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 static lang_statement_list_type
*stat_save
[10];
73 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
74 static struct unique_sections
*unique_section_list
;
75 static struct asneeded_minfo
*asneeded_list_head
;
76 static unsigned int opb_shift
= 0;
78 /* Forward declarations. */
79 static void exp_init_os (etree_type
*);
80 static lang_input_statement_type
*lookup_name (const char *);
81 static void insert_undefined (const char *);
82 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
83 static void print_statement (lang_statement_union_type
*,
84 lang_output_section_statement_type
*);
85 static void print_statement_list (lang_statement_union_type
*,
86 lang_output_section_statement_type
*);
87 static void print_statements (void);
88 static void print_input_section (asection
*, bfd_boolean
);
89 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
90 static void lang_record_phdrs (void);
91 static void lang_do_version_exports_section (void);
92 static void lang_finalize_version_expr_head
93 (struct bfd_elf_version_expr_head
*);
94 static void lang_do_memory_regions (bfd_boolean
);
96 /* Exported variables. */
97 const char *output_target
;
98 lang_output_section_statement_type
*abs_output_section
;
99 /* Header for list of statements corresponding to any files involved in the
100 link, either specified from the command-line or added implicitely (eg.
101 archive member used to resolved undefined symbol, wildcard statement from
102 linker script, etc.). Next pointer is in next field of a
103 lang_statement_header_type (reached via header field in a
104 lang_statement_union). */
105 lang_statement_list_type statement_list
;
106 lang_statement_list_type lang_os_list
;
107 lang_statement_list_type
*stat_ptr
= &statement_list
;
108 /* Header for list of statements corresponding to files used in the final
109 executable. This can be either object file specified on the command-line
110 or library member resolving an undefined reference. Next pointer is in next
111 field of a lang_input_statement_type (reached via input_statement field in a
112 lang_statement_union). */
113 lang_statement_list_type file_chain
= { NULL
, NULL
};
114 /* Header for list of statements corresponding to files specified on the
115 command-line for linking. It thus contains real object files and archive
116 but not archive members. Next pointer is in next_real_file field of a
117 lang_input_statement_type statement (reached via input_statement field in a
118 lang_statement_union). */
119 lang_statement_list_type input_file_chain
;
120 static const char *current_input_file
;
121 struct bfd_elf_dynamic_list
**current_dynamic_list_p
;
122 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
123 const char *entry_section
= ".text";
124 struct lang_input_statement_flags input_flags
;
125 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
;
585 node
->pattern
= ptr
->section_list
;
587 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
592 /* Convert a sorted sections' BST back to list form. */
595 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
596 lang_section_bst_type
*tree
,
600 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
602 lang_add_section (&ptr
->children
, tree
->section
, tree
->pattern
, NULL
,
603 (lang_output_section_statement_type
*) output
);
606 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
611 /* Specialized, optimized routines for handling different kinds of
615 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
616 lang_input_statement_type
*file
,
620 /* We can just do a hash lookup for the section with the right name.
621 But if that lookup discovers more than one section with the name
622 (should be rare), we fall back to the general algorithm because
623 we would otherwise have to sort the sections to make sure they
624 get processed in the bfd's order. */
625 bfd_boolean multiple_sections_found
;
626 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
627 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
629 if (multiple_sections_found
)
630 walk_wild_section_general (ptr
, file
, callback
, data
);
632 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
636 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
637 lang_input_statement_type
*file
,
642 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
644 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
646 const char *sname
= bfd_section_name (s
);
647 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
650 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
655 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
656 lang_input_statement_type
*file
,
661 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
662 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
663 bfd_boolean multiple_sections_found
;
664 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
666 if (multiple_sections_found
)
668 walk_wild_section_general (ptr
, file
, callback
, data
);
672 /* Note that if the section was not found, s0 is NULL and
673 we'll simply never succeed the s == s0 test below. */
674 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
676 /* Recall that in this code path, a section cannot satisfy more
677 than one spec, so if s == s0 then it cannot match
680 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
683 const char *sname
= bfd_section_name (s
);
684 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
687 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
694 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
695 lang_input_statement_type
*file
,
700 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
701 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
702 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
703 bfd_boolean multiple_sections_found
;
704 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
706 if (multiple_sections_found
)
708 walk_wild_section_general (ptr
, file
, callback
, data
);
712 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
715 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
718 const char *sname
= bfd_section_name (s
);
719 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
722 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
725 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
727 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
735 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
736 lang_input_statement_type
*file
,
741 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
742 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
743 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
744 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
745 bfd_boolean multiple_sections_found
;
746 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
748 if (multiple_sections_found
)
750 walk_wild_section_general (ptr
, file
, callback
, data
);
754 s1
= find_section (file
, sec1
, &multiple_sections_found
);
755 if (multiple_sections_found
)
757 walk_wild_section_general (ptr
, file
, callback
, data
);
761 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
764 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
767 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
770 const char *sname
= bfd_section_name (s
);
771 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
775 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
779 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
781 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
789 walk_wild_section (lang_wild_statement_type
*ptr
,
790 lang_input_statement_type
*file
,
794 if (file
->flags
.just_syms
)
797 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
800 /* Returns TRUE when name1 is a wildcard spec that might match
801 something name2 can match. We're conservative: we return FALSE
802 only if the prefixes of name1 and name2 are different up to the
803 first wildcard character. */
806 wild_spec_can_overlap (const char *name1
, const char *name2
)
808 size_t prefix1_len
= strcspn (name1
, "?*[");
809 size_t prefix2_len
= strcspn (name2
, "?*[");
810 size_t min_prefix_len
;
812 /* Note that if there is no wildcard character, then we treat the
813 terminating 0 as part of the prefix. Thus ".text" won't match
814 ".text." or ".text.*", for example. */
815 if (name1
[prefix1_len
] == '\0')
817 if (name2
[prefix2_len
] == '\0')
820 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
822 return memcmp (name1
, name2
, min_prefix_len
) == 0;
825 /* Select specialized code to handle various kinds of wildcard
829 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
832 int wild_name_count
= 0;
833 struct wildcard_list
*sec
;
837 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
838 ptr
->handler_data
[0] = NULL
;
839 ptr
->handler_data
[1] = NULL
;
840 ptr
->handler_data
[2] = NULL
;
841 ptr
->handler_data
[3] = NULL
;
844 /* Count how many wildcard_specs there are, and how many of those
845 actually use wildcards in the name. Also, bail out if any of the
846 wildcard names are NULL. (Can this actually happen?
847 walk_wild_section used to test for it.) And bail out if any
848 of the wildcards are more complex than a simple string
849 ending in a single '*'. */
850 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
853 if (sec
->spec
.name
== NULL
)
855 if (wildcardp (sec
->spec
.name
))
858 if (!is_simple_wild (sec
->spec
.name
))
863 /* The zero-spec case would be easy to optimize but it doesn't
864 happen in practice. Likewise, more than 4 specs doesn't
865 happen in practice. */
866 if (sec_count
== 0 || sec_count
> 4)
869 /* Check that no two specs can match the same section. */
870 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
872 struct wildcard_list
*sec2
;
873 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
875 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
880 signature
= (sec_count
<< 8) + wild_name_count
;
884 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
887 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
890 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
893 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
896 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
902 /* Now fill the data array with pointers to the specs, first the
903 specs with non-wildcard names, then the specs with wildcard
904 names. It's OK to process the specs in different order from the
905 given order, because we've already determined that no section
906 will match more than one spec. */
908 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
909 if (!wildcardp (sec
->spec
.name
))
910 ptr
->handler_data
[data_counter
++] = sec
;
911 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
912 if (wildcardp (sec
->spec
.name
))
913 ptr
->handler_data
[data_counter
++] = sec
;
916 /* Handle a wild statement for a single file F. */
919 walk_wild_file (lang_wild_statement_type
*s
,
920 lang_input_statement_type
*f
,
924 if (walk_wild_file_in_exclude_list (s
->exclude_name_list
, f
))
927 if (f
->the_bfd
== NULL
928 || !bfd_check_format (f
->the_bfd
, bfd_archive
))
929 walk_wild_section (s
, f
, callback
, data
);
934 /* This is an archive file. We must map each member of the
935 archive separately. */
936 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
937 while (member
!= NULL
)
939 /* When lookup_name is called, it will call the add_symbols
940 entry point for the archive. For each element of the
941 archive which is included, BFD will call ldlang_add_file,
942 which will set the usrdata field of the member to the
943 lang_input_statement. */
944 if (bfd_usrdata (member
) != NULL
)
945 walk_wild_section (s
, bfd_usrdata (member
), callback
, data
);
947 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
953 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
955 const char *file_spec
= s
->filename
;
958 if (file_spec
== NULL
)
960 /* Perform the iteration over all files in the list. */
961 LANG_FOR_EACH_INPUT_STATEMENT (f
)
963 walk_wild_file (s
, f
, callback
, data
);
966 else if ((p
= archive_path (file_spec
)) != NULL
)
968 LANG_FOR_EACH_INPUT_STATEMENT (f
)
970 if (input_statement_is_archive_path (file_spec
, p
, f
))
971 walk_wild_file (s
, f
, callback
, data
);
974 else if (wildcardp (file_spec
))
976 LANG_FOR_EACH_INPUT_STATEMENT (f
)
978 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
979 walk_wild_file (s
, f
, callback
, data
);
984 lang_input_statement_type
*f
;
986 /* Perform the iteration over a single file. */
987 f
= lookup_name (file_spec
);
989 walk_wild_file (s
, f
, callback
, data
);
993 /* lang_for_each_statement walks the parse tree and calls the provided
994 function for each node, except those inside output section statements
995 with constraint set to -1. */
998 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
999 lang_statement_union_type
*s
)
1001 for (; s
!= NULL
; s
= s
->header
.next
)
1005 switch (s
->header
.type
)
1007 case lang_constructors_statement_enum
:
1008 lang_for_each_statement_worker (func
, constructor_list
.head
);
1010 case lang_output_section_statement_enum
:
1011 if (s
->output_section_statement
.constraint
!= -1)
1012 lang_for_each_statement_worker
1013 (func
, s
->output_section_statement
.children
.head
);
1015 case lang_wild_statement_enum
:
1016 lang_for_each_statement_worker (func
,
1017 s
->wild_statement
.children
.head
);
1019 case lang_group_statement_enum
:
1020 lang_for_each_statement_worker (func
,
1021 s
->group_statement
.children
.head
);
1023 case lang_data_statement_enum
:
1024 case lang_reloc_statement_enum
:
1025 case lang_object_symbols_statement_enum
:
1026 case lang_output_statement_enum
:
1027 case lang_target_statement_enum
:
1028 case lang_input_section_enum
:
1029 case lang_input_statement_enum
:
1030 case lang_assignment_statement_enum
:
1031 case lang_padding_statement_enum
:
1032 case lang_address_statement_enum
:
1033 case lang_fill_statement_enum
:
1034 case lang_insert_statement_enum
:
1044 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
1046 lang_for_each_statement_worker (func
, statement_list
.head
);
1049 /*----------------------------------------------------------------------*/
1052 lang_list_init (lang_statement_list_type
*list
)
1055 list
->tail
= &list
->head
;
1059 lang_statement_append (lang_statement_list_type
*list
,
1063 *(list
->tail
) = element
;
1068 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1070 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1072 *stat_save_ptr
++ = stat_ptr
;
1079 if (stat_save_ptr
<= stat_save
)
1081 stat_ptr
= *--stat_save_ptr
;
1084 /* Build a new statement node for the parse tree. */
1086 static lang_statement_union_type
*
1087 new_statement (enum statement_enum type
,
1089 lang_statement_list_type
*list
)
1091 lang_statement_union_type
*new_stmt
;
1093 new_stmt
= stat_alloc (size
);
1094 new_stmt
->header
.type
= type
;
1095 new_stmt
->header
.next
= NULL
;
1096 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1100 /* Build a new input file node for the language. There are several
1101 ways in which we treat an input file, eg, we only look at symbols,
1102 or prefix it with a -l etc.
1104 We can be supplied with requests for input files more than once;
1105 they may, for example be split over several lines like foo.o(.text)
1106 foo.o(.data) etc, so when asked for a file we check that we haven't
1107 got it already so we don't duplicate the bfd. */
1109 static lang_input_statement_type
*
1110 new_afile (const char *name
,
1111 lang_input_file_enum_type file_type
,
1113 const char *from_filename
)
1115 lang_input_statement_type
*p
;
1117 lang_has_input_file
= TRUE
;
1119 p
= new_stat (lang_input_statement
, stat_ptr
);
1120 memset (&p
->the_bfd
, 0,
1121 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1122 p
->extra_search_path
= NULL
;
1124 p
->flags
.dynamic
= input_flags
.dynamic
;
1125 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1126 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1127 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1128 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1132 case lang_input_file_is_symbols_only_enum
:
1134 p
->local_sym_name
= name
;
1135 p
->flags
.real
= TRUE
;
1136 p
->flags
.just_syms
= TRUE
;
1138 case lang_input_file_is_fake_enum
:
1140 p
->local_sym_name
= name
;
1142 case lang_input_file_is_l_enum
:
1143 if (name
[0] == ':' && name
[1] != '\0')
1145 p
->filename
= name
+ 1;
1146 p
->flags
.full_name_provided
= TRUE
;
1150 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1151 p
->flags
.maybe_archive
= TRUE
;
1152 p
->flags
.real
= TRUE
;
1153 p
->flags
.search_dirs
= TRUE
;
1155 case lang_input_file_is_marker_enum
:
1157 p
->local_sym_name
= name
;
1158 p
->flags
.search_dirs
= TRUE
;
1160 case lang_input_file_is_search_file_enum
:
1162 p
->local_sym_name
= name
;
1163 /* If name is a relative path, search the directory of the current linker
1165 if (from_filename
&& !IS_ABSOLUTE_PATH (name
))
1166 p
->extra_search_path
= ldirname (from_filename
);
1167 p
->flags
.real
= TRUE
;
1168 p
->flags
.search_dirs
= TRUE
;
1170 case lang_input_file_is_file_enum
:
1172 p
->local_sym_name
= name
;
1173 p
->flags
.real
= TRUE
;
1179 lang_statement_append (&input_file_chain
, p
, &p
->next_real_file
);
1183 lang_input_statement_type
*
1184 lang_add_input_file (const char *name
,
1185 lang_input_file_enum_type file_type
,
1189 && (*name
== '=' || CONST_STRNEQ (name
, "$SYSROOT")))
1191 lang_input_statement_type
*ret
;
1192 char *sysrooted_name
1193 = concat (ld_sysroot
,
1194 name
+ (*name
== '=' ? 1 : strlen ("$SYSROOT")),
1195 (const char *) NULL
);
1197 /* We've now forcibly prepended the sysroot, making the input
1198 file independent of the context. Therefore, temporarily
1199 force a non-sysrooted context for this statement, so it won't
1200 get the sysroot prepended again when opened. (N.B. if it's a
1201 script, any child nodes with input files starting with "/"
1202 will be handled as "sysrooted" as they'll be found to be
1203 within the sysroot subdirectory.) */
1204 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1205 input_flags
.sysrooted
= 0;
1206 ret
= new_afile (sysrooted_name
, file_type
, target
, NULL
);
1207 input_flags
.sysrooted
= outer_sysrooted
;
1211 return new_afile (name
, file_type
, target
, current_input_file
);
1214 struct out_section_hash_entry
1216 struct bfd_hash_entry root
;
1217 lang_statement_union_type s
;
1220 /* The hash table. */
1222 static struct bfd_hash_table output_section_statement_table
;
1224 /* Support routines for the hash table used by lang_output_section_find,
1225 initialize the table, fill in an entry and remove the table. */
1227 static struct bfd_hash_entry
*
1228 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1229 struct bfd_hash_table
*table
,
1232 lang_output_section_statement_type
**nextp
;
1233 struct out_section_hash_entry
*ret
;
1237 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1243 entry
= bfd_hash_newfunc (entry
, table
, string
);
1247 ret
= (struct out_section_hash_entry
*) entry
;
1248 memset (&ret
->s
, 0, sizeof (ret
->s
));
1249 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1250 ret
->s
.output_section_statement
.subsection_alignment
= NULL
;
1251 ret
->s
.output_section_statement
.section_alignment
= NULL
;
1252 ret
->s
.output_section_statement
.block_value
= 1;
1253 lang_list_init (&ret
->s
.output_section_statement
.children
);
1254 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1256 /* For every output section statement added to the list, except the
1257 first one, lang_os_list.tail points to the "next"
1258 field of the last element of the list. */
1259 if (lang_os_list
.head
!= NULL
)
1260 ret
->s
.output_section_statement
.prev
1261 = ((lang_output_section_statement_type
*)
1262 ((char *) lang_os_list
.tail
1263 - offsetof (lang_output_section_statement_type
, next
)));
1265 /* GCC's strict aliasing rules prevent us from just casting the
1266 address, so we store the pointer in a variable and cast that
1268 nextp
= &ret
->s
.output_section_statement
.next
;
1269 lang_statement_append (&lang_os_list
, &ret
->s
, nextp
);
1274 output_section_statement_table_init (void)
1276 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1277 output_section_statement_newfunc
,
1278 sizeof (struct out_section_hash_entry
),
1280 einfo (_("%F%P: can not create hash table: %E\n"));
1284 output_section_statement_table_free (void)
1286 bfd_hash_table_free (&output_section_statement_table
);
1289 /* Build enough state so that the parser can build its tree. */
1294 obstack_begin (&stat_obstack
, 1000);
1296 stat_ptr
= &statement_list
;
1298 output_section_statement_table_init ();
1300 lang_list_init (stat_ptr
);
1302 lang_list_init (&input_file_chain
);
1303 lang_list_init (&lang_os_list
);
1304 lang_list_init (&file_chain
);
1305 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1307 abs_output_section
=
1308 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, 1);
1310 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1312 asneeded_list_head
= NULL
;
1313 asneeded_list_tail
= &asneeded_list_head
;
1319 output_section_statement_table_free ();
1322 /*----------------------------------------------------------------------
1323 A region is an area of memory declared with the
1324 MEMORY { name:org=exp, len=exp ... }
1327 We maintain a list of all the regions here.
1329 If no regions are specified in the script, then the default is used
1330 which is created when looked up to be the entire data space.
1332 If create is true we are creating a region inside a MEMORY block.
1333 In this case it is probably an error to create a region that has
1334 already been created. If we are not inside a MEMORY block it is
1335 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1336 and so we issue a warning.
1338 Each region has at least one name. The first name is either
1339 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1340 alias names to an existing region within a script with
1341 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1344 static lang_memory_region_type
*lang_memory_region_list
;
1345 static lang_memory_region_type
**lang_memory_region_list_tail
1346 = &lang_memory_region_list
;
1348 lang_memory_region_type
*
1349 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1351 lang_memory_region_name
*n
;
1352 lang_memory_region_type
*r
;
1353 lang_memory_region_type
*new_region
;
1355 /* NAME is NULL for LMA memspecs if no region was specified. */
1359 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1360 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1361 if (strcmp (n
->name
, name
) == 0)
1364 einfo (_("%P:%pS: warning: redeclaration of memory region `%s'\n"),
1369 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1370 einfo (_("%P:%pS: warning: memory region `%s' not declared\n"),
1373 new_region
= stat_alloc (sizeof (lang_memory_region_type
));
1375 new_region
->name_list
.name
= xstrdup (name
);
1376 new_region
->name_list
.next
= NULL
;
1377 new_region
->next
= NULL
;
1378 new_region
->origin_exp
= NULL
;
1379 new_region
->origin
= 0;
1380 new_region
->length_exp
= NULL
;
1381 new_region
->length
= ~(bfd_size_type
) 0;
1382 new_region
->current
= 0;
1383 new_region
->last_os
= NULL
;
1384 new_region
->flags
= 0;
1385 new_region
->not_flags
= 0;
1386 new_region
->had_full_message
= FALSE
;
1388 *lang_memory_region_list_tail
= new_region
;
1389 lang_memory_region_list_tail
= &new_region
->next
;
1395 lang_memory_region_alias (const char *alias
, const char *region_name
)
1397 lang_memory_region_name
*n
;
1398 lang_memory_region_type
*r
;
1399 lang_memory_region_type
*region
;
1401 /* The default region must be unique. This ensures that it is not necessary
1402 to iterate through the name list if someone wants the check if a region is
1403 the default memory region. */
1404 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1405 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1406 einfo (_("%F%P:%pS: error: alias for default memory region\n"), NULL
);
1408 /* Look for the target region and check if the alias is not already
1411 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1412 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1414 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1416 if (strcmp (n
->name
, alias
) == 0)
1417 einfo (_("%F%P:%pS: error: redefinition of memory region "
1422 /* Check if the target region exists. */
1424 einfo (_("%F%P:%pS: error: memory region `%s' "
1425 "for alias `%s' does not exist\n"),
1426 NULL
, region_name
, alias
);
1428 /* Add alias to region name list. */
1429 n
= stat_alloc (sizeof (lang_memory_region_name
));
1430 n
->name
= xstrdup (alias
);
1431 n
->next
= region
->name_list
.next
;
1432 region
->name_list
.next
= n
;
1435 static lang_memory_region_type
*
1436 lang_memory_default (asection
*section
)
1438 lang_memory_region_type
*p
;
1440 flagword sec_flags
= section
->flags
;
1442 /* Override SEC_DATA to mean a writable section. */
1443 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1444 sec_flags
|= SEC_DATA
;
1446 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1448 if ((p
->flags
& sec_flags
) != 0
1449 && (p
->not_flags
& sec_flags
) == 0)
1454 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1457 /* Get the output section statement directly from the userdata. */
1459 lang_output_section_statement_type
*
1460 lang_output_section_get (const asection
*output_section
)
1462 return bfd_section_userdata (output_section
);
1465 /* Find or create an output_section_statement with the given NAME.
1466 If CONSTRAINT is non-zero match one with that constraint, otherwise
1467 match any non-negative constraint. If CREATE is 0 return NULL when
1468 no match exists. If CREATE is 1, create an output_section_statement
1469 when no match exists or if CONSTRAINT is SPECIAL. If CREATE is 2,
1470 always make a new output_section_statement. */
1472 lang_output_section_statement_type
*
1473 lang_output_section_statement_lookup (const char *name
,
1477 struct out_section_hash_entry
*entry
;
1479 entry
= ((struct out_section_hash_entry
*)
1480 bfd_hash_lookup (&output_section_statement_table
, name
,
1481 create
!= 0, FALSE
));
1485 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1489 if (entry
->s
.output_section_statement
.name
!= NULL
)
1491 /* We have a section of this name, but it might not have the correct
1493 struct out_section_hash_entry
*last_ent
;
1495 name
= entry
->s
.output_section_statement
.name
;
1499 && !(create
&& constraint
== SPECIAL
)
1500 && (constraint
== entry
->s
.output_section_statement
.constraint
1502 && entry
->s
.output_section_statement
.constraint
>= 0)))
1503 return &entry
->s
.output_section_statement
;
1505 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1507 while (entry
!= NULL
1508 && name
== entry
->s
.output_section_statement
.name
);
1514 = ((struct out_section_hash_entry
*)
1515 output_section_statement_newfunc (NULL
,
1516 &output_section_statement_table
,
1520 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1523 entry
->root
= last_ent
->root
;
1524 last_ent
->root
.next
= &entry
->root
;
1527 entry
->s
.output_section_statement
.name
= name
;
1528 entry
->s
.output_section_statement
.constraint
= constraint
;
1529 entry
->s
.output_section_statement
.dup_output
= (create
== 2
1530 || constraint
== SPECIAL
);
1531 return &entry
->s
.output_section_statement
;
1534 /* Find the next output_section_statement with the same name as OS.
1535 If CONSTRAINT is non-zero, find one with that constraint otherwise
1536 match any non-negative constraint. */
1538 lang_output_section_statement_type
*
1539 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1542 /* All output_section_statements are actually part of a
1543 struct out_section_hash_entry. */
1544 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1546 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1547 const char *name
= os
->name
;
1549 ASSERT (name
== entry
->root
.string
);
1552 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1554 || name
!= entry
->s
.output_section_statement
.name
)
1557 while (constraint
!= entry
->s
.output_section_statement
.constraint
1559 || entry
->s
.output_section_statement
.constraint
< 0));
1561 return &entry
->s
.output_section_statement
;
1564 /* A variant of lang_output_section_find used by place_orphan.
1565 Returns the output statement that should precede a new output
1566 statement for SEC. If an exact match is found on certain flags,
1569 lang_output_section_statement_type
*
1570 lang_output_section_find_by_flags (const asection
*sec
,
1572 lang_output_section_statement_type
**exact
,
1573 lang_match_sec_type_func match_type
)
1575 lang_output_section_statement_type
*first
, *look
, *found
;
1576 flagword look_flags
, differ
;
1578 /* We know the first statement on this list is *ABS*. May as well
1580 first
= (void *) lang_os_list
.head
;
1581 first
= first
->next
;
1583 /* First try for an exact match. */
1585 for (look
= first
; look
; look
= look
->next
)
1587 look_flags
= look
->flags
;
1588 if (look
->bfd_section
!= NULL
)
1590 look_flags
= look
->bfd_section
->flags
;
1591 if (match_type
&& !match_type (link_info
.output_bfd
,
1596 differ
= look_flags
^ sec_flags
;
1597 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1598 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1608 if ((sec_flags
& SEC_CODE
) != 0
1609 && (sec_flags
& SEC_ALLOC
) != 0)
1611 /* Try for a rw code section. */
1612 for (look
= first
; look
; look
= look
->next
)
1614 look_flags
= look
->flags
;
1615 if (look
->bfd_section
!= NULL
)
1617 look_flags
= look
->bfd_section
->flags
;
1618 if (match_type
&& !match_type (link_info
.output_bfd
,
1623 differ
= look_flags
^ sec_flags
;
1624 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1625 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1629 else if ((sec_flags
& SEC_READONLY
) != 0
1630 && (sec_flags
& SEC_ALLOC
) != 0)
1632 /* .rodata can go after .text, .sdata2 after .rodata. */
1633 for (look
= first
; look
; look
= look
->next
)
1635 look_flags
= look
->flags
;
1636 if (look
->bfd_section
!= NULL
)
1638 look_flags
= look
->bfd_section
->flags
;
1639 if (match_type
&& !match_type (link_info
.output_bfd
,
1644 differ
= look_flags
^ sec_flags
;
1645 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1646 | SEC_READONLY
| SEC_SMALL_DATA
))
1647 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1649 && !(look_flags
& SEC_SMALL_DATA
)))
1653 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1654 && (sec_flags
& SEC_ALLOC
) != 0)
1656 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1657 as if it were a loaded section, and don't use match_type. */
1658 bfd_boolean seen_thread_local
= FALSE
;
1661 for (look
= first
; look
; look
= look
->next
)
1663 look_flags
= look
->flags
;
1664 if (look
->bfd_section
!= NULL
)
1665 look_flags
= look
->bfd_section
->flags
;
1667 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1668 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1670 /* .tdata and .tbss must be adjacent and in that order. */
1671 if (!(look_flags
& SEC_LOAD
)
1672 && (sec_flags
& SEC_LOAD
))
1673 /* ..so if we're at a .tbss section and we're placing
1674 a .tdata section stop looking and return the
1675 previous section. */
1678 seen_thread_local
= TRUE
;
1680 else if (seen_thread_local
)
1682 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1686 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1687 && (sec_flags
& SEC_ALLOC
) != 0)
1689 /* .sdata goes after .data, .sbss after .sdata. */
1690 for (look
= first
; look
; look
= look
->next
)
1692 look_flags
= look
->flags
;
1693 if (look
->bfd_section
!= NULL
)
1695 look_flags
= look
->bfd_section
->flags
;
1696 if (match_type
&& !match_type (link_info
.output_bfd
,
1701 differ
= look_flags
^ sec_flags
;
1702 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1703 | SEC_THREAD_LOCAL
))
1704 || ((look_flags
& SEC_SMALL_DATA
)
1705 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1709 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1710 && (sec_flags
& SEC_ALLOC
) != 0)
1712 /* .data goes after .rodata. */
1713 for (look
= first
; look
; look
= look
->next
)
1715 look_flags
= look
->flags
;
1716 if (look
->bfd_section
!= NULL
)
1718 look_flags
= look
->bfd_section
->flags
;
1719 if (match_type
&& !match_type (link_info
.output_bfd
,
1724 differ
= look_flags
^ sec_flags
;
1725 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1726 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1730 else if ((sec_flags
& SEC_ALLOC
) != 0)
1732 /* .bss goes after any other alloc section. */
1733 for (look
= first
; look
; look
= look
->next
)
1735 look_flags
= look
->flags
;
1736 if (look
->bfd_section
!= NULL
)
1738 look_flags
= look
->bfd_section
->flags
;
1739 if (match_type
&& !match_type (link_info
.output_bfd
,
1744 differ
= look_flags
^ sec_flags
;
1745 if (!(differ
& SEC_ALLOC
))
1751 /* non-alloc go last. */
1752 for (look
= first
; look
; look
= look
->next
)
1754 look_flags
= look
->flags
;
1755 if (look
->bfd_section
!= NULL
)
1756 look_flags
= look
->bfd_section
->flags
;
1757 differ
= look_flags
^ sec_flags
;
1758 if (!(differ
& SEC_DEBUGGING
))
1764 if (found
|| !match_type
)
1767 return lang_output_section_find_by_flags (sec
, sec_flags
, NULL
, NULL
);
1770 /* Find the last output section before given output statement.
1771 Used by place_orphan. */
1774 output_prev_sec_find (lang_output_section_statement_type
*os
)
1776 lang_output_section_statement_type
*lookup
;
1778 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1780 if (lookup
->constraint
< 0)
1783 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1784 return lookup
->bfd_section
;
1790 /* Look for a suitable place for a new output section statement. The
1791 idea is to skip over anything that might be inside a SECTIONS {}
1792 statement in a script, before we find another output section
1793 statement. Assignments to "dot" before an output section statement
1794 are assumed to belong to it, except in two cases; The first
1795 assignment to dot, and assignments before non-alloc sections.
1796 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1797 similar assignments that set the initial address, or we might
1798 insert non-alloc note sections among assignments setting end of
1801 static lang_statement_union_type
**
1802 insert_os_after (lang_output_section_statement_type
*after
)
1804 lang_statement_union_type
**where
;
1805 lang_statement_union_type
**assign
= NULL
;
1806 bfd_boolean ignore_first
;
1808 ignore_first
= after
== (void *) lang_os_list
.head
;
1810 for (where
= &after
->header
.next
;
1812 where
= &(*where
)->header
.next
)
1814 switch ((*where
)->header
.type
)
1816 case lang_assignment_statement_enum
:
1819 lang_assignment_statement_type
*ass
;
1821 ass
= &(*where
)->assignment_statement
;
1822 if (ass
->exp
->type
.node_class
!= etree_assert
1823 && ass
->exp
->assign
.dst
[0] == '.'
1824 && ass
->exp
->assign
.dst
[1] == 0)
1828 ignore_first
= FALSE
;
1832 case lang_wild_statement_enum
:
1833 case lang_input_section_enum
:
1834 case lang_object_symbols_statement_enum
:
1835 case lang_fill_statement_enum
:
1836 case lang_data_statement_enum
:
1837 case lang_reloc_statement_enum
:
1838 case lang_padding_statement_enum
:
1839 case lang_constructors_statement_enum
:
1841 ignore_first
= FALSE
;
1843 case lang_output_section_statement_enum
:
1846 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1849 || s
->map_head
.s
== NULL
1850 || (s
->flags
& SEC_ALLOC
) != 0)
1854 case lang_input_statement_enum
:
1855 case lang_address_statement_enum
:
1856 case lang_target_statement_enum
:
1857 case lang_output_statement_enum
:
1858 case lang_group_statement_enum
:
1859 case lang_insert_statement_enum
:
1868 lang_output_section_statement_type
*
1869 lang_insert_orphan (asection
*s
,
1870 const char *secname
,
1872 lang_output_section_statement_type
*after
,
1873 struct orphan_save
*place
,
1874 etree_type
*address
,
1875 lang_statement_list_type
*add_child
)
1877 lang_statement_list_type add
;
1878 lang_output_section_statement_type
*os
;
1879 lang_output_section_statement_type
**os_tail
;
1881 /* If we have found an appropriate place for the output section
1882 statements for this orphan, add them to our own private list,
1883 inserting them later into the global statement list. */
1886 lang_list_init (&add
);
1887 push_stat_ptr (&add
);
1890 if (bfd_link_relocatable (&link_info
)
1891 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1892 address
= exp_intop (0);
1894 os_tail
= (lang_output_section_statement_type
**) lang_os_list
.tail
;
1895 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1896 NULL
, NULL
, NULL
, constraint
, 0);
1898 if (add_child
== NULL
)
1899 add_child
= &os
->children
;
1900 lang_add_section (add_child
, s
, NULL
, NULL
, os
);
1902 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1904 const char *region
= (after
->region
1905 ? after
->region
->name_list
.name
1906 : DEFAULT_MEMORY_REGION
);
1907 const char *lma_region
= (after
->lma_region
1908 ? after
->lma_region
->name_list
.name
1910 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1914 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1917 /* Restore the global list pointer. */
1921 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1923 asection
*snew
, *as
;
1924 bfd_boolean place_after
= place
->stmt
== NULL
;
1925 bfd_boolean insert_after
= TRUE
;
1927 snew
= os
->bfd_section
;
1929 /* Shuffle the bfd section list to make the output file look
1930 neater. This is really only cosmetic. */
1931 if (place
->section
== NULL
1932 && after
!= (void *) lang_os_list
.head
)
1934 asection
*bfd_section
= after
->bfd_section
;
1936 /* If the output statement hasn't been used to place any input
1937 sections (and thus doesn't have an output bfd_section),
1938 look for the closest prior output statement having an
1940 if (bfd_section
== NULL
)
1941 bfd_section
= output_prev_sec_find (after
);
1943 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1944 place
->section
= &bfd_section
->next
;
1947 if (place
->section
== NULL
)
1948 place
->section
= &link_info
.output_bfd
->sections
;
1950 as
= *place
->section
;
1954 /* Put the section at the end of the list. */
1956 /* Unlink the section. */
1957 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1959 /* Now tack it back on in the right place. */
1960 bfd_section_list_append (link_info
.output_bfd
, snew
);
1962 else if ((bfd_get_flavour (link_info
.output_bfd
)
1963 == bfd_target_elf_flavour
)
1964 && (bfd_get_flavour (s
->owner
)
1965 == bfd_target_elf_flavour
)
1966 && ((elf_section_type (s
) == SHT_NOTE
1967 && (s
->flags
& SEC_LOAD
) != 0)
1968 || (elf_section_type (as
) == SHT_NOTE
1969 && (as
->flags
& SEC_LOAD
) != 0)))
1971 /* Make sure that output note sections are grouped and sorted
1972 by alignments when inserting a note section or insert a
1973 section after a note section, */
1975 /* A specific section after which the output note section
1976 should be placed. */
1977 asection
*after_sec
;
1978 /* True if we need to insert the orphan section after a
1979 specific section to maintain output note section order. */
1980 bfd_boolean after_sec_note
= FALSE
;
1982 static asection
*first_orphan_note
= NULL
;
1984 /* Group and sort output note section by alignments in
1987 if (elf_section_type (s
) == SHT_NOTE
1988 && (s
->flags
& SEC_LOAD
) != 0)
1990 /* Search from the beginning for the last output note
1991 section with equal or larger alignments. NB: Don't
1992 place orphan note section after non-note sections. */
1994 first_orphan_note
= NULL
;
1995 for (sec
= link_info
.output_bfd
->sections
;
1997 && !bfd_is_abs_section (sec
));
2000 && elf_section_type (sec
) == SHT_NOTE
2001 && (sec
->flags
& SEC_LOAD
) != 0)
2003 if (!first_orphan_note
)
2004 first_orphan_note
= sec
;
2005 if (sec
->alignment_power
>= s
->alignment_power
)
2008 else if (first_orphan_note
)
2010 /* Stop if there is non-note section after the first
2011 orphan note section. */
2015 /* If this will be the first orphan note section, it can
2016 be placed at the default location. */
2017 after_sec_note
= first_orphan_note
!= NULL
;
2018 if (after_sec
== NULL
&& after_sec_note
)
2020 /* If all output note sections have smaller
2021 alignments, place the section before all
2022 output orphan note sections. */
2023 after_sec
= first_orphan_note
;
2024 insert_after
= FALSE
;
2027 else if (first_orphan_note
)
2029 /* Don't place non-note sections in the middle of orphan
2031 after_sec_note
= TRUE
;
2033 for (sec
= as
->next
;
2035 && !bfd_is_abs_section (sec
));
2037 if (elf_section_type (sec
) == SHT_NOTE
2038 && (sec
->flags
& SEC_LOAD
) != 0)
2046 /* Search forward to insert OS after AFTER_SEC output
2048 lang_output_section_statement_type
*stmt
, *next
;
2049 bfd_boolean found
= FALSE
;
2050 for (stmt
= after
; stmt
!= NULL
; stmt
= next
)
2055 if (stmt
->bfd_section
== after_sec
)
2065 /* If INSERT_AFTER is FALSE, place OS before
2066 AFTER_SEC output statement. */
2067 if (next
&& next
->bfd_section
== after_sec
)
2077 /* Search backward to insert OS after AFTER_SEC output
2080 for (stmt
= after
; stmt
!= NULL
; stmt
= stmt
->prev
)
2084 if (stmt
->bfd_section
== after_sec
)
2093 /* If INSERT_AFTER is FALSE, place OS before
2094 AFTER_SEC output statement. */
2095 if (stmt
->next
->bfd_section
== after_sec
)
2105 if (after_sec
== NULL
2106 || (insert_after
&& after_sec
->next
!= snew
)
2107 || (!insert_after
&& after_sec
->prev
!= snew
))
2109 /* Unlink the section. */
2110 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2112 /* Place SNEW after AFTER_SEC. If AFTER_SEC is NULL,
2117 bfd_section_list_insert_after (link_info
.output_bfd
,
2120 bfd_section_list_insert_before (link_info
.output_bfd
,
2124 bfd_section_list_prepend (link_info
.output_bfd
, snew
);
2127 else if (as
!= snew
&& as
->prev
!= snew
)
2129 /* Unlink the section. */
2130 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2132 /* Now tack it back on in the right place. */
2133 bfd_section_list_insert_before (link_info
.output_bfd
,
2137 else if (as
!= snew
&& as
->prev
!= snew
)
2139 /* Unlink the section. */
2140 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2142 /* Now tack it back on in the right place. */
2143 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
2146 /* Save the end of this list. Further ophans of this type will
2147 follow the one we've just added. */
2148 place
->section
= &snew
->next
;
2150 /* The following is non-cosmetic. We try to put the output
2151 statements in some sort of reasonable order here, because they
2152 determine the final load addresses of the orphan sections.
2153 In addition, placing output statements in the wrong order may
2154 require extra segments. For instance, given a typical
2155 situation of all read-only sections placed in one segment and
2156 following that a segment containing all the read-write
2157 sections, we wouldn't want to place an orphan read/write
2158 section before or amongst the read-only ones. */
2159 if (add
.head
!= NULL
)
2161 lang_output_section_statement_type
*newly_added_os
;
2163 /* Place OS after AFTER if AFTER_NOTE is TRUE. */
2166 lang_statement_union_type
**where
= insert_os_after (after
);
2171 place
->os_tail
= &after
->next
;
2175 /* Put it after the last orphan statement we added. */
2176 *add
.tail
= *place
->stmt
;
2177 *place
->stmt
= add
.head
;
2180 /* Fix the global list pointer if we happened to tack our
2181 new list at the tail. */
2182 if (*stat_ptr
->tail
== add
.head
)
2183 stat_ptr
->tail
= add
.tail
;
2185 /* Save the end of this list. */
2186 place
->stmt
= add
.tail
;
2188 /* Do the same for the list of output section statements. */
2189 newly_added_os
= *os_tail
;
2191 newly_added_os
->prev
= (lang_output_section_statement_type
*)
2192 ((char *) place
->os_tail
2193 - offsetof (lang_output_section_statement_type
, next
));
2194 newly_added_os
->next
= *place
->os_tail
;
2195 if (newly_added_os
->next
!= NULL
)
2196 newly_added_os
->next
->prev
= newly_added_os
;
2197 *place
->os_tail
= newly_added_os
;
2198 place
->os_tail
= &newly_added_os
->next
;
2200 /* Fixing the global list pointer here is a little different.
2201 We added to the list in lang_enter_output_section_statement,
2202 trimmed off the new output_section_statment above when
2203 assigning *os_tail = NULL, but possibly added it back in
2204 the same place when assigning *place->os_tail. */
2205 if (*os_tail
== NULL
)
2206 lang_os_list
.tail
= (lang_statement_union_type
**) os_tail
;
2213 lang_print_asneeded (void)
2215 struct asneeded_minfo
*m
;
2217 if (asneeded_list_head
== NULL
)
2220 minfo (_("\nAs-needed library included to satisfy reference by file (symbol)\n\n"));
2222 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2226 minfo ("%s", m
->soname
);
2227 len
= strlen (m
->soname
);
2241 minfo ("%pB ", m
->ref
);
2242 minfo ("(%pT)\n", m
->name
);
2247 lang_map_flags (flagword flag
)
2249 if (flag
& SEC_ALLOC
)
2252 if (flag
& SEC_CODE
)
2255 if (flag
& SEC_READONLY
)
2258 if (flag
& SEC_DATA
)
2261 if (flag
& SEC_LOAD
)
2268 lang_memory_region_type
*m
;
2269 bfd_boolean dis_header_printed
= FALSE
;
2271 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2275 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2276 || file
->flags
.just_syms
)
2279 if (config
.print_map_discarded
)
2280 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2281 if ((s
->output_section
== NULL
2282 || s
->output_section
->owner
!= link_info
.output_bfd
)
2283 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2285 if (! dis_header_printed
)
2287 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2288 dis_header_printed
= TRUE
;
2291 print_input_section (s
, TRUE
);
2295 minfo (_("\nMemory Configuration\n\n"));
2296 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2297 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2299 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2304 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2306 sprintf_vma (buf
, m
->origin
);
2307 minfo ("0x%s ", buf
);
2315 minfo ("0x%V", m
->length
);
2316 if (m
->flags
|| m
->not_flags
)
2324 lang_map_flags (m
->flags
);
2330 lang_map_flags (m
->not_flags
);
2337 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2339 if (!link_info
.reduce_memory_overheads
)
2341 obstack_begin (&map_obstack
, 1000);
2342 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2344 expld
.phase
= lang_fixed_phase_enum
;
2345 lang_statement_iteration
++;
2346 print_statements ();
2348 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
,
2353 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2354 void *info ATTRIBUTE_UNUSED
)
2356 if ((hash_entry
->type
== bfd_link_hash_defined
2357 || hash_entry
->type
== bfd_link_hash_defweak
)
2358 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2359 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2361 input_section_userdata_type
*ud
;
2362 struct map_symbol_def
*def
;
2364 ud
= bfd_section_userdata (hash_entry
->u
.def
.section
);
2367 ud
= stat_alloc (sizeof (*ud
));
2368 bfd_set_section_userdata (hash_entry
->u
.def
.section
, ud
);
2369 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2370 ud
->map_symbol_def_count
= 0;
2372 else if (!ud
->map_symbol_def_tail
)
2373 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2375 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2376 def
->entry
= hash_entry
;
2377 *(ud
->map_symbol_def_tail
) = def
;
2378 ud
->map_symbol_def_tail
= &def
->next
;
2379 ud
->map_symbol_def_count
++;
2384 /* Initialize an output section. */
2387 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2389 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2390 einfo (_("%F%P: illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2393 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2394 if (s
->bfd_section
== NULL
)
2395 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2397 if (s
->bfd_section
== NULL
)
2399 einfo (_("%F%P: output format %s cannot represent section"
2400 " called %s: %E\n"),
2401 link_info
.output_bfd
->xvec
->name
, s
->name
);
2403 s
->bfd_section
->output_section
= s
->bfd_section
;
2404 s
->bfd_section
->output_offset
= 0;
2406 /* Set the userdata of the output section to the output section
2407 statement to avoid lookup. */
2408 bfd_set_section_userdata (s
->bfd_section
, s
);
2410 /* If there is a base address, make sure that any sections it might
2411 mention are initialized. */
2412 if (s
->addr_tree
!= NULL
)
2413 exp_init_os (s
->addr_tree
);
2415 if (s
->load_base
!= NULL
)
2416 exp_init_os (s
->load_base
);
2418 /* If supplied an alignment, set it. */
2419 if (s
->section_alignment
!= NULL
)
2420 s
->bfd_section
->alignment_power
= exp_get_power (s
->section_alignment
,
2421 "section alignment");
2424 /* Make sure that all output sections mentioned in an expression are
2428 exp_init_os (etree_type
*exp
)
2430 switch (exp
->type
.node_class
)
2434 case etree_provided
:
2435 exp_init_os (exp
->assign
.src
);
2439 exp_init_os (exp
->binary
.lhs
);
2440 exp_init_os (exp
->binary
.rhs
);
2444 exp_init_os (exp
->trinary
.cond
);
2445 exp_init_os (exp
->trinary
.lhs
);
2446 exp_init_os (exp
->trinary
.rhs
);
2450 exp_init_os (exp
->assert_s
.child
);
2454 exp_init_os (exp
->unary
.child
);
2458 switch (exp
->type
.node_code
)
2464 lang_output_section_statement_type
*os
;
2466 os
= lang_output_section_find (exp
->name
.name
);
2467 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2479 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2481 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2483 /* If we are only reading symbols from this object, then we want to
2484 discard all sections. */
2485 if (entry
->flags
.just_syms
)
2487 bfd_link_just_syms (abfd
, sec
, &link_info
);
2491 /* Deal with SHF_EXCLUDE ELF sections. */
2492 if (!bfd_link_relocatable (&link_info
)
2493 && (abfd
->flags
& BFD_PLUGIN
) == 0
2494 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2495 sec
->output_section
= bfd_abs_section_ptr
;
2497 if (!(abfd
->flags
& DYNAMIC
))
2498 bfd_section_already_linked (abfd
, sec
, &link_info
);
2502 /* Returns true if SECTION is one we know will be discarded based on its
2503 section flags, otherwise returns false. */
2506 lang_discard_section_p (asection
*section
)
2508 bfd_boolean discard
;
2509 flagword flags
= section
->flags
;
2511 /* Discard sections marked with SEC_EXCLUDE. */
2512 discard
= (flags
& SEC_EXCLUDE
) != 0;
2514 /* Discard the group descriptor sections when we're finally placing the
2515 sections from within the group. */
2516 if ((flags
& SEC_GROUP
) != 0
2517 && link_info
.resolve_section_groups
)
2520 /* Discard debugging sections if we are stripping debugging
2522 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2523 && (flags
& SEC_DEBUGGING
) != 0)
2529 /* The wild routines.
2531 These expand statements like *(.text) and foo.o to a list of
2532 explicit actions, like foo.o(.text), bar.o(.text) and
2533 foo.o(.text, .data). */
2535 /* Add SECTION to the output section OUTPUT. Do this by creating a
2536 lang_input_section statement which is placed at PTR. */
2539 lang_add_section (lang_statement_list_type
*ptr
,
2541 struct wildcard_list
*pattern
,
2542 struct flag_info
*sflag_info
,
2543 lang_output_section_statement_type
*output
)
2545 flagword flags
= section
->flags
;
2547 bfd_boolean discard
;
2548 lang_input_section_type
*new_section
;
2549 bfd
*abfd
= link_info
.output_bfd
;
2551 /* Is this section one we know should be discarded? */
2552 discard
= lang_discard_section_p (section
);
2554 /* Discard input sections which are assigned to a section named
2555 DISCARD_SECTION_NAME. */
2556 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2561 if (section
->output_section
== NULL
)
2563 /* This prevents future calls from assigning this section. */
2564 section
->output_section
= bfd_abs_section_ptr
;
2566 else if (link_info
.non_contiguous_regions_warnings
)
2567 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions makes "
2568 "section `%pA' from '%pB' match /DISCARD/ clause.\n"),
2569 NULL
, section
, section
->owner
);
2578 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2583 if (section
->output_section
!= NULL
)
2585 if (!link_info
.non_contiguous_regions
)
2588 /* SECTION has already been handled in a special way
2589 (eg. LINK_ONCE): skip it. */
2590 if (bfd_is_abs_section (section
->output_section
))
2593 /* Already assigned to the same output section, do not process
2594 it again, to avoid creating loops between duplicate sections
2596 if (section
->output_section
== output
->bfd_section
)
2599 if (link_info
.non_contiguous_regions_warnings
&& output
->bfd_section
)
2600 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions may "
2601 "change behaviour for section `%pA' from '%pB' (assigned to "
2602 "%pA, but additional match: %pA)\n"),
2603 NULL
, section
, section
->owner
, section
->output_section
,
2604 output
->bfd_section
);
2606 /* SECTION has already been assigned to an output section, but
2607 the user allows it to be mapped to another one in case it
2608 overflows. We'll later update the actual output section in
2609 size_input_section as appropriate. */
2612 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2613 to an output section, because we want to be able to include a
2614 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2615 section (I don't know why we want to do this, but we do).
2616 build_link_order in ldwrite.c handles this case by turning
2617 the embedded SEC_NEVER_LOAD section into a fill. */
2618 flags
&= ~ SEC_NEVER_LOAD
;
2620 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2621 already been processed. One reason to do this is that on pe
2622 format targets, .text$foo sections go into .text and it's odd
2623 to see .text with SEC_LINK_ONCE set. */
2624 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2626 if (link_info
.resolve_section_groups
)
2627 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2629 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2631 else if (!bfd_link_relocatable (&link_info
))
2632 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2634 switch (output
->sectype
)
2636 case normal_section
:
2637 case overlay_section
:
2638 case first_overlay_section
:
2640 case noalloc_section
:
2641 flags
&= ~SEC_ALLOC
;
2643 case noload_section
:
2645 flags
|= SEC_NEVER_LOAD
;
2646 /* Unfortunately GNU ld has managed to evolve two different
2647 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2648 alloc, no contents section. All others get a noload, noalloc
2650 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2651 flags
&= ~SEC_HAS_CONTENTS
;
2653 flags
&= ~SEC_ALLOC
;
2657 if (output
->bfd_section
== NULL
)
2658 init_os (output
, flags
);
2660 /* If SEC_READONLY is not set in the input section, then clear
2661 it from the output section. */
2662 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2664 if (output
->bfd_section
->linker_has_input
)
2666 /* Only set SEC_READONLY flag on the first input section. */
2667 flags
&= ~ SEC_READONLY
;
2669 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2670 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2671 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2672 || ((flags
& SEC_MERGE
) != 0
2673 && output
->bfd_section
->entsize
!= section
->entsize
))
2675 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2676 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2679 output
->bfd_section
->flags
|= flags
;
2681 if (!output
->bfd_section
->linker_has_input
)
2683 output
->bfd_section
->linker_has_input
= 1;
2684 /* This must happen after flags have been updated. The output
2685 section may have been created before we saw its first input
2686 section, eg. for a data statement. */
2687 bfd_init_private_section_data (section
->owner
, section
,
2688 link_info
.output_bfd
,
2689 output
->bfd_section
,
2691 if ((flags
& SEC_MERGE
) != 0)
2692 output
->bfd_section
->entsize
= section
->entsize
;
2695 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2696 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2698 /* FIXME: This value should really be obtained from the bfd... */
2699 output
->block_value
= 128;
2702 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2703 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2705 section
->output_section
= output
->bfd_section
;
2707 if (!map_head_is_link_order
)
2709 asection
*s
= output
->bfd_section
->map_tail
.s
;
2710 output
->bfd_section
->map_tail
.s
= section
;
2711 section
->map_head
.s
= NULL
;
2712 section
->map_tail
.s
= s
;
2714 s
->map_head
.s
= section
;
2716 output
->bfd_section
->map_head
.s
= section
;
2719 /* Add a section reference to the list. */
2720 new_section
= new_stat (lang_input_section
, ptr
);
2721 new_section
->section
= section
;
2722 new_section
->pattern
= pattern
;
2725 /* Handle wildcard sorting. This returns the lang_input_section which
2726 should follow the one we are going to create for SECTION and FILE,
2727 based on the sorting requirements of WILD. It returns NULL if the
2728 new section should just go at the end of the current list. */
2730 static lang_statement_union_type
*
2731 wild_sort (lang_wild_statement_type
*wild
,
2732 struct wildcard_list
*sec
,
2733 lang_input_statement_type
*file
,
2736 lang_statement_union_type
*l
;
2738 if (!wild
->filenames_sorted
2739 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2742 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2744 lang_input_section_type
*ls
;
2746 if (l
->header
.type
!= lang_input_section_enum
)
2748 ls
= &l
->input_section
;
2750 /* Sorting by filename takes precedence over sorting by section
2753 if (wild
->filenames_sorted
)
2755 const char *fn
, *ln
;
2759 /* The PE support for the .idata section as generated by
2760 dlltool assumes that files will be sorted by the name of
2761 the archive and then the name of the file within the
2764 if (file
->the_bfd
!= NULL
2765 && file
->the_bfd
->my_archive
!= NULL
)
2767 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2772 fn
= file
->filename
;
2776 if (ls
->section
->owner
->my_archive
!= NULL
)
2778 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2783 ln
= bfd_get_filename (ls
->section
->owner
);
2787 i
= filename_cmp (fn
, ln
);
2796 fn
= file
->filename
;
2798 ln
= bfd_get_filename (ls
->section
->owner
);
2800 i
= filename_cmp (fn
, ln
);
2808 /* Here either the files are not sorted by name, or we are
2809 looking at the sections for this file. */
2812 && sec
->spec
.sorted
!= none
2813 && sec
->spec
.sorted
!= by_none
)
2814 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2821 /* Expand a wild statement for a particular FILE. SECTION may be
2822 NULL, in which case it is a wild card. */
2825 output_section_callback (lang_wild_statement_type
*ptr
,
2826 struct wildcard_list
*sec
,
2828 lang_input_statement_type
*file
,
2831 lang_statement_union_type
*before
;
2832 lang_output_section_statement_type
*os
;
2834 os
= (lang_output_section_statement_type
*) output
;
2836 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2837 if (unique_section_p (section
, os
))
2840 before
= wild_sort (ptr
, sec
, file
, section
);
2842 /* Here BEFORE points to the lang_input_section which
2843 should follow the one we are about to add. If BEFORE
2844 is NULL, then the section should just go at the end
2845 of the current list. */
2848 lang_add_section (&ptr
->children
, section
, ptr
->section_list
,
2849 ptr
->section_flag_list
, os
);
2852 lang_statement_list_type list
;
2853 lang_statement_union_type
**pp
;
2855 lang_list_init (&list
);
2856 lang_add_section (&list
, section
, ptr
->section_list
,
2857 ptr
->section_flag_list
, os
);
2859 /* If we are discarding the section, LIST.HEAD will
2861 if (list
.head
!= NULL
)
2863 ASSERT (list
.head
->header
.next
== NULL
);
2865 for (pp
= &ptr
->children
.head
;
2867 pp
= &(*pp
)->header
.next
)
2868 ASSERT (*pp
!= NULL
);
2870 list
.head
->header
.next
= *pp
;
2876 /* Check if all sections in a wild statement for a particular FILE
2880 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2881 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2883 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2886 lang_output_section_statement_type
*os
;
2888 os
= (lang_output_section_statement_type
*) output
;
2890 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2891 if (unique_section_p (section
, os
))
2894 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2895 os
->all_input_readonly
= FALSE
;
2898 /* This is passed a file name which must have been seen already and
2899 added to the statement tree. We will see if it has been opened
2900 already and had its symbols read. If not then we'll read it. */
2902 static lang_input_statement_type
*
2903 lookup_name (const char *name
)
2905 lang_input_statement_type
*search
;
2907 for (search
= (void *) input_file_chain
.head
;
2909 search
= search
->next_real_file
)
2911 /* Use the local_sym_name as the name of the file that has
2912 already been loaded as filename might have been transformed
2913 via the search directory lookup mechanism. */
2914 const char *filename
= search
->local_sym_name
;
2916 if (filename
!= NULL
2917 && filename_cmp (filename
, name
) == 0)
2923 /* Arrange to splice the input statement added by new_afile into
2924 statement_list after the current input_file_chain tail.
2925 We know input_file_chain is not an empty list, and that
2926 lookup_name was called via open_input_bfds. Later calls to
2927 lookup_name should always match an existing input_statement. */
2928 lang_statement_union_type
**tail
= stat_ptr
->tail
;
2929 lang_statement_union_type
**after
2930 = (void *) ((char *) input_file_chain
.tail
2931 - offsetof (lang_input_statement_type
, next_real_file
)
2932 + offsetof (lang_input_statement_type
, header
.next
));
2933 lang_statement_union_type
*rest
= *after
;
2934 stat_ptr
->tail
= after
;
2935 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2936 default_target
, NULL
);
2937 *stat_ptr
->tail
= rest
;
2939 stat_ptr
->tail
= tail
;
2942 /* If we have already added this file, or this file is not real
2943 don't add this file. */
2944 if (search
->flags
.loaded
|| !search
->flags
.real
)
2947 if (!load_symbols (search
, NULL
))
2953 /* Save LIST as a list of libraries whose symbols should not be exported. */
2958 struct excluded_lib
*next
;
2960 static struct excluded_lib
*excluded_libs
;
2963 add_excluded_libs (const char *list
)
2965 const char *p
= list
, *end
;
2969 struct excluded_lib
*entry
;
2970 end
= strpbrk (p
, ",:");
2972 end
= p
+ strlen (p
);
2973 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2974 entry
->next
= excluded_libs
;
2975 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2976 memcpy (entry
->name
, p
, end
- p
);
2977 entry
->name
[end
- p
] = '\0';
2978 excluded_libs
= entry
;
2986 check_excluded_libs (bfd
*abfd
)
2988 struct excluded_lib
*lib
= excluded_libs
;
2992 int len
= strlen (lib
->name
);
2993 const char *filename
= lbasename (bfd_get_filename (abfd
));
2995 if (strcmp (lib
->name
, "ALL") == 0)
2997 abfd
->no_export
= TRUE
;
3001 if (filename_ncmp (lib
->name
, filename
, len
) == 0
3002 && (filename
[len
] == '\0'
3003 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
3004 && filename
[len
+ 2] == '\0')))
3006 abfd
->no_export
= TRUE
;
3014 /* Get the symbols for an input file. */
3017 load_symbols (lang_input_statement_type
*entry
,
3018 lang_statement_list_type
*place
)
3022 if (entry
->flags
.loaded
)
3025 ldfile_open_file (entry
);
3027 /* Do not process further if the file was missing. */
3028 if (entry
->flags
.missing_file
)
3031 if (trace_files
|| verbose
)
3032 info_msg ("%pI\n", entry
);
3034 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
3035 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
3038 struct lang_input_statement_flags save_flags
;
3041 err
= bfd_get_error ();
3043 /* See if the emulation has some special knowledge. */
3044 if (ldemul_unrecognized_file (entry
))
3047 if (err
== bfd_error_file_ambiguously_recognized
)
3051 einfo (_("%P: %pB: file not recognized: %E;"
3052 " matching formats:"), entry
->the_bfd
);
3053 for (p
= matching
; *p
!= NULL
; p
++)
3057 else if (err
!= bfd_error_file_not_recognized
3059 einfo (_("%F%P: %pB: file not recognized: %E\n"), entry
->the_bfd
);
3061 bfd_close (entry
->the_bfd
);
3062 entry
->the_bfd
= NULL
;
3064 /* Try to interpret the file as a linker script. */
3065 save_flags
= input_flags
;
3066 ldfile_open_command_file (entry
->filename
);
3068 push_stat_ptr (place
);
3069 input_flags
.add_DT_NEEDED_for_regular
3070 = entry
->flags
.add_DT_NEEDED_for_regular
;
3071 input_flags
.add_DT_NEEDED_for_dynamic
3072 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
3073 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
3074 input_flags
.dynamic
= entry
->flags
.dynamic
;
3076 ldfile_assumed_script
= TRUE
;
3077 parser_input
= input_script
;
3078 current_input_file
= entry
->filename
;
3080 current_input_file
= NULL
;
3081 ldfile_assumed_script
= FALSE
;
3083 /* missing_file is sticky. sysrooted will already have been
3084 restored when seeing EOF in yyparse, but no harm to restore
3086 save_flags
.missing_file
|= input_flags
.missing_file
;
3087 input_flags
= save_flags
;
3091 entry
->flags
.loaded
= TRUE
;
3096 if (ldemul_recognized_file (entry
))
3099 /* We don't call ldlang_add_file for an archive. Instead, the
3100 add_symbols entry point will call ldlang_add_file, via the
3101 add_archive_element callback, for each element of the archive
3103 switch (bfd_get_format (entry
->the_bfd
))
3109 if (!entry
->flags
.reload
)
3110 ldlang_add_file (entry
);
3114 check_excluded_libs (entry
->the_bfd
);
3116 bfd_set_usrdata (entry
->the_bfd
, entry
);
3117 if (entry
->flags
.whole_archive
)
3120 bfd_boolean loaded
= TRUE
;
3125 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
3130 if (!bfd_check_format (member
, bfd_object
))
3132 einfo (_("%F%P: %pB: member %pB in archive is not an object\n"),
3133 entry
->the_bfd
, member
);
3138 if (!(*link_info
.callbacks
3139 ->add_archive_element
) (&link_info
, member
,
3140 "--whole-archive", &subsbfd
))
3143 /* Potentially, the add_archive_element hook may have set a
3144 substitute BFD for us. */
3145 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
3147 einfo (_("%F%P: %pB: error adding symbols: %E\n"), member
);
3152 entry
->flags
.loaded
= loaded
;
3158 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
3159 entry
->flags
.loaded
= TRUE
;
3161 einfo (_("%F%P: %pB: error adding symbols: %E\n"), entry
->the_bfd
);
3163 return entry
->flags
.loaded
;
3166 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
3167 may be NULL, indicating that it is a wildcard. Separate
3168 lang_input_section statements are created for each part of the
3169 expansion; they are added after the wild statement S. OUTPUT is
3170 the output section. */
3173 wild (lang_wild_statement_type
*s
,
3174 const char *target ATTRIBUTE_UNUSED
,
3175 lang_output_section_statement_type
*output
)
3177 struct wildcard_list
*sec
;
3179 if (s
->handler_data
[0]
3180 && s
->handler_data
[0]->spec
.sorted
== by_name
3181 && !s
->filenames_sorted
)
3183 lang_section_bst_type
*tree
;
3185 walk_wild (s
, output_section_callback_fast
, output
);
3190 output_section_callback_tree_to_list (s
, tree
, output
);
3195 walk_wild (s
, output_section_callback
, output
);
3197 if (default_common_section
== NULL
)
3198 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
3199 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
3201 /* Remember the section that common is going to in case we
3202 later get something which doesn't know where to put it. */
3203 default_common_section
= output
;
3208 /* Return TRUE iff target is the sought target. */
3211 get_target (const bfd_target
*target
, void *data
)
3213 const char *sought
= (const char *) data
;
3215 return strcmp (target
->name
, sought
) == 0;
3218 /* Like strcpy() but convert to lower case as well. */
3221 stricpy (char *dest
, const char *src
)
3225 while ((c
= *src
++) != 0)
3226 *dest
++ = TOLOWER (c
);
3231 /* Remove the first occurrence of needle (if any) in haystack
3235 strcut (char *haystack
, const char *needle
)
3237 haystack
= strstr (haystack
, needle
);
3243 for (src
= haystack
+ strlen (needle
); *src
;)
3244 *haystack
++ = *src
++;
3250 /* Compare two target format name strings.
3251 Return a value indicating how "similar" they are. */
3254 name_compare (const char *first
, const char *second
)
3260 copy1
= (char *) xmalloc (strlen (first
) + 1);
3261 copy2
= (char *) xmalloc (strlen (second
) + 1);
3263 /* Convert the names to lower case. */
3264 stricpy (copy1
, first
);
3265 stricpy (copy2
, second
);
3267 /* Remove size and endian strings from the name. */
3268 strcut (copy1
, "big");
3269 strcut (copy1
, "little");
3270 strcut (copy2
, "big");
3271 strcut (copy2
, "little");
3273 /* Return a value based on how many characters match,
3274 starting from the beginning. If both strings are
3275 the same then return 10 * their length. */
3276 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3277 if (copy1
[result
] == 0)
3289 /* Set by closest_target_match() below. */
3290 static const bfd_target
*winner
;
3292 /* Scan all the valid bfd targets looking for one that has the endianness
3293 requirement that was specified on the command line, and is the nearest
3294 match to the original output target. */
3297 closest_target_match (const bfd_target
*target
, void *data
)
3299 const bfd_target
*original
= (const bfd_target
*) data
;
3301 if (command_line
.endian
== ENDIAN_BIG
3302 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3305 if (command_line
.endian
== ENDIAN_LITTLE
3306 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3309 /* Must be the same flavour. */
3310 if (target
->flavour
!= original
->flavour
)
3313 /* Ignore generic big and little endian elf vectors. */
3314 if (strcmp (target
->name
, "elf32-big") == 0
3315 || strcmp (target
->name
, "elf64-big") == 0
3316 || strcmp (target
->name
, "elf32-little") == 0
3317 || strcmp (target
->name
, "elf64-little") == 0)
3320 /* If we have not found a potential winner yet, then record this one. */
3327 /* Oh dear, we now have two potential candidates for a successful match.
3328 Compare their names and choose the better one. */
3329 if (name_compare (target
->name
, original
->name
)
3330 > name_compare (winner
->name
, original
->name
))
3333 /* Keep on searching until wqe have checked them all. */
3337 /* Return the BFD target format of the first input file. */
3340 get_first_input_target (void)
3342 const char *target
= NULL
;
3344 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3346 if (s
->header
.type
== lang_input_statement_enum
3349 ldfile_open_file (s
);
3351 if (s
->the_bfd
!= NULL
3352 && bfd_check_format (s
->the_bfd
, bfd_object
))
3354 target
= bfd_get_target (s
->the_bfd
);
3366 lang_get_output_target (void)
3370 /* Has the user told us which output format to use? */
3371 if (output_target
!= NULL
)
3372 return output_target
;
3374 /* No - has the current target been set to something other than
3376 if (current_target
!= default_target
&& current_target
!= NULL
)
3377 return current_target
;
3379 /* No - can we determine the format of the first input file? */
3380 target
= get_first_input_target ();
3384 /* Failed - use the default output target. */
3385 return default_target
;
3388 /* Open the output file. */
3391 open_output (const char *name
)
3393 output_target
= lang_get_output_target ();
3395 /* Has the user requested a particular endianness on the command
3397 if (command_line
.endian
!= ENDIAN_UNSET
)
3399 /* Get the chosen target. */
3400 const bfd_target
*target
3401 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3403 /* If the target is not supported, we cannot do anything. */
3406 enum bfd_endian desired_endian
;
3408 if (command_line
.endian
== ENDIAN_BIG
)
3409 desired_endian
= BFD_ENDIAN_BIG
;
3411 desired_endian
= BFD_ENDIAN_LITTLE
;
3413 /* See if the target has the wrong endianness. This should
3414 not happen if the linker script has provided big and
3415 little endian alternatives, but some scrips don't do
3417 if (target
->byteorder
!= desired_endian
)
3419 /* If it does, then see if the target provides
3420 an alternative with the correct endianness. */
3421 if (target
->alternative_target
!= NULL
3422 && (target
->alternative_target
->byteorder
== desired_endian
))
3423 output_target
= target
->alternative_target
->name
;
3426 /* Try to find a target as similar as possible to
3427 the default target, but which has the desired
3428 endian characteristic. */
3429 bfd_iterate_over_targets (closest_target_match
,
3432 /* Oh dear - we could not find any targets that
3433 satisfy our requirements. */
3435 einfo (_("%P: warning: could not find any targets"
3436 " that match endianness requirement\n"));
3438 output_target
= winner
->name
;
3444 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3446 if (link_info
.output_bfd
== NULL
)
3448 if (bfd_get_error () == bfd_error_invalid_target
)
3449 einfo (_("%F%P: target %s not found\n"), output_target
);
3451 einfo (_("%F%P: cannot open output file %s: %E\n"), name
);
3454 delete_output_file_on_failure
= TRUE
;
3456 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3457 einfo (_("%F%P: %s: can not make object file: %E\n"), name
);
3458 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3459 ldfile_output_architecture
,
3460 ldfile_output_machine
))
3461 einfo (_("%F%P: %s: can not set architecture: %E\n"), name
);
3463 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3464 if (link_info
.hash
== NULL
)
3465 einfo (_("%F%P: can not create hash table: %E\n"));
3467 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3471 ldlang_open_output (lang_statement_union_type
*statement
)
3473 switch (statement
->header
.type
)
3475 case lang_output_statement_enum
:
3476 ASSERT (link_info
.output_bfd
== NULL
);
3477 open_output (statement
->output_statement
.name
);
3478 ldemul_set_output_arch ();
3479 if (config
.magic_demand_paged
3480 && !bfd_link_relocatable (&link_info
))
3481 link_info
.output_bfd
->flags
|= D_PAGED
;
3483 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3484 if (config
.text_read_only
)
3485 link_info
.output_bfd
->flags
|= WP_TEXT
;
3487 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3488 if (link_info
.traditional_format
)
3489 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3491 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3494 case lang_target_statement_enum
:
3495 current_target
= statement
->target_statement
.target
;
3503 init_opb (asection
*s
)
3508 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
3510 && (s
->flags
& SEC_ELF_OCTETS
) != 0)
3513 x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3514 ldfile_output_machine
);
3516 while ((x
& 1) == 0)
3524 /* Open all the input files. */
3528 OPEN_BFD_NORMAL
= 0,
3532 #if BFD_SUPPORTS_PLUGINS
3533 static lang_input_statement_type
*plugin_insert
= NULL
;
3534 static struct bfd_link_hash_entry
*plugin_undefs
= NULL
;
3538 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3540 for (; s
!= NULL
; s
= s
->header
.next
)
3542 switch (s
->header
.type
)
3544 case lang_constructors_statement_enum
:
3545 open_input_bfds (constructor_list
.head
, mode
);
3547 case lang_output_section_statement_enum
:
3548 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3550 case lang_wild_statement_enum
:
3551 /* Maybe we should load the file's symbols. */
3552 if ((mode
& OPEN_BFD_RESCAN
) == 0
3553 && s
->wild_statement
.filename
3554 && !wildcardp (s
->wild_statement
.filename
)
3555 && !archive_path (s
->wild_statement
.filename
))
3556 lookup_name (s
->wild_statement
.filename
);
3557 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3559 case lang_group_statement_enum
:
3561 struct bfd_link_hash_entry
*undefs
;
3562 #if BFD_SUPPORTS_PLUGINS
3563 lang_input_statement_type
*plugin_insert_save
;
3566 /* We must continually search the entries in the group
3567 until no new symbols are added to the list of undefined
3572 #if BFD_SUPPORTS_PLUGINS
3573 plugin_insert_save
= plugin_insert
;
3575 undefs
= link_info
.hash
->undefs_tail
;
3576 open_input_bfds (s
->group_statement
.children
.head
,
3577 mode
| OPEN_BFD_FORCE
);
3579 while (undefs
!= link_info
.hash
->undefs_tail
3580 #if BFD_SUPPORTS_PLUGINS
3581 /* Objects inserted by a plugin, which are loaded
3582 before we hit this loop, may have added new
3584 || (plugin_insert
!= plugin_insert_save
&& plugin_undefs
)
3589 case lang_target_statement_enum
:
3590 current_target
= s
->target_statement
.target
;
3592 case lang_input_statement_enum
:
3593 if (s
->input_statement
.flags
.real
)
3595 lang_statement_union_type
**os_tail
;
3596 lang_statement_list_type add
;
3599 s
->input_statement
.target
= current_target
;
3601 /* If we are being called from within a group, and this
3602 is an archive which has already been searched, then
3603 force it to be researched unless the whole archive
3604 has been loaded already. Do the same for a rescan.
3605 Likewise reload --as-needed shared libs. */
3606 if (mode
!= OPEN_BFD_NORMAL
3607 #if BFD_SUPPORTS_PLUGINS
3608 && ((mode
& OPEN_BFD_RESCAN
) == 0
3609 || plugin_insert
== NULL
)
3611 && s
->input_statement
.flags
.loaded
3612 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3613 && ((bfd_get_format (abfd
) == bfd_archive
3614 && !s
->input_statement
.flags
.whole_archive
)
3615 || (bfd_get_format (abfd
) == bfd_object
3616 && ((abfd
->flags
) & DYNAMIC
) != 0
3617 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3618 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3619 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3621 s
->input_statement
.flags
.loaded
= FALSE
;
3622 s
->input_statement
.flags
.reload
= TRUE
;
3625 os_tail
= lang_os_list
.tail
;
3626 lang_list_init (&add
);
3628 if (!load_symbols (&s
->input_statement
, &add
))
3629 config
.make_executable
= FALSE
;
3631 if (add
.head
!= NULL
)
3633 /* If this was a script with output sections then
3634 tack any added statements on to the end of the
3635 list. This avoids having to reorder the output
3636 section statement list. Very likely the user
3637 forgot -T, and whatever we do here will not meet
3638 naive user expectations. */
3639 if (os_tail
!= lang_os_list
.tail
)
3641 einfo (_("%P: warning: %s contains output sections;"
3642 " did you forget -T?\n"),
3643 s
->input_statement
.filename
);
3644 *stat_ptr
->tail
= add
.head
;
3645 stat_ptr
->tail
= add
.tail
;
3649 *add
.tail
= s
->header
.next
;
3650 s
->header
.next
= add
.head
;
3654 #if BFD_SUPPORTS_PLUGINS
3655 /* If we have found the point at which a plugin added new
3656 files, clear plugin_insert to enable archive rescan. */
3657 if (&s
->input_statement
== plugin_insert
)
3658 plugin_insert
= NULL
;
3661 case lang_assignment_statement_enum
:
3662 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3663 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3670 /* Exit if any of the files were missing. */
3671 if (input_flags
.missing_file
)
3675 #ifdef ENABLE_LIBCTF
3676 /* Emit CTF errors and warnings. fp can be NULL to report errors/warnings
3677 that happened specifically at CTF open time. */
3679 lang_ctf_errs_warnings (ctf_dict_t
*fp
)
3681 ctf_next_t
*i
= NULL
;
3686 while ((text
= ctf_errwarning_next (fp
, &i
, &is_warning
, &err
)) != NULL
)
3688 einfo (_("%s: %s\n"), is_warning
? _("CTF warning"): _("CTF error"),
3692 if (err
!= ECTF_NEXT_END
)
3694 einfo (_("CTF error: cannot get CTF errors: `%s'\n"),
3698 /* `err' returns errors from the error/warning iterator in particular.
3699 These never assert. But if we have an fp, that could have recorded
3700 an assertion failure: assert if it has done so. */
3701 ASSERT (!fp
|| ctf_errno (fp
) != ECTF_INTERNAL
);
3704 /* Open the CTF sections in the input files with libctf: if any were opened,
3705 create a fake input file that we'll write the merged CTF data to later
3709 ldlang_open_ctf (void)
3714 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3718 /* Incoming files from the compiler have a single ctf_dict_t in them
3719 (which is presented to us by the libctf API in a ctf_archive_t
3720 wrapper): files derived from a previous relocatable link have a CTF
3721 archive containing possibly many CTF files. */
3723 if ((file
->the_ctf
= ctf_bfdopen (file
->the_bfd
, &err
)) == NULL
)
3725 if (err
!= ECTF_NOCTFDATA
)
3727 lang_ctf_errs_warnings (NULL
);
3728 einfo (_("%P: warning: CTF section in %pB not loaded; "
3729 "its types will be discarded: %s\n"), file
->the_bfd
,
3735 /* Prevent the contents of this section from being written, while
3736 requiring the section itself to be duplicated in the output, but only
3738 /* This section must exist if ctf_bfdopen() succeeded. */
3739 sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf");
3741 sect
->flags
|= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
| SEC_LINKER_CREATED
;
3744 sect
->flags
|= SEC_EXCLUDE
;
3754 if ((ctf_output
= ctf_create (&err
)) != NULL
)
3757 einfo (_("%P: warning: CTF output not created: `%s'\n"),
3760 LANG_FOR_EACH_INPUT_STATEMENT (errfile
)
3761 ctf_close (errfile
->the_ctf
);
3764 /* Merge together CTF sections. After this, only the symtab-dependent
3765 function and data object sections need adjustment. */
3768 lang_merge_ctf (void)
3770 asection
*output_sect
;
3776 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3778 /* If the section was discarded, don't waste time merging. */
3779 if (output_sect
== NULL
)
3781 ctf_dict_close (ctf_output
);
3784 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3786 ctf_close (file
->the_ctf
);
3787 file
->the_ctf
= NULL
;
3792 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3797 /* Takes ownership of file->the_ctf. */
3798 if (ctf_link_add_ctf (ctf_output
, file
->the_ctf
, file
->filename
) < 0)
3800 einfo (_("%P: warning: CTF section in %pB cannot be linked: `%s'\n"),
3801 file
->the_bfd
, ctf_errmsg (ctf_errno (ctf_output
)));
3802 ctf_close (file
->the_ctf
);
3803 file
->the_ctf
= NULL
;
3808 if (!config
.ctf_share_duplicated
)
3809 flags
= CTF_LINK_SHARE_UNCONFLICTED
;
3811 flags
= CTF_LINK_SHARE_DUPLICATED
;
3812 if (!config
.ctf_variables
)
3813 flags
|= CTF_LINK_OMIT_VARIABLES_SECTION
;
3815 if (ctf_link (ctf_output
, flags
) < 0)
3817 lang_ctf_errs_warnings (ctf_output
);
3818 einfo (_("%P: warning: CTF linking failed; "
3819 "output will have no CTF section: %s\n"),
3820 ctf_errmsg (ctf_errno (ctf_output
)));
3823 output_sect
->size
= 0;
3824 output_sect
->flags
|= SEC_EXCLUDE
;
3827 /* Output any lingering errors that didn't come from ctf_link. */
3828 lang_ctf_errs_warnings (ctf_output
);
3831 /* Let the emulation acquire strings from the dynamic strtab to help it optimize
3832 the CTF, if supported. */
3835 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
)
3837 ldemul_acquire_strings_for_ctf (ctf_output
, dynstrtab
);
3840 /* Inform the emulation about the addition of a new dynamic symbol, in BFD
3842 void ldlang_ctf_new_dynsym (int symidx
, struct elf_internal_sym
*sym
)
3844 ldemul_new_dynsym_for_ctf (ctf_output
, symidx
, sym
);
3847 /* Write out the CTF section. Called early, if the emulation isn't going to
3848 need to dedup against the strtab and symtab, then possibly called from the
3849 target linker code if the dedup has happened. */
3851 lang_write_ctf (int late
)
3854 asection
*output_sect
;
3861 /* Emit CTF late if this emulation says it can do so. */
3862 if (ldemul_emit_ctf_early ())
3867 if (!ldemul_emit_ctf_early ())
3871 /* Inform the emulation that all the symbols that will be received have
3874 ldemul_new_dynsym_for_ctf (ctf_output
, 0, NULL
);
3878 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3881 output_sect
->contents
= ctf_link_write (ctf_output
, &output_size
,
3882 CTF_COMPRESSION_THRESHOLD
);
3883 output_sect
->size
= output_size
;
3884 output_sect
->flags
|= SEC_IN_MEMORY
| SEC_KEEP
;
3886 lang_ctf_errs_warnings (ctf_output
);
3887 if (!output_sect
->contents
)
3889 einfo (_("%P: warning: CTF section emission failed; "
3890 "output will have no CTF section: %s\n"),
3891 ctf_errmsg (ctf_errno (ctf_output
)));
3892 output_sect
->size
= 0;
3893 output_sect
->flags
|= SEC_EXCLUDE
;
3897 /* This also closes every CTF input file used in the link. */
3898 ctf_dict_close (ctf_output
);
3901 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3902 file
->the_ctf
= NULL
;
3905 /* Write out the CTF section late, if the emulation needs that. */
3908 ldlang_write_ctf_late (void)
3910 /* Trigger a "late call", if the emulation needs one. */
3916 ldlang_open_ctf (void)
3918 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3922 /* If built without CTF, warn and delete all CTF sections from the output.
3923 (The alternative would be to simply concatenate them, which does not
3924 yield a valid CTF section.) */
3926 if ((sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf")) != NULL
)
3928 einfo (_("%P: warning: CTF section in %pB not linkable: "
3929 "%P was built without support for CTF\n"), file
->the_bfd
);
3931 sect
->flags
|= SEC_EXCLUDE
;
3936 static void lang_merge_ctf (void) {}
3938 ldlang_ctf_acquire_strings (struct elf_strtab_hash
*dynstrtab
3939 ATTRIBUTE_UNUSED
) {}
3941 ldlang_ctf_new_dynsym (int symidx ATTRIBUTE_UNUSED
,
3942 struct elf_internal_sym
*sym ATTRIBUTE_UNUSED
) {}
3943 static void lang_write_ctf (int late ATTRIBUTE_UNUSED
) {}
3944 void ldlang_write_ctf_late (void) {}
3947 /* Add the supplied name to the symbol table as an undefined reference.
3948 This is a two step process as the symbol table doesn't even exist at
3949 the time the ld command line is processed. First we put the name
3950 on a list, then, once the output file has been opened, transfer the
3951 name to the symbol table. */
3953 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3955 #define ldlang_undef_chain_list_head entry_symbol.next
3958 ldlang_add_undef (const char *const name
, bfd_boolean cmdline ATTRIBUTE_UNUSED
)
3960 ldlang_undef_chain_list_type
*new_undef
;
3962 new_undef
= stat_alloc (sizeof (*new_undef
));
3963 new_undef
->next
= ldlang_undef_chain_list_head
;
3964 ldlang_undef_chain_list_head
= new_undef
;
3966 new_undef
->name
= xstrdup (name
);
3968 if (link_info
.output_bfd
!= NULL
)
3969 insert_undefined (new_undef
->name
);
3972 /* Insert NAME as undefined in the symbol table. */
3975 insert_undefined (const char *name
)
3977 struct bfd_link_hash_entry
*h
;
3979 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3981 einfo (_("%F%P: bfd_link_hash_lookup failed: %E\n"));
3982 if (h
->type
== bfd_link_hash_new
)
3984 h
->type
= bfd_link_hash_undefined
;
3985 h
->u
.undef
.abfd
= NULL
;
3986 h
->non_ir_ref_regular
= TRUE
;
3987 if (is_elf_hash_table (link_info
.hash
))
3988 ((struct elf_link_hash_entry
*) h
)->mark
= 1;
3989 bfd_link_add_undef (link_info
.hash
, h
);
3993 /* Run through the list of undefineds created above and place them
3994 into the linker hash table as undefined symbols belonging to the
3998 lang_place_undefineds (void)
4000 ldlang_undef_chain_list_type
*ptr
;
4002 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
4003 insert_undefined (ptr
->name
);
4006 /* Structure used to build the list of symbols that the user has required
4009 struct require_defined_symbol
4012 struct require_defined_symbol
*next
;
4015 /* The list of symbols that the user has required be defined. */
4017 static struct require_defined_symbol
*require_defined_symbol_list
;
4019 /* Add a new symbol NAME to the list of symbols that are required to be
4023 ldlang_add_require_defined (const char *const name
)
4025 struct require_defined_symbol
*ptr
;
4027 ldlang_add_undef (name
, TRUE
);
4028 ptr
= stat_alloc (sizeof (*ptr
));
4029 ptr
->next
= require_defined_symbol_list
;
4030 ptr
->name
= strdup (name
);
4031 require_defined_symbol_list
= ptr
;
4034 /* Check that all symbols the user required to be defined, are defined,
4035 raise an error if we find a symbol that is not defined. */
4038 ldlang_check_require_defined_symbols (void)
4040 struct require_defined_symbol
*ptr
;
4042 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
4044 struct bfd_link_hash_entry
*h
;
4046 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
4047 FALSE
, FALSE
, TRUE
);
4049 || (h
->type
!= bfd_link_hash_defined
4050 && h
->type
!= bfd_link_hash_defweak
))
4051 einfo(_("%X%P: required symbol `%s' not defined\n"), ptr
->name
);
4055 /* Check for all readonly or some readwrite sections. */
4058 check_input_sections
4059 (lang_statement_union_type
*s
,
4060 lang_output_section_statement_type
*output_section_statement
)
4062 for (; s
!= NULL
; s
= s
->header
.next
)
4064 switch (s
->header
.type
)
4066 case lang_wild_statement_enum
:
4067 walk_wild (&s
->wild_statement
, check_section_callback
,
4068 output_section_statement
);
4069 if (!output_section_statement
->all_input_readonly
)
4072 case lang_constructors_statement_enum
:
4073 check_input_sections (constructor_list
.head
,
4074 output_section_statement
);
4075 if (!output_section_statement
->all_input_readonly
)
4078 case lang_group_statement_enum
:
4079 check_input_sections (s
->group_statement
.children
.head
,
4080 output_section_statement
);
4081 if (!output_section_statement
->all_input_readonly
)
4090 /* Update wildcard statements if needed. */
4093 update_wild_statements (lang_statement_union_type
*s
)
4095 struct wildcard_list
*sec
;
4097 switch (sort_section
)
4107 for (; s
!= NULL
; s
= s
->header
.next
)
4109 switch (s
->header
.type
)
4114 case lang_wild_statement_enum
:
4115 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
4117 /* Don't sort .init/.fini sections. */
4118 if (strcmp (sec
->spec
.name
, ".init") != 0
4119 && strcmp (sec
->spec
.name
, ".fini") != 0)
4120 switch (sec
->spec
.sorted
)
4123 sec
->spec
.sorted
= sort_section
;
4126 if (sort_section
== by_alignment
)
4127 sec
->spec
.sorted
= by_name_alignment
;
4130 if (sort_section
== by_name
)
4131 sec
->spec
.sorted
= by_alignment_name
;
4138 case lang_constructors_statement_enum
:
4139 update_wild_statements (constructor_list
.head
);
4142 case lang_output_section_statement_enum
:
4143 update_wild_statements
4144 (s
->output_section_statement
.children
.head
);
4147 case lang_group_statement_enum
:
4148 update_wild_statements (s
->group_statement
.children
.head
);
4156 /* Open input files and attach to output sections. */
4159 map_input_to_output_sections
4160 (lang_statement_union_type
*s
, const char *target
,
4161 lang_output_section_statement_type
*os
)
4163 for (; s
!= NULL
; s
= s
->header
.next
)
4165 lang_output_section_statement_type
*tos
;
4168 switch (s
->header
.type
)
4170 case lang_wild_statement_enum
:
4171 wild (&s
->wild_statement
, target
, os
);
4173 case lang_constructors_statement_enum
:
4174 map_input_to_output_sections (constructor_list
.head
,
4178 case lang_output_section_statement_enum
:
4179 tos
= &s
->output_section_statement
;
4180 if (tos
->constraint
== ONLY_IF_RW
4181 || tos
->constraint
== ONLY_IF_RO
)
4183 tos
->all_input_readonly
= TRUE
;
4184 check_input_sections (tos
->children
.head
, tos
);
4185 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
4186 tos
->constraint
= -1;
4188 if (tos
->constraint
>= 0)
4189 map_input_to_output_sections (tos
->children
.head
,
4193 case lang_output_statement_enum
:
4195 case lang_target_statement_enum
:
4196 target
= s
->target_statement
.target
;
4198 case lang_group_statement_enum
:
4199 map_input_to_output_sections (s
->group_statement
.children
.head
,
4203 case lang_data_statement_enum
:
4204 /* Make sure that any sections mentioned in the expression
4206 exp_init_os (s
->data_statement
.exp
);
4207 /* The output section gets CONTENTS, ALLOC and LOAD, but
4208 these may be overridden by the script. */
4209 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
4210 switch (os
->sectype
)
4212 case normal_section
:
4213 case overlay_section
:
4214 case first_overlay_section
:
4216 case noalloc_section
:
4217 flags
= SEC_HAS_CONTENTS
;
4219 case noload_section
:
4220 if (bfd_get_flavour (link_info
.output_bfd
)
4221 == bfd_target_elf_flavour
)
4222 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
4224 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
4227 if (os
->bfd_section
== NULL
)
4228 init_os (os
, flags
| SEC_READONLY
);
4230 os
->bfd_section
->flags
|= flags
;
4232 case lang_input_section_enum
:
4234 case lang_fill_statement_enum
:
4235 case lang_object_symbols_statement_enum
:
4236 case lang_reloc_statement_enum
:
4237 case lang_padding_statement_enum
:
4238 case lang_input_statement_enum
:
4239 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4242 case lang_assignment_statement_enum
:
4243 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4246 /* Make sure that any sections mentioned in the assignment
4248 exp_init_os (s
->assignment_statement
.exp
);
4250 case lang_address_statement_enum
:
4251 /* Mark the specified section with the supplied address.
4252 If this section was actually a segment marker, then the
4253 directive is ignored if the linker script explicitly
4254 processed the segment marker. Originally, the linker
4255 treated segment directives (like -Ttext on the
4256 command-line) as section directives. We honor the
4257 section directive semantics for backwards compatibility;
4258 linker scripts that do not specifically check for
4259 SEGMENT_START automatically get the old semantics. */
4260 if (!s
->address_statement
.segment
4261 || !s
->address_statement
.segment
->used
)
4263 const char *name
= s
->address_statement
.section_name
;
4265 /* Create the output section statement here so that
4266 orphans with a set address will be placed after other
4267 script sections. If we let the orphan placement code
4268 place them in amongst other sections then the address
4269 will affect following script sections, which is
4270 likely to surprise naive users. */
4271 tos
= lang_output_section_statement_lookup (name
, 0, 1);
4272 tos
->addr_tree
= s
->address_statement
.address
;
4273 if (tos
->bfd_section
== NULL
)
4277 case lang_insert_statement_enum
:
4283 /* An insert statement snips out all the linker statements from the
4284 start of the list and places them after the output section
4285 statement specified by the insert. This operation is complicated
4286 by the fact that we keep a doubly linked list of output section
4287 statements as well as the singly linked list of all statements.
4288 FIXME someday: Twiddling with the list not only moves statements
4289 from the user's script but also input and group statements that are
4290 built from command line object files and --start-group. We only
4291 get away with this because the list pointers used by file_chain
4292 and input_file_chain are not reordered, and processing via
4293 statement_list after this point mostly ignores input statements.
4294 One exception is the map file, where LOAD and START GROUP/END GROUP
4295 can end up looking odd. */
4298 process_insert_statements (lang_statement_union_type
**start
)
4300 lang_statement_union_type
**s
;
4301 lang_output_section_statement_type
*first_os
= NULL
;
4302 lang_output_section_statement_type
*last_os
= NULL
;
4303 lang_output_section_statement_type
*os
;
4308 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
4310 /* Keep pointers to the first and last output section
4311 statement in the sequence we may be about to move. */
4312 os
= &(*s
)->output_section_statement
;
4314 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
4317 /* Set constraint negative so that lang_output_section_find
4318 won't match this output section statement. At this
4319 stage in linking constraint has values in the range
4320 [-1, ONLY_IN_RW]. */
4321 last_os
->constraint
= -2 - last_os
->constraint
;
4322 if (first_os
== NULL
)
4325 else if ((*s
)->header
.type
== lang_group_statement_enum
)
4327 /* A user might put -T between --start-group and
4328 --end-group. One way this odd construct might arise is
4329 from a wrapper around ld to change library search
4330 behaviour. For example:
4332 exec real_ld --start-group "$@" --end-group
4333 This isn't completely unreasonable so go looking inside a
4334 group statement for insert statements. */
4335 process_insert_statements (&(*s
)->group_statement
.children
.head
);
4337 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
4339 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
4340 lang_output_section_statement_type
*where
;
4341 lang_statement_union_type
**ptr
;
4342 lang_statement_union_type
*first
;
4344 if (link_info
.non_contiguous_regions
)
4346 einfo (_("warning: INSERT statement in linker script is "
4347 "incompatible with --enable-non-contiguous-regions.\n"));
4350 where
= lang_output_section_find (i
->where
);
4351 if (where
!= NULL
&& i
->is_before
)
4354 where
= where
->prev
;
4355 while (where
!= NULL
&& where
->constraint
< 0);
4359 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
4363 /* Deal with reordering the output section statement list. */
4364 if (last_os
!= NULL
)
4366 asection
*first_sec
, *last_sec
;
4367 struct lang_output_section_statement_struct
**next
;
4369 /* Snip out the output sections we are moving. */
4370 first_os
->prev
->next
= last_os
->next
;
4371 if (last_os
->next
== NULL
)
4373 next
= &first_os
->prev
->next
;
4374 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4377 last_os
->next
->prev
= first_os
->prev
;
4378 /* Add them in at the new position. */
4379 last_os
->next
= where
->next
;
4380 if (where
->next
== NULL
)
4382 next
= &last_os
->next
;
4383 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4386 where
->next
->prev
= last_os
;
4387 first_os
->prev
= where
;
4388 where
->next
= first_os
;
4390 /* Move the bfd sections in the same way. */
4393 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4395 os
->constraint
= -2 - os
->constraint
;
4396 if (os
->bfd_section
!= NULL
4397 && os
->bfd_section
->owner
!= NULL
)
4399 last_sec
= os
->bfd_section
;
4400 if (first_sec
== NULL
)
4401 first_sec
= last_sec
;
4406 if (last_sec
!= NULL
)
4408 asection
*sec
= where
->bfd_section
;
4410 sec
= output_prev_sec_find (where
);
4412 /* The place we want to insert must come after the
4413 sections we are moving. So if we find no
4414 section or if the section is the same as our
4415 last section, then no move is needed. */
4416 if (sec
!= NULL
&& sec
!= last_sec
)
4418 /* Trim them off. */
4419 if (first_sec
->prev
!= NULL
)
4420 first_sec
->prev
->next
= last_sec
->next
;
4422 link_info
.output_bfd
->sections
= last_sec
->next
;
4423 if (last_sec
->next
!= NULL
)
4424 last_sec
->next
->prev
= first_sec
->prev
;
4426 link_info
.output_bfd
->section_last
= first_sec
->prev
;
4428 last_sec
->next
= sec
->next
;
4429 if (sec
->next
!= NULL
)
4430 sec
->next
->prev
= last_sec
;
4432 link_info
.output_bfd
->section_last
= last_sec
;
4433 first_sec
->prev
= sec
;
4434 sec
->next
= first_sec
;
4442 ptr
= insert_os_after (where
);
4443 /* Snip everything from the start of the list, up to and
4444 including the insert statement we are currently processing. */
4446 *start
= (*s
)->header
.next
;
4447 /* Add them back where they belong, minus the insert. */
4450 statement_list
.tail
= s
;
4455 s
= &(*s
)->header
.next
;
4458 /* Undo constraint twiddling. */
4459 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4461 os
->constraint
= -2 - os
->constraint
;
4467 /* An output section might have been removed after its statement was
4468 added. For example, ldemul_before_allocation can remove dynamic
4469 sections if they turn out to be not needed. Clean them up here. */
4472 strip_excluded_output_sections (void)
4474 lang_output_section_statement_type
*os
;
4476 /* Run lang_size_sections (if not already done). */
4477 if (expld
.phase
!= lang_mark_phase_enum
)
4479 expld
.phase
= lang_mark_phase_enum
;
4480 expld
.dataseg
.phase
= exp_seg_none
;
4481 one_lang_size_sections_pass (NULL
, FALSE
);
4482 lang_reset_memory_regions ();
4485 for (os
= (void *) lang_os_list
.head
;
4489 asection
*output_section
;
4490 bfd_boolean exclude
;
4492 if (os
->constraint
< 0)
4495 output_section
= os
->bfd_section
;
4496 if (output_section
== NULL
)
4499 exclude
= (output_section
->rawsize
== 0
4500 && (output_section
->flags
& SEC_KEEP
) == 0
4501 && !bfd_section_removed_from_list (link_info
.output_bfd
,
4504 /* Some sections have not yet been sized, notably .gnu.version,
4505 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
4506 input sections, so don't drop output sections that have such
4507 input sections unless they are also marked SEC_EXCLUDE. */
4508 if (exclude
&& output_section
->map_head
.s
!= NULL
)
4512 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
4513 if ((s
->flags
& SEC_EXCLUDE
) == 0
4514 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
4515 || link_info
.emitrelocations
))
4524 /* We don't set bfd_section to NULL since bfd_section of the
4525 removed output section statement may still be used. */
4526 if (!os
->update_dot
)
4528 output_section
->flags
|= SEC_EXCLUDE
;
4529 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
4530 link_info
.output_bfd
->section_count
--;
4535 /* Called from ldwrite to clear out asection.map_head and
4536 asection.map_tail for use as link_orders in ldwrite. */
4539 lang_clear_os_map (void)
4541 lang_output_section_statement_type
*os
;
4543 if (map_head_is_link_order
)
4546 for (os
= (void *) lang_os_list
.head
;
4550 asection
*output_section
;
4552 if (os
->constraint
< 0)
4555 output_section
= os
->bfd_section
;
4556 if (output_section
== NULL
)
4559 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
4560 output_section
->map_head
.link_order
= NULL
;
4561 output_section
->map_tail
.link_order
= NULL
;
4564 /* Stop future calls to lang_add_section from messing with map_head
4565 and map_tail link_order fields. */
4566 map_head_is_link_order
= TRUE
;
4570 print_output_section_statement
4571 (lang_output_section_statement_type
*output_section_statement
)
4573 asection
*section
= output_section_statement
->bfd_section
;
4576 if (output_section_statement
!= abs_output_section
)
4578 minfo ("\n%s", output_section_statement
->name
);
4580 if (section
!= NULL
)
4582 print_dot
= section
->vma
;
4584 len
= strlen (output_section_statement
->name
);
4585 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4590 while (len
< SECTION_NAME_MAP_LENGTH
)
4596 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4598 if (section
->vma
!= section
->lma
)
4599 minfo (_(" load address 0x%V"), section
->lma
);
4601 if (output_section_statement
->update_dot_tree
!= NULL
)
4602 exp_fold_tree (output_section_statement
->update_dot_tree
,
4603 bfd_abs_section_ptr
, &print_dot
);
4609 print_statement_list (output_section_statement
->children
.head
,
4610 output_section_statement
);
4614 print_assignment (lang_assignment_statement_type
*assignment
,
4615 lang_output_section_statement_type
*output_section
)
4622 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4625 if (assignment
->exp
->type
.node_class
== etree_assert
)
4628 tree
= assignment
->exp
->assert_s
.child
;
4632 const char *dst
= assignment
->exp
->assign
.dst
;
4634 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4635 tree
= assignment
->exp
;
4638 osec
= output_section
->bfd_section
;
4640 osec
= bfd_abs_section_ptr
;
4642 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4643 exp_fold_tree (tree
, osec
, &print_dot
);
4645 expld
.result
.valid_p
= FALSE
;
4647 if (expld
.result
.valid_p
)
4651 if (assignment
->exp
->type
.node_class
== etree_assert
4653 || expld
.assign_name
!= NULL
)
4655 value
= expld
.result
.value
;
4657 if (expld
.result
.section
!= NULL
)
4658 value
+= expld
.result
.section
->vma
;
4660 minfo ("0x%V", value
);
4666 struct bfd_link_hash_entry
*h
;
4668 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4669 FALSE
, FALSE
, TRUE
);
4671 && (h
->type
== bfd_link_hash_defined
4672 || h
->type
== bfd_link_hash_defweak
))
4674 value
= h
->u
.def
.value
;
4675 value
+= h
->u
.def
.section
->output_section
->vma
;
4676 value
+= h
->u
.def
.section
->output_offset
;
4678 minfo ("[0x%V]", value
);
4681 minfo ("[unresolved]");
4686 if (assignment
->exp
->type
.node_class
== etree_provide
)
4687 minfo ("[!provide]");
4694 expld
.assign_name
= NULL
;
4697 exp_print_tree (assignment
->exp
);
4702 print_input_statement (lang_input_statement_type
*statm
)
4704 if (statm
->filename
!= NULL
)
4705 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4708 /* Print all symbols defined in a particular section. This is called
4709 via bfd_link_hash_traverse, or by print_all_symbols. */
4712 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4714 asection
*sec
= (asection
*) ptr
;
4716 if ((hash_entry
->type
== bfd_link_hash_defined
4717 || hash_entry
->type
== bfd_link_hash_defweak
)
4718 && sec
== hash_entry
->u
.def
.section
)
4722 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4725 (hash_entry
->u
.def
.value
4726 + hash_entry
->u
.def
.section
->output_offset
4727 + hash_entry
->u
.def
.section
->output_section
->vma
));
4729 minfo (" %pT\n", hash_entry
->root
.string
);
4736 hash_entry_addr_cmp (const void *a
, const void *b
)
4738 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4739 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4741 if (l
->u
.def
.value
< r
->u
.def
.value
)
4743 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4750 print_all_symbols (asection
*sec
)
4752 input_section_userdata_type
*ud
= bfd_section_userdata (sec
);
4753 struct map_symbol_def
*def
;
4754 struct bfd_link_hash_entry
**entries
;
4760 *ud
->map_symbol_def_tail
= 0;
4762 /* Sort the symbols by address. */
4763 entries
= (struct bfd_link_hash_entry
**)
4764 obstack_alloc (&map_obstack
,
4765 ud
->map_symbol_def_count
* sizeof (*entries
));
4767 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4768 entries
[i
] = def
->entry
;
4770 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4771 hash_entry_addr_cmp
);
4773 /* Print the symbols. */
4774 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4775 ldemul_print_symbol (entries
[i
], sec
);
4777 obstack_free (&map_obstack
, entries
);
4780 /* Print information about an input section to the map file. */
4783 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4785 bfd_size_type size
= i
->size
;
4792 minfo ("%s", i
->name
);
4794 len
= 1 + strlen (i
->name
);
4795 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4800 while (len
< SECTION_NAME_MAP_LENGTH
)
4806 if (i
->output_section
!= NULL
4807 && i
->output_section
->owner
== link_info
.output_bfd
)
4808 addr
= i
->output_section
->vma
+ i
->output_offset
;
4816 minfo ("0x%V %W %pB\n", addr
, TO_ADDR (size
), i
->owner
);
4818 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4820 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4832 minfo (_("%W (size before relaxing)\n"), TO_ADDR (i
->rawsize
));
4835 if (i
->output_section
!= NULL
4836 && i
->output_section
->owner
== link_info
.output_bfd
)
4838 if (link_info
.reduce_memory_overheads
)
4839 bfd_link_hash_traverse (link_info
.hash
, ldemul_print_symbol
, i
);
4841 print_all_symbols (i
);
4843 /* Update print_dot, but make sure that we do not move it
4844 backwards - this could happen if we have overlays and a
4845 later overlay is shorter than an earier one. */
4846 if (addr
+ TO_ADDR (size
) > print_dot
)
4847 print_dot
= addr
+ TO_ADDR (size
);
4852 print_fill_statement (lang_fill_statement_type
*fill
)
4856 fputs (" FILL mask 0x", config
.map_file
);
4857 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4858 fprintf (config
.map_file
, "%02x", *p
);
4859 fputs ("\n", config
.map_file
);
4863 print_data_statement (lang_data_statement_type
*data
)
4870 init_opb (data
->output_section
);
4871 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4874 addr
= data
->output_offset
;
4875 if (data
->output_section
!= NULL
)
4876 addr
+= data
->output_section
->vma
;
4904 if (size
< TO_SIZE ((unsigned) 1))
4905 size
= TO_SIZE ((unsigned) 1);
4906 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4908 if (data
->exp
->type
.node_class
!= etree_value
)
4911 exp_print_tree (data
->exp
);
4916 print_dot
= addr
+ TO_ADDR (size
);
4919 /* Print an address statement. These are generated by options like
4923 print_address_statement (lang_address_statement_type
*address
)
4925 minfo (_("Address of section %s set to "), address
->section_name
);
4926 exp_print_tree (address
->address
);
4930 /* Print a reloc statement. */
4933 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4939 init_opb (reloc
->output_section
);
4940 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4943 addr
= reloc
->output_offset
;
4944 if (reloc
->output_section
!= NULL
)
4945 addr
+= reloc
->output_section
->vma
;
4947 size
= bfd_get_reloc_size (reloc
->howto
);
4949 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4951 if (reloc
->name
!= NULL
)
4952 minfo ("%s+", reloc
->name
);
4954 minfo ("%s+", reloc
->section
->name
);
4956 exp_print_tree (reloc
->addend_exp
);
4960 print_dot
= addr
+ TO_ADDR (size
);
4964 print_padding_statement (lang_padding_statement_type
*s
)
4969 init_opb (s
->output_section
);
4972 len
= sizeof " *fill*" - 1;
4973 while (len
< SECTION_NAME_MAP_LENGTH
)
4979 addr
= s
->output_offset
;
4980 if (s
->output_section
!= NULL
)
4981 addr
+= s
->output_section
->vma
;
4982 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4984 if (s
->fill
->size
!= 0)
4988 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4989 fprintf (config
.map_file
, "%02x", *p
);
4994 print_dot
= addr
+ TO_ADDR (s
->size
);
4998 print_wild_statement (lang_wild_statement_type
*w
,
4999 lang_output_section_statement_type
*os
)
5001 struct wildcard_list
*sec
;
5005 if (w
->exclude_name_list
)
5008 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
5009 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5010 minfo (" %s", tmp
->name
);
5014 if (w
->filenames_sorted
)
5015 minfo ("SORT_BY_NAME(");
5016 if (w
->filename
!= NULL
)
5017 minfo ("%s", w
->filename
);
5020 if (w
->filenames_sorted
)
5024 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
5026 int closing_paren
= 0;
5028 switch (sec
->spec
.sorted
)
5034 minfo ("SORT_BY_NAME(");
5039 minfo ("SORT_BY_ALIGNMENT(");
5043 case by_name_alignment
:
5044 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
5048 case by_alignment_name
:
5049 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
5054 minfo ("SORT_NONE(");
5058 case by_init_priority
:
5059 minfo ("SORT_BY_INIT_PRIORITY(");
5064 if (sec
->spec
.exclude_name_list
!= NULL
)
5067 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
5068 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
5069 minfo (" %s", tmp
->name
);
5072 if (sec
->spec
.name
!= NULL
)
5073 minfo ("%s", sec
->spec
.name
);
5076 for (;closing_paren
> 0; closing_paren
--)
5085 print_statement_list (w
->children
.head
, os
);
5088 /* Print a group statement. */
5091 print_group (lang_group_statement_type
*s
,
5092 lang_output_section_statement_type
*os
)
5094 fprintf (config
.map_file
, "START GROUP\n");
5095 print_statement_list (s
->children
.head
, os
);
5096 fprintf (config
.map_file
, "END GROUP\n");
5099 /* Print the list of statements in S.
5100 This can be called for any statement type. */
5103 print_statement_list (lang_statement_union_type
*s
,
5104 lang_output_section_statement_type
*os
)
5108 print_statement (s
, os
);
5113 /* Print the first statement in statement list S.
5114 This can be called for any statement type. */
5117 print_statement (lang_statement_union_type
*s
,
5118 lang_output_section_statement_type
*os
)
5120 switch (s
->header
.type
)
5123 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
5126 case lang_constructors_statement_enum
:
5127 if (constructor_list
.head
!= NULL
)
5129 if (constructors_sorted
)
5130 minfo (" SORT (CONSTRUCTORS)\n");
5132 minfo (" CONSTRUCTORS\n");
5133 print_statement_list (constructor_list
.head
, os
);
5136 case lang_wild_statement_enum
:
5137 print_wild_statement (&s
->wild_statement
, os
);
5139 case lang_address_statement_enum
:
5140 print_address_statement (&s
->address_statement
);
5142 case lang_object_symbols_statement_enum
:
5143 minfo (" CREATE_OBJECT_SYMBOLS\n");
5145 case lang_fill_statement_enum
:
5146 print_fill_statement (&s
->fill_statement
);
5148 case lang_data_statement_enum
:
5149 print_data_statement (&s
->data_statement
);
5151 case lang_reloc_statement_enum
:
5152 print_reloc_statement (&s
->reloc_statement
);
5154 case lang_input_section_enum
:
5155 print_input_section (s
->input_section
.section
, FALSE
);
5157 case lang_padding_statement_enum
:
5158 print_padding_statement (&s
->padding_statement
);
5160 case lang_output_section_statement_enum
:
5161 print_output_section_statement (&s
->output_section_statement
);
5163 case lang_assignment_statement_enum
:
5164 print_assignment (&s
->assignment_statement
, os
);
5166 case lang_target_statement_enum
:
5167 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
5169 case lang_output_statement_enum
:
5170 minfo ("OUTPUT(%s", s
->output_statement
.name
);
5171 if (output_target
!= NULL
)
5172 minfo (" %s", output_target
);
5175 case lang_input_statement_enum
:
5176 print_input_statement (&s
->input_statement
);
5178 case lang_group_statement_enum
:
5179 print_group (&s
->group_statement
, os
);
5181 case lang_insert_statement_enum
:
5182 minfo ("INSERT %s %s\n",
5183 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
5184 s
->insert_statement
.where
);
5190 print_statements (void)
5192 print_statement_list (statement_list
.head
, abs_output_section
);
5195 /* Print the first N statements in statement list S to STDERR.
5196 If N == 0, nothing is printed.
5197 If N < 0, the entire list is printed.
5198 Intended to be called from GDB. */
5201 dprint_statement (lang_statement_union_type
*s
, int n
)
5203 FILE *map_save
= config
.map_file
;
5205 config
.map_file
= stderr
;
5208 print_statement_list (s
, abs_output_section
);
5211 while (s
&& --n
>= 0)
5213 print_statement (s
, abs_output_section
);
5218 config
.map_file
= map_save
;
5222 insert_pad (lang_statement_union_type
**ptr
,
5224 bfd_size_type alignment_needed
,
5225 asection
*output_section
,
5228 static fill_type zero_fill
;
5229 lang_statement_union_type
*pad
= NULL
;
5231 if (ptr
!= &statement_list
.head
)
5232 pad
= ((lang_statement_union_type
*)
5233 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
5235 && pad
->header
.type
== lang_padding_statement_enum
5236 && pad
->padding_statement
.output_section
== output_section
)
5238 /* Use the existing pad statement. */
5240 else if ((pad
= *ptr
) != NULL
5241 && pad
->header
.type
== lang_padding_statement_enum
5242 && pad
->padding_statement
.output_section
== output_section
)
5244 /* Use the existing pad statement. */
5248 /* Make a new padding statement, linked into existing chain. */
5249 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
5250 pad
->header
.next
= *ptr
;
5252 pad
->header
.type
= lang_padding_statement_enum
;
5253 pad
->padding_statement
.output_section
= output_section
;
5256 pad
->padding_statement
.fill
= fill
;
5258 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
5259 pad
->padding_statement
.size
= alignment_needed
;
5260 if (!(output_section
->flags
& SEC_FIXED_SIZE
))
5261 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
5262 - output_section
->vma
);
5265 /* Work out how much this section will move the dot point. */
5269 (lang_statement_union_type
**this_ptr
,
5270 lang_output_section_statement_type
*output_section_statement
,
5272 bfd_boolean
*removed
,
5275 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
5276 asection
*i
= is
->section
;
5277 asection
*o
= output_section_statement
->bfd_section
;
5280 if (link_info
.non_contiguous_regions
)
5282 /* If the input section I has already been successfully assigned
5283 to an output section other than O, don't bother with it and
5284 let the caller remove it from the list. Keep processing in
5285 case we have already handled O, because the repeated passes
5286 have reinitialized its size. */
5287 if (i
->already_assigned
&& i
->already_assigned
!= o
)
5294 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
5295 i
->output_offset
= i
->vma
- o
->vma
;
5296 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
5297 || output_section_statement
->ignored
)
5298 i
->output_offset
= dot
- o
->vma
;
5301 bfd_size_type alignment_needed
;
5303 /* Align this section first to the input sections requirement,
5304 then to the output section's requirement. If this alignment
5305 is greater than any seen before, then record it too. Perform
5306 the alignment by inserting a magic 'padding' statement. */
5308 if (output_section_statement
->subsection_alignment
!= NULL
)
5310 = exp_get_power (output_section_statement
->subsection_alignment
,
5311 "subsection alignment");
5313 if (o
->alignment_power
< i
->alignment_power
)
5314 o
->alignment_power
= i
->alignment_power
;
5316 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
5318 if (alignment_needed
!= 0)
5320 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
5321 dot
+= alignment_needed
;
5324 if (link_info
.non_contiguous_regions
)
5326 /* If I would overflow O, let the caller remove I from the
5328 if (output_section_statement
->region
)
5330 bfd_vma end
= output_section_statement
->region
->origin
5331 + output_section_statement
->region
->length
;
5333 if (dot
+ TO_ADDR (i
->size
) > end
)
5335 if (i
->flags
& SEC_LINKER_CREATED
)
5336 einfo (_("%F%P: Output section '%s' not large enough for the "
5337 "linker-created stubs section '%s'.\n"),
5338 i
->output_section
->name
, i
->name
);
5340 if (i
->rawsize
&& i
->rawsize
!= i
->size
)
5341 einfo (_("%F%P: Relaxation not supported with "
5342 "--enable-non-contiguous-regions (section '%s' "
5343 "would overflow '%s' after it changed size).\n"),
5344 i
->name
, i
->output_section
->name
);
5348 i
->output_section
= NULL
;
5354 /* Remember where in the output section this input section goes. */
5355 i
->output_offset
= dot
- o
->vma
;
5357 /* Mark how big the output section must be to contain this now. */
5358 dot
+= TO_ADDR (i
->size
);
5359 if (!(o
->flags
& SEC_FIXED_SIZE
))
5360 o
->size
= TO_SIZE (dot
- o
->vma
);
5362 if (link_info
.non_contiguous_regions
)
5364 /* Record that I was successfully assigned to O, and update
5365 its actual output section too. */
5366 i
->already_assigned
= o
;
5367 i
->output_section
= o
;
5381 sort_sections_by_lma (const void *arg1
, const void *arg2
)
5383 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5384 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5386 if (sec1
->lma
< sec2
->lma
)
5388 else if (sec1
->lma
> sec2
->lma
)
5390 else if (sec1
->id
< sec2
->id
)
5392 else if (sec1
->id
> sec2
->id
)
5399 sort_sections_by_vma (const void *arg1
, const void *arg2
)
5401 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5402 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5404 if (sec1
->vma
< sec2
->vma
)
5406 else if (sec1
->vma
> sec2
->vma
)
5408 else if (sec1
->id
< sec2
->id
)
5410 else if (sec1
->id
> sec2
->id
)
5416 #define IS_TBSS(s) \
5417 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
5419 #define IGNORE_SECTION(s) \
5420 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
5422 /* Check to see if any allocated sections overlap with other allocated
5423 sections. This can happen if a linker script specifies the output
5424 section addresses of the two sections. Also check whether any memory
5425 region has overflowed. */
5428 lang_check_section_addresses (void)
5431 struct check_sec
*sections
;
5436 bfd_vma p_start
= 0;
5438 lang_memory_region_type
*m
;
5439 bfd_boolean overlays
;
5441 /* Detect address space overflow on allocated sections. */
5442 addr_mask
= ((bfd_vma
) 1 <<
5443 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
5444 addr_mask
= (addr_mask
<< 1) + 1;
5445 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5446 if ((s
->flags
& SEC_ALLOC
) != 0)
5448 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
5449 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
5450 einfo (_("%X%P: section %s VMA wraps around address space\n"),
5454 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
5455 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
5456 einfo (_("%X%P: section %s LMA wraps around address space\n"),
5461 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
5464 count
= bfd_count_sections (link_info
.output_bfd
);
5465 sections
= XNEWVEC (struct check_sec
, count
);
5467 /* Scan all sections in the output list. */
5469 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5471 if (IGNORE_SECTION (s
)
5475 sections
[count
].sec
= s
;
5476 sections
[count
].warned
= FALSE
;
5486 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
5488 /* First check section LMAs. There should be no overlap of LMAs on
5489 loadable sections, even with overlays. */
5490 for (p
= NULL
, i
= 0; i
< count
; i
++)
5492 s
= sections
[i
].sec
;
5494 if ((s
->flags
& SEC_LOAD
) != 0)
5497 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5499 /* Look for an overlap. We have sorted sections by lma, so
5500 we know that s_start >= p_start. Besides the obvious
5501 case of overlap when the current section starts before
5502 the previous one ends, we also must have overlap if the
5503 previous section wraps around the address space. */
5505 && (s_start
<= p_end
5506 || p_end
< p_start
))
5508 einfo (_("%X%P: section %s LMA [%V,%V]"
5509 " overlaps section %s LMA [%V,%V]\n"),
5510 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5511 sections
[i
].warned
= TRUE
;
5519 /* If any non-zero size allocated section (excluding tbss) starts at
5520 exactly the same VMA as another such section, then we have
5521 overlays. Overlays generated by the OVERLAY keyword will have
5522 this property. It is possible to intentionally generate overlays
5523 that fail this test, but it would be unusual. */
5524 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
5526 p_start
= sections
[0].sec
->vma
;
5527 for (i
= 1; i
< count
; i
++)
5529 s_start
= sections
[i
].sec
->vma
;
5530 if (p_start
== s_start
)
5538 /* Now check section VMAs if no overlays were detected. */
5541 for (p
= NULL
, i
= 0; i
< count
; i
++)
5543 s
= sections
[i
].sec
;
5546 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5549 && !sections
[i
].warned
5550 && (s_start
<= p_end
5551 || p_end
< p_start
))
5552 einfo (_("%X%P: section %s VMA [%V,%V]"
5553 " overlaps section %s VMA [%V,%V]\n"),
5554 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5563 /* If any memory region has overflowed, report by how much.
5564 We do not issue this diagnostic for regions that had sections
5565 explicitly placed outside their bounds; os_region_check's
5566 diagnostics are adequate for that case.
5568 FIXME: It is conceivable that m->current - (m->origin + m->length)
5569 might overflow a 32-bit integer. There is, alas, no way to print
5570 a bfd_vma quantity in decimal. */
5571 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
5572 if (m
->had_full_message
)
5574 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
5575 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
5576 "%X%P: region `%s' overflowed by %lu bytes\n",
5578 m
->name_list
.name
, over
);
5582 /* Make sure the new address is within the region. We explicitly permit the
5583 current address to be at the exact end of the region when the address is
5584 non-zero, in case the region is at the end of addressable memory and the
5585 calculation wraps around. */
5588 os_region_check (lang_output_section_statement_type
*os
,
5589 lang_memory_region_type
*region
,
5593 if ((region
->current
< region
->origin
5594 || (region
->current
- region
->origin
> region
->length
))
5595 && ((region
->current
!= region
->origin
+ region
->length
)
5600 einfo (_("%X%P: address 0x%v of %pB section `%s'"
5601 " is not within region `%s'\n"),
5603 os
->bfd_section
->owner
,
5604 os
->bfd_section
->name
,
5605 region
->name_list
.name
);
5607 else if (!region
->had_full_message
)
5609 region
->had_full_message
= TRUE
;
5611 einfo (_("%X%P: %pB section `%s' will not fit in region `%s'\n"),
5612 os
->bfd_section
->owner
,
5613 os
->bfd_section
->name
,
5614 region
->name_list
.name
);
5620 ldlang_check_relro_region (lang_statement_union_type
*s
,
5621 seg_align_type
*seg
)
5623 if (seg
->relro
== exp_seg_relro_start
)
5625 if (!seg
->relro_start_stat
)
5626 seg
->relro_start_stat
= s
;
5629 ASSERT (seg
->relro_start_stat
== s
);
5632 else if (seg
->relro
== exp_seg_relro_end
)
5634 if (!seg
->relro_end_stat
)
5635 seg
->relro_end_stat
= s
;
5638 ASSERT (seg
->relro_end_stat
== s
);
5643 /* Set the sizes for all the output sections. */
5646 lang_size_sections_1
5647 (lang_statement_union_type
**prev
,
5648 lang_output_section_statement_type
*output_section_statement
,
5652 bfd_boolean check_regions
)
5654 lang_statement_union_type
*s
;
5655 lang_statement_union_type
*prev_s
= NULL
;
5656 bfd_boolean removed_prev_s
= FALSE
;
5658 /* Size up the sections from their constituent parts. */
5659 for (s
= *prev
; s
!= NULL
; prev_s
= s
, s
= s
->header
.next
)
5661 bfd_boolean removed
=FALSE
;
5663 switch (s
->header
.type
)
5665 case lang_output_section_statement_enum
:
5667 bfd_vma newdot
, after
, dotdelta
;
5668 lang_output_section_statement_type
*os
;
5669 lang_memory_region_type
*r
;
5670 int section_alignment
= 0;
5672 os
= &s
->output_section_statement
;
5673 init_opb (os
->bfd_section
);
5674 if (os
->constraint
== -1)
5677 /* FIXME: We shouldn't need to zero section vmas for ld -r
5678 here, in lang_insert_orphan, or in the default linker scripts.
5679 This is covering for coff backend linker bugs. See PR6945. */
5680 if (os
->addr_tree
== NULL
5681 && bfd_link_relocatable (&link_info
)
5682 && (bfd_get_flavour (link_info
.output_bfd
)
5683 == bfd_target_coff_flavour
))
5684 os
->addr_tree
= exp_intop (0);
5685 if (os
->addr_tree
!= NULL
)
5687 os
->processed_vma
= FALSE
;
5688 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5690 if (expld
.result
.valid_p
)
5692 dot
= expld
.result
.value
;
5693 if (expld
.result
.section
!= NULL
)
5694 dot
+= expld
.result
.section
->vma
;
5696 else if (expld
.phase
!= lang_mark_phase_enum
)
5697 einfo (_("%F%P:%pS: non constant or forward reference"
5698 " address expression for section %s\n"),
5699 os
->addr_tree
, os
->name
);
5702 if (os
->bfd_section
== NULL
)
5703 /* This section was removed or never actually created. */
5706 /* If this is a COFF shared library section, use the size and
5707 address from the input section. FIXME: This is COFF
5708 specific; it would be cleaner if there were some other way
5709 to do this, but nothing simple comes to mind. */
5710 if (((bfd_get_flavour (link_info
.output_bfd
)
5711 == bfd_target_ecoff_flavour
)
5712 || (bfd_get_flavour (link_info
.output_bfd
)
5713 == bfd_target_coff_flavour
))
5714 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5718 if (os
->children
.head
== NULL
5719 || os
->children
.head
->header
.next
!= NULL
5720 || (os
->children
.head
->header
.type
5721 != lang_input_section_enum
))
5722 einfo (_("%X%P: internal error on COFF shared library"
5723 " section %s\n"), os
->name
);
5725 input
= os
->children
.head
->input_section
.section
;
5726 bfd_set_section_vma (os
->bfd_section
,
5727 bfd_section_vma (input
));
5728 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5729 os
->bfd_section
->size
= input
->size
;
5735 if (bfd_is_abs_section (os
->bfd_section
))
5737 /* No matter what happens, an abs section starts at zero. */
5738 ASSERT (os
->bfd_section
->vma
== 0);
5742 if (os
->addr_tree
== NULL
)
5744 /* No address specified for this section, get one
5745 from the region specification. */
5746 if (os
->region
== NULL
5747 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5748 && os
->region
->name_list
.name
[0] == '*'
5749 && strcmp (os
->region
->name_list
.name
,
5750 DEFAULT_MEMORY_REGION
) == 0))
5752 os
->region
= lang_memory_default (os
->bfd_section
);
5755 /* If a loadable section is using the default memory
5756 region, and some non default memory regions were
5757 defined, issue an error message. */
5759 && !IGNORE_SECTION (os
->bfd_section
)
5760 && !bfd_link_relocatable (&link_info
)
5762 && strcmp (os
->region
->name_list
.name
,
5763 DEFAULT_MEMORY_REGION
) == 0
5764 && lang_memory_region_list
!= NULL
5765 && (strcmp (lang_memory_region_list
->name_list
.name
,
5766 DEFAULT_MEMORY_REGION
) != 0
5767 || lang_memory_region_list
->next
!= NULL
)
5768 && lang_sizing_iteration
== 1)
5770 /* By default this is an error rather than just a
5771 warning because if we allocate the section to the
5772 default memory region we can end up creating an
5773 excessively large binary, or even seg faulting when
5774 attempting to perform a negative seek. See
5775 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5776 for an example of this. This behaviour can be
5777 overridden by the using the --no-check-sections
5779 if (command_line
.check_section_addresses
)
5780 einfo (_("%F%P: error: no memory region specified"
5781 " for loadable section `%s'\n"),
5782 bfd_section_name (os
->bfd_section
));
5784 einfo (_("%P: warning: no memory region specified"
5785 " for loadable section `%s'\n"),
5786 bfd_section_name (os
->bfd_section
));
5789 newdot
= os
->region
->current
;
5790 section_alignment
= os
->bfd_section
->alignment_power
;
5793 section_alignment
= exp_get_power (os
->section_alignment
,
5794 "section alignment");
5796 /* Align to what the section needs. */
5797 if (section_alignment
> 0)
5799 bfd_vma savedot
= newdot
;
5802 newdot
= align_power (newdot
, section_alignment
);
5803 dotdelta
= newdot
- savedot
;
5805 if (lang_sizing_iteration
== 1)
5807 else if (lang_sizing_iteration
> 1)
5809 /* Only report adjustments that would change
5810 alignment from what we have already reported. */
5811 diff
= newdot
- os
->bfd_section
->vma
;
5812 if (!(diff
& (((bfd_vma
) 1 << section_alignment
) - 1)))
5816 && (config
.warn_section_align
5817 || os
->addr_tree
!= NULL
))
5818 einfo (_("%P: warning: "
5819 "start of section %s changed by %ld\n"),
5820 os
->name
, (long) diff
);
5823 bfd_set_section_vma (os
->bfd_section
, newdot
);
5825 os
->bfd_section
->output_offset
= 0;
5828 lang_size_sections_1 (&os
->children
.head
, os
,
5829 os
->fill
, newdot
, relax
, check_regions
);
5831 os
->processed_vma
= TRUE
;
5833 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5834 /* Except for some special linker created sections,
5835 no output section should change from zero size
5836 after strip_excluded_output_sections. A non-zero
5837 size on an ignored section indicates that some
5838 input section was not sized early enough. */
5839 ASSERT (os
->bfd_section
->size
== 0);
5842 dot
= os
->bfd_section
->vma
;
5844 /* Put the section within the requested block size, or
5845 align at the block boundary. */
5847 + TO_ADDR (os
->bfd_section
->size
)
5848 + os
->block_value
- 1)
5849 & - (bfd_vma
) os
->block_value
);
5851 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5852 os
->bfd_section
->size
= TO_SIZE (after
5853 - os
->bfd_section
->vma
);
5856 /* Set section lma. */
5859 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5863 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5864 os
->bfd_section
->lma
= lma
;
5866 else if (os
->lma_region
!= NULL
)
5868 bfd_vma lma
= os
->lma_region
->current
;
5870 if (os
->align_lma_with_input
)
5874 /* When LMA_REGION is the same as REGION, align the LMA
5875 as we did for the VMA, possibly including alignment
5876 from the bfd section. If a different region, then
5877 only align according to the value in the output
5879 if (os
->lma_region
!= os
->region
)
5880 section_alignment
= exp_get_power (os
->section_alignment
,
5881 "section alignment");
5882 if (section_alignment
> 0)
5883 lma
= align_power (lma
, section_alignment
);
5885 os
->bfd_section
->lma
= lma
;
5887 else if (r
->last_os
!= NULL
5888 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5893 last
= r
->last_os
->output_section_statement
.bfd_section
;
5895 /* A backwards move of dot should be accompanied by
5896 an explicit assignment to the section LMA (ie.
5897 os->load_base set) because backwards moves can
5898 create overlapping LMAs. */
5900 && os
->bfd_section
->size
!= 0
5901 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5903 /* If dot moved backwards then leave lma equal to
5904 vma. This is the old default lma, which might
5905 just happen to work when the backwards move is
5906 sufficiently large. Nag if this changes anything,
5907 so people can fix their linker scripts. */
5909 if (last
->vma
!= last
->lma
)
5910 einfo (_("%P: warning: dot moved backwards "
5911 "before `%s'\n"), os
->name
);
5915 /* If this is an overlay, set the current lma to that
5916 at the end of the previous section. */
5917 if (os
->sectype
== overlay_section
)
5918 lma
= last
->lma
+ TO_ADDR (last
->size
);
5920 /* Otherwise, keep the same lma to vma relationship
5921 as the previous section. */
5923 lma
= os
->bfd_section
->vma
+ last
->lma
- last
->vma
;
5925 if (section_alignment
> 0)
5926 lma
= align_power (lma
, section_alignment
);
5927 os
->bfd_section
->lma
= lma
;
5930 os
->processed_lma
= TRUE
;
5932 /* Keep track of normal sections using the default
5933 lma region. We use this to set the lma for
5934 following sections. Overlays or other linker
5935 script assignment to lma might mean that the
5936 default lma == vma is incorrect.
5937 To avoid warnings about dot moving backwards when using
5938 -Ttext, don't start tracking sections until we find one
5939 of non-zero size or with lma set differently to vma.
5940 Do this tracking before we short-cut the loop so that we
5941 track changes for the case where the section size is zero,
5942 but the lma is set differently to the vma. This is
5943 important, if an orphan section is placed after an
5944 otherwise empty output section that has an explicit lma
5945 set, we want that lma reflected in the orphans lma. */
5946 if (((!IGNORE_SECTION (os
->bfd_section
)
5947 && (os
->bfd_section
->size
!= 0
5948 || (r
->last_os
== NULL
5949 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5950 || (r
->last_os
!= NULL
5951 && dot
>= (r
->last_os
->output_section_statement
5952 .bfd_section
->vma
))))
5953 || os
->sectype
== first_overlay_section
)
5954 && os
->lma_region
== NULL
5955 && !bfd_link_relocatable (&link_info
))
5958 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5961 /* .tbss sections effectively have zero size. */
5962 if (!IS_TBSS (os
->bfd_section
)
5963 || bfd_link_relocatable (&link_info
))
5964 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5969 if (os
->update_dot_tree
!= 0)
5970 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5972 /* Update dot in the region ?
5973 We only do this if the section is going to be allocated,
5974 since unallocated sections do not contribute to the region's
5975 overall size in memory. */
5976 if (os
->region
!= NULL
5977 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5979 os
->region
->current
= dot
;
5982 /* Make sure the new address is within the region. */
5983 os_region_check (os
, os
->region
, os
->addr_tree
,
5984 os
->bfd_section
->vma
);
5986 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5987 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5988 || os
->align_lma_with_input
))
5990 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5993 os_region_check (os
, os
->lma_region
, NULL
,
5994 os
->bfd_section
->lma
);
6000 case lang_constructors_statement_enum
:
6001 dot
= lang_size_sections_1 (&constructor_list
.head
,
6002 output_section_statement
,
6003 fill
, dot
, relax
, check_regions
);
6006 case lang_data_statement_enum
:
6008 unsigned int size
= 0;
6010 s
->data_statement
.output_offset
=
6011 dot
- output_section_statement
->bfd_section
->vma
;
6012 s
->data_statement
.output_section
=
6013 output_section_statement
->bfd_section
;
6015 /* We might refer to provided symbols in the expression, and
6016 need to mark them as needed. */
6017 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6019 switch (s
->data_statement
.type
)
6037 if (size
< TO_SIZE ((unsigned) 1))
6038 size
= TO_SIZE ((unsigned) 1);
6039 dot
+= TO_ADDR (size
);
6040 if (!(output_section_statement
->bfd_section
->flags
6042 output_section_statement
->bfd_section
->size
6043 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6048 case lang_reloc_statement_enum
:
6052 s
->reloc_statement
.output_offset
=
6053 dot
- output_section_statement
->bfd_section
->vma
;
6054 s
->reloc_statement
.output_section
=
6055 output_section_statement
->bfd_section
;
6056 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
6057 dot
+= TO_ADDR (size
);
6058 if (!(output_section_statement
->bfd_section
->flags
6060 output_section_statement
->bfd_section
->size
6061 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
6065 case lang_wild_statement_enum
:
6066 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
6067 output_section_statement
,
6068 fill
, dot
, relax
, check_regions
);
6071 case lang_object_symbols_statement_enum
:
6072 link_info
.create_object_symbols_section
6073 = output_section_statement
->bfd_section
;
6074 output_section_statement
->bfd_section
->flags
|= SEC_KEEP
;
6077 case lang_output_statement_enum
:
6078 case lang_target_statement_enum
:
6081 case lang_input_section_enum
:
6085 i
= s
->input_section
.section
;
6090 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
6091 einfo (_("%F%P: can't relax section: %E\n"));
6095 dot
= size_input_section (prev
, output_section_statement
,
6096 fill
, &removed
, dot
);
6100 case lang_input_statement_enum
:
6103 case lang_fill_statement_enum
:
6104 s
->fill_statement
.output_section
=
6105 output_section_statement
->bfd_section
;
6107 fill
= s
->fill_statement
.fill
;
6110 case lang_assignment_statement_enum
:
6112 bfd_vma newdot
= dot
;
6113 etree_type
*tree
= s
->assignment_statement
.exp
;
6115 expld
.dataseg
.relro
= exp_seg_relro_none
;
6117 exp_fold_tree (tree
,
6118 output_section_statement
->bfd_section
,
6121 ldlang_check_relro_region (s
, &expld
.dataseg
);
6123 expld
.dataseg
.relro
= exp_seg_relro_none
;
6125 /* This symbol may be relative to this section. */
6126 if ((tree
->type
.node_class
== etree_provided
6127 || tree
->type
.node_class
== etree_assign
)
6128 && (tree
->assign
.dst
[0] != '.'
6129 || tree
->assign
.dst
[1] != '\0'))
6130 output_section_statement
->update_dot
= 1;
6132 if (!output_section_statement
->ignored
)
6134 if (output_section_statement
== abs_output_section
)
6136 /* If we don't have an output section, then just adjust
6137 the default memory address. */
6138 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
6139 FALSE
)->current
= newdot
;
6141 else if (newdot
!= dot
)
6143 /* Insert a pad after this statement. We can't
6144 put the pad before when relaxing, in case the
6145 assignment references dot. */
6146 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
6147 output_section_statement
->bfd_section
, dot
);
6149 /* Don't neuter the pad below when relaxing. */
6152 /* If dot is advanced, this implies that the section
6153 should have space allocated to it, unless the
6154 user has explicitly stated that the section
6155 should not be allocated. */
6156 if (output_section_statement
->sectype
!= noalloc_section
6157 && (output_section_statement
->sectype
!= noload_section
6158 || (bfd_get_flavour (link_info
.output_bfd
)
6159 == bfd_target_elf_flavour
)))
6160 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
6167 case lang_padding_statement_enum
:
6168 /* If this is the first time lang_size_sections is called,
6169 we won't have any padding statements. If this is the
6170 second or later passes when relaxing, we should allow
6171 padding to shrink. If padding is needed on this pass, it
6172 will be added back in. */
6173 s
->padding_statement
.size
= 0;
6175 /* Make sure output_offset is valid. If relaxation shrinks
6176 the section and this pad isn't needed, it's possible to
6177 have output_offset larger than the final size of the
6178 section. bfd_set_section_contents will complain even for
6179 a pad size of zero. */
6180 s
->padding_statement
.output_offset
6181 = dot
- output_section_statement
->bfd_section
->vma
;
6184 case lang_group_statement_enum
:
6185 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
6186 output_section_statement
,
6187 fill
, dot
, relax
, check_regions
);
6190 case lang_insert_statement_enum
:
6193 /* We can only get here when relaxing is turned on. */
6194 case lang_address_statement_enum
:
6202 /* If an input section doesn't fit in the current output
6203 section, remove it from the list. Handle the case where we
6204 have to remove an input_section statement here: there is a
6205 special case to remove the first element of the list. */
6206 if (link_info
.non_contiguous_regions
&& removed
)
6208 /* If we removed the first element during the previous
6209 iteration, override the loop assignment of prev_s. */
6215 /* If there was a real previous input section, just skip
6217 prev_s
->header
.next
=s
->header
.next
;
6219 removed_prev_s
= FALSE
;
6223 /* Remove the first input section of the list. */
6224 *prev
= s
->header
.next
;
6225 removed_prev_s
= TRUE
;
6228 /* Move to next element, unless we removed the head of the
6230 if (!removed_prev_s
)
6231 prev
= &s
->header
.next
;
6235 prev
= &s
->header
.next
;
6236 removed_prev_s
= FALSE
;
6242 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
6243 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
6244 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
6245 segments. We are allowed an opportunity to override this decision. */
6248 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
6249 bfd
*abfd ATTRIBUTE_UNUSED
,
6250 asection
*current_section
,
6251 asection
*previous_section
,
6252 bfd_boolean new_segment
)
6254 lang_output_section_statement_type
*cur
;
6255 lang_output_section_statement_type
*prev
;
6257 /* The checks below are only necessary when the BFD library has decided
6258 that the two sections ought to be placed into the same segment. */
6262 /* Paranoia checks. */
6263 if (current_section
== NULL
|| previous_section
== NULL
)
6266 /* If this flag is set, the target never wants code and non-code
6267 sections comingled in the same segment. */
6268 if (config
.separate_code
6269 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
6272 /* Find the memory regions associated with the two sections.
6273 We call lang_output_section_find() here rather than scanning the list
6274 of output sections looking for a matching section pointer because if
6275 we have a large number of sections then a hash lookup is faster. */
6276 cur
= lang_output_section_find (current_section
->name
);
6277 prev
= lang_output_section_find (previous_section
->name
);
6279 /* More paranoia. */
6280 if (cur
== NULL
|| prev
== NULL
)
6283 /* If the regions are different then force the sections to live in
6284 different segments. See the email thread starting at the following
6285 URL for the reasons why this is necessary:
6286 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
6287 return cur
->region
!= prev
->region
;
6291 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
6293 lang_statement_iteration
++;
6294 if (expld
.phase
!= lang_mark_phase_enum
)
6295 lang_sizing_iteration
++;
6296 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
6297 0, 0, relax
, check_regions
);
6301 lang_size_segment (seg_align_type
*seg
)
6303 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
6304 a page could be saved in the data segment. */
6305 bfd_vma first
, last
;
6307 first
= -seg
->base
& (seg
->pagesize
- 1);
6308 last
= seg
->end
& (seg
->pagesize
- 1);
6310 && ((seg
->base
& ~(seg
->pagesize
- 1))
6311 != (seg
->end
& ~(seg
->pagesize
- 1)))
6312 && first
+ last
<= seg
->pagesize
)
6314 seg
->phase
= exp_seg_adjust
;
6318 seg
->phase
= exp_seg_done
;
6323 lang_size_relro_segment_1 (seg_align_type
*seg
)
6325 bfd_vma relro_end
, desired_end
;
6328 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
6329 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
6330 & ~(seg
->pagesize
- 1));
6332 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
6333 desired_end
= relro_end
- seg
->relro_offset
;
6335 /* For sections in the relro segment.. */
6336 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
6337 if ((sec
->flags
& SEC_ALLOC
) != 0
6338 && sec
->vma
>= seg
->base
6339 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
6341 /* Where do we want to put this section so that it ends as
6343 bfd_vma start
, end
, bump
;
6345 end
= start
= sec
->vma
;
6347 end
+= TO_ADDR (sec
->size
);
6348 bump
= desired_end
- end
;
6349 /* We'd like to increase START by BUMP, but we must heed
6350 alignment so the increase might be less than optimum. */
6352 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
6353 /* This is now the desired end for the previous section. */
6354 desired_end
= start
;
6357 seg
->phase
= exp_seg_relro_adjust
;
6358 ASSERT (desired_end
>= seg
->base
);
6359 seg
->base
= desired_end
;
6364 lang_size_relro_segment (bfd_boolean
*relax
, bfd_boolean check_regions
)
6366 bfd_boolean do_reset
= FALSE
;
6367 bfd_boolean do_data_relro
;
6368 bfd_vma data_initial_base
, data_relro_end
;
6370 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6372 do_data_relro
= TRUE
;
6373 data_initial_base
= expld
.dataseg
.base
;
6374 data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
6378 do_data_relro
= FALSE
;
6379 data_initial_base
= data_relro_end
= 0;
6384 lang_reset_memory_regions ();
6385 one_lang_size_sections_pass (relax
, check_regions
);
6387 /* Assignments to dot, or to output section address in a user
6388 script have increased padding over the original. Revert. */
6389 if (do_data_relro
&& expld
.dataseg
.relro_end
> data_relro_end
)
6391 expld
.dataseg
.base
= data_initial_base
;;
6396 if (!do_data_relro
&& lang_size_segment (&expld
.dataseg
))
6403 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
6405 expld
.phase
= lang_allocating_phase_enum
;
6406 expld
.dataseg
.phase
= exp_seg_none
;
6408 one_lang_size_sections_pass (relax
, check_regions
);
6410 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
6411 expld
.dataseg
.phase
= exp_seg_done
;
6413 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
6415 bfd_boolean do_reset
6416 = lang_size_relro_segment (relax
, check_regions
);
6420 lang_reset_memory_regions ();
6421 one_lang_size_sections_pass (relax
, check_regions
);
6424 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6426 link_info
.relro_start
= expld
.dataseg
.base
;
6427 link_info
.relro_end
= expld
.dataseg
.relro_end
;
6432 static lang_output_section_statement_type
*current_section
;
6433 static lang_assignment_statement_type
*current_assign
;
6434 static bfd_boolean prefer_next_section
;
6436 /* Worker function for lang_do_assignments. Recursiveness goes here. */
6439 lang_do_assignments_1 (lang_statement_union_type
*s
,
6440 lang_output_section_statement_type
*current_os
,
6443 bfd_boolean
*found_end
)
6445 for (; s
!= NULL
; s
= s
->header
.next
)
6447 switch (s
->header
.type
)
6449 case lang_constructors_statement_enum
:
6450 dot
= lang_do_assignments_1 (constructor_list
.head
,
6451 current_os
, fill
, dot
, found_end
);
6454 case lang_output_section_statement_enum
:
6456 lang_output_section_statement_type
*os
;
6459 os
= &(s
->output_section_statement
);
6460 os
->after_end
= *found_end
;
6461 init_opb (os
->bfd_section
);
6462 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
6464 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
6466 current_section
= os
;
6467 prefer_next_section
= FALSE
;
6469 dot
= os
->bfd_section
->vma
;
6471 newdot
= lang_do_assignments_1 (os
->children
.head
,
6472 os
, os
->fill
, dot
, found_end
);
6475 if (os
->bfd_section
!= NULL
)
6477 /* .tbss sections effectively have zero size. */
6478 if (!IS_TBSS (os
->bfd_section
)
6479 || bfd_link_relocatable (&link_info
))
6480 dot
+= TO_ADDR (os
->bfd_section
->size
);
6482 if (os
->update_dot_tree
!= NULL
)
6483 exp_fold_tree (os
->update_dot_tree
,
6484 bfd_abs_section_ptr
, &dot
);
6492 case lang_wild_statement_enum
:
6494 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
6495 current_os
, fill
, dot
, found_end
);
6498 case lang_object_symbols_statement_enum
:
6499 case lang_output_statement_enum
:
6500 case lang_target_statement_enum
:
6503 case lang_data_statement_enum
:
6504 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6505 if (expld
.result
.valid_p
)
6507 s
->data_statement
.value
= expld
.result
.value
;
6508 if (expld
.result
.section
!= NULL
)
6509 s
->data_statement
.value
+= expld
.result
.section
->vma
;
6511 else if (expld
.phase
== lang_final_phase_enum
)
6512 einfo (_("%F%P: invalid data statement\n"));
6515 switch (s
->data_statement
.type
)
6533 if (size
< TO_SIZE ((unsigned) 1))
6534 size
= TO_SIZE ((unsigned) 1);
6535 dot
+= TO_ADDR (size
);
6539 case lang_reloc_statement_enum
:
6540 exp_fold_tree (s
->reloc_statement
.addend_exp
,
6541 bfd_abs_section_ptr
, &dot
);
6542 if (expld
.result
.valid_p
)
6543 s
->reloc_statement
.addend_value
= expld
.result
.value
;
6544 else if (expld
.phase
== lang_final_phase_enum
)
6545 einfo (_("%F%P: invalid reloc statement\n"));
6546 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
6549 case lang_input_section_enum
:
6551 asection
*in
= s
->input_section
.section
;
6553 if ((in
->flags
& SEC_EXCLUDE
) == 0)
6554 dot
+= TO_ADDR (in
->size
);
6558 case lang_input_statement_enum
:
6561 case lang_fill_statement_enum
:
6562 fill
= s
->fill_statement
.fill
;
6565 case lang_assignment_statement_enum
:
6566 current_assign
= &s
->assignment_statement
;
6567 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
6569 const char *p
= current_assign
->exp
->assign
.dst
;
6571 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
6572 prefer_next_section
= TRUE
;
6576 if (strcmp (p
, "end") == 0)
6579 exp_fold_tree (s
->assignment_statement
.exp
,
6580 (current_os
->bfd_section
!= NULL
6581 ? current_os
->bfd_section
: bfd_und_section_ptr
),
6585 case lang_padding_statement_enum
:
6586 dot
+= TO_ADDR (s
->padding_statement
.size
);
6589 case lang_group_statement_enum
:
6590 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
6591 current_os
, fill
, dot
, found_end
);
6594 case lang_insert_statement_enum
:
6597 case lang_address_statement_enum
:
6609 lang_do_assignments (lang_phase_type phase
)
6611 bfd_boolean found_end
= FALSE
;
6613 current_section
= NULL
;
6614 prefer_next_section
= FALSE
;
6615 expld
.phase
= phase
;
6616 lang_statement_iteration
++;
6617 lang_do_assignments_1 (statement_list
.head
,
6618 abs_output_section
, NULL
, 0, &found_end
);
6621 /* For an assignment statement outside of an output section statement,
6622 choose the best of neighbouring output sections to use for values
6626 section_for_dot (void)
6630 /* Assignments belong to the previous output section, unless there
6631 has been an assignment to "dot", in which case following
6632 assignments belong to the next output section. (The assumption
6633 is that an assignment to "dot" is setting up the address for the
6634 next output section.) Except that past the assignment to "_end"
6635 we always associate with the previous section. This exception is
6636 for targets like SH that define an alloc .stack or other
6637 weirdness after non-alloc sections. */
6638 if (current_section
== NULL
|| prefer_next_section
)
6640 lang_statement_union_type
*stmt
;
6641 lang_output_section_statement_type
*os
;
6643 for (stmt
= (lang_statement_union_type
*) current_assign
;
6645 stmt
= stmt
->header
.next
)
6646 if (stmt
->header
.type
== lang_output_section_statement_enum
)
6649 os
= &stmt
->output_section_statement
;
6652 && (os
->bfd_section
== NULL
6653 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
6654 || bfd_section_removed_from_list (link_info
.output_bfd
,
6658 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
6661 s
= os
->bfd_section
;
6663 s
= link_info
.output_bfd
->section_last
;
6665 && ((s
->flags
& SEC_ALLOC
) == 0
6666 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6671 return bfd_abs_section_ptr
;
6675 s
= current_section
->bfd_section
;
6677 /* The section may have been stripped. */
6679 && ((s
->flags
& SEC_EXCLUDE
) != 0
6680 || (s
->flags
& SEC_ALLOC
) == 0
6681 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
6682 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
6685 s
= link_info
.output_bfd
->sections
;
6687 && ((s
->flags
& SEC_ALLOC
) == 0
6688 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6693 return bfd_abs_section_ptr
;
6696 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
6698 static struct bfd_link_hash_entry
**start_stop_syms
;
6699 static size_t start_stop_count
= 0;
6700 static size_t start_stop_alloc
= 0;
6702 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6703 to start_stop_syms. */
6706 lang_define_start_stop (const char *symbol
, asection
*sec
)
6708 struct bfd_link_hash_entry
*h
;
6710 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6713 if (start_stop_count
== start_stop_alloc
)
6715 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6717 = xrealloc (start_stop_syms
,
6718 start_stop_alloc
* sizeof (*start_stop_syms
));
6720 start_stop_syms
[start_stop_count
++] = h
;
6724 /* Check for input sections whose names match references to
6725 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6726 preliminary definitions. */
6729 lang_init_start_stop (void)
6733 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6735 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6736 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6739 const char *secname
= s
->name
;
6741 for (ps
= secname
; *ps
!= '\0'; ps
++)
6742 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6746 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6748 symbol
[0] = leading_char
;
6749 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6750 lang_define_start_stop (symbol
, s
);
6752 symbol
[1] = leading_char
;
6753 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6754 lang_define_start_stop (symbol
+ 1, s
);
6761 /* Iterate over start_stop_syms. */
6764 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6768 for (i
= 0; i
< start_stop_count
; ++i
)
6769 func (start_stop_syms
[i
]);
6772 /* __start and __stop symbols are only supposed to be defined by the
6773 linker for orphan sections, but we now extend that to sections that
6774 map to an output section of the same name. The symbols were
6775 defined early for --gc-sections, before we mapped input to output
6776 sections, so undo those that don't satisfy this rule. */
6779 undef_start_stop (struct bfd_link_hash_entry
*h
)
6781 if (h
->ldscript_def
)
6784 if (h
->u
.def
.section
->output_section
== NULL
6785 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6786 || strcmp (h
->u
.def
.section
->name
,
6787 h
->u
.def
.section
->output_section
->name
) != 0)
6789 asection
*sec
= bfd_get_section_by_name (link_info
.output_bfd
,
6790 h
->u
.def
.section
->name
);
6793 /* When there are more than one input sections with the same
6794 section name, SECNAME, linker picks the first one to define
6795 __start_SECNAME and __stop_SECNAME symbols. When the first
6796 input section is removed by comdat group, we need to check
6797 if there is still an output section with section name
6800 for (i
= sec
->map_head
.s
; i
!= NULL
; i
= i
->map_head
.s
)
6801 if (strcmp (h
->u
.def
.section
->name
, i
->name
) == 0)
6803 h
->u
.def
.section
= i
;
6807 h
->type
= bfd_link_hash_undefined
;
6808 h
->u
.undef
.abfd
= NULL
;
6813 lang_undef_start_stop (void)
6815 foreach_start_stop (undef_start_stop
);
6818 /* Check for output sections whose names match references to
6819 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6820 preliminary definitions. */
6823 lang_init_startof_sizeof (void)
6827 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6829 const char *secname
= s
->name
;
6830 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6832 sprintf (symbol
, ".startof.%s", secname
);
6833 lang_define_start_stop (symbol
, s
);
6835 memcpy (symbol
+ 1, ".size", 5);
6836 lang_define_start_stop (symbol
+ 1, s
);
6841 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6844 set_start_stop (struct bfd_link_hash_entry
*h
)
6847 || h
->type
!= bfd_link_hash_defined
)
6850 if (h
->root
.string
[0] == '.')
6852 /* .startof. or .sizeof. symbol.
6853 .startof. already has final value. */
6854 if (h
->root
.string
[2] == 'i')
6857 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6858 h
->u
.def
.section
= bfd_abs_section_ptr
;
6863 /* __start or __stop symbol. */
6864 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6866 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6867 if (h
->root
.string
[4 + has_lead
] == 'o')
6870 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6876 lang_finalize_start_stop (void)
6878 foreach_start_stop (set_start_stop
);
6884 struct bfd_link_hash_entry
*h
;
6887 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
6888 || bfd_link_dll (&link_info
))
6889 warn
= entry_from_cmdline
;
6893 /* Force the user to specify a root when generating a relocatable with
6894 --gc-sections, unless --gc-keep-exported was also given. */
6895 if (bfd_link_relocatable (&link_info
)
6896 && link_info
.gc_sections
6897 && !link_info
.gc_keep_exported
)
6899 struct bfd_sym_chain
*sym
;
6901 for (sym
= link_info
.gc_sym_list
; sym
!= NULL
; sym
= sym
->next
)
6903 h
= bfd_link_hash_lookup (link_info
.hash
, sym
->name
,
6904 FALSE
, FALSE
, FALSE
);
6906 && (h
->type
== bfd_link_hash_defined
6907 || h
->type
== bfd_link_hash_defweak
)
6908 && !bfd_is_const_section (h
->u
.def
.section
))
6912 einfo (_("%F%P: --gc-sections requires a defined symbol root "
6913 "specified by -e or -u\n"));
6916 if (entry_symbol
.name
== NULL
)
6918 /* No entry has been specified. Look for the default entry, but
6919 don't warn if we don't find it. */
6920 entry_symbol
.name
= entry_symbol_default
;
6924 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
6925 FALSE
, FALSE
, TRUE
);
6927 && (h
->type
== bfd_link_hash_defined
6928 || h
->type
== bfd_link_hash_defweak
)
6929 && h
->u
.def
.section
->output_section
!= NULL
)
6933 val
= (h
->u
.def
.value
6934 + bfd_section_vma (h
->u
.def
.section
->output_section
)
6935 + h
->u
.def
.section
->output_offset
);
6936 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6937 einfo (_("%F%P: %s: can't set start address\n"), entry_symbol
.name
);
6944 /* We couldn't find the entry symbol. Try parsing it as a
6946 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
6949 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6950 einfo (_("%F%P: can't set start address\n"));
6956 /* Can't find the entry symbol, and it's not a number. Use
6957 the first address in the text section. */
6958 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
6962 einfo (_("%P: warning: cannot find entry symbol %s;"
6963 " defaulting to %V\n"),
6965 bfd_section_vma (ts
));
6966 if (!bfd_set_start_address (link_info
.output_bfd
,
6967 bfd_section_vma (ts
)))
6968 einfo (_("%F%P: can't set start address\n"));
6973 einfo (_("%P: warning: cannot find entry symbol %s;"
6974 " not setting start address\n"),
6981 /* This is a small function used when we want to ignore errors from
6985 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
6986 va_list ap ATTRIBUTE_UNUSED
)
6988 /* Don't do anything. */
6991 /* Check that the architecture of all the input files is compatible
6992 with the output file. Also call the backend to let it do any
6993 other checking that is needed. */
6998 lang_input_statement_type
*file
;
7000 const bfd_arch_info_type
*compatible
;
7002 for (file
= (void *) file_chain
.head
;
7006 #if BFD_SUPPORTS_PLUGINS
7007 /* Don't check format of files claimed by plugin. */
7008 if (file
->flags
.claimed
)
7010 #endif /* BFD_SUPPORTS_PLUGINS */
7011 input_bfd
= file
->the_bfd
;
7013 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
7014 command_line
.accept_unknown_input_arch
);
7016 /* In general it is not possible to perform a relocatable
7017 link between differing object formats when the input
7018 file has relocations, because the relocations in the
7019 input format may not have equivalent representations in
7020 the output format (and besides BFD does not translate
7021 relocs for other link purposes than a final link). */
7022 if (!file
->flags
.just_syms
7023 && (bfd_link_relocatable (&link_info
)
7024 || link_info
.emitrelocations
)
7025 && (compatible
== NULL
7026 || (bfd_get_flavour (input_bfd
)
7027 != bfd_get_flavour (link_info
.output_bfd
)))
7028 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
7030 einfo (_("%F%P: relocatable linking with relocations from"
7031 " format %s (%pB) to format %s (%pB) is not supported\n"),
7032 bfd_get_target (input_bfd
), input_bfd
,
7033 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
7034 /* einfo with %F exits. */
7037 if (compatible
== NULL
)
7039 if (command_line
.warn_mismatch
)
7040 einfo (_("%X%P: %s architecture of input file `%pB'"
7041 " is incompatible with %s output\n"),
7042 bfd_printable_name (input_bfd
), input_bfd
,
7043 bfd_printable_name (link_info
.output_bfd
));
7046 /* If the input bfd has no contents, it shouldn't set the
7047 private data of the output bfd. */
7048 else if (!file
->flags
.just_syms
7049 && ((input_bfd
->flags
& DYNAMIC
) != 0
7050 || bfd_count_sections (input_bfd
) != 0))
7052 bfd_error_handler_type pfn
= NULL
;
7054 /* If we aren't supposed to warn about mismatched input
7055 files, temporarily set the BFD error handler to a
7056 function which will do nothing. We still want to call
7057 bfd_merge_private_bfd_data, since it may set up
7058 information which is needed in the output file. */
7059 if (!command_line
.warn_mismatch
)
7060 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
7061 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
7063 if (command_line
.warn_mismatch
)
7064 einfo (_("%X%P: failed to merge target specific data"
7065 " of file %pB\n"), input_bfd
);
7067 if (!command_line
.warn_mismatch
)
7068 bfd_set_error_handler (pfn
);
7073 /* Look through all the global common symbols and attach them to the
7074 correct section. The -sort-common command line switch may be used
7075 to roughly sort the entries by alignment. */
7080 if (link_info
.inhibit_common_definition
)
7082 if (bfd_link_relocatable (&link_info
)
7083 && !command_line
.force_common_definition
)
7086 if (!config
.sort_common
)
7087 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
7092 if (config
.sort_common
== sort_descending
)
7094 for (power
= 4; power
> 0; power
--)
7095 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7098 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7102 for (power
= 0; power
<= 4; power
++)
7103 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7105 power
= (unsigned int) -1;
7106 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7111 /* Place one common symbol in the correct section. */
7114 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
7116 unsigned int power_of_two
;
7120 if (h
->type
!= bfd_link_hash_common
)
7124 power_of_two
= h
->u
.c
.p
->alignment_power
;
7126 if (config
.sort_common
== sort_descending
7127 && power_of_two
< *(unsigned int *) info
)
7129 else if (config
.sort_common
== sort_ascending
7130 && power_of_two
> *(unsigned int *) info
)
7133 section
= h
->u
.c
.p
->section
;
7134 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
7135 einfo (_("%F%P: could not define common symbol `%pT': %E\n"),
7138 if (config
.map_file
!= NULL
)
7140 static bfd_boolean header_printed
;
7145 if (!header_printed
)
7147 minfo (_("\nAllocating common symbols\n"));
7148 minfo (_("Common symbol size file\n\n"));
7149 header_printed
= TRUE
;
7152 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
7153 DMGL_ANSI
| DMGL_PARAMS
);
7156 minfo ("%s", h
->root
.string
);
7157 len
= strlen (h
->root
.string
);
7162 len
= strlen (name
);
7178 if (size
<= 0xffffffff)
7179 sprintf (buf
, "%lx", (unsigned long) size
);
7181 sprintf_vma (buf
, size
);
7191 minfo ("%pB\n", section
->owner
);
7197 /* Handle a single orphan section S, placing the orphan into an appropriate
7198 output section. The effects of the --orphan-handling command line
7199 option are handled here. */
7202 ldlang_place_orphan (asection
*s
)
7204 if (config
.orphan_handling
== orphan_handling_discard
)
7206 lang_output_section_statement_type
*os
;
7207 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0, 1);
7208 if (os
->addr_tree
== NULL
7209 && (bfd_link_relocatable (&link_info
)
7210 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7211 os
->addr_tree
= exp_intop (0);
7212 lang_add_section (&os
->children
, s
, NULL
, NULL
, os
);
7216 lang_output_section_statement_type
*os
;
7217 const char *name
= s
->name
;
7220 if (config
.orphan_handling
== orphan_handling_error
)
7221 einfo (_("%X%P: error: unplaced orphan section `%pA' from `%pB'\n"),
7224 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
7225 constraint
= SPECIAL
;
7227 os
= ldemul_place_orphan (s
, name
, constraint
);
7230 os
= lang_output_section_statement_lookup (name
, constraint
, 1);
7231 if (os
->addr_tree
== NULL
7232 && (bfd_link_relocatable (&link_info
)
7233 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7234 os
->addr_tree
= exp_intop (0);
7235 lang_add_section (&os
->children
, s
, NULL
, NULL
, os
);
7238 if (config
.orphan_handling
== orphan_handling_warn
)
7239 einfo (_("%P: warning: orphan section `%pA' from `%pB' being "
7240 "placed in section `%s'\n"),
7241 s
, s
->owner
, os
->name
);
7245 /* Run through the input files and ensure that every input section has
7246 somewhere to go. If one is found without a destination then create
7247 an input request and place it into the statement tree. */
7250 lang_place_orphans (void)
7252 LANG_FOR_EACH_INPUT_STATEMENT (file
)
7256 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
7258 if (s
->output_section
== NULL
)
7260 /* This section of the file is not attached, root
7261 around for a sensible place for it to go. */
7263 if (file
->flags
.just_syms
)
7264 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
7265 else if (lang_discard_section_p (s
))
7266 s
->output_section
= bfd_abs_section_ptr
;
7267 else if (strcmp (s
->name
, "COMMON") == 0)
7269 /* This is a lonely common section which must have
7270 come from an archive. We attach to the section
7271 with the wildcard. */
7272 if (!bfd_link_relocatable (&link_info
)
7273 || command_line
.force_common_definition
)
7275 if (default_common_section
== NULL
)
7276 default_common_section
7277 = lang_output_section_statement_lookup (".bss", 0, 1);
7278 lang_add_section (&default_common_section
->children
, s
,
7279 NULL
, NULL
, default_common_section
);
7283 ldlang_place_orphan (s
);
7290 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
7292 flagword
*ptr_flags
;
7294 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7300 /* PR 17900: An exclamation mark in the attributes reverses
7301 the sense of any of the attributes that follow. */
7304 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7308 *ptr_flags
|= SEC_ALLOC
;
7312 *ptr_flags
|= SEC_READONLY
;
7316 *ptr_flags
|= SEC_DATA
;
7320 *ptr_flags
|= SEC_CODE
;
7325 *ptr_flags
|= SEC_LOAD
;
7329 einfo (_("%F%P: invalid character %c (%d) in flags\n"),
7337 /* Call a function on each real input file. This function will be
7338 called on an archive, but not on the elements. */
7341 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
7343 lang_input_statement_type
*f
;
7345 for (f
= (void *) input_file_chain
.head
;
7347 f
= f
->next_real_file
)
7352 /* Call a function on each real file. The function will be called on
7353 all the elements of an archive which are included in the link, but
7354 will not be called on the archive file itself. */
7357 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
7359 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7367 ldlang_add_file (lang_input_statement_type
*entry
)
7369 lang_statement_append (&file_chain
, entry
, &entry
->next
);
7371 /* The BFD linker needs to have a list of all input BFDs involved in
7373 ASSERT (link_info
.input_bfds_tail
!= &entry
->the_bfd
->link
.next
7374 && entry
->the_bfd
->link
.next
== NULL
);
7375 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
7377 *link_info
.input_bfds_tail
= entry
->the_bfd
;
7378 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
7379 bfd_set_usrdata (entry
->the_bfd
, entry
);
7380 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
7382 /* Look through the sections and check for any which should not be
7383 included in the link. We need to do this now, so that we can
7384 notice when the backend linker tries to report multiple
7385 definition errors for symbols which are in sections we aren't
7386 going to link. FIXME: It might be better to entirely ignore
7387 symbols which are defined in sections which are going to be
7388 discarded. This would require modifying the backend linker for
7389 each backend which might set the SEC_LINK_ONCE flag. If we do
7390 this, we should probably handle SEC_EXCLUDE in the same way. */
7392 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
7396 lang_add_output (const char *name
, int from_script
)
7398 /* Make -o on command line override OUTPUT in script. */
7399 if (!had_output_filename
|| !from_script
)
7401 output_filename
= name
;
7402 had_output_filename
= TRUE
;
7406 lang_output_section_statement_type
*
7407 lang_enter_output_section_statement (const char *output_section_statement_name
,
7408 etree_type
*address_exp
,
7409 enum section_type sectype
,
7411 etree_type
*subalign
,
7414 int align_with_input
)
7416 lang_output_section_statement_type
*os
;
7418 os
= lang_output_section_statement_lookup (output_section_statement_name
,
7420 current_section
= os
;
7422 if (os
->addr_tree
== NULL
)
7424 os
->addr_tree
= address_exp
;
7426 os
->sectype
= sectype
;
7427 if (sectype
!= noload_section
)
7428 os
->flags
= SEC_NO_FLAGS
;
7430 os
->flags
= SEC_NEVER_LOAD
;
7431 os
->block_value
= 1;
7433 /* Make next things chain into subchain of this. */
7434 push_stat_ptr (&os
->children
);
7436 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
7437 if (os
->align_lma_with_input
&& align
!= NULL
)
7438 einfo (_("%F%P:%pS: error: align with input and explicit align specified\n"),
7441 os
->subsection_alignment
= subalign
;
7442 os
->section_alignment
= align
;
7444 os
->load_base
= ebase
;
7451 lang_output_statement_type
*new_stmt
;
7453 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
7454 new_stmt
->name
= output_filename
;
7457 /* Reset the current counters in the regions. */
7460 lang_reset_memory_regions (void)
7462 lang_memory_region_type
*p
= lang_memory_region_list
;
7464 lang_output_section_statement_type
*os
;
7466 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
7468 p
->current
= p
->origin
;
7472 for (os
= (void *) lang_os_list
.head
;
7476 os
->processed_vma
= FALSE
;
7477 os
->processed_lma
= FALSE
;
7480 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
7482 /* Save the last size for possible use by bfd_relax_section. */
7483 o
->rawsize
= o
->size
;
7484 if (!(o
->flags
& SEC_FIXED_SIZE
))
7489 /* Worker for lang_gc_sections_1. */
7492 gc_section_callback (lang_wild_statement_type
*ptr
,
7493 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7495 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7496 void *data ATTRIBUTE_UNUSED
)
7498 /* If the wild pattern was marked KEEP, the member sections
7499 should be as well. */
7500 if (ptr
->keep_sections
)
7501 section
->flags
|= SEC_KEEP
;
7504 /* Iterate over sections marking them against GC. */
7507 lang_gc_sections_1 (lang_statement_union_type
*s
)
7509 for (; s
!= NULL
; s
= s
->header
.next
)
7511 switch (s
->header
.type
)
7513 case lang_wild_statement_enum
:
7514 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
7516 case lang_constructors_statement_enum
:
7517 lang_gc_sections_1 (constructor_list
.head
);
7519 case lang_output_section_statement_enum
:
7520 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
7522 case lang_group_statement_enum
:
7523 lang_gc_sections_1 (s
->group_statement
.children
.head
);
7532 lang_gc_sections (void)
7534 /* Keep all sections so marked in the link script. */
7535 lang_gc_sections_1 (statement_list
.head
);
7537 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
7538 the special case of debug info. (See bfd/stabs.c)
7539 Twiddle the flag here, to simplify later linker code. */
7540 if (bfd_link_relocatable (&link_info
))
7542 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7545 #if BFD_SUPPORTS_PLUGINS
7546 if (f
->flags
.claimed
)
7549 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
7550 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
7551 sec
->flags
&= ~SEC_EXCLUDE
;
7555 if (link_info
.gc_sections
)
7556 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
7559 /* Worker for lang_find_relro_sections_1. */
7562 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
7563 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7565 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7568 /* Discarded, excluded and ignored sections effectively have zero
7570 if (section
->output_section
!= NULL
7571 && section
->output_section
->owner
== link_info
.output_bfd
7572 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
7573 && !IGNORE_SECTION (section
)
7574 && section
->size
!= 0)
7576 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
7577 *has_relro_section
= TRUE
;
7581 /* Iterate over sections for relro sections. */
7584 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
7585 seg_align_type
*seg
,
7586 bfd_boolean
*has_relro_section
)
7588 if (*has_relro_section
)
7591 for (; s
!= NULL
; s
= s
->header
.next
)
7593 if (s
== seg
->relro_end_stat
)
7596 switch (s
->header
.type
)
7598 case lang_wild_statement_enum
:
7599 walk_wild (&s
->wild_statement
,
7600 find_relro_section_callback
,
7603 case lang_constructors_statement_enum
:
7604 lang_find_relro_sections_1 (constructor_list
.head
,
7605 seg
, has_relro_section
);
7607 case lang_output_section_statement_enum
:
7608 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
7609 seg
, has_relro_section
);
7611 case lang_group_statement_enum
:
7612 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
7613 seg
, has_relro_section
);
7622 lang_find_relro_sections (void)
7624 bfd_boolean has_relro_section
= FALSE
;
7626 /* Check all sections in the link script. */
7628 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
7629 &expld
.dataseg
, &has_relro_section
);
7631 if (!has_relro_section
)
7632 link_info
.relro
= FALSE
;
7635 /* Relax all sections until bfd_relax_section gives up. */
7638 lang_relax_sections (bfd_boolean need_layout
)
7640 if (RELAXATION_ENABLED
)
7642 /* We may need more than one relaxation pass. */
7643 int i
= link_info
.relax_pass
;
7645 /* The backend can use it to determine the current pass. */
7646 link_info
.relax_pass
= 0;
7650 /* Keep relaxing until bfd_relax_section gives up. */
7651 bfd_boolean relax_again
;
7653 link_info
.relax_trip
= -1;
7656 link_info
.relax_trip
++;
7658 /* Note: pe-dll.c does something like this also. If you find
7659 you need to change this code, you probably need to change
7660 pe-dll.c also. DJ */
7662 /* Do all the assignments with our current guesses as to
7664 lang_do_assignments (lang_assigning_phase_enum
);
7666 /* We must do this after lang_do_assignments, because it uses
7668 lang_reset_memory_regions ();
7670 /* Perform another relax pass - this time we know where the
7671 globals are, so can make a better guess. */
7672 relax_again
= FALSE
;
7673 lang_size_sections (&relax_again
, FALSE
);
7675 while (relax_again
);
7677 link_info
.relax_pass
++;
7684 /* Final extra sizing to report errors. */
7685 lang_do_assignments (lang_assigning_phase_enum
);
7686 lang_reset_memory_regions ();
7687 lang_size_sections (NULL
, TRUE
);
7691 #if BFD_SUPPORTS_PLUGINS
7692 /* Find the insert point for the plugin's replacement files. We
7693 place them after the first claimed real object file, or if the
7694 first claimed object is an archive member, after the last real
7695 object file immediately preceding the archive. In the event
7696 no objects have been claimed at all, we return the first dummy
7697 object file on the list as the insert point; that works, but
7698 the callee must be careful when relinking the file_chain as it
7699 is not actually on that chain, only the statement_list and the
7700 input_file list; in that case, the replacement files must be
7701 inserted at the head of the file_chain. */
7703 static lang_input_statement_type
*
7704 find_replacements_insert_point (bfd_boolean
*before
)
7706 lang_input_statement_type
*claim1
, *lastobject
;
7707 lastobject
= (void *) input_file_chain
.head
;
7708 for (claim1
= (void *) file_chain
.head
;
7710 claim1
= claim1
->next
)
7712 if (claim1
->flags
.claimed
)
7714 *before
= claim1
->flags
.claim_archive
;
7715 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
7717 /* Update lastobject if this is a real object file. */
7718 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
7719 lastobject
= claim1
;
7721 /* No files were claimed by the plugin. Choose the last object
7722 file found on the list (maybe the first, dummy entry) as the
7728 /* Find where to insert ADD, an archive element or shared library
7729 added during a rescan. */
7731 static lang_input_statement_type
**
7732 find_rescan_insertion (lang_input_statement_type
*add
)
7734 bfd
*add_bfd
= add
->the_bfd
;
7735 lang_input_statement_type
*f
;
7736 lang_input_statement_type
*last_loaded
= NULL
;
7737 lang_input_statement_type
*before
= NULL
;
7738 lang_input_statement_type
**iter
= NULL
;
7740 if (add_bfd
->my_archive
!= NULL
)
7741 add_bfd
= add_bfd
->my_archive
;
7743 /* First look through the input file chain, to find an object file
7744 before the one we've rescanned. Normal object files always
7745 appear on both the input file chain and the file chain, so this
7746 lets us get quickly to somewhere near the correct place on the
7747 file chain if it is full of archive elements. Archives don't
7748 appear on the file chain, but if an element has been extracted
7749 then their input_statement->next points at it. */
7750 for (f
= (void *) input_file_chain
.head
;
7752 f
= f
->next_real_file
)
7754 if (f
->the_bfd
== add_bfd
)
7756 before
= last_loaded
;
7757 if (f
->next
!= NULL
)
7758 return &f
->next
->next
;
7760 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7764 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7766 iter
= &(*iter
)->next
)
7767 if (!(*iter
)->flags
.claim_archive
7768 && (*iter
)->the_bfd
->my_archive
== NULL
)
7774 /* Insert SRCLIST into DESTLIST after given element by chaining
7775 on FIELD as the next-pointer. (Counterintuitively does not need
7776 a pointer to the actual after-node itself, just its chain field.) */
7779 lang_list_insert_after (lang_statement_list_type
*destlist
,
7780 lang_statement_list_type
*srclist
,
7781 lang_statement_union_type
**field
)
7783 *(srclist
->tail
) = *field
;
7784 *field
= srclist
->head
;
7785 if (destlist
->tail
== field
)
7786 destlist
->tail
= srclist
->tail
;
7789 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7790 was taken as a copy of it and leave them in ORIGLIST. */
7793 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7794 lang_statement_list_type
*origlist
)
7796 union lang_statement_union
**savetail
;
7797 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7798 ASSERT (origlist
->head
== destlist
->head
);
7799 savetail
= origlist
->tail
;
7800 origlist
->head
= *(savetail
);
7801 origlist
->tail
= destlist
->tail
;
7802 destlist
->tail
= savetail
;
7806 static lang_statement_union_type
**
7807 find_next_input_statement (lang_statement_union_type
**s
)
7809 for ( ; *s
; s
= &(*s
)->header
.next
)
7811 lang_statement_union_type
**t
;
7812 switch ((*s
)->header
.type
)
7814 case lang_input_statement_enum
:
7816 case lang_wild_statement_enum
:
7817 t
= &(*s
)->wild_statement
.children
.head
;
7819 case lang_group_statement_enum
:
7820 t
= &(*s
)->group_statement
.children
.head
;
7822 case lang_output_section_statement_enum
:
7823 t
= &(*s
)->output_section_statement
.children
.head
;
7828 t
= find_next_input_statement (t
);
7834 #endif /* BFD_SUPPORTS_PLUGINS */
7836 /* Add NAME to the list of garbage collection entry points. */
7839 lang_add_gc_name (const char *name
)
7841 struct bfd_sym_chain
*sym
;
7846 sym
= stat_alloc (sizeof (*sym
));
7848 sym
->next
= link_info
.gc_sym_list
;
7850 link_info
.gc_sym_list
= sym
;
7853 /* Check relocations. */
7856 lang_check_relocs (void)
7858 if (link_info
.check_relocs_after_open_input
)
7862 for (abfd
= link_info
.input_bfds
;
7863 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7864 if (!bfd_link_check_relocs (abfd
, &link_info
))
7866 /* No object output, fail return. */
7867 config
.make_executable
= FALSE
;
7868 /* Note: we do not abort the loop, but rather
7869 continue the scan in case there are other
7870 bad relocations to report. */
7875 /* Look through all output sections looking for places where we can
7876 propagate forward the lma region. */
7879 lang_propagate_lma_regions (void)
7881 lang_output_section_statement_type
*os
;
7883 for (os
= (void *) lang_os_list
.head
;
7887 if (os
->prev
!= NULL
7888 && os
->lma_region
== NULL
7889 && os
->load_base
== NULL
7890 && os
->addr_tree
== NULL
7891 && os
->region
== os
->prev
->region
)
7892 os
->lma_region
= os
->prev
->lma_region
;
7899 /* Finalize dynamic list. */
7900 if (link_info
.dynamic_list
)
7901 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
7903 current_target
= default_target
;
7905 /* Open the output file. */
7906 lang_for_each_statement (ldlang_open_output
);
7909 ldemul_create_output_section_statements ();
7911 /* Add to the hash table all undefineds on the command line. */
7912 lang_place_undefineds ();
7914 if (!bfd_section_already_linked_table_init ())
7915 einfo (_("%F%P: can not create hash table: %E\n"));
7917 /* A first pass through the memory regions ensures that if any region
7918 references a symbol for its origin or length then this symbol will be
7919 added to the symbol table. Having these symbols in the symbol table
7920 means that when we call open_input_bfds PROVIDE statements will
7921 trigger to provide any needed symbols. The regions origins and
7922 lengths are not assigned as a result of this call. */
7923 lang_do_memory_regions (FALSE
);
7925 /* Create a bfd for each input file. */
7926 current_target
= default_target
;
7927 lang_statement_iteration
++;
7928 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
7930 /* Now that open_input_bfds has processed assignments and provide
7931 statements we can give values to symbolic origin/length now. */
7932 lang_do_memory_regions (TRUE
);
7934 #if BFD_SUPPORTS_PLUGINS
7935 if (link_info
.lto_plugin_active
)
7937 lang_statement_list_type added
;
7938 lang_statement_list_type files
, inputfiles
;
7940 /* Now all files are read, let the plugin(s) decide if there
7941 are any more to be added to the link before we call the
7942 emulation's after_open hook. We create a private list of
7943 input statements for this purpose, which we will eventually
7944 insert into the global statement list after the first claimed
7947 /* We need to manipulate all three chains in synchrony. */
7949 inputfiles
= input_file_chain
;
7950 if (plugin_call_all_symbols_read ())
7951 einfo (_("%F%P: %s: plugin reported error after all symbols read\n"),
7952 plugin_error_plugin ());
7953 link_info
.lto_all_symbols_read
= TRUE
;
7954 /* Open any newly added files, updating the file chains. */
7955 plugin_undefs
= link_info
.hash
->undefs_tail
;
7956 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
7957 if (plugin_undefs
== link_info
.hash
->undefs_tail
)
7958 plugin_undefs
= NULL
;
7959 /* Restore the global list pointer now they have all been added. */
7960 lang_list_remove_tail (stat_ptr
, &added
);
7961 /* And detach the fresh ends of the file lists. */
7962 lang_list_remove_tail (&file_chain
, &files
);
7963 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
7964 /* Were any new files added? */
7965 if (added
.head
!= NULL
)
7967 /* If so, we will insert them into the statement list immediately
7968 after the first input file that was claimed by the plugin,
7969 unless that file was an archive in which case it is inserted
7970 immediately before. */
7972 lang_statement_union_type
**prev
;
7973 plugin_insert
= find_replacements_insert_point (&before
);
7974 /* If a plugin adds input files without having claimed any, we
7975 don't really have a good idea where to place them. Just putting
7976 them at the start or end of the list is liable to leave them
7977 outside the crtbegin...crtend range. */
7978 ASSERT (plugin_insert
!= NULL
);
7979 /* Splice the new statement list into the old one. */
7980 prev
= &plugin_insert
->header
.next
;
7983 prev
= find_next_input_statement (prev
);
7984 if (*prev
!= (void *) plugin_insert
->next_real_file
)
7986 /* We didn't find the expected input statement.
7987 Fall back to adding after plugin_insert. */
7988 prev
= &plugin_insert
->header
.next
;
7991 lang_list_insert_after (stat_ptr
, &added
, prev
);
7992 /* Likewise for the file chains. */
7993 lang_list_insert_after (&input_file_chain
, &inputfiles
,
7994 (void *) &plugin_insert
->next_real_file
);
7995 /* We must be careful when relinking file_chain; we may need to
7996 insert the new files at the head of the list if the insert
7997 point chosen is the dummy first input file. */
7998 if (plugin_insert
->filename
)
7999 lang_list_insert_after (&file_chain
, &files
,
8000 (void *) &plugin_insert
->next
);
8002 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
8004 /* Rescan archives in case new undefined symbols have appeared. */
8006 lang_statement_iteration
++;
8007 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
8008 lang_list_remove_tail (&file_chain
, &files
);
8009 while (files
.head
!= NULL
)
8011 lang_input_statement_type
**insert
;
8012 lang_input_statement_type
**iter
, *temp
;
8015 insert
= find_rescan_insertion (&files
.head
->input_statement
);
8016 /* All elements from an archive can be added at once. */
8017 iter
= &files
.head
->input_statement
.next
;
8018 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
8019 if (my_arch
!= NULL
)
8020 for (; *iter
!= NULL
; iter
= &(*iter
)->next
)
8021 if ((*iter
)->the_bfd
->my_archive
!= my_arch
)
8024 *insert
= &files
.head
->input_statement
;
8025 files
.head
= (lang_statement_union_type
*) *iter
;
8027 if (my_arch
!= NULL
)
8029 lang_input_statement_type
*parent
= bfd_usrdata (my_arch
);
8031 parent
->next
= (lang_input_statement_type
*)
8033 - offsetof (lang_input_statement_type
, next
));
8038 #endif /* BFD_SUPPORTS_PLUGINS */
8040 /* Make sure that nobody has tried to add a symbol to this list
8042 ASSERT (link_info
.gc_sym_list
== NULL
);
8044 link_info
.gc_sym_list
= &entry_symbol
;
8046 if (entry_symbol
.name
== NULL
)
8048 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
8050 /* entry_symbol is normally initialied by a ENTRY definition in the
8051 linker script or the -e command line option. But if neither of
8052 these have been used, the target specific backend may still have
8053 provided an entry symbol via a call to lang_default_entry().
8054 Unfortunately this value will not be processed until lang_end()
8055 is called, long after this function has finished. So detect this
8056 case here and add the target's entry symbol to the list of starting
8057 points for garbage collection resolution. */
8058 lang_add_gc_name (entry_symbol_default
);
8061 lang_add_gc_name (link_info
.init_function
);
8062 lang_add_gc_name (link_info
.fini_function
);
8064 ldemul_after_open ();
8065 if (config
.map_file
!= NULL
)
8066 lang_print_asneeded ();
8070 bfd_section_already_linked_table_free ();
8072 /* Make sure that we're not mixing architectures. We call this
8073 after all the input files have been opened, but before we do any
8074 other processing, so that any operations merge_private_bfd_data
8075 does on the output file will be known during the rest of the
8079 /* Handle .exports instead of a version script if we're told to do so. */
8080 if (command_line
.version_exports_section
)
8081 lang_do_version_exports_section ();
8083 /* Build all sets based on the information gathered from the input
8085 ldctor_build_sets ();
8087 /* Give initial values for __start and __stop symbols, so that ELF
8088 gc_sections will keep sections referenced by these symbols. Must
8089 be done before lang_do_assignments below. */
8090 if (config
.build_constructors
)
8091 lang_init_start_stop ();
8093 /* PR 13683: We must rerun the assignments prior to running garbage
8094 collection in order to make sure that all symbol aliases are resolved. */
8095 lang_do_assignments (lang_mark_phase_enum
);
8096 expld
.phase
= lang_first_phase_enum
;
8098 /* Size up the common data. */
8101 /* Remove unreferenced sections if asked to. */
8102 lang_gc_sections ();
8104 /* Check relocations. */
8105 lang_check_relocs ();
8107 ldemul_after_check_relocs ();
8109 /* Update wild statements. */
8110 update_wild_statements (statement_list
.head
);
8112 /* Run through the contours of the script and attach input sections
8113 to the correct output sections. */
8114 lang_statement_iteration
++;
8115 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
8117 /* Start at the statement immediately after the special abs_section
8118 output statement, so that it isn't reordered. */
8119 process_insert_statements (&lang_os_list
.head
->header
.next
);
8121 ldemul_before_place_orphans ();
8123 /* Find any sections not attached explicitly and handle them. */
8124 lang_place_orphans ();
8126 if (!bfd_link_relocatable (&link_info
))
8130 /* Merge SEC_MERGE sections. This has to be done after GC of
8131 sections, so that GCed sections are not merged, but before
8132 assigning dynamic symbols, since removing whole input sections
8134 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
8136 /* Look for a text section and set the readonly attribute in it. */
8137 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
8141 if (config
.text_read_only
)
8142 found
->flags
|= SEC_READONLY
;
8144 found
->flags
&= ~SEC_READONLY
;
8148 /* Merge together CTF sections. After this, only the symtab-dependent
8149 function and data object sections need adjustment. */
8152 /* Emit the CTF, iff the emulation doesn't need to do late emission after
8153 examining things laid out late, like the strtab. */
8156 /* Copy forward lma regions for output sections in same lma region. */
8157 lang_propagate_lma_regions ();
8159 /* Defining __start/__stop symbols early for --gc-sections to work
8160 around a glibc build problem can result in these symbols being
8161 defined when they should not be. Fix them now. */
8162 if (config
.build_constructors
)
8163 lang_undef_start_stop ();
8165 /* Define .startof./.sizeof. symbols with preliminary values before
8166 dynamic symbols are created. */
8167 if (!bfd_link_relocatable (&link_info
))
8168 lang_init_startof_sizeof ();
8170 /* Do anything special before sizing sections. This is where ELF
8171 and other back-ends size dynamic sections. */
8172 ldemul_before_allocation ();
8174 /* We must record the program headers before we try to fix the
8175 section positions, since they will affect SIZEOF_HEADERS. */
8176 lang_record_phdrs ();
8178 /* Check relro sections. */
8179 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
8180 lang_find_relro_sections ();
8182 /* Size up the sections. */
8183 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
8185 /* See if anything special should be done now we know how big
8186 everything is. This is where relaxation is done. */
8187 ldemul_after_allocation ();
8189 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
8190 lang_finalize_start_stop ();
8192 /* Do all the assignments again, to report errors. Assignment
8193 statements are processed multiple times, updating symbols; In
8194 open_input_bfds, lang_do_assignments, and lang_size_sections.
8195 Since lang_relax_sections calls lang_do_assignments, symbols are
8196 also updated in ldemul_after_allocation. */
8197 lang_do_assignments (lang_final_phase_enum
);
8201 /* Convert absolute symbols to section relative. */
8202 ldexp_finalize_syms ();
8204 /* Make sure that the section addresses make sense. */
8205 if (command_line
.check_section_addresses
)
8206 lang_check_section_addresses ();
8208 /* Check any required symbols are known. */
8209 ldlang_check_require_defined_symbols ();
8214 /* EXPORTED TO YACC */
8217 lang_add_wild (struct wildcard_spec
*filespec
,
8218 struct wildcard_list
*section_list
,
8219 bfd_boolean keep_sections
)
8221 struct wildcard_list
*curr
, *next
;
8222 lang_wild_statement_type
*new_stmt
;
8224 /* Reverse the list as the parser puts it back to front. */
8225 for (curr
= section_list
, section_list
= NULL
;
8227 section_list
= curr
, curr
= next
)
8230 curr
->next
= section_list
;
8233 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
8235 if (strcmp (filespec
->name
, "*") == 0)
8236 filespec
->name
= NULL
;
8237 else if (!wildcardp (filespec
->name
))
8238 lang_has_input_file
= TRUE
;
8241 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
8242 new_stmt
->filename
= NULL
;
8243 new_stmt
->filenames_sorted
= FALSE
;
8244 new_stmt
->section_flag_list
= NULL
;
8245 new_stmt
->exclude_name_list
= NULL
;
8246 if (filespec
!= NULL
)
8248 new_stmt
->filename
= filespec
->name
;
8249 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
8250 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
8251 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
8253 new_stmt
->section_list
= section_list
;
8254 new_stmt
->keep_sections
= keep_sections
;
8255 lang_list_init (&new_stmt
->children
);
8256 analyze_walk_wild_section_handler (new_stmt
);
8260 lang_section_start (const char *name
, etree_type
*address
,
8261 const segment_type
*segment
)
8263 lang_address_statement_type
*ad
;
8265 ad
= new_stat (lang_address_statement
, stat_ptr
);
8266 ad
->section_name
= name
;
8267 ad
->address
= address
;
8268 ad
->segment
= segment
;
8271 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
8272 because of a -e argument on the command line, or zero if this is
8273 called by ENTRY in a linker script. Command line arguments take
8277 lang_add_entry (const char *name
, bfd_boolean cmdline
)
8279 if (entry_symbol
.name
== NULL
8281 || !entry_from_cmdline
)
8283 entry_symbol
.name
= name
;
8284 entry_from_cmdline
= cmdline
;
8288 /* Set the default start symbol to NAME. .em files should use this,
8289 not lang_add_entry, to override the use of "start" if neither the
8290 linker script nor the command line specifies an entry point. NAME
8291 must be permanently allocated. */
8293 lang_default_entry (const char *name
)
8295 entry_symbol_default
= name
;
8299 lang_add_target (const char *name
)
8301 lang_target_statement_type
*new_stmt
;
8303 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
8304 new_stmt
->target
= name
;
8308 lang_add_map (const char *name
)
8315 map_option_f
= TRUE
;
8323 lang_add_fill (fill_type
*fill
)
8325 lang_fill_statement_type
*new_stmt
;
8327 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
8328 new_stmt
->fill
= fill
;
8332 lang_add_data (int type
, union etree_union
*exp
)
8334 lang_data_statement_type
*new_stmt
;
8336 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
8337 new_stmt
->exp
= exp
;
8338 new_stmt
->type
= type
;
8341 /* Create a new reloc statement. RELOC is the BFD relocation type to
8342 generate. HOWTO is the corresponding howto structure (we could
8343 look this up, but the caller has already done so). SECTION is the
8344 section to generate a reloc against, or NAME is the name of the
8345 symbol to generate a reloc against. Exactly one of SECTION and
8346 NAME must be NULL. ADDEND is an expression for the addend. */
8349 lang_add_reloc (bfd_reloc_code_real_type reloc
,
8350 reloc_howto_type
*howto
,
8353 union etree_union
*addend
)
8355 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
8359 p
->section
= section
;
8361 p
->addend_exp
= addend
;
8363 p
->addend_value
= 0;
8364 p
->output_section
= NULL
;
8365 p
->output_offset
= 0;
8368 lang_assignment_statement_type
*
8369 lang_add_assignment (etree_type
*exp
)
8371 lang_assignment_statement_type
*new_stmt
;
8373 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
8374 new_stmt
->exp
= exp
;
8379 lang_add_attribute (enum statement_enum attribute
)
8381 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
8385 lang_startup (const char *name
)
8387 if (first_file
->filename
!= NULL
)
8389 einfo (_("%F%P: multiple STARTUP files\n"));
8391 first_file
->filename
= name
;
8392 first_file
->local_sym_name
= name
;
8393 first_file
->flags
.real
= TRUE
;
8397 lang_float (bfd_boolean maybe
)
8399 lang_float_flag
= maybe
;
8403 /* Work out the load- and run-time regions from a script statement, and
8404 store them in *LMA_REGION and *REGION respectively.
8406 MEMSPEC is the name of the run-time region, or the value of
8407 DEFAULT_MEMORY_REGION if the statement didn't specify one.
8408 LMA_MEMSPEC is the name of the load-time region, or null if the
8409 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
8410 had an explicit load address.
8412 It is an error to specify both a load region and a load address. */
8415 lang_get_regions (lang_memory_region_type
**region
,
8416 lang_memory_region_type
**lma_region
,
8417 const char *memspec
,
8418 const char *lma_memspec
,
8419 bfd_boolean have_lma
,
8420 bfd_boolean have_vma
)
8422 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
8424 /* If no runtime region or VMA has been specified, but the load region
8425 has been specified, then use the load region for the runtime region
8427 if (lma_memspec
!= NULL
8429 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
8430 *region
= *lma_region
;
8432 *region
= lang_memory_region_lookup (memspec
, FALSE
);
8434 if (have_lma
&& lma_memspec
!= 0)
8435 einfo (_("%X%P:%pS: section has both a load address and a load region\n"),
8440 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
8441 lang_output_section_phdr_list
*phdrs
,
8442 const char *lma_memspec
)
8444 lang_get_regions (¤t_section
->region
,
8445 ¤t_section
->lma_region
,
8446 memspec
, lma_memspec
,
8447 current_section
->load_base
!= NULL
,
8448 current_section
->addr_tree
!= NULL
);
8450 current_section
->fill
= fill
;
8451 current_section
->phdrs
= phdrs
;
8455 /* Set the output format type. -oformat overrides scripts. */
8458 lang_add_output_format (const char *format
,
8463 if (output_target
== NULL
|| !from_script
)
8465 if (command_line
.endian
== ENDIAN_BIG
8468 else if (command_line
.endian
== ENDIAN_LITTLE
8472 output_target
= format
;
8477 lang_add_insert (const char *where
, int is_before
)
8479 lang_insert_statement_type
*new_stmt
;
8481 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
8482 new_stmt
->where
= where
;
8483 new_stmt
->is_before
= is_before
;
8484 saved_script_handle
= previous_script_handle
;
8487 /* Enter a group. This creates a new lang_group_statement, and sets
8488 stat_ptr to build new statements within the group. */
8491 lang_enter_group (void)
8493 lang_group_statement_type
*g
;
8495 g
= new_stat (lang_group_statement
, stat_ptr
);
8496 lang_list_init (&g
->children
);
8497 push_stat_ptr (&g
->children
);
8500 /* Leave a group. This just resets stat_ptr to start writing to the
8501 regular list of statements again. Note that this will not work if
8502 groups can occur inside anything else which can adjust stat_ptr,
8503 but currently they can't. */
8506 lang_leave_group (void)
8511 /* Add a new program header. This is called for each entry in a PHDRS
8512 command in a linker script. */
8515 lang_new_phdr (const char *name
,
8517 bfd_boolean filehdr
,
8522 struct lang_phdr
*n
, **pp
;
8525 n
= stat_alloc (sizeof (struct lang_phdr
));
8528 n
->type
= exp_get_vma (type
, 0, "program header type");
8529 n
->filehdr
= filehdr
;
8534 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
8536 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8539 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
8541 einfo (_("%X%P:%pS: PHDRS and FILEHDR are not supported"
8542 " when prior PT_LOAD headers lack them\n"), NULL
);
8549 /* Record the program header information in the output BFD. FIXME: We
8550 should not be calling an ELF specific function here. */
8553 lang_record_phdrs (void)
8557 lang_output_section_phdr_list
*last
;
8558 struct lang_phdr
*l
;
8559 lang_output_section_statement_type
*os
;
8562 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
8565 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
8572 for (os
= (void *) lang_os_list
.head
;
8576 lang_output_section_phdr_list
*pl
;
8578 if (os
->constraint
< 0)
8586 if (os
->sectype
== noload_section
8587 || os
->bfd_section
== NULL
8588 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
8591 /* Don't add orphans to PT_INTERP header. */
8597 lang_output_section_statement_type
*tmp_os
;
8599 /* If we have not run across a section with a program
8600 header assigned to it yet, then scan forwards to find
8601 one. This prevents inconsistencies in the linker's
8602 behaviour when a script has specified just a single
8603 header and there are sections in that script which are
8604 not assigned to it, and which occur before the first
8605 use of that header. See here for more details:
8606 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
8607 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
8610 last
= tmp_os
->phdrs
;
8614 einfo (_("%F%P: no sections assigned to phdrs\n"));
8619 if (os
->bfd_section
== NULL
)
8622 for (; pl
!= NULL
; pl
= pl
->next
)
8624 if (strcmp (pl
->name
, l
->name
) == 0)
8629 secs
= (asection
**) xrealloc (secs
,
8630 alc
* sizeof (asection
*));
8632 secs
[c
] = os
->bfd_section
;
8639 if (l
->flags
== NULL
)
8642 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
8647 at
= exp_get_vma (l
->at
, 0, "phdr load address");
8649 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
8650 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
8651 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
8652 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
8657 /* Make sure all the phdr assignments succeeded. */
8658 for (os
= (void *) lang_os_list
.head
;
8662 lang_output_section_phdr_list
*pl
;
8664 if (os
->constraint
< 0
8665 || os
->bfd_section
== NULL
)
8668 for (pl
= os
->phdrs
;
8671 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
8672 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
8673 os
->name
, pl
->name
);
8677 /* Record a list of sections which may not be cross referenced. */
8680 lang_add_nocrossref (lang_nocrossref_type
*l
)
8682 struct lang_nocrossrefs
*n
;
8684 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
8685 n
->next
= nocrossref_list
;
8687 n
->onlyfirst
= FALSE
;
8688 nocrossref_list
= n
;
8690 /* Set notice_all so that we get informed about all symbols. */
8691 link_info
.notice_all
= TRUE
;
8694 /* Record a section that cannot be referenced from a list of sections. */
8697 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
8699 lang_add_nocrossref (l
);
8700 nocrossref_list
->onlyfirst
= TRUE
;
8703 /* Overlay handling. We handle overlays with some static variables. */
8705 /* The overlay virtual address. */
8706 static etree_type
*overlay_vma
;
8707 /* And subsection alignment. */
8708 static etree_type
*overlay_subalign
;
8710 /* An expression for the maximum section size seen so far. */
8711 static etree_type
*overlay_max
;
8713 /* A list of all the sections in this overlay. */
8715 struct overlay_list
{
8716 struct overlay_list
*next
;
8717 lang_output_section_statement_type
*os
;
8720 static struct overlay_list
*overlay_list
;
8722 /* Start handling an overlay. */
8725 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
8727 /* The grammar should prevent nested overlays from occurring. */
8728 ASSERT (overlay_vma
== NULL
8729 && overlay_subalign
== NULL
8730 && overlay_max
== NULL
);
8732 overlay_vma
= vma_expr
;
8733 overlay_subalign
= subalign
;
8736 /* Start a section in an overlay. We handle this by calling
8737 lang_enter_output_section_statement with the correct VMA.
8738 lang_leave_overlay sets up the LMA and memory regions. */
8741 lang_enter_overlay_section (const char *name
)
8743 struct overlay_list
*n
;
8746 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
8747 0, overlay_subalign
, 0, 0, 0);
8749 /* If this is the first section, then base the VMA of future
8750 sections on this one. This will work correctly even if `.' is
8751 used in the addresses. */
8752 if (overlay_list
== NULL
)
8753 overlay_vma
= exp_nameop (ADDR
, name
);
8755 /* Remember the section. */
8756 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
8757 n
->os
= current_section
;
8758 n
->next
= overlay_list
;
8761 size
= exp_nameop (SIZEOF
, name
);
8763 /* Arrange to work out the maximum section end address. */
8764 if (overlay_max
== NULL
)
8767 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
8770 /* Finish a section in an overlay. There isn't any special to do
8774 lang_leave_overlay_section (fill_type
*fill
,
8775 lang_output_section_phdr_list
*phdrs
)
8782 name
= current_section
->name
;
8784 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
8785 region and that no load-time region has been specified. It doesn't
8786 really matter what we say here, since lang_leave_overlay will
8788 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
8790 /* Define the magic symbols. */
8792 clean
= (char *) xmalloc (strlen (name
) + 1);
8794 for (s1
= name
; *s1
!= '\0'; s1
++)
8795 if (ISALNUM (*s1
) || *s1
== '_')
8799 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8800 sprintf (buf
, "__load_start_%s", clean
);
8801 lang_add_assignment (exp_provide (buf
,
8802 exp_nameop (LOADADDR
, name
),
8805 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8806 sprintf (buf
, "__load_stop_%s", clean
);
8807 lang_add_assignment (exp_provide (buf
,
8809 exp_nameop (LOADADDR
, name
),
8810 exp_nameop (SIZEOF
, name
)),
8816 /* Finish an overlay. If there are any overlay wide settings, this
8817 looks through all the sections in the overlay and sets them. */
8820 lang_leave_overlay (etree_type
*lma_expr
,
8823 const char *memspec
,
8824 lang_output_section_phdr_list
*phdrs
,
8825 const char *lma_memspec
)
8827 lang_memory_region_type
*region
;
8828 lang_memory_region_type
*lma_region
;
8829 struct overlay_list
*l
;
8830 lang_nocrossref_type
*nocrossref
;
8832 lang_get_regions (®ion
, &lma_region
,
8833 memspec
, lma_memspec
,
8834 lma_expr
!= NULL
, FALSE
);
8838 /* After setting the size of the last section, set '.' to end of the
8840 if (overlay_list
!= NULL
)
8842 overlay_list
->os
->update_dot
= 1;
8843 overlay_list
->os
->update_dot_tree
8844 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
8850 struct overlay_list
*next
;
8852 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8855 l
->os
->region
= region
;
8856 l
->os
->lma_region
= lma_region
;
8858 /* The first section has the load address specified in the
8859 OVERLAY statement. The rest are worked out from that.
8860 The base address is not needed (and should be null) if
8861 an LMA region was specified. */
8864 l
->os
->load_base
= lma_expr
;
8865 l
->os
->sectype
= first_overlay_section
;
8867 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
8868 l
->os
->phdrs
= phdrs
;
8872 lang_nocrossref_type
*nc
;
8874 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
8875 nc
->name
= l
->os
->name
;
8876 nc
->next
= nocrossref
;
8885 if (nocrossref
!= NULL
)
8886 lang_add_nocrossref (nocrossref
);
8889 overlay_list
= NULL
;
8891 overlay_subalign
= NULL
;
8894 /* Version handling. This is only useful for ELF. */
8896 /* If PREV is NULL, return first version pattern matching particular symbol.
8897 If PREV is non-NULL, return first version pattern matching particular
8898 symbol after PREV (previously returned by lang_vers_match). */
8900 static struct bfd_elf_version_expr
*
8901 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
8902 struct bfd_elf_version_expr
*prev
,
8906 const char *cxx_sym
= sym
;
8907 const char *java_sym
= sym
;
8908 struct bfd_elf_version_expr
*expr
= NULL
;
8909 enum demangling_styles curr_style
;
8911 curr_style
= CURRENT_DEMANGLING_STYLE
;
8912 cplus_demangle_set_style (no_demangling
);
8913 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
8916 cplus_demangle_set_style (curr_style
);
8918 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8920 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
8921 DMGL_PARAMS
| DMGL_ANSI
);
8925 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8927 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
8932 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
8934 struct bfd_elf_version_expr e
;
8936 switch (prev
? prev
->mask
: 0)
8939 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
8942 expr
= (struct bfd_elf_version_expr
*)
8943 htab_find ((htab_t
) head
->htab
, &e
);
8944 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
8945 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
8951 case BFD_ELF_VERSION_C_TYPE
:
8952 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8954 e
.pattern
= cxx_sym
;
8955 expr
= (struct bfd_elf_version_expr
*)
8956 htab_find ((htab_t
) head
->htab
, &e
);
8957 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
8958 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8964 case BFD_ELF_VERSION_CXX_TYPE
:
8965 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8967 e
.pattern
= java_sym
;
8968 expr
= (struct bfd_elf_version_expr
*)
8969 htab_find ((htab_t
) head
->htab
, &e
);
8970 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
8971 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8982 /* Finally, try the wildcards. */
8983 if (prev
== NULL
|| prev
->literal
)
8984 expr
= head
->remaining
;
8987 for (; expr
; expr
= expr
->next
)
8994 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
8997 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8999 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
9003 if (fnmatch (expr
->pattern
, s
, 0) == 0)
9009 free ((char *) c_sym
);
9011 free ((char *) cxx_sym
);
9012 if (java_sym
!= sym
)
9013 free ((char *) java_sym
);
9017 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
9018 return a pointer to the symbol name with any backslash quotes removed. */
9021 realsymbol (const char *pattern
)
9024 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
9025 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
9027 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
9029 /* It is a glob pattern only if there is no preceding
9033 /* Remove the preceding backslash. */
9040 if (*p
== '?' || *p
== '*' || *p
== '[')
9047 backslash
= *p
== '\\';
9063 /* This is called for each variable name or match expression. NEW_NAME is
9064 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
9065 pattern to be matched against symbol names. */
9067 struct bfd_elf_version_expr
*
9068 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
9069 const char *new_name
,
9071 bfd_boolean literal_p
)
9073 struct bfd_elf_version_expr
*ret
;
9075 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
9079 ret
->literal
= TRUE
;
9080 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
9081 if (ret
->pattern
== NULL
)
9083 ret
->pattern
= new_name
;
9084 ret
->literal
= FALSE
;
9087 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
9088 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9089 else if (strcasecmp (lang
, "C++") == 0)
9090 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
9091 else if (strcasecmp (lang
, "Java") == 0)
9092 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
9095 einfo (_("%X%P: unknown language `%s' in version information\n"),
9097 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
9100 return ldemul_new_vers_pattern (ret
);
9103 /* This is called for each set of variable names and match
9106 struct bfd_elf_version_tree
*
9107 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
9108 struct bfd_elf_version_expr
*locals
)
9110 struct bfd_elf_version_tree
*ret
;
9112 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
9113 ret
->globals
.list
= globals
;
9114 ret
->locals
.list
= locals
;
9115 ret
->match
= lang_vers_match
;
9116 ret
->name_indx
= (unsigned int) -1;
9120 /* This static variable keeps track of version indices. */
9122 static int version_index
;
9125 version_expr_head_hash (const void *p
)
9127 const struct bfd_elf_version_expr
*e
=
9128 (const struct bfd_elf_version_expr
*) p
;
9130 return htab_hash_string (e
->pattern
);
9134 version_expr_head_eq (const void *p1
, const void *p2
)
9136 const struct bfd_elf_version_expr
*e1
=
9137 (const struct bfd_elf_version_expr
*) p1
;
9138 const struct bfd_elf_version_expr
*e2
=
9139 (const struct bfd_elf_version_expr
*) p2
;
9141 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
9145 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
9148 struct bfd_elf_version_expr
*e
, *next
;
9149 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
9151 for (e
= head
->list
; e
; e
= e
->next
)
9155 head
->mask
|= e
->mask
;
9160 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
9161 version_expr_head_eq
, NULL
);
9162 list_loc
= &head
->list
;
9163 remaining_loc
= &head
->remaining
;
9164 for (e
= head
->list
; e
; e
= next
)
9170 remaining_loc
= &e
->next
;
9174 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
9178 struct bfd_elf_version_expr
*e1
, *last
;
9180 e1
= (struct bfd_elf_version_expr
*) *loc
;
9184 if (e1
->mask
== e
->mask
)
9192 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
9196 /* This is a duplicate. */
9197 /* FIXME: Memory leak. Sometimes pattern is not
9198 xmalloced alone, but in larger chunk of memory. */
9199 /* free (e->pattern); */
9204 e
->next
= last
->next
;
9212 list_loc
= &e
->next
;
9216 *remaining_loc
= NULL
;
9217 *list_loc
= head
->remaining
;
9220 head
->remaining
= head
->list
;
9223 /* This is called when we know the name and dependencies of the
9227 lang_register_vers_node (const char *name
,
9228 struct bfd_elf_version_tree
*version
,
9229 struct bfd_elf_version_deps
*deps
)
9231 struct bfd_elf_version_tree
*t
, **pp
;
9232 struct bfd_elf_version_expr
*e1
;
9237 if (link_info
.version_info
!= NULL
9238 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
9240 einfo (_("%X%P: anonymous version tag cannot be combined"
9241 " with other version tags\n"));
9246 /* Make sure this node has a unique name. */
9247 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9248 if (strcmp (t
->name
, name
) == 0)
9249 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
9251 lang_finalize_version_expr_head (&version
->globals
);
9252 lang_finalize_version_expr_head (&version
->locals
);
9254 /* Check the global and local match names, and make sure there
9255 aren't any duplicates. */
9257 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
9259 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9261 struct bfd_elf_version_expr
*e2
;
9263 if (t
->locals
.htab
&& e1
->literal
)
9265 e2
= (struct bfd_elf_version_expr
*)
9266 htab_find ((htab_t
) t
->locals
.htab
, e1
);
9267 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9269 if (e1
->mask
== e2
->mask
)
9270 einfo (_("%X%P: duplicate expression `%s'"
9271 " in version information\n"), e1
->pattern
);
9275 else if (!e1
->literal
)
9276 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9277 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9278 && e1
->mask
== e2
->mask
)
9279 einfo (_("%X%P: duplicate expression `%s'"
9280 " in version information\n"), e1
->pattern
);
9284 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
9286 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9288 struct bfd_elf_version_expr
*e2
;
9290 if (t
->globals
.htab
&& e1
->literal
)
9292 e2
= (struct bfd_elf_version_expr
*)
9293 htab_find ((htab_t
) t
->globals
.htab
, e1
);
9294 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9296 if (e1
->mask
== e2
->mask
)
9297 einfo (_("%X%P: duplicate expression `%s'"
9298 " in version information\n"),
9303 else if (!e1
->literal
)
9304 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9305 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9306 && e1
->mask
== e2
->mask
)
9307 einfo (_("%X%P: duplicate expression `%s'"
9308 " in version information\n"), e1
->pattern
);
9312 version
->deps
= deps
;
9313 version
->name
= name
;
9314 if (name
[0] != '\0')
9317 version
->vernum
= version_index
;
9320 version
->vernum
= 0;
9322 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
9327 /* This is called when we see a version dependency. */
9329 struct bfd_elf_version_deps
*
9330 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
9332 struct bfd_elf_version_deps
*ret
;
9333 struct bfd_elf_version_tree
*t
;
9335 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
9338 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9340 if (strcmp (t
->name
, name
) == 0)
9342 ret
->version_needed
= t
;
9347 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
9349 ret
->version_needed
= NULL
;
9354 lang_do_version_exports_section (void)
9356 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
9358 LANG_FOR_EACH_INPUT_STATEMENT (is
)
9360 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
9368 contents
= (char *) xmalloc (len
);
9369 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
9370 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
9373 while (p
< contents
+ len
)
9375 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
9376 p
= strchr (p
, '\0') + 1;
9379 /* Do not free the contents, as we used them creating the regex. */
9381 /* Do not include this section in the link. */
9382 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
9385 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
9386 lang_register_vers_node (command_line
.version_exports_section
,
9387 lang_new_vers_node (greg
, lreg
), NULL
);
9390 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec. This is initially
9391 called with UPDATE_REGIONS_P set to FALSE, in this case no errors are
9392 thrown, however, references to symbols in the origin and length fields
9393 will be pushed into the symbol table, this allows PROVIDE statements to
9394 then provide these symbols. This function is called a second time with
9395 UPDATE_REGIONS_P set to TRUE, this time the we update the actual region
9396 data structures, and throw errors if missing symbols are encountered. */
9399 lang_do_memory_regions (bfd_boolean update_regions_p
)
9401 lang_memory_region_type
*r
= lang_memory_region_list
;
9403 for (; r
!= NULL
; r
= r
->next
)
9407 exp_fold_tree_no_dot (r
->origin_exp
);
9408 if (update_regions_p
)
9410 if (expld
.result
.valid_p
)
9412 r
->origin
= expld
.result
.value
;
9413 r
->current
= r
->origin
;
9416 einfo (_("%P: invalid origin for memory region %s\n"),
9422 exp_fold_tree_no_dot (r
->length_exp
);
9423 if (update_regions_p
)
9425 if (expld
.result
.valid_p
)
9426 r
->length
= expld
.result
.value
;
9428 einfo (_("%P: invalid length for memory region %s\n"),
9436 lang_add_unique (const char *name
)
9438 struct unique_sections
*ent
;
9440 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
9441 if (strcmp (ent
->name
, name
) == 0)
9444 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
9445 ent
->name
= xstrdup (name
);
9446 ent
->next
= unique_section_list
;
9447 unique_section_list
= ent
;
9450 /* Append the list of dynamic symbols to the existing one. */
9453 lang_append_dynamic_list (struct bfd_elf_dynamic_list
**list_p
,
9454 struct bfd_elf_version_expr
*dynamic
)
9458 struct bfd_elf_version_expr
*tail
;
9459 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
9461 tail
->next
= (*list_p
)->head
.list
;
9462 (*list_p
)->head
.list
= dynamic
;
9466 struct bfd_elf_dynamic_list
*d
;
9468 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
9469 d
->head
.list
= dynamic
;
9470 d
->match
= lang_vers_match
;
9475 /* Append the list of C++ typeinfo dynamic symbols to the existing
9479 lang_append_dynamic_list_cpp_typeinfo (void)
9481 const char *symbols
[] =
9483 "typeinfo name for*",
9486 struct bfd_elf_version_expr
*dynamic
= NULL
;
9489 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9490 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9493 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9496 /* Append the list of C++ operator new and delete dynamic symbols to the
9500 lang_append_dynamic_list_cpp_new (void)
9502 const char *symbols
[] =
9507 struct bfd_elf_version_expr
*dynamic
= NULL
;
9510 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9511 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9514 lang_append_dynamic_list (&link_info
.dynamic_list
, dynamic
);
9517 /* Scan a space and/or comma separated string of features. */
9520 lang_ld_feature (char *str
)
9528 while (*p
== ',' || ISSPACE (*p
))
9533 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
9537 if (strcasecmp (p
, "SANE_EXPR") == 0)
9538 config
.sane_expr
= TRUE
;
9540 einfo (_("%X%P: unknown feature `%s'\n"), p
);
9546 /* Pretty print memory amount. */
9549 lang_print_memory_size (bfd_vma sz
)
9551 if ((sz
& 0x3fffffff) == 0)
9552 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
9553 else if ((sz
& 0xfffff) == 0)
9554 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
9555 else if ((sz
& 0x3ff) == 0)
9556 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
9558 printf (" %10" BFD_VMA_FMT
"u B", sz
);
9561 /* Implement --print-memory-usage: disply per region memory usage. */
9564 lang_print_memory_usage (void)
9566 lang_memory_region_type
*r
;
9568 printf ("Memory region Used Size Region Size %%age Used\n");
9569 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
9571 bfd_vma used_length
= r
->current
- r
->origin
;
9573 printf ("%16s: ",r
->name_list
.name
);
9574 lang_print_memory_size (used_length
);
9575 lang_print_memory_size ((bfd_vma
) r
->length
);
9579 double percent
= used_length
* 100.0 / r
->length
;
9580 printf (" %6.2f%%", percent
);