1 /* Linker command language support.
2 Copyright (C) 1991-2021 Free Software Foundation, Inc.
4 This file is part of the GNU Binutils.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
24 #include "libiberty.h"
25 #include "filenames.h"
26 #include "safe-ctype.h"
45 #if BFD_SUPPORTS_PLUGINS
47 #endif /* BFD_SUPPORTS_PLUGINS */
50 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
53 /* Convert between addresses in bytes and sizes in octets.
54 For currently supported targets, octets_per_byte is always a power
55 of two, so we can use shifts. */
56 #define TO_ADDR(X) ((X) >> opb_shift)
57 #define TO_SIZE(X) ((X) << opb_shift)
59 /* Local variables. */
60 static struct obstack stat_obstack
;
61 static struct obstack map_obstack
;
63 #define obstack_chunk_alloc xmalloc
64 #define obstack_chunk_free free
65 static const char *entry_symbol_default
= "start";
66 static bool map_head_is_link_order
= false;
67 static lang_output_section_statement_type
*default_common_section
;
68 static bool map_option_f
;
69 static bfd_vma print_dot
;
70 static lang_input_statement_type
*first_file
;
71 static const char *current_target
;
72 static lang_statement_list_type
*stat_save
[10];
73 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
74 static struct unique_sections
*unique_section_list
;
75 static struct asneeded_minfo
*asneeded_list_head
;
76 static unsigned int opb_shift
= 0;
78 /* Forward declarations. */
79 static void exp_init_os (etree_type
*);
80 static lang_input_statement_type
*lookup_name (const char *);
81 static void insert_undefined (const char *);
82 static bool sort_def_symbol (struct bfd_link_hash_entry
*, void *);
83 static void print_statement (lang_statement_union_type
*,
84 lang_output_section_statement_type
*);
85 static void print_statement_list (lang_statement_union_type
*,
86 lang_output_section_statement_type
*);
87 static void print_statements (void);
88 static void print_input_section (asection
*, bool);
89 static bool lang_one_common (struct bfd_link_hash_entry
*, void *);
90 static void lang_record_phdrs (void);
91 static void lang_do_version_exports_section (void);
92 static void lang_finalize_version_expr_head
93 (struct bfd_elf_version_expr_head
*);
94 static void lang_do_memory_regions (bool);
96 /* Exported variables. */
97 const char *output_target
;
98 lang_output_section_statement_type
*abs_output_section
;
99 /* Header for list of statements corresponding to any files involved in the
100 link, either specified from the command-line or added implicitely (eg.
101 archive member used to resolved undefined symbol, wildcard statement from
102 linker script, etc.). Next pointer is in next field of a
103 lang_statement_header_type (reached via header field in a
104 lang_statement_union). */
105 lang_statement_list_type statement_list
;
106 lang_statement_list_type lang_os_list
;
107 lang_statement_list_type
*stat_ptr
= &statement_list
;
108 /* Header for list of statements corresponding to files used in the final
109 executable. This can be either object file specified on the command-line
110 or library member resolving an undefined reference. Next pointer is in next
111 field of a lang_input_statement_type (reached via input_statement field in a
112 lang_statement_union). */
113 lang_statement_list_type file_chain
= { NULL
, NULL
};
114 /* Header for list of statements corresponding to files specified on the
115 command-line for linking. It thus contains real object files and archive
116 but not archive members. Next pointer is in next_real_file field of a
117 lang_input_statement_type statement (reached via input_statement field in a
118 lang_statement_union). */
119 lang_statement_list_type input_file_chain
;
120 static const char *current_input_file
;
121 struct bfd_elf_dynamic_list
**current_dynamic_list_p
;
122 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
123 const char *entry_section
= ".text";
124 struct lang_input_statement_flags input_flags
;
125 bool entry_from_cmdline
;
126 bool lang_has_input_file
= false;
127 bool had_output_filename
= false;
128 bool lang_float_flag
= false;
129 bool delete_output_file_on_failure
= false;
130 struct lang_phdr
*lang_phdr_list
;
131 struct lang_nocrossrefs
*nocrossref_list
;
132 struct asneeded_minfo
**asneeded_list_tail
;
134 static ctf_dict_t
*ctf_output
;
137 /* Functions that traverse the linker script and might evaluate
138 DEFINED() need to increment this at the start of the traversal. */
139 int lang_statement_iteration
= 0;
141 /* Count times through one_lang_size_sections_pass after mark phase. */
142 static int lang_sizing_iteration
= 0;
144 /* Return TRUE if the PATTERN argument is a wildcard pattern.
145 Although backslashes are treated specially if a pattern contains
146 wildcards, we do not consider the mere presence of a backslash to
147 be enough to cause the pattern to be treated as a wildcard.
148 That lets us handle DOS filenames more naturally. */
149 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
151 #define new_stat(x, y) \
152 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
154 #define outside_section_address(q) \
155 ((q)->output_offset + (q)->output_section->vma)
157 #define outside_symbol_address(q) \
158 ((q)->value + outside_section_address (q->section))
160 /* CTF sections smaller than this are not compressed: compression of
161 dictionaries this small doesn't gain much, and this lets consumers mmap the
162 sections directly out of the ELF file and use them with no decompression
163 overhead if they want to. */
164 #define CTF_COMPRESSION_THRESHOLD 4096
167 stat_alloc (size_t size
)
169 return obstack_alloc (&stat_obstack
, size
);
173 name_match (const char *pattern
, const char *name
)
175 if (wildcardp (pattern
))
176 return fnmatch (pattern
, name
, 0);
177 return strcmp (pattern
, name
);
181 ldirname (const char *name
)
183 const char *base
= lbasename (name
);
186 while (base
> name
&& IS_DIR_SEPARATOR (base
[-1]))
190 dirname
= strdup (name
);
191 dirname
[base
- name
] = '\0';
195 /* If PATTERN is of the form archive:file, return a pointer to the
196 separator. If not, return NULL. */
199 archive_path (const char *pattern
)
203 if (link_info
.path_separator
== 0)
206 p
= strchr (pattern
, link_info
.path_separator
);
207 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
208 if (p
== NULL
|| link_info
.path_separator
!= ':')
211 /* Assume a match on the second char is part of drive specifier,
212 as in "c:\silly.dos". */
213 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
214 p
= strchr (p
+ 1, link_info
.path_separator
);
219 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
220 return whether F matches FILE_SPEC. */
223 input_statement_is_archive_path (const char *file_spec
, char *sep
,
224 lang_input_statement_type
*f
)
229 || name_match (sep
+ 1, f
->filename
) == 0)
230 && ((sep
!= file_spec
)
231 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
235 if (sep
!= file_spec
)
237 const char *aname
= bfd_get_filename (f
->the_bfd
->my_archive
);
239 match
= name_match (file_spec
, aname
) == 0;
240 *sep
= link_info
.path_separator
;
247 unique_section_p (const asection
*sec
,
248 const lang_output_section_statement_type
*os
)
250 struct unique_sections
*unam
;
253 if (!link_info
.resolve_section_groups
254 && sec
->owner
!= NULL
255 && bfd_is_group_section (sec
->owner
, sec
))
257 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
260 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
261 if (name_match (unam
->name
, secnam
) == 0)
267 /* Generic traversal routines for finding matching sections. */
269 /* Return true if FILE matches a pattern in EXCLUDE_LIST, otherwise return
273 walk_wild_file_in_exclude_list (struct name_list
*exclude_list
,
274 lang_input_statement_type
*file
)
276 struct name_list
*list_tmp
;
278 for (list_tmp
= exclude_list
;
280 list_tmp
= list_tmp
->next
)
282 char *p
= archive_path (list_tmp
->name
);
286 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
290 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
293 /* FIXME: Perhaps remove the following at some stage? Matching
294 unadorned archives like this was never documented and has
295 been superceded by the archive:path syntax. */
296 else if (file
->the_bfd
!= NULL
297 && file
->the_bfd
->my_archive
!= NULL
298 && name_match (list_tmp
->name
,
299 bfd_get_filename (file
->the_bfd
->my_archive
)) == 0)
306 /* Try processing a section against a wildcard. This just calls
307 the callback unless the filename exclusion list is present
308 and excludes the file. It's hardly ever present so this
309 function is very fast. */
312 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
313 lang_input_statement_type
*file
,
315 struct wildcard_list
*sec
,
319 /* Don't process sections from files which were excluded. */
320 if (walk_wild_file_in_exclude_list (sec
->spec
.exclude_name_list
, file
))
323 (*callback
) (ptr
, sec
, s
, file
, data
);
326 /* Lowest common denominator routine that can handle everything correctly,
330 walk_wild_section_general (lang_wild_statement_type
*ptr
,
331 lang_input_statement_type
*file
,
336 struct wildcard_list
*sec
;
338 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
340 sec
= ptr
->section_list
;
342 (*callback
) (ptr
, sec
, s
, file
, data
);
348 if (sec
->spec
.name
!= NULL
)
350 const char *sname
= bfd_section_name (s
);
352 skip
= name_match (sec
->spec
.name
, sname
) != 0;
356 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
363 /* Routines to find a single section given its name. If there's more
364 than one section with that name, we report that. */
368 asection
*found_section
;
369 bool multiple_sections_found
;
370 } section_iterator_callback_data
;
373 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
375 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
377 if (d
->found_section
!= NULL
)
379 d
->multiple_sections_found
= true;
383 d
->found_section
= s
;
388 find_section (lang_input_statement_type
*file
,
389 struct wildcard_list
*sec
,
390 bool *multiple_sections_found
)
392 section_iterator_callback_data cb_data
= { NULL
, false };
394 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
395 section_iterator_callback
, &cb_data
);
396 *multiple_sections_found
= cb_data
.multiple_sections_found
;
397 return cb_data
.found_section
;
400 /* Code for handling simple wildcards without going through fnmatch,
401 which can be expensive because of charset translations etc. */
403 /* A simple wild is a literal string followed by a single '*',
404 where the literal part is at least 4 characters long. */
407 is_simple_wild (const char *name
)
409 size_t len
= strcspn (name
, "*?[");
410 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
414 match_simple_wild (const char *pattern
, const char *name
)
416 /* The first four characters of the pattern are guaranteed valid
417 non-wildcard characters. So we can go faster. */
418 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
419 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
424 while (*pattern
!= '*')
425 if (*name
++ != *pattern
++)
431 /* Return the numerical value of the init_priority attribute from
432 section name NAME. */
435 get_init_priority (const asection
*sec
)
437 const char *name
= bfd_section_name (sec
);
440 /* GCC uses the following section names for the init_priority
441 attribute with numerical values 101 to 65535 inclusive. A
442 lower value means a higher priority.
444 1: .init_array.NNNNN/.fini_array.NNNNN: Where NNNNN is the
445 decimal numerical value of the init_priority attribute.
446 The order of execution in .init_array is forward and
447 .fini_array is backward.
448 2: .ctors.NNNNN/.dtors.NNNNN: Where NNNNN is 65535 minus the
449 decimal numerical value of the init_priority attribute.
450 The order of execution in .ctors is backward and .dtors
453 .init_array.NNNNN sections would normally be placed in an output
454 .init_array section, .fini_array.NNNNN in .fini_array,
455 .ctors.NNNNN in .ctors, and .dtors.NNNNN in .dtors. This means
456 we should sort by increasing number (and could just use
457 SORT_BY_NAME in scripts). However if .ctors.NNNNN sections are
458 being placed in .init_array (which may also contain
459 .init_array.NNNNN sections) or .dtors.NNNNN sections are being
460 placed in .fini_array then we need to extract the init_priority
461 attribute and sort on that. */
462 dot
= strrchr (name
, '.');
463 if (dot
!= NULL
&& ISDIGIT (dot
[1]))
466 unsigned long init_priority
= strtoul (dot
+ 1, &end
, 10);
470 && (strncmp (name
, ".ctors", 6) == 0
471 || strncmp (name
, ".dtors", 6) == 0))
472 init_priority
= 65535 - init_priority
;
473 if (init_priority
<= INT_MAX
)
474 return init_priority
;
480 /* Compare sections ASEC and BSEC according to SORT. */
483 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
486 int a_priority
, b_priority
;
493 case by_init_priority
:
494 a_priority
= get_init_priority (asec
);
495 b_priority
= get_init_priority (bsec
);
496 if (a_priority
< 0 || b_priority
< 0)
498 ret
= a_priority
- b_priority
;
504 case by_alignment_name
:
505 ret
= bfd_section_alignment (bsec
) - bfd_section_alignment (asec
);
512 ret
= strcmp (bfd_section_name (asec
), bfd_section_name (bsec
));
515 case by_name_alignment
:
516 ret
= strcmp (bfd_section_name (asec
), bfd_section_name (bsec
));
522 ret
= bfd_section_alignment (bsec
) - bfd_section_alignment (asec
);
529 /* Build a Binary Search Tree to sort sections, unlike insertion sort
530 used in wild_sort(). BST is considerably faster if the number of
531 of sections are large. */
533 static lang_section_bst_type
**
534 wild_sort_fast (lang_wild_statement_type
*wild
,
535 struct wildcard_list
*sec
,
536 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
539 lang_section_bst_type
**tree
;
542 if (!wild
->filenames_sorted
543 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
545 /* Append at the right end of tree. */
547 tree
= &((*tree
)->right
);
553 /* Find the correct node to append this section. */
554 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
555 tree
= &((*tree
)->left
);
557 tree
= &((*tree
)->right
);
563 /* Use wild_sort_fast to build a BST to sort sections. */
566 output_section_callback_fast (lang_wild_statement_type
*ptr
,
567 struct wildcard_list
*sec
,
569 lang_input_statement_type
*file
,
572 lang_section_bst_type
*node
;
573 lang_section_bst_type
**tree
;
574 lang_output_section_statement_type
*os
;
576 os
= (lang_output_section_statement_type
*) output
;
578 if (unique_section_p (section
, os
))
581 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
584 node
->section
= section
;
585 node
->pattern
= ptr
->section_list
;
587 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
592 /* Convert a sorted sections' BST back to list form. */
595 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
596 lang_section_bst_type
*tree
,
600 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
602 lang_add_section (&ptr
->children
, tree
->section
, tree
->pattern
, NULL
,
603 (lang_output_section_statement_type
*) output
);
606 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
611 /* Specialized, optimized routines for handling different kinds of
615 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
616 lang_input_statement_type
*file
,
620 /* We can just do a hash lookup for the section with the right name.
621 But if that lookup discovers more than one section with the name
622 (should be rare), we fall back to the general algorithm because
623 we would otherwise have to sort the sections to make sure they
624 get processed in the bfd's order. */
625 bool multiple_sections_found
;
626 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
627 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
629 if (multiple_sections_found
)
630 walk_wild_section_general (ptr
, file
, callback
, data
);
632 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
636 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
637 lang_input_statement_type
*file
,
642 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
644 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
646 const char *sname
= bfd_section_name (s
);
647 bool skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
650 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
655 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
656 lang_input_statement_type
*file
,
661 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
662 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
663 bool multiple_sections_found
;
664 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
666 if (multiple_sections_found
)
668 walk_wild_section_general (ptr
, file
, callback
, data
);
672 /* Note that if the section was not found, s0 is NULL and
673 we'll simply never succeed the s == s0 test below. */
674 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
676 /* Recall that in this code path, a section cannot satisfy more
677 than one spec, so if s == s0 then it cannot match
680 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
683 const char *sname
= bfd_section_name (s
);
684 bool skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
687 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
694 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
695 lang_input_statement_type
*file
,
700 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
701 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
702 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
703 bool multiple_sections_found
;
704 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
706 if (multiple_sections_found
)
708 walk_wild_section_general (ptr
, file
, callback
, data
);
712 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
715 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
718 const char *sname
= bfd_section_name (s
);
719 bool skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
722 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
725 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
727 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
735 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
736 lang_input_statement_type
*file
,
741 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
742 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
743 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
744 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
745 bool multiple_sections_found
;
746 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
748 if (multiple_sections_found
)
750 walk_wild_section_general (ptr
, file
, callback
, data
);
754 s1
= find_section (file
, sec1
, &multiple_sections_found
);
755 if (multiple_sections_found
)
757 walk_wild_section_general (ptr
, file
, callback
, data
);
761 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
764 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
767 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
770 const char *sname
= bfd_section_name (s
);
771 bool skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
774 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
778 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
780 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
788 walk_wild_section (lang_wild_statement_type
*ptr
,
789 lang_input_statement_type
*file
,
793 if (file
->flags
.just_syms
)
796 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
799 /* Returns TRUE when name1 is a wildcard spec that might match
800 something name2 can match. We're conservative: we return FALSE
801 only if the prefixes of name1 and name2 are different up to the
802 first wildcard character. */
805 wild_spec_can_overlap (const char *name1
, const char *name2
)
807 size_t prefix1_len
= strcspn (name1
, "?*[");
808 size_t prefix2_len
= strcspn (name2
, "?*[");
809 size_t min_prefix_len
;
811 /* Note that if there is no wildcard character, then we treat the
812 terminating 0 as part of the prefix. Thus ".text" won't match
813 ".text." or ".text.*", for example. */
814 if (name1
[prefix1_len
] == '\0')
816 if (name2
[prefix2_len
] == '\0')
819 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
821 return memcmp (name1
, name2
, min_prefix_len
) == 0;
824 /* Select specialized code to handle various kinds of wildcard
828 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
831 int wild_name_count
= 0;
832 struct wildcard_list
*sec
;
836 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
837 ptr
->handler_data
[0] = NULL
;
838 ptr
->handler_data
[1] = NULL
;
839 ptr
->handler_data
[2] = NULL
;
840 ptr
->handler_data
[3] = NULL
;
843 /* Count how many wildcard_specs there are, and how many of those
844 actually use wildcards in the name. Also, bail out if any of the
845 wildcard names are NULL. (Can this actually happen?
846 walk_wild_section used to test for it.) And bail out if any
847 of the wildcards are more complex than a simple string
848 ending in a single '*'. */
849 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
852 if (sec
->spec
.name
== NULL
)
854 if (wildcardp (sec
->spec
.name
))
857 if (!is_simple_wild (sec
->spec
.name
))
862 /* The zero-spec case would be easy to optimize but it doesn't
863 happen in practice. Likewise, more than 4 specs doesn't
864 happen in practice. */
865 if (sec_count
== 0 || sec_count
> 4)
868 /* Check that no two specs can match the same section. */
869 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
871 struct wildcard_list
*sec2
;
872 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
874 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
879 signature
= (sec_count
<< 8) + wild_name_count
;
883 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
886 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
889 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
892 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
895 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
901 /* Now fill the data array with pointers to the specs, first the
902 specs with non-wildcard names, then the specs with wildcard
903 names. It's OK to process the specs in different order from the
904 given order, because we've already determined that no section
905 will match more than one spec. */
907 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
908 if (!wildcardp (sec
->spec
.name
))
909 ptr
->handler_data
[data_counter
++] = sec
;
910 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
911 if (wildcardp (sec
->spec
.name
))
912 ptr
->handler_data
[data_counter
++] = sec
;
915 /* Handle a wild statement for a single file F. */
918 walk_wild_file (lang_wild_statement_type
*s
,
919 lang_input_statement_type
*f
,
923 if (walk_wild_file_in_exclude_list (s
->exclude_name_list
, f
))
926 if (f
->the_bfd
== NULL
927 || !bfd_check_format (f
->the_bfd
, bfd_archive
))
928 walk_wild_section (s
, f
, callback
, data
);
933 /* This is an archive file. We must map each member of the
934 archive separately. */
935 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
936 while (member
!= NULL
)
938 /* When lookup_name is called, it will call the add_symbols
939 entry point for the archive. For each element of the
940 archive which is included, BFD will call ldlang_add_file,
941 which will set the usrdata field of the member to the
942 lang_input_statement. */
943 if (bfd_usrdata (member
) != NULL
)
944 walk_wild_section (s
, bfd_usrdata (member
), callback
, data
);
946 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
952 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
954 const char *file_spec
= s
->filename
;
957 if (file_spec
== NULL
)
959 /* Perform the iteration over all files in the list. */
960 LANG_FOR_EACH_INPUT_STATEMENT (f
)
962 walk_wild_file (s
, f
, callback
, data
);
965 else if ((p
= archive_path (file_spec
)) != NULL
)
967 LANG_FOR_EACH_INPUT_STATEMENT (f
)
969 if (input_statement_is_archive_path (file_spec
, p
, f
))
970 walk_wild_file (s
, f
, callback
, data
);
973 else if (wildcardp (file_spec
))
975 LANG_FOR_EACH_INPUT_STATEMENT (f
)
977 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
978 walk_wild_file (s
, f
, callback
, data
);
983 lang_input_statement_type
*f
;
985 /* Perform the iteration over a single file. */
986 f
= lookup_name (file_spec
);
988 walk_wild_file (s
, f
, callback
, data
);
992 /* lang_for_each_statement walks the parse tree and calls the provided
993 function for each node, except those inside output section statements
994 with constraint set to -1. */
997 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
998 lang_statement_union_type
*s
)
1000 for (; s
!= NULL
; s
= s
->header
.next
)
1004 switch (s
->header
.type
)
1006 case lang_constructors_statement_enum
:
1007 lang_for_each_statement_worker (func
, constructor_list
.head
);
1009 case lang_output_section_statement_enum
:
1010 if (s
->output_section_statement
.constraint
!= -1)
1011 lang_for_each_statement_worker
1012 (func
, s
->output_section_statement
.children
.head
);
1014 case lang_wild_statement_enum
:
1015 lang_for_each_statement_worker (func
,
1016 s
->wild_statement
.children
.head
);
1018 case lang_group_statement_enum
:
1019 lang_for_each_statement_worker (func
,
1020 s
->group_statement
.children
.head
);
1022 case lang_data_statement_enum
:
1023 case lang_reloc_statement_enum
:
1024 case lang_object_symbols_statement_enum
:
1025 case lang_output_statement_enum
:
1026 case lang_target_statement_enum
:
1027 case lang_input_section_enum
:
1028 case lang_input_statement_enum
:
1029 case lang_assignment_statement_enum
:
1030 case lang_padding_statement_enum
:
1031 case lang_address_statement_enum
:
1032 case lang_fill_statement_enum
:
1033 case lang_insert_statement_enum
:
1043 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
1045 lang_for_each_statement_worker (func
, statement_list
.head
);
1048 /*----------------------------------------------------------------------*/
1051 lang_list_init (lang_statement_list_type
*list
)
1054 list
->tail
= &list
->head
;
1058 lang_statement_append (lang_statement_list_type
*list
,
1062 *(list
->tail
) = element
;
1067 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1069 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1071 *stat_save_ptr
++ = stat_ptr
;
1078 if (stat_save_ptr
<= stat_save
)
1080 stat_ptr
= *--stat_save_ptr
;
1083 /* Build a new statement node for the parse tree. */
1085 static lang_statement_union_type
*
1086 new_statement (enum statement_enum type
,
1088 lang_statement_list_type
*list
)
1090 lang_statement_union_type
*new_stmt
;
1092 new_stmt
= stat_alloc (size
);
1093 new_stmt
->header
.type
= type
;
1094 new_stmt
->header
.next
= NULL
;
1095 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1099 /* Build a new input file node for the language. There are several
1100 ways in which we treat an input file, eg, we only look at symbols,
1101 or prefix it with a -l etc.
1103 We can be supplied with requests for input files more than once;
1104 they may, for example be split over several lines like foo.o(.text)
1105 foo.o(.data) etc, so when asked for a file we check that we haven't
1106 got it already so we don't duplicate the bfd. */
1108 static lang_input_statement_type
*
1109 new_afile (const char *name
,
1110 lang_input_file_enum_type file_type
,
1112 const char *from_filename
)
1114 lang_input_statement_type
*p
;
1116 lang_has_input_file
= true;
1118 p
= new_stat (lang_input_statement
, stat_ptr
);
1119 memset (&p
->the_bfd
, 0,
1120 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1121 p
->extra_search_path
= NULL
;
1123 p
->flags
.dynamic
= input_flags
.dynamic
;
1124 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1125 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1126 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1127 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1131 case lang_input_file_is_symbols_only_enum
:
1133 p
->local_sym_name
= name
;
1134 p
->flags
.real
= true;
1135 p
->flags
.just_syms
= true;
1137 case lang_input_file_is_fake_enum
:
1139 p
->local_sym_name
= name
;
1141 case lang_input_file_is_l_enum
:
1142 if (name
[0] == ':' && name
[1] != '\0')
1144 p
->filename
= name
+ 1;
1145 p
->flags
.full_name_provided
= true;
1149 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1150 p
->flags
.maybe_archive
= true;
1151 p
->flags
.real
= true;
1152 p
->flags
.search_dirs
= true;
1154 case lang_input_file_is_marker_enum
:
1156 p
->local_sym_name
= name
;
1157 p
->flags
.search_dirs
= true;
1159 case lang_input_file_is_search_file_enum
:
1161 p
->local_sym_name
= name
;
1162 /* If name is a relative path, search the directory of the current linker
1164 if (from_filename
&& !IS_ABSOLUTE_PATH (name
))
1165 p
->extra_search_path
= ldirname (from_filename
);
1166 p
->flags
.real
= true;
1167 p
->flags
.search_dirs
= true;
1169 case lang_input_file_is_file_enum
:
1171 p
->local_sym_name
= name
;
1172 p
->flags
.real
= true;
1178 lang_statement_append (&input_file_chain
, p
, &p
->next_real_file
);
1182 lang_input_statement_type
*
1183 lang_add_input_file (const char *name
,
1184 lang_input_file_enum_type file_type
,
1188 && (*name
== '=' || startswith (name
, "$SYSROOT")))
1190 lang_input_statement_type
*ret
;
1191 char *sysrooted_name
1192 = concat (ld_sysroot
,
1193 name
+ (*name
== '=' ? 1 : strlen ("$SYSROOT")),
1194 (const char *) NULL
);
1196 /* We've now forcibly prepended the sysroot, making the input
1197 file independent of the context. Therefore, temporarily
1198 force a non-sysrooted context for this statement, so it won't
1199 get the sysroot prepended again when opened. (N.B. if it's a
1200 script, any child nodes with input files starting with "/"
1201 will be handled as "sysrooted" as they'll be found to be
1202 within the sysroot subdirectory.) */
1203 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1204 input_flags
.sysrooted
= 0;
1205 ret
= new_afile (sysrooted_name
, file_type
, target
, NULL
);
1206 input_flags
.sysrooted
= outer_sysrooted
;
1210 return new_afile (name
, file_type
, target
, current_input_file
);
1213 struct out_section_hash_entry
1215 struct bfd_hash_entry root
;
1216 lang_statement_union_type s
;
1219 /* The hash table. */
1221 static struct bfd_hash_table output_section_statement_table
;
1223 /* Support routines for the hash table used by lang_output_section_find,
1224 initialize the table, fill in an entry and remove the table. */
1226 static struct bfd_hash_entry
*
1227 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1228 struct bfd_hash_table
*table
,
1231 lang_output_section_statement_type
**nextp
;
1232 struct out_section_hash_entry
*ret
;
1236 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1242 entry
= bfd_hash_newfunc (entry
, table
, string
);
1246 ret
= (struct out_section_hash_entry
*) entry
;
1247 memset (&ret
->s
, 0, sizeof (ret
->s
));
1248 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1249 ret
->s
.output_section_statement
.subsection_alignment
= NULL
;
1250 ret
->s
.output_section_statement
.section_alignment
= NULL
;
1251 ret
->s
.output_section_statement
.block_value
= 1;
1252 lang_list_init (&ret
->s
.output_section_statement
.children
);
1253 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1255 /* For every output section statement added to the list, except the
1256 first one, lang_os_list.tail points to the "next"
1257 field of the last element of the list. */
1258 if (lang_os_list
.head
!= NULL
)
1259 ret
->s
.output_section_statement
.prev
1260 = ((lang_output_section_statement_type
*)
1261 ((char *) lang_os_list
.tail
1262 - offsetof (lang_output_section_statement_type
, next
)));
1264 /* GCC's strict aliasing rules prevent us from just casting the
1265 address, so we store the pointer in a variable and cast that
1267 nextp
= &ret
->s
.output_section_statement
.next
;
1268 lang_statement_append (&lang_os_list
, &ret
->s
, nextp
);
1273 output_section_statement_table_init (void)
1275 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1276 output_section_statement_newfunc
,
1277 sizeof (struct out_section_hash_entry
),
1279 einfo (_("%F%P: can not create hash table: %E\n"));
1283 output_section_statement_table_free (void)
1285 bfd_hash_table_free (&output_section_statement_table
);
1288 /* Build enough state so that the parser can build its tree. */
1293 obstack_begin (&stat_obstack
, 1000);
1295 stat_ptr
= &statement_list
;
1297 output_section_statement_table_init ();
1299 lang_list_init (stat_ptr
);
1301 lang_list_init (&input_file_chain
);
1302 lang_list_init (&lang_os_list
);
1303 lang_list_init (&file_chain
);
1304 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1306 abs_output_section
=
1307 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, 1);
1309 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1311 asneeded_list_head
= NULL
;
1312 asneeded_list_tail
= &asneeded_list_head
;
1318 output_section_statement_table_free ();
1321 /*----------------------------------------------------------------------
1322 A region is an area of memory declared with the
1323 MEMORY { name:org=exp, len=exp ... }
1326 We maintain a list of all the regions here.
1328 If no regions are specified in the script, then the default is used
1329 which is created when looked up to be the entire data space.
1331 If create is true we are creating a region inside a MEMORY block.
1332 In this case it is probably an error to create a region that has
1333 already been created. If we are not inside a MEMORY block it is
1334 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1335 and so we issue a warning.
1337 Each region has at least one name. The first name is either
1338 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1339 alias names to an existing region within a script with
1340 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1343 static lang_memory_region_type
*lang_memory_region_list
;
1344 static lang_memory_region_type
**lang_memory_region_list_tail
1345 = &lang_memory_region_list
;
1347 lang_memory_region_type
*
1348 lang_memory_region_lookup (const char *const name
, bool create
)
1350 lang_memory_region_name
*n
;
1351 lang_memory_region_type
*r
;
1352 lang_memory_region_type
*new_region
;
1354 /* NAME is NULL for LMA memspecs if no region was specified. */
1358 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1359 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1360 if (strcmp (n
->name
, name
) == 0)
1363 einfo (_("%P:%pS: warning: redeclaration of memory region `%s'\n"),
1368 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1369 einfo (_("%P:%pS: warning: memory region `%s' not declared\n"),
1372 new_region
= stat_alloc (sizeof (lang_memory_region_type
));
1374 new_region
->name_list
.name
= xstrdup (name
);
1375 new_region
->name_list
.next
= NULL
;
1376 new_region
->next
= NULL
;
1377 new_region
->origin_exp
= NULL
;
1378 new_region
->origin
= 0;
1379 new_region
->length_exp
= NULL
;
1380 new_region
->length
= ~(bfd_size_type
) 0;
1381 new_region
->current
= 0;
1382 new_region
->last_os
= NULL
;
1383 new_region
->flags
= 0;
1384 new_region
->not_flags
= 0;
1385 new_region
->had_full_message
= false;
1387 *lang_memory_region_list_tail
= new_region
;
1388 lang_memory_region_list_tail
= &new_region
->next
;
1394 lang_memory_region_alias (const char *alias
, const char *region_name
)
1396 lang_memory_region_name
*n
;
1397 lang_memory_region_type
*r
;
1398 lang_memory_region_type
*region
;
1400 /* The default region must be unique. This ensures that it is not necessary
1401 to iterate through the name list if someone wants the check if a region is
1402 the default memory region. */
1403 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1404 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1405 einfo (_("%F%P:%pS: error: alias for default memory region\n"), NULL
);
1407 /* Look for the target region and check if the alias is not already
1410 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1411 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1413 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1415 if (strcmp (n
->name
, alias
) == 0)
1416 einfo (_("%F%P:%pS: error: redefinition of memory region "
1421 /* Check if the target region exists. */
1423 einfo (_("%F%P:%pS: error: memory region `%s' "
1424 "for alias `%s' does not exist\n"),
1425 NULL
, region_name
, alias
);
1427 /* Add alias to region name list. */
1428 n
= stat_alloc (sizeof (lang_memory_region_name
));
1429 n
->name
= xstrdup (alias
);
1430 n
->next
= region
->name_list
.next
;
1431 region
->name_list
.next
= n
;
1434 static lang_memory_region_type
*
1435 lang_memory_default (asection
*section
)
1437 lang_memory_region_type
*p
;
1439 flagword sec_flags
= section
->flags
;
1441 /* Override SEC_DATA to mean a writable section. */
1442 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1443 sec_flags
|= SEC_DATA
;
1445 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1447 if ((p
->flags
& sec_flags
) != 0
1448 && (p
->not_flags
& sec_flags
) == 0)
1453 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, false);
1456 /* Get the output section statement directly from the userdata. */
1458 lang_output_section_statement_type
*
1459 lang_output_section_get (const asection
*output_section
)
1461 return bfd_section_userdata (output_section
);
1464 /* Find or create an output_section_statement with the given NAME.
1465 If CONSTRAINT is non-zero match one with that constraint, otherwise
1466 match any non-negative constraint. If CREATE is 0 return NULL when
1467 no match exists. If CREATE is 1, create an output_section_statement
1468 when no match exists or if CONSTRAINT is SPECIAL. If CREATE is 2,
1469 always make a new output_section_statement. */
1471 lang_output_section_statement_type
*
1472 lang_output_section_statement_lookup (const char *name
,
1476 struct out_section_hash_entry
*entry
;
1478 entry
= ((struct out_section_hash_entry
*)
1479 bfd_hash_lookup (&output_section_statement_table
, name
,
1480 create
!= 0, false));
1484 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1488 if (entry
->s
.output_section_statement
.name
!= NULL
)
1490 /* We have a section of this name, but it might not have the correct
1492 struct out_section_hash_entry
*last_ent
;
1494 name
= entry
->s
.output_section_statement
.name
;
1498 && !(create
&& constraint
== SPECIAL
)
1499 && (constraint
== entry
->s
.output_section_statement
.constraint
1501 && entry
->s
.output_section_statement
.constraint
>= 0)))
1502 return &entry
->s
.output_section_statement
;
1504 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1506 while (entry
!= NULL
1507 && name
== entry
->s
.output_section_statement
.name
);
1513 = ((struct out_section_hash_entry
*)
1514 output_section_statement_newfunc (NULL
,
1515 &output_section_statement_table
,
1519 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1522 entry
->root
= last_ent
->root
;
1523 last_ent
->root
.next
= &entry
->root
;
1526 entry
->s
.output_section_statement
.name
= name
;
1527 entry
->s
.output_section_statement
.constraint
= constraint
;
1528 entry
->s
.output_section_statement
.dup_output
= (create
== 2
1529 || constraint
== SPECIAL
);
1530 return &entry
->s
.output_section_statement
;
1533 /* Find the next output_section_statement with the same name as OS.
1534 If CONSTRAINT is non-zero, find one with that constraint otherwise
1535 match any non-negative constraint. */
1537 lang_output_section_statement_type
*
1538 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1541 /* All output_section_statements are actually part of a
1542 struct out_section_hash_entry. */
1543 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1545 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1546 const char *name
= os
->name
;
1548 ASSERT (name
== entry
->root
.string
);
1551 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1553 || name
!= entry
->s
.output_section_statement
.name
)
1556 while (constraint
!= entry
->s
.output_section_statement
.constraint
1558 || entry
->s
.output_section_statement
.constraint
< 0));
1560 return &entry
->s
.output_section_statement
;
1563 /* A variant of lang_output_section_find used by place_orphan.
1564 Returns the output statement that should precede a new output
1565 statement for SEC. If an exact match is found on certain flags,
1568 lang_output_section_statement_type
*
1569 lang_output_section_find_by_flags (const asection
*sec
,
1571 lang_output_section_statement_type
**exact
,
1572 lang_match_sec_type_func match_type
)
1574 lang_output_section_statement_type
*first
, *look
, *found
;
1575 flagword look_flags
, differ
;
1577 /* We know the first statement on this list is *ABS*. May as well
1579 first
= (void *) lang_os_list
.head
;
1580 first
= first
->next
;
1582 /* First try for an exact match. */
1584 for (look
= first
; look
; look
= look
->next
)
1586 look_flags
= look
->flags
;
1587 if (look
->bfd_section
!= NULL
)
1589 look_flags
= look
->bfd_section
->flags
;
1590 if (match_type
&& !match_type (link_info
.output_bfd
,
1595 differ
= look_flags
^ sec_flags
;
1596 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1597 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1607 if ((sec_flags
& SEC_CODE
) != 0
1608 && (sec_flags
& SEC_ALLOC
) != 0)
1610 /* Try for a rw code section. */
1611 for (look
= first
; look
; look
= look
->next
)
1613 look_flags
= look
->flags
;
1614 if (look
->bfd_section
!= NULL
)
1616 look_flags
= look
->bfd_section
->flags
;
1617 if (match_type
&& !match_type (link_info
.output_bfd
,
1622 differ
= look_flags
^ sec_flags
;
1623 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1624 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1628 else if ((sec_flags
& SEC_READONLY
) != 0
1629 && (sec_flags
& SEC_ALLOC
) != 0)
1631 /* .rodata can go after .text, .sdata2 after .rodata. */
1632 for (look
= first
; look
; look
= look
->next
)
1634 look_flags
= look
->flags
;
1635 if (look
->bfd_section
!= NULL
)
1637 look_flags
= look
->bfd_section
->flags
;
1638 if (match_type
&& !match_type (link_info
.output_bfd
,
1643 differ
= look_flags
^ sec_flags
;
1644 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1645 | SEC_READONLY
| SEC_SMALL_DATA
))
1646 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1648 && !(look_flags
& SEC_SMALL_DATA
)))
1652 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1653 && (sec_flags
& SEC_ALLOC
) != 0)
1655 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1656 as if it were a loaded section, and don't use match_type. */
1657 bool seen_thread_local
= false;
1660 for (look
= first
; look
; look
= look
->next
)
1662 look_flags
= look
->flags
;
1663 if (look
->bfd_section
!= NULL
)
1664 look_flags
= look
->bfd_section
->flags
;
1666 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1667 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1669 /* .tdata and .tbss must be adjacent and in that order. */
1670 if (!(look_flags
& SEC_LOAD
)
1671 && (sec_flags
& SEC_LOAD
))
1672 /* ..so if we're at a .tbss section and we're placing
1673 a .tdata section stop looking and return the
1674 previous section. */
1677 seen_thread_local
= true;
1679 else if (seen_thread_local
)
1681 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1685 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1686 && (sec_flags
& SEC_ALLOC
) != 0)
1688 /* .sdata goes after .data, .sbss after .sdata. */
1689 for (look
= first
; look
; look
= look
->next
)
1691 look_flags
= look
->flags
;
1692 if (look
->bfd_section
!= NULL
)
1694 look_flags
= look
->bfd_section
->flags
;
1695 if (match_type
&& !match_type (link_info
.output_bfd
,
1700 differ
= look_flags
^ sec_flags
;
1701 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1702 | SEC_THREAD_LOCAL
))
1703 || ((look_flags
& SEC_SMALL_DATA
)
1704 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1708 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1709 && (sec_flags
& SEC_ALLOC
) != 0)
1711 /* .data goes after .rodata. */
1712 for (look
= first
; look
; look
= look
->next
)
1714 look_flags
= look
->flags
;
1715 if (look
->bfd_section
!= NULL
)
1717 look_flags
= look
->bfd_section
->flags
;
1718 if (match_type
&& !match_type (link_info
.output_bfd
,
1723 differ
= look_flags
^ sec_flags
;
1724 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1725 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1729 else if ((sec_flags
& SEC_ALLOC
) != 0)
1731 /* .bss goes after any other alloc section. */
1732 for (look
= first
; look
; look
= look
->next
)
1734 look_flags
= look
->flags
;
1735 if (look
->bfd_section
!= NULL
)
1737 look_flags
= look
->bfd_section
->flags
;
1738 if (match_type
&& !match_type (link_info
.output_bfd
,
1743 differ
= look_flags
^ sec_flags
;
1744 if (!(differ
& SEC_ALLOC
))
1750 /* non-alloc go last. */
1751 for (look
= first
; look
; look
= look
->next
)
1753 look_flags
= look
->flags
;
1754 if (look
->bfd_section
!= NULL
)
1755 look_flags
= look
->bfd_section
->flags
;
1756 differ
= look_flags
^ sec_flags
;
1757 if (!(differ
& SEC_DEBUGGING
))
1763 if (found
|| !match_type
)
1766 return lang_output_section_find_by_flags (sec
, sec_flags
, NULL
, NULL
);
1769 /* Find the last output section before given output statement.
1770 Used by place_orphan. */
1773 output_prev_sec_find (lang_output_section_statement_type
*os
)
1775 lang_output_section_statement_type
*lookup
;
1777 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1779 if (lookup
->constraint
< 0)
1782 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1783 return lookup
->bfd_section
;
1789 /* Look for a suitable place for a new output section statement. The
1790 idea is to skip over anything that might be inside a SECTIONS {}
1791 statement in a script, before we find another output section
1792 statement. Assignments to "dot" before an output section statement
1793 are assumed to belong to it, except in two cases; The first
1794 assignment to dot, and assignments before non-alloc sections.
1795 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1796 similar assignments that set the initial address, or we might
1797 insert non-alloc note sections among assignments setting end of
1800 static lang_statement_union_type
**
1801 insert_os_after (lang_output_section_statement_type
*after
)
1803 lang_statement_union_type
**where
;
1804 lang_statement_union_type
**assign
= NULL
;
1807 ignore_first
= after
== (void *) lang_os_list
.head
;
1809 for (where
= &after
->header
.next
;
1811 where
= &(*where
)->header
.next
)
1813 switch ((*where
)->header
.type
)
1815 case lang_assignment_statement_enum
:
1818 lang_assignment_statement_type
*ass
;
1820 ass
= &(*where
)->assignment_statement
;
1821 if (ass
->exp
->type
.node_class
!= etree_assert
1822 && ass
->exp
->assign
.dst
[0] == '.'
1823 && ass
->exp
->assign
.dst
[1] == 0)
1827 ignore_first
= false;
1831 case lang_wild_statement_enum
:
1832 case lang_input_section_enum
:
1833 case lang_object_symbols_statement_enum
:
1834 case lang_fill_statement_enum
:
1835 case lang_data_statement_enum
:
1836 case lang_reloc_statement_enum
:
1837 case lang_padding_statement_enum
:
1838 case lang_constructors_statement_enum
:
1840 ignore_first
= false;
1842 case lang_output_section_statement_enum
:
1845 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1848 || s
->map_head
.s
== NULL
1849 || (s
->flags
& SEC_ALLOC
) != 0)
1853 case lang_input_statement_enum
:
1854 case lang_address_statement_enum
:
1855 case lang_target_statement_enum
:
1856 case lang_output_statement_enum
:
1857 case lang_group_statement_enum
:
1858 case lang_insert_statement_enum
:
1867 lang_output_section_statement_type
*
1868 lang_insert_orphan (asection
*s
,
1869 const char *secname
,
1871 lang_output_section_statement_type
*after
,
1872 struct orphan_save
*place
,
1873 etree_type
*address
,
1874 lang_statement_list_type
*add_child
)
1876 lang_statement_list_type add
;
1877 lang_output_section_statement_type
*os
;
1878 lang_output_section_statement_type
**os_tail
;
1880 /* If we have found an appropriate place for the output section
1881 statements for this orphan, add them to our own private list,
1882 inserting them later into the global statement list. */
1885 lang_list_init (&add
);
1886 push_stat_ptr (&add
);
1889 if (bfd_link_relocatable (&link_info
)
1890 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1891 address
= exp_intop (0);
1893 os_tail
= (lang_output_section_statement_type
**) lang_os_list
.tail
;
1894 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1895 NULL
, NULL
, NULL
, constraint
, 0);
1897 if (add_child
== NULL
)
1898 add_child
= &os
->children
;
1899 lang_add_section (add_child
, s
, NULL
, NULL
, os
);
1901 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1903 const char *region
= (after
->region
1904 ? after
->region
->name_list
.name
1905 : DEFAULT_MEMORY_REGION
);
1906 const char *lma_region
= (after
->lma_region
1907 ? after
->lma_region
->name_list
.name
1909 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1913 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1916 /* Restore the global list pointer. */
1920 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1922 asection
*snew
, *as
;
1923 bool place_after
= place
->stmt
== NULL
;
1924 bool insert_after
= true;
1926 snew
= os
->bfd_section
;
1928 /* Shuffle the bfd section list to make the output file look
1929 neater. This is really only cosmetic. */
1930 if (place
->section
== NULL
1931 && after
!= (void *) lang_os_list
.head
)
1933 asection
*bfd_section
= after
->bfd_section
;
1935 /* If the output statement hasn't been used to place any input
1936 sections (and thus doesn't have an output bfd_section),
1937 look for the closest prior output statement having an
1939 if (bfd_section
== NULL
)
1940 bfd_section
= output_prev_sec_find (after
);
1942 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1943 place
->section
= &bfd_section
->next
;
1946 if (place
->section
== NULL
)
1947 place
->section
= &link_info
.output_bfd
->sections
;
1949 as
= *place
->section
;
1953 /* Put the section at the end of the list. */
1955 /* Unlink the section. */
1956 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1958 /* Now tack it back on in the right place. */
1959 bfd_section_list_append (link_info
.output_bfd
, snew
);
1961 else if ((bfd_get_flavour (link_info
.output_bfd
)
1962 == bfd_target_elf_flavour
)
1963 && (bfd_get_flavour (s
->owner
)
1964 == bfd_target_elf_flavour
)
1965 && ((elf_section_type (s
) == SHT_NOTE
1966 && (s
->flags
& SEC_LOAD
) != 0)
1967 || (elf_section_type (as
) == SHT_NOTE
1968 && (as
->flags
& SEC_LOAD
) != 0)))
1970 /* Make sure that output note sections are grouped and sorted
1971 by alignments when inserting a note section or insert a
1972 section after a note section, */
1974 /* A specific section after which the output note section
1975 should be placed. */
1976 asection
*after_sec
;
1977 /* True if we need to insert the orphan section after a
1978 specific section to maintain output note section order. */
1979 bool after_sec_note
= false;
1981 static asection
*first_orphan_note
= NULL
;
1983 /* Group and sort output note section by alignments in
1986 if (elf_section_type (s
) == SHT_NOTE
1987 && (s
->flags
& SEC_LOAD
) != 0)
1989 /* Search from the beginning for the last output note
1990 section with equal or larger alignments. NB: Don't
1991 place orphan note section after non-note sections. */
1993 first_orphan_note
= NULL
;
1994 for (sec
= link_info
.output_bfd
->sections
;
1996 && !bfd_is_abs_section (sec
));
1999 && elf_section_type (sec
) == SHT_NOTE
2000 && (sec
->flags
& SEC_LOAD
) != 0)
2002 if (!first_orphan_note
)
2003 first_orphan_note
= sec
;
2004 if (sec
->alignment_power
>= s
->alignment_power
)
2007 else if (first_orphan_note
)
2009 /* Stop if there is non-note section after the first
2010 orphan note section. */
2014 /* If this will be the first orphan note section, it can
2015 be placed at the default location. */
2016 after_sec_note
= first_orphan_note
!= NULL
;
2017 if (after_sec
== NULL
&& after_sec_note
)
2019 /* If all output note sections have smaller
2020 alignments, place the section before all
2021 output orphan note sections. */
2022 after_sec
= first_orphan_note
;
2023 insert_after
= false;
2026 else if (first_orphan_note
)
2028 /* Don't place non-note sections in the middle of orphan
2030 after_sec_note
= true;
2032 for (sec
= as
->next
;
2034 && !bfd_is_abs_section (sec
));
2036 if (elf_section_type (sec
) == SHT_NOTE
2037 && (sec
->flags
& SEC_LOAD
) != 0)
2045 /* Search forward to insert OS after AFTER_SEC output
2047 lang_output_section_statement_type
*stmt
, *next
;
2049 for (stmt
= after
; stmt
!= NULL
; stmt
= next
)
2054 if (stmt
->bfd_section
== after_sec
)
2064 /* If INSERT_AFTER is FALSE, place OS before
2065 AFTER_SEC output statement. */
2066 if (next
&& next
->bfd_section
== after_sec
)
2076 /* Search backward to insert OS after AFTER_SEC output
2079 for (stmt
= after
; stmt
!= NULL
; stmt
= stmt
->prev
)
2083 if (stmt
->bfd_section
== after_sec
)
2092 /* If INSERT_AFTER is FALSE, place OS before
2093 AFTER_SEC output statement. */
2094 if (stmt
->next
->bfd_section
== after_sec
)
2104 if (after_sec
== NULL
2105 || (insert_after
&& after_sec
->next
!= snew
)
2106 || (!insert_after
&& after_sec
->prev
!= snew
))
2108 /* Unlink the section. */
2109 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2111 /* Place SNEW after AFTER_SEC. If AFTER_SEC is NULL,
2116 bfd_section_list_insert_after (link_info
.output_bfd
,
2119 bfd_section_list_insert_before (link_info
.output_bfd
,
2123 bfd_section_list_prepend (link_info
.output_bfd
, snew
);
2126 else if (as
!= snew
&& as
->prev
!= snew
)
2128 /* Unlink the section. */
2129 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2131 /* Now tack it back on in the right place. */
2132 bfd_section_list_insert_before (link_info
.output_bfd
,
2136 else if (as
!= snew
&& as
->prev
!= snew
)
2138 /* Unlink the section. */
2139 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2141 /* Now tack it back on in the right place. */
2142 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
2145 /* Save the end of this list. Further ophans of this type will
2146 follow the one we've just added. */
2147 place
->section
= &snew
->next
;
2149 /* The following is non-cosmetic. We try to put the output
2150 statements in some sort of reasonable order here, because they
2151 determine the final load addresses of the orphan sections.
2152 In addition, placing output statements in the wrong order may
2153 require extra segments. For instance, given a typical
2154 situation of all read-only sections placed in one segment and
2155 following that a segment containing all the read-write
2156 sections, we wouldn't want to place an orphan read/write
2157 section before or amongst the read-only ones. */
2158 if (add
.head
!= NULL
)
2160 lang_output_section_statement_type
*newly_added_os
;
2162 /* Place OS after AFTER if AFTER_NOTE is TRUE. */
2165 lang_statement_union_type
**where
= insert_os_after (after
);
2170 place
->os_tail
= &after
->next
;
2174 /* Put it after the last orphan statement we added. */
2175 *add
.tail
= *place
->stmt
;
2176 *place
->stmt
= add
.head
;
2179 /* Fix the global list pointer if we happened to tack our
2180 new list at the tail. */
2181 if (*stat_ptr
->tail
== add
.head
)
2182 stat_ptr
->tail
= add
.tail
;
2184 /* Save the end of this list. */
2185 place
->stmt
= add
.tail
;
2187 /* Do the same for the list of output section statements. */
2188 newly_added_os
= *os_tail
;
2190 newly_added_os
->prev
= (lang_output_section_statement_type
*)
2191 ((char *) place
->os_tail
2192 - offsetof (lang_output_section_statement_type
, next
));
2193 newly_added_os
->next
= *place
->os_tail
;
2194 if (newly_added_os
->next
!= NULL
)
2195 newly_added_os
->next
->prev
= newly_added_os
;
2196 *place
->os_tail
= newly_added_os
;
2197 place
->os_tail
= &newly_added_os
->next
;
2199 /* Fixing the global list pointer here is a little different.
2200 We added to the list in lang_enter_output_section_statement,
2201 trimmed off the new output_section_statment above when
2202 assigning *os_tail = NULL, but possibly added it back in
2203 the same place when assigning *place->os_tail. */
2204 if (*os_tail
== NULL
)
2205 lang_os_list
.tail
= (lang_statement_union_type
**) os_tail
;
2212 lang_print_asneeded (void)
2214 struct asneeded_minfo
*m
;
2216 if (asneeded_list_head
== NULL
)
2219 minfo (_("\nAs-needed library included to satisfy reference by file (symbol)\n\n"));
2221 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2225 minfo ("%s", m
->soname
);
2226 len
= strlen (m
->soname
);
2240 minfo ("%pB ", m
->ref
);
2241 minfo ("(%pT)\n", m
->name
);
2246 lang_map_flags (flagword flag
)
2248 if (flag
& SEC_ALLOC
)
2251 if (flag
& SEC_CODE
)
2254 if (flag
& SEC_READONLY
)
2257 if (flag
& SEC_DATA
)
2260 if (flag
& SEC_LOAD
)
2267 lang_memory_region_type
*m
;
2268 bool dis_header_printed
= false;
2270 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2274 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2275 || file
->flags
.just_syms
)
2278 if (config
.print_map_discarded
)
2279 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2280 if ((s
->output_section
== NULL
2281 || s
->output_section
->owner
!= link_info
.output_bfd
)
2282 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2284 if (! dis_header_printed
)
2286 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2287 dis_header_printed
= true;
2290 print_input_section (s
, true);
2294 minfo (_("\nMemory Configuration\n\n"));
2295 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2296 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2298 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2303 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2305 sprintf_vma (buf
, m
->origin
);
2306 minfo ("0x%s ", buf
);
2314 minfo ("0x%V", m
->length
);
2315 if (m
->flags
|| m
->not_flags
)
2323 lang_map_flags (m
->flags
);
2329 lang_map_flags (m
->not_flags
);
2336 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2338 if (!link_info
.reduce_memory_overheads
)
2340 obstack_begin (&map_obstack
, 1000);
2341 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2343 expld
.phase
= lang_fixed_phase_enum
;
2344 lang_statement_iteration
++;
2345 print_statements ();
2347 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
,
2352 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2353 void *info ATTRIBUTE_UNUSED
)
2355 if ((hash_entry
->type
== bfd_link_hash_defined
2356 || hash_entry
->type
== bfd_link_hash_defweak
)
2357 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2358 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2360 input_section_userdata_type
*ud
;
2361 struct map_symbol_def
*def
;
2363 ud
= bfd_section_userdata (hash_entry
->u
.def
.section
);
2366 ud
= stat_alloc (sizeof (*ud
));
2367 bfd_set_section_userdata (hash_entry
->u
.def
.section
, ud
);
2368 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2369 ud
->map_symbol_def_count
= 0;
2371 else if (!ud
->map_symbol_def_tail
)
2372 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2374 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2375 def
->entry
= hash_entry
;
2376 *(ud
->map_symbol_def_tail
) = def
;
2377 ud
->map_symbol_def_tail
= &def
->next
;
2378 ud
->map_symbol_def_count
++;
2383 /* Initialize an output section. */
2386 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2388 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2389 einfo (_("%F%P: illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2392 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2393 if (s
->bfd_section
== NULL
)
2394 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2396 if (s
->bfd_section
== NULL
)
2398 einfo (_("%F%P: output format %s cannot represent section"
2399 " called %s: %E\n"),
2400 link_info
.output_bfd
->xvec
->name
, s
->name
);
2402 s
->bfd_section
->output_section
= s
->bfd_section
;
2403 s
->bfd_section
->output_offset
= 0;
2405 /* Set the userdata of the output section to the output section
2406 statement to avoid lookup. */
2407 bfd_set_section_userdata (s
->bfd_section
, s
);
2409 /* If there is a base address, make sure that any sections it might
2410 mention are initialized. */
2411 if (s
->addr_tree
!= NULL
)
2412 exp_init_os (s
->addr_tree
);
2414 if (s
->load_base
!= NULL
)
2415 exp_init_os (s
->load_base
);
2417 /* If supplied an alignment, set it. */
2418 if (s
->section_alignment
!= NULL
)
2419 s
->bfd_section
->alignment_power
= exp_get_power (s
->section_alignment
,
2420 "section alignment");
2423 /* Make sure that all output sections mentioned in an expression are
2427 exp_init_os (etree_type
*exp
)
2429 switch (exp
->type
.node_class
)
2433 case etree_provided
:
2434 exp_init_os (exp
->assign
.src
);
2438 exp_init_os (exp
->binary
.lhs
);
2439 exp_init_os (exp
->binary
.rhs
);
2443 exp_init_os (exp
->trinary
.cond
);
2444 exp_init_os (exp
->trinary
.lhs
);
2445 exp_init_os (exp
->trinary
.rhs
);
2449 exp_init_os (exp
->assert_s
.child
);
2453 exp_init_os (exp
->unary
.child
);
2457 switch (exp
->type
.node_code
)
2463 lang_output_section_statement_type
*os
;
2465 os
= lang_output_section_find (exp
->name
.name
);
2466 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2478 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2480 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2482 /* If we are only reading symbols from this object, then we want to
2483 discard all sections. */
2484 if (entry
->flags
.just_syms
)
2486 bfd_link_just_syms (abfd
, sec
, &link_info
);
2490 /* Deal with SHF_EXCLUDE ELF sections. */
2491 if (!bfd_link_relocatable (&link_info
)
2492 && (abfd
->flags
& BFD_PLUGIN
) == 0
2493 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2494 sec
->output_section
= bfd_abs_section_ptr
;
2496 if (!(abfd
->flags
& DYNAMIC
))
2497 bfd_section_already_linked (abfd
, sec
, &link_info
);
2501 /* Returns true if SECTION is one we know will be discarded based on its
2502 section flags, otherwise returns false. */
2505 lang_discard_section_p (asection
*section
)
2508 flagword flags
= section
->flags
;
2510 /* Discard sections marked with SEC_EXCLUDE. */
2511 discard
= (flags
& SEC_EXCLUDE
) != 0;
2513 /* Discard the group descriptor sections when we're finally placing the
2514 sections from within the group. */
2515 if ((flags
& SEC_GROUP
) != 0
2516 && link_info
.resolve_section_groups
)
2519 /* Discard debugging sections if we are stripping debugging
2521 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2522 && (flags
& SEC_DEBUGGING
) != 0)
2528 /* The wild routines.
2530 These expand statements like *(.text) and foo.o to a list of
2531 explicit actions, like foo.o(.text), bar.o(.text) and
2532 foo.o(.text, .data). */
2534 /* Add SECTION to the output section OUTPUT. Do this by creating a
2535 lang_input_section statement which is placed at PTR. */
2538 lang_add_section (lang_statement_list_type
*ptr
,
2540 struct wildcard_list
*pattern
,
2541 struct flag_info
*sflag_info
,
2542 lang_output_section_statement_type
*output
)
2544 flagword flags
= section
->flags
;
2547 lang_input_section_type
*new_section
;
2548 bfd
*abfd
= link_info
.output_bfd
;
2550 /* Is this section one we know should be discarded? */
2551 discard
= lang_discard_section_p (section
);
2553 /* Discard input sections which are assigned to a section named
2554 DISCARD_SECTION_NAME. */
2555 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2560 if (section
->output_section
== NULL
)
2562 /* This prevents future calls from assigning this section. */
2563 section
->output_section
= bfd_abs_section_ptr
;
2565 else if (link_info
.non_contiguous_regions_warnings
)
2566 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions makes "
2567 "section `%pA' from '%pB' match /DISCARD/ clause.\n"),
2568 NULL
, section
, section
->owner
);
2577 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2582 if (section
->output_section
!= NULL
)
2584 if (!link_info
.non_contiguous_regions
)
2587 /* SECTION has already been handled in a special way
2588 (eg. LINK_ONCE): skip it. */
2589 if (bfd_is_abs_section (section
->output_section
))
2592 /* Already assigned to the same output section, do not process
2593 it again, to avoid creating loops between duplicate sections
2595 if (section
->output_section
== output
->bfd_section
)
2598 if (link_info
.non_contiguous_regions_warnings
&& output
->bfd_section
)
2599 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions may "
2600 "change behaviour for section `%pA' from '%pB' (assigned to "
2601 "%pA, but additional match: %pA)\n"),
2602 NULL
, section
, section
->owner
, section
->output_section
,
2603 output
->bfd_section
);
2605 /* SECTION has already been assigned to an output section, but
2606 the user allows it to be mapped to another one in case it
2607 overflows. We'll later update the actual output section in
2608 size_input_section as appropriate. */
2611 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2612 to an output section, because we want to be able to include a
2613 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2614 section (I don't know why we want to do this, but we do).
2615 build_link_order in ldwrite.c handles this case by turning
2616 the embedded SEC_NEVER_LOAD section into a fill. */
2617 flags
&= ~ SEC_NEVER_LOAD
;
2619 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2620 already been processed. One reason to do this is that on pe
2621 format targets, .text$foo sections go into .text and it's odd
2622 to see .text with SEC_LINK_ONCE set. */
2623 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2625 if (link_info
.resolve_section_groups
)
2626 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2628 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2630 else if (!bfd_link_relocatable (&link_info
))
2631 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2633 switch (output
->sectype
)
2635 case normal_section
:
2636 case overlay_section
:
2637 case first_overlay_section
:
2639 case noalloc_section
:
2640 flags
&= ~SEC_ALLOC
;
2642 case readonly_section
:
2643 flags
|= SEC_READONLY
;
2645 case noload_section
:
2647 flags
|= SEC_NEVER_LOAD
;
2648 /* Unfortunately GNU ld has managed to evolve two different
2649 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2650 alloc, no contents section. All others get a noload, noalloc
2652 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2653 flags
&= ~SEC_HAS_CONTENTS
;
2655 flags
&= ~SEC_ALLOC
;
2659 if (output
->bfd_section
== NULL
)
2660 init_os (output
, flags
);
2662 /* If SEC_READONLY is not set in the input section, then clear
2663 it from the output section. */
2664 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2666 if (output
->bfd_section
->linker_has_input
)
2668 /* Only set SEC_READONLY flag on the first input section. */
2669 flags
&= ~ SEC_READONLY
;
2671 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2672 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2673 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2674 || ((flags
& SEC_MERGE
) != 0
2675 && output
->bfd_section
->entsize
!= section
->entsize
))
2677 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2678 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2681 output
->bfd_section
->flags
|= flags
;
2683 if (!output
->bfd_section
->linker_has_input
)
2685 output
->bfd_section
->linker_has_input
= 1;
2686 /* This must happen after flags have been updated. The output
2687 section may have been created before we saw its first input
2688 section, eg. for a data statement. */
2689 bfd_init_private_section_data (section
->owner
, section
,
2690 link_info
.output_bfd
,
2691 output
->bfd_section
,
2693 if ((flags
& SEC_MERGE
) != 0)
2694 output
->bfd_section
->entsize
= section
->entsize
;
2697 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2698 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2700 /* FIXME: This value should really be obtained from the bfd... */
2701 output
->block_value
= 128;
2704 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 /* Handle wildcard sorting. This returns the lang_input_section which
2728 should follow the one we are going to create for SECTION and FILE,
2729 based on the sorting requirements of WILD. It returns NULL if the
2730 new section should just go at the end of the current list. */
2732 static lang_statement_union_type
*
2733 wild_sort (lang_wild_statement_type
*wild
,
2734 struct wildcard_list
*sec
,
2735 lang_input_statement_type
*file
,
2738 lang_statement_union_type
*l
;
2740 if (!wild
->filenames_sorted
2741 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2744 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2746 lang_input_section_type
*ls
;
2748 if (l
->header
.type
!= lang_input_section_enum
)
2750 ls
= &l
->input_section
;
2752 /* Sorting by filename takes precedence over sorting by section
2755 if (wild
->filenames_sorted
)
2757 const char *fn
, *ln
;
2761 /* The PE support for the .idata section as generated by
2762 dlltool assumes that files will be sorted by the name of
2763 the archive and then the name of the file within the
2766 if (file
->the_bfd
!= NULL
2767 && file
->the_bfd
->my_archive
!= NULL
)
2769 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2774 fn
= file
->filename
;
2778 if (ls
->section
->owner
->my_archive
!= NULL
)
2780 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2785 ln
= bfd_get_filename (ls
->section
->owner
);
2789 i
= filename_cmp (fn
, ln
);
2798 fn
= file
->filename
;
2800 ln
= bfd_get_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
))
3049 if (err
== bfd_error_file_ambiguously_recognized
)
3053 einfo (_("%P: %pB: file not recognized: %E;"
3054 " matching formats:"), entry
->the_bfd
);
3055 for (p
= matching
; *p
!= NULL
; p
++)
3059 else if (err
!= bfd_error_file_not_recognized
3061 einfo (_("%F%P: %pB: file not recognized: %E\n"), entry
->the_bfd
);
3063 bfd_close (entry
->the_bfd
);
3064 entry
->the_bfd
= NULL
;
3066 /* Try to interpret the file as a linker script. */
3067 save_flags
= input_flags
;
3068 ldfile_open_command_file (entry
->filename
);
3070 push_stat_ptr (place
);
3071 input_flags
.add_DT_NEEDED_for_regular
3072 = entry
->flags
.add_DT_NEEDED_for_regular
;
3073 input_flags
.add_DT_NEEDED_for_dynamic
3074 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
3075 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
3076 input_flags
.dynamic
= entry
->flags
.dynamic
;
3078 ldfile_assumed_script
= true;
3079 parser_input
= input_script
;
3080 current_input_file
= entry
->filename
;
3082 current_input_file
= NULL
;
3083 ldfile_assumed_script
= false;
3085 /* missing_file is sticky. sysrooted will already have been
3086 restored when seeing EOF in yyparse, but no harm to restore
3088 save_flags
.missing_file
|= input_flags
.missing_file
;
3089 input_flags
= save_flags
;
3093 entry
->flags
.loaded
= true;
3098 if (ldemul_recognized_file (entry
))
3101 /* We don't call ldlang_add_file for an archive. Instead, the
3102 add_symbols entry point will call ldlang_add_file, via the
3103 add_archive_element callback, for each element of the archive
3105 switch (bfd_get_format (entry
->the_bfd
))
3111 if (!entry
->flags
.reload
)
3112 ldlang_add_file (entry
);
3116 check_excluded_libs (entry
->the_bfd
);
3118 bfd_set_usrdata (entry
->the_bfd
, entry
);
3119 if (entry
->flags
.whole_archive
)
3127 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
3132 if (!bfd_check_format (member
, bfd_object
))
3134 einfo (_("%F%P: %pB: member %pB in archive is not an object\n"),
3135 entry
->the_bfd
, member
);
3140 if (!(*link_info
.callbacks
3141 ->add_archive_element
) (&link_info
, member
,
3142 "--whole-archive", &subsbfd
))
3145 /* Potentially, the add_archive_element hook may have set a
3146 substitute BFD for us. */
3147 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
3149 einfo (_("%F%P: %pB: error adding symbols: %E\n"), member
);
3154 entry
->flags
.loaded
= loaded
;
3160 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
3161 entry
->flags
.loaded
= true;
3163 einfo (_("%F%P: %pB: error adding symbols: %E\n"), entry
->the_bfd
);
3165 return entry
->flags
.loaded
;
3168 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
3169 may be NULL, indicating that it is a wildcard. Separate
3170 lang_input_section statements are created for each part of the
3171 expansion; they are added after the wild statement S. OUTPUT is
3172 the output section. */
3175 wild (lang_wild_statement_type
*s
,
3176 const char *target ATTRIBUTE_UNUSED
,
3177 lang_output_section_statement_type
*output
)
3179 struct wildcard_list
*sec
;
3181 if (s
->handler_data
[0]
3182 && s
->handler_data
[0]->spec
.sorted
== by_name
3183 && !s
->filenames_sorted
)
3185 lang_section_bst_type
*tree
;
3187 walk_wild (s
, output_section_callback_fast
, output
);
3192 output_section_callback_tree_to_list (s
, tree
, output
);
3197 walk_wild (s
, output_section_callback
, output
);
3199 if (default_common_section
== NULL
)
3200 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
3201 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
3203 /* Remember the section that common is going to in case we
3204 later get something which doesn't know where to put it. */
3205 default_common_section
= output
;
3210 /* Return TRUE iff target is the sought target. */
3213 get_target (const bfd_target
*target
, void *data
)
3215 const char *sought
= (const char *) data
;
3217 return strcmp (target
->name
, sought
) == 0;
3220 /* Like strcpy() but convert to lower case as well. */
3223 stricpy (char *dest
, const char *src
)
3227 while ((c
= *src
++) != 0)
3228 *dest
++ = TOLOWER (c
);
3233 /* Remove the first occurrence of needle (if any) in haystack
3237 strcut (char *haystack
, const char *needle
)
3239 haystack
= strstr (haystack
, needle
);
3245 for (src
= haystack
+ strlen (needle
); *src
;)
3246 *haystack
++ = *src
++;
3252 /* Compare two target format name strings.
3253 Return a value indicating how "similar" they are. */
3256 name_compare (const char *first
, const char *second
)
3262 copy1
= (char *) xmalloc (strlen (first
) + 1);
3263 copy2
= (char *) xmalloc (strlen (second
) + 1);
3265 /* Convert the names to lower case. */
3266 stricpy (copy1
, first
);
3267 stricpy (copy2
, second
);
3269 /* Remove size and endian strings from the name. */
3270 strcut (copy1
, "big");
3271 strcut (copy1
, "little");
3272 strcut (copy2
, "big");
3273 strcut (copy2
, "little");
3275 /* Return a value based on how many characters match,
3276 starting from the beginning. If both strings are
3277 the same then return 10 * their length. */
3278 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3279 if (copy1
[result
] == 0)
3291 /* Set by closest_target_match() below. */
3292 static const bfd_target
*winner
;
3294 /* Scan all the valid bfd targets looking for one that has the endianness
3295 requirement that was specified on the command line, and is the nearest
3296 match to the original output target. */
3299 closest_target_match (const bfd_target
*target
, void *data
)
3301 const bfd_target
*original
= (const bfd_target
*) data
;
3303 if (command_line
.endian
== ENDIAN_BIG
3304 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3307 if (command_line
.endian
== ENDIAN_LITTLE
3308 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3311 /* Must be the same flavour. */
3312 if (target
->flavour
!= original
->flavour
)
3315 /* Ignore generic big and little endian elf vectors. */
3316 if (strcmp (target
->name
, "elf32-big") == 0
3317 || strcmp (target
->name
, "elf64-big") == 0
3318 || strcmp (target
->name
, "elf32-little") == 0
3319 || strcmp (target
->name
, "elf64-little") == 0)
3322 /* If we have not found a potential winner yet, then record this one. */
3329 /* Oh dear, we now have two potential candidates for a successful match.
3330 Compare their names and choose the better one. */
3331 if (name_compare (target
->name
, original
->name
)
3332 > name_compare (winner
->name
, original
->name
))
3335 /* Keep on searching until wqe have checked them all. */
3339 /* Return the BFD target format of the first input file. */
3342 get_first_input_target (void)
3344 const char *target
= NULL
;
3346 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3348 if (s
->header
.type
== lang_input_statement_enum
3351 ldfile_open_file (s
);
3353 if (s
->the_bfd
!= NULL
3354 && bfd_check_format (s
->the_bfd
, bfd_object
))
3356 target
= bfd_get_target (s
->the_bfd
);
3368 lang_get_output_target (void)
3372 /* Has the user told us which output format to use? */
3373 if (output_target
!= NULL
)
3374 return output_target
;
3376 /* No - has the current target been set to something other than
3378 if (current_target
!= default_target
&& current_target
!= NULL
)
3379 return current_target
;
3381 /* No - can we determine the format of the first input file? */
3382 target
= get_first_input_target ();
3386 /* Failed - use the default output target. */
3387 return default_target
;
3390 /* Open the output file. */
3393 open_output (const char *name
)
3395 lang_input_statement_type
*f
;
3396 char *out
= lrealpath (name
);
3398 for (f
= (void *) input_file_chain
.head
;
3400 f
= f
->next_real_file
)
3403 char *in
= lrealpath (f
->local_sym_name
);
3404 if (filename_cmp (in
, out
) == 0)
3405 einfo (_("%F%P: input file '%s' is the same as output file\n"),
3411 output_target
= lang_get_output_target ();
3413 /* Has the user requested a particular endianness on the command
3415 if (command_line
.endian
!= ENDIAN_UNSET
)
3417 /* Get the chosen target. */
3418 const bfd_target
*target
3419 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3421 /* If the target is not supported, we cannot do anything. */
3424 enum bfd_endian desired_endian
;
3426 if (command_line
.endian
== ENDIAN_BIG
)
3427 desired_endian
= BFD_ENDIAN_BIG
;
3429 desired_endian
= BFD_ENDIAN_LITTLE
;
3431 /* See if the target has the wrong endianness. This should
3432 not happen if the linker script has provided big and
3433 little endian alternatives, but some scrips don't do
3435 if (target
->byteorder
!= desired_endian
)
3437 /* If it does, then see if the target provides
3438 an alternative with the correct endianness. */
3439 if (target
->alternative_target
!= NULL
3440 && (target
->alternative_target
->byteorder
== desired_endian
))
3441 output_target
= target
->alternative_target
->name
;
3444 /* Try to find a target as similar as possible to
3445 the default target, but which has the desired
3446 endian characteristic. */
3447 bfd_iterate_over_targets (closest_target_match
,
3450 /* Oh dear - we could not find any targets that
3451 satisfy our requirements. */
3453 einfo (_("%P: warning: could not find any targets"
3454 " that match endianness requirement\n"));
3456 output_target
= winner
->name
;
3462 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3464 if (link_info
.output_bfd
== NULL
)
3466 if (bfd_get_error () == bfd_error_invalid_target
)
3467 einfo (_("%F%P: target %s not found\n"), output_target
);
3469 einfo (_("%F%P: cannot open output file %s: %E\n"), name
);
3472 delete_output_file_on_failure
= true;
3474 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3475 einfo (_("%F%P: %s: can not make object file: %E\n"), name
);
3476 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3477 ldfile_output_architecture
,
3478 ldfile_output_machine
))
3479 einfo (_("%F%P: %s: can not set architecture: %E\n"), name
);
3481 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3482 if (link_info
.hash
== NULL
)
3483 einfo (_("%F%P: can not create hash table: %E\n"));
3485 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3489 ldlang_open_output (lang_statement_union_type
*statement
)
3491 switch (statement
->header
.type
)
3493 case lang_output_statement_enum
:
3494 ASSERT (link_info
.output_bfd
== NULL
);
3495 open_output (statement
->output_statement
.name
);
3496 ldemul_set_output_arch ();
3497 if (config
.magic_demand_paged
3498 && !bfd_link_relocatable (&link_info
))
3499 link_info
.output_bfd
->flags
|= D_PAGED
;
3501 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3502 if (config
.text_read_only
)
3503 link_info
.output_bfd
->flags
|= WP_TEXT
;
3505 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3506 if (link_info
.traditional_format
)
3507 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3509 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3512 case lang_target_statement_enum
:
3513 current_target
= statement
->target_statement
.target
;
3521 init_opb (asection
*s
)
3526 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
3528 && (s
->flags
& SEC_ELF_OCTETS
) != 0)
3531 x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3532 ldfile_output_machine
);
3534 while ((x
& 1) == 0)
3542 /* Open all the input files. */
3546 OPEN_BFD_NORMAL
= 0,
3550 #if BFD_SUPPORTS_PLUGINS
3551 static lang_input_statement_type
*plugin_insert
= NULL
;
3552 static struct bfd_link_hash_entry
*plugin_undefs
= NULL
;
3556 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3558 for (; s
!= NULL
; s
= s
->header
.next
)
3560 switch (s
->header
.type
)
3562 case lang_constructors_statement_enum
:
3563 open_input_bfds (constructor_list
.head
, mode
);
3565 case lang_output_section_statement_enum
:
3566 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3568 case lang_wild_statement_enum
:
3569 /* Maybe we should load the file's symbols. */
3570 if ((mode
& OPEN_BFD_RESCAN
) == 0
3571 && s
->wild_statement
.filename
3572 && !wildcardp (s
->wild_statement
.filename
)
3573 && !archive_path (s
->wild_statement
.filename
))
3574 lookup_name (s
->wild_statement
.filename
);
3575 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3577 case lang_group_statement_enum
:
3579 struct bfd_link_hash_entry
*undefs
;
3580 #if BFD_SUPPORTS_PLUGINS
3581 lang_input_statement_type
*plugin_insert_save
;
3584 /* We must continually search the entries in the group
3585 until no new symbols are added to the list of undefined
3590 #if BFD_SUPPORTS_PLUGINS
3591 plugin_insert_save
= plugin_insert
;
3593 undefs
= link_info
.hash
->undefs_tail
;
3594 open_input_bfds (s
->group_statement
.children
.head
,
3595 mode
| OPEN_BFD_FORCE
);
3597 while (undefs
!= link_info
.hash
->undefs_tail
3598 #if BFD_SUPPORTS_PLUGINS
3599 /* Objects inserted by a plugin, which are loaded
3600 before we hit this loop, may have added new
3602 || (plugin_insert
!= plugin_insert_save
&& plugin_undefs
)
3607 case lang_target_statement_enum
:
3608 current_target
= s
->target_statement
.target
;
3610 case lang_input_statement_enum
:
3611 if (s
->input_statement
.flags
.real
)
3613 lang_statement_union_type
**os_tail
;
3614 lang_statement_list_type add
;
3617 s
->input_statement
.target
= current_target
;
3619 /* If we are being called from within a group, and this
3620 is an archive which has already been searched, then
3621 force it to be researched unless the whole archive
3622 has been loaded already. Do the same for a rescan.
3623 Likewise reload --as-needed shared libs. */
3624 if (mode
!= OPEN_BFD_NORMAL
3625 #if BFD_SUPPORTS_PLUGINS
3626 && ((mode
& OPEN_BFD_RESCAN
) == 0
3627 || plugin_insert
== NULL
)
3629 && s
->input_statement
.flags
.loaded
3630 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3631 && ((bfd_get_format (abfd
) == bfd_archive
3632 && !s
->input_statement
.flags
.whole_archive
)
3633 || (bfd_get_format (abfd
) == bfd_object
3634 && ((abfd
->flags
) & DYNAMIC
) != 0
3635 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3636 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3637 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3639 s
->input_statement
.flags
.loaded
= false;
3640 s
->input_statement
.flags
.reload
= true;
3643 os_tail
= lang_os_list
.tail
;
3644 lang_list_init (&add
);
3646 if (!load_symbols (&s
->input_statement
, &add
))
3647 config
.make_executable
= false;
3649 if (add
.head
!= NULL
)
3651 /* If this was a script with output sections then
3652 tack any added statements on to the end of the
3653 list. This avoids having to reorder the output
3654 section statement list. Very likely the user
3655 forgot -T, and whatever we do here will not meet
3656 naive user expectations. */
3657 if (os_tail
!= lang_os_list
.tail
)
3659 einfo (_("%P: warning: %s contains output sections;"
3660 " did you forget -T?\n"),
3661 s
->input_statement
.filename
);
3662 *stat_ptr
->tail
= add
.head
;
3663 stat_ptr
->tail
= add
.tail
;
3667 *add
.tail
= s
->header
.next
;
3668 s
->header
.next
= add
.head
;
3672 #if BFD_SUPPORTS_PLUGINS
3673 /* If we have found the point at which a plugin added new
3674 files, clear plugin_insert to enable archive rescan. */
3675 if (&s
->input_statement
== plugin_insert
)
3676 plugin_insert
= NULL
;
3679 case lang_assignment_statement_enum
:
3680 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3681 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3688 /* Exit if any of the files were missing. */
3689 if (input_flags
.missing_file
)
3693 #ifdef ENABLE_LIBCTF
3694 /* Emit CTF errors and warnings. fp can be NULL to report errors/warnings
3695 that happened specifically at CTF open time. */
3697 lang_ctf_errs_warnings (ctf_dict_t
*fp
)
3699 ctf_next_t
*i
= NULL
;
3704 while ((text
= ctf_errwarning_next (fp
, &i
, &is_warning
, &err
)) != NULL
)
3706 einfo (_("%s: %s\n"), is_warning
? _("CTF warning"): _("CTF error"),
3710 if (err
!= ECTF_NEXT_END
)
3712 einfo (_("CTF error: cannot get CTF errors: `%s'\n"),
3716 /* `err' returns errors from the error/warning iterator in particular.
3717 These never assert. But if we have an fp, that could have recorded
3718 an assertion failure: assert if it has done so. */
3719 ASSERT (!fp
|| ctf_errno (fp
) != ECTF_INTERNAL
);
3722 /* Open the CTF sections in the input files with libctf: if any were opened,
3723 create a fake input file that we'll write the merged CTF data to later
3727 ldlang_open_ctf (void)
3732 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3736 /* Incoming files from the compiler have a single ctf_dict_t in them
3737 (which is presented to us by the libctf API in a ctf_archive_t
3738 wrapper): files derived from a previous relocatable link have a CTF
3739 archive containing possibly many CTF files. */
3741 if ((file
->the_ctf
= ctf_bfdopen (file
->the_bfd
, &err
)) == NULL
)
3743 if (err
!= ECTF_NOCTFDATA
)
3745 lang_ctf_errs_warnings (NULL
);
3746 einfo (_("%P: warning: CTF section in %pB not loaded; "
3747 "its types will be discarded: %s\n"), file
->the_bfd
,
3753 /* Prevent the contents of this section from being written, while
3754 requiring the section itself to be duplicated in the output, but only
3756 /* This section must exist if ctf_bfdopen() succeeded. */
3757 sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf");
3759 sect
->flags
|= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
| SEC_LINKER_CREATED
;
3762 sect
->flags
|= SEC_EXCLUDE
;
3772 if ((ctf_output
= ctf_create (&err
)) != NULL
)
3775 einfo (_("%P: warning: CTF output not created: `%s'\n"),
3778 LANG_FOR_EACH_INPUT_STATEMENT (errfile
)
3779 ctf_close (errfile
->the_ctf
);
3782 /* Merge together CTF sections. After this, only the symtab-dependent
3783 function and data object sections need adjustment. */
3786 lang_merge_ctf (void)
3788 asection
*output_sect
;
3794 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3796 /* If the section was discarded, don't waste time merging. */
3797 if (output_sect
== NULL
)
3799 ctf_dict_close (ctf_output
);
3802 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3804 ctf_close (file
->the_ctf
);
3805 file
->the_ctf
= NULL
;
3810 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3815 /* Takes ownership of file->the_ctf. */
3816 if (ctf_link_add_ctf (ctf_output
, file
->the_ctf
, file
->filename
) < 0)
3818 einfo (_("%P: warning: CTF section in %pB cannot be linked: `%s'\n"),
3819 file
->the_bfd
, ctf_errmsg (ctf_errno (ctf_output
)));
3820 ctf_close (file
->the_ctf
);
3821 file
->the_ctf
= NULL
;
3826 if (!config
.ctf_share_duplicated
)
3827 flags
= CTF_LINK_SHARE_UNCONFLICTED
;
3829 flags
= CTF_LINK_SHARE_DUPLICATED
;
3830 if (!config
.ctf_variables
)
3831 flags
|= CTF_LINK_OMIT_VARIABLES_SECTION
;
3832 if (bfd_link_relocatable (&link_info
))
3833 flags
|= CTF_LINK_NO_FILTER_REPORTED_SYMS
;
3835 if (ctf_link (ctf_output
, flags
) < 0)
3837 lang_ctf_errs_warnings (ctf_output
);
3838 einfo (_("%P: warning: CTF linking failed; "
3839 "output will have no CTF section: %s\n"),
3840 ctf_errmsg (ctf_errno (ctf_output
)));
3843 output_sect
->size
= 0;
3844 output_sect
->flags
|= SEC_EXCLUDE
;
3847 /* Output any lingering errors that didn't come from ctf_link. */
3848 lang_ctf_errs_warnings (ctf_output
);
3851 /* Let the emulation acquire strings from the dynamic strtab to help it optimize
3852 the CTF, if supported. */
3855 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
)
3857 ldemul_acquire_strings_for_ctf (ctf_output
, dynstrtab
);
3860 /* Inform the emulation about the addition of a new dynamic symbol, in BFD
3862 void ldlang_ctf_new_dynsym (int symidx
, struct elf_internal_sym
*sym
)
3864 ldemul_new_dynsym_for_ctf (ctf_output
, symidx
, sym
);
3867 /* Write out the CTF section. Called early, if the emulation isn't going to
3868 need to dedup against the strtab and symtab, then possibly called from the
3869 target linker code if the dedup has happened. */
3871 lang_write_ctf (int late
)
3874 asection
*output_sect
;
3881 /* Emit CTF late if this emulation says it can do so. */
3882 if (ldemul_emit_ctf_early ())
3887 if (!ldemul_emit_ctf_early ())
3891 /* Inform the emulation that all the symbols that will be received have
3894 ldemul_new_dynsym_for_ctf (ctf_output
, 0, NULL
);
3898 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3901 output_sect
->contents
= ctf_link_write (ctf_output
, &output_size
,
3902 CTF_COMPRESSION_THRESHOLD
);
3903 output_sect
->size
= output_size
;
3904 output_sect
->flags
|= SEC_IN_MEMORY
| SEC_KEEP
;
3906 lang_ctf_errs_warnings (ctf_output
);
3907 if (!output_sect
->contents
)
3909 einfo (_("%P: warning: CTF section emission failed; "
3910 "output will have no CTF section: %s\n"),
3911 ctf_errmsg (ctf_errno (ctf_output
)));
3912 output_sect
->size
= 0;
3913 output_sect
->flags
|= SEC_EXCLUDE
;
3917 /* This also closes every CTF input file used in the link. */
3918 ctf_dict_close (ctf_output
);
3921 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3922 file
->the_ctf
= NULL
;
3925 /* Write out the CTF section late, if the emulation needs that. */
3928 ldlang_write_ctf_late (void)
3930 /* Trigger a "late call", if the emulation needs one. */
3936 ldlang_open_ctf (void)
3938 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3942 /* If built without CTF, warn and delete all CTF sections from the output.
3943 (The alternative would be to simply concatenate them, which does not
3944 yield a valid CTF section.) */
3946 if ((sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf")) != NULL
)
3948 einfo (_("%P: warning: CTF section in %pB not linkable: "
3949 "%P was built without support for CTF\n"), file
->the_bfd
);
3951 sect
->flags
|= SEC_EXCLUDE
;
3956 static void lang_merge_ctf (void) {}
3958 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
3959 ATTRIBUTE_UNUSED
) {}
3961 ldlang_ctf_new_dynsym (int symidx ATTRIBUTE_UNUSED
,
3962 struct elf_internal_sym
*sym ATTRIBUTE_UNUSED
) {}
3963 static void lang_write_ctf (int late ATTRIBUTE_UNUSED
) {}
3964 void ldlang_write_ctf_late (void) {}
3967 /* Add the supplied name to the symbol table as an undefined reference.
3968 This is a two step process as the symbol table doesn't even exist at
3969 the time the ld command line is processed. First we put the name
3970 on a list, then, once the output file has been opened, transfer the
3971 name to the symbol table. */
3973 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3975 #define ldlang_undef_chain_list_head entry_symbol.next
3978 ldlang_add_undef (const char *const name
, bool cmdline ATTRIBUTE_UNUSED
)
3980 ldlang_undef_chain_list_type
*new_undef
;
3982 new_undef
= stat_alloc (sizeof (*new_undef
));
3983 new_undef
->next
= ldlang_undef_chain_list_head
;
3984 ldlang_undef_chain_list_head
= new_undef
;
3986 new_undef
->name
= xstrdup (name
);
3988 if (link_info
.output_bfd
!= NULL
)
3989 insert_undefined (new_undef
->name
);
3992 /* Insert NAME as undefined in the symbol table. */
3995 insert_undefined (const char *name
)
3997 struct bfd_link_hash_entry
*h
;
3999 h
= bfd_link_hash_lookup (link_info
.hash
, name
, true, false, true);
4001 einfo (_("%F%P: bfd_link_hash_lookup failed: %E\n"));
4002 if (h
->type
== bfd_link_hash_new
)
4004 h
->type
= bfd_link_hash_undefined
;
4005 h
->u
.undef
.abfd
= NULL
;
4006 h
->non_ir_ref_regular
= true;
4007 bfd_link_add_undef (link_info
.hash
, h
);
4011 /* Run through the list of undefineds created above and place them
4012 into the linker hash table as undefined symbols belonging to the
4016 lang_place_undefineds (void)
4018 ldlang_undef_chain_list_type
*ptr
;
4020 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
4021 insert_undefined (ptr
->name
);
4024 /* Mark -u symbols against garbage collection. */
4027 lang_mark_undefineds (void)
4029 ldlang_undef_chain_list_type
*ptr
;
4031 if (is_elf_hash_table (link_info
.hash
))
4032 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
4034 struct elf_link_hash_entry
*h
= (struct elf_link_hash_entry
*)
4035 bfd_link_hash_lookup (link_info
.hash
, ptr
->name
, false, false, true);
4041 /* Structure used to build the list of symbols that the user has required
4044 struct require_defined_symbol
4047 struct require_defined_symbol
*next
;
4050 /* The list of symbols that the user has required be defined. */
4052 static struct require_defined_symbol
*require_defined_symbol_list
;
4054 /* Add a new symbol NAME to the list of symbols that are required to be
4058 ldlang_add_require_defined (const char *const name
)
4060 struct require_defined_symbol
*ptr
;
4062 ldlang_add_undef (name
, true);
4063 ptr
= stat_alloc (sizeof (*ptr
));
4064 ptr
->next
= require_defined_symbol_list
;
4065 ptr
->name
= strdup (name
);
4066 require_defined_symbol_list
= ptr
;
4069 /* Check that all symbols the user required to be defined, are defined,
4070 raise an error if we find a symbol that is not defined. */
4073 ldlang_check_require_defined_symbols (void)
4075 struct require_defined_symbol
*ptr
;
4077 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
4079 struct bfd_link_hash_entry
*h
;
4081 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
4082 false, false, true);
4084 || (h
->type
!= bfd_link_hash_defined
4085 && h
->type
!= bfd_link_hash_defweak
))
4086 einfo(_("%X%P: required symbol `%s' not defined\n"), ptr
->name
);
4090 /* Check for all readonly or some readwrite sections. */
4093 check_input_sections
4094 (lang_statement_union_type
*s
,
4095 lang_output_section_statement_type
*output_section_statement
)
4097 for (; s
!= NULL
; s
= s
->header
.next
)
4099 switch (s
->header
.type
)
4101 case lang_wild_statement_enum
:
4102 walk_wild (&s
->wild_statement
, check_section_callback
,
4103 output_section_statement
);
4104 if (!output_section_statement
->all_input_readonly
)
4107 case lang_constructors_statement_enum
:
4108 check_input_sections (constructor_list
.head
,
4109 output_section_statement
);
4110 if (!output_section_statement
->all_input_readonly
)
4113 case lang_group_statement_enum
:
4114 check_input_sections (s
->group_statement
.children
.head
,
4115 output_section_statement
);
4116 if (!output_section_statement
->all_input_readonly
)
4125 /* Update wildcard statements if needed. */
4128 update_wild_statements (lang_statement_union_type
*s
)
4130 struct wildcard_list
*sec
;
4132 switch (sort_section
)
4142 for (; s
!= NULL
; s
= s
->header
.next
)
4144 switch (s
->header
.type
)
4149 case lang_wild_statement_enum
:
4150 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
4152 /* Don't sort .init/.fini sections. */
4153 if (strcmp (sec
->spec
.name
, ".init") != 0
4154 && strcmp (sec
->spec
.name
, ".fini") != 0)
4155 switch (sec
->spec
.sorted
)
4158 sec
->spec
.sorted
= sort_section
;
4161 if (sort_section
== by_alignment
)
4162 sec
->spec
.sorted
= by_name_alignment
;
4165 if (sort_section
== by_name
)
4166 sec
->spec
.sorted
= by_alignment_name
;
4173 case lang_constructors_statement_enum
:
4174 update_wild_statements (constructor_list
.head
);
4177 case lang_output_section_statement_enum
:
4178 update_wild_statements
4179 (s
->output_section_statement
.children
.head
);
4182 case lang_group_statement_enum
:
4183 update_wild_statements (s
->group_statement
.children
.head
);
4191 /* Open input files and attach to output sections. */
4194 map_input_to_output_sections
4195 (lang_statement_union_type
*s
, const char *target
,
4196 lang_output_section_statement_type
*os
)
4198 for (; s
!= NULL
; s
= s
->header
.next
)
4200 lang_output_section_statement_type
*tos
;
4203 switch (s
->header
.type
)
4205 case lang_wild_statement_enum
:
4206 wild (&s
->wild_statement
, target
, os
);
4208 case lang_constructors_statement_enum
:
4209 map_input_to_output_sections (constructor_list
.head
,
4213 case lang_output_section_statement_enum
:
4214 tos
= &s
->output_section_statement
;
4215 if (tos
->constraint
== ONLY_IF_RW
4216 || tos
->constraint
== ONLY_IF_RO
)
4218 tos
->all_input_readonly
= true;
4219 check_input_sections (tos
->children
.head
, tos
);
4220 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
4221 tos
->constraint
= -1;
4223 if (tos
->constraint
>= 0)
4224 map_input_to_output_sections (tos
->children
.head
,
4228 case lang_output_statement_enum
:
4230 case lang_target_statement_enum
:
4231 target
= s
->target_statement
.target
;
4233 case lang_group_statement_enum
:
4234 map_input_to_output_sections (s
->group_statement
.children
.head
,
4238 case lang_data_statement_enum
:
4239 /* Make sure that any sections mentioned in the expression
4241 exp_init_os (s
->data_statement
.exp
);
4242 /* The output section gets CONTENTS, ALLOC and LOAD, but
4243 these may be overridden by the script. */
4244 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
4245 switch (os
->sectype
)
4247 case normal_section
:
4248 case overlay_section
:
4249 case first_overlay_section
:
4251 case noalloc_section
:
4252 flags
= SEC_HAS_CONTENTS
;
4254 case readonly_section
:
4255 flags
|= SEC_READONLY
;
4257 case noload_section
:
4258 if (bfd_get_flavour (link_info
.output_bfd
)
4259 == bfd_target_elf_flavour
)
4260 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
4262 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
4265 if (os
->bfd_section
== NULL
)
4266 init_os (os
, flags
| SEC_READONLY
);
4268 os
->bfd_section
->flags
|= flags
;
4270 case lang_input_section_enum
:
4272 case lang_fill_statement_enum
:
4273 case lang_object_symbols_statement_enum
:
4274 case lang_reloc_statement_enum
:
4275 case lang_padding_statement_enum
:
4276 case lang_input_statement_enum
:
4277 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4280 case lang_assignment_statement_enum
:
4281 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4284 /* Make sure that any sections mentioned in the assignment
4286 exp_init_os (s
->assignment_statement
.exp
);
4288 case lang_address_statement_enum
:
4289 /* Mark the specified section with the supplied address.
4290 If this section was actually a segment marker, then the
4291 directive is ignored if the linker script explicitly
4292 processed the segment marker. Originally, the linker
4293 treated segment directives (like -Ttext on the
4294 command-line) as section directives. We honor the
4295 section directive semantics for backwards compatibility;
4296 linker scripts that do not specifically check for
4297 SEGMENT_START automatically get the old semantics. */
4298 if (!s
->address_statement
.segment
4299 || !s
->address_statement
.segment
->used
)
4301 const char *name
= s
->address_statement
.section_name
;
4303 /* Create the output section statement here so that
4304 orphans with a set address will be placed after other
4305 script sections. If we let the orphan placement code
4306 place them in amongst other sections then the address
4307 will affect following script sections, which is
4308 likely to surprise naive users. */
4309 tos
= lang_output_section_statement_lookup (name
, 0, 1);
4310 tos
->addr_tree
= s
->address_statement
.address
;
4311 if (tos
->bfd_section
== NULL
)
4315 case lang_insert_statement_enum
:
4321 /* An insert statement snips out all the linker statements from the
4322 start of the list and places them after the output section
4323 statement specified by the insert. This operation is complicated
4324 by the fact that we keep a doubly linked list of output section
4325 statements as well as the singly linked list of all statements.
4326 FIXME someday: Twiddling with the list not only moves statements
4327 from the user's script but also input and group statements that are
4328 built from command line object files and --start-group. We only
4329 get away with this because the list pointers used by file_chain
4330 and input_file_chain are not reordered, and processing via
4331 statement_list after this point mostly ignores input statements.
4332 One exception is the map file, where LOAD and START GROUP/END GROUP
4333 can end up looking odd. */
4336 process_insert_statements (lang_statement_union_type
**start
)
4338 lang_statement_union_type
**s
;
4339 lang_output_section_statement_type
*first_os
= NULL
;
4340 lang_output_section_statement_type
*last_os
= NULL
;
4341 lang_output_section_statement_type
*os
;
4346 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
4348 /* Keep pointers to the first and last output section
4349 statement in the sequence we may be about to move. */
4350 os
= &(*s
)->output_section_statement
;
4352 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
4355 /* Set constraint negative so that lang_output_section_find
4356 won't match this output section statement. At this
4357 stage in linking constraint has values in the range
4358 [-1, ONLY_IN_RW]. */
4359 last_os
->constraint
= -2 - last_os
->constraint
;
4360 if (first_os
== NULL
)
4363 else if ((*s
)->header
.type
== lang_group_statement_enum
)
4365 /* A user might put -T between --start-group and
4366 --end-group. One way this odd construct might arise is
4367 from a wrapper around ld to change library search
4368 behaviour. For example:
4370 exec real_ld --start-group "$@" --end-group
4371 This isn't completely unreasonable so go looking inside a
4372 group statement for insert statements. */
4373 process_insert_statements (&(*s
)->group_statement
.children
.head
);
4375 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
4377 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
4378 lang_output_section_statement_type
*where
;
4379 lang_statement_union_type
**ptr
;
4380 lang_statement_union_type
*first
;
4382 if (link_info
.non_contiguous_regions
)
4384 einfo (_("warning: INSERT statement in linker script is "
4385 "incompatible with --enable-non-contiguous-regions.\n"));
4388 where
= lang_output_section_find (i
->where
);
4389 if (where
!= NULL
&& i
->is_before
)
4392 where
= where
->prev
;
4393 while (where
!= NULL
&& where
->constraint
< 0);
4397 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
4401 /* Deal with reordering the output section statement list. */
4402 if (last_os
!= NULL
)
4404 asection
*first_sec
, *last_sec
;
4405 struct lang_output_section_statement_struct
**next
;
4407 /* Snip out the output sections we are moving. */
4408 first_os
->prev
->next
= last_os
->next
;
4409 if (last_os
->next
== NULL
)
4411 next
= &first_os
->prev
->next
;
4412 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4415 last_os
->next
->prev
= first_os
->prev
;
4416 /* Add them in at the new position. */
4417 last_os
->next
= where
->next
;
4418 if (where
->next
== NULL
)
4420 next
= &last_os
->next
;
4421 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4424 where
->next
->prev
= last_os
;
4425 first_os
->prev
= where
;
4426 where
->next
= first_os
;
4428 /* Move the bfd sections in the same way. */
4431 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4433 os
->constraint
= -2 - os
->constraint
;
4434 if (os
->bfd_section
!= NULL
4435 && os
->bfd_section
->owner
!= NULL
)
4437 last_sec
= os
->bfd_section
;
4438 if (first_sec
== NULL
)
4439 first_sec
= last_sec
;
4444 if (last_sec
!= NULL
)
4446 asection
*sec
= where
->bfd_section
;
4448 sec
= output_prev_sec_find (where
);
4450 /* The place we want to insert must come after the
4451 sections we are moving. So if we find no
4452 section or if the section is the same as our
4453 last section, then no move is needed. */
4454 if (sec
!= NULL
&& sec
!= last_sec
)
4456 /* Trim them off. */
4457 if (first_sec
->prev
!= NULL
)
4458 first_sec
->prev
->next
= last_sec
->next
;
4460 link_info
.output_bfd
->sections
= last_sec
->next
;
4461 if (last_sec
->next
!= NULL
)
4462 last_sec
->next
->prev
= first_sec
->prev
;
4464 link_info
.output_bfd
->section_last
= first_sec
->prev
;
4466 last_sec
->next
= sec
->next
;
4467 if (sec
->next
!= NULL
)
4468 sec
->next
->prev
= last_sec
;
4470 link_info
.output_bfd
->section_last
= last_sec
;
4471 first_sec
->prev
= sec
;
4472 sec
->next
= first_sec
;
4480 ptr
= insert_os_after (where
);
4481 /* Snip everything from the start of the list, up to and
4482 including the insert statement we are currently processing. */
4484 *start
= (*s
)->header
.next
;
4485 /* Add them back where they belong, minus the insert. */
4488 statement_list
.tail
= s
;
4493 s
= &(*s
)->header
.next
;
4496 /* Undo constraint twiddling. */
4497 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4499 os
->constraint
= -2 - os
->constraint
;
4505 /* An output section might have been removed after its statement was
4506 added. For example, ldemul_before_allocation can remove dynamic
4507 sections if they turn out to be not needed. Clean them up here. */
4510 strip_excluded_output_sections (void)
4512 lang_output_section_statement_type
*os
;
4514 /* Run lang_size_sections (if not already done). */
4515 if (expld
.phase
!= lang_mark_phase_enum
)
4517 expld
.phase
= lang_mark_phase_enum
;
4518 expld
.dataseg
.phase
= exp_seg_none
;
4519 one_lang_size_sections_pass (NULL
, false);
4520 lang_reset_memory_regions ();
4523 for (os
= (void *) lang_os_list
.head
;
4527 asection
*output_section
;
4530 if (os
->constraint
< 0)
4533 output_section
= os
->bfd_section
;
4534 if (output_section
== NULL
)
4537 exclude
= (output_section
->rawsize
== 0
4538 && (output_section
->flags
& SEC_KEEP
) == 0
4539 && !bfd_section_removed_from_list (link_info
.output_bfd
,
4542 /* Some sections have not yet been sized, notably .gnu.version,
4543 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
4544 input sections, so don't drop output sections that have such
4545 input sections unless they are also marked SEC_EXCLUDE. */
4546 if (exclude
&& output_section
->map_head
.s
!= NULL
)
4550 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
4551 if ((s
->flags
& SEC_EXCLUDE
) == 0
4552 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
4553 || link_info
.emitrelocations
))
4562 /* We don't set bfd_section to NULL since bfd_section of the
4563 removed output section statement may still be used. */
4564 if (!os
->update_dot
)
4566 output_section
->flags
|= SEC_EXCLUDE
;
4567 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
4568 link_info
.output_bfd
->section_count
--;
4573 /* Called from ldwrite to clear out asection.map_head and
4574 asection.map_tail for use as link_orders in ldwrite. */
4577 lang_clear_os_map (void)
4579 lang_output_section_statement_type
*os
;
4581 if (map_head_is_link_order
)
4584 for (os
= (void *) lang_os_list
.head
;
4588 asection
*output_section
;
4590 if (os
->constraint
< 0)
4593 output_section
= os
->bfd_section
;
4594 if (output_section
== NULL
)
4597 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
4598 output_section
->map_head
.link_order
= NULL
;
4599 output_section
->map_tail
.link_order
= NULL
;
4602 /* Stop future calls to lang_add_section from messing with map_head
4603 and map_tail link_order fields. */
4604 map_head_is_link_order
= true;
4608 print_output_section_statement
4609 (lang_output_section_statement_type
*output_section_statement
)
4611 asection
*section
= output_section_statement
->bfd_section
;
4614 if (output_section_statement
!= abs_output_section
)
4616 minfo ("\n%s", output_section_statement
->name
);
4618 if (section
!= NULL
)
4620 print_dot
= section
->vma
;
4622 len
= strlen (output_section_statement
->name
);
4623 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4628 while (len
< SECTION_NAME_MAP_LENGTH
)
4634 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4636 if (section
->vma
!= section
->lma
)
4637 minfo (_(" load address 0x%V"), section
->lma
);
4639 if (output_section_statement
->update_dot_tree
!= NULL
)
4640 exp_fold_tree (output_section_statement
->update_dot_tree
,
4641 bfd_abs_section_ptr
, &print_dot
);
4647 print_statement_list (output_section_statement
->children
.head
,
4648 output_section_statement
);
4652 print_assignment (lang_assignment_statement_type
*assignment
,
4653 lang_output_section_statement_type
*output_section
)
4660 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4663 if (assignment
->exp
->type
.node_class
== etree_assert
)
4666 tree
= assignment
->exp
->assert_s
.child
;
4670 const char *dst
= assignment
->exp
->assign
.dst
;
4672 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4673 tree
= assignment
->exp
;
4676 osec
= output_section
->bfd_section
;
4678 osec
= bfd_abs_section_ptr
;
4680 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4681 exp_fold_tree (tree
, osec
, &print_dot
);
4683 expld
.result
.valid_p
= false;
4685 if (expld
.result
.valid_p
)
4689 if (assignment
->exp
->type
.node_class
== etree_assert
4691 || expld
.assign_name
!= NULL
)
4693 value
= expld
.result
.value
;
4695 if (expld
.result
.section
!= NULL
)
4696 value
+= expld
.result
.section
->vma
;
4698 minfo ("0x%V", value
);
4704 struct bfd_link_hash_entry
*h
;
4706 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4707 false, false, true);
4709 && (h
->type
== bfd_link_hash_defined
4710 || h
->type
== bfd_link_hash_defweak
))
4712 value
= h
->u
.def
.value
;
4713 value
+= h
->u
.def
.section
->output_section
->vma
;
4714 value
+= h
->u
.def
.section
->output_offset
;
4716 minfo ("[0x%V]", value
);
4719 minfo ("[unresolved]");
4724 if (assignment
->exp
->type
.node_class
== etree_provide
)
4725 minfo ("[!provide]");
4732 expld
.assign_name
= NULL
;
4735 exp_print_tree (assignment
->exp
);
4740 print_input_statement (lang_input_statement_type
*statm
)
4742 if (statm
->filename
!= NULL
)
4743 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4746 /* Print all symbols defined in a particular section. This is called
4747 via bfd_link_hash_traverse, or by print_all_symbols. */
4750 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4752 asection
*sec
= (asection
*) ptr
;
4754 if ((hash_entry
->type
== bfd_link_hash_defined
4755 || hash_entry
->type
== bfd_link_hash_defweak
)
4756 && sec
== hash_entry
->u
.def
.section
)
4760 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4763 (hash_entry
->u
.def
.value
4764 + hash_entry
->u
.def
.section
->output_offset
4765 + hash_entry
->u
.def
.section
->output_section
->vma
));
4767 minfo (" %pT\n", hash_entry
->root
.string
);
4774 hash_entry_addr_cmp (const void *a
, const void *b
)
4776 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4777 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4779 if (l
->u
.def
.value
< r
->u
.def
.value
)
4781 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4788 print_all_symbols (asection
*sec
)
4790 input_section_userdata_type
*ud
= bfd_section_userdata (sec
);
4791 struct map_symbol_def
*def
;
4792 struct bfd_link_hash_entry
**entries
;
4798 *ud
->map_symbol_def_tail
= 0;
4800 /* Sort the symbols by address. */
4801 entries
= (struct bfd_link_hash_entry
**)
4802 obstack_alloc (&map_obstack
,
4803 ud
->map_symbol_def_count
* sizeof (*entries
));
4805 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4806 entries
[i
] = def
->entry
;
4808 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4809 hash_entry_addr_cmp
);
4811 /* Print the symbols. */
4812 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4813 ldemul_print_symbol (entries
[i
], sec
);
4815 obstack_free (&map_obstack
, entries
);
4818 /* Print information about an input section to the map file. */
4821 print_input_section (asection
*i
, bool is_discarded
)
4823 bfd_size_type size
= i
->size
;
4830 minfo ("%s", i
->name
);
4832 len
= 1 + strlen (i
->name
);
4833 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4838 while (len
< SECTION_NAME_MAP_LENGTH
)
4844 if (i
->output_section
!= NULL
4845 && i
->output_section
->owner
== link_info
.output_bfd
)
4846 addr
= i
->output_section
->vma
+ i
->output_offset
;
4854 minfo ("0x%V %W %pB\n", addr
, TO_ADDR (size
), i
->owner
);
4856 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4858 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4870 minfo (_("%W (size before relaxing)\n"), TO_ADDR (i
->rawsize
));
4873 if (i
->output_section
!= NULL
4874 && i
->output_section
->owner
== link_info
.output_bfd
)
4876 if (link_info
.reduce_memory_overheads
)
4877 bfd_link_hash_traverse (link_info
.hash
, ldemul_print_symbol
, i
);
4879 print_all_symbols (i
);
4881 /* Update print_dot, but make sure that we do not move it
4882 backwards - this could happen if we have overlays and a
4883 later overlay is shorter than an earier one. */
4884 if (addr
+ TO_ADDR (size
) > print_dot
)
4885 print_dot
= addr
+ TO_ADDR (size
);
4890 print_fill_statement (lang_fill_statement_type
*fill
)
4894 fputs (" FILL mask 0x", config
.map_file
);
4895 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4896 fprintf (config
.map_file
, "%02x", *p
);
4897 fputs ("\n", config
.map_file
);
4901 print_data_statement (lang_data_statement_type
*data
)
4908 init_opb (data
->output_section
);
4909 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4912 addr
= data
->output_offset
;
4913 if (data
->output_section
!= NULL
)
4914 addr
+= data
->output_section
->vma
;
4942 if (size
< TO_SIZE ((unsigned) 1))
4943 size
= TO_SIZE ((unsigned) 1);
4944 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4946 if (data
->exp
->type
.node_class
!= etree_value
)
4949 exp_print_tree (data
->exp
);
4954 print_dot
= addr
+ TO_ADDR (size
);
4957 /* Print an address statement. These are generated by options like
4961 print_address_statement (lang_address_statement_type
*address
)
4963 minfo (_("Address of section %s set to "), address
->section_name
);
4964 exp_print_tree (address
->address
);
4968 /* Print a reloc statement. */
4971 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4977 init_opb (reloc
->output_section
);
4978 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4981 addr
= reloc
->output_offset
;
4982 if (reloc
->output_section
!= NULL
)
4983 addr
+= reloc
->output_section
->vma
;
4985 size
= bfd_get_reloc_size (reloc
->howto
);
4987 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4989 if (reloc
->name
!= NULL
)
4990 minfo ("%s+", reloc
->name
);
4992 minfo ("%s+", reloc
->section
->name
);
4994 exp_print_tree (reloc
->addend_exp
);
4998 print_dot
= addr
+ TO_ADDR (size
);
5002 print_padding_statement (lang_padding_statement_type
*s
)
5007 init_opb (s
->output_section
);
5010 len
= sizeof " *fill*" - 1;
5011 while (len
< SECTION_NAME_MAP_LENGTH
)
5017 addr
= s
->output_offset
;
5018 if (s
->output_section
!= NULL
)
5019 addr
+= s
->output_section
->vma
;
5020 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
5022 if (s
->fill
->size
!= 0)
5026 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
5027 fprintf (config
.map_file
, "%02x", *p
);
5032 print_dot
= addr
+ TO_ADDR (s
->size
);
5036 print_wild_statement (lang_wild_statement_type
*w
,
5037 lang_output_section_statement_type
*os
)
5039 struct wildcard_list
*sec
;
5043 if (w
->exclude_name_list
)
5046 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
5047 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5048 minfo (" %s", tmp
->name
);
5052 if (w
->filenames_sorted
)
5053 minfo ("SORT_BY_NAME(");
5054 if (w
->filename
!= NULL
)
5055 minfo ("%s", w
->filename
);
5058 if (w
->filenames_sorted
)
5062 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
5064 int closing_paren
= 0;
5066 switch (sec
->spec
.sorted
)
5072 minfo ("SORT_BY_NAME(");
5077 minfo ("SORT_BY_ALIGNMENT(");
5081 case by_name_alignment
:
5082 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
5086 case by_alignment_name
:
5087 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
5092 minfo ("SORT_NONE(");
5096 case by_init_priority
:
5097 minfo ("SORT_BY_INIT_PRIORITY(");
5102 if (sec
->spec
.exclude_name_list
!= NULL
)
5105 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
5106 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5107 minfo (" %s", tmp
->name
);
5110 if (sec
->spec
.name
!= NULL
)
5111 minfo ("%s", sec
->spec
.name
);
5114 for (;closing_paren
> 0; closing_paren
--)
5123 print_statement_list (w
->children
.head
, os
);
5126 /* Print a group statement. */
5129 print_group (lang_group_statement_type
*s
,
5130 lang_output_section_statement_type
*os
)
5132 fprintf (config
.map_file
, "START GROUP\n");
5133 print_statement_list (s
->children
.head
, os
);
5134 fprintf (config
.map_file
, "END GROUP\n");
5137 /* Print the list of statements in S.
5138 This can be called for any statement type. */
5141 print_statement_list (lang_statement_union_type
*s
,
5142 lang_output_section_statement_type
*os
)
5146 print_statement (s
, os
);
5151 /* Print the first statement in statement list S.
5152 This can be called for any statement type. */
5155 print_statement (lang_statement_union_type
*s
,
5156 lang_output_section_statement_type
*os
)
5158 switch (s
->header
.type
)
5161 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
5164 case lang_constructors_statement_enum
:
5165 if (constructor_list
.head
!= NULL
)
5167 if (constructors_sorted
)
5168 minfo (" SORT (CONSTRUCTORS)\n");
5170 minfo (" CONSTRUCTORS\n");
5171 print_statement_list (constructor_list
.head
, os
);
5174 case lang_wild_statement_enum
:
5175 print_wild_statement (&s
->wild_statement
, os
);
5177 case lang_address_statement_enum
:
5178 print_address_statement (&s
->address_statement
);
5180 case lang_object_symbols_statement_enum
:
5181 minfo (" CREATE_OBJECT_SYMBOLS\n");
5183 case lang_fill_statement_enum
:
5184 print_fill_statement (&s
->fill_statement
);
5186 case lang_data_statement_enum
:
5187 print_data_statement (&s
->data_statement
);
5189 case lang_reloc_statement_enum
:
5190 print_reloc_statement (&s
->reloc_statement
);
5192 case lang_input_section_enum
:
5193 print_input_section (s
->input_section
.section
, false);
5195 case lang_padding_statement_enum
:
5196 print_padding_statement (&s
->padding_statement
);
5198 case lang_output_section_statement_enum
:
5199 print_output_section_statement (&s
->output_section_statement
);
5201 case lang_assignment_statement_enum
:
5202 print_assignment (&s
->assignment_statement
, os
);
5204 case lang_target_statement_enum
:
5205 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
5207 case lang_output_statement_enum
:
5208 minfo ("OUTPUT(%s", s
->output_statement
.name
);
5209 if (output_target
!= NULL
)
5210 minfo (" %s", output_target
);
5213 case lang_input_statement_enum
:
5214 print_input_statement (&s
->input_statement
);
5216 case lang_group_statement_enum
:
5217 print_group (&s
->group_statement
, os
);
5219 case lang_insert_statement_enum
:
5220 minfo ("INSERT %s %s\n",
5221 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
5222 s
->insert_statement
.where
);
5228 print_statements (void)
5230 print_statement_list (statement_list
.head
, abs_output_section
);
5233 /* Print the first N statements in statement list S to STDERR.
5234 If N == 0, nothing is printed.
5235 If N < 0, the entire list is printed.
5236 Intended to be called from GDB. */
5239 dprint_statement (lang_statement_union_type
*s
, int n
)
5241 FILE *map_save
= config
.map_file
;
5243 config
.map_file
= stderr
;
5246 print_statement_list (s
, abs_output_section
);
5249 while (s
&& --n
>= 0)
5251 print_statement (s
, abs_output_section
);
5256 config
.map_file
= map_save
;
5260 insert_pad (lang_statement_union_type
**ptr
,
5262 bfd_size_type alignment_needed
,
5263 asection
*output_section
,
5266 static fill_type zero_fill
;
5267 lang_statement_union_type
*pad
= NULL
;
5269 if (ptr
!= &statement_list
.head
)
5270 pad
= ((lang_statement_union_type
*)
5271 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
5273 && pad
->header
.type
== lang_padding_statement_enum
5274 && pad
->padding_statement
.output_section
== output_section
)
5276 /* Use the existing pad statement. */
5278 else if ((pad
= *ptr
) != NULL
5279 && pad
->header
.type
== lang_padding_statement_enum
5280 && pad
->padding_statement
.output_section
== output_section
)
5282 /* Use the existing pad statement. */
5286 /* Make a new padding statement, linked into existing chain. */
5287 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
5288 pad
->header
.next
= *ptr
;
5290 pad
->header
.type
= lang_padding_statement_enum
;
5291 pad
->padding_statement
.output_section
= output_section
;
5294 pad
->padding_statement
.fill
= fill
;
5296 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
5297 pad
->padding_statement
.size
= alignment_needed
;
5298 if (!(output_section
->flags
& SEC_FIXED_SIZE
))
5299 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
5300 - output_section
->vma
);
5303 /* Work out how much this section will move the dot point. */
5307 (lang_statement_union_type
**this_ptr
,
5308 lang_output_section_statement_type
*output_section_statement
,
5313 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
5314 asection
*i
= is
->section
;
5315 asection
*o
= output_section_statement
->bfd_section
;
5318 if (link_info
.non_contiguous_regions
)
5320 /* If the input section I has already been successfully assigned
5321 to an output section other than O, don't bother with it and
5322 let the caller remove it from the list. Keep processing in
5323 case we have already handled O, because the repeated passes
5324 have reinitialized its size. */
5325 if (i
->already_assigned
&& i
->already_assigned
!= o
)
5332 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
5333 i
->output_offset
= i
->vma
- o
->vma
;
5334 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
5335 || output_section_statement
->ignored
)
5336 i
->output_offset
= dot
- o
->vma
;
5339 bfd_size_type alignment_needed
;
5341 /* Align this section first to the input sections requirement,
5342 then to the output section's requirement. If this alignment
5343 is greater than any seen before, then record it too. Perform
5344 the alignment by inserting a magic 'padding' statement. */
5346 if (output_section_statement
->subsection_alignment
!= NULL
)
5348 = exp_get_power (output_section_statement
->subsection_alignment
,
5349 "subsection alignment");
5351 if (o
->alignment_power
< i
->alignment_power
)
5352 o
->alignment_power
= i
->alignment_power
;
5354 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
5356 if (alignment_needed
!= 0)
5358 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
5359 dot
+= alignment_needed
;
5362 if (link_info
.non_contiguous_regions
)
5364 /* If I would overflow O, let the caller remove I from the
5366 if (output_section_statement
->region
)
5368 bfd_vma end
= output_section_statement
->region
->origin
5369 + output_section_statement
->region
->length
;
5371 if (dot
+ TO_ADDR (i
->size
) > end
)
5373 if (i
->flags
& SEC_LINKER_CREATED
)
5374 einfo (_("%F%P: Output section '%s' not large enough for the "
5375 "linker-created stubs section '%s'.\n"),
5376 i
->output_section
->name
, i
->name
);
5378 if (i
->rawsize
&& i
->rawsize
!= i
->size
)
5379 einfo (_("%F%P: Relaxation not supported with "
5380 "--enable-non-contiguous-regions (section '%s' "
5381 "would overflow '%s' after it changed size).\n"),
5382 i
->name
, i
->output_section
->name
);
5386 i
->output_section
= NULL
;
5392 /* Remember where in the output section this input section goes. */
5393 i
->output_offset
= dot
- o
->vma
;
5395 /* Mark how big the output section must be to contain this now. */
5396 dot
+= TO_ADDR (i
->size
);
5397 if (!(o
->flags
& SEC_FIXED_SIZE
))
5398 o
->size
= TO_SIZE (dot
- o
->vma
);
5400 if (link_info
.non_contiguous_regions
)
5402 /* Record that I was successfully assigned to O, and update
5403 its actual output section too. */
5404 i
->already_assigned
= o
;
5405 i
->output_section
= o
;
5419 sort_sections_by_lma (const void *arg1
, const void *arg2
)
5421 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5422 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5424 if (sec1
->lma
< sec2
->lma
)
5426 else if (sec1
->lma
> sec2
->lma
)
5428 else if (sec1
->id
< sec2
->id
)
5430 else if (sec1
->id
> sec2
->id
)
5437 sort_sections_by_vma (const void *arg1
, const void *arg2
)
5439 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5440 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5442 if (sec1
->vma
< sec2
->vma
)
5444 else if (sec1
->vma
> sec2
->vma
)
5446 else if (sec1
->id
< sec2
->id
)
5448 else if (sec1
->id
> sec2
->id
)
5454 #define IS_TBSS(s) \
5455 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
5457 #define IGNORE_SECTION(s) \
5458 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
5460 /* Check to see if any allocated sections overlap with other allocated
5461 sections. This can happen if a linker script specifies the output
5462 section addresses of the two sections. Also check whether any memory
5463 region has overflowed. */
5466 lang_check_section_addresses (void)
5469 struct check_sec
*sections
;
5474 bfd_vma p_start
= 0;
5476 lang_memory_region_type
*m
;
5479 /* Detect address space overflow on allocated sections. */
5480 addr_mask
= ((bfd_vma
) 1 <<
5481 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
5482 addr_mask
= (addr_mask
<< 1) + 1;
5483 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5484 if ((s
->flags
& SEC_ALLOC
) != 0)
5486 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
5487 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
5488 einfo (_("%X%P: section %s VMA wraps around address space\n"),
5492 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
5493 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
5494 einfo (_("%X%P: section %s LMA wraps around address space\n"),
5499 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
5502 count
= bfd_count_sections (link_info
.output_bfd
);
5503 sections
= XNEWVEC (struct check_sec
, count
);
5505 /* Scan all sections in the output list. */
5507 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5509 if (IGNORE_SECTION (s
)
5513 sections
[count
].sec
= s
;
5514 sections
[count
].warned
= false;
5524 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
5526 /* First check section LMAs. There should be no overlap of LMAs on
5527 loadable sections, even with overlays. */
5528 for (p
= NULL
, i
= 0; i
< count
; i
++)
5530 s
= sections
[i
].sec
;
5532 if ((s
->flags
& SEC_LOAD
) != 0)
5535 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5537 /* Look for an overlap. We have sorted sections by lma, so
5538 we know that s_start >= p_start. Besides the obvious
5539 case of overlap when the current section starts before
5540 the previous one ends, we also must have overlap if the
5541 previous section wraps around the address space. */
5543 && (s_start
<= p_end
5544 || p_end
< p_start
))
5546 einfo (_("%X%P: section %s LMA [%V,%V]"
5547 " overlaps section %s LMA [%V,%V]\n"),
5548 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5549 sections
[i
].warned
= true;
5557 /* If any non-zero size allocated section (excluding tbss) starts at
5558 exactly the same VMA as another such section, then we have
5559 overlays. Overlays generated by the OVERLAY keyword will have
5560 this property. It is possible to intentionally generate overlays
5561 that fail this test, but it would be unusual. */
5562 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
5564 p_start
= sections
[0].sec
->vma
;
5565 for (i
= 1; i
< count
; i
++)
5567 s_start
= sections
[i
].sec
->vma
;
5568 if (p_start
== s_start
)
5576 /* Now check section VMAs if no overlays were detected. */
5579 for (p
= NULL
, i
= 0; i
< count
; i
++)
5581 s
= sections
[i
].sec
;
5584 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5587 && !sections
[i
].warned
5588 && (s_start
<= p_end
5589 || p_end
< p_start
))
5590 einfo (_("%X%P: section %s VMA [%V,%V]"
5591 " overlaps section %s VMA [%V,%V]\n"),
5592 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5601 /* If any memory region has overflowed, report by how much.
5602 We do not issue this diagnostic for regions that had sections
5603 explicitly placed outside their bounds; os_region_check's
5604 diagnostics are adequate for that case.
5606 FIXME: It is conceivable that m->current - (m->origin + m->length)
5607 might overflow a 32-bit integer. There is, alas, no way to print
5608 a bfd_vma quantity in decimal. */
5609 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
5610 if (m
->had_full_message
)
5612 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
5613 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
5614 "%X%P: region `%s' overflowed by %lu bytes\n",
5616 m
->name_list
.name
, over
);
5620 /* Make sure the new address is within the region. We explicitly permit the
5621 current address to be at the exact end of the region when the address is
5622 non-zero, in case the region is at the end of addressable memory and the
5623 calculation wraps around. */
5626 os_region_check (lang_output_section_statement_type
*os
,
5627 lang_memory_region_type
*region
,
5631 if ((region
->current
< region
->origin
5632 || (region
->current
- region
->origin
> region
->length
))
5633 && ((region
->current
!= region
->origin
+ region
->length
)
5638 einfo (_("%X%P: address 0x%v of %pB section `%s'"
5639 " is not within region `%s'\n"),
5641 os
->bfd_section
->owner
,
5642 os
->bfd_section
->name
,
5643 region
->name_list
.name
);
5645 else if (!region
->had_full_message
)
5647 region
->had_full_message
= true;
5649 einfo (_("%X%P: %pB section `%s' will not fit in region `%s'\n"),
5650 os
->bfd_section
->owner
,
5651 os
->bfd_section
->name
,
5652 region
->name_list
.name
);
5658 ldlang_check_relro_region (lang_statement_union_type
*s
,
5659 seg_align_type
*seg
)
5661 if (seg
->relro
== exp_seg_relro_start
)
5663 if (!seg
->relro_start_stat
)
5664 seg
->relro_start_stat
= s
;
5667 ASSERT (seg
->relro_start_stat
== s
);
5670 else if (seg
->relro
== exp_seg_relro_end
)
5672 if (!seg
->relro_end_stat
)
5673 seg
->relro_end_stat
= s
;
5676 ASSERT (seg
->relro_end_stat
== s
);
5681 /* Set the sizes for all the output sections. */
5684 lang_size_sections_1
5685 (lang_statement_union_type
**prev
,
5686 lang_output_section_statement_type
*output_section_statement
,
5692 lang_statement_union_type
*s
;
5693 lang_statement_union_type
*prev_s
= NULL
;
5694 bool removed_prev_s
= false;
5696 /* Size up the sections from their constituent parts. */
5697 for (s
= *prev
; s
!= NULL
; prev_s
= s
, s
= s
->header
.next
)
5699 bool removed
= false;
5701 switch (s
->header
.type
)
5703 case lang_output_section_statement_enum
:
5705 bfd_vma newdot
, after
, dotdelta
;
5706 lang_output_section_statement_type
*os
;
5707 lang_memory_region_type
*r
;
5708 int section_alignment
= 0;
5710 os
= &s
->output_section_statement
;
5711 init_opb (os
->bfd_section
);
5712 if (os
->constraint
== -1)
5715 /* FIXME: We shouldn't need to zero section vmas for ld -r
5716 here, in lang_insert_orphan, or in the default linker scripts.
5717 This is covering for coff backend linker bugs. See PR6945. */
5718 if (os
->addr_tree
== NULL
5719 && bfd_link_relocatable (&link_info
)
5720 && (bfd_get_flavour (link_info
.output_bfd
)
5721 == bfd_target_coff_flavour
))
5722 os
->addr_tree
= exp_intop (0);
5723 if (os
->addr_tree
!= NULL
)
5725 os
->processed_vma
= false;
5726 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5728 if (expld
.result
.valid_p
)
5730 dot
= expld
.result
.value
;
5731 if (expld
.result
.section
!= NULL
)
5732 dot
+= expld
.result
.section
->vma
;
5734 else if (expld
.phase
!= lang_mark_phase_enum
)
5735 einfo (_("%F%P:%pS: non constant or forward reference"
5736 " address expression for section %s\n"),
5737 os
->addr_tree
, os
->name
);
5740 if (os
->bfd_section
== NULL
)
5741 /* This section was removed or never actually created. */
5744 /* If this is a COFF shared library section, use the size and
5745 address from the input section. FIXME: This is COFF
5746 specific; it would be cleaner if there were some other way
5747 to do this, but nothing simple comes to mind. */
5748 if (((bfd_get_flavour (link_info
.output_bfd
)
5749 == bfd_target_ecoff_flavour
)
5750 || (bfd_get_flavour (link_info
.output_bfd
)
5751 == bfd_target_coff_flavour
))
5752 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5756 if (os
->children
.head
== NULL
5757 || os
->children
.head
->header
.next
!= NULL
5758 || (os
->children
.head
->header
.type
5759 != lang_input_section_enum
))
5760 einfo (_("%X%P: internal error on COFF shared library"
5761 " section %s\n"), os
->name
);
5763 input
= os
->children
.head
->input_section
.section
;
5764 bfd_set_section_vma (os
->bfd_section
,
5765 bfd_section_vma (input
));
5766 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5767 os
->bfd_section
->size
= input
->size
;
5773 if (bfd_is_abs_section (os
->bfd_section
))
5775 /* No matter what happens, an abs section starts at zero. */
5776 ASSERT (os
->bfd_section
->vma
== 0);
5780 if (os
->addr_tree
== NULL
)
5782 /* No address specified for this section, get one
5783 from the region specification. */
5784 if (os
->region
== NULL
5785 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5786 && os
->region
->name_list
.name
[0] == '*'
5787 && strcmp (os
->region
->name_list
.name
,
5788 DEFAULT_MEMORY_REGION
) == 0))
5790 os
->region
= lang_memory_default (os
->bfd_section
);
5793 /* If a loadable section is using the default memory
5794 region, and some non default memory regions were
5795 defined, issue an error message. */
5797 && !IGNORE_SECTION (os
->bfd_section
)
5798 && !bfd_link_relocatable (&link_info
)
5800 && strcmp (os
->region
->name_list
.name
,
5801 DEFAULT_MEMORY_REGION
) == 0
5802 && lang_memory_region_list
!= NULL
5803 && (strcmp (lang_memory_region_list
->name_list
.name
,
5804 DEFAULT_MEMORY_REGION
) != 0
5805 || lang_memory_region_list
->next
!= NULL
)
5806 && lang_sizing_iteration
== 1)
5808 /* By default this is an error rather than just a
5809 warning because if we allocate the section to the
5810 default memory region we can end up creating an
5811 excessively large binary, or even seg faulting when
5812 attempting to perform a negative seek. See
5813 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5814 for an example of this. This behaviour can be
5815 overridden by the using the --no-check-sections
5817 if (command_line
.check_section_addresses
)
5818 einfo (_("%F%P: error: no memory region specified"
5819 " for loadable section `%s'\n"),
5820 bfd_section_name (os
->bfd_section
));
5822 einfo (_("%P: warning: no memory region specified"
5823 " for loadable section `%s'\n"),
5824 bfd_section_name (os
->bfd_section
));
5827 newdot
= os
->region
->current
;
5828 section_alignment
= os
->bfd_section
->alignment_power
;
5831 section_alignment
= exp_get_power (os
->section_alignment
,
5832 "section alignment");
5834 /* Align to what the section needs. */
5835 if (section_alignment
> 0)
5837 bfd_vma savedot
= newdot
;
5840 newdot
= align_power (newdot
, section_alignment
);
5841 dotdelta
= newdot
- savedot
;
5843 if (lang_sizing_iteration
== 1)
5845 else if (lang_sizing_iteration
> 1)
5847 /* Only report adjustments that would change
5848 alignment from what we have already reported. */
5849 diff
= newdot
- os
->bfd_section
->vma
;
5850 if (!(diff
& (((bfd_vma
) 1 << section_alignment
) - 1)))
5854 && (config
.warn_section_align
5855 || os
->addr_tree
!= NULL
))
5856 einfo (_("%P: warning: "
5857 "start of section %s changed by %ld\n"),
5858 os
->name
, (long) diff
);
5861 bfd_set_section_vma (os
->bfd_section
, newdot
);
5863 os
->bfd_section
->output_offset
= 0;
5866 lang_size_sections_1 (&os
->children
.head
, os
,
5867 os
->fill
, newdot
, relax
, check_regions
);
5869 os
->processed_vma
= true;
5871 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5872 /* Except for some special linker created sections,
5873 no output section should change from zero size
5874 after strip_excluded_output_sections. A non-zero
5875 size on an ignored section indicates that some
5876 input section was not sized early enough. */
5877 ASSERT (os
->bfd_section
->size
== 0);
5880 dot
= os
->bfd_section
->vma
;
5882 /* Put the section within the requested block size, or
5883 align at the block boundary. */
5885 + TO_ADDR (os
->bfd_section
->size
)
5886 + os
->block_value
- 1)
5887 & - (bfd_vma
) os
->block_value
);
5889 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5890 os
->bfd_section
->size
= TO_SIZE (after
5891 - os
->bfd_section
->vma
);
5894 /* Set section lma. */
5897 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, false);
5901 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5902 os
->bfd_section
->lma
= lma
;
5904 else if (os
->lma_region
!= NULL
)
5906 bfd_vma lma
= os
->lma_region
->current
;
5908 if (os
->align_lma_with_input
)
5912 /* When LMA_REGION is the same as REGION, align the LMA
5913 as we did for the VMA, possibly including alignment
5914 from the bfd section. If a different region, then
5915 only align according to the value in the output
5917 if (os
->lma_region
!= os
->region
)
5918 section_alignment
= exp_get_power (os
->section_alignment
,
5919 "section alignment");
5920 if (section_alignment
> 0)
5921 lma
= align_power (lma
, section_alignment
);
5923 os
->bfd_section
->lma
= lma
;
5925 else if (r
->last_os
!= NULL
5926 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5931 last
= r
->last_os
->output_section_statement
.bfd_section
;
5933 /* A backwards move of dot should be accompanied by
5934 an explicit assignment to the section LMA (ie.
5935 os->load_base set) because backwards moves can
5936 create overlapping LMAs. */
5938 && os
->bfd_section
->size
!= 0
5939 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5941 /* If dot moved backwards then leave lma equal to
5942 vma. This is the old default lma, which might
5943 just happen to work when the backwards move is
5944 sufficiently large. Nag if this changes anything,
5945 so people can fix their linker scripts. */
5947 if (last
->vma
!= last
->lma
)
5948 einfo (_("%P: warning: dot moved backwards "
5949 "before `%s'\n"), os
->name
);
5953 /* If this is an overlay, set the current lma to that
5954 at the end of the previous section. */
5955 if (os
->sectype
== overlay_section
)
5956 lma
= last
->lma
+ TO_ADDR (last
->size
);
5958 /* Otherwise, keep the same lma to vma relationship
5959 as the previous section. */
5961 lma
= os
->bfd_section
->vma
+ last
->lma
- last
->vma
;
5963 if (section_alignment
> 0)
5964 lma
= align_power (lma
, section_alignment
);
5965 os
->bfd_section
->lma
= lma
;
5968 os
->processed_lma
= true;
5970 /* Keep track of normal sections using the default
5971 lma region. We use this to set the lma for
5972 following sections. Overlays or other linker
5973 script assignment to lma might mean that the
5974 default lma == vma is incorrect.
5975 To avoid warnings about dot moving backwards when using
5976 -Ttext, don't start tracking sections until we find one
5977 of non-zero size or with lma set differently to vma.
5978 Do this tracking before we short-cut the loop so that we
5979 track changes for the case where the section size is zero,
5980 but the lma is set differently to the vma. This is
5981 important, if an orphan section is placed after an
5982 otherwise empty output section that has an explicit lma
5983 set, we want that lma reflected in the orphans lma. */
5984 if (((!IGNORE_SECTION (os
->bfd_section
)
5985 && (os
->bfd_section
->size
!= 0
5986 || (r
->last_os
== NULL
5987 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5988 || (r
->last_os
!= NULL
5989 && dot
>= (r
->last_os
->output_section_statement
5990 .bfd_section
->vma
))))
5991 || os
->sectype
== first_overlay_section
)
5992 && os
->lma_region
== NULL
5993 && !bfd_link_relocatable (&link_info
))
5996 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5999 /* .tbss sections effectively have zero size. */
6000 if (!IS_TBSS (os
->bfd_section
)
6001 || bfd_link_relocatable (&link_info
))
6002 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
6007 if (os
->update_dot_tree
!= 0)
6008 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
6010 /* Update dot in the region ?
6011 We only do this if the section is going to be allocated,
6012 since unallocated sections do not contribute to the region's
6013 overall size in memory. */
6014 if (os
->region
!= NULL
6015 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
6017 os
->region
->current
= dot
;
6020 /* Make sure the new address is within the region. */
6021 os_region_check (os
, os
->region
, os
->addr_tree
,
6022 os
->bfd_section
->vma
);
6024 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
6025 && ((os
->bfd_section
->flags
& SEC_LOAD
)
6026 || os
->align_lma_with_input
))
6028 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
6031 os_region_check (os
, os
->lma_region
, NULL
,
6032 os
->bfd_section
->lma
);
6038 case lang_constructors_statement_enum
:
6039 dot
= lang_size_sections_1 (&constructor_list
.head
,
6040 output_section_statement
,
6041 fill
, dot
, relax
, check_regions
);
6044 case lang_data_statement_enum
:
6046 unsigned int size
= 0;
6048 s
->data_statement
.output_offset
=
6049 dot
- output_section_statement
->bfd_section
->vma
;
6050 s
->data_statement
.output_section
=
6051 output_section_statement
->bfd_section
;
6053 /* We might refer to provided symbols in the expression, and
6054 need to mark them as needed. */
6055 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6057 switch (s
->data_statement
.type
)
6075 if (size
< TO_SIZE ((unsigned) 1))
6076 size
= TO_SIZE ((unsigned) 1);
6077 dot
+= TO_ADDR (size
);
6078 if (!(output_section_statement
->bfd_section
->flags
6080 output_section_statement
->bfd_section
->size
6081 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6086 case lang_reloc_statement_enum
:
6090 s
->reloc_statement
.output_offset
=
6091 dot
- output_section_statement
->bfd_section
->vma
;
6092 s
->reloc_statement
.output_section
=
6093 output_section_statement
->bfd_section
;
6094 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
6095 dot
+= TO_ADDR (size
);
6096 if (!(output_section_statement
->bfd_section
->flags
6098 output_section_statement
->bfd_section
->size
6099 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6103 case lang_wild_statement_enum
:
6104 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
6105 output_section_statement
,
6106 fill
, dot
, relax
, check_regions
);
6109 case lang_object_symbols_statement_enum
:
6110 link_info
.create_object_symbols_section
6111 = output_section_statement
->bfd_section
;
6112 output_section_statement
->bfd_section
->flags
|= SEC_KEEP
;
6115 case lang_output_statement_enum
:
6116 case lang_target_statement_enum
:
6119 case lang_input_section_enum
:
6123 i
= s
->input_section
.section
;
6128 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
6129 einfo (_("%F%P: can't relax section: %E\n"));
6133 dot
= size_input_section (prev
, output_section_statement
,
6134 fill
, &removed
, dot
);
6138 case lang_input_statement_enum
:
6141 case lang_fill_statement_enum
:
6142 s
->fill_statement
.output_section
=
6143 output_section_statement
->bfd_section
;
6145 fill
= s
->fill_statement
.fill
;
6148 case lang_assignment_statement_enum
:
6150 bfd_vma newdot
= dot
;
6151 etree_type
*tree
= s
->assignment_statement
.exp
;
6153 expld
.dataseg
.relro
= exp_seg_relro_none
;
6155 exp_fold_tree (tree
,
6156 output_section_statement
->bfd_section
,
6159 ldlang_check_relro_region (s
, &expld
.dataseg
);
6161 expld
.dataseg
.relro
= exp_seg_relro_none
;
6163 /* This symbol may be relative to this section. */
6164 if ((tree
->type
.node_class
== etree_provided
6165 || tree
->type
.node_class
== etree_assign
)
6166 && (tree
->assign
.dst
[0] != '.'
6167 || tree
->assign
.dst
[1] != '\0'))
6168 output_section_statement
->update_dot
= 1;
6170 if (!output_section_statement
->ignored
)
6172 if (output_section_statement
== abs_output_section
)
6174 /* If we don't have an output section, then just adjust
6175 the default memory address. */
6176 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
6177 false)->current
= newdot
;
6179 else if (newdot
!= dot
)
6181 /* Insert a pad after this statement. We can't
6182 put the pad before when relaxing, in case the
6183 assignment references dot. */
6184 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
6185 output_section_statement
->bfd_section
, dot
);
6187 /* Don't neuter the pad below when relaxing. */
6190 /* If dot is advanced, this implies that the section
6191 should have space allocated to it, unless the
6192 user has explicitly stated that the section
6193 should not be allocated. */
6194 if (output_section_statement
->sectype
!= noalloc_section
6195 && (output_section_statement
->sectype
!= noload_section
6196 || (bfd_get_flavour (link_info
.output_bfd
)
6197 == bfd_target_elf_flavour
)))
6198 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
6205 case lang_padding_statement_enum
:
6206 /* If this is the first time lang_size_sections is called,
6207 we won't have any padding statements. If this is the
6208 second or later passes when relaxing, we should allow
6209 padding to shrink. If padding is needed on this pass, it
6210 will be added back in. */
6211 s
->padding_statement
.size
= 0;
6213 /* Make sure output_offset is valid. If relaxation shrinks
6214 the section and this pad isn't needed, it's possible to
6215 have output_offset larger than the final size of the
6216 section. bfd_set_section_contents will complain even for
6217 a pad size of zero. */
6218 s
->padding_statement
.output_offset
6219 = dot
- output_section_statement
->bfd_section
->vma
;
6222 case lang_group_statement_enum
:
6223 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
6224 output_section_statement
,
6225 fill
, dot
, relax
, check_regions
);
6228 case lang_insert_statement_enum
:
6231 /* We can only get here when relaxing is turned on. */
6232 case lang_address_statement_enum
:
6240 /* If an input section doesn't fit in the current output
6241 section, remove it from the list. Handle the case where we
6242 have to remove an input_section statement here: there is a
6243 special case to remove the first element of the list. */
6244 if (link_info
.non_contiguous_regions
&& removed
)
6246 /* If we removed the first element during the previous
6247 iteration, override the loop assignment of prev_s. */
6253 /* If there was a real previous input section, just skip
6255 prev_s
->header
.next
=s
->header
.next
;
6257 removed_prev_s
= false;
6261 /* Remove the first input section of the list. */
6262 *prev
= s
->header
.next
;
6263 removed_prev_s
= true;
6266 /* Move to next element, unless we removed the head of the
6268 if (!removed_prev_s
)
6269 prev
= &s
->header
.next
;
6273 prev
= &s
->header
.next
;
6274 removed_prev_s
= false;
6280 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
6281 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
6282 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
6283 segments. We are allowed an opportunity to override this decision. */
6286 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
6287 bfd
*abfd ATTRIBUTE_UNUSED
,
6288 asection
*current_section
,
6289 asection
*previous_section
,
6292 lang_output_section_statement_type
*cur
;
6293 lang_output_section_statement_type
*prev
;
6295 /* The checks below are only necessary when the BFD library has decided
6296 that the two sections ought to be placed into the same segment. */
6300 /* Paranoia checks. */
6301 if (current_section
== NULL
|| previous_section
== NULL
)
6304 /* If this flag is set, the target never wants code and non-code
6305 sections comingled in the same segment. */
6306 if (config
.separate_code
6307 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
6310 /* Find the memory regions associated with the two sections.
6311 We call lang_output_section_find() here rather than scanning the list
6312 of output sections looking for a matching section pointer because if
6313 we have a large number of sections then a hash lookup is faster. */
6314 cur
= lang_output_section_find (current_section
->name
);
6315 prev
= lang_output_section_find (previous_section
->name
);
6317 /* More paranoia. */
6318 if (cur
== NULL
|| prev
== NULL
)
6321 /* If the regions are different then force the sections to live in
6322 different segments. See the email thread starting at the following
6323 URL for the reasons why this is necessary:
6324 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
6325 return cur
->region
!= prev
->region
;
6329 one_lang_size_sections_pass (bool *relax
, bool check_regions
)
6331 lang_statement_iteration
++;
6332 if (expld
.phase
!= lang_mark_phase_enum
)
6333 lang_sizing_iteration
++;
6334 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
6335 0, 0, relax
, check_regions
);
6339 lang_size_segment (seg_align_type
*seg
)
6341 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
6342 a page could be saved in the data segment. */
6343 bfd_vma first
, last
;
6345 first
= -seg
->base
& (seg
->pagesize
- 1);
6346 last
= seg
->end
& (seg
->pagesize
- 1);
6348 && ((seg
->base
& ~(seg
->pagesize
- 1))
6349 != (seg
->end
& ~(seg
->pagesize
- 1)))
6350 && first
+ last
<= seg
->pagesize
)
6352 seg
->phase
= exp_seg_adjust
;
6356 seg
->phase
= exp_seg_done
;
6361 lang_size_relro_segment_1 (seg_align_type
*seg
)
6363 bfd_vma relro_end
, desired_end
;
6366 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
6367 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
6368 & ~(seg
->pagesize
- 1));
6370 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
6371 desired_end
= relro_end
- seg
->relro_offset
;
6373 /* For sections in the relro segment.. */
6374 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
6375 if ((sec
->flags
& SEC_ALLOC
) != 0
6376 && sec
->vma
>= seg
->base
6377 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
6379 /* Where do we want to put this section so that it ends as
6381 bfd_vma start
, end
, bump
;
6383 end
= start
= sec
->vma
;
6385 end
+= TO_ADDR (sec
->size
);
6386 bump
= desired_end
- end
;
6387 /* We'd like to increase START by BUMP, but we must heed
6388 alignment so the increase might be less than optimum. */
6390 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
6391 /* This is now the desired end for the previous section. */
6392 desired_end
= start
;
6395 seg
->phase
= exp_seg_relro_adjust
;
6396 ASSERT (desired_end
>= seg
->base
);
6397 seg
->base
= desired_end
;
6402 lang_size_relro_segment (bool *relax
, bool check_regions
)
6404 bool do_reset
= false;
6406 bfd_vma data_initial_base
, data_relro_end
;
6408 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6410 do_data_relro
= true;
6411 data_initial_base
= expld
.dataseg
.base
;
6412 data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
6416 do_data_relro
= false;
6417 data_initial_base
= data_relro_end
= 0;
6422 lang_reset_memory_regions ();
6423 one_lang_size_sections_pass (relax
, check_regions
);
6425 /* Assignments to dot, or to output section address in a user
6426 script have increased padding over the original. Revert. */
6427 if (do_data_relro
&& expld
.dataseg
.relro_end
> data_relro_end
)
6429 expld
.dataseg
.base
= data_initial_base
;;
6434 if (!do_data_relro
&& lang_size_segment (&expld
.dataseg
))
6441 lang_size_sections (bool *relax
, bool check_regions
)
6443 expld
.phase
= lang_allocating_phase_enum
;
6444 expld
.dataseg
.phase
= exp_seg_none
;
6446 one_lang_size_sections_pass (relax
, check_regions
);
6448 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
6449 expld
.dataseg
.phase
= exp_seg_done
;
6451 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
6454 = lang_size_relro_segment (relax
, check_regions
);
6458 lang_reset_memory_regions ();
6459 one_lang_size_sections_pass (relax
, check_regions
);
6462 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6464 link_info
.relro_start
= expld
.dataseg
.base
;
6465 link_info
.relro_end
= expld
.dataseg
.relro_end
;
6470 static lang_output_section_statement_type
*current_section
;
6471 static lang_assignment_statement_type
*current_assign
;
6472 static bool prefer_next_section
;
6474 /* Worker function for lang_do_assignments. Recursiveness goes here. */
6477 lang_do_assignments_1 (lang_statement_union_type
*s
,
6478 lang_output_section_statement_type
*current_os
,
6483 for (; s
!= NULL
; s
= s
->header
.next
)
6485 switch (s
->header
.type
)
6487 case lang_constructors_statement_enum
:
6488 dot
= lang_do_assignments_1 (constructor_list
.head
,
6489 current_os
, fill
, dot
, found_end
);
6492 case lang_output_section_statement_enum
:
6494 lang_output_section_statement_type
*os
;
6497 os
= &(s
->output_section_statement
);
6498 os
->after_end
= *found_end
;
6499 init_opb (os
->bfd_section
);
6501 if (os
->bfd_section
!= NULL
)
6503 if (!os
->ignored
&& (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
6505 current_section
= os
;
6506 prefer_next_section
= false;
6508 newdot
= os
->bfd_section
->vma
;
6510 newdot
= lang_do_assignments_1 (os
->children
.head
,
6511 os
, os
->fill
, newdot
, found_end
);
6514 if (os
->bfd_section
!= NULL
)
6516 newdot
= os
->bfd_section
->vma
;
6518 /* .tbss sections effectively have zero size. */
6519 if (!IS_TBSS (os
->bfd_section
)
6520 || bfd_link_relocatable (&link_info
))
6521 newdot
+= TO_ADDR (os
->bfd_section
->size
);
6523 if (os
->update_dot_tree
!= NULL
)
6524 exp_fold_tree (os
->update_dot_tree
,
6525 bfd_abs_section_ptr
, &newdot
);
6532 case lang_wild_statement_enum
:
6534 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
6535 current_os
, fill
, dot
, found_end
);
6538 case lang_object_symbols_statement_enum
:
6539 case lang_output_statement_enum
:
6540 case lang_target_statement_enum
:
6543 case lang_data_statement_enum
:
6544 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6545 if (expld
.result
.valid_p
)
6547 s
->data_statement
.value
= expld
.result
.value
;
6548 if (expld
.result
.section
!= NULL
)
6549 s
->data_statement
.value
+= expld
.result
.section
->vma
;
6551 else if (expld
.phase
== lang_final_phase_enum
)
6552 einfo (_("%F%P: invalid data statement\n"));
6555 switch (s
->data_statement
.type
)
6573 if (size
< TO_SIZE ((unsigned) 1))
6574 size
= TO_SIZE ((unsigned) 1);
6575 dot
+= TO_ADDR (size
);
6579 case lang_reloc_statement_enum
:
6580 exp_fold_tree (s
->reloc_statement
.addend_exp
,
6581 bfd_abs_section_ptr
, &dot
);
6582 if (expld
.result
.valid_p
)
6583 s
->reloc_statement
.addend_value
= expld
.result
.value
;
6584 else if (expld
.phase
== lang_final_phase_enum
)
6585 einfo (_("%F%P: invalid reloc statement\n"));
6586 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
6589 case lang_input_section_enum
:
6591 asection
*in
= s
->input_section
.section
;
6593 if ((in
->flags
& SEC_EXCLUDE
) == 0)
6594 dot
+= TO_ADDR (in
->size
);
6598 case lang_input_statement_enum
:
6601 case lang_fill_statement_enum
:
6602 fill
= s
->fill_statement
.fill
;
6605 case lang_assignment_statement_enum
:
6606 current_assign
= &s
->assignment_statement
;
6607 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
6609 const char *p
= current_assign
->exp
->assign
.dst
;
6611 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
6612 prefer_next_section
= true;
6616 if (strcmp (p
, "end") == 0)
6619 exp_fold_tree (s
->assignment_statement
.exp
,
6620 (current_os
->bfd_section
!= NULL
6621 ? current_os
->bfd_section
: bfd_und_section_ptr
),
6625 case lang_padding_statement_enum
:
6626 dot
+= TO_ADDR (s
->padding_statement
.size
);
6629 case lang_group_statement_enum
:
6630 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
6631 current_os
, fill
, dot
, found_end
);
6634 case lang_insert_statement_enum
:
6637 case lang_address_statement_enum
:
6649 lang_do_assignments (lang_phase_type phase
)
6651 bool found_end
= false;
6653 current_section
= NULL
;
6654 prefer_next_section
= false;
6655 expld
.phase
= phase
;
6656 lang_statement_iteration
++;
6657 lang_do_assignments_1 (statement_list
.head
,
6658 abs_output_section
, NULL
, 0, &found_end
);
6661 /* For an assignment statement outside of an output section statement,
6662 choose the best of neighbouring output sections to use for values
6666 section_for_dot (void)
6670 /* Assignments belong to the previous output section, unless there
6671 has been an assignment to "dot", in which case following
6672 assignments belong to the next output section. (The assumption
6673 is that an assignment to "dot" is setting up the address for the
6674 next output section.) Except that past the assignment to "_end"
6675 we always associate with the previous section. This exception is
6676 for targets like SH that define an alloc .stack or other
6677 weirdness after non-alloc sections. */
6678 if (current_section
== NULL
|| prefer_next_section
)
6680 lang_statement_union_type
*stmt
;
6681 lang_output_section_statement_type
*os
;
6683 for (stmt
= (lang_statement_union_type
*) current_assign
;
6685 stmt
= stmt
->header
.next
)
6686 if (stmt
->header
.type
== lang_output_section_statement_enum
)
6689 os
= &stmt
->output_section_statement
;
6692 && (os
->bfd_section
== NULL
6693 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
6694 || bfd_section_removed_from_list (link_info
.output_bfd
,
6698 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
6701 s
= os
->bfd_section
;
6703 s
= link_info
.output_bfd
->section_last
;
6705 && ((s
->flags
& SEC_ALLOC
) == 0
6706 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6711 return bfd_abs_section_ptr
;
6715 s
= current_section
->bfd_section
;
6717 /* The section may have been stripped. */
6719 && ((s
->flags
& SEC_EXCLUDE
) != 0
6720 || (s
->flags
& SEC_ALLOC
) == 0
6721 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
6722 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
6725 s
= link_info
.output_bfd
->sections
;
6727 && ((s
->flags
& SEC_ALLOC
) == 0
6728 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6733 return bfd_abs_section_ptr
;
6736 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
6738 static struct bfd_link_hash_entry
**start_stop_syms
;
6739 static size_t start_stop_count
= 0;
6740 static size_t start_stop_alloc
= 0;
6742 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6743 to start_stop_syms. */
6746 lang_define_start_stop (const char *symbol
, asection
*sec
)
6748 struct bfd_link_hash_entry
*h
;
6750 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6753 if (start_stop_count
== start_stop_alloc
)
6755 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6757 = xrealloc (start_stop_syms
,
6758 start_stop_alloc
* sizeof (*start_stop_syms
));
6760 start_stop_syms
[start_stop_count
++] = h
;
6764 /* Check for input sections whose names match references to
6765 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6766 preliminary definitions. */
6769 lang_init_start_stop (void)
6773 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6775 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6776 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6779 const char *secname
= s
->name
;
6781 for (ps
= secname
; *ps
!= '\0'; ps
++)
6782 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6786 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6788 symbol
[0] = leading_char
;
6789 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6790 lang_define_start_stop (symbol
, s
);
6792 symbol
[1] = leading_char
;
6793 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6794 lang_define_start_stop (symbol
+ 1, s
);
6801 /* Iterate over start_stop_syms. */
6804 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6808 for (i
= 0; i
< start_stop_count
; ++i
)
6809 func (start_stop_syms
[i
]);
6812 /* __start and __stop symbols are only supposed to be defined by the
6813 linker for orphan sections, but we now extend that to sections that
6814 map to an output section of the same name. The symbols were
6815 defined early for --gc-sections, before we mapped input to output
6816 sections, so undo those that don't satisfy this rule. */
6819 undef_start_stop (struct bfd_link_hash_entry
*h
)
6821 if (h
->ldscript_def
)
6824 if (h
->u
.def
.section
->output_section
== NULL
6825 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6826 || strcmp (h
->u
.def
.section
->name
,
6827 h
->u
.def
.section
->output_section
->name
) != 0)
6829 asection
*sec
= bfd_get_section_by_name (link_info
.output_bfd
,
6830 h
->u
.def
.section
->name
);
6833 /* When there are more than one input sections with the same
6834 section name, SECNAME, linker picks the first one to define
6835 __start_SECNAME and __stop_SECNAME symbols. When the first
6836 input section is removed by comdat group, we need to check
6837 if there is still an output section with section name
6840 for (i
= sec
->map_head
.s
; i
!= NULL
; i
= i
->map_head
.s
)
6841 if (strcmp (h
->u
.def
.section
->name
, i
->name
) == 0)
6843 h
->u
.def
.section
= i
;
6847 h
->type
= bfd_link_hash_undefined
;
6848 h
->u
.undef
.abfd
= NULL
;
6849 if (is_elf_hash_table (link_info
.hash
))
6851 const struct elf_backend_data
*bed
;
6852 struct elf_link_hash_entry
*eh
= (struct elf_link_hash_entry
*) h
;
6853 unsigned int was_forced
= eh
->forced_local
;
6855 bed
= get_elf_backend_data (link_info
.output_bfd
);
6856 (*bed
->elf_backend_hide_symbol
) (&link_info
, eh
, true);
6857 if (!eh
->ref_regular_nonweak
)
6858 h
->type
= bfd_link_hash_undefweak
;
6859 eh
->def_regular
= 0;
6860 eh
->forced_local
= was_forced
;
6866 lang_undef_start_stop (void)
6868 foreach_start_stop (undef_start_stop
);
6871 /* Check for output sections whose names match references to
6872 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6873 preliminary definitions. */
6876 lang_init_startof_sizeof (void)
6880 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6882 const char *secname
= s
->name
;
6883 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6885 sprintf (symbol
, ".startof.%s", secname
);
6886 lang_define_start_stop (symbol
, s
);
6888 memcpy (symbol
+ 1, ".size", 5);
6889 lang_define_start_stop (symbol
+ 1, s
);
6894 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6897 set_start_stop (struct bfd_link_hash_entry
*h
)
6900 || h
->type
!= bfd_link_hash_defined
)
6903 if (h
->root
.string
[0] == '.')
6905 /* .startof. or .sizeof. symbol.
6906 .startof. already has final value. */
6907 if (h
->root
.string
[2] == 'i')
6910 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6911 h
->u
.def
.section
= bfd_abs_section_ptr
;
6916 /* __start or __stop symbol. */
6917 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6919 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6920 if (h
->root
.string
[4 + has_lead
] == 'o')
6923 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6929 lang_finalize_start_stop (void)
6931 foreach_start_stop (set_start_stop
);
6937 struct bfd_link_hash_entry
*h
;
6940 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
6941 || bfd_link_dll (&link_info
))
6942 warn
= entry_from_cmdline
;
6946 /* Force the user to specify a root when generating a relocatable with
6947 --gc-sections, unless --gc-keep-exported was also given. */
6948 if (bfd_link_relocatable (&link_info
)
6949 && link_info
.gc_sections
6950 && !link_info
.gc_keep_exported
)
6952 struct bfd_sym_chain
*sym
;
6954 for (sym
= link_info
.gc_sym_list
; sym
!= NULL
; sym
= sym
->next
)
6956 h
= bfd_link_hash_lookup (link_info
.hash
, sym
->name
,
6957 false, false, false);
6959 && (h
->type
== bfd_link_hash_defined
6960 || h
->type
== bfd_link_hash_defweak
)
6961 && !bfd_is_const_section (h
->u
.def
.section
))
6965 einfo (_("%F%P: --gc-sections requires a defined symbol root "
6966 "specified by -e or -u\n"));
6969 if (entry_symbol
.name
== NULL
)
6971 /* No entry has been specified. Look for the default entry, but
6972 don't warn if we don't find it. */
6973 entry_symbol
.name
= entry_symbol_default
;
6977 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
6978 false, false, true);
6980 && (h
->type
== bfd_link_hash_defined
6981 || h
->type
== bfd_link_hash_defweak
)
6982 && h
->u
.def
.section
->output_section
!= NULL
)
6986 val
= (h
->u
.def
.value
6987 + bfd_section_vma (h
->u
.def
.section
->output_section
)
6988 + h
->u
.def
.section
->output_offset
);
6989 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6990 einfo (_("%F%P: %s: can't set start address\n"), entry_symbol
.name
);
6997 /* We couldn't find the entry symbol. Try parsing it as a
6999 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
7002 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
7003 einfo (_("%F%P: can't set start address\n"));
7005 /* BZ 2004952: Only use the start of the entry section for executables. */
7006 else if bfd_link_executable (&link_info
)
7010 /* Can't find the entry symbol, and it's not a number. Use
7011 the first address in the text section. */
7012 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
7016 einfo (_("%P: warning: cannot find entry symbol %s;"
7017 " defaulting to %V\n"),
7019 bfd_section_vma (ts
));
7020 if (!bfd_set_start_address (link_info
.output_bfd
,
7021 bfd_section_vma (ts
)))
7022 einfo (_("%F%P: can't set start address\n"));
7027 einfo (_("%P: warning: cannot find entry symbol %s;"
7028 " not setting start address\n"),
7035 einfo (_("%P: warning: cannot find entry symbol %s;"
7036 " not setting start address\n"),
7042 /* This is a small function used when we want to ignore errors from
7046 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
7047 va_list ap ATTRIBUTE_UNUSED
)
7049 /* Don't do anything. */
7052 /* Check that the architecture of all the input files is compatible
7053 with the output file. Also call the backend to let it do any
7054 other checking that is needed. */
7059 lang_input_statement_type
*file
;
7061 const bfd_arch_info_type
*compatible
;
7063 for (file
= (void *) file_chain
.head
;
7067 #if BFD_SUPPORTS_PLUGINS
7068 /* Don't check format of files claimed by plugin. */
7069 if (file
->flags
.claimed
)
7071 #endif /* BFD_SUPPORTS_PLUGINS */
7072 input_bfd
= file
->the_bfd
;
7074 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
7075 command_line
.accept_unknown_input_arch
);
7077 /* In general it is not possible to perform a relocatable
7078 link between differing object formats when the input
7079 file has relocations, because the relocations in the
7080 input format may not have equivalent representations in
7081 the output format (and besides BFD does not translate
7082 relocs for other link purposes than a final link). */
7083 if (!file
->flags
.just_syms
7084 && (bfd_link_relocatable (&link_info
)
7085 || link_info
.emitrelocations
)
7086 && (compatible
== NULL
7087 || (bfd_get_flavour (input_bfd
)
7088 != bfd_get_flavour (link_info
.output_bfd
)))
7089 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
7091 einfo (_("%F%P: relocatable linking with relocations from"
7092 " format %s (%pB) to format %s (%pB) is not supported\n"),
7093 bfd_get_target (input_bfd
), input_bfd
,
7094 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
7095 /* einfo with %F exits. */
7098 if (compatible
== NULL
)
7100 if (command_line
.warn_mismatch
)
7101 einfo (_("%X%P: %s architecture of input file `%pB'"
7102 " is incompatible with %s output\n"),
7103 bfd_printable_name (input_bfd
), input_bfd
,
7104 bfd_printable_name (link_info
.output_bfd
));
7107 /* If the input bfd has no contents, it shouldn't set the
7108 private data of the output bfd. */
7109 else if (!file
->flags
.just_syms
7110 && ((input_bfd
->flags
& DYNAMIC
) != 0
7111 || bfd_count_sections (input_bfd
) != 0))
7113 bfd_error_handler_type pfn
= NULL
;
7115 /* If we aren't supposed to warn about mismatched input
7116 files, temporarily set the BFD error handler to a
7117 function which will do nothing. We still want to call
7118 bfd_merge_private_bfd_data, since it may set up
7119 information which is needed in the output file. */
7120 if (!command_line
.warn_mismatch
)
7121 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
7122 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
7124 if (command_line
.warn_mismatch
)
7125 einfo (_("%X%P: failed to merge target specific data"
7126 " of file %pB\n"), input_bfd
);
7128 if (!command_line
.warn_mismatch
)
7129 bfd_set_error_handler (pfn
);
7134 /* Look through all the global common symbols and attach them to the
7135 correct section. The -sort-common command line switch may be used
7136 to roughly sort the entries by alignment. */
7141 if (link_info
.inhibit_common_definition
)
7143 if (bfd_link_relocatable (&link_info
)
7144 && !command_line
.force_common_definition
)
7147 if (!config
.sort_common
)
7148 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
7153 if (config
.sort_common
== sort_descending
)
7155 for (power
= 4; power
> 0; power
--)
7156 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7159 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7163 for (power
= 0; power
<= 4; power
++)
7164 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7166 power
= (unsigned int) -1;
7167 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7172 /* Place one common symbol in the correct section. */
7175 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
7177 unsigned int power_of_two
;
7181 if (h
->type
!= bfd_link_hash_common
)
7185 power_of_two
= h
->u
.c
.p
->alignment_power
;
7187 if (config
.sort_common
== sort_descending
7188 && power_of_two
< *(unsigned int *) info
)
7190 else if (config
.sort_common
== sort_ascending
7191 && power_of_two
> *(unsigned int *) info
)
7194 section
= h
->u
.c
.p
->section
;
7195 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
7196 einfo (_("%F%P: could not define common symbol `%pT': %E\n"),
7199 if (config
.map_file
!= NULL
)
7201 static bool header_printed
;
7206 if (!header_printed
)
7208 minfo (_("\nAllocating common symbols\n"));
7209 minfo (_("Common symbol size file\n\n"));
7210 header_printed
= true;
7213 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
7214 DMGL_ANSI
| DMGL_PARAMS
);
7217 minfo ("%s", h
->root
.string
);
7218 len
= strlen (h
->root
.string
);
7223 len
= strlen (name
);
7239 if (size
<= 0xffffffff)
7240 sprintf (buf
, "%lx", (unsigned long) size
);
7242 sprintf_vma (buf
, size
);
7252 minfo ("%pB\n", section
->owner
);
7258 /* Handle a single orphan section S, placing the orphan into an appropriate
7259 output section. The effects of the --orphan-handling command line
7260 option are handled here. */
7263 ldlang_place_orphan (asection
*s
)
7265 if (config
.orphan_handling
== orphan_handling_discard
)
7267 lang_output_section_statement_type
*os
;
7268 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0, 1);
7269 if (os
->addr_tree
== NULL
7270 && (bfd_link_relocatable (&link_info
)
7271 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7272 os
->addr_tree
= exp_intop (0);
7273 lang_add_section (&os
->children
, s
, NULL
, NULL
, os
);
7277 lang_output_section_statement_type
*os
;
7278 const char *name
= s
->name
;
7281 if (config
.orphan_handling
== orphan_handling_error
)
7282 einfo (_("%X%P: error: unplaced orphan section `%pA' from `%pB'\n"),
7285 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
7286 constraint
= SPECIAL
;
7288 os
= ldemul_place_orphan (s
, name
, constraint
);
7291 os
= lang_output_section_statement_lookup (name
, constraint
, 1);
7292 if (os
->addr_tree
== NULL
7293 && (bfd_link_relocatable (&link_info
)
7294 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7295 os
->addr_tree
= exp_intop (0);
7296 lang_add_section (&os
->children
, s
, NULL
, NULL
, os
);
7299 if (config
.orphan_handling
== orphan_handling_warn
)
7300 einfo (_("%P: warning: orphan section `%pA' from `%pB' being "
7301 "placed in section `%s'\n"),
7302 s
, s
->owner
, os
->name
);
7306 /* Run through the input files and ensure that every input section has
7307 somewhere to go. If one is found without a destination then create
7308 an input request and place it into the statement tree. */
7311 lang_place_orphans (void)
7313 LANG_FOR_EACH_INPUT_STATEMENT (file
)
7317 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
7319 if (s
->output_section
== NULL
)
7321 /* This section of the file is not attached, root
7322 around for a sensible place for it to go. */
7324 if (file
->flags
.just_syms
)
7325 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
7326 else if (lang_discard_section_p (s
))
7327 s
->output_section
= bfd_abs_section_ptr
;
7328 else if (strcmp (s
->name
, "COMMON") == 0)
7330 /* This is a lonely common section which must have
7331 come from an archive. We attach to the section
7332 with the wildcard. */
7333 if (!bfd_link_relocatable (&link_info
)
7334 || command_line
.force_common_definition
)
7336 if (default_common_section
== NULL
)
7337 default_common_section
7338 = lang_output_section_statement_lookup (".bss", 0, 1);
7339 lang_add_section (&default_common_section
->children
, s
,
7340 NULL
, NULL
, default_common_section
);
7344 ldlang_place_orphan (s
);
7351 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
7353 flagword
*ptr_flags
;
7355 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7361 /* PR 17900: An exclamation mark in the attributes reverses
7362 the sense of any of the attributes that follow. */
7365 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7369 *ptr_flags
|= SEC_ALLOC
;
7373 *ptr_flags
|= SEC_READONLY
;
7377 *ptr_flags
|= SEC_DATA
;
7381 *ptr_flags
|= SEC_CODE
;
7386 *ptr_flags
|= SEC_LOAD
;
7390 einfo (_("%F%P: invalid character %c (%d) in flags\n"),
7398 /* Call a function on each real input file. This function will be
7399 called on an archive, but not on the elements. */
7402 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
7404 lang_input_statement_type
*f
;
7406 for (f
= (void *) input_file_chain
.head
;
7408 f
= f
->next_real_file
)
7413 /* Call a function on each real file. The function will be called on
7414 all the elements of an archive which are included in the link, but
7415 will not be called on the archive file itself. */
7418 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
7420 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7428 ldlang_add_file (lang_input_statement_type
*entry
)
7430 lang_statement_append (&file_chain
, entry
, &entry
->next
);
7432 /* The BFD linker needs to have a list of all input BFDs involved in
7434 ASSERT (link_info
.input_bfds_tail
!= &entry
->the_bfd
->link
.next
7435 && entry
->the_bfd
->link
.next
== NULL
);
7436 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
7438 *link_info
.input_bfds_tail
= entry
->the_bfd
;
7439 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
7440 bfd_set_usrdata (entry
->the_bfd
, entry
);
7441 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
7443 /* Look through the sections and check for any which should not be
7444 included in the link. We need to do this now, so that we can
7445 notice when the backend linker tries to report multiple
7446 definition errors for symbols which are in sections we aren't
7447 going to link. FIXME: It might be better to entirely ignore
7448 symbols which are defined in sections which are going to be
7449 discarded. This would require modifying the backend linker for
7450 each backend which might set the SEC_LINK_ONCE flag. If we do
7451 this, we should probably handle SEC_EXCLUDE in the same way. */
7453 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
7457 lang_add_output (const char *name
, int from_script
)
7459 /* Make -o on command line override OUTPUT in script. */
7460 if (!had_output_filename
|| !from_script
)
7462 output_filename
= name
;
7463 had_output_filename
= true;
7467 lang_output_section_statement_type
*
7468 lang_enter_output_section_statement (const char *output_section_statement_name
,
7469 etree_type
*address_exp
,
7470 enum section_type sectype
,
7472 etree_type
*subalign
,
7475 int align_with_input
)
7477 lang_output_section_statement_type
*os
;
7479 os
= lang_output_section_statement_lookup (output_section_statement_name
,
7481 current_section
= os
;
7483 if (os
->addr_tree
== NULL
)
7485 os
->addr_tree
= address_exp
;
7487 os
->sectype
= sectype
;
7488 if (sectype
!= noload_section
)
7489 os
->flags
= SEC_NO_FLAGS
;
7491 os
->flags
= SEC_NEVER_LOAD
;
7492 os
->block_value
= 1;
7494 /* Make next things chain into subchain of this. */
7495 push_stat_ptr (&os
->children
);
7497 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
7498 if (os
->align_lma_with_input
&& align
!= NULL
)
7499 einfo (_("%F%P:%pS: error: align with input and explicit align specified\n"),
7502 os
->subsection_alignment
= subalign
;
7503 os
->section_alignment
= align
;
7505 os
->load_base
= ebase
;
7512 lang_output_statement_type
*new_stmt
;
7514 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
7515 new_stmt
->name
= output_filename
;
7518 /* Reset the current counters in the regions. */
7521 lang_reset_memory_regions (void)
7523 lang_memory_region_type
*p
= lang_memory_region_list
;
7525 lang_output_section_statement_type
*os
;
7527 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
7529 p
->current
= p
->origin
;
7533 for (os
= (void *) lang_os_list
.head
;
7537 os
->processed_vma
= false;
7538 os
->processed_lma
= false;
7541 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
7543 /* Save the last size for possible use by bfd_relax_section. */
7544 o
->rawsize
= o
->size
;
7545 if (!(o
->flags
& SEC_FIXED_SIZE
))
7550 /* Worker for lang_gc_sections_1. */
7553 gc_section_callback (lang_wild_statement_type
*ptr
,
7554 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7556 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7557 void *data ATTRIBUTE_UNUSED
)
7559 /* If the wild pattern was marked KEEP, the member sections
7560 should be as well. */
7561 if (ptr
->keep_sections
)
7562 section
->flags
|= SEC_KEEP
;
7565 /* Iterate over sections marking them against GC. */
7568 lang_gc_sections_1 (lang_statement_union_type
*s
)
7570 for (; s
!= NULL
; s
= s
->header
.next
)
7572 switch (s
->header
.type
)
7574 case lang_wild_statement_enum
:
7575 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
7577 case lang_constructors_statement_enum
:
7578 lang_gc_sections_1 (constructor_list
.head
);
7580 case lang_output_section_statement_enum
:
7581 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
7583 case lang_group_statement_enum
:
7584 lang_gc_sections_1 (s
->group_statement
.children
.head
);
7593 lang_gc_sections (void)
7595 /* Keep all sections so marked in the link script. */
7596 lang_gc_sections_1 (statement_list
.head
);
7598 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
7599 the special case of .stabstr debug info. (See bfd/stabs.c)
7600 Twiddle the flag here, to simplify later linker code. */
7601 if (bfd_link_relocatable (&link_info
))
7603 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7606 #if BFD_SUPPORTS_PLUGINS
7607 if (f
->flags
.claimed
)
7610 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
7611 if ((sec
->flags
& SEC_DEBUGGING
) == 0
7612 || strcmp (sec
->name
, ".stabstr") != 0)
7613 sec
->flags
&= ~SEC_EXCLUDE
;
7617 if (link_info
.gc_sections
)
7618 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
7621 /* Worker for lang_find_relro_sections_1. */
7624 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
7625 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7627 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7630 /* Discarded, excluded and ignored sections effectively have zero
7632 if (section
->output_section
!= NULL
7633 && section
->output_section
->owner
== link_info
.output_bfd
7634 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
7635 && !IGNORE_SECTION (section
)
7636 && section
->size
!= 0)
7638 bool *has_relro_section
= (bool *) data
;
7639 *has_relro_section
= true;
7643 /* Iterate over sections for relro sections. */
7646 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
7647 seg_align_type
*seg
,
7648 bool *has_relro_section
)
7650 if (*has_relro_section
)
7653 for (; s
!= NULL
; s
= s
->header
.next
)
7655 if (s
== seg
->relro_end_stat
)
7658 switch (s
->header
.type
)
7660 case lang_wild_statement_enum
:
7661 walk_wild (&s
->wild_statement
,
7662 find_relro_section_callback
,
7665 case lang_constructors_statement_enum
:
7666 lang_find_relro_sections_1 (constructor_list
.head
,
7667 seg
, has_relro_section
);
7669 case lang_output_section_statement_enum
:
7670 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
7671 seg
, has_relro_section
);
7673 case lang_group_statement_enum
:
7674 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
7675 seg
, has_relro_section
);
7684 lang_find_relro_sections (void)
7686 bool has_relro_section
= false;
7688 /* Check all sections in the link script. */
7690 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
7691 &expld
.dataseg
, &has_relro_section
);
7693 if (!has_relro_section
)
7694 link_info
.relro
= false;
7697 /* Relax all sections until bfd_relax_section gives up. */
7700 lang_relax_sections (bool need_layout
)
7702 if (RELAXATION_ENABLED
)
7704 /* We may need more than one relaxation pass. */
7705 int i
= link_info
.relax_pass
;
7707 /* The backend can use it to determine the current pass. */
7708 link_info
.relax_pass
= 0;
7712 /* Keep relaxing until bfd_relax_section gives up. */
7715 link_info
.relax_trip
= -1;
7718 link_info
.relax_trip
++;
7720 /* Note: pe-dll.c does something like this also. If you find
7721 you need to change this code, you probably need to change
7722 pe-dll.c also. DJ */
7724 /* Do all the assignments with our current guesses as to
7726 lang_do_assignments (lang_assigning_phase_enum
);
7728 /* We must do this after lang_do_assignments, because it uses
7730 lang_reset_memory_regions ();
7732 /* Perform another relax pass - this time we know where the
7733 globals are, so can make a better guess. */
7734 relax_again
= false;
7735 lang_size_sections (&relax_again
, false);
7737 while (relax_again
);
7739 link_info
.relax_pass
++;
7746 /* Final extra sizing to report errors. */
7747 lang_do_assignments (lang_assigning_phase_enum
);
7748 lang_reset_memory_regions ();
7749 lang_size_sections (NULL
, true);
7753 #if BFD_SUPPORTS_PLUGINS
7754 /* Find the insert point for the plugin's replacement files. We
7755 place them after the first claimed real object file, or if the
7756 first claimed object is an archive member, after the last real
7757 object file immediately preceding the archive. In the event
7758 no objects have been claimed at all, we return the first dummy
7759 object file on the list as the insert point; that works, but
7760 the callee must be careful when relinking the file_chain as it
7761 is not actually on that chain, only the statement_list and the
7762 input_file list; in that case, the replacement files must be
7763 inserted at the head of the file_chain. */
7765 static lang_input_statement_type
*
7766 find_replacements_insert_point (bool *before
)
7768 lang_input_statement_type
*claim1
, *lastobject
;
7769 lastobject
= (void *) input_file_chain
.head
;
7770 for (claim1
= (void *) file_chain
.head
;
7772 claim1
= claim1
->next
)
7774 if (claim1
->flags
.claimed
)
7776 *before
= claim1
->flags
.claim_archive
;
7777 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
7779 /* Update lastobject if this is a real object file. */
7780 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
7781 lastobject
= claim1
;
7783 /* No files were claimed by the plugin. Choose the last object
7784 file found on the list (maybe the first, dummy entry) as the
7790 /* Find where to insert ADD, an archive element or shared library
7791 added during a rescan. */
7793 static lang_input_statement_type
**
7794 find_rescan_insertion (lang_input_statement_type
*add
)
7796 bfd
*add_bfd
= add
->the_bfd
;
7797 lang_input_statement_type
*f
;
7798 lang_input_statement_type
*last_loaded
= NULL
;
7799 lang_input_statement_type
*before
= NULL
;
7800 lang_input_statement_type
**iter
= NULL
;
7802 if (add_bfd
->my_archive
!= NULL
)
7803 add_bfd
= add_bfd
->my_archive
;
7805 /* First look through the input file chain, to find an object file
7806 before the one we've rescanned. Normal object files always
7807 appear on both the input file chain and the file chain, so this
7808 lets us get quickly to somewhere near the correct place on the
7809 file chain if it is full of archive elements. Archives don't
7810 appear on the file chain, but if an element has been extracted
7811 then their input_statement->next points at it. */
7812 for (f
= (void *) input_file_chain
.head
;
7814 f
= f
->next_real_file
)
7816 if (f
->the_bfd
== add_bfd
)
7818 before
= last_loaded
;
7819 if (f
->next
!= NULL
)
7820 return &f
->next
->next
;
7822 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7826 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7828 iter
= &(*iter
)->next
)
7829 if (!(*iter
)->flags
.claim_archive
7830 && (*iter
)->the_bfd
->my_archive
== NULL
)
7836 /* Insert SRCLIST into DESTLIST after given element by chaining
7837 on FIELD as the next-pointer. (Counterintuitively does not need
7838 a pointer to the actual after-node itself, just its chain field.) */
7841 lang_list_insert_after (lang_statement_list_type
*destlist
,
7842 lang_statement_list_type
*srclist
,
7843 lang_statement_union_type
**field
)
7845 *(srclist
->tail
) = *field
;
7846 *field
= srclist
->head
;
7847 if (destlist
->tail
== field
)
7848 destlist
->tail
= srclist
->tail
;
7851 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7852 was taken as a copy of it and leave them in ORIGLIST. */
7855 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7856 lang_statement_list_type
*origlist
)
7858 union lang_statement_union
**savetail
;
7859 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7860 ASSERT (origlist
->head
== destlist
->head
);
7861 savetail
= origlist
->tail
;
7862 origlist
->head
= *(savetail
);
7863 origlist
->tail
= destlist
->tail
;
7864 destlist
->tail
= savetail
;
7868 static lang_statement_union_type
**
7869 find_next_input_statement (lang_statement_union_type
**s
)
7871 for ( ; *s
; s
= &(*s
)->header
.next
)
7873 lang_statement_union_type
**t
;
7874 switch ((*s
)->header
.type
)
7876 case lang_input_statement_enum
:
7878 case lang_wild_statement_enum
:
7879 t
= &(*s
)->wild_statement
.children
.head
;
7881 case lang_group_statement_enum
:
7882 t
= &(*s
)->group_statement
.children
.head
;
7884 case lang_output_section_statement_enum
:
7885 t
= &(*s
)->output_section_statement
.children
.head
;
7890 t
= find_next_input_statement (t
);
7896 #endif /* BFD_SUPPORTS_PLUGINS */
7898 /* Add NAME to the list of garbage collection entry points. */
7901 lang_add_gc_name (const char *name
)
7903 struct bfd_sym_chain
*sym
;
7908 sym
= stat_alloc (sizeof (*sym
));
7910 sym
->next
= link_info
.gc_sym_list
;
7912 link_info
.gc_sym_list
= sym
;
7915 /* Check relocations. */
7918 lang_check_relocs (void)
7920 if (link_info
.check_relocs_after_open_input
)
7924 for (abfd
= link_info
.input_bfds
;
7925 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7926 if (!bfd_link_check_relocs (abfd
, &link_info
))
7928 /* No object output, fail return. */
7929 config
.make_executable
= false;
7930 /* Note: we do not abort the loop, but rather
7931 continue the scan in case there are other
7932 bad relocations to report. */
7937 /* Look through all output sections looking for places where we can
7938 propagate forward the lma region. */
7941 lang_propagate_lma_regions (void)
7943 lang_output_section_statement_type
*os
;
7945 for (os
= (void *) lang_os_list
.head
;
7949 if (os
->prev
!= NULL
7950 && os
->lma_region
== NULL
7951 && os
->load_base
== NULL
7952 && os
->addr_tree
== NULL
7953 && os
->region
== os
->prev
->region
)
7954 os
->lma_region
= os
->prev
->lma_region
;
7961 /* Finalize dynamic list. */
7962 if (link_info
.dynamic_list
)
7963 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
7965 current_target
= default_target
;
7967 /* Open the output file. */
7968 lang_for_each_statement (ldlang_open_output
);
7971 ldemul_create_output_section_statements ();
7973 /* Add to the hash table all undefineds on the command line. */
7974 lang_place_undefineds ();
7976 if (!bfd_section_already_linked_table_init ())
7977 einfo (_("%F%P: can not create hash table: %E\n"));
7979 /* A first pass through the memory regions ensures that if any region
7980 references a symbol for its origin or length then this symbol will be
7981 added to the symbol table. Having these symbols in the symbol table
7982 means that when we call open_input_bfds PROVIDE statements will
7983 trigger to provide any needed symbols. The regions origins and
7984 lengths are not assigned as a result of this call. */
7985 lang_do_memory_regions (false);
7987 /* Create a bfd for each input file. */
7988 current_target
= default_target
;
7989 lang_statement_iteration
++;
7990 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
7992 /* Now that open_input_bfds has processed assignments and provide
7993 statements we can give values to symbolic origin/length now. */
7994 lang_do_memory_regions (true);
7996 #if BFD_SUPPORTS_PLUGINS
7997 if (link_info
.lto_plugin_active
)
7999 lang_statement_list_type added
;
8000 lang_statement_list_type files
, inputfiles
;
8002 /* Now all files are read, let the plugin(s) decide if there
8003 are any more to be added to the link before we call the
8004 emulation's after_open hook. We create a private list of
8005 input statements for this purpose, which we will eventually
8006 insert into the global statement list after the first claimed
8009 /* We need to manipulate all three chains in synchrony. */
8011 inputfiles
= input_file_chain
;
8012 if (plugin_call_all_symbols_read ())
8013 einfo (_("%F%P: %s: plugin reported error after all symbols read\n"),
8014 plugin_error_plugin ());
8015 link_info
.lto_all_symbols_read
= true;
8016 /* Open any newly added files, updating the file chains. */
8017 plugin_undefs
= link_info
.hash
->undefs_tail
;
8018 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
8019 if (plugin_undefs
== link_info
.hash
->undefs_tail
)
8020 plugin_undefs
= NULL
;
8021 /* Restore the global list pointer now they have all been added. */
8022 lang_list_remove_tail (stat_ptr
, &added
);
8023 /* And detach the fresh ends of the file lists. */
8024 lang_list_remove_tail (&file_chain
, &files
);
8025 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
8026 /* Were any new files added? */
8027 if (added
.head
!= NULL
)
8029 /* If so, we will insert them into the statement list immediately
8030 after the first input file that was claimed by the plugin,
8031 unless that file was an archive in which case it is inserted
8032 immediately before. */
8034 lang_statement_union_type
**prev
;
8035 plugin_insert
= find_replacements_insert_point (&before
);
8036 /* If a plugin adds input files without having claimed any, we
8037 don't really have a good idea where to place them. Just putting
8038 them at the start or end of the list is liable to leave them
8039 outside the crtbegin...crtend range. */
8040 ASSERT (plugin_insert
!= NULL
);
8041 /* Splice the new statement list into the old one. */
8042 prev
= &plugin_insert
->header
.next
;
8045 prev
= find_next_input_statement (prev
);
8046 if (*prev
!= (void *) plugin_insert
->next_real_file
)
8048 /* We didn't find the expected input statement.
8049 Fall back to adding after plugin_insert. */
8050 prev
= &plugin_insert
->header
.next
;
8053 lang_list_insert_after (stat_ptr
, &added
, prev
);
8054 /* Likewise for the file chains. */
8055 lang_list_insert_after (&input_file_chain
, &inputfiles
,
8056 (void *) &plugin_insert
->next_real_file
);
8057 /* We must be careful when relinking file_chain; we may need to
8058 insert the new files at the head of the list if the insert
8059 point chosen is the dummy first input file. */
8060 if (plugin_insert
->filename
)
8061 lang_list_insert_after (&file_chain
, &files
,
8062 (void *) &plugin_insert
->next
);
8064 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
8066 /* Rescan archives in case new undefined symbols have appeared. */
8068 lang_statement_iteration
++;
8069 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
8070 lang_list_remove_tail (&file_chain
, &files
);
8071 while (files
.head
!= NULL
)
8073 lang_input_statement_type
**insert
;
8074 lang_input_statement_type
**iter
, *temp
;
8077 insert
= find_rescan_insertion (&files
.head
->input_statement
);
8078 /* All elements from an archive can be added at once. */
8079 iter
= &files
.head
->input_statement
.next
;
8080 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
8081 if (my_arch
!= NULL
)
8082 for (; *iter
!= NULL
; iter
= &(*iter
)->next
)
8083 if ((*iter
)->the_bfd
->my_archive
!= my_arch
)
8086 *insert
= &files
.head
->input_statement
;
8087 files
.head
= (lang_statement_union_type
*) *iter
;
8089 if (my_arch
!= NULL
)
8091 lang_input_statement_type
*parent
= bfd_usrdata (my_arch
);
8093 parent
->next
= (lang_input_statement_type
*)
8095 - offsetof (lang_input_statement_type
, next
));
8100 #endif /* BFD_SUPPORTS_PLUGINS */
8102 /* Make sure that nobody has tried to add a symbol to this list
8104 ASSERT (link_info
.gc_sym_list
== NULL
);
8106 link_info
.gc_sym_list
= &entry_symbol
;
8108 if (entry_symbol
.name
== NULL
)
8110 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
8112 /* entry_symbol is normally initialied by a ENTRY definition in the
8113 linker script or the -e command line option. But if neither of
8114 these have been used, the target specific backend may still have
8115 provided an entry symbol via a call to lang_default_entry().
8116 Unfortunately this value will not be processed until lang_end()
8117 is called, long after this function has finished. So detect this
8118 case here and add the target's entry symbol to the list of starting
8119 points for garbage collection resolution. */
8120 lang_add_gc_name (entry_symbol_default
);
8123 lang_add_gc_name (link_info
.init_function
);
8124 lang_add_gc_name (link_info
.fini_function
);
8126 ldemul_after_open ();
8127 if (config
.map_file
!= NULL
)
8128 lang_print_asneeded ();
8132 bfd_section_already_linked_table_free ();
8134 /* Make sure that we're not mixing architectures. We call this
8135 after all the input files have been opened, but before we do any
8136 other processing, so that any operations merge_private_bfd_data
8137 does on the output file will be known during the rest of the
8141 /* Handle .exports instead of a version script if we're told to do so. */
8142 if (command_line
.version_exports_section
)
8143 lang_do_version_exports_section ();
8145 /* Build all sets based on the information gathered from the input
8147 ldctor_build_sets ();
8149 /* Give initial values for __start and __stop symbols, so that ELF
8150 gc_sections will keep sections referenced by these symbols. Must
8151 be done before lang_do_assignments below. */
8152 if (config
.build_constructors
)
8153 lang_init_start_stop ();
8155 /* PR 13683: We must rerun the assignments prior to running garbage
8156 collection in order to make sure that all symbol aliases are resolved. */
8157 lang_do_assignments (lang_mark_phase_enum
);
8158 expld
.phase
= lang_first_phase_enum
;
8160 /* Size up the common data. */
8163 /* Remove unreferenced sections if asked to. */
8164 lang_gc_sections ();
8166 lang_mark_undefineds ();
8168 /* Check relocations. */
8169 lang_check_relocs ();
8171 ldemul_after_check_relocs ();
8173 /* Update wild statements. */
8174 update_wild_statements (statement_list
.head
);
8176 /* Run through the contours of the script and attach input sections
8177 to the correct output sections. */
8178 lang_statement_iteration
++;
8179 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
8181 /* Start at the statement immediately after the special abs_section
8182 output statement, so that it isn't reordered. */
8183 process_insert_statements (&lang_os_list
.head
->header
.next
);
8185 ldemul_before_place_orphans ();
8187 /* Find any sections not attached explicitly and handle them. */
8188 lang_place_orphans ();
8190 if (!bfd_link_relocatable (&link_info
))
8194 /* Merge SEC_MERGE sections. This has to be done after GC of
8195 sections, so that GCed sections are not merged, but before
8196 assigning dynamic symbols, since removing whole input sections
8198 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
8200 /* Look for a text section and set the readonly attribute in it. */
8201 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
8205 if (config
.text_read_only
)
8206 found
->flags
|= SEC_READONLY
;
8208 found
->flags
&= ~SEC_READONLY
;
8212 /* Merge together CTF sections. After this, only the symtab-dependent
8213 function and data object sections need adjustment. */
8216 /* Emit the CTF, iff the emulation doesn't need to do late emission after
8217 examining things laid out late, like the strtab. */
8220 /* Copy forward lma regions for output sections in same lma region. */
8221 lang_propagate_lma_regions ();
8223 /* Defining __start/__stop symbols early for --gc-sections to work
8224 around a glibc build problem can result in these symbols being
8225 defined when they should not be. Fix them now. */
8226 if (config
.build_constructors
)
8227 lang_undef_start_stop ();
8229 /* Define .startof./.sizeof. symbols with preliminary values before
8230 dynamic symbols are created. */
8231 if (!bfd_link_relocatable (&link_info
))
8232 lang_init_startof_sizeof ();
8234 /* Do anything special before sizing sections. This is where ELF
8235 and other back-ends size dynamic sections. */
8236 ldemul_before_allocation ();
8238 /* We must record the program headers before we try to fix the
8239 section positions, since they will affect SIZEOF_HEADERS. */
8240 lang_record_phdrs ();
8242 /* Check relro sections. */
8243 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
8244 lang_find_relro_sections ();
8246 /* Size up the sections. */
8247 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
8249 /* See if anything special should be done now we know how big
8250 everything is. This is where relaxation is done. */
8251 ldemul_after_allocation ();
8253 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
8254 lang_finalize_start_stop ();
8256 /* Do all the assignments again, to report errors. Assignment
8257 statements are processed multiple times, updating symbols; In
8258 open_input_bfds, lang_do_assignments, and lang_size_sections.
8259 Since lang_relax_sections calls lang_do_assignments, symbols are
8260 also updated in ldemul_after_allocation. */
8261 lang_do_assignments (lang_final_phase_enum
);
8265 /* Convert absolute symbols to section relative. */
8266 ldexp_finalize_syms ();
8268 /* Make sure that the section addresses make sense. */
8269 if (command_line
.check_section_addresses
)
8270 lang_check_section_addresses ();
8272 /* Check any required symbols are known. */
8273 ldlang_check_require_defined_symbols ();
8278 /* EXPORTED TO YACC */
8281 lang_add_wild (struct wildcard_spec
*filespec
,
8282 struct wildcard_list
*section_list
,
8285 struct wildcard_list
*curr
, *next
;
8286 lang_wild_statement_type
*new_stmt
;
8288 /* Reverse the list as the parser puts it back to front. */
8289 for (curr
= section_list
, section_list
= NULL
;
8291 section_list
= curr
, curr
= next
)
8294 curr
->next
= section_list
;
8297 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
8299 if (strcmp (filespec
->name
, "*") == 0)
8300 filespec
->name
= NULL
;
8301 else if (!wildcardp (filespec
->name
))
8302 lang_has_input_file
= true;
8305 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
8306 new_stmt
->filename
= NULL
;
8307 new_stmt
->filenames_sorted
= false;
8308 new_stmt
->section_flag_list
= NULL
;
8309 new_stmt
->exclude_name_list
= NULL
;
8310 if (filespec
!= NULL
)
8312 new_stmt
->filename
= filespec
->name
;
8313 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
8314 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
8315 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
8317 new_stmt
->section_list
= section_list
;
8318 new_stmt
->keep_sections
= keep_sections
;
8319 lang_list_init (&new_stmt
->children
);
8320 analyze_walk_wild_section_handler (new_stmt
);
8324 lang_section_start (const char *name
, etree_type
*address
,
8325 const segment_type
*segment
)
8327 lang_address_statement_type
*ad
;
8329 ad
= new_stat (lang_address_statement
, stat_ptr
);
8330 ad
->section_name
= name
;
8331 ad
->address
= address
;
8332 ad
->segment
= segment
;
8335 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
8336 because of a -e argument on the command line, or zero if this is
8337 called by ENTRY in a linker script. Command line arguments take
8341 lang_add_entry (const char *name
, bool cmdline
)
8343 if (entry_symbol
.name
== NULL
8345 || !entry_from_cmdline
)
8347 entry_symbol
.name
= name
;
8348 entry_from_cmdline
= cmdline
;
8352 /* Set the default start symbol to NAME. .em files should use this,
8353 not lang_add_entry, to override the use of "start" if neither the
8354 linker script nor the command line specifies an entry point. NAME
8355 must be permanently allocated. */
8357 lang_default_entry (const char *name
)
8359 entry_symbol_default
= name
;
8363 lang_add_target (const char *name
)
8365 lang_target_statement_type
*new_stmt
;
8367 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
8368 new_stmt
->target
= name
;
8372 lang_add_map (const char *name
)
8379 map_option_f
= true;
8387 lang_add_fill (fill_type
*fill
)
8389 lang_fill_statement_type
*new_stmt
;
8391 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
8392 new_stmt
->fill
= fill
;
8396 lang_add_data (int type
, union etree_union
*exp
)
8398 lang_data_statement_type
*new_stmt
;
8400 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
8401 new_stmt
->exp
= exp
;
8402 new_stmt
->type
= type
;
8405 /* Create a new reloc statement. RELOC is the BFD relocation type to
8406 generate. HOWTO is the corresponding howto structure (we could
8407 look this up, but the caller has already done so). SECTION is the
8408 section to generate a reloc against, or NAME is the name of the
8409 symbol to generate a reloc against. Exactly one of SECTION and
8410 NAME must be NULL. ADDEND is an expression for the addend. */
8413 lang_add_reloc (bfd_reloc_code_real_type reloc
,
8414 reloc_howto_type
*howto
,
8417 union etree_union
*addend
)
8419 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
8423 p
->section
= section
;
8425 p
->addend_exp
= addend
;
8427 p
->addend_value
= 0;
8428 p
->output_section
= NULL
;
8429 p
->output_offset
= 0;
8432 lang_assignment_statement_type
*
8433 lang_add_assignment (etree_type
*exp
)
8435 lang_assignment_statement_type
*new_stmt
;
8437 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
8438 new_stmt
->exp
= exp
;
8443 lang_add_attribute (enum statement_enum attribute
)
8445 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
8449 lang_startup (const char *name
)
8451 if (first_file
->filename
!= NULL
)
8453 einfo (_("%F%P: multiple STARTUP files\n"));
8455 first_file
->filename
= name
;
8456 first_file
->local_sym_name
= name
;
8457 first_file
->flags
.real
= true;
8461 lang_float (bool maybe
)
8463 lang_float_flag
= maybe
;
8467 /* Work out the load- and run-time regions from a script statement, and
8468 store them in *LMA_REGION and *REGION respectively.
8470 MEMSPEC is the name of the run-time region, or the value of
8471 DEFAULT_MEMORY_REGION if the statement didn't specify one.
8472 LMA_MEMSPEC is the name of the load-time region, or null if the
8473 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
8474 had an explicit load address.
8476 It is an error to specify both a load region and a load address. */
8479 lang_get_regions (lang_memory_region_type
**region
,
8480 lang_memory_region_type
**lma_region
,
8481 const char *memspec
,
8482 const char *lma_memspec
,
8486 *lma_region
= lang_memory_region_lookup (lma_memspec
, false);
8488 /* If no runtime region or VMA has been specified, but the load region
8489 has been specified, then use the load region for the runtime region
8491 if (lma_memspec
!= NULL
8493 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
8494 *region
= *lma_region
;
8496 *region
= lang_memory_region_lookup (memspec
, false);
8498 if (have_lma
&& lma_memspec
!= 0)
8499 einfo (_("%X%P:%pS: section has both a load address and a load region\n"),
8504 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
8505 lang_output_section_phdr_list
*phdrs
,
8506 const char *lma_memspec
)
8508 lang_get_regions (¤t_section
->region
,
8509 ¤t_section
->lma_region
,
8510 memspec
, lma_memspec
,
8511 current_section
->load_base
!= NULL
,
8512 current_section
->addr_tree
!= NULL
);
8514 current_section
->fill
= fill
;
8515 current_section
->phdrs
= phdrs
;
8519 /* Set the output format type. -oformat overrides scripts. */
8522 lang_add_output_format (const char *format
,
8527 if (output_target
== NULL
|| !from_script
)
8529 if (command_line
.endian
== ENDIAN_BIG
8532 else if (command_line
.endian
== ENDIAN_LITTLE
8536 output_target
= format
;
8541 lang_add_insert (const char *where
, int is_before
)
8543 lang_insert_statement_type
*new_stmt
;
8545 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
8546 new_stmt
->where
= where
;
8547 new_stmt
->is_before
= is_before
;
8548 saved_script_handle
= previous_script_handle
;
8551 /* Enter a group. This creates a new lang_group_statement, and sets
8552 stat_ptr to build new statements within the group. */
8555 lang_enter_group (void)
8557 lang_group_statement_type
*g
;
8559 g
= new_stat (lang_group_statement
, stat_ptr
);
8560 lang_list_init (&g
->children
);
8561 push_stat_ptr (&g
->children
);
8564 /* Leave a group. This just resets stat_ptr to start writing to the
8565 regular list of statements again. Note that this will not work if
8566 groups can occur inside anything else which can adjust stat_ptr,
8567 but currently they can't. */
8570 lang_leave_group (void)
8575 /* Add a new program header. This is called for each entry in a PHDRS
8576 command in a linker script. */
8579 lang_new_phdr (const char *name
,
8586 struct lang_phdr
*n
, **pp
;
8589 n
= stat_alloc (sizeof (struct lang_phdr
));
8592 n
->type
= exp_get_vma (type
, 0, "program header type");
8593 n
->filehdr
= filehdr
;
8598 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
8600 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8603 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
8605 einfo (_("%X%P:%pS: PHDRS and FILEHDR are not supported"
8606 " when prior PT_LOAD headers lack them\n"), NULL
);
8613 /* Record the program header information in the output BFD. FIXME: We
8614 should not be calling an ELF specific function here. */
8617 lang_record_phdrs (void)
8621 lang_output_section_phdr_list
*last
;
8622 struct lang_phdr
*l
;
8623 lang_output_section_statement_type
*os
;
8626 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
8629 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
8636 for (os
= (void *) lang_os_list
.head
;
8640 lang_output_section_phdr_list
*pl
;
8642 if (os
->constraint
< 0)
8650 if (os
->sectype
== noload_section
8651 || os
->bfd_section
== NULL
8652 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
8655 /* Don't add orphans to PT_INTERP header. */
8661 lang_output_section_statement_type
*tmp_os
;
8663 /* If we have not run across a section with a program
8664 header assigned to it yet, then scan forwards to find
8665 one. This prevents inconsistencies in the linker's
8666 behaviour when a script has specified just a single
8667 header and there are sections in that script which are
8668 not assigned to it, and which occur before the first
8669 use of that header. See here for more details:
8670 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
8671 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
8674 last
= tmp_os
->phdrs
;
8678 einfo (_("%F%P: no sections assigned to phdrs\n"));
8683 if (os
->bfd_section
== NULL
)
8686 for (; pl
!= NULL
; pl
= pl
->next
)
8688 if (strcmp (pl
->name
, l
->name
) == 0)
8693 secs
= (asection
**) xrealloc (secs
,
8694 alc
* sizeof (asection
*));
8696 secs
[c
] = os
->bfd_section
;
8703 if (l
->flags
== NULL
)
8706 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
8711 at
= exp_get_vma (l
->at
, 0, "phdr load address");
8713 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
8714 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
8715 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
8716 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
8721 /* Make sure all the phdr assignments succeeded. */
8722 for (os
= (void *) lang_os_list
.head
;
8726 lang_output_section_phdr_list
*pl
;
8728 if (os
->constraint
< 0
8729 || os
->bfd_section
== NULL
)
8732 for (pl
= os
->phdrs
;
8735 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
8736 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
8737 os
->name
, pl
->name
);
8741 /* Record a list of sections which may not be cross referenced. */
8744 lang_add_nocrossref (lang_nocrossref_type
*l
)
8746 struct lang_nocrossrefs
*n
;
8748 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
8749 n
->next
= nocrossref_list
;
8751 n
->onlyfirst
= false;
8752 nocrossref_list
= n
;
8754 /* Set notice_all so that we get informed about all symbols. */
8755 link_info
.notice_all
= true;
8758 /* Record a section that cannot be referenced from a list of sections. */
8761 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
8763 lang_add_nocrossref (l
);
8764 nocrossref_list
->onlyfirst
= true;
8767 /* Overlay handling. We handle overlays with some static variables. */
8769 /* The overlay virtual address. */
8770 static etree_type
*overlay_vma
;
8771 /* And subsection alignment. */
8772 static etree_type
*overlay_subalign
;
8774 /* An expression for the maximum section size seen so far. */
8775 static etree_type
*overlay_max
;
8777 /* A list of all the sections in this overlay. */
8779 struct overlay_list
{
8780 struct overlay_list
*next
;
8781 lang_output_section_statement_type
*os
;
8784 static struct overlay_list
*overlay_list
;
8786 /* Start handling an overlay. */
8789 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
8791 /* The grammar should prevent nested overlays from occurring. */
8792 ASSERT (overlay_vma
== NULL
8793 && overlay_subalign
== NULL
8794 && overlay_max
== NULL
);
8796 overlay_vma
= vma_expr
;
8797 overlay_subalign
= subalign
;
8800 /* Start a section in an overlay. We handle this by calling
8801 lang_enter_output_section_statement with the correct VMA.
8802 lang_leave_overlay sets up the LMA and memory regions. */
8805 lang_enter_overlay_section (const char *name
)
8807 struct overlay_list
*n
;
8810 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
8811 0, overlay_subalign
, 0, 0, 0);
8813 /* If this is the first section, then base the VMA of future
8814 sections on this one. This will work correctly even if `.' is
8815 used in the addresses. */
8816 if (overlay_list
== NULL
)
8817 overlay_vma
= exp_nameop (ADDR
, name
);
8819 /* Remember the section. */
8820 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
8821 n
->os
= current_section
;
8822 n
->next
= overlay_list
;
8825 size
= exp_nameop (SIZEOF
, name
);
8827 /* Arrange to work out the maximum section end address. */
8828 if (overlay_max
== NULL
)
8831 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
8834 /* Finish a section in an overlay. There isn't any special to do
8838 lang_leave_overlay_section (fill_type
*fill
,
8839 lang_output_section_phdr_list
*phdrs
)
8846 name
= current_section
->name
;
8848 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
8849 region and that no load-time region has been specified. It doesn't
8850 really matter what we say here, since lang_leave_overlay will
8852 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
8854 /* Define the magic symbols. */
8856 clean
= (char *) xmalloc (strlen (name
) + 1);
8858 for (s1
= name
; *s1
!= '\0'; s1
++)
8859 if (ISALNUM (*s1
) || *s1
== '_')
8863 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8864 sprintf (buf
, "__load_start_%s", clean
);
8865 lang_add_assignment (exp_provide (buf
,
8866 exp_nameop (LOADADDR
, name
),
8869 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8870 sprintf (buf
, "__load_stop_%s", clean
);
8871 lang_add_assignment (exp_provide (buf
,
8873 exp_nameop (LOADADDR
, name
),
8874 exp_nameop (SIZEOF
, name
)),
8880 /* Finish an overlay. If there are any overlay wide settings, this
8881 looks through all the sections in the overlay and sets them. */
8884 lang_leave_overlay (etree_type
*lma_expr
,
8887 const char *memspec
,
8888 lang_output_section_phdr_list
*phdrs
,
8889 const char *lma_memspec
)
8891 lang_memory_region_type
*region
;
8892 lang_memory_region_type
*lma_region
;
8893 struct overlay_list
*l
;
8894 lang_nocrossref_type
*nocrossref
;
8896 lang_get_regions (®ion
, &lma_region
,
8897 memspec
, lma_memspec
,
8898 lma_expr
!= NULL
, false);
8902 /* After setting the size of the last section, set '.' to end of the
8904 if (overlay_list
!= NULL
)
8906 overlay_list
->os
->update_dot
= 1;
8907 overlay_list
->os
->update_dot_tree
8908 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), false);
8914 struct overlay_list
*next
;
8916 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8919 l
->os
->region
= region
;
8920 l
->os
->lma_region
= lma_region
;
8922 /* The first section has the load address specified in the
8923 OVERLAY statement. The rest are worked out from that.
8924 The base address is not needed (and should be null) if
8925 an LMA region was specified. */
8928 l
->os
->load_base
= lma_expr
;
8929 l
->os
->sectype
= first_overlay_section
;
8931 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
8932 l
->os
->phdrs
= phdrs
;
8936 lang_nocrossref_type
*nc
;
8938 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
8939 nc
->name
= l
->os
->name
;
8940 nc
->next
= nocrossref
;
8949 if (nocrossref
!= NULL
)
8950 lang_add_nocrossref (nocrossref
);
8953 overlay_list
= NULL
;
8955 overlay_subalign
= NULL
;
8958 /* Version handling. This is only useful for ELF. */
8960 /* If PREV is NULL, return first version pattern matching particular symbol.
8961 If PREV is non-NULL, return first version pattern matching particular
8962 symbol after PREV (previously returned by lang_vers_match). */
8964 static struct bfd_elf_version_expr
*
8965 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
8966 struct bfd_elf_version_expr
*prev
,
8970 const char *cxx_sym
= sym
;
8971 const char *java_sym
= sym
;
8972 struct bfd_elf_version_expr
*expr
= NULL
;
8973 enum demangling_styles curr_style
;
8975 curr_style
= CURRENT_DEMANGLING_STYLE
;
8976 cplus_demangle_set_style (no_demangling
);
8977 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
8980 cplus_demangle_set_style (curr_style
);
8982 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8984 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
8985 DMGL_PARAMS
| DMGL_ANSI
);
8989 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8991 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
8996 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
8998 struct bfd_elf_version_expr e
;
9000 switch (prev
? prev
->mask
: 0)
9003 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
9006 expr
= (struct bfd_elf_version_expr
*)
9007 htab_find ((htab_t
) head
->htab
, &e
);
9008 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
9009 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
9015 case BFD_ELF_VERSION_C_TYPE
:
9016 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
9018 e
.pattern
= cxx_sym
;
9019 expr
= (struct bfd_elf_version_expr
*)
9020 htab_find ((htab_t
) head
->htab
, &e
);
9021 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
9022 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
9028 case BFD_ELF_VERSION_CXX_TYPE
:
9029 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
9031 e
.pattern
= java_sym
;
9032 expr
= (struct bfd_elf_version_expr
*)
9033 htab_find ((htab_t
) head
->htab
, &e
);
9034 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
9035 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
9046 /* Finally, try the wildcards. */
9047 if (prev
== NULL
|| prev
->literal
)
9048 expr
= head
->remaining
;
9051 for (; expr
; expr
= expr
->next
)
9058 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
9061 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
9063 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
9067 if (fnmatch (expr
->pattern
, s
, 0) == 0)
9073 free ((char *) c_sym
);
9075 free ((char *) cxx_sym
);
9076 if (java_sym
!= sym
)
9077 free ((char *) java_sym
);
9081 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
9082 return a pointer to the symbol name with any backslash quotes removed. */
9085 realsymbol (const char *pattern
)
9088 bool changed
= false, backslash
= false;
9089 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
9091 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
9093 /* It is a glob pattern only if there is no preceding
9097 /* Remove the preceding backslash. */
9104 if (*p
== '?' || *p
== '*' || *p
== '[')
9111 backslash
= *p
== '\\';
9127 /* This is called for each variable name or match expression. NEW_NAME is
9128 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
9129 pattern to be matched against symbol names. */
9131 struct bfd_elf_version_expr
*
9132 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
9133 const char *new_name
,
9137 struct bfd_elf_version_expr
*ret
;
9139 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
9143 ret
->literal
= true;
9144 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
9145 if (ret
->pattern
== NULL
)
9147 ret
->pattern
= new_name
;
9148 ret
->literal
= false;
9151 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
9152 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9153 else if (strcasecmp (lang
, "C++") == 0)
9154 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
9155 else if (strcasecmp (lang
, "Java") == 0)
9156 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
9159 einfo (_("%X%P: unknown language `%s' in version information\n"),
9161 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9164 return ldemul_new_vers_pattern (ret
);
9167 /* This is called for each set of variable names and match
9170 struct bfd_elf_version_tree
*
9171 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
9172 struct bfd_elf_version_expr
*locals
)
9174 struct bfd_elf_version_tree
*ret
;
9176 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
9177 ret
->globals
.list
= globals
;
9178 ret
->locals
.list
= locals
;
9179 ret
->match
= lang_vers_match
;
9180 ret
->name_indx
= (unsigned int) -1;
9184 /* This static variable keeps track of version indices. */
9186 static int version_index
;
9189 version_expr_head_hash (const void *p
)
9191 const struct bfd_elf_version_expr
*e
=
9192 (const struct bfd_elf_version_expr
*) p
;
9194 return htab_hash_string (e
->pattern
);
9198 version_expr_head_eq (const void *p1
, const void *p2
)
9200 const struct bfd_elf_version_expr
*e1
=
9201 (const struct bfd_elf_version_expr
*) p1
;
9202 const struct bfd_elf_version_expr
*e2
=
9203 (const struct bfd_elf_version_expr
*) p2
;
9205 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
9209 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
9212 struct bfd_elf_version_expr
*e
, *next
;
9213 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
9215 for (e
= head
->list
; e
; e
= e
->next
)
9219 head
->mask
|= e
->mask
;
9224 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
9225 version_expr_head_eq
, NULL
);
9226 list_loc
= &head
->list
;
9227 remaining_loc
= &head
->remaining
;
9228 for (e
= head
->list
; e
; e
= next
)
9234 remaining_loc
= &e
->next
;
9238 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
9242 struct bfd_elf_version_expr
*e1
, *last
;
9244 e1
= (struct bfd_elf_version_expr
*) *loc
;
9248 if (e1
->mask
== e
->mask
)
9256 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
9260 /* This is a duplicate. */
9261 /* FIXME: Memory leak. Sometimes pattern is not
9262 xmalloced alone, but in larger chunk of memory. */
9263 /* free (e->pattern); */
9268 e
->next
= last
->next
;
9276 list_loc
= &e
->next
;
9280 *remaining_loc
= NULL
;
9281 *list_loc
= head
->remaining
;
9284 head
->remaining
= head
->list
;
9287 /* This is called when we know the name and dependencies of the
9291 lang_register_vers_node (const char *name
,
9292 struct bfd_elf_version_tree
*version
,
9293 struct bfd_elf_version_deps
*deps
)
9295 struct bfd_elf_version_tree
*t
, **pp
;
9296 struct bfd_elf_version_expr
*e1
;
9301 if (link_info
.version_info
!= NULL
9302 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
9304 einfo (_("%X%P: anonymous version tag cannot be combined"
9305 " with other version tags\n"));
9310 /* Make sure this node has a unique name. */
9311 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9312 if (strcmp (t
->name
, name
) == 0)
9313 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
9315 lang_finalize_version_expr_head (&version
->globals
);
9316 lang_finalize_version_expr_head (&version
->locals
);
9318 /* Check the global and local match names, and make sure there
9319 aren't any duplicates. */
9321 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
9323 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9325 struct bfd_elf_version_expr
*e2
;
9327 if (t
->locals
.htab
&& e1
->literal
)
9329 e2
= (struct bfd_elf_version_expr
*)
9330 htab_find ((htab_t
) t
->locals
.htab
, e1
);
9331 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9333 if (e1
->mask
== e2
->mask
)
9334 einfo (_("%X%P: duplicate expression `%s'"
9335 " in version information\n"), e1
->pattern
);
9339 else if (!e1
->literal
)
9340 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9341 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9342 && e1
->mask
== e2
->mask
)
9343 einfo (_("%X%P: duplicate expression `%s'"
9344 " in version information\n"), e1
->pattern
);
9348 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
9350 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9352 struct bfd_elf_version_expr
*e2
;
9354 if (t
->globals
.htab
&& e1
->literal
)
9356 e2
= (struct bfd_elf_version_expr
*)
9357 htab_find ((htab_t
) t
->globals
.htab
, e1
);
9358 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9360 if (e1
->mask
== e2
->mask
)
9361 einfo (_("%X%P: duplicate expression `%s'"
9362 " in version information\n"),
9367 else if (!e1
->literal
)
9368 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9369 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9370 && e1
->mask
== e2
->mask
)
9371 einfo (_("%X%P: duplicate expression `%s'"
9372 " in version information\n"), e1
->pattern
);
9376 version
->deps
= deps
;
9377 version
->name
= name
;
9378 if (name
[0] != '\0')
9381 version
->vernum
= version_index
;
9384 version
->vernum
= 0;
9386 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
9391 /* This is called when we see a version dependency. */
9393 struct bfd_elf_version_deps
*
9394 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
9396 struct bfd_elf_version_deps
*ret
;
9397 struct bfd_elf_version_tree
*t
;
9399 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
9402 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9404 if (strcmp (t
->name
, name
) == 0)
9406 ret
->version_needed
= t
;
9411 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
9413 ret
->version_needed
= NULL
;
9418 lang_do_version_exports_section (void)
9420 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
9422 LANG_FOR_EACH_INPUT_STATEMENT (is
)
9424 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
9432 contents
= (char *) xmalloc (len
);
9433 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
9434 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
9437 while (p
< contents
+ len
)
9439 greg
= lang_new_vers_pattern (greg
, p
, NULL
, false);
9440 p
= strchr (p
, '\0') + 1;
9443 /* Do not free the contents, as we used them creating the regex. */
9445 /* Do not include this section in the link. */
9446 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
9449 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, false);
9450 lang_register_vers_node (command_line
.version_exports_section
,
9451 lang_new_vers_node (greg
, lreg
), NULL
);
9454 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec. This is initially
9455 called with UPDATE_REGIONS_P set to FALSE, in this case no errors are
9456 thrown, however, references to symbols in the origin and length fields
9457 will be pushed into the symbol table, this allows PROVIDE statements to
9458 then provide these symbols. This function is called a second time with
9459 UPDATE_REGIONS_P set to TRUE, this time the we update the actual region
9460 data structures, and throw errors if missing symbols are encountered. */
9463 lang_do_memory_regions (bool update_regions_p
)
9465 lang_memory_region_type
*r
= lang_memory_region_list
;
9467 for (; r
!= NULL
; r
= r
->next
)
9471 exp_fold_tree_no_dot (r
->origin_exp
);
9472 if (update_regions_p
)
9474 if (expld
.result
.valid_p
)
9476 r
->origin
= expld
.result
.value
;
9477 r
->current
= r
->origin
;
9480 einfo (_("%P: invalid origin for memory region %s\n"),
9486 exp_fold_tree_no_dot (r
->length_exp
);
9487 if (update_regions_p
)
9489 if (expld
.result
.valid_p
)
9490 r
->length
= expld
.result
.value
;
9492 einfo (_("%P: invalid length for memory region %s\n"),
9500 lang_add_unique (const char *name
)
9502 struct unique_sections
*ent
;
9504 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
9505 if (strcmp (ent
->name
, name
) == 0)
9508 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
9509 ent
->name
= xstrdup (name
);
9510 ent
->next
= unique_section_list
;
9511 unique_section_list
= ent
;
9514 /* Append the list of dynamic symbols to the existing one. */
9517 lang_append_dynamic_list (struct bfd_elf_dynamic_list
**list_p
,
9518 struct bfd_elf_version_expr
*dynamic
)
9522 struct bfd_elf_version_expr
*tail
;
9523 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
9525 tail
->next
= (*list_p
)->head
.list
;
9526 (*list_p
)->head
.list
= dynamic
;
9530 struct bfd_elf_dynamic_list
*d
;
9532 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
9533 d
->head
.list
= dynamic
;
9534 d
->match
= lang_vers_match
;
9539 /* Append the list of C++ typeinfo dynamic symbols to the existing
9543 lang_append_dynamic_list_cpp_typeinfo (void)
9545 const char *symbols
[] =
9547 "typeinfo name for*",
9550 struct bfd_elf_version_expr
*dynamic
= NULL
;
9553 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9554 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9557 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9560 /* Append the list of C++ operator new and delete dynamic symbols to the
9564 lang_append_dynamic_list_cpp_new (void)
9566 const char *symbols
[] =
9571 struct bfd_elf_version_expr
*dynamic
= NULL
;
9574 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9575 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9578 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9581 /* Scan a space and/or comma separated string of features. */
9584 lang_ld_feature (char *str
)
9592 while (*p
== ',' || ISSPACE (*p
))
9597 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
9601 if (strcasecmp (p
, "SANE_EXPR") == 0)
9602 config
.sane_expr
= true;
9604 einfo (_("%X%P: unknown feature `%s'\n"), p
);
9610 /* Pretty print memory amount. */
9613 lang_print_memory_size (bfd_vma sz
)
9615 if ((sz
& 0x3fffffff) == 0)
9616 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
9617 else if ((sz
& 0xfffff) == 0)
9618 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
9619 else if ((sz
& 0x3ff) == 0)
9620 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
9622 printf (" %10" BFD_VMA_FMT
"u B", sz
);
9625 /* Implement --print-memory-usage: disply per region memory usage. */
9628 lang_print_memory_usage (void)
9630 lang_memory_region_type
*r
;
9632 printf ("Memory region Used Size Region Size %%age Used\n");
9633 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
9635 bfd_vma used_length
= r
->current
- r
->origin
;
9637 printf ("%16s: ",r
->name_list
.name
);
9638 lang_print_memory_size (used_length
);
9639 lang_print_memory_size ((bfd_vma
) r
->length
);
9643 double percent
= used_length
* 100.0 / r
->length
;
9644 printf (" %6.2f%%", percent
);