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 bfd_boolean map_head_is_link_order
= FALSE
;
67 static lang_output_section_statement_type
*default_common_section
;
68 static bfd_boolean map_option_f
;
69 static bfd_vma print_dot
;
70 static lang_input_statement_type
*first_file
;
71 static const char *current_target
;
72 /* Header for list of statements corresponding to any files involved in the
73 link, either specified from the command-line or added implicitely (eg.
74 archive member used to resolved undefined symbol, wildcard statement from
75 linker script, etc.). Next pointer is in next field of a
76 lang_statement_header_type (reached via header field in a
77 lang_statement_union). */
78 static lang_statement_list_type statement_list
;
79 static lang_statement_list_type
*stat_save
[10];
80 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
81 static struct unique_sections
*unique_section_list
;
82 static struct asneeded_minfo
*asneeded_list_head
;
83 static unsigned int opb_shift
= 0;
85 /* Forward declarations. */
86 static void exp_init_os (etree_type
*);
87 static lang_input_statement_type
*lookup_name (const char *);
88 static void insert_undefined (const char *);
89 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
90 static void print_statement (lang_statement_union_type
*,
91 lang_output_section_statement_type
*);
92 static void print_statement_list (lang_statement_union_type
*,
93 lang_output_section_statement_type
*);
94 static void print_statements (void);
95 static void print_input_section (asection
*, bfd_boolean
);
96 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
97 static void lang_record_phdrs (void);
98 static void lang_do_version_exports_section (void);
99 static void lang_finalize_version_expr_head
100 (struct bfd_elf_version_expr_head
*);
101 static void lang_do_memory_regions (bfd_boolean
);
103 /* Exported variables. */
104 const char *output_target
;
105 lang_output_section_statement_type
*abs_output_section
;
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 bfd_boolean entry_from_cmdline
;
126 bfd_boolean lang_has_input_file
= FALSE
;
127 bfd_boolean had_output_filename
= FALSE
;
128 bfd_boolean lang_float_flag
= FALSE
;
129 bfd_boolean 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
)
226 bfd_boolean match
= FALSE
;
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
);
346 bfd_boolean skip
= FALSE
;
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 bfd_boolean 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 bfd_boolean
*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
;
586 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
591 /* Convert a sorted sections' BST back to list form. */
594 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
595 lang_section_bst_type
*tree
,
599 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
601 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
602 (lang_output_section_statement_type
*) output
);
605 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
610 /* Specialized, optimized routines for handling different kinds of
614 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
615 lang_input_statement_type
*file
,
619 /* We can just do a hash lookup for the section with the right name.
620 But if that lookup discovers more than one section with the name
621 (should be rare), we fall back to the general algorithm because
622 we would otherwise have to sort the sections to make sure they
623 get processed in the bfd's order. */
624 bfd_boolean multiple_sections_found
;
625 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
626 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
628 if (multiple_sections_found
)
629 walk_wild_section_general (ptr
, file
, callback
, data
);
631 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
635 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
636 lang_input_statement_type
*file
,
641 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
643 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
645 const char *sname
= bfd_section_name (s
);
646 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
649 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
654 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
655 lang_input_statement_type
*file
,
660 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
661 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
662 bfd_boolean multiple_sections_found
;
663 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
665 if (multiple_sections_found
)
667 walk_wild_section_general (ptr
, file
, callback
, data
);
671 /* Note that if the section was not found, s0 is NULL and
672 we'll simply never succeed the s == s0 test below. */
673 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
675 /* Recall that in this code path, a section cannot satisfy more
676 than one spec, so if s == s0 then it cannot match
679 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
682 const char *sname
= bfd_section_name (s
);
683 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
686 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
693 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
694 lang_input_statement_type
*file
,
699 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
700 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
701 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
702 bfd_boolean multiple_sections_found
;
703 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
705 if (multiple_sections_found
)
707 walk_wild_section_general (ptr
, file
, callback
, data
);
711 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
714 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
717 const char *sname
= bfd_section_name (s
);
718 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
721 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
724 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
726 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
734 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
735 lang_input_statement_type
*file
,
740 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
741 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
742 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
743 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
744 bfd_boolean multiple_sections_found
;
745 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
747 if (multiple_sections_found
)
749 walk_wild_section_general (ptr
, file
, callback
, data
);
753 s1
= find_section (file
, sec1
, &multiple_sections_found
);
754 if (multiple_sections_found
)
756 walk_wild_section_general (ptr
, file
, callback
, data
);
760 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
763 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
766 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
769 const char *sname
= bfd_section_name (s
);
770 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
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
== '=' || CONST_STRNEQ (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
, bfd_boolean 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 bfd_boolean 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
;
1805 bfd_boolean ignore_first
;
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
, 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 bfd_boolean place_after
= place
->stmt
== NULL
;
1924 bfd_boolean 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 bfd_boolean 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
;
2048 bfd_boolean found
= FALSE
;
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 bfd_boolean 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
)
2507 bfd_boolean discard
;
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 flag_info
*sflag_info
,
2541 lang_output_section_statement_type
*output
)
2543 flagword flags
= section
->flags
;
2545 bfd_boolean discard
;
2546 lang_input_section_type
*new_section
;
2547 bfd
*abfd
= link_info
.output_bfd
;
2549 /* Is this section one we know should be discarded? */
2550 discard
= lang_discard_section_p (section
);
2552 /* Discard input sections which are assigned to a section named
2553 DISCARD_SECTION_NAME. */
2554 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2559 if (section
->output_section
== NULL
)
2561 /* This prevents future calls from assigning this section. */
2562 section
->output_section
= bfd_abs_section_ptr
;
2564 else if (link_info
.non_contiguous_regions_warnings
)
2565 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions makes "
2566 "section `%pA' from '%pB' match /DISCARD/ clause.\n"),
2567 NULL
, section
, section
->owner
);
2576 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2581 if (section
->output_section
!= NULL
)
2583 if (!link_info
.non_contiguous_regions
)
2586 /* SECTION has already been handled in a special way
2587 (eg. LINK_ONCE): skip it. */
2588 if (bfd_is_abs_section (section
->output_section
))
2591 /* Already assigned to the same output section, do not process
2592 it again, to avoid creating loops between duplicate sections
2594 if (section
->output_section
== output
->bfd_section
)
2597 if (link_info
.non_contiguous_regions_warnings
&& output
->bfd_section
)
2598 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions may "
2599 "change behaviour for section `%pA' from '%pB' (assigned to "
2600 "%pA, but additional match: %pA)\n"),
2601 NULL
, section
, section
->owner
, section
->output_section
,
2602 output
->bfd_section
);
2604 /* SECTION has already been assigned to an output section, but
2605 the user allows it to be mapped to another one in case it
2606 overflows. We'll later update the actual output section in
2607 size_input_section as appropriate. */
2610 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2611 to an output section, because we want to be able to include a
2612 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2613 section (I don't know why we want to do this, but we do).
2614 build_link_order in ldwrite.c handles this case by turning
2615 the embedded SEC_NEVER_LOAD section into a fill. */
2616 flags
&= ~ SEC_NEVER_LOAD
;
2618 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2619 already been processed. One reason to do this is that on pe
2620 format targets, .text$foo sections go into .text and it's odd
2621 to see .text with SEC_LINK_ONCE set. */
2622 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2624 if (link_info
.resolve_section_groups
)
2625 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2627 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2629 else if (!bfd_link_relocatable (&link_info
))
2630 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2632 switch (output
->sectype
)
2634 case normal_section
:
2635 case overlay_section
:
2636 case first_overlay_section
:
2638 case noalloc_section
:
2639 flags
&= ~SEC_ALLOC
;
2641 case noload_section
:
2643 flags
|= SEC_NEVER_LOAD
;
2644 /* Unfortunately GNU ld has managed to evolve two different
2645 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2646 alloc, no contents section. All others get a noload, noalloc
2648 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2649 flags
&= ~SEC_HAS_CONTENTS
;
2651 flags
&= ~SEC_ALLOC
;
2655 if (output
->bfd_section
== NULL
)
2656 init_os (output
, flags
);
2658 /* If SEC_READONLY is not set in the input section, then clear
2659 it from the output section. */
2660 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2662 if (output
->bfd_section
->linker_has_input
)
2664 /* Only set SEC_READONLY flag on the first input section. */
2665 flags
&= ~ SEC_READONLY
;
2667 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2668 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2669 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2670 || ((flags
& SEC_MERGE
) != 0
2671 && output
->bfd_section
->entsize
!= section
->entsize
))
2673 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2674 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2677 output
->bfd_section
->flags
|= flags
;
2679 if (!output
->bfd_section
->linker_has_input
)
2681 output
->bfd_section
->linker_has_input
= 1;
2682 /* This must happen after flags have been updated. The output
2683 section may have been created before we saw its first input
2684 section, eg. for a data statement. */
2685 bfd_init_private_section_data (section
->owner
, section
,
2686 link_info
.output_bfd
,
2687 output
->bfd_section
,
2689 if ((flags
& SEC_MERGE
) != 0)
2690 output
->bfd_section
->entsize
= section
->entsize
;
2693 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2694 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2696 /* FIXME: This value should really be obtained from the bfd... */
2697 output
->block_value
= 128;
2700 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2701 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2703 section
->output_section
= output
->bfd_section
;
2705 if (!map_head_is_link_order
)
2707 asection
*s
= output
->bfd_section
->map_tail
.s
;
2708 output
->bfd_section
->map_tail
.s
= section
;
2709 section
->map_head
.s
= NULL
;
2710 section
->map_tail
.s
= s
;
2712 s
->map_head
.s
= section
;
2714 output
->bfd_section
->map_head
.s
= section
;
2717 /* Add a section reference to the list. */
2718 new_section
= new_stat (lang_input_section
, ptr
);
2719 new_section
->section
= section
;
2722 /* Handle wildcard sorting. This returns the lang_input_section which
2723 should follow the one we are going to create for SECTION and FILE,
2724 based on the sorting requirements of WILD. It returns NULL if the
2725 new section should just go at the end of the current list. */
2727 static lang_statement_union_type
*
2728 wild_sort (lang_wild_statement_type
*wild
,
2729 struct wildcard_list
*sec
,
2730 lang_input_statement_type
*file
,
2733 lang_statement_union_type
*l
;
2735 if (!wild
->filenames_sorted
2736 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2739 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2741 lang_input_section_type
*ls
;
2743 if (l
->header
.type
!= lang_input_section_enum
)
2745 ls
= &l
->input_section
;
2747 /* Sorting by filename takes precedence over sorting by section
2750 if (wild
->filenames_sorted
)
2752 const char *fn
, *ln
;
2756 /* The PE support for the .idata section as generated by
2757 dlltool assumes that files will be sorted by the name of
2758 the archive and then the name of the file within the
2761 if (file
->the_bfd
!= NULL
2762 && file
->the_bfd
->my_archive
!= NULL
)
2764 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2769 fn
= file
->filename
;
2773 if (ls
->section
->owner
->my_archive
!= NULL
)
2775 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2780 ln
= bfd_get_filename (ls
->section
->owner
);
2784 i
= filename_cmp (fn
, ln
);
2793 fn
= file
->filename
;
2795 ln
= bfd_get_filename (ls
->section
->owner
);
2797 i
= filename_cmp (fn
, ln
);
2805 /* Here either the files are not sorted by name, or we are
2806 looking at the sections for this file. */
2809 && sec
->spec
.sorted
!= none
2810 && sec
->spec
.sorted
!= by_none
)
2811 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2818 /* Expand a wild statement for a particular FILE. SECTION may be
2819 NULL, in which case it is a wild card. */
2822 output_section_callback (lang_wild_statement_type
*ptr
,
2823 struct wildcard_list
*sec
,
2825 lang_input_statement_type
*file
,
2828 lang_statement_union_type
*before
;
2829 lang_output_section_statement_type
*os
;
2831 os
= (lang_output_section_statement_type
*) output
;
2833 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2834 if (unique_section_p (section
, os
))
2837 before
= wild_sort (ptr
, sec
, file
, section
);
2839 /* Here BEFORE points to the lang_input_section which
2840 should follow the one we are about to add. If BEFORE
2841 is NULL, then the section should just go at the end
2842 of the current list. */
2845 lang_add_section (&ptr
->children
, section
, ptr
->section_flag_list
, os
);
2848 lang_statement_list_type list
;
2849 lang_statement_union_type
**pp
;
2851 lang_list_init (&list
);
2852 lang_add_section (&list
, section
, ptr
->section_flag_list
, os
);
2854 /* If we are discarding the section, LIST.HEAD will
2856 if (list
.head
!= NULL
)
2858 ASSERT (list
.head
->header
.next
== NULL
);
2860 for (pp
= &ptr
->children
.head
;
2862 pp
= &(*pp
)->header
.next
)
2863 ASSERT (*pp
!= NULL
);
2865 list
.head
->header
.next
= *pp
;
2871 /* Check if all sections in a wild statement for a particular FILE
2875 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2876 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2878 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2881 lang_output_section_statement_type
*os
;
2883 os
= (lang_output_section_statement_type
*) output
;
2885 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2886 if (unique_section_p (section
, os
))
2889 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2890 os
->all_input_readonly
= FALSE
;
2893 /* This is passed a file name which must have been seen already and
2894 added to the statement tree. We will see if it has been opened
2895 already and had its symbols read. If not then we'll read it. */
2897 static lang_input_statement_type
*
2898 lookup_name (const char *name
)
2900 lang_input_statement_type
*search
;
2902 for (search
= (void *) input_file_chain
.head
;
2904 search
= search
->next_real_file
)
2906 /* Use the local_sym_name as the name of the file that has
2907 already been loaded as filename might have been transformed
2908 via the search directory lookup mechanism. */
2909 const char *filename
= search
->local_sym_name
;
2911 if (filename
!= NULL
2912 && filename_cmp (filename
, name
) == 0)
2918 /* Arrange to splice the input statement added by new_afile into
2919 statement_list after the current input_file_chain tail.
2920 We know input_file_chain is not an empty list, and that
2921 lookup_name was called via open_input_bfds. Later calls to
2922 lookup_name should always match an existing input_statement. */
2923 lang_statement_union_type
**tail
= stat_ptr
->tail
;
2924 lang_statement_union_type
**after
2925 = (void *) ((char *) input_file_chain
.tail
2926 - offsetof (lang_input_statement_type
, next_real_file
)
2927 + offsetof (lang_input_statement_type
, header
.next
));
2928 lang_statement_union_type
*rest
= *after
;
2929 stat_ptr
->tail
= after
;
2930 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2931 default_target
, NULL
);
2932 *stat_ptr
->tail
= rest
;
2934 stat_ptr
->tail
= tail
;
2937 /* If we have already added this file, or this file is not real
2938 don't add this file. */
2939 if (search
->flags
.loaded
|| !search
->flags
.real
)
2942 if (!load_symbols (search
, NULL
))
2948 /* Save LIST as a list of libraries whose symbols should not be exported. */
2953 struct excluded_lib
*next
;
2955 static struct excluded_lib
*excluded_libs
;
2958 add_excluded_libs (const char *list
)
2960 const char *p
= list
, *end
;
2964 struct excluded_lib
*entry
;
2965 end
= strpbrk (p
, ",:");
2967 end
= p
+ strlen (p
);
2968 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2969 entry
->next
= excluded_libs
;
2970 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2971 memcpy (entry
->name
, p
, end
- p
);
2972 entry
->name
[end
- p
] = '\0';
2973 excluded_libs
= entry
;
2981 check_excluded_libs (bfd
*abfd
)
2983 struct excluded_lib
*lib
= excluded_libs
;
2987 int len
= strlen (lib
->name
);
2988 const char *filename
= lbasename (bfd_get_filename (abfd
));
2990 if (strcmp (lib
->name
, "ALL") == 0)
2992 abfd
->no_export
= TRUE
;
2996 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2997 && (filename
[len
] == '\0'
2998 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2999 && filename
[len
+ 2] == '\0')))
3001 abfd
->no_export
= TRUE
;
3009 /* Get the symbols for an input file. */
3012 load_symbols (lang_input_statement_type
*entry
,
3013 lang_statement_list_type
*place
)
3017 if (entry
->flags
.loaded
)
3020 ldfile_open_file (entry
);
3022 /* Do not process further if the file was missing. */
3023 if (entry
->flags
.missing_file
)
3026 if (trace_files
|| verbose
)
3027 info_msg ("%pI\n", entry
);
3029 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
3030 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
3033 struct lang_input_statement_flags save_flags
;
3036 err
= bfd_get_error ();
3038 /* See if the emulation has some special knowledge. */
3039 if (ldemul_unrecognized_file (entry
))
3042 if (err
== bfd_error_file_ambiguously_recognized
)
3046 einfo (_("%P: %pB: file not recognized: %E;"
3047 " matching formats:"), entry
->the_bfd
);
3048 for (p
= matching
; *p
!= NULL
; p
++)
3052 else if (err
!= bfd_error_file_not_recognized
3054 einfo (_("%F%P: %pB: file not recognized: %E\n"), entry
->the_bfd
);
3056 bfd_close (entry
->the_bfd
);
3057 entry
->the_bfd
= NULL
;
3059 /* Try to interpret the file as a linker script. */
3060 save_flags
= input_flags
;
3061 ldfile_open_command_file (entry
->filename
);
3063 push_stat_ptr (place
);
3064 input_flags
.add_DT_NEEDED_for_regular
3065 = entry
->flags
.add_DT_NEEDED_for_regular
;
3066 input_flags
.add_DT_NEEDED_for_dynamic
3067 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
3068 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
3069 input_flags
.dynamic
= entry
->flags
.dynamic
;
3071 ldfile_assumed_script
= TRUE
;
3072 parser_input
= input_script
;
3073 current_input_file
= entry
->filename
;
3075 current_input_file
= NULL
;
3076 ldfile_assumed_script
= FALSE
;
3078 /* missing_file is sticky. sysrooted will already have been
3079 restored when seeing EOF in yyparse, but no harm to restore
3081 save_flags
.missing_file
|= input_flags
.missing_file
;
3082 input_flags
= save_flags
;
3086 entry
->flags
.loaded
= TRUE
;
3091 if (ldemul_recognized_file (entry
))
3094 /* We don't call ldlang_add_file for an archive. Instead, the
3095 add_symbols entry point will call ldlang_add_file, via the
3096 add_archive_element callback, for each element of the archive
3098 switch (bfd_get_format (entry
->the_bfd
))
3104 if (!entry
->flags
.reload
)
3105 ldlang_add_file (entry
);
3109 check_excluded_libs (entry
->the_bfd
);
3111 bfd_set_usrdata (entry
->the_bfd
, entry
);
3112 if (entry
->flags
.whole_archive
)
3115 bfd_boolean loaded
= TRUE
;
3120 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
3125 if (!bfd_check_format (member
, bfd_object
))
3127 einfo (_("%F%P: %pB: member %pB in archive is not an object\n"),
3128 entry
->the_bfd
, member
);
3133 if (!(*link_info
.callbacks
3134 ->add_archive_element
) (&link_info
, member
,
3135 "--whole-archive", &subsbfd
))
3138 /* Potentially, the add_archive_element hook may have set a
3139 substitute BFD for us. */
3140 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
3142 einfo (_("%F%P: %pB: error adding symbols: %E\n"), member
);
3147 entry
->flags
.loaded
= loaded
;
3153 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
3154 entry
->flags
.loaded
= TRUE
;
3156 einfo (_("%F%P: %pB: error adding symbols: %E\n"), entry
->the_bfd
);
3158 return entry
->flags
.loaded
;
3161 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
3162 may be NULL, indicating that it is a wildcard. Separate
3163 lang_input_section statements are created for each part of the
3164 expansion; they are added after the wild statement S. OUTPUT is
3165 the output section. */
3168 wild (lang_wild_statement_type
*s
,
3169 const char *target ATTRIBUTE_UNUSED
,
3170 lang_output_section_statement_type
*output
)
3172 struct wildcard_list
*sec
;
3174 if (s
->handler_data
[0]
3175 && s
->handler_data
[0]->spec
.sorted
== by_name
3176 && !s
->filenames_sorted
)
3178 lang_section_bst_type
*tree
;
3180 walk_wild (s
, output_section_callback_fast
, output
);
3185 output_section_callback_tree_to_list (s
, tree
, output
);
3190 walk_wild (s
, output_section_callback
, output
);
3192 if (default_common_section
== NULL
)
3193 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
3194 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
3196 /* Remember the section that common is going to in case we
3197 later get something which doesn't know where to put it. */
3198 default_common_section
= output
;
3203 /* Return TRUE iff target is the sought target. */
3206 get_target (const bfd_target
*target
, void *data
)
3208 const char *sought
= (const char *) data
;
3210 return strcmp (target
->name
, sought
) == 0;
3213 /* Like strcpy() but convert to lower case as well. */
3216 stricpy (char *dest
, const char *src
)
3220 while ((c
= *src
++) != 0)
3221 *dest
++ = TOLOWER (c
);
3226 /* Remove the first occurrence of needle (if any) in haystack
3230 strcut (char *haystack
, const char *needle
)
3232 haystack
= strstr (haystack
, needle
);
3238 for (src
= haystack
+ strlen (needle
); *src
;)
3239 *haystack
++ = *src
++;
3245 /* Compare two target format name strings.
3246 Return a value indicating how "similar" they are. */
3249 name_compare (const char *first
, const char *second
)
3255 copy1
= (char *) xmalloc (strlen (first
) + 1);
3256 copy2
= (char *) xmalloc (strlen (second
) + 1);
3258 /* Convert the names to lower case. */
3259 stricpy (copy1
, first
);
3260 stricpy (copy2
, second
);
3262 /* Remove size and endian strings from the name. */
3263 strcut (copy1
, "big");
3264 strcut (copy1
, "little");
3265 strcut (copy2
, "big");
3266 strcut (copy2
, "little");
3268 /* Return a value based on how many characters match,
3269 starting from the beginning. If both strings are
3270 the same then return 10 * their length. */
3271 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3272 if (copy1
[result
] == 0)
3284 /* Set by closest_target_match() below. */
3285 static const bfd_target
*winner
;
3287 /* Scan all the valid bfd targets looking for one that has the endianness
3288 requirement that was specified on the command line, and is the nearest
3289 match to the original output target. */
3292 closest_target_match (const bfd_target
*target
, void *data
)
3294 const bfd_target
*original
= (const bfd_target
*) data
;
3296 if (command_line
.endian
== ENDIAN_BIG
3297 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3300 if (command_line
.endian
== ENDIAN_LITTLE
3301 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3304 /* Must be the same flavour. */
3305 if (target
->flavour
!= original
->flavour
)
3308 /* Ignore generic big and little endian elf vectors. */
3309 if (strcmp (target
->name
, "elf32-big") == 0
3310 || strcmp (target
->name
, "elf64-big") == 0
3311 || strcmp (target
->name
, "elf32-little") == 0
3312 || strcmp (target
->name
, "elf64-little") == 0)
3315 /* If we have not found a potential winner yet, then record this one. */
3322 /* Oh dear, we now have two potential candidates for a successful match.
3323 Compare their names and choose the better one. */
3324 if (name_compare (target
->name
, original
->name
)
3325 > name_compare (winner
->name
, original
->name
))
3328 /* Keep on searching until wqe have checked them all. */
3332 /* Return the BFD target format of the first input file. */
3335 get_first_input_target (void)
3337 const char *target
= NULL
;
3339 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3341 if (s
->header
.type
== lang_input_statement_enum
3344 ldfile_open_file (s
);
3346 if (s
->the_bfd
!= NULL
3347 && bfd_check_format (s
->the_bfd
, bfd_object
))
3349 target
= bfd_get_target (s
->the_bfd
);
3361 lang_get_output_target (void)
3365 /* Has the user told us which output format to use? */
3366 if (output_target
!= NULL
)
3367 return output_target
;
3369 /* No - has the current target been set to something other than
3371 if (current_target
!= default_target
&& current_target
!= NULL
)
3372 return current_target
;
3374 /* No - can we determine the format of the first input file? */
3375 target
= get_first_input_target ();
3379 /* Failed - use the default output target. */
3380 return default_target
;
3383 /* Open the output file. */
3386 open_output (const char *name
)
3388 output_target
= lang_get_output_target ();
3390 /* Has the user requested a particular endianness on the command
3392 if (command_line
.endian
!= ENDIAN_UNSET
)
3394 /* Get the chosen target. */
3395 const bfd_target
*target
3396 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3398 /* If the target is not supported, we cannot do anything. */
3401 enum bfd_endian desired_endian
;
3403 if (command_line
.endian
== ENDIAN_BIG
)
3404 desired_endian
= BFD_ENDIAN_BIG
;
3406 desired_endian
= BFD_ENDIAN_LITTLE
;
3408 /* See if the target has the wrong endianness. This should
3409 not happen if the linker script has provided big and
3410 little endian alternatives, but some scrips don't do
3412 if (target
->byteorder
!= desired_endian
)
3414 /* If it does, then see if the target provides
3415 an alternative with the correct endianness. */
3416 if (target
->alternative_target
!= NULL
3417 && (target
->alternative_target
->byteorder
== desired_endian
))
3418 output_target
= target
->alternative_target
->name
;
3421 /* Try to find a target as similar as possible to
3422 the default target, but which has the desired
3423 endian characteristic. */
3424 bfd_iterate_over_targets (closest_target_match
,
3427 /* Oh dear - we could not find any targets that
3428 satisfy our requirements. */
3430 einfo (_("%P: warning: could not find any targets"
3431 " that match endianness requirement\n"));
3433 output_target
= winner
->name
;
3439 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3441 if (link_info
.output_bfd
== NULL
)
3443 if (bfd_get_error () == bfd_error_invalid_target
)
3444 einfo (_("%F%P: target %s not found\n"), output_target
);
3446 einfo (_("%F%P: cannot open output file %s: %E\n"), name
);
3449 delete_output_file_on_failure
= TRUE
;
3451 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3452 einfo (_("%F%P: %s: can not make object file: %E\n"), name
);
3453 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3454 ldfile_output_architecture
,
3455 ldfile_output_machine
))
3456 einfo (_("%F%P: %s: can not set architecture: %E\n"), name
);
3458 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3459 if (link_info
.hash
== NULL
)
3460 einfo (_("%F%P: can not create hash table: %E\n"));
3462 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3466 ldlang_open_output (lang_statement_union_type
*statement
)
3468 switch (statement
->header
.type
)
3470 case lang_output_statement_enum
:
3471 ASSERT (link_info
.output_bfd
== NULL
);
3472 open_output (statement
->output_statement
.name
);
3473 ldemul_set_output_arch ();
3474 if (config
.magic_demand_paged
3475 && !bfd_link_relocatable (&link_info
))
3476 link_info
.output_bfd
->flags
|= D_PAGED
;
3478 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3479 if (config
.text_read_only
)
3480 link_info
.output_bfd
->flags
|= WP_TEXT
;
3482 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3483 if (link_info
.traditional_format
)
3484 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3486 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3489 case lang_target_statement_enum
:
3490 current_target
= statement
->target_statement
.target
;
3498 init_opb (asection
*s
)
3503 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
3505 && (s
->flags
& SEC_ELF_OCTETS
) != 0)
3508 x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3509 ldfile_output_machine
);
3511 while ((x
& 1) == 0)
3519 /* Open all the input files. */
3523 OPEN_BFD_NORMAL
= 0,
3527 #if BFD_SUPPORTS_PLUGINS
3528 static lang_input_statement_type
*plugin_insert
= NULL
;
3529 static struct bfd_link_hash_entry
*plugin_undefs
= NULL
;
3533 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3535 for (; s
!= NULL
; s
= s
->header
.next
)
3537 switch (s
->header
.type
)
3539 case lang_constructors_statement_enum
:
3540 open_input_bfds (constructor_list
.head
, mode
);
3542 case lang_output_section_statement_enum
:
3543 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3545 case lang_wild_statement_enum
:
3546 /* Maybe we should load the file's symbols. */
3547 if ((mode
& OPEN_BFD_RESCAN
) == 0
3548 && s
->wild_statement
.filename
3549 && !wildcardp (s
->wild_statement
.filename
)
3550 && !archive_path (s
->wild_statement
.filename
))
3551 lookup_name (s
->wild_statement
.filename
);
3552 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3554 case lang_group_statement_enum
:
3556 struct bfd_link_hash_entry
*undefs
;
3557 #if BFD_SUPPORTS_PLUGINS
3558 lang_input_statement_type
*plugin_insert_save
;
3561 /* We must continually search the entries in the group
3562 until no new symbols are added to the list of undefined
3567 #if BFD_SUPPORTS_PLUGINS
3568 plugin_insert_save
= plugin_insert
;
3570 undefs
= link_info
.hash
->undefs_tail
;
3571 open_input_bfds (s
->group_statement
.children
.head
,
3572 mode
| OPEN_BFD_FORCE
);
3574 while (undefs
!= link_info
.hash
->undefs_tail
3575 #if BFD_SUPPORTS_PLUGINS
3576 /* Objects inserted by a plugin, which are loaded
3577 before we hit this loop, may have added new
3579 || (plugin_insert
!= plugin_insert_save
&& plugin_undefs
)
3584 case lang_target_statement_enum
:
3585 current_target
= s
->target_statement
.target
;
3587 case lang_input_statement_enum
:
3588 if (s
->input_statement
.flags
.real
)
3590 lang_statement_union_type
**os_tail
;
3591 lang_statement_list_type add
;
3594 s
->input_statement
.target
= current_target
;
3596 /* If we are being called from within a group, and this
3597 is an archive which has already been searched, then
3598 force it to be researched unless the whole archive
3599 has been loaded already. Do the same for a rescan.
3600 Likewise reload --as-needed shared libs. */
3601 if (mode
!= OPEN_BFD_NORMAL
3602 #if BFD_SUPPORTS_PLUGINS
3603 && ((mode
& OPEN_BFD_RESCAN
) == 0
3604 || plugin_insert
== NULL
)
3606 && s
->input_statement
.flags
.loaded
3607 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3608 && ((bfd_get_format (abfd
) == bfd_archive
3609 && !s
->input_statement
.flags
.whole_archive
)
3610 || (bfd_get_format (abfd
) == bfd_object
3611 && ((abfd
->flags
) & DYNAMIC
) != 0
3612 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3613 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3614 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3616 s
->input_statement
.flags
.loaded
= FALSE
;
3617 s
->input_statement
.flags
.reload
= TRUE
;
3620 os_tail
= lang_os_list
.tail
;
3621 lang_list_init (&add
);
3623 if (!load_symbols (&s
->input_statement
, &add
))
3624 config
.make_executable
= FALSE
;
3626 if (add
.head
!= NULL
)
3628 /* If this was a script with output sections then
3629 tack any added statements on to the end of the
3630 list. This avoids having to reorder the output
3631 section statement list. Very likely the user
3632 forgot -T, and whatever we do here will not meet
3633 naive user expectations. */
3634 if (os_tail
!= lang_os_list
.tail
)
3636 einfo (_("%P: warning: %s contains output sections;"
3637 " did you forget -T?\n"),
3638 s
->input_statement
.filename
);
3639 *stat_ptr
->tail
= add
.head
;
3640 stat_ptr
->tail
= add
.tail
;
3644 *add
.tail
= s
->header
.next
;
3645 s
->header
.next
= add
.head
;
3649 #if BFD_SUPPORTS_PLUGINS
3650 /* If we have found the point at which a plugin added new
3651 files, clear plugin_insert to enable archive rescan. */
3652 if (&s
->input_statement
== plugin_insert
)
3653 plugin_insert
= NULL
;
3656 case lang_assignment_statement_enum
:
3657 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3658 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3665 /* Exit if any of the files were missing. */
3666 if (input_flags
.missing_file
)
3670 #ifdef ENABLE_LIBCTF
3671 /* Emit CTF errors and warnings. fp can be NULL to report errors/warnings
3672 that happened specifically at CTF open time. */
3674 lang_ctf_errs_warnings (ctf_dict_t
*fp
)
3676 ctf_next_t
*i
= NULL
;
3681 while ((text
= ctf_errwarning_next (fp
, &i
, &is_warning
, &err
)) != NULL
)
3683 einfo (_("%s: %s\n"), is_warning
? _("CTF warning"): _("CTF error"),
3687 if (err
!= ECTF_NEXT_END
)
3689 einfo (_("CTF error: cannot get CTF errors: `%s'\n"),
3693 /* `err' returns errors from the error/warning iterator in particular.
3694 These never assert. But if we have an fp, that could have recorded
3695 an assertion failure: assert if it has done so. */
3696 ASSERT (!fp
|| ctf_errno (fp
) != ECTF_INTERNAL
);
3699 /* Open the CTF sections in the input files with libctf: if any were opened,
3700 create a fake input file that we'll write the merged CTF data to later
3704 ldlang_open_ctf (void)
3709 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3713 /* Incoming files from the compiler have a single ctf_dict_t in them
3714 (which is presented to us by the libctf API in a ctf_archive_t
3715 wrapper): files derived from a previous relocatable link have a CTF
3716 archive containing possibly many CTF files. */
3718 if ((file
->the_ctf
= ctf_bfdopen (file
->the_bfd
, &err
)) == NULL
)
3720 if (err
!= ECTF_NOCTFDATA
)
3722 lang_ctf_errs_warnings (NULL
);
3723 einfo (_("%P: warning: CTF section in %pB not loaded; "
3724 "its types will be discarded: %s\n"), file
->the_bfd
,
3730 /* Prevent the contents of this section from being written, while
3731 requiring the section itself to be duplicated in the output, but only
3733 /* This section must exist if ctf_bfdopen() succeeded. */
3734 sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf");
3736 sect
->flags
|= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
| SEC_LINKER_CREATED
;
3739 sect
->flags
|= SEC_EXCLUDE
;
3749 if ((ctf_output
= ctf_create (&err
)) != NULL
)
3752 einfo (_("%P: warning: CTF output not created: `%s'\n"),
3755 LANG_FOR_EACH_INPUT_STATEMENT (errfile
)
3756 ctf_close (errfile
->the_ctf
);
3759 /* Merge together CTF sections. After this, only the symtab-dependent
3760 function and data object sections need adjustment. */
3763 lang_merge_ctf (void)
3765 asection
*output_sect
;
3771 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3773 /* If the section was discarded, don't waste time merging. */
3774 if (output_sect
== NULL
)
3776 ctf_dict_close (ctf_output
);
3779 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3781 ctf_close (file
->the_ctf
);
3782 file
->the_ctf
= NULL
;
3787 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3792 /* Takes ownership of file->the_ctf. */
3793 if (ctf_link_add_ctf (ctf_output
, file
->the_ctf
, file
->filename
) < 0)
3795 einfo (_("%P: warning: CTF section in %pB cannot be linked: `%s'\n"),
3796 file
->the_bfd
, ctf_errmsg (ctf_errno (ctf_output
)));
3797 ctf_close (file
->the_ctf
);
3798 file
->the_ctf
= NULL
;
3803 if (!config
.ctf_share_duplicated
)
3804 flags
= CTF_LINK_SHARE_UNCONFLICTED
;
3806 flags
= CTF_LINK_SHARE_DUPLICATED
;
3807 if (!config
.ctf_variables
)
3808 flags
|= CTF_LINK_OMIT_VARIABLES_SECTION
;
3810 if (ctf_link (ctf_output
, flags
) < 0)
3812 lang_ctf_errs_warnings (ctf_output
);
3813 einfo (_("%P: warning: CTF linking failed; "
3814 "output will have no CTF section: %s\n"),
3815 ctf_errmsg (ctf_errno (ctf_output
)));
3818 output_sect
->size
= 0;
3819 output_sect
->flags
|= SEC_EXCLUDE
;
3822 /* Output any lingering errors that didn't come from ctf_link. */
3823 lang_ctf_errs_warnings (ctf_output
);
3826 /* Let the emulation acquire strings from the dynamic strtab to help it optimize
3827 the CTF, if supported. */
3830 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
)
3832 ldemul_acquire_strings_for_ctf (ctf_output
, dynstrtab
);
3835 /* Inform the emulation about the addition of a new dynamic symbol, in BFD
3837 void ldlang_ctf_new_dynsym (int symidx
, struct elf_internal_sym
*sym
)
3839 ldemul_new_dynsym_for_ctf (ctf_output
, symidx
, sym
);
3842 /* Write out the CTF section. Called early, if the emulation isn't going to
3843 need to dedup against the strtab and symtab, then possibly called from the
3844 target linker code if the dedup has happened. */
3846 lang_write_ctf (int late
)
3849 asection
*output_sect
;
3856 /* Emit CTF late if this emulation says it can do so. */
3857 if (ldemul_emit_ctf_early ())
3862 if (!ldemul_emit_ctf_early ())
3866 /* Inform the emulation that all the symbols that will be received have
3869 ldemul_new_dynsym_for_ctf (ctf_output
, 0, NULL
);
3873 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3876 output_sect
->contents
= ctf_link_write (ctf_output
, &output_size
,
3877 CTF_COMPRESSION_THRESHOLD
);
3878 output_sect
->size
= output_size
;
3879 output_sect
->flags
|= SEC_IN_MEMORY
| SEC_KEEP
;
3881 lang_ctf_errs_warnings (ctf_output
);
3882 if (!output_sect
->contents
)
3884 einfo (_("%P: warning: CTF section emission failed; "
3885 "output will have no CTF section: %s\n"),
3886 ctf_errmsg (ctf_errno (ctf_output
)));
3887 output_sect
->size
= 0;
3888 output_sect
->flags
|= SEC_EXCLUDE
;
3892 /* This also closes every CTF input file used in the link. */
3893 ctf_dict_close (ctf_output
);
3896 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3897 file
->the_ctf
= NULL
;
3900 /* Write out the CTF section late, if the emulation needs that. */
3903 ldlang_write_ctf_late (void)
3905 /* Trigger a "late call", if the emulation needs one. */
3911 ldlang_open_ctf (void)
3913 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3917 /* If built without CTF, warn and delete all CTF sections from the output.
3918 (The alternative would be to simply concatenate them, which does not
3919 yield a valid CTF section.) */
3921 if ((sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf")) != NULL
)
3923 einfo (_("%P: warning: CTF section in %pB not linkable: "
3924 "%P was built without support for CTF\n"), file
->the_bfd
);
3926 sect
->flags
|= SEC_EXCLUDE
;
3931 static void lang_merge_ctf (void) {}
3933 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
3934 ATTRIBUTE_UNUSED
) {}
3936 ldlang_ctf_new_dynsym (int symidx ATTRIBUTE_UNUSED
,
3937 struct elf_internal_sym
*sym ATTRIBUTE_UNUSED
) {}
3938 static void lang_write_ctf (int late ATTRIBUTE_UNUSED
) {}
3939 void ldlang_write_ctf_late (void) {}
3942 /* Add the supplied name to the symbol table as an undefined reference.
3943 This is a two step process as the symbol table doesn't even exist at
3944 the time the ld command line is processed. First we put the name
3945 on a list, then, once the output file has been opened, transfer the
3946 name to the symbol table. */
3948 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3950 #define ldlang_undef_chain_list_head entry_symbol.next
3953 ldlang_add_undef (const char *const name
, bfd_boolean cmdline ATTRIBUTE_UNUSED
)
3955 ldlang_undef_chain_list_type
*new_undef
;
3957 new_undef
= stat_alloc (sizeof (*new_undef
));
3958 new_undef
->next
= ldlang_undef_chain_list_head
;
3959 ldlang_undef_chain_list_head
= new_undef
;
3961 new_undef
->name
= xstrdup (name
);
3963 if (link_info
.output_bfd
!= NULL
)
3964 insert_undefined (new_undef
->name
);
3967 /* Insert NAME as undefined in the symbol table. */
3970 insert_undefined (const char *name
)
3972 struct bfd_link_hash_entry
*h
;
3974 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3976 einfo (_("%F%P: bfd_link_hash_lookup failed: %E\n"));
3977 if (h
->type
== bfd_link_hash_new
)
3979 h
->type
= bfd_link_hash_undefined
;
3980 h
->u
.undef
.abfd
= NULL
;
3981 h
->non_ir_ref_regular
= TRUE
;
3982 if (is_elf_hash_table (link_info
.hash
))
3983 ((struct elf_link_hash_entry
*) h
)->mark
= 1;
3984 bfd_link_add_undef (link_info
.hash
, h
);
3988 /* Run through the list of undefineds created above and place them
3989 into the linker hash table as undefined symbols belonging to the
3993 lang_place_undefineds (void)
3995 ldlang_undef_chain_list_type
*ptr
;
3997 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3998 insert_undefined (ptr
->name
);
4001 /* Structure used to build the list of symbols that the user has required
4004 struct require_defined_symbol
4007 struct require_defined_symbol
*next
;
4010 /* The list of symbols that the user has required be defined. */
4012 static struct require_defined_symbol
*require_defined_symbol_list
;
4014 /* Add a new symbol NAME to the list of symbols that are required to be
4018 ldlang_add_require_defined (const char *const name
)
4020 struct require_defined_symbol
*ptr
;
4022 ldlang_add_undef (name
, TRUE
);
4023 ptr
= stat_alloc (sizeof (*ptr
));
4024 ptr
->next
= require_defined_symbol_list
;
4025 ptr
->name
= strdup (name
);
4026 require_defined_symbol_list
= ptr
;
4029 /* Check that all symbols the user required to be defined, are defined,
4030 raise an error if we find a symbol that is not defined. */
4033 ldlang_check_require_defined_symbols (void)
4035 struct require_defined_symbol
*ptr
;
4037 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
4039 struct bfd_link_hash_entry
*h
;
4041 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
4042 FALSE
, FALSE
, TRUE
);
4044 || (h
->type
!= bfd_link_hash_defined
4045 && h
->type
!= bfd_link_hash_defweak
))
4046 einfo(_("%X%P: required symbol `%s' not defined\n"), ptr
->name
);
4050 /* Check for all readonly or some readwrite sections. */
4053 check_input_sections
4054 (lang_statement_union_type
*s
,
4055 lang_output_section_statement_type
*output_section_statement
)
4057 for (; s
!= NULL
; s
= s
->header
.next
)
4059 switch (s
->header
.type
)
4061 case lang_wild_statement_enum
:
4062 walk_wild (&s
->wild_statement
, check_section_callback
,
4063 output_section_statement
);
4064 if (!output_section_statement
->all_input_readonly
)
4067 case lang_constructors_statement_enum
:
4068 check_input_sections (constructor_list
.head
,
4069 output_section_statement
);
4070 if (!output_section_statement
->all_input_readonly
)
4073 case lang_group_statement_enum
:
4074 check_input_sections (s
->group_statement
.children
.head
,
4075 output_section_statement
);
4076 if (!output_section_statement
->all_input_readonly
)
4085 /* Update wildcard statements if needed. */
4088 update_wild_statements (lang_statement_union_type
*s
)
4090 struct wildcard_list
*sec
;
4092 switch (sort_section
)
4102 for (; s
!= NULL
; s
= s
->header
.next
)
4104 switch (s
->header
.type
)
4109 case lang_wild_statement_enum
:
4110 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
4112 /* Don't sort .init/.fini sections. */
4113 if (strcmp (sec
->spec
.name
, ".init") != 0
4114 && strcmp (sec
->spec
.name
, ".fini") != 0)
4115 switch (sec
->spec
.sorted
)
4118 sec
->spec
.sorted
= sort_section
;
4121 if (sort_section
== by_alignment
)
4122 sec
->spec
.sorted
= by_name_alignment
;
4125 if (sort_section
== by_name
)
4126 sec
->spec
.sorted
= by_alignment_name
;
4133 case lang_constructors_statement_enum
:
4134 update_wild_statements (constructor_list
.head
);
4137 case lang_output_section_statement_enum
:
4138 update_wild_statements
4139 (s
->output_section_statement
.children
.head
);
4142 case lang_group_statement_enum
:
4143 update_wild_statements (s
->group_statement
.children
.head
);
4151 /* Open input files and attach to output sections. */
4154 map_input_to_output_sections
4155 (lang_statement_union_type
*s
, const char *target
,
4156 lang_output_section_statement_type
*os
)
4158 for (; s
!= NULL
; s
= s
->header
.next
)
4160 lang_output_section_statement_type
*tos
;
4163 switch (s
->header
.type
)
4165 case lang_wild_statement_enum
:
4166 wild (&s
->wild_statement
, target
, os
);
4168 case lang_constructors_statement_enum
:
4169 map_input_to_output_sections (constructor_list
.head
,
4173 case lang_output_section_statement_enum
:
4174 tos
= &s
->output_section_statement
;
4175 if (tos
->constraint
== ONLY_IF_RW
4176 || tos
->constraint
== ONLY_IF_RO
)
4178 tos
->all_input_readonly
= TRUE
;
4179 check_input_sections (tos
->children
.head
, tos
);
4180 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
4181 tos
->constraint
= -1;
4183 if (tos
->constraint
>= 0)
4184 map_input_to_output_sections (tos
->children
.head
,
4188 case lang_output_statement_enum
:
4190 case lang_target_statement_enum
:
4191 target
= s
->target_statement
.target
;
4193 case lang_group_statement_enum
:
4194 map_input_to_output_sections (s
->group_statement
.children
.head
,
4198 case lang_data_statement_enum
:
4199 /* Make sure that any sections mentioned in the expression
4201 exp_init_os (s
->data_statement
.exp
);
4202 /* The output section gets CONTENTS, ALLOC and LOAD, but
4203 these may be overridden by the script. */
4204 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
4205 switch (os
->sectype
)
4207 case normal_section
:
4208 case overlay_section
:
4209 case first_overlay_section
:
4211 case noalloc_section
:
4212 flags
= SEC_HAS_CONTENTS
;
4214 case noload_section
:
4215 if (bfd_get_flavour (link_info
.output_bfd
)
4216 == bfd_target_elf_flavour
)
4217 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
4219 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
4222 if (os
->bfd_section
== NULL
)
4223 init_os (os
, flags
);
4225 os
->bfd_section
->flags
|= flags
;
4227 case lang_input_section_enum
:
4229 case lang_fill_statement_enum
:
4230 case lang_object_symbols_statement_enum
:
4231 case lang_reloc_statement_enum
:
4232 case lang_padding_statement_enum
:
4233 case lang_input_statement_enum
:
4234 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4237 case lang_assignment_statement_enum
:
4238 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4241 /* Make sure that any sections mentioned in the assignment
4243 exp_init_os (s
->assignment_statement
.exp
);
4245 case lang_address_statement_enum
:
4246 /* Mark the specified section with the supplied address.
4247 If this section was actually a segment marker, then the
4248 directive is ignored if the linker script explicitly
4249 processed the segment marker. Originally, the linker
4250 treated segment directives (like -Ttext on the
4251 command-line) as section directives. We honor the
4252 section directive semantics for backwards compatibility;
4253 linker scripts that do not specifically check for
4254 SEGMENT_START automatically get the old semantics. */
4255 if (!s
->address_statement
.segment
4256 || !s
->address_statement
.segment
->used
)
4258 const char *name
= s
->address_statement
.section_name
;
4260 /* Create the output section statement here so that
4261 orphans with a set address will be placed after other
4262 script sections. If we let the orphan placement code
4263 place them in amongst other sections then the address
4264 will affect following script sections, which is
4265 likely to surprise naive users. */
4266 tos
= lang_output_section_statement_lookup (name
, 0, 1);
4267 tos
->addr_tree
= s
->address_statement
.address
;
4268 if (tos
->bfd_section
== NULL
)
4272 case lang_insert_statement_enum
:
4278 /* An insert statement snips out all the linker statements from the
4279 start of the list and places them after the output section
4280 statement specified by the insert. This operation is complicated
4281 by the fact that we keep a doubly linked list of output section
4282 statements as well as the singly linked list of all statements.
4283 FIXME someday: Twiddling with the list not only moves statements
4284 from the user's script but also input and group statements that are
4285 built from command line object files and --start-group. We only
4286 get away with this because the list pointers used by file_chain
4287 and input_file_chain are not reordered, and processing via
4288 statement_list after this point mostly ignores input statements.
4289 One exception is the map file, where LOAD and START GROUP/END GROUP
4290 can end up looking odd. */
4293 process_insert_statements (lang_statement_union_type
**start
)
4295 lang_statement_union_type
**s
;
4296 lang_output_section_statement_type
*first_os
= NULL
;
4297 lang_output_section_statement_type
*last_os
= NULL
;
4298 lang_output_section_statement_type
*os
;
4303 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
4305 /* Keep pointers to the first and last output section
4306 statement in the sequence we may be about to move. */
4307 os
= &(*s
)->output_section_statement
;
4309 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
4312 /* Set constraint negative so that lang_output_section_find
4313 won't match this output section statement. At this
4314 stage in linking constraint has values in the range
4315 [-1, ONLY_IN_RW]. */
4316 last_os
->constraint
= -2 - last_os
->constraint
;
4317 if (first_os
== NULL
)
4320 else if ((*s
)->header
.type
== lang_group_statement_enum
)
4322 /* A user might put -T between --start-group and
4323 --end-group. One way this odd construct might arise is
4324 from a wrapper around ld to change library search
4325 behaviour. For example:
4327 exec real_ld --start-group "$@" --end-group
4328 This isn't completely unreasonable so go looking inside a
4329 group statement for insert statements. */
4330 process_insert_statements (&(*s
)->group_statement
.children
.head
);
4332 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
4334 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
4335 lang_output_section_statement_type
*where
;
4336 lang_statement_union_type
**ptr
;
4337 lang_statement_union_type
*first
;
4339 if (link_info
.non_contiguous_regions
)
4341 einfo (_("warning: INSERT statement in linker script is "
4342 "incompatible with --enable-non-contiguous-regions.\n"));
4345 where
= lang_output_section_find (i
->where
);
4346 if (where
!= NULL
&& i
->is_before
)
4349 where
= where
->prev
;
4350 while (where
!= NULL
&& where
->constraint
< 0);
4354 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
4358 /* Deal with reordering the output section statement list. */
4359 if (last_os
!= NULL
)
4361 asection
*first_sec
, *last_sec
;
4362 struct lang_output_section_statement_struct
**next
;
4364 /* Snip out the output sections we are moving. */
4365 first_os
->prev
->next
= last_os
->next
;
4366 if (last_os
->next
== NULL
)
4368 next
= &first_os
->prev
->next
;
4369 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4372 last_os
->next
->prev
= first_os
->prev
;
4373 /* Add them in at the new position. */
4374 last_os
->next
= where
->next
;
4375 if (where
->next
== NULL
)
4377 next
= &last_os
->next
;
4378 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4381 where
->next
->prev
= last_os
;
4382 first_os
->prev
= where
;
4383 where
->next
= first_os
;
4385 /* Move the bfd sections in the same way. */
4388 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4390 os
->constraint
= -2 - os
->constraint
;
4391 if (os
->bfd_section
!= NULL
4392 && os
->bfd_section
->owner
!= NULL
)
4394 last_sec
= os
->bfd_section
;
4395 if (first_sec
== NULL
)
4396 first_sec
= last_sec
;
4401 if (last_sec
!= NULL
)
4403 asection
*sec
= where
->bfd_section
;
4405 sec
= output_prev_sec_find (where
);
4407 /* The place we want to insert must come after the
4408 sections we are moving. So if we find no
4409 section or if the section is the same as our
4410 last section, then no move is needed. */
4411 if (sec
!= NULL
&& sec
!= last_sec
)
4413 /* Trim them off. */
4414 if (first_sec
->prev
!= NULL
)
4415 first_sec
->prev
->next
= last_sec
->next
;
4417 link_info
.output_bfd
->sections
= last_sec
->next
;
4418 if (last_sec
->next
!= NULL
)
4419 last_sec
->next
->prev
= first_sec
->prev
;
4421 link_info
.output_bfd
->section_last
= first_sec
->prev
;
4423 last_sec
->next
= sec
->next
;
4424 if (sec
->next
!= NULL
)
4425 sec
->next
->prev
= last_sec
;
4427 link_info
.output_bfd
->section_last
= last_sec
;
4428 first_sec
->prev
= sec
;
4429 sec
->next
= first_sec
;
4437 ptr
= insert_os_after (where
);
4438 /* Snip everything from the start of the list, up to and
4439 including the insert statement we are currently processing. */
4441 *start
= (*s
)->header
.next
;
4442 /* Add them back where they belong, minus the insert. */
4445 statement_list
.tail
= s
;
4450 s
= &(*s
)->header
.next
;
4453 /* Undo constraint twiddling. */
4454 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4456 os
->constraint
= -2 - os
->constraint
;
4462 /* An output section might have been removed after its statement was
4463 added. For example, ldemul_before_allocation can remove dynamic
4464 sections if they turn out to be not needed. Clean them up here. */
4467 strip_excluded_output_sections (void)
4469 lang_output_section_statement_type
*os
;
4471 /* Run lang_size_sections (if not already done). */
4472 if (expld
.phase
!= lang_mark_phase_enum
)
4474 expld
.phase
= lang_mark_phase_enum
;
4475 expld
.dataseg
.phase
= exp_seg_none
;
4476 one_lang_size_sections_pass (NULL
, FALSE
);
4477 lang_reset_memory_regions ();
4480 for (os
= (void *) lang_os_list
.head
;
4484 asection
*output_section
;
4485 bfd_boolean exclude
;
4487 if (os
->constraint
< 0)
4490 output_section
= os
->bfd_section
;
4491 if (output_section
== NULL
)
4494 exclude
= (output_section
->rawsize
== 0
4495 && (output_section
->flags
& SEC_KEEP
) == 0
4496 && !bfd_section_removed_from_list (link_info
.output_bfd
,
4499 /* Some sections have not yet been sized, notably .gnu.version,
4500 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
4501 input sections, so don't drop output sections that have such
4502 input sections unless they are also marked SEC_EXCLUDE. */
4503 if (exclude
&& output_section
->map_head
.s
!= NULL
)
4507 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
4508 if ((s
->flags
& SEC_EXCLUDE
) == 0
4509 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
4510 || link_info
.emitrelocations
))
4519 /* We don't set bfd_section to NULL since bfd_section of the
4520 removed output section statement may still be used. */
4521 if (!os
->update_dot
)
4523 output_section
->flags
|= SEC_EXCLUDE
;
4524 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
4525 link_info
.output_bfd
->section_count
--;
4530 /* Called from ldwrite to clear out asection.map_head and
4531 asection.map_tail for use as link_orders in ldwrite. */
4534 lang_clear_os_map (void)
4536 lang_output_section_statement_type
*os
;
4538 if (map_head_is_link_order
)
4541 for (os
= (void *) lang_os_list
.head
;
4545 asection
*output_section
;
4547 if (os
->constraint
< 0)
4550 output_section
= os
->bfd_section
;
4551 if (output_section
== NULL
)
4554 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
4555 output_section
->map_head
.link_order
= NULL
;
4556 output_section
->map_tail
.link_order
= NULL
;
4559 /* Stop future calls to lang_add_section from messing with map_head
4560 and map_tail link_order fields. */
4561 map_head_is_link_order
= TRUE
;
4565 print_output_section_statement
4566 (lang_output_section_statement_type
*output_section_statement
)
4568 asection
*section
= output_section_statement
->bfd_section
;
4571 if (output_section_statement
!= abs_output_section
)
4573 minfo ("\n%s", output_section_statement
->name
);
4575 if (section
!= NULL
)
4577 print_dot
= section
->vma
;
4579 len
= strlen (output_section_statement
->name
);
4580 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4585 while (len
< SECTION_NAME_MAP_LENGTH
)
4591 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4593 if (section
->vma
!= section
->lma
)
4594 minfo (_(" load address 0x%V"), section
->lma
);
4596 if (output_section_statement
->update_dot_tree
!= NULL
)
4597 exp_fold_tree (output_section_statement
->update_dot_tree
,
4598 bfd_abs_section_ptr
, &print_dot
);
4604 print_statement_list (output_section_statement
->children
.head
,
4605 output_section_statement
);
4609 print_assignment (lang_assignment_statement_type
*assignment
,
4610 lang_output_section_statement_type
*output_section
)
4617 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4620 if (assignment
->exp
->type
.node_class
== etree_assert
)
4623 tree
= assignment
->exp
->assert_s
.child
;
4627 const char *dst
= assignment
->exp
->assign
.dst
;
4629 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4630 tree
= assignment
->exp
;
4633 osec
= output_section
->bfd_section
;
4635 osec
= bfd_abs_section_ptr
;
4637 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4638 exp_fold_tree (tree
, osec
, &print_dot
);
4640 expld
.result
.valid_p
= FALSE
;
4642 if (expld
.result
.valid_p
)
4646 if (assignment
->exp
->type
.node_class
== etree_assert
4648 || expld
.assign_name
!= NULL
)
4650 value
= expld
.result
.value
;
4652 if (expld
.result
.section
!= NULL
)
4653 value
+= expld
.result
.section
->vma
;
4655 minfo ("0x%V", value
);
4661 struct bfd_link_hash_entry
*h
;
4663 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4664 FALSE
, FALSE
, TRUE
);
4666 && (h
->type
== bfd_link_hash_defined
4667 || h
->type
== bfd_link_hash_defweak
))
4669 value
= h
->u
.def
.value
;
4670 value
+= h
->u
.def
.section
->output_section
->vma
;
4671 value
+= h
->u
.def
.section
->output_offset
;
4673 minfo ("[0x%V]", value
);
4676 minfo ("[unresolved]");
4681 if (assignment
->exp
->type
.node_class
== etree_provide
)
4682 minfo ("[!provide]");
4689 expld
.assign_name
= NULL
;
4692 exp_print_tree (assignment
->exp
);
4697 print_input_statement (lang_input_statement_type
*statm
)
4699 if (statm
->filename
!= NULL
)
4700 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4703 /* Print all symbols defined in a particular section. This is called
4704 via bfd_link_hash_traverse, or by print_all_symbols. */
4707 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4709 asection
*sec
= (asection
*) ptr
;
4711 if ((hash_entry
->type
== bfd_link_hash_defined
4712 || hash_entry
->type
== bfd_link_hash_defweak
)
4713 && sec
== hash_entry
->u
.def
.section
)
4717 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4720 (hash_entry
->u
.def
.value
4721 + hash_entry
->u
.def
.section
->output_offset
4722 + hash_entry
->u
.def
.section
->output_section
->vma
));
4724 minfo (" %pT\n", hash_entry
->root
.string
);
4731 hash_entry_addr_cmp (const void *a
, const void *b
)
4733 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4734 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4736 if (l
->u
.def
.value
< r
->u
.def
.value
)
4738 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4745 print_all_symbols (asection
*sec
)
4747 input_section_userdata_type
*ud
= bfd_section_userdata (sec
);
4748 struct map_symbol_def
*def
;
4749 struct bfd_link_hash_entry
**entries
;
4755 *ud
->map_symbol_def_tail
= 0;
4757 /* Sort the symbols by address. */
4758 entries
= (struct bfd_link_hash_entry
**)
4759 obstack_alloc (&map_obstack
,
4760 ud
->map_symbol_def_count
* sizeof (*entries
));
4762 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4763 entries
[i
] = def
->entry
;
4765 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4766 hash_entry_addr_cmp
);
4768 /* Print the symbols. */
4769 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4770 ldemul_print_symbol (entries
[i
], sec
);
4772 obstack_free (&map_obstack
, entries
);
4775 /* Print information about an input section to the map file. */
4778 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4780 bfd_size_type size
= i
->size
;
4787 minfo ("%s", i
->name
);
4789 len
= 1 + strlen (i
->name
);
4790 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4795 while (len
< SECTION_NAME_MAP_LENGTH
)
4801 if (i
->output_section
!= NULL
4802 && i
->output_section
->owner
== link_info
.output_bfd
)
4803 addr
= i
->output_section
->vma
+ i
->output_offset
;
4811 minfo ("0x%V %W %pB\n", addr
, TO_ADDR (size
), i
->owner
);
4813 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4815 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4827 minfo (_("%W (size before relaxing)\n"), TO_ADDR (i
->rawsize
));
4830 if (i
->output_section
!= NULL
4831 && i
->output_section
->owner
== link_info
.output_bfd
)
4833 if (link_info
.reduce_memory_overheads
)
4834 bfd_link_hash_traverse (link_info
.hash
, ldemul_print_symbol
, i
);
4836 print_all_symbols (i
);
4838 /* Update print_dot, but make sure that we do not move it
4839 backwards - this could happen if we have overlays and a
4840 later overlay is shorter than an earier one. */
4841 if (addr
+ TO_ADDR (size
) > print_dot
)
4842 print_dot
= addr
+ TO_ADDR (size
);
4847 print_fill_statement (lang_fill_statement_type
*fill
)
4851 fputs (" FILL mask 0x", config
.map_file
);
4852 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4853 fprintf (config
.map_file
, "%02x", *p
);
4854 fputs ("\n", config
.map_file
);
4858 print_data_statement (lang_data_statement_type
*data
)
4865 init_opb (data
->output_section
);
4866 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4869 addr
= data
->output_offset
;
4870 if (data
->output_section
!= NULL
)
4871 addr
+= data
->output_section
->vma
;
4899 if (size
< TO_SIZE ((unsigned) 1))
4900 size
= TO_SIZE ((unsigned) 1);
4901 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4903 if (data
->exp
->type
.node_class
!= etree_value
)
4906 exp_print_tree (data
->exp
);
4911 print_dot
= addr
+ TO_ADDR (size
);
4914 /* Print an address statement. These are generated by options like
4918 print_address_statement (lang_address_statement_type
*address
)
4920 minfo (_("Address of section %s set to "), address
->section_name
);
4921 exp_print_tree (address
->address
);
4925 /* Print a reloc statement. */
4928 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4934 init_opb (reloc
->output_section
);
4935 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4938 addr
= reloc
->output_offset
;
4939 if (reloc
->output_section
!= NULL
)
4940 addr
+= reloc
->output_section
->vma
;
4942 size
= bfd_get_reloc_size (reloc
->howto
);
4944 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4946 if (reloc
->name
!= NULL
)
4947 minfo ("%s+", reloc
->name
);
4949 minfo ("%s+", reloc
->section
->name
);
4951 exp_print_tree (reloc
->addend_exp
);
4955 print_dot
= addr
+ TO_ADDR (size
);
4959 print_padding_statement (lang_padding_statement_type
*s
)
4964 init_opb (s
->output_section
);
4967 len
= sizeof " *fill*" - 1;
4968 while (len
< SECTION_NAME_MAP_LENGTH
)
4974 addr
= s
->output_offset
;
4975 if (s
->output_section
!= NULL
)
4976 addr
+= s
->output_section
->vma
;
4977 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4979 if (s
->fill
->size
!= 0)
4983 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4984 fprintf (config
.map_file
, "%02x", *p
);
4989 print_dot
= addr
+ TO_ADDR (s
->size
);
4993 print_wild_statement (lang_wild_statement_type
*w
,
4994 lang_output_section_statement_type
*os
)
4996 struct wildcard_list
*sec
;
5000 if (w
->exclude_name_list
)
5003 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
5004 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5005 minfo (" %s", tmp
->name
);
5009 if (w
->filenames_sorted
)
5010 minfo ("SORT_BY_NAME(");
5011 if (w
->filename
!= NULL
)
5012 minfo ("%s", w
->filename
);
5015 if (w
->filenames_sorted
)
5019 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
5021 int closing_paren
= 0;
5023 switch (sec
->spec
.sorted
)
5029 minfo ("SORT_BY_NAME(");
5034 minfo ("SORT_BY_ALIGNMENT(");
5038 case by_name_alignment
:
5039 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
5043 case by_alignment_name
:
5044 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
5049 minfo ("SORT_NONE(");
5053 case by_init_priority
:
5054 minfo ("SORT_BY_INIT_PRIORITY(");
5059 if (sec
->spec
.exclude_name_list
!= NULL
)
5062 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
5063 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5064 minfo (" %s", tmp
->name
);
5067 if (sec
->spec
.name
!= NULL
)
5068 minfo ("%s", sec
->spec
.name
);
5071 for (;closing_paren
> 0; closing_paren
--)
5080 print_statement_list (w
->children
.head
, os
);
5083 /* Print a group statement. */
5086 print_group (lang_group_statement_type
*s
,
5087 lang_output_section_statement_type
*os
)
5089 fprintf (config
.map_file
, "START GROUP\n");
5090 print_statement_list (s
->children
.head
, os
);
5091 fprintf (config
.map_file
, "END GROUP\n");
5094 /* Print the list of statements in S.
5095 This can be called for any statement type. */
5098 print_statement_list (lang_statement_union_type
*s
,
5099 lang_output_section_statement_type
*os
)
5103 print_statement (s
, os
);
5108 /* Print the first statement in statement list S.
5109 This can be called for any statement type. */
5112 print_statement (lang_statement_union_type
*s
,
5113 lang_output_section_statement_type
*os
)
5115 switch (s
->header
.type
)
5118 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
5121 case lang_constructors_statement_enum
:
5122 if (constructor_list
.head
!= NULL
)
5124 if (constructors_sorted
)
5125 minfo (" SORT (CONSTRUCTORS)\n");
5127 minfo (" CONSTRUCTORS\n");
5128 print_statement_list (constructor_list
.head
, os
);
5131 case lang_wild_statement_enum
:
5132 print_wild_statement (&s
->wild_statement
, os
);
5134 case lang_address_statement_enum
:
5135 print_address_statement (&s
->address_statement
);
5137 case lang_object_symbols_statement_enum
:
5138 minfo (" CREATE_OBJECT_SYMBOLS\n");
5140 case lang_fill_statement_enum
:
5141 print_fill_statement (&s
->fill_statement
);
5143 case lang_data_statement_enum
:
5144 print_data_statement (&s
->data_statement
);
5146 case lang_reloc_statement_enum
:
5147 print_reloc_statement (&s
->reloc_statement
);
5149 case lang_input_section_enum
:
5150 print_input_section (s
->input_section
.section
, FALSE
);
5152 case lang_padding_statement_enum
:
5153 print_padding_statement (&s
->padding_statement
);
5155 case lang_output_section_statement_enum
:
5156 print_output_section_statement (&s
->output_section_statement
);
5158 case lang_assignment_statement_enum
:
5159 print_assignment (&s
->assignment_statement
, os
);
5161 case lang_target_statement_enum
:
5162 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
5164 case lang_output_statement_enum
:
5165 minfo ("OUTPUT(%s", s
->output_statement
.name
);
5166 if (output_target
!= NULL
)
5167 minfo (" %s", output_target
);
5170 case lang_input_statement_enum
:
5171 print_input_statement (&s
->input_statement
);
5173 case lang_group_statement_enum
:
5174 print_group (&s
->group_statement
, os
);
5176 case lang_insert_statement_enum
:
5177 minfo ("INSERT %s %s\n",
5178 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
5179 s
->insert_statement
.where
);
5185 print_statements (void)
5187 print_statement_list (statement_list
.head
, abs_output_section
);
5190 /* Print the first N statements in statement list S to STDERR.
5191 If N == 0, nothing is printed.
5192 If N < 0, the entire list is printed.
5193 Intended to be called from GDB. */
5196 dprint_statement (lang_statement_union_type
*s
, int n
)
5198 FILE *map_save
= config
.map_file
;
5200 config
.map_file
= stderr
;
5203 print_statement_list (s
, abs_output_section
);
5206 while (s
&& --n
>= 0)
5208 print_statement (s
, abs_output_section
);
5213 config
.map_file
= map_save
;
5217 insert_pad (lang_statement_union_type
**ptr
,
5219 bfd_size_type alignment_needed
,
5220 asection
*output_section
,
5223 static fill_type zero_fill
;
5224 lang_statement_union_type
*pad
= NULL
;
5226 if (ptr
!= &statement_list
.head
)
5227 pad
= ((lang_statement_union_type
*)
5228 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
5230 && pad
->header
.type
== lang_padding_statement_enum
5231 && pad
->padding_statement
.output_section
== output_section
)
5233 /* Use the existing pad statement. */
5235 else if ((pad
= *ptr
) != NULL
5236 && pad
->header
.type
== lang_padding_statement_enum
5237 && pad
->padding_statement
.output_section
== output_section
)
5239 /* Use the existing pad statement. */
5243 /* Make a new padding statement, linked into existing chain. */
5244 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
5245 pad
->header
.next
= *ptr
;
5247 pad
->header
.type
= lang_padding_statement_enum
;
5248 pad
->padding_statement
.output_section
= output_section
;
5251 pad
->padding_statement
.fill
= fill
;
5253 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
5254 pad
->padding_statement
.size
= alignment_needed
;
5255 if (!(output_section
->flags
& SEC_FIXED_SIZE
))
5256 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
5257 - output_section
->vma
);
5260 /* Work out how much this section will move the dot point. */
5264 (lang_statement_union_type
**this_ptr
,
5265 lang_output_section_statement_type
*output_section_statement
,
5267 bfd_boolean
*removed
,
5270 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
5271 asection
*i
= is
->section
;
5272 asection
*o
= output_section_statement
->bfd_section
;
5275 if (link_info
.non_contiguous_regions
)
5277 /* If the input section I has already been successfully assigned
5278 to an output section other than O, don't bother with it and
5279 let the caller remove it from the list. Keep processing in
5280 case we have already handled O, because the repeated passes
5281 have reinitialized its size. */
5282 if (i
->already_assigned
&& i
->already_assigned
!= o
)
5289 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
5290 i
->output_offset
= i
->vma
- o
->vma
;
5291 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
5292 || output_section_statement
->ignored
)
5293 i
->output_offset
= dot
- o
->vma
;
5296 bfd_size_type alignment_needed
;
5298 /* Align this section first to the input sections requirement,
5299 then to the output section's requirement. If this alignment
5300 is greater than any seen before, then record it too. Perform
5301 the alignment by inserting a magic 'padding' statement. */
5303 if (output_section_statement
->subsection_alignment
!= NULL
)
5305 = exp_get_power (output_section_statement
->subsection_alignment
,
5306 "subsection alignment");
5308 if (o
->alignment_power
< i
->alignment_power
)
5309 o
->alignment_power
= i
->alignment_power
;
5311 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
5313 if (alignment_needed
!= 0)
5315 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
5316 dot
+= alignment_needed
;
5319 if (link_info
.non_contiguous_regions
)
5321 /* If I would overflow O, let the caller remove I from the
5323 if (output_section_statement
->region
)
5325 bfd_vma end
= output_section_statement
->region
->origin
5326 + output_section_statement
->region
->length
;
5328 if (dot
+ TO_ADDR (i
->size
) > end
)
5330 if (i
->flags
& SEC_LINKER_CREATED
)
5331 einfo (_("%F%P: Output section '%s' not large enough for the "
5332 "linker-created stubs section '%s'.\n"),
5333 i
->output_section
->name
, i
->name
);
5335 if (i
->rawsize
&& i
->rawsize
!= i
->size
)
5336 einfo (_("%F%P: Relaxation not supported with "
5337 "--enable-non-contiguous-regions (section '%s' "
5338 "would overflow '%s' after it changed size).\n"),
5339 i
->name
, i
->output_section
->name
);
5343 i
->output_section
= NULL
;
5349 /* Remember where in the output section this input section goes. */
5350 i
->output_offset
= dot
- o
->vma
;
5352 /* Mark how big the output section must be to contain this now. */
5353 dot
+= TO_ADDR (i
->size
);
5354 if (!(o
->flags
& SEC_FIXED_SIZE
))
5355 o
->size
= TO_SIZE (dot
- o
->vma
);
5357 if (link_info
.non_contiguous_regions
)
5359 /* Record that I was successfully assigned to O, and update
5360 its actual output section too. */
5361 i
->already_assigned
= o
;
5362 i
->output_section
= o
;
5376 sort_sections_by_lma (const void *arg1
, const void *arg2
)
5378 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5379 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5381 if (sec1
->lma
< sec2
->lma
)
5383 else if (sec1
->lma
> sec2
->lma
)
5385 else if (sec1
->id
< sec2
->id
)
5387 else if (sec1
->id
> sec2
->id
)
5394 sort_sections_by_vma (const void *arg1
, const void *arg2
)
5396 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5397 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5399 if (sec1
->vma
< sec2
->vma
)
5401 else if (sec1
->vma
> sec2
->vma
)
5403 else if (sec1
->id
< sec2
->id
)
5405 else if (sec1
->id
> sec2
->id
)
5411 #define IS_TBSS(s) \
5412 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
5414 #define IGNORE_SECTION(s) \
5415 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
5417 /* Check to see if any allocated sections overlap with other allocated
5418 sections. This can happen if a linker script specifies the output
5419 section addresses of the two sections. Also check whether any memory
5420 region has overflowed. */
5423 lang_check_section_addresses (void)
5426 struct check_sec
*sections
;
5431 bfd_vma p_start
= 0;
5433 lang_memory_region_type
*m
;
5434 bfd_boolean overlays
;
5436 /* Detect address space overflow on allocated sections. */
5437 addr_mask
= ((bfd_vma
) 1 <<
5438 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
5439 addr_mask
= (addr_mask
<< 1) + 1;
5440 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5441 if ((s
->flags
& SEC_ALLOC
) != 0)
5443 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
5444 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
5445 einfo (_("%X%P: section %s VMA wraps around address space\n"),
5449 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
5450 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
5451 einfo (_("%X%P: section %s LMA wraps around address space\n"),
5456 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
5459 count
= bfd_count_sections (link_info
.output_bfd
);
5460 sections
= XNEWVEC (struct check_sec
, count
);
5462 /* Scan all sections in the output list. */
5464 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5466 if (IGNORE_SECTION (s
)
5470 sections
[count
].sec
= s
;
5471 sections
[count
].warned
= FALSE
;
5481 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
5483 /* First check section LMAs. There should be no overlap of LMAs on
5484 loadable sections, even with overlays. */
5485 for (p
= NULL
, i
= 0; i
< count
; i
++)
5487 s
= sections
[i
].sec
;
5489 if ((s
->flags
& SEC_LOAD
) != 0)
5492 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5494 /* Look for an overlap. We have sorted sections by lma, so
5495 we know that s_start >= p_start. Besides the obvious
5496 case of overlap when the current section starts before
5497 the previous one ends, we also must have overlap if the
5498 previous section wraps around the address space. */
5500 && (s_start
<= p_end
5501 || p_end
< p_start
))
5503 einfo (_("%X%P: section %s LMA [%V,%V]"
5504 " overlaps section %s LMA [%V,%V]\n"),
5505 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5506 sections
[i
].warned
= TRUE
;
5514 /* If any non-zero size allocated section (excluding tbss) starts at
5515 exactly the same VMA as another such section, then we have
5516 overlays. Overlays generated by the OVERLAY keyword will have
5517 this property. It is possible to intentionally generate overlays
5518 that fail this test, but it would be unusual. */
5519 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
5521 p_start
= sections
[0].sec
->vma
;
5522 for (i
= 1; i
< count
; i
++)
5524 s_start
= sections
[i
].sec
->vma
;
5525 if (p_start
== s_start
)
5533 /* Now check section VMAs if no overlays were detected. */
5536 for (p
= NULL
, i
= 0; i
< count
; i
++)
5538 s
= sections
[i
].sec
;
5541 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5544 && !sections
[i
].warned
5545 && (s_start
<= p_end
5546 || p_end
< p_start
))
5547 einfo (_("%X%P: section %s VMA [%V,%V]"
5548 " overlaps section %s VMA [%V,%V]\n"),
5549 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5558 /* If any memory region has overflowed, report by how much.
5559 We do not issue this diagnostic for regions that had sections
5560 explicitly placed outside their bounds; os_region_check's
5561 diagnostics are adequate for that case.
5563 FIXME: It is conceivable that m->current - (m->origin + m->length)
5564 might overflow a 32-bit integer. There is, alas, no way to print
5565 a bfd_vma quantity in decimal. */
5566 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
5567 if (m
->had_full_message
)
5569 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
5570 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
5571 "%X%P: region `%s' overflowed by %lu bytes\n",
5573 m
->name_list
.name
, over
);
5577 /* Make sure the new address is within the region. We explicitly permit the
5578 current address to be at the exact end of the region when the address is
5579 non-zero, in case the region is at the end of addressable memory and the
5580 calculation wraps around. */
5583 os_region_check (lang_output_section_statement_type
*os
,
5584 lang_memory_region_type
*region
,
5588 if ((region
->current
< region
->origin
5589 || (region
->current
- region
->origin
> region
->length
))
5590 && ((region
->current
!= region
->origin
+ region
->length
)
5595 einfo (_("%X%P: address 0x%v of %pB section `%s'"
5596 " is not within region `%s'\n"),
5598 os
->bfd_section
->owner
,
5599 os
->bfd_section
->name
,
5600 region
->name_list
.name
);
5602 else if (!region
->had_full_message
)
5604 region
->had_full_message
= TRUE
;
5606 einfo (_("%X%P: %pB section `%s' will not fit in region `%s'\n"),
5607 os
->bfd_section
->owner
,
5608 os
->bfd_section
->name
,
5609 region
->name_list
.name
);
5615 ldlang_check_relro_region (lang_statement_union_type
*s
,
5616 seg_align_type
*seg
)
5618 if (seg
->relro
== exp_seg_relro_start
)
5620 if (!seg
->relro_start_stat
)
5621 seg
->relro_start_stat
= s
;
5624 ASSERT (seg
->relro_start_stat
== s
);
5627 else if (seg
->relro
== exp_seg_relro_end
)
5629 if (!seg
->relro_end_stat
)
5630 seg
->relro_end_stat
= s
;
5633 ASSERT (seg
->relro_end_stat
== s
);
5638 /* Set the sizes for all the output sections. */
5641 lang_size_sections_1
5642 (lang_statement_union_type
**prev
,
5643 lang_output_section_statement_type
*output_section_statement
,
5647 bfd_boolean check_regions
)
5649 lang_statement_union_type
*s
;
5650 lang_statement_union_type
*prev_s
= NULL
;
5651 bfd_boolean removed_prev_s
= FALSE
;
5653 /* Size up the sections from their constituent parts. */
5654 for (s
= *prev
; s
!= NULL
; prev_s
= s
, s
= s
->header
.next
)
5656 bfd_boolean removed
=FALSE
;
5658 switch (s
->header
.type
)
5660 case lang_output_section_statement_enum
:
5662 bfd_vma newdot
, after
, dotdelta
;
5663 lang_output_section_statement_type
*os
;
5664 lang_memory_region_type
*r
;
5665 int section_alignment
= 0;
5667 os
= &s
->output_section_statement
;
5668 init_opb (os
->bfd_section
);
5669 if (os
->constraint
== -1)
5672 /* FIXME: We shouldn't need to zero section vmas for ld -r
5673 here, in lang_insert_orphan, or in the default linker scripts.
5674 This is covering for coff backend linker bugs. See PR6945. */
5675 if (os
->addr_tree
== NULL
5676 && bfd_link_relocatable (&link_info
)
5677 && (bfd_get_flavour (link_info
.output_bfd
)
5678 == bfd_target_coff_flavour
))
5679 os
->addr_tree
= exp_intop (0);
5680 if (os
->addr_tree
!= NULL
)
5682 os
->processed_vma
= FALSE
;
5683 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5685 if (expld
.result
.valid_p
)
5687 dot
= expld
.result
.value
;
5688 if (expld
.result
.section
!= NULL
)
5689 dot
+= expld
.result
.section
->vma
;
5691 else if (expld
.phase
!= lang_mark_phase_enum
)
5692 einfo (_("%F%P:%pS: non constant or forward reference"
5693 " address expression for section %s\n"),
5694 os
->addr_tree
, os
->name
);
5697 if (os
->bfd_section
== NULL
)
5698 /* This section was removed or never actually created. */
5701 /* If this is a COFF shared library section, use the size and
5702 address from the input section. FIXME: This is COFF
5703 specific; it would be cleaner if there were some other way
5704 to do this, but nothing simple comes to mind. */
5705 if (((bfd_get_flavour (link_info
.output_bfd
)
5706 == bfd_target_ecoff_flavour
)
5707 || (bfd_get_flavour (link_info
.output_bfd
)
5708 == bfd_target_coff_flavour
))
5709 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5713 if (os
->children
.head
== NULL
5714 || os
->children
.head
->header
.next
!= NULL
5715 || (os
->children
.head
->header
.type
5716 != lang_input_section_enum
))
5717 einfo (_("%X%P: internal error on COFF shared library"
5718 " section %s\n"), os
->name
);
5720 input
= os
->children
.head
->input_section
.section
;
5721 bfd_set_section_vma (os
->bfd_section
,
5722 bfd_section_vma (input
));
5723 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5724 os
->bfd_section
->size
= input
->size
;
5730 if (bfd_is_abs_section (os
->bfd_section
))
5732 /* No matter what happens, an abs section starts at zero. */
5733 ASSERT (os
->bfd_section
->vma
== 0);
5737 if (os
->addr_tree
== NULL
)
5739 /* No address specified for this section, get one
5740 from the region specification. */
5741 if (os
->region
== NULL
5742 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5743 && os
->region
->name_list
.name
[0] == '*'
5744 && strcmp (os
->region
->name_list
.name
,
5745 DEFAULT_MEMORY_REGION
) == 0))
5747 os
->region
= lang_memory_default (os
->bfd_section
);
5750 /* If a loadable section is using the default memory
5751 region, and some non default memory regions were
5752 defined, issue an error message. */
5754 && !IGNORE_SECTION (os
->bfd_section
)
5755 && !bfd_link_relocatable (&link_info
)
5757 && strcmp (os
->region
->name_list
.name
,
5758 DEFAULT_MEMORY_REGION
) == 0
5759 && lang_memory_region_list
!= NULL
5760 && (strcmp (lang_memory_region_list
->name_list
.name
,
5761 DEFAULT_MEMORY_REGION
) != 0
5762 || lang_memory_region_list
->next
!= NULL
)
5763 && lang_sizing_iteration
== 1)
5765 /* By default this is an error rather than just a
5766 warning because if we allocate the section to the
5767 default memory region we can end up creating an
5768 excessively large binary, or even seg faulting when
5769 attempting to perform a negative seek. See
5770 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5771 for an example of this. This behaviour can be
5772 overridden by the using the --no-check-sections
5774 if (command_line
.check_section_addresses
)
5775 einfo (_("%F%P: error: no memory region specified"
5776 " for loadable section `%s'\n"),
5777 bfd_section_name (os
->bfd_section
));
5779 einfo (_("%P: warning: no memory region specified"
5780 " for loadable section `%s'\n"),
5781 bfd_section_name (os
->bfd_section
));
5784 newdot
= os
->region
->current
;
5785 section_alignment
= os
->bfd_section
->alignment_power
;
5788 section_alignment
= exp_get_power (os
->section_alignment
,
5789 "section alignment");
5791 /* Align to what the section needs. */
5792 if (section_alignment
> 0)
5794 bfd_vma savedot
= newdot
;
5797 newdot
= align_power (newdot
, section_alignment
);
5798 dotdelta
= newdot
- savedot
;
5800 if (lang_sizing_iteration
== 1)
5802 else if (lang_sizing_iteration
> 1)
5804 /* Only report adjustments that would change
5805 alignment from what we have already reported. */
5806 diff
= newdot
- os
->bfd_section
->vma
;
5807 if (!(diff
& (((bfd_vma
) 1 << section_alignment
) - 1)))
5811 && (config
.warn_section_align
5812 || os
->addr_tree
!= NULL
))
5813 einfo (_("%P: warning: "
5814 "start of section %s changed by %ld\n"),
5815 os
->name
, (long) diff
);
5818 bfd_set_section_vma (os
->bfd_section
, newdot
);
5820 os
->bfd_section
->output_offset
= 0;
5823 lang_size_sections_1 (&os
->children
.head
, os
,
5824 os
->fill
, newdot
, relax
, check_regions
);
5826 os
->processed_vma
= TRUE
;
5828 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5829 /* Except for some special linker created sections,
5830 no output section should change from zero size
5831 after strip_excluded_output_sections. A non-zero
5832 size on an ignored section indicates that some
5833 input section was not sized early enough. */
5834 ASSERT (os
->bfd_section
->size
== 0);
5837 dot
= os
->bfd_section
->vma
;
5839 /* Put the section within the requested block size, or
5840 align at the block boundary. */
5842 + TO_ADDR (os
->bfd_section
->size
)
5843 + os
->block_value
- 1)
5844 & - (bfd_vma
) os
->block_value
);
5846 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5847 os
->bfd_section
->size
= TO_SIZE (after
5848 - os
->bfd_section
->vma
);
5851 /* Set section lma. */
5854 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5858 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5859 os
->bfd_section
->lma
= lma
;
5861 else if (os
->lma_region
!= NULL
)
5863 bfd_vma lma
= os
->lma_region
->current
;
5865 if (os
->align_lma_with_input
)
5869 /* When LMA_REGION is the same as REGION, align the LMA
5870 as we did for the VMA, possibly including alignment
5871 from the bfd section. If a different region, then
5872 only align according to the value in the output
5874 if (os
->lma_region
!= os
->region
)
5875 section_alignment
= exp_get_power (os
->section_alignment
,
5876 "section alignment");
5877 if (section_alignment
> 0)
5878 lma
= align_power (lma
, section_alignment
);
5880 os
->bfd_section
->lma
= lma
;
5882 else if (r
->last_os
!= NULL
5883 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5888 last
= r
->last_os
->output_section_statement
.bfd_section
;
5890 /* A backwards move of dot should be accompanied by
5891 an explicit assignment to the section LMA (ie.
5892 os->load_base set) because backwards moves can
5893 create overlapping LMAs. */
5895 && os
->bfd_section
->size
!= 0
5896 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5898 /* If dot moved backwards then leave lma equal to
5899 vma. This is the old default lma, which might
5900 just happen to work when the backwards move is
5901 sufficiently large. Nag if this changes anything,
5902 so people can fix their linker scripts. */
5904 if (last
->vma
!= last
->lma
)
5905 einfo (_("%P: warning: dot moved backwards "
5906 "before `%s'\n"), os
->name
);
5910 /* If this is an overlay, set the current lma to that
5911 at the end of the previous section. */
5912 if (os
->sectype
== overlay_section
)
5913 lma
= last
->lma
+ TO_ADDR (last
->size
);
5915 /* Otherwise, keep the same lma to vma relationship
5916 as the previous section. */
5918 lma
= os
->bfd_section
->vma
+ last
->lma
- last
->vma
;
5920 if (section_alignment
> 0)
5921 lma
= align_power (lma
, section_alignment
);
5922 os
->bfd_section
->lma
= lma
;
5925 os
->processed_lma
= TRUE
;
5927 /* Keep track of normal sections using the default
5928 lma region. We use this to set the lma for
5929 following sections. Overlays or other linker
5930 script assignment to lma might mean that the
5931 default lma == vma is incorrect.
5932 To avoid warnings about dot moving backwards when using
5933 -Ttext, don't start tracking sections until we find one
5934 of non-zero size or with lma set differently to vma.
5935 Do this tracking before we short-cut the loop so that we
5936 track changes for the case where the section size is zero,
5937 but the lma is set differently to the vma. This is
5938 important, if an orphan section is placed after an
5939 otherwise empty output section that has an explicit lma
5940 set, we want that lma reflected in the orphans lma. */
5941 if (((!IGNORE_SECTION (os
->bfd_section
)
5942 && (os
->bfd_section
->size
!= 0
5943 || (r
->last_os
== NULL
5944 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5945 || (r
->last_os
!= NULL
5946 && dot
>= (r
->last_os
->output_section_statement
5947 .bfd_section
->vma
))))
5948 || os
->sectype
== first_overlay_section
)
5949 && os
->lma_region
== NULL
5950 && !bfd_link_relocatable (&link_info
))
5953 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5956 /* .tbss sections effectively have zero size. */
5957 if (!IS_TBSS (os
->bfd_section
)
5958 || bfd_link_relocatable (&link_info
))
5959 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5964 if (os
->update_dot_tree
!= 0)
5965 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5967 /* Update dot in the region ?
5968 We only do this if the section is going to be allocated,
5969 since unallocated sections do not contribute to the region's
5970 overall size in memory. */
5971 if (os
->region
!= NULL
5972 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5974 os
->region
->current
= dot
;
5977 /* Make sure the new address is within the region. */
5978 os_region_check (os
, os
->region
, os
->addr_tree
,
5979 os
->bfd_section
->vma
);
5981 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5982 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5983 || os
->align_lma_with_input
))
5985 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5988 os_region_check (os
, os
->lma_region
, NULL
,
5989 os
->bfd_section
->lma
);
5995 case lang_constructors_statement_enum
:
5996 dot
= lang_size_sections_1 (&constructor_list
.head
,
5997 output_section_statement
,
5998 fill
, dot
, relax
, check_regions
);
6001 case lang_data_statement_enum
:
6003 unsigned int size
= 0;
6005 s
->data_statement
.output_offset
=
6006 dot
- output_section_statement
->bfd_section
->vma
;
6007 s
->data_statement
.output_section
=
6008 output_section_statement
->bfd_section
;
6010 /* We might refer to provided symbols in the expression, and
6011 need to mark them as needed. */
6012 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6014 switch (s
->data_statement
.type
)
6032 if (size
< TO_SIZE ((unsigned) 1))
6033 size
= TO_SIZE ((unsigned) 1);
6034 dot
+= TO_ADDR (size
);
6035 if (!(output_section_statement
->bfd_section
->flags
6037 output_section_statement
->bfd_section
->size
6038 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6043 case lang_reloc_statement_enum
:
6047 s
->reloc_statement
.output_offset
=
6048 dot
- output_section_statement
->bfd_section
->vma
;
6049 s
->reloc_statement
.output_section
=
6050 output_section_statement
->bfd_section
;
6051 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
6052 dot
+= TO_ADDR (size
);
6053 if (!(output_section_statement
->bfd_section
->flags
6055 output_section_statement
->bfd_section
->size
6056 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6060 case lang_wild_statement_enum
:
6061 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
6062 output_section_statement
,
6063 fill
, dot
, relax
, check_regions
);
6066 case lang_object_symbols_statement_enum
:
6067 link_info
.create_object_symbols_section
6068 = output_section_statement
->bfd_section
;
6069 output_section_statement
->bfd_section
->flags
|= SEC_KEEP
;
6072 case lang_output_statement_enum
:
6073 case lang_target_statement_enum
:
6076 case lang_input_section_enum
:
6080 i
= s
->input_section
.section
;
6085 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
6086 einfo (_("%F%P: can't relax section: %E\n"));
6090 dot
= size_input_section (prev
, output_section_statement
,
6091 fill
, &removed
, dot
);
6095 case lang_input_statement_enum
:
6098 case lang_fill_statement_enum
:
6099 s
->fill_statement
.output_section
=
6100 output_section_statement
->bfd_section
;
6102 fill
= s
->fill_statement
.fill
;
6105 case lang_assignment_statement_enum
:
6107 bfd_vma newdot
= dot
;
6108 etree_type
*tree
= s
->assignment_statement
.exp
;
6110 expld
.dataseg
.relro
= exp_seg_relro_none
;
6112 exp_fold_tree (tree
,
6113 output_section_statement
->bfd_section
,
6116 ldlang_check_relro_region (s
, &expld
.dataseg
);
6118 expld
.dataseg
.relro
= exp_seg_relro_none
;
6120 /* This symbol may be relative to this section. */
6121 if ((tree
->type
.node_class
== etree_provided
6122 || tree
->type
.node_class
== etree_assign
)
6123 && (tree
->assign
.dst
[0] != '.'
6124 || tree
->assign
.dst
[1] != '\0'))
6125 output_section_statement
->update_dot
= 1;
6127 if (!output_section_statement
->ignored
)
6129 if (output_section_statement
== abs_output_section
)
6131 /* If we don't have an output section, then just adjust
6132 the default memory address. */
6133 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
6134 FALSE
)->current
= newdot
;
6136 else if (newdot
!= dot
)
6138 /* Insert a pad after this statement. We can't
6139 put the pad before when relaxing, in case the
6140 assignment references dot. */
6141 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
6142 output_section_statement
->bfd_section
, dot
);
6144 /* Don't neuter the pad below when relaxing. */
6147 /* If dot is advanced, this implies that the section
6148 should have space allocated to it, unless the
6149 user has explicitly stated that the section
6150 should not be allocated. */
6151 if (output_section_statement
->sectype
!= noalloc_section
6152 && (output_section_statement
->sectype
!= noload_section
6153 || (bfd_get_flavour (link_info
.output_bfd
)
6154 == bfd_target_elf_flavour
)))
6155 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
6162 case lang_padding_statement_enum
:
6163 /* If this is the first time lang_size_sections is called,
6164 we won't have any padding statements. If this is the
6165 second or later passes when relaxing, we should allow
6166 padding to shrink. If padding is needed on this pass, it
6167 will be added back in. */
6168 s
->padding_statement
.size
= 0;
6170 /* Make sure output_offset is valid. If relaxation shrinks
6171 the section and this pad isn't needed, it's possible to
6172 have output_offset larger than the final size of the
6173 section. bfd_set_section_contents will complain even for
6174 a pad size of zero. */
6175 s
->padding_statement
.output_offset
6176 = dot
- output_section_statement
->bfd_section
->vma
;
6179 case lang_group_statement_enum
:
6180 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
6181 output_section_statement
,
6182 fill
, dot
, relax
, check_regions
);
6185 case lang_insert_statement_enum
:
6188 /* We can only get here when relaxing is turned on. */
6189 case lang_address_statement_enum
:
6197 /* If an input section doesn't fit in the current output
6198 section, remove it from the list. Handle the case where we
6199 have to remove an input_section statement here: there is a
6200 special case to remove the first element of the list. */
6201 if (link_info
.non_contiguous_regions
&& removed
)
6203 /* If we removed the first element during the previous
6204 iteration, override the loop assignment of prev_s. */
6210 /* If there was a real previous input section, just skip
6212 prev_s
->header
.next
=s
->header
.next
;
6214 removed_prev_s
= FALSE
;
6218 /* Remove the first input section of the list. */
6219 *prev
= s
->header
.next
;
6220 removed_prev_s
= TRUE
;
6223 /* Move to next element, unless we removed the head of the
6225 if (!removed_prev_s
)
6226 prev
= &s
->header
.next
;
6230 prev
= &s
->header
.next
;
6231 removed_prev_s
= FALSE
;
6237 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
6238 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
6239 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
6240 segments. We are allowed an opportunity to override this decision. */
6243 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
6244 bfd
*abfd ATTRIBUTE_UNUSED
,
6245 asection
*current_section
,
6246 asection
*previous_section
,
6247 bfd_boolean new_segment
)
6249 lang_output_section_statement_type
*cur
;
6250 lang_output_section_statement_type
*prev
;
6252 /* The checks below are only necessary when the BFD library has decided
6253 that the two sections ought to be placed into the same segment. */
6257 /* Paranoia checks. */
6258 if (current_section
== NULL
|| previous_section
== NULL
)
6261 /* If this flag is set, the target never wants code and non-code
6262 sections comingled in the same segment. */
6263 if (config
.separate_code
6264 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
6267 /* Find the memory regions associated with the two sections.
6268 We call lang_output_section_find() here rather than scanning the list
6269 of output sections looking for a matching section pointer because if
6270 we have a large number of sections then a hash lookup is faster. */
6271 cur
= lang_output_section_find (current_section
->name
);
6272 prev
= lang_output_section_find (previous_section
->name
);
6274 /* More paranoia. */
6275 if (cur
== NULL
|| prev
== NULL
)
6278 /* If the regions are different then force the sections to live in
6279 different segments. See the email thread starting at the following
6280 URL for the reasons why this is necessary:
6281 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
6282 return cur
->region
!= prev
->region
;
6286 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
6288 lang_statement_iteration
++;
6289 if (expld
.phase
!= lang_mark_phase_enum
)
6290 lang_sizing_iteration
++;
6291 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
6292 0, 0, relax
, check_regions
);
6296 lang_size_segment (seg_align_type
*seg
)
6298 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
6299 a page could be saved in the data segment. */
6300 bfd_vma first
, last
;
6302 first
= -seg
->base
& (seg
->pagesize
- 1);
6303 last
= seg
->end
& (seg
->pagesize
- 1);
6305 && ((seg
->base
& ~(seg
->pagesize
- 1))
6306 != (seg
->end
& ~(seg
->pagesize
- 1)))
6307 && first
+ last
<= seg
->pagesize
)
6309 seg
->phase
= exp_seg_adjust
;
6313 seg
->phase
= exp_seg_done
;
6318 lang_size_relro_segment_1 (seg_align_type
*seg
)
6320 bfd_vma relro_end
, desired_end
;
6323 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
6324 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
6325 & ~(seg
->pagesize
- 1));
6327 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
6328 desired_end
= relro_end
- seg
->relro_offset
;
6330 /* For sections in the relro segment.. */
6331 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
6332 if ((sec
->flags
& SEC_ALLOC
) != 0
6333 && sec
->vma
>= seg
->base
6334 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
6336 /* Where do we want to put this section so that it ends as
6338 bfd_vma start
, end
, bump
;
6340 end
= start
= sec
->vma
;
6342 end
+= TO_ADDR (sec
->size
);
6343 bump
= desired_end
- end
;
6344 /* We'd like to increase START by BUMP, but we must heed
6345 alignment so the increase might be less than optimum. */
6347 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
6348 /* This is now the desired end for the previous section. */
6349 desired_end
= start
;
6352 seg
->phase
= exp_seg_relro_adjust
;
6353 ASSERT (desired_end
>= seg
->base
);
6354 seg
->base
= desired_end
;
6359 lang_size_relro_segment (bfd_boolean
*relax
, bfd_boolean check_regions
)
6361 bfd_boolean do_reset
= FALSE
;
6362 bfd_boolean do_data_relro
;
6363 bfd_vma data_initial_base
, data_relro_end
;
6365 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6367 do_data_relro
= TRUE
;
6368 data_initial_base
= expld
.dataseg
.base
;
6369 data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
6373 do_data_relro
= FALSE
;
6374 data_initial_base
= data_relro_end
= 0;
6379 lang_reset_memory_regions ();
6380 one_lang_size_sections_pass (relax
, check_regions
);
6382 /* Assignments to dot, or to output section address in a user
6383 script have increased padding over the original. Revert. */
6384 if (do_data_relro
&& expld
.dataseg
.relro_end
> data_relro_end
)
6386 expld
.dataseg
.base
= data_initial_base
;;
6391 if (!do_data_relro
&& lang_size_segment (&expld
.dataseg
))
6398 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
6400 expld
.phase
= lang_allocating_phase_enum
;
6401 expld
.dataseg
.phase
= exp_seg_none
;
6403 one_lang_size_sections_pass (relax
, check_regions
);
6405 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
6406 expld
.dataseg
.phase
= exp_seg_done
;
6408 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
6410 bfd_boolean do_reset
6411 = lang_size_relro_segment (relax
, check_regions
);
6415 lang_reset_memory_regions ();
6416 one_lang_size_sections_pass (relax
, check_regions
);
6419 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6421 link_info
.relro_start
= expld
.dataseg
.base
;
6422 link_info
.relro_end
= expld
.dataseg
.relro_end
;
6427 static lang_output_section_statement_type
*current_section
;
6428 static lang_assignment_statement_type
*current_assign
;
6429 static bfd_boolean prefer_next_section
;
6431 /* Worker function for lang_do_assignments. Recursiveness goes here. */
6434 lang_do_assignments_1 (lang_statement_union_type
*s
,
6435 lang_output_section_statement_type
*current_os
,
6438 bfd_boolean
*found_end
)
6440 for (; s
!= NULL
; s
= s
->header
.next
)
6442 switch (s
->header
.type
)
6444 case lang_constructors_statement_enum
:
6445 dot
= lang_do_assignments_1 (constructor_list
.head
,
6446 current_os
, fill
, dot
, found_end
);
6449 case lang_output_section_statement_enum
:
6451 lang_output_section_statement_type
*os
;
6454 os
= &(s
->output_section_statement
);
6455 os
->after_end
= *found_end
;
6456 init_opb (os
->bfd_section
);
6457 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
6459 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
6461 current_section
= os
;
6462 prefer_next_section
= FALSE
;
6464 dot
= os
->bfd_section
->vma
;
6466 newdot
= lang_do_assignments_1 (os
->children
.head
,
6467 os
, os
->fill
, dot
, found_end
);
6470 if (os
->bfd_section
!= NULL
)
6472 /* .tbss sections effectively have zero size. */
6473 if (!IS_TBSS (os
->bfd_section
)
6474 || bfd_link_relocatable (&link_info
))
6475 dot
+= TO_ADDR (os
->bfd_section
->size
);
6477 if (os
->update_dot_tree
!= NULL
)
6478 exp_fold_tree (os
->update_dot_tree
,
6479 bfd_abs_section_ptr
, &dot
);
6487 case lang_wild_statement_enum
:
6489 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
6490 current_os
, fill
, dot
, found_end
);
6493 case lang_object_symbols_statement_enum
:
6494 case lang_output_statement_enum
:
6495 case lang_target_statement_enum
:
6498 case lang_data_statement_enum
:
6499 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6500 if (expld
.result
.valid_p
)
6502 s
->data_statement
.value
= expld
.result
.value
;
6503 if (expld
.result
.section
!= NULL
)
6504 s
->data_statement
.value
+= expld
.result
.section
->vma
;
6506 else if (expld
.phase
== lang_final_phase_enum
)
6507 einfo (_("%F%P: invalid data statement\n"));
6510 switch (s
->data_statement
.type
)
6528 if (size
< TO_SIZE ((unsigned) 1))
6529 size
= TO_SIZE ((unsigned) 1);
6530 dot
+= TO_ADDR (size
);
6534 case lang_reloc_statement_enum
:
6535 exp_fold_tree (s
->reloc_statement
.addend_exp
,
6536 bfd_abs_section_ptr
, &dot
);
6537 if (expld
.result
.valid_p
)
6538 s
->reloc_statement
.addend_value
= expld
.result
.value
;
6539 else if (expld
.phase
== lang_final_phase_enum
)
6540 einfo (_("%F%P: invalid reloc statement\n"));
6541 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
6544 case lang_input_section_enum
:
6546 asection
*in
= s
->input_section
.section
;
6548 if ((in
->flags
& SEC_EXCLUDE
) == 0)
6549 dot
+= TO_ADDR (in
->size
);
6553 case lang_input_statement_enum
:
6556 case lang_fill_statement_enum
:
6557 fill
= s
->fill_statement
.fill
;
6560 case lang_assignment_statement_enum
:
6561 current_assign
= &s
->assignment_statement
;
6562 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
6564 const char *p
= current_assign
->exp
->assign
.dst
;
6566 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
6567 prefer_next_section
= TRUE
;
6571 if (strcmp (p
, "end") == 0)
6574 exp_fold_tree (s
->assignment_statement
.exp
,
6575 (current_os
->bfd_section
!= NULL
6576 ? current_os
->bfd_section
: bfd_und_section_ptr
),
6580 case lang_padding_statement_enum
:
6581 dot
+= TO_ADDR (s
->padding_statement
.size
);
6584 case lang_group_statement_enum
:
6585 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
6586 current_os
, fill
, dot
, found_end
);
6589 case lang_insert_statement_enum
:
6592 case lang_address_statement_enum
:
6604 lang_do_assignments (lang_phase_type phase
)
6606 bfd_boolean found_end
= FALSE
;
6608 current_section
= NULL
;
6609 prefer_next_section
= FALSE
;
6610 expld
.phase
= phase
;
6611 lang_statement_iteration
++;
6612 lang_do_assignments_1 (statement_list
.head
,
6613 abs_output_section
, NULL
, 0, &found_end
);
6616 /* For an assignment statement outside of an output section statement,
6617 choose the best of neighbouring output sections to use for values
6621 section_for_dot (void)
6625 /* Assignments belong to the previous output section, unless there
6626 has been an assignment to "dot", in which case following
6627 assignments belong to the next output section. (The assumption
6628 is that an assignment to "dot" is setting up the address for the
6629 next output section.) Except that past the assignment to "_end"
6630 we always associate with the previous section. This exception is
6631 for targets like SH that define an alloc .stack or other
6632 weirdness after non-alloc sections. */
6633 if (current_section
== NULL
|| prefer_next_section
)
6635 lang_statement_union_type
*stmt
;
6636 lang_output_section_statement_type
*os
;
6638 for (stmt
= (lang_statement_union_type
*) current_assign
;
6640 stmt
= stmt
->header
.next
)
6641 if (stmt
->header
.type
== lang_output_section_statement_enum
)
6644 os
= &stmt
->output_section_statement
;
6647 && (os
->bfd_section
== NULL
6648 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
6649 || bfd_section_removed_from_list (link_info
.output_bfd
,
6653 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
6656 s
= os
->bfd_section
;
6658 s
= link_info
.output_bfd
->section_last
;
6660 && ((s
->flags
& SEC_ALLOC
) == 0
6661 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6666 return bfd_abs_section_ptr
;
6670 s
= current_section
->bfd_section
;
6672 /* The section may have been stripped. */
6674 && ((s
->flags
& SEC_EXCLUDE
) != 0
6675 || (s
->flags
& SEC_ALLOC
) == 0
6676 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
6677 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
6680 s
= link_info
.output_bfd
->sections
;
6682 && ((s
->flags
& SEC_ALLOC
) == 0
6683 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6688 return bfd_abs_section_ptr
;
6691 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
6693 static struct bfd_link_hash_entry
**start_stop_syms
;
6694 static size_t start_stop_count
= 0;
6695 static size_t start_stop_alloc
= 0;
6697 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6698 to start_stop_syms. */
6701 lang_define_start_stop (const char *symbol
, asection
*sec
)
6703 struct bfd_link_hash_entry
*h
;
6705 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6708 if (start_stop_count
== start_stop_alloc
)
6710 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6712 = xrealloc (start_stop_syms
,
6713 start_stop_alloc
* sizeof (*start_stop_syms
));
6715 start_stop_syms
[start_stop_count
++] = h
;
6719 /* Check for input sections whose names match references to
6720 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6721 preliminary definitions. */
6724 lang_init_start_stop (void)
6728 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6730 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6731 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6734 const char *secname
= s
->name
;
6736 for (ps
= secname
; *ps
!= '\0'; ps
++)
6737 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6741 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6743 symbol
[0] = leading_char
;
6744 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6745 lang_define_start_stop (symbol
, s
);
6747 symbol
[1] = leading_char
;
6748 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6749 lang_define_start_stop (symbol
+ 1, s
);
6756 /* Iterate over start_stop_syms. */
6759 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6763 for (i
= 0; i
< start_stop_count
; ++i
)
6764 func (start_stop_syms
[i
]);
6767 /* __start and __stop symbols are only supposed to be defined by the
6768 linker for orphan sections, but we now extend that to sections that
6769 map to an output section of the same name. The symbols were
6770 defined early for --gc-sections, before we mapped input to output
6771 sections, so undo those that don't satisfy this rule. */
6774 undef_start_stop (struct bfd_link_hash_entry
*h
)
6776 if (h
->ldscript_def
)
6779 if (h
->u
.def
.section
->output_section
== NULL
6780 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6781 || strcmp (h
->u
.def
.section
->name
,
6782 h
->u
.def
.section
->output_section
->name
) != 0)
6784 asection
*sec
= bfd_get_section_by_name (link_info
.output_bfd
,
6785 h
->u
.def
.section
->name
);
6788 /* When there are more than one input sections with the same
6789 section name, SECNAME, linker picks the first one to define
6790 __start_SECNAME and __stop_SECNAME symbols. When the first
6791 input section is removed by comdat group, we need to check
6792 if there is still an output section with section name
6795 for (i
= sec
->map_head
.s
; i
!= NULL
; i
= i
->map_head
.s
)
6796 if (strcmp (h
->u
.def
.section
->name
, i
->name
) == 0)
6798 h
->u
.def
.section
= i
;
6802 h
->type
= bfd_link_hash_undefined
;
6803 h
->u
.undef
.abfd
= NULL
;
6808 lang_undef_start_stop (void)
6810 foreach_start_stop (undef_start_stop
);
6813 /* Check for output sections whose names match references to
6814 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6815 preliminary definitions. */
6818 lang_init_startof_sizeof (void)
6822 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6824 const char *secname
= s
->name
;
6825 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6827 sprintf (symbol
, ".startof.%s", secname
);
6828 lang_define_start_stop (symbol
, s
);
6830 memcpy (symbol
+ 1, ".size", 5);
6831 lang_define_start_stop (symbol
+ 1, s
);
6836 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6839 set_start_stop (struct bfd_link_hash_entry
*h
)
6842 || h
->type
!= bfd_link_hash_defined
)
6845 if (h
->root
.string
[0] == '.')
6847 /* .startof. or .sizeof. symbol.
6848 .startof. already has final value. */
6849 if (h
->root
.string
[2] == 'i')
6852 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6853 h
->u
.def
.section
= bfd_abs_section_ptr
;
6858 /* __start or __stop symbol. */
6859 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6861 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6862 if (h
->root
.string
[4 + has_lead
] == 'o')
6865 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6871 lang_finalize_start_stop (void)
6873 foreach_start_stop (set_start_stop
);
6879 struct bfd_link_hash_entry
*h
;
6882 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
6883 || bfd_link_dll (&link_info
))
6884 warn
= entry_from_cmdline
;
6888 /* Force the user to specify a root when generating a relocatable with
6889 --gc-sections, unless --gc-keep-exported was also given. */
6890 if (bfd_link_relocatable (&link_info
)
6891 && link_info
.gc_sections
6892 && !link_info
.gc_keep_exported
)
6894 struct bfd_sym_chain
*sym
;
6896 for (sym
= link_info
.gc_sym_list
; sym
!= NULL
; sym
= sym
->next
)
6898 h
= bfd_link_hash_lookup (link_info
.hash
, sym
->name
,
6899 FALSE
, FALSE
, FALSE
);
6901 && (h
->type
== bfd_link_hash_defined
6902 || h
->type
== bfd_link_hash_defweak
)
6903 && !bfd_is_const_section (h
->u
.def
.section
))
6907 einfo (_("%F%P: --gc-sections requires a defined symbol root "
6908 "specified by -e or -u\n"));
6911 if (entry_symbol
.name
== NULL
)
6913 /* No entry has been specified. Look for the default entry, but
6914 don't warn if we don't find it. */
6915 entry_symbol
.name
= entry_symbol_default
;
6919 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
6920 FALSE
, FALSE
, TRUE
);
6922 && (h
->type
== bfd_link_hash_defined
6923 || h
->type
== bfd_link_hash_defweak
)
6924 && h
->u
.def
.section
->output_section
!= NULL
)
6928 val
= (h
->u
.def
.value
6929 + bfd_section_vma (h
->u
.def
.section
->output_section
)
6930 + h
->u
.def
.section
->output_offset
);
6931 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6932 einfo (_("%F%P: %s: can't set start address\n"), entry_symbol
.name
);
6939 /* We couldn't find the entry symbol. Try parsing it as a
6941 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
6944 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6945 einfo (_("%F%P: can't set start address\n"));
6951 /* Can't find the entry symbol, and it's not a number. Use
6952 the first address in the text section. */
6953 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
6957 einfo (_("%P: warning: cannot find entry symbol %s;"
6958 " defaulting to %V\n"),
6960 bfd_section_vma (ts
));
6961 if (!bfd_set_start_address (link_info
.output_bfd
,
6962 bfd_section_vma (ts
)))
6963 einfo (_("%F%P: can't set start address\n"));
6968 einfo (_("%P: warning: cannot find entry symbol %s;"
6969 " not setting start address\n"),
6976 /* This is a small function used when we want to ignore errors from
6980 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
6981 va_list ap ATTRIBUTE_UNUSED
)
6983 /* Don't do anything. */
6986 /* Check that the architecture of all the input files is compatible
6987 with the output file. Also call the backend to let it do any
6988 other checking that is needed. */
6993 lang_input_statement_type
*file
;
6995 const bfd_arch_info_type
*compatible
;
6997 for (file
= (void *) file_chain
.head
;
7001 #if BFD_SUPPORTS_PLUGINS
7002 /* Don't check format of files claimed by plugin. */
7003 if (file
->flags
.claimed
)
7005 #endif /* BFD_SUPPORTS_PLUGINS */
7006 input_bfd
= file
->the_bfd
;
7008 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
7009 command_line
.accept_unknown_input_arch
);
7011 /* In general it is not possible to perform a relocatable
7012 link between differing object formats when the input
7013 file has relocations, because the relocations in the
7014 input format may not have equivalent representations in
7015 the output format (and besides BFD does not translate
7016 relocs for other link purposes than a final link). */
7017 if (!file
->flags
.just_syms
7018 && (bfd_link_relocatable (&link_info
)
7019 || link_info
.emitrelocations
)
7020 && (compatible
== NULL
7021 || (bfd_get_flavour (input_bfd
)
7022 != bfd_get_flavour (link_info
.output_bfd
)))
7023 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
7025 einfo (_("%F%P: relocatable linking with relocations from"
7026 " format %s (%pB) to format %s (%pB) is not supported\n"),
7027 bfd_get_target (input_bfd
), input_bfd
,
7028 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
7029 /* einfo with %F exits. */
7032 if (compatible
== NULL
)
7034 if (command_line
.warn_mismatch
)
7035 einfo (_("%X%P: %s architecture of input file `%pB'"
7036 " is incompatible with %s output\n"),
7037 bfd_printable_name (input_bfd
), input_bfd
,
7038 bfd_printable_name (link_info
.output_bfd
));
7041 /* If the input bfd has no contents, it shouldn't set the
7042 private data of the output bfd. */
7043 else if (!file
->flags
.just_syms
7044 && ((input_bfd
->flags
& DYNAMIC
) != 0
7045 || bfd_count_sections (input_bfd
) != 0))
7047 bfd_error_handler_type pfn
= NULL
;
7049 /* If we aren't supposed to warn about mismatched input
7050 files, temporarily set the BFD error handler to a
7051 function which will do nothing. We still want to call
7052 bfd_merge_private_bfd_data, since it may set up
7053 information which is needed in the output file. */
7054 if (!command_line
.warn_mismatch
)
7055 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
7056 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
7058 if (command_line
.warn_mismatch
)
7059 einfo (_("%X%P: failed to merge target specific data"
7060 " of file %pB\n"), input_bfd
);
7062 if (!command_line
.warn_mismatch
)
7063 bfd_set_error_handler (pfn
);
7068 /* Look through all the global common symbols and attach them to the
7069 correct section. The -sort-common command line switch may be used
7070 to roughly sort the entries by alignment. */
7075 if (link_info
.inhibit_common_definition
)
7077 if (bfd_link_relocatable (&link_info
)
7078 && !command_line
.force_common_definition
)
7081 if (!config
.sort_common
)
7082 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
7087 if (config
.sort_common
== sort_descending
)
7089 for (power
= 4; power
> 0; power
--)
7090 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7093 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7097 for (power
= 0; power
<= 4; power
++)
7098 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7100 power
= (unsigned int) -1;
7101 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7106 /* Place one common symbol in the correct section. */
7109 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
7111 unsigned int power_of_two
;
7115 if (h
->type
!= bfd_link_hash_common
)
7119 power_of_two
= h
->u
.c
.p
->alignment_power
;
7121 if (config
.sort_common
== sort_descending
7122 && power_of_two
< *(unsigned int *) info
)
7124 else if (config
.sort_common
== sort_ascending
7125 && power_of_two
> *(unsigned int *) info
)
7128 section
= h
->u
.c
.p
->section
;
7129 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
7130 einfo (_("%F%P: could not define common symbol `%pT': %E\n"),
7133 if (config
.map_file
!= NULL
)
7135 static bfd_boolean header_printed
;
7140 if (!header_printed
)
7142 minfo (_("\nAllocating common symbols\n"));
7143 minfo (_("Common symbol size file\n\n"));
7144 header_printed
= TRUE
;
7147 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
7148 DMGL_ANSI
| DMGL_PARAMS
);
7151 minfo ("%s", h
->root
.string
);
7152 len
= strlen (h
->root
.string
);
7157 len
= strlen (name
);
7173 if (size
<= 0xffffffff)
7174 sprintf (buf
, "%lx", (unsigned long) size
);
7176 sprintf_vma (buf
, size
);
7186 minfo ("%pB\n", section
->owner
);
7192 /* Handle a single orphan section S, placing the orphan into an appropriate
7193 output section. The effects of the --orphan-handling command line
7194 option are handled here. */
7197 ldlang_place_orphan (asection
*s
)
7199 if (config
.orphan_handling
== orphan_handling_discard
)
7201 lang_output_section_statement_type
*os
;
7202 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0, 1);
7203 if (os
->addr_tree
== NULL
7204 && (bfd_link_relocatable (&link_info
)
7205 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7206 os
->addr_tree
= exp_intop (0);
7207 lang_add_section (&os
->children
, s
, NULL
, os
);
7211 lang_output_section_statement_type
*os
;
7212 const char *name
= s
->name
;
7215 if (config
.orphan_handling
== orphan_handling_error
)
7216 einfo (_("%X%P: error: unplaced orphan section `%pA' from `%pB'\n"),
7219 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
7220 constraint
= SPECIAL
;
7222 os
= ldemul_place_orphan (s
, name
, constraint
);
7225 os
= lang_output_section_statement_lookup (name
, constraint
, 1);
7226 if (os
->addr_tree
== NULL
7227 && (bfd_link_relocatable (&link_info
)
7228 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7229 os
->addr_tree
= exp_intop (0);
7230 lang_add_section (&os
->children
, s
, NULL
, os
);
7233 if (config
.orphan_handling
== orphan_handling_warn
)
7234 einfo (_("%P: warning: orphan section `%pA' from `%pB' being "
7235 "placed in section `%s'\n"),
7236 s
, s
->owner
, os
->name
);
7240 /* Run through the input files and ensure that every input section has
7241 somewhere to go. If one is found without a destination then create
7242 an input request and place it into the statement tree. */
7245 lang_place_orphans (void)
7247 LANG_FOR_EACH_INPUT_STATEMENT (file
)
7251 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
7253 if (s
->output_section
== NULL
)
7255 /* This section of the file is not attached, root
7256 around for a sensible place for it to go. */
7258 if (file
->flags
.just_syms
)
7259 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
7260 else if (lang_discard_section_p (s
))
7261 s
->output_section
= bfd_abs_section_ptr
;
7262 else if (strcmp (s
->name
, "COMMON") == 0)
7264 /* This is a lonely common section which must have
7265 come from an archive. We attach to the section
7266 with the wildcard. */
7267 if (!bfd_link_relocatable (&link_info
)
7268 || command_line
.force_common_definition
)
7270 if (default_common_section
== NULL
)
7271 default_common_section
7272 = lang_output_section_statement_lookup (".bss", 0, 1);
7273 lang_add_section (&default_common_section
->children
, s
,
7274 NULL
, default_common_section
);
7278 ldlang_place_orphan (s
);
7285 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
7287 flagword
*ptr_flags
;
7289 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7295 /* PR 17900: An exclamation mark in the attributes reverses
7296 the sense of any of the attributes that follow. */
7299 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7303 *ptr_flags
|= SEC_ALLOC
;
7307 *ptr_flags
|= SEC_READONLY
;
7311 *ptr_flags
|= SEC_DATA
;
7315 *ptr_flags
|= SEC_CODE
;
7320 *ptr_flags
|= SEC_LOAD
;
7324 einfo (_("%F%P: invalid character %c (%d) in flags\n"),
7332 /* Call a function on each real input file. This function will be
7333 called on an archive, but not on the elements. */
7336 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
7338 lang_input_statement_type
*f
;
7340 for (f
= (void *) input_file_chain
.head
;
7342 f
= f
->next_real_file
)
7347 /* Call a function on each real file. The function will be called on
7348 all the elements of an archive which are included in the link, but
7349 will not be called on the archive file itself. */
7352 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
7354 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7362 ldlang_add_file (lang_input_statement_type
*entry
)
7364 lang_statement_append (&file_chain
, entry
, &entry
->next
);
7366 /* The BFD linker needs to have a list of all input BFDs involved in
7368 ASSERT (link_info
.input_bfds_tail
!= &entry
->the_bfd
->link
.next
7369 && entry
->the_bfd
->link
.next
== NULL
);
7370 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
7372 *link_info
.input_bfds_tail
= entry
->the_bfd
;
7373 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
7374 bfd_set_usrdata (entry
->the_bfd
, entry
);
7375 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
7377 /* Look through the sections and check for any which should not be
7378 included in the link. We need to do this now, so that we can
7379 notice when the backend linker tries to report multiple
7380 definition errors for symbols which are in sections we aren't
7381 going to link. FIXME: It might be better to entirely ignore
7382 symbols which are defined in sections which are going to be
7383 discarded. This would require modifying the backend linker for
7384 each backend which might set the SEC_LINK_ONCE flag. If we do
7385 this, we should probably handle SEC_EXCLUDE in the same way. */
7387 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
7391 lang_add_output (const char *name
, int from_script
)
7393 /* Make -o on command line override OUTPUT in script. */
7394 if (!had_output_filename
|| !from_script
)
7396 output_filename
= name
;
7397 had_output_filename
= TRUE
;
7401 lang_output_section_statement_type
*
7402 lang_enter_output_section_statement (const char *output_section_statement_name
,
7403 etree_type
*address_exp
,
7404 enum section_type sectype
,
7406 etree_type
*subalign
,
7409 int align_with_input
)
7411 lang_output_section_statement_type
*os
;
7413 os
= lang_output_section_statement_lookup (output_section_statement_name
,
7415 current_section
= os
;
7417 if (os
->addr_tree
== NULL
)
7419 os
->addr_tree
= address_exp
;
7421 os
->sectype
= sectype
;
7422 if (sectype
!= noload_section
)
7423 os
->flags
= SEC_NO_FLAGS
;
7425 os
->flags
= SEC_NEVER_LOAD
;
7426 os
->block_value
= 1;
7428 /* Make next things chain into subchain of this. */
7429 push_stat_ptr (&os
->children
);
7431 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
7432 if (os
->align_lma_with_input
&& align
!= NULL
)
7433 einfo (_("%F%P:%pS: error: align with input and explicit align specified\n"),
7436 os
->subsection_alignment
= subalign
;
7437 os
->section_alignment
= align
;
7439 os
->load_base
= ebase
;
7446 lang_output_statement_type
*new_stmt
;
7448 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
7449 new_stmt
->name
= output_filename
;
7452 /* Reset the current counters in the regions. */
7455 lang_reset_memory_regions (void)
7457 lang_memory_region_type
*p
= lang_memory_region_list
;
7459 lang_output_section_statement_type
*os
;
7461 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
7463 p
->current
= p
->origin
;
7467 for (os
= (void *) lang_os_list
.head
;
7471 os
->processed_vma
= FALSE
;
7472 os
->processed_lma
= FALSE
;
7475 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
7477 /* Save the last size for possible use by bfd_relax_section. */
7478 o
->rawsize
= o
->size
;
7479 if (!(o
->flags
& SEC_FIXED_SIZE
))
7484 /* Worker for lang_gc_sections_1. */
7487 gc_section_callback (lang_wild_statement_type
*ptr
,
7488 struct wildcard_list
*sec
,
7490 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7491 void *data ATTRIBUTE_UNUSED
)
7493 /* If the wild pattern was marked KEEP, the member sections
7494 should be as well. */
7495 if (ptr
->keep_sections
)
7496 section
->flags
|= SEC_KEEP
;
7498 section
->pattern
= sec
->spec
.name
;
7501 /* Iterate over sections marking them against GC. */
7504 lang_gc_sections_1 (lang_statement_union_type
*s
)
7506 for (; s
!= NULL
; s
= s
->header
.next
)
7508 switch (s
->header
.type
)
7510 case lang_wild_statement_enum
:
7511 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
7513 case lang_constructors_statement_enum
:
7514 lang_gc_sections_1 (constructor_list
.head
);
7516 case lang_output_section_statement_enum
:
7517 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
7519 case lang_group_statement_enum
:
7520 lang_gc_sections_1 (s
->group_statement
.children
.head
);
7529 lang_gc_sections (void)
7531 /* Keep all sections so marked in the link script. */
7532 lang_gc_sections_1 (statement_list
.head
);
7534 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
7535 the special case of debug info. (See bfd/stabs.c)
7536 Twiddle the flag here, to simplify later linker code. */
7537 if (bfd_link_relocatable (&link_info
))
7539 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7542 #if BFD_SUPPORTS_PLUGINS
7543 if (f
->flags
.claimed
)
7546 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
7547 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
7548 sec
->flags
&= ~SEC_EXCLUDE
;
7552 if (link_info
.gc_sections
)
7553 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
7556 /* Worker for lang_find_relro_sections_1. */
7559 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
7560 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7562 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7565 /* Discarded, excluded and ignored sections effectively have zero
7567 if (section
->output_section
!= NULL
7568 && section
->output_section
->owner
== link_info
.output_bfd
7569 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
7570 && !IGNORE_SECTION (section
)
7571 && section
->size
!= 0)
7573 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
7574 *has_relro_section
= TRUE
;
7578 /* Iterate over sections for relro sections. */
7581 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
7582 seg_align_type
*seg
,
7583 bfd_boolean
*has_relro_section
)
7585 if (*has_relro_section
)
7588 for (; s
!= NULL
; s
= s
->header
.next
)
7590 if (s
== seg
->relro_end_stat
)
7593 switch (s
->header
.type
)
7595 case lang_wild_statement_enum
:
7596 walk_wild (&s
->wild_statement
,
7597 find_relro_section_callback
,
7600 case lang_constructors_statement_enum
:
7601 lang_find_relro_sections_1 (constructor_list
.head
,
7602 seg
, has_relro_section
);
7604 case lang_output_section_statement_enum
:
7605 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
7606 seg
, has_relro_section
);
7608 case lang_group_statement_enum
:
7609 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
7610 seg
, has_relro_section
);
7619 lang_find_relro_sections (void)
7621 bfd_boolean has_relro_section
= FALSE
;
7623 /* Check all sections in the link script. */
7625 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
7626 &expld
.dataseg
, &has_relro_section
);
7628 if (!has_relro_section
)
7629 link_info
.relro
= FALSE
;
7632 /* Relax all sections until bfd_relax_section gives up. */
7635 lang_relax_sections (bfd_boolean need_layout
)
7637 if (RELAXATION_ENABLED
)
7639 /* We may need more than one relaxation pass. */
7640 int i
= link_info
.relax_pass
;
7642 /* The backend can use it to determine the current pass. */
7643 link_info
.relax_pass
= 0;
7647 /* Keep relaxing until bfd_relax_section gives up. */
7648 bfd_boolean relax_again
;
7650 link_info
.relax_trip
= -1;
7653 link_info
.relax_trip
++;
7655 /* Note: pe-dll.c does something like this also. If you find
7656 you need to change this code, you probably need to change
7657 pe-dll.c also. DJ */
7659 /* Do all the assignments with our current guesses as to
7661 lang_do_assignments (lang_assigning_phase_enum
);
7663 /* We must do this after lang_do_assignments, because it uses
7665 lang_reset_memory_regions ();
7667 /* Perform another relax pass - this time we know where the
7668 globals are, so can make a better guess. */
7669 relax_again
= FALSE
;
7670 lang_size_sections (&relax_again
, FALSE
);
7672 while (relax_again
);
7674 link_info
.relax_pass
++;
7681 /* Final extra sizing to report errors. */
7682 lang_do_assignments (lang_assigning_phase_enum
);
7683 lang_reset_memory_regions ();
7684 lang_size_sections (NULL
, TRUE
);
7688 #if BFD_SUPPORTS_PLUGINS
7689 /* Find the insert point for the plugin's replacement files. We
7690 place them after the first claimed real object file, or if the
7691 first claimed object is an archive member, after the last real
7692 object file immediately preceding the archive. In the event
7693 no objects have been claimed at all, we return the first dummy
7694 object file on the list as the insert point; that works, but
7695 the callee must be careful when relinking the file_chain as it
7696 is not actually on that chain, only the statement_list and the
7697 input_file list; in that case, the replacement files must be
7698 inserted at the head of the file_chain. */
7700 static lang_input_statement_type
*
7701 find_replacements_insert_point (bfd_boolean
*before
)
7703 lang_input_statement_type
*claim1
, *lastobject
;
7704 lastobject
= (void *) input_file_chain
.head
;
7705 for (claim1
= (void *) file_chain
.head
;
7707 claim1
= claim1
->next
)
7709 if (claim1
->flags
.claimed
)
7711 *before
= claim1
->flags
.claim_archive
;
7712 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
7714 /* Update lastobject if this is a real object file. */
7715 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
7716 lastobject
= claim1
;
7718 /* No files were claimed by the plugin. Choose the last object
7719 file found on the list (maybe the first, dummy entry) as the
7725 /* Find where to insert ADD, an archive element or shared library
7726 added during a rescan. */
7728 static lang_input_statement_type
**
7729 find_rescan_insertion (lang_input_statement_type
*add
)
7731 bfd
*add_bfd
= add
->the_bfd
;
7732 lang_input_statement_type
*f
;
7733 lang_input_statement_type
*last_loaded
= NULL
;
7734 lang_input_statement_type
*before
= NULL
;
7735 lang_input_statement_type
**iter
= NULL
;
7737 if (add_bfd
->my_archive
!= NULL
)
7738 add_bfd
= add_bfd
->my_archive
;
7740 /* First look through the input file chain, to find an object file
7741 before the one we've rescanned. Normal object files always
7742 appear on both the input file chain and the file chain, so this
7743 lets us get quickly to somewhere near the correct place on the
7744 file chain if it is full of archive elements. Archives don't
7745 appear on the file chain, but if an element has been extracted
7746 then their input_statement->next points at it. */
7747 for (f
= (void *) input_file_chain
.head
;
7749 f
= f
->next_real_file
)
7751 if (f
->the_bfd
== add_bfd
)
7753 before
= last_loaded
;
7754 if (f
->next
!= NULL
)
7755 return &f
->next
->next
;
7757 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7761 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7763 iter
= &(*iter
)->next
)
7764 if (!(*iter
)->flags
.claim_archive
7765 && (*iter
)->the_bfd
->my_archive
== NULL
)
7771 /* Insert SRCLIST into DESTLIST after given element by chaining
7772 on FIELD as the next-pointer. (Counterintuitively does not need
7773 a pointer to the actual after-node itself, just its chain field.) */
7776 lang_list_insert_after (lang_statement_list_type
*destlist
,
7777 lang_statement_list_type
*srclist
,
7778 lang_statement_union_type
**field
)
7780 *(srclist
->tail
) = *field
;
7781 *field
= srclist
->head
;
7782 if (destlist
->tail
== field
)
7783 destlist
->tail
= srclist
->tail
;
7786 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7787 was taken as a copy of it and leave them in ORIGLIST. */
7790 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7791 lang_statement_list_type
*origlist
)
7793 union lang_statement_union
**savetail
;
7794 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7795 ASSERT (origlist
->head
== destlist
->head
);
7796 savetail
= origlist
->tail
;
7797 origlist
->head
= *(savetail
);
7798 origlist
->tail
= destlist
->tail
;
7799 destlist
->tail
= savetail
;
7803 static lang_statement_union_type
**
7804 find_next_input_statement (lang_statement_union_type
**s
)
7806 for ( ; *s
; s
= &(*s
)->header
.next
)
7808 lang_statement_union_type
**t
;
7809 switch ((*s
)->header
.type
)
7811 case lang_input_statement_enum
:
7813 case lang_wild_statement_enum
:
7814 t
= &(*s
)->wild_statement
.children
.head
;
7816 case lang_group_statement_enum
:
7817 t
= &(*s
)->group_statement
.children
.head
;
7819 case lang_output_section_statement_enum
:
7820 t
= &(*s
)->output_section_statement
.children
.head
;
7825 t
= find_next_input_statement (t
);
7831 #endif /* BFD_SUPPORTS_PLUGINS */
7833 /* Add NAME to the list of garbage collection entry points. */
7836 lang_add_gc_name (const char *name
)
7838 struct bfd_sym_chain
*sym
;
7843 sym
= stat_alloc (sizeof (*sym
));
7845 sym
->next
= link_info
.gc_sym_list
;
7847 link_info
.gc_sym_list
= sym
;
7850 /* Check relocations. */
7853 lang_check_relocs (void)
7855 if (link_info
.check_relocs_after_open_input
)
7859 for (abfd
= link_info
.input_bfds
;
7860 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7861 if (!bfd_link_check_relocs (abfd
, &link_info
))
7863 /* No object output, fail return. */
7864 config
.make_executable
= FALSE
;
7865 /* Note: we do not abort the loop, but rather
7866 continue the scan in case there are other
7867 bad relocations to report. */
7872 /* Look through all output sections looking for places where we can
7873 propagate forward the lma region. */
7876 lang_propagate_lma_regions (void)
7878 lang_output_section_statement_type
*os
;
7880 for (os
= (void *) lang_os_list
.head
;
7884 if (os
->prev
!= NULL
7885 && os
->lma_region
== NULL
7886 && os
->load_base
== NULL
7887 && os
->addr_tree
== NULL
7888 && os
->region
== os
->prev
->region
)
7889 os
->lma_region
= os
->prev
->lma_region
;
7896 /* Finalize dynamic list. */
7897 if (link_info
.dynamic_list
)
7898 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
7900 current_target
= default_target
;
7902 /* Open the output file. */
7903 lang_for_each_statement (ldlang_open_output
);
7906 ldemul_create_output_section_statements ();
7908 /* Add to the hash table all undefineds on the command line. */
7909 lang_place_undefineds ();
7911 if (!bfd_section_already_linked_table_init ())
7912 einfo (_("%F%P: can not create hash table: %E\n"));
7914 /* A first pass through the memory regions ensures that if any region
7915 references a symbol for its origin or length then this symbol will be
7916 added to the symbol table. Having these symbols in the symbol table
7917 means that when we call open_input_bfds PROVIDE statements will
7918 trigger to provide any needed symbols. The regions origins and
7919 lengths are not assigned as a result of this call. */
7920 lang_do_memory_regions (FALSE
);
7922 /* Create a bfd for each input file. */
7923 current_target
= default_target
;
7924 lang_statement_iteration
++;
7925 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
7927 /* Now that open_input_bfds has processed assignments and provide
7928 statements we can give values to symbolic origin/length now. */
7929 lang_do_memory_regions (TRUE
);
7931 #if BFD_SUPPORTS_PLUGINS
7932 if (link_info
.lto_plugin_active
)
7934 lang_statement_list_type added
;
7935 lang_statement_list_type files
, inputfiles
;
7937 /* Now all files are read, let the plugin(s) decide if there
7938 are any more to be added to the link before we call the
7939 emulation's after_open hook. We create a private list of
7940 input statements for this purpose, which we will eventually
7941 insert into the global statement list after the first claimed
7944 /* We need to manipulate all three chains in synchrony. */
7946 inputfiles
= input_file_chain
;
7947 if (plugin_call_all_symbols_read ())
7948 einfo (_("%F%P: %s: plugin reported error after all symbols read\n"),
7949 plugin_error_plugin ());
7950 link_info
.lto_all_symbols_read
= TRUE
;
7951 /* Open any newly added files, updating the file chains. */
7952 plugin_undefs
= link_info
.hash
->undefs_tail
;
7953 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
7954 if (plugin_undefs
== link_info
.hash
->undefs_tail
)
7955 plugin_undefs
= NULL
;
7956 /* Restore the global list pointer now they have all been added. */
7957 lang_list_remove_tail (stat_ptr
, &added
);
7958 /* And detach the fresh ends of the file lists. */
7959 lang_list_remove_tail (&file_chain
, &files
);
7960 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
7961 /* Were any new files added? */
7962 if (added
.head
!= NULL
)
7964 /* If so, we will insert them into the statement list immediately
7965 after the first input file that was claimed by the plugin,
7966 unless that file was an archive in which case it is inserted
7967 immediately before. */
7969 lang_statement_union_type
**prev
;
7970 plugin_insert
= find_replacements_insert_point (&before
);
7971 /* If a plugin adds input files without having claimed any, we
7972 don't really have a good idea where to place them. Just putting
7973 them at the start or end of the list is liable to leave them
7974 outside the crtbegin...crtend range. */
7975 ASSERT (plugin_insert
!= NULL
);
7976 /* Splice the new statement list into the old one. */
7977 prev
= &plugin_insert
->header
.next
;
7980 prev
= find_next_input_statement (prev
);
7981 if (*prev
!= (void *) plugin_insert
->next_real_file
)
7983 /* We didn't find the expected input statement.
7984 Fall back to adding after plugin_insert. */
7985 prev
= &plugin_insert
->header
.next
;
7988 lang_list_insert_after (stat_ptr
, &added
, prev
);
7989 /* Likewise for the file chains. */
7990 lang_list_insert_after (&input_file_chain
, &inputfiles
,
7991 (void *) &plugin_insert
->next_real_file
);
7992 /* We must be careful when relinking file_chain; we may need to
7993 insert the new files at the head of the list if the insert
7994 point chosen is the dummy first input file. */
7995 if (plugin_insert
->filename
)
7996 lang_list_insert_after (&file_chain
, &files
,
7997 (void *) &plugin_insert
->next
);
7999 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
8001 /* Rescan archives in case new undefined symbols have appeared. */
8003 lang_statement_iteration
++;
8004 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
8005 lang_list_remove_tail (&file_chain
, &files
);
8006 while (files
.head
!= NULL
)
8008 lang_input_statement_type
**insert
;
8009 lang_input_statement_type
**iter
, *temp
;
8012 insert
= find_rescan_insertion (&files
.head
->input_statement
);
8013 /* All elements from an archive can be added at once. */
8014 iter
= &files
.head
->input_statement
.next
;
8015 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
8016 if (my_arch
!= NULL
)
8017 for (; *iter
!= NULL
; iter
= &(*iter
)->next
)
8018 if ((*iter
)->the_bfd
->my_archive
!= my_arch
)
8021 *insert
= &files
.head
->input_statement
;
8022 files
.head
= (lang_statement_union_type
*) *iter
;
8024 if (my_arch
!= NULL
)
8026 lang_input_statement_type
*parent
= bfd_usrdata (my_arch
);
8028 parent
->next
= (lang_input_statement_type
*)
8030 - offsetof (lang_input_statement_type
, next
));
8035 #endif /* BFD_SUPPORTS_PLUGINS */
8037 /* Make sure that nobody has tried to add a symbol to this list
8039 ASSERT (link_info
.gc_sym_list
== NULL
);
8041 link_info
.gc_sym_list
= &entry_symbol
;
8043 if (entry_symbol
.name
== NULL
)
8045 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
8047 /* entry_symbol is normally initialied by a ENTRY definition in the
8048 linker script or the -e command line option. But if neither of
8049 these have been used, the target specific backend may still have
8050 provided an entry symbol via a call to lang_default_entry().
8051 Unfortunately this value will not be processed until lang_end()
8052 is called, long after this function has finished. So detect this
8053 case here and add the target's entry symbol to the list of starting
8054 points for garbage collection resolution. */
8055 lang_add_gc_name (entry_symbol_default
);
8058 lang_add_gc_name (link_info
.init_function
);
8059 lang_add_gc_name (link_info
.fini_function
);
8061 ldemul_after_open ();
8062 if (config
.map_file
!= NULL
)
8063 lang_print_asneeded ();
8067 bfd_section_already_linked_table_free ();
8069 /* Make sure that we're not mixing architectures. We call this
8070 after all the input files have been opened, but before we do any
8071 other processing, so that any operations merge_private_bfd_data
8072 does on the output file will be known during the rest of the
8076 /* Handle .exports instead of a version script if we're told to do so. */
8077 if (command_line
.version_exports_section
)
8078 lang_do_version_exports_section ();
8080 /* Build all sets based on the information gathered from the input
8082 ldctor_build_sets ();
8084 /* Give initial values for __start and __stop symbols, so that ELF
8085 gc_sections will keep sections referenced by these symbols. Must
8086 be done before lang_do_assignments below. */
8087 if (config
.build_constructors
)
8088 lang_init_start_stop ();
8090 /* PR 13683: We must rerun the assignments prior to running garbage
8091 collection in order to make sure that all symbol aliases are resolved. */
8092 lang_do_assignments (lang_mark_phase_enum
);
8093 expld
.phase
= lang_first_phase_enum
;
8095 /* Size up the common data. */
8098 /* Remove unreferenced sections if asked to. */
8099 lang_gc_sections ();
8101 /* Check relocations. */
8102 lang_check_relocs ();
8104 ldemul_after_check_relocs ();
8106 /* Update wild statements. */
8107 update_wild_statements (statement_list
.head
);
8109 /* Run through the contours of the script and attach input sections
8110 to the correct output sections. */
8111 lang_statement_iteration
++;
8112 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
8114 /* Start at the statement immediately after the special abs_section
8115 output statement, so that it isn't reordered. */
8116 process_insert_statements (&lang_os_list
.head
->header
.next
);
8118 ldemul_before_place_orphans ();
8120 /* Find any sections not attached explicitly and handle them. */
8121 lang_place_orphans ();
8123 if (!bfd_link_relocatable (&link_info
))
8127 /* Merge SEC_MERGE sections. This has to be done after GC of
8128 sections, so that GCed sections are not merged, but before
8129 assigning dynamic symbols, since removing whole input sections
8131 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
8133 /* Look for a text section and set the readonly attribute in it. */
8134 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
8138 if (config
.text_read_only
)
8139 found
->flags
|= SEC_READONLY
;
8141 found
->flags
&= ~SEC_READONLY
;
8145 /* Merge together CTF sections. After this, only the symtab-dependent
8146 function and data object sections need adjustment. */
8149 /* Emit the CTF, iff the emulation doesn't need to do late emission after
8150 examining things laid out late, like the strtab. */
8153 /* Copy forward lma regions for output sections in same lma region. */
8154 lang_propagate_lma_regions ();
8156 /* Defining __start/__stop symbols early for --gc-sections to work
8157 around a glibc build problem can result in these symbols being
8158 defined when they should not be. Fix them now. */
8159 if (config
.build_constructors
)
8160 lang_undef_start_stop ();
8162 /* Define .startof./.sizeof. symbols with preliminary values before
8163 dynamic symbols are created. */
8164 if (!bfd_link_relocatable (&link_info
))
8165 lang_init_startof_sizeof ();
8167 /* Do anything special before sizing sections. This is where ELF
8168 and other back-ends size dynamic sections. */
8169 ldemul_before_allocation ();
8171 /* We must record the program headers before we try to fix the
8172 section positions, since they will affect SIZEOF_HEADERS. */
8173 lang_record_phdrs ();
8175 /* Check relro sections. */
8176 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
8177 lang_find_relro_sections ();
8179 /* Size up the sections. */
8180 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
8182 /* See if anything special should be done now we know how big
8183 everything is. This is where relaxation is done. */
8184 ldemul_after_allocation ();
8186 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
8187 lang_finalize_start_stop ();
8189 /* Do all the assignments again, to report errors. Assignment
8190 statements are processed multiple times, updating symbols; In
8191 open_input_bfds, lang_do_assignments, and lang_size_sections.
8192 Since lang_relax_sections calls lang_do_assignments, symbols are
8193 also updated in ldemul_after_allocation. */
8194 lang_do_assignments (lang_final_phase_enum
);
8198 /* Convert absolute symbols to section relative. */
8199 ldexp_finalize_syms ();
8201 /* Make sure that the section addresses make sense. */
8202 if (command_line
.check_section_addresses
)
8203 lang_check_section_addresses ();
8205 /* Check any required symbols are known. */
8206 ldlang_check_require_defined_symbols ();
8211 /* EXPORTED TO YACC */
8214 lang_add_wild (struct wildcard_spec
*filespec
,
8215 struct wildcard_list
*section_list
,
8216 bfd_boolean keep_sections
)
8218 struct wildcard_list
*curr
, *next
;
8219 lang_wild_statement_type
*new_stmt
;
8221 /* Reverse the list as the parser puts it back to front. */
8222 for (curr
= section_list
, section_list
= NULL
;
8224 section_list
= curr
, curr
= next
)
8227 curr
->next
= section_list
;
8230 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
8232 if (strcmp (filespec
->name
, "*") == 0)
8233 filespec
->name
= NULL
;
8234 else if (!wildcardp (filespec
->name
))
8235 lang_has_input_file
= TRUE
;
8238 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
8239 new_stmt
->filename
= NULL
;
8240 new_stmt
->filenames_sorted
= FALSE
;
8241 new_stmt
->section_flag_list
= NULL
;
8242 new_stmt
->exclude_name_list
= NULL
;
8243 if (filespec
!= NULL
)
8245 new_stmt
->filename
= filespec
->name
;
8246 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
8247 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
8248 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
8250 new_stmt
->section_list
= section_list
;
8251 new_stmt
->keep_sections
= keep_sections
;
8252 lang_list_init (&new_stmt
->children
);
8253 analyze_walk_wild_section_handler (new_stmt
);
8257 lang_section_start (const char *name
, etree_type
*address
,
8258 const segment_type
*segment
)
8260 lang_address_statement_type
*ad
;
8262 ad
= new_stat (lang_address_statement
, stat_ptr
);
8263 ad
->section_name
= name
;
8264 ad
->address
= address
;
8265 ad
->segment
= segment
;
8268 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
8269 because of a -e argument on the command line, or zero if this is
8270 called by ENTRY in a linker script. Command line arguments take
8274 lang_add_entry (const char *name
, bfd_boolean cmdline
)
8276 if (entry_symbol
.name
== NULL
8278 || !entry_from_cmdline
)
8280 entry_symbol
.name
= name
;
8281 entry_from_cmdline
= cmdline
;
8285 /* Set the default start symbol to NAME. .em files should use this,
8286 not lang_add_entry, to override the use of "start" if neither the
8287 linker script nor the command line specifies an entry point. NAME
8288 must be permanently allocated. */
8290 lang_default_entry (const char *name
)
8292 entry_symbol_default
= name
;
8296 lang_add_target (const char *name
)
8298 lang_target_statement_type
*new_stmt
;
8300 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
8301 new_stmt
->target
= name
;
8305 lang_add_map (const char *name
)
8312 map_option_f
= TRUE
;
8320 lang_add_fill (fill_type
*fill
)
8322 lang_fill_statement_type
*new_stmt
;
8324 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
8325 new_stmt
->fill
= fill
;
8329 lang_add_data (int type
, union etree_union
*exp
)
8331 lang_data_statement_type
*new_stmt
;
8333 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
8334 new_stmt
->exp
= exp
;
8335 new_stmt
->type
= type
;
8338 /* Create a new reloc statement. RELOC is the BFD relocation type to
8339 generate. HOWTO is the corresponding howto structure (we could
8340 look this up, but the caller has already done so). SECTION is the
8341 section to generate a reloc against, or NAME is the name of the
8342 symbol to generate a reloc against. Exactly one of SECTION and
8343 NAME must be NULL. ADDEND is an expression for the addend. */
8346 lang_add_reloc (bfd_reloc_code_real_type reloc
,
8347 reloc_howto_type
*howto
,
8350 union etree_union
*addend
)
8352 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
8356 p
->section
= section
;
8358 p
->addend_exp
= addend
;
8360 p
->addend_value
= 0;
8361 p
->output_section
= NULL
;
8362 p
->output_offset
= 0;
8365 lang_assignment_statement_type
*
8366 lang_add_assignment (etree_type
*exp
)
8368 lang_assignment_statement_type
*new_stmt
;
8370 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
8371 new_stmt
->exp
= exp
;
8376 lang_add_attribute (enum statement_enum attribute
)
8378 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
8382 lang_startup (const char *name
)
8384 if (first_file
->filename
!= NULL
)
8386 einfo (_("%F%P: multiple STARTUP files\n"));
8388 first_file
->filename
= name
;
8389 first_file
->local_sym_name
= name
;
8390 first_file
->flags
.real
= TRUE
;
8394 lang_float (bfd_boolean maybe
)
8396 lang_float_flag
= maybe
;
8400 /* Work out the load- and run-time regions from a script statement, and
8401 store them in *LMA_REGION and *REGION respectively.
8403 MEMSPEC is the name of the run-time region, or the value of
8404 DEFAULT_MEMORY_REGION if the statement didn't specify one.
8405 LMA_MEMSPEC is the name of the load-time region, or null if the
8406 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
8407 had an explicit load address.
8409 It is an error to specify both a load region and a load address. */
8412 lang_get_regions (lang_memory_region_type
**region
,
8413 lang_memory_region_type
**lma_region
,
8414 const char *memspec
,
8415 const char *lma_memspec
,
8416 bfd_boolean have_lma
,
8417 bfd_boolean have_vma
)
8419 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
8421 /* If no runtime region or VMA has been specified, but the load region
8422 has been specified, then use the load region for the runtime region
8424 if (lma_memspec
!= NULL
8426 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
8427 *region
= *lma_region
;
8429 *region
= lang_memory_region_lookup (memspec
, FALSE
);
8431 if (have_lma
&& lma_memspec
!= 0)
8432 einfo (_("%X%P:%pS: section has both a load address and a load region\n"),
8437 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
8438 lang_output_section_phdr_list
*phdrs
,
8439 const char *lma_memspec
)
8441 lang_get_regions (¤t_section
->region
,
8442 ¤t_section
->lma_region
,
8443 memspec
, lma_memspec
,
8444 current_section
->load_base
!= NULL
,
8445 current_section
->addr_tree
!= NULL
);
8447 current_section
->fill
= fill
;
8448 current_section
->phdrs
= phdrs
;
8452 /* Set the output format type. -oformat overrides scripts. */
8455 lang_add_output_format (const char *format
,
8460 if (output_target
== NULL
|| !from_script
)
8462 if (command_line
.endian
== ENDIAN_BIG
8465 else if (command_line
.endian
== ENDIAN_LITTLE
8469 output_target
= format
;
8474 lang_add_insert (const char *where
, int is_before
)
8476 lang_insert_statement_type
*new_stmt
;
8478 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
8479 new_stmt
->where
= where
;
8480 new_stmt
->is_before
= is_before
;
8481 saved_script_handle
= previous_script_handle
;
8484 /* Enter a group. This creates a new lang_group_statement, and sets
8485 stat_ptr to build new statements within the group. */
8488 lang_enter_group (void)
8490 lang_group_statement_type
*g
;
8492 g
= new_stat (lang_group_statement
, stat_ptr
);
8493 lang_list_init (&g
->children
);
8494 push_stat_ptr (&g
->children
);
8497 /* Leave a group. This just resets stat_ptr to start writing to the
8498 regular list of statements again. Note that this will not work if
8499 groups can occur inside anything else which can adjust stat_ptr,
8500 but currently they can't. */
8503 lang_leave_group (void)
8508 /* Add a new program header. This is called for each entry in a PHDRS
8509 command in a linker script. */
8512 lang_new_phdr (const char *name
,
8514 bfd_boolean filehdr
,
8519 struct lang_phdr
*n
, **pp
;
8522 n
= stat_alloc (sizeof (struct lang_phdr
));
8525 n
->type
= exp_get_vma (type
, 0, "program header type");
8526 n
->filehdr
= filehdr
;
8531 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
8533 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8536 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
8538 einfo (_("%X%P:%pS: PHDRS and FILEHDR are not supported"
8539 " when prior PT_LOAD headers lack them\n"), NULL
);
8546 /* Record the program header information in the output BFD. FIXME: We
8547 should not be calling an ELF specific function here. */
8550 lang_record_phdrs (void)
8554 lang_output_section_phdr_list
*last
;
8555 struct lang_phdr
*l
;
8556 lang_output_section_statement_type
*os
;
8559 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
8562 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
8569 for (os
= (void *) lang_os_list
.head
;
8573 lang_output_section_phdr_list
*pl
;
8575 if (os
->constraint
< 0)
8583 if (os
->sectype
== noload_section
8584 || os
->bfd_section
== NULL
8585 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
8588 /* Don't add orphans to PT_INTERP header. */
8594 lang_output_section_statement_type
*tmp_os
;
8596 /* If we have not run across a section with a program
8597 header assigned to it yet, then scan forwards to find
8598 one. This prevents inconsistencies in the linker's
8599 behaviour when a script has specified just a single
8600 header and there are sections in that script which are
8601 not assigned to it, and which occur before the first
8602 use of that header. See here for more details:
8603 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
8604 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
8607 last
= tmp_os
->phdrs
;
8611 einfo (_("%F%P: no sections assigned to phdrs\n"));
8616 if (os
->bfd_section
== NULL
)
8619 for (; pl
!= NULL
; pl
= pl
->next
)
8621 if (strcmp (pl
->name
, l
->name
) == 0)
8626 secs
= (asection
**) xrealloc (secs
,
8627 alc
* sizeof (asection
*));
8629 secs
[c
] = os
->bfd_section
;
8636 if (l
->flags
== NULL
)
8639 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
8644 at
= exp_get_vma (l
->at
, 0, "phdr load address");
8646 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
8647 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
8648 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
8649 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
8654 /* Make sure all the phdr assignments succeeded. */
8655 for (os
= (void *) lang_os_list
.head
;
8659 lang_output_section_phdr_list
*pl
;
8661 if (os
->constraint
< 0
8662 || os
->bfd_section
== NULL
)
8665 for (pl
= os
->phdrs
;
8668 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
8669 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
8670 os
->name
, pl
->name
);
8674 /* Record a list of sections which may not be cross referenced. */
8677 lang_add_nocrossref (lang_nocrossref_type
*l
)
8679 struct lang_nocrossrefs
*n
;
8681 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
8682 n
->next
= nocrossref_list
;
8684 n
->onlyfirst
= FALSE
;
8685 nocrossref_list
= n
;
8687 /* Set notice_all so that we get informed about all symbols. */
8688 link_info
.notice_all
= TRUE
;
8691 /* Record a section that cannot be referenced from a list of sections. */
8694 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
8696 lang_add_nocrossref (l
);
8697 nocrossref_list
->onlyfirst
= TRUE
;
8700 /* Overlay handling. We handle overlays with some static variables. */
8702 /* The overlay virtual address. */
8703 static etree_type
*overlay_vma
;
8704 /* And subsection alignment. */
8705 static etree_type
*overlay_subalign
;
8707 /* An expression for the maximum section size seen so far. */
8708 static etree_type
*overlay_max
;
8710 /* A list of all the sections in this overlay. */
8712 struct overlay_list
{
8713 struct overlay_list
*next
;
8714 lang_output_section_statement_type
*os
;
8717 static struct overlay_list
*overlay_list
;
8719 /* Start handling an overlay. */
8722 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
8724 /* The grammar should prevent nested overlays from occurring. */
8725 ASSERT (overlay_vma
== NULL
8726 && overlay_subalign
== NULL
8727 && overlay_max
== NULL
);
8729 overlay_vma
= vma_expr
;
8730 overlay_subalign
= subalign
;
8733 /* Start a section in an overlay. We handle this by calling
8734 lang_enter_output_section_statement with the correct VMA.
8735 lang_leave_overlay sets up the LMA and memory regions. */
8738 lang_enter_overlay_section (const char *name
)
8740 struct overlay_list
*n
;
8743 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
8744 0, overlay_subalign
, 0, 0, 0);
8746 /* If this is the first section, then base the VMA of future
8747 sections on this one. This will work correctly even if `.' is
8748 used in the addresses. */
8749 if (overlay_list
== NULL
)
8750 overlay_vma
= exp_nameop (ADDR
, name
);
8752 /* Remember the section. */
8753 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
8754 n
->os
= current_section
;
8755 n
->next
= overlay_list
;
8758 size
= exp_nameop (SIZEOF
, name
);
8760 /* Arrange to work out the maximum section end address. */
8761 if (overlay_max
== NULL
)
8764 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
8767 /* Finish a section in an overlay. There isn't any special to do
8771 lang_leave_overlay_section (fill_type
*fill
,
8772 lang_output_section_phdr_list
*phdrs
)
8779 name
= current_section
->name
;
8781 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
8782 region and that no load-time region has been specified. It doesn't
8783 really matter what we say here, since lang_leave_overlay will
8785 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
8787 /* Define the magic symbols. */
8789 clean
= (char *) xmalloc (strlen (name
) + 1);
8791 for (s1
= name
; *s1
!= '\0'; s1
++)
8792 if (ISALNUM (*s1
) || *s1
== '_')
8796 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8797 sprintf (buf
, "__load_start_%s", clean
);
8798 lang_add_assignment (exp_provide (buf
,
8799 exp_nameop (LOADADDR
, name
),
8802 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8803 sprintf (buf
, "__load_stop_%s", clean
);
8804 lang_add_assignment (exp_provide (buf
,
8806 exp_nameop (LOADADDR
, name
),
8807 exp_nameop (SIZEOF
, name
)),
8813 /* Finish an overlay. If there are any overlay wide settings, this
8814 looks through all the sections in the overlay and sets them. */
8817 lang_leave_overlay (etree_type
*lma_expr
,
8820 const char *memspec
,
8821 lang_output_section_phdr_list
*phdrs
,
8822 const char *lma_memspec
)
8824 lang_memory_region_type
*region
;
8825 lang_memory_region_type
*lma_region
;
8826 struct overlay_list
*l
;
8827 lang_nocrossref_type
*nocrossref
;
8829 lang_get_regions (®ion
, &lma_region
,
8830 memspec
, lma_memspec
,
8831 lma_expr
!= NULL
, FALSE
);
8835 /* After setting the size of the last section, set '.' to end of the
8837 if (overlay_list
!= NULL
)
8839 overlay_list
->os
->update_dot
= 1;
8840 overlay_list
->os
->update_dot_tree
8841 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
8847 struct overlay_list
*next
;
8849 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8852 l
->os
->region
= region
;
8853 l
->os
->lma_region
= lma_region
;
8855 /* The first section has the load address specified in the
8856 OVERLAY statement. The rest are worked out from that.
8857 The base address is not needed (and should be null) if
8858 an LMA region was specified. */
8861 l
->os
->load_base
= lma_expr
;
8862 l
->os
->sectype
= first_overlay_section
;
8864 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
8865 l
->os
->phdrs
= phdrs
;
8869 lang_nocrossref_type
*nc
;
8871 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
8872 nc
->name
= l
->os
->name
;
8873 nc
->next
= nocrossref
;
8882 if (nocrossref
!= NULL
)
8883 lang_add_nocrossref (nocrossref
);
8886 overlay_list
= NULL
;
8888 overlay_subalign
= NULL
;
8891 /* Version handling. This is only useful for ELF. */
8893 /* If PREV is NULL, return first version pattern matching particular symbol.
8894 If PREV is non-NULL, return first version pattern matching particular
8895 symbol after PREV (previously returned by lang_vers_match). */
8897 static struct bfd_elf_version_expr
*
8898 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
8899 struct bfd_elf_version_expr
*prev
,
8903 const char *cxx_sym
= sym
;
8904 const char *java_sym
= sym
;
8905 struct bfd_elf_version_expr
*expr
= NULL
;
8906 enum demangling_styles curr_style
;
8908 curr_style
= CURRENT_DEMANGLING_STYLE
;
8909 cplus_demangle_set_style (no_demangling
);
8910 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
8913 cplus_demangle_set_style (curr_style
);
8915 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8917 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
8918 DMGL_PARAMS
| DMGL_ANSI
);
8922 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8924 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
8929 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
8931 struct bfd_elf_version_expr e
;
8933 switch (prev
? prev
->mask
: 0)
8936 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
8939 expr
= (struct bfd_elf_version_expr
*)
8940 htab_find ((htab_t
) head
->htab
, &e
);
8941 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
8942 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
8948 case BFD_ELF_VERSION_C_TYPE
:
8949 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8951 e
.pattern
= cxx_sym
;
8952 expr
= (struct bfd_elf_version_expr
*)
8953 htab_find ((htab_t
) head
->htab
, &e
);
8954 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
8955 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8961 case BFD_ELF_VERSION_CXX_TYPE
:
8962 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8964 e
.pattern
= java_sym
;
8965 expr
= (struct bfd_elf_version_expr
*)
8966 htab_find ((htab_t
) head
->htab
, &e
);
8967 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
8968 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8979 /* Finally, try the wildcards. */
8980 if (prev
== NULL
|| prev
->literal
)
8981 expr
= head
->remaining
;
8984 for (; expr
; expr
= expr
->next
)
8991 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
8994 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8996 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
9000 if (fnmatch (expr
->pattern
, s
, 0) == 0)
9006 free ((char *) c_sym
);
9008 free ((char *) cxx_sym
);
9009 if (java_sym
!= sym
)
9010 free ((char *) java_sym
);
9014 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
9015 return a pointer to the symbol name with any backslash quotes removed. */
9018 realsymbol (const char *pattern
)
9021 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
9022 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
9024 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
9026 /* It is a glob pattern only if there is no preceding
9030 /* Remove the preceding backslash. */
9037 if (*p
== '?' || *p
== '*' || *p
== '[')
9044 backslash
= *p
== '\\';
9060 /* This is called for each variable name or match expression. NEW_NAME is
9061 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
9062 pattern to be matched against symbol names. */
9064 struct bfd_elf_version_expr
*
9065 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
9066 const char *new_name
,
9068 bfd_boolean literal_p
)
9070 struct bfd_elf_version_expr
*ret
;
9072 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
9076 ret
->literal
= TRUE
;
9077 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
9078 if (ret
->pattern
== NULL
)
9080 ret
->pattern
= new_name
;
9081 ret
->literal
= FALSE
;
9084 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
9085 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9086 else if (strcasecmp (lang
, "C++") == 0)
9087 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
9088 else if (strcasecmp (lang
, "Java") == 0)
9089 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
9092 einfo (_("%X%P: unknown language `%s' in version information\n"),
9094 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9097 return ldemul_new_vers_pattern (ret
);
9100 /* This is called for each set of variable names and match
9103 struct bfd_elf_version_tree
*
9104 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
9105 struct bfd_elf_version_expr
*locals
)
9107 struct bfd_elf_version_tree
*ret
;
9109 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
9110 ret
->globals
.list
= globals
;
9111 ret
->locals
.list
= locals
;
9112 ret
->match
= lang_vers_match
;
9113 ret
->name_indx
= (unsigned int) -1;
9117 /* This static variable keeps track of version indices. */
9119 static int version_index
;
9122 version_expr_head_hash (const void *p
)
9124 const struct bfd_elf_version_expr
*e
=
9125 (const struct bfd_elf_version_expr
*) p
;
9127 return htab_hash_string (e
->pattern
);
9131 version_expr_head_eq (const void *p1
, const void *p2
)
9133 const struct bfd_elf_version_expr
*e1
=
9134 (const struct bfd_elf_version_expr
*) p1
;
9135 const struct bfd_elf_version_expr
*e2
=
9136 (const struct bfd_elf_version_expr
*) p2
;
9138 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
9142 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
9145 struct bfd_elf_version_expr
*e
, *next
;
9146 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
9148 for (e
= head
->list
; e
; e
= e
->next
)
9152 head
->mask
|= e
->mask
;
9157 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
9158 version_expr_head_eq
, NULL
);
9159 list_loc
= &head
->list
;
9160 remaining_loc
= &head
->remaining
;
9161 for (e
= head
->list
; e
; e
= next
)
9167 remaining_loc
= &e
->next
;
9171 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
9175 struct bfd_elf_version_expr
*e1
, *last
;
9177 e1
= (struct bfd_elf_version_expr
*) *loc
;
9181 if (e1
->mask
== e
->mask
)
9189 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
9193 /* This is a duplicate. */
9194 /* FIXME: Memory leak. Sometimes pattern is not
9195 xmalloced alone, but in larger chunk of memory. */
9196 /* free (e->pattern); */
9201 e
->next
= last
->next
;
9209 list_loc
= &e
->next
;
9213 *remaining_loc
= NULL
;
9214 *list_loc
= head
->remaining
;
9217 head
->remaining
= head
->list
;
9220 /* This is called when we know the name and dependencies of the
9224 lang_register_vers_node (const char *name
,
9225 struct bfd_elf_version_tree
*version
,
9226 struct bfd_elf_version_deps
*deps
)
9228 struct bfd_elf_version_tree
*t
, **pp
;
9229 struct bfd_elf_version_expr
*e1
;
9234 if (link_info
.version_info
!= NULL
9235 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
9237 einfo (_("%X%P: anonymous version tag cannot be combined"
9238 " with other version tags\n"));
9243 /* Make sure this node has a unique name. */
9244 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9245 if (strcmp (t
->name
, name
) == 0)
9246 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
9248 lang_finalize_version_expr_head (&version
->globals
);
9249 lang_finalize_version_expr_head (&version
->locals
);
9251 /* Check the global and local match names, and make sure there
9252 aren't any duplicates. */
9254 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
9256 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9258 struct bfd_elf_version_expr
*e2
;
9260 if (t
->locals
.htab
&& e1
->literal
)
9262 e2
= (struct bfd_elf_version_expr
*)
9263 htab_find ((htab_t
) t
->locals
.htab
, e1
);
9264 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9266 if (e1
->mask
== e2
->mask
)
9267 einfo (_("%X%P: duplicate expression `%s'"
9268 " in version information\n"), e1
->pattern
);
9272 else if (!e1
->literal
)
9273 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9274 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9275 && e1
->mask
== e2
->mask
)
9276 einfo (_("%X%P: duplicate expression `%s'"
9277 " in version information\n"), e1
->pattern
);
9281 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
9283 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9285 struct bfd_elf_version_expr
*e2
;
9287 if (t
->globals
.htab
&& e1
->literal
)
9289 e2
= (struct bfd_elf_version_expr
*)
9290 htab_find ((htab_t
) t
->globals
.htab
, e1
);
9291 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9293 if (e1
->mask
== e2
->mask
)
9294 einfo (_("%X%P: duplicate expression `%s'"
9295 " in version information\n"),
9300 else if (!e1
->literal
)
9301 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9302 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9303 && e1
->mask
== e2
->mask
)
9304 einfo (_("%X%P: duplicate expression `%s'"
9305 " in version information\n"), e1
->pattern
);
9309 version
->deps
= deps
;
9310 version
->name
= name
;
9311 if (name
[0] != '\0')
9314 version
->vernum
= version_index
;
9317 version
->vernum
= 0;
9319 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
9324 /* This is called when we see a version dependency. */
9326 struct bfd_elf_version_deps
*
9327 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
9329 struct bfd_elf_version_deps
*ret
;
9330 struct bfd_elf_version_tree
*t
;
9332 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
9335 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9337 if (strcmp (t
->name
, name
) == 0)
9339 ret
->version_needed
= t
;
9344 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
9346 ret
->version_needed
= NULL
;
9351 lang_do_version_exports_section (void)
9353 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
9355 LANG_FOR_EACH_INPUT_STATEMENT (is
)
9357 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
9365 contents
= (char *) xmalloc (len
);
9366 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
9367 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
9370 while (p
< contents
+ len
)
9372 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
9373 p
= strchr (p
, '\0') + 1;
9376 /* Do not free the contents, as we used them creating the regex. */
9378 /* Do not include this section in the link. */
9379 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
9382 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
9383 lang_register_vers_node (command_line
.version_exports_section
,
9384 lang_new_vers_node (greg
, lreg
), NULL
);
9387 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec. This is initially
9388 called with UPDATE_REGIONS_P set to FALSE, in this case no errors are
9389 thrown, however, references to symbols in the origin and length fields
9390 will be pushed into the symbol table, this allows PROVIDE statements to
9391 then provide these symbols. This function is called a second time with
9392 UPDATE_REGIONS_P set to TRUE, this time the we update the actual region
9393 data structures, and throw errors if missing symbols are encountered. */
9396 lang_do_memory_regions (bfd_boolean update_regions_p
)
9398 lang_memory_region_type
*r
= lang_memory_region_list
;
9400 for (; r
!= NULL
; r
= r
->next
)
9404 exp_fold_tree_no_dot (r
->origin_exp
);
9405 if (update_regions_p
)
9407 if (expld
.result
.valid_p
)
9409 r
->origin
= expld
.result
.value
;
9410 r
->current
= r
->origin
;
9413 einfo (_("%P: invalid origin for memory region %s\n"),
9419 exp_fold_tree_no_dot (r
->length_exp
);
9420 if (update_regions_p
)
9422 if (expld
.result
.valid_p
)
9423 r
->length
= expld
.result
.value
;
9425 einfo (_("%P: invalid length for memory region %s\n"),
9433 lang_add_unique (const char *name
)
9435 struct unique_sections
*ent
;
9437 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
9438 if (strcmp (ent
->name
, name
) == 0)
9441 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
9442 ent
->name
= xstrdup (name
);
9443 ent
->next
= unique_section_list
;
9444 unique_section_list
= ent
;
9447 /* Append the list of dynamic symbols to the existing one. */
9450 lang_append_dynamic_list (struct bfd_elf_dynamic_list
**list_p
,
9451 struct bfd_elf_version_expr
*dynamic
)
9455 struct bfd_elf_version_expr
*tail
;
9456 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
9458 tail
->next
= (*list_p
)->head
.list
;
9459 (*list_p
)->head
.list
= dynamic
;
9463 struct bfd_elf_dynamic_list
*d
;
9465 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
9466 d
->head
.list
= dynamic
;
9467 d
->match
= lang_vers_match
;
9472 /* Append the list of C++ typeinfo dynamic symbols to the existing
9476 lang_append_dynamic_list_cpp_typeinfo (void)
9478 const char *symbols
[] =
9480 "typeinfo name for*",
9483 struct bfd_elf_version_expr
*dynamic
= NULL
;
9486 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9487 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9490 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9493 /* Append the list of C++ operator new and delete dynamic symbols to the
9497 lang_append_dynamic_list_cpp_new (void)
9499 const char *symbols
[] =
9504 struct bfd_elf_version_expr
*dynamic
= NULL
;
9507 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9508 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9511 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9514 /* Scan a space and/or comma separated string of features. */
9517 lang_ld_feature (char *str
)
9525 while (*p
== ',' || ISSPACE (*p
))
9530 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
9534 if (strcasecmp (p
, "SANE_EXPR") == 0)
9535 config
.sane_expr
= TRUE
;
9537 einfo (_("%X%P: unknown feature `%s'\n"), p
);
9543 /* Pretty print memory amount. */
9546 lang_print_memory_size (bfd_vma sz
)
9548 if ((sz
& 0x3fffffff) == 0)
9549 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
9550 else if ((sz
& 0xfffff) == 0)
9551 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
9552 else if ((sz
& 0x3ff) == 0)
9553 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
9555 printf (" %10" BFD_VMA_FMT
"u B", sz
);
9558 /* Implement --print-memory-usage: disply per region memory usage. */
9561 lang_print_memory_usage (void)
9563 lang_memory_region_type
*r
;
9565 printf ("Memory region Used Size Region Size %%age Used\n");
9566 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
9568 bfd_vma used_length
= r
->current
- r
->origin
;
9570 printf ("%16s: ",r
->name_list
.name
);
9571 lang_print_memory_size (used_length
);
9572 lang_print_memory_size ((bfd_vma
) r
->length
);
9576 double percent
= used_length
* 100.0 / r
->length
;
9577 printf (" %6.2f%%", percent
);