1 /* Linker command language support.
2 Copyright (C) 1991-2020 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"
47 #endif /* ENABLE_PLUGINS */
50 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
53 /* Convert between addresses in bytes and sizes in octets.
54 For currently supported targets, octets_per_byte is always a power
55 of two, so we can use shifts. */
56 #define TO_ADDR(X) ((X) >> opb_shift)
57 #define TO_SIZE(X) ((X) << opb_shift)
59 /* Local variables. */
60 static struct obstack stat_obstack
;
61 static struct obstack map_obstack
;
63 #define obstack_chunk_alloc xmalloc
64 #define obstack_chunk_free free
65 static const char *entry_symbol_default
= "start";
66 static bfd_boolean map_head_is_link_order
= FALSE
;
67 static lang_output_section_statement_type
*default_common_section
;
68 static bfd_boolean map_option_f
;
69 static bfd_vma print_dot
;
70 static lang_input_statement_type
*first_file
;
71 static const char *current_target
;
72 /* Header for list of statements corresponding to any files involved in the
73 link, either specified from the command-line or added implicitely (eg.
74 archive member used to resolved undefined symbol, wildcard statement from
75 linker script, etc.). Next pointer is in next field of a
76 lang_statement_header_type (reached via header field in a
77 lang_statement_union). */
78 static lang_statement_list_type statement_list
;
79 static lang_statement_list_type
*stat_save
[10];
80 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
81 static struct unique_sections
*unique_section_list
;
82 static struct asneeded_minfo
*asneeded_list_head
;
83 static unsigned int opb_shift
= 0;
85 /* Forward declarations. */
86 static void exp_init_os (etree_type
*);
87 static lang_input_statement_type
*lookup_name (const char *);
88 static void insert_undefined (const char *);
89 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
90 static void print_statement (lang_statement_union_type
*,
91 lang_output_section_statement_type
*);
92 static void print_statement_list (lang_statement_union_type
*,
93 lang_output_section_statement_type
*);
94 static void print_statements (void);
95 static void print_input_section (asection
*, bfd_boolean
);
96 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
97 static void lang_record_phdrs (void);
98 static void lang_do_version_exports_section (void);
99 static void lang_finalize_version_expr_head
100 (struct bfd_elf_version_expr_head
*);
101 static void lang_do_memory_regions (void);
103 /* Exported variables. */
104 const char *output_target
;
105 lang_output_section_statement_type
*abs_output_section
;
106 lang_statement_list_type lang_os_list
;
107 lang_statement_list_type
*stat_ptr
= &statement_list
;
108 /* Header for list of statements corresponding to files used in the final
109 executable. This can be either object file specified on the command-line
110 or library member resolving an undefined reference. Next pointer is in next
111 field of a lang_input_statement_type (reached via input_statement field in a
112 lang_statement_union). */
113 lang_statement_list_type file_chain
= { NULL
, NULL
};
114 /* Header for list of statements corresponding to files specified on the
115 command-line for linking. It thus contains real object files and archive
116 but not archive members. Next pointer is in next_real_file field of a
117 lang_input_statement_type statement (reached via input_statement field in a
118 lang_statement_union). */
119 lang_statement_list_type input_file_chain
;
120 static const char *current_input_file
;
121 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
122 const char *entry_section
= ".text";
123 struct lang_input_statement_flags input_flags
;
124 bfd_boolean entry_from_cmdline
;
125 bfd_boolean undef_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
;
133 static ctf_file_t
*ctf_output
;
135 /* Functions that traverse the linker script and might evaluate
136 DEFINED() need to increment this at the start of the traversal. */
137 int lang_statement_iteration
= 0;
139 /* Count times through one_lang_size_sections_pass after mark phase. */
140 static int lang_sizing_iteration
= 0;
142 /* Return TRUE if the PATTERN argument is a wildcard pattern.
143 Although backslashes are treated specially if a pattern contains
144 wildcards, we do not consider the mere presence of a backslash to
145 be enough to cause the pattern to be treated as a wildcard.
146 That lets us handle DOS filenames more naturally. */
147 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
149 #define new_stat(x, y) \
150 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
152 #define outside_section_address(q) \
153 ((q)->output_offset + (q)->output_section->vma)
155 #define outside_symbol_address(q) \
156 ((q)->value + outside_section_address (q->section))
158 #define SECTION_NAME_MAP_LENGTH (16)
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
= f
->the_bfd
->my_archive
->filename
;
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 file
->the_bfd
->my_archive
->filename
) == 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
, ptr
->section_flag_list
, 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
, ptr
->section_flag_list
, 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 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
570 lang_input_statement_type
*file
,
573 lang_section_bst_type
*node
;
574 lang_section_bst_type
**tree
;
575 lang_output_section_statement_type
*os
;
577 os
= (lang_output_section_statement_type
*) output
;
579 if (unique_section_p (section
, os
))
582 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
585 node
->section
= section
;
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
, 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, TRUE
);
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, always make a
1468 new output_section_statement for SPECIAL CONSTRAINT. */
1470 lang_output_section_statement_type
*
1471 lang_output_section_statement_lookup (const char *name
,
1475 struct out_section_hash_entry
*entry
;
1477 entry
= ((struct out_section_hash_entry
*)
1478 bfd_hash_lookup (&output_section_statement_table
, name
,
1483 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1487 if (entry
->s
.output_section_statement
.name
!= NULL
)
1489 /* We have a section of this name, but it might not have the correct
1491 struct out_section_hash_entry
*last_ent
;
1493 name
= entry
->s
.output_section_statement
.name
;
1494 if (create
&& constraint
== SPECIAL
)
1495 /* Not traversing to the end reverses the order of the second
1496 and subsequent SPECIAL sections in the hash table chain,
1497 but that shouldn't matter. */
1502 if (constraint
== entry
->s
.output_section_statement
.constraint
1504 && entry
->s
.output_section_statement
.constraint
>= 0))
1505 return &entry
->s
.output_section_statement
;
1507 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1509 while (entry
!= NULL
1510 && name
== entry
->s
.output_section_statement
.name
);
1516 = ((struct out_section_hash_entry
*)
1517 output_section_statement_newfunc (NULL
,
1518 &output_section_statement_table
,
1522 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1525 entry
->root
= last_ent
->root
;
1526 last_ent
->root
.next
= &entry
->root
;
1529 entry
->s
.output_section_statement
.name
= name
;
1530 entry
->s
.output_section_statement
.constraint
= constraint
;
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
, 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
);
2392 if (s
->constraint
!= SPECIAL
)
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 flag_info
*sflag_info
,
2542 lang_output_section_statement_type
*output
)
2544 flagword flags
= section
->flags
;
2546 bfd_boolean discard
;
2547 lang_input_section_type
*new_section
;
2548 bfd
*abfd
= link_info
.output_bfd
;
2550 /* Is this section one we know should be discarded? */
2551 discard
= lang_discard_section_p (section
);
2553 /* Discard input sections which are assigned to a section named
2554 DISCARD_SECTION_NAME. */
2555 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2560 if (section
->output_section
== NULL
)
2562 /* This prevents future calls from assigning this section. */
2563 section
->output_section
= bfd_abs_section_ptr
;
2565 else if (link_info
.non_contiguous_regions_warnings
)
2566 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions makes "
2567 "section `%pA' from '%pB' match /DISCARD/ clause.\n"),
2568 NULL
, section
, section
->owner
);
2577 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2582 if (section
->output_section
!= NULL
)
2584 if (!link_info
.non_contiguous_regions
)
2587 /* SECTION has already been handled in a special way
2588 (eg. LINK_ONCE): skip it. */
2589 if (bfd_is_abs_section (section
->output_section
))
2592 /* Already assigned to the same output section, do not process
2593 it again, to avoid creating loops between duplicate sections
2595 if (section
->output_section
== output
->bfd_section
)
2598 if (link_info
.non_contiguous_regions_warnings
&& output
->bfd_section
)
2599 einfo (_("%P:%pS: warning: --enable-non-contiguous-regions may "
2600 "change behaviour for section `%pA' from '%pB' (assigned to "
2601 "%pA, but additional match: %pA)\n"),
2602 NULL
, section
, section
->owner
, section
->output_section
,
2603 output
->bfd_section
);
2605 /* SECTION has already been assigned to an output section, but
2606 the user allows it to be mapped to another one in case it
2607 overflows. We'll later update the actual output section in
2608 size_input_section as appropriate. */
2611 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2612 to an output section, because we want to be able to include a
2613 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2614 section (I don't know why we want to do this, but we do).
2615 build_link_order in ldwrite.c handles this case by turning
2616 the embedded SEC_NEVER_LOAD section into a fill. */
2617 flags
&= ~ SEC_NEVER_LOAD
;
2619 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2620 already been processed. One reason to do this is that on pe
2621 format targets, .text$foo sections go into .text and it's odd
2622 to see .text with SEC_LINK_ONCE set. */
2623 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2625 if (link_info
.resolve_section_groups
)
2626 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2628 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2630 else if (!bfd_link_relocatable (&link_info
))
2631 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2633 switch (output
->sectype
)
2635 case normal_section
:
2636 case overlay_section
:
2637 case first_overlay_section
:
2639 case noalloc_section
:
2640 flags
&= ~SEC_ALLOC
;
2642 case noload_section
:
2644 flags
|= SEC_NEVER_LOAD
;
2645 /* Unfortunately GNU ld has managed to evolve two different
2646 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2647 alloc, no contents section. All others get a noload, noalloc
2649 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2650 flags
&= ~SEC_HAS_CONTENTS
;
2652 flags
&= ~SEC_ALLOC
;
2656 if (output
->bfd_section
== NULL
)
2657 init_os (output
, flags
);
2659 /* If SEC_READONLY is not set in the input section, then clear
2660 it from the output section. */
2661 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2663 if (output
->bfd_section
->linker_has_input
)
2665 /* Only set SEC_READONLY flag on the first input section. */
2666 flags
&= ~ SEC_READONLY
;
2668 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2669 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2670 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2671 || ((flags
& SEC_MERGE
) != 0
2672 && output
->bfd_section
->entsize
!= section
->entsize
))
2674 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2675 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2678 output
->bfd_section
->flags
|= flags
;
2680 if (!output
->bfd_section
->linker_has_input
)
2682 output
->bfd_section
->linker_has_input
= 1;
2683 /* This must happen after flags have been updated. The output
2684 section may have been created before we saw its first input
2685 section, eg. for a data statement. */
2686 bfd_init_private_section_data (section
->owner
, section
,
2687 link_info
.output_bfd
,
2688 output
->bfd_section
,
2690 if ((flags
& SEC_MERGE
) != 0)
2691 output
->bfd_section
->entsize
= section
->entsize
;
2694 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2695 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2697 /* FIXME: This value should really be obtained from the bfd... */
2698 output
->block_value
= 128;
2701 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2702 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2704 section
->output_section
= output
->bfd_section
;
2706 if (!map_head_is_link_order
)
2708 asection
*s
= output
->bfd_section
->map_tail
.s
;
2709 output
->bfd_section
->map_tail
.s
= section
;
2710 section
->map_head
.s
= NULL
;
2711 section
->map_tail
.s
= s
;
2713 s
->map_head
.s
= section
;
2715 output
->bfd_section
->map_head
.s
= section
;
2718 /* Add a section reference to the list. */
2719 new_section
= new_stat (lang_input_section
, ptr
);
2720 new_section
->section
= section
;
2723 /* Handle wildcard sorting. This returns the lang_input_section which
2724 should follow the one we are going to create for SECTION and FILE,
2725 based on the sorting requirements of WILD. It returns NULL if the
2726 new section should just go at the end of the current list. */
2728 static lang_statement_union_type
*
2729 wild_sort (lang_wild_statement_type
*wild
,
2730 struct wildcard_list
*sec
,
2731 lang_input_statement_type
*file
,
2734 lang_statement_union_type
*l
;
2736 if (!wild
->filenames_sorted
2737 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2740 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2742 lang_input_section_type
*ls
;
2744 if (l
->header
.type
!= lang_input_section_enum
)
2746 ls
= &l
->input_section
;
2748 /* Sorting by filename takes precedence over sorting by section
2751 if (wild
->filenames_sorted
)
2753 const char *fn
, *ln
;
2757 /* The PE support for the .idata section as generated by
2758 dlltool assumes that files will be sorted by the name of
2759 the archive and then the name of the file within the
2762 if (file
->the_bfd
!= NULL
2763 && file
->the_bfd
->my_archive
!= NULL
)
2765 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2770 fn
= file
->filename
;
2774 if (ls
->section
->owner
->my_archive
!= NULL
)
2776 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2781 ln
= ls
->section
->owner
->filename
;
2785 i
= filename_cmp (fn
, ln
);
2794 fn
= file
->filename
;
2796 ln
= ls
->section
->owner
->filename
;
2798 i
= filename_cmp (fn
, ln
);
2806 /* Here either the files are not sorted by name, or we are
2807 looking at the sections for this file. */
2810 && sec
->spec
.sorted
!= none
2811 && sec
->spec
.sorted
!= by_none
)
2812 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2819 /* Expand a wild statement for a particular FILE. SECTION may be
2820 NULL, in which case it is a wild card. */
2823 output_section_callback (lang_wild_statement_type
*ptr
,
2824 struct wildcard_list
*sec
,
2826 struct flag_info
*sflag_info
,
2827 lang_input_statement_type
*file
,
2830 lang_statement_union_type
*before
;
2831 lang_output_section_statement_type
*os
;
2833 os
= (lang_output_section_statement_type
*) output
;
2835 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2836 if (unique_section_p (section
, os
))
2839 before
= wild_sort (ptr
, sec
, file
, section
);
2841 /* Here BEFORE points to the lang_input_section which
2842 should follow the one we are about to add. If BEFORE
2843 is NULL, then the section should just go at the end
2844 of the current list. */
2847 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2850 lang_statement_list_type list
;
2851 lang_statement_union_type
**pp
;
2853 lang_list_init (&list
);
2854 lang_add_section (&list
, section
, sflag_info
, os
);
2856 /* If we are discarding the section, LIST.HEAD will
2858 if (list
.head
!= NULL
)
2860 ASSERT (list
.head
->header
.next
== NULL
);
2862 for (pp
= &ptr
->children
.head
;
2864 pp
= &(*pp
)->header
.next
)
2865 ASSERT (*pp
!= NULL
);
2867 list
.head
->header
.next
= *pp
;
2873 /* Check if all sections in a wild statement for a particular FILE
2877 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2878 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2880 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2881 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2884 lang_output_section_statement_type
*os
;
2886 os
= (lang_output_section_statement_type
*) output
;
2888 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2889 if (unique_section_p (section
, os
))
2892 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2893 os
->all_input_readonly
= FALSE
;
2896 /* This is passed a file name which must have been seen already and
2897 added to the statement tree. We will see if it has been opened
2898 already and had its symbols read. If not then we'll read it. */
2900 static lang_input_statement_type
*
2901 lookup_name (const char *name
)
2903 lang_input_statement_type
*search
;
2905 for (search
= (void *) input_file_chain
.head
;
2907 search
= search
->next_real_file
)
2909 /* Use the local_sym_name as the name of the file that has
2910 already been loaded as filename might have been transformed
2911 via the search directory lookup mechanism. */
2912 const char *filename
= search
->local_sym_name
;
2914 if (filename
!= NULL
2915 && filename_cmp (filename
, name
) == 0)
2921 /* Arrange to splice the input statement added by new_afile into
2922 statement_list after the current input_file_chain tail.
2923 We know input_file_chain is not an empty list, and that
2924 lookup_name was called via open_input_bfds. Later calls to
2925 lookup_name should always match an existing input_statement. */
2926 lang_statement_union_type
**tail
= stat_ptr
->tail
;
2927 lang_statement_union_type
**after
2928 = (void *) ((char *) input_file_chain
.tail
2929 - offsetof (lang_input_statement_type
, next_real_file
)
2930 + offsetof (lang_input_statement_type
, header
.next
));
2931 lang_statement_union_type
*rest
= *after
;
2932 stat_ptr
->tail
= after
;
2933 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2934 default_target
, NULL
);
2935 *stat_ptr
->tail
= rest
;
2937 stat_ptr
->tail
= tail
;
2940 /* If we have already added this file, or this file is not real
2941 don't add this file. */
2942 if (search
->flags
.loaded
|| !search
->flags
.real
)
2945 if (!load_symbols (search
, NULL
))
2951 /* Save LIST as a list of libraries whose symbols should not be exported. */
2956 struct excluded_lib
*next
;
2958 static struct excluded_lib
*excluded_libs
;
2961 add_excluded_libs (const char *list
)
2963 const char *p
= list
, *end
;
2967 struct excluded_lib
*entry
;
2968 end
= strpbrk (p
, ",:");
2970 end
= p
+ strlen (p
);
2971 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2972 entry
->next
= excluded_libs
;
2973 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2974 memcpy (entry
->name
, p
, end
- p
);
2975 entry
->name
[end
- p
] = '\0';
2976 excluded_libs
= entry
;
2984 check_excluded_libs (bfd
*abfd
)
2986 struct excluded_lib
*lib
= excluded_libs
;
2990 int len
= strlen (lib
->name
);
2991 const char *filename
= lbasename (abfd
->filename
);
2993 if (strcmp (lib
->name
, "ALL") == 0)
2995 abfd
->no_export
= TRUE
;
2999 if (filename_ncmp (lib
->name
, filename
, len
) == 0
3000 && (filename
[len
] == '\0'
3001 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
3002 && filename
[len
+ 2] == '\0')))
3004 abfd
->no_export
= TRUE
;
3012 /* Get the symbols for an input file. */
3015 load_symbols (lang_input_statement_type
*entry
,
3016 lang_statement_list_type
*place
)
3020 if (entry
->flags
.loaded
)
3023 ldfile_open_file (entry
);
3025 /* Do not process further if the file was missing. */
3026 if (entry
->flags
.missing_file
)
3029 if (trace_files
|| verbose
)
3030 info_msg ("%pI\n", entry
);
3032 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
3033 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
3036 struct lang_input_statement_flags save_flags
;
3039 err
= bfd_get_error ();
3041 /* See if the emulation has some special knowledge. */
3042 if (ldemul_unrecognized_file (entry
))
3045 if (err
== bfd_error_file_ambiguously_recognized
)
3049 einfo (_("%P: %pB: file not recognized: %E;"
3050 " matching formats:"), entry
->the_bfd
);
3051 for (p
= matching
; *p
!= NULL
; p
++)
3055 else if (err
!= bfd_error_file_not_recognized
3057 einfo (_("%F%P: %pB: file not recognized: %E\n"), entry
->the_bfd
);
3059 bfd_close (entry
->the_bfd
);
3060 entry
->the_bfd
= NULL
;
3062 /* Try to interpret the file as a linker script. */
3063 save_flags
= input_flags
;
3064 ldfile_open_command_file (entry
->filename
);
3066 push_stat_ptr (place
);
3067 input_flags
.add_DT_NEEDED_for_regular
3068 = entry
->flags
.add_DT_NEEDED_for_regular
;
3069 input_flags
.add_DT_NEEDED_for_dynamic
3070 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
3071 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
3072 input_flags
.dynamic
= entry
->flags
.dynamic
;
3074 ldfile_assumed_script
= TRUE
;
3075 parser_input
= input_script
;
3076 current_input_file
= entry
->filename
;
3078 current_input_file
= NULL
;
3079 ldfile_assumed_script
= FALSE
;
3081 /* missing_file is sticky. sysrooted will already have been
3082 restored when seeing EOF in yyparse, but no harm to restore
3084 save_flags
.missing_file
|= input_flags
.missing_file
;
3085 input_flags
= save_flags
;
3089 entry
->flags
.loaded
= TRUE
;
3094 if (ldemul_recognized_file (entry
))
3097 /* We don't call ldlang_add_file for an archive. Instead, the
3098 add_symbols entry point will call ldlang_add_file, via the
3099 add_archive_element callback, for each element of the archive
3101 switch (bfd_get_format (entry
->the_bfd
))
3107 if (!entry
->flags
.reload
)
3108 ldlang_add_file (entry
);
3112 check_excluded_libs (entry
->the_bfd
);
3114 bfd_set_usrdata (entry
->the_bfd
, entry
);
3115 if (entry
->flags
.whole_archive
)
3118 bfd_boolean loaded
= TRUE
;
3123 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
3128 if (!bfd_check_format (member
, bfd_object
))
3130 einfo (_("%F%P: %pB: member %pB in archive is not an object\n"),
3131 entry
->the_bfd
, member
);
3136 if (!(*link_info
.callbacks
3137 ->add_archive_element
) (&link_info
, member
,
3138 "--whole-archive", &subsbfd
))
3141 /* Potentially, the add_archive_element hook may have set a
3142 substitute BFD for us. */
3143 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
3145 einfo (_("%F%P: %pB: error adding symbols: %E\n"), member
);
3150 entry
->flags
.loaded
= loaded
;
3156 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
3157 entry
->flags
.loaded
= TRUE
;
3159 einfo (_("%F%P: %pB: error adding symbols: %E\n"), entry
->the_bfd
);
3161 return entry
->flags
.loaded
;
3164 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
3165 may be NULL, indicating that it is a wildcard. Separate
3166 lang_input_section statements are created for each part of the
3167 expansion; they are added after the wild statement S. OUTPUT is
3168 the output section. */
3171 wild (lang_wild_statement_type
*s
,
3172 const char *target ATTRIBUTE_UNUSED
,
3173 lang_output_section_statement_type
*output
)
3175 struct wildcard_list
*sec
;
3177 if (s
->handler_data
[0]
3178 && s
->handler_data
[0]->spec
.sorted
== by_name
3179 && !s
->filenames_sorted
)
3181 lang_section_bst_type
*tree
;
3183 walk_wild (s
, output_section_callback_fast
, output
);
3188 output_section_callback_tree_to_list (s
, tree
, output
);
3193 walk_wild (s
, output_section_callback
, output
);
3195 if (default_common_section
== NULL
)
3196 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
3197 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
3199 /* Remember the section that common is going to in case we
3200 later get something which doesn't know where to put it. */
3201 default_common_section
= output
;
3206 /* Return TRUE iff target is the sought target. */
3209 get_target (const bfd_target
*target
, void *data
)
3211 const char *sought
= (const char *) data
;
3213 return strcmp (target
->name
, sought
) == 0;
3216 /* Like strcpy() but convert to lower case as well. */
3219 stricpy (char *dest
, const char *src
)
3223 while ((c
= *src
++) != 0)
3224 *dest
++ = TOLOWER (c
);
3229 /* Remove the first occurrence of needle (if any) in haystack
3233 strcut (char *haystack
, const char *needle
)
3235 haystack
= strstr (haystack
, needle
);
3241 for (src
= haystack
+ strlen (needle
); *src
;)
3242 *haystack
++ = *src
++;
3248 /* Compare two target format name strings.
3249 Return a value indicating how "similar" they are. */
3252 name_compare (const char *first
, const char *second
)
3258 copy1
= (char *) xmalloc (strlen (first
) + 1);
3259 copy2
= (char *) xmalloc (strlen (second
) + 1);
3261 /* Convert the names to lower case. */
3262 stricpy (copy1
, first
);
3263 stricpy (copy2
, second
);
3265 /* Remove size and endian strings from the name. */
3266 strcut (copy1
, "big");
3267 strcut (copy1
, "little");
3268 strcut (copy2
, "big");
3269 strcut (copy2
, "little");
3271 /* Return a value based on how many characters match,
3272 starting from the beginning. If both strings are
3273 the same then return 10 * their length. */
3274 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3275 if (copy1
[result
] == 0)
3287 /* Set by closest_target_match() below. */
3288 static const bfd_target
*winner
;
3290 /* Scan all the valid bfd targets looking for one that has the endianness
3291 requirement that was specified on the command line, and is the nearest
3292 match to the original output target. */
3295 closest_target_match (const bfd_target
*target
, void *data
)
3297 const bfd_target
*original
= (const bfd_target
*) data
;
3299 if (command_line
.endian
== ENDIAN_BIG
3300 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3303 if (command_line
.endian
== ENDIAN_LITTLE
3304 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3307 /* Must be the same flavour. */
3308 if (target
->flavour
!= original
->flavour
)
3311 /* Ignore generic big and little endian elf vectors. */
3312 if (strcmp (target
->name
, "elf32-big") == 0
3313 || strcmp (target
->name
, "elf64-big") == 0
3314 || strcmp (target
->name
, "elf32-little") == 0
3315 || strcmp (target
->name
, "elf64-little") == 0)
3318 /* If we have not found a potential winner yet, then record this one. */
3325 /* Oh dear, we now have two potential candidates for a successful match.
3326 Compare their names and choose the better one. */
3327 if (name_compare (target
->name
, original
->name
)
3328 > name_compare (winner
->name
, original
->name
))
3331 /* Keep on searching until wqe have checked them all. */
3335 /* Return the BFD target format of the first input file. */
3338 get_first_input_target (void)
3340 const char *target
= NULL
;
3342 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3344 if (s
->header
.type
== lang_input_statement_enum
3347 ldfile_open_file (s
);
3349 if (s
->the_bfd
!= NULL
3350 && bfd_check_format (s
->the_bfd
, bfd_object
))
3352 target
= bfd_get_target (s
->the_bfd
);
3364 lang_get_output_target (void)
3368 /* Has the user told us which output format to use? */
3369 if (output_target
!= NULL
)
3370 return output_target
;
3372 /* No - has the current target been set to something other than
3374 if (current_target
!= default_target
&& current_target
!= NULL
)
3375 return current_target
;
3377 /* No - can we determine the format of the first input file? */
3378 target
= get_first_input_target ();
3382 /* Failed - use the default output target. */
3383 return default_target
;
3386 /* Open the output file. */
3389 open_output (const char *name
)
3391 output_target
= lang_get_output_target ();
3393 /* Has the user requested a particular endianness on the command
3395 if (command_line
.endian
!= ENDIAN_UNSET
)
3397 /* Get the chosen target. */
3398 const bfd_target
*target
3399 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3401 /* If the target is not supported, we cannot do anything. */
3404 enum bfd_endian desired_endian
;
3406 if (command_line
.endian
== ENDIAN_BIG
)
3407 desired_endian
= BFD_ENDIAN_BIG
;
3409 desired_endian
= BFD_ENDIAN_LITTLE
;
3411 /* See if the target has the wrong endianness. This should
3412 not happen if the linker script has provided big and
3413 little endian alternatives, but some scrips don't do
3415 if (target
->byteorder
!= desired_endian
)
3417 /* If it does, then see if the target provides
3418 an alternative with the correct endianness. */
3419 if (target
->alternative_target
!= NULL
3420 && (target
->alternative_target
->byteorder
== desired_endian
))
3421 output_target
= target
->alternative_target
->name
;
3424 /* Try to find a target as similar as possible to
3425 the default target, but which has the desired
3426 endian characteristic. */
3427 bfd_iterate_over_targets (closest_target_match
,
3430 /* Oh dear - we could not find any targets that
3431 satisfy our requirements. */
3433 einfo (_("%P: warning: could not find any targets"
3434 " that match endianness requirement\n"));
3436 output_target
= winner
->name
;
3442 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3444 if (link_info
.output_bfd
== NULL
)
3446 if (bfd_get_error () == bfd_error_invalid_target
)
3447 einfo (_("%F%P: target %s not found\n"), output_target
);
3449 einfo (_("%F%P: cannot open output file %s: %E\n"), name
);
3452 delete_output_file_on_failure
= TRUE
;
3454 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3455 einfo (_("%F%P: %s: can not make object file: %E\n"), name
);
3456 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3457 ldfile_output_architecture
,
3458 ldfile_output_machine
))
3459 einfo (_("%F%P: %s: can not set architecture: %E\n"), name
);
3461 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3462 if (link_info
.hash
== NULL
)
3463 einfo (_("%F%P: can not create hash table: %E\n"));
3465 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3469 ldlang_open_output (lang_statement_union_type
*statement
)
3471 switch (statement
->header
.type
)
3473 case lang_output_statement_enum
:
3474 ASSERT (link_info
.output_bfd
== NULL
);
3475 open_output (statement
->output_statement
.name
);
3476 ldemul_set_output_arch ();
3477 if (config
.magic_demand_paged
3478 && !bfd_link_relocatable (&link_info
))
3479 link_info
.output_bfd
->flags
|= D_PAGED
;
3481 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3482 if (config
.text_read_only
)
3483 link_info
.output_bfd
->flags
|= WP_TEXT
;
3485 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3486 if (link_info
.traditional_format
)
3487 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3489 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3492 case lang_target_statement_enum
:
3493 current_target
= statement
->target_statement
.target
;
3501 init_opb (asection
*s
)
3506 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
3508 && (s
->flags
& SEC_ELF_OCTETS
) != 0)
3511 x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3512 ldfile_output_machine
);
3514 while ((x
& 1) == 0)
3522 /* Open all the input files. */
3526 OPEN_BFD_NORMAL
= 0,
3530 #ifdef ENABLE_PLUGINS
3531 static lang_input_statement_type
*plugin_insert
= NULL
;
3532 static struct bfd_link_hash_entry
*plugin_undefs
= NULL
;
3536 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3538 for (; s
!= NULL
; s
= s
->header
.next
)
3540 switch (s
->header
.type
)
3542 case lang_constructors_statement_enum
:
3543 open_input_bfds (constructor_list
.head
, mode
);
3545 case lang_output_section_statement_enum
:
3546 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3548 case lang_wild_statement_enum
:
3549 /* Maybe we should load the file's symbols. */
3550 if ((mode
& OPEN_BFD_RESCAN
) == 0
3551 && s
->wild_statement
.filename
3552 && !wildcardp (s
->wild_statement
.filename
)
3553 && !archive_path (s
->wild_statement
.filename
))
3554 lookup_name (s
->wild_statement
.filename
);
3555 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3557 case lang_group_statement_enum
:
3559 struct bfd_link_hash_entry
*undefs
;
3560 #ifdef ENABLE_PLUGINS
3561 lang_input_statement_type
*plugin_insert_save
;
3564 /* We must continually search the entries in the group
3565 until no new symbols are added to the list of undefined
3570 #ifdef ENABLE_PLUGINS
3571 plugin_insert_save
= plugin_insert
;
3573 undefs
= link_info
.hash
->undefs_tail
;
3574 open_input_bfds (s
->group_statement
.children
.head
,
3575 mode
| OPEN_BFD_FORCE
);
3577 while (undefs
!= link_info
.hash
->undefs_tail
3578 #ifdef ENABLE_PLUGINS
3579 /* Objects inserted by a plugin, which are loaded
3580 before we hit this loop, may have added new
3582 || (plugin_insert
!= plugin_insert_save
&& plugin_undefs
)
3587 case lang_target_statement_enum
:
3588 current_target
= s
->target_statement
.target
;
3590 case lang_input_statement_enum
:
3591 if (s
->input_statement
.flags
.real
)
3593 lang_statement_union_type
**os_tail
;
3594 lang_statement_list_type add
;
3597 s
->input_statement
.target
= current_target
;
3599 /* If we are being called from within a group, and this
3600 is an archive which has already been searched, then
3601 force it to be researched unless the whole archive
3602 has been loaded already. Do the same for a rescan.
3603 Likewise reload --as-needed shared libs. */
3604 if (mode
!= OPEN_BFD_NORMAL
3605 #ifdef ENABLE_PLUGINS
3606 && ((mode
& OPEN_BFD_RESCAN
) == 0
3607 || plugin_insert
== NULL
)
3609 && s
->input_statement
.flags
.loaded
3610 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3611 && ((bfd_get_format (abfd
) == bfd_archive
3612 && !s
->input_statement
.flags
.whole_archive
)
3613 || (bfd_get_format (abfd
) == bfd_object
3614 && ((abfd
->flags
) & DYNAMIC
) != 0
3615 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3616 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3617 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3619 s
->input_statement
.flags
.loaded
= FALSE
;
3620 s
->input_statement
.flags
.reload
= TRUE
;
3623 os_tail
= lang_os_list
.tail
;
3624 lang_list_init (&add
);
3626 if (!load_symbols (&s
->input_statement
, &add
))
3627 config
.make_executable
= FALSE
;
3629 if (add
.head
!= NULL
)
3631 /* If this was a script with output sections then
3632 tack any added statements on to the end of the
3633 list. This avoids having to reorder the output
3634 section statement list. Very likely the user
3635 forgot -T, and whatever we do here will not meet
3636 naive user expectations. */
3637 if (os_tail
!= lang_os_list
.tail
)
3639 einfo (_("%P: warning: %s contains output sections;"
3640 " did you forget -T?\n"),
3641 s
->input_statement
.filename
);
3642 *stat_ptr
->tail
= add
.head
;
3643 stat_ptr
->tail
= add
.tail
;
3647 *add
.tail
= s
->header
.next
;
3648 s
->header
.next
= add
.head
;
3652 #ifdef ENABLE_PLUGINS
3653 /* If we have found the point at which a plugin added new
3654 files, clear plugin_insert to enable archive rescan. */
3655 if (&s
->input_statement
== plugin_insert
)
3656 plugin_insert
= NULL
;
3659 case lang_assignment_statement_enum
:
3660 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3661 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3668 /* Exit if any of the files were missing. */
3669 if (input_flags
.missing_file
)
3673 /* Open the CTF sections in the input files with libctf: if any were opened,
3674 create a fake input file that we'll write the merged CTF data to later
3678 ldlang_open_ctf (void)
3683 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3687 /* Incoming files from the compiler have a single ctf_file_t in them
3688 (which is presented to us by the libctf API in a ctf_archive_t
3689 wrapper): files derived from a previous relocatable link have a CTF
3690 archive containing possibly many CTF files. */
3692 if ((file
->the_ctf
= ctf_bfdopen (file
->the_bfd
, &err
)) == NULL
)
3694 if (err
!= ECTF_NOCTFDATA
)
3695 einfo (_("%P: warning: CTF section in `%pI' not loaded: "
3696 "its types will be discarded: `%s'\n"), file
,
3701 /* Prevent the contents of this section from being written, while
3702 requiring the section itself to be duplicated in the output. */
3703 /* This section must exist if ctf_bfdopen() succeeded. */
3704 sect
= bfd_get_section_by_name (file
->the_bfd
, ".ctf");
3706 sect
->flags
|= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
| SEC_LINKER_CREATED
;
3717 if ((ctf_output
= ctf_create (&err
)) != NULL
)
3720 einfo (_("%P: warning: CTF output not created: `%s'\n"),
3723 LANG_FOR_EACH_INPUT_STATEMENT (errfile
)
3724 ctf_close (errfile
->the_ctf
);
3727 /* Merge together CTF sections. After this, only the symtab-dependent
3728 function and data object sections need adjustment. */
3731 lang_merge_ctf (void)
3733 asection
*output_sect
;
3738 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3740 /* If the section was discarded, don't waste time merging. */
3741 if (output_sect
== NULL
)
3743 ctf_file_close (ctf_output
);
3746 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3748 ctf_close (file
->the_ctf
);
3749 file
->the_ctf
= NULL
;
3754 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3759 /* Takes ownership of file->u.the_ctfa. */
3760 if (ctf_link_add_ctf (ctf_output
, file
->the_ctf
, file
->filename
) < 0)
3762 einfo (_("%F%P: cannot link with CTF in %pB: %s\n"), file
->the_bfd
,
3763 ctf_errmsg (ctf_errno (ctf_output
)));
3764 ctf_close (file
->the_ctf
);
3765 file
->the_ctf
= NULL
;
3770 if (ctf_link (ctf_output
, CTF_LINK_SHARE_UNCONFLICTED
) < 0)
3772 einfo (_("%F%P: CTF linking failed; output will have no CTF section: %s\n"),
3773 ctf_errmsg (ctf_errno (ctf_output
)));
3776 output_sect
->size
= 0;
3777 output_sect
->flags
|= SEC_EXCLUDE
;
3782 /* Let the emulation examine the symbol table and strtab to help it optimize the
3783 CTF, if supported. */
3786 ldlang_ctf_apply_strsym (struct elf_sym_strtab
*syms
, bfd_size_type symcount
,
3787 struct elf_strtab_hash
*symstrtab
)
3789 ldemul_examine_strtab_for_ctf (ctf_output
, syms
, symcount
, symstrtab
);
3792 /* Write out the CTF section. Called early, if the emulation isn't going to
3793 need to dedup against the strtab and symtab, then possibly called from the
3794 target linker code if the dedup has happened. */
3796 lang_write_ctf (int late
)
3799 asection
*output_sect
;
3806 /* Emit CTF late if this emulation says it can do so. */
3807 if (ldemul_emit_ctf_early ())
3812 if (!ldemul_emit_ctf_early ())
3818 output_sect
= bfd_get_section_by_name (link_info
.output_bfd
, ".ctf");
3821 output_sect
->contents
= ctf_link_write (ctf_output
, &output_size
,
3822 CTF_COMPRESSION_THRESHOLD
);
3823 output_sect
->size
= output_size
;
3824 output_sect
->flags
|= SEC_IN_MEMORY
| SEC_KEEP
;
3826 if (!output_sect
->contents
)
3828 einfo (_("%F%P: CTF section emission failed; output will have no "
3829 "CTF section: %s\n"), ctf_errmsg (ctf_errno (ctf_output
)));
3830 output_sect
->size
= 0;
3831 output_sect
->flags
|= SEC_EXCLUDE
;
3835 /* This also closes every CTF input file used in the link. */
3836 ctf_file_close (ctf_output
);
3839 LANG_FOR_EACH_INPUT_STATEMENT (file
)
3840 file
->the_ctf
= NULL
;
3843 /* Write out the CTF section late, if the emulation needs that. */
3846 ldlang_write_ctf_late (void)
3848 /* Trigger a "late call", if the emulation needs one. */
3853 /* Add the supplied name to the symbol table as an undefined reference.
3854 This is a two step process as the symbol table doesn't even exist at
3855 the time the ld command line is processed. First we put the name
3856 on a list, then, once the output file has been opened, transfer the
3857 name to the symbol table. */
3859 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3861 #define ldlang_undef_chain_list_head entry_symbol.next
3864 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3866 ldlang_undef_chain_list_type
*new_undef
;
3868 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3869 new_undef
= stat_alloc (sizeof (*new_undef
));
3870 new_undef
->next
= ldlang_undef_chain_list_head
;
3871 ldlang_undef_chain_list_head
= new_undef
;
3873 new_undef
->name
= xstrdup (name
);
3875 if (link_info
.output_bfd
!= NULL
)
3876 insert_undefined (new_undef
->name
);
3879 /* Insert NAME as undefined in the symbol table. */
3882 insert_undefined (const char *name
)
3884 struct bfd_link_hash_entry
*h
;
3886 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3888 einfo (_("%F%P: bfd_link_hash_lookup failed: %E\n"));
3889 if (h
->type
== bfd_link_hash_new
)
3891 h
->type
= bfd_link_hash_undefined
;
3892 h
->u
.undef
.abfd
= NULL
;
3893 h
->non_ir_ref_regular
= TRUE
;
3894 if (is_elf_hash_table (link_info
.hash
))
3895 ((struct elf_link_hash_entry
*) h
)->mark
= 1;
3896 bfd_link_add_undef (link_info
.hash
, h
);
3900 /* Run through the list of undefineds created above and place them
3901 into the linker hash table as undefined symbols belonging to the
3905 lang_place_undefineds (void)
3907 ldlang_undef_chain_list_type
*ptr
;
3909 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3910 insert_undefined (ptr
->name
);
3913 /* Structure used to build the list of symbols that the user has required
3916 struct require_defined_symbol
3919 struct require_defined_symbol
*next
;
3922 /* The list of symbols that the user has required be defined. */
3924 static struct require_defined_symbol
*require_defined_symbol_list
;
3926 /* Add a new symbol NAME to the list of symbols that are required to be
3930 ldlang_add_require_defined (const char *const name
)
3932 struct require_defined_symbol
*ptr
;
3934 ldlang_add_undef (name
, TRUE
);
3935 ptr
= stat_alloc (sizeof (*ptr
));
3936 ptr
->next
= require_defined_symbol_list
;
3937 ptr
->name
= strdup (name
);
3938 require_defined_symbol_list
= ptr
;
3941 /* Check that all symbols the user required to be defined, are defined,
3942 raise an error if we find a symbol that is not defined. */
3945 ldlang_check_require_defined_symbols (void)
3947 struct require_defined_symbol
*ptr
;
3949 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
3951 struct bfd_link_hash_entry
*h
;
3953 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
3954 FALSE
, FALSE
, TRUE
);
3956 || (h
->type
!= bfd_link_hash_defined
3957 && h
->type
!= bfd_link_hash_defweak
))
3958 einfo(_("%X%P: required symbol `%s' not defined\n"), ptr
->name
);
3962 /* Check for all readonly or some readwrite sections. */
3965 check_input_sections
3966 (lang_statement_union_type
*s
,
3967 lang_output_section_statement_type
*output_section_statement
)
3969 for (; s
!= NULL
; s
= s
->header
.next
)
3971 switch (s
->header
.type
)
3973 case lang_wild_statement_enum
:
3974 walk_wild (&s
->wild_statement
, check_section_callback
,
3975 output_section_statement
);
3976 if (!output_section_statement
->all_input_readonly
)
3979 case lang_constructors_statement_enum
:
3980 check_input_sections (constructor_list
.head
,
3981 output_section_statement
);
3982 if (!output_section_statement
->all_input_readonly
)
3985 case lang_group_statement_enum
:
3986 check_input_sections (s
->group_statement
.children
.head
,
3987 output_section_statement
);
3988 if (!output_section_statement
->all_input_readonly
)
3997 /* Update wildcard statements if needed. */
4000 update_wild_statements (lang_statement_union_type
*s
)
4002 struct wildcard_list
*sec
;
4004 switch (sort_section
)
4014 for (; s
!= NULL
; s
= s
->header
.next
)
4016 switch (s
->header
.type
)
4021 case lang_wild_statement_enum
:
4022 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
4024 /* Don't sort .init/.fini sections. */
4025 if (strcmp (sec
->spec
.name
, ".init") != 0
4026 && strcmp (sec
->spec
.name
, ".fini") != 0)
4027 switch (sec
->spec
.sorted
)
4030 sec
->spec
.sorted
= sort_section
;
4033 if (sort_section
== by_alignment
)
4034 sec
->spec
.sorted
= by_name_alignment
;
4037 if (sort_section
== by_name
)
4038 sec
->spec
.sorted
= by_alignment_name
;
4045 case lang_constructors_statement_enum
:
4046 update_wild_statements (constructor_list
.head
);
4049 case lang_output_section_statement_enum
:
4050 update_wild_statements
4051 (s
->output_section_statement
.children
.head
);
4054 case lang_group_statement_enum
:
4055 update_wild_statements (s
->group_statement
.children
.head
);
4063 /* Open input files and attach to output sections. */
4066 map_input_to_output_sections
4067 (lang_statement_union_type
*s
, const char *target
,
4068 lang_output_section_statement_type
*os
)
4070 for (; s
!= NULL
; s
= s
->header
.next
)
4072 lang_output_section_statement_type
*tos
;
4075 switch (s
->header
.type
)
4077 case lang_wild_statement_enum
:
4078 wild (&s
->wild_statement
, target
, os
);
4080 case lang_constructors_statement_enum
:
4081 map_input_to_output_sections (constructor_list
.head
,
4085 case lang_output_section_statement_enum
:
4086 tos
= &s
->output_section_statement
;
4087 if (tos
->constraint
!= 0)
4089 if (tos
->constraint
!= ONLY_IF_RW
4090 && tos
->constraint
!= ONLY_IF_RO
)
4092 tos
->all_input_readonly
= TRUE
;
4093 check_input_sections (tos
->children
.head
, tos
);
4094 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
4096 tos
->constraint
= -1;
4100 map_input_to_output_sections (tos
->children
.head
,
4104 case lang_output_statement_enum
:
4106 case lang_target_statement_enum
:
4107 target
= s
->target_statement
.target
;
4109 case lang_group_statement_enum
:
4110 map_input_to_output_sections (s
->group_statement
.children
.head
,
4114 case lang_data_statement_enum
:
4115 /* Make sure that any sections mentioned in the expression
4117 exp_init_os (s
->data_statement
.exp
);
4118 /* The output section gets CONTENTS, ALLOC and LOAD, but
4119 these may be overridden by the script. */
4120 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
4121 switch (os
->sectype
)
4123 case normal_section
:
4124 case overlay_section
:
4125 case first_overlay_section
:
4127 case noalloc_section
:
4128 flags
= SEC_HAS_CONTENTS
;
4130 case noload_section
:
4131 if (bfd_get_flavour (link_info
.output_bfd
)
4132 == bfd_target_elf_flavour
)
4133 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
4135 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
4138 if (os
->bfd_section
== NULL
)
4139 init_os (os
, flags
);
4141 os
->bfd_section
->flags
|= flags
;
4143 case lang_input_section_enum
:
4145 case lang_fill_statement_enum
:
4146 case lang_object_symbols_statement_enum
:
4147 case lang_reloc_statement_enum
:
4148 case lang_padding_statement_enum
:
4149 case lang_input_statement_enum
:
4150 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4153 case lang_assignment_statement_enum
:
4154 if (os
!= NULL
&& os
->bfd_section
== NULL
)
4157 /* Make sure that any sections mentioned in the assignment
4159 exp_init_os (s
->assignment_statement
.exp
);
4161 case lang_address_statement_enum
:
4162 /* Mark the specified section with the supplied address.
4163 If this section was actually a segment marker, then the
4164 directive is ignored if the linker script explicitly
4165 processed the segment marker. Originally, the linker
4166 treated segment directives (like -Ttext on the
4167 command-line) as section directives. We honor the
4168 section directive semantics for backwards compatibility;
4169 linker scripts that do not specifically check for
4170 SEGMENT_START automatically get the old semantics. */
4171 if (!s
->address_statement
.segment
4172 || !s
->address_statement
.segment
->used
)
4174 const char *name
= s
->address_statement
.section_name
;
4176 /* Create the output section statement here so that
4177 orphans with a set address will be placed after other
4178 script sections. If we let the orphan placement code
4179 place them in amongst other sections then the address
4180 will affect following script sections, which is
4181 likely to surprise naive users. */
4182 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
4183 tos
->addr_tree
= s
->address_statement
.address
;
4184 if (tos
->bfd_section
== NULL
)
4188 case lang_insert_statement_enum
:
4194 /* An insert statement snips out all the linker statements from the
4195 start of the list and places them after the output section
4196 statement specified by the insert. This operation is complicated
4197 by the fact that we keep a doubly linked list of output section
4198 statements as well as the singly linked list of all statements.
4199 FIXME someday: Twiddling with the list not only moves statements
4200 from the user's script but also input and group statements that are
4201 built from command line object files and --start-group. We only
4202 get away with this because the list pointers used by file_chain
4203 and input_file_chain are not reordered, and processing via
4204 statement_list after this point mostly ignores input statements.
4205 One exception is the map file, where LOAD and START GROUP/END GROUP
4206 can end up looking odd. */
4209 process_insert_statements (lang_statement_union_type
**start
)
4211 lang_statement_union_type
**s
;
4212 lang_output_section_statement_type
*first_os
= NULL
;
4213 lang_output_section_statement_type
*last_os
= NULL
;
4214 lang_output_section_statement_type
*os
;
4219 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
4221 /* Keep pointers to the first and last output section
4222 statement in the sequence we may be about to move. */
4223 os
= &(*s
)->output_section_statement
;
4225 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
4228 /* Set constraint negative so that lang_output_section_find
4229 won't match this output section statement. At this
4230 stage in linking constraint has values in the range
4231 [-1, ONLY_IN_RW]. */
4232 last_os
->constraint
= -2 - last_os
->constraint
;
4233 if (first_os
== NULL
)
4236 else if ((*s
)->header
.type
== lang_group_statement_enum
)
4238 /* A user might put -T between --start-group and
4239 --end-group. One way this odd construct might arise is
4240 from a wrapper around ld to change library search
4241 behaviour. For example:
4243 exec real_ld --start-group "$@" --end-group
4244 This isn't completely unreasonable so go looking inside a
4245 group statement for insert statements. */
4246 process_insert_statements (&(*s
)->group_statement
.children
.head
);
4248 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
4250 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
4251 lang_output_section_statement_type
*where
;
4252 lang_statement_union_type
**ptr
;
4253 lang_statement_union_type
*first
;
4255 if (link_info
.non_contiguous_regions
)
4257 einfo (_("warning: INSERT statement in linker script is "
4258 "incompatible with --enable-non-contiguous-regions.\n"));
4261 where
= lang_output_section_find (i
->where
);
4262 if (where
!= NULL
&& i
->is_before
)
4265 where
= where
->prev
;
4266 while (where
!= NULL
&& where
->constraint
< 0);
4270 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
4274 /* Deal with reordering the output section statement list. */
4275 if (last_os
!= NULL
)
4277 asection
*first_sec
, *last_sec
;
4278 struct lang_output_section_statement_struct
**next
;
4280 /* Snip out the output sections we are moving. */
4281 first_os
->prev
->next
= last_os
->next
;
4282 if (last_os
->next
== NULL
)
4284 next
= &first_os
->prev
->next
;
4285 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4288 last_os
->next
->prev
= first_os
->prev
;
4289 /* Add them in at the new position. */
4290 last_os
->next
= where
->next
;
4291 if (where
->next
== NULL
)
4293 next
= &last_os
->next
;
4294 lang_os_list
.tail
= (lang_statement_union_type
**) next
;
4297 where
->next
->prev
= last_os
;
4298 first_os
->prev
= where
;
4299 where
->next
= first_os
;
4301 /* Move the bfd sections in the same way. */
4304 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4306 os
->constraint
= -2 - os
->constraint
;
4307 if (os
->bfd_section
!= NULL
4308 && os
->bfd_section
->owner
!= NULL
)
4310 last_sec
= os
->bfd_section
;
4311 if (first_sec
== NULL
)
4312 first_sec
= last_sec
;
4317 if (last_sec
!= NULL
)
4319 asection
*sec
= where
->bfd_section
;
4321 sec
= output_prev_sec_find (where
);
4323 /* The place we want to insert must come after the
4324 sections we are moving. So if we find no
4325 section or if the section is the same as our
4326 last section, then no move is needed. */
4327 if (sec
!= NULL
&& sec
!= last_sec
)
4329 /* Trim them off. */
4330 if (first_sec
->prev
!= NULL
)
4331 first_sec
->prev
->next
= last_sec
->next
;
4333 link_info
.output_bfd
->sections
= last_sec
->next
;
4334 if (last_sec
->next
!= NULL
)
4335 last_sec
->next
->prev
= first_sec
->prev
;
4337 link_info
.output_bfd
->section_last
= first_sec
->prev
;
4339 last_sec
->next
= sec
->next
;
4340 if (sec
->next
!= NULL
)
4341 sec
->next
->prev
= last_sec
;
4343 link_info
.output_bfd
->section_last
= last_sec
;
4344 first_sec
->prev
= sec
;
4345 sec
->next
= first_sec
;
4353 ptr
= insert_os_after (where
);
4354 /* Snip everything from the start of the list, up to and
4355 including the insert statement we are currently processing. */
4357 *start
= (*s
)->header
.next
;
4358 /* Add them back where they belong, minus the insert. */
4361 statement_list
.tail
= s
;
4366 s
= &(*s
)->header
.next
;
4369 /* Undo constraint twiddling. */
4370 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4372 os
->constraint
= -2 - os
->constraint
;
4378 /* An output section might have been removed after its statement was
4379 added. For example, ldemul_before_allocation can remove dynamic
4380 sections if they turn out to be not needed. Clean them up here. */
4383 strip_excluded_output_sections (void)
4385 lang_output_section_statement_type
*os
;
4387 /* Run lang_size_sections (if not already done). */
4388 if (expld
.phase
!= lang_mark_phase_enum
)
4390 expld
.phase
= lang_mark_phase_enum
;
4391 expld
.dataseg
.phase
= exp_seg_none
;
4392 one_lang_size_sections_pass (NULL
, FALSE
);
4393 lang_reset_memory_regions ();
4396 for (os
= (void *) lang_os_list
.head
;
4400 asection
*output_section
;
4401 bfd_boolean exclude
;
4403 if (os
->constraint
< 0)
4406 output_section
= os
->bfd_section
;
4407 if (output_section
== NULL
)
4410 exclude
= (output_section
->rawsize
== 0
4411 && (output_section
->flags
& SEC_KEEP
) == 0
4412 && !bfd_section_removed_from_list (link_info
.output_bfd
,
4415 /* Some sections have not yet been sized, notably .gnu.version,
4416 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
4417 input sections, so don't drop output sections that have such
4418 input sections unless they are also marked SEC_EXCLUDE. */
4419 if (exclude
&& output_section
->map_head
.s
!= NULL
)
4423 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
4424 if ((s
->flags
& SEC_EXCLUDE
) == 0
4425 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
4426 || link_info
.emitrelocations
))
4435 /* We don't set bfd_section to NULL since bfd_section of the
4436 removed output section statement may still be used. */
4437 if (!os
->update_dot
)
4439 output_section
->flags
|= SEC_EXCLUDE
;
4440 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
4441 link_info
.output_bfd
->section_count
--;
4446 /* Called from ldwrite to clear out asection.map_head and
4447 asection.map_tail for use as link_orders in ldwrite. */
4450 lang_clear_os_map (void)
4452 lang_output_section_statement_type
*os
;
4454 if (map_head_is_link_order
)
4457 for (os
= (void *) lang_os_list
.head
;
4461 asection
*output_section
;
4463 if (os
->constraint
< 0)
4466 output_section
= os
->bfd_section
;
4467 if (output_section
== NULL
)
4470 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
4471 output_section
->map_head
.link_order
= NULL
;
4472 output_section
->map_tail
.link_order
= NULL
;
4475 /* Stop future calls to lang_add_section from messing with map_head
4476 and map_tail link_order fields. */
4477 map_head_is_link_order
= TRUE
;
4481 print_output_section_statement
4482 (lang_output_section_statement_type
*output_section_statement
)
4484 asection
*section
= output_section_statement
->bfd_section
;
4487 if (output_section_statement
!= abs_output_section
)
4489 minfo ("\n%s", output_section_statement
->name
);
4491 if (section
!= NULL
)
4493 print_dot
= section
->vma
;
4495 len
= strlen (output_section_statement
->name
);
4496 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4501 while (len
< SECTION_NAME_MAP_LENGTH
)
4507 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4509 if (section
->vma
!= section
->lma
)
4510 minfo (_(" load address 0x%V"), section
->lma
);
4512 if (output_section_statement
->update_dot_tree
!= NULL
)
4513 exp_fold_tree (output_section_statement
->update_dot_tree
,
4514 bfd_abs_section_ptr
, &print_dot
);
4520 print_statement_list (output_section_statement
->children
.head
,
4521 output_section_statement
);
4525 print_assignment (lang_assignment_statement_type
*assignment
,
4526 lang_output_section_statement_type
*output_section
)
4533 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4536 if (assignment
->exp
->type
.node_class
== etree_assert
)
4539 tree
= assignment
->exp
->assert_s
.child
;
4543 const char *dst
= assignment
->exp
->assign
.dst
;
4545 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4546 tree
= assignment
->exp
;
4549 osec
= output_section
->bfd_section
;
4551 osec
= bfd_abs_section_ptr
;
4553 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4554 exp_fold_tree (tree
, osec
, &print_dot
);
4556 expld
.result
.valid_p
= FALSE
;
4558 if (expld
.result
.valid_p
)
4562 if (assignment
->exp
->type
.node_class
== etree_assert
4564 || expld
.assign_name
!= NULL
)
4566 value
= expld
.result
.value
;
4568 if (expld
.result
.section
!= NULL
)
4569 value
+= expld
.result
.section
->vma
;
4571 minfo ("0x%V", value
);
4577 struct bfd_link_hash_entry
*h
;
4579 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4580 FALSE
, FALSE
, TRUE
);
4582 && (h
->type
== bfd_link_hash_defined
4583 || h
->type
== bfd_link_hash_defweak
))
4585 value
= h
->u
.def
.value
;
4586 value
+= h
->u
.def
.section
->output_section
->vma
;
4587 value
+= h
->u
.def
.section
->output_offset
;
4589 minfo ("[0x%V]", value
);
4592 minfo ("[unresolved]");
4597 if (assignment
->exp
->type
.node_class
== etree_provide
)
4598 minfo ("[!provide]");
4605 expld
.assign_name
= NULL
;
4608 exp_print_tree (assignment
->exp
);
4613 print_input_statement (lang_input_statement_type
*statm
)
4615 if (statm
->filename
!= NULL
)
4616 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4619 /* Print all symbols defined in a particular section. This is called
4620 via bfd_link_hash_traverse, or by print_all_symbols. */
4623 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4625 asection
*sec
= (asection
*) ptr
;
4627 if ((hash_entry
->type
== bfd_link_hash_defined
4628 || hash_entry
->type
== bfd_link_hash_defweak
)
4629 && sec
== hash_entry
->u
.def
.section
)
4633 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4636 (hash_entry
->u
.def
.value
4637 + hash_entry
->u
.def
.section
->output_offset
4638 + hash_entry
->u
.def
.section
->output_section
->vma
));
4640 minfo (" %pT\n", hash_entry
->root
.string
);
4647 hash_entry_addr_cmp (const void *a
, const void *b
)
4649 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4650 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4652 if (l
->u
.def
.value
< r
->u
.def
.value
)
4654 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4661 print_all_symbols (asection
*sec
)
4663 input_section_userdata_type
*ud
= bfd_section_userdata (sec
);
4664 struct map_symbol_def
*def
;
4665 struct bfd_link_hash_entry
**entries
;
4671 *ud
->map_symbol_def_tail
= 0;
4673 /* Sort the symbols by address. */
4674 entries
= (struct bfd_link_hash_entry
**)
4675 obstack_alloc (&map_obstack
,
4676 ud
->map_symbol_def_count
* sizeof (*entries
));
4678 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4679 entries
[i
] = def
->entry
;
4681 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4682 hash_entry_addr_cmp
);
4684 /* Print the symbols. */
4685 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4686 print_one_symbol (entries
[i
], sec
);
4688 obstack_free (&map_obstack
, entries
);
4691 /* Print information about an input section to the map file. */
4694 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4696 bfd_size_type size
= i
->size
;
4703 minfo ("%s", i
->name
);
4705 len
= 1 + strlen (i
->name
);
4706 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4711 while (len
< SECTION_NAME_MAP_LENGTH
)
4717 if (i
->output_section
!= NULL
4718 && i
->output_section
->owner
== link_info
.output_bfd
)
4719 addr
= i
->output_section
->vma
+ i
->output_offset
;
4727 minfo ("0x%V %W %pB\n", addr
, TO_ADDR (size
), i
->owner
);
4729 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4731 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4743 minfo (_("%W (size before relaxing)\n"), TO_ADDR (i
->rawsize
));
4746 if (i
->output_section
!= NULL
4747 && i
->output_section
->owner
== link_info
.output_bfd
)
4749 if (link_info
.reduce_memory_overheads
)
4750 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4752 print_all_symbols (i
);
4754 /* Update print_dot, but make sure that we do not move it
4755 backwards - this could happen if we have overlays and a
4756 later overlay is shorter than an earier one. */
4757 if (addr
+ TO_ADDR (size
) > print_dot
)
4758 print_dot
= addr
+ TO_ADDR (size
);
4763 print_fill_statement (lang_fill_statement_type
*fill
)
4767 fputs (" FILL mask 0x", config
.map_file
);
4768 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4769 fprintf (config
.map_file
, "%02x", *p
);
4770 fputs ("\n", config
.map_file
);
4774 print_data_statement (lang_data_statement_type
*data
)
4781 init_opb (data
->output_section
);
4782 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4785 addr
= data
->output_offset
;
4786 if (data
->output_section
!= NULL
)
4787 addr
+= data
->output_section
->vma
;
4815 if (size
< TO_SIZE ((unsigned) 1))
4816 size
= TO_SIZE ((unsigned) 1);
4817 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4819 if (data
->exp
->type
.node_class
!= etree_value
)
4822 exp_print_tree (data
->exp
);
4827 print_dot
= addr
+ TO_ADDR (size
);
4830 /* Print an address statement. These are generated by options like
4834 print_address_statement (lang_address_statement_type
*address
)
4836 minfo (_("Address of section %s set to "), address
->section_name
);
4837 exp_print_tree (address
->address
);
4841 /* Print a reloc statement. */
4844 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4850 init_opb (reloc
->output_section
);
4851 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4854 addr
= reloc
->output_offset
;
4855 if (reloc
->output_section
!= NULL
)
4856 addr
+= reloc
->output_section
->vma
;
4858 size
= bfd_get_reloc_size (reloc
->howto
);
4860 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4862 if (reloc
->name
!= NULL
)
4863 minfo ("%s+", reloc
->name
);
4865 minfo ("%s+", reloc
->section
->name
);
4867 exp_print_tree (reloc
->addend_exp
);
4871 print_dot
= addr
+ TO_ADDR (size
);
4875 print_padding_statement (lang_padding_statement_type
*s
)
4880 init_opb (s
->output_section
);
4883 len
= sizeof " *fill*" - 1;
4884 while (len
< SECTION_NAME_MAP_LENGTH
)
4890 addr
= s
->output_offset
;
4891 if (s
->output_section
!= NULL
)
4892 addr
+= s
->output_section
->vma
;
4893 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4895 if (s
->fill
->size
!= 0)
4899 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4900 fprintf (config
.map_file
, "%02x", *p
);
4905 print_dot
= addr
+ TO_ADDR (s
->size
);
4909 print_wild_statement (lang_wild_statement_type
*w
,
4910 lang_output_section_statement_type
*os
)
4912 struct wildcard_list
*sec
;
4916 if (w
->exclude_name_list
)
4919 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
4920 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4921 minfo (" %s", tmp
->name
);
4925 if (w
->filenames_sorted
)
4926 minfo ("SORT_BY_NAME(");
4927 if (w
->filename
!= NULL
)
4928 minfo ("%s", w
->filename
);
4931 if (w
->filenames_sorted
)
4935 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4937 int closing_paren
= 0;
4939 switch (sec
->spec
.sorted
)
4945 minfo ("SORT_BY_NAME(");
4950 minfo ("SORT_BY_ALIGNMENT(");
4954 case by_name_alignment
:
4955 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
4959 case by_alignment_name
:
4960 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
4965 minfo ("SORT_NONE(");
4969 case by_init_priority
:
4970 minfo ("SORT_BY_INIT_PRIORITY(");
4975 if (sec
->spec
.exclude_name_list
!= NULL
)
4978 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4979 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4980 minfo (" %s", tmp
->name
);
4983 if (sec
->spec
.name
!= NULL
)
4984 minfo ("%s", sec
->spec
.name
);
4987 for (;closing_paren
> 0; closing_paren
--)
4996 print_statement_list (w
->children
.head
, os
);
4999 /* Print a group statement. */
5002 print_group (lang_group_statement_type
*s
,
5003 lang_output_section_statement_type
*os
)
5005 fprintf (config
.map_file
, "START GROUP\n");
5006 print_statement_list (s
->children
.head
, os
);
5007 fprintf (config
.map_file
, "END GROUP\n");
5010 /* Print the list of statements in S.
5011 This can be called for any statement type. */
5014 print_statement_list (lang_statement_union_type
*s
,
5015 lang_output_section_statement_type
*os
)
5019 print_statement (s
, os
);
5024 /* Print the first statement in statement list S.
5025 This can be called for any statement type. */
5028 print_statement (lang_statement_union_type
*s
,
5029 lang_output_section_statement_type
*os
)
5031 switch (s
->header
.type
)
5034 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
5037 case lang_constructors_statement_enum
:
5038 if (constructor_list
.head
!= NULL
)
5040 if (constructors_sorted
)
5041 minfo (" SORT (CONSTRUCTORS)\n");
5043 minfo (" CONSTRUCTORS\n");
5044 print_statement_list (constructor_list
.head
, os
);
5047 case lang_wild_statement_enum
:
5048 print_wild_statement (&s
->wild_statement
, os
);
5050 case lang_address_statement_enum
:
5051 print_address_statement (&s
->address_statement
);
5053 case lang_object_symbols_statement_enum
:
5054 minfo (" CREATE_OBJECT_SYMBOLS\n");
5056 case lang_fill_statement_enum
:
5057 print_fill_statement (&s
->fill_statement
);
5059 case lang_data_statement_enum
:
5060 print_data_statement (&s
->data_statement
);
5062 case lang_reloc_statement_enum
:
5063 print_reloc_statement (&s
->reloc_statement
);
5065 case lang_input_section_enum
:
5066 print_input_section (s
->input_section
.section
, FALSE
);
5068 case lang_padding_statement_enum
:
5069 print_padding_statement (&s
->padding_statement
);
5071 case lang_output_section_statement_enum
:
5072 print_output_section_statement (&s
->output_section_statement
);
5074 case lang_assignment_statement_enum
:
5075 print_assignment (&s
->assignment_statement
, os
);
5077 case lang_target_statement_enum
:
5078 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
5080 case lang_output_statement_enum
:
5081 minfo ("OUTPUT(%s", s
->output_statement
.name
);
5082 if (output_target
!= NULL
)
5083 minfo (" %s", output_target
);
5086 case lang_input_statement_enum
:
5087 print_input_statement (&s
->input_statement
);
5089 case lang_group_statement_enum
:
5090 print_group (&s
->group_statement
, os
);
5092 case lang_insert_statement_enum
:
5093 minfo ("INSERT %s %s\n",
5094 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
5095 s
->insert_statement
.where
);
5101 print_statements (void)
5103 print_statement_list (statement_list
.head
, abs_output_section
);
5106 /* Print the first N statements in statement list S to STDERR.
5107 If N == 0, nothing is printed.
5108 If N < 0, the entire list is printed.
5109 Intended to be called from GDB. */
5112 dprint_statement (lang_statement_union_type
*s
, int n
)
5114 FILE *map_save
= config
.map_file
;
5116 config
.map_file
= stderr
;
5119 print_statement_list (s
, abs_output_section
);
5122 while (s
&& --n
>= 0)
5124 print_statement (s
, abs_output_section
);
5129 config
.map_file
= map_save
;
5133 insert_pad (lang_statement_union_type
**ptr
,
5135 bfd_size_type alignment_needed
,
5136 asection
*output_section
,
5139 static fill_type zero_fill
;
5140 lang_statement_union_type
*pad
= NULL
;
5142 if (ptr
!= &statement_list
.head
)
5143 pad
= ((lang_statement_union_type
*)
5144 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
5146 && pad
->header
.type
== lang_padding_statement_enum
5147 && pad
->padding_statement
.output_section
== output_section
)
5149 /* Use the existing pad statement. */
5151 else if ((pad
= *ptr
) != NULL
5152 && pad
->header
.type
== lang_padding_statement_enum
5153 && pad
->padding_statement
.output_section
== output_section
)
5155 /* Use the existing pad statement. */
5159 /* Make a new padding statement, linked into existing chain. */
5160 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
5161 pad
->header
.next
= *ptr
;
5163 pad
->header
.type
= lang_padding_statement_enum
;
5164 pad
->padding_statement
.output_section
= output_section
;
5167 pad
->padding_statement
.fill
= fill
;
5169 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
5170 pad
->padding_statement
.size
= alignment_needed
;
5171 if (!(output_section
->flags
& SEC_FIXED_SIZE
))
5172 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
5173 - output_section
->vma
);
5176 /* Work out how much this section will move the dot point. */
5180 (lang_statement_union_type
**this_ptr
,
5181 lang_output_section_statement_type
*output_section_statement
,
5183 bfd_boolean
*removed
,
5186 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
5187 asection
*i
= is
->section
;
5188 asection
*o
= output_section_statement
->bfd_section
;
5191 if (link_info
.non_contiguous_regions
)
5193 /* If the input section I has already been successfully assigned
5194 to an output section other than O, don't bother with it and
5195 let the caller remove it from the list. Keep processing in
5196 case we have already handled O, because the repeated passes
5197 have reinitialized its size. */
5198 if (i
->already_assigned
&& i
->already_assigned
!= o
)
5205 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
5206 i
->output_offset
= i
->vma
- o
->vma
;
5207 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
5208 || output_section_statement
->ignored
)
5209 i
->output_offset
= dot
- o
->vma
;
5212 bfd_size_type alignment_needed
;
5214 /* Align this section first to the input sections requirement,
5215 then to the output section's requirement. If this alignment
5216 is greater than any seen before, then record it too. Perform
5217 the alignment by inserting a magic 'padding' statement. */
5219 if (output_section_statement
->subsection_alignment
!= NULL
)
5221 = exp_get_power (output_section_statement
->subsection_alignment
,
5222 "subsection alignment");
5224 if (o
->alignment_power
< i
->alignment_power
)
5225 o
->alignment_power
= i
->alignment_power
;
5227 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
5229 if (alignment_needed
!= 0)
5231 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
5232 dot
+= alignment_needed
;
5235 if (link_info
.non_contiguous_regions
)
5237 /* If I would overflow O, let the caller remove I from the
5239 if (output_section_statement
->region
)
5241 bfd_vma end
= output_section_statement
->region
->origin
5242 + output_section_statement
->region
->length
;
5244 if (dot
+ TO_ADDR (i
->size
) > end
)
5246 if (i
->flags
& SEC_LINKER_CREATED
)
5247 einfo (_("%F%P: Output section '%s' not large enough for the "
5248 "linker-created stubs section '%s'.\n"),
5249 i
->output_section
->name
, i
->name
);
5251 if (i
->rawsize
&& i
->rawsize
!= i
->size
)
5252 einfo (_("%F%P: Relaxation not supported with "
5253 "--enable-non-contiguous-regions (section '%s' "
5254 "would overflow '%s' after it changed size).\n"),
5255 i
->name
, i
->output_section
->name
);
5259 i
->output_section
= NULL
;
5265 /* Remember where in the output section this input section goes. */
5266 i
->output_offset
= dot
- o
->vma
;
5268 /* Mark how big the output section must be to contain this now. */
5269 dot
+= TO_ADDR (i
->size
);
5270 if (!(o
->flags
& SEC_FIXED_SIZE
))
5271 o
->size
= TO_SIZE (dot
- o
->vma
);
5273 if (link_info
.non_contiguous_regions
)
5275 /* Record that I was successfully assigned to O, and update
5276 its actual output section too. */
5277 i
->already_assigned
= o
;
5278 i
->output_section
= o
;
5292 sort_sections_by_lma (const void *arg1
, const void *arg2
)
5294 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5295 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5297 if (sec1
->lma
< sec2
->lma
)
5299 else if (sec1
->lma
> sec2
->lma
)
5301 else if (sec1
->id
< sec2
->id
)
5303 else if (sec1
->id
> sec2
->id
)
5310 sort_sections_by_vma (const void *arg1
, const void *arg2
)
5312 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
5313 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
5315 if (sec1
->vma
< sec2
->vma
)
5317 else if (sec1
->vma
> sec2
->vma
)
5319 else if (sec1
->id
< sec2
->id
)
5321 else if (sec1
->id
> sec2
->id
)
5327 #define IS_TBSS(s) \
5328 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
5330 #define IGNORE_SECTION(s) \
5331 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
5333 /* Check to see if any allocated sections overlap with other allocated
5334 sections. This can happen if a linker script specifies the output
5335 section addresses of the two sections. Also check whether any memory
5336 region has overflowed. */
5339 lang_check_section_addresses (void)
5342 struct check_sec
*sections
;
5347 bfd_vma p_start
= 0;
5349 lang_memory_region_type
*m
;
5350 bfd_boolean overlays
;
5352 /* Detect address space overflow on allocated sections. */
5353 addr_mask
= ((bfd_vma
) 1 <<
5354 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
5355 addr_mask
= (addr_mask
<< 1) + 1;
5356 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5357 if ((s
->flags
& SEC_ALLOC
) != 0)
5359 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
5360 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
5361 einfo (_("%X%P: section %s VMA wraps around address space\n"),
5365 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
5366 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
5367 einfo (_("%X%P: section %s LMA wraps around address space\n"),
5372 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
5375 count
= bfd_count_sections (link_info
.output_bfd
);
5376 sections
= XNEWVEC (struct check_sec
, count
);
5378 /* Scan all sections in the output list. */
5380 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5382 if (IGNORE_SECTION (s
)
5386 sections
[count
].sec
= s
;
5387 sections
[count
].warned
= FALSE
;
5397 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
5399 /* First check section LMAs. There should be no overlap of LMAs on
5400 loadable sections, even with overlays. */
5401 for (p
= NULL
, i
= 0; i
< count
; i
++)
5403 s
= sections
[i
].sec
;
5405 if ((s
->flags
& SEC_LOAD
) != 0)
5408 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5410 /* Look for an overlap. We have sorted sections by lma, so
5411 we know that s_start >= p_start. Besides the obvious
5412 case of overlap when the current section starts before
5413 the previous one ends, we also must have overlap if the
5414 previous section wraps around the address space. */
5416 && (s_start
<= p_end
5417 || p_end
< p_start
))
5419 einfo (_("%X%P: section %s LMA [%V,%V]"
5420 " overlaps section %s LMA [%V,%V]\n"),
5421 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5422 sections
[i
].warned
= TRUE
;
5430 /* If any non-zero size allocated section (excluding tbss) starts at
5431 exactly the same VMA as another such section, then we have
5432 overlays. Overlays generated by the OVERLAY keyword will have
5433 this property. It is possible to intentionally generate overlays
5434 that fail this test, but it would be unusual. */
5435 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
5437 p_start
= sections
[0].sec
->vma
;
5438 for (i
= 1; i
< count
; i
++)
5440 s_start
= sections
[i
].sec
->vma
;
5441 if (p_start
== s_start
)
5449 /* Now check section VMAs if no overlays were detected. */
5452 for (p
= NULL
, i
= 0; i
< count
; i
++)
5454 s
= sections
[i
].sec
;
5457 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5460 && !sections
[i
].warned
5461 && (s_start
<= p_end
5462 || p_end
< p_start
))
5463 einfo (_("%X%P: section %s VMA [%V,%V]"
5464 " overlaps section %s VMA [%V,%V]\n"),
5465 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5474 /* If any memory region has overflowed, report by how much.
5475 We do not issue this diagnostic for regions that had sections
5476 explicitly placed outside their bounds; os_region_check's
5477 diagnostics are adequate for that case.
5479 FIXME: It is conceivable that m->current - (m->origin + m->length)
5480 might overflow a 32-bit integer. There is, alas, no way to print
5481 a bfd_vma quantity in decimal. */
5482 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
5483 if (m
->had_full_message
)
5485 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
5486 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
5487 "%X%P: region `%s' overflowed by %lu bytes\n",
5489 m
->name_list
.name
, over
);
5493 /* Make sure the new address is within the region. We explicitly permit the
5494 current address to be at the exact end of the region when the address is
5495 non-zero, in case the region is at the end of addressable memory and the
5496 calculation wraps around. */
5499 os_region_check (lang_output_section_statement_type
*os
,
5500 lang_memory_region_type
*region
,
5504 if ((region
->current
< region
->origin
5505 || (region
->current
- region
->origin
> region
->length
))
5506 && ((region
->current
!= region
->origin
+ region
->length
)
5511 einfo (_("%X%P: address 0x%v of %pB section `%s'"
5512 " is not within region `%s'\n"),
5514 os
->bfd_section
->owner
,
5515 os
->bfd_section
->name
,
5516 region
->name_list
.name
);
5518 else if (!region
->had_full_message
)
5520 region
->had_full_message
= TRUE
;
5522 einfo (_("%X%P: %pB section `%s' will not fit in region `%s'\n"),
5523 os
->bfd_section
->owner
,
5524 os
->bfd_section
->name
,
5525 region
->name_list
.name
);
5531 ldlang_check_relro_region (lang_statement_union_type
*s
,
5532 seg_align_type
*seg
)
5534 if (seg
->relro
== exp_seg_relro_start
)
5536 if (!seg
->relro_start_stat
)
5537 seg
->relro_start_stat
= s
;
5540 ASSERT (seg
->relro_start_stat
== s
);
5543 else if (seg
->relro
== exp_seg_relro_end
)
5545 if (!seg
->relro_end_stat
)
5546 seg
->relro_end_stat
= s
;
5549 ASSERT (seg
->relro_end_stat
== s
);
5554 /* Set the sizes for all the output sections. */
5557 lang_size_sections_1
5558 (lang_statement_union_type
**prev
,
5559 lang_output_section_statement_type
*output_section_statement
,
5563 bfd_boolean check_regions
)
5565 lang_statement_union_type
*s
;
5566 lang_statement_union_type
*prev_s
= NULL
;
5567 bfd_boolean removed_prev_s
= FALSE
;
5569 /* Size up the sections from their constituent parts. */
5570 for (s
= *prev
; s
!= NULL
; prev_s
= s
, s
= s
->header
.next
)
5572 bfd_boolean removed
=FALSE
;
5574 switch (s
->header
.type
)
5576 case lang_output_section_statement_enum
:
5578 bfd_vma newdot
, after
, dotdelta
;
5579 lang_output_section_statement_type
*os
;
5580 lang_memory_region_type
*r
;
5581 int section_alignment
= 0;
5583 os
= &s
->output_section_statement
;
5584 init_opb (os
->bfd_section
);
5585 if (os
->constraint
== -1)
5588 /* FIXME: We shouldn't need to zero section vmas for ld -r
5589 here, in lang_insert_orphan, or in the default linker scripts.
5590 This is covering for coff backend linker bugs. See PR6945. */
5591 if (os
->addr_tree
== NULL
5592 && bfd_link_relocatable (&link_info
)
5593 && (bfd_get_flavour (link_info
.output_bfd
)
5594 == bfd_target_coff_flavour
))
5595 os
->addr_tree
= exp_intop (0);
5596 if (os
->addr_tree
!= NULL
)
5598 os
->processed_vma
= FALSE
;
5599 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5601 if (expld
.result
.valid_p
)
5603 dot
= expld
.result
.value
;
5604 if (expld
.result
.section
!= NULL
)
5605 dot
+= expld
.result
.section
->vma
;
5607 else if (expld
.phase
!= lang_mark_phase_enum
)
5608 einfo (_("%F%P:%pS: non constant or forward reference"
5609 " address expression for section %s\n"),
5610 os
->addr_tree
, os
->name
);
5613 if (os
->bfd_section
== NULL
)
5614 /* This section was removed or never actually created. */
5617 /* If this is a COFF shared library section, use the size and
5618 address from the input section. FIXME: This is COFF
5619 specific; it would be cleaner if there were some other way
5620 to do this, but nothing simple comes to mind. */
5621 if (((bfd_get_flavour (link_info
.output_bfd
)
5622 == bfd_target_ecoff_flavour
)
5623 || (bfd_get_flavour (link_info
.output_bfd
)
5624 == bfd_target_coff_flavour
))
5625 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5629 if (os
->children
.head
== NULL
5630 || os
->children
.head
->header
.next
!= NULL
5631 || (os
->children
.head
->header
.type
5632 != lang_input_section_enum
))
5633 einfo (_("%X%P: internal error on COFF shared library"
5634 " section %s\n"), os
->name
);
5636 input
= os
->children
.head
->input_section
.section
;
5637 bfd_set_section_vma (os
->bfd_section
,
5638 bfd_section_vma (input
));
5639 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5640 os
->bfd_section
->size
= input
->size
;
5646 if (bfd_is_abs_section (os
->bfd_section
))
5648 /* No matter what happens, an abs section starts at zero. */
5649 ASSERT (os
->bfd_section
->vma
== 0);
5653 if (os
->addr_tree
== NULL
)
5655 /* No address specified for this section, get one
5656 from the region specification. */
5657 if (os
->region
== NULL
5658 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5659 && os
->region
->name_list
.name
[0] == '*'
5660 && strcmp (os
->region
->name_list
.name
,
5661 DEFAULT_MEMORY_REGION
) == 0))
5663 os
->region
= lang_memory_default (os
->bfd_section
);
5666 /* If a loadable section is using the default memory
5667 region, and some non default memory regions were
5668 defined, issue an error message. */
5670 && !IGNORE_SECTION (os
->bfd_section
)
5671 && !bfd_link_relocatable (&link_info
)
5673 && strcmp (os
->region
->name_list
.name
,
5674 DEFAULT_MEMORY_REGION
) == 0
5675 && lang_memory_region_list
!= NULL
5676 && (strcmp (lang_memory_region_list
->name_list
.name
,
5677 DEFAULT_MEMORY_REGION
) != 0
5678 || lang_memory_region_list
->next
!= NULL
)
5679 && lang_sizing_iteration
== 1)
5681 /* By default this is an error rather than just a
5682 warning because if we allocate the section to the
5683 default memory region we can end up creating an
5684 excessively large binary, or even seg faulting when
5685 attempting to perform a negative seek. See
5686 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5687 for an example of this. This behaviour can be
5688 overridden by the using the --no-check-sections
5690 if (command_line
.check_section_addresses
)
5691 einfo (_("%F%P: error: no memory region specified"
5692 " for loadable section `%s'\n"),
5693 bfd_section_name (os
->bfd_section
));
5695 einfo (_("%P: warning: no memory region specified"
5696 " for loadable section `%s'\n"),
5697 bfd_section_name (os
->bfd_section
));
5700 newdot
= os
->region
->current
;
5701 section_alignment
= os
->bfd_section
->alignment_power
;
5704 section_alignment
= exp_get_power (os
->section_alignment
,
5705 "section alignment");
5707 /* Align to what the section needs. */
5708 if (section_alignment
> 0)
5710 bfd_vma savedot
= newdot
;
5713 newdot
= align_power (newdot
, section_alignment
);
5714 dotdelta
= newdot
- savedot
;
5716 if (lang_sizing_iteration
== 1)
5718 else if (lang_sizing_iteration
> 1)
5720 /* Only report adjustments that would change
5721 alignment from what we have already reported. */
5722 diff
= newdot
- os
->bfd_section
->vma
;
5723 if (!(diff
& (((bfd_vma
) 1 << section_alignment
) - 1)))
5727 && (config
.warn_section_align
5728 || os
->addr_tree
!= NULL
))
5729 einfo (_("%P: warning: "
5730 "start of section %s changed by %ld\n"),
5731 os
->name
, (long) diff
);
5734 bfd_set_section_vma (os
->bfd_section
, newdot
);
5736 os
->bfd_section
->output_offset
= 0;
5739 lang_size_sections_1 (&os
->children
.head
, os
,
5740 os
->fill
, newdot
, relax
, check_regions
);
5742 os
->processed_vma
= TRUE
;
5744 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5745 /* Except for some special linker created sections,
5746 no output section should change from zero size
5747 after strip_excluded_output_sections. A non-zero
5748 size on an ignored section indicates that some
5749 input section was not sized early enough. */
5750 ASSERT (os
->bfd_section
->size
== 0);
5753 dot
= os
->bfd_section
->vma
;
5755 /* Put the section within the requested block size, or
5756 align at the block boundary. */
5758 + TO_ADDR (os
->bfd_section
->size
)
5759 + os
->block_value
- 1)
5760 & - (bfd_vma
) os
->block_value
);
5762 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5763 os
->bfd_section
->size
= TO_SIZE (after
5764 - os
->bfd_section
->vma
);
5767 /* Set section lma. */
5770 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5774 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5775 os
->bfd_section
->lma
= lma
;
5777 else if (os
->lma_region
!= NULL
)
5779 bfd_vma lma
= os
->lma_region
->current
;
5781 if (os
->align_lma_with_input
)
5785 /* When LMA_REGION is the same as REGION, align the LMA
5786 as we did for the VMA, possibly including alignment
5787 from the bfd section. If a different region, then
5788 only align according to the value in the output
5790 if (os
->lma_region
!= os
->region
)
5791 section_alignment
= exp_get_power (os
->section_alignment
,
5792 "section alignment");
5793 if (section_alignment
> 0)
5794 lma
= align_power (lma
, section_alignment
);
5796 os
->bfd_section
->lma
= lma
;
5798 else if (r
->last_os
!= NULL
5799 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5804 last
= r
->last_os
->output_section_statement
.bfd_section
;
5806 /* A backwards move of dot should be accompanied by
5807 an explicit assignment to the section LMA (ie.
5808 os->load_base set) because backwards moves can
5809 create overlapping LMAs. */
5811 && os
->bfd_section
->size
!= 0
5812 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5814 /* If dot moved backwards then leave lma equal to
5815 vma. This is the old default lma, which might
5816 just happen to work when the backwards move is
5817 sufficiently large. Nag if this changes anything,
5818 so people can fix their linker scripts. */
5820 if (last
->vma
!= last
->lma
)
5821 einfo (_("%P: warning: dot moved backwards "
5822 "before `%s'\n"), os
->name
);
5826 /* If this is an overlay, set the current lma to that
5827 at the end of the previous section. */
5828 if (os
->sectype
== overlay_section
)
5829 lma
= last
->lma
+ TO_ADDR (last
->size
);
5831 /* Otherwise, keep the same lma to vma relationship
5832 as the previous section. */
5834 lma
= os
->bfd_section
->vma
+ last
->lma
- last
->vma
;
5836 if (section_alignment
> 0)
5837 lma
= align_power (lma
, section_alignment
);
5838 os
->bfd_section
->lma
= lma
;
5841 os
->processed_lma
= TRUE
;
5843 /* Keep track of normal sections using the default
5844 lma region. We use this to set the lma for
5845 following sections. Overlays or other linker
5846 script assignment to lma might mean that the
5847 default lma == vma is incorrect.
5848 To avoid warnings about dot moving backwards when using
5849 -Ttext, don't start tracking sections until we find one
5850 of non-zero size or with lma set differently to vma.
5851 Do this tracking before we short-cut the loop so that we
5852 track changes for the case where the section size is zero,
5853 but the lma is set differently to the vma. This is
5854 important, if an orphan section is placed after an
5855 otherwise empty output section that has an explicit lma
5856 set, we want that lma reflected in the orphans lma. */
5857 if (((!IGNORE_SECTION (os
->bfd_section
)
5858 && (os
->bfd_section
->size
!= 0
5859 || (r
->last_os
== NULL
5860 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5861 || (r
->last_os
!= NULL
5862 && dot
>= (r
->last_os
->output_section_statement
5863 .bfd_section
->vma
))))
5864 || os
->sectype
== first_overlay_section
)
5865 && os
->lma_region
== NULL
5866 && !bfd_link_relocatable (&link_info
))
5869 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5872 /* .tbss sections effectively have zero size. */
5873 if (!IS_TBSS (os
->bfd_section
)
5874 || bfd_link_relocatable (&link_info
))
5875 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5880 if (os
->update_dot_tree
!= 0)
5881 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5883 /* Update dot in the region ?
5884 We only do this if the section is going to be allocated,
5885 since unallocated sections do not contribute to the region's
5886 overall size in memory. */
5887 if (os
->region
!= NULL
5888 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5890 os
->region
->current
= dot
;
5893 /* Make sure the new address is within the region. */
5894 os_region_check (os
, os
->region
, os
->addr_tree
,
5895 os
->bfd_section
->vma
);
5897 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5898 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5899 || os
->align_lma_with_input
))
5901 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5904 os_region_check (os
, os
->lma_region
, NULL
,
5905 os
->bfd_section
->lma
);
5911 case lang_constructors_statement_enum
:
5912 dot
= lang_size_sections_1 (&constructor_list
.head
,
5913 output_section_statement
,
5914 fill
, dot
, relax
, check_regions
);
5917 case lang_data_statement_enum
:
5919 unsigned int size
= 0;
5921 s
->data_statement
.output_offset
=
5922 dot
- output_section_statement
->bfd_section
->vma
;
5923 s
->data_statement
.output_section
=
5924 output_section_statement
->bfd_section
;
5926 /* We might refer to provided symbols in the expression, and
5927 need to mark them as needed. */
5928 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5930 switch (s
->data_statement
.type
)
5948 if (size
< TO_SIZE ((unsigned) 1))
5949 size
= TO_SIZE ((unsigned) 1);
5950 dot
+= TO_ADDR (size
);
5951 if (!(output_section_statement
->bfd_section
->flags
5953 output_section_statement
->bfd_section
->size
5954 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5959 case lang_reloc_statement_enum
:
5963 s
->reloc_statement
.output_offset
=
5964 dot
- output_section_statement
->bfd_section
->vma
;
5965 s
->reloc_statement
.output_section
=
5966 output_section_statement
->bfd_section
;
5967 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5968 dot
+= TO_ADDR (size
);
5969 if (!(output_section_statement
->bfd_section
->flags
5971 output_section_statement
->bfd_section
->size
5972 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5976 case lang_wild_statement_enum
:
5977 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5978 output_section_statement
,
5979 fill
, dot
, relax
, check_regions
);
5982 case lang_object_symbols_statement_enum
:
5983 link_info
.create_object_symbols_section
5984 = output_section_statement
->bfd_section
;
5985 output_section_statement
->bfd_section
->flags
|= SEC_KEEP
;
5988 case lang_output_statement_enum
:
5989 case lang_target_statement_enum
:
5992 case lang_input_section_enum
:
5996 i
= s
->input_section
.section
;
6001 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
6002 einfo (_("%F%P: can't relax section: %E\n"));
6006 dot
= size_input_section (prev
, output_section_statement
,
6007 fill
, &removed
, dot
);
6011 case lang_input_statement_enum
:
6014 case lang_fill_statement_enum
:
6015 s
->fill_statement
.output_section
=
6016 output_section_statement
->bfd_section
;
6018 fill
= s
->fill_statement
.fill
;
6021 case lang_assignment_statement_enum
:
6023 bfd_vma newdot
= dot
;
6024 etree_type
*tree
= s
->assignment_statement
.exp
;
6026 expld
.dataseg
.relro
= exp_seg_relro_none
;
6028 exp_fold_tree (tree
,
6029 output_section_statement
->bfd_section
,
6032 ldlang_check_relro_region (s
, &expld
.dataseg
);
6034 expld
.dataseg
.relro
= exp_seg_relro_none
;
6036 /* This symbol may be relative to this section. */
6037 if ((tree
->type
.node_class
== etree_provided
6038 || tree
->type
.node_class
== etree_assign
)
6039 && (tree
->assign
.dst
[0] != '.'
6040 || tree
->assign
.dst
[1] != '\0'))
6041 output_section_statement
->update_dot
= 1;
6043 if (!output_section_statement
->ignored
)
6045 if (output_section_statement
== abs_output_section
)
6047 /* If we don't have an output section, then just adjust
6048 the default memory address. */
6049 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
6050 FALSE
)->current
= newdot
;
6052 else if (newdot
!= dot
)
6054 /* Insert a pad after this statement. We can't
6055 put the pad before when relaxing, in case the
6056 assignment references dot. */
6057 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
6058 output_section_statement
->bfd_section
, dot
);
6060 /* Don't neuter the pad below when relaxing. */
6063 /* If dot is advanced, this implies that the section
6064 should have space allocated to it, unless the
6065 user has explicitly stated that the section
6066 should not be allocated. */
6067 if (output_section_statement
->sectype
!= noalloc_section
6068 && (output_section_statement
->sectype
!= noload_section
6069 || (bfd_get_flavour (link_info
.output_bfd
)
6070 == bfd_target_elf_flavour
)))
6071 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
6078 case lang_padding_statement_enum
:
6079 /* If this is the first time lang_size_sections is called,
6080 we won't have any padding statements. If this is the
6081 second or later passes when relaxing, we should allow
6082 padding to shrink. If padding is needed on this pass, it
6083 will be added back in. */
6084 s
->padding_statement
.size
= 0;
6086 /* Make sure output_offset is valid. If relaxation shrinks
6087 the section and this pad isn't needed, it's possible to
6088 have output_offset larger than the final size of the
6089 section. bfd_set_section_contents will complain even for
6090 a pad size of zero. */
6091 s
->padding_statement
.output_offset
6092 = dot
- output_section_statement
->bfd_section
->vma
;
6095 case lang_group_statement_enum
:
6096 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
6097 output_section_statement
,
6098 fill
, dot
, relax
, check_regions
);
6101 case lang_insert_statement_enum
:
6104 /* We can only get here when relaxing is turned on. */
6105 case lang_address_statement_enum
:
6113 /* If an input section doesn't fit in the current output
6114 section, remove it from the list. Handle the case where we
6115 have to remove an input_section statement here: there is a
6116 special case to remove the first element of the list. */
6117 if (link_info
.non_contiguous_regions
&& removed
)
6119 /* If we removed the first element during the previous
6120 iteration, override the loop assignment of prev_s. */
6126 /* If there was a real previous input section, just skip
6128 prev_s
->header
.next
=s
->header
.next
;
6130 removed_prev_s
= FALSE
;
6134 /* Remove the first input section of the list. */
6135 *prev
= s
->header
.next
;
6136 removed_prev_s
= TRUE
;
6139 /* Move to next element, unless we removed the head of the
6141 if (!removed_prev_s
)
6142 prev
= &s
->header
.next
;
6146 prev
= &s
->header
.next
;
6147 removed_prev_s
= FALSE
;
6153 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
6154 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
6155 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
6156 segments. We are allowed an opportunity to override this decision. */
6159 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
6160 bfd
*abfd ATTRIBUTE_UNUSED
,
6161 asection
*current_section
,
6162 asection
*previous_section
,
6163 bfd_boolean new_segment
)
6165 lang_output_section_statement_type
*cur
;
6166 lang_output_section_statement_type
*prev
;
6168 /* The checks below are only necessary when the BFD library has decided
6169 that the two sections ought to be placed into the same segment. */
6173 /* Paranoia checks. */
6174 if (current_section
== NULL
|| previous_section
== NULL
)
6177 /* If this flag is set, the target never wants code and non-code
6178 sections comingled in the same segment. */
6179 if (config
.separate_code
6180 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
6183 /* Find the memory regions associated with the two sections.
6184 We call lang_output_section_find() here rather than scanning the list
6185 of output sections looking for a matching section pointer because if
6186 we have a large number of sections then a hash lookup is faster. */
6187 cur
= lang_output_section_find (current_section
->name
);
6188 prev
= lang_output_section_find (previous_section
->name
);
6190 /* More paranoia. */
6191 if (cur
== NULL
|| prev
== NULL
)
6194 /* If the regions are different then force the sections to live in
6195 different segments. See the email thread starting at the following
6196 URL for the reasons why this is necessary:
6197 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
6198 return cur
->region
!= prev
->region
;
6202 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
6204 lang_statement_iteration
++;
6205 if (expld
.phase
!= lang_mark_phase_enum
)
6206 lang_sizing_iteration
++;
6207 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
6208 0, 0, relax
, check_regions
);
6212 lang_size_segment (seg_align_type
*seg
)
6214 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
6215 a page could be saved in the data segment. */
6216 bfd_vma first
, last
;
6218 first
= -seg
->base
& (seg
->pagesize
- 1);
6219 last
= seg
->end
& (seg
->pagesize
- 1);
6221 && ((seg
->base
& ~(seg
->pagesize
- 1))
6222 != (seg
->end
& ~(seg
->pagesize
- 1)))
6223 && first
+ last
<= seg
->pagesize
)
6225 seg
->phase
= exp_seg_adjust
;
6229 seg
->phase
= exp_seg_done
;
6234 lang_size_relro_segment_1 (seg_align_type
*seg
)
6236 bfd_vma relro_end
, desired_end
;
6239 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
6240 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
6241 & ~(seg
->pagesize
- 1));
6243 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
6244 desired_end
= relro_end
- seg
->relro_offset
;
6246 /* For sections in the relro segment.. */
6247 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
6248 if ((sec
->flags
& SEC_ALLOC
) != 0
6249 && sec
->vma
>= seg
->base
6250 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
6252 /* Where do we want to put this section so that it ends as
6254 bfd_vma start
, end
, bump
;
6256 end
= start
= sec
->vma
;
6258 end
+= TO_ADDR (sec
->size
);
6259 bump
= desired_end
- end
;
6260 /* We'd like to increase START by BUMP, but we must heed
6261 alignment so the increase might be less than optimum. */
6263 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
6264 /* This is now the desired end for the previous section. */
6265 desired_end
= start
;
6268 seg
->phase
= exp_seg_relro_adjust
;
6269 ASSERT (desired_end
>= seg
->base
);
6270 seg
->base
= desired_end
;
6275 lang_size_relro_segment (bfd_boolean
*relax
, bfd_boolean check_regions
)
6277 bfd_boolean do_reset
= FALSE
;
6278 bfd_boolean do_data_relro
;
6279 bfd_vma data_initial_base
, data_relro_end
;
6281 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6283 do_data_relro
= TRUE
;
6284 data_initial_base
= expld
.dataseg
.base
;
6285 data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
6289 do_data_relro
= FALSE
;
6290 data_initial_base
= data_relro_end
= 0;
6295 lang_reset_memory_regions ();
6296 one_lang_size_sections_pass (relax
, check_regions
);
6298 /* Assignments to dot, or to output section address in a user
6299 script have increased padding over the original. Revert. */
6300 if (do_data_relro
&& expld
.dataseg
.relro_end
> data_relro_end
)
6302 expld
.dataseg
.base
= data_initial_base
;;
6307 if (!do_data_relro
&& lang_size_segment (&expld
.dataseg
))
6314 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
6316 expld
.phase
= lang_allocating_phase_enum
;
6317 expld
.dataseg
.phase
= exp_seg_none
;
6319 one_lang_size_sections_pass (relax
, check_regions
);
6321 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
6322 expld
.dataseg
.phase
= exp_seg_done
;
6324 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
6326 bfd_boolean do_reset
6327 = lang_size_relro_segment (relax
, check_regions
);
6331 lang_reset_memory_regions ();
6332 one_lang_size_sections_pass (relax
, check_regions
);
6335 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
6337 link_info
.relro_start
= expld
.dataseg
.base
;
6338 link_info
.relro_end
= expld
.dataseg
.relro_end
;
6343 static lang_output_section_statement_type
*current_section
;
6344 static lang_assignment_statement_type
*current_assign
;
6345 static bfd_boolean prefer_next_section
;
6347 /* Worker function for lang_do_assignments. Recursiveness goes here. */
6350 lang_do_assignments_1 (lang_statement_union_type
*s
,
6351 lang_output_section_statement_type
*current_os
,
6354 bfd_boolean
*found_end
)
6356 for (; s
!= NULL
; s
= s
->header
.next
)
6358 switch (s
->header
.type
)
6360 case lang_constructors_statement_enum
:
6361 dot
= lang_do_assignments_1 (constructor_list
.head
,
6362 current_os
, fill
, dot
, found_end
);
6365 case lang_output_section_statement_enum
:
6367 lang_output_section_statement_type
*os
;
6370 os
= &(s
->output_section_statement
);
6371 os
->after_end
= *found_end
;
6372 init_opb (os
->bfd_section
);
6373 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
6375 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
6377 current_section
= os
;
6378 prefer_next_section
= FALSE
;
6380 dot
= os
->bfd_section
->vma
;
6382 newdot
= lang_do_assignments_1 (os
->children
.head
,
6383 os
, os
->fill
, dot
, found_end
);
6386 if (os
->bfd_section
!= NULL
)
6388 /* .tbss sections effectively have zero size. */
6389 if (!IS_TBSS (os
->bfd_section
)
6390 || bfd_link_relocatable (&link_info
))
6391 dot
+= TO_ADDR (os
->bfd_section
->size
);
6393 if (os
->update_dot_tree
!= NULL
)
6394 exp_fold_tree (os
->update_dot_tree
,
6395 bfd_abs_section_ptr
, &dot
);
6403 case lang_wild_statement_enum
:
6405 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
6406 current_os
, fill
, dot
, found_end
);
6409 case lang_object_symbols_statement_enum
:
6410 case lang_output_statement_enum
:
6411 case lang_target_statement_enum
:
6414 case lang_data_statement_enum
:
6415 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
6416 if (expld
.result
.valid_p
)
6418 s
->data_statement
.value
= expld
.result
.value
;
6419 if (expld
.result
.section
!= NULL
)
6420 s
->data_statement
.value
+= expld
.result
.section
->vma
;
6422 else if (expld
.phase
== lang_final_phase_enum
)
6423 einfo (_("%F%P: invalid data statement\n"));
6426 switch (s
->data_statement
.type
)
6444 if (size
< TO_SIZE ((unsigned) 1))
6445 size
= TO_SIZE ((unsigned) 1);
6446 dot
+= TO_ADDR (size
);
6450 case lang_reloc_statement_enum
:
6451 exp_fold_tree (s
->reloc_statement
.addend_exp
,
6452 bfd_abs_section_ptr
, &dot
);
6453 if (expld
.result
.valid_p
)
6454 s
->reloc_statement
.addend_value
= expld
.result
.value
;
6455 else if (expld
.phase
== lang_final_phase_enum
)
6456 einfo (_("%F%P: invalid reloc statement\n"));
6457 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
6460 case lang_input_section_enum
:
6462 asection
*in
= s
->input_section
.section
;
6464 if ((in
->flags
& SEC_EXCLUDE
) == 0)
6465 dot
+= TO_ADDR (in
->size
);
6469 case lang_input_statement_enum
:
6472 case lang_fill_statement_enum
:
6473 fill
= s
->fill_statement
.fill
;
6476 case lang_assignment_statement_enum
:
6477 current_assign
= &s
->assignment_statement
;
6478 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
6480 const char *p
= current_assign
->exp
->assign
.dst
;
6482 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
6483 prefer_next_section
= TRUE
;
6487 if (strcmp (p
, "end") == 0)
6490 exp_fold_tree (s
->assignment_statement
.exp
,
6491 (current_os
->bfd_section
!= NULL
6492 ? current_os
->bfd_section
: bfd_und_section_ptr
),
6496 case lang_padding_statement_enum
:
6497 dot
+= TO_ADDR (s
->padding_statement
.size
);
6500 case lang_group_statement_enum
:
6501 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
6502 current_os
, fill
, dot
, found_end
);
6505 case lang_insert_statement_enum
:
6508 case lang_address_statement_enum
:
6520 lang_do_assignments (lang_phase_type phase
)
6522 bfd_boolean found_end
= FALSE
;
6524 current_section
= NULL
;
6525 prefer_next_section
= FALSE
;
6526 expld
.phase
= phase
;
6527 lang_statement_iteration
++;
6528 lang_do_assignments_1 (statement_list
.head
,
6529 abs_output_section
, NULL
, 0, &found_end
);
6532 /* For an assignment statement outside of an output section statement,
6533 choose the best of neighbouring output sections to use for values
6537 section_for_dot (void)
6541 /* Assignments belong to the previous output section, unless there
6542 has been an assignment to "dot", in which case following
6543 assignments belong to the next output section. (The assumption
6544 is that an assignment to "dot" is setting up the address for the
6545 next output section.) Except that past the assignment to "_end"
6546 we always associate with the previous section. This exception is
6547 for targets like SH that define an alloc .stack or other
6548 weirdness after non-alloc sections. */
6549 if (current_section
== NULL
|| prefer_next_section
)
6551 lang_statement_union_type
*stmt
;
6552 lang_output_section_statement_type
*os
;
6554 for (stmt
= (lang_statement_union_type
*) current_assign
;
6556 stmt
= stmt
->header
.next
)
6557 if (stmt
->header
.type
== lang_output_section_statement_enum
)
6560 os
= &stmt
->output_section_statement
;
6563 && (os
->bfd_section
== NULL
6564 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
6565 || bfd_section_removed_from_list (link_info
.output_bfd
,
6569 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
6572 s
= os
->bfd_section
;
6574 s
= link_info
.output_bfd
->section_last
;
6576 && ((s
->flags
& SEC_ALLOC
) == 0
6577 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6582 return bfd_abs_section_ptr
;
6586 s
= current_section
->bfd_section
;
6588 /* The section may have been stripped. */
6590 && ((s
->flags
& SEC_EXCLUDE
) != 0
6591 || (s
->flags
& SEC_ALLOC
) == 0
6592 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
6593 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
6596 s
= link_info
.output_bfd
->sections
;
6598 && ((s
->flags
& SEC_ALLOC
) == 0
6599 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6604 return bfd_abs_section_ptr
;
6607 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
6609 static struct bfd_link_hash_entry
**start_stop_syms
;
6610 static size_t start_stop_count
= 0;
6611 static size_t start_stop_alloc
= 0;
6613 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6614 to start_stop_syms. */
6617 lang_define_start_stop (const char *symbol
, asection
*sec
)
6619 struct bfd_link_hash_entry
*h
;
6621 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6624 if (start_stop_count
== start_stop_alloc
)
6626 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6628 = xrealloc (start_stop_syms
,
6629 start_stop_alloc
* sizeof (*start_stop_syms
));
6631 start_stop_syms
[start_stop_count
++] = h
;
6635 /* Check for input sections whose names match references to
6636 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6637 preliminary definitions. */
6640 lang_init_start_stop (void)
6644 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6646 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6647 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6650 const char *secname
= s
->name
;
6652 for (ps
= secname
; *ps
!= '\0'; ps
++)
6653 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6657 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6659 symbol
[0] = leading_char
;
6660 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6661 lang_define_start_stop (symbol
, s
);
6663 symbol
[1] = leading_char
;
6664 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6665 lang_define_start_stop (symbol
+ 1, s
);
6672 /* Iterate over start_stop_syms. */
6675 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6679 for (i
= 0; i
< start_stop_count
; ++i
)
6680 func (start_stop_syms
[i
]);
6683 /* __start and __stop symbols are only supposed to be defined by the
6684 linker for orphan sections, but we now extend that to sections that
6685 map to an output section of the same name. The symbols were
6686 defined early for --gc-sections, before we mapped input to output
6687 sections, so undo those that don't satisfy this rule. */
6690 undef_start_stop (struct bfd_link_hash_entry
*h
)
6692 if (h
->ldscript_def
)
6695 if (h
->u
.def
.section
->output_section
== NULL
6696 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6697 || strcmp (h
->u
.def
.section
->name
,
6698 h
->u
.def
.section
->output_section
->name
) != 0)
6700 asection
*sec
= bfd_get_section_by_name (link_info
.output_bfd
,
6701 h
->u
.def
.section
->name
);
6704 /* When there are more than one input sections with the same
6705 section name, SECNAME, linker picks the first one to define
6706 __start_SECNAME and __stop_SECNAME symbols. When the first
6707 input section is removed by comdat group, we need to check
6708 if there is still an output section with section name
6711 for (i
= sec
->map_head
.s
; i
!= NULL
; i
= i
->map_head
.s
)
6712 if (strcmp (h
->u
.def
.section
->name
, i
->name
) == 0)
6714 h
->u
.def
.section
= i
;
6718 h
->type
= bfd_link_hash_undefined
;
6719 h
->u
.undef
.abfd
= NULL
;
6724 lang_undef_start_stop (void)
6726 foreach_start_stop (undef_start_stop
);
6729 /* Check for output sections whose names match references to
6730 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6731 preliminary definitions. */
6734 lang_init_startof_sizeof (void)
6738 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6740 const char *secname
= s
->name
;
6741 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6743 sprintf (symbol
, ".startof.%s", secname
);
6744 lang_define_start_stop (symbol
, s
);
6746 memcpy (symbol
+ 1, ".size", 5);
6747 lang_define_start_stop (symbol
+ 1, s
);
6752 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6755 set_start_stop (struct bfd_link_hash_entry
*h
)
6758 || h
->type
!= bfd_link_hash_defined
)
6761 if (h
->root
.string
[0] == '.')
6763 /* .startof. or .sizeof. symbol.
6764 .startof. already has final value. */
6765 if (h
->root
.string
[2] == 'i')
6768 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6769 h
->u
.def
.section
= bfd_abs_section_ptr
;
6774 /* __start or __stop symbol. */
6775 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6777 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6778 if (h
->root
.string
[4 + has_lead
] == 'o')
6781 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6787 lang_finalize_start_stop (void)
6789 foreach_start_stop (set_start_stop
);
6795 struct bfd_link_hash_entry
*h
;
6798 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
6799 || bfd_link_dll (&link_info
))
6800 warn
= entry_from_cmdline
;
6804 /* Force the user to specify a root when generating a relocatable with
6805 --gc-sections, unless --gc-keep-exported was also given. */
6806 if (bfd_link_relocatable (&link_info
)
6807 && link_info
.gc_sections
6808 && !link_info
.gc_keep_exported
6809 && !(entry_from_cmdline
|| undef_from_cmdline
))
6810 einfo (_("%F%P: gc-sections requires either an entry or "
6811 "an undefined symbol\n"));
6813 if (entry_symbol
.name
== NULL
)
6815 /* No entry has been specified. Look for the default entry, but
6816 don't warn if we don't find it. */
6817 entry_symbol
.name
= entry_symbol_default
;
6821 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
6822 FALSE
, FALSE
, TRUE
);
6824 && (h
->type
== bfd_link_hash_defined
6825 || h
->type
== bfd_link_hash_defweak
)
6826 && h
->u
.def
.section
->output_section
!= NULL
)
6830 val
= (h
->u
.def
.value
6831 + bfd_section_vma (h
->u
.def
.section
->output_section
)
6832 + h
->u
.def
.section
->output_offset
);
6833 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6834 einfo (_("%F%P: %s: can't set start address\n"), entry_symbol
.name
);
6841 /* We couldn't find the entry symbol. Try parsing it as a
6843 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
6846 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6847 einfo (_("%F%P: can't set start address\n"));
6853 /* Can't find the entry symbol, and it's not a number. Use
6854 the first address in the text section. */
6855 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
6859 einfo (_("%P: warning: cannot find entry symbol %s;"
6860 " defaulting to %V\n"),
6862 bfd_section_vma (ts
));
6863 if (!bfd_set_start_address (link_info
.output_bfd
,
6864 bfd_section_vma (ts
)))
6865 einfo (_("%F%P: can't set start address\n"));
6870 einfo (_("%P: warning: cannot find entry symbol %s;"
6871 " not setting start address\n"),
6878 /* This is a small function used when we want to ignore errors from
6882 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
6883 va_list ap ATTRIBUTE_UNUSED
)
6885 /* Don't do anything. */
6888 /* Check that the architecture of all the input files is compatible
6889 with the output file. Also call the backend to let it do any
6890 other checking that is needed. */
6895 lang_input_statement_type
*file
;
6897 const bfd_arch_info_type
*compatible
;
6899 for (file
= (void *) file_chain
.head
;
6903 #ifdef ENABLE_PLUGINS
6904 /* Don't check format of files claimed by plugin. */
6905 if (file
->flags
.claimed
)
6907 #endif /* ENABLE_PLUGINS */
6908 input_bfd
= file
->the_bfd
;
6910 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
6911 command_line
.accept_unknown_input_arch
);
6913 /* In general it is not possible to perform a relocatable
6914 link between differing object formats when the input
6915 file has relocations, because the relocations in the
6916 input format may not have equivalent representations in
6917 the output format (and besides BFD does not translate
6918 relocs for other link purposes than a final link). */
6919 if ((bfd_link_relocatable (&link_info
)
6920 || link_info
.emitrelocations
)
6921 && (compatible
== NULL
6922 || (bfd_get_flavour (input_bfd
)
6923 != bfd_get_flavour (link_info
.output_bfd
)))
6924 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
6926 einfo (_("%F%P: relocatable linking with relocations from"
6927 " format %s (%pB) to format %s (%pB) is not supported\n"),
6928 bfd_get_target (input_bfd
), input_bfd
,
6929 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
6930 /* einfo with %F exits. */
6933 if (compatible
== NULL
)
6935 if (command_line
.warn_mismatch
)
6936 einfo (_("%X%P: %s architecture of input file `%pB'"
6937 " is incompatible with %s output\n"),
6938 bfd_printable_name (input_bfd
), input_bfd
,
6939 bfd_printable_name (link_info
.output_bfd
));
6941 else if (bfd_count_sections (input_bfd
))
6943 /* If the input bfd has no contents, it shouldn't set the
6944 private data of the output bfd. */
6946 bfd_error_handler_type pfn
= NULL
;
6948 /* If we aren't supposed to warn about mismatched input
6949 files, temporarily set the BFD error handler to a
6950 function which will do nothing. We still want to call
6951 bfd_merge_private_bfd_data, since it may set up
6952 information which is needed in the output file. */
6953 if (!command_line
.warn_mismatch
)
6954 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
6955 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
6957 if (command_line
.warn_mismatch
)
6958 einfo (_("%X%P: failed to merge target specific data"
6959 " of file %pB\n"), input_bfd
);
6961 if (!command_line
.warn_mismatch
)
6962 bfd_set_error_handler (pfn
);
6967 /* Look through all the global common symbols and attach them to the
6968 correct section. The -sort-common command line switch may be used
6969 to roughly sort the entries by alignment. */
6974 if (link_info
.inhibit_common_definition
)
6976 if (bfd_link_relocatable (&link_info
)
6977 && !command_line
.force_common_definition
)
6980 if (!config
.sort_common
)
6981 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
6986 if (config
.sort_common
== sort_descending
)
6988 for (power
= 4; power
> 0; power
--)
6989 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6992 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6996 for (power
= 0; power
<= 4; power
++)
6997 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6999 power
= (unsigned int) -1;
7000 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
7005 /* Place one common symbol in the correct section. */
7008 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
7010 unsigned int power_of_two
;
7014 if (h
->type
!= bfd_link_hash_common
)
7018 power_of_two
= h
->u
.c
.p
->alignment_power
;
7020 if (config
.sort_common
== sort_descending
7021 && power_of_two
< *(unsigned int *) info
)
7023 else if (config
.sort_common
== sort_ascending
7024 && power_of_two
> *(unsigned int *) info
)
7027 section
= h
->u
.c
.p
->section
;
7028 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
7029 einfo (_("%F%P: could not define common symbol `%pT': %E\n"),
7032 if (config
.map_file
!= NULL
)
7034 static bfd_boolean header_printed
;
7039 if (!header_printed
)
7041 minfo (_("\nAllocating common symbols\n"));
7042 minfo (_("Common symbol size file\n\n"));
7043 header_printed
= TRUE
;
7046 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
7047 DMGL_ANSI
| DMGL_PARAMS
);
7050 minfo ("%s", h
->root
.string
);
7051 len
= strlen (h
->root
.string
);
7056 len
= strlen (name
);
7072 if (size
<= 0xffffffff)
7073 sprintf (buf
, "%lx", (unsigned long) size
);
7075 sprintf_vma (buf
, size
);
7085 minfo ("%pB\n", section
->owner
);
7091 /* Handle a single orphan section S, placing the orphan into an appropriate
7092 output section. The effects of the --orphan-handling command line
7093 option are handled here. */
7096 ldlang_place_orphan (asection
*s
)
7098 if (config
.orphan_handling
== orphan_handling_discard
)
7100 lang_output_section_statement_type
*os
;
7101 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0,
7103 if (os
->addr_tree
== NULL
7104 && (bfd_link_relocatable (&link_info
)
7105 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7106 os
->addr_tree
= exp_intop (0);
7107 lang_add_section (&os
->children
, s
, NULL
, os
);
7111 lang_output_section_statement_type
*os
;
7112 const char *name
= s
->name
;
7115 if (config
.orphan_handling
== orphan_handling_error
)
7116 einfo (_("%X%P: error: unplaced orphan section `%pA' from `%pB'\n"),
7119 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
7120 constraint
= SPECIAL
;
7122 os
= ldemul_place_orphan (s
, name
, constraint
);
7125 os
= lang_output_section_statement_lookup (name
, constraint
, TRUE
);
7126 if (os
->addr_tree
== NULL
7127 && (bfd_link_relocatable (&link_info
)
7128 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
7129 os
->addr_tree
= exp_intop (0);
7130 lang_add_section (&os
->children
, s
, NULL
, os
);
7133 if (config
.orphan_handling
== orphan_handling_warn
)
7134 einfo (_("%P: warning: orphan section `%pA' from `%pB' being "
7135 "placed in section `%s'\n"),
7136 s
, s
->owner
, os
->name
);
7140 /* Run through the input files and ensure that every input section has
7141 somewhere to go. If one is found without a destination then create
7142 an input request and place it into the statement tree. */
7145 lang_place_orphans (void)
7147 LANG_FOR_EACH_INPUT_STATEMENT (file
)
7151 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
7153 if (s
->output_section
== NULL
)
7155 /* This section of the file is not attached, root
7156 around for a sensible place for it to go. */
7158 if (file
->flags
.just_syms
)
7159 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
7160 else if (lang_discard_section_p (s
))
7161 s
->output_section
= bfd_abs_section_ptr
;
7162 else if (strcmp (s
->name
, "COMMON") == 0)
7164 /* This is a lonely common section which must have
7165 come from an archive. We attach to the section
7166 with the wildcard. */
7167 if (!bfd_link_relocatable (&link_info
)
7168 || command_line
.force_common_definition
)
7170 if (default_common_section
== NULL
)
7171 default_common_section
7172 = lang_output_section_statement_lookup (".bss", 0,
7174 lang_add_section (&default_common_section
->children
, s
,
7175 NULL
, default_common_section
);
7179 ldlang_place_orphan (s
);
7186 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
7188 flagword
*ptr_flags
;
7190 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7196 /* PR 17900: An exclamation mark in the attributes reverses
7197 the sense of any of the attributes that follow. */
7200 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
7204 *ptr_flags
|= SEC_ALLOC
;
7208 *ptr_flags
|= SEC_READONLY
;
7212 *ptr_flags
|= SEC_DATA
;
7216 *ptr_flags
|= SEC_CODE
;
7221 *ptr_flags
|= SEC_LOAD
;
7225 einfo (_("%F%P: invalid character %c (%d) in flags\n"),
7233 /* Call a function on each real input file. This function will be
7234 called on an archive, but not on the elements. */
7237 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
7239 lang_input_statement_type
*f
;
7241 for (f
= (void *) input_file_chain
.head
;
7243 f
= f
->next_real_file
)
7248 /* Call a function on each real file. The function will be called on
7249 all the elements of an archive which are included in the link, but
7250 will not be called on the archive file itself. */
7253 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
7255 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7263 ldlang_add_file (lang_input_statement_type
*entry
)
7265 lang_statement_append (&file_chain
, entry
, &entry
->next
);
7267 /* The BFD linker needs to have a list of all input BFDs involved in
7269 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
7270 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
7272 *link_info
.input_bfds_tail
= entry
->the_bfd
;
7273 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
7274 bfd_set_usrdata (entry
->the_bfd
, entry
);
7275 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
7277 /* Look through the sections and check for any which should not be
7278 included in the link. We need to do this now, so that we can
7279 notice when the backend linker tries to report multiple
7280 definition errors for symbols which are in sections we aren't
7281 going to link. FIXME: It might be better to entirely ignore
7282 symbols which are defined in sections which are going to be
7283 discarded. This would require modifying the backend linker for
7284 each backend which might set the SEC_LINK_ONCE flag. If we do
7285 this, we should probably handle SEC_EXCLUDE in the same way. */
7287 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
7291 lang_add_output (const char *name
, int from_script
)
7293 /* Make -o on command line override OUTPUT in script. */
7294 if (!had_output_filename
|| !from_script
)
7296 output_filename
= name
;
7297 had_output_filename
= TRUE
;
7301 lang_output_section_statement_type
*
7302 lang_enter_output_section_statement (const char *output_section_statement_name
,
7303 etree_type
*address_exp
,
7304 enum section_type sectype
,
7306 etree_type
*subalign
,
7309 int align_with_input
)
7311 lang_output_section_statement_type
*os
;
7313 os
= lang_output_section_statement_lookup (output_section_statement_name
,
7315 current_section
= os
;
7317 if (os
->addr_tree
== NULL
)
7319 os
->addr_tree
= address_exp
;
7321 os
->sectype
= sectype
;
7322 if (sectype
!= noload_section
)
7323 os
->flags
= SEC_NO_FLAGS
;
7325 os
->flags
= SEC_NEVER_LOAD
;
7326 os
->block_value
= 1;
7328 /* Make next things chain into subchain of this. */
7329 push_stat_ptr (&os
->children
);
7331 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
7332 if (os
->align_lma_with_input
&& align
!= NULL
)
7333 einfo (_("%F%P:%pS: error: align with input and explicit align specified\n"),
7336 os
->subsection_alignment
= subalign
;
7337 os
->section_alignment
= align
;
7339 os
->load_base
= ebase
;
7346 lang_output_statement_type
*new_stmt
;
7348 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
7349 new_stmt
->name
= output_filename
;
7352 /* Reset the current counters in the regions. */
7355 lang_reset_memory_regions (void)
7357 lang_memory_region_type
*p
= lang_memory_region_list
;
7359 lang_output_section_statement_type
*os
;
7361 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
7363 p
->current
= p
->origin
;
7367 for (os
= (void *) lang_os_list
.head
;
7371 os
->processed_vma
= FALSE
;
7372 os
->processed_lma
= FALSE
;
7375 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
7377 /* Save the last size for possible use by bfd_relax_section. */
7378 o
->rawsize
= o
->size
;
7379 if (!(o
->flags
& SEC_FIXED_SIZE
))
7384 /* Worker for lang_gc_sections_1. */
7387 gc_section_callback (lang_wild_statement_type
*ptr
,
7388 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7390 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
7391 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7392 void *data ATTRIBUTE_UNUSED
)
7394 /* If the wild pattern was marked KEEP, the member sections
7395 should be as well. */
7396 if (ptr
->keep_sections
)
7397 section
->flags
|= SEC_KEEP
;
7400 /* Iterate over sections marking them against GC. */
7403 lang_gc_sections_1 (lang_statement_union_type
*s
)
7405 for (; s
!= NULL
; s
= s
->header
.next
)
7407 switch (s
->header
.type
)
7409 case lang_wild_statement_enum
:
7410 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
7412 case lang_constructors_statement_enum
:
7413 lang_gc_sections_1 (constructor_list
.head
);
7415 case lang_output_section_statement_enum
:
7416 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
7418 case lang_group_statement_enum
:
7419 lang_gc_sections_1 (s
->group_statement
.children
.head
);
7428 lang_gc_sections (void)
7430 /* Keep all sections so marked in the link script. */
7431 lang_gc_sections_1 (statement_list
.head
);
7433 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
7434 the special case of debug info. (See bfd/stabs.c)
7435 Twiddle the flag here, to simplify later linker code. */
7436 if (bfd_link_relocatable (&link_info
))
7438 LANG_FOR_EACH_INPUT_STATEMENT (f
)
7441 #ifdef ENABLE_PLUGINS
7442 if (f
->flags
.claimed
)
7445 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
7446 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
7447 sec
->flags
&= ~SEC_EXCLUDE
;
7451 if (link_info
.gc_sections
)
7452 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
7455 /* Worker for lang_find_relro_sections_1. */
7458 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
7459 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
7461 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
7462 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7465 /* Discarded, excluded and ignored sections effectively have zero
7467 if (section
->output_section
!= NULL
7468 && section
->output_section
->owner
== link_info
.output_bfd
7469 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
7470 && !IGNORE_SECTION (section
)
7471 && section
->size
!= 0)
7473 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
7474 *has_relro_section
= TRUE
;
7478 /* Iterate over sections for relro sections. */
7481 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
7482 seg_align_type
*seg
,
7483 bfd_boolean
*has_relro_section
)
7485 if (*has_relro_section
)
7488 for (; s
!= NULL
; s
= s
->header
.next
)
7490 if (s
== seg
->relro_end_stat
)
7493 switch (s
->header
.type
)
7495 case lang_wild_statement_enum
:
7496 walk_wild (&s
->wild_statement
,
7497 find_relro_section_callback
,
7500 case lang_constructors_statement_enum
:
7501 lang_find_relro_sections_1 (constructor_list
.head
,
7502 seg
, has_relro_section
);
7504 case lang_output_section_statement_enum
:
7505 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
7506 seg
, has_relro_section
);
7508 case lang_group_statement_enum
:
7509 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
7510 seg
, has_relro_section
);
7519 lang_find_relro_sections (void)
7521 bfd_boolean has_relro_section
= FALSE
;
7523 /* Check all sections in the link script. */
7525 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
7526 &expld
.dataseg
, &has_relro_section
);
7528 if (!has_relro_section
)
7529 link_info
.relro
= FALSE
;
7532 /* Relax all sections until bfd_relax_section gives up. */
7535 lang_relax_sections (bfd_boolean need_layout
)
7537 if (RELAXATION_ENABLED
)
7539 /* We may need more than one relaxation pass. */
7540 int i
= link_info
.relax_pass
;
7542 /* The backend can use it to determine the current pass. */
7543 link_info
.relax_pass
= 0;
7547 /* Keep relaxing until bfd_relax_section gives up. */
7548 bfd_boolean relax_again
;
7550 link_info
.relax_trip
= -1;
7553 link_info
.relax_trip
++;
7555 /* Note: pe-dll.c does something like this also. If you find
7556 you need to change this code, you probably need to change
7557 pe-dll.c also. DJ */
7559 /* Do all the assignments with our current guesses as to
7561 lang_do_assignments (lang_assigning_phase_enum
);
7563 /* We must do this after lang_do_assignments, because it uses
7565 lang_reset_memory_regions ();
7567 /* Perform another relax pass - this time we know where the
7568 globals are, so can make a better guess. */
7569 relax_again
= FALSE
;
7570 lang_size_sections (&relax_again
, FALSE
);
7572 while (relax_again
);
7574 link_info
.relax_pass
++;
7581 /* Final extra sizing to report errors. */
7582 lang_do_assignments (lang_assigning_phase_enum
);
7583 lang_reset_memory_regions ();
7584 lang_size_sections (NULL
, TRUE
);
7588 #ifdef ENABLE_PLUGINS
7589 /* Find the insert point for the plugin's replacement files. We
7590 place them after the first claimed real object file, or if the
7591 first claimed object is an archive member, after the last real
7592 object file immediately preceding the archive. In the event
7593 no objects have been claimed at all, we return the first dummy
7594 object file on the list as the insert point; that works, but
7595 the callee must be careful when relinking the file_chain as it
7596 is not actually on that chain, only the statement_list and the
7597 input_file list; in that case, the replacement files must be
7598 inserted at the head of the file_chain. */
7600 static lang_input_statement_type
*
7601 find_replacements_insert_point (bfd_boolean
*before
)
7603 lang_input_statement_type
*claim1
, *lastobject
;
7604 lastobject
= (void *) input_file_chain
.head
;
7605 for (claim1
= (void *) file_chain
.head
;
7607 claim1
= claim1
->next
)
7609 if (claim1
->flags
.claimed
)
7611 *before
= claim1
->flags
.claim_archive
;
7612 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
7614 /* Update lastobject if this is a real object file. */
7615 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
7616 lastobject
= claim1
;
7618 /* No files were claimed by the plugin. Choose the last object
7619 file found on the list (maybe the first, dummy entry) as the
7625 /* Find where to insert ADD, an archive element or shared library
7626 added during a rescan. */
7628 static lang_input_statement_type
**
7629 find_rescan_insertion (lang_input_statement_type
*add
)
7631 bfd
*add_bfd
= add
->the_bfd
;
7632 lang_input_statement_type
*f
;
7633 lang_input_statement_type
*last_loaded
= NULL
;
7634 lang_input_statement_type
*before
= NULL
;
7635 lang_input_statement_type
**iter
= NULL
;
7637 if (add_bfd
->my_archive
!= NULL
)
7638 add_bfd
= add_bfd
->my_archive
;
7640 /* First look through the input file chain, to find an object file
7641 before the one we've rescanned. Normal object files always
7642 appear on both the input file chain and the file chain, so this
7643 lets us get quickly to somewhere near the correct place on the
7644 file chain if it is full of archive elements. Archives don't
7645 appear on the file chain, but if an element has been extracted
7646 then their input_statement->next points at it. */
7647 for (f
= (void *) input_file_chain
.head
;
7649 f
= f
->next_real_file
)
7651 if (f
->the_bfd
== add_bfd
)
7653 before
= last_loaded
;
7654 if (f
->next
!= NULL
)
7655 return &f
->next
->next
;
7657 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7661 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7663 iter
= &(*iter
)->next
)
7664 if (!(*iter
)->flags
.claim_archive
7665 && (*iter
)->the_bfd
->my_archive
== NULL
)
7671 /* Insert SRCLIST into DESTLIST after given element by chaining
7672 on FIELD as the next-pointer. (Counterintuitively does not need
7673 a pointer to the actual after-node itself, just its chain field.) */
7676 lang_list_insert_after (lang_statement_list_type
*destlist
,
7677 lang_statement_list_type
*srclist
,
7678 lang_statement_union_type
**field
)
7680 *(srclist
->tail
) = *field
;
7681 *field
= srclist
->head
;
7682 if (destlist
->tail
== field
)
7683 destlist
->tail
= srclist
->tail
;
7686 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7687 was taken as a copy of it and leave them in ORIGLIST. */
7690 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7691 lang_statement_list_type
*origlist
)
7693 union lang_statement_union
**savetail
;
7694 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7695 ASSERT (origlist
->head
== destlist
->head
);
7696 savetail
= origlist
->tail
;
7697 origlist
->head
= *(savetail
);
7698 origlist
->tail
= destlist
->tail
;
7699 destlist
->tail
= savetail
;
7703 static lang_statement_union_type
**
7704 find_next_input_statement (lang_statement_union_type
**s
)
7706 for ( ; *s
; s
= &(*s
)->header
.next
)
7708 lang_statement_union_type
**t
;
7709 switch ((*s
)->header
.type
)
7711 case lang_input_statement_enum
:
7713 case lang_wild_statement_enum
:
7714 t
= &(*s
)->wild_statement
.children
.head
;
7716 case lang_group_statement_enum
:
7717 t
= &(*s
)->group_statement
.children
.head
;
7719 case lang_output_section_statement_enum
:
7720 t
= &(*s
)->output_section_statement
.children
.head
;
7725 t
= find_next_input_statement (t
);
7731 #endif /* ENABLE_PLUGINS */
7733 /* Add NAME to the list of garbage collection entry points. */
7736 lang_add_gc_name (const char *name
)
7738 struct bfd_sym_chain
*sym
;
7743 sym
= stat_alloc (sizeof (*sym
));
7745 sym
->next
= link_info
.gc_sym_list
;
7747 link_info
.gc_sym_list
= sym
;
7750 /* Check relocations. */
7753 lang_check_relocs (void)
7755 if (link_info
.check_relocs_after_open_input
)
7759 for (abfd
= link_info
.input_bfds
;
7760 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7761 if (!bfd_link_check_relocs (abfd
, &link_info
))
7763 /* No object output, fail return. */
7764 config
.make_executable
= FALSE
;
7765 /* Note: we do not abort the loop, but rather
7766 continue the scan in case there are other
7767 bad relocations to report. */
7772 /* Look through all output sections looking for places where we can
7773 propagate forward the lma region. */
7776 lang_propagate_lma_regions (void)
7778 lang_output_section_statement_type
*os
;
7780 for (os
= (void *) lang_os_list
.head
;
7784 if (os
->prev
!= NULL
7785 && os
->lma_region
== NULL
7786 && os
->load_base
== NULL
7787 && os
->addr_tree
== NULL
7788 && os
->region
== os
->prev
->region
)
7789 os
->lma_region
= os
->prev
->lma_region
;
7796 /* Finalize dynamic list. */
7797 if (link_info
.dynamic_list
)
7798 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
7800 current_target
= default_target
;
7802 /* Open the output file. */
7803 lang_for_each_statement (ldlang_open_output
);
7806 ldemul_create_output_section_statements ();
7808 /* Add to the hash table all undefineds on the command line. */
7809 lang_place_undefineds ();
7811 if (!bfd_section_already_linked_table_init ())
7812 einfo (_("%F%P: can not create hash table: %E\n"));
7814 /* Create a bfd for each input file. */
7815 current_target
= default_target
;
7816 lang_statement_iteration
++;
7817 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
7818 /* open_input_bfds also handles assignments, so we can give values
7819 to symbolic origin/length now. */
7820 lang_do_memory_regions ();
7822 #ifdef ENABLE_PLUGINS
7823 if (link_info
.lto_plugin_active
)
7825 lang_statement_list_type added
;
7826 lang_statement_list_type files
, inputfiles
;
7828 /* Now all files are read, let the plugin(s) decide if there
7829 are any more to be added to the link before we call the
7830 emulation's after_open hook. We create a private list of
7831 input statements for this purpose, which we will eventually
7832 insert into the global statement list after the first claimed
7835 /* We need to manipulate all three chains in synchrony. */
7837 inputfiles
= input_file_chain
;
7838 if (plugin_call_all_symbols_read ())
7839 einfo (_("%F%P: %s: plugin reported error after all symbols read\n"),
7840 plugin_error_plugin ());
7841 /* Open any newly added files, updating the file chains. */
7842 plugin_undefs
= link_info
.hash
->undefs_tail
;
7843 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
7844 if (plugin_undefs
== link_info
.hash
->undefs_tail
)
7845 plugin_undefs
= NULL
;
7846 /* Restore the global list pointer now they have all been added. */
7847 lang_list_remove_tail (stat_ptr
, &added
);
7848 /* And detach the fresh ends of the file lists. */
7849 lang_list_remove_tail (&file_chain
, &files
);
7850 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
7851 /* Were any new files added? */
7852 if (added
.head
!= NULL
)
7854 /* If so, we will insert them into the statement list immediately
7855 after the first input file that was claimed by the plugin,
7856 unless that file was an archive in which case it is inserted
7857 immediately before. */
7859 lang_statement_union_type
**prev
;
7860 plugin_insert
= find_replacements_insert_point (&before
);
7861 /* If a plugin adds input files without having claimed any, we
7862 don't really have a good idea where to place them. Just putting
7863 them at the start or end of the list is liable to leave them
7864 outside the crtbegin...crtend range. */
7865 ASSERT (plugin_insert
!= NULL
);
7866 /* Splice the new statement list into the old one. */
7867 prev
= &plugin_insert
->header
.next
;
7870 prev
= find_next_input_statement (prev
);
7871 if (*prev
!= (void *) plugin_insert
->next_real_file
)
7873 /* We didn't find the expected input statement.
7874 Fall back to adding after plugin_insert. */
7875 prev
= &plugin_insert
->header
.next
;
7878 lang_list_insert_after (stat_ptr
, &added
, prev
);
7879 /* Likewise for the file chains. */
7880 lang_list_insert_after (&input_file_chain
, &inputfiles
,
7881 (void *) &plugin_insert
->next_real_file
);
7882 /* We must be careful when relinking file_chain; we may need to
7883 insert the new files at the head of the list if the insert
7884 point chosen is the dummy first input file. */
7885 if (plugin_insert
->filename
)
7886 lang_list_insert_after (&file_chain
, &files
,
7887 (void *) &plugin_insert
->next
);
7889 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
7891 /* Rescan archives in case new undefined symbols have appeared. */
7893 lang_statement_iteration
++;
7894 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
7895 lang_list_remove_tail (&file_chain
, &files
);
7896 while (files
.head
!= NULL
)
7898 lang_input_statement_type
**insert
;
7899 lang_input_statement_type
**iter
, *temp
;
7902 insert
= find_rescan_insertion (&files
.head
->input_statement
);
7903 /* All elements from an archive can be added at once. */
7904 iter
= &files
.head
->input_statement
.next
;
7905 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
7906 if (my_arch
!= NULL
)
7907 for (; *iter
!= NULL
; iter
= &(*iter
)->next
)
7908 if ((*iter
)->the_bfd
->my_archive
!= my_arch
)
7911 *insert
= &files
.head
->input_statement
;
7912 files
.head
= (lang_statement_union_type
*) *iter
;
7914 if (my_arch
!= NULL
)
7916 lang_input_statement_type
*parent
= bfd_usrdata (my_arch
);
7918 parent
->next
= (lang_input_statement_type
*)
7920 - offsetof (lang_input_statement_type
, next
));
7925 #endif /* ENABLE_PLUGINS */
7927 /* Make sure that nobody has tried to add a symbol to this list
7929 ASSERT (link_info
.gc_sym_list
== NULL
);
7931 link_info
.gc_sym_list
= &entry_symbol
;
7933 if (entry_symbol
.name
== NULL
)
7935 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
7937 /* entry_symbol is normally initialied by a ENTRY definition in the
7938 linker script or the -e command line option. But if neither of
7939 these have been used, the target specific backend may still have
7940 provided an entry symbol via a call to lang_default_entry().
7941 Unfortunately this value will not be processed until lang_end()
7942 is called, long after this function has finished. So detect this
7943 case here and add the target's entry symbol to the list of starting
7944 points for garbage collection resolution. */
7945 lang_add_gc_name (entry_symbol_default
);
7948 lang_add_gc_name (link_info
.init_function
);
7949 lang_add_gc_name (link_info
.fini_function
);
7951 ldemul_after_open ();
7952 if (config
.map_file
!= NULL
)
7953 lang_print_asneeded ();
7957 bfd_section_already_linked_table_free ();
7959 /* Make sure that we're not mixing architectures. We call this
7960 after all the input files have been opened, but before we do any
7961 other processing, so that any operations merge_private_bfd_data
7962 does on the output file will be known during the rest of the
7966 /* Handle .exports instead of a version script if we're told to do so. */
7967 if (command_line
.version_exports_section
)
7968 lang_do_version_exports_section ();
7970 /* Build all sets based on the information gathered from the input
7972 ldctor_build_sets ();
7974 /* Give initial values for __start and __stop symbols, so that ELF
7975 gc_sections will keep sections referenced by these symbols. Must
7976 be done before lang_do_assignments below. */
7977 if (config
.build_constructors
)
7978 lang_init_start_stop ();
7980 /* PR 13683: We must rerun the assignments prior to running garbage
7981 collection in order to make sure that all symbol aliases are resolved. */
7982 lang_do_assignments (lang_mark_phase_enum
);
7983 expld
.phase
= lang_first_phase_enum
;
7985 /* Size up the common data. */
7988 /* Remove unreferenced sections if asked to. */
7989 lang_gc_sections ();
7991 /* Check relocations. */
7992 lang_check_relocs ();
7994 ldemul_after_check_relocs ();
7996 /* Update wild statements. */
7997 update_wild_statements (statement_list
.head
);
7999 /* Run through the contours of the script and attach input sections
8000 to the correct output sections. */
8001 lang_statement_iteration
++;
8002 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
8004 /* Start at the statement immediately after the special abs_section
8005 output statement, so that it isn't reordered. */
8006 process_insert_statements (&lang_os_list
.head
->header
.next
);
8008 ldemul_before_place_orphans ();
8010 /* Find any sections not attached explicitly and handle them. */
8011 lang_place_orphans ();
8013 if (!bfd_link_relocatable (&link_info
))
8017 /* Merge SEC_MERGE sections. This has to be done after GC of
8018 sections, so that GCed sections are not merged, but before
8019 assigning dynamic symbols, since removing whole input sections
8021 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
8023 /* Look for a text section and set the readonly attribute in it. */
8024 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
8028 if (config
.text_read_only
)
8029 found
->flags
|= SEC_READONLY
;
8031 found
->flags
&= ~SEC_READONLY
;
8035 /* Merge together CTF sections. After this, only the symtab-dependent
8036 function and data object sections need adjustment. */
8039 /* Emit the CTF, iff the emulation doesn't need to do late emission after
8040 examining things laid out late, like the strtab. */
8043 /* Copy forward lma regions for output sections in same lma region. */
8044 lang_propagate_lma_regions ();
8046 /* Defining __start/__stop symbols early for --gc-sections to work
8047 around a glibc build problem can result in these symbols being
8048 defined when they should not be. Fix them now. */
8049 if (config
.build_constructors
)
8050 lang_undef_start_stop ();
8052 /* Define .startof./.sizeof. symbols with preliminary values before
8053 dynamic symbols are created. */
8054 if (!bfd_link_relocatable (&link_info
))
8055 lang_init_startof_sizeof ();
8057 /* Do anything special before sizing sections. This is where ELF
8058 and other back-ends size dynamic sections. */
8059 ldemul_before_allocation ();
8061 /* We must record the program headers before we try to fix the
8062 section positions, since they will affect SIZEOF_HEADERS. */
8063 lang_record_phdrs ();
8065 /* Check relro sections. */
8066 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
8067 lang_find_relro_sections ();
8069 /* Size up the sections. */
8070 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
8072 /* See if anything special should be done now we know how big
8073 everything is. This is where relaxation is done. */
8074 ldemul_after_allocation ();
8076 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
8077 lang_finalize_start_stop ();
8079 /* Do all the assignments again, to report errors. Assignment
8080 statements are processed multiple times, updating symbols; In
8081 open_input_bfds, lang_do_assignments, and lang_size_sections.
8082 Since lang_relax_sections calls lang_do_assignments, symbols are
8083 also updated in ldemul_after_allocation. */
8084 lang_do_assignments (lang_final_phase_enum
);
8088 /* Convert absolute symbols to section relative. */
8089 ldexp_finalize_syms ();
8091 /* Make sure that the section addresses make sense. */
8092 if (command_line
.check_section_addresses
)
8093 lang_check_section_addresses ();
8095 /* Check any required symbols are known. */
8096 ldlang_check_require_defined_symbols ();
8101 /* EXPORTED TO YACC */
8104 lang_add_wild (struct wildcard_spec
*filespec
,
8105 struct wildcard_list
*section_list
,
8106 bfd_boolean keep_sections
)
8108 struct wildcard_list
*curr
, *next
;
8109 lang_wild_statement_type
*new_stmt
;
8111 /* Reverse the list as the parser puts it back to front. */
8112 for (curr
= section_list
, section_list
= NULL
;
8114 section_list
= curr
, curr
= next
)
8117 curr
->next
= section_list
;
8120 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
8122 if (strcmp (filespec
->name
, "*") == 0)
8123 filespec
->name
= NULL
;
8124 else if (!wildcardp (filespec
->name
))
8125 lang_has_input_file
= TRUE
;
8128 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
8129 new_stmt
->filename
= NULL
;
8130 new_stmt
->filenames_sorted
= FALSE
;
8131 new_stmt
->section_flag_list
= NULL
;
8132 new_stmt
->exclude_name_list
= NULL
;
8133 if (filespec
!= NULL
)
8135 new_stmt
->filename
= filespec
->name
;
8136 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
8137 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
8138 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
8140 new_stmt
->section_list
= section_list
;
8141 new_stmt
->keep_sections
= keep_sections
;
8142 lang_list_init (&new_stmt
->children
);
8143 analyze_walk_wild_section_handler (new_stmt
);
8147 lang_section_start (const char *name
, etree_type
*address
,
8148 const segment_type
*segment
)
8150 lang_address_statement_type
*ad
;
8152 ad
= new_stat (lang_address_statement
, stat_ptr
);
8153 ad
->section_name
= name
;
8154 ad
->address
= address
;
8155 ad
->segment
= segment
;
8158 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
8159 because of a -e argument on the command line, or zero if this is
8160 called by ENTRY in a linker script. Command line arguments take
8164 lang_add_entry (const char *name
, bfd_boolean cmdline
)
8166 if (entry_symbol
.name
== NULL
8168 || !entry_from_cmdline
)
8170 entry_symbol
.name
= name
;
8171 entry_from_cmdline
= cmdline
;
8175 /* Set the default start symbol to NAME. .em files should use this,
8176 not lang_add_entry, to override the use of "start" if neither the
8177 linker script nor the command line specifies an entry point. NAME
8178 must be permanently allocated. */
8180 lang_default_entry (const char *name
)
8182 entry_symbol_default
= name
;
8186 lang_add_target (const char *name
)
8188 lang_target_statement_type
*new_stmt
;
8190 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
8191 new_stmt
->target
= name
;
8195 lang_add_map (const char *name
)
8202 map_option_f
= TRUE
;
8210 lang_add_fill (fill_type
*fill
)
8212 lang_fill_statement_type
*new_stmt
;
8214 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
8215 new_stmt
->fill
= fill
;
8219 lang_add_data (int type
, union etree_union
*exp
)
8221 lang_data_statement_type
*new_stmt
;
8223 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
8224 new_stmt
->exp
= exp
;
8225 new_stmt
->type
= type
;
8228 /* Create a new reloc statement. RELOC is the BFD relocation type to
8229 generate. HOWTO is the corresponding howto structure (we could
8230 look this up, but the caller has already done so). SECTION is the
8231 section to generate a reloc against, or NAME is the name of the
8232 symbol to generate a reloc against. Exactly one of SECTION and
8233 NAME must be NULL. ADDEND is an expression for the addend. */
8236 lang_add_reloc (bfd_reloc_code_real_type reloc
,
8237 reloc_howto_type
*howto
,
8240 union etree_union
*addend
)
8242 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
8246 p
->section
= section
;
8248 p
->addend_exp
= addend
;
8250 p
->addend_value
= 0;
8251 p
->output_section
= NULL
;
8252 p
->output_offset
= 0;
8255 lang_assignment_statement_type
*
8256 lang_add_assignment (etree_type
*exp
)
8258 lang_assignment_statement_type
*new_stmt
;
8260 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
8261 new_stmt
->exp
= exp
;
8266 lang_add_attribute (enum statement_enum attribute
)
8268 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
8272 lang_startup (const char *name
)
8274 if (first_file
->filename
!= NULL
)
8276 einfo (_("%F%P: multiple STARTUP files\n"));
8278 first_file
->filename
= name
;
8279 first_file
->local_sym_name
= name
;
8280 first_file
->flags
.real
= TRUE
;
8284 lang_float (bfd_boolean maybe
)
8286 lang_float_flag
= maybe
;
8290 /* Work out the load- and run-time regions from a script statement, and
8291 store them in *LMA_REGION and *REGION respectively.
8293 MEMSPEC is the name of the run-time region, or the value of
8294 DEFAULT_MEMORY_REGION if the statement didn't specify one.
8295 LMA_MEMSPEC is the name of the load-time region, or null if the
8296 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
8297 had an explicit load address.
8299 It is an error to specify both a load region and a load address. */
8302 lang_get_regions (lang_memory_region_type
**region
,
8303 lang_memory_region_type
**lma_region
,
8304 const char *memspec
,
8305 const char *lma_memspec
,
8306 bfd_boolean have_lma
,
8307 bfd_boolean have_vma
)
8309 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
8311 /* If no runtime region or VMA has been specified, but the load region
8312 has been specified, then use the load region for the runtime region
8314 if (lma_memspec
!= NULL
8316 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
8317 *region
= *lma_region
;
8319 *region
= lang_memory_region_lookup (memspec
, FALSE
);
8321 if (have_lma
&& lma_memspec
!= 0)
8322 einfo (_("%X%P:%pS: section has both a load address and a load region\n"),
8327 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
8328 lang_output_section_phdr_list
*phdrs
,
8329 const char *lma_memspec
)
8331 lang_get_regions (¤t_section
->region
,
8332 ¤t_section
->lma_region
,
8333 memspec
, lma_memspec
,
8334 current_section
->load_base
!= NULL
,
8335 current_section
->addr_tree
!= NULL
);
8337 current_section
->fill
= fill
;
8338 current_section
->phdrs
= phdrs
;
8342 /* Set the output format type. -oformat overrides scripts. */
8345 lang_add_output_format (const char *format
,
8350 if (output_target
== NULL
|| !from_script
)
8352 if (command_line
.endian
== ENDIAN_BIG
8355 else if (command_line
.endian
== ENDIAN_LITTLE
8359 output_target
= format
;
8364 lang_add_insert (const char *where
, int is_before
)
8366 lang_insert_statement_type
*new_stmt
;
8368 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
8369 new_stmt
->where
= where
;
8370 new_stmt
->is_before
= is_before
;
8371 saved_script_handle
= previous_script_handle
;
8374 /* Enter a group. This creates a new lang_group_statement, and sets
8375 stat_ptr to build new statements within the group. */
8378 lang_enter_group (void)
8380 lang_group_statement_type
*g
;
8382 g
= new_stat (lang_group_statement
, stat_ptr
);
8383 lang_list_init (&g
->children
);
8384 push_stat_ptr (&g
->children
);
8387 /* Leave a group. This just resets stat_ptr to start writing to the
8388 regular list of statements again. Note that this will not work if
8389 groups can occur inside anything else which can adjust stat_ptr,
8390 but currently they can't. */
8393 lang_leave_group (void)
8398 /* Add a new program header. This is called for each entry in a PHDRS
8399 command in a linker script. */
8402 lang_new_phdr (const char *name
,
8404 bfd_boolean filehdr
,
8409 struct lang_phdr
*n
, **pp
;
8412 n
= stat_alloc (sizeof (struct lang_phdr
));
8415 n
->type
= exp_get_vma (type
, 0, "program header type");
8416 n
->filehdr
= filehdr
;
8421 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
8423 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8426 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
8428 einfo (_("%X%P:%pS: PHDRS and FILEHDR are not supported"
8429 " when prior PT_LOAD headers lack them\n"), NULL
);
8436 /* Record the program header information in the output BFD. FIXME: We
8437 should not be calling an ELF specific function here. */
8440 lang_record_phdrs (void)
8444 lang_output_section_phdr_list
*last
;
8445 struct lang_phdr
*l
;
8446 lang_output_section_statement_type
*os
;
8449 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
8452 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
8459 for (os
= (void *) lang_os_list
.head
;
8463 lang_output_section_phdr_list
*pl
;
8465 if (os
->constraint
< 0)
8473 if (os
->sectype
== noload_section
8474 || os
->bfd_section
== NULL
8475 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
8478 /* Don't add orphans to PT_INTERP header. */
8484 lang_output_section_statement_type
*tmp_os
;
8486 /* If we have not run across a section with a program
8487 header assigned to it yet, then scan forwards to find
8488 one. This prevents inconsistencies in the linker's
8489 behaviour when a script has specified just a single
8490 header and there are sections in that script which are
8491 not assigned to it, and which occur before the first
8492 use of that header. See here for more details:
8493 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
8494 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
8497 last
= tmp_os
->phdrs
;
8501 einfo (_("%F%P: no sections assigned to phdrs\n"));
8506 if (os
->bfd_section
== NULL
)
8509 for (; pl
!= NULL
; pl
= pl
->next
)
8511 if (strcmp (pl
->name
, l
->name
) == 0)
8516 secs
= (asection
**) xrealloc (secs
,
8517 alc
* sizeof (asection
*));
8519 secs
[c
] = os
->bfd_section
;
8526 if (l
->flags
== NULL
)
8529 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
8534 at
= exp_get_vma (l
->at
, 0, "phdr load address");
8536 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
8537 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
8538 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
8539 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
8544 /* Make sure all the phdr assignments succeeded. */
8545 for (os
= (void *) lang_os_list
.head
;
8549 lang_output_section_phdr_list
*pl
;
8551 if (os
->constraint
< 0
8552 || os
->bfd_section
== NULL
)
8555 for (pl
= os
->phdrs
;
8558 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
8559 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
8560 os
->name
, pl
->name
);
8564 /* Record a list of sections which may not be cross referenced. */
8567 lang_add_nocrossref (lang_nocrossref_type
*l
)
8569 struct lang_nocrossrefs
*n
;
8571 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
8572 n
->next
= nocrossref_list
;
8574 n
->onlyfirst
= FALSE
;
8575 nocrossref_list
= n
;
8577 /* Set notice_all so that we get informed about all symbols. */
8578 link_info
.notice_all
= TRUE
;
8581 /* Record a section that cannot be referenced from a list of sections. */
8584 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
8586 lang_add_nocrossref (l
);
8587 nocrossref_list
->onlyfirst
= TRUE
;
8590 /* Overlay handling. We handle overlays with some static variables. */
8592 /* The overlay virtual address. */
8593 static etree_type
*overlay_vma
;
8594 /* And subsection alignment. */
8595 static etree_type
*overlay_subalign
;
8597 /* An expression for the maximum section size seen so far. */
8598 static etree_type
*overlay_max
;
8600 /* A list of all the sections in this overlay. */
8602 struct overlay_list
{
8603 struct overlay_list
*next
;
8604 lang_output_section_statement_type
*os
;
8607 static struct overlay_list
*overlay_list
;
8609 /* Start handling an overlay. */
8612 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
8614 /* The grammar should prevent nested overlays from occurring. */
8615 ASSERT (overlay_vma
== NULL
8616 && overlay_subalign
== NULL
8617 && overlay_max
== NULL
);
8619 overlay_vma
= vma_expr
;
8620 overlay_subalign
= subalign
;
8623 /* Start a section in an overlay. We handle this by calling
8624 lang_enter_output_section_statement with the correct VMA.
8625 lang_leave_overlay sets up the LMA and memory regions. */
8628 lang_enter_overlay_section (const char *name
)
8630 struct overlay_list
*n
;
8633 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
8634 0, overlay_subalign
, 0, 0, 0);
8636 /* If this is the first section, then base the VMA of future
8637 sections on this one. This will work correctly even if `.' is
8638 used in the addresses. */
8639 if (overlay_list
== NULL
)
8640 overlay_vma
= exp_nameop (ADDR
, name
);
8642 /* Remember the section. */
8643 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
8644 n
->os
= current_section
;
8645 n
->next
= overlay_list
;
8648 size
= exp_nameop (SIZEOF
, name
);
8650 /* Arrange to work out the maximum section end address. */
8651 if (overlay_max
== NULL
)
8654 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
8657 /* Finish a section in an overlay. There isn't any special to do
8661 lang_leave_overlay_section (fill_type
*fill
,
8662 lang_output_section_phdr_list
*phdrs
)
8669 name
= current_section
->name
;
8671 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
8672 region and that no load-time region has been specified. It doesn't
8673 really matter what we say here, since lang_leave_overlay will
8675 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
8677 /* Define the magic symbols. */
8679 clean
= (char *) xmalloc (strlen (name
) + 1);
8681 for (s1
= name
; *s1
!= '\0'; s1
++)
8682 if (ISALNUM (*s1
) || *s1
== '_')
8686 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8687 sprintf (buf
, "__load_start_%s", clean
);
8688 lang_add_assignment (exp_provide (buf
,
8689 exp_nameop (LOADADDR
, name
),
8692 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8693 sprintf (buf
, "__load_stop_%s", clean
);
8694 lang_add_assignment (exp_provide (buf
,
8696 exp_nameop (LOADADDR
, name
),
8697 exp_nameop (SIZEOF
, name
)),
8703 /* Finish an overlay. If there are any overlay wide settings, this
8704 looks through all the sections in the overlay and sets them. */
8707 lang_leave_overlay (etree_type
*lma_expr
,
8710 const char *memspec
,
8711 lang_output_section_phdr_list
*phdrs
,
8712 const char *lma_memspec
)
8714 lang_memory_region_type
*region
;
8715 lang_memory_region_type
*lma_region
;
8716 struct overlay_list
*l
;
8717 lang_nocrossref_type
*nocrossref
;
8719 lang_get_regions (®ion
, &lma_region
,
8720 memspec
, lma_memspec
,
8721 lma_expr
!= NULL
, FALSE
);
8725 /* After setting the size of the last section, set '.' to end of the
8727 if (overlay_list
!= NULL
)
8729 overlay_list
->os
->update_dot
= 1;
8730 overlay_list
->os
->update_dot_tree
8731 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
8737 struct overlay_list
*next
;
8739 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8742 l
->os
->region
= region
;
8743 l
->os
->lma_region
= lma_region
;
8745 /* The first section has the load address specified in the
8746 OVERLAY statement. The rest are worked out from that.
8747 The base address is not needed (and should be null) if
8748 an LMA region was specified. */
8751 l
->os
->load_base
= lma_expr
;
8752 l
->os
->sectype
= first_overlay_section
;
8754 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
8755 l
->os
->phdrs
= phdrs
;
8759 lang_nocrossref_type
*nc
;
8761 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
8762 nc
->name
= l
->os
->name
;
8763 nc
->next
= nocrossref
;
8772 if (nocrossref
!= NULL
)
8773 lang_add_nocrossref (nocrossref
);
8776 overlay_list
= NULL
;
8778 overlay_subalign
= NULL
;
8781 /* Version handling. This is only useful for ELF. */
8783 /* If PREV is NULL, return first version pattern matching particular symbol.
8784 If PREV is non-NULL, return first version pattern matching particular
8785 symbol after PREV (previously returned by lang_vers_match). */
8787 static struct bfd_elf_version_expr
*
8788 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
8789 struct bfd_elf_version_expr
*prev
,
8793 const char *cxx_sym
= sym
;
8794 const char *java_sym
= sym
;
8795 struct bfd_elf_version_expr
*expr
= NULL
;
8796 enum demangling_styles curr_style
;
8798 curr_style
= CURRENT_DEMANGLING_STYLE
;
8799 cplus_demangle_set_style (no_demangling
);
8800 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
8803 cplus_demangle_set_style (curr_style
);
8805 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8807 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
8808 DMGL_PARAMS
| DMGL_ANSI
);
8812 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8814 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
8819 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
8821 struct bfd_elf_version_expr e
;
8823 switch (prev
? prev
->mask
: 0)
8826 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
8829 expr
= (struct bfd_elf_version_expr
*)
8830 htab_find ((htab_t
) head
->htab
, &e
);
8831 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
8832 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
8838 case BFD_ELF_VERSION_C_TYPE
:
8839 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8841 e
.pattern
= cxx_sym
;
8842 expr
= (struct bfd_elf_version_expr
*)
8843 htab_find ((htab_t
) head
->htab
, &e
);
8844 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
8845 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8851 case BFD_ELF_VERSION_CXX_TYPE
:
8852 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8854 e
.pattern
= java_sym
;
8855 expr
= (struct bfd_elf_version_expr
*)
8856 htab_find ((htab_t
) head
->htab
, &e
);
8857 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
8858 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8869 /* Finally, try the wildcards. */
8870 if (prev
== NULL
|| prev
->literal
)
8871 expr
= head
->remaining
;
8874 for (; expr
; expr
= expr
->next
)
8881 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
8884 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8886 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8890 if (fnmatch (expr
->pattern
, s
, 0) == 0)
8896 free ((char *) c_sym
);
8898 free ((char *) cxx_sym
);
8899 if (java_sym
!= sym
)
8900 free ((char *) java_sym
);
8904 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
8905 return a pointer to the symbol name with any backslash quotes removed. */
8908 realsymbol (const char *pattern
)
8911 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
8912 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
8914 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
8916 /* It is a glob pattern only if there is no preceding
8920 /* Remove the preceding backslash. */
8927 if (*p
== '?' || *p
== '*' || *p
== '[')
8934 backslash
= *p
== '\\';
8950 /* This is called for each variable name or match expression. NEW_NAME is
8951 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
8952 pattern to be matched against symbol names. */
8954 struct bfd_elf_version_expr
*
8955 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
8956 const char *new_name
,
8958 bfd_boolean literal_p
)
8960 struct bfd_elf_version_expr
*ret
;
8962 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
8966 ret
->literal
= TRUE
;
8967 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
8968 if (ret
->pattern
== NULL
)
8970 ret
->pattern
= new_name
;
8971 ret
->literal
= FALSE
;
8974 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
8975 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8976 else if (strcasecmp (lang
, "C++") == 0)
8977 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
8978 else if (strcasecmp (lang
, "Java") == 0)
8979 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
8982 einfo (_("%X%P: unknown language `%s' in version information\n"),
8984 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8987 return ldemul_new_vers_pattern (ret
);
8990 /* This is called for each set of variable names and match
8993 struct bfd_elf_version_tree
*
8994 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
8995 struct bfd_elf_version_expr
*locals
)
8997 struct bfd_elf_version_tree
*ret
;
8999 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
9000 ret
->globals
.list
= globals
;
9001 ret
->locals
.list
= locals
;
9002 ret
->match
= lang_vers_match
;
9003 ret
->name_indx
= (unsigned int) -1;
9007 /* This static variable keeps track of version indices. */
9009 static int version_index
;
9012 version_expr_head_hash (const void *p
)
9014 const struct bfd_elf_version_expr
*e
=
9015 (const struct bfd_elf_version_expr
*) p
;
9017 return htab_hash_string (e
->pattern
);
9021 version_expr_head_eq (const void *p1
, const void *p2
)
9023 const struct bfd_elf_version_expr
*e1
=
9024 (const struct bfd_elf_version_expr
*) p1
;
9025 const struct bfd_elf_version_expr
*e2
=
9026 (const struct bfd_elf_version_expr
*) p2
;
9028 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
9032 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
9035 struct bfd_elf_version_expr
*e
, *next
;
9036 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
9038 for (e
= head
->list
; e
; e
= e
->next
)
9042 head
->mask
|= e
->mask
;
9047 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
9048 version_expr_head_eq
, NULL
);
9049 list_loc
= &head
->list
;
9050 remaining_loc
= &head
->remaining
;
9051 for (e
= head
->list
; e
; e
= next
)
9057 remaining_loc
= &e
->next
;
9061 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
9065 struct bfd_elf_version_expr
*e1
, *last
;
9067 e1
= (struct bfd_elf_version_expr
*) *loc
;
9071 if (e1
->mask
== e
->mask
)
9079 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
9083 /* This is a duplicate. */
9084 /* FIXME: Memory leak. Sometimes pattern is not
9085 xmalloced alone, but in larger chunk of memory. */
9086 /* free (e->pattern); */
9091 e
->next
= last
->next
;
9099 list_loc
= &e
->next
;
9103 *remaining_loc
= NULL
;
9104 *list_loc
= head
->remaining
;
9107 head
->remaining
= head
->list
;
9110 /* This is called when we know the name and dependencies of the
9114 lang_register_vers_node (const char *name
,
9115 struct bfd_elf_version_tree
*version
,
9116 struct bfd_elf_version_deps
*deps
)
9118 struct bfd_elf_version_tree
*t
, **pp
;
9119 struct bfd_elf_version_expr
*e1
;
9124 if (link_info
.version_info
!= NULL
9125 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
9127 einfo (_("%X%P: anonymous version tag cannot be combined"
9128 " with other version tags\n"));
9133 /* Make sure this node has a unique name. */
9134 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9135 if (strcmp (t
->name
, name
) == 0)
9136 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
9138 lang_finalize_version_expr_head (&version
->globals
);
9139 lang_finalize_version_expr_head (&version
->locals
);
9141 /* Check the global and local match names, and make sure there
9142 aren't any duplicates. */
9144 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
9146 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9148 struct bfd_elf_version_expr
*e2
;
9150 if (t
->locals
.htab
&& e1
->literal
)
9152 e2
= (struct bfd_elf_version_expr
*)
9153 htab_find ((htab_t
) t
->locals
.htab
, e1
);
9154 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9156 if (e1
->mask
== e2
->mask
)
9157 einfo (_("%X%P: duplicate expression `%s'"
9158 " in version information\n"), e1
->pattern
);
9162 else if (!e1
->literal
)
9163 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9164 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9165 && e1
->mask
== e2
->mask
)
9166 einfo (_("%X%P: duplicate expression `%s'"
9167 " in version information\n"), e1
->pattern
);
9171 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
9173 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9175 struct bfd_elf_version_expr
*e2
;
9177 if (t
->globals
.htab
&& e1
->literal
)
9179 e2
= (struct bfd_elf_version_expr
*)
9180 htab_find ((htab_t
) t
->globals
.htab
, e1
);
9181 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
9183 if (e1
->mask
== e2
->mask
)
9184 einfo (_("%X%P: duplicate expression `%s'"
9185 " in version information\n"),
9190 else if (!e1
->literal
)
9191 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
9192 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
9193 && e1
->mask
== e2
->mask
)
9194 einfo (_("%X%P: duplicate expression `%s'"
9195 " in version information\n"), e1
->pattern
);
9199 version
->deps
= deps
;
9200 version
->name
= name
;
9201 if (name
[0] != '\0')
9204 version
->vernum
= version_index
;
9207 version
->vernum
= 0;
9209 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
9214 /* This is called when we see a version dependency. */
9216 struct bfd_elf_version_deps
*
9217 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
9219 struct bfd_elf_version_deps
*ret
;
9220 struct bfd_elf_version_tree
*t
;
9222 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
9225 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
9227 if (strcmp (t
->name
, name
) == 0)
9229 ret
->version_needed
= t
;
9234 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
9236 ret
->version_needed
= NULL
;
9241 lang_do_version_exports_section (void)
9243 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
9245 LANG_FOR_EACH_INPUT_STATEMENT (is
)
9247 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
9255 contents
= (char *) xmalloc (len
);
9256 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
9257 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
9260 while (p
< contents
+ len
)
9262 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
9263 p
= strchr (p
, '\0') + 1;
9266 /* Do not free the contents, as we used them creating the regex. */
9268 /* Do not include this section in the link. */
9269 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
9272 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
9273 lang_register_vers_node (command_line
.version_exports_section
,
9274 lang_new_vers_node (greg
, lreg
), NULL
);
9277 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
9280 lang_do_memory_regions (void)
9282 lang_memory_region_type
*r
= lang_memory_region_list
;
9284 for (; r
!= NULL
; r
= r
->next
)
9288 exp_fold_tree_no_dot (r
->origin_exp
);
9289 if (expld
.result
.valid_p
)
9291 r
->origin
= expld
.result
.value
;
9292 r
->current
= r
->origin
;
9295 einfo (_("%F%P: invalid origin for memory region %s\n"),
9300 exp_fold_tree_no_dot (r
->length_exp
);
9301 if (expld
.result
.valid_p
)
9302 r
->length
= expld
.result
.value
;
9304 einfo (_("%F%P: invalid length for memory region %s\n"),
9311 lang_add_unique (const char *name
)
9313 struct unique_sections
*ent
;
9315 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
9316 if (strcmp (ent
->name
, name
) == 0)
9319 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
9320 ent
->name
= xstrdup (name
);
9321 ent
->next
= unique_section_list
;
9322 unique_section_list
= ent
;
9325 /* Append the list of dynamic symbols to the existing one. */
9328 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
9330 if (link_info
.dynamic_list
)
9332 struct bfd_elf_version_expr
*tail
;
9333 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
9335 tail
->next
= link_info
.dynamic_list
->head
.list
;
9336 link_info
.dynamic_list
->head
.list
= dynamic
;
9340 struct bfd_elf_dynamic_list
*d
;
9342 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
9343 d
->head
.list
= dynamic
;
9344 d
->match
= lang_vers_match
;
9345 link_info
.dynamic_list
= d
;
9349 /* Append the list of C++ typeinfo dynamic symbols to the existing
9353 lang_append_dynamic_list_cpp_typeinfo (void)
9355 const char *symbols
[] =
9357 "typeinfo name for*",
9360 struct bfd_elf_version_expr
*dynamic
= NULL
;
9363 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9364 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9367 lang_append_dynamic_list (dynamic
);
9370 /* Append the list of C++ operator new and delete dynamic symbols to the
9374 lang_append_dynamic_list_cpp_new (void)
9376 const char *symbols
[] =
9381 struct bfd_elf_version_expr
*dynamic
= NULL
;
9384 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
9385 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
9388 lang_append_dynamic_list (dynamic
);
9391 /* Scan a space and/or comma separated string of features. */
9394 lang_ld_feature (char *str
)
9402 while (*p
== ',' || ISSPACE (*p
))
9407 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
9411 if (strcasecmp (p
, "SANE_EXPR") == 0)
9412 config
.sane_expr
= TRUE
;
9414 einfo (_("%X%P: unknown feature `%s'\n"), p
);
9420 /* Pretty print memory amount. */
9423 lang_print_memory_size (bfd_vma sz
)
9425 if ((sz
& 0x3fffffff) == 0)
9426 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
9427 else if ((sz
& 0xfffff) == 0)
9428 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
9429 else if ((sz
& 0x3ff) == 0)
9430 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
9432 printf (" %10" BFD_VMA_FMT
"u B", sz
);
9435 /* Implement --print-memory-usage: disply per region memory usage. */
9438 lang_print_memory_usage (void)
9440 lang_memory_region_type
*r
;
9442 printf ("Memory region Used Size Region Size %%age Used\n");
9443 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
9445 bfd_vma used_length
= r
->current
- r
->origin
;
9447 printf ("%16s: ",r
->name_list
.name
);
9448 lang_print_memory_size (used_length
);
9449 lang_print_memory_size ((bfd_vma
) r
->length
);
9453 double percent
= used_length
* 100.0 / r
->length
;
9454 printf (" %6.2f%%", percent
);