1 /* Linker command language support.
2 Copyright (C) 1991-2018 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. */
23 #include "libiberty.h"
24 #include "filenames.h"
25 #include "safe-ctype.h"
45 #endif /* ENABLE_PLUGINS */
48 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
51 /* Convert between addresses in bytes and sizes in octets.
52 For currently supported targets, octets_per_byte is always a power
53 of two, so we can use shifts. */
54 #define TO_ADDR(X) ((X) >> opb_shift)
55 #define TO_SIZE(X) ((X) << opb_shift)
57 /* Local variables. */
58 static struct obstack stat_obstack
;
59 static struct obstack map_obstack
;
61 #define obstack_chunk_alloc xmalloc
62 #define obstack_chunk_free free
63 static const char *entry_symbol_default
= "start";
64 static bfd_boolean map_head_is_link_order
= FALSE
;
65 static lang_output_section_statement_type
*default_common_section
;
66 static bfd_boolean map_option_f
;
67 static bfd_vma print_dot
;
68 static lang_input_statement_type
*first_file
;
69 static const char *current_target
;
70 static lang_statement_list_type statement_list
;
71 static lang_statement_list_type
*stat_save
[10];
72 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
73 static struct unique_sections
*unique_section_list
;
74 static struct asneeded_minfo
*asneeded_list_head
;
75 static unsigned int opb_shift
= 0;
77 /* Forward declarations. */
78 static void exp_init_os (etree_type
*);
79 static lang_input_statement_type
*lookup_name (const char *);
80 static void insert_undefined (const char *);
81 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
82 static void print_statement (lang_statement_union_type
*,
83 lang_output_section_statement_type
*);
84 static void print_statement_list (lang_statement_union_type
*,
85 lang_output_section_statement_type
*);
86 static void print_statements (void);
87 static void print_input_section (asection
*, bfd_boolean
);
88 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
89 static void lang_record_phdrs (void);
90 static void lang_do_version_exports_section (void);
91 static void lang_finalize_version_expr_head
92 (struct bfd_elf_version_expr_head
*);
93 static void lang_do_memory_regions (void);
95 /* Exported variables. */
96 const char *output_target
;
97 lang_output_section_statement_type
*abs_output_section
;
98 lang_statement_list_type lang_output_section_statement
;
99 lang_statement_list_type
*stat_ptr
= &statement_list
;
100 lang_statement_list_type file_chain
= { NULL
, NULL
};
101 lang_statement_list_type input_file_chain
;
102 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
103 const char *entry_section
= ".text";
104 struct lang_input_statement_flags input_flags
;
105 bfd_boolean entry_from_cmdline
;
106 bfd_boolean undef_from_cmdline
;
107 bfd_boolean lang_has_input_file
= FALSE
;
108 bfd_boolean had_output_filename
= FALSE
;
109 bfd_boolean lang_float_flag
= FALSE
;
110 bfd_boolean delete_output_file_on_failure
= FALSE
;
111 struct lang_phdr
*lang_phdr_list
;
112 struct lang_nocrossrefs
*nocrossref_list
;
113 struct asneeded_minfo
**asneeded_list_tail
;
115 /* Functions that traverse the linker script and might evaluate
116 DEFINED() need to increment this at the start of the traversal. */
117 int lang_statement_iteration
= 0;
119 /* Return TRUE if the PATTERN argument is a wildcard pattern.
120 Although backslashes are treated specially if a pattern contains
121 wildcards, we do not consider the mere presence of a backslash to
122 be enough to cause the pattern to be treated as a wildcard.
123 That lets us handle DOS filenames more naturally. */
124 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
126 #define new_stat(x, y) \
127 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
129 #define outside_section_address(q) \
130 ((q)->output_offset + (q)->output_section->vma)
132 #define outside_symbol_address(q) \
133 ((q)->value + outside_section_address (q->section))
135 #define SECTION_NAME_MAP_LENGTH (16)
138 stat_alloc (size_t size
)
140 return obstack_alloc (&stat_obstack
, size
);
144 name_match (const char *pattern
, const char *name
)
146 if (wildcardp (pattern
))
147 return fnmatch (pattern
, name
, 0);
148 return strcmp (pattern
, name
);
151 /* If PATTERN is of the form archive:file, return a pointer to the
152 separator. If not, return NULL. */
155 archive_path (const char *pattern
)
159 if (link_info
.path_separator
== 0)
162 p
= strchr (pattern
, link_info
.path_separator
);
163 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
164 if (p
== NULL
|| link_info
.path_separator
!= ':')
167 /* Assume a match on the second char is part of drive specifier,
168 as in "c:\silly.dos". */
169 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
170 p
= strchr (p
+ 1, link_info
.path_separator
);
175 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
176 return whether F matches FILE_SPEC. */
179 input_statement_is_archive_path (const char *file_spec
, char *sep
,
180 lang_input_statement_type
*f
)
182 bfd_boolean match
= FALSE
;
185 || name_match (sep
+ 1, f
->filename
) == 0)
186 && ((sep
!= file_spec
)
187 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
191 if (sep
!= file_spec
)
193 const char *aname
= f
->the_bfd
->my_archive
->filename
;
195 match
= name_match (file_spec
, aname
) == 0;
196 *sep
= link_info
.path_separator
;
203 unique_section_p (const asection
*sec
,
204 const lang_output_section_statement_type
*os
)
206 struct unique_sections
*unam
;
209 if (!link_info
.resolve_section_groups
210 && sec
->owner
!= NULL
211 && bfd_is_group_section (sec
->owner
, sec
))
213 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
216 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
217 if (name_match (unam
->name
, secnam
) == 0)
223 /* Generic traversal routines for finding matching sections. */
225 /* Return true if FILE matches a pattern in EXCLUDE_LIST, otherwise return
229 walk_wild_file_in_exclude_list (struct name_list
*exclude_list
,
230 lang_input_statement_type
*file
)
232 struct name_list
*list_tmp
;
234 for (list_tmp
= exclude_list
;
236 list_tmp
= list_tmp
->next
)
238 char *p
= archive_path (list_tmp
->name
);
242 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
246 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
249 /* FIXME: Perhaps remove the following at some stage? Matching
250 unadorned archives like this was never documented and has
251 been superceded by the archive:path syntax. */
252 else if (file
->the_bfd
!= NULL
253 && file
->the_bfd
->my_archive
!= NULL
254 && name_match (list_tmp
->name
,
255 file
->the_bfd
->my_archive
->filename
) == 0)
262 /* Try processing a section against a wildcard. This just calls
263 the callback unless the filename exclusion list is present
264 and excludes the file. It's hardly ever present so this
265 function is very fast. */
268 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
269 lang_input_statement_type
*file
,
271 struct wildcard_list
*sec
,
275 /* Don't process sections from files which were excluded. */
276 if (walk_wild_file_in_exclude_list (sec
->spec
.exclude_name_list
, file
))
279 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
282 /* Lowest common denominator routine that can handle everything correctly,
286 walk_wild_section_general (lang_wild_statement_type
*ptr
,
287 lang_input_statement_type
*file
,
292 struct wildcard_list
*sec
;
294 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
296 sec
= ptr
->section_list
;
298 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
302 bfd_boolean skip
= FALSE
;
304 if (sec
->spec
.name
!= NULL
)
306 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
308 skip
= name_match (sec
->spec
.name
, sname
) != 0;
312 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
319 /* Routines to find a single section given its name. If there's more
320 than one section with that name, we report that. */
324 asection
*found_section
;
325 bfd_boolean multiple_sections_found
;
326 } section_iterator_callback_data
;
329 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
331 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
333 if (d
->found_section
!= NULL
)
335 d
->multiple_sections_found
= TRUE
;
339 d
->found_section
= s
;
344 find_section (lang_input_statement_type
*file
,
345 struct wildcard_list
*sec
,
346 bfd_boolean
*multiple_sections_found
)
348 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
350 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
351 section_iterator_callback
, &cb_data
);
352 *multiple_sections_found
= cb_data
.multiple_sections_found
;
353 return cb_data
.found_section
;
356 /* Code for handling simple wildcards without going through fnmatch,
357 which can be expensive because of charset translations etc. */
359 /* A simple wild is a literal string followed by a single '*',
360 where the literal part is at least 4 characters long. */
363 is_simple_wild (const char *name
)
365 size_t len
= strcspn (name
, "*?[");
366 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
370 match_simple_wild (const char *pattern
, const char *name
)
372 /* The first four characters of the pattern are guaranteed valid
373 non-wildcard characters. So we can go faster. */
374 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
375 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
380 while (*pattern
!= '*')
381 if (*name
++ != *pattern
++)
387 /* Return the numerical value of the init_priority attribute from
388 section name NAME. */
391 get_init_priority (const char *name
)
394 unsigned long init_priority
;
396 /* GCC uses the following section names for the init_priority
397 attribute with numerical values 101 and 65535 inclusive. A
398 lower value means a higher priority.
400 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
401 decimal numerical value of the init_priority attribute.
402 The order of execution in .init_array is forward and
403 .fini_array is backward.
404 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
405 decimal numerical value of the init_priority attribute.
406 The order of execution in .ctors is backward and .dtors
409 if (strncmp (name
, ".init_array.", 12) == 0
410 || strncmp (name
, ".fini_array.", 12) == 0)
412 init_priority
= strtoul (name
+ 12, &end
, 10);
413 return *end
? 0 : init_priority
;
415 else if (strncmp (name
, ".ctors.", 7) == 0
416 || strncmp (name
, ".dtors.", 7) == 0)
418 init_priority
= strtoul (name
+ 7, &end
, 10);
419 return *end
? 0 : 65535 - init_priority
;
425 /* Compare sections ASEC and BSEC according to SORT. */
428 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
431 unsigned long ainit_priority
, binit_priority
;
438 case by_init_priority
:
440 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
442 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
443 if (ainit_priority
== 0 || binit_priority
== 0)
445 ret
= ainit_priority
- binit_priority
;
451 case by_alignment_name
:
452 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
453 - bfd_section_alignment (asec
->owner
, asec
));
460 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
461 bfd_get_section_name (bsec
->owner
, bsec
));
464 case by_name_alignment
:
465 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
466 bfd_get_section_name (bsec
->owner
, bsec
));
472 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
473 - bfd_section_alignment (asec
->owner
, asec
));
480 /* Build a Binary Search Tree to sort sections, unlike insertion sort
481 used in wild_sort(). BST is considerably faster if the number of
482 of sections are large. */
484 static lang_section_bst_type
**
485 wild_sort_fast (lang_wild_statement_type
*wild
,
486 struct wildcard_list
*sec
,
487 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
490 lang_section_bst_type
**tree
;
493 if (!wild
->filenames_sorted
494 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
496 /* Append at the right end of tree. */
498 tree
= &((*tree
)->right
);
504 /* Find the correct node to append this section. */
505 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
506 tree
= &((*tree
)->left
);
508 tree
= &((*tree
)->right
);
514 /* Use wild_sort_fast to build a BST to sort sections. */
517 output_section_callback_fast (lang_wild_statement_type
*ptr
,
518 struct wildcard_list
*sec
,
520 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
521 lang_input_statement_type
*file
,
524 lang_section_bst_type
*node
;
525 lang_section_bst_type
**tree
;
526 lang_output_section_statement_type
*os
;
528 os
= (lang_output_section_statement_type
*) output
;
530 if (unique_section_p (section
, os
))
533 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
536 node
->section
= section
;
538 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
543 /* Convert a sorted sections' BST back to list form. */
546 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
547 lang_section_bst_type
*tree
,
551 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
553 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
554 (lang_output_section_statement_type
*) output
);
557 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
562 /* Specialized, optimized routines for handling different kinds of
566 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
567 lang_input_statement_type
*file
,
571 /* We can just do a hash lookup for the section with the right name.
572 But if that lookup discovers more than one section with the name
573 (should be rare), we fall back to the general algorithm because
574 we would otherwise have to sort the sections to make sure they
575 get processed in the bfd's order. */
576 bfd_boolean multiple_sections_found
;
577 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
578 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
580 if (multiple_sections_found
)
581 walk_wild_section_general (ptr
, file
, callback
, data
);
583 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
587 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
588 lang_input_statement_type
*file
,
593 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
595 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
597 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
598 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
601 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
606 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
607 lang_input_statement_type
*file
,
612 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
613 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
614 bfd_boolean multiple_sections_found
;
615 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
617 if (multiple_sections_found
)
619 walk_wild_section_general (ptr
, file
, callback
, data
);
623 /* Note that if the section was not found, s0 is NULL and
624 we'll simply never succeed the s == s0 test below. */
625 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
627 /* Recall that in this code path, a section cannot satisfy more
628 than one spec, so if s == s0 then it cannot match
631 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
634 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
635 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
638 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
645 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
646 lang_input_statement_type
*file
,
651 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
652 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
653 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
654 bfd_boolean multiple_sections_found
;
655 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
657 if (multiple_sections_found
)
659 walk_wild_section_general (ptr
, file
, callback
, data
);
663 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
666 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
669 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
670 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
673 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
676 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
678 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
686 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
687 lang_input_statement_type
*file
,
692 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
693 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
694 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
695 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
696 bfd_boolean multiple_sections_found
;
697 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
699 if (multiple_sections_found
)
701 walk_wild_section_general (ptr
, file
, callback
, data
);
705 s1
= find_section (file
, sec1
, &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 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
721 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
722 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
726 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
730 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
732 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
740 walk_wild_section (lang_wild_statement_type
*ptr
,
741 lang_input_statement_type
*file
,
745 if (file
->flags
.just_syms
)
748 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
751 /* Returns TRUE when name1 is a wildcard spec that might match
752 something name2 can match. We're conservative: we return FALSE
753 only if the prefixes of name1 and name2 are different up to the
754 first wildcard character. */
757 wild_spec_can_overlap (const char *name1
, const char *name2
)
759 size_t prefix1_len
= strcspn (name1
, "?*[");
760 size_t prefix2_len
= strcspn (name2
, "?*[");
761 size_t min_prefix_len
;
763 /* Note that if there is no wildcard character, then we treat the
764 terminating 0 as part of the prefix. Thus ".text" won't match
765 ".text." or ".text.*", for example. */
766 if (name1
[prefix1_len
] == '\0')
768 if (name2
[prefix2_len
] == '\0')
771 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
773 return memcmp (name1
, name2
, min_prefix_len
) == 0;
776 /* Select specialized code to handle various kinds of wildcard
780 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
783 int wild_name_count
= 0;
784 struct wildcard_list
*sec
;
788 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
789 ptr
->handler_data
[0] = NULL
;
790 ptr
->handler_data
[1] = NULL
;
791 ptr
->handler_data
[2] = NULL
;
792 ptr
->handler_data
[3] = NULL
;
795 /* Count how many wildcard_specs there are, and how many of those
796 actually use wildcards in the name. Also, bail out if any of the
797 wildcard names are NULL. (Can this actually happen?
798 walk_wild_section used to test for it.) And bail out if any
799 of the wildcards are more complex than a simple string
800 ending in a single '*'. */
801 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
804 if (sec
->spec
.name
== NULL
)
806 if (wildcardp (sec
->spec
.name
))
809 if (!is_simple_wild (sec
->spec
.name
))
814 /* The zero-spec case would be easy to optimize but it doesn't
815 happen in practice. Likewise, more than 4 specs doesn't
816 happen in practice. */
817 if (sec_count
== 0 || sec_count
> 4)
820 /* Check that no two specs can match the same section. */
821 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
823 struct wildcard_list
*sec2
;
824 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
826 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
831 signature
= (sec_count
<< 8) + wild_name_count
;
835 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
838 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
841 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
844 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
847 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
853 /* Now fill the data array with pointers to the specs, first the
854 specs with non-wildcard names, then the specs with wildcard
855 names. It's OK to process the specs in different order from the
856 given order, because we've already determined that no section
857 will match more than one spec. */
859 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
860 if (!wildcardp (sec
->spec
.name
))
861 ptr
->handler_data
[data_counter
++] = sec
;
862 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
863 if (wildcardp (sec
->spec
.name
))
864 ptr
->handler_data
[data_counter
++] = sec
;
867 /* Handle a wild statement for a single file F. */
870 walk_wild_file (lang_wild_statement_type
*s
,
871 lang_input_statement_type
*f
,
875 if (walk_wild_file_in_exclude_list (s
->exclude_name_list
, f
))
878 if (f
->the_bfd
== NULL
879 || !bfd_check_format (f
->the_bfd
, bfd_archive
))
880 walk_wild_section (s
, f
, callback
, data
);
885 /* This is an archive file. We must map each member of the
886 archive separately. */
887 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
888 while (member
!= NULL
)
890 /* When lookup_name is called, it will call the add_symbols
891 entry point for the archive. For each element of the
892 archive which is included, BFD will call ldlang_add_file,
893 which will set the usrdata field of the member to the
894 lang_input_statement. */
895 if (member
->usrdata
!= NULL
)
897 walk_wild_section (s
,
898 (lang_input_statement_type
*) member
->usrdata
,
902 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
908 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
910 const char *file_spec
= s
->filename
;
913 if (file_spec
== NULL
)
915 /* Perform the iteration over all files in the list. */
916 LANG_FOR_EACH_INPUT_STATEMENT (f
)
918 walk_wild_file (s
, f
, callback
, data
);
921 else if ((p
= archive_path (file_spec
)) != NULL
)
923 LANG_FOR_EACH_INPUT_STATEMENT (f
)
925 if (input_statement_is_archive_path (file_spec
, p
, f
))
926 walk_wild_file (s
, f
, callback
, data
);
929 else if (wildcardp (file_spec
))
931 LANG_FOR_EACH_INPUT_STATEMENT (f
)
933 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
934 walk_wild_file (s
, f
, callback
, data
);
939 lang_input_statement_type
*f
;
941 /* Perform the iteration over a single file. */
942 f
= lookup_name (file_spec
);
944 walk_wild_file (s
, f
, callback
, data
);
948 /* lang_for_each_statement walks the parse tree and calls the provided
949 function for each node, except those inside output section statements
950 with constraint set to -1. */
953 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
954 lang_statement_union_type
*s
)
956 for (; s
!= NULL
; s
= s
->header
.next
)
960 switch (s
->header
.type
)
962 case lang_constructors_statement_enum
:
963 lang_for_each_statement_worker (func
, constructor_list
.head
);
965 case lang_output_section_statement_enum
:
966 if (s
->output_section_statement
.constraint
!= -1)
967 lang_for_each_statement_worker
968 (func
, s
->output_section_statement
.children
.head
);
970 case lang_wild_statement_enum
:
971 lang_for_each_statement_worker (func
,
972 s
->wild_statement
.children
.head
);
974 case lang_group_statement_enum
:
975 lang_for_each_statement_worker (func
,
976 s
->group_statement
.children
.head
);
978 case lang_data_statement_enum
:
979 case lang_reloc_statement_enum
:
980 case lang_object_symbols_statement_enum
:
981 case lang_output_statement_enum
:
982 case lang_target_statement_enum
:
983 case lang_input_section_enum
:
984 case lang_input_statement_enum
:
985 case lang_assignment_statement_enum
:
986 case lang_padding_statement_enum
:
987 case lang_address_statement_enum
:
988 case lang_fill_statement_enum
:
989 case lang_insert_statement_enum
:
999 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
1001 lang_for_each_statement_worker (func
, statement_list
.head
);
1004 /*----------------------------------------------------------------------*/
1007 lang_list_init (lang_statement_list_type
*list
)
1010 list
->tail
= &list
->head
;
1014 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1016 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1018 *stat_save_ptr
++ = stat_ptr
;
1025 if (stat_save_ptr
<= stat_save
)
1027 stat_ptr
= *--stat_save_ptr
;
1030 /* Build a new statement node for the parse tree. */
1032 static lang_statement_union_type
*
1033 new_statement (enum statement_enum type
,
1035 lang_statement_list_type
*list
)
1037 lang_statement_union_type
*new_stmt
;
1039 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1040 new_stmt
->header
.type
= type
;
1041 new_stmt
->header
.next
= NULL
;
1042 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1046 /* Build a new input file node for the language. There are several
1047 ways in which we treat an input file, eg, we only look at symbols,
1048 or prefix it with a -l etc.
1050 We can be supplied with requests for input files more than once;
1051 they may, for example be split over several lines like foo.o(.text)
1052 foo.o(.data) etc, so when asked for a file we check that we haven't
1053 got it already so we don't duplicate the bfd. */
1055 static lang_input_statement_type
*
1056 new_afile (const char *name
,
1057 lang_input_file_enum_type file_type
,
1059 bfd_boolean add_to_list
)
1061 lang_input_statement_type
*p
;
1063 lang_has_input_file
= TRUE
;
1066 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1069 p
= (lang_input_statement_type
*)
1070 stat_alloc (sizeof (lang_input_statement_type
));
1071 p
->header
.type
= lang_input_statement_enum
;
1072 p
->header
.next
= NULL
;
1075 memset (&p
->the_bfd
, 0,
1076 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1078 p
->flags
.dynamic
= input_flags
.dynamic
;
1079 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1080 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1081 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1082 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1086 case lang_input_file_is_symbols_only_enum
:
1088 p
->local_sym_name
= name
;
1089 p
->flags
.real
= TRUE
;
1090 p
->flags
.just_syms
= TRUE
;
1092 case lang_input_file_is_fake_enum
:
1094 p
->local_sym_name
= name
;
1096 case lang_input_file_is_l_enum
:
1097 if (name
[0] == ':' && name
[1] != '\0')
1099 p
->filename
= name
+ 1;
1100 p
->flags
.full_name_provided
= TRUE
;
1104 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1105 p
->flags
.maybe_archive
= TRUE
;
1106 p
->flags
.real
= TRUE
;
1107 p
->flags
.search_dirs
= TRUE
;
1109 case lang_input_file_is_marker_enum
:
1111 p
->local_sym_name
= name
;
1112 p
->flags
.search_dirs
= TRUE
;
1114 case lang_input_file_is_search_file_enum
:
1116 p
->local_sym_name
= name
;
1117 p
->flags
.real
= TRUE
;
1118 p
->flags
.search_dirs
= TRUE
;
1120 case lang_input_file_is_file_enum
:
1122 p
->local_sym_name
= name
;
1123 p
->flags
.real
= TRUE
;
1129 lang_statement_append (&input_file_chain
,
1130 (lang_statement_union_type
*) p
,
1131 &p
->next_real_file
);
1135 lang_input_statement_type
*
1136 lang_add_input_file (const char *name
,
1137 lang_input_file_enum_type file_type
,
1141 && (*name
== '=' || CONST_STRNEQ (name
, "$SYSROOT")))
1143 lang_input_statement_type
*ret
;
1144 char *sysrooted_name
1145 = concat (ld_sysroot
,
1146 name
+ (*name
== '=' ? 1 : strlen ("$SYSROOT")),
1147 (const char *) NULL
);
1149 /* We've now forcibly prepended the sysroot, making the input
1150 file independent of the context. Therefore, temporarily
1151 force a non-sysrooted context for this statement, so it won't
1152 get the sysroot prepended again when opened. (N.B. if it's a
1153 script, any child nodes with input files starting with "/"
1154 will be handled as "sysrooted" as they'll be found to be
1155 within the sysroot subdirectory.) */
1156 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1157 input_flags
.sysrooted
= 0;
1158 ret
= new_afile (sysrooted_name
, file_type
, target
, TRUE
);
1159 input_flags
.sysrooted
= outer_sysrooted
;
1163 return new_afile (name
, file_type
, target
, TRUE
);
1166 struct out_section_hash_entry
1168 struct bfd_hash_entry root
;
1169 lang_statement_union_type s
;
1172 /* The hash table. */
1174 static struct bfd_hash_table output_section_statement_table
;
1176 /* Support routines for the hash table used by lang_output_section_find,
1177 initialize the table, fill in an entry and remove the table. */
1179 static struct bfd_hash_entry
*
1180 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1181 struct bfd_hash_table
*table
,
1184 lang_output_section_statement_type
**nextp
;
1185 struct out_section_hash_entry
*ret
;
1189 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1195 entry
= bfd_hash_newfunc (entry
, table
, string
);
1199 ret
= (struct out_section_hash_entry
*) entry
;
1200 memset (&ret
->s
, 0, sizeof (ret
->s
));
1201 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1202 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1203 ret
->s
.output_section_statement
.section_alignment
= -1;
1204 ret
->s
.output_section_statement
.block_value
= 1;
1205 lang_list_init (&ret
->s
.output_section_statement
.children
);
1206 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1208 /* For every output section statement added to the list, except the
1209 first one, lang_output_section_statement.tail points to the "next"
1210 field of the last element of the list. */
1211 if (lang_output_section_statement
.head
!= NULL
)
1212 ret
->s
.output_section_statement
.prev
1213 = ((lang_output_section_statement_type
*)
1214 ((char *) lang_output_section_statement
.tail
1215 - offsetof (lang_output_section_statement_type
, next
)));
1217 /* GCC's strict aliasing rules prevent us from just casting the
1218 address, so we store the pointer in a variable and cast that
1220 nextp
= &ret
->s
.output_section_statement
.next
;
1221 lang_statement_append (&lang_output_section_statement
,
1223 (lang_statement_union_type
**) nextp
);
1228 output_section_statement_table_init (void)
1230 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1231 output_section_statement_newfunc
,
1232 sizeof (struct out_section_hash_entry
),
1234 einfo (_("%F%P: can not create hash table: %E\n"));
1238 output_section_statement_table_free (void)
1240 bfd_hash_table_free (&output_section_statement_table
);
1243 /* Build enough state so that the parser can build its tree. */
1248 obstack_begin (&stat_obstack
, 1000);
1250 stat_ptr
= &statement_list
;
1252 output_section_statement_table_init ();
1254 lang_list_init (stat_ptr
);
1256 lang_list_init (&input_file_chain
);
1257 lang_list_init (&lang_output_section_statement
);
1258 lang_list_init (&file_chain
);
1259 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1261 abs_output_section
=
1262 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1264 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1266 asneeded_list_head
= NULL
;
1267 asneeded_list_tail
= &asneeded_list_head
;
1273 output_section_statement_table_free ();
1276 /*----------------------------------------------------------------------
1277 A region is an area of memory declared with the
1278 MEMORY { name:org=exp, len=exp ... }
1281 We maintain a list of all the regions here.
1283 If no regions are specified in the script, then the default is used
1284 which is created when looked up to be the entire data space.
1286 If create is true we are creating a region inside a MEMORY block.
1287 In this case it is probably an error to create a region that has
1288 already been created. If we are not inside a MEMORY block it is
1289 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1290 and so we issue a warning.
1292 Each region has at least one name. The first name is either
1293 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1294 alias names to an existing region within a script with
1295 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1298 static lang_memory_region_type
*lang_memory_region_list
;
1299 static lang_memory_region_type
**lang_memory_region_list_tail
1300 = &lang_memory_region_list
;
1302 lang_memory_region_type
*
1303 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1305 lang_memory_region_name
*n
;
1306 lang_memory_region_type
*r
;
1307 lang_memory_region_type
*new_region
;
1309 /* NAME is NULL for LMA memspecs if no region was specified. */
1313 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1314 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1315 if (strcmp (n
->name
, name
) == 0)
1318 einfo (_("%P:%pS: warning: redeclaration of memory region `%s'\n"),
1323 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1324 einfo (_("%P:%pS: warning: memory region `%s' not declared\n"),
1327 new_region
= (lang_memory_region_type
*)
1328 stat_alloc (sizeof (lang_memory_region_type
));
1330 new_region
->name_list
.name
= xstrdup (name
);
1331 new_region
->name_list
.next
= NULL
;
1332 new_region
->next
= NULL
;
1333 new_region
->origin_exp
= NULL
;
1334 new_region
->origin
= 0;
1335 new_region
->length_exp
= NULL
;
1336 new_region
->length
= ~(bfd_size_type
) 0;
1337 new_region
->current
= 0;
1338 new_region
->last_os
= NULL
;
1339 new_region
->flags
= 0;
1340 new_region
->not_flags
= 0;
1341 new_region
->had_full_message
= FALSE
;
1343 *lang_memory_region_list_tail
= new_region
;
1344 lang_memory_region_list_tail
= &new_region
->next
;
1350 lang_memory_region_alias (const char *alias
, const char *region_name
)
1352 lang_memory_region_name
*n
;
1353 lang_memory_region_type
*r
;
1354 lang_memory_region_type
*region
;
1356 /* The default region must be unique. This ensures that it is not necessary
1357 to iterate through the name list if someone wants the check if a region is
1358 the default memory region. */
1359 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1360 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1361 einfo (_("%F%P:%pS: error: alias for default memory region\n"), NULL
);
1363 /* Look for the target region and check if the alias is not already
1366 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1367 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1369 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1371 if (strcmp (n
->name
, alias
) == 0)
1372 einfo (_("%F%P:%pS: error: redefinition of memory region "
1377 /* Check if the target region exists. */
1379 einfo (_("%F%P:%pS: error: memory region `%s' "
1380 "for alias `%s' does not exist\n"),
1381 NULL
, region_name
, alias
);
1383 /* Add alias to region name list. */
1384 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1385 n
->name
= xstrdup (alias
);
1386 n
->next
= region
->name_list
.next
;
1387 region
->name_list
.next
= n
;
1390 static lang_memory_region_type
*
1391 lang_memory_default (asection
*section
)
1393 lang_memory_region_type
*p
;
1395 flagword sec_flags
= section
->flags
;
1397 /* Override SEC_DATA to mean a writable section. */
1398 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1399 sec_flags
|= SEC_DATA
;
1401 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1403 if ((p
->flags
& sec_flags
) != 0
1404 && (p
->not_flags
& sec_flags
) == 0)
1409 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1412 /* Get the output section statement directly from the userdata. */
1414 lang_output_section_statement_type
*
1415 lang_output_section_get (const asection
*output_section
)
1417 return get_userdata (output_section
);
1420 /* Find or create an output_section_statement with the given NAME.
1421 If CONSTRAINT is non-zero match one with that constraint, otherwise
1422 match any non-negative constraint. If CREATE, always make a
1423 new output_section_statement for SPECIAL CONSTRAINT. */
1425 lang_output_section_statement_type
*
1426 lang_output_section_statement_lookup (const char *name
,
1430 struct out_section_hash_entry
*entry
;
1432 entry
= ((struct out_section_hash_entry
*)
1433 bfd_hash_lookup (&output_section_statement_table
, name
,
1438 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1442 if (entry
->s
.output_section_statement
.name
!= NULL
)
1444 /* We have a section of this name, but it might not have the correct
1446 struct out_section_hash_entry
*last_ent
;
1448 name
= entry
->s
.output_section_statement
.name
;
1449 if (create
&& constraint
== SPECIAL
)
1450 /* Not traversing to the end reverses the order of the second
1451 and subsequent SPECIAL sections in the hash table chain,
1452 but that shouldn't matter. */
1457 if (constraint
== entry
->s
.output_section_statement
.constraint
1459 && entry
->s
.output_section_statement
.constraint
>= 0))
1460 return &entry
->s
.output_section_statement
;
1462 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1464 while (entry
!= NULL
1465 && name
== entry
->s
.output_section_statement
.name
);
1471 = ((struct out_section_hash_entry
*)
1472 output_section_statement_newfunc (NULL
,
1473 &output_section_statement_table
,
1477 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1480 entry
->root
= last_ent
->root
;
1481 last_ent
->root
.next
= &entry
->root
;
1484 entry
->s
.output_section_statement
.name
= name
;
1485 entry
->s
.output_section_statement
.constraint
= constraint
;
1486 return &entry
->s
.output_section_statement
;
1489 /* Find the next output_section_statement with the same name as OS.
1490 If CONSTRAINT is non-zero, find one with that constraint otherwise
1491 match any non-negative constraint. */
1493 lang_output_section_statement_type
*
1494 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1497 /* All output_section_statements are actually part of a
1498 struct out_section_hash_entry. */
1499 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1501 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1502 const char *name
= os
->name
;
1504 ASSERT (name
== entry
->root
.string
);
1507 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1509 || name
!= entry
->s
.output_section_statement
.name
)
1512 while (constraint
!= entry
->s
.output_section_statement
.constraint
1514 || entry
->s
.output_section_statement
.constraint
< 0));
1516 return &entry
->s
.output_section_statement
;
1519 /* A variant of lang_output_section_find used by place_orphan.
1520 Returns the output statement that should precede a new output
1521 statement for SEC. If an exact match is found on certain flags,
1524 lang_output_section_statement_type
*
1525 lang_output_section_find_by_flags (const asection
*sec
,
1527 lang_output_section_statement_type
**exact
,
1528 lang_match_sec_type_func match_type
)
1530 lang_output_section_statement_type
*first
, *look
, *found
;
1531 flagword look_flags
, differ
;
1533 /* We know the first statement on this list is *ABS*. May as well
1535 first
= &lang_output_section_statement
.head
->output_section_statement
;
1536 first
= first
->next
;
1538 /* First try for an exact match. */
1540 for (look
= first
; look
; look
= look
->next
)
1542 look_flags
= look
->flags
;
1543 if (look
->bfd_section
!= NULL
)
1545 look_flags
= look
->bfd_section
->flags
;
1546 if (match_type
&& !match_type (link_info
.output_bfd
,
1551 differ
= look_flags
^ sec_flags
;
1552 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1553 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1563 if ((sec_flags
& SEC_CODE
) != 0
1564 && (sec_flags
& SEC_ALLOC
) != 0)
1566 /* Try for a rw code section. */
1567 for (look
= first
; look
; look
= look
->next
)
1569 look_flags
= look
->flags
;
1570 if (look
->bfd_section
!= NULL
)
1572 look_flags
= look
->bfd_section
->flags
;
1573 if (match_type
&& !match_type (link_info
.output_bfd
,
1578 differ
= look_flags
^ sec_flags
;
1579 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1580 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1584 else if ((sec_flags
& SEC_READONLY
) != 0
1585 && (sec_flags
& SEC_ALLOC
) != 0)
1587 /* .rodata can go after .text, .sdata2 after .rodata. */
1588 for (look
= first
; look
; look
= look
->next
)
1590 look_flags
= look
->flags
;
1591 if (look
->bfd_section
!= NULL
)
1593 look_flags
= look
->bfd_section
->flags
;
1594 if (match_type
&& !match_type (link_info
.output_bfd
,
1599 differ
= look_flags
^ sec_flags
;
1600 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1601 | SEC_READONLY
| SEC_SMALL_DATA
))
1602 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1604 && !(look_flags
& SEC_SMALL_DATA
)))
1608 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1609 && (sec_flags
& SEC_ALLOC
) != 0)
1611 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1612 as if it were a loaded section, and don't use match_type. */
1613 bfd_boolean seen_thread_local
= FALSE
;
1616 for (look
= first
; look
; look
= look
->next
)
1618 look_flags
= look
->flags
;
1619 if (look
->bfd_section
!= NULL
)
1620 look_flags
= look
->bfd_section
->flags
;
1622 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1623 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1625 /* .tdata and .tbss must be adjacent and in that order. */
1626 if (!(look_flags
& SEC_LOAD
)
1627 && (sec_flags
& SEC_LOAD
))
1628 /* ..so if we're at a .tbss section and we're placing
1629 a .tdata section stop looking and return the
1630 previous section. */
1633 seen_thread_local
= TRUE
;
1635 else if (seen_thread_local
)
1637 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1641 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1642 && (sec_flags
& SEC_ALLOC
) != 0)
1644 /* .sdata goes after .data, .sbss after .sdata. */
1645 for (look
= first
; look
; look
= look
->next
)
1647 look_flags
= look
->flags
;
1648 if (look
->bfd_section
!= NULL
)
1650 look_flags
= look
->bfd_section
->flags
;
1651 if (match_type
&& !match_type (link_info
.output_bfd
,
1656 differ
= look_flags
^ sec_flags
;
1657 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1658 | SEC_THREAD_LOCAL
))
1659 || ((look_flags
& SEC_SMALL_DATA
)
1660 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1664 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1665 && (sec_flags
& SEC_ALLOC
) != 0)
1667 /* .data goes after .rodata. */
1668 for (look
= first
; look
; look
= look
->next
)
1670 look_flags
= look
->flags
;
1671 if (look
->bfd_section
!= NULL
)
1673 look_flags
= look
->bfd_section
->flags
;
1674 if (match_type
&& !match_type (link_info
.output_bfd
,
1679 differ
= look_flags
^ sec_flags
;
1680 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1681 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1685 else if ((sec_flags
& SEC_ALLOC
) != 0)
1687 /* .bss goes after any other alloc section. */
1688 for (look
= first
; look
; look
= look
->next
)
1690 look_flags
= look
->flags
;
1691 if (look
->bfd_section
!= NULL
)
1693 look_flags
= look
->bfd_section
->flags
;
1694 if (match_type
&& !match_type (link_info
.output_bfd
,
1699 differ
= look_flags
^ sec_flags
;
1700 if (!(differ
& SEC_ALLOC
))
1706 /* non-alloc go last. */
1707 for (look
= first
; look
; look
= look
->next
)
1709 look_flags
= look
->flags
;
1710 if (look
->bfd_section
!= NULL
)
1711 look_flags
= look
->bfd_section
->flags
;
1712 differ
= look_flags
^ sec_flags
;
1713 if (!(differ
& SEC_DEBUGGING
))
1719 if (found
|| !match_type
)
1722 return lang_output_section_find_by_flags (sec
, sec_flags
, NULL
, NULL
);
1725 /* Find the last output section before given output statement.
1726 Used by place_orphan. */
1729 output_prev_sec_find (lang_output_section_statement_type
*os
)
1731 lang_output_section_statement_type
*lookup
;
1733 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1735 if (lookup
->constraint
< 0)
1738 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1739 return lookup
->bfd_section
;
1745 /* Look for a suitable place for a new output section statement. The
1746 idea is to skip over anything that might be inside a SECTIONS {}
1747 statement in a script, before we find another output section
1748 statement. Assignments to "dot" before an output section statement
1749 are assumed to belong to it, except in two cases; The first
1750 assignment to dot, and assignments before non-alloc sections.
1751 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1752 similar assignments that set the initial address, or we might
1753 insert non-alloc note sections among assignments setting end of
1756 static lang_statement_union_type
**
1757 insert_os_after (lang_output_section_statement_type
*after
)
1759 lang_statement_union_type
**where
;
1760 lang_statement_union_type
**assign
= NULL
;
1761 bfd_boolean ignore_first
;
1764 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1766 for (where
= &after
->header
.next
;
1768 where
= &(*where
)->header
.next
)
1770 switch ((*where
)->header
.type
)
1772 case lang_assignment_statement_enum
:
1775 lang_assignment_statement_type
*ass
;
1777 ass
= &(*where
)->assignment_statement
;
1778 if (ass
->exp
->type
.node_class
!= etree_assert
1779 && ass
->exp
->assign
.dst
[0] == '.'
1780 && ass
->exp
->assign
.dst
[1] == 0
1784 ignore_first
= FALSE
;
1786 case lang_wild_statement_enum
:
1787 case lang_input_section_enum
:
1788 case lang_object_symbols_statement_enum
:
1789 case lang_fill_statement_enum
:
1790 case lang_data_statement_enum
:
1791 case lang_reloc_statement_enum
:
1792 case lang_padding_statement_enum
:
1793 case lang_constructors_statement_enum
:
1796 case lang_output_section_statement_enum
:
1799 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1802 || s
->map_head
.s
== NULL
1803 || (s
->flags
& SEC_ALLOC
) != 0)
1807 case lang_input_statement_enum
:
1808 case lang_address_statement_enum
:
1809 case lang_target_statement_enum
:
1810 case lang_output_statement_enum
:
1811 case lang_group_statement_enum
:
1812 case lang_insert_statement_enum
:
1821 lang_output_section_statement_type
*
1822 lang_insert_orphan (asection
*s
,
1823 const char *secname
,
1825 lang_output_section_statement_type
*after
,
1826 struct orphan_save
*place
,
1827 etree_type
*address
,
1828 lang_statement_list_type
*add_child
)
1830 lang_statement_list_type add
;
1831 lang_output_section_statement_type
*os
;
1832 lang_output_section_statement_type
**os_tail
;
1834 /* If we have found an appropriate place for the output section
1835 statements for this orphan, add them to our own private list,
1836 inserting them later into the global statement list. */
1839 lang_list_init (&add
);
1840 push_stat_ptr (&add
);
1843 if (bfd_link_relocatable (&link_info
)
1844 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1845 address
= exp_intop (0);
1847 os_tail
= ((lang_output_section_statement_type
**)
1848 lang_output_section_statement
.tail
);
1849 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1850 NULL
, NULL
, NULL
, constraint
, 0);
1852 if (add_child
== NULL
)
1853 add_child
= &os
->children
;
1854 lang_add_section (add_child
, s
, NULL
, os
);
1856 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1858 const char *region
= (after
->region
1859 ? after
->region
->name_list
.name
1860 : DEFAULT_MEMORY_REGION
);
1861 const char *lma_region
= (after
->lma_region
1862 ? after
->lma_region
->name_list
.name
1864 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1868 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1871 /* Restore the global list pointer. */
1875 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1877 asection
*snew
, *as
;
1879 snew
= os
->bfd_section
;
1881 /* Shuffle the bfd section list to make the output file look
1882 neater. This is really only cosmetic. */
1883 if (place
->section
== NULL
1884 && after
!= (&lang_output_section_statement
.head
1885 ->output_section_statement
))
1887 asection
*bfd_section
= after
->bfd_section
;
1889 /* If the output statement hasn't been used to place any input
1890 sections (and thus doesn't have an output bfd_section),
1891 look for the closest prior output statement having an
1893 if (bfd_section
== NULL
)
1894 bfd_section
= output_prev_sec_find (after
);
1896 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1897 place
->section
= &bfd_section
->next
;
1900 if (place
->section
== NULL
)
1901 place
->section
= &link_info
.output_bfd
->sections
;
1903 as
= *place
->section
;
1907 /* Put the section at the end of the list. */
1909 /* Unlink the section. */
1910 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1912 /* Now tack it back on in the right place. */
1913 bfd_section_list_append (link_info
.output_bfd
, snew
);
1915 else if (as
!= snew
&& as
->prev
!= snew
)
1917 /* Unlink the section. */
1918 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1920 /* Now tack it back on in the right place. */
1921 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1924 /* Save the end of this list. Further ophans of this type will
1925 follow the one we've just added. */
1926 place
->section
= &snew
->next
;
1928 /* The following is non-cosmetic. We try to put the output
1929 statements in some sort of reasonable order here, because they
1930 determine the final load addresses of the orphan sections.
1931 In addition, placing output statements in the wrong order may
1932 require extra segments. For instance, given a typical
1933 situation of all read-only sections placed in one segment and
1934 following that a segment containing all the read-write
1935 sections, we wouldn't want to place an orphan read/write
1936 section before or amongst the read-only ones. */
1937 if (add
.head
!= NULL
)
1939 lang_output_section_statement_type
*newly_added_os
;
1941 if (place
->stmt
== NULL
)
1943 lang_statement_union_type
**where
= insert_os_after (after
);
1948 place
->os_tail
= &after
->next
;
1952 /* Put it after the last orphan statement we added. */
1953 *add
.tail
= *place
->stmt
;
1954 *place
->stmt
= add
.head
;
1957 /* Fix the global list pointer if we happened to tack our
1958 new list at the tail. */
1959 if (*stat_ptr
->tail
== add
.head
)
1960 stat_ptr
->tail
= add
.tail
;
1962 /* Save the end of this list. */
1963 place
->stmt
= add
.tail
;
1965 /* Do the same for the list of output section statements. */
1966 newly_added_os
= *os_tail
;
1968 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1969 ((char *) place
->os_tail
1970 - offsetof (lang_output_section_statement_type
, next
));
1971 newly_added_os
->next
= *place
->os_tail
;
1972 if (newly_added_os
->next
!= NULL
)
1973 newly_added_os
->next
->prev
= newly_added_os
;
1974 *place
->os_tail
= newly_added_os
;
1975 place
->os_tail
= &newly_added_os
->next
;
1977 /* Fixing the global list pointer here is a little different.
1978 We added to the list in lang_enter_output_section_statement,
1979 trimmed off the new output_section_statment above when
1980 assigning *os_tail = NULL, but possibly added it back in
1981 the same place when assigning *place->os_tail. */
1982 if (*os_tail
== NULL
)
1983 lang_output_section_statement
.tail
1984 = (lang_statement_union_type
**) os_tail
;
1991 lang_print_asneeded (void)
1993 struct asneeded_minfo
*m
;
1995 if (asneeded_list_head
== NULL
)
1998 minfo (_("\nAs-needed library included to satisfy reference by file (symbol)\n\n"));
2000 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2004 minfo ("%s", m
->soname
);
2005 len
= strlen (m
->soname
);
2019 minfo ("%pB ", m
->ref
);
2020 minfo ("(%pT)\n", m
->name
);
2025 lang_map_flags (flagword flag
)
2027 if (flag
& SEC_ALLOC
)
2030 if (flag
& SEC_CODE
)
2033 if (flag
& SEC_READONLY
)
2036 if (flag
& SEC_DATA
)
2039 if (flag
& SEC_LOAD
)
2046 lang_memory_region_type
*m
;
2047 bfd_boolean dis_header_printed
= FALSE
;
2049 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2053 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2054 || file
->flags
.just_syms
)
2057 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2058 if ((s
->output_section
== NULL
2059 || s
->output_section
->owner
!= link_info
.output_bfd
)
2060 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2062 if (!dis_header_printed
)
2064 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2065 dis_header_printed
= TRUE
;
2068 print_input_section (s
, TRUE
);
2072 minfo (_("\nMemory Configuration\n\n"));
2073 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2074 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2076 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2081 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2083 sprintf_vma (buf
, m
->origin
);
2084 minfo ("0x%s ", buf
);
2092 minfo ("0x%V", m
->length
);
2093 if (m
->flags
|| m
->not_flags
)
2101 lang_map_flags (m
->flags
);
2107 lang_map_flags (m
->not_flags
);
2114 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2116 if (!link_info
.reduce_memory_overheads
)
2118 obstack_begin (&map_obstack
, 1000);
2119 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2121 lang_statement_iteration
++;
2122 print_statements ();
2124 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
,
2129 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2130 void *info ATTRIBUTE_UNUSED
)
2132 if ((hash_entry
->type
== bfd_link_hash_defined
2133 || hash_entry
->type
== bfd_link_hash_defweak
)
2134 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2135 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2137 input_section_userdata_type
*ud
;
2138 struct map_symbol_def
*def
;
2140 ud
= ((input_section_userdata_type
*)
2141 get_userdata (hash_entry
->u
.def
.section
));
2144 ud
= (input_section_userdata_type
*) stat_alloc (sizeof (*ud
));
2145 get_userdata (hash_entry
->u
.def
.section
) = ud
;
2146 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2147 ud
->map_symbol_def_count
= 0;
2149 else if (!ud
->map_symbol_def_tail
)
2150 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2152 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2153 def
->entry
= hash_entry
;
2154 *(ud
->map_symbol_def_tail
) = def
;
2155 ud
->map_symbol_def_tail
= &def
->next
;
2156 ud
->map_symbol_def_count
++;
2161 /* Initialize an output section. */
2164 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2166 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2167 einfo (_("%F%P: illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2169 if (s
->constraint
!= SPECIAL
)
2170 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2171 if (s
->bfd_section
== NULL
)
2172 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2174 if (s
->bfd_section
== NULL
)
2176 einfo (_("%F%P: output format %s cannot represent section"
2177 " called %s: %E\n"),
2178 link_info
.output_bfd
->xvec
->name
, s
->name
);
2180 s
->bfd_section
->output_section
= s
->bfd_section
;
2181 s
->bfd_section
->output_offset
= 0;
2183 /* Set the userdata of the output section to the output section
2184 statement to avoid lookup. */
2185 get_userdata (s
->bfd_section
) = s
;
2187 /* If there is a base address, make sure that any sections it might
2188 mention are initialized. */
2189 if (s
->addr_tree
!= NULL
)
2190 exp_init_os (s
->addr_tree
);
2192 if (s
->load_base
!= NULL
)
2193 exp_init_os (s
->load_base
);
2195 /* If supplied an alignment, set it. */
2196 if (s
->section_alignment
!= -1)
2197 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2200 /* Make sure that all output sections mentioned in an expression are
2204 exp_init_os (etree_type
*exp
)
2206 switch (exp
->type
.node_class
)
2210 case etree_provided
:
2211 exp_init_os (exp
->assign
.src
);
2215 exp_init_os (exp
->binary
.lhs
);
2216 exp_init_os (exp
->binary
.rhs
);
2220 exp_init_os (exp
->trinary
.cond
);
2221 exp_init_os (exp
->trinary
.lhs
);
2222 exp_init_os (exp
->trinary
.rhs
);
2226 exp_init_os (exp
->assert_s
.child
);
2230 exp_init_os (exp
->unary
.child
);
2234 switch (exp
->type
.node_code
)
2240 lang_output_section_statement_type
*os
;
2242 os
= lang_output_section_find (exp
->name
.name
);
2243 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2255 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2257 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2259 /* If we are only reading symbols from this object, then we want to
2260 discard all sections. */
2261 if (entry
->flags
.just_syms
)
2263 bfd_link_just_syms (abfd
, sec
, &link_info
);
2267 /* Deal with SHF_EXCLUDE ELF sections. */
2268 if (!bfd_link_relocatable (&link_info
)
2269 && (abfd
->flags
& BFD_PLUGIN
) == 0
2270 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2271 sec
->output_section
= bfd_abs_section_ptr
;
2273 if (!(abfd
->flags
& DYNAMIC
))
2274 bfd_section_already_linked (abfd
, sec
, &link_info
);
2278 /* Returns true if SECTION is one we know will be discarded based on its
2279 section flags, otherwise returns false. */
2282 lang_discard_section_p (asection
*section
)
2284 bfd_boolean discard
;
2285 flagword flags
= section
->flags
;
2287 /* Discard sections marked with SEC_EXCLUDE. */
2288 discard
= (flags
& SEC_EXCLUDE
) != 0;
2290 /* Discard the group descriptor sections when we're finally placing the
2291 sections from within the group. */
2292 if ((flags
& SEC_GROUP
) != 0
2293 && link_info
.resolve_section_groups
)
2296 /* Discard debugging sections if we are stripping debugging
2298 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2299 && (flags
& SEC_DEBUGGING
) != 0)
2305 /* The wild routines.
2307 These expand statements like *(.text) and foo.o to a list of
2308 explicit actions, like foo.o(.text), bar.o(.text) and
2309 foo.o(.text, .data). */
2311 /* Add SECTION to the output section OUTPUT. Do this by creating a
2312 lang_input_section statement which is placed at PTR. */
2315 lang_add_section (lang_statement_list_type
*ptr
,
2317 struct flag_info
*sflag_info
,
2318 lang_output_section_statement_type
*output
)
2320 flagword flags
= section
->flags
;
2322 bfd_boolean discard
;
2323 lang_input_section_type
*new_section
;
2324 bfd
*abfd
= link_info
.output_bfd
;
2326 /* Is this section one we know should be discarded? */
2327 discard
= lang_discard_section_p (section
);
2329 /* Discard input sections which are assigned to a section named
2330 DISCARD_SECTION_NAME. */
2331 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2336 if (section
->output_section
== NULL
)
2338 /* This prevents future calls from assigning this section. */
2339 section
->output_section
= bfd_abs_section_ptr
;
2348 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2353 if (section
->output_section
!= NULL
)
2356 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2357 to an output section, because we want to be able to include a
2358 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2359 section (I don't know why we want to do this, but we do).
2360 build_link_order in ldwrite.c handles this case by turning
2361 the embedded SEC_NEVER_LOAD section into a fill. */
2362 flags
&= ~ SEC_NEVER_LOAD
;
2364 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2365 already been processed. One reason to do this is that on pe
2366 format targets, .text$foo sections go into .text and it's odd
2367 to see .text with SEC_LINK_ONCE set. */
2368 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2370 if (link_info
.resolve_section_groups
)
2371 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2373 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2375 else if (!bfd_link_relocatable (&link_info
))
2376 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2378 switch (output
->sectype
)
2380 case normal_section
:
2381 case overlay_section
:
2383 case noalloc_section
:
2384 flags
&= ~SEC_ALLOC
;
2386 case noload_section
:
2388 flags
|= SEC_NEVER_LOAD
;
2389 /* Unfortunately GNU ld has managed to evolve two different
2390 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2391 alloc, no contents section. All others get a noload, noalloc
2393 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2394 flags
&= ~SEC_HAS_CONTENTS
;
2396 flags
&= ~SEC_ALLOC
;
2400 if (output
->bfd_section
== NULL
)
2401 init_os (output
, flags
);
2403 /* If SEC_READONLY is not set in the input section, then clear
2404 it from the output section. */
2405 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2407 if (output
->bfd_section
->linker_has_input
)
2409 /* Only set SEC_READONLY flag on the first input section. */
2410 flags
&= ~ SEC_READONLY
;
2412 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2413 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2414 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2415 || ((flags
& SEC_MERGE
) != 0
2416 && output
->bfd_section
->entsize
!= section
->entsize
))
2418 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2419 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2422 output
->bfd_section
->flags
|= flags
;
2424 if (!output
->bfd_section
->linker_has_input
)
2426 output
->bfd_section
->linker_has_input
= 1;
2427 /* This must happen after flags have been updated. The output
2428 section may have been created before we saw its first input
2429 section, eg. for a data statement. */
2430 bfd_init_private_section_data (section
->owner
, section
,
2431 link_info
.output_bfd
,
2432 output
->bfd_section
,
2434 if ((flags
& SEC_MERGE
) != 0)
2435 output
->bfd_section
->entsize
= section
->entsize
;
2438 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2439 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2441 /* FIXME: This value should really be obtained from the bfd... */
2442 output
->block_value
= 128;
2445 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2446 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2448 section
->output_section
= output
->bfd_section
;
2450 if (!map_head_is_link_order
)
2452 asection
*s
= output
->bfd_section
->map_tail
.s
;
2453 output
->bfd_section
->map_tail
.s
= section
;
2454 section
->map_head
.s
= NULL
;
2455 section
->map_tail
.s
= s
;
2457 s
->map_head
.s
= section
;
2459 output
->bfd_section
->map_head
.s
= section
;
2462 /* Add a section reference to the list. */
2463 new_section
= new_stat (lang_input_section
, ptr
);
2464 new_section
->section
= section
;
2467 /* Handle wildcard sorting. This returns the lang_input_section which
2468 should follow the one we are going to create for SECTION and FILE,
2469 based on the sorting requirements of WILD. It returns NULL if the
2470 new section should just go at the end of the current list. */
2472 static lang_statement_union_type
*
2473 wild_sort (lang_wild_statement_type
*wild
,
2474 struct wildcard_list
*sec
,
2475 lang_input_statement_type
*file
,
2478 lang_statement_union_type
*l
;
2480 if (!wild
->filenames_sorted
2481 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2484 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2486 lang_input_section_type
*ls
;
2488 if (l
->header
.type
!= lang_input_section_enum
)
2490 ls
= &l
->input_section
;
2492 /* Sorting by filename takes precedence over sorting by section
2495 if (wild
->filenames_sorted
)
2497 const char *fn
, *ln
;
2501 /* The PE support for the .idata section as generated by
2502 dlltool assumes that files will be sorted by the name of
2503 the archive and then the name of the file within the
2506 if (file
->the_bfd
!= NULL
2507 && file
->the_bfd
->my_archive
!= NULL
)
2509 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2514 fn
= file
->filename
;
2518 if (ls
->section
->owner
->my_archive
!= NULL
)
2520 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2525 ln
= ls
->section
->owner
->filename
;
2529 i
= filename_cmp (fn
, ln
);
2538 fn
= file
->filename
;
2540 ln
= ls
->section
->owner
->filename
;
2542 i
= filename_cmp (fn
, ln
);
2550 /* Here either the files are not sorted by name, or we are
2551 looking at the sections for this file. */
2554 && sec
->spec
.sorted
!= none
2555 && sec
->spec
.sorted
!= by_none
)
2556 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2563 /* Expand a wild statement for a particular FILE. SECTION may be
2564 NULL, in which case it is a wild card. */
2567 output_section_callback (lang_wild_statement_type
*ptr
,
2568 struct wildcard_list
*sec
,
2570 struct flag_info
*sflag_info
,
2571 lang_input_statement_type
*file
,
2574 lang_statement_union_type
*before
;
2575 lang_output_section_statement_type
*os
;
2577 os
= (lang_output_section_statement_type
*) output
;
2579 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2580 if (unique_section_p (section
, os
))
2583 before
= wild_sort (ptr
, sec
, file
, section
);
2585 /* Here BEFORE points to the lang_input_section which
2586 should follow the one we are about to add. If BEFORE
2587 is NULL, then the section should just go at the end
2588 of the current list. */
2591 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2594 lang_statement_list_type list
;
2595 lang_statement_union_type
**pp
;
2597 lang_list_init (&list
);
2598 lang_add_section (&list
, section
, sflag_info
, os
);
2600 /* If we are discarding the section, LIST.HEAD will
2602 if (list
.head
!= NULL
)
2604 ASSERT (list
.head
->header
.next
== NULL
);
2606 for (pp
= &ptr
->children
.head
;
2608 pp
= &(*pp
)->header
.next
)
2609 ASSERT (*pp
!= NULL
);
2611 list
.head
->header
.next
= *pp
;
2617 /* Check if all sections in a wild statement for a particular FILE
2621 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2622 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2624 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2625 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2628 lang_output_section_statement_type
*os
;
2630 os
= (lang_output_section_statement_type
*) output
;
2632 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2633 if (unique_section_p (section
, os
))
2636 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2637 os
->all_input_readonly
= FALSE
;
2640 /* This is passed a file name which must have been seen already and
2641 added to the statement tree. We will see if it has been opened
2642 already and had its symbols read. If not then we'll read it. */
2644 static lang_input_statement_type
*
2645 lookup_name (const char *name
)
2647 lang_input_statement_type
*search
;
2649 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2651 search
= (lang_input_statement_type
*) search
->next_real_file
)
2653 /* Use the local_sym_name as the name of the file that has
2654 already been loaded as filename might have been transformed
2655 via the search directory lookup mechanism. */
2656 const char *filename
= search
->local_sym_name
;
2658 if (filename
!= NULL
2659 && filename_cmp (filename
, name
) == 0)
2664 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2665 default_target
, FALSE
);
2667 /* If we have already added this file, or this file is not real
2668 don't add this file. */
2669 if (search
->flags
.loaded
|| !search
->flags
.real
)
2672 if (!load_symbols (search
, NULL
))
2678 /* Save LIST as a list of libraries whose symbols should not be exported. */
2683 struct excluded_lib
*next
;
2685 static struct excluded_lib
*excluded_libs
;
2688 add_excluded_libs (const char *list
)
2690 const char *p
= list
, *end
;
2694 struct excluded_lib
*entry
;
2695 end
= strpbrk (p
, ",:");
2697 end
= p
+ strlen (p
);
2698 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2699 entry
->next
= excluded_libs
;
2700 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2701 memcpy (entry
->name
, p
, end
- p
);
2702 entry
->name
[end
- p
] = '\0';
2703 excluded_libs
= entry
;
2711 check_excluded_libs (bfd
*abfd
)
2713 struct excluded_lib
*lib
= excluded_libs
;
2717 int len
= strlen (lib
->name
);
2718 const char *filename
= lbasename (abfd
->filename
);
2720 if (strcmp (lib
->name
, "ALL") == 0)
2722 abfd
->no_export
= TRUE
;
2726 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2727 && (filename
[len
] == '\0'
2728 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2729 && filename
[len
+ 2] == '\0')))
2731 abfd
->no_export
= TRUE
;
2739 /* Get the symbols for an input file. */
2742 load_symbols (lang_input_statement_type
*entry
,
2743 lang_statement_list_type
*place
)
2747 if (entry
->flags
.loaded
)
2750 ldfile_open_file (entry
);
2752 /* Do not process further if the file was missing. */
2753 if (entry
->flags
.missing_file
)
2756 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
2757 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2760 struct lang_input_statement_flags save_flags
;
2763 err
= bfd_get_error ();
2765 /* See if the emulation has some special knowledge. */
2766 if (ldemul_unrecognized_file (entry
))
2769 if (err
== bfd_error_file_ambiguously_recognized
)
2773 einfo (_("%P: %pB: file not recognized: %E;"
2774 " matching formats:"), entry
->the_bfd
);
2775 for (p
= matching
; *p
!= NULL
; p
++)
2779 else if (err
!= bfd_error_file_not_recognized
2781 einfo (_("%F%P: %pB: file not recognized: %E\n"), entry
->the_bfd
);
2783 bfd_close (entry
->the_bfd
);
2784 entry
->the_bfd
= NULL
;
2786 /* Try to interpret the file as a linker script. */
2787 save_flags
= input_flags
;
2788 ldfile_open_command_file (entry
->filename
);
2790 push_stat_ptr (place
);
2791 input_flags
.add_DT_NEEDED_for_regular
2792 = entry
->flags
.add_DT_NEEDED_for_regular
;
2793 input_flags
.add_DT_NEEDED_for_dynamic
2794 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2795 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2796 input_flags
.dynamic
= entry
->flags
.dynamic
;
2798 ldfile_assumed_script
= TRUE
;
2799 parser_input
= input_script
;
2801 ldfile_assumed_script
= FALSE
;
2803 /* missing_file is sticky. sysrooted will already have been
2804 restored when seeing EOF in yyparse, but no harm to restore
2806 save_flags
.missing_file
|= input_flags
.missing_file
;
2807 input_flags
= save_flags
;
2811 entry
->flags
.loaded
= TRUE
;
2816 if (ldemul_recognized_file (entry
))
2819 /* We don't call ldlang_add_file for an archive. Instead, the
2820 add_symbols entry point will call ldlang_add_file, via the
2821 add_archive_element callback, for each element of the archive
2823 switch (bfd_get_format (entry
->the_bfd
))
2829 if (!entry
->flags
.reload
)
2830 ldlang_add_file (entry
);
2831 if (trace_files
|| verbose
)
2832 info_msg ("%pI\n", entry
);
2836 check_excluded_libs (entry
->the_bfd
);
2838 entry
->the_bfd
->usrdata
= entry
;
2839 if (entry
->flags
.whole_archive
)
2842 bfd_boolean loaded
= TRUE
;
2847 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2852 if (!bfd_check_format (member
, bfd_object
))
2854 einfo (_("%F%P: %pB: member %pB in archive is not an object\n"),
2855 entry
->the_bfd
, member
);
2860 if (!(*link_info
.callbacks
2861 ->add_archive_element
) (&link_info
, member
,
2862 "--whole-archive", &subsbfd
))
2865 /* Potentially, the add_archive_element hook may have set a
2866 substitute BFD for us. */
2867 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2869 einfo (_("%F%P: %pB: error adding symbols: %E\n"), member
);
2874 entry
->flags
.loaded
= loaded
;
2880 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2881 entry
->flags
.loaded
= TRUE
;
2883 einfo (_("%F%P: %pB: error adding symbols: %E\n"), entry
->the_bfd
);
2885 return entry
->flags
.loaded
;
2888 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2889 may be NULL, indicating that it is a wildcard. Separate
2890 lang_input_section statements are created for each part of the
2891 expansion; they are added after the wild statement S. OUTPUT is
2892 the output section. */
2895 wild (lang_wild_statement_type
*s
,
2896 const char *target ATTRIBUTE_UNUSED
,
2897 lang_output_section_statement_type
*output
)
2899 struct wildcard_list
*sec
;
2901 if (s
->handler_data
[0]
2902 && s
->handler_data
[0]->spec
.sorted
== by_name
2903 && !s
->filenames_sorted
)
2905 lang_section_bst_type
*tree
;
2907 walk_wild (s
, output_section_callback_fast
, output
);
2912 output_section_callback_tree_to_list (s
, tree
, output
);
2917 walk_wild (s
, output_section_callback
, output
);
2919 if (default_common_section
== NULL
)
2920 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2921 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2923 /* Remember the section that common is going to in case we
2924 later get something which doesn't know where to put it. */
2925 default_common_section
= output
;
2930 /* Return TRUE iff target is the sought target. */
2933 get_target (const bfd_target
*target
, void *data
)
2935 const char *sought
= (const char *) data
;
2937 return strcmp (target
->name
, sought
) == 0;
2940 /* Like strcpy() but convert to lower case as well. */
2943 stricpy (char *dest
, char *src
)
2947 while ((c
= *src
++) != 0)
2948 *dest
++ = TOLOWER (c
);
2953 /* Remove the first occurrence of needle (if any) in haystack
2957 strcut (char *haystack
, char *needle
)
2959 haystack
= strstr (haystack
, needle
);
2965 for (src
= haystack
+ strlen (needle
); *src
;)
2966 *haystack
++ = *src
++;
2972 /* Compare two target format name strings.
2973 Return a value indicating how "similar" they are. */
2976 name_compare (char *first
, char *second
)
2982 copy1
= (char *) xmalloc (strlen (first
) + 1);
2983 copy2
= (char *) xmalloc (strlen (second
) + 1);
2985 /* Convert the names to lower case. */
2986 stricpy (copy1
, first
);
2987 stricpy (copy2
, second
);
2989 /* Remove size and endian strings from the name. */
2990 strcut (copy1
, "big");
2991 strcut (copy1
, "little");
2992 strcut (copy2
, "big");
2993 strcut (copy2
, "little");
2995 /* Return a value based on how many characters match,
2996 starting from the beginning. If both strings are
2997 the same then return 10 * their length. */
2998 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2999 if (copy1
[result
] == 0)
3011 /* Set by closest_target_match() below. */
3012 static const bfd_target
*winner
;
3014 /* Scan all the valid bfd targets looking for one that has the endianness
3015 requirement that was specified on the command line, and is the nearest
3016 match to the original output target. */
3019 closest_target_match (const bfd_target
*target
, void *data
)
3021 const bfd_target
*original
= (const bfd_target
*) data
;
3023 if (command_line
.endian
== ENDIAN_BIG
3024 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3027 if (command_line
.endian
== ENDIAN_LITTLE
3028 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3031 /* Must be the same flavour. */
3032 if (target
->flavour
!= original
->flavour
)
3035 /* Ignore generic big and little endian elf vectors. */
3036 if (strcmp (target
->name
, "elf32-big") == 0
3037 || strcmp (target
->name
, "elf64-big") == 0
3038 || strcmp (target
->name
, "elf32-little") == 0
3039 || strcmp (target
->name
, "elf64-little") == 0)
3042 /* If we have not found a potential winner yet, then record this one. */
3049 /* Oh dear, we now have two potential candidates for a successful match.
3050 Compare their names and choose the better one. */
3051 if (name_compare (target
->name
, original
->name
)
3052 > name_compare (winner
->name
, original
->name
))
3055 /* Keep on searching until wqe have checked them all. */
3059 /* Return the BFD target format of the first input file. */
3062 get_first_input_target (void)
3064 char *target
= NULL
;
3066 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3068 if (s
->header
.type
== lang_input_statement_enum
3071 ldfile_open_file (s
);
3073 if (s
->the_bfd
!= NULL
3074 && bfd_check_format (s
->the_bfd
, bfd_object
))
3076 target
= bfd_get_target (s
->the_bfd
);
3088 lang_get_output_target (void)
3092 /* Has the user told us which output format to use? */
3093 if (output_target
!= NULL
)
3094 return output_target
;
3096 /* No - has the current target been set to something other than
3098 if (current_target
!= default_target
&& current_target
!= NULL
)
3099 return current_target
;
3101 /* No - can we determine the format of the first input file? */
3102 target
= get_first_input_target ();
3106 /* Failed - use the default output target. */
3107 return default_target
;
3110 /* Open the output file. */
3113 open_output (const char *name
)
3115 output_target
= lang_get_output_target ();
3117 /* Has the user requested a particular endianness on the command
3119 if (command_line
.endian
!= ENDIAN_UNSET
)
3121 /* Get the chosen target. */
3122 const bfd_target
*target
3123 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3125 /* If the target is not supported, we cannot do anything. */
3128 enum bfd_endian desired_endian
;
3130 if (command_line
.endian
== ENDIAN_BIG
)
3131 desired_endian
= BFD_ENDIAN_BIG
;
3133 desired_endian
= BFD_ENDIAN_LITTLE
;
3135 /* See if the target has the wrong endianness. This should
3136 not happen if the linker script has provided big and
3137 little endian alternatives, but some scrips don't do
3139 if (target
->byteorder
!= desired_endian
)
3141 /* If it does, then see if the target provides
3142 an alternative with the correct endianness. */
3143 if (target
->alternative_target
!= NULL
3144 && (target
->alternative_target
->byteorder
== desired_endian
))
3145 output_target
= target
->alternative_target
->name
;
3148 /* Try to find a target as similar as possible to
3149 the default target, but which has the desired
3150 endian characteristic. */
3151 bfd_iterate_over_targets (closest_target_match
,
3154 /* Oh dear - we could not find any targets that
3155 satisfy our requirements. */
3157 einfo (_("%P: warning: could not find any targets"
3158 " that match endianness requirement\n"));
3160 output_target
= winner
->name
;
3166 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3168 if (link_info
.output_bfd
== NULL
)
3170 if (bfd_get_error () == bfd_error_invalid_target
)
3171 einfo (_("%F%P: target %s not found\n"), output_target
);
3173 einfo (_("%F%P: cannot open output file %s: %E\n"), name
);
3176 delete_output_file_on_failure
= TRUE
;
3178 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3179 einfo (_("%F%P: %s: can not make object file: %E\n"), name
);
3180 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3181 ldfile_output_architecture
,
3182 ldfile_output_machine
))
3183 einfo (_("%F%P: %s: can not set architecture: %E\n"), name
);
3185 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3186 if (link_info
.hash
== NULL
)
3187 einfo (_("%F%P: can not create hash table: %E\n"));
3189 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3193 ldlang_open_output (lang_statement_union_type
*statement
)
3195 switch (statement
->header
.type
)
3197 case lang_output_statement_enum
:
3198 ASSERT (link_info
.output_bfd
== NULL
);
3199 open_output (statement
->output_statement
.name
);
3200 ldemul_set_output_arch ();
3201 if (config
.magic_demand_paged
3202 && !bfd_link_relocatable (&link_info
))
3203 link_info
.output_bfd
->flags
|= D_PAGED
;
3205 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3206 if (config
.text_read_only
)
3207 link_info
.output_bfd
->flags
|= WP_TEXT
;
3209 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3210 if (link_info
.traditional_format
)
3211 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3213 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3216 case lang_target_statement_enum
:
3217 current_target
= statement
->target_statement
.target
;
3227 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3228 ldfile_output_machine
);
3231 while ((x
& 1) == 0)
3239 /* Open all the input files. */
3243 OPEN_BFD_NORMAL
= 0,
3247 #ifdef ENABLE_PLUGINS
3248 static lang_input_statement_type
*plugin_insert
= NULL
;
3252 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3254 for (; s
!= NULL
; s
= s
->header
.next
)
3256 switch (s
->header
.type
)
3258 case lang_constructors_statement_enum
:
3259 open_input_bfds (constructor_list
.head
, mode
);
3261 case lang_output_section_statement_enum
:
3262 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3264 case lang_wild_statement_enum
:
3265 /* Maybe we should load the file's symbols. */
3266 if ((mode
& OPEN_BFD_RESCAN
) == 0
3267 && s
->wild_statement
.filename
3268 && !wildcardp (s
->wild_statement
.filename
)
3269 && !archive_path (s
->wild_statement
.filename
))
3270 lookup_name (s
->wild_statement
.filename
);
3271 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3273 case lang_group_statement_enum
:
3275 struct bfd_link_hash_entry
*undefs
;
3277 /* We must continually search the entries in the group
3278 until no new symbols are added to the list of undefined
3283 undefs
= link_info
.hash
->undefs_tail
;
3284 open_input_bfds (s
->group_statement
.children
.head
,
3285 mode
| OPEN_BFD_FORCE
);
3287 while (undefs
!= link_info
.hash
->undefs_tail
);
3290 case lang_target_statement_enum
:
3291 current_target
= s
->target_statement
.target
;
3293 case lang_input_statement_enum
:
3294 if (s
->input_statement
.flags
.real
)
3296 lang_statement_union_type
**os_tail
;
3297 lang_statement_list_type add
;
3300 s
->input_statement
.target
= current_target
;
3302 /* If we are being called from within a group, and this
3303 is an archive which has already been searched, then
3304 force it to be researched unless the whole archive
3305 has been loaded already. Do the same for a rescan.
3306 Likewise reload --as-needed shared libs. */
3307 if (mode
!= OPEN_BFD_NORMAL
3308 #ifdef ENABLE_PLUGINS
3309 && ((mode
& OPEN_BFD_RESCAN
) == 0
3310 || plugin_insert
== NULL
)
3312 && s
->input_statement
.flags
.loaded
3313 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3314 && ((bfd_get_format (abfd
) == bfd_archive
3315 && !s
->input_statement
.flags
.whole_archive
)
3316 || (bfd_get_format (abfd
) == bfd_object
3317 && ((abfd
->flags
) & DYNAMIC
) != 0
3318 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3319 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3320 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3322 s
->input_statement
.flags
.loaded
= FALSE
;
3323 s
->input_statement
.flags
.reload
= TRUE
;
3326 os_tail
= lang_output_section_statement
.tail
;
3327 lang_list_init (&add
);
3329 if (!load_symbols (&s
->input_statement
, &add
))
3330 config
.make_executable
= FALSE
;
3332 if (add
.head
!= NULL
)
3334 /* If this was a script with output sections then
3335 tack any added statements on to the end of the
3336 list. This avoids having to reorder the output
3337 section statement list. Very likely the user
3338 forgot -T, and whatever we do here will not meet
3339 naive user expectations. */
3340 if (os_tail
!= lang_output_section_statement
.tail
)
3342 einfo (_("%P: warning: %s contains output sections;"
3343 " did you forget -T?\n"),
3344 s
->input_statement
.filename
);
3345 *stat_ptr
->tail
= add
.head
;
3346 stat_ptr
->tail
= add
.tail
;
3350 *add
.tail
= s
->header
.next
;
3351 s
->header
.next
= add
.head
;
3355 #ifdef ENABLE_PLUGINS
3356 /* If we have found the point at which a plugin added new
3357 files, clear plugin_insert to enable archive rescan. */
3358 if (&s
->input_statement
== plugin_insert
)
3359 plugin_insert
= NULL
;
3362 case lang_assignment_statement_enum
:
3363 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3364 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3371 /* Exit if any of the files were missing. */
3372 if (input_flags
.missing_file
)
3376 /* Add the supplied name to the symbol table as an undefined reference.
3377 This is a two step process as the symbol table doesn't even exist at
3378 the time the ld command line is processed. First we put the name
3379 on a list, then, once the output file has been opened, transfer the
3380 name to the symbol table. */
3382 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3384 #define ldlang_undef_chain_list_head entry_symbol.next
3387 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3389 ldlang_undef_chain_list_type
*new_undef
;
3391 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3392 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3393 new_undef
->next
= ldlang_undef_chain_list_head
;
3394 ldlang_undef_chain_list_head
= new_undef
;
3396 new_undef
->name
= xstrdup (name
);
3398 if (link_info
.output_bfd
!= NULL
)
3399 insert_undefined (new_undef
->name
);
3402 /* Insert NAME as undefined in the symbol table. */
3405 insert_undefined (const char *name
)
3407 struct bfd_link_hash_entry
*h
;
3409 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3411 einfo (_("%F%P: bfd_link_hash_lookup failed: %E\n"));
3412 if (h
->type
== bfd_link_hash_new
)
3414 h
->type
= bfd_link_hash_undefined
;
3415 h
->u
.undef
.abfd
= NULL
;
3416 h
->non_ir_ref_regular
= TRUE
;
3417 if (is_elf_hash_table (link_info
.hash
))
3418 ((struct elf_link_hash_entry
*) h
)->mark
= 1;
3419 bfd_link_add_undef (link_info
.hash
, h
);
3423 /* Run through the list of undefineds created above and place them
3424 into the linker hash table as undefined symbols belonging to the
3428 lang_place_undefineds (void)
3430 ldlang_undef_chain_list_type
*ptr
;
3432 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3433 insert_undefined (ptr
->name
);
3436 /* Structure used to build the list of symbols that the user has required
3439 struct require_defined_symbol
3442 struct require_defined_symbol
*next
;
3445 /* The list of symbols that the user has required be defined. */
3447 static struct require_defined_symbol
*require_defined_symbol_list
;
3449 /* Add a new symbol NAME to the list of symbols that are required to be
3453 ldlang_add_require_defined (const char *const name
)
3455 struct require_defined_symbol
*ptr
;
3457 ldlang_add_undef (name
, TRUE
);
3458 ptr
= (struct require_defined_symbol
*) stat_alloc (sizeof (*ptr
));
3459 ptr
->next
= require_defined_symbol_list
;
3460 ptr
->name
= strdup (name
);
3461 require_defined_symbol_list
= ptr
;
3464 /* Check that all symbols the user required to be defined, are defined,
3465 raise an error if we find a symbol that is not defined. */
3468 ldlang_check_require_defined_symbols (void)
3470 struct require_defined_symbol
*ptr
;
3472 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
3474 struct bfd_link_hash_entry
*h
;
3476 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
3477 FALSE
, FALSE
, TRUE
);
3479 || (h
->type
!= bfd_link_hash_defined
3480 && h
->type
!= bfd_link_hash_defweak
))
3481 einfo(_("%X%P: required symbol `%s' not defined\n"), ptr
->name
);
3485 /* Check for all readonly or some readwrite sections. */
3488 check_input_sections
3489 (lang_statement_union_type
*s
,
3490 lang_output_section_statement_type
*output_section_statement
)
3492 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3494 switch (s
->header
.type
)
3496 case lang_wild_statement_enum
:
3497 walk_wild (&s
->wild_statement
, check_section_callback
,
3498 output_section_statement
);
3499 if (!output_section_statement
->all_input_readonly
)
3502 case lang_constructors_statement_enum
:
3503 check_input_sections (constructor_list
.head
,
3504 output_section_statement
);
3505 if (!output_section_statement
->all_input_readonly
)
3508 case lang_group_statement_enum
:
3509 check_input_sections (s
->group_statement
.children
.head
,
3510 output_section_statement
);
3511 if (!output_section_statement
->all_input_readonly
)
3520 /* Update wildcard statements if needed. */
3523 update_wild_statements (lang_statement_union_type
*s
)
3525 struct wildcard_list
*sec
;
3527 switch (sort_section
)
3537 for (; s
!= NULL
; s
= s
->header
.next
)
3539 switch (s
->header
.type
)
3544 case lang_wild_statement_enum
:
3545 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3548 switch (sec
->spec
.sorted
)
3551 sec
->spec
.sorted
= sort_section
;
3554 if (sort_section
== by_alignment
)
3555 sec
->spec
.sorted
= by_name_alignment
;
3558 if (sort_section
== by_name
)
3559 sec
->spec
.sorted
= by_alignment_name
;
3567 case lang_constructors_statement_enum
:
3568 update_wild_statements (constructor_list
.head
);
3571 case lang_output_section_statement_enum
:
3572 /* Don't sort .init/.fini sections. */
3573 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3574 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3575 update_wild_statements
3576 (s
->output_section_statement
.children
.head
);
3579 case lang_group_statement_enum
:
3580 update_wild_statements (s
->group_statement
.children
.head
);
3588 /* Open input files and attach to output sections. */
3591 map_input_to_output_sections
3592 (lang_statement_union_type
*s
, const char *target
,
3593 lang_output_section_statement_type
*os
)
3595 for (; s
!= NULL
; s
= s
->header
.next
)
3597 lang_output_section_statement_type
*tos
;
3600 switch (s
->header
.type
)
3602 case lang_wild_statement_enum
:
3603 wild (&s
->wild_statement
, target
, os
);
3605 case lang_constructors_statement_enum
:
3606 map_input_to_output_sections (constructor_list
.head
,
3610 case lang_output_section_statement_enum
:
3611 tos
= &s
->output_section_statement
;
3612 if (tos
->constraint
!= 0)
3614 if (tos
->constraint
!= ONLY_IF_RW
3615 && tos
->constraint
!= ONLY_IF_RO
)
3617 tos
->all_input_readonly
= TRUE
;
3618 check_input_sections (tos
->children
.head
, tos
);
3619 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3621 tos
->constraint
= -1;
3625 map_input_to_output_sections (tos
->children
.head
,
3629 case lang_output_statement_enum
:
3631 case lang_target_statement_enum
:
3632 target
= s
->target_statement
.target
;
3634 case lang_group_statement_enum
:
3635 map_input_to_output_sections (s
->group_statement
.children
.head
,
3639 case lang_data_statement_enum
:
3640 /* Make sure that any sections mentioned in the expression
3642 exp_init_os (s
->data_statement
.exp
);
3643 /* The output section gets CONTENTS, ALLOC and LOAD, but
3644 these may be overridden by the script. */
3645 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3646 switch (os
->sectype
)
3648 case normal_section
:
3649 case overlay_section
:
3651 case noalloc_section
:
3652 flags
= SEC_HAS_CONTENTS
;
3654 case noload_section
:
3655 if (bfd_get_flavour (link_info
.output_bfd
)
3656 == bfd_target_elf_flavour
)
3657 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3659 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3662 if (os
->bfd_section
== NULL
)
3663 init_os (os
, flags
);
3665 os
->bfd_section
->flags
|= flags
;
3667 case lang_input_section_enum
:
3669 case lang_fill_statement_enum
:
3670 case lang_object_symbols_statement_enum
:
3671 case lang_reloc_statement_enum
:
3672 case lang_padding_statement_enum
:
3673 case lang_input_statement_enum
:
3674 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3677 case lang_assignment_statement_enum
:
3678 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3681 /* Make sure that any sections mentioned in the assignment
3683 exp_init_os (s
->assignment_statement
.exp
);
3685 case lang_address_statement_enum
:
3686 /* Mark the specified section with the supplied address.
3687 If this section was actually a segment marker, then the
3688 directive is ignored if the linker script explicitly
3689 processed the segment marker. Originally, the linker
3690 treated segment directives (like -Ttext on the
3691 command-line) as section directives. We honor the
3692 section directive semantics for backwards compatibility;
3693 linker scripts that do not specifically check for
3694 SEGMENT_START automatically get the old semantics. */
3695 if (!s
->address_statement
.segment
3696 || !s
->address_statement
.segment
->used
)
3698 const char *name
= s
->address_statement
.section_name
;
3700 /* Create the output section statement here so that
3701 orphans with a set address will be placed after other
3702 script sections. If we let the orphan placement code
3703 place them in amongst other sections then the address
3704 will affect following script sections, which is
3705 likely to surprise naive users. */
3706 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3707 tos
->addr_tree
= s
->address_statement
.address
;
3708 if (tos
->bfd_section
== NULL
)
3712 case lang_insert_statement_enum
:
3718 /* An insert statement snips out all the linker statements from the
3719 start of the list and places them after the output section
3720 statement specified by the insert. This operation is complicated
3721 by the fact that we keep a doubly linked list of output section
3722 statements as well as the singly linked list of all statements. */
3725 process_insert_statements (void)
3727 lang_statement_union_type
**s
;
3728 lang_output_section_statement_type
*first_os
= NULL
;
3729 lang_output_section_statement_type
*last_os
= NULL
;
3730 lang_output_section_statement_type
*os
;
3732 /* "start of list" is actually the statement immediately after
3733 the special abs_section output statement, so that it isn't
3735 s
= &lang_output_section_statement
.head
;
3736 while (*(s
= &(*s
)->header
.next
) != NULL
)
3738 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3740 /* Keep pointers to the first and last output section
3741 statement in the sequence we may be about to move. */
3742 os
= &(*s
)->output_section_statement
;
3744 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3747 /* Set constraint negative so that lang_output_section_find
3748 won't match this output section statement. At this
3749 stage in linking constraint has values in the range
3750 [-1, ONLY_IN_RW]. */
3751 last_os
->constraint
= -2 - last_os
->constraint
;
3752 if (first_os
== NULL
)
3755 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3757 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3758 lang_output_section_statement_type
*where
;
3759 lang_statement_union_type
**ptr
;
3760 lang_statement_union_type
*first
;
3762 where
= lang_output_section_find (i
->where
);
3763 if (where
!= NULL
&& i
->is_before
)
3766 where
= where
->prev
;
3767 while (where
!= NULL
&& where
->constraint
< 0);
3771 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3775 /* Deal with reordering the output section statement list. */
3776 if (last_os
!= NULL
)
3778 asection
*first_sec
, *last_sec
;
3779 struct lang_output_section_statement_struct
**next
;
3781 /* Snip out the output sections we are moving. */
3782 first_os
->prev
->next
= last_os
->next
;
3783 if (last_os
->next
== NULL
)
3785 next
= &first_os
->prev
->next
;
3786 lang_output_section_statement
.tail
3787 = (lang_statement_union_type
**) next
;
3790 last_os
->next
->prev
= first_os
->prev
;
3791 /* Add them in at the new position. */
3792 last_os
->next
= where
->next
;
3793 if (where
->next
== NULL
)
3795 next
= &last_os
->next
;
3796 lang_output_section_statement
.tail
3797 = (lang_statement_union_type
**) next
;
3800 where
->next
->prev
= last_os
;
3801 first_os
->prev
= where
;
3802 where
->next
= first_os
;
3804 /* Move the bfd sections in the same way. */
3807 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3809 os
->constraint
= -2 - os
->constraint
;
3810 if (os
->bfd_section
!= NULL
3811 && os
->bfd_section
->owner
!= NULL
)
3813 last_sec
= os
->bfd_section
;
3814 if (first_sec
== NULL
)
3815 first_sec
= last_sec
;
3820 if (last_sec
!= NULL
)
3822 asection
*sec
= where
->bfd_section
;
3824 sec
= output_prev_sec_find (where
);
3826 /* The place we want to insert must come after the
3827 sections we are moving. So if we find no
3828 section or if the section is the same as our
3829 last section, then no move is needed. */
3830 if (sec
!= NULL
&& sec
!= last_sec
)
3832 /* Trim them off. */
3833 if (first_sec
->prev
!= NULL
)
3834 first_sec
->prev
->next
= last_sec
->next
;
3836 link_info
.output_bfd
->sections
= last_sec
->next
;
3837 if (last_sec
->next
!= NULL
)
3838 last_sec
->next
->prev
= first_sec
->prev
;
3840 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3842 last_sec
->next
= sec
->next
;
3843 if (sec
->next
!= NULL
)
3844 sec
->next
->prev
= last_sec
;
3846 link_info
.output_bfd
->section_last
= last_sec
;
3847 first_sec
->prev
= sec
;
3848 sec
->next
= first_sec
;
3856 ptr
= insert_os_after (where
);
3857 /* Snip everything after the abs_section output statement we
3858 know is at the start of the list, up to and including
3859 the insert statement we are currently processing. */
3860 first
= lang_output_section_statement
.head
->header
.next
;
3861 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3862 /* Add them back where they belong. */
3865 statement_list
.tail
= s
;
3867 s
= &lang_output_section_statement
.head
;
3871 /* Undo constraint twiddling. */
3872 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3874 os
->constraint
= -2 - os
->constraint
;
3880 /* An output section might have been removed after its statement was
3881 added. For example, ldemul_before_allocation can remove dynamic
3882 sections if they turn out to be not needed. Clean them up here. */
3885 strip_excluded_output_sections (void)
3887 lang_output_section_statement_type
*os
;
3889 /* Run lang_size_sections (if not already done). */
3890 if (expld
.phase
!= lang_mark_phase_enum
)
3892 expld
.phase
= lang_mark_phase_enum
;
3893 expld
.dataseg
.phase
= exp_seg_none
;
3894 one_lang_size_sections_pass (NULL
, FALSE
);
3895 lang_reset_memory_regions ();
3898 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3902 asection
*output_section
;
3903 bfd_boolean exclude
;
3905 if (os
->constraint
< 0)
3908 output_section
= os
->bfd_section
;
3909 if (output_section
== NULL
)
3912 exclude
= (output_section
->rawsize
== 0
3913 && (output_section
->flags
& SEC_KEEP
) == 0
3914 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3917 /* Some sections have not yet been sized, notably .gnu.version,
3918 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3919 input sections, so don't drop output sections that have such
3920 input sections unless they are also marked SEC_EXCLUDE. */
3921 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3925 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3926 if ((s
->flags
& SEC_EXCLUDE
) == 0
3927 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3928 || link_info
.emitrelocations
))
3937 /* We don't set bfd_section to NULL since bfd_section of the
3938 removed output section statement may still be used. */
3939 if (!os
->update_dot
)
3941 output_section
->flags
|= SEC_EXCLUDE
;
3942 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3943 link_info
.output_bfd
->section_count
--;
3948 /* Called from ldwrite to clear out asection.map_head and
3949 asection.map_tail for use as link_orders in ldwrite. */
3952 lang_clear_os_map (void)
3954 lang_output_section_statement_type
*os
;
3956 if (map_head_is_link_order
)
3959 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3963 asection
*output_section
;
3965 if (os
->constraint
< 0)
3968 output_section
= os
->bfd_section
;
3969 if (output_section
== NULL
)
3972 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3973 output_section
->map_head
.link_order
= NULL
;
3974 output_section
->map_tail
.link_order
= NULL
;
3977 /* Stop future calls to lang_add_section from messing with map_head
3978 and map_tail link_order fields. */
3979 map_head_is_link_order
= TRUE
;
3983 print_output_section_statement
3984 (lang_output_section_statement_type
*output_section_statement
)
3986 asection
*section
= output_section_statement
->bfd_section
;
3989 if (output_section_statement
!= abs_output_section
)
3991 minfo ("\n%s", output_section_statement
->name
);
3993 if (section
!= NULL
)
3995 print_dot
= section
->vma
;
3997 len
= strlen (output_section_statement
->name
);
3998 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4003 while (len
< SECTION_NAME_MAP_LENGTH
)
4009 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4011 if (section
->vma
!= section
->lma
)
4012 minfo (_(" load address 0x%V"), section
->lma
);
4014 if (output_section_statement
->update_dot_tree
!= NULL
)
4015 exp_fold_tree (output_section_statement
->update_dot_tree
,
4016 bfd_abs_section_ptr
, &print_dot
);
4022 print_statement_list (output_section_statement
->children
.head
,
4023 output_section_statement
);
4027 print_assignment (lang_assignment_statement_type
*assignment
,
4028 lang_output_section_statement_type
*output_section
)
4035 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4038 if (assignment
->exp
->type
.node_class
== etree_assert
)
4041 tree
= assignment
->exp
->assert_s
.child
;
4045 const char *dst
= assignment
->exp
->assign
.dst
;
4047 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4049 expld
.assign_name
= dst
;
4050 tree
= assignment
->exp
->assign
.src
;
4053 osec
= output_section
->bfd_section
;
4055 osec
= bfd_abs_section_ptr
;
4057 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4058 exp_fold_tree (tree
, osec
, &print_dot
);
4060 expld
.result
.valid_p
= FALSE
;
4062 if (expld
.result
.valid_p
)
4066 if (assignment
->exp
->type
.node_class
== etree_assert
4068 || expld
.assign_name
!= NULL
)
4070 value
= expld
.result
.value
;
4072 if (expld
.result
.section
!= NULL
)
4073 value
+= expld
.result
.section
->vma
;
4075 minfo ("0x%V", value
);
4081 struct bfd_link_hash_entry
*h
;
4083 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4084 FALSE
, FALSE
, TRUE
);
4087 value
= h
->u
.def
.value
;
4088 value
+= h
->u
.def
.section
->output_section
->vma
;
4089 value
+= h
->u
.def
.section
->output_offset
;
4091 minfo ("[0x%V]", value
);
4094 minfo ("[unresolved]");
4099 if (assignment
->exp
->type
.node_class
== etree_provide
)
4100 minfo ("[!provide]");
4107 expld
.assign_name
= NULL
;
4110 exp_print_tree (assignment
->exp
);
4115 print_input_statement (lang_input_statement_type
*statm
)
4117 if (statm
->filename
!= NULL
4118 && (statm
->the_bfd
== NULL
4119 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4120 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4123 /* Print all symbols defined in a particular section. This is called
4124 via bfd_link_hash_traverse, or by print_all_symbols. */
4127 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4129 asection
*sec
= (asection
*) ptr
;
4131 if ((hash_entry
->type
== bfd_link_hash_defined
4132 || hash_entry
->type
== bfd_link_hash_defweak
)
4133 && sec
== hash_entry
->u
.def
.section
)
4137 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4140 (hash_entry
->u
.def
.value
4141 + hash_entry
->u
.def
.section
->output_offset
4142 + hash_entry
->u
.def
.section
->output_section
->vma
));
4144 minfo (" %pT\n", hash_entry
->root
.string
);
4151 hash_entry_addr_cmp (const void *a
, const void *b
)
4153 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4154 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4156 if (l
->u
.def
.value
< r
->u
.def
.value
)
4158 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4165 print_all_symbols (asection
*sec
)
4167 input_section_userdata_type
*ud
4168 = (input_section_userdata_type
*) get_userdata (sec
);
4169 struct map_symbol_def
*def
;
4170 struct bfd_link_hash_entry
**entries
;
4176 *ud
->map_symbol_def_tail
= 0;
4178 /* Sort the symbols by address. */
4179 entries
= (struct bfd_link_hash_entry
**)
4180 obstack_alloc (&map_obstack
,
4181 ud
->map_symbol_def_count
* sizeof (*entries
));
4183 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4184 entries
[i
] = def
->entry
;
4186 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4187 hash_entry_addr_cmp
);
4189 /* Print the symbols. */
4190 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4191 print_one_symbol (entries
[i
], sec
);
4193 obstack_free (&map_obstack
, entries
);
4196 /* Print information about an input section to the map file. */
4199 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4201 bfd_size_type size
= i
->size
;
4208 minfo ("%s", i
->name
);
4210 len
= 1 + strlen (i
->name
);
4211 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4216 while (len
< SECTION_NAME_MAP_LENGTH
)
4222 if (i
->output_section
!= NULL
4223 && i
->output_section
->owner
== link_info
.output_bfd
)
4224 addr
= i
->output_section
->vma
+ i
->output_offset
;
4232 minfo ("0x%V %W %pB\n", addr
, size
, i
->owner
);
4234 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4236 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4248 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4251 if (i
->output_section
!= NULL
4252 && i
->output_section
->owner
== link_info
.output_bfd
)
4254 if (link_info
.reduce_memory_overheads
)
4255 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4257 print_all_symbols (i
);
4259 /* Update print_dot, but make sure that we do not move it
4260 backwards - this could happen if we have overlays and a
4261 later overlay is shorter than an earier one. */
4262 if (addr
+ TO_ADDR (size
) > print_dot
)
4263 print_dot
= addr
+ TO_ADDR (size
);
4268 print_fill_statement (lang_fill_statement_type
*fill
)
4272 fputs (" FILL mask 0x", config
.map_file
);
4273 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4274 fprintf (config
.map_file
, "%02x", *p
);
4275 fputs ("\n", config
.map_file
);
4279 print_data_statement (lang_data_statement_type
*data
)
4287 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4290 addr
= data
->output_offset
;
4291 if (data
->output_section
!= NULL
)
4292 addr
+= data
->output_section
->vma
;
4320 if (size
< TO_SIZE ((unsigned) 1))
4321 size
= TO_SIZE ((unsigned) 1);
4322 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4324 if (data
->exp
->type
.node_class
!= etree_value
)
4327 exp_print_tree (data
->exp
);
4332 print_dot
= addr
+ TO_ADDR (size
);
4335 /* Print an address statement. These are generated by options like
4339 print_address_statement (lang_address_statement_type
*address
)
4341 minfo (_("Address of section %s set to "), address
->section_name
);
4342 exp_print_tree (address
->address
);
4346 /* Print a reloc statement. */
4349 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4356 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4359 addr
= reloc
->output_offset
;
4360 if (reloc
->output_section
!= NULL
)
4361 addr
+= reloc
->output_section
->vma
;
4363 size
= bfd_get_reloc_size (reloc
->howto
);
4365 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4367 if (reloc
->name
!= NULL
)
4368 minfo ("%s+", reloc
->name
);
4370 minfo ("%s+", reloc
->section
->name
);
4372 exp_print_tree (reloc
->addend_exp
);
4376 print_dot
= addr
+ TO_ADDR (size
);
4380 print_padding_statement (lang_padding_statement_type
*s
)
4388 len
= sizeof " *fill*" - 1;
4389 while (len
< SECTION_NAME_MAP_LENGTH
)
4395 addr
= s
->output_offset
;
4396 if (s
->output_section
!= NULL
)
4397 addr
+= s
->output_section
->vma
;
4398 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4400 if (s
->fill
->size
!= 0)
4404 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4405 fprintf (config
.map_file
, "%02x", *p
);
4410 print_dot
= addr
+ TO_ADDR (s
->size
);
4414 print_wild_statement (lang_wild_statement_type
*w
,
4415 lang_output_section_statement_type
*os
)
4417 struct wildcard_list
*sec
;
4421 if (w
->exclude_name_list
)
4424 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
4425 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4426 minfo (" %s", tmp
->name
);
4430 if (w
->filenames_sorted
)
4431 minfo ("SORT_BY_NAME(");
4432 if (w
->filename
!= NULL
)
4433 minfo ("%s", w
->filename
);
4436 if (w
->filenames_sorted
)
4440 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4442 int closing_paren
= 0;
4444 switch (sec
->spec
.sorted
)
4450 minfo ("SORT_BY_NAME(");
4455 minfo ("SORT_BY_ALIGNMENT(");
4459 case by_name_alignment
:
4460 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
4464 case by_alignment_name
:
4465 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
4470 minfo ("SORT_NONE(");
4474 case by_init_priority
:
4475 minfo ("SORT_BY_INIT_PRIORITY(");
4480 if (sec
->spec
.exclude_name_list
!= NULL
)
4483 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4484 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4485 minfo (" %s", tmp
->name
);
4488 if (sec
->spec
.name
!= NULL
)
4489 minfo ("%s", sec
->spec
.name
);
4492 for (;closing_paren
> 0; closing_paren
--)
4501 print_statement_list (w
->children
.head
, os
);
4504 /* Print a group statement. */
4507 print_group (lang_group_statement_type
*s
,
4508 lang_output_section_statement_type
*os
)
4510 fprintf (config
.map_file
, "START GROUP\n");
4511 print_statement_list (s
->children
.head
, os
);
4512 fprintf (config
.map_file
, "END GROUP\n");
4515 /* Print the list of statements in S.
4516 This can be called for any statement type. */
4519 print_statement_list (lang_statement_union_type
*s
,
4520 lang_output_section_statement_type
*os
)
4524 print_statement (s
, os
);
4529 /* Print the first statement in statement list S.
4530 This can be called for any statement type. */
4533 print_statement (lang_statement_union_type
*s
,
4534 lang_output_section_statement_type
*os
)
4536 switch (s
->header
.type
)
4539 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4542 case lang_constructors_statement_enum
:
4543 if (constructor_list
.head
!= NULL
)
4545 if (constructors_sorted
)
4546 minfo (" SORT (CONSTRUCTORS)\n");
4548 minfo (" CONSTRUCTORS\n");
4549 print_statement_list (constructor_list
.head
, os
);
4552 case lang_wild_statement_enum
:
4553 print_wild_statement (&s
->wild_statement
, os
);
4555 case lang_address_statement_enum
:
4556 print_address_statement (&s
->address_statement
);
4558 case lang_object_symbols_statement_enum
:
4559 minfo (" CREATE_OBJECT_SYMBOLS\n");
4561 case lang_fill_statement_enum
:
4562 print_fill_statement (&s
->fill_statement
);
4564 case lang_data_statement_enum
:
4565 print_data_statement (&s
->data_statement
);
4567 case lang_reloc_statement_enum
:
4568 print_reloc_statement (&s
->reloc_statement
);
4570 case lang_input_section_enum
:
4571 print_input_section (s
->input_section
.section
, FALSE
);
4573 case lang_padding_statement_enum
:
4574 print_padding_statement (&s
->padding_statement
);
4576 case lang_output_section_statement_enum
:
4577 print_output_section_statement (&s
->output_section_statement
);
4579 case lang_assignment_statement_enum
:
4580 print_assignment (&s
->assignment_statement
, os
);
4582 case lang_target_statement_enum
:
4583 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4585 case lang_output_statement_enum
:
4586 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4587 if (output_target
!= NULL
)
4588 minfo (" %s", output_target
);
4591 case lang_input_statement_enum
:
4592 print_input_statement (&s
->input_statement
);
4594 case lang_group_statement_enum
:
4595 print_group (&s
->group_statement
, os
);
4597 case lang_insert_statement_enum
:
4598 minfo ("INSERT %s %s\n",
4599 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4600 s
->insert_statement
.where
);
4606 print_statements (void)
4608 print_statement_list (statement_list
.head
, abs_output_section
);
4611 /* Print the first N statements in statement list S to STDERR.
4612 If N == 0, nothing is printed.
4613 If N < 0, the entire list is printed.
4614 Intended to be called from GDB. */
4617 dprint_statement (lang_statement_union_type
*s
, int n
)
4619 FILE *map_save
= config
.map_file
;
4621 config
.map_file
= stderr
;
4624 print_statement_list (s
, abs_output_section
);
4627 while (s
&& --n
>= 0)
4629 print_statement (s
, abs_output_section
);
4634 config
.map_file
= map_save
;
4638 insert_pad (lang_statement_union_type
**ptr
,
4640 bfd_size_type alignment_needed
,
4641 asection
*output_section
,
4644 static fill_type zero_fill
;
4645 lang_statement_union_type
*pad
= NULL
;
4647 if (ptr
!= &statement_list
.head
)
4648 pad
= ((lang_statement_union_type
*)
4649 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4651 && pad
->header
.type
== lang_padding_statement_enum
4652 && pad
->padding_statement
.output_section
== output_section
)
4654 /* Use the existing pad statement. */
4656 else if ((pad
= *ptr
) != NULL
4657 && pad
->header
.type
== lang_padding_statement_enum
4658 && pad
->padding_statement
.output_section
== output_section
)
4660 /* Use the existing pad statement. */
4664 /* Make a new padding statement, linked into existing chain. */
4665 pad
= (lang_statement_union_type
*)
4666 stat_alloc (sizeof (lang_padding_statement_type
));
4667 pad
->header
.next
= *ptr
;
4669 pad
->header
.type
= lang_padding_statement_enum
;
4670 pad
->padding_statement
.output_section
= output_section
;
4673 pad
->padding_statement
.fill
= fill
;
4675 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4676 pad
->padding_statement
.size
= alignment_needed
;
4677 if (!(output_section
->flags
& SEC_FIXED_SIZE
))
4678 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4679 - output_section
->vma
);
4682 /* Work out how much this section will move the dot point. */
4686 (lang_statement_union_type
**this_ptr
,
4687 lang_output_section_statement_type
*output_section_statement
,
4691 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4692 asection
*i
= is
->section
;
4693 asection
*o
= output_section_statement
->bfd_section
;
4695 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4696 i
->output_offset
= i
->vma
- o
->vma
;
4697 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
4698 || output_section_statement
->ignored
)
4699 i
->output_offset
= dot
- o
->vma
;
4702 bfd_size_type alignment_needed
;
4704 /* Align this section first to the input sections requirement,
4705 then to the output section's requirement. If this alignment
4706 is greater than any seen before, then record it too. Perform
4707 the alignment by inserting a magic 'padding' statement. */
4709 if (output_section_statement
->subsection_alignment
!= -1)
4710 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4712 if (o
->alignment_power
< i
->alignment_power
)
4713 o
->alignment_power
= i
->alignment_power
;
4715 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4717 if (alignment_needed
!= 0)
4719 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4720 dot
+= alignment_needed
;
4723 /* Remember where in the output section this input section goes. */
4724 i
->output_offset
= dot
- o
->vma
;
4726 /* Mark how big the output section must be to contain this now. */
4727 dot
+= TO_ADDR (i
->size
);
4728 if (!(o
->flags
& SEC_FIXED_SIZE
))
4729 o
->size
= TO_SIZE (dot
- o
->vma
);
4742 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4744 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4745 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4747 if (sec1
->lma
< sec2
->lma
)
4749 else if (sec1
->lma
> sec2
->lma
)
4751 else if (sec1
->id
< sec2
->id
)
4753 else if (sec1
->id
> sec2
->id
)
4760 sort_sections_by_vma (const void *arg1
, const void *arg2
)
4762 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4763 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4765 if (sec1
->vma
< sec2
->vma
)
4767 else if (sec1
->vma
> sec2
->vma
)
4769 else if (sec1
->id
< sec2
->id
)
4771 else if (sec1
->id
> sec2
->id
)
4777 #define IS_TBSS(s) \
4778 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4780 #define IGNORE_SECTION(s) \
4781 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4783 /* Check to see if any allocated sections overlap with other allocated
4784 sections. This can happen if a linker script specifies the output
4785 section addresses of the two sections. Also check whether any memory
4786 region has overflowed. */
4789 lang_check_section_addresses (void)
4792 struct check_sec
*sections
;
4797 bfd_vma p_start
= 0;
4799 lang_memory_region_type
*m
;
4800 bfd_boolean overlays
;
4802 /* Detect address space overflow on allocated sections. */
4803 addr_mask
= ((bfd_vma
) 1 <<
4804 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
4805 addr_mask
= (addr_mask
<< 1) + 1;
4806 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4807 if ((s
->flags
& SEC_ALLOC
) != 0)
4809 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
4810 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
4811 einfo (_("%X%P: section %s VMA wraps around address space\n"),
4815 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
4816 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
4817 einfo (_("%X%P: section %s LMA wraps around address space\n"),
4822 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4825 count
= bfd_count_sections (link_info
.output_bfd
);
4826 sections
= XNEWVEC (struct check_sec
, count
);
4828 /* Scan all sections in the output list. */
4830 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4832 if (IGNORE_SECTION (s
)
4836 sections
[count
].sec
= s
;
4837 sections
[count
].warned
= FALSE
;
4847 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
4849 /* First check section LMAs. There should be no overlap of LMAs on
4850 loadable sections, even with overlays. */
4851 for (p
= NULL
, i
= 0; i
< count
; i
++)
4853 s
= sections
[i
].sec
;
4854 if ((s
->flags
& SEC_LOAD
) != 0)
4857 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4859 /* Look for an overlap. We have sorted sections by lma, so
4860 we know that s_start >= p_start. Besides the obvious
4861 case of overlap when the current section starts before
4862 the previous one ends, we also must have overlap if the
4863 previous section wraps around the address space. */
4865 && (s_start
<= p_end
4866 || p_end
< p_start
))
4868 einfo (_("%X%P: section %s LMA [%V,%V]"
4869 " overlaps section %s LMA [%V,%V]\n"),
4870 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4871 sections
[i
].warned
= TRUE
;
4879 /* If any non-zero size allocated section (excluding tbss) starts at
4880 exactly the same VMA as another such section, then we have
4881 overlays. Overlays generated by the OVERLAY keyword will have
4882 this property. It is possible to intentionally generate overlays
4883 that fail this test, but it would be unusual. */
4884 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
4886 p_start
= sections
[0].sec
->vma
;
4887 for (i
= 1; i
< count
; i
++)
4889 s_start
= sections
[i
].sec
->vma
;
4890 if (p_start
== s_start
)
4898 /* Now check section VMAs if no overlays were detected. */
4901 for (p
= NULL
, i
= 0; i
< count
; i
++)
4903 s
= sections
[i
].sec
;
4905 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4908 && !sections
[i
].warned
4909 && (s_start
<= p_end
4910 || p_end
< p_start
))
4911 einfo (_("%X%P: section %s VMA [%V,%V]"
4912 " overlaps section %s VMA [%V,%V]\n"),
4913 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4922 /* If any memory region has overflowed, report by how much.
4923 We do not issue this diagnostic for regions that had sections
4924 explicitly placed outside their bounds; os_region_check's
4925 diagnostics are adequate for that case.
4927 FIXME: It is conceivable that m->current - (m->origin + m->length)
4928 might overflow a 32-bit integer. There is, alas, no way to print
4929 a bfd_vma quantity in decimal. */
4930 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4931 if (m
->had_full_message
)
4933 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
4934 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
4935 "%X%P: region `%s' overflowed by %lu bytes\n",
4937 m
->name_list
.name
, over
);
4941 /* Make sure the new address is within the region. We explicitly permit the
4942 current address to be at the exact end of the region when the address is
4943 non-zero, in case the region is at the end of addressable memory and the
4944 calculation wraps around. */
4947 os_region_check (lang_output_section_statement_type
*os
,
4948 lang_memory_region_type
*region
,
4952 if ((region
->current
< region
->origin
4953 || (region
->current
- region
->origin
> region
->length
))
4954 && ((region
->current
!= region
->origin
+ region
->length
)
4959 einfo (_("%X%P: address 0x%v of %pB section `%s'"
4960 " is not within region `%s'\n"),
4962 os
->bfd_section
->owner
,
4963 os
->bfd_section
->name
,
4964 region
->name_list
.name
);
4966 else if (!region
->had_full_message
)
4968 region
->had_full_message
= TRUE
;
4970 einfo (_("%X%P: %pB section `%s' will not fit in region `%s'\n"),
4971 os
->bfd_section
->owner
,
4972 os
->bfd_section
->name
,
4973 region
->name_list
.name
);
4979 ldlang_check_relro_region (lang_statement_union_type
*s
,
4980 seg_align_type
*seg
)
4982 if (seg
->relro
== exp_seg_relro_start
)
4984 if (!seg
->relro_start_stat
)
4985 seg
->relro_start_stat
= s
;
4988 ASSERT (seg
->relro_start_stat
== s
);
4991 else if (seg
->relro
== exp_seg_relro_end
)
4993 if (!seg
->relro_end_stat
)
4994 seg
->relro_end_stat
= s
;
4997 ASSERT (seg
->relro_end_stat
== s
);
5002 /* Set the sizes for all the output sections. */
5005 lang_size_sections_1
5006 (lang_statement_union_type
**prev
,
5007 lang_output_section_statement_type
*output_section_statement
,
5011 bfd_boolean check_regions
)
5013 lang_statement_union_type
*s
;
5015 /* Size up the sections from their constituent parts. */
5016 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
5018 switch (s
->header
.type
)
5020 case lang_output_section_statement_enum
:
5022 bfd_vma newdot
, after
, dotdelta
;
5023 lang_output_section_statement_type
*os
;
5024 lang_memory_region_type
*r
;
5025 int section_alignment
= 0;
5027 os
= &s
->output_section_statement
;
5028 if (os
->constraint
== -1)
5031 /* FIXME: We shouldn't need to zero section vmas for ld -r
5032 here, in lang_insert_orphan, or in the default linker scripts.
5033 This is covering for coff backend linker bugs. See PR6945. */
5034 if (os
->addr_tree
== NULL
5035 && bfd_link_relocatable (&link_info
)
5036 && (bfd_get_flavour (link_info
.output_bfd
)
5037 == bfd_target_coff_flavour
))
5038 os
->addr_tree
= exp_intop (0);
5039 if (os
->addr_tree
!= NULL
)
5041 os
->processed_vma
= FALSE
;
5042 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5044 if (expld
.result
.valid_p
)
5046 dot
= expld
.result
.value
;
5047 if (expld
.result
.section
!= NULL
)
5048 dot
+= expld
.result
.section
->vma
;
5050 else if (expld
.phase
!= lang_mark_phase_enum
)
5051 einfo (_("%F%P:%pS: non constant or forward reference"
5052 " address expression for section %s\n"),
5053 os
->addr_tree
, os
->name
);
5056 if (os
->bfd_section
== NULL
)
5057 /* This section was removed or never actually created. */
5060 /* If this is a COFF shared library section, use the size and
5061 address from the input section. FIXME: This is COFF
5062 specific; it would be cleaner if there were some other way
5063 to do this, but nothing simple comes to mind. */
5064 if (((bfd_get_flavour (link_info
.output_bfd
)
5065 == bfd_target_ecoff_flavour
)
5066 || (bfd_get_flavour (link_info
.output_bfd
)
5067 == bfd_target_coff_flavour
))
5068 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5072 if (os
->children
.head
== NULL
5073 || os
->children
.head
->header
.next
!= NULL
5074 || (os
->children
.head
->header
.type
5075 != lang_input_section_enum
))
5076 einfo (_("%X%P: internal error on COFF shared library"
5077 " section %s\n"), os
->name
);
5079 input
= os
->children
.head
->input_section
.section
;
5080 bfd_set_section_vma (os
->bfd_section
->owner
,
5082 bfd_section_vma (input
->owner
, input
));
5083 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5084 os
->bfd_section
->size
= input
->size
;
5090 if (bfd_is_abs_section (os
->bfd_section
))
5092 /* No matter what happens, an abs section starts at zero. */
5093 ASSERT (os
->bfd_section
->vma
== 0);
5097 if (os
->addr_tree
== NULL
)
5099 /* No address specified for this section, get one
5100 from the region specification. */
5101 if (os
->region
== NULL
5102 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5103 && os
->region
->name_list
.name
[0] == '*'
5104 && strcmp (os
->region
->name_list
.name
,
5105 DEFAULT_MEMORY_REGION
) == 0))
5107 os
->region
= lang_memory_default (os
->bfd_section
);
5110 /* If a loadable section is using the default memory
5111 region, and some non default memory regions were
5112 defined, issue an error message. */
5114 && !IGNORE_SECTION (os
->bfd_section
)
5115 && !bfd_link_relocatable (&link_info
)
5117 && strcmp (os
->region
->name_list
.name
,
5118 DEFAULT_MEMORY_REGION
) == 0
5119 && lang_memory_region_list
!= NULL
5120 && (strcmp (lang_memory_region_list
->name_list
.name
,
5121 DEFAULT_MEMORY_REGION
) != 0
5122 || lang_memory_region_list
->next
!= NULL
)
5123 && expld
.phase
!= lang_mark_phase_enum
)
5125 /* By default this is an error rather than just a
5126 warning because if we allocate the section to the
5127 default memory region we can end up creating an
5128 excessively large binary, or even seg faulting when
5129 attempting to perform a negative seek. See
5130 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5131 for an example of this. This behaviour can be
5132 overridden by the using the --no-check-sections
5134 if (command_line
.check_section_addresses
)
5135 einfo (_("%F%P: error: no memory region specified"
5136 " for loadable section `%s'\n"),
5137 bfd_get_section_name (link_info
.output_bfd
,
5140 einfo (_("%P: warning: no memory region specified"
5141 " for loadable section `%s'\n"),
5142 bfd_get_section_name (link_info
.output_bfd
,
5146 newdot
= os
->region
->current
;
5147 section_alignment
= os
->bfd_section
->alignment_power
;
5150 section_alignment
= os
->section_alignment
;
5152 /* Align to what the section needs. */
5153 if (section_alignment
> 0)
5155 bfd_vma savedot
= newdot
;
5156 newdot
= align_power (newdot
, section_alignment
);
5158 dotdelta
= newdot
- savedot
;
5160 && (config
.warn_section_align
5161 || os
->addr_tree
!= NULL
)
5162 && expld
.phase
!= lang_mark_phase_enum
)
5163 einfo (ngettext ("%P: warning: changing start of "
5164 "section %s by %lu byte\n",
5165 "%P: warning: changing start of "
5166 "section %s by %lu bytes\n",
5167 (unsigned long) dotdelta
),
5168 os
->name
, (unsigned long) dotdelta
);
5171 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
5173 os
->bfd_section
->output_offset
= 0;
5176 lang_size_sections_1 (&os
->children
.head
, os
,
5177 os
->fill
, newdot
, relax
, check_regions
);
5179 os
->processed_vma
= TRUE
;
5181 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5182 /* Except for some special linker created sections,
5183 no output section should change from zero size
5184 after strip_excluded_output_sections. A non-zero
5185 size on an ignored section indicates that some
5186 input section was not sized early enough. */
5187 ASSERT (os
->bfd_section
->size
== 0);
5190 dot
= os
->bfd_section
->vma
;
5192 /* Put the section within the requested block size, or
5193 align at the block boundary. */
5195 + TO_ADDR (os
->bfd_section
->size
)
5196 + os
->block_value
- 1)
5197 & - (bfd_vma
) os
->block_value
);
5199 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5200 os
->bfd_section
->size
= TO_SIZE (after
5201 - os
->bfd_section
->vma
);
5204 /* Set section lma. */
5207 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5211 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5212 os
->bfd_section
->lma
= lma
;
5214 else if (os
->lma_region
!= NULL
)
5216 bfd_vma lma
= os
->lma_region
->current
;
5218 if (os
->align_lma_with_input
)
5222 /* When LMA_REGION is the same as REGION, align the LMA
5223 as we did for the VMA, possibly including alignment
5224 from the bfd section. If a different region, then
5225 only align according to the value in the output
5227 if (os
->lma_region
!= os
->region
)
5228 section_alignment
= os
->section_alignment
;
5229 if (section_alignment
> 0)
5230 lma
= align_power (lma
, section_alignment
);
5232 os
->bfd_section
->lma
= lma
;
5234 else if (r
->last_os
!= NULL
5235 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5240 last
= r
->last_os
->output_section_statement
.bfd_section
;
5242 /* A backwards move of dot should be accompanied by
5243 an explicit assignment to the section LMA (ie.
5244 os->load_base set) because backwards moves can
5245 create overlapping LMAs. */
5247 && os
->bfd_section
->size
!= 0
5248 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5250 /* If dot moved backwards then leave lma equal to
5251 vma. This is the old default lma, which might
5252 just happen to work when the backwards move is
5253 sufficiently large. Nag if this changes anything,
5254 so people can fix their linker scripts. */
5256 if (last
->vma
!= last
->lma
)
5257 einfo (_("%P: warning: dot moved backwards "
5258 "before `%s'\n"), os
->name
);
5262 /* If this is an overlay, set the current lma to that
5263 at the end of the previous section. */
5264 if (os
->sectype
== overlay_section
)
5265 lma
= last
->lma
+ TO_ADDR (last
->size
);
5267 /* Otherwise, keep the same lma to vma relationship
5268 as the previous section. */
5270 lma
= dot
+ last
->lma
- last
->vma
;
5272 if (section_alignment
> 0)
5273 lma
= align_power (lma
, section_alignment
);
5274 os
->bfd_section
->lma
= lma
;
5277 os
->processed_lma
= TRUE
;
5279 /* Keep track of normal sections using the default
5280 lma region. We use this to set the lma for
5281 following sections. Overlays or other linker
5282 script assignment to lma might mean that the
5283 default lma == vma is incorrect.
5284 To avoid warnings about dot moving backwards when using
5285 -Ttext, don't start tracking sections until we find one
5286 of non-zero size or with lma set differently to vma.
5287 Do this tracking before we short-cut the loop so that we
5288 track changes for the case where the section size is zero,
5289 but the lma is set differently to the vma. This is
5290 important, if an orphan section is placed after an
5291 otherwise empty output section that has an explicit lma
5292 set, we want that lma reflected in the orphans lma. */
5293 if (!IGNORE_SECTION (os
->bfd_section
)
5294 && (os
->bfd_section
->size
!= 0
5295 || (r
->last_os
== NULL
5296 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5297 || (r
->last_os
!= NULL
5298 && dot
>= (r
->last_os
->output_section_statement
5299 .bfd_section
->vma
)))
5300 && os
->lma_region
== NULL
5301 && !bfd_link_relocatable (&link_info
))
5304 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5307 /* .tbss sections effectively have zero size. */
5308 if (!IS_TBSS (os
->bfd_section
)
5309 || bfd_link_relocatable (&link_info
))
5310 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5315 if (os
->update_dot_tree
!= 0)
5316 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5318 /* Update dot in the region ?
5319 We only do this if the section is going to be allocated,
5320 since unallocated sections do not contribute to the region's
5321 overall size in memory. */
5322 if (os
->region
!= NULL
5323 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5325 os
->region
->current
= dot
;
5328 /* Make sure the new address is within the region. */
5329 os_region_check (os
, os
->region
, os
->addr_tree
,
5330 os
->bfd_section
->vma
);
5332 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5333 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5334 || os
->align_lma_with_input
))
5336 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5339 os_region_check (os
, os
->lma_region
, NULL
,
5340 os
->bfd_section
->lma
);
5346 case lang_constructors_statement_enum
:
5347 dot
= lang_size_sections_1 (&constructor_list
.head
,
5348 output_section_statement
,
5349 fill
, dot
, relax
, check_regions
);
5352 case lang_data_statement_enum
:
5354 unsigned int size
= 0;
5356 s
->data_statement
.output_offset
=
5357 dot
- output_section_statement
->bfd_section
->vma
;
5358 s
->data_statement
.output_section
=
5359 output_section_statement
->bfd_section
;
5361 /* We might refer to provided symbols in the expression, and
5362 need to mark them as needed. */
5363 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5365 switch (s
->data_statement
.type
)
5383 if (size
< TO_SIZE ((unsigned) 1))
5384 size
= TO_SIZE ((unsigned) 1);
5385 dot
+= TO_ADDR (size
);
5386 if (!(output_section_statement
->bfd_section
->flags
5388 output_section_statement
->bfd_section
->size
5389 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5394 case lang_reloc_statement_enum
:
5398 s
->reloc_statement
.output_offset
=
5399 dot
- output_section_statement
->bfd_section
->vma
;
5400 s
->reloc_statement
.output_section
=
5401 output_section_statement
->bfd_section
;
5402 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5403 dot
+= TO_ADDR (size
);
5404 if (!(output_section_statement
->bfd_section
->flags
5406 output_section_statement
->bfd_section
->size
5407 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5411 case lang_wild_statement_enum
:
5412 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5413 output_section_statement
,
5414 fill
, dot
, relax
, check_regions
);
5417 case lang_object_symbols_statement_enum
:
5418 link_info
.create_object_symbols_section
=
5419 output_section_statement
->bfd_section
;
5422 case lang_output_statement_enum
:
5423 case lang_target_statement_enum
:
5426 case lang_input_section_enum
:
5430 i
= s
->input_section
.section
;
5435 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5436 einfo (_("%F%P: can't relax section: %E\n"));
5440 dot
= size_input_section (prev
, output_section_statement
,
5445 case lang_input_statement_enum
:
5448 case lang_fill_statement_enum
:
5449 s
->fill_statement
.output_section
=
5450 output_section_statement
->bfd_section
;
5452 fill
= s
->fill_statement
.fill
;
5455 case lang_assignment_statement_enum
:
5457 bfd_vma newdot
= dot
;
5458 etree_type
*tree
= s
->assignment_statement
.exp
;
5460 expld
.dataseg
.relro
= exp_seg_relro_none
;
5462 exp_fold_tree (tree
,
5463 output_section_statement
->bfd_section
,
5466 ldlang_check_relro_region (s
, &expld
.dataseg
);
5468 expld
.dataseg
.relro
= exp_seg_relro_none
;
5470 /* This symbol may be relative to this section. */
5471 if ((tree
->type
.node_class
== etree_provided
5472 || tree
->type
.node_class
== etree_assign
)
5473 && (tree
->assign
.dst
[0] != '.'
5474 || tree
->assign
.dst
[1] != '\0'))
5475 output_section_statement
->update_dot
= 1;
5477 if (!output_section_statement
->ignored
)
5479 if (output_section_statement
== abs_output_section
)
5481 /* If we don't have an output section, then just adjust
5482 the default memory address. */
5483 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5484 FALSE
)->current
= newdot
;
5486 else if (newdot
!= dot
)
5488 /* Insert a pad after this statement. We can't
5489 put the pad before when relaxing, in case the
5490 assignment references dot. */
5491 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5492 output_section_statement
->bfd_section
, dot
);
5494 /* Don't neuter the pad below when relaxing. */
5497 /* If dot is advanced, this implies that the section
5498 should have space allocated to it, unless the
5499 user has explicitly stated that the section
5500 should not be allocated. */
5501 if (output_section_statement
->sectype
!= noalloc_section
5502 && (output_section_statement
->sectype
!= noload_section
5503 || (bfd_get_flavour (link_info
.output_bfd
)
5504 == bfd_target_elf_flavour
)))
5505 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5512 case lang_padding_statement_enum
:
5513 /* If this is the first time lang_size_sections is called,
5514 we won't have any padding statements. If this is the
5515 second or later passes when relaxing, we should allow
5516 padding to shrink. If padding is needed on this pass, it
5517 will be added back in. */
5518 s
->padding_statement
.size
= 0;
5520 /* Make sure output_offset is valid. If relaxation shrinks
5521 the section and this pad isn't needed, it's possible to
5522 have output_offset larger than the final size of the
5523 section. bfd_set_section_contents will complain even for
5524 a pad size of zero. */
5525 s
->padding_statement
.output_offset
5526 = dot
- output_section_statement
->bfd_section
->vma
;
5529 case lang_group_statement_enum
:
5530 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5531 output_section_statement
,
5532 fill
, dot
, relax
, check_regions
);
5535 case lang_insert_statement_enum
:
5538 /* We can only get here when relaxing is turned on. */
5539 case lang_address_statement_enum
:
5546 prev
= &s
->header
.next
;
5551 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5552 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5553 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5554 segments. We are allowed an opportunity to override this decision. */
5557 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
5558 bfd
*abfd ATTRIBUTE_UNUSED
,
5559 asection
*current_section
,
5560 asection
*previous_section
,
5561 bfd_boolean new_segment
)
5563 lang_output_section_statement_type
*cur
;
5564 lang_output_section_statement_type
*prev
;
5566 /* The checks below are only necessary when the BFD library has decided
5567 that the two sections ought to be placed into the same segment. */
5571 /* Paranoia checks. */
5572 if (current_section
== NULL
|| previous_section
== NULL
)
5575 /* If this flag is set, the target never wants code and non-code
5576 sections comingled in the same segment. */
5577 if (config
.separate_code
5578 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5581 /* Find the memory regions associated with the two sections.
5582 We call lang_output_section_find() here rather than scanning the list
5583 of output sections looking for a matching section pointer because if
5584 we have a large number of sections then a hash lookup is faster. */
5585 cur
= lang_output_section_find (current_section
->name
);
5586 prev
= lang_output_section_find (previous_section
->name
);
5588 /* More paranoia. */
5589 if (cur
== NULL
|| prev
== NULL
)
5592 /* If the regions are different then force the sections to live in
5593 different segments. See the email thread starting at the following
5594 URL for the reasons why this is necessary:
5595 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5596 return cur
->region
!= prev
->region
;
5600 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5602 lang_statement_iteration
++;
5603 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5604 0, 0, relax
, check_regions
);
5608 lang_size_segment (seg_align_type
*seg
)
5610 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
5611 a page could be saved in the data segment. */
5612 bfd_vma first
, last
;
5614 first
= -seg
->base
& (seg
->pagesize
- 1);
5615 last
= seg
->end
& (seg
->pagesize
- 1);
5617 && ((seg
->base
& ~(seg
->pagesize
- 1))
5618 != (seg
->end
& ~(seg
->pagesize
- 1)))
5619 && first
+ last
<= seg
->pagesize
)
5621 seg
->phase
= exp_seg_adjust
;
5625 seg
->phase
= exp_seg_done
;
5630 lang_size_relro_segment_1 (seg_align_type
*seg
)
5632 bfd_vma relro_end
, desired_end
;
5635 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
5636 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
5637 & ~(seg
->pagesize
- 1));
5639 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
5640 desired_end
= relro_end
- seg
->relro_offset
;
5642 /* For sections in the relro segment.. */
5643 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
5644 if ((sec
->flags
& SEC_ALLOC
) != 0
5645 && sec
->vma
>= seg
->base
5646 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
5648 /* Where do we want to put this section so that it ends as
5650 bfd_vma start
, end
, bump
;
5652 end
= start
= sec
->vma
;
5654 end
+= TO_ADDR (sec
->size
);
5655 bump
= desired_end
- end
;
5656 /* We'd like to increase START by BUMP, but we must heed
5657 alignment so the increase might be less than optimum. */
5659 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
5660 /* This is now the desired end for the previous section. */
5661 desired_end
= start
;
5664 seg
->phase
= exp_seg_relro_adjust
;
5665 ASSERT (desired_end
>= seg
->base
);
5666 seg
->base
= desired_end
;
5671 lang_size_relro_segment (bfd_boolean
*relax
, bfd_boolean check_regions
)
5673 bfd_boolean do_reset
= FALSE
;
5674 bfd_boolean do_data_relro
;
5675 bfd_vma data_initial_base
, data_relro_end
;
5677 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5679 do_data_relro
= TRUE
;
5680 data_initial_base
= expld
.dataseg
.base
;
5681 data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
5685 do_data_relro
= FALSE
;
5686 data_initial_base
= data_relro_end
= 0;
5691 lang_reset_memory_regions ();
5692 one_lang_size_sections_pass (relax
, check_regions
);
5694 /* Assignments to dot, or to output section address in a user
5695 script have increased padding over the original. Revert. */
5696 if (do_data_relro
&& expld
.dataseg
.relro_end
> data_relro_end
)
5698 expld
.dataseg
.base
= data_initial_base
;;
5703 if (!do_data_relro
&& lang_size_segment (&expld
.dataseg
))
5710 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5712 expld
.phase
= lang_allocating_phase_enum
;
5713 expld
.dataseg
.phase
= exp_seg_none
;
5715 one_lang_size_sections_pass (relax
, check_regions
);
5717 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
5718 expld
.dataseg
.phase
= exp_seg_done
;
5720 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
5722 bfd_boolean do_reset
5723 = lang_size_relro_segment (relax
, check_regions
);
5727 lang_reset_memory_regions ();
5728 one_lang_size_sections_pass (relax
, check_regions
);
5731 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5733 link_info
.relro_start
= expld
.dataseg
.base
;
5734 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5739 static lang_output_section_statement_type
*current_section
;
5740 static lang_assignment_statement_type
*current_assign
;
5741 static bfd_boolean prefer_next_section
;
5743 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5746 lang_do_assignments_1 (lang_statement_union_type
*s
,
5747 lang_output_section_statement_type
*current_os
,
5750 bfd_boolean
*found_end
)
5752 for (; s
!= NULL
; s
= s
->header
.next
)
5754 switch (s
->header
.type
)
5756 case lang_constructors_statement_enum
:
5757 dot
= lang_do_assignments_1 (constructor_list
.head
,
5758 current_os
, fill
, dot
, found_end
);
5761 case lang_output_section_statement_enum
:
5763 lang_output_section_statement_type
*os
;
5766 os
= &(s
->output_section_statement
);
5767 os
->after_end
= *found_end
;
5768 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5770 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5772 current_section
= os
;
5773 prefer_next_section
= FALSE
;
5775 dot
= os
->bfd_section
->vma
;
5777 newdot
= lang_do_assignments_1 (os
->children
.head
,
5778 os
, os
->fill
, dot
, found_end
);
5781 if (os
->bfd_section
!= NULL
)
5783 /* .tbss sections effectively have zero size. */
5784 if (!IS_TBSS (os
->bfd_section
)
5785 || bfd_link_relocatable (&link_info
))
5786 dot
+= TO_ADDR (os
->bfd_section
->size
);
5788 if (os
->update_dot_tree
!= NULL
)
5789 exp_fold_tree (os
->update_dot_tree
,
5790 bfd_abs_section_ptr
, &dot
);
5798 case lang_wild_statement_enum
:
5800 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5801 current_os
, fill
, dot
, found_end
);
5804 case lang_object_symbols_statement_enum
:
5805 case lang_output_statement_enum
:
5806 case lang_target_statement_enum
:
5809 case lang_data_statement_enum
:
5810 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5811 if (expld
.result
.valid_p
)
5813 s
->data_statement
.value
= expld
.result
.value
;
5814 if (expld
.result
.section
!= NULL
)
5815 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5817 else if (expld
.phase
== lang_final_phase_enum
)
5818 einfo (_("%F%P: invalid data statement\n"));
5821 switch (s
->data_statement
.type
)
5839 if (size
< TO_SIZE ((unsigned) 1))
5840 size
= TO_SIZE ((unsigned) 1);
5841 dot
+= TO_ADDR (size
);
5845 case lang_reloc_statement_enum
:
5846 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5847 bfd_abs_section_ptr
, &dot
);
5848 if (expld
.result
.valid_p
)
5849 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5850 else if (expld
.phase
== lang_final_phase_enum
)
5851 einfo (_("%F%P: invalid reloc statement\n"));
5852 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5855 case lang_input_section_enum
:
5857 asection
*in
= s
->input_section
.section
;
5859 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5860 dot
+= TO_ADDR (in
->size
);
5864 case lang_input_statement_enum
:
5867 case lang_fill_statement_enum
:
5868 fill
= s
->fill_statement
.fill
;
5871 case lang_assignment_statement_enum
:
5872 current_assign
= &s
->assignment_statement
;
5873 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5875 const char *p
= current_assign
->exp
->assign
.dst
;
5877 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5878 prefer_next_section
= TRUE
;
5882 if (strcmp (p
, "end") == 0)
5885 exp_fold_tree (s
->assignment_statement
.exp
,
5886 (current_os
->bfd_section
!= NULL
5887 ? current_os
->bfd_section
: bfd_und_section_ptr
),
5891 case lang_padding_statement_enum
:
5892 dot
+= TO_ADDR (s
->padding_statement
.size
);
5895 case lang_group_statement_enum
:
5896 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5897 current_os
, fill
, dot
, found_end
);
5900 case lang_insert_statement_enum
:
5903 case lang_address_statement_enum
:
5915 lang_do_assignments (lang_phase_type phase
)
5917 bfd_boolean found_end
= FALSE
;
5919 current_section
= NULL
;
5920 prefer_next_section
= FALSE
;
5921 expld
.phase
= phase
;
5922 lang_statement_iteration
++;
5923 lang_do_assignments_1 (statement_list
.head
,
5924 abs_output_section
, NULL
, 0, &found_end
);
5927 /* For an assignment statement outside of an output section statement,
5928 choose the best of neighbouring output sections to use for values
5932 section_for_dot (void)
5936 /* Assignments belong to the previous output section, unless there
5937 has been an assignment to "dot", in which case following
5938 assignments belong to the next output section. (The assumption
5939 is that an assignment to "dot" is setting up the address for the
5940 next output section.) Except that past the assignment to "_end"
5941 we always associate with the previous section. This exception is
5942 for targets like SH that define an alloc .stack or other
5943 weirdness after non-alloc sections. */
5944 if (current_section
== NULL
|| prefer_next_section
)
5946 lang_statement_union_type
*stmt
;
5947 lang_output_section_statement_type
*os
;
5949 for (stmt
= (lang_statement_union_type
*) current_assign
;
5951 stmt
= stmt
->header
.next
)
5952 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5955 os
= &stmt
->output_section_statement
;
5958 && (os
->bfd_section
== NULL
5959 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5960 || bfd_section_removed_from_list (link_info
.output_bfd
,
5964 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5967 s
= os
->bfd_section
;
5969 s
= link_info
.output_bfd
->section_last
;
5971 && ((s
->flags
& SEC_ALLOC
) == 0
5972 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5977 return bfd_abs_section_ptr
;
5981 s
= current_section
->bfd_section
;
5983 /* The section may have been stripped. */
5985 && ((s
->flags
& SEC_EXCLUDE
) != 0
5986 || (s
->flags
& SEC_ALLOC
) == 0
5987 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5988 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5991 s
= link_info
.output_bfd
->sections
;
5993 && ((s
->flags
& SEC_ALLOC
) == 0
5994 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5999 return bfd_abs_section_ptr
;
6002 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
6004 static struct bfd_link_hash_entry
**start_stop_syms
;
6005 static size_t start_stop_count
= 0;
6006 static size_t start_stop_alloc
= 0;
6008 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6009 to start_stop_syms. */
6012 lang_define_start_stop (const char *symbol
, asection
*sec
)
6014 struct bfd_link_hash_entry
*h
;
6016 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6019 if (start_stop_count
== start_stop_alloc
)
6021 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6023 = xrealloc (start_stop_syms
,
6024 start_stop_alloc
* sizeof (*start_stop_syms
));
6026 start_stop_syms
[start_stop_count
++] = h
;
6030 /* Check for input sections whose names match references to
6031 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6032 preliminary definitions. */
6035 lang_init_start_stop (void)
6039 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6041 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6042 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6045 const char *secname
= s
->name
;
6047 for (ps
= secname
; *ps
!= '\0'; ps
++)
6048 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6052 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6054 symbol
[0] = leading_char
;
6055 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6056 lang_define_start_stop (symbol
, s
);
6058 symbol
[1] = leading_char
;
6059 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6060 lang_define_start_stop (symbol
+ 1, s
);
6067 /* Iterate over start_stop_syms. */
6070 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6074 for (i
= 0; i
< start_stop_count
; ++i
)
6075 func (start_stop_syms
[i
]);
6078 /* __start and __stop symbols are only supposed to be defined by the
6079 linker for orphan sections, but we now extend that to sections that
6080 map to an output section of the same name. The symbols were
6081 defined early for --gc-sections, before we mapped input to output
6082 sections, so undo those that don't satisfy this rule. */
6085 undef_start_stop (struct bfd_link_hash_entry
*h
)
6087 if (h
->ldscript_def
)
6090 if (h
->u
.def
.section
->output_section
== NULL
6091 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6092 || strcmp (h
->u
.def
.section
->name
,
6093 h
->u
.def
.section
->output_section
->name
) != 0)
6095 h
->type
= bfd_link_hash_undefined
;
6096 h
->u
.undef
.abfd
= NULL
;
6101 lang_undef_start_stop (void)
6103 foreach_start_stop (undef_start_stop
);
6106 /* Check for output sections whose names match references to
6107 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6108 preliminary definitions. */
6111 lang_init_startof_sizeof (void)
6115 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6117 const char *secname
= s
->name
;
6118 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6120 sprintf (symbol
, ".startof.%s", secname
);
6121 lang_define_start_stop (symbol
, s
);
6123 memcpy (symbol
+ 1, ".size", 5);
6124 lang_define_start_stop (symbol
+ 1, s
);
6129 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6132 set_start_stop (struct bfd_link_hash_entry
*h
)
6135 || h
->type
!= bfd_link_hash_defined
)
6138 if (h
->root
.string
[0] == '.')
6140 /* .startof. or .sizeof. symbol.
6141 .startof. already has final value. */
6142 if (h
->root
.string
[2] == 'i')
6145 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6146 h
->u
.def
.section
= bfd_abs_section_ptr
;
6151 /* __start or __stop symbol. */
6152 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6154 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6155 if (h
->root
.string
[4 + has_lead
] == 'o')
6158 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6164 lang_finalize_start_stop (void)
6166 foreach_start_stop (set_start_stop
);
6172 struct bfd_link_hash_entry
*h
;
6175 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
6176 || bfd_link_dll (&link_info
))
6177 warn
= entry_from_cmdline
;
6181 /* Force the user to specify a root when generating a relocatable with
6183 if (link_info
.gc_sections
&& bfd_link_relocatable (&link_info
)
6184 && !(entry_from_cmdline
|| undef_from_cmdline
))
6185 einfo (_("%F%P: gc-sections requires either an entry or "
6186 "an undefined symbol\n"));
6188 if (entry_symbol
.name
== NULL
)
6190 /* No entry has been specified. Look for the default entry, but
6191 don't warn if we don't find it. */
6192 entry_symbol
.name
= entry_symbol_default
;
6196 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
6197 FALSE
, FALSE
, TRUE
);
6199 && (h
->type
== bfd_link_hash_defined
6200 || h
->type
== bfd_link_hash_defweak
)
6201 && h
->u
.def
.section
->output_section
!= NULL
)
6205 val
= (h
->u
.def
.value
6206 + bfd_get_section_vma (link_info
.output_bfd
,
6207 h
->u
.def
.section
->output_section
)
6208 + h
->u
.def
.section
->output_offset
);
6209 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6210 einfo (_("%F%P: %s: can't set start address\n"), entry_symbol
.name
);
6217 /* We couldn't find the entry symbol. Try parsing it as a
6219 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
6222 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6223 einfo (_("%F%P: can't set start address\n"));
6229 /* Can't find the entry symbol, and it's not a number. Use
6230 the first address in the text section. */
6231 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
6235 einfo (_("%P: warning: cannot find entry symbol %s;"
6236 " defaulting to %V\n"),
6238 bfd_get_section_vma (link_info
.output_bfd
, ts
));
6239 if (!(bfd_set_start_address
6240 (link_info
.output_bfd
,
6241 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
6242 einfo (_("%F%P: can't set start address\n"));
6247 einfo (_("%P: warning: cannot find entry symbol %s;"
6248 " not setting start address\n"),
6255 /* This is a small function used when we want to ignore errors from
6259 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
6260 va_list ap ATTRIBUTE_UNUSED
)
6262 /* Don't do anything. */
6265 /* Check that the architecture of all the input files is compatible
6266 with the output file. Also call the backend to let it do any
6267 other checking that is needed. */
6272 lang_statement_union_type
*file
;
6274 const bfd_arch_info_type
*compatible
;
6276 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
6278 #ifdef ENABLE_PLUGINS
6279 /* Don't check format of files claimed by plugin. */
6280 if (file
->input_statement
.flags
.claimed
)
6282 #endif /* ENABLE_PLUGINS */
6283 input_bfd
= file
->input_statement
.the_bfd
;
6285 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
6286 command_line
.accept_unknown_input_arch
);
6288 /* In general it is not possible to perform a relocatable
6289 link between differing object formats when the input
6290 file has relocations, because the relocations in the
6291 input format may not have equivalent representations in
6292 the output format (and besides BFD does not translate
6293 relocs for other link purposes than a final link). */
6294 if ((bfd_link_relocatable (&link_info
)
6295 || link_info
.emitrelocations
)
6296 && (compatible
== NULL
6297 || (bfd_get_flavour (input_bfd
)
6298 != bfd_get_flavour (link_info
.output_bfd
)))
6299 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
6301 einfo (_("%F%P: relocatable linking with relocations from"
6302 " format %s (%pB) to format %s (%pB) is not supported\n"),
6303 bfd_get_target (input_bfd
), input_bfd
,
6304 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
6305 /* einfo with %F exits. */
6308 if (compatible
== NULL
)
6310 if (command_line
.warn_mismatch
)
6311 einfo (_("%X%P: %s architecture of input file `%pB'"
6312 " is incompatible with %s output\n"),
6313 bfd_printable_name (input_bfd
), input_bfd
,
6314 bfd_printable_name (link_info
.output_bfd
));
6316 else if (bfd_count_sections (input_bfd
))
6318 /* If the input bfd has no contents, it shouldn't set the
6319 private data of the output bfd. */
6321 bfd_error_handler_type pfn
= NULL
;
6323 /* If we aren't supposed to warn about mismatched input
6324 files, temporarily set the BFD error handler to a
6325 function which will do nothing. We still want to call
6326 bfd_merge_private_bfd_data, since it may set up
6327 information which is needed in the output file. */
6328 if (!command_line
.warn_mismatch
)
6329 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
6330 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
6332 if (command_line
.warn_mismatch
)
6333 einfo (_("%X%P: failed to merge target specific data"
6334 " of file %pB\n"), input_bfd
);
6336 if (!command_line
.warn_mismatch
)
6337 bfd_set_error_handler (pfn
);
6342 /* Look through all the global common symbols and attach them to the
6343 correct section. The -sort-common command line switch may be used
6344 to roughly sort the entries by alignment. */
6349 if (link_info
.inhibit_common_definition
)
6351 if (bfd_link_relocatable (&link_info
)
6352 && !command_line
.force_common_definition
)
6355 if (!config
.sort_common
)
6356 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
6361 if (config
.sort_common
== sort_descending
)
6363 for (power
= 4; power
> 0; power
--)
6364 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6367 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6371 for (power
= 0; power
<= 4; power
++)
6372 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6374 power
= (unsigned int) -1;
6375 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6380 /* Place one common symbol in the correct section. */
6383 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
6385 unsigned int power_of_two
;
6389 if (h
->type
!= bfd_link_hash_common
)
6393 power_of_two
= h
->u
.c
.p
->alignment_power
;
6395 if (config
.sort_common
== sort_descending
6396 && power_of_two
< *(unsigned int *) info
)
6398 else if (config
.sort_common
== sort_ascending
6399 && power_of_two
> *(unsigned int *) info
)
6402 section
= h
->u
.c
.p
->section
;
6403 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6404 einfo (_("%F%P: could not define common symbol `%pT': %E\n"),
6407 if (config
.map_file
!= NULL
)
6409 static bfd_boolean header_printed
;
6414 if (!header_printed
)
6416 minfo (_("\nAllocating common symbols\n"));
6417 minfo (_("Common symbol size file\n\n"));
6418 header_printed
= TRUE
;
6421 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6422 DMGL_ANSI
| DMGL_PARAMS
);
6425 minfo ("%s", h
->root
.string
);
6426 len
= strlen (h
->root
.string
);
6431 len
= strlen (name
);
6447 if (size
<= 0xffffffff)
6448 sprintf (buf
, "%lx", (unsigned long) size
);
6450 sprintf_vma (buf
, size
);
6460 minfo ("%pB\n", section
->owner
);
6466 /* Handle a single orphan section S, placing the orphan into an appropriate
6467 output section. The effects of the --orphan-handling command line
6468 option are handled here. */
6471 ldlang_place_orphan (asection
*s
)
6473 if (config
.orphan_handling
== orphan_handling_discard
)
6475 lang_output_section_statement_type
*os
;
6476 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0,
6478 if (os
->addr_tree
== NULL
6479 && (bfd_link_relocatable (&link_info
)
6480 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6481 os
->addr_tree
= exp_intop (0);
6482 lang_add_section (&os
->children
, s
, NULL
, os
);
6486 lang_output_section_statement_type
*os
;
6487 const char *name
= s
->name
;
6490 if (config
.orphan_handling
== orphan_handling_error
)
6491 einfo (_("%X%P: error: unplaced orphan section `%pA' from `%pB'\n"),
6494 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
6495 constraint
= SPECIAL
;
6497 os
= ldemul_place_orphan (s
, name
, constraint
);
6500 os
= lang_output_section_statement_lookup (name
, constraint
, TRUE
);
6501 if (os
->addr_tree
== NULL
6502 && (bfd_link_relocatable (&link_info
)
6503 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6504 os
->addr_tree
= exp_intop (0);
6505 lang_add_section (&os
->children
, s
, NULL
, os
);
6508 if (config
.orphan_handling
== orphan_handling_warn
)
6509 einfo (_("%P: warning: orphan section `%pA' from `%pB' being "
6510 "placed in section `%s'\n"),
6511 s
, s
->owner
, os
->name
);
6515 /* Run through the input files and ensure that every input section has
6516 somewhere to go. If one is found without a destination then create
6517 an input request and place it into the statement tree. */
6520 lang_place_orphans (void)
6522 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6526 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6528 if (s
->output_section
== NULL
)
6530 /* This section of the file is not attached, root
6531 around for a sensible place for it to go. */
6533 if (file
->flags
.just_syms
)
6534 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6535 else if (lang_discard_section_p (s
))
6536 s
->output_section
= bfd_abs_section_ptr
;
6537 else if (strcmp (s
->name
, "COMMON") == 0)
6539 /* This is a lonely common section which must have
6540 come from an archive. We attach to the section
6541 with the wildcard. */
6542 if (!bfd_link_relocatable (&link_info
)
6543 || command_line
.force_common_definition
)
6545 if (default_common_section
== NULL
)
6546 default_common_section
6547 = lang_output_section_statement_lookup (".bss", 0,
6549 lang_add_section (&default_common_section
->children
, s
,
6550 NULL
, default_common_section
);
6554 ldlang_place_orphan (s
);
6561 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6563 flagword
*ptr_flags
;
6565 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6571 /* PR 17900: An exclamation mark in the attributes reverses
6572 the sense of any of the attributes that follow. */
6575 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6579 *ptr_flags
|= SEC_ALLOC
;
6583 *ptr_flags
|= SEC_READONLY
;
6587 *ptr_flags
|= SEC_DATA
;
6591 *ptr_flags
|= SEC_CODE
;
6596 *ptr_flags
|= SEC_LOAD
;
6600 einfo (_("%F%P: invalid character %c (%d) in flags\n"),
6608 /* Call a function on each input file. This function will be called
6609 on an archive, but not on the elements. */
6612 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6614 lang_input_statement_type
*f
;
6616 for (f
= &input_file_chain
.head
->input_statement
;
6618 f
= &f
->next_real_file
->input_statement
)
6622 /* Call a function on each file. The function will be called on all
6623 the elements of an archive which are included in the link, but will
6624 not be called on the archive file itself. */
6627 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6629 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6636 ldlang_add_file (lang_input_statement_type
*entry
)
6638 lang_statement_append (&file_chain
,
6639 (lang_statement_union_type
*) entry
,
6642 /* The BFD linker needs to have a list of all input BFDs involved in
6644 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
6645 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6647 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6648 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
6649 entry
->the_bfd
->usrdata
= entry
;
6650 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6652 /* Look through the sections and check for any which should not be
6653 included in the link. We need to do this now, so that we can
6654 notice when the backend linker tries to report multiple
6655 definition errors for symbols which are in sections we aren't
6656 going to link. FIXME: It might be better to entirely ignore
6657 symbols which are defined in sections which are going to be
6658 discarded. This would require modifying the backend linker for
6659 each backend which might set the SEC_LINK_ONCE flag. If we do
6660 this, we should probably handle SEC_EXCLUDE in the same way. */
6662 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6666 lang_add_output (const char *name
, int from_script
)
6668 /* Make -o on command line override OUTPUT in script. */
6669 if (!had_output_filename
|| !from_script
)
6671 output_filename
= name
;
6672 had_output_filename
= TRUE
;
6685 for (l
= 0; l
< 32; l
++)
6687 if (i
>= (unsigned int) x
)
6695 lang_output_section_statement_type
*
6696 lang_enter_output_section_statement (const char *output_section_statement_name
,
6697 etree_type
*address_exp
,
6698 enum section_type sectype
,
6700 etree_type
*subalign
,
6703 int align_with_input
)
6705 lang_output_section_statement_type
*os
;
6707 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6709 current_section
= os
;
6711 if (os
->addr_tree
== NULL
)
6713 os
->addr_tree
= address_exp
;
6715 os
->sectype
= sectype
;
6716 if (sectype
!= noload_section
)
6717 os
->flags
= SEC_NO_FLAGS
;
6719 os
->flags
= SEC_NEVER_LOAD
;
6720 os
->block_value
= 1;
6722 /* Make next things chain into subchain of this. */
6723 push_stat_ptr (&os
->children
);
6725 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6726 if (os
->align_lma_with_input
&& align
!= NULL
)
6727 einfo (_("%F%P:%pS: error: align with input and explicit align specified\n"),
6730 os
->subsection_alignment
=
6731 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6732 os
->section_alignment
=
6733 topower (exp_get_value_int (align
, -1, "section alignment"));
6735 os
->load_base
= ebase
;
6742 lang_output_statement_type
*new_stmt
;
6744 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6745 new_stmt
->name
= output_filename
;
6748 /* Reset the current counters in the regions. */
6751 lang_reset_memory_regions (void)
6753 lang_memory_region_type
*p
= lang_memory_region_list
;
6755 lang_output_section_statement_type
*os
;
6757 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6759 p
->current
= p
->origin
;
6763 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6767 os
->processed_vma
= FALSE
;
6768 os
->processed_lma
= FALSE
;
6771 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6773 /* Save the last size for possible use by bfd_relax_section. */
6774 o
->rawsize
= o
->size
;
6775 if (!(o
->flags
& SEC_FIXED_SIZE
))
6780 /* Worker for lang_gc_sections_1. */
6783 gc_section_callback (lang_wild_statement_type
*ptr
,
6784 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6786 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6787 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6788 void *data ATTRIBUTE_UNUSED
)
6790 /* If the wild pattern was marked KEEP, the member sections
6791 should be as well. */
6792 if (ptr
->keep_sections
)
6793 section
->flags
|= SEC_KEEP
;
6796 /* Iterate over sections marking them against GC. */
6799 lang_gc_sections_1 (lang_statement_union_type
*s
)
6801 for (; s
!= NULL
; s
= s
->header
.next
)
6803 switch (s
->header
.type
)
6805 case lang_wild_statement_enum
:
6806 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6808 case lang_constructors_statement_enum
:
6809 lang_gc_sections_1 (constructor_list
.head
);
6811 case lang_output_section_statement_enum
:
6812 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6814 case lang_group_statement_enum
:
6815 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6824 lang_gc_sections (void)
6826 /* Keep all sections so marked in the link script. */
6827 lang_gc_sections_1 (statement_list
.head
);
6829 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6830 the special case of debug info. (See bfd/stabs.c)
6831 Twiddle the flag here, to simplify later linker code. */
6832 if (bfd_link_relocatable (&link_info
))
6834 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6837 #ifdef ENABLE_PLUGINS
6838 if (f
->flags
.claimed
)
6841 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6842 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6843 sec
->flags
&= ~SEC_EXCLUDE
;
6847 if (link_info
.gc_sections
)
6848 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6851 /* Worker for lang_find_relro_sections_1. */
6854 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6855 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6857 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6858 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6861 /* Discarded, excluded and ignored sections effectively have zero
6863 if (section
->output_section
!= NULL
6864 && section
->output_section
->owner
== link_info
.output_bfd
6865 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6866 && !IGNORE_SECTION (section
)
6867 && section
->size
!= 0)
6869 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6870 *has_relro_section
= TRUE
;
6874 /* Iterate over sections for relro sections. */
6877 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6878 seg_align_type
*seg
,
6879 bfd_boolean
*has_relro_section
)
6881 if (*has_relro_section
)
6884 for (; s
!= NULL
; s
= s
->header
.next
)
6886 if (s
== seg
->relro_end_stat
)
6889 switch (s
->header
.type
)
6891 case lang_wild_statement_enum
:
6892 walk_wild (&s
->wild_statement
,
6893 find_relro_section_callback
,
6896 case lang_constructors_statement_enum
:
6897 lang_find_relro_sections_1 (constructor_list
.head
,
6898 seg
, has_relro_section
);
6900 case lang_output_section_statement_enum
:
6901 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6902 seg
, has_relro_section
);
6904 case lang_group_statement_enum
:
6905 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6906 seg
, has_relro_section
);
6915 lang_find_relro_sections (void)
6917 bfd_boolean has_relro_section
= FALSE
;
6919 /* Check all sections in the link script. */
6921 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6922 &expld
.dataseg
, &has_relro_section
);
6924 if (!has_relro_section
)
6925 link_info
.relro
= FALSE
;
6928 /* Relax all sections until bfd_relax_section gives up. */
6931 lang_relax_sections (bfd_boolean need_layout
)
6933 if (RELAXATION_ENABLED
)
6935 /* We may need more than one relaxation pass. */
6936 int i
= link_info
.relax_pass
;
6938 /* The backend can use it to determine the current pass. */
6939 link_info
.relax_pass
= 0;
6943 /* Keep relaxing until bfd_relax_section gives up. */
6944 bfd_boolean relax_again
;
6946 link_info
.relax_trip
= -1;
6949 link_info
.relax_trip
++;
6951 /* Note: pe-dll.c does something like this also. If you find
6952 you need to change this code, you probably need to change
6953 pe-dll.c also. DJ */
6955 /* Do all the assignments with our current guesses as to
6957 lang_do_assignments (lang_assigning_phase_enum
);
6959 /* We must do this after lang_do_assignments, because it uses
6961 lang_reset_memory_regions ();
6963 /* Perform another relax pass - this time we know where the
6964 globals are, so can make a better guess. */
6965 relax_again
= FALSE
;
6966 lang_size_sections (&relax_again
, FALSE
);
6968 while (relax_again
);
6970 link_info
.relax_pass
++;
6977 /* Final extra sizing to report errors. */
6978 lang_do_assignments (lang_assigning_phase_enum
);
6979 lang_reset_memory_regions ();
6980 lang_size_sections (NULL
, TRUE
);
6984 #ifdef ENABLE_PLUGINS
6985 /* Find the insert point for the plugin's replacement files. We
6986 place them after the first claimed real object file, or if the
6987 first claimed object is an archive member, after the last real
6988 object file immediately preceding the archive. In the event
6989 no objects have been claimed at all, we return the first dummy
6990 object file on the list as the insert point; that works, but
6991 the callee must be careful when relinking the file_chain as it
6992 is not actually on that chain, only the statement_list and the
6993 input_file list; in that case, the replacement files must be
6994 inserted at the head of the file_chain. */
6996 static lang_input_statement_type
*
6997 find_replacements_insert_point (void)
6999 lang_input_statement_type
*claim1
, *lastobject
;
7000 lastobject
= &input_file_chain
.head
->input_statement
;
7001 for (claim1
= &file_chain
.head
->input_statement
;
7003 claim1
= &claim1
->next
->input_statement
)
7005 if (claim1
->flags
.claimed
)
7006 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
7007 /* Update lastobject if this is a real object file. */
7008 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
7009 lastobject
= claim1
;
7011 /* No files were claimed by the plugin. Choose the last object
7012 file found on the list (maybe the first, dummy entry) as the
7017 /* Find where to insert ADD, an archive element or shared library
7018 added during a rescan. */
7020 static lang_statement_union_type
**
7021 find_rescan_insertion (lang_input_statement_type
*add
)
7023 bfd
*add_bfd
= add
->the_bfd
;
7024 lang_input_statement_type
*f
;
7025 lang_input_statement_type
*last_loaded
= NULL
;
7026 lang_input_statement_type
*before
= NULL
;
7027 lang_statement_union_type
**iter
= NULL
;
7029 if (add_bfd
->my_archive
!= NULL
)
7030 add_bfd
= add_bfd
->my_archive
;
7032 /* First look through the input file chain, to find an object file
7033 before the one we've rescanned. Normal object files always
7034 appear on both the input file chain and the file chain, so this
7035 lets us get quickly to somewhere near the correct place on the
7036 file chain if it is full of archive elements. Archives don't
7037 appear on the file chain, but if an element has been extracted
7038 then their input_statement->next points at it. */
7039 for (f
= &input_file_chain
.head
->input_statement
;
7041 f
= &f
->next_real_file
->input_statement
)
7043 if (f
->the_bfd
== add_bfd
)
7045 before
= last_loaded
;
7046 if (f
->next
!= NULL
)
7047 return &f
->next
->input_statement
.next
;
7049 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7053 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7055 iter
= &(*iter
)->input_statement
.next
)
7056 if (!(*iter
)->input_statement
.flags
.claim_archive
7057 && (*iter
)->input_statement
.the_bfd
->my_archive
== NULL
)
7063 /* Insert SRCLIST into DESTLIST after given element by chaining
7064 on FIELD as the next-pointer. (Counterintuitively does not need
7065 a pointer to the actual after-node itself, just its chain field.) */
7068 lang_list_insert_after (lang_statement_list_type
*destlist
,
7069 lang_statement_list_type
*srclist
,
7070 lang_statement_union_type
**field
)
7072 *(srclist
->tail
) = *field
;
7073 *field
= srclist
->head
;
7074 if (destlist
->tail
== field
)
7075 destlist
->tail
= srclist
->tail
;
7078 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7079 was taken as a copy of it and leave them in ORIGLIST. */
7082 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7083 lang_statement_list_type
*origlist
)
7085 union lang_statement_union
**savetail
;
7086 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7087 ASSERT (origlist
->head
== destlist
->head
);
7088 savetail
= origlist
->tail
;
7089 origlist
->head
= *(savetail
);
7090 origlist
->tail
= destlist
->tail
;
7091 destlist
->tail
= savetail
;
7094 #endif /* ENABLE_PLUGINS */
7096 /* Add NAME to the list of garbage collection entry points. */
7099 lang_add_gc_name (const char *name
)
7101 struct bfd_sym_chain
*sym
;
7106 sym
= (struct bfd_sym_chain
*) stat_alloc (sizeof (*sym
));
7108 sym
->next
= link_info
.gc_sym_list
;
7110 link_info
.gc_sym_list
= sym
;
7113 /* Check relocations. */
7116 lang_check_relocs (void)
7118 if (link_info
.check_relocs_after_open_input
)
7122 for (abfd
= link_info
.input_bfds
;
7123 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7124 if (!bfd_link_check_relocs (abfd
, &link_info
))
7126 /* No object output, fail return. */
7127 config
.make_executable
= FALSE
;
7128 /* Note: we do not abort the loop, but rather
7129 continue the scan in case there are other
7130 bad relocations to report. */
7135 /* Look through all output sections looking for places where we can
7136 propagate forward the lma region. */
7139 lang_propagate_lma_regions (void)
7141 lang_output_section_statement_type
*os
;
7143 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7147 if (os
->prev
!= NULL
7148 && os
->lma_region
== NULL
7149 && os
->load_base
== NULL
7150 && os
->addr_tree
== NULL
7151 && os
->region
== os
->prev
->region
)
7152 os
->lma_region
= os
->prev
->lma_region
;
7159 /* Finalize dynamic list. */
7160 if (link_info
.dynamic_list
)
7161 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
7163 current_target
= default_target
;
7165 /* Open the output file. */
7166 lang_for_each_statement (ldlang_open_output
);
7169 ldemul_create_output_section_statements ();
7171 /* Add to the hash table all undefineds on the command line. */
7172 lang_place_undefineds ();
7174 if (!bfd_section_already_linked_table_init ())
7175 einfo (_("%F%P: can not create hash table: %E\n"));
7177 /* Create a bfd for each input file. */
7178 current_target
= default_target
;
7179 lang_statement_iteration
++;
7180 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
7182 #ifdef ENABLE_PLUGINS
7183 if (link_info
.lto_plugin_active
)
7185 lang_statement_list_type added
;
7186 lang_statement_list_type files
, inputfiles
;
7188 /* Now all files are read, let the plugin(s) decide if there
7189 are any more to be added to the link before we call the
7190 emulation's after_open hook. We create a private list of
7191 input statements for this purpose, which we will eventually
7192 insert into the global statement list after the first claimed
7195 /* We need to manipulate all three chains in synchrony. */
7197 inputfiles
= input_file_chain
;
7198 if (plugin_call_all_symbols_read ())
7199 einfo (_("%F%P: %s: plugin reported error after all symbols read\n"),
7200 plugin_error_plugin ());
7201 /* Open any newly added files, updating the file chains. */
7202 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
7203 /* Restore the global list pointer now they have all been added. */
7204 lang_list_remove_tail (stat_ptr
, &added
);
7205 /* And detach the fresh ends of the file lists. */
7206 lang_list_remove_tail (&file_chain
, &files
);
7207 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
7208 /* Were any new files added? */
7209 if (added
.head
!= NULL
)
7211 /* If so, we will insert them into the statement list immediately
7212 after the first input file that was claimed by the plugin. */
7213 plugin_insert
= find_replacements_insert_point ();
7214 /* If a plugin adds input files without having claimed any, we
7215 don't really have a good idea where to place them. Just putting
7216 them at the start or end of the list is liable to leave them
7217 outside the crtbegin...crtend range. */
7218 ASSERT (plugin_insert
!= NULL
);
7219 /* Splice the new statement list into the old one. */
7220 lang_list_insert_after (stat_ptr
, &added
,
7221 &plugin_insert
->header
.next
);
7222 /* Likewise for the file chains. */
7223 lang_list_insert_after (&input_file_chain
, &inputfiles
,
7224 &plugin_insert
->next_real_file
);
7225 /* We must be careful when relinking file_chain; we may need to
7226 insert the new files at the head of the list if the insert
7227 point chosen is the dummy first input file. */
7228 if (plugin_insert
->filename
)
7229 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
7231 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
7233 /* Rescan archives in case new undefined symbols have appeared. */
7235 lang_statement_iteration
++;
7236 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
7237 lang_list_remove_tail (&file_chain
, &files
);
7238 while (files
.head
!= NULL
)
7240 lang_statement_union_type
**insert
;
7241 lang_statement_union_type
**iter
, *temp
;
7244 insert
= find_rescan_insertion (&files
.head
->input_statement
);
7245 /* All elements from an archive can be added at once. */
7246 iter
= &files
.head
->input_statement
.next
;
7247 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
7248 if (my_arch
!= NULL
)
7249 for (; *iter
!= NULL
; iter
= &(*iter
)->input_statement
.next
)
7250 if ((*iter
)->input_statement
.the_bfd
->my_archive
!= my_arch
)
7253 *insert
= files
.head
;
7256 if (my_arch
!= NULL
)
7258 lang_input_statement_type
*parent
= my_arch
->usrdata
;
7260 parent
->next
= (lang_statement_union_type
*)
7262 - offsetof (lang_input_statement_type
, next
));
7267 #endif /* ENABLE_PLUGINS */
7269 /* Make sure that nobody has tried to add a symbol to this list
7271 ASSERT (link_info
.gc_sym_list
== NULL
);
7273 link_info
.gc_sym_list
= &entry_symbol
;
7275 if (entry_symbol
.name
== NULL
)
7277 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
7279 /* entry_symbol is normally initialied by a ENTRY definition in the
7280 linker script or the -e command line option. But if neither of
7281 these have been used, the target specific backend may still have
7282 provided an entry symbol via a call to lang_default_entry().
7283 Unfortunately this value will not be processed until lang_end()
7284 is called, long after this function has finished. So detect this
7285 case here and add the target's entry symbol to the list of starting
7286 points for garbage collection resolution. */
7287 lang_add_gc_name (entry_symbol_default
);
7290 lang_add_gc_name (link_info
.init_function
);
7291 lang_add_gc_name (link_info
.fini_function
);
7293 ldemul_after_open ();
7294 if (config
.map_file
!= NULL
)
7295 lang_print_asneeded ();
7297 bfd_section_already_linked_table_free ();
7299 /* Make sure that we're not mixing architectures. We call this
7300 after all the input files have been opened, but before we do any
7301 other processing, so that any operations merge_private_bfd_data
7302 does on the output file will be known during the rest of the
7306 /* Handle .exports instead of a version script if we're told to do so. */
7307 if (command_line
.version_exports_section
)
7308 lang_do_version_exports_section ();
7310 /* Build all sets based on the information gathered from the input
7312 ldctor_build_sets ();
7314 /* Give initial values for __start and __stop symbols, so that ELF
7315 gc_sections will keep sections referenced by these symbols. Must
7316 be done before lang_do_assignments below. */
7317 if (config
.build_constructors
)
7318 lang_init_start_stop ();
7320 /* PR 13683: We must rerun the assignments prior to running garbage
7321 collection in order to make sure that all symbol aliases are resolved. */
7322 lang_do_assignments (lang_mark_phase_enum
);
7324 lang_do_memory_regions();
7325 expld
.phase
= lang_first_phase_enum
;
7327 /* Size up the common data. */
7330 /* Remove unreferenced sections if asked to. */
7331 lang_gc_sections ();
7333 /* Check relocations. */
7334 lang_check_relocs ();
7336 ldemul_after_check_relocs ();
7338 /* Update wild statements. */
7339 update_wild_statements (statement_list
.head
);
7341 /* Run through the contours of the script and attach input sections
7342 to the correct output sections. */
7343 lang_statement_iteration
++;
7344 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
7346 process_insert_statements ();
7348 /* Find any sections not attached explicitly and handle them. */
7349 lang_place_orphans ();
7351 if (!bfd_link_relocatable (&link_info
))
7355 /* Merge SEC_MERGE sections. This has to be done after GC of
7356 sections, so that GCed sections are not merged, but before
7357 assigning dynamic symbols, since removing whole input sections
7359 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
7361 /* Look for a text section and set the readonly attribute in it. */
7362 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
7366 if (config
.text_read_only
)
7367 found
->flags
|= SEC_READONLY
;
7369 found
->flags
&= ~SEC_READONLY
;
7373 /* Copy forward lma regions for output sections in same lma region. */
7374 lang_propagate_lma_regions ();
7376 /* Defining __start/__stop symbols early for --gc-sections to work
7377 around a glibc build problem can result in these symbols being
7378 defined when they should not be. Fix them now. */
7379 if (config
.build_constructors
)
7380 lang_undef_start_stop ();
7382 /* Define .startof./.sizeof. symbols with preliminary values before
7383 dynamic symbols are created. */
7384 if (!bfd_link_relocatable (&link_info
))
7385 lang_init_startof_sizeof ();
7387 /* Do anything special before sizing sections. This is where ELF
7388 and other back-ends size dynamic sections. */
7389 ldemul_before_allocation ();
7391 /* We must record the program headers before we try to fix the
7392 section positions, since they will affect SIZEOF_HEADERS. */
7393 lang_record_phdrs ();
7395 /* Check relro sections. */
7396 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
7397 lang_find_relro_sections ();
7399 /* Size up the sections. */
7400 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
7402 /* See if anything special should be done now we know how big
7403 everything is. This is where relaxation is done. */
7404 ldemul_after_allocation ();
7406 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
7407 lang_finalize_start_stop ();
7409 /* Do all the assignments, now that we know the final resting places
7410 of all the symbols. */
7411 lang_do_assignments (lang_final_phase_enum
);
7415 /* Convert absolute symbols to section relative. */
7416 ldexp_finalize_syms ();
7418 /* Make sure that the section addresses make sense. */
7419 if (command_line
.check_section_addresses
)
7420 lang_check_section_addresses ();
7422 /* Check any required symbols are known. */
7423 ldlang_check_require_defined_symbols ();
7428 /* EXPORTED TO YACC */
7431 lang_add_wild (struct wildcard_spec
*filespec
,
7432 struct wildcard_list
*section_list
,
7433 bfd_boolean keep_sections
)
7435 struct wildcard_list
*curr
, *next
;
7436 lang_wild_statement_type
*new_stmt
;
7438 /* Reverse the list as the parser puts it back to front. */
7439 for (curr
= section_list
, section_list
= NULL
;
7441 section_list
= curr
, curr
= next
)
7444 curr
->next
= section_list
;
7447 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
7449 if (strcmp (filespec
->name
, "*") == 0)
7450 filespec
->name
= NULL
;
7451 else if (!wildcardp (filespec
->name
))
7452 lang_has_input_file
= TRUE
;
7455 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
7456 new_stmt
->filename
= NULL
;
7457 new_stmt
->filenames_sorted
= FALSE
;
7458 new_stmt
->section_flag_list
= NULL
;
7459 new_stmt
->exclude_name_list
= NULL
;
7460 if (filespec
!= NULL
)
7462 new_stmt
->filename
= filespec
->name
;
7463 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
7464 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
7465 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
7467 new_stmt
->section_list
= section_list
;
7468 new_stmt
->keep_sections
= keep_sections
;
7469 lang_list_init (&new_stmt
->children
);
7470 analyze_walk_wild_section_handler (new_stmt
);
7474 lang_section_start (const char *name
, etree_type
*address
,
7475 const segment_type
*segment
)
7477 lang_address_statement_type
*ad
;
7479 ad
= new_stat (lang_address_statement
, stat_ptr
);
7480 ad
->section_name
= name
;
7481 ad
->address
= address
;
7482 ad
->segment
= segment
;
7485 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7486 because of a -e argument on the command line, or zero if this is
7487 called by ENTRY in a linker script. Command line arguments take
7491 lang_add_entry (const char *name
, bfd_boolean cmdline
)
7493 if (entry_symbol
.name
== NULL
7495 || !entry_from_cmdline
)
7497 entry_symbol
.name
= name
;
7498 entry_from_cmdline
= cmdline
;
7502 /* Set the default start symbol to NAME. .em files should use this,
7503 not lang_add_entry, to override the use of "start" if neither the
7504 linker script nor the command line specifies an entry point. NAME
7505 must be permanently allocated. */
7507 lang_default_entry (const char *name
)
7509 entry_symbol_default
= name
;
7513 lang_add_target (const char *name
)
7515 lang_target_statement_type
*new_stmt
;
7517 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
7518 new_stmt
->target
= name
;
7522 lang_add_map (const char *name
)
7529 map_option_f
= TRUE
;
7537 lang_add_fill (fill_type
*fill
)
7539 lang_fill_statement_type
*new_stmt
;
7541 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
7542 new_stmt
->fill
= fill
;
7546 lang_add_data (int type
, union etree_union
*exp
)
7548 lang_data_statement_type
*new_stmt
;
7550 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
7551 new_stmt
->exp
= exp
;
7552 new_stmt
->type
= type
;
7555 /* Create a new reloc statement. RELOC is the BFD relocation type to
7556 generate. HOWTO is the corresponding howto structure (we could
7557 look this up, but the caller has already done so). SECTION is the
7558 section to generate a reloc against, or NAME is the name of the
7559 symbol to generate a reloc against. Exactly one of SECTION and
7560 NAME must be NULL. ADDEND is an expression for the addend. */
7563 lang_add_reloc (bfd_reloc_code_real_type reloc
,
7564 reloc_howto_type
*howto
,
7567 union etree_union
*addend
)
7569 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
7573 p
->section
= section
;
7575 p
->addend_exp
= addend
;
7577 p
->addend_value
= 0;
7578 p
->output_section
= NULL
;
7579 p
->output_offset
= 0;
7582 lang_assignment_statement_type
*
7583 lang_add_assignment (etree_type
*exp
)
7585 lang_assignment_statement_type
*new_stmt
;
7587 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
7588 new_stmt
->exp
= exp
;
7593 lang_add_attribute (enum statement_enum attribute
)
7595 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
7599 lang_startup (const char *name
)
7601 if (first_file
->filename
!= NULL
)
7603 einfo (_("%F%P: multiple STARTUP files\n"));
7605 first_file
->filename
= name
;
7606 first_file
->local_sym_name
= name
;
7607 first_file
->flags
.real
= TRUE
;
7611 lang_float (bfd_boolean maybe
)
7613 lang_float_flag
= maybe
;
7617 /* Work out the load- and run-time regions from a script statement, and
7618 store them in *LMA_REGION and *REGION respectively.
7620 MEMSPEC is the name of the run-time region, or the value of
7621 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7622 LMA_MEMSPEC is the name of the load-time region, or null if the
7623 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7624 had an explicit load address.
7626 It is an error to specify both a load region and a load address. */
7629 lang_get_regions (lang_memory_region_type
**region
,
7630 lang_memory_region_type
**lma_region
,
7631 const char *memspec
,
7632 const char *lma_memspec
,
7633 bfd_boolean have_lma
,
7634 bfd_boolean have_vma
)
7636 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7638 /* If no runtime region or VMA has been specified, but the load region
7639 has been specified, then use the load region for the runtime region
7641 if (lma_memspec
!= NULL
7643 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7644 *region
= *lma_region
;
7646 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7648 if (have_lma
&& lma_memspec
!= 0)
7649 einfo (_("%X%P:%pS: section has both a load address and a load region\n"),
7654 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7655 lang_output_section_phdr_list
*phdrs
,
7656 const char *lma_memspec
)
7658 lang_get_regions (¤t_section
->region
,
7659 ¤t_section
->lma_region
,
7660 memspec
, lma_memspec
,
7661 current_section
->load_base
!= NULL
,
7662 current_section
->addr_tree
!= NULL
);
7664 current_section
->fill
= fill
;
7665 current_section
->phdrs
= phdrs
;
7670 lang_statement_append (lang_statement_list_type
*list
,
7671 lang_statement_union_type
*element
,
7672 lang_statement_union_type
**field
)
7674 *(list
->tail
) = element
;
7678 /* Set the output format type. -oformat overrides scripts. */
7681 lang_add_output_format (const char *format
,
7686 if (output_target
== NULL
|| !from_script
)
7688 if (command_line
.endian
== ENDIAN_BIG
7691 else if (command_line
.endian
== ENDIAN_LITTLE
7695 output_target
= format
;
7700 lang_add_insert (const char *where
, int is_before
)
7702 lang_insert_statement_type
*new_stmt
;
7704 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7705 new_stmt
->where
= where
;
7706 new_stmt
->is_before
= is_before
;
7707 saved_script_handle
= previous_script_handle
;
7710 /* Enter a group. This creates a new lang_group_statement, and sets
7711 stat_ptr to build new statements within the group. */
7714 lang_enter_group (void)
7716 lang_group_statement_type
*g
;
7718 g
= new_stat (lang_group_statement
, stat_ptr
);
7719 lang_list_init (&g
->children
);
7720 push_stat_ptr (&g
->children
);
7723 /* Leave a group. This just resets stat_ptr to start writing to the
7724 regular list of statements again. Note that this will not work if
7725 groups can occur inside anything else which can adjust stat_ptr,
7726 but currently they can't. */
7729 lang_leave_group (void)
7734 /* Add a new program header. This is called for each entry in a PHDRS
7735 command in a linker script. */
7738 lang_new_phdr (const char *name
,
7740 bfd_boolean filehdr
,
7745 struct lang_phdr
*n
, **pp
;
7748 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7751 n
->type
= exp_get_value_int (type
, 0, "program header type");
7752 n
->filehdr
= filehdr
;
7757 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7759 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7762 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7764 einfo (_("%X%P:%pS: PHDRS and FILEHDR are not supported"
7765 " when prior PT_LOAD headers lack them\n"), NULL
);
7772 /* Record the program header information in the output BFD. FIXME: We
7773 should not be calling an ELF specific function here. */
7776 lang_record_phdrs (void)
7780 lang_output_section_phdr_list
*last
;
7781 struct lang_phdr
*l
;
7782 lang_output_section_statement_type
*os
;
7785 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7788 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7795 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7799 lang_output_section_phdr_list
*pl
;
7801 if (os
->constraint
< 0)
7809 if (os
->sectype
== noload_section
7810 || os
->bfd_section
== NULL
7811 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7814 /* Don't add orphans to PT_INTERP header. */
7820 lang_output_section_statement_type
*tmp_os
;
7822 /* If we have not run across a section with a program
7823 header assigned to it yet, then scan forwards to find
7824 one. This prevents inconsistencies in the linker's
7825 behaviour when a script has specified just a single
7826 header and there are sections in that script which are
7827 not assigned to it, and which occur before the first
7828 use of that header. See here for more details:
7829 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7830 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7833 last
= tmp_os
->phdrs
;
7837 einfo (_("%F%P: no sections assigned to phdrs\n"));
7842 if (os
->bfd_section
== NULL
)
7845 for (; pl
!= NULL
; pl
= pl
->next
)
7847 if (strcmp (pl
->name
, l
->name
) == 0)
7852 secs
= (asection
**) xrealloc (secs
,
7853 alc
* sizeof (asection
*));
7855 secs
[c
] = os
->bfd_section
;
7862 if (l
->flags
== NULL
)
7865 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7870 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7872 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7873 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7874 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7875 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7880 /* Make sure all the phdr assignments succeeded. */
7881 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7885 lang_output_section_phdr_list
*pl
;
7887 if (os
->constraint
< 0
7888 || os
->bfd_section
== NULL
)
7891 for (pl
= os
->phdrs
;
7894 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7895 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7896 os
->name
, pl
->name
);
7900 /* Record a list of sections which may not be cross referenced. */
7903 lang_add_nocrossref (lang_nocrossref_type
*l
)
7905 struct lang_nocrossrefs
*n
;
7907 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7908 n
->next
= nocrossref_list
;
7910 n
->onlyfirst
= FALSE
;
7911 nocrossref_list
= n
;
7913 /* Set notice_all so that we get informed about all symbols. */
7914 link_info
.notice_all
= TRUE
;
7917 /* Record a section that cannot be referenced from a list of sections. */
7920 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
7922 lang_add_nocrossref (l
);
7923 nocrossref_list
->onlyfirst
= TRUE
;
7926 /* Overlay handling. We handle overlays with some static variables. */
7928 /* The overlay virtual address. */
7929 static etree_type
*overlay_vma
;
7930 /* And subsection alignment. */
7931 static etree_type
*overlay_subalign
;
7933 /* An expression for the maximum section size seen so far. */
7934 static etree_type
*overlay_max
;
7936 /* A list of all the sections in this overlay. */
7938 struct overlay_list
{
7939 struct overlay_list
*next
;
7940 lang_output_section_statement_type
*os
;
7943 static struct overlay_list
*overlay_list
;
7945 /* Start handling an overlay. */
7948 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7950 /* The grammar should prevent nested overlays from occurring. */
7951 ASSERT (overlay_vma
== NULL
7952 && overlay_subalign
== NULL
7953 && overlay_max
== NULL
);
7955 overlay_vma
= vma_expr
;
7956 overlay_subalign
= subalign
;
7959 /* Start a section in an overlay. We handle this by calling
7960 lang_enter_output_section_statement with the correct VMA.
7961 lang_leave_overlay sets up the LMA and memory regions. */
7964 lang_enter_overlay_section (const char *name
)
7966 struct overlay_list
*n
;
7969 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7970 0, overlay_subalign
, 0, 0, 0);
7972 /* If this is the first section, then base the VMA of future
7973 sections on this one. This will work correctly even if `.' is
7974 used in the addresses. */
7975 if (overlay_list
== NULL
)
7976 overlay_vma
= exp_nameop (ADDR
, name
);
7978 /* Remember the section. */
7979 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7980 n
->os
= current_section
;
7981 n
->next
= overlay_list
;
7984 size
= exp_nameop (SIZEOF
, name
);
7986 /* Arrange to work out the maximum section end address. */
7987 if (overlay_max
== NULL
)
7990 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7993 /* Finish a section in an overlay. There isn't any special to do
7997 lang_leave_overlay_section (fill_type
*fill
,
7998 lang_output_section_phdr_list
*phdrs
)
8005 name
= current_section
->name
;
8007 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
8008 region and that no load-time region has been specified. It doesn't
8009 really matter what we say here, since lang_leave_overlay will
8011 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
8013 /* Define the magic symbols. */
8015 clean
= (char *) xmalloc (strlen (name
) + 1);
8017 for (s1
= name
; *s1
!= '\0'; s1
++)
8018 if (ISALNUM (*s1
) || *s1
== '_')
8022 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8023 sprintf (buf
, "__load_start_%s", clean
);
8024 lang_add_assignment (exp_provide (buf
,
8025 exp_nameop (LOADADDR
, name
),
8028 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8029 sprintf (buf
, "__load_stop_%s", clean
);
8030 lang_add_assignment (exp_provide (buf
,
8032 exp_nameop (LOADADDR
, name
),
8033 exp_nameop (SIZEOF
, name
)),
8039 /* Finish an overlay. If there are any overlay wide settings, this
8040 looks through all the sections in the overlay and sets them. */
8043 lang_leave_overlay (etree_type
*lma_expr
,
8046 const char *memspec
,
8047 lang_output_section_phdr_list
*phdrs
,
8048 const char *lma_memspec
)
8050 lang_memory_region_type
*region
;
8051 lang_memory_region_type
*lma_region
;
8052 struct overlay_list
*l
;
8053 lang_nocrossref_type
*nocrossref
;
8055 lang_get_regions (®ion
, &lma_region
,
8056 memspec
, lma_memspec
,
8057 lma_expr
!= NULL
, FALSE
);
8061 /* After setting the size of the last section, set '.' to end of the
8063 if (overlay_list
!= NULL
)
8065 overlay_list
->os
->update_dot
= 1;
8066 overlay_list
->os
->update_dot_tree
8067 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
8073 struct overlay_list
*next
;
8075 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8078 l
->os
->region
= region
;
8079 l
->os
->lma_region
= lma_region
;
8081 /* The first section has the load address specified in the
8082 OVERLAY statement. The rest are worked out from that.
8083 The base address is not needed (and should be null) if
8084 an LMA region was specified. */
8087 l
->os
->load_base
= lma_expr
;
8088 l
->os
->sectype
= normal_section
;
8090 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
8091 l
->os
->phdrs
= phdrs
;
8095 lang_nocrossref_type
*nc
;
8097 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
8098 nc
->name
= l
->os
->name
;
8099 nc
->next
= nocrossref
;
8108 if (nocrossref
!= NULL
)
8109 lang_add_nocrossref (nocrossref
);
8112 overlay_list
= NULL
;
8114 overlay_subalign
= NULL
;
8117 /* Version handling. This is only useful for ELF. */
8119 /* If PREV is NULL, return first version pattern matching particular symbol.
8120 If PREV is non-NULL, return first version pattern matching particular
8121 symbol after PREV (previously returned by lang_vers_match). */
8123 static struct bfd_elf_version_expr
*
8124 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
8125 struct bfd_elf_version_expr
*prev
,
8129 const char *cxx_sym
= sym
;
8130 const char *java_sym
= sym
;
8131 struct bfd_elf_version_expr
*expr
= NULL
;
8132 enum demangling_styles curr_style
;
8134 curr_style
= CURRENT_DEMANGLING_STYLE
;
8135 cplus_demangle_set_style (no_demangling
);
8136 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
8139 cplus_demangle_set_style (curr_style
);
8141 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8143 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
8144 DMGL_PARAMS
| DMGL_ANSI
);
8148 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8150 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
8155 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
8157 struct bfd_elf_version_expr e
;
8159 switch (prev
? prev
->mask
: 0)
8162 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
8165 expr
= (struct bfd_elf_version_expr
*)
8166 htab_find ((htab_t
) head
->htab
, &e
);
8167 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
8168 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
8174 case BFD_ELF_VERSION_C_TYPE
:
8175 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8177 e
.pattern
= cxx_sym
;
8178 expr
= (struct bfd_elf_version_expr
*)
8179 htab_find ((htab_t
) head
->htab
, &e
);
8180 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
8181 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8187 case BFD_ELF_VERSION_CXX_TYPE
:
8188 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8190 e
.pattern
= java_sym
;
8191 expr
= (struct bfd_elf_version_expr
*)
8192 htab_find ((htab_t
) head
->htab
, &e
);
8193 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
8194 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8205 /* Finally, try the wildcards. */
8206 if (prev
== NULL
|| prev
->literal
)
8207 expr
= head
->remaining
;
8210 for (; expr
; expr
= expr
->next
)
8217 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
8220 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8222 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8226 if (fnmatch (expr
->pattern
, s
, 0) == 0)
8232 free ((char *) c_sym
);
8234 free ((char *) cxx_sym
);
8235 if (java_sym
!= sym
)
8236 free ((char *) java_sym
);
8240 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
8241 return a pointer to the symbol name with any backslash quotes removed. */
8244 realsymbol (const char *pattern
)
8247 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
8248 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
8250 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
8252 /* It is a glob pattern only if there is no preceding
8256 /* Remove the preceding backslash. */
8263 if (*p
== '?' || *p
== '*' || *p
== '[')
8270 backslash
= *p
== '\\';
8286 /* This is called for each variable name or match expression. NEW_NAME is
8287 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
8288 pattern to be matched against symbol names. */
8290 struct bfd_elf_version_expr
*
8291 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
8292 const char *new_name
,
8294 bfd_boolean literal_p
)
8296 struct bfd_elf_version_expr
*ret
;
8298 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
8302 ret
->literal
= TRUE
;
8303 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
8304 if (ret
->pattern
== NULL
)
8306 ret
->pattern
= new_name
;
8307 ret
->literal
= FALSE
;
8310 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
8311 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8312 else if (strcasecmp (lang
, "C++") == 0)
8313 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
8314 else if (strcasecmp (lang
, "Java") == 0)
8315 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
8318 einfo (_("%X%P: unknown language `%s' in version information\n"),
8320 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8323 return ldemul_new_vers_pattern (ret
);
8326 /* This is called for each set of variable names and match
8329 struct bfd_elf_version_tree
*
8330 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
8331 struct bfd_elf_version_expr
*locals
)
8333 struct bfd_elf_version_tree
*ret
;
8335 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
8336 ret
->globals
.list
= globals
;
8337 ret
->locals
.list
= locals
;
8338 ret
->match
= lang_vers_match
;
8339 ret
->name_indx
= (unsigned int) -1;
8343 /* This static variable keeps track of version indices. */
8345 static int version_index
;
8348 version_expr_head_hash (const void *p
)
8350 const struct bfd_elf_version_expr
*e
=
8351 (const struct bfd_elf_version_expr
*) p
;
8353 return htab_hash_string (e
->pattern
);
8357 version_expr_head_eq (const void *p1
, const void *p2
)
8359 const struct bfd_elf_version_expr
*e1
=
8360 (const struct bfd_elf_version_expr
*) p1
;
8361 const struct bfd_elf_version_expr
*e2
=
8362 (const struct bfd_elf_version_expr
*) p2
;
8364 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
8368 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
8371 struct bfd_elf_version_expr
*e
, *next
;
8372 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
8374 for (e
= head
->list
; e
; e
= e
->next
)
8378 head
->mask
|= e
->mask
;
8383 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
8384 version_expr_head_eq
, NULL
);
8385 list_loc
= &head
->list
;
8386 remaining_loc
= &head
->remaining
;
8387 for (e
= head
->list
; e
; e
= next
)
8393 remaining_loc
= &e
->next
;
8397 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
8401 struct bfd_elf_version_expr
*e1
, *last
;
8403 e1
= (struct bfd_elf_version_expr
*) *loc
;
8407 if (e1
->mask
== e
->mask
)
8415 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
8419 /* This is a duplicate. */
8420 /* FIXME: Memory leak. Sometimes pattern is not
8421 xmalloced alone, but in larger chunk of memory. */
8422 /* free (e->pattern); */
8427 e
->next
= last
->next
;
8435 list_loc
= &e
->next
;
8439 *remaining_loc
= NULL
;
8440 *list_loc
= head
->remaining
;
8443 head
->remaining
= head
->list
;
8446 /* This is called when we know the name and dependencies of the
8450 lang_register_vers_node (const char *name
,
8451 struct bfd_elf_version_tree
*version
,
8452 struct bfd_elf_version_deps
*deps
)
8454 struct bfd_elf_version_tree
*t
, **pp
;
8455 struct bfd_elf_version_expr
*e1
;
8460 if (link_info
.version_info
!= NULL
8461 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
8463 einfo (_("%X%P: anonymous version tag cannot be combined"
8464 " with other version tags\n"));
8469 /* Make sure this node has a unique name. */
8470 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8471 if (strcmp (t
->name
, name
) == 0)
8472 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
8474 lang_finalize_version_expr_head (&version
->globals
);
8475 lang_finalize_version_expr_head (&version
->locals
);
8477 /* Check the global and local match names, and make sure there
8478 aren't any duplicates. */
8480 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
8482 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8484 struct bfd_elf_version_expr
*e2
;
8486 if (t
->locals
.htab
&& e1
->literal
)
8488 e2
= (struct bfd_elf_version_expr
*)
8489 htab_find ((htab_t
) t
->locals
.htab
, e1
);
8490 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8492 if (e1
->mask
== e2
->mask
)
8493 einfo (_("%X%P: duplicate expression `%s'"
8494 " in version information\n"), e1
->pattern
);
8498 else if (!e1
->literal
)
8499 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8500 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8501 && e1
->mask
== e2
->mask
)
8502 einfo (_("%X%P: duplicate expression `%s'"
8503 " in version information\n"), e1
->pattern
);
8507 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
8509 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8511 struct bfd_elf_version_expr
*e2
;
8513 if (t
->globals
.htab
&& e1
->literal
)
8515 e2
= (struct bfd_elf_version_expr
*)
8516 htab_find ((htab_t
) t
->globals
.htab
, e1
);
8517 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8519 if (e1
->mask
== e2
->mask
)
8520 einfo (_("%X%P: duplicate expression `%s'"
8521 " in version information\n"),
8526 else if (!e1
->literal
)
8527 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8528 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8529 && e1
->mask
== e2
->mask
)
8530 einfo (_("%X%P: duplicate expression `%s'"
8531 " in version information\n"), e1
->pattern
);
8535 version
->deps
= deps
;
8536 version
->name
= name
;
8537 if (name
[0] != '\0')
8540 version
->vernum
= version_index
;
8543 version
->vernum
= 0;
8545 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8550 /* This is called when we see a version dependency. */
8552 struct bfd_elf_version_deps
*
8553 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
8555 struct bfd_elf_version_deps
*ret
;
8556 struct bfd_elf_version_tree
*t
;
8558 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
8561 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8563 if (strcmp (t
->name
, name
) == 0)
8565 ret
->version_needed
= t
;
8570 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
8572 ret
->version_needed
= NULL
;
8577 lang_do_version_exports_section (void)
8579 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
8581 LANG_FOR_EACH_INPUT_STATEMENT (is
)
8583 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
8591 contents
= (char *) xmalloc (len
);
8592 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
8593 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
8596 while (p
< contents
+ len
)
8598 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
8599 p
= strchr (p
, '\0') + 1;
8602 /* Do not free the contents, as we used them creating the regex. */
8604 /* Do not include this section in the link. */
8605 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
8608 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
8609 lang_register_vers_node (command_line
.version_exports_section
,
8610 lang_new_vers_node (greg
, lreg
), NULL
);
8613 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8616 lang_do_memory_regions (void)
8618 lang_memory_region_type
*r
= lang_memory_region_list
;
8620 for (; r
!= NULL
; r
= r
->next
)
8624 exp_fold_tree_no_dot (r
->origin_exp
);
8625 if (expld
.result
.valid_p
)
8627 r
->origin
= expld
.result
.value
;
8628 r
->current
= r
->origin
;
8631 einfo (_("%F%P: invalid origin for memory region %s\n"),
8636 exp_fold_tree_no_dot (r
->length_exp
);
8637 if (expld
.result
.valid_p
)
8638 r
->length
= expld
.result
.value
;
8640 einfo (_("%F%P: invalid length for memory region %s\n"),
8647 lang_add_unique (const char *name
)
8649 struct unique_sections
*ent
;
8651 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8652 if (strcmp (ent
->name
, name
) == 0)
8655 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8656 ent
->name
= xstrdup (name
);
8657 ent
->next
= unique_section_list
;
8658 unique_section_list
= ent
;
8661 /* Append the list of dynamic symbols to the existing one. */
8664 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8666 if (link_info
.dynamic_list
)
8668 struct bfd_elf_version_expr
*tail
;
8669 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8671 tail
->next
= link_info
.dynamic_list
->head
.list
;
8672 link_info
.dynamic_list
->head
.list
= dynamic
;
8676 struct bfd_elf_dynamic_list
*d
;
8678 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8679 d
->head
.list
= dynamic
;
8680 d
->match
= lang_vers_match
;
8681 link_info
.dynamic_list
= d
;
8685 /* Append the list of C++ typeinfo dynamic symbols to the existing
8689 lang_append_dynamic_list_cpp_typeinfo (void)
8691 const char *symbols
[] =
8693 "typeinfo name for*",
8696 struct bfd_elf_version_expr
*dynamic
= NULL
;
8699 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8700 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8703 lang_append_dynamic_list (dynamic
);
8706 /* Append the list of C++ operator new and delete dynamic symbols to the
8710 lang_append_dynamic_list_cpp_new (void)
8712 const char *symbols
[] =
8717 struct bfd_elf_version_expr
*dynamic
= NULL
;
8720 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8721 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8724 lang_append_dynamic_list (dynamic
);
8727 /* Scan a space and/or comma separated string of features. */
8730 lang_ld_feature (char *str
)
8738 while (*p
== ',' || ISSPACE (*p
))
8743 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8747 if (strcasecmp (p
, "SANE_EXPR") == 0)
8748 config
.sane_expr
= TRUE
;
8750 einfo (_("%X%P: unknown feature `%s'\n"), p
);
8756 /* Pretty print memory amount. */
8759 lang_print_memory_size (bfd_vma sz
)
8761 if ((sz
& 0x3fffffff) == 0)
8762 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
8763 else if ((sz
& 0xfffff) == 0)
8764 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
8765 else if ((sz
& 0x3ff) == 0)
8766 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
8768 printf (" %10" BFD_VMA_FMT
"u B", sz
);
8771 /* Implement --print-memory-usage: disply per region memory usage. */
8774 lang_print_memory_usage (void)
8776 lang_memory_region_type
*r
;
8778 printf ("Memory region Used Size Region Size %%age Used\n");
8779 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
8781 bfd_vma used_length
= r
->current
- r
->origin
;
8784 printf ("%16s: ",r
->name_list
.name
);
8785 lang_print_memory_size (used_length
);
8786 lang_print_memory_size ((bfd_vma
) r
->length
);
8788 percent
= used_length
* 100.0 / r
->length
;
8790 printf (" %6.2f%%\n", percent
);