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
;
1132 case lang_input_file_is_symbols_only_enum
:
1134 p
->local_sym_name
= name
;
1135 p
->flags
.real
= true;
1136 p
->flags
.just_syms
= true;
1138 case lang_input_file_is_fake_enum
:
1140 p
->local_sym_name
= name
;
1142 case lang_input_file_is_l_enum
:
1143 if (name
[0] == ':' && name
[1] != '\0')
1145 p
->filename
= name
+ 1;
1146 p
->flags
.full_name_provided
= true;
1150 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1151 p
->flags
.maybe_archive
= true;
1152 p
->flags
.real
= true;
1153 p
->flags
.search_dirs
= true;
1155 case lang_input_file_is_marker_enum
:
1157 p
->local_sym_name
= name
;
1158 p
->flags
.search_dirs
= true;
1160 case lang_input_file_is_search_file_enum
:
1162 p
->local_sym_name
= name
;
1163 /* If name is a relative path, search the directory of the current linker
1165 if (from_filename
&& !IS_ABSOLUTE_PATH (name
))
1166 p
->extra_search_path
= ldirname (from_filename
);
1167 p
->flags
.real
= true;
1168 p
->flags
.search_dirs
= true;
1170 case lang_input_file_is_file_enum
:
1172 p
->local_sym_name
= name
;
1173 p
->flags
.real
= true;
1179 lang_statement_append (&input_file_chain
, p
, &p
->next_real_file
);
1183 lang_input_statement_type
*
1184 lang_add_input_file (const char *name
,
1185 lang_input_file_enum_type file_type
,
1189 && (*name
== '=' || startswith (name
, "$SYSROOT")))
1191 lang_input_statement_type
*ret
;
1192 char *sysrooted_name
1193 = concat (ld_sysroot
,
1194 name
+ (*name
== '=' ? 1 : strlen ("$SYSROOT")),
1195 (const char *) NULL
);
1197 /* We've now forcibly prepended the sysroot, making the input
1198 file independent of the context. Therefore, temporarily
1199 force a non-sysrooted context for this statement, so it won't
1200 get the sysroot prepended again when opened. (N.B. if it's a
1201 script, any child nodes with input files starting with "/"
1202 will be handled as "sysrooted" as they'll be found to be
1203 within the sysroot subdirectory.) */
1204 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1205 input_flags
.sysrooted
= 0;
1206 ret
= new_afile (sysrooted_name
, file_type
, target
, NULL
);
1207 input_flags
.sysrooted
= outer_sysrooted
;
1211 return new_afile (name
, file_type
, target
, current_input_file
);
1214 struct out_section_hash_entry
1216 struct bfd_hash_entry root
;
1217 lang_statement_union_type s
;
1220 /* The hash table. */
1222 static struct bfd_hash_table output_section_statement_table
;
1224 /* Support routines for the hash table used by lang_output_section_find,
1225 initialize the table, fill in an entry and remove the table. */
1227 static struct bfd_hash_entry
*
1228 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1229 struct bfd_hash_table
*table
,
1232 lang_output_section_statement_type
**nextp
;
1233 struct out_section_hash_entry
*ret
;
1237 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1243 entry
= bfd_hash_newfunc (entry
, table
, string
);
1247 ret
= (struct out_section_hash_entry
*) entry
;
1248 memset (&ret
->s
, 0, sizeof (ret
->s
));
1249 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1250 ret
->s
.output_section_statement
.subsection_alignment
= NULL
;
1251 ret
->s
.output_section_statement
.section_alignment
= NULL
;
1252 ret
->s
.output_section_statement
.block_value
= 1;
1253 lang_list_init (&ret
->s
.output_section_statement
.children
);
1254 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1256 /* For every output section statement added to the list, except the
1257 first one, lang_os_list.tail points to the "next"
1258 field of the last element of the list. */
1259 if (lang_os_list
.head
!= NULL
)
1260 ret
->s
.output_section_statement
.prev
1261 = ((lang_output_section_statement_type
*)
1262 ((char *) lang_os_list
.tail
1263 - offsetof (lang_output_section_statement_type
, next
)));
1265 /* GCC's strict aliasing rules prevent us from just casting the
1266 address, so we store the pointer in a variable and cast that
1268 nextp
= &ret
->s
.output_section_statement
.next
;
1269 lang_statement_append (&lang_os_list
, &ret
->s
, nextp
);
1274 output_section_statement_table_init (void)
1276 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1277 output_section_statement_newfunc
,
1278 sizeof (struct out_section_hash_entry
),
1280 einfo (_("%F%P: can not create hash table: %E\n"));
1284 output_section_statement_table_free (void)
1286 bfd_hash_table_free (&output_section_statement_table
);
1289 /* Build enough state so that the parser can build its tree. */
1294 obstack_begin (&stat_obstack
, 1000);
1296 stat_ptr
= &statement_list
;
1298 output_section_statement_table_init ();
1300 lang_list_init (stat_ptr
);
1302 lang_list_init (&input_file_chain
);
1303 lang_list_init (&lang_os_list
);
1304 lang_list_init (&file_chain
);
1305 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1307 abs_output_section
=
1308 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, 1);
1310 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1312 asneeded_list_head
= NULL
;
1313 asneeded_list_tail
= &asneeded_list_head
;
1319 output_section_statement_table_free ();
1322 /*----------------------------------------------------------------------
1323 A region is an area of memory declared with the
1324 MEMORY { name:org=exp, len=exp ... }
1327 We maintain a list of all the regions here.
1329 If no regions are specified in the script, then the default is used
1330 which is created when looked up to be the entire data space.
1332 If create is true we are creating a region inside a MEMORY block.
1333 In this case it is probably an error to create a region that has
1334 already been created. If we are not inside a MEMORY block it is
1335 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1336 and so we issue a warning.
1338 Each region has at least one name. The first name is either
1339 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1340 alias names to an existing region within a script with
1341 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1344 static lang_memory_region_type
*lang_memory_region_list
;
1345 static lang_memory_region_type
**lang_memory_region_list_tail
1346 = &lang_memory_region_list
;
1348 lang_memory_region_type
*
1349 lang_memory_region_lookup (const char *const name
, bool create
)
1351 lang_memory_region_name
*n
;
1352 lang_memory_region_type
*r
;
1353 lang_memory_region_type
*new_region
;
1355 /* NAME is NULL for LMA memspecs if no region was specified. */
1359 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1360 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1361 if (strcmp (n
->name
, name
) == 0)
1364 einfo (_("%P:%pS: warning: redeclaration of memory region `%s'\n"),
1369 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1370 einfo (_("%P:%pS: warning: memory region `%s' not declared\n"),
1373 new_region
= stat_alloc (sizeof (lang_memory_region_type
));
1375 new_region
->name_list
.name
= xstrdup (name
);
1376 new_region
->name_list
.next
= NULL
;
1377 new_region
->next
= NULL
;
1378 new_region
->origin_exp
= NULL
;
1379 new_region
->origin
= 0;
1380 new_region
->length_exp
= NULL
;
1381 new_region
->length
= ~(bfd_size_type
) 0;
1382 new_region
->current
= 0;
1383 new_region
->last_os
= NULL
;
1384 new_region
->flags
= 0;
1385 new_region
->not_flags
= 0;
1386 new_region
->had_full_message
= false;
1388 *lang_memory_region_list_tail
= new_region
;
1389 lang_memory_region_list_tail
= &new_region
->next
;
1395 lang_memory_region_alias (const char *alias
, const char *region_name
)
1397 lang_memory_region_name
*n
;
1398 lang_memory_region_type
*r
;
1399 lang_memory_region_type
*region
;
1401 /* The default region must be unique. This ensures that it is not necessary
1402 to iterate through the name list if someone wants the check if a region is
1403 the default memory region. */
1404 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1405 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1406 einfo (_("%F%P:%pS: error: alias for default memory region\n"), NULL
);
1408 /* Look for the target region and check if the alias is not already
1411 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1412 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1414 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1416 if (strcmp (n
->name
, alias
) == 0)
1417 einfo (_("%F%P:%pS: error: redefinition of memory region "
1422 /* Check if the target region exists. */
1424 einfo (_("%F%P:%pS: error: memory region `%s' "
1425 "for alias `%s' does not exist\n"),
1426 NULL
, region_name
, alias
);
1428 /* Add alias to region name list. */
1429 n
= stat_alloc (sizeof (lang_memory_region_name
));
1430 n
->name
= xstrdup (alias
);
1431 n
->next
= region
->name_list
.next
;
1432 region
->name_list
.next
= n
;
1435 static lang_memory_region_type
*
1436 lang_memory_default (asection
*section
)
1438 lang_memory_region_type
*p
;
1440 flagword sec_flags
= section
->flags
;
1442 /* Override SEC_DATA to mean a writable section. */
1443 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1444 sec_flags
|= SEC_DATA
;
1446 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1448 if ((p
->flags
& sec_flags
) != 0
1449 && (p
->not_flags
& sec_flags
) == 0)
1454 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, false);
1457 /* Get the output section statement directly from the userdata. */
1459 lang_output_section_statement_type
*
1460 lang_output_section_get (const asection
*output_section
)
1462 return bfd_section_userdata (output_section
);
1465 /* Find or create an output_section_statement with the given NAME.
1466 If CONSTRAINT is non-zero match one with that constraint, otherwise
1467 match any non-negative constraint. If CREATE is 0 return NULL when
1468 no match exists. If CREATE is 1, create an output_section_statement
1469 when no match exists or if CONSTRAINT is SPECIAL. If CREATE is 2,
1470 always make a new output_section_statement. */
1472 lang_output_section_statement_type
*
1473 lang_output_section_statement_lookup (const char *name
,
1477 struct out_section_hash_entry
*entry
;
1479 entry
= ((struct out_section_hash_entry
*)
1480 bfd_hash_lookup (&output_section_statement_table
, name
,
1481 create
!= 0, false));
1485 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1489 if (entry
->s
.output_section_statement
.name
!= NULL
)
1491 /* We have a section of this name, but it might not have the correct
1493 struct out_section_hash_entry
*last_ent
;
1495 name
= entry
->s
.output_section_statement
.name
;
1499 && !(create
&& constraint
== SPECIAL
)
1500 && (constraint
== entry
->s
.output_section_statement
.constraint
1502 && entry
->s
.output_section_statement
.constraint
>= 0)))
1503 return &entry
->s
.output_section_statement
;
1505 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1507 while (entry
!= NULL
1508 && name
== entry
->s
.output_section_statement
.name
);
1514 = ((struct out_section_hash_entry
*)
1515 output_section_statement_newfunc (NULL
,
1516 &output_section_statement_table
,
1520 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1523 entry
->root
= last_ent
->root
;
1524 last_ent
->root
.next
= &entry
->root
;
1527 entry
->s
.output_section_statement
.name
= name
;
1528 entry
->s
.output_section_statement
.constraint
= constraint
;
1529 entry
->s
.output_section_statement
.dup_output
= (create
== 2
1530 || constraint
== SPECIAL
);
1531 return &entry
->s
.output_section_statement
;
1534 /* Find the next output_section_statement with the same name as OS.
1535 If CONSTRAINT is non-zero, find one with that constraint otherwise
1536 match any non-negative constraint. */
1538 lang_output_section_statement_type
*
1539 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1542 /* All output_section_statements are actually part of a
1543 struct out_section_hash_entry. */
1544 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1546 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1547 const char *name
= os
->name
;
1549 ASSERT (name
== entry
->root
.string
);
1552 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1554 || name
!= entry
->s
.output_section_statement
.name
)
1557 while (constraint
!= entry
->s
.output_section_statement
.constraint
1559 || entry
->s
.output_section_statement
.constraint
< 0));
1561 return &entry
->s
.output_section_statement
;
1564 /* A variant of lang_output_section_find used by place_orphan.
1565 Returns the output statement that should precede a new output
1566 statement for SEC. If an exact match is found on certain flags,
1569 lang_output_section_statement_type
*
1570 lang_output_section_find_by_flags (const asection
*sec
,
1572 lang_output_section_statement_type
**exact
,
1573 lang_match_sec_type_func match_type
)
1575 lang_output_section_statement_type
*first
, *look
, *found
;
1576 flagword look_flags
, differ
;
1578 /* We know the first statement on this list is *ABS*. May as well
1580 first
= (void *) lang_os_list
.head
;
1581 first
= first
->next
;
1583 /* First try for an exact match. */
1585 for (look
= first
; look
; look
= look
->next
)
1587 look_flags
= look
->flags
;
1588 if (look
->bfd_section
!= NULL
)
1590 look_flags
= look
->bfd_section
->flags
;
1591 if (match_type
&& !match_type (link_info
.output_bfd
,
1596 differ
= look_flags
^ sec_flags
;
1597 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1598 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1608 if ((sec_flags
& SEC_CODE
) != 0
1609 && (sec_flags
& SEC_ALLOC
) != 0)
1611 /* Try for a rw code section. */
1612 for (look
= first
; look
; look
= look
->next
)
1614 look_flags
= look
->flags
;
1615 if (look
->bfd_section
!= NULL
)
1617 look_flags
= look
->bfd_section
->flags
;
1618 if (match_type
&& !match_type (link_info
.output_bfd
,
1623 differ
= look_flags
^ sec_flags
;
1624 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1625 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1629 else if ((sec_flags
& SEC_READONLY
) != 0
1630 && (sec_flags
& SEC_ALLOC
) != 0)
1632 /* .rodata can go after .text, .sdata2 after .rodata. */
1633 for (look
= first
; look
; look
= look
->next
)
1635 look_flags
= look
->flags
;
1636 if (look
->bfd_section
!= NULL
)
1638 look_flags
= look
->bfd_section
->flags
;
1639 if (match_type
&& !match_type (link_info
.output_bfd
,
1644 differ
= look_flags
^ sec_flags
;
1645 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1646 | SEC_READONLY
| SEC_SMALL_DATA
))
1647 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1649 && !(look_flags
& SEC_SMALL_DATA
)))
1653 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1654 && (sec_flags
& SEC_ALLOC
) != 0)
1656 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1657 as if it were a loaded section, and don't use match_type. */
1658 bool seen_thread_local
= false;
1661 for (look
= first
; look
; look
= look
->next
)
1663 look_flags
= look
->flags
;
1664 if (look
->bfd_section
!= NULL
)
1665 look_flags
= look
->bfd_section
->flags
;
1667 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1668 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1670 /* .tdata and .tbss must be adjacent and in that order. */
1671 if (!(look_flags
& SEC_LOAD
)
1672 && (sec_flags
& SEC_LOAD
))
1673 /* ..so if we're at a .tbss section and we're placing
1674 a .tdata section stop looking and return the
1675 previous section. */
1678 seen_thread_local
= true;
1680 else if (seen_thread_local
)
1682 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1686 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1687 && (sec_flags
& SEC_ALLOC
) != 0)
1689 /* .sdata goes after .data, .sbss after .sdata. */
1690 for (look
= first
; look
; look
= look
->next
)
1692 look_flags
= look
->flags
;
1693 if (look
->bfd_section
!= NULL
)
1695 look_flags
= look
->bfd_section
->flags
;
1696 if (match_type
&& !match_type (link_info
.output_bfd
,
1701 differ
= look_flags
^ sec_flags
;
1702 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1703 | SEC_THREAD_LOCAL
))
1704 || ((look_flags
& SEC_SMALL_DATA
)
1705 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1709 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1710 && (sec_flags
& SEC_ALLOC
) != 0)
1712 /* .data goes after .rodata. */
1713 for (look
= first
; look
; look
= look
->next
)
1715 look_flags
= look
->flags
;
1716 if (look
->bfd_section
!= NULL
)
1718 look_flags
= look
->bfd_section
->flags
;
1719 if (match_type
&& !match_type (link_info
.output_bfd
,
1724 differ
= look_flags
^ sec_flags
;
1725 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1726 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1730 else if ((sec_flags
& SEC_ALLOC
) != 0)
1732 /* .bss goes after any other alloc section. */
1733 for (look
= first
; look
; look
= look
->next
)
1735 look_flags
= look
->flags
;
1736 if (look
->bfd_section
!= NULL
)
1738 look_flags
= look
->bfd_section
->flags
;
1739 if (match_type
&& !match_type (link_info
.output_bfd
,
1744 differ
= look_flags
^ sec_flags
;
1745 if (!(differ
& SEC_ALLOC
))
1751 /* non-alloc go last. */
1752 for (look
= first
; look
; look
= look
->next
)
1754 look_flags
= look
->flags
;
1755 if (look
->bfd_section
!= NULL
)
1756 look_flags
= look
->bfd_section
->flags
;
1757 differ
= look_flags
^ sec_flags
;
1758 if (!(differ
& SEC_DEBUGGING
))
1764 if (found
|| !match_type
)
1767 return lang_output_section_find_by_flags (sec
, sec_flags
, NULL
, NULL
);
1770 /* Find the last output section before given output statement.
1771 Used by place_orphan. */
1774 output_prev_sec_find (lang_output_section_statement_type
*os
)
1776 lang_output_section_statement_type
*lookup
;
1778 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1780 if (lookup
->constraint
< 0)
1783 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1784 return lookup
->bfd_section
;
1790 /* Look for a suitable place for a new output section statement. The
1791 idea is to skip over anything that might be inside a SECTIONS {}
1792 statement in a script, before we find another output section
1793 statement. Assignments to "dot" before an output section statement
1794 are assumed to belong to it, except in two cases; The first
1795 assignment to dot, and assignments before non-alloc sections.
1796 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1797 similar assignments that set the initial address, or we might
1798 insert non-alloc note sections among assignments setting end of
1801 static lang_statement_union_type
**
1802 insert_os_after (lang_output_section_statement_type
*after
)
1804 lang_statement_union_type
**where
;
1805 lang_statement_union_type
**assign
= NULL
;
1808 ignore_first
= after
== (void *) lang_os_list
.head
;
1810 for (where
= &after
->header
.next
;
1812 where
= &(*where
)->header
.next
)
1814 switch ((*where
)->header
.type
)
1816 case lang_assignment_statement_enum
:
1819 lang_assignment_statement_type
*ass
;
1821 ass
= &(*where
)->assignment_statement
;
1822 if (ass
->exp
->type
.node_class
!= etree_assert
1823 && ass
->exp
->assign
.dst
[0] == '.'
1824 && ass
->exp
->assign
.dst
[1] == 0)
1828 ignore_first
= false;
1832 case lang_wild_statement_enum
:
1833 case lang_input_section_enum
:
1834 case lang_object_symbols_statement_enum
:
1835 case lang_fill_statement_enum
:
1836 case lang_data_statement_enum
:
1837 case lang_reloc_statement_enum
:
1838 case lang_padding_statement_enum
:
1839 case lang_constructors_statement_enum
:
1841 ignore_first
= false;
1843 case lang_output_section_statement_enum
:
1846 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1849 || s
->map_head
.s
== NULL
1850 || (s
->flags
& SEC_ALLOC
) != 0)
1854 case lang_input_statement_enum
:
1855 case lang_address_statement_enum
:
1856 case lang_target_statement_enum
:
1857 case lang_output_statement_enum
:
1858 case lang_group_statement_enum
:
1859 case lang_insert_statement_enum
:
1868 lang_output_section_statement_type
*
1869 lang_insert_orphan (asection
*s
,
1870 const char *secname
,
1872 lang_output_section_statement_type
*after
,
1873 struct orphan_save
*place
,
1874 etree_type
*address
,
1875 lang_statement_list_type
*add_child
)
1877 lang_statement_list_type add
;
1878 lang_output_section_statement_type
*os
;
1879 lang_output_section_statement_type
**os_tail
;
1881 /* If we have found an appropriate place for the output section
1882 statements for this orphan, add them to our own private list,
1883 inserting them later into the global statement list. */
1886 lang_list_init (&add
);
1887 push_stat_ptr (&add
);
1890 if (bfd_link_relocatable (&link_info
)
1891 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1892 address
= exp_intop (0);
1894 os_tail
= (lang_output_section_statement_type
**) lang_os_list
.tail
;
1895 os
= lang_enter_output_section_statement (
1896 secname
, address
, normal_section
, 0, NULL
, NULL
, NULL
, constraint
, 0);
1898 if (add_child
== NULL
)
1899 add_child
= &os
->children
;
1900 lang_add_section (add_child
, s
, NULL
, NULL
, os
);
1902 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1904 const char *region
= (after
->region
1905 ? after
->region
->name_list
.name
1906 : DEFAULT_MEMORY_REGION
);
1907 const char *lma_region
= (after
->lma_region
1908 ? after
->lma_region
->name_list
.name
1910 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1914 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1917 /* Restore the global list pointer. */
1921 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1923 asection
*snew
, *as
;
1924 bool place_after
= place
->stmt
== NULL
;
1925 bool insert_after
= true;
1927 snew
= os
->bfd_section
;
1929 /* Shuffle the bfd section list to make the output file look
1930 neater. This is really only cosmetic. */
1931 if (place
->section
== NULL
1932 && after
!= (void *) lang_os_list
.head
)
1934 asection
*bfd_section
= after
->bfd_section
;
1936 /* If the output statement hasn't been used to place any input
1937 sections (and thus doesn't have an output bfd_section),
1938 look for the closest prior output statement having an
1940 if (bfd_section
== NULL
)
1941 bfd_section
= output_prev_sec_find (after
);
1943 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1944 place
->section
= &bfd_section
->next
;
1947 if (place
->section
== NULL
)
1948 place
->section
= &link_info
.output_bfd
->sections
;
1950 as
= *place
->section
;
1954 /* Put the section at the end of the list. */
1956 /* Unlink the section. */
1957 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1959 /* Now tack it back on in the right place. */
1960 bfd_section_list_append (link_info
.output_bfd
, snew
);
1962 else if ((bfd_get_flavour (link_info
.output_bfd
)
1963 == bfd_target_elf_flavour
)
1964 && (bfd_get_flavour (s
->owner
)
1965 == bfd_target_elf_flavour
)
1966 && ((elf_section_type (s
) == SHT_NOTE
1967 && (s
->flags
& SEC_LOAD
) != 0)
1968 || (elf_section_type (as
) == SHT_NOTE
1969 && (as
->flags
& SEC_LOAD
) != 0)))
1971 /* Make sure that output note sections are grouped and sorted
1972 by alignments when inserting a note section or insert a
1973 section after a note section, */
1975 /* A specific section after which the output note section
1976 should be placed. */
1977 asection
*after_sec
;
1978 /* True if we need to insert the orphan section after a
1979 specific section to maintain output note section order. */
1980 bool after_sec_note
= false;
1982 static asection
*first_orphan_note
= NULL
;
1984 /* Group and sort output note section by alignments in
1987 if (elf_section_type (s
) == SHT_NOTE
1988 && (s
->flags
& SEC_LOAD
) != 0)
1990 /* Search from the beginning for the last output note
1991 section with equal or larger alignments. NB: Don't
1992 place orphan note section after non-note sections. */
1994 first_orphan_note
= NULL
;
1995 for (sec
= link_info
.output_bfd
->sections
;
1997 && !bfd_is_abs_section (sec
));
2000 && elf_section_type (sec
) == SHT_NOTE
2001 && (sec
->flags
& SEC_LOAD
) != 0)
2003 if (!first_orphan_note
)
2004 first_orphan_note
= sec
;
2005 if (sec
->alignment_power
>= s
->alignment_power
)
2008 else if (first_orphan_note
)
2010 /* Stop if there is non-note section after the first
2011 orphan note section. */
2015 /* If this will be the first orphan note section, it can
2016 be placed at the default location. */
2017 after_sec_note
= first_orphan_note
!= NULL
;
2018 if (after_sec
== NULL
&& after_sec_note
)
2020 /* If all output note sections have smaller
2021 alignments, place the section before all
2022 output orphan note sections. */
2023 after_sec
= first_orphan_note
;
2024 insert_after
= false;
2027 else if (first_orphan_note
)
2029 /* Don't place non-note sections in the middle of orphan
2031 after_sec_note
= true;
2033 for (sec
= as
->next
;
2035 && !bfd_is_abs_section (sec
));
2037 if (elf_section_type (sec
) == SHT_NOTE
2038 && (sec
->flags
& SEC_LOAD
) != 0)
2046 /* Search forward to insert OS after AFTER_SEC output
2048 lang_output_section_statement_type
*stmt
, *next
;
2050 for (stmt
= after
; stmt
!= NULL
; stmt
= next
)
2055 if (stmt
->bfd_section
== after_sec
)
2065 /* If INSERT_AFTER is FALSE, place OS before
2066 AFTER_SEC output statement. */
2067 if (next
&& next
->bfd_section
== after_sec
)
2077 /* Search backward to insert OS after AFTER_SEC output
2080 for (stmt
= after
; stmt
!= NULL
; stmt
= stmt
->prev
)
2084 if (stmt
->bfd_section
== after_sec
)
2093 /* If INSERT_AFTER is FALSE, place OS before
2094 AFTER_SEC output statement. */
2095 if (stmt
->next
->bfd_section
== after_sec
)
2105 if (after_sec
== NULL
2106 || (insert_after
&& after_sec
->next
!= snew
)
2107 || (!insert_after
&& after_sec
->prev
!= snew
))
2109 /* Unlink the section. */
2110 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2112 /* Place SNEW after AFTER_SEC. If AFTER_SEC is NULL,
2117 bfd_section_list_insert_after (link_info
.output_bfd
,
2120 bfd_section_list_insert_before (link_info
.output_bfd
,
2124 bfd_section_list_prepend (link_info
.output_bfd
, snew
);
2127 else if (as
!= snew
&& as
->prev
!= snew
)
2129 /* Unlink the section. */
2130 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2132 /* Now tack it back on in the right place. */
2133 bfd_section_list_insert_before (link_info
.output_bfd
,
2137 else if (as
!= snew
&& as
->prev
!= snew
)
2139 /* Unlink the section. */
2140 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2142 /* Now tack it back on in the right place. */
2143 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
2146 /* Save the end of this list. Further ophans of this type will
2147 follow the one we've just added. */
2148 place
->section
= &snew
->next
;
2150 /* The following is non-cosmetic. We try to put the output
2151 statements in some sort of reasonable order here, because they
2152 determine the final load addresses of the orphan sections.
2153 In addition, placing output statements in the wrong order may
2154 require extra segments. For instance, given a typical
2155 situation of all read-only sections placed in one segment and
2156 following that a segment containing all the read-write
2157 sections, we wouldn't want to place an orphan read/write
2158 section before or amongst the read-only ones. */
2159 if (add
.head
!= NULL
)
2161 lang_output_section_statement_type
*newly_added_os
;
2163 /* Place OS after AFTER if AFTER_NOTE is TRUE. */
2166 lang_statement_union_type
**where
= insert_os_after (after
);
2171 place
->os_tail
= &after
->next
;
2175 /* Put it after the last orphan statement we added. */
2176 *add
.tail
= *place
->stmt
;
2177 *place
->stmt
= add
.head
;
2180 /* Fix the global list pointer if we happened to tack our
2181 new list at the tail. */
2182 if (*stat_ptr
->tail
== add
.head
)
2183 stat_ptr
->tail
= add
.tail
;
2185 /* Save the end of this list. */
2186 place
->stmt
= add
.tail
;
2188 /* Do the same for the list of output section statements. */
2189 newly_added_os
= *os_tail
;
2191 newly_added_os
->prev
= (lang_output_section_statement_type
*)
2192 ((char *) place
->os_tail
2193 - offsetof (lang_output_section_statement_type
, next
));
2194 newly_added_os
->next
= *place
->os_tail
;
2195 if (newly_added_os
->next
!= NULL
)
2196 newly_added_os
->next
->prev
= newly_added_os
;
2197 *place
->os_tail
= newly_added_os
;
2198 place
->os_tail
= &newly_added_os
->next
;
2200 /* Fixing the global list pointer here is a little different.
2201 We added to the list in lang_enter_output_section_statement,
2202 trimmed off the new output_section_statment above when
2203 assigning *os_tail = NULL, but possibly added it back in
2204 the same place when assigning *place->os_tail. */
2205 if (*os_tail
== NULL
)
2206 lang_os_list
.tail
= (lang_statement_union_type
**) os_tail
;
2213 lang_print_asneeded (void)
2215 struct asneeded_minfo
*m
;
2217 if (asneeded_list_head
== NULL
)
2220 minfo (_("\nAs-needed library included to satisfy reference by file (symbol)\n\n"));
2222 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2226 minfo ("%s", m
->soname
);
2227 len
= strlen (m
->soname
);
2241 minfo ("%pB ", m
->ref
);
2242 minfo ("(%pT)\n", m
->name
);
2247 lang_map_flags (flagword flag
)
2249 if (flag
& SEC_ALLOC
)
2252 if (flag
& SEC_CODE
)
2255 if (flag
& SEC_READONLY
)
2258 if (flag
& SEC_DATA
)
2261 if (flag
& SEC_LOAD
)
2268 lang_memory_region_type
*m
;
2269 bool dis_header_printed
= false;
2271 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2275 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2276 || file
->flags
.just_syms
)
2279 if (config
.print_map_discarded
)
2280 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2281 if ((s
->output_section
== NULL
2282 || s
->output_section
->owner
!= link_info
.output_bfd
)
2283 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2285 if (! dis_header_printed
)
2287 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2288 dis_header_printed
= true;
2291 print_input_section (s
, true);
2295 minfo (_("\nMemory Configuration\n\n"));
2296 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2297 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2299 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2301 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2303 minfo ("0x%V 0x%V", m
->origin
, m
->length
);
2304 if (m
->flags
|| m
->not_flags
)
2312 lang_map_flags (m
->flags
);
2318 lang_map_flags (m
->not_flags
);
2325 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2327 if (!link_info
.reduce_memory_overheads
)
2329 obstack_begin (&map_obstack
, 1000);
2330 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2332 expld
.phase
= lang_fixed_phase_enum
;
2333 lang_statement_iteration
++;
2334 print_statements ();
2336 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
,
2341 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2342 void *info ATTRIBUTE_UNUSED
)
2344 if ((hash_entry
->type
== bfd_link_hash_defined
2345 || hash_entry
->type
== bfd_link_hash_defweak
)
2346 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2347 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2349 input_section_userdata_type
*ud
;
2350 struct map_symbol_def
*def
;
2352 ud
= bfd_section_userdata (hash_entry
->u
.def
.section
);
2355 ud
= stat_alloc (sizeof (*ud
));
2356 bfd_set_section_userdata (hash_entry
->u
.def
.section
, ud
);
2357 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2358 ud
->map_symbol_def_count
= 0;
2360 else if (!ud
->map_symbol_def_tail
)
2361 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2363 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2364 def
->entry
= hash_entry
;
2365 *(ud
->map_symbol_def_tail
) = def
;
2366 ud
->map_symbol_def_tail
= &def
->next
;
2367 ud
->map_symbol_def_count
++;
2372 /* Initialize an output section. */
2375 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2377 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2378 einfo (_("%F%P: illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2381 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2382 if (s
->bfd_section
== NULL
)
2383 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2385 if (s
->bfd_section
== NULL
)
2387 einfo (_("%F%P: output format %s cannot represent section"
2388 " called %s: %E\n"),
2389 link_info
.output_bfd
->xvec
->name
, s
->name
);
2391 s
->bfd_section
->output_section
= s
->bfd_section
;
2392 s
->bfd_section
->output_offset
= 0;
2394 /* Set the userdata of the output section to the output section
2395 statement to avoid lookup. */
2396 bfd_set_section_userdata (s
->bfd_section
, s
);
2398 /* If there is a base address, make sure that any sections it might
2399 mention are initialized. */
2400 if (s
->addr_tree
!= NULL
)
2401 exp_init_os (s
->addr_tree
);
2403 if (s
->load_base
!= NULL
)
2404 exp_init_os (s
->load_base
);
2406 /* If supplied an alignment, set it. */
2407 if (s
->section_alignment
!= NULL
)
2408 s
->bfd_section
->alignment_power
= exp_get_power (s
->section_alignment
,
2409 "section alignment");
2412 /* Make sure that all output sections mentioned in an expression are
2416 exp_init_os (etree_type
*exp
)
2418 switch (exp
->type
.node_class
)
2422 case etree_provided
:
2423 exp_init_os (exp
->assign
.src
);
2427 exp_init_os (exp
->binary
.lhs
);
2428 exp_init_os (exp
->binary
.rhs
);
2432 exp_init_os (exp
->trinary
.cond
);
2433 exp_init_os (exp
->trinary
.lhs
);
2434 exp_init_os (exp
->trinary
.rhs
);
2438 exp_init_os (exp
->assert_s
.child
);
2442 exp_init_os (exp
->unary
.child
);
2446 switch (exp
->type
.node_code
)
2451 lang_output_section_statement_type
*os
;
2453 os
= lang_output_section_find (exp
->name
.name
);
2454 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2466 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2468 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2470 /* If we are only reading symbols from this object, then we want to
2471 discard all sections. */
2472 if (entry
->flags
.just_syms
)
2474 bfd_link_just_syms (abfd
, sec
, &link_info
);
2478 /* Deal with SHF_EXCLUDE ELF sections. */
2479 if (!bfd_link_relocatable (&link_info
)
2480 && (abfd
->flags
& BFD_PLUGIN
) == 0
2481 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2482 sec
->output_section
= bfd_abs_section_ptr
;
2484 if (!(abfd
->flags
& DYNAMIC
))
2485 bfd_section_already_linked (abfd
, sec
, &link_info
);
2489 /* Returns true if SECTION is one we know will be discarded based on its
2490 section flags, otherwise returns false. */
2493 lang_discard_section_p (asection
*section
)
2496 flagword flags
= section
->flags
;
2498 /* Discard sections marked with SEC_EXCLUDE. */
2499 discard
= (flags
& SEC_EXCLUDE
) != 0;
2501 /* Discard the group descriptor sections when we're finally placing the
2502 sections from within the group. */
2503 if ((flags
& SEC_GROUP
) != 0
2504 && link_info
.resolve_section_groups
)
2507 /* Discard debugging sections if we are stripping debugging
2509 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2510 && (flags
& SEC_DEBUGGING
) != 0)
2516 /* The wild routines.
2518 These expand statements like *(.text) and foo.o to a list of
2519 explicit actions, like foo.o(.text), bar.o(.text) and
2520 foo.o(.text, .data). */
2522 /* Add SECTION to the output section OUTPUT. Do this by creating a
2523 lang_input_section statement which is placed at PTR. */
2526 lang_add_section (lang_statement_list_type
*ptr
,
2528 struct wildcard_list
*pattern
,
2529 struct flag_info
*sflag_info
,
2530 lang_output_section_statement_type
*output
)
2532 flagword flags
= section
->flags
;
2535 lang_input_section_type
*new_section
;
2536 bfd
*abfd
= link_info
.output_bfd
;
2538 /* Is this section one we know should be discarded? */
2539 discard
= lang_discard_section_p (section
);
2541 /* Discard input sections which are assigned to a section named
2542 DISCARD_SECTION_NAME. */
2543 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2548 if (section
->output_section
== NULL
)
2550 /* This prevents future calls from assigning this section. */
2551 section
->output_section
= bfd_abs_section_ptr
;
2553 else if (link_info
.non_contiguous_regions_warnings
)
2554 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions makes "
2555 "section `%pA' from '%pB' match /DISCARD/ clause.\n"),
2556 NULL
, section
, section
->owner
);
2565 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2570 if (section
->output_section
!= NULL
)
2572 if (!link_info
.non_contiguous_regions
)
2575 /* SECTION has already been handled in a special way
2576 (eg. LINK_ONCE): skip it. */
2577 if (bfd_is_abs_section (section
->output_section
))
2580 /* Already assigned to the same output section, do not process
2581 it again, to avoid creating loops between duplicate sections
2583 if (section
->output_section
== output
->bfd_section
)
2586 if (link_info
.non_contiguous_regions_warnings
&& output
->bfd_section
)
2587 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions may "
2588 "change behaviour for section `%pA' from '%pB' (assigned to "
2589 "%pA, but additional match: %pA)\n"),
2590 NULL
, section
, section
->owner
, section
->output_section
,
2591 output
->bfd_section
);
2593 /* SECTION has already been assigned to an output section, but
2594 the user allows it to be mapped to another one in case it
2595 overflows. We'll later update the actual output section in
2596 size_input_section as appropriate. */
2599 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2600 to an output section, because we want to be able to include a
2601 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2602 section (I don't know why we want to do this, but we do).
2603 build_link_order in ldwrite.c handles this case by turning
2604 the embedded SEC_NEVER_LOAD section into a fill. */
2605 flags
&= ~ SEC_NEVER_LOAD
;
2607 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2608 already been processed. One reason to do this is that on pe
2609 format targets, .text$foo sections go into .text and it's odd
2610 to see .text with SEC_LINK_ONCE set. */
2611 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2613 if (link_info
.resolve_section_groups
)
2614 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2616 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2618 else if (!bfd_link_relocatable (&link_info
))
2619 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2621 switch (output
->sectype
)
2623 case normal_section
:
2624 case overlay_section
:
2625 case first_overlay_section
:
2628 case noalloc_section
:
2629 flags
&= ~SEC_ALLOC
;
2631 case typed_readonly_section
:
2632 case readonly_section
:
2633 flags
|= SEC_READONLY
;
2635 case noload_section
:
2637 flags
|= SEC_NEVER_LOAD
;
2638 /* Unfortunately GNU ld has managed to evolve two different
2639 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2640 alloc, no contents section. All others get a noload, noalloc
2642 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2643 flags
&= ~SEC_HAS_CONTENTS
;
2645 flags
&= ~SEC_ALLOC
;
2649 if (output
->bfd_section
== NULL
)
2650 init_os (output
, flags
);
2652 /* If SEC_READONLY is not set in the input section, then clear
2653 it from the output section. */
2654 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2656 if (output
->bfd_section
->linker_has_input
)
2658 /* Only set SEC_READONLY flag on the first input section. */
2659 flags
&= ~ SEC_READONLY
;
2661 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2662 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2663 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2664 || ((flags
& SEC_MERGE
) != 0
2665 && output
->bfd_section
->entsize
!= section
->entsize
))
2667 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2668 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2671 output
->bfd_section
->flags
|= flags
;
2673 if (!output
->bfd_section
->linker_has_input
)
2675 output
->bfd_section
->linker_has_input
= 1;
2676 /* This must happen after flags have been updated. The output
2677 section may have been created before we saw its first input
2678 section, eg. for a data statement. */
2679 bfd_init_private_section_data (section
->owner
, section
,
2680 link_info
.output_bfd
,
2681 output
->bfd_section
,
2683 if ((flags
& SEC_MERGE
) != 0)
2684 output
->bfd_section
->entsize
= section
->entsize
;
2687 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2688 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2690 /* FIXME: This value should really be obtained from the bfd... */
2691 output
->block_value
= 128;
2694 /* When a .ctors section is placed in .init_array it must be copied
2695 in reverse order. Similarly for .dtors. Set that up. */
2696 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
2697 && ((startswith (section
->name
, ".ctors")
2698 && strcmp (output
->bfd_section
->name
, ".init_array") == 0)
2699 || (startswith (section
->name
, ".dtors")
2700 && strcmp (output
->bfd_section
->name
, ".fini_array") == 0))
2701 && (section
->name
[6] == 0 || section
->name
[6] == '.'))
2702 section
->flags
|= SEC_ELF_REVERSE_COPY
;
2704 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2705 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2707 section
->output_section
= output
->bfd_section
;
2709 if (!map_head_is_link_order
)
2711 asection
*s
= output
->bfd_section
->map_tail
.s
;
2712 output
->bfd_section
->map_tail
.s
= section
;
2713 section
->map_head
.s
= NULL
;
2714 section
->map_tail
.s
= s
;
2716 s
->map_head
.s
= section
;
2718 output
->bfd_section
->map_head
.s
= section
;
2721 /* Add a section reference to the list. */
2722 new_section
= new_stat (lang_input_section
, ptr
);
2723 new_section
->section
= section
;
2724 new_section
->pattern
= pattern
;
2727 /* PE puts the sort key in the input statement. */
2730 sort_filename (bfd
*abfd
)
2732 lang_input_statement_type
*is
= bfd_usrdata (abfd
);
2734 return is
->sort_key
;
2735 return bfd_get_filename (abfd
);
2738 /* Handle wildcard sorting. This returns the lang_input_section which
2739 should follow the one we are going to create for SECTION and FILE,
2740 based on the sorting requirements of WILD. It returns NULL if the
2741 new section should just go at the end of the current list. */
2743 static lang_statement_union_type
*
2744 wild_sort (lang_wild_statement_type
*wild
,
2745 struct wildcard_list
*sec
,
2746 lang_input_statement_type
*file
,
2749 lang_statement_union_type
*l
;
2751 if (!wild
->filenames_sorted
2752 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2755 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2757 lang_input_section_type
*ls
;
2759 if (l
->header
.type
!= lang_input_section_enum
)
2761 ls
= &l
->input_section
;
2763 /* Sorting by filename takes precedence over sorting by section
2766 if (wild
->filenames_sorted
)
2768 const char *fn
, *ln
;
2772 /* The PE support for the .idata section as generated by
2773 dlltool assumes that files will be sorted by the name of
2774 the archive and then the name of the file within the
2777 fa
= file
->the_bfd
->my_archive
!= NULL
;
2779 fn
= sort_filename (file
->the_bfd
->my_archive
);
2781 fn
= sort_filename (file
->the_bfd
);
2783 la
= ls
->section
->owner
->my_archive
!= NULL
;
2785 ln
= sort_filename (ls
->section
->owner
->my_archive
);
2787 ln
= sort_filename (ls
->section
->owner
);
2789 i
= filename_cmp (fn
, ln
);
2798 fn
= sort_filename (file
->the_bfd
);
2800 ln
= sort_filename (ls
->section
->owner
);
2802 i
= filename_cmp (fn
, ln
);
2810 /* Here either the files are not sorted by name, or we are
2811 looking at the sections for this file. */
2814 && sec
->spec
.sorted
!= none
2815 && sec
->spec
.sorted
!= by_none
)
2816 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2823 /* Expand a wild statement for a particular FILE. SECTION may be
2824 NULL, in which case it is a wild card. */
2827 output_section_callback (lang_wild_statement_type
*ptr
,
2828 struct wildcard_list
*sec
,
2830 lang_input_statement_type
*file
,
2833 lang_statement_union_type
*before
;
2834 lang_output_section_statement_type
*os
;
2836 os
= (lang_output_section_statement_type
*) output
;
2838 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2839 if (unique_section_p (section
, os
))
2842 before
= wild_sort (ptr
, sec
, file
, section
);
2844 /* Here BEFORE points to the lang_input_section which
2845 should follow the one we are about to add. If BEFORE
2846 is NULL, then the section should just go at the end
2847 of the current list. */
2850 lang_add_section (&ptr
->children
, section
, ptr
->section_list
,
2851 ptr
->section_flag_list
, os
);
2854 lang_statement_list_type list
;
2855 lang_statement_union_type
**pp
;
2857 lang_list_init (&list
);
2858 lang_add_section (&list
, section
, ptr
->section_list
,
2859 ptr
->section_flag_list
, os
);
2861 /* If we are discarding the section, LIST.HEAD will
2863 if (list
.head
!= NULL
)
2865 ASSERT (list
.head
->header
.next
== NULL
);
2867 for (pp
= &ptr
->children
.head
;
2869 pp
= &(*pp
)->header
.next
)
2870 ASSERT (*pp
!= NULL
);
2872 list
.head
->header
.next
= *pp
;
2878 /* Check if all sections in a wild statement for a particular FILE
2882 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2883 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2885 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2888 lang_output_section_statement_type
*os
;
2890 os
= (lang_output_section_statement_type
*) output
;
2892 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2893 if (unique_section_p (section
, os
))
2896 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2897 os
->all_input_readonly
= false;
2900 /* This is passed a file name which must have been seen already and
2901 added to the statement tree. We will see if it has been opened
2902 already and had its symbols read. If not then we'll read it. */
2904 static lang_input_statement_type
*
2905 lookup_name (const char *name
)
2907 lang_input_statement_type
*search
;
2909 for (search
= (void *) input_file_chain
.head
;
2911 search
= search
->next_real_file
)
2913 /* Use the local_sym_name as the name of the file that has
2914 already been loaded as filename might have been transformed
2915 via the search directory lookup mechanism. */
2916 const char *filename
= search
->local_sym_name
;
2918 if (filename
!= NULL
2919 && filename_cmp (filename
, name
) == 0)
2925 /* Arrange to splice the input statement added by new_afile into
2926 statement_list after the current input_file_chain tail.
2927 We know input_file_chain is not an empty list, and that
2928 lookup_name was called via open_input_bfds. Later calls to
2929 lookup_name should always match an existing input_statement. */
2930 lang_statement_union_type
**tail
= stat_ptr
->tail
;
2931 lang_statement_union_type
**after
2932 = (void *) ((char *) input_file_chain
.tail
2933 - offsetof (lang_input_statement_type
, next_real_file
)
2934 + offsetof (lang_input_statement_type
, header
.next
));
2935 lang_statement_union_type
*rest
= *after
;
2936 stat_ptr
->tail
= after
;
2937 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2938 default_target
, NULL
);
2939 *stat_ptr
->tail
= rest
;
2941 stat_ptr
->tail
= tail
;
2944 /* If we have already added this file, or this file is not real
2945 don't add this file. */
2946 if (search
->flags
.loaded
|| !search
->flags
.real
)
2949 if (!load_symbols (search
, NULL
))
2955 /* Save LIST as a list of libraries whose symbols should not be exported. */
2960 struct excluded_lib
*next
;
2962 static struct excluded_lib
*excluded_libs
;
2965 add_excluded_libs (const char *list
)
2967 const char *p
= list
, *end
;
2971 struct excluded_lib
*entry
;
2972 end
= strpbrk (p
, ",:");
2974 end
= p
+ strlen (p
);
2975 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2976 entry
->next
= excluded_libs
;
2977 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2978 memcpy (entry
->name
, p
, end
- p
);
2979 entry
->name
[end
- p
] = '\0';
2980 excluded_libs
= entry
;
2988 check_excluded_libs (bfd
*abfd
)
2990 struct excluded_lib
*lib
= excluded_libs
;
2994 int len
= strlen (lib
->name
);
2995 const char *filename
= lbasename (bfd_get_filename (abfd
));
2997 if (strcmp (lib
->name
, "ALL") == 0)
2999 abfd
->no_export
= true;
3003 if (filename_ncmp (lib
->name
, filename
, len
) == 0
3004 && (filename
[len
] == '\0'
3005 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
3006 && filename
[len
+ 2] == '\0')))
3008 abfd
->no_export
= true;
3016 /* Get the symbols for an input file. */
3019 load_symbols (lang_input_statement_type
*entry
,
3020 lang_statement_list_type
*place
)
3024 if (entry
->flags
.loaded
)
3027 ldfile_open_file (entry
);
3029 /* Do not process further if the file was missing. */
3030 if (entry
->flags
.missing_file
)
3033 if (trace_files
|| verbose
)
3034 info_msg ("%pI\n", entry
);
3036 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
3037 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
3040 struct lang_input_statement_flags save_flags
;
3043 err
= bfd_get_error ();
3045 /* See if the emulation has some special knowledge. */
3046 if (ldemul_unrecognized_file (entry
))
3048 if (err
== bfd_error_file_ambiguously_recognized
)
3053 if (err
== bfd_error_file_ambiguously_recognized
)
3057 einfo (_("%P: %pB: file not recognized: %E;"
3058 " matching formats:"), entry
->the_bfd
);
3059 for (p
= matching
; *p
!= NULL
; p
++)
3064 else if (err
!= bfd_error_file_not_recognized
3066 einfo (_("%F%P: %pB: file not recognized: %E\n"), entry
->the_bfd
);
3068 bfd_close (entry
->the_bfd
);
3069 entry
->the_bfd
= NULL
;
3071 /* Try to interpret the file as a linker script. */
3072 save_flags
= input_flags
;
3073 ldfile_open_command_file (entry
->filename
);
3075 push_stat_ptr (place
);
3076 input_flags
.add_DT_NEEDED_for_regular
3077 = entry
->flags
.add_DT_NEEDED_for_regular
;
3078 input_flags
.add_DT_NEEDED_for_dynamic
3079 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
3080 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
3081 input_flags
.dynamic
= entry
->flags
.dynamic
;
3083 ldfile_assumed_script
= true;
3084 parser_input
= input_script
;
3085 current_input_file
= entry
->filename
;
3087 current_input_file
= NULL
;
3088 ldfile_assumed_script
= false;
3090 /* missing_file is sticky. sysrooted will already have been
3091 restored when seeing EOF in yyparse, but no harm to restore
3093 save_flags
.missing_file
|= input_flags
.missing_file
;
3094 input_flags
= save_flags
;
3098 entry
->flags
.loaded
= true;
3103 if (ldemul_recognized_file (entry
))
3106 /* We don't call ldlang_add_file for an archive. Instead, the
3107 add_symbols entry point will call ldlang_add_file, via the
3108 add_archive_element callback, for each element of the archive
3110 switch (bfd_get_format (entry
->the_bfd
))
3116 if (!entry
->flags
.reload
)
3117 ldlang_add_file (entry
);
3121 check_excluded_libs (entry
->the_bfd
);
3123 bfd_set_usrdata (entry
->the_bfd
, entry
);
3124 if (entry
->flags
.whole_archive
)
3132 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
3137 if (!bfd_check_format (member
, bfd_object
))
3139 einfo (_("%F%P: %pB: member %pB in archive is not an object\n"),
3140 entry
->the_bfd
, member
);
3145 if (!(*link_info
.callbacks
3146 ->add_archive_element
) (&link_info
, member
,
3147 "--whole-archive", &subsbfd
))
3150 /* Potentially, the add_archive_element hook may have set a
3151 substitute BFD for us. */
3152 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
3154 einfo (_("%F%P: %pB: error adding symbols: %E\n"), member
);
3159 entry
->flags
.loaded
= loaded
;
3165 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
3166 entry
->flags
.loaded
= true;
3168 einfo (_("%F%P: %pB: error adding symbols: %E\n"), entry
->the_bfd
);
3170 return entry
->flags
.loaded
;
3173 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
3174 may be NULL, indicating that it is a wildcard. Separate
3175 lang_input_section statements are created for each part of the
3176 expansion; they are added after the wild statement S. OUTPUT is
3177 the output section. */
3180 wild (lang_wild_statement_type
*s
,
3181 const char *target ATTRIBUTE_UNUSED
,
3182 lang_output_section_statement_type
*output
)
3184 struct wildcard_list
*sec
;
3186 if (s
->handler_data
[0]
3187 && s
->handler_data
[0]->spec
.sorted
== by_name
3188 && !s
->filenames_sorted
)
3190 lang_section_bst_type
*tree
;
3192 walk_wild (s
, output_section_callback_fast
, output
);
3197 output_section_callback_tree_to_list (s
, tree
, output
);
3202 walk_wild (s
, output_section_callback
, output
);
3204 if (default_common_section
== NULL
)
3205 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
3206 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
3208 /* Remember the section that common is going to in case we
3209 later get something which doesn't know where to put it. */
3210 default_common_section
= output
;
3215 /* Return TRUE iff target is the sought target. */
3218 get_target (const bfd_target
*target
, void *data
)
3220 const char *sought
= (const char *) data
;
3222 return strcmp (target
->name
, sought
) == 0;
3225 /* Like strcpy() but convert to lower case as well. */
3228 stricpy (char *dest
, const char *src
)
3232 while ((c
= *src
++) != 0)
3233 *dest
++ = TOLOWER (c
);
3238 /* Remove the first occurrence of needle (if any) in haystack
3242 strcut (char *haystack
, const char *needle
)
3244 haystack
= strstr (haystack
, needle
);
3250 for (src
= haystack
+ strlen (needle
); *src
;)
3251 *haystack
++ = *src
++;
3257 /* Compare two target format name strings.
3258 Return a value indicating how "similar" they are. */
3261 name_compare (const char *first
, const char *second
)
3267 copy1
= (char *) xmalloc (strlen (first
) + 1);
3268 copy2
= (char *) xmalloc (strlen (second
) + 1);
3270 /* Convert the names to lower case. */
3271 stricpy (copy1
, first
);
3272 stricpy (copy2
, second
);
3274 /* Remove size and endian strings from the name. */
3275 strcut (copy1
, "big");
3276 strcut (copy1
, "little");
3277 strcut (copy2
, "big");
3278 strcut (copy2
, "little");
3280 /* Return a value based on how many characters match,
3281 starting from the beginning. If both strings are
3282 the same then return 10 * their length. */
3283 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3284 if (copy1
[result
] == 0)
3296 /* Set by closest_target_match() below. */
3297 static const bfd_target
*winner
;
3299 /* Scan all the valid bfd targets looking for one that has the endianness
3300 requirement that was specified on the command line, and is the nearest
3301 match to the original output target. */
3304 closest_target_match (const bfd_target
*target
, void *data
)
3306 const bfd_target
*original
= (const bfd_target
*) data
;
3308 if (command_line
.endian
== ENDIAN_BIG
3309 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3312 if (command_line
.endian
== ENDIAN_LITTLE
3313 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3316 /* Must be the same flavour. */
3317 if (target
->flavour
!= original
->flavour
)
3320 /* Ignore generic big and little endian elf vectors. */
3321 if (strcmp (target
->name
, "elf32-big") == 0
3322 || strcmp (target
->name
, "elf64-big") == 0
3323 || strcmp (target
->name
, "elf32-little") == 0
3324 || strcmp (target
->name
, "elf64-little") == 0)
3327 /* If we have not found a potential winner yet, then record this one. */
3334 /* Oh dear, we now have two potential candidates for a successful match.
3335 Compare their names and choose the better one. */
3336 if (name_compare (target
->name
, original
->name
)
3337 > name_compare (winner
->name
, original
->name
))
3340 /* Keep on searching until wqe have checked them all. */
3344 /* Return the BFD target format of the first input file. */
3347 get_first_input_target (void)
3349 const char *target
= NULL
;
3351 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3353 if (s
->header
.type
== lang_input_statement_enum
3356 ldfile_open_file (s
);
3358 if (s
->the_bfd
!= NULL
3359 && bfd_check_format (s
->the_bfd
, bfd_object
))
3361 target
= bfd_get_target (s
->the_bfd
);
3373 lang_get_output_target (void)
3377 /* Has the user told us which output format to use? */
3378 if (output_target
!= NULL
)
3379 return output_target
;
3381 /* No - has the current target been set to something other than
3383 if (current_target
!= default_target
&& current_target
!= NULL
)
3384 return current_target
;
3386 /* No - can we determine the format of the first input file? */
3387 target
= get_first_input_target ();
3391 /* Failed - use the default output target. */
3392 return default_target
;
3395 /* Open the output file. */
3398 open_output (const char *name
)
3400 lang_input_statement_type
*f
;
3401 char *out
= lrealpath (name
);
3403 for (f
= (void *) input_file_chain
.head
;
3405 f
= f
->next_real_file
)
3408 char *in
= lrealpath (f
->local_sym_name
);
3409 if (filename_cmp (in
, out
) == 0)
3410 einfo (_("%F%P: input file '%s' is the same as output file\n"),
3416 output_target
= lang_get_output_target ();
3418 /* Has the user requested a particular endianness on the command
3420 if (command_line
.endian
!= ENDIAN_UNSET
)
3422 /* Get the chosen target. */
3423 const bfd_target
*target
3424 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3426 /* If the target is not supported, we cannot do anything. */
3429 enum bfd_endian desired_endian
;
3431 if (command_line
.endian
== ENDIAN_BIG
)
3432 desired_endian
= BFD_ENDIAN_BIG
;
3434 desired_endian
= BFD_ENDIAN_LITTLE
;
3436 /* See if the target has the wrong endianness. This should
3437 not happen if the linker script has provided big and
3438 little endian alternatives, but some scrips don't do
3440 if (target
->byteorder
!= desired_endian
)
3442 /* If it does, then see if the target provides
3443 an alternative with the correct endianness. */
3444 if (target
->alternative_target
!= NULL
3445 && (target
->alternative_target
->byteorder
== desired_endian
))
3446 output_target
= target
->alternative_target
->name
;
3449 /* Try to find a target as similar as possible to
3450 the default target, but which has the desired
3451 endian characteristic. */
3452 bfd_iterate_over_targets (closest_target_match
,
3455 /* Oh dear - we could not find any targets that
3456 satisfy our requirements. */
3458 einfo (_("%P: warning: could not find any targets"
3459 " that match endianness requirement\n"));
3461 output_target
= winner
->name
;
3467 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3469 if (link_info
.output_bfd
== NULL
)
3471 if (bfd_get_error () == bfd_error_invalid_target
)
3472 einfo (_("%F%P: target %s not found\n"), output_target
);
3474 einfo (_("%F%P: cannot open output file %s: %E\n"), name
);
3477 delete_output_file_on_failure
= true;
3479 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3480 einfo (_("%F%P: %s: can not make object file: %E\n"), name
);
3481 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3482 ldfile_output_architecture
,
3483 ldfile_output_machine
))
3484 einfo (_("%F%P: %s: can not set architecture: %E\n"), name
);
3486 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3487 if (link_info
.hash
== NULL
)
3488 einfo (_("%F%P: can not create hash table: %E\n"));
3490 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3494 ldlang_open_output (lang_statement_union_type
*statement
)
3496 switch (statement
->header
.type
)
3498 case lang_output_statement_enum
:
3499 ASSERT (link_info
.output_bfd
== NULL
);
3500 open_output (statement
->output_statement
.name
);
3501 ldemul_set_output_arch ();
3502 if (config
.magic_demand_paged
3503 && !bfd_link_relocatable (&link_info
))
3504 link_info
.output_bfd
->flags
|= D_PAGED
;
3506 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3507 if (config
.text_read_only
)
3508 link_info
.output_bfd
->flags
|= WP_TEXT
;
3510 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3511 if (link_info
.traditional_format
)
3512 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3514 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3517 case lang_target_statement_enum
:
3518 current_target
= statement
->target_statement
.target
;
3526 init_opb (asection
*s
)
3531 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
3533 && (s
->flags
& SEC_ELF_OCTETS
) != 0)
3536 x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3537 ldfile_output_machine
);
3539 while ((x
& 1) == 0)
3547 /* Open all the input files. */
3551 OPEN_BFD_NORMAL
= 0,
3555 #if BFD_SUPPORTS_PLUGINS
3556 static lang_input_statement_type
*plugin_insert
= NULL
;
3557 static struct bfd_link_hash_entry
*plugin_undefs
= NULL
;
3561 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3563 for (; s
!= NULL
; s
= s
->header
.next
)
3565 switch (s
->header
.type
)
3567 case lang_constructors_statement_enum
:
3568 open_input_bfds (constructor_list
.head
, mode
);
3570 case lang_output_section_statement_enum
:
3571 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3573 case lang_wild_statement_enum
:
3574 /* Maybe we should load the file's symbols. */
3575 if ((mode
& OPEN_BFD_RESCAN
) == 0
3576 && s
->wild_statement
.filename
3577 && !wildcardp (s
->wild_statement
.filename
)
3578 && !archive_path (s
->wild_statement
.filename
))
3579 lookup_name (s
->wild_statement
.filename
);
3580 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3582 case lang_group_statement_enum
:
3584 struct bfd_link_hash_entry
*undefs
;
3585 #if BFD_SUPPORTS_PLUGINS
3586 lang_input_statement_type
*plugin_insert_save
;
3589 /* We must continually search the entries in the group
3590 until no new symbols are added to the list of undefined
3595 #if BFD_SUPPORTS_PLUGINS
3596 plugin_insert_save
= plugin_insert
;
3598 undefs
= link_info
.hash
->undefs_tail
;
3599 open_input_bfds (s
->group_statement
.children
.head
,
3600 mode
| OPEN_BFD_FORCE
);
3602 while (undefs
!= link_info
.hash
->undefs_tail
3603 #if BFD_SUPPORTS_PLUGINS
3604 /* Objects inserted by a plugin, which are loaded
3605 before we hit this loop, may have added new
3607 || (plugin_insert
!= plugin_insert_save
&& plugin_undefs
)
3612 case lang_target_statement_enum
:
3613 current_target
= s
->target_statement
.target
;
3615 case lang_input_statement_enum
:
3616 if (s
->input_statement
.flags
.real
)
3618 lang_statement_union_type
**os_tail
;
3619 lang_statement_list_type add
;
3622 s
->input_statement
.target
= current_target
;
3624 /* If we are being called from within a group, and this
3625 is an archive which has already been searched, then
3626 force it to be researched unless the whole archive
3627 has been loaded already. Do the same for a rescan.
3628 Likewise reload --as-needed shared libs. */
3629 if (mode
!= OPEN_BFD_NORMAL
3630 #if BFD_SUPPORTS_PLUGINS
3631 && ((mode
& OPEN_BFD_RESCAN
) == 0
3632 || plugin_insert
== NULL
)
3634 && s
->input_statement
.flags
.loaded
3635 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3636 && ((bfd_get_format (abfd
) == bfd_archive
3637 && !s
->input_statement
.flags
.whole_archive
)
3638 || (bfd_get_format (abfd
) == bfd_object
3639 && ((abfd
->flags
) & DYNAMIC
) != 0
3640 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3641 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3642 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3644 s
->input_statement
.flags
.loaded
= false;
3645 s
->input_statement
.flags
.reload
= true;
3648 os_tail
= lang_os_list
.tail
;
3649 lang_list_init (&add
);
3651 if (!load_symbols (&s
->input_statement
, &add
))
3652 config
.make_executable
= false;
3654 if (add
.head
!= NULL
)
3656 /* If this was a script with output sections then
3657 tack any added statements on to the end of the
3658 list. This avoids having to reorder the output
3659 section statement list. Very likely the user
3660 forgot -T, and whatever we do here will not meet
3661 naive user expectations. */
3662 if (os_tail
!= lang_os_list
.tail
)
3664 einfo (_("%P: warning: %s contains output sections;"
3665 " did you forget -T?\n"),
3666 s
->input_statement
.filename
);
3667 *stat_ptr
->tail
= add
.head
;
3668 stat_ptr
->tail
= add
.tail
;
3672 *add
.tail
= s
->header
.next
;
3673 s
->header
.next
= add
.head
;
3677 #if BFD_SUPPORTS_PLUGINS
3678 /* If we have found the point at which a plugin added new
3679 files, clear plugin_insert to enable archive rescan. */
3680 if (&s
->input_statement
== plugin_insert
)
3681 plugin_insert
= NULL
;
3684 case lang_assignment_statement_enum
:
3685 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3686 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3693 /* Exit if any of the files were missing. */
3694 if (input_flags
.missing_file
)
3698 #ifdef ENABLE_LIBCTF
3699 /* Emit CTF errors and warnings. fp can be NULL to report errors/warnings
3700 that happened specifically at CTF open time. */
3702 lang_ctf_errs_warnings (ctf_dict_t
*fp
)
3704 ctf_next_t
*i
= NULL
;
3709 while ((text
= ctf_errwarning_next (fp
, &i
, &is_warning
, &err
)) != NULL
)
3711 einfo (_("%s: %s\n"), is_warning
? _("CTF warning"): _("CTF error"),
3715 if (err
!= ECTF_NEXT_END
)
3717 einfo (_("CTF error: cannot get CTF errors: `%s'\n"),
3721 /* `err' returns errors from the error/warning iterator in particular.
3722 These never assert. But if we have an fp, that could have recorded
3723 an assertion failure: assert if it has done so. */
3724 ASSERT (!fp
|| ctf_errno (fp
) != ECTF_INTERNAL
);
3727 /* Open the CTF sections in the input files with libctf: if any were opened,
3728 create a fake input file that we'll write the merged CTF data to later
3732 ldlang_open_ctf (void)
3737 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3741 /* Incoming files from the compiler have a single ctf_dict_t in them
3742 (which is presented to us by the libctf API in a ctf_archive_t
3743 wrapper): files derived from a previous relocatable link have a CTF
3744 archive containing possibly many CTF files. */
3746 if ((file
->the_ctf
= ctf_bfdopen (file
->the_bfd
, &err
)) == NULL
)
3748 if (err
!= ECTF_NOCTFDATA
)
3750 lang_ctf_errs_warnings (NULL
);
3751 einfo (_("%P: warning: CTF section in %pB not loaded; "
3752 "its types will be discarded: %s\n"), file
->the_bfd
,
3758 /* Prevent the contents of this section from being written, while
3759 requiring the section itself to be duplicated in the output, but only
3761 /* This section must exist if ctf_bfdopen() succeeded. */
3762 sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf");
3764 sect
->flags
|= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
| SEC_LINKER_CREATED
;
3767 sect
->flags
|= SEC_EXCLUDE
;
3777 if ((ctf_output
= ctf_create (&err
)) != NULL
)
3780 einfo (_("%P: warning: CTF output not created: `%s'\n"),
3783 LANG_FOR_EACH_INPUT_STATEMENT (errfile
)
3784 ctf_close (errfile
->the_ctf
);
3787 /* Merge together CTF sections. After this, only the symtab-dependent
3788 function and data object sections need adjustment. */
3791 lang_merge_ctf (void)
3793 asection
*output_sect
;
3799 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3801 /* If the section was discarded, don't waste time merging. */
3802 if (output_sect
== NULL
)
3804 ctf_dict_close (ctf_output
);
3807 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3809 ctf_close (file
->the_ctf
);
3810 file
->the_ctf
= NULL
;
3815 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3820 /* Takes ownership of file->the_ctf. */
3821 if (ctf_link_add_ctf (ctf_output
, file
->the_ctf
, file
->filename
) < 0)
3823 einfo (_("%P: warning: CTF section in %pB cannot be linked: `%s'\n"),
3824 file
->the_bfd
, ctf_errmsg (ctf_errno (ctf_output
)));
3825 ctf_close (file
->the_ctf
);
3826 file
->the_ctf
= NULL
;
3831 if (!config
.ctf_share_duplicated
)
3832 flags
= CTF_LINK_SHARE_UNCONFLICTED
;
3834 flags
= CTF_LINK_SHARE_DUPLICATED
;
3835 if (!config
.ctf_variables
)
3836 flags
|= CTF_LINK_OMIT_VARIABLES_SECTION
;
3837 if (bfd_link_relocatable (&link_info
))
3838 flags
|= CTF_LINK_NO_FILTER_REPORTED_SYMS
;
3840 if (ctf_link (ctf_output
, flags
) < 0)
3842 lang_ctf_errs_warnings (ctf_output
);
3843 einfo (_("%P: warning: CTF linking failed; "
3844 "output will have no CTF section: %s\n"),
3845 ctf_errmsg (ctf_errno (ctf_output
)));
3848 output_sect
->size
= 0;
3849 output_sect
->flags
|= SEC_EXCLUDE
;
3852 /* Output any lingering errors that didn't come from ctf_link. */
3853 lang_ctf_errs_warnings (ctf_output
);
3856 /* Let the emulation acquire strings from the dynamic strtab to help it optimize
3857 the CTF, if supported. */
3860 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
)
3862 ldemul_acquire_strings_for_ctf (ctf_output
, dynstrtab
);
3865 /* Inform the emulation about the addition of a new dynamic symbol, in BFD
3867 void ldlang_ctf_new_dynsym (int symidx
, struct elf_internal_sym
*sym
)
3869 ldemul_new_dynsym_for_ctf (ctf_output
, symidx
, sym
);
3872 /* Write out the CTF section. Called early, if the emulation isn't going to
3873 need to dedup against the strtab and symtab, then possibly called from the
3874 target linker code if the dedup has happened. */
3876 lang_write_ctf (int late
)
3879 asection
*output_sect
;
3886 /* Emit CTF late if this emulation says it can do so. */
3887 if (ldemul_emit_ctf_early ())
3892 if (!ldemul_emit_ctf_early ())
3896 /* Inform the emulation that all the symbols that will be received have
3899 ldemul_new_dynsym_for_ctf (ctf_output
, 0, NULL
);
3903 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3906 output_sect
->contents
= ctf_link_write (ctf_output
, &output_size
,
3907 CTF_COMPRESSION_THRESHOLD
);
3908 output_sect
->size
= output_size
;
3909 output_sect
->flags
|= SEC_IN_MEMORY
| SEC_KEEP
;
3911 lang_ctf_errs_warnings (ctf_output
);
3912 if (!output_sect
->contents
)
3914 einfo (_("%P: warning: CTF section emission failed; "
3915 "output will have no CTF section: %s\n"),
3916 ctf_errmsg (ctf_errno (ctf_output
)));
3917 output_sect
->size
= 0;
3918 output_sect
->flags
|= SEC_EXCLUDE
;
3922 /* This also closes every CTF input file used in the link. */
3923 ctf_dict_close (ctf_output
);
3926 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3927 file
->the_ctf
= NULL
;
3930 /* Write out the CTF section late, if the emulation needs that. */
3933 ldlang_write_ctf_late (void)
3935 /* Trigger a "late call", if the emulation needs one. */
3941 ldlang_open_ctf (void)
3943 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3947 /* If built without CTF, warn and delete all CTF sections from the output.
3948 (The alternative would be to simply concatenate them, which does not
3949 yield a valid CTF section.) */
3951 if ((sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf")) != NULL
)
3953 einfo (_("%P: warning: CTF section in %pB not linkable: "
3954 "%P was built without support for CTF\n"), file
->the_bfd
);
3956 sect
->flags
|= SEC_EXCLUDE
;
3961 static void lang_merge_ctf (void) {}
3963 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
3964 ATTRIBUTE_UNUSED
) {}
3966 ldlang_ctf_new_dynsym (int symidx ATTRIBUTE_UNUSED
,
3967 struct elf_internal_sym
*sym ATTRIBUTE_UNUSED
) {}
3968 static void lang_write_ctf (int late ATTRIBUTE_UNUSED
) {}
3969 void ldlang_write_ctf_late (void) {}
3972 /* Add the supplied name to the symbol table as an undefined reference.
3973 This is a two step process as the symbol table doesn't even exist at
3974 the time the ld command line is processed. First we put the name
3975 on a list, then, once the output file has been opened, transfer the
3976 name to the symbol table. */
3978 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3980 #define ldlang_undef_chain_list_head entry_symbol.next
3983 ldlang_add_undef (const char *const name
, bool cmdline ATTRIBUTE_UNUSED
)
3985 ldlang_undef_chain_list_type
*new_undef
;
3987 new_undef
= stat_alloc (sizeof (*new_undef
));
3988 new_undef
->next
= ldlang_undef_chain_list_head
;
3989 ldlang_undef_chain_list_head
= new_undef
;
3991 new_undef
->name
= xstrdup (name
);
3993 if (link_info
.output_bfd
!= NULL
)
3994 insert_undefined (new_undef
->name
);
3997 /* Insert NAME as undefined in the symbol table. */
4000 insert_undefined (const char *name
)
4002 struct bfd_link_hash_entry
*h
;
4004 h
= bfd_link_hash_lookup (link_info
.hash
, name
, true, false, true);
4006 einfo (_("%F%P: bfd_link_hash_lookup failed: %E\n"));
4007 if (h
->type
== bfd_link_hash_new
)
4009 h
->type
= bfd_link_hash_undefined
;
4010 h
->u
.undef
.abfd
= NULL
;
4011 h
->non_ir_ref_regular
= true;
4012 bfd_link_add_undef (link_info
.hash
, h
);
4016 /* Run through the list of undefineds created above and place them
4017 into the linker hash table as undefined symbols belonging to the
4021 lang_place_undefineds (void)
4023 ldlang_undef_chain_list_type
*ptr
;
4025 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
4026 insert_undefined (ptr
->name
);
4029 /* Mark -u symbols against garbage collection. */
4032 lang_mark_undefineds (void)
4034 ldlang_undef_chain_list_type
*ptr
;
4036 if (is_elf_hash_table (link_info
.hash
))
4037 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
4039 struct elf_link_hash_entry
*h
= (struct elf_link_hash_entry
*)
4040 bfd_link_hash_lookup (link_info
.hash
, ptr
->name
, false, false, true);
4046 /* Structure used to build the list of symbols that the user has required
4049 struct require_defined_symbol
4052 struct require_defined_symbol
*next
;
4055 /* The list of symbols that the user has required be defined. */
4057 static struct require_defined_symbol
*require_defined_symbol_list
;
4059 /* Add a new symbol NAME to the list of symbols that are required to be
4063 ldlang_add_require_defined (const char *const name
)
4065 struct require_defined_symbol
*ptr
;
4067 ldlang_add_undef (name
, true);
4068 ptr
= stat_alloc (sizeof (*ptr
));
4069 ptr
->next
= require_defined_symbol_list
;
4070 ptr
->name
= strdup (name
);
4071 require_defined_symbol_list
= ptr
;
4074 /* Check that all symbols the user required to be defined, are defined,
4075 raise an error if we find a symbol that is not defined. */
4078 ldlang_check_require_defined_symbols (void)
4080 struct require_defined_symbol
*ptr
;
4082 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
4084 struct bfd_link_hash_entry
*h
;
4086 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
4087 false, false, true);
4089 || (h
->type
!= bfd_link_hash_defined
4090 && h
->type
!= bfd_link_hash_defweak
))
4091 einfo(_("%X%P: required symbol `%s' not defined\n"), ptr
->name
);
4095 /* Check for all readonly or some readwrite sections. */
4098 check_input_sections
4099 (lang_statement_union_type
*s
,
4100 lang_output_section_statement_type
*output_section_statement
)
4102 for (; s
!= NULL
; s
= s
->header
.next
)
4104 switch (s
->header
.type
)
4106 case lang_wild_statement_enum
:
4107 walk_wild (&s
->wild_statement
, check_section_callback
,
4108 output_section_statement
);
4109 if (!output_section_statement
->all_input_readonly
)
4112 case lang_constructors_statement_enum
:
4113 check_input_sections (constructor_list
.head
,
4114 output_section_statement
);
4115 if (!output_section_statement
->all_input_readonly
)
4118 case lang_group_statement_enum
:
4119 check_input_sections (s
->group_statement
.children
.head
,
4120 output_section_statement
);
4121 if (!output_section_statement
->all_input_readonly
)
4130 /* Update wildcard statements if needed. */
4133 update_wild_statements (lang_statement_union_type
*s
)
4135 struct wildcard_list
*sec
;
4137 switch (sort_section
)
4147 for (; s
!= NULL
; s
= s
->header
.next
)
4149 switch (s
->header
.type
)
4154 case lang_wild_statement_enum
:
4155 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
4157 /* Don't sort .init/.fini sections. */
4158 if (strcmp (sec
->spec
.name
, ".init") != 0
4159 && strcmp (sec
->spec
.name
, ".fini") != 0)
4160 switch (sec
->spec
.sorted
)
4163 sec
->spec
.sorted
= sort_section
;
4166 if (sort_section
== by_alignment
)
4167 sec
->spec
.sorted
= by_name_alignment
;
4170 if (sort_section
== by_name
)
4171 sec
->spec
.sorted
= by_alignment_name
;
4178 case lang_constructors_statement_enum
:
4179 update_wild_statements (constructor_list
.head
);
4182 case lang_output_section_statement_enum
:
4183 update_wild_statements
4184 (s
->output_section_statement
.children
.head
);
4187 case lang_group_statement_enum
:
4188 update_wild_statements (s
->group_statement
.children
.head
);
4196 /* Open input files and attach to output sections. */
4199 map_input_to_output_sections
4200 (lang_statement_union_type
*s
, const char *target
,
4201 lang_output_section_statement_type
*os
)
4203 for (; s
!= NULL
; s
= s
->header
.next
)
4205 lang_output_section_statement_type
*tos
;
4207 unsigned int type
= 0;
4209 switch (s
->header
.type
)
4211 case lang_wild_statement_enum
:
4212 wild (&s
->wild_statement
, target
, os
);
4214 case lang_constructors_statement_enum
:
4215 map_input_to_output_sections (constructor_list
.head
,
4219 case lang_output_section_statement_enum
:
4220 tos
= &s
->output_section_statement
;
4221 if (tos
->constraint
== ONLY_IF_RW
4222 || tos
->constraint
== ONLY_IF_RO
)
4224 tos
->all_input_readonly
= true;
4225 check_input_sections (tos
->children
.head
, tos
);
4226 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
4227 tos
->constraint
= -1;
4229 if (tos
->constraint
>= 0)
4230 map_input_to_output_sections (tos
->children
.head
,
4234 case lang_output_statement_enum
:
4236 case lang_target_statement_enum
:
4237 target
= s
->target_statement
.target
;
4239 case lang_group_statement_enum
:
4240 map_input_to_output_sections (s
->group_statement
.children
.head
,
4244 case lang_data_statement_enum
:
4245 /* Make sure that any sections mentioned in the expression
4247 exp_init_os (s
->data_statement
.exp
);
4248 /* The output section gets CONTENTS, ALLOC and LOAD, but
4249 these may be overridden by the script. */
4250 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
4251 switch (os
->sectype
)
4253 case normal_section
:
4254 case overlay_section
:
4255 case first_overlay_section
:
4257 case noalloc_section
:
4258 flags
= SEC_HAS_CONTENTS
;
4260 case readonly_section
:
4261 flags
|= SEC_READONLY
;
4263 case typed_readonly_section
:
4264 flags
|= SEC_READONLY
;
4267 if (os
->sectype_value
->type
.node_class
== etree_name
4268 && os
->sectype_value
->type
.node_code
== NAME
)
4270 const char *name
= os
->sectype_value
->name
.name
;
4271 if (strcmp (name
, "SHT_PROGBITS") == 0)
4272 type
= SHT_PROGBITS
;
4273 else if (strcmp (name
, "SHT_STRTAB") == 0)
4275 else if (strcmp (name
, "SHT_NOTE") == 0)
4277 else if (strcmp (name
, "SHT_NOBITS") == 0)
4279 else if (strcmp (name
, "SHT_INIT_ARRAY") == 0)
4280 type
= SHT_INIT_ARRAY
;
4281 else if (strcmp (name
, "SHT_FINI_ARRAY") == 0)
4282 type
= SHT_FINI_ARRAY
;
4283 else if (strcmp (name
, "SHT_PREINIT_ARRAY") == 0)
4284 type
= SHT_PREINIT_ARRAY
;
4286 einfo (_ ("%F%P: invalid type for output section `%s'\n"),
4291 exp_fold_tree_no_dot (os
->sectype_value
);
4292 if (expld
.result
.valid_p
)
4293 type
= expld
.result
.value
;
4295 einfo (_ ("%F%P: invalid type for output section `%s'\n"),
4299 case noload_section
:
4300 if (bfd_get_flavour (link_info
.output_bfd
)
4301 == bfd_target_elf_flavour
)
4302 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
4304 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
4307 if (os
->bfd_section
== NULL
)
4308 init_os (os
, flags
| SEC_READONLY
);
4310 os
->bfd_section
->flags
|= flags
;
4311 os
->bfd_section
->type
= type
;
4313 case lang_input_section_enum
:
4315 case lang_fill_statement_enum
:
4316 case lang_object_symbols_statement_enum
:
4317 case lang_reloc_statement_enum
:
4318 case lang_padding_statement_enum
:
4319 case lang_input_statement_enum
:
4320 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4323 case lang_assignment_statement_enum
:
4324 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4327 /* Make sure that any sections mentioned in the assignment
4329 exp_init_os (s
->assignment_statement
.exp
);
4331 case lang_address_statement_enum
:
4332 /* Mark the specified section with the supplied address.
4333 If this section was actually a segment marker, then the
4334 directive is ignored if the linker script explicitly
4335 processed the segment marker. Originally, the linker
4336 treated segment directives (like -Ttext on the
4337 command-line) as section directives. We honor the
4338 section directive semantics for backwards compatibility;
4339 linker scripts that do not specifically check for
4340 SEGMENT_START automatically get the old semantics. */
4341 if (!s
->address_statement
.segment
4342 || !s
->address_statement
.segment
->used
)
4344 const char *name
= s
->address_statement
.section_name
;
4346 /* Create the output section statement here so that
4347 orphans with a set address will be placed after other
4348 script sections. If we let the orphan placement code
4349 place them in amongst other sections then the address
4350 will affect following script sections, which is
4351 likely to surprise naive users. */
4352 tos
= lang_output_section_statement_lookup (name
, 0, 1);
4353 tos
->addr_tree
= s
->address_statement
.address
;
4354 if (tos
->bfd_section
== NULL
)
4358 case lang_insert_statement_enum
:
4364 /* An insert statement snips out all the linker statements from the
4365 start of the list and places them after the output section
4366 statement specified by the insert. This operation is complicated
4367 by the fact that we keep a doubly linked list of output section
4368 statements as well as the singly linked list of all statements.
4369 FIXME someday: Twiddling with the list not only moves statements
4370 from the user's script but also input and group statements that are
4371 built from command line object files and --start-group. We only
4372 get away with this because the list pointers used by file_chain
4373 and input_file_chain are not reordered, and processing via
4374 statement_list after this point mostly ignores input statements.
4375 One exception is the map file, where LOAD and START GROUP/END GROUP
4376 can end up looking odd. */
4379 process_insert_statements (lang_statement_union_type
**start
)
4381 lang_statement_union_type
**s
;
4382 lang_output_section_statement_type
*first_os
= NULL
;
4383 lang_output_section_statement_type
*last_os
= NULL
;
4384 lang_output_section_statement_type
*os
;
4389 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
4391 /* Keep pointers to the first and last output section
4392 statement in the sequence we may be about to move. */
4393 os
= &(*s
)->output_section_statement
;
4395 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
4398 /* Set constraint negative so that lang_output_section_find
4399 won't match this output section statement. At this
4400 stage in linking constraint has values in the range
4401 [-1, ONLY_IN_RW]. */
4402 last_os
->constraint
= -2 - last_os
->constraint
;
4403 if (first_os
== NULL
)
4406 else if ((*s
)->header
.type
== lang_group_statement_enum
)
4408 /* A user might put -T between --start-group and
4409 --end-group. One way this odd construct might arise is
4410 from a wrapper around ld to change library search
4411 behaviour. For example:
4413 exec real_ld --start-group "$@" --end-group
4414 This isn't completely unreasonable so go looking inside a
4415 group statement for insert statements. */
4416 process_insert_statements (&(*s
)->group_statement
.children
.head
);
4418 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
4420 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
4421 lang_output_section_statement_type
*where
;
4422 lang_statement_union_type
**ptr
;
4423 lang_statement_union_type
*first
;
4425 if (link_info
.non_contiguous_regions
)
4427 einfo (_("warning: INSERT statement in linker script is "
4428 "incompatible with --enable-non-contiguous-regions.\n"));
4431 where
= lang_output_section_find (i
->where
);
4432 if (where
!= NULL
&& i
->is_before
)
4435 where
= where
->prev
;
4436 while (where
!= NULL
&& where
->constraint
< 0);
4440 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
4444 /* Deal with reordering the output section statement list. */
4445 if (last_os
!= NULL
)
4447 asection
*first_sec
, *last_sec
;
4448 struct lang_output_section_statement_struct
**next
;
4450 /* Snip out the output sections we are moving. */
4451 first_os
->prev
->next
= last_os
->next
;
4452 if (last_os
->next
== NULL
)
4454 next
= &first_os
->prev
->next
;
4455 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4458 last_os
->next
->prev
= first_os
->prev
;
4459 /* Add them in at the new position. */
4460 last_os
->next
= where
->next
;
4461 if (where
->next
== NULL
)
4463 next
= &last_os
->next
;
4464 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4467 where
->next
->prev
= last_os
;
4468 first_os
->prev
= where
;
4469 where
->next
= first_os
;
4471 /* Move the bfd sections in the same way. */
4474 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4476 os
->constraint
= -2 - os
->constraint
;
4477 if (os
->bfd_section
!= NULL
4478 && os
->bfd_section
->owner
!= NULL
)
4480 last_sec
= os
->bfd_section
;
4481 if (first_sec
== NULL
)
4482 first_sec
= last_sec
;
4487 if (last_sec
!= NULL
)
4489 asection
*sec
= where
->bfd_section
;
4491 sec
= output_prev_sec_find (where
);
4493 /* The place we want to insert must come after the
4494 sections we are moving. So if we find no
4495 section or if the section is the same as our
4496 last section, then no move is needed. */
4497 if (sec
!= NULL
&& sec
!= last_sec
)
4499 /* Trim them off. */
4500 if (first_sec
->prev
!= NULL
)
4501 first_sec
->prev
->next
= last_sec
->next
;
4503 link_info
.output_bfd
->sections
= last_sec
->next
;
4504 if (last_sec
->next
!= NULL
)
4505 last_sec
->next
->prev
= first_sec
->prev
;
4507 link_info
.output_bfd
->section_last
= first_sec
->prev
;
4509 last_sec
->next
= sec
->next
;
4510 if (sec
->next
!= NULL
)
4511 sec
->next
->prev
= last_sec
;
4513 link_info
.output_bfd
->section_last
= last_sec
;
4514 first_sec
->prev
= sec
;
4515 sec
->next
= first_sec
;
4523 ptr
= insert_os_after (where
);
4524 /* Snip everything from the start of the list, up to and
4525 including the insert statement we are currently processing. */
4527 *start
= (*s
)->header
.next
;
4528 /* Add them back where they belong, minus the insert. */
4531 statement_list
.tail
= s
;
4536 s
= &(*s
)->header
.next
;
4539 /* Undo constraint twiddling. */
4540 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4542 os
->constraint
= -2 - os
->constraint
;
4548 /* An output section might have been removed after its statement was
4549 added. For example, ldemul_before_allocation can remove dynamic
4550 sections if they turn out to be not needed. Clean them up here. */
4553 strip_excluded_output_sections (void)
4555 lang_output_section_statement_type
*os
;
4557 /* Run lang_size_sections (if not already done). */
4558 if (expld
.phase
!= lang_mark_phase_enum
)
4560 expld
.phase
= lang_mark_phase_enum
;
4561 expld
.dataseg
.phase
= exp_seg_none
;
4562 one_lang_size_sections_pass (NULL
, false);
4563 lang_reset_memory_regions ();
4566 for (os
= (void *) lang_os_list
.head
;
4570 asection
*output_section
;
4573 if (os
->constraint
< 0)
4576 output_section
= os
->bfd_section
;
4577 if (output_section
== NULL
)
4580 exclude
= (output_section
->rawsize
== 0
4581 && (output_section
->flags
& SEC_KEEP
) == 0
4582 && !bfd_section_removed_from_list (link_info
.output_bfd
,
4585 /* Some sections have not yet been sized, notably .gnu.version,
4586 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
4587 input sections, so don't drop output sections that have such
4588 input sections unless they are also marked SEC_EXCLUDE. */
4589 if (exclude
&& output_section
->map_head
.s
!= NULL
)
4593 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
4594 if ((s
->flags
& SEC_EXCLUDE
) == 0
4595 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
4596 || link_info
.emitrelocations
))
4605 /* We don't set bfd_section to NULL since bfd_section of the
4606 removed output section statement may still be used. */
4607 if (!os
->update_dot
)
4609 output_section
->flags
|= SEC_EXCLUDE
;
4610 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
4611 link_info
.output_bfd
->section_count
--;
4616 /* Called from ldwrite to clear out asection.map_head and
4617 asection.map_tail for use as link_orders in ldwrite. */
4620 lang_clear_os_map (void)
4622 lang_output_section_statement_type
*os
;
4624 if (map_head_is_link_order
)
4627 for (os
= (void *) lang_os_list
.head
;
4631 asection
*output_section
;
4633 if (os
->constraint
< 0)
4636 output_section
= os
->bfd_section
;
4637 if (output_section
== NULL
)
4640 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
4641 output_section
->map_head
.link_order
= NULL
;
4642 output_section
->map_tail
.link_order
= NULL
;
4645 /* Stop future calls to lang_add_section from messing with map_head
4646 and map_tail link_order fields. */
4647 map_head_is_link_order
= true;
4651 print_output_section_statement
4652 (lang_output_section_statement_type
*output_section_statement
)
4654 asection
*section
= output_section_statement
->bfd_section
;
4657 if (output_section_statement
!= abs_output_section
)
4659 minfo ("\n%s", output_section_statement
->name
);
4661 if (section
!= NULL
)
4663 print_dot
= section
->vma
;
4665 len
= strlen (output_section_statement
->name
);
4666 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4671 while (len
< SECTION_NAME_MAP_LENGTH
)
4677 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4679 if (section
->vma
!= section
->lma
)
4680 minfo (_(" load address 0x%V"), section
->lma
);
4682 if (output_section_statement
->update_dot_tree
!= NULL
)
4683 exp_fold_tree (output_section_statement
->update_dot_tree
,
4684 bfd_abs_section_ptr
, &print_dot
);
4690 print_statement_list (output_section_statement
->children
.head
,
4691 output_section_statement
);
4695 print_assignment (lang_assignment_statement_type
*assignment
,
4696 lang_output_section_statement_type
*output_section
)
4703 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4706 if (assignment
->exp
->type
.node_class
== etree_assert
)
4709 tree
= assignment
->exp
->assert_s
.child
;
4713 const char *dst
= assignment
->exp
->assign
.dst
;
4715 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4716 tree
= assignment
->exp
;
4719 osec
= output_section
->bfd_section
;
4721 osec
= bfd_abs_section_ptr
;
4723 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4724 exp_fold_tree (tree
, osec
, &print_dot
);
4726 expld
.result
.valid_p
= false;
4728 if (expld
.result
.valid_p
)
4732 if (assignment
->exp
->type
.node_class
== etree_assert
4734 || expld
.assign_name
!= NULL
)
4736 value
= expld
.result
.value
;
4738 if (expld
.result
.section
!= NULL
)
4739 value
+= expld
.result
.section
->vma
;
4741 minfo ("0x%V", value
);
4747 struct bfd_link_hash_entry
*h
;
4749 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4750 false, false, true);
4752 && (h
->type
== bfd_link_hash_defined
4753 || h
->type
== bfd_link_hash_defweak
))
4755 value
= h
->u
.def
.value
;
4756 value
+= h
->u
.def
.section
->output_section
->vma
;
4757 value
+= h
->u
.def
.section
->output_offset
;
4759 minfo ("[0x%V]", value
);
4762 minfo ("[unresolved]");
4767 if (assignment
->exp
->type
.node_class
== etree_provide
)
4768 minfo ("[!provide]");
4775 expld
.assign_name
= NULL
;
4778 exp_print_tree (assignment
->exp
);
4783 print_input_statement (lang_input_statement_type
*statm
)
4785 if (statm
->filename
!= NULL
)
4786 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4789 /* Print all symbols defined in a particular section. This is called
4790 via bfd_link_hash_traverse, or by print_all_symbols. */
4793 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4795 asection
*sec
= (asection
*) ptr
;
4797 if ((hash_entry
->type
== bfd_link_hash_defined
4798 || hash_entry
->type
== bfd_link_hash_defweak
)
4799 && sec
== hash_entry
->u
.def
.section
)
4803 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4806 (hash_entry
->u
.def
.value
4807 + hash_entry
->u
.def
.section
->output_offset
4808 + hash_entry
->u
.def
.section
->output_section
->vma
));
4810 minfo (" %pT\n", hash_entry
->root
.string
);
4817 hash_entry_addr_cmp (const void *a
, const void *b
)
4819 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4820 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4822 if (l
->u
.def
.value
< r
->u
.def
.value
)
4824 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4831 print_all_symbols (asection
*sec
)
4833 input_section_userdata_type
*ud
= bfd_section_userdata (sec
);
4834 struct map_symbol_def
*def
;
4835 struct bfd_link_hash_entry
**entries
;
4841 *ud
->map_symbol_def_tail
= 0;
4843 /* Sort the symbols by address. */
4844 entries
= (struct bfd_link_hash_entry
**)
4845 obstack_alloc (&map_obstack
,
4846 ud
->map_symbol_def_count
* sizeof (*entries
));
4848 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4849 entries
[i
] = def
->entry
;
4851 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4852 hash_entry_addr_cmp
);
4854 /* Print the symbols. */
4855 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4856 ldemul_print_symbol (entries
[i
], sec
);
4858 obstack_free (&map_obstack
, entries
);
4861 /* Print information about an input section to the map file. */
4864 print_input_section (asection
*i
, bool is_discarded
)
4866 bfd_size_type size
= i
->size
;
4873 minfo ("%s", i
->name
);
4875 len
= 1 + strlen (i
->name
);
4876 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4881 while (len
< SECTION_NAME_MAP_LENGTH
)
4887 if (i
->output_section
!= NULL
4888 && i
->output_section
->owner
== link_info
.output_bfd
)
4889 addr
= i
->output_section
->vma
+ i
->output_offset
;
4897 minfo ("0x%V %W %pB\n", addr
, TO_ADDR (size
), i
->owner
);
4899 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4901 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4913 minfo (_("%W (size before relaxing)\n"), TO_ADDR (i
->rawsize
));
4916 if (i
->output_section
!= NULL
4917 && i
->output_section
->owner
== link_info
.output_bfd
)
4919 if (link_info
.reduce_memory_overheads
)
4920 bfd_link_hash_traverse (link_info
.hash
, ldemul_print_symbol
, i
);
4922 print_all_symbols (i
);
4924 /* Update print_dot, but make sure that we do not move it
4925 backwards - this could happen if we have overlays and a
4926 later overlay is shorter than an earier one. */
4927 if (addr
+ TO_ADDR (size
) > print_dot
)
4928 print_dot
= addr
+ TO_ADDR (size
);
4933 print_fill_statement (lang_fill_statement_type
*fill
)
4937 fputs (" FILL mask 0x", config
.map_file
);
4938 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4939 fprintf (config
.map_file
, "%02x", *p
);
4940 fputs ("\n", config
.map_file
);
4944 print_data_statement (lang_data_statement_type
*data
)
4951 init_opb (data
->output_section
);
4952 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4955 addr
= data
->output_offset
;
4956 if (data
->output_section
!= NULL
)
4957 addr
+= data
->output_section
->vma
;
4985 if (size
< TO_SIZE ((unsigned) 1))
4986 size
= TO_SIZE ((unsigned) 1);
4987 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4989 if (data
->exp
->type
.node_class
!= etree_value
)
4992 exp_print_tree (data
->exp
);
4997 print_dot
= addr
+ TO_ADDR (size
);
5000 /* Print an address statement. These are generated by options like
5004 print_address_statement (lang_address_statement_type
*address
)
5006 minfo (_("Address of section %s set to "), address
->section_name
);
5007 exp_print_tree (address
->address
);
5011 /* Print a reloc statement. */
5014 print_reloc_statement (lang_reloc_statement_type
*reloc
)
5020 init_opb (reloc
->output_section
);
5021 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
5024 addr
= reloc
->output_offset
;
5025 if (reloc
->output_section
!= NULL
)
5026 addr
+= reloc
->output_section
->vma
;
5028 size
= bfd_get_reloc_size (reloc
->howto
);
5030 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
5032 if (reloc
->name
!= NULL
)
5033 minfo ("%s+", reloc
->name
);
5035 minfo ("%s+", reloc
->section
->name
);
5037 exp_print_tree (reloc
->addend_exp
);
5041 print_dot
= addr
+ TO_ADDR (size
);
5045 print_padding_statement (lang_padding_statement_type
*s
)
5050 init_opb (s
->output_section
);
5053 len
= sizeof " *fill*" - 1;
5054 while (len
< SECTION_NAME_MAP_LENGTH
)
5060 addr
= s
->output_offset
;
5061 if (s
->output_section
!= NULL
)
5062 addr
+= s
->output_section
->vma
;
5063 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
5065 if (s
->fill
->size
!= 0)
5069 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
5070 fprintf (config
.map_file
, "%02x", *p
);
5075 print_dot
= addr
+ TO_ADDR (s
->size
);
5079 print_wild_statement (lang_wild_statement_type
*w
,
5080 lang_output_section_statement_type
*os
)
5082 struct wildcard_list
*sec
;
5086 if (w
->exclude_name_list
)
5089 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
5090 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5091 minfo (" %s", tmp
->name
);
5095 if (w
->filenames_sorted
)
5096 minfo ("SORT_BY_NAME(");
5097 if (w
->filename
!= NULL
)
5098 minfo ("%s", w
->filename
);
5101 if (w
->filenames_sorted
)
5105 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
5107 int closing_paren
= 0;
5109 switch (sec
->spec
.sorted
)
5115 minfo ("SORT_BY_NAME(");
5120 minfo ("SORT_BY_ALIGNMENT(");
5124 case by_name_alignment
:
5125 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
5129 case by_alignment_name
:
5130 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
5135 minfo ("SORT_NONE(");
5139 case by_init_priority
:
5140 minfo ("SORT_BY_INIT_PRIORITY(");
5145 if (sec
->spec
.exclude_name_list
!= NULL
)
5148 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
5149 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5150 minfo (" %s", tmp
->name
);
5153 if (sec
->spec
.name
!= NULL
)
5154 minfo ("%s", sec
->spec
.name
);
5157 for (;closing_paren
> 0; closing_paren
--)
5166 print_statement_list (w
->children
.head
, os
);
5169 /* Print a group statement. */
5172 print_group (lang_group_statement_type
*s
,
5173 lang_output_section_statement_type
*os
)
5175 fprintf (config
.map_file
, "START GROUP\n");
5176 print_statement_list (s
->children
.head
, os
);
5177 fprintf (config
.map_file
, "END GROUP\n");
5180 /* Print the list of statements in S.
5181 This can be called for any statement type. */
5184 print_statement_list (lang_statement_union_type
*s
,
5185 lang_output_section_statement_type
*os
)
5189 print_statement (s
, os
);
5194 /* Print the first statement in statement list S.
5195 This can be called for any statement type. */
5198 print_statement (lang_statement_union_type
*s
,
5199 lang_output_section_statement_type
*os
)
5201 switch (s
->header
.type
)
5204 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
5207 case lang_constructors_statement_enum
:
5208 if (constructor_list
.head
!= NULL
)
5210 if (constructors_sorted
)
5211 minfo (" SORT (CONSTRUCTORS)\n");
5213 minfo (" CONSTRUCTORS\n");
5214 print_statement_list (constructor_list
.head
, os
);
5217 case lang_wild_statement_enum
:
5218 print_wild_statement (&s
->wild_statement
, os
);
5220 case lang_address_statement_enum
:
5221 print_address_statement (&s
->address_statement
);
5223 case lang_object_symbols_statement_enum
:
5224 minfo (" CREATE_OBJECT_SYMBOLS\n");
5226 case lang_fill_statement_enum
:
5227 print_fill_statement (&s
->fill_statement
);
5229 case lang_data_statement_enum
:
5230 print_data_statement (&s
->data_statement
);
5232 case lang_reloc_statement_enum
:
5233 print_reloc_statement (&s
->reloc_statement
);
5235 case lang_input_section_enum
:
5236 print_input_section (s
->input_section
.section
, false);
5238 case lang_padding_statement_enum
:
5239 print_padding_statement (&s
->padding_statement
);
5241 case lang_output_section_statement_enum
:
5242 print_output_section_statement (&s
->output_section_statement
);
5244 case lang_assignment_statement_enum
:
5245 print_assignment (&s
->assignment_statement
, os
);
5247 case lang_target_statement_enum
:
5248 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
5250 case lang_output_statement_enum
:
5251 minfo ("OUTPUT(%s", s
->output_statement
.name
);
5252 if (output_target
!= NULL
)
5253 minfo (" %s", output_target
);
5256 case lang_input_statement_enum
:
5257 print_input_statement (&s
->input_statement
);
5259 case lang_group_statement_enum
:
5260 print_group (&s
->group_statement
, os
);
5262 case lang_insert_statement_enum
:
5263 minfo ("INSERT %s %s\n",
5264 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
5265 s
->insert_statement
.where
);
5271 print_statements (void)
5273 print_statement_list (statement_list
.head
, abs_output_section
);
5276 /* Print the first N statements in statement list S to STDERR.
5277 If N == 0, nothing is printed.
5278 If N < 0, the entire list is printed.
5279 Intended to be called from GDB. */
5282 dprint_statement (lang_statement_union_type
*s
, int n
)
5284 FILE *map_save
= config
.map_file
;
5286 config
.map_file
= stderr
;
5289 print_statement_list (s
, abs_output_section
);
5292 while (s
&& --n
>= 0)
5294 print_statement (s
, abs_output_section
);
5299 config
.map_file
= map_save
;
5303 insert_pad (lang_statement_union_type
**ptr
,
5305 bfd_size_type alignment_needed
,
5306 asection
*output_section
,
5309 static fill_type zero_fill
;
5310 lang_statement_union_type
*pad
= NULL
;
5312 if (ptr
!= &statement_list
.head
)
5313 pad
= ((lang_statement_union_type
*)
5314 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
5316 && pad
->header
.type
== lang_padding_statement_enum
5317 && pad
->padding_statement
.output_section
== output_section
)
5319 /* Use the existing pad statement. */
5321 else if ((pad
= *ptr
) != NULL
5322 && pad
->header
.type
== lang_padding_statement_enum
5323 && pad
->padding_statement
.output_section
== output_section
)
5325 /* Use the existing pad statement. */
5329 /* Make a new padding statement, linked into existing chain. */
5330 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
5331 pad
->header
.next
= *ptr
;
5333 pad
->header
.type
= lang_padding_statement_enum
;
5334 pad
->padding_statement
.output_section
= output_section
;
5337 pad
->padding_statement
.fill
= fill
;
5339 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
5340 pad
->padding_statement
.size
= alignment_needed
;
5341 if (!(output_section
->flags
& SEC_FIXED_SIZE
))
5342 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
5343 - output_section
->vma
);
5346 /* Work out how much this section will move the dot point. */
5350 (lang_statement_union_type
**this_ptr
,
5351 lang_output_section_statement_type
*output_section_statement
,
5356 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
5357 asection
*i
= is
->section
;
5358 asection
*o
= output_section_statement
->bfd_section
;
5361 if (link_info
.non_contiguous_regions
)
5363 /* If the input section I has already been successfully assigned
5364 to an output section other than O, don't bother with it and
5365 let the caller remove it from the list. Keep processing in
5366 case we have already handled O, because the repeated passes
5367 have reinitialized its size. */
5368 if (i
->already_assigned
&& i
->already_assigned
!= o
)
5375 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
5376 i
->output_offset
= i
->vma
- o
->vma
;
5377 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
5378 || output_section_statement
->ignored
)
5379 i
->output_offset
= dot
- o
->vma
;
5382 bfd_size_type alignment_needed
;
5384 /* Align this section first to the input sections requirement,
5385 then to the output section's requirement. If this alignment
5386 is greater than any seen before, then record it too. Perform
5387 the alignment by inserting a magic 'padding' statement. */
5389 if (output_section_statement
->subsection_alignment
!= NULL
)
5391 = exp_get_power (output_section_statement
->subsection_alignment
,
5392 "subsection alignment");
5394 if (o
->alignment_power
< i
->alignment_power
)
5395 o
->alignment_power
= i
->alignment_power
;
5397 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
5399 if (alignment_needed
!= 0)
5401 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
5402 dot
+= alignment_needed
;
5405 if (link_info
.non_contiguous_regions
)
5407 /* If I would overflow O, let the caller remove I from the
5409 if (output_section_statement
->region
)
5411 bfd_vma end
= output_section_statement
->region
->origin
5412 + output_section_statement
->region
->length
;
5414 if (dot
+ TO_ADDR (i
->size
) > end
)
5416 if (i
->flags
& SEC_LINKER_CREATED
)
5417 einfo (_("%F%P: Output section '%s' not large enough for the "
5418 "linker-created stubs section '%s'.\n"),
5419 i
->output_section
->name
, i
->name
);
5421 if (i
->rawsize
&& i
->rawsize
!= i
->size
)
5422 einfo (_("%F%P: Relaxation not supported with "
5423 "--enable-non-contiguous-regions (section '%s' "
5424 "would overflow '%s' after it changed size).\n"),
5425 i
->name
, i
->output_section
->name
);
5429 i
->output_section
= NULL
;
5435 /* Remember where in the output section this input section goes. */
5436 i
->output_offset
= dot
- o
->vma
;
5438 /* Mark how big the output section must be to contain this now. */
5439 dot
+= TO_ADDR (i
->size
);
5440 if (!(o
->flags
& SEC_FIXED_SIZE
))
5441 o
->size
= TO_SIZE (dot
- o
->vma
);
5443 if (link_info
.non_contiguous_regions
)
5445 /* Record that I was successfully assigned to O, and update
5446 its actual output section too. */
5447 i
->already_assigned
= o
;
5448 i
->output_section
= o
;
5462 sort_sections_by_lma (const void *arg1
, const void *arg2
)
5464 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5465 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5467 if (sec1
->lma
< sec2
->lma
)
5469 else if (sec1
->lma
> sec2
->lma
)
5471 else if (sec1
->id
< sec2
->id
)
5473 else if (sec1
->id
> sec2
->id
)
5480 sort_sections_by_vma (const void *arg1
, const void *arg2
)
5482 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5483 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5485 if (sec1
->vma
< sec2
->vma
)
5487 else if (sec1
->vma
> sec2
->vma
)
5489 else if (sec1
->id
< sec2
->id
)
5491 else if (sec1
->id
> sec2
->id
)
5497 #define IS_TBSS(s) \
5498 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
5500 #define IGNORE_SECTION(s) \
5501 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
5503 /* Check to see if any allocated sections overlap with other allocated
5504 sections. This can happen if a linker script specifies the output
5505 section addresses of the two sections. Also check whether any memory
5506 region has overflowed. */
5509 lang_check_section_addresses (void)
5512 struct check_sec
*sections
;
5517 bfd_vma p_start
= 0;
5519 lang_memory_region_type
*m
;
5522 /* Detect address space overflow on allocated sections. */
5523 addr_mask
= ((bfd_vma
) 1 <<
5524 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
5525 addr_mask
= (addr_mask
<< 1) + 1;
5526 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5527 if ((s
->flags
& SEC_ALLOC
) != 0)
5529 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
5530 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
5531 einfo (_("%X%P: section %s VMA wraps around address space\n"),
5535 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
5536 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
5537 einfo (_("%X%P: section %s LMA wraps around address space\n"),
5542 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
5545 count
= bfd_count_sections (link_info
.output_bfd
);
5546 sections
= XNEWVEC (struct check_sec
, count
);
5548 /* Scan all sections in the output list. */
5550 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5552 if (IGNORE_SECTION (s
)
5556 sections
[count
].sec
= s
;
5557 sections
[count
].warned
= false;
5567 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
5569 /* First check section LMAs. There should be no overlap of LMAs on
5570 loadable sections, even with overlays. */
5571 for (p
= NULL
, i
= 0; i
< count
; i
++)
5573 s
= sections
[i
].sec
;
5575 if ((s
->flags
& SEC_LOAD
) != 0)
5578 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5580 /* Look for an overlap. We have sorted sections by lma, so
5581 we know that s_start >= p_start. Besides the obvious
5582 case of overlap when the current section starts before
5583 the previous one ends, we also must have overlap if the
5584 previous section wraps around the address space. */
5586 && (s_start
<= p_end
5587 || p_end
< p_start
))
5589 einfo (_("%X%P: section %s LMA [%V,%V]"
5590 " overlaps section %s LMA [%V,%V]\n"),
5591 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5592 sections
[i
].warned
= true;
5600 /* If any non-zero size allocated section (excluding tbss) starts at
5601 exactly the same VMA as another such section, then we have
5602 overlays. Overlays generated by the OVERLAY keyword will have
5603 this property. It is possible to intentionally generate overlays
5604 that fail this test, but it would be unusual. */
5605 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
5607 p_start
= sections
[0].sec
->vma
;
5608 for (i
= 1; i
< count
; i
++)
5610 s_start
= sections
[i
].sec
->vma
;
5611 if (p_start
== s_start
)
5619 /* Now check section VMAs if no overlays were detected. */
5622 for (p
= NULL
, i
= 0; i
< count
; i
++)
5624 s
= sections
[i
].sec
;
5627 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5630 && !sections
[i
].warned
5631 && (s_start
<= p_end
5632 || p_end
< p_start
))
5633 einfo (_("%X%P: section %s VMA [%V,%V]"
5634 " overlaps section %s VMA [%V,%V]\n"),
5635 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5644 /* If any memory region has overflowed, report by how much.
5645 We do not issue this diagnostic for regions that had sections
5646 explicitly placed outside their bounds; os_region_check's
5647 diagnostics are adequate for that case.
5649 FIXME: It is conceivable that m->current - (m->origin + m->length)
5650 might overflow a 32-bit integer. There is, alas, no way to print
5651 a bfd_vma quantity in decimal. */
5652 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
5653 if (m
->had_full_message
)
5655 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
5656 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
5657 "%X%P: region `%s' overflowed by %lu bytes\n",
5659 m
->name_list
.name
, over
);
5663 /* Make sure the new address is within the region. We explicitly permit the
5664 current address to be at the exact end of the region when the address is
5665 non-zero, in case the region is at the end of addressable memory and the
5666 calculation wraps around. */
5669 os_region_check (lang_output_section_statement_type
*os
,
5670 lang_memory_region_type
*region
,
5674 if ((region
->current
< region
->origin
5675 || (region
->current
- region
->origin
> region
->length
))
5676 && ((region
->current
!= region
->origin
+ region
->length
)
5681 einfo (_("%X%P: address 0x%v of %pB section `%s'"
5682 " is not within region `%s'\n"),
5684 os
->bfd_section
->owner
,
5685 os
->bfd_section
->name
,
5686 region
->name_list
.name
);
5688 else if (!region
->had_full_message
)
5690 region
->had_full_message
= true;
5692 einfo (_("%X%P: %pB section `%s' will not fit in region `%s'\n"),
5693 os
->bfd_section
->owner
,
5694 os
->bfd_section
->name
,
5695 region
->name_list
.name
);
5701 ldlang_check_relro_region (lang_statement_union_type
*s
)
5703 seg_align_type
*seg
= &expld
.dataseg
;
5705 if (seg
->relro
== exp_seg_relro_start
)
5707 if (!seg
->relro_start_stat
)
5708 seg
->relro_start_stat
= s
;
5711 ASSERT (seg
->relro_start_stat
== s
);
5714 else if (seg
->relro
== exp_seg_relro_end
)
5716 if (!seg
->relro_end_stat
)
5717 seg
->relro_end_stat
= s
;
5720 ASSERT (seg
->relro_end_stat
== s
);
5725 /* Set the sizes for all the output sections. */
5728 lang_size_sections_1
5729 (lang_statement_union_type
**prev
,
5730 lang_output_section_statement_type
*output_section_statement
,
5736 lang_statement_union_type
*s
;
5737 lang_statement_union_type
*prev_s
= NULL
;
5738 bool removed_prev_s
= false;
5740 /* Size up the sections from their constituent parts. */
5741 for (s
= *prev
; s
!= NULL
; prev_s
= s
, s
= s
->header
.next
)
5743 bool removed
= false;
5745 switch (s
->header
.type
)
5747 case lang_output_section_statement_enum
:
5749 bfd_vma newdot
, after
, dotdelta
;
5750 lang_output_section_statement_type
*os
;
5751 lang_memory_region_type
*r
;
5752 int section_alignment
= 0;
5754 os
= &s
->output_section_statement
;
5755 init_opb (os
->bfd_section
);
5756 if (os
->constraint
== -1)
5759 /* FIXME: We shouldn't need to zero section vmas for ld -r
5760 here, in lang_insert_orphan, or in the default linker scripts.
5761 This is covering for coff backend linker bugs. See PR6945. */
5762 if (os
->addr_tree
== NULL
5763 && bfd_link_relocatable (&link_info
)
5764 && (bfd_get_flavour (link_info
.output_bfd
)
5765 == bfd_target_coff_flavour
))
5766 os
->addr_tree
= exp_intop (0);
5767 if (os
->addr_tree
!= NULL
)
5769 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5771 if (expld
.result
.valid_p
)
5773 dot
= expld
.result
.value
;
5774 if (expld
.result
.section
!= NULL
)
5775 dot
+= expld
.result
.section
->vma
;
5777 else if (expld
.phase
!= lang_mark_phase_enum
)
5778 einfo (_("%F%P:%pS: non constant or forward reference"
5779 " address expression for section %s\n"),
5780 os
->addr_tree
, os
->name
);
5783 if (os
->bfd_section
== NULL
)
5784 /* This section was removed or never actually created. */
5787 /* If this is a COFF shared library section, use the size and
5788 address from the input section. FIXME: This is COFF
5789 specific; it would be cleaner if there were some other way
5790 to do this, but nothing simple comes to mind. */
5791 if (((bfd_get_flavour (link_info
.output_bfd
)
5792 == bfd_target_ecoff_flavour
)
5793 || (bfd_get_flavour (link_info
.output_bfd
)
5794 == bfd_target_coff_flavour
))
5795 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5799 if (os
->children
.head
== NULL
5800 || os
->children
.head
->header
.next
!= NULL
5801 || (os
->children
.head
->header
.type
5802 != lang_input_section_enum
))
5803 einfo (_("%X%P: internal error on COFF shared library"
5804 " section %s\n"), os
->name
);
5806 input
= os
->children
.head
->input_section
.section
;
5807 bfd_set_section_vma (os
->bfd_section
,
5808 bfd_section_vma (input
));
5809 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5810 os
->bfd_section
->size
= input
->size
;
5816 if (bfd_is_abs_section (os
->bfd_section
))
5818 /* No matter what happens, an abs section starts at zero. */
5819 ASSERT (os
->bfd_section
->vma
== 0);
5823 if (os
->addr_tree
== NULL
)
5825 /* No address specified for this section, get one
5826 from the region specification. */
5827 if (os
->region
== NULL
5828 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5829 && os
->region
->name_list
.name
[0] == '*'
5830 && strcmp (os
->region
->name_list
.name
,
5831 DEFAULT_MEMORY_REGION
) == 0))
5833 os
->region
= lang_memory_default (os
->bfd_section
);
5836 /* If a loadable section is using the default memory
5837 region, and some non default memory regions were
5838 defined, issue an error message. */
5840 && !IGNORE_SECTION (os
->bfd_section
)
5841 && !bfd_link_relocatable (&link_info
)
5843 && strcmp (os
->region
->name_list
.name
,
5844 DEFAULT_MEMORY_REGION
) == 0
5845 && lang_memory_region_list
!= NULL
5846 && (strcmp (lang_memory_region_list
->name_list
.name
,
5847 DEFAULT_MEMORY_REGION
) != 0
5848 || lang_memory_region_list
->next
!= NULL
)
5849 && lang_sizing_iteration
== 1)
5851 /* By default this is an error rather than just a
5852 warning because if we allocate the section to the
5853 default memory region we can end up creating an
5854 excessively large binary, or even seg faulting when
5855 attempting to perform a negative seek. See
5856 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5857 for an example of this. This behaviour can be
5858 overridden by the using the --no-check-sections
5860 if (command_line
.check_section_addresses
)
5861 einfo (_("%F%P: error: no memory region specified"
5862 " for loadable section `%s'\n"),
5863 bfd_section_name (os
->bfd_section
));
5865 einfo (_("%P: warning: no memory region specified"
5866 " for loadable section `%s'\n"),
5867 bfd_section_name (os
->bfd_section
));
5870 newdot
= os
->region
->current
;
5871 section_alignment
= os
->bfd_section
->alignment_power
;
5874 section_alignment
= exp_get_power (os
->section_alignment
,
5875 "section alignment");
5877 /* Align to what the section needs. */
5878 if (section_alignment
> 0)
5880 bfd_vma savedot
= newdot
;
5883 newdot
= align_power (newdot
, section_alignment
);
5884 dotdelta
= newdot
- savedot
;
5886 if (lang_sizing_iteration
== 1)
5888 else if (lang_sizing_iteration
> 1)
5890 /* Only report adjustments that would change
5891 alignment from what we have already reported. */
5892 diff
= newdot
- os
->bfd_section
->vma
;
5893 if (!(diff
& (((bfd_vma
) 1 << section_alignment
) - 1)))
5897 && (config
.warn_section_align
5898 || os
->addr_tree
!= NULL
))
5899 einfo (_("%P: warning: "
5900 "start of section %s changed by %ld\n"),
5901 os
->name
, (long) diff
);
5904 bfd_set_section_vma (os
->bfd_section
, newdot
);
5906 os
->bfd_section
->output_offset
= 0;
5909 lang_size_sections_1 (&os
->children
.head
, os
,
5910 os
->fill
, newdot
, relax
, check_regions
);
5912 os
->processed_vma
= true;
5914 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5915 /* Except for some special linker created sections,
5916 no output section should change from zero size
5917 after strip_excluded_output_sections. A non-zero
5918 size on an ignored section indicates that some
5919 input section was not sized early enough. */
5920 ASSERT (os
->bfd_section
->size
== 0);
5923 dot
= os
->bfd_section
->vma
;
5925 /* Put the section within the requested block size, or
5926 align at the block boundary. */
5928 + TO_ADDR (os
->bfd_section
->size
)
5929 + os
->block_value
- 1)
5930 & - (bfd_vma
) os
->block_value
);
5932 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5933 os
->bfd_section
->size
= TO_SIZE (after
5934 - os
->bfd_section
->vma
);
5937 /* Set section lma. */
5940 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, false);
5944 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5945 os
->bfd_section
->lma
= lma
;
5947 else if (os
->lma_region
!= NULL
)
5949 bfd_vma lma
= os
->lma_region
->current
;
5951 if (os
->align_lma_with_input
)
5955 /* When LMA_REGION is the same as REGION, align the LMA
5956 as we did for the VMA, possibly including alignment
5957 from the bfd section. If a different region, then
5958 only align according to the value in the output
5960 if (os
->lma_region
!= os
->region
)
5961 section_alignment
= exp_get_power (os
->section_alignment
,
5962 "section alignment");
5963 if (section_alignment
> 0)
5964 lma
= align_power (lma
, section_alignment
);
5966 os
->bfd_section
->lma
= lma
;
5968 else if (r
->last_os
!= NULL
5969 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5974 last
= r
->last_os
->output_section_statement
.bfd_section
;
5976 /* A backwards move of dot should be accompanied by
5977 an explicit assignment to the section LMA (ie.
5978 os->load_base set) because backwards moves can
5979 create overlapping LMAs. */
5981 && os
->bfd_section
->size
!= 0
5982 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5984 /* If dot moved backwards then leave lma equal to
5985 vma. This is the old default lma, which might
5986 just happen to work when the backwards move is
5987 sufficiently large. Nag if this changes anything,
5988 so people can fix their linker scripts. */
5990 if (last
->vma
!= last
->lma
)
5991 einfo (_("%P: warning: dot moved backwards "
5992 "before `%s'\n"), os
->name
);
5996 /* If this is an overlay, set the current lma to that
5997 at the end of the previous section. */
5998 if (os
->sectype
== overlay_section
)
5999 lma
= last
->lma
+ TO_ADDR (last
->size
);
6001 /* Otherwise, keep the same lma to vma relationship
6002 as the previous section. */
6004 lma
= os
->bfd_section
->vma
+ last
->lma
- last
->vma
;
6006 if (section_alignment
> 0)
6007 lma
= align_power (lma
, section_alignment
);
6008 os
->bfd_section
->lma
= lma
;
6011 os
->processed_lma
= true;
6013 /* Keep track of normal sections using the default
6014 lma region. We use this to set the lma for
6015 following sections. Overlays or other linker
6016 script assignment to lma might mean that the
6017 default lma == vma is incorrect.
6018 To avoid warnings about dot moving backwards when using
6019 -Ttext, don't start tracking sections until we find one
6020 of non-zero size or with lma set differently to vma.
6021 Do this tracking before we short-cut the loop so that we
6022 track changes for the case where the section size is zero,
6023 but the lma is set differently to the vma. This is
6024 important, if an orphan section is placed after an
6025 otherwise empty output section that has an explicit lma
6026 set, we want that lma reflected in the orphans lma. */
6027 if (((!IGNORE_SECTION (os
->bfd_section
)
6028 && (os
->bfd_section
->size
!= 0
6029 || (r
->last_os
== NULL
6030 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
6031 || (r
->last_os
!= NULL
6032 && dot
>= (r
->last_os
->output_section_statement
6033 .bfd_section
->vma
))))
6034 || os
->sectype
== first_overlay_section
)
6035 && os
->lma_region
== NULL
6036 && !bfd_link_relocatable (&link_info
))
6039 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
6042 /* .tbss sections effectively have zero size. */
6043 if (!IS_TBSS (os
->bfd_section
)
6044 || bfd_link_relocatable (&link_info
))
6045 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
6050 if (os
->update_dot_tree
!= 0)
6051 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
6053 /* Update dot in the region ?
6054 We only do this if the section is going to be allocated,
6055 since unallocated sections do not contribute to the region's
6056 overall size in memory. */
6057 if (os
->region
!= NULL
6058 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
6060 os
->region
->current
= dot
;
6063 /* Make sure the new address is within the region. */
6064 os_region_check (os
, os
->region
, os
->addr_tree
,
6065 os
->bfd_section
->vma
);
6067 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
6068 && ((os
->bfd_section
->flags
& SEC_LOAD
)
6069 || os
->align_lma_with_input
))
6071 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
6074 os_region_check (os
, os
->lma_region
, NULL
,
6075 os
->bfd_section
->lma
);
6081 case lang_constructors_statement_enum
:
6082 dot
= lang_size_sections_1 (&constructor_list
.head
,
6083 output_section_statement
,
6084 fill
, dot
, relax
, check_regions
);
6087 case lang_data_statement_enum
:
6089 unsigned int size
= 0;
6091 s
->data_statement
.output_offset
=
6092 dot
- output_section_statement
->bfd_section
->vma
;
6093 s
->data_statement
.output_section
=
6094 output_section_statement
->bfd_section
;
6096 /* We might refer to provided symbols in the expression, and
6097 need to mark them as needed. */
6098 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6100 switch (s
->data_statement
.type
)
6118 if (size
< TO_SIZE ((unsigned) 1))
6119 size
= TO_SIZE ((unsigned) 1);
6120 dot
+= TO_ADDR (size
);
6121 if (!(output_section_statement
->bfd_section
->flags
6123 output_section_statement
->bfd_section
->size
6124 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6129 case lang_reloc_statement_enum
:
6133 s
->reloc_statement
.output_offset
=
6134 dot
- output_section_statement
->bfd_section
->vma
;
6135 s
->reloc_statement
.output_section
=
6136 output_section_statement
->bfd_section
;
6137 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
6138 dot
+= TO_ADDR (size
);
6139 if (!(output_section_statement
->bfd_section
->flags
6141 output_section_statement
->bfd_section
->size
6142 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6146 case lang_wild_statement_enum
:
6147 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
6148 output_section_statement
,
6149 fill
, dot
, relax
, check_regions
);
6152 case lang_object_symbols_statement_enum
:
6153 link_info
.create_object_symbols_section
6154 = output_section_statement
->bfd_section
;
6155 output_section_statement
->bfd_section
->flags
|= SEC_KEEP
;
6158 case lang_output_statement_enum
:
6159 case lang_target_statement_enum
:
6162 case lang_input_section_enum
:
6166 i
= s
->input_section
.section
;
6171 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
6172 einfo (_("%F%P: can't relax section: %E\n"));
6176 dot
= size_input_section (prev
, output_section_statement
,
6177 fill
, &removed
, dot
);
6181 case lang_input_statement_enum
:
6184 case lang_fill_statement_enum
:
6185 s
->fill_statement
.output_section
=
6186 output_section_statement
->bfd_section
;
6188 fill
= s
->fill_statement
.fill
;
6191 case lang_assignment_statement_enum
:
6193 bfd_vma newdot
= dot
;
6194 etree_type
*tree
= s
->assignment_statement
.exp
;
6196 expld
.dataseg
.relro
= exp_seg_relro_none
;
6198 exp_fold_tree (tree
,
6199 output_section_statement
->bfd_section
,
6202 ldlang_check_relro_region (s
);
6204 expld
.dataseg
.relro
= exp_seg_relro_none
;
6206 /* This symbol may be relative to this section. */
6207 if ((tree
->type
.node_class
== etree_provided
6208 || tree
->type
.node_class
== etree_assign
)
6209 && (tree
->assign
.dst
[0] != '.'
6210 || tree
->assign
.dst
[1] != '\0'))
6211 output_section_statement
->update_dot
= 1;
6213 if (!output_section_statement
->ignored
)
6215 if (output_section_statement
== abs_output_section
)
6217 /* If we don't have an output section, then just adjust
6218 the default memory address. */
6219 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
6220 false)->current
= newdot
;
6222 else if (newdot
!= dot
)
6224 /* Insert a pad after this statement. We can't
6225 put the pad before when relaxing, in case the
6226 assignment references dot. */
6227 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
6228 output_section_statement
->bfd_section
, dot
);
6230 /* Don't neuter the pad below when relaxing. */
6233 /* If dot is advanced, this implies that the section
6234 should have space allocated to it, unless the
6235 user has explicitly stated that the section
6236 should not be allocated. */
6237 if (output_section_statement
->sectype
!= noalloc_section
6238 && (output_section_statement
->sectype
!= noload_section
6239 || (bfd_get_flavour (link_info
.output_bfd
)
6240 == bfd_target_elf_flavour
)))
6241 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
6248 case lang_padding_statement_enum
:
6249 /* If this is the first time lang_size_sections is called,
6250 we won't have any padding statements. If this is the
6251 second or later passes when relaxing, we should allow
6252 padding to shrink. If padding is needed on this pass, it
6253 will be added back in. */
6254 s
->padding_statement
.size
= 0;
6256 /* Make sure output_offset is valid. If relaxation shrinks
6257 the section and this pad isn't needed, it's possible to
6258 have output_offset larger than the final size of the
6259 section. bfd_set_section_contents will complain even for
6260 a pad size of zero. */
6261 s
->padding_statement
.output_offset
6262 = dot
- output_section_statement
->bfd_section
->vma
;
6265 case lang_group_statement_enum
:
6266 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
6267 output_section_statement
,
6268 fill
, dot
, relax
, check_regions
);
6271 case lang_insert_statement_enum
:
6274 /* We can only get here when relaxing is turned on. */
6275 case lang_address_statement_enum
:
6283 /* If an input section doesn't fit in the current output
6284 section, remove it from the list. Handle the case where we
6285 have to remove an input_section statement here: there is a
6286 special case to remove the first element of the list. */
6287 if (link_info
.non_contiguous_regions
&& removed
)
6289 /* If we removed the first element during the previous
6290 iteration, override the loop assignment of prev_s. */
6296 /* If there was a real previous input section, just skip
6298 prev_s
->header
.next
=s
->header
.next
;
6300 removed_prev_s
= false;
6304 /* Remove the first input section of the list. */
6305 *prev
= s
->header
.next
;
6306 removed_prev_s
= true;
6309 /* Move to next element, unless we removed the head of the
6311 if (!removed_prev_s
)
6312 prev
= &s
->header
.next
;
6316 prev
= &s
->header
.next
;
6317 removed_prev_s
= false;
6323 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
6324 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
6325 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
6326 segments. We are allowed an opportunity to override this decision. */
6329 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
6330 bfd
*abfd ATTRIBUTE_UNUSED
,
6331 asection
*current_section
,
6332 asection
*previous_section
,
6335 lang_output_section_statement_type
*cur
;
6336 lang_output_section_statement_type
*prev
;
6338 /* The checks below are only necessary when the BFD library has decided
6339 that the two sections ought to be placed into the same segment. */
6343 /* Paranoia checks. */
6344 if (current_section
== NULL
|| previous_section
== NULL
)
6347 /* If this flag is set, the target never wants code and non-code
6348 sections comingled in the same segment. */
6349 if (config
.separate_code
6350 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
6353 /* Find the memory regions associated with the two sections.
6354 We call lang_output_section_find() here rather than scanning the list
6355 of output sections looking for a matching section pointer because if
6356 we have a large number of sections then a hash lookup is faster. */
6357 cur
= lang_output_section_find (current_section
->name
);
6358 prev
= lang_output_section_find (previous_section
->name
);
6360 /* More paranoia. */
6361 if (cur
== NULL
|| prev
== NULL
)
6364 /* If the regions are different then force the sections to live in
6365 different segments. See the email thread starting at the following
6366 URL for the reasons why this is necessary:
6367 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
6368 return cur
->region
!= prev
->region
;
6372 one_lang_size_sections_pass (bool *relax
, bool check_regions
)
6374 lang_statement_iteration
++;
6375 if (expld
.phase
!= lang_mark_phase_enum
)
6376 lang_sizing_iteration
++;
6377 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
6378 0, 0, relax
, check_regions
);
6382 lang_size_segment (void)
6384 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
6385 a page could be saved in the data segment. */
6386 seg_align_type
*seg
= &expld
.dataseg
;
6387 bfd_vma first
, last
;
6389 first
= -seg
->base
& (seg
->commonpagesize
- 1);
6390 last
= seg
->end
& (seg
->commonpagesize
- 1);
6392 && ((seg
->base
& ~(seg
->commonpagesize
- 1))
6393 != (seg
->end
& ~(seg
->commonpagesize
- 1)))
6394 && first
+ last
<= seg
->commonpagesize
)
6396 seg
->phase
= exp_seg_adjust
;
6400 seg
->phase
= exp_seg_done
;
6405 lang_size_relro_segment_1 (void)
6407 seg_align_type
*seg
= &expld
.dataseg
;
6408 bfd_vma relro_end
, desired_end
;
6411 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
6412 relro_end
= (seg
->relro_end
+ seg
->relropagesize
- 1) & -seg
->relropagesize
;
6414 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
6415 desired_end
= relro_end
- seg
->relro_offset
;
6417 /* For sections in the relro segment.. */
6418 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
6419 if ((sec
->flags
& SEC_ALLOC
) != 0
6420 && sec
->vma
>= seg
->base
6421 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
6423 /* Where do we want to put this section so that it ends as
6425 bfd_vma start
, end
, bump
;
6427 end
= start
= sec
->vma
;
6429 end
+= TO_ADDR (sec
->size
);
6430 bump
= desired_end
- end
;
6431 /* We'd like to increase START by BUMP, but we must heed
6432 alignment so the increase might be less than optimum. */
6434 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
6435 /* This is now the desired end for the previous section. */
6436 desired_end
= start
;
6439 seg
->phase
= exp_seg_relro_adjust
;
6440 ASSERT (desired_end
>= seg
->base
);
6441 seg
->base
= desired_end
;
6446 lang_size_relro_segment (bool *relax
, bool check_regions
)
6448 bool do_reset
= false;
6450 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6452 bfd_vma data_initial_base
= expld
.dataseg
.base
;
6453 bfd_vma data_relro_end
= lang_size_relro_segment_1 ();
6455 lang_reset_memory_regions ();
6456 one_lang_size_sections_pass (relax
, check_regions
);
6458 /* Assignments to dot, or to output section address in a user
6459 script have increased padding over the original. Revert. */
6460 if (expld
.dataseg
.relro_end
> data_relro_end
)
6462 expld
.dataseg
.base
= data_initial_base
;
6466 else if (lang_size_segment ())
6473 lang_size_sections (bool *relax
, bool check_regions
)
6475 expld
.phase
= lang_allocating_phase_enum
;
6476 expld
.dataseg
.phase
= exp_seg_none
;
6478 one_lang_size_sections_pass (relax
, check_regions
);
6480 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
6481 expld
.dataseg
.phase
= exp_seg_done
;
6483 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
6486 = lang_size_relro_segment (relax
, check_regions
);
6490 lang_reset_memory_regions ();
6491 one_lang_size_sections_pass (relax
, check_regions
);
6494 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6496 link_info
.relro_start
= expld
.dataseg
.base
;
6497 link_info
.relro_end
= expld
.dataseg
.relro_end
;
6502 static lang_output_section_statement_type
*current_section
;
6503 static lang_assignment_statement_type
*current_assign
;
6504 static bool prefer_next_section
;
6506 /* Worker function for lang_do_assignments. Recursiveness goes here. */
6509 lang_do_assignments_1 (lang_statement_union_type
*s
,
6510 lang_output_section_statement_type
*current_os
,
6515 for (; s
!= NULL
; s
= s
->header
.next
)
6517 switch (s
->header
.type
)
6519 case lang_constructors_statement_enum
:
6520 dot
= lang_do_assignments_1 (constructor_list
.head
,
6521 current_os
, fill
, dot
, found_end
);
6524 case lang_output_section_statement_enum
:
6526 lang_output_section_statement_type
*os
;
6529 os
= &(s
->output_section_statement
);
6530 os
->after_end
= *found_end
;
6531 init_opb (os
->bfd_section
);
6533 if (os
->bfd_section
!= NULL
)
6535 if (!os
->ignored
&& (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
6537 current_section
= os
;
6538 prefer_next_section
= false;
6540 newdot
= os
->bfd_section
->vma
;
6542 newdot
= lang_do_assignments_1 (os
->children
.head
,
6543 os
, os
->fill
, newdot
, found_end
);
6546 if (os
->bfd_section
!= NULL
)
6548 newdot
= os
->bfd_section
->vma
;
6550 /* .tbss sections effectively have zero size. */
6551 if (!IS_TBSS (os
->bfd_section
)
6552 || bfd_link_relocatable (&link_info
))
6553 newdot
+= TO_ADDR (os
->bfd_section
->size
);
6555 if (os
->update_dot_tree
!= NULL
)
6556 exp_fold_tree (os
->update_dot_tree
,
6557 bfd_abs_section_ptr
, &newdot
);
6564 case lang_wild_statement_enum
:
6566 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
6567 current_os
, fill
, dot
, found_end
);
6570 case lang_object_symbols_statement_enum
:
6571 case lang_output_statement_enum
:
6572 case lang_target_statement_enum
:
6575 case lang_data_statement_enum
:
6576 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6577 if (expld
.result
.valid_p
)
6579 s
->data_statement
.value
= expld
.result
.value
;
6580 if (expld
.result
.section
!= NULL
)
6581 s
->data_statement
.value
+= expld
.result
.section
->vma
;
6583 else if (expld
.phase
== lang_final_phase_enum
)
6584 einfo (_("%F%P: invalid data statement\n"));
6587 switch (s
->data_statement
.type
)
6605 if (size
< TO_SIZE ((unsigned) 1))
6606 size
= TO_SIZE ((unsigned) 1);
6607 dot
+= TO_ADDR (size
);
6611 case lang_reloc_statement_enum
:
6612 exp_fold_tree (s
->reloc_statement
.addend_exp
,
6613 bfd_abs_section_ptr
, &dot
);
6614 if (expld
.result
.valid_p
)
6615 s
->reloc_statement
.addend_value
= expld
.result
.value
;
6616 else if (expld
.phase
== lang_final_phase_enum
)
6617 einfo (_("%F%P: invalid reloc statement\n"));
6618 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
6621 case lang_input_section_enum
:
6623 asection
*in
= s
->input_section
.section
;
6625 if ((in
->flags
& SEC_EXCLUDE
) == 0)
6626 dot
+= TO_ADDR (in
->size
);
6630 case lang_input_statement_enum
:
6633 case lang_fill_statement_enum
:
6634 fill
= s
->fill_statement
.fill
;
6637 case lang_assignment_statement_enum
:
6638 current_assign
= &s
->assignment_statement
;
6639 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
6641 const char *p
= current_assign
->exp
->assign
.dst
;
6643 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
6644 prefer_next_section
= true;
6648 if (strcmp (p
, "end") == 0)
6651 exp_fold_tree (s
->assignment_statement
.exp
,
6652 (current_os
->bfd_section
!= NULL
6653 ? current_os
->bfd_section
: bfd_und_section_ptr
),
6657 case lang_padding_statement_enum
:
6658 dot
+= TO_ADDR (s
->padding_statement
.size
);
6661 case lang_group_statement_enum
:
6662 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
6663 current_os
, fill
, dot
, found_end
);
6666 case lang_insert_statement_enum
:
6669 case lang_address_statement_enum
:
6681 lang_do_assignments (lang_phase_type phase
)
6683 bool found_end
= false;
6685 current_section
= NULL
;
6686 prefer_next_section
= false;
6687 expld
.phase
= phase
;
6688 lang_statement_iteration
++;
6689 lang_do_assignments_1 (statement_list
.head
,
6690 abs_output_section
, NULL
, 0, &found_end
);
6693 /* For an assignment statement outside of an output section statement,
6694 choose the best of neighbouring output sections to use for values
6698 section_for_dot (void)
6702 /* Assignments belong to the previous output section, unless there
6703 has been an assignment to "dot", in which case following
6704 assignments belong to the next output section. (The assumption
6705 is that an assignment to "dot" is setting up the address for the
6706 next output section.) Except that past the assignment to "_end"
6707 we always associate with the previous section. This exception is
6708 for targets like SH that define an alloc .stack or other
6709 weirdness after non-alloc sections. */
6710 if (current_section
== NULL
|| prefer_next_section
)
6712 lang_statement_union_type
*stmt
;
6713 lang_output_section_statement_type
*os
;
6715 for (stmt
= (lang_statement_union_type
*) current_assign
;
6717 stmt
= stmt
->header
.next
)
6718 if (stmt
->header
.type
== lang_output_section_statement_enum
)
6721 os
= stmt
? &stmt
->output_section_statement
: NULL
;
6724 && (os
->bfd_section
== NULL
6725 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
6726 || bfd_section_removed_from_list (link_info
.output_bfd
,
6730 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
6733 s
= os
->bfd_section
;
6735 s
= link_info
.output_bfd
->section_last
;
6737 && ((s
->flags
& SEC_ALLOC
) == 0
6738 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6743 return bfd_abs_section_ptr
;
6747 s
= current_section
->bfd_section
;
6749 /* The section may have been stripped. */
6751 && ((s
->flags
& SEC_EXCLUDE
) != 0
6752 || (s
->flags
& SEC_ALLOC
) == 0
6753 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
6754 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
6757 s
= link_info
.output_bfd
->sections
;
6759 && ((s
->flags
& SEC_ALLOC
) == 0
6760 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6765 return bfd_abs_section_ptr
;
6768 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
6770 static struct bfd_link_hash_entry
**start_stop_syms
;
6771 static size_t start_stop_count
= 0;
6772 static size_t start_stop_alloc
= 0;
6774 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6775 to start_stop_syms. */
6778 lang_define_start_stop (const char *symbol
, asection
*sec
)
6780 struct bfd_link_hash_entry
*h
;
6782 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6785 if (start_stop_count
== start_stop_alloc
)
6787 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6789 = xrealloc (start_stop_syms
,
6790 start_stop_alloc
* sizeof (*start_stop_syms
));
6792 start_stop_syms
[start_stop_count
++] = h
;
6796 /* Check for input sections whose names match references to
6797 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6798 preliminary definitions. */
6801 lang_init_start_stop (void)
6805 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6807 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6808 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6811 const char *secname
= s
->name
;
6813 for (ps
= secname
; *ps
!= '\0'; ps
++)
6814 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6818 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6820 symbol
[0] = leading_char
;
6821 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6822 lang_define_start_stop (symbol
, s
);
6824 symbol
[1] = leading_char
;
6825 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6826 lang_define_start_stop (symbol
+ 1, s
);
6833 /* Iterate over start_stop_syms. */
6836 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6840 for (i
= 0; i
< start_stop_count
; ++i
)
6841 func (start_stop_syms
[i
]);
6844 /* __start and __stop symbols are only supposed to be defined by the
6845 linker for orphan sections, but we now extend that to sections that
6846 map to an output section of the same name. The symbols were
6847 defined early for --gc-sections, before we mapped input to output
6848 sections, so undo those that don't satisfy this rule. */
6851 undef_start_stop (struct bfd_link_hash_entry
*h
)
6853 if (h
->ldscript_def
)
6856 if (h
->u
.def
.section
->output_section
== NULL
6857 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6858 || strcmp (h
->u
.def
.section
->name
,
6859 h
->u
.def
.section
->output_section
->name
) != 0)
6861 asection
*sec
= bfd_get_section_by_name (link_info
.output_bfd
,
6862 h
->u
.def
.section
->name
);
6865 /* When there are more than one input sections with the same
6866 section name, SECNAME, linker picks the first one to define
6867 __start_SECNAME and __stop_SECNAME symbols. When the first
6868 input section is removed by comdat group, we need to check
6869 if there is still an output section with section name
6872 for (i
= sec
->map_head
.s
; i
!= NULL
; i
= i
->map_head
.s
)
6873 if (strcmp (h
->u
.def
.section
->name
, i
->name
) == 0)
6875 h
->u
.def
.section
= i
;
6879 h
->type
= bfd_link_hash_undefined
;
6880 h
->u
.undef
.abfd
= NULL
;
6881 if (is_elf_hash_table (link_info
.hash
))
6883 const struct elf_backend_data
*bed
;
6884 struct elf_link_hash_entry
*eh
= (struct elf_link_hash_entry
*) h
;
6885 unsigned int was_forced
= eh
->forced_local
;
6887 bed
= get_elf_backend_data (link_info
.output_bfd
);
6888 (*bed
->elf_backend_hide_symbol
) (&link_info
, eh
, true);
6889 if (!eh
->ref_regular_nonweak
)
6890 h
->type
= bfd_link_hash_undefweak
;
6891 eh
->def_regular
= 0;
6892 eh
->forced_local
= was_forced
;
6898 lang_undef_start_stop (void)
6900 foreach_start_stop (undef_start_stop
);
6903 /* Check for output sections whose names match references to
6904 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6905 preliminary definitions. */
6908 lang_init_startof_sizeof (void)
6912 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6914 const char *secname
= s
->name
;
6915 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6917 sprintf (symbol
, ".startof.%s", secname
);
6918 lang_define_start_stop (symbol
, s
);
6920 memcpy (symbol
+ 1, ".size", 5);
6921 lang_define_start_stop (symbol
+ 1, s
);
6926 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6929 set_start_stop (struct bfd_link_hash_entry
*h
)
6932 || h
->type
!= bfd_link_hash_defined
)
6935 if (h
->root
.string
[0] == '.')
6937 /* .startof. or .sizeof. symbol.
6938 .startof. already has final value. */
6939 if (h
->root
.string
[2] == 'i')
6942 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6943 h
->u
.def
.section
= bfd_abs_section_ptr
;
6948 /* __start or __stop symbol. */
6949 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6951 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6952 if (h
->root
.string
[4 + has_lead
] == 'o')
6955 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6961 lang_finalize_start_stop (void)
6963 foreach_start_stop (set_start_stop
);
6967 lang_symbol_tweaks (void)
6969 /* Give initial values for __start and __stop symbols, so that ELF
6970 gc_sections will keep sections referenced by these symbols. Must
6971 be done before lang_do_assignments. */
6972 if (config
.build_constructors
)
6973 lang_init_start_stop ();
6975 /* Make __ehdr_start hidden, and set def_regular even though it is
6976 likely undefined at this stage. For lang_check_relocs. */
6977 if (is_elf_hash_table (link_info
.hash
)
6978 && !bfd_link_relocatable (&link_info
))
6980 struct elf_link_hash_entry
*h
= (struct elf_link_hash_entry
*)
6981 bfd_link_hash_lookup (link_info
.hash
, "__ehdr_start",
6982 false, false, true);
6984 /* Only adjust the export class if the symbol was referenced
6985 and not defined, otherwise leave it alone. */
6987 && (h
->root
.type
== bfd_link_hash_new
6988 || h
->root
.type
== bfd_link_hash_undefined
6989 || h
->root
.type
== bfd_link_hash_undefweak
6990 || h
->root
.type
== bfd_link_hash_common
))
6992 const struct elf_backend_data
*bed
;
6993 bed
= get_elf_backend_data (link_info
.output_bfd
);
6994 (*bed
->elf_backend_hide_symbol
) (&link_info
, h
, true);
6995 if (ELF_ST_VISIBILITY (h
->other
) != STV_INTERNAL
)
6996 h
->other
= (h
->other
& ~ELF_ST_VISIBILITY (-1)) | STV_HIDDEN
;
6998 h
->root
.linker_def
= 1;
6999 h
->root
.rel_from_abs
= 1;
7007 struct bfd_link_hash_entry
*h
;
7010 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
7011 || bfd_link_dll (&link_info
))
7012 warn
= entry_from_cmdline
;
7016 /* Force the user to specify a root when generating a relocatable with
7017 --gc-sections, unless --gc-keep-exported was also given. */
7018 if (bfd_link_relocatable (&link_info
)
7019 && link_info
.gc_sections
7020 && !link_info
.gc_keep_exported
)
7022 struct bfd_sym_chain
*sym
;
7024 for (sym
= link_info
.gc_sym_list
; sym
!= NULL
; sym
= sym
->next
)
7026 h
= bfd_link_hash_lookup (link_info
.hash
, sym
->name
,
7027 false, false, false);
7029 && (h
->type
== bfd_link_hash_defined
7030 || h
->type
== bfd_link_hash_defweak
)
7031 && !bfd_is_const_section (h
->u
.def
.section
))
7035 einfo (_("%F%P: --gc-sections requires a defined symbol root "
7036 "specified by -e or -u\n"));
7039 if (entry_symbol
.name
== NULL
)
7041 /* No entry has been specified. Look for the default entry, but
7042 don't warn if we don't find it. */
7043 entry_symbol
.name
= entry_symbol_default
;
7047 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
7048 false, false, true);
7050 && (h
->type
== bfd_link_hash_defined
7051 || h
->type
== bfd_link_hash_defweak
)
7052 && h
->u
.def
.section
->output_section
!= NULL
)
7056 val
= (h
->u
.def
.value
7057 + bfd_section_vma (h
->u
.def
.section
->output_section
)
7058 + h
->u
.def
.section
->output_offset
);
7059 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
7060 einfo (_("%F%P: %s: can't set start address\n"), entry_symbol
.name
);
7067 /* We couldn't find the entry symbol. Try parsing it as a
7069 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
7072 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
7073 einfo (_("%F%P: can't set start address\n"));
7075 /* BZ 2004952: Only use the start of the entry section for executables. */
7076 else if bfd_link_executable (&link_info
)
7080 /* Can't find the entry symbol, and it's not a number. Use
7081 the first address in the text section. */
7082 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
7086 einfo (_("%P: warning: cannot find entry symbol %s;"
7087 " defaulting to %V\n"),
7089 bfd_section_vma (ts
));
7090 if (!bfd_set_start_address (link_info
.output_bfd
,
7091 bfd_section_vma (ts
)))
7092 einfo (_("%F%P: can't set start address\n"));
7097 einfo (_("%P: warning: cannot find entry symbol %s;"
7098 " not setting start address\n"),
7105 einfo (_("%P: warning: cannot find entry symbol %s;"
7106 " not setting start address\n"),
7112 /* This is a small function used when we want to ignore errors from
7116 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
7117 va_list ap ATTRIBUTE_UNUSED
)
7119 /* Don't do anything. */
7122 /* Check that the architecture of all the input files is compatible
7123 with the output file. Also call the backend to let it do any
7124 other checking that is needed. */
7129 lang_input_statement_type
*file
;
7131 const bfd_arch_info_type
*compatible
;
7133 for (file
= (void *) file_chain
.head
;
7137 #if BFD_SUPPORTS_PLUGINS
7138 /* Don't check format of files claimed by plugin. */
7139 if (file
->flags
.claimed
)
7141 #endif /* BFD_SUPPORTS_PLUGINS */
7142 input_bfd
= file
->the_bfd
;
7144 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
7145 command_line
.accept_unknown_input_arch
);
7147 /* In general it is not possible to perform a relocatable
7148 link between differing object formats when the input
7149 file has relocations, because the relocations in the
7150 input format may not have equivalent representations in
7151 the output format (and besides BFD does not translate
7152 relocs for other link purposes than a final link). */
7153 if (!file
->flags
.just_syms
7154 && (bfd_link_relocatable (&link_info
)
7155 || link_info
.emitrelocations
)
7156 && (compatible
== NULL
7157 || (bfd_get_flavour (input_bfd
)
7158 != bfd_get_flavour (link_info
.output_bfd
)))
7159 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
7161 einfo (_("%F%P: relocatable linking with relocations from"
7162 " format %s (%pB) to format %s (%pB) is not supported\n"),
7163 bfd_get_target (input_bfd
), input_bfd
,
7164 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
7165 /* einfo with %F exits. */
7168 if (compatible
== NULL
)
7170 if (command_line
.warn_mismatch
)
7171 einfo (_("%X%P: %s architecture of input file `%pB'"
7172 " is incompatible with %s output\n"),
7173 bfd_printable_name (input_bfd
), input_bfd
,
7174 bfd_printable_name (link_info
.output_bfd
));
7177 /* If the input bfd has no contents, it shouldn't set the
7178 private data of the output bfd. */
7179 else if (!file
->flags
.just_syms
7180 && ((input_bfd
->flags
& DYNAMIC
) != 0
7181 || bfd_count_sections (input_bfd
) != 0))
7183 bfd_error_handler_type pfn
= NULL
;
7185 /* If we aren't supposed to warn about mismatched input
7186 files, temporarily set the BFD error handler to a
7187 function which will do nothing. We still want to call
7188 bfd_merge_private_bfd_data, since it may set up
7189 information which is needed in the output file. */
7190 if (!command_line
.warn_mismatch
)
7191 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
7192 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
7194 if (command_line
.warn_mismatch
)
7195 einfo (_("%X%P: failed to merge target specific data"
7196 " of file %pB\n"), input_bfd
);
7198 if (!command_line
.warn_mismatch
)
7199 bfd_set_error_handler (pfn
);
7204 /* Look through all the global common symbols and attach them to the
7205 correct section. The -sort-common command line switch may be used
7206 to roughly sort the entries by alignment. */
7211 if (link_info
.inhibit_common_definition
)
7213 if (bfd_link_relocatable (&link_info
)
7214 && !command_line
.force_common_definition
)
7217 if (!config
.sort_common
)
7218 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
7223 if (config
.sort_common
== sort_descending
)
7225 for (power
= 4; power
> 0; power
--)
7226 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7229 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7233 for (power
= 0; power
<= 4; power
++)
7234 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7236 power
= (unsigned int) -1;
7237 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7242 /* Place one common symbol in the correct section. */
7245 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
7247 unsigned int power_of_two
;
7251 if (h
->type
!= bfd_link_hash_common
)
7255 power_of_two
= h
->u
.c
.p
->alignment_power
;
7257 if (config
.sort_common
== sort_descending
7258 && power_of_two
< *(unsigned int *) info
)
7260 else if (config
.sort_common
== sort_ascending
7261 && power_of_two
> *(unsigned int *) info
)
7264 section
= h
->u
.c
.p
->section
;
7265 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
7266 einfo (_("%F%P: could not define common symbol `%pT': %E\n"),
7269 if (config
.map_file
!= NULL
)
7271 static bool header_printed
;
7276 if (!header_printed
)
7278 minfo (_("\nAllocating common symbols\n"));
7279 minfo (_("Common symbol size file\n\n"));
7280 header_printed
= true;
7283 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
7284 DMGL_ANSI
| DMGL_PARAMS
);
7287 minfo ("%s", h
->root
.string
);
7288 len
= strlen (h
->root
.string
);
7293 len
= strlen (name
);
7309 sprintf (buf
, "%" PRIx64
, (uint64_t) size
);
7319 minfo ("%pB\n", section
->owner
);
7325 /* Handle a single orphan section S, placing the orphan into an appropriate
7326 output section. The effects of the --orphan-handling command line
7327 option are handled here. */
7330 ldlang_place_orphan (asection
*s
)
7332 if (config
.orphan_handling
== orphan_handling_discard
)
7334 lang_output_section_statement_type
*os
;
7335 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0, 1);
7336 if (os
->addr_tree
== NULL
7337 && (bfd_link_relocatable (&link_info
)
7338 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7339 os
->addr_tree
= exp_intop (0);
7340 lang_add_section (&os
->children
, s
, NULL
, NULL
, os
);
7344 lang_output_section_statement_type
*os
;
7345 const char *name
= s
->name
;
7348 if (config
.orphan_handling
== orphan_handling_error
)
7349 einfo (_("%X%P: error: unplaced orphan section `%pA' from `%pB'\n"),
7352 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
7353 constraint
= SPECIAL
;
7355 os
= ldemul_place_orphan (s
, name
, constraint
);
7358 os
= lang_output_section_statement_lookup (name
, constraint
, 1);
7359 if (os
->addr_tree
== NULL
7360 && (bfd_link_relocatable (&link_info
)
7361 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7362 os
->addr_tree
= exp_intop (0);
7363 lang_add_section (&os
->children
, s
, NULL
, NULL
, os
);
7366 if (config
.orphan_handling
== orphan_handling_warn
)
7367 einfo (_("%P: warning: orphan section `%pA' from `%pB' being "
7368 "placed in section `%s'\n"),
7369 s
, s
->owner
, os
->name
);
7373 /* Run through the input files and ensure that every input section has
7374 somewhere to go. If one is found without a destination then create
7375 an input request and place it into the statement tree. */
7378 lang_place_orphans (void)
7380 LANG_FOR_EACH_INPUT_STATEMENT (file
)
7384 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
7386 if (s
->output_section
== NULL
)
7388 /* This section of the file is not attached, root
7389 around for a sensible place for it to go. */
7391 if (file
->flags
.just_syms
)
7392 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
7393 else if (lang_discard_section_p (s
))
7394 s
->output_section
= bfd_abs_section_ptr
;
7395 else if (strcmp (s
->name
, "COMMON") == 0)
7397 /* This is a lonely common section which must have
7398 come from an archive. We attach to the section
7399 with the wildcard. */
7400 if (!bfd_link_relocatable (&link_info
)
7401 || command_line
.force_common_definition
)
7403 if (default_common_section
== NULL
)
7404 default_common_section
7405 = lang_output_section_statement_lookup (".bss", 0, 1);
7406 lang_add_section (&default_common_section
->children
, s
,
7407 NULL
, NULL
, default_common_section
);
7411 ldlang_place_orphan (s
);
7418 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
7420 flagword
*ptr_flags
;
7422 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7428 /* PR 17900: An exclamation mark in the attributes reverses
7429 the sense of any of the attributes that follow. */
7432 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7436 *ptr_flags
|= SEC_ALLOC
;
7440 *ptr_flags
|= SEC_READONLY
;
7444 *ptr_flags
|= SEC_DATA
;
7448 *ptr_flags
|= SEC_CODE
;
7453 *ptr_flags
|= SEC_LOAD
;
7457 einfo (_("%F%P: invalid character %c (%d) in flags\n"),
7465 /* Call a function on each real input file. This function will be
7466 called on an archive, but not on the elements. */
7469 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
7471 lang_input_statement_type
*f
;
7473 for (f
= (void *) input_file_chain
.head
;
7475 f
= f
->next_real_file
)
7480 /* Call a function on each real file. The function will be called on
7481 all the elements of an archive which are included in the link, but
7482 will not be called on the archive file itself. */
7485 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
7487 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7495 ldlang_add_file (lang_input_statement_type
*entry
)
7497 lang_statement_append (&file_chain
, entry
, &entry
->next
);
7499 /* The BFD linker needs to have a list of all input BFDs involved in
7501 ASSERT (link_info
.input_bfds_tail
!= &entry
->the_bfd
->link
.next
7502 && entry
->the_bfd
->link
.next
== NULL
);
7503 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
7505 *link_info
.input_bfds_tail
= entry
->the_bfd
;
7506 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
7507 bfd_set_usrdata (entry
->the_bfd
, entry
);
7508 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
7510 /* Look through the sections and check for any which should not be
7511 included in the link. We need to do this now, so that we can
7512 notice when the backend linker tries to report multiple
7513 definition errors for symbols which are in sections we aren't
7514 going to link. FIXME: It might be better to entirely ignore
7515 symbols which are defined in sections which are going to be
7516 discarded. This would require modifying the backend linker for
7517 each backend which might set the SEC_LINK_ONCE flag. If we do
7518 this, we should probably handle SEC_EXCLUDE in the same way. */
7520 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
7524 lang_add_output (const char *name
, int from_script
)
7526 /* Make -o on command line override OUTPUT in script. */
7527 if (!had_output_filename
|| !from_script
)
7529 output_filename
= name
;
7530 had_output_filename
= true;
7534 lang_output_section_statement_type
*
7535 lang_enter_output_section_statement (const char *output_section_statement_name
,
7536 etree_type
*address_exp
,
7537 enum section_type sectype
,
7538 etree_type
*sectype_value
,
7540 etree_type
*subalign
,
7543 int align_with_input
)
7545 lang_output_section_statement_type
*os
;
7547 os
= lang_output_section_statement_lookup (output_section_statement_name
,
7549 current_section
= os
;
7551 if (os
->addr_tree
== NULL
)
7553 os
->addr_tree
= address_exp
;
7555 os
->sectype
= sectype
;
7556 if (sectype
== type_section
|| sectype
== typed_readonly_section
)
7557 os
->sectype_value
= sectype_value
;
7558 else if (sectype
== noload_section
)
7559 os
->flags
= SEC_NEVER_LOAD
;
7561 os
->flags
= SEC_NO_FLAGS
;
7562 os
->block_value
= 1;
7564 /* Make next things chain into subchain of this. */
7565 push_stat_ptr (&os
->children
);
7567 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
7568 if (os
->align_lma_with_input
&& align
!= NULL
)
7569 einfo (_("%F%P:%pS: error: align with input and explicit align specified\n"),
7572 os
->subsection_alignment
= subalign
;
7573 os
->section_alignment
= align
;
7575 os
->load_base
= ebase
;
7582 lang_output_statement_type
*new_stmt
;
7584 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
7585 new_stmt
->name
= output_filename
;
7588 /* Reset the current counters in the regions. */
7591 lang_reset_memory_regions (void)
7593 lang_memory_region_type
*p
= lang_memory_region_list
;
7595 lang_output_section_statement_type
*os
;
7597 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
7599 p
->current
= p
->origin
;
7603 for (os
= (void *) lang_os_list
.head
;
7607 os
->processed_vma
= false;
7608 os
->processed_lma
= false;
7611 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
7613 /* Save the last size for possible use by bfd_relax_section. */
7614 o
->rawsize
= o
->size
;
7615 if (!(o
->flags
& SEC_FIXED_SIZE
))
7620 /* Worker for lang_gc_sections_1. */
7623 gc_section_callback (lang_wild_statement_type
*ptr
,
7624 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7626 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7627 void *data ATTRIBUTE_UNUSED
)
7629 /* If the wild pattern was marked KEEP, the member sections
7630 should be as well. */
7631 if (ptr
->keep_sections
)
7632 section
->flags
|= SEC_KEEP
;
7635 /* Iterate over sections marking them against GC. */
7638 lang_gc_sections_1 (lang_statement_union_type
*s
)
7640 for (; s
!= NULL
; s
= s
->header
.next
)
7642 switch (s
->header
.type
)
7644 case lang_wild_statement_enum
:
7645 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
7647 case lang_constructors_statement_enum
:
7648 lang_gc_sections_1 (constructor_list
.head
);
7650 case lang_output_section_statement_enum
:
7651 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
7653 case lang_group_statement_enum
:
7654 lang_gc_sections_1 (s
->group_statement
.children
.head
);
7663 lang_gc_sections (void)
7665 /* Keep all sections so marked in the link script. */
7666 lang_gc_sections_1 (statement_list
.head
);
7668 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
7669 the special case of .stabstr debug info. (See bfd/stabs.c)
7670 Twiddle the flag here, to simplify later linker code. */
7671 if (bfd_link_relocatable (&link_info
))
7673 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7676 #if BFD_SUPPORTS_PLUGINS
7677 if (f
->flags
.claimed
)
7680 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
7681 if ((sec
->flags
& SEC_DEBUGGING
) == 0
7682 || strcmp (sec
->name
, ".stabstr") != 0)
7683 sec
->flags
&= ~SEC_EXCLUDE
;
7687 if (link_info
.gc_sections
)
7688 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
7691 /* Worker for lang_find_relro_sections_1. */
7694 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
7695 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7697 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7700 /* Discarded, excluded and ignored sections effectively have zero
7702 if (section
->output_section
!= NULL
7703 && section
->output_section
->owner
== link_info
.output_bfd
7704 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
7705 && !IGNORE_SECTION (section
)
7706 && section
->size
!= 0)
7708 bool *has_relro_section
= (bool *) data
;
7709 *has_relro_section
= true;
7713 /* Iterate over sections for relro sections. */
7716 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
7717 bool *has_relro_section
)
7719 if (*has_relro_section
)
7722 for (; s
!= NULL
; s
= s
->header
.next
)
7724 if (s
== expld
.dataseg
.relro_end_stat
)
7727 switch (s
->header
.type
)
7729 case lang_wild_statement_enum
:
7730 walk_wild (&s
->wild_statement
,
7731 find_relro_section_callback
,
7734 case lang_constructors_statement_enum
:
7735 lang_find_relro_sections_1 (constructor_list
.head
,
7738 case lang_output_section_statement_enum
:
7739 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
7742 case lang_group_statement_enum
:
7743 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
7753 lang_find_relro_sections (void)
7755 bool has_relro_section
= false;
7757 /* Check all sections in the link script. */
7759 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
7760 &has_relro_section
);
7762 if (!has_relro_section
)
7763 link_info
.relro
= false;
7766 /* Relax all sections until bfd_relax_section gives up. */
7769 lang_relax_sections (bool need_layout
)
7771 /* NB: Also enable relaxation to layout sections for DT_RELR. */
7772 if (RELAXATION_ENABLED
|| link_info
.enable_dt_relr
)
7774 /* We may need more than one relaxation pass. */
7775 int i
= link_info
.relax_pass
;
7777 /* The backend can use it to determine the current pass. */
7778 link_info
.relax_pass
= 0;
7782 /* Keep relaxing until bfd_relax_section gives up. */
7785 link_info
.relax_trip
= -1;
7788 link_info
.relax_trip
++;
7790 /* Note: pe-dll.c does something like this also. If you find
7791 you need to change this code, you probably need to change
7792 pe-dll.c also. DJ */
7794 /* Do all the assignments with our current guesses as to
7796 lang_do_assignments (lang_assigning_phase_enum
);
7798 /* We must do this after lang_do_assignments, because it uses
7800 lang_reset_memory_regions ();
7802 /* Perform another relax pass - this time we know where the
7803 globals are, so can make a better guess. */
7804 relax_again
= false;
7805 lang_size_sections (&relax_again
, false);
7807 while (relax_again
);
7809 link_info
.relax_pass
++;
7816 /* Final extra sizing to report errors. */
7817 lang_do_assignments (lang_assigning_phase_enum
);
7818 lang_reset_memory_regions ();
7819 lang_size_sections (NULL
, true);
7823 #if BFD_SUPPORTS_PLUGINS
7824 /* Find the insert point for the plugin's replacement files. We
7825 place them after the first claimed real object file, or if the
7826 first claimed object is an archive member, after the last real
7827 object file immediately preceding the archive. In the event
7828 no objects have been claimed at all, we return the first dummy
7829 object file on the list as the insert point; that works, but
7830 the callee must be careful when relinking the file_chain as it
7831 is not actually on that chain, only the statement_list and the
7832 input_file list; in that case, the replacement files must be
7833 inserted at the head of the file_chain. */
7835 static lang_input_statement_type
*
7836 find_replacements_insert_point (bool *before
)
7838 lang_input_statement_type
*claim1
, *lastobject
;
7839 lastobject
= (void *) input_file_chain
.head
;
7840 for (claim1
= (void *) file_chain
.head
;
7842 claim1
= claim1
->next
)
7844 if (claim1
->flags
.claimed
)
7846 *before
= claim1
->flags
.claim_archive
;
7847 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
7849 /* Update lastobject if this is a real object file. */
7850 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
7851 lastobject
= claim1
;
7853 /* No files were claimed by the plugin. Choose the last object
7854 file found on the list (maybe the first, dummy entry) as the
7860 /* Find where to insert ADD, an archive element or shared library
7861 added during a rescan. */
7863 static lang_input_statement_type
**
7864 find_rescan_insertion (lang_input_statement_type
*add
)
7866 bfd
*add_bfd
= add
->the_bfd
;
7867 lang_input_statement_type
*f
;
7868 lang_input_statement_type
*last_loaded
= NULL
;
7869 lang_input_statement_type
*before
= NULL
;
7870 lang_input_statement_type
**iter
= NULL
;
7872 if (add_bfd
->my_archive
!= NULL
)
7873 add_bfd
= add_bfd
->my_archive
;
7875 /* First look through the input file chain, to find an object file
7876 before the one we've rescanned. Normal object files always
7877 appear on both the input file chain and the file chain, so this
7878 lets us get quickly to somewhere near the correct place on the
7879 file chain if it is full of archive elements. Archives don't
7880 appear on the file chain, but if an element has been extracted
7881 then their input_statement->next points at it. */
7882 for (f
= (void *) input_file_chain
.head
;
7884 f
= f
->next_real_file
)
7886 if (f
->the_bfd
== add_bfd
)
7888 before
= last_loaded
;
7889 if (f
->next
!= NULL
)
7890 return &f
->next
->next
;
7892 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7896 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7898 iter
= &(*iter
)->next
)
7899 if (!(*iter
)->flags
.claim_archive
7900 && (*iter
)->the_bfd
->my_archive
== NULL
)
7906 /* Insert SRCLIST into DESTLIST after given element by chaining
7907 on FIELD as the next-pointer. (Counterintuitively does not need
7908 a pointer to the actual after-node itself, just its chain field.) */
7911 lang_list_insert_after (lang_statement_list_type
*destlist
,
7912 lang_statement_list_type
*srclist
,
7913 lang_statement_union_type
**field
)
7915 *(srclist
->tail
) = *field
;
7916 *field
= srclist
->head
;
7917 if (destlist
->tail
== field
)
7918 destlist
->tail
= srclist
->tail
;
7921 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7922 was taken as a copy of it and leave them in ORIGLIST. */
7925 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7926 lang_statement_list_type
*origlist
)
7928 union lang_statement_union
**savetail
;
7929 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7930 ASSERT (origlist
->head
== destlist
->head
);
7931 savetail
= origlist
->tail
;
7932 origlist
->head
= *(savetail
);
7933 origlist
->tail
= destlist
->tail
;
7934 destlist
->tail
= savetail
;
7938 static lang_statement_union_type
**
7939 find_next_input_statement (lang_statement_union_type
**s
)
7941 for ( ; *s
; s
= &(*s
)->header
.next
)
7943 lang_statement_union_type
**t
;
7944 switch ((*s
)->header
.type
)
7946 case lang_input_statement_enum
:
7948 case lang_wild_statement_enum
:
7949 t
= &(*s
)->wild_statement
.children
.head
;
7951 case lang_group_statement_enum
:
7952 t
= &(*s
)->group_statement
.children
.head
;
7954 case lang_output_section_statement_enum
:
7955 t
= &(*s
)->output_section_statement
.children
.head
;
7960 t
= find_next_input_statement (t
);
7966 #endif /* BFD_SUPPORTS_PLUGINS */
7968 /* Add NAME to the list of garbage collection entry points. */
7971 lang_add_gc_name (const char *name
)
7973 struct bfd_sym_chain
*sym
;
7978 sym
= stat_alloc (sizeof (*sym
));
7980 sym
->next
= link_info
.gc_sym_list
;
7982 link_info
.gc_sym_list
= sym
;
7985 /* Check relocations. */
7988 lang_check_relocs (void)
7990 if (link_info
.check_relocs_after_open_input
)
7994 for (abfd
= link_info
.input_bfds
;
7995 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7996 if (!bfd_link_check_relocs (abfd
, &link_info
))
7998 /* No object output, fail return. */
7999 config
.make_executable
= false;
8000 /* Note: we do not abort the loop, but rather
8001 continue the scan in case there are other
8002 bad relocations to report. */
8007 /* Look through all output sections looking for places where we can
8008 propagate forward the lma region. */
8011 lang_propagate_lma_regions (void)
8013 lang_output_section_statement_type
*os
;
8015 for (os
= (void *) lang_os_list
.head
;
8019 if (os
->prev
!= NULL
8020 && os
->lma_region
== NULL
8021 && os
->load_base
== NULL
8022 && os
->addr_tree
== NULL
8023 && os
->region
== os
->prev
->region
)
8024 os
->lma_region
= os
->prev
->lma_region
;
8031 /* Finalize dynamic list. */
8032 if (link_info
.dynamic_list
)
8033 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
8035 current_target
= default_target
;
8037 /* Open the output file. */
8038 lang_for_each_statement (ldlang_open_output
);
8041 ldemul_create_output_section_statements ();
8043 /* Add to the hash table all undefineds on the command line. */
8044 lang_place_undefineds ();
8046 if (!bfd_section_already_linked_table_init ())
8047 einfo (_("%F%P: can not create hash table: %E\n"));
8049 /* A first pass through the memory regions ensures that if any region
8050 references a symbol for its origin or length then this symbol will be
8051 added to the symbol table. Having these symbols in the symbol table
8052 means that when we call open_input_bfds PROVIDE statements will
8053 trigger to provide any needed symbols. The regions origins and
8054 lengths are not assigned as a result of this call. */
8055 lang_do_memory_regions (false);
8057 /* Create a bfd for each input file. */
8058 current_target
= default_target
;
8059 lang_statement_iteration
++;
8060 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
8062 /* Now that open_input_bfds has processed assignments and provide
8063 statements we can give values to symbolic origin/length now. */
8064 lang_do_memory_regions (true);
8066 #if BFD_SUPPORTS_PLUGINS
8067 if (link_info
.lto_plugin_active
)
8069 lang_statement_list_type added
;
8070 lang_statement_list_type files
, inputfiles
;
8072 ldemul_before_plugin_all_symbols_read ();
8074 /* Now all files are read, let the plugin(s) decide if there
8075 are any more to be added to the link before we call the
8076 emulation's after_open hook. We create a private list of
8077 input statements for this purpose, which we will eventually
8078 insert into the global statement list after the first claimed
8081 /* We need to manipulate all three chains in synchrony. */
8083 inputfiles
= input_file_chain
;
8084 if (plugin_call_all_symbols_read ())
8085 einfo (_("%F%P: %s: plugin reported error after all symbols read\n"),
8086 plugin_error_plugin ());
8087 link_info
.lto_all_symbols_read
= true;
8088 /* Open any newly added files, updating the file chains. */
8089 plugin_undefs
= link_info
.hash
->undefs_tail
;
8090 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
8091 if (plugin_undefs
== link_info
.hash
->undefs_tail
)
8092 plugin_undefs
= NULL
;
8093 /* Restore the global list pointer now they have all been added. */
8094 lang_list_remove_tail (stat_ptr
, &added
);
8095 /* And detach the fresh ends of the file lists. */
8096 lang_list_remove_tail (&file_chain
, &files
);
8097 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
8098 /* Were any new files added? */
8099 if (added
.head
!= NULL
)
8101 /* If so, we will insert them into the statement list immediately
8102 after the first input file that was claimed by the plugin,
8103 unless that file was an archive in which case it is inserted
8104 immediately before. */
8106 lang_statement_union_type
**prev
;
8107 plugin_insert
= find_replacements_insert_point (&before
);
8108 /* If a plugin adds input files without having claimed any, we
8109 don't really have a good idea where to place them. Just putting
8110 them at the start or end of the list is liable to leave them
8111 outside the crtbegin...crtend range. */
8112 ASSERT (plugin_insert
!= NULL
);
8113 /* Splice the new statement list into the old one. */
8114 prev
= &plugin_insert
->header
.next
;
8117 prev
= find_next_input_statement (prev
);
8118 if (*prev
!= (void *) plugin_insert
->next_real_file
)
8120 /* We didn't find the expected input statement.
8121 Fall back to adding after plugin_insert. */
8122 prev
= &plugin_insert
->header
.next
;
8125 lang_list_insert_after (stat_ptr
, &added
, prev
);
8126 /* Likewise for the file chains. */
8127 lang_list_insert_after (&input_file_chain
, &inputfiles
,
8128 (void *) &plugin_insert
->next_real_file
);
8129 /* We must be careful when relinking file_chain; we may need to
8130 insert the new files at the head of the list if the insert
8131 point chosen is the dummy first input file. */
8132 if (plugin_insert
->filename
)
8133 lang_list_insert_after (&file_chain
, &files
,
8134 (void *) &plugin_insert
->next
);
8136 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
8138 /* Rescan archives in case new undefined symbols have appeared. */
8140 lang_statement_iteration
++;
8141 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
8142 lang_list_remove_tail (&file_chain
, &files
);
8143 while (files
.head
!= NULL
)
8145 lang_input_statement_type
**insert
;
8146 lang_input_statement_type
**iter
, *temp
;
8149 insert
= find_rescan_insertion (&files
.head
->input_statement
);
8150 /* All elements from an archive can be added at once. */
8151 iter
= &files
.head
->input_statement
.next
;
8152 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
8153 if (my_arch
!= NULL
)
8154 for (; *iter
!= NULL
; iter
= &(*iter
)->next
)
8155 if ((*iter
)->the_bfd
->my_archive
!= my_arch
)
8158 *insert
= &files
.head
->input_statement
;
8159 files
.head
= (lang_statement_union_type
*) *iter
;
8161 if (my_arch
!= NULL
)
8163 lang_input_statement_type
*parent
= bfd_usrdata (my_arch
);
8165 parent
->next
= (lang_input_statement_type
*)
8167 - offsetof (lang_input_statement_type
, next
));
8172 #endif /* BFD_SUPPORTS_PLUGINS */
8174 /* Make sure that nobody has tried to add a symbol to this list
8176 ASSERT (link_info
.gc_sym_list
== NULL
);
8178 link_info
.gc_sym_list
= &entry_symbol
;
8180 if (entry_symbol
.name
== NULL
)
8182 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
8184 /* entry_symbol is normally initialied by a ENTRY definition in the
8185 linker script or the -e command line option. But if neither of
8186 these have been used, the target specific backend may still have
8187 provided an entry symbol via a call to lang_default_entry().
8188 Unfortunately this value will not be processed until lang_end()
8189 is called, long after this function has finished. So detect this
8190 case here and add the target's entry symbol to the list of starting
8191 points for garbage collection resolution. */
8192 lang_add_gc_name (entry_symbol_default
);
8195 lang_add_gc_name (link_info
.init_function
);
8196 lang_add_gc_name (link_info
.fini_function
);
8198 ldemul_after_open ();
8199 if (config
.map_file
!= NULL
)
8200 lang_print_asneeded ();
8204 bfd_section_already_linked_table_free ();
8206 /* Make sure that we're not mixing architectures. We call this
8207 after all the input files have been opened, but before we do any
8208 other processing, so that any operations merge_private_bfd_data
8209 does on the output file will be known during the rest of the
8213 /* Handle .exports instead of a version script if we're told to do so. */
8214 if (command_line
.version_exports_section
)
8215 lang_do_version_exports_section ();
8217 /* Build all sets based on the information gathered from the input
8219 ldctor_build_sets ();
8221 lang_symbol_tweaks ();
8223 /* PR 13683: We must rerun the assignments prior to running garbage
8224 collection in order to make sure that all symbol aliases are resolved. */
8225 lang_do_assignments (lang_mark_phase_enum
);
8226 expld
.phase
= lang_first_phase_enum
;
8228 /* Size up the common data. */
8231 /* Remove unreferenced sections if asked to. */
8232 lang_gc_sections ();
8234 lang_mark_undefineds ();
8236 /* Check relocations. */
8237 lang_check_relocs ();
8239 ldemul_after_check_relocs ();
8241 /* Update wild statements. */
8242 update_wild_statements (statement_list
.head
);
8244 /* Run through the contours of the script and attach input sections
8245 to the correct output sections. */
8246 lang_statement_iteration
++;
8247 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
8249 /* Start at the statement immediately after the special abs_section
8250 output statement, so that it isn't reordered. */
8251 process_insert_statements (&lang_os_list
.head
->header
.next
);
8253 ldemul_before_place_orphans ();
8255 /* Find any sections not attached explicitly and handle them. */
8256 lang_place_orphans ();
8258 if (!bfd_link_relocatable (&link_info
))
8262 /* Merge SEC_MERGE sections. This has to be done after GC of
8263 sections, so that GCed sections are not merged, but before
8264 assigning dynamic symbols, since removing whole input sections
8266 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
8268 /* Look for a text section and set the readonly attribute in it. */
8269 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
8273 if (config
.text_read_only
)
8274 found
->flags
|= SEC_READONLY
;
8276 found
->flags
&= ~SEC_READONLY
;
8280 /* Merge together CTF sections. After this, only the symtab-dependent
8281 function and data object sections need adjustment. */
8284 /* Emit the CTF, iff the emulation doesn't need to do late emission after
8285 examining things laid out late, like the strtab. */
8288 /* Copy forward lma regions for output sections in same lma region. */
8289 lang_propagate_lma_regions ();
8291 /* Defining __start/__stop symbols early for --gc-sections to work
8292 around a glibc build problem can result in these symbols being
8293 defined when they should not be. Fix them now. */
8294 if (config
.build_constructors
)
8295 lang_undef_start_stop ();
8297 /* Define .startof./.sizeof. symbols with preliminary values before
8298 dynamic symbols are created. */
8299 if (!bfd_link_relocatable (&link_info
))
8300 lang_init_startof_sizeof ();
8302 /* Do anything special before sizing sections. This is where ELF
8303 and other back-ends size dynamic sections. */
8304 ldemul_before_allocation ();
8306 /* We must record the program headers before we try to fix the
8307 section positions, since they will affect SIZEOF_HEADERS. */
8308 lang_record_phdrs ();
8310 /* Check relro sections. */
8311 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
8312 lang_find_relro_sections ();
8314 /* Size up the sections. */
8315 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
8317 /* See if anything special should be done now we know how big
8318 everything is. This is where relaxation is done. */
8319 ldemul_after_allocation ();
8321 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
8322 lang_finalize_start_stop ();
8324 /* Do all the assignments again, to report errors. Assignment
8325 statements are processed multiple times, updating symbols; In
8326 open_input_bfds, lang_do_assignments, and lang_size_sections.
8327 Since lang_relax_sections calls lang_do_assignments, symbols are
8328 also updated in ldemul_after_allocation. */
8329 lang_do_assignments (lang_final_phase_enum
);
8333 /* Convert absolute symbols to section relative. */
8334 ldexp_finalize_syms ();
8336 /* Make sure that the section addresses make sense. */
8337 if (command_line
.check_section_addresses
)
8338 lang_check_section_addresses ();
8340 /* Check any required symbols are known. */
8341 ldlang_check_require_defined_symbols ();
8346 /* EXPORTED TO YACC */
8349 lang_add_wild (struct wildcard_spec
*filespec
,
8350 struct wildcard_list
*section_list
,
8353 struct wildcard_list
*curr
, *next
;
8354 lang_wild_statement_type
*new_stmt
;
8356 /* Reverse the list as the parser puts it back to front. */
8357 for (curr
= section_list
, section_list
= NULL
;
8359 section_list
= curr
, curr
= next
)
8362 curr
->next
= section_list
;
8365 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
8367 if (strcmp (filespec
->name
, "*") == 0)
8368 filespec
->name
= NULL
;
8369 else if (!wildcardp (filespec
->name
))
8370 lang_has_input_file
= true;
8373 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
8374 new_stmt
->filename
= NULL
;
8375 new_stmt
->filenames_sorted
= false;
8376 new_stmt
->section_flag_list
= NULL
;
8377 new_stmt
->exclude_name_list
= NULL
;
8378 if (filespec
!= NULL
)
8380 new_stmt
->filename
= filespec
->name
;
8381 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
8382 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
8383 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
8385 new_stmt
->section_list
= section_list
;
8386 new_stmt
->keep_sections
= keep_sections
;
8387 lang_list_init (&new_stmt
->children
);
8388 analyze_walk_wild_section_handler (new_stmt
);
8392 lang_section_start (const char *name
, etree_type
*address
,
8393 const segment_type
*segment
)
8395 lang_address_statement_type
*ad
;
8397 ad
= new_stat (lang_address_statement
, stat_ptr
);
8398 ad
->section_name
= name
;
8399 ad
->address
= address
;
8400 ad
->segment
= segment
;
8403 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
8404 because of a -e argument on the command line, or zero if this is
8405 called by ENTRY in a linker script. Command line arguments take
8409 lang_add_entry (const char *name
, bool cmdline
)
8411 if (entry_symbol
.name
== NULL
8413 || !entry_from_cmdline
)
8415 entry_symbol
.name
= name
;
8416 entry_from_cmdline
= cmdline
;
8420 /* Set the default start symbol to NAME. .em files should use this,
8421 not lang_add_entry, to override the use of "start" if neither the
8422 linker script nor the command line specifies an entry point. NAME
8423 must be permanently allocated. */
8425 lang_default_entry (const char *name
)
8427 entry_symbol_default
= name
;
8431 lang_add_target (const char *name
)
8433 lang_target_statement_type
*new_stmt
;
8435 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
8436 new_stmt
->target
= name
;
8440 lang_add_map (const char *name
)
8447 map_option_f
= true;
8455 lang_add_fill (fill_type
*fill
)
8457 lang_fill_statement_type
*new_stmt
;
8459 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
8460 new_stmt
->fill
= fill
;
8464 lang_add_data (int type
, union etree_union
*exp
)
8466 lang_data_statement_type
*new_stmt
;
8468 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
8469 new_stmt
->exp
= exp
;
8470 new_stmt
->type
= type
;
8473 /* Create a new reloc statement. RELOC is the BFD relocation type to
8474 generate. HOWTO is the corresponding howto structure (we could
8475 look this up, but the caller has already done so). SECTION is the
8476 section to generate a reloc against, or NAME is the name of the
8477 symbol to generate a reloc against. Exactly one of SECTION and
8478 NAME must be NULL. ADDEND is an expression for the addend. */
8481 lang_add_reloc (bfd_reloc_code_real_type reloc
,
8482 reloc_howto_type
*howto
,
8485 union etree_union
*addend
)
8487 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
8491 p
->section
= section
;
8493 p
->addend_exp
= addend
;
8495 p
->addend_value
= 0;
8496 p
->output_section
= NULL
;
8497 p
->output_offset
= 0;
8500 lang_assignment_statement_type
*
8501 lang_add_assignment (etree_type
*exp
)
8503 lang_assignment_statement_type
*new_stmt
;
8505 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
8506 new_stmt
->exp
= exp
;
8511 lang_add_attribute (enum statement_enum attribute
)
8513 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
8517 lang_startup (const char *name
)
8519 if (first_file
->filename
!= NULL
)
8521 einfo (_("%F%P: multiple STARTUP files\n"));
8523 first_file
->filename
= name
;
8524 first_file
->local_sym_name
= name
;
8525 first_file
->flags
.real
= true;
8529 lang_float (bool maybe
)
8531 lang_float_flag
= maybe
;
8535 /* Work out the load- and run-time regions from a script statement, and
8536 store them in *LMA_REGION and *REGION respectively.
8538 MEMSPEC is the name of the run-time region, or the value of
8539 DEFAULT_MEMORY_REGION if the statement didn't specify one.
8540 LMA_MEMSPEC is the name of the load-time region, or null if the
8541 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
8542 had an explicit load address.
8544 It is an error to specify both a load region and a load address. */
8547 lang_get_regions (lang_memory_region_type
**region
,
8548 lang_memory_region_type
**lma_region
,
8549 const char *memspec
,
8550 const char *lma_memspec
,
8554 *lma_region
= lang_memory_region_lookup (lma_memspec
, false);
8556 /* If no runtime region or VMA has been specified, but the load region
8557 has been specified, then use the load region for the runtime region
8559 if (lma_memspec
!= NULL
8561 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
8562 *region
= *lma_region
;
8564 *region
= lang_memory_region_lookup (memspec
, false);
8566 if (have_lma
&& lma_memspec
!= 0)
8567 einfo (_("%X%P:%pS: section has both a load address and a load region\n"),
8572 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
8573 lang_output_section_phdr_list
*phdrs
,
8574 const char *lma_memspec
)
8576 lang_get_regions (¤t_section
->region
,
8577 ¤t_section
->lma_region
,
8578 memspec
, lma_memspec
,
8579 current_section
->load_base
!= NULL
,
8580 current_section
->addr_tree
!= NULL
);
8582 current_section
->fill
= fill
;
8583 current_section
->phdrs
= phdrs
;
8587 /* Set the output format type. -oformat overrides scripts. */
8590 lang_add_output_format (const char *format
,
8595 if (output_target
== NULL
|| !from_script
)
8597 if (command_line
.endian
== ENDIAN_BIG
8600 else if (command_line
.endian
== ENDIAN_LITTLE
8604 output_target
= format
;
8609 lang_add_insert (const char *where
, int is_before
)
8611 lang_insert_statement_type
*new_stmt
;
8613 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
8614 new_stmt
->where
= where
;
8615 new_stmt
->is_before
= is_before
;
8616 saved_script_handle
= previous_script_handle
;
8619 /* Enter a group. This creates a new lang_group_statement, and sets
8620 stat_ptr to build new statements within the group. */
8623 lang_enter_group (void)
8625 lang_group_statement_type
*g
;
8627 g
= new_stat (lang_group_statement
, stat_ptr
);
8628 lang_list_init (&g
->children
);
8629 push_stat_ptr (&g
->children
);
8632 /* Leave a group. This just resets stat_ptr to start writing to the
8633 regular list of statements again. Note that this will not work if
8634 groups can occur inside anything else which can adjust stat_ptr,
8635 but currently they can't. */
8638 lang_leave_group (void)
8643 /* Add a new program header. This is called for each entry in a PHDRS
8644 command in a linker script. */
8647 lang_new_phdr (const char *name
,
8654 struct lang_phdr
*n
, **pp
;
8657 n
= stat_alloc (sizeof (struct lang_phdr
));
8660 n
->type
= exp_get_vma (type
, 0, "program header type");
8661 n
->filehdr
= filehdr
;
8666 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
8668 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8671 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
8673 einfo (_("%X%P:%pS: PHDRS and FILEHDR are not supported"
8674 " when prior PT_LOAD headers lack them\n"), NULL
);
8681 /* Record the program header information in the output BFD. FIXME: We
8682 should not be calling an ELF specific function here. */
8685 lang_record_phdrs (void)
8689 lang_output_section_phdr_list
*last
;
8690 struct lang_phdr
*l
;
8691 lang_output_section_statement_type
*os
;
8694 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
8697 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
8704 for (os
= (void *) lang_os_list
.head
;
8708 lang_output_section_phdr_list
*pl
;
8710 if (os
->constraint
< 0)
8718 if (os
->sectype
== noload_section
8719 || os
->bfd_section
== NULL
8720 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
8723 /* Don't add orphans to PT_INTERP header. */
8729 lang_output_section_statement_type
*tmp_os
;
8731 /* If we have not run across a section with a program
8732 header assigned to it yet, then scan forwards to find
8733 one. This prevents inconsistencies in the linker's
8734 behaviour when a script has specified just a single
8735 header and there are sections in that script which are
8736 not assigned to it, and which occur before the first
8737 use of that header. See here for more details:
8738 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
8739 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
8742 last
= tmp_os
->phdrs
;
8746 einfo (_("%F%P: no sections assigned to phdrs\n"));
8751 if (os
->bfd_section
== NULL
)
8754 for (; pl
!= NULL
; pl
= pl
->next
)
8756 if (strcmp (pl
->name
, l
->name
) == 0)
8761 secs
= (asection
**) xrealloc (secs
,
8762 alc
* sizeof (asection
*));
8764 secs
[c
] = os
->bfd_section
;
8771 if (l
->flags
== NULL
)
8774 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
8779 at
= exp_get_vma (l
->at
, 0, "phdr load address");
8781 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
8782 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
8783 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
8784 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
8789 /* Make sure all the phdr assignments succeeded. */
8790 for (os
= (void *) lang_os_list
.head
;
8794 lang_output_section_phdr_list
*pl
;
8796 if (os
->constraint
< 0
8797 || os
->bfd_section
== NULL
)
8800 for (pl
= os
->phdrs
;
8803 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
8804 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
8805 os
->name
, pl
->name
);
8809 /* Record a list of sections which may not be cross referenced. */
8812 lang_add_nocrossref (lang_nocrossref_type
*l
)
8814 struct lang_nocrossrefs
*n
;
8816 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
8817 n
->next
= nocrossref_list
;
8819 n
->onlyfirst
= false;
8820 nocrossref_list
= n
;
8822 /* Set notice_all so that we get informed about all symbols. */
8823 link_info
.notice_all
= true;
8826 /* Record a section that cannot be referenced from a list of sections. */
8829 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
8831 lang_add_nocrossref (l
);
8832 nocrossref_list
->onlyfirst
= true;
8835 /* Overlay handling. We handle overlays with some static variables. */
8837 /* The overlay virtual address. */
8838 static etree_type
*overlay_vma
;
8839 /* And subsection alignment. */
8840 static etree_type
*overlay_subalign
;
8842 /* An expression for the maximum section size seen so far. */
8843 static etree_type
*overlay_max
;
8845 /* A list of all the sections in this overlay. */
8847 struct overlay_list
{
8848 struct overlay_list
*next
;
8849 lang_output_section_statement_type
*os
;
8852 static struct overlay_list
*overlay_list
;
8854 /* Start handling an overlay. */
8857 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
8859 /* The grammar should prevent nested overlays from occurring. */
8860 ASSERT (overlay_vma
== NULL
8861 && overlay_subalign
== NULL
8862 && overlay_max
== NULL
);
8864 overlay_vma
= vma_expr
;
8865 overlay_subalign
= subalign
;
8868 /* Start a section in an overlay. We handle this by calling
8869 lang_enter_output_section_statement with the correct VMA.
8870 lang_leave_overlay sets up the LMA and memory regions. */
8873 lang_enter_overlay_section (const char *name
)
8875 struct overlay_list
*n
;
8878 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
8879 0, 0, overlay_subalign
, 0, 0, 0);
8881 /* If this is the first section, then base the VMA of future
8882 sections on this one. This will work correctly even if `.' is
8883 used in the addresses. */
8884 if (overlay_list
== NULL
)
8885 overlay_vma
= exp_nameop (ADDR
, name
);
8887 /* Remember the section. */
8888 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
8889 n
->os
= current_section
;
8890 n
->next
= overlay_list
;
8893 size
= exp_nameop (SIZEOF
, name
);
8895 /* Arrange to work out the maximum section end address. */
8896 if (overlay_max
== NULL
)
8899 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
8902 /* Finish a section in an overlay. There isn't any special to do
8906 lang_leave_overlay_section (fill_type
*fill
,
8907 lang_output_section_phdr_list
*phdrs
)
8914 name
= current_section
->name
;
8916 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
8917 region and that no load-time region has been specified. It doesn't
8918 really matter what we say here, since lang_leave_overlay will
8920 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
8922 /* Define the magic symbols. */
8924 clean
= (char *) xmalloc (strlen (name
) + 1);
8926 for (s1
= name
; *s1
!= '\0'; s1
++)
8927 if (ISALNUM (*s1
) || *s1
== '_')
8931 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8932 sprintf (buf
, "__load_start_%s", clean
);
8933 lang_add_assignment (exp_provide (buf
,
8934 exp_nameop (LOADADDR
, name
),
8937 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8938 sprintf (buf
, "__load_stop_%s", clean
);
8939 lang_add_assignment (exp_provide (buf
,
8941 exp_nameop (LOADADDR
, name
),
8942 exp_nameop (SIZEOF
, name
)),
8948 /* Finish an overlay. If there are any overlay wide settings, this
8949 looks through all the sections in the overlay and sets them. */
8952 lang_leave_overlay (etree_type
*lma_expr
,
8955 const char *memspec
,
8956 lang_output_section_phdr_list
*phdrs
,
8957 const char *lma_memspec
)
8959 lang_memory_region_type
*region
;
8960 lang_memory_region_type
*lma_region
;
8961 struct overlay_list
*l
;
8962 lang_nocrossref_type
*nocrossref
;
8964 lang_get_regions (®ion
, &lma_region
,
8965 memspec
, lma_memspec
,
8966 lma_expr
!= NULL
, false);
8970 /* After setting the size of the last section, set '.' to end of the
8972 if (overlay_list
!= NULL
)
8974 overlay_list
->os
->update_dot
= 1;
8975 overlay_list
->os
->update_dot_tree
8976 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), false);
8982 struct overlay_list
*next
;
8984 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8987 l
->os
->region
= region
;
8988 l
->os
->lma_region
= lma_region
;
8990 /* The first section has the load address specified in the
8991 OVERLAY statement. The rest are worked out from that.
8992 The base address is not needed (and should be null) if
8993 an LMA region was specified. */
8996 l
->os
->load_base
= lma_expr
;
8997 l
->os
->sectype
= first_overlay_section
;
8999 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
9000 l
->os
->phdrs
= phdrs
;
9004 lang_nocrossref_type
*nc
;
9006 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
9007 nc
->name
= l
->os
->name
;
9008 nc
->next
= nocrossref
;
9017 if (nocrossref
!= NULL
)
9018 lang_add_nocrossref (nocrossref
);
9021 overlay_list
= NULL
;
9023 overlay_subalign
= NULL
;
9026 /* Version handling. This is only useful for ELF. */
9028 /* If PREV is NULL, return first version pattern matching particular symbol.
9029 If PREV is non-NULL, return first version pattern matching particular
9030 symbol after PREV (previously returned by lang_vers_match). */
9032 static struct bfd_elf_version_expr
*
9033 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
9034 struct bfd_elf_version_expr
*prev
,
9038 const char *cxx_sym
= sym
;
9039 const char *java_sym
= sym
;
9040 struct bfd_elf_version_expr
*expr
= NULL
;
9041 enum demangling_styles curr_style
;
9043 curr_style
= CURRENT_DEMANGLING_STYLE
;
9044 cplus_demangle_set_style (no_demangling
);
9045 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
9048 cplus_demangle_set_style (curr_style
);
9050 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
9052 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
9053 DMGL_PARAMS
| DMGL_ANSI
);
9057 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
9059 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
9064 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
9066 struct bfd_elf_version_expr e
;
9068 switch (prev
? prev
->mask
: 0)
9071 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
9074 expr
= (struct bfd_elf_version_expr
*)
9075 htab_find ((htab_t
) head
->htab
, &e
);
9076 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
9077 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
9083 case BFD_ELF_VERSION_C_TYPE
:
9084 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
9086 e
.pattern
= cxx_sym
;
9087 expr
= (struct bfd_elf_version_expr
*)
9088 htab_find ((htab_t
) head
->htab
, &e
);
9089 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
9090 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
9096 case BFD_ELF_VERSION_CXX_TYPE
:
9097 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
9099 e
.pattern
= java_sym
;
9100 expr
= (struct bfd_elf_version_expr
*)
9101 htab_find ((htab_t
) head
->htab
, &e
);
9102 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
9103 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
9114 /* Finally, try the wildcards. */
9115 if (prev
== NULL
|| prev
->literal
)
9116 expr
= head
->remaining
;
9119 for (; expr
; expr
= expr
->next
)
9126 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
9129 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
9131 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
9135 if (fnmatch (expr
->pattern
, s
, 0) == 0)
9141 free ((char *) c_sym
);
9143 free ((char *) cxx_sym
);
9144 if (java_sym
!= sym
)
9145 free ((char *) java_sym
);
9149 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
9150 return a pointer to the symbol name with any backslash quotes removed. */
9153 realsymbol (const char *pattern
)
9156 bool changed
= false, backslash
= false;
9157 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
9159 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
9161 /* It is a glob pattern only if there is no preceding
9165 /* Remove the preceding backslash. */
9172 if (*p
== '?' || *p
== '*' || *p
== '[')
9179 backslash
= *p
== '\\';
9195 /* This is called for each variable name or match expression. NEW_NAME is
9196 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
9197 pattern to be matched against symbol names. */
9199 struct bfd_elf_version_expr
*
9200 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
9201 const char *new_name
,
9205 struct bfd_elf_version_expr
*ret
;
9207 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
9211 ret
->literal
= true;
9212 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
9213 if (ret
->pattern
== NULL
)
9215 ret
->pattern
= new_name
;
9216 ret
->literal
= false;
9219 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
9220 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9221 else if (strcasecmp (lang
, "C++") == 0)
9222 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
9223 else if (strcasecmp (lang
, "Java") == 0)
9224 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
9227 einfo (_("%X%P: unknown language `%s' in version information\n"),
9229 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9232 return ldemul_new_vers_pattern (ret
);
9235 /* This is called for each set of variable names and match
9238 struct bfd_elf_version_tree
*
9239 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
9240 struct bfd_elf_version_expr
*locals
)
9242 struct bfd_elf_version_tree
*ret
;
9244 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
9245 ret
->globals
.list
= globals
;
9246 ret
->locals
.list
= locals
;
9247 ret
->match
= lang_vers_match
;
9248 ret
->name_indx
= (unsigned int) -1;
9252 /* This static variable keeps track of version indices. */
9254 static int version_index
;
9257 version_expr_head_hash (const void *p
)
9259 const struct bfd_elf_version_expr
*e
=
9260 (const struct bfd_elf_version_expr
*) p
;
9262 return htab_hash_string (e
->pattern
);
9266 version_expr_head_eq (const void *p1
, const void *p2
)
9268 const struct bfd_elf_version_expr
*e1
=
9269 (const struct bfd_elf_version_expr
*) p1
;
9270 const struct bfd_elf_version_expr
*e2
=
9271 (const struct bfd_elf_version_expr
*) p2
;
9273 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
9277 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
9280 struct bfd_elf_version_expr
*e
, *next
;
9281 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
9283 for (e
= head
->list
; e
; e
= e
->next
)
9287 head
->mask
|= e
->mask
;
9292 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
9293 version_expr_head_eq
, NULL
);
9294 list_loc
= &head
->list
;
9295 remaining_loc
= &head
->remaining
;
9296 for (e
= head
->list
; e
; e
= next
)
9302 remaining_loc
= &e
->next
;
9306 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
9310 struct bfd_elf_version_expr
*e1
, *last
;
9312 e1
= (struct bfd_elf_version_expr
*) *loc
;
9316 if (e1
->mask
== e
->mask
)
9324 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
9328 /* This is a duplicate. */
9329 /* FIXME: Memory leak. Sometimes pattern is not
9330 xmalloced alone, but in larger chunk of memory. */
9331 /* free (e->pattern); */
9336 e
->next
= last
->next
;
9344 list_loc
= &e
->next
;
9348 *remaining_loc
= NULL
;
9349 *list_loc
= head
->remaining
;
9352 head
->remaining
= head
->list
;
9355 /* This is called when we know the name and dependencies of the
9359 lang_register_vers_node (const char *name
,
9360 struct bfd_elf_version_tree
*version
,
9361 struct bfd_elf_version_deps
*deps
)
9363 struct bfd_elf_version_tree
*t
, **pp
;
9364 struct bfd_elf_version_expr
*e1
;
9369 if (link_info
.version_info
!= NULL
9370 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
9372 einfo (_("%X%P: anonymous version tag cannot be combined"
9373 " with other version tags\n"));
9378 /* Make sure this node has a unique name. */
9379 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9380 if (strcmp (t
->name
, name
) == 0)
9381 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
9383 lang_finalize_version_expr_head (&version
->globals
);
9384 lang_finalize_version_expr_head (&version
->locals
);
9386 /* Check the global and local match names, and make sure there
9387 aren't any duplicates. */
9389 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
9391 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9393 struct bfd_elf_version_expr
*e2
;
9395 if (t
->locals
.htab
&& e1
->literal
)
9397 e2
= (struct bfd_elf_version_expr
*)
9398 htab_find ((htab_t
) t
->locals
.htab
, e1
);
9399 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9401 if (e1
->mask
== e2
->mask
)
9402 einfo (_("%X%P: duplicate expression `%s'"
9403 " in version information\n"), e1
->pattern
);
9407 else if (!e1
->literal
)
9408 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9409 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9410 && e1
->mask
== e2
->mask
)
9411 einfo (_("%X%P: duplicate expression `%s'"
9412 " in version information\n"), e1
->pattern
);
9416 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
9418 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9420 struct bfd_elf_version_expr
*e2
;
9422 if (t
->globals
.htab
&& e1
->literal
)
9424 e2
= (struct bfd_elf_version_expr
*)
9425 htab_find ((htab_t
) t
->globals
.htab
, e1
);
9426 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9428 if (e1
->mask
== e2
->mask
)
9429 einfo (_("%X%P: duplicate expression `%s'"
9430 " in version information\n"),
9435 else if (!e1
->literal
)
9436 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9437 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9438 && e1
->mask
== e2
->mask
)
9439 einfo (_("%X%P: duplicate expression `%s'"
9440 " in version information\n"), e1
->pattern
);
9444 version
->deps
= deps
;
9445 version
->name
= name
;
9446 if (name
[0] != '\0')
9449 version
->vernum
= version_index
;
9452 version
->vernum
= 0;
9454 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
9459 /* This is called when we see a version dependency. */
9461 struct bfd_elf_version_deps
*
9462 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
9464 struct bfd_elf_version_deps
*ret
;
9465 struct bfd_elf_version_tree
*t
;
9467 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
9470 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9472 if (strcmp (t
->name
, name
) == 0)
9474 ret
->version_needed
= t
;
9479 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
9481 ret
->version_needed
= NULL
;
9486 lang_do_version_exports_section (void)
9488 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
9490 LANG_FOR_EACH_INPUT_STATEMENT (is
)
9492 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
9500 contents
= (char *) xmalloc (len
);
9501 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
9502 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
9505 while (p
< contents
+ len
)
9507 greg
= lang_new_vers_pattern (greg
, p
, NULL
, false);
9508 p
= strchr (p
, '\0') + 1;
9511 /* Do not free the contents, as we used them creating the regex. */
9513 /* Do not include this section in the link. */
9514 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
9517 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, false);
9518 lang_register_vers_node (command_line
.version_exports_section
,
9519 lang_new_vers_node (greg
, lreg
), NULL
);
9522 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec. This is initially
9523 called with UPDATE_REGIONS_P set to FALSE, in this case no errors are
9524 thrown, however, references to symbols in the origin and length fields
9525 will be pushed into the symbol table, this allows PROVIDE statements to
9526 then provide these symbols. This function is called a second time with
9527 UPDATE_REGIONS_P set to TRUE, this time the we update the actual region
9528 data structures, and throw errors if missing symbols are encountered. */
9531 lang_do_memory_regions (bool update_regions_p
)
9533 lang_memory_region_type
*r
= lang_memory_region_list
;
9535 for (; r
!= NULL
; r
= r
->next
)
9539 exp_fold_tree_no_dot (r
->origin_exp
);
9540 if (update_regions_p
)
9542 if (expld
.result
.valid_p
)
9544 r
->origin
= expld
.result
.value
;
9545 r
->current
= r
->origin
;
9548 einfo (_("%P: invalid origin for memory region %s\n"),
9554 exp_fold_tree_no_dot (r
->length_exp
);
9555 if (update_regions_p
)
9557 if (expld
.result
.valid_p
)
9558 r
->length
= expld
.result
.value
;
9560 einfo (_("%P: invalid length for memory region %s\n"),
9568 lang_add_unique (const char *name
)
9570 struct unique_sections
*ent
;
9572 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
9573 if (strcmp (ent
->name
, name
) == 0)
9576 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
9577 ent
->name
= xstrdup (name
);
9578 ent
->next
= unique_section_list
;
9579 unique_section_list
= ent
;
9582 /* Append the list of dynamic symbols to the existing one. */
9585 lang_append_dynamic_list (struct bfd_elf_dynamic_list
**list_p
,
9586 struct bfd_elf_version_expr
*dynamic
)
9590 struct bfd_elf_version_expr
*tail
;
9591 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
9593 tail
->next
= (*list_p
)->head
.list
;
9594 (*list_p
)->head
.list
= dynamic
;
9598 struct bfd_elf_dynamic_list
*d
;
9600 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
9601 d
->head
.list
= dynamic
;
9602 d
->match
= lang_vers_match
;
9607 /* Append the list of C++ typeinfo dynamic symbols to the existing
9611 lang_append_dynamic_list_cpp_typeinfo (void)
9613 const char *symbols
[] =
9615 "typeinfo name for*",
9618 struct bfd_elf_version_expr
*dynamic
= NULL
;
9621 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9622 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9625 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9628 /* Append the list of C++ operator new and delete dynamic symbols to the
9632 lang_append_dynamic_list_cpp_new (void)
9634 const char *symbols
[] =
9639 struct bfd_elf_version_expr
*dynamic
= NULL
;
9642 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9643 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9646 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9649 /* Scan a space and/or comma separated string of features. */
9652 lang_ld_feature (char *str
)
9660 while (*p
== ',' || ISSPACE (*p
))
9665 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
9669 if (strcasecmp (p
, "SANE_EXPR") == 0)
9670 config
.sane_expr
= true;
9672 einfo (_("%X%P: unknown feature `%s'\n"), p
);
9678 /* Pretty print memory amount. */
9681 lang_print_memory_size (bfd_vma sz
)
9683 if ((sz
& 0x3fffffff) == 0)
9684 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
9685 else if ((sz
& 0xfffff) == 0)
9686 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
9687 else if ((sz
& 0x3ff) == 0)
9688 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
9690 printf (" %10" BFD_VMA_FMT
"u B", sz
);
9693 /* Implement --print-memory-usage: disply per region memory usage. */
9696 lang_print_memory_usage (void)
9698 lang_memory_region_type
*r
;
9700 printf ("Memory region Used Size Region Size %%age Used\n");
9701 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
9703 bfd_vma used_length
= r
->current
- r
->origin
;
9705 printf ("%16s: ",r
->name_list
.name
);
9706 lang_print_memory_size (used_length
);
9707 lang_print_memory_size ((bfd_vma
) r
->length
);
9711 double percent
= used_length
* 100.0 / r
->length
;
9712 printf (" %6.2f%%", percent
);