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
= NULL
;
1203 ret
->s
.output_section_statement
.section_alignment
= NULL
;
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
!= NULL
)
2197 s
->bfd_section
->alignment_power
= exp_get_power (s
->section_alignment
,
2198 "section alignment");
2201 /* Make sure that all output sections mentioned in an expression are
2205 exp_init_os (etree_type
*exp
)
2207 switch (exp
->type
.node_class
)
2211 case etree_provided
:
2212 exp_init_os (exp
->assign
.src
);
2216 exp_init_os (exp
->binary
.lhs
);
2217 exp_init_os (exp
->binary
.rhs
);
2221 exp_init_os (exp
->trinary
.cond
);
2222 exp_init_os (exp
->trinary
.lhs
);
2223 exp_init_os (exp
->trinary
.rhs
);
2227 exp_init_os (exp
->assert_s
.child
);
2231 exp_init_os (exp
->unary
.child
);
2235 switch (exp
->type
.node_code
)
2241 lang_output_section_statement_type
*os
;
2243 os
= lang_output_section_find (exp
->name
.name
);
2244 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2256 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2258 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2260 /* If we are only reading symbols from this object, then we want to
2261 discard all sections. */
2262 if (entry
->flags
.just_syms
)
2264 bfd_link_just_syms (abfd
, sec
, &link_info
);
2268 /* Deal with SHF_EXCLUDE ELF sections. */
2269 if (!bfd_link_relocatable (&link_info
)
2270 && (abfd
->flags
& BFD_PLUGIN
) == 0
2271 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2272 sec
->output_section
= bfd_abs_section_ptr
;
2274 if (!(abfd
->flags
& DYNAMIC
))
2275 bfd_section_already_linked (abfd
, sec
, &link_info
);
2279 /* Returns true if SECTION is one we know will be discarded based on its
2280 section flags, otherwise returns false. */
2283 lang_discard_section_p (asection
*section
)
2285 bfd_boolean discard
;
2286 flagword flags
= section
->flags
;
2288 /* Discard sections marked with SEC_EXCLUDE. */
2289 discard
= (flags
& SEC_EXCLUDE
) != 0;
2291 /* Discard the group descriptor sections when we're finally placing the
2292 sections from within the group. */
2293 if ((flags
& SEC_GROUP
) != 0
2294 && link_info
.resolve_section_groups
)
2297 /* Discard debugging sections if we are stripping debugging
2299 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2300 && (flags
& SEC_DEBUGGING
) != 0)
2306 /* The wild routines.
2308 These expand statements like *(.text) and foo.o to a list of
2309 explicit actions, like foo.o(.text), bar.o(.text) and
2310 foo.o(.text, .data). */
2312 /* Add SECTION to the output section OUTPUT. Do this by creating a
2313 lang_input_section statement which is placed at PTR. */
2316 lang_add_section (lang_statement_list_type
*ptr
,
2318 struct flag_info
*sflag_info
,
2319 lang_output_section_statement_type
*output
)
2321 flagword flags
= section
->flags
;
2323 bfd_boolean discard
;
2324 lang_input_section_type
*new_section
;
2325 bfd
*abfd
= link_info
.output_bfd
;
2327 /* Is this section one we know should be discarded? */
2328 discard
= lang_discard_section_p (section
);
2330 /* Discard input sections which are assigned to a section named
2331 DISCARD_SECTION_NAME. */
2332 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2337 if (section
->output_section
== NULL
)
2339 /* This prevents future calls from assigning this section. */
2340 section
->output_section
= bfd_abs_section_ptr
;
2349 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2354 if (section
->output_section
!= NULL
)
2357 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2358 to an output section, because we want to be able to include a
2359 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2360 section (I don't know why we want to do this, but we do).
2361 build_link_order in ldwrite.c handles this case by turning
2362 the embedded SEC_NEVER_LOAD section into a fill. */
2363 flags
&= ~ SEC_NEVER_LOAD
;
2365 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2366 already been processed. One reason to do this is that on pe
2367 format targets, .text$foo sections go into .text and it's odd
2368 to see .text with SEC_LINK_ONCE set. */
2369 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2371 if (link_info
.resolve_section_groups
)
2372 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2374 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2376 else if (!bfd_link_relocatable (&link_info
))
2377 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2379 switch (output
->sectype
)
2381 case normal_section
:
2382 case overlay_section
:
2384 case noalloc_section
:
2385 flags
&= ~SEC_ALLOC
;
2387 case noload_section
:
2389 flags
|= SEC_NEVER_LOAD
;
2390 /* Unfortunately GNU ld has managed to evolve two different
2391 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2392 alloc, no contents section. All others get a noload, noalloc
2394 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2395 flags
&= ~SEC_HAS_CONTENTS
;
2397 flags
&= ~SEC_ALLOC
;
2401 if (output
->bfd_section
== NULL
)
2402 init_os (output
, flags
);
2404 /* If SEC_READONLY is not set in the input section, then clear
2405 it from the output section. */
2406 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2408 if (output
->bfd_section
->linker_has_input
)
2410 /* Only set SEC_READONLY flag on the first input section. */
2411 flags
&= ~ SEC_READONLY
;
2413 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2414 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2415 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2416 || ((flags
& SEC_MERGE
) != 0
2417 && output
->bfd_section
->entsize
!= section
->entsize
))
2419 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2420 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2423 output
->bfd_section
->flags
|= flags
;
2425 if (!output
->bfd_section
->linker_has_input
)
2427 output
->bfd_section
->linker_has_input
= 1;
2428 /* This must happen after flags have been updated. The output
2429 section may have been created before we saw its first input
2430 section, eg. for a data statement. */
2431 bfd_init_private_section_data (section
->owner
, section
,
2432 link_info
.output_bfd
,
2433 output
->bfd_section
,
2435 if ((flags
& SEC_MERGE
) != 0)
2436 output
->bfd_section
->entsize
= section
->entsize
;
2439 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2440 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2442 /* FIXME: This value should really be obtained from the bfd... */
2443 output
->block_value
= 128;
2446 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2447 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2449 section
->output_section
= output
->bfd_section
;
2451 if (!map_head_is_link_order
)
2453 asection
*s
= output
->bfd_section
->map_tail
.s
;
2454 output
->bfd_section
->map_tail
.s
= section
;
2455 section
->map_head
.s
= NULL
;
2456 section
->map_tail
.s
= s
;
2458 s
->map_head
.s
= section
;
2460 output
->bfd_section
->map_head
.s
= section
;
2463 /* Add a section reference to the list. */
2464 new_section
= new_stat (lang_input_section
, ptr
);
2465 new_section
->section
= section
;
2468 /* Handle wildcard sorting. This returns the lang_input_section which
2469 should follow the one we are going to create for SECTION and FILE,
2470 based on the sorting requirements of WILD. It returns NULL if the
2471 new section should just go at the end of the current list. */
2473 static lang_statement_union_type
*
2474 wild_sort (lang_wild_statement_type
*wild
,
2475 struct wildcard_list
*sec
,
2476 lang_input_statement_type
*file
,
2479 lang_statement_union_type
*l
;
2481 if (!wild
->filenames_sorted
2482 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2485 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2487 lang_input_section_type
*ls
;
2489 if (l
->header
.type
!= lang_input_section_enum
)
2491 ls
= &l
->input_section
;
2493 /* Sorting by filename takes precedence over sorting by section
2496 if (wild
->filenames_sorted
)
2498 const char *fn
, *ln
;
2502 /* The PE support for the .idata section as generated by
2503 dlltool assumes that files will be sorted by the name of
2504 the archive and then the name of the file within the
2507 if (file
->the_bfd
!= NULL
2508 && file
->the_bfd
->my_archive
!= NULL
)
2510 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2515 fn
= file
->filename
;
2519 if (ls
->section
->owner
->my_archive
!= NULL
)
2521 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2526 ln
= ls
->section
->owner
->filename
;
2530 i
= filename_cmp (fn
, ln
);
2539 fn
= file
->filename
;
2541 ln
= ls
->section
->owner
->filename
;
2543 i
= filename_cmp (fn
, ln
);
2551 /* Here either the files are not sorted by name, or we are
2552 looking at the sections for this file. */
2555 && sec
->spec
.sorted
!= none
2556 && sec
->spec
.sorted
!= by_none
)
2557 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2564 /* Expand a wild statement for a particular FILE. SECTION may be
2565 NULL, in which case it is a wild card. */
2568 output_section_callback (lang_wild_statement_type
*ptr
,
2569 struct wildcard_list
*sec
,
2571 struct flag_info
*sflag_info
,
2572 lang_input_statement_type
*file
,
2575 lang_statement_union_type
*before
;
2576 lang_output_section_statement_type
*os
;
2578 os
= (lang_output_section_statement_type
*) output
;
2580 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2581 if (unique_section_p (section
, os
))
2584 before
= wild_sort (ptr
, sec
, file
, section
);
2586 /* Here BEFORE points to the lang_input_section which
2587 should follow the one we are about to add. If BEFORE
2588 is NULL, then the section should just go at the end
2589 of the current list. */
2592 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2595 lang_statement_list_type list
;
2596 lang_statement_union_type
**pp
;
2598 lang_list_init (&list
);
2599 lang_add_section (&list
, section
, sflag_info
, os
);
2601 /* If we are discarding the section, LIST.HEAD will
2603 if (list
.head
!= NULL
)
2605 ASSERT (list
.head
->header
.next
== NULL
);
2607 for (pp
= &ptr
->children
.head
;
2609 pp
= &(*pp
)->header
.next
)
2610 ASSERT (*pp
!= NULL
);
2612 list
.head
->header
.next
= *pp
;
2618 /* Check if all sections in a wild statement for a particular FILE
2622 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2623 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2625 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2626 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2629 lang_output_section_statement_type
*os
;
2631 os
= (lang_output_section_statement_type
*) output
;
2633 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2634 if (unique_section_p (section
, os
))
2637 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2638 os
->all_input_readonly
= FALSE
;
2641 /* This is passed a file name which must have been seen already and
2642 added to the statement tree. We will see if it has been opened
2643 already and had its symbols read. If not then we'll read it. */
2645 static lang_input_statement_type
*
2646 lookup_name (const char *name
)
2648 lang_input_statement_type
*search
;
2650 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2652 search
= (lang_input_statement_type
*) search
->next_real_file
)
2654 /* Use the local_sym_name as the name of the file that has
2655 already been loaded as filename might have been transformed
2656 via the search directory lookup mechanism. */
2657 const char *filename
= search
->local_sym_name
;
2659 if (filename
!= NULL
2660 && filename_cmp (filename
, name
) == 0)
2665 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2666 default_target
, FALSE
);
2668 /* If we have already added this file, or this file is not real
2669 don't add this file. */
2670 if (search
->flags
.loaded
|| !search
->flags
.real
)
2673 if (!load_symbols (search
, NULL
))
2679 /* Save LIST as a list of libraries whose symbols should not be exported. */
2684 struct excluded_lib
*next
;
2686 static struct excluded_lib
*excluded_libs
;
2689 add_excluded_libs (const char *list
)
2691 const char *p
= list
, *end
;
2695 struct excluded_lib
*entry
;
2696 end
= strpbrk (p
, ",:");
2698 end
= p
+ strlen (p
);
2699 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2700 entry
->next
= excluded_libs
;
2701 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2702 memcpy (entry
->name
, p
, end
- p
);
2703 entry
->name
[end
- p
] = '\0';
2704 excluded_libs
= entry
;
2712 check_excluded_libs (bfd
*abfd
)
2714 struct excluded_lib
*lib
= excluded_libs
;
2718 int len
= strlen (lib
->name
);
2719 const char *filename
= lbasename (abfd
->filename
);
2721 if (strcmp (lib
->name
, "ALL") == 0)
2723 abfd
->no_export
= TRUE
;
2727 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2728 && (filename
[len
] == '\0'
2729 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2730 && filename
[len
+ 2] == '\0')))
2732 abfd
->no_export
= TRUE
;
2740 /* Get the symbols for an input file. */
2743 load_symbols (lang_input_statement_type
*entry
,
2744 lang_statement_list_type
*place
)
2748 if (entry
->flags
.loaded
)
2751 ldfile_open_file (entry
);
2753 /* Do not process further if the file was missing. */
2754 if (entry
->flags
.missing_file
)
2757 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
2758 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2761 struct lang_input_statement_flags save_flags
;
2764 err
= bfd_get_error ();
2766 /* See if the emulation has some special knowledge. */
2767 if (ldemul_unrecognized_file (entry
))
2770 if (err
== bfd_error_file_ambiguously_recognized
)
2774 einfo (_("%P: %pB: file not recognized: %E;"
2775 " matching formats:"), entry
->the_bfd
);
2776 for (p
= matching
; *p
!= NULL
; p
++)
2780 else if (err
!= bfd_error_file_not_recognized
2782 einfo (_("%F%P: %pB: file not recognized: %E\n"), entry
->the_bfd
);
2784 bfd_close (entry
->the_bfd
);
2785 entry
->the_bfd
= NULL
;
2787 /* Try to interpret the file as a linker script. */
2788 save_flags
= input_flags
;
2789 ldfile_open_command_file (entry
->filename
);
2791 push_stat_ptr (place
);
2792 input_flags
.add_DT_NEEDED_for_regular
2793 = entry
->flags
.add_DT_NEEDED_for_regular
;
2794 input_flags
.add_DT_NEEDED_for_dynamic
2795 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2796 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2797 input_flags
.dynamic
= entry
->flags
.dynamic
;
2799 ldfile_assumed_script
= TRUE
;
2800 parser_input
= input_script
;
2802 ldfile_assumed_script
= FALSE
;
2804 /* missing_file is sticky. sysrooted will already have been
2805 restored when seeing EOF in yyparse, but no harm to restore
2807 save_flags
.missing_file
|= input_flags
.missing_file
;
2808 input_flags
= save_flags
;
2812 entry
->flags
.loaded
= TRUE
;
2817 if (ldemul_recognized_file (entry
))
2820 /* We don't call ldlang_add_file for an archive. Instead, the
2821 add_symbols entry point will call ldlang_add_file, via the
2822 add_archive_element callback, for each element of the archive
2824 switch (bfd_get_format (entry
->the_bfd
))
2830 if (!entry
->flags
.reload
)
2831 ldlang_add_file (entry
);
2832 if (trace_files
|| verbose
)
2833 info_msg ("%pI\n", entry
);
2837 check_excluded_libs (entry
->the_bfd
);
2839 entry
->the_bfd
->usrdata
= entry
;
2840 if (entry
->flags
.whole_archive
)
2843 bfd_boolean loaded
= TRUE
;
2848 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2853 if (!bfd_check_format (member
, bfd_object
))
2855 einfo (_("%F%P: %pB: member %pB in archive is not an object\n"),
2856 entry
->the_bfd
, member
);
2861 if (!(*link_info
.callbacks
2862 ->add_archive_element
) (&link_info
, member
,
2863 "--whole-archive", &subsbfd
))
2866 /* Potentially, the add_archive_element hook may have set a
2867 substitute BFD for us. */
2868 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2870 einfo (_("%F%P: %pB: error adding symbols: %E\n"), member
);
2875 entry
->flags
.loaded
= loaded
;
2881 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2882 entry
->flags
.loaded
= TRUE
;
2884 einfo (_("%F%P: %pB: error adding symbols: %E\n"), entry
->the_bfd
);
2886 return entry
->flags
.loaded
;
2889 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2890 may be NULL, indicating that it is a wildcard. Separate
2891 lang_input_section statements are created for each part of the
2892 expansion; they are added after the wild statement S. OUTPUT is
2893 the output section. */
2896 wild (lang_wild_statement_type
*s
,
2897 const char *target ATTRIBUTE_UNUSED
,
2898 lang_output_section_statement_type
*output
)
2900 struct wildcard_list
*sec
;
2902 if (s
->handler_data
[0]
2903 && s
->handler_data
[0]->spec
.sorted
== by_name
2904 && !s
->filenames_sorted
)
2906 lang_section_bst_type
*tree
;
2908 walk_wild (s
, output_section_callback_fast
, output
);
2913 output_section_callback_tree_to_list (s
, tree
, output
);
2918 walk_wild (s
, output_section_callback
, output
);
2920 if (default_common_section
== NULL
)
2921 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2922 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2924 /* Remember the section that common is going to in case we
2925 later get something which doesn't know where to put it. */
2926 default_common_section
= output
;
2931 /* Return TRUE iff target is the sought target. */
2934 get_target (const bfd_target
*target
, void *data
)
2936 const char *sought
= (const char *) data
;
2938 return strcmp (target
->name
, sought
) == 0;
2941 /* Like strcpy() but convert to lower case as well. */
2944 stricpy (char *dest
, char *src
)
2948 while ((c
= *src
++) != 0)
2949 *dest
++ = TOLOWER (c
);
2954 /* Remove the first occurrence of needle (if any) in haystack
2958 strcut (char *haystack
, char *needle
)
2960 haystack
= strstr (haystack
, needle
);
2966 for (src
= haystack
+ strlen (needle
); *src
;)
2967 *haystack
++ = *src
++;
2973 /* Compare two target format name strings.
2974 Return a value indicating how "similar" they are. */
2977 name_compare (char *first
, char *second
)
2983 copy1
= (char *) xmalloc (strlen (first
) + 1);
2984 copy2
= (char *) xmalloc (strlen (second
) + 1);
2986 /* Convert the names to lower case. */
2987 stricpy (copy1
, first
);
2988 stricpy (copy2
, second
);
2990 /* Remove size and endian strings from the name. */
2991 strcut (copy1
, "big");
2992 strcut (copy1
, "little");
2993 strcut (copy2
, "big");
2994 strcut (copy2
, "little");
2996 /* Return a value based on how many characters match,
2997 starting from the beginning. If both strings are
2998 the same then return 10 * their length. */
2999 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3000 if (copy1
[result
] == 0)
3012 /* Set by closest_target_match() below. */
3013 static const bfd_target
*winner
;
3015 /* Scan all the valid bfd targets looking for one that has the endianness
3016 requirement that was specified on the command line, and is the nearest
3017 match to the original output target. */
3020 closest_target_match (const bfd_target
*target
, void *data
)
3022 const bfd_target
*original
= (const bfd_target
*) data
;
3024 if (command_line
.endian
== ENDIAN_BIG
3025 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3028 if (command_line
.endian
== ENDIAN_LITTLE
3029 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3032 /* Must be the same flavour. */
3033 if (target
->flavour
!= original
->flavour
)
3036 /* Ignore generic big and little endian elf vectors. */
3037 if (strcmp (target
->name
, "elf32-big") == 0
3038 || strcmp (target
->name
, "elf64-big") == 0
3039 || strcmp (target
->name
, "elf32-little") == 0
3040 || strcmp (target
->name
, "elf64-little") == 0)
3043 /* If we have not found a potential winner yet, then record this one. */
3050 /* Oh dear, we now have two potential candidates for a successful match.
3051 Compare their names and choose the better one. */
3052 if (name_compare (target
->name
, original
->name
)
3053 > name_compare (winner
->name
, original
->name
))
3056 /* Keep on searching until wqe have checked them all. */
3060 /* Return the BFD target format of the first input file. */
3063 get_first_input_target (void)
3065 char *target
= NULL
;
3067 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3069 if (s
->header
.type
== lang_input_statement_enum
3072 ldfile_open_file (s
);
3074 if (s
->the_bfd
!= NULL
3075 && bfd_check_format (s
->the_bfd
, bfd_object
))
3077 target
= bfd_get_target (s
->the_bfd
);
3089 lang_get_output_target (void)
3093 /* Has the user told us which output format to use? */
3094 if (output_target
!= NULL
)
3095 return output_target
;
3097 /* No - has the current target been set to something other than
3099 if (current_target
!= default_target
&& current_target
!= NULL
)
3100 return current_target
;
3102 /* No - can we determine the format of the first input file? */
3103 target
= get_first_input_target ();
3107 /* Failed - use the default output target. */
3108 return default_target
;
3111 /* Open the output file. */
3114 open_output (const char *name
)
3116 output_target
= lang_get_output_target ();
3118 /* Has the user requested a particular endianness on the command
3120 if (command_line
.endian
!= ENDIAN_UNSET
)
3122 /* Get the chosen target. */
3123 const bfd_target
*target
3124 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3126 /* If the target is not supported, we cannot do anything. */
3129 enum bfd_endian desired_endian
;
3131 if (command_line
.endian
== ENDIAN_BIG
)
3132 desired_endian
= BFD_ENDIAN_BIG
;
3134 desired_endian
= BFD_ENDIAN_LITTLE
;
3136 /* See if the target has the wrong endianness. This should
3137 not happen if the linker script has provided big and
3138 little endian alternatives, but some scrips don't do
3140 if (target
->byteorder
!= desired_endian
)
3142 /* If it does, then see if the target provides
3143 an alternative with the correct endianness. */
3144 if (target
->alternative_target
!= NULL
3145 && (target
->alternative_target
->byteorder
== desired_endian
))
3146 output_target
= target
->alternative_target
->name
;
3149 /* Try to find a target as similar as possible to
3150 the default target, but which has the desired
3151 endian characteristic. */
3152 bfd_iterate_over_targets (closest_target_match
,
3155 /* Oh dear - we could not find any targets that
3156 satisfy our requirements. */
3158 einfo (_("%P: warning: could not find any targets"
3159 " that match endianness requirement\n"));
3161 output_target
= winner
->name
;
3167 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3169 if (link_info
.output_bfd
== NULL
)
3171 if (bfd_get_error () == bfd_error_invalid_target
)
3172 einfo (_("%F%P: target %s not found\n"), output_target
);
3174 einfo (_("%F%P: cannot open output file %s: %E\n"), name
);
3177 delete_output_file_on_failure
= TRUE
;
3179 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3180 einfo (_("%F%P: %s: can not make object file: %E\n"), name
);
3181 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3182 ldfile_output_architecture
,
3183 ldfile_output_machine
))
3184 einfo (_("%F%P: %s: can not set architecture: %E\n"), name
);
3186 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3187 if (link_info
.hash
== NULL
)
3188 einfo (_("%F%P: can not create hash table: %E\n"));
3190 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3194 ldlang_open_output (lang_statement_union_type
*statement
)
3196 switch (statement
->header
.type
)
3198 case lang_output_statement_enum
:
3199 ASSERT (link_info
.output_bfd
== NULL
);
3200 open_output (statement
->output_statement
.name
);
3201 ldemul_set_output_arch ();
3202 if (config
.magic_demand_paged
3203 && !bfd_link_relocatable (&link_info
))
3204 link_info
.output_bfd
->flags
|= D_PAGED
;
3206 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3207 if (config
.text_read_only
)
3208 link_info
.output_bfd
->flags
|= WP_TEXT
;
3210 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3211 if (link_info
.traditional_format
)
3212 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3214 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3217 case lang_target_statement_enum
:
3218 current_target
= statement
->target_statement
.target
;
3228 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3229 ldfile_output_machine
);
3232 while ((x
& 1) == 0)
3240 /* Open all the input files. */
3244 OPEN_BFD_NORMAL
= 0,
3248 #ifdef ENABLE_PLUGINS
3249 static lang_input_statement_type
*plugin_insert
= NULL
;
3253 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3255 for (; s
!= NULL
; s
= s
->header
.next
)
3257 switch (s
->header
.type
)
3259 case lang_constructors_statement_enum
:
3260 open_input_bfds (constructor_list
.head
, mode
);
3262 case lang_output_section_statement_enum
:
3263 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3265 case lang_wild_statement_enum
:
3266 /* Maybe we should load the file's symbols. */
3267 if ((mode
& OPEN_BFD_RESCAN
) == 0
3268 && s
->wild_statement
.filename
3269 && !wildcardp (s
->wild_statement
.filename
)
3270 && !archive_path (s
->wild_statement
.filename
))
3271 lookup_name (s
->wild_statement
.filename
);
3272 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3274 case lang_group_statement_enum
:
3276 struct bfd_link_hash_entry
*undefs
;
3278 /* We must continually search the entries in the group
3279 until no new symbols are added to the list of undefined
3284 undefs
= link_info
.hash
->undefs_tail
;
3285 open_input_bfds (s
->group_statement
.children
.head
,
3286 mode
| OPEN_BFD_FORCE
);
3288 while (undefs
!= link_info
.hash
->undefs_tail
);
3291 case lang_target_statement_enum
:
3292 current_target
= s
->target_statement
.target
;
3294 case lang_input_statement_enum
:
3295 if (s
->input_statement
.flags
.real
)
3297 lang_statement_union_type
**os_tail
;
3298 lang_statement_list_type add
;
3301 s
->input_statement
.target
= current_target
;
3303 /* If we are being called from within a group, and this
3304 is an archive which has already been searched, then
3305 force it to be researched unless the whole archive
3306 has been loaded already. Do the same for a rescan.
3307 Likewise reload --as-needed shared libs. */
3308 if (mode
!= OPEN_BFD_NORMAL
3309 #ifdef ENABLE_PLUGINS
3310 && ((mode
& OPEN_BFD_RESCAN
) == 0
3311 || plugin_insert
== NULL
)
3313 && s
->input_statement
.flags
.loaded
3314 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3315 && ((bfd_get_format (abfd
) == bfd_archive
3316 && !s
->input_statement
.flags
.whole_archive
)
3317 || (bfd_get_format (abfd
) == bfd_object
3318 && ((abfd
->flags
) & DYNAMIC
) != 0
3319 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3320 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3321 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3323 s
->input_statement
.flags
.loaded
= FALSE
;
3324 s
->input_statement
.flags
.reload
= TRUE
;
3327 os_tail
= lang_output_section_statement
.tail
;
3328 lang_list_init (&add
);
3330 if (!load_symbols (&s
->input_statement
, &add
))
3331 config
.make_executable
= FALSE
;
3333 if (add
.head
!= NULL
)
3335 /* If this was a script with output sections then
3336 tack any added statements on to the end of the
3337 list. This avoids having to reorder the output
3338 section statement list. Very likely the user
3339 forgot -T, and whatever we do here will not meet
3340 naive user expectations. */
3341 if (os_tail
!= lang_output_section_statement
.tail
)
3343 einfo (_("%P: warning: %s contains output sections;"
3344 " did you forget -T?\n"),
3345 s
->input_statement
.filename
);
3346 *stat_ptr
->tail
= add
.head
;
3347 stat_ptr
->tail
= add
.tail
;
3351 *add
.tail
= s
->header
.next
;
3352 s
->header
.next
= add
.head
;
3356 #ifdef ENABLE_PLUGINS
3357 /* If we have found the point at which a plugin added new
3358 files, clear plugin_insert to enable archive rescan. */
3359 if (&s
->input_statement
== plugin_insert
)
3360 plugin_insert
= NULL
;
3363 case lang_assignment_statement_enum
:
3364 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3365 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3372 /* Exit if any of the files were missing. */
3373 if (input_flags
.missing_file
)
3377 /* Add the supplied name to the symbol table as an undefined reference.
3378 This is a two step process as the symbol table doesn't even exist at
3379 the time the ld command line is processed. First we put the name
3380 on a list, then, once the output file has been opened, transfer the
3381 name to the symbol table. */
3383 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3385 #define ldlang_undef_chain_list_head entry_symbol.next
3388 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3390 ldlang_undef_chain_list_type
*new_undef
;
3392 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3393 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3394 new_undef
->next
= ldlang_undef_chain_list_head
;
3395 ldlang_undef_chain_list_head
= new_undef
;
3397 new_undef
->name
= xstrdup (name
);
3399 if (link_info
.output_bfd
!= NULL
)
3400 insert_undefined (new_undef
->name
);
3403 /* Insert NAME as undefined in the symbol table. */
3406 insert_undefined (const char *name
)
3408 struct bfd_link_hash_entry
*h
;
3410 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3412 einfo (_("%F%P: bfd_link_hash_lookup failed: %E\n"));
3413 if (h
->type
== bfd_link_hash_new
)
3415 h
->type
= bfd_link_hash_undefined
;
3416 h
->u
.undef
.abfd
= NULL
;
3417 h
->non_ir_ref_regular
= TRUE
;
3418 if (is_elf_hash_table (link_info
.hash
))
3419 ((struct elf_link_hash_entry
*) h
)->mark
= 1;
3420 bfd_link_add_undef (link_info
.hash
, h
);
3424 /* Run through the list of undefineds created above and place them
3425 into the linker hash table as undefined symbols belonging to the
3429 lang_place_undefineds (void)
3431 ldlang_undef_chain_list_type
*ptr
;
3433 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3434 insert_undefined (ptr
->name
);
3437 /* Structure used to build the list of symbols that the user has required
3440 struct require_defined_symbol
3443 struct require_defined_symbol
*next
;
3446 /* The list of symbols that the user has required be defined. */
3448 static struct require_defined_symbol
*require_defined_symbol_list
;
3450 /* Add a new symbol NAME to the list of symbols that are required to be
3454 ldlang_add_require_defined (const char *const name
)
3456 struct require_defined_symbol
*ptr
;
3458 ldlang_add_undef (name
, TRUE
);
3459 ptr
= (struct require_defined_symbol
*) stat_alloc (sizeof (*ptr
));
3460 ptr
->next
= require_defined_symbol_list
;
3461 ptr
->name
= strdup (name
);
3462 require_defined_symbol_list
= ptr
;
3465 /* Check that all symbols the user required to be defined, are defined,
3466 raise an error if we find a symbol that is not defined. */
3469 ldlang_check_require_defined_symbols (void)
3471 struct require_defined_symbol
*ptr
;
3473 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
3475 struct bfd_link_hash_entry
*h
;
3477 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
3478 FALSE
, FALSE
, TRUE
);
3480 || (h
->type
!= bfd_link_hash_defined
3481 && h
->type
!= bfd_link_hash_defweak
))
3482 einfo(_("%X%P: required symbol `%s' not defined\n"), ptr
->name
);
3486 /* Check for all readonly or some readwrite sections. */
3489 check_input_sections
3490 (lang_statement_union_type
*s
,
3491 lang_output_section_statement_type
*output_section_statement
)
3493 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3495 switch (s
->header
.type
)
3497 case lang_wild_statement_enum
:
3498 walk_wild (&s
->wild_statement
, check_section_callback
,
3499 output_section_statement
);
3500 if (!output_section_statement
->all_input_readonly
)
3503 case lang_constructors_statement_enum
:
3504 check_input_sections (constructor_list
.head
,
3505 output_section_statement
);
3506 if (!output_section_statement
->all_input_readonly
)
3509 case lang_group_statement_enum
:
3510 check_input_sections (s
->group_statement
.children
.head
,
3511 output_section_statement
);
3512 if (!output_section_statement
->all_input_readonly
)
3521 /* Update wildcard statements if needed. */
3524 update_wild_statements (lang_statement_union_type
*s
)
3526 struct wildcard_list
*sec
;
3528 switch (sort_section
)
3538 for (; s
!= NULL
; s
= s
->header
.next
)
3540 switch (s
->header
.type
)
3545 case lang_wild_statement_enum
:
3546 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3549 switch (sec
->spec
.sorted
)
3552 sec
->spec
.sorted
= sort_section
;
3555 if (sort_section
== by_alignment
)
3556 sec
->spec
.sorted
= by_name_alignment
;
3559 if (sort_section
== by_name
)
3560 sec
->spec
.sorted
= by_alignment_name
;
3568 case lang_constructors_statement_enum
:
3569 update_wild_statements (constructor_list
.head
);
3572 case lang_output_section_statement_enum
:
3573 /* Don't sort .init/.fini sections. */
3574 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3575 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3576 update_wild_statements
3577 (s
->output_section_statement
.children
.head
);
3580 case lang_group_statement_enum
:
3581 update_wild_statements (s
->group_statement
.children
.head
);
3589 /* Open input files and attach to output sections. */
3592 map_input_to_output_sections
3593 (lang_statement_union_type
*s
, const char *target
,
3594 lang_output_section_statement_type
*os
)
3596 for (; s
!= NULL
; s
= s
->header
.next
)
3598 lang_output_section_statement_type
*tos
;
3601 switch (s
->header
.type
)
3603 case lang_wild_statement_enum
:
3604 wild (&s
->wild_statement
, target
, os
);
3606 case lang_constructors_statement_enum
:
3607 map_input_to_output_sections (constructor_list
.head
,
3611 case lang_output_section_statement_enum
:
3612 tos
= &s
->output_section_statement
;
3613 if (tos
->constraint
!= 0)
3615 if (tos
->constraint
!= ONLY_IF_RW
3616 && tos
->constraint
!= ONLY_IF_RO
)
3618 tos
->all_input_readonly
= TRUE
;
3619 check_input_sections (tos
->children
.head
, tos
);
3620 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3622 tos
->constraint
= -1;
3626 map_input_to_output_sections (tos
->children
.head
,
3630 case lang_output_statement_enum
:
3632 case lang_target_statement_enum
:
3633 target
= s
->target_statement
.target
;
3635 case lang_group_statement_enum
:
3636 map_input_to_output_sections (s
->group_statement
.children
.head
,
3640 case lang_data_statement_enum
:
3641 /* Make sure that any sections mentioned in the expression
3643 exp_init_os (s
->data_statement
.exp
);
3644 /* The output section gets CONTENTS, ALLOC and LOAD, but
3645 these may be overridden by the script. */
3646 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3647 switch (os
->sectype
)
3649 case normal_section
:
3650 case overlay_section
:
3652 case noalloc_section
:
3653 flags
= SEC_HAS_CONTENTS
;
3655 case noload_section
:
3656 if (bfd_get_flavour (link_info
.output_bfd
)
3657 == bfd_target_elf_flavour
)
3658 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3660 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3663 if (os
->bfd_section
== NULL
)
3664 init_os (os
, flags
);
3666 os
->bfd_section
->flags
|= flags
;
3668 case lang_input_section_enum
:
3670 case lang_fill_statement_enum
:
3671 case lang_object_symbols_statement_enum
:
3672 case lang_reloc_statement_enum
:
3673 case lang_padding_statement_enum
:
3674 case lang_input_statement_enum
:
3675 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3678 case lang_assignment_statement_enum
:
3679 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3682 /* Make sure that any sections mentioned in the assignment
3684 exp_init_os (s
->assignment_statement
.exp
);
3686 case lang_address_statement_enum
:
3687 /* Mark the specified section with the supplied address.
3688 If this section was actually a segment marker, then the
3689 directive is ignored if the linker script explicitly
3690 processed the segment marker. Originally, the linker
3691 treated segment directives (like -Ttext on the
3692 command-line) as section directives. We honor the
3693 section directive semantics for backwards compatibility;
3694 linker scripts that do not specifically check for
3695 SEGMENT_START automatically get the old semantics. */
3696 if (!s
->address_statement
.segment
3697 || !s
->address_statement
.segment
->used
)
3699 const char *name
= s
->address_statement
.section_name
;
3701 /* Create the output section statement here so that
3702 orphans with a set address will be placed after other
3703 script sections. If we let the orphan placement code
3704 place them in amongst other sections then the address
3705 will affect following script sections, which is
3706 likely to surprise naive users. */
3707 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3708 tos
->addr_tree
= s
->address_statement
.address
;
3709 if (tos
->bfd_section
== NULL
)
3713 case lang_insert_statement_enum
:
3719 /* An insert statement snips out all the linker statements from the
3720 start of the list and places them after the output section
3721 statement specified by the insert. This operation is complicated
3722 by the fact that we keep a doubly linked list of output section
3723 statements as well as the singly linked list of all statements. */
3726 process_insert_statements (void)
3728 lang_statement_union_type
**s
;
3729 lang_output_section_statement_type
*first_os
= NULL
;
3730 lang_output_section_statement_type
*last_os
= NULL
;
3731 lang_output_section_statement_type
*os
;
3733 /* "start of list" is actually the statement immediately after
3734 the special abs_section output statement, so that it isn't
3736 s
= &lang_output_section_statement
.head
;
3737 while (*(s
= &(*s
)->header
.next
) != NULL
)
3739 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3741 /* Keep pointers to the first and last output section
3742 statement in the sequence we may be about to move. */
3743 os
= &(*s
)->output_section_statement
;
3745 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3748 /* Set constraint negative so that lang_output_section_find
3749 won't match this output section statement. At this
3750 stage in linking constraint has values in the range
3751 [-1, ONLY_IN_RW]. */
3752 last_os
->constraint
= -2 - last_os
->constraint
;
3753 if (first_os
== NULL
)
3756 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3758 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3759 lang_output_section_statement_type
*where
;
3760 lang_statement_union_type
**ptr
;
3761 lang_statement_union_type
*first
;
3763 where
= lang_output_section_find (i
->where
);
3764 if (where
!= NULL
&& i
->is_before
)
3767 where
= where
->prev
;
3768 while (where
!= NULL
&& where
->constraint
< 0);
3772 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3776 /* Deal with reordering the output section statement list. */
3777 if (last_os
!= NULL
)
3779 asection
*first_sec
, *last_sec
;
3780 struct lang_output_section_statement_struct
**next
;
3782 /* Snip out the output sections we are moving. */
3783 first_os
->prev
->next
= last_os
->next
;
3784 if (last_os
->next
== NULL
)
3786 next
= &first_os
->prev
->next
;
3787 lang_output_section_statement
.tail
3788 = (lang_statement_union_type
**) next
;
3791 last_os
->next
->prev
= first_os
->prev
;
3792 /* Add them in at the new position. */
3793 last_os
->next
= where
->next
;
3794 if (where
->next
== NULL
)
3796 next
= &last_os
->next
;
3797 lang_output_section_statement
.tail
3798 = (lang_statement_union_type
**) next
;
3801 where
->next
->prev
= last_os
;
3802 first_os
->prev
= where
;
3803 where
->next
= first_os
;
3805 /* Move the bfd sections in the same way. */
3808 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3810 os
->constraint
= -2 - os
->constraint
;
3811 if (os
->bfd_section
!= NULL
3812 && os
->bfd_section
->owner
!= NULL
)
3814 last_sec
= os
->bfd_section
;
3815 if (first_sec
== NULL
)
3816 first_sec
= last_sec
;
3821 if (last_sec
!= NULL
)
3823 asection
*sec
= where
->bfd_section
;
3825 sec
= output_prev_sec_find (where
);
3827 /* The place we want to insert must come after the
3828 sections we are moving. So if we find no
3829 section or if the section is the same as our
3830 last section, then no move is needed. */
3831 if (sec
!= NULL
&& sec
!= last_sec
)
3833 /* Trim them off. */
3834 if (first_sec
->prev
!= NULL
)
3835 first_sec
->prev
->next
= last_sec
->next
;
3837 link_info
.output_bfd
->sections
= last_sec
->next
;
3838 if (last_sec
->next
!= NULL
)
3839 last_sec
->next
->prev
= first_sec
->prev
;
3841 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3843 last_sec
->next
= sec
->next
;
3844 if (sec
->next
!= NULL
)
3845 sec
->next
->prev
= last_sec
;
3847 link_info
.output_bfd
->section_last
= last_sec
;
3848 first_sec
->prev
= sec
;
3849 sec
->next
= first_sec
;
3857 ptr
= insert_os_after (where
);
3858 /* Snip everything after the abs_section output statement we
3859 know is at the start of the list, up to and including
3860 the insert statement we are currently processing. */
3861 first
= lang_output_section_statement
.head
->header
.next
;
3862 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3863 /* Add them back where they belong. */
3866 statement_list
.tail
= s
;
3868 s
= &lang_output_section_statement
.head
;
3872 /* Undo constraint twiddling. */
3873 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3875 os
->constraint
= -2 - os
->constraint
;
3881 /* An output section might have been removed after its statement was
3882 added. For example, ldemul_before_allocation can remove dynamic
3883 sections if they turn out to be not needed. Clean them up here. */
3886 strip_excluded_output_sections (void)
3888 lang_output_section_statement_type
*os
;
3890 /* Run lang_size_sections (if not already done). */
3891 if (expld
.phase
!= lang_mark_phase_enum
)
3893 expld
.phase
= lang_mark_phase_enum
;
3894 expld
.dataseg
.phase
= exp_seg_none
;
3895 one_lang_size_sections_pass (NULL
, FALSE
);
3896 lang_reset_memory_regions ();
3899 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3903 asection
*output_section
;
3904 bfd_boolean exclude
;
3906 if (os
->constraint
< 0)
3909 output_section
= os
->bfd_section
;
3910 if (output_section
== NULL
)
3913 exclude
= (output_section
->rawsize
== 0
3914 && (output_section
->flags
& SEC_KEEP
) == 0
3915 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3918 /* Some sections have not yet been sized, notably .gnu.version,
3919 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3920 input sections, so don't drop output sections that have such
3921 input sections unless they are also marked SEC_EXCLUDE. */
3922 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3926 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3927 if ((s
->flags
& SEC_EXCLUDE
) == 0
3928 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3929 || link_info
.emitrelocations
))
3938 /* We don't set bfd_section to NULL since bfd_section of the
3939 removed output section statement may still be used. */
3940 if (!os
->update_dot
)
3942 output_section
->flags
|= SEC_EXCLUDE
;
3943 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3944 link_info
.output_bfd
->section_count
--;
3949 /* Called from ldwrite to clear out asection.map_head and
3950 asection.map_tail for use as link_orders in ldwrite. */
3953 lang_clear_os_map (void)
3955 lang_output_section_statement_type
*os
;
3957 if (map_head_is_link_order
)
3960 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3964 asection
*output_section
;
3966 if (os
->constraint
< 0)
3969 output_section
= os
->bfd_section
;
3970 if (output_section
== NULL
)
3973 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3974 output_section
->map_head
.link_order
= NULL
;
3975 output_section
->map_tail
.link_order
= NULL
;
3978 /* Stop future calls to lang_add_section from messing with map_head
3979 and map_tail link_order fields. */
3980 map_head_is_link_order
= TRUE
;
3984 print_output_section_statement
3985 (lang_output_section_statement_type
*output_section_statement
)
3987 asection
*section
= output_section_statement
->bfd_section
;
3990 if (output_section_statement
!= abs_output_section
)
3992 minfo ("\n%s", output_section_statement
->name
);
3994 if (section
!= NULL
)
3996 print_dot
= section
->vma
;
3998 len
= strlen (output_section_statement
->name
);
3999 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4004 while (len
< SECTION_NAME_MAP_LENGTH
)
4010 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4012 if (section
->vma
!= section
->lma
)
4013 minfo (_(" load address 0x%V"), section
->lma
);
4015 if (output_section_statement
->update_dot_tree
!= NULL
)
4016 exp_fold_tree (output_section_statement
->update_dot_tree
,
4017 bfd_abs_section_ptr
, &print_dot
);
4023 print_statement_list (output_section_statement
->children
.head
,
4024 output_section_statement
);
4028 print_assignment (lang_assignment_statement_type
*assignment
,
4029 lang_output_section_statement_type
*output_section
)
4036 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4039 if (assignment
->exp
->type
.node_class
== etree_assert
)
4042 tree
= assignment
->exp
->assert_s
.child
;
4046 const char *dst
= assignment
->exp
->assign
.dst
;
4048 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4050 expld
.assign_name
= dst
;
4051 tree
= assignment
->exp
->assign
.src
;
4054 osec
= output_section
->bfd_section
;
4056 osec
= bfd_abs_section_ptr
;
4058 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4059 exp_fold_tree (tree
, osec
, &print_dot
);
4061 expld
.result
.valid_p
= FALSE
;
4063 if (expld
.result
.valid_p
)
4067 if (assignment
->exp
->type
.node_class
== etree_assert
4069 || expld
.assign_name
!= NULL
)
4071 value
= expld
.result
.value
;
4073 if (expld
.result
.section
!= NULL
)
4074 value
+= expld
.result
.section
->vma
;
4076 minfo ("0x%V", value
);
4082 struct bfd_link_hash_entry
*h
;
4084 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4085 FALSE
, FALSE
, TRUE
);
4088 value
= h
->u
.def
.value
;
4089 value
+= h
->u
.def
.section
->output_section
->vma
;
4090 value
+= h
->u
.def
.section
->output_offset
;
4092 minfo ("[0x%V]", value
);
4095 minfo ("[unresolved]");
4100 if (assignment
->exp
->type
.node_class
== etree_provide
)
4101 minfo ("[!provide]");
4108 expld
.assign_name
= NULL
;
4111 exp_print_tree (assignment
->exp
);
4116 print_input_statement (lang_input_statement_type
*statm
)
4118 if (statm
->filename
!= NULL
4119 && (statm
->the_bfd
== NULL
4120 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4121 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4124 /* Print all symbols defined in a particular section. This is called
4125 via bfd_link_hash_traverse, or by print_all_symbols. */
4128 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4130 asection
*sec
= (asection
*) ptr
;
4132 if ((hash_entry
->type
== bfd_link_hash_defined
4133 || hash_entry
->type
== bfd_link_hash_defweak
)
4134 && sec
== hash_entry
->u
.def
.section
)
4138 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4141 (hash_entry
->u
.def
.value
4142 + hash_entry
->u
.def
.section
->output_offset
4143 + hash_entry
->u
.def
.section
->output_section
->vma
));
4145 minfo (" %pT\n", hash_entry
->root
.string
);
4152 hash_entry_addr_cmp (const void *a
, const void *b
)
4154 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4155 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4157 if (l
->u
.def
.value
< r
->u
.def
.value
)
4159 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4166 print_all_symbols (asection
*sec
)
4168 input_section_userdata_type
*ud
4169 = (input_section_userdata_type
*) get_userdata (sec
);
4170 struct map_symbol_def
*def
;
4171 struct bfd_link_hash_entry
**entries
;
4177 *ud
->map_symbol_def_tail
= 0;
4179 /* Sort the symbols by address. */
4180 entries
= (struct bfd_link_hash_entry
**)
4181 obstack_alloc (&map_obstack
,
4182 ud
->map_symbol_def_count
* sizeof (*entries
));
4184 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4185 entries
[i
] = def
->entry
;
4187 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4188 hash_entry_addr_cmp
);
4190 /* Print the symbols. */
4191 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4192 print_one_symbol (entries
[i
], sec
);
4194 obstack_free (&map_obstack
, entries
);
4197 /* Print information about an input section to the map file. */
4200 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4202 bfd_size_type size
= i
->size
;
4209 minfo ("%s", i
->name
);
4211 len
= 1 + strlen (i
->name
);
4212 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4217 while (len
< SECTION_NAME_MAP_LENGTH
)
4223 if (i
->output_section
!= NULL
4224 && i
->output_section
->owner
== link_info
.output_bfd
)
4225 addr
= i
->output_section
->vma
+ i
->output_offset
;
4233 minfo ("0x%V %W %pB\n", addr
, size
, i
->owner
);
4235 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4237 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4249 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4252 if (i
->output_section
!= NULL
4253 && i
->output_section
->owner
== link_info
.output_bfd
)
4255 if (link_info
.reduce_memory_overheads
)
4256 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4258 print_all_symbols (i
);
4260 /* Update print_dot, but make sure that we do not move it
4261 backwards - this could happen if we have overlays and a
4262 later overlay is shorter than an earier one. */
4263 if (addr
+ TO_ADDR (size
) > print_dot
)
4264 print_dot
= addr
+ TO_ADDR (size
);
4269 print_fill_statement (lang_fill_statement_type
*fill
)
4273 fputs (" FILL mask 0x", config
.map_file
);
4274 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4275 fprintf (config
.map_file
, "%02x", *p
);
4276 fputs ("\n", config
.map_file
);
4280 print_data_statement (lang_data_statement_type
*data
)
4288 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4291 addr
= data
->output_offset
;
4292 if (data
->output_section
!= NULL
)
4293 addr
+= data
->output_section
->vma
;
4321 if (size
< TO_SIZE ((unsigned) 1))
4322 size
= TO_SIZE ((unsigned) 1);
4323 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4325 if (data
->exp
->type
.node_class
!= etree_value
)
4328 exp_print_tree (data
->exp
);
4333 print_dot
= addr
+ TO_ADDR (size
);
4336 /* Print an address statement. These are generated by options like
4340 print_address_statement (lang_address_statement_type
*address
)
4342 minfo (_("Address of section %s set to "), address
->section_name
);
4343 exp_print_tree (address
->address
);
4347 /* Print a reloc statement. */
4350 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4357 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4360 addr
= reloc
->output_offset
;
4361 if (reloc
->output_section
!= NULL
)
4362 addr
+= reloc
->output_section
->vma
;
4364 size
= bfd_get_reloc_size (reloc
->howto
);
4366 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4368 if (reloc
->name
!= NULL
)
4369 minfo ("%s+", reloc
->name
);
4371 minfo ("%s+", reloc
->section
->name
);
4373 exp_print_tree (reloc
->addend_exp
);
4377 print_dot
= addr
+ TO_ADDR (size
);
4381 print_padding_statement (lang_padding_statement_type
*s
)
4389 len
= sizeof " *fill*" - 1;
4390 while (len
< SECTION_NAME_MAP_LENGTH
)
4396 addr
= s
->output_offset
;
4397 if (s
->output_section
!= NULL
)
4398 addr
+= s
->output_section
->vma
;
4399 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4401 if (s
->fill
->size
!= 0)
4405 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4406 fprintf (config
.map_file
, "%02x", *p
);
4411 print_dot
= addr
+ TO_ADDR (s
->size
);
4415 print_wild_statement (lang_wild_statement_type
*w
,
4416 lang_output_section_statement_type
*os
)
4418 struct wildcard_list
*sec
;
4422 if (w
->exclude_name_list
)
4425 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
4426 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4427 minfo (" %s", tmp
->name
);
4431 if (w
->filenames_sorted
)
4432 minfo ("SORT_BY_NAME(");
4433 if (w
->filename
!= NULL
)
4434 minfo ("%s", w
->filename
);
4437 if (w
->filenames_sorted
)
4441 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4443 int closing_paren
= 0;
4445 switch (sec
->spec
.sorted
)
4451 minfo ("SORT_BY_NAME(");
4456 minfo ("SORT_BY_ALIGNMENT(");
4460 case by_name_alignment
:
4461 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
4465 case by_alignment_name
:
4466 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
4471 minfo ("SORT_NONE(");
4475 case by_init_priority
:
4476 minfo ("SORT_BY_INIT_PRIORITY(");
4481 if (sec
->spec
.exclude_name_list
!= NULL
)
4484 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4485 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4486 minfo (" %s", tmp
->name
);
4489 if (sec
->spec
.name
!= NULL
)
4490 minfo ("%s", sec
->spec
.name
);
4493 for (;closing_paren
> 0; closing_paren
--)
4502 print_statement_list (w
->children
.head
, os
);
4505 /* Print a group statement. */
4508 print_group (lang_group_statement_type
*s
,
4509 lang_output_section_statement_type
*os
)
4511 fprintf (config
.map_file
, "START GROUP\n");
4512 print_statement_list (s
->children
.head
, os
);
4513 fprintf (config
.map_file
, "END GROUP\n");
4516 /* Print the list of statements in S.
4517 This can be called for any statement type. */
4520 print_statement_list (lang_statement_union_type
*s
,
4521 lang_output_section_statement_type
*os
)
4525 print_statement (s
, os
);
4530 /* Print the first statement in statement list S.
4531 This can be called for any statement type. */
4534 print_statement (lang_statement_union_type
*s
,
4535 lang_output_section_statement_type
*os
)
4537 switch (s
->header
.type
)
4540 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4543 case lang_constructors_statement_enum
:
4544 if (constructor_list
.head
!= NULL
)
4546 if (constructors_sorted
)
4547 minfo (" SORT (CONSTRUCTORS)\n");
4549 minfo (" CONSTRUCTORS\n");
4550 print_statement_list (constructor_list
.head
, os
);
4553 case lang_wild_statement_enum
:
4554 print_wild_statement (&s
->wild_statement
, os
);
4556 case lang_address_statement_enum
:
4557 print_address_statement (&s
->address_statement
);
4559 case lang_object_symbols_statement_enum
:
4560 minfo (" CREATE_OBJECT_SYMBOLS\n");
4562 case lang_fill_statement_enum
:
4563 print_fill_statement (&s
->fill_statement
);
4565 case lang_data_statement_enum
:
4566 print_data_statement (&s
->data_statement
);
4568 case lang_reloc_statement_enum
:
4569 print_reloc_statement (&s
->reloc_statement
);
4571 case lang_input_section_enum
:
4572 print_input_section (s
->input_section
.section
, FALSE
);
4574 case lang_padding_statement_enum
:
4575 print_padding_statement (&s
->padding_statement
);
4577 case lang_output_section_statement_enum
:
4578 print_output_section_statement (&s
->output_section_statement
);
4580 case lang_assignment_statement_enum
:
4581 print_assignment (&s
->assignment_statement
, os
);
4583 case lang_target_statement_enum
:
4584 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4586 case lang_output_statement_enum
:
4587 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4588 if (output_target
!= NULL
)
4589 minfo (" %s", output_target
);
4592 case lang_input_statement_enum
:
4593 print_input_statement (&s
->input_statement
);
4595 case lang_group_statement_enum
:
4596 print_group (&s
->group_statement
, os
);
4598 case lang_insert_statement_enum
:
4599 minfo ("INSERT %s %s\n",
4600 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4601 s
->insert_statement
.where
);
4607 print_statements (void)
4609 print_statement_list (statement_list
.head
, abs_output_section
);
4612 /* Print the first N statements in statement list S to STDERR.
4613 If N == 0, nothing is printed.
4614 If N < 0, the entire list is printed.
4615 Intended to be called from GDB. */
4618 dprint_statement (lang_statement_union_type
*s
, int n
)
4620 FILE *map_save
= config
.map_file
;
4622 config
.map_file
= stderr
;
4625 print_statement_list (s
, abs_output_section
);
4628 while (s
&& --n
>= 0)
4630 print_statement (s
, abs_output_section
);
4635 config
.map_file
= map_save
;
4639 insert_pad (lang_statement_union_type
**ptr
,
4641 bfd_size_type alignment_needed
,
4642 asection
*output_section
,
4645 static fill_type zero_fill
;
4646 lang_statement_union_type
*pad
= NULL
;
4648 if (ptr
!= &statement_list
.head
)
4649 pad
= ((lang_statement_union_type
*)
4650 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4652 && pad
->header
.type
== lang_padding_statement_enum
4653 && pad
->padding_statement
.output_section
== output_section
)
4655 /* Use the existing pad statement. */
4657 else if ((pad
= *ptr
) != NULL
4658 && pad
->header
.type
== lang_padding_statement_enum
4659 && pad
->padding_statement
.output_section
== output_section
)
4661 /* Use the existing pad statement. */
4665 /* Make a new padding statement, linked into existing chain. */
4666 pad
= (lang_statement_union_type
*)
4667 stat_alloc (sizeof (lang_padding_statement_type
));
4668 pad
->header
.next
= *ptr
;
4670 pad
->header
.type
= lang_padding_statement_enum
;
4671 pad
->padding_statement
.output_section
= output_section
;
4674 pad
->padding_statement
.fill
= fill
;
4676 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4677 pad
->padding_statement
.size
= alignment_needed
;
4678 if (!(output_section
->flags
& SEC_FIXED_SIZE
))
4679 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4680 - output_section
->vma
);
4683 /* Work out how much this section will move the dot point. */
4687 (lang_statement_union_type
**this_ptr
,
4688 lang_output_section_statement_type
*output_section_statement
,
4692 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4693 asection
*i
= is
->section
;
4694 asection
*o
= output_section_statement
->bfd_section
;
4696 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4697 i
->output_offset
= i
->vma
- o
->vma
;
4698 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
4699 || output_section_statement
->ignored
)
4700 i
->output_offset
= dot
- o
->vma
;
4703 bfd_size_type alignment_needed
;
4705 /* Align this section first to the input sections requirement,
4706 then to the output section's requirement. If this alignment
4707 is greater than any seen before, then record it too. Perform
4708 the alignment by inserting a magic 'padding' statement. */
4710 if (output_section_statement
->subsection_alignment
!= NULL
)
4712 = exp_get_power (output_section_statement
->subsection_alignment
,
4713 "subsection alignment");
4715 if (o
->alignment_power
< i
->alignment_power
)
4716 o
->alignment_power
= i
->alignment_power
;
4718 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4720 if (alignment_needed
!= 0)
4722 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4723 dot
+= alignment_needed
;
4726 /* Remember where in the output section this input section goes. */
4727 i
->output_offset
= dot
- o
->vma
;
4729 /* Mark how big the output section must be to contain this now. */
4730 dot
+= TO_ADDR (i
->size
);
4731 if (!(o
->flags
& SEC_FIXED_SIZE
))
4732 o
->size
= TO_SIZE (dot
- o
->vma
);
4745 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4747 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4748 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4750 if (sec1
->lma
< sec2
->lma
)
4752 else if (sec1
->lma
> sec2
->lma
)
4754 else if (sec1
->id
< sec2
->id
)
4756 else if (sec1
->id
> sec2
->id
)
4763 sort_sections_by_vma (const void *arg1
, const void *arg2
)
4765 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4766 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4768 if (sec1
->vma
< sec2
->vma
)
4770 else if (sec1
->vma
> sec2
->vma
)
4772 else if (sec1
->id
< sec2
->id
)
4774 else if (sec1
->id
> sec2
->id
)
4780 #define IS_TBSS(s) \
4781 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4783 #define IGNORE_SECTION(s) \
4784 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4786 /* Check to see if any allocated sections overlap with other allocated
4787 sections. This can happen if a linker script specifies the output
4788 section addresses of the two sections. Also check whether any memory
4789 region has overflowed. */
4792 lang_check_section_addresses (void)
4795 struct check_sec
*sections
;
4800 bfd_vma p_start
= 0;
4802 lang_memory_region_type
*m
;
4803 bfd_boolean overlays
;
4805 /* Detect address space overflow on allocated sections. */
4806 addr_mask
= ((bfd_vma
) 1 <<
4807 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
4808 addr_mask
= (addr_mask
<< 1) + 1;
4809 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4810 if ((s
->flags
& SEC_ALLOC
) != 0)
4812 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
4813 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
4814 einfo (_("%X%P: section %s VMA wraps around address space\n"),
4818 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
4819 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
4820 einfo (_("%X%P: section %s LMA wraps around address space\n"),
4825 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4828 count
= bfd_count_sections (link_info
.output_bfd
);
4829 sections
= XNEWVEC (struct check_sec
, count
);
4831 /* Scan all sections in the output list. */
4833 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4835 if (IGNORE_SECTION (s
)
4839 sections
[count
].sec
= s
;
4840 sections
[count
].warned
= FALSE
;
4850 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
4852 /* First check section LMAs. There should be no overlap of LMAs on
4853 loadable sections, even with overlays. */
4854 for (p
= NULL
, i
= 0; i
< count
; i
++)
4856 s
= sections
[i
].sec
;
4857 if ((s
->flags
& SEC_LOAD
) != 0)
4860 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4862 /* Look for an overlap. We have sorted sections by lma, so
4863 we know that s_start >= p_start. Besides the obvious
4864 case of overlap when the current section starts before
4865 the previous one ends, we also must have overlap if the
4866 previous section wraps around the address space. */
4868 && (s_start
<= p_end
4869 || p_end
< p_start
))
4871 einfo (_("%X%P: section %s LMA [%V,%V]"
4872 " overlaps section %s LMA [%V,%V]\n"),
4873 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4874 sections
[i
].warned
= TRUE
;
4882 /* If any non-zero size allocated section (excluding tbss) starts at
4883 exactly the same VMA as another such section, then we have
4884 overlays. Overlays generated by the OVERLAY keyword will have
4885 this property. It is possible to intentionally generate overlays
4886 that fail this test, but it would be unusual. */
4887 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
4889 p_start
= sections
[0].sec
->vma
;
4890 for (i
= 1; i
< count
; i
++)
4892 s_start
= sections
[i
].sec
->vma
;
4893 if (p_start
== s_start
)
4901 /* Now check section VMAs if no overlays were detected. */
4904 for (p
= NULL
, i
= 0; i
< count
; i
++)
4906 s
= sections
[i
].sec
;
4908 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4911 && !sections
[i
].warned
4912 && (s_start
<= p_end
4913 || p_end
< p_start
))
4914 einfo (_("%X%P: section %s VMA [%V,%V]"
4915 " overlaps section %s VMA [%V,%V]\n"),
4916 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4925 /* If any memory region has overflowed, report by how much.
4926 We do not issue this diagnostic for regions that had sections
4927 explicitly placed outside their bounds; os_region_check's
4928 diagnostics are adequate for that case.
4930 FIXME: It is conceivable that m->current - (m->origin + m->length)
4931 might overflow a 32-bit integer. There is, alas, no way to print
4932 a bfd_vma quantity in decimal. */
4933 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4934 if (m
->had_full_message
)
4936 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
4937 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
4938 "%X%P: region `%s' overflowed by %lu bytes\n",
4940 m
->name_list
.name
, over
);
4944 /* Make sure the new address is within the region. We explicitly permit the
4945 current address to be at the exact end of the region when the address is
4946 non-zero, in case the region is at the end of addressable memory and the
4947 calculation wraps around. */
4950 os_region_check (lang_output_section_statement_type
*os
,
4951 lang_memory_region_type
*region
,
4955 if ((region
->current
< region
->origin
4956 || (region
->current
- region
->origin
> region
->length
))
4957 && ((region
->current
!= region
->origin
+ region
->length
)
4962 einfo (_("%X%P: address 0x%v of %pB section `%s'"
4963 " is not within region `%s'\n"),
4965 os
->bfd_section
->owner
,
4966 os
->bfd_section
->name
,
4967 region
->name_list
.name
);
4969 else if (!region
->had_full_message
)
4971 region
->had_full_message
= TRUE
;
4973 einfo (_("%X%P: %pB section `%s' will not fit in region `%s'\n"),
4974 os
->bfd_section
->owner
,
4975 os
->bfd_section
->name
,
4976 region
->name_list
.name
);
4982 ldlang_check_relro_region (lang_statement_union_type
*s
,
4983 seg_align_type
*seg
)
4985 if (seg
->relro
== exp_seg_relro_start
)
4987 if (!seg
->relro_start_stat
)
4988 seg
->relro_start_stat
= s
;
4991 ASSERT (seg
->relro_start_stat
== s
);
4994 else if (seg
->relro
== exp_seg_relro_end
)
4996 if (!seg
->relro_end_stat
)
4997 seg
->relro_end_stat
= s
;
5000 ASSERT (seg
->relro_end_stat
== s
);
5005 /* Set the sizes for all the output sections. */
5008 lang_size_sections_1
5009 (lang_statement_union_type
**prev
,
5010 lang_output_section_statement_type
*output_section_statement
,
5014 bfd_boolean check_regions
)
5016 lang_statement_union_type
*s
;
5018 /* Size up the sections from their constituent parts. */
5019 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
5021 switch (s
->header
.type
)
5023 case lang_output_section_statement_enum
:
5025 bfd_vma newdot
, after
, dotdelta
;
5026 lang_output_section_statement_type
*os
;
5027 lang_memory_region_type
*r
;
5028 int section_alignment
= 0;
5030 os
= &s
->output_section_statement
;
5031 if (os
->constraint
== -1)
5034 /* FIXME: We shouldn't need to zero section vmas for ld -r
5035 here, in lang_insert_orphan, or in the default linker scripts.
5036 This is covering for coff backend linker bugs. See PR6945. */
5037 if (os
->addr_tree
== NULL
5038 && bfd_link_relocatable (&link_info
)
5039 && (bfd_get_flavour (link_info
.output_bfd
)
5040 == bfd_target_coff_flavour
))
5041 os
->addr_tree
= exp_intop (0);
5042 if (os
->addr_tree
!= NULL
)
5044 os
->processed_vma
= FALSE
;
5045 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5047 if (expld
.result
.valid_p
)
5049 dot
= expld
.result
.value
;
5050 if (expld
.result
.section
!= NULL
)
5051 dot
+= expld
.result
.section
->vma
;
5053 else if (expld
.phase
!= lang_mark_phase_enum
)
5054 einfo (_("%F%P:%pS: non constant or forward reference"
5055 " address expression for section %s\n"),
5056 os
->addr_tree
, os
->name
);
5059 if (os
->bfd_section
== NULL
)
5060 /* This section was removed or never actually created. */
5063 /* If this is a COFF shared library section, use the size and
5064 address from the input section. FIXME: This is COFF
5065 specific; it would be cleaner if there were some other way
5066 to do this, but nothing simple comes to mind. */
5067 if (((bfd_get_flavour (link_info
.output_bfd
)
5068 == bfd_target_ecoff_flavour
)
5069 || (bfd_get_flavour (link_info
.output_bfd
)
5070 == bfd_target_coff_flavour
))
5071 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5075 if (os
->children
.head
== NULL
5076 || os
->children
.head
->header
.next
!= NULL
5077 || (os
->children
.head
->header
.type
5078 != lang_input_section_enum
))
5079 einfo (_("%X%P: internal error on COFF shared library"
5080 " section %s\n"), os
->name
);
5082 input
= os
->children
.head
->input_section
.section
;
5083 bfd_set_section_vma (os
->bfd_section
->owner
,
5085 bfd_section_vma (input
->owner
, input
));
5086 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5087 os
->bfd_section
->size
= input
->size
;
5093 if (bfd_is_abs_section (os
->bfd_section
))
5095 /* No matter what happens, an abs section starts at zero. */
5096 ASSERT (os
->bfd_section
->vma
== 0);
5100 if (os
->addr_tree
== NULL
)
5102 /* No address specified for this section, get one
5103 from the region specification. */
5104 if (os
->region
== NULL
5105 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5106 && os
->region
->name_list
.name
[0] == '*'
5107 && strcmp (os
->region
->name_list
.name
,
5108 DEFAULT_MEMORY_REGION
) == 0))
5110 os
->region
= lang_memory_default (os
->bfd_section
);
5113 /* If a loadable section is using the default memory
5114 region, and some non default memory regions were
5115 defined, issue an error message. */
5117 && !IGNORE_SECTION (os
->bfd_section
)
5118 && !bfd_link_relocatable (&link_info
)
5120 && strcmp (os
->region
->name_list
.name
,
5121 DEFAULT_MEMORY_REGION
) == 0
5122 && lang_memory_region_list
!= NULL
5123 && (strcmp (lang_memory_region_list
->name_list
.name
,
5124 DEFAULT_MEMORY_REGION
) != 0
5125 || lang_memory_region_list
->next
!= NULL
)
5126 && expld
.phase
!= lang_mark_phase_enum
)
5128 /* By default this is an error rather than just a
5129 warning because if we allocate the section to the
5130 default memory region we can end up creating an
5131 excessively large binary, or even seg faulting when
5132 attempting to perform a negative seek. See
5133 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5134 for an example of this. This behaviour can be
5135 overridden by the using the --no-check-sections
5137 if (command_line
.check_section_addresses
)
5138 einfo (_("%F%P: error: no memory region specified"
5139 " for loadable section `%s'\n"),
5140 bfd_get_section_name (link_info
.output_bfd
,
5143 einfo (_("%P: warning: no memory region specified"
5144 " for loadable section `%s'\n"),
5145 bfd_get_section_name (link_info
.output_bfd
,
5149 newdot
= os
->region
->current
;
5150 section_alignment
= os
->bfd_section
->alignment_power
;
5153 section_alignment
= exp_get_power (os
->section_alignment
,
5154 "section alignment");
5156 /* Align to what the section needs. */
5157 if (section_alignment
> 0)
5159 bfd_vma savedot
= newdot
;
5160 newdot
= align_power (newdot
, section_alignment
);
5162 dotdelta
= newdot
- savedot
;
5164 && (config
.warn_section_align
5165 || os
->addr_tree
!= NULL
)
5166 && expld
.phase
!= lang_mark_phase_enum
)
5167 einfo (ngettext ("%P: warning: changing start of "
5168 "section %s by %lu byte\n",
5169 "%P: warning: changing start of "
5170 "section %s by %lu bytes\n",
5171 (unsigned long) dotdelta
),
5172 os
->name
, (unsigned long) dotdelta
);
5175 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
5177 os
->bfd_section
->output_offset
= 0;
5180 lang_size_sections_1 (&os
->children
.head
, os
,
5181 os
->fill
, newdot
, relax
, check_regions
);
5183 os
->processed_vma
= TRUE
;
5185 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5186 /* Except for some special linker created sections,
5187 no output section should change from zero size
5188 after strip_excluded_output_sections. A non-zero
5189 size on an ignored section indicates that some
5190 input section was not sized early enough. */
5191 ASSERT (os
->bfd_section
->size
== 0);
5194 dot
= os
->bfd_section
->vma
;
5196 /* Put the section within the requested block size, or
5197 align at the block boundary. */
5199 + TO_ADDR (os
->bfd_section
->size
)
5200 + os
->block_value
- 1)
5201 & - (bfd_vma
) os
->block_value
);
5203 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5204 os
->bfd_section
->size
= TO_SIZE (after
5205 - os
->bfd_section
->vma
);
5208 /* Set section lma. */
5211 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5215 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5216 os
->bfd_section
->lma
= lma
;
5218 else if (os
->lma_region
!= NULL
)
5220 bfd_vma lma
= os
->lma_region
->current
;
5222 if (os
->align_lma_with_input
)
5226 /* When LMA_REGION is the same as REGION, align the LMA
5227 as we did for the VMA, possibly including alignment
5228 from the bfd section. If a different region, then
5229 only align according to the value in the output
5231 if (os
->lma_region
!= os
->region
)
5232 section_alignment
= exp_get_power (os
->section_alignment
,
5233 "section alignment");
5234 if (section_alignment
> 0)
5235 lma
= align_power (lma
, section_alignment
);
5237 os
->bfd_section
->lma
= lma
;
5239 else if (r
->last_os
!= NULL
5240 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5245 last
= r
->last_os
->output_section_statement
.bfd_section
;
5247 /* A backwards move of dot should be accompanied by
5248 an explicit assignment to the section LMA (ie.
5249 os->load_base set) because backwards moves can
5250 create overlapping LMAs. */
5252 && os
->bfd_section
->size
!= 0
5253 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5255 /* If dot moved backwards then leave lma equal to
5256 vma. This is the old default lma, which might
5257 just happen to work when the backwards move is
5258 sufficiently large. Nag if this changes anything,
5259 so people can fix their linker scripts. */
5261 if (last
->vma
!= last
->lma
)
5262 einfo (_("%P: warning: dot moved backwards "
5263 "before `%s'\n"), os
->name
);
5267 /* If this is an overlay, set the current lma to that
5268 at the end of the previous section. */
5269 if (os
->sectype
== overlay_section
)
5270 lma
= last
->lma
+ TO_ADDR (last
->size
);
5272 /* Otherwise, keep the same lma to vma relationship
5273 as the previous section. */
5275 lma
= dot
+ last
->lma
- last
->vma
;
5277 if (section_alignment
> 0)
5278 lma
= align_power (lma
, section_alignment
);
5279 os
->bfd_section
->lma
= lma
;
5282 os
->processed_lma
= TRUE
;
5284 /* Keep track of normal sections using the default
5285 lma region. We use this to set the lma for
5286 following sections. Overlays or other linker
5287 script assignment to lma might mean that the
5288 default lma == vma is incorrect.
5289 To avoid warnings about dot moving backwards when using
5290 -Ttext, don't start tracking sections until we find one
5291 of non-zero size or with lma set differently to vma.
5292 Do this tracking before we short-cut the loop so that we
5293 track changes for the case where the section size is zero,
5294 but the lma is set differently to the vma. This is
5295 important, if an orphan section is placed after an
5296 otherwise empty output section that has an explicit lma
5297 set, we want that lma reflected in the orphans lma. */
5298 if (!IGNORE_SECTION (os
->bfd_section
)
5299 && (os
->bfd_section
->size
!= 0
5300 || (r
->last_os
== NULL
5301 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5302 || (r
->last_os
!= NULL
5303 && dot
>= (r
->last_os
->output_section_statement
5304 .bfd_section
->vma
)))
5305 && os
->lma_region
== NULL
5306 && !bfd_link_relocatable (&link_info
))
5309 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5312 /* .tbss sections effectively have zero size. */
5313 if (!IS_TBSS (os
->bfd_section
)
5314 || bfd_link_relocatable (&link_info
))
5315 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5320 if (os
->update_dot_tree
!= 0)
5321 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5323 /* Update dot in the region ?
5324 We only do this if the section is going to be allocated,
5325 since unallocated sections do not contribute to the region's
5326 overall size in memory. */
5327 if (os
->region
!= NULL
5328 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5330 os
->region
->current
= dot
;
5333 /* Make sure the new address is within the region. */
5334 os_region_check (os
, os
->region
, os
->addr_tree
,
5335 os
->bfd_section
->vma
);
5337 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5338 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5339 || os
->align_lma_with_input
))
5341 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5344 os_region_check (os
, os
->lma_region
, NULL
,
5345 os
->bfd_section
->lma
);
5351 case lang_constructors_statement_enum
:
5352 dot
= lang_size_sections_1 (&constructor_list
.head
,
5353 output_section_statement
,
5354 fill
, dot
, relax
, check_regions
);
5357 case lang_data_statement_enum
:
5359 unsigned int size
= 0;
5361 s
->data_statement
.output_offset
=
5362 dot
- output_section_statement
->bfd_section
->vma
;
5363 s
->data_statement
.output_section
=
5364 output_section_statement
->bfd_section
;
5366 /* We might refer to provided symbols in the expression, and
5367 need to mark them as needed. */
5368 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5370 switch (s
->data_statement
.type
)
5388 if (size
< TO_SIZE ((unsigned) 1))
5389 size
= TO_SIZE ((unsigned) 1);
5390 dot
+= TO_ADDR (size
);
5391 if (!(output_section_statement
->bfd_section
->flags
5393 output_section_statement
->bfd_section
->size
5394 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5399 case lang_reloc_statement_enum
:
5403 s
->reloc_statement
.output_offset
=
5404 dot
- output_section_statement
->bfd_section
->vma
;
5405 s
->reloc_statement
.output_section
=
5406 output_section_statement
->bfd_section
;
5407 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5408 dot
+= TO_ADDR (size
);
5409 if (!(output_section_statement
->bfd_section
->flags
5411 output_section_statement
->bfd_section
->size
5412 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5416 case lang_wild_statement_enum
:
5417 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5418 output_section_statement
,
5419 fill
, dot
, relax
, check_regions
);
5422 case lang_object_symbols_statement_enum
:
5423 link_info
.create_object_symbols_section
=
5424 output_section_statement
->bfd_section
;
5427 case lang_output_statement_enum
:
5428 case lang_target_statement_enum
:
5431 case lang_input_section_enum
:
5435 i
= s
->input_section
.section
;
5440 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5441 einfo (_("%F%P: can't relax section: %E\n"));
5445 dot
= size_input_section (prev
, output_section_statement
,
5450 case lang_input_statement_enum
:
5453 case lang_fill_statement_enum
:
5454 s
->fill_statement
.output_section
=
5455 output_section_statement
->bfd_section
;
5457 fill
= s
->fill_statement
.fill
;
5460 case lang_assignment_statement_enum
:
5462 bfd_vma newdot
= dot
;
5463 etree_type
*tree
= s
->assignment_statement
.exp
;
5465 expld
.dataseg
.relro
= exp_seg_relro_none
;
5467 exp_fold_tree (tree
,
5468 output_section_statement
->bfd_section
,
5471 ldlang_check_relro_region (s
, &expld
.dataseg
);
5473 expld
.dataseg
.relro
= exp_seg_relro_none
;
5475 /* This symbol may be relative to this section. */
5476 if ((tree
->type
.node_class
== etree_provided
5477 || tree
->type
.node_class
== etree_assign
)
5478 && (tree
->assign
.dst
[0] != '.'
5479 || tree
->assign
.dst
[1] != '\0'))
5480 output_section_statement
->update_dot
= 1;
5482 if (!output_section_statement
->ignored
)
5484 if (output_section_statement
== abs_output_section
)
5486 /* If we don't have an output section, then just adjust
5487 the default memory address. */
5488 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5489 FALSE
)->current
= newdot
;
5491 else if (newdot
!= dot
)
5493 /* Insert a pad after this statement. We can't
5494 put the pad before when relaxing, in case the
5495 assignment references dot. */
5496 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5497 output_section_statement
->bfd_section
, dot
);
5499 /* Don't neuter the pad below when relaxing. */
5502 /* If dot is advanced, this implies that the section
5503 should have space allocated to it, unless the
5504 user has explicitly stated that the section
5505 should not be allocated. */
5506 if (output_section_statement
->sectype
!= noalloc_section
5507 && (output_section_statement
->sectype
!= noload_section
5508 || (bfd_get_flavour (link_info
.output_bfd
)
5509 == bfd_target_elf_flavour
)))
5510 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5517 case lang_padding_statement_enum
:
5518 /* If this is the first time lang_size_sections is called,
5519 we won't have any padding statements. If this is the
5520 second or later passes when relaxing, we should allow
5521 padding to shrink. If padding is needed on this pass, it
5522 will be added back in. */
5523 s
->padding_statement
.size
= 0;
5525 /* Make sure output_offset is valid. If relaxation shrinks
5526 the section and this pad isn't needed, it's possible to
5527 have output_offset larger than the final size of the
5528 section. bfd_set_section_contents will complain even for
5529 a pad size of zero. */
5530 s
->padding_statement
.output_offset
5531 = dot
- output_section_statement
->bfd_section
->vma
;
5534 case lang_group_statement_enum
:
5535 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5536 output_section_statement
,
5537 fill
, dot
, relax
, check_regions
);
5540 case lang_insert_statement_enum
:
5543 /* We can only get here when relaxing is turned on. */
5544 case lang_address_statement_enum
:
5551 prev
= &s
->header
.next
;
5556 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5557 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5558 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5559 segments. We are allowed an opportunity to override this decision. */
5562 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
5563 bfd
*abfd ATTRIBUTE_UNUSED
,
5564 asection
*current_section
,
5565 asection
*previous_section
,
5566 bfd_boolean new_segment
)
5568 lang_output_section_statement_type
*cur
;
5569 lang_output_section_statement_type
*prev
;
5571 /* The checks below are only necessary when the BFD library has decided
5572 that the two sections ought to be placed into the same segment. */
5576 /* Paranoia checks. */
5577 if (current_section
== NULL
|| previous_section
== NULL
)
5580 /* If this flag is set, the target never wants code and non-code
5581 sections comingled in the same segment. */
5582 if (config
.separate_code
5583 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5586 /* Find the memory regions associated with the two sections.
5587 We call lang_output_section_find() here rather than scanning the list
5588 of output sections looking for a matching section pointer because if
5589 we have a large number of sections then a hash lookup is faster. */
5590 cur
= lang_output_section_find (current_section
->name
);
5591 prev
= lang_output_section_find (previous_section
->name
);
5593 /* More paranoia. */
5594 if (cur
== NULL
|| prev
== NULL
)
5597 /* If the regions are different then force the sections to live in
5598 different segments. See the email thread starting at the following
5599 URL for the reasons why this is necessary:
5600 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5601 return cur
->region
!= prev
->region
;
5605 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5607 lang_statement_iteration
++;
5608 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5609 0, 0, relax
, check_regions
);
5613 lang_size_segment (seg_align_type
*seg
)
5615 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
5616 a page could be saved in the data segment. */
5617 bfd_vma first
, last
;
5619 first
= -seg
->base
& (seg
->pagesize
- 1);
5620 last
= seg
->end
& (seg
->pagesize
- 1);
5622 && ((seg
->base
& ~(seg
->pagesize
- 1))
5623 != (seg
->end
& ~(seg
->pagesize
- 1)))
5624 && first
+ last
<= seg
->pagesize
)
5626 seg
->phase
= exp_seg_adjust
;
5630 seg
->phase
= exp_seg_done
;
5635 lang_size_relro_segment_1 (seg_align_type
*seg
)
5637 bfd_vma relro_end
, desired_end
;
5640 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
5641 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
5642 & ~(seg
->pagesize
- 1));
5644 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
5645 desired_end
= relro_end
- seg
->relro_offset
;
5647 /* For sections in the relro segment.. */
5648 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
5649 if ((sec
->flags
& SEC_ALLOC
) != 0
5650 && sec
->vma
>= seg
->base
5651 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
5653 /* Where do we want to put this section so that it ends as
5655 bfd_vma start
, end
, bump
;
5657 end
= start
= sec
->vma
;
5659 end
+= TO_ADDR (sec
->size
);
5660 bump
= desired_end
- end
;
5661 /* We'd like to increase START by BUMP, but we must heed
5662 alignment so the increase might be less than optimum. */
5664 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
5665 /* This is now the desired end for the previous section. */
5666 desired_end
= start
;
5669 seg
->phase
= exp_seg_relro_adjust
;
5670 ASSERT (desired_end
>= seg
->base
);
5671 seg
->base
= desired_end
;
5676 lang_size_relro_segment (bfd_boolean
*relax
, bfd_boolean check_regions
)
5678 bfd_boolean do_reset
= FALSE
;
5679 bfd_boolean do_data_relro
;
5680 bfd_vma data_initial_base
, data_relro_end
;
5682 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5684 do_data_relro
= TRUE
;
5685 data_initial_base
= expld
.dataseg
.base
;
5686 data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
5690 do_data_relro
= FALSE
;
5691 data_initial_base
= data_relro_end
= 0;
5696 lang_reset_memory_regions ();
5697 one_lang_size_sections_pass (relax
, check_regions
);
5699 /* Assignments to dot, or to output section address in a user
5700 script have increased padding over the original. Revert. */
5701 if (do_data_relro
&& expld
.dataseg
.relro_end
> data_relro_end
)
5703 expld
.dataseg
.base
= data_initial_base
;;
5708 if (!do_data_relro
&& lang_size_segment (&expld
.dataseg
))
5715 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5717 expld
.phase
= lang_allocating_phase_enum
;
5718 expld
.dataseg
.phase
= exp_seg_none
;
5720 one_lang_size_sections_pass (relax
, check_regions
);
5722 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
5723 expld
.dataseg
.phase
= exp_seg_done
;
5725 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
5727 bfd_boolean do_reset
5728 = lang_size_relro_segment (relax
, check_regions
);
5732 lang_reset_memory_regions ();
5733 one_lang_size_sections_pass (relax
, check_regions
);
5736 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5738 link_info
.relro_start
= expld
.dataseg
.base
;
5739 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5744 static lang_output_section_statement_type
*current_section
;
5745 static lang_assignment_statement_type
*current_assign
;
5746 static bfd_boolean prefer_next_section
;
5748 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5751 lang_do_assignments_1 (lang_statement_union_type
*s
,
5752 lang_output_section_statement_type
*current_os
,
5755 bfd_boolean
*found_end
)
5757 for (; s
!= NULL
; s
= s
->header
.next
)
5759 switch (s
->header
.type
)
5761 case lang_constructors_statement_enum
:
5762 dot
= lang_do_assignments_1 (constructor_list
.head
,
5763 current_os
, fill
, dot
, found_end
);
5766 case lang_output_section_statement_enum
:
5768 lang_output_section_statement_type
*os
;
5771 os
= &(s
->output_section_statement
);
5772 os
->after_end
= *found_end
;
5773 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5775 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5777 current_section
= os
;
5778 prefer_next_section
= FALSE
;
5780 dot
= os
->bfd_section
->vma
;
5782 newdot
= lang_do_assignments_1 (os
->children
.head
,
5783 os
, os
->fill
, dot
, found_end
);
5786 if (os
->bfd_section
!= NULL
)
5788 /* .tbss sections effectively have zero size. */
5789 if (!IS_TBSS (os
->bfd_section
)
5790 || bfd_link_relocatable (&link_info
))
5791 dot
+= TO_ADDR (os
->bfd_section
->size
);
5793 if (os
->update_dot_tree
!= NULL
)
5794 exp_fold_tree (os
->update_dot_tree
,
5795 bfd_abs_section_ptr
, &dot
);
5803 case lang_wild_statement_enum
:
5805 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5806 current_os
, fill
, dot
, found_end
);
5809 case lang_object_symbols_statement_enum
:
5810 case lang_output_statement_enum
:
5811 case lang_target_statement_enum
:
5814 case lang_data_statement_enum
:
5815 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5816 if (expld
.result
.valid_p
)
5818 s
->data_statement
.value
= expld
.result
.value
;
5819 if (expld
.result
.section
!= NULL
)
5820 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5822 else if (expld
.phase
== lang_final_phase_enum
)
5823 einfo (_("%F%P: invalid data statement\n"));
5826 switch (s
->data_statement
.type
)
5844 if (size
< TO_SIZE ((unsigned) 1))
5845 size
= TO_SIZE ((unsigned) 1);
5846 dot
+= TO_ADDR (size
);
5850 case lang_reloc_statement_enum
:
5851 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5852 bfd_abs_section_ptr
, &dot
);
5853 if (expld
.result
.valid_p
)
5854 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5855 else if (expld
.phase
== lang_final_phase_enum
)
5856 einfo (_("%F%P: invalid reloc statement\n"));
5857 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5860 case lang_input_section_enum
:
5862 asection
*in
= s
->input_section
.section
;
5864 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5865 dot
+= TO_ADDR (in
->size
);
5869 case lang_input_statement_enum
:
5872 case lang_fill_statement_enum
:
5873 fill
= s
->fill_statement
.fill
;
5876 case lang_assignment_statement_enum
:
5877 current_assign
= &s
->assignment_statement
;
5878 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5880 const char *p
= current_assign
->exp
->assign
.dst
;
5882 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5883 prefer_next_section
= TRUE
;
5887 if (strcmp (p
, "end") == 0)
5890 exp_fold_tree (s
->assignment_statement
.exp
,
5891 (current_os
->bfd_section
!= NULL
5892 ? current_os
->bfd_section
: bfd_und_section_ptr
),
5896 case lang_padding_statement_enum
:
5897 dot
+= TO_ADDR (s
->padding_statement
.size
);
5900 case lang_group_statement_enum
:
5901 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5902 current_os
, fill
, dot
, found_end
);
5905 case lang_insert_statement_enum
:
5908 case lang_address_statement_enum
:
5920 lang_do_assignments (lang_phase_type phase
)
5922 bfd_boolean found_end
= FALSE
;
5924 current_section
= NULL
;
5925 prefer_next_section
= FALSE
;
5926 expld
.phase
= phase
;
5927 lang_statement_iteration
++;
5928 lang_do_assignments_1 (statement_list
.head
,
5929 abs_output_section
, NULL
, 0, &found_end
);
5932 /* For an assignment statement outside of an output section statement,
5933 choose the best of neighbouring output sections to use for values
5937 section_for_dot (void)
5941 /* Assignments belong to the previous output section, unless there
5942 has been an assignment to "dot", in which case following
5943 assignments belong to the next output section. (The assumption
5944 is that an assignment to "dot" is setting up the address for the
5945 next output section.) Except that past the assignment to "_end"
5946 we always associate with the previous section. This exception is
5947 for targets like SH that define an alloc .stack or other
5948 weirdness after non-alloc sections. */
5949 if (current_section
== NULL
|| prefer_next_section
)
5951 lang_statement_union_type
*stmt
;
5952 lang_output_section_statement_type
*os
;
5954 for (stmt
= (lang_statement_union_type
*) current_assign
;
5956 stmt
= stmt
->header
.next
)
5957 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5960 os
= &stmt
->output_section_statement
;
5963 && (os
->bfd_section
== NULL
5964 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5965 || bfd_section_removed_from_list (link_info
.output_bfd
,
5969 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5972 s
= os
->bfd_section
;
5974 s
= link_info
.output_bfd
->section_last
;
5976 && ((s
->flags
& SEC_ALLOC
) == 0
5977 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5982 return bfd_abs_section_ptr
;
5986 s
= current_section
->bfd_section
;
5988 /* The section may have been stripped. */
5990 && ((s
->flags
& SEC_EXCLUDE
) != 0
5991 || (s
->flags
& SEC_ALLOC
) == 0
5992 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5993 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5996 s
= link_info
.output_bfd
->sections
;
5998 && ((s
->flags
& SEC_ALLOC
) == 0
5999 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6004 return bfd_abs_section_ptr
;
6007 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
6009 static struct bfd_link_hash_entry
**start_stop_syms
;
6010 static size_t start_stop_count
= 0;
6011 static size_t start_stop_alloc
= 0;
6013 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6014 to start_stop_syms. */
6017 lang_define_start_stop (const char *symbol
, asection
*sec
)
6019 struct bfd_link_hash_entry
*h
;
6021 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6024 if (start_stop_count
== start_stop_alloc
)
6026 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6028 = xrealloc (start_stop_syms
,
6029 start_stop_alloc
* sizeof (*start_stop_syms
));
6031 start_stop_syms
[start_stop_count
++] = h
;
6035 /* Check for input sections whose names match references to
6036 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6037 preliminary definitions. */
6040 lang_init_start_stop (void)
6044 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6046 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6047 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6050 const char *secname
= s
->name
;
6052 for (ps
= secname
; *ps
!= '\0'; ps
++)
6053 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6057 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6059 symbol
[0] = leading_char
;
6060 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6061 lang_define_start_stop (symbol
, s
);
6063 symbol
[1] = leading_char
;
6064 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6065 lang_define_start_stop (symbol
+ 1, s
);
6072 /* Iterate over start_stop_syms. */
6075 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6079 for (i
= 0; i
< start_stop_count
; ++i
)
6080 func (start_stop_syms
[i
]);
6083 /* __start and __stop symbols are only supposed to be defined by the
6084 linker for orphan sections, but we now extend that to sections that
6085 map to an output section of the same name. The symbols were
6086 defined early for --gc-sections, before we mapped input to output
6087 sections, so undo those that don't satisfy this rule. */
6090 undef_start_stop (struct bfd_link_hash_entry
*h
)
6092 if (h
->ldscript_def
)
6095 if (h
->u
.def
.section
->output_section
== NULL
6096 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6097 || strcmp (h
->u
.def
.section
->name
,
6098 h
->u
.def
.section
->output_section
->name
) != 0)
6100 h
->type
= bfd_link_hash_undefined
;
6101 h
->u
.undef
.abfd
= NULL
;
6106 lang_undef_start_stop (void)
6108 foreach_start_stop (undef_start_stop
);
6111 /* Check for output sections whose names match references to
6112 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6113 preliminary definitions. */
6116 lang_init_startof_sizeof (void)
6120 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6122 const char *secname
= s
->name
;
6123 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6125 sprintf (symbol
, ".startof.%s", secname
);
6126 lang_define_start_stop (symbol
, s
);
6128 memcpy (symbol
+ 1, ".size", 5);
6129 lang_define_start_stop (symbol
+ 1, s
);
6134 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6137 set_start_stop (struct bfd_link_hash_entry
*h
)
6140 || h
->type
!= bfd_link_hash_defined
)
6143 if (h
->root
.string
[0] == '.')
6145 /* .startof. or .sizeof. symbol.
6146 .startof. already has final value. */
6147 if (h
->root
.string
[2] == 'i')
6150 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6151 h
->u
.def
.section
= bfd_abs_section_ptr
;
6156 /* __start or __stop symbol. */
6157 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6159 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6160 if (h
->root
.string
[4 + has_lead
] == 'o')
6163 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6169 lang_finalize_start_stop (void)
6171 foreach_start_stop (set_start_stop
);
6177 struct bfd_link_hash_entry
*h
;
6180 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
6181 || bfd_link_dll (&link_info
))
6182 warn
= entry_from_cmdline
;
6186 /* Force the user to specify a root when generating a relocatable with
6188 if (link_info
.gc_sections
&& bfd_link_relocatable (&link_info
)
6189 && !(entry_from_cmdline
|| undef_from_cmdline
))
6190 einfo (_("%F%P: gc-sections requires either an entry or "
6191 "an undefined symbol\n"));
6193 if (entry_symbol
.name
== NULL
)
6195 /* No entry has been specified. Look for the default entry, but
6196 don't warn if we don't find it. */
6197 entry_symbol
.name
= entry_symbol_default
;
6201 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
6202 FALSE
, FALSE
, TRUE
);
6204 && (h
->type
== bfd_link_hash_defined
6205 || h
->type
== bfd_link_hash_defweak
)
6206 && h
->u
.def
.section
->output_section
!= NULL
)
6210 val
= (h
->u
.def
.value
6211 + bfd_get_section_vma (link_info
.output_bfd
,
6212 h
->u
.def
.section
->output_section
)
6213 + h
->u
.def
.section
->output_offset
);
6214 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6215 einfo (_("%F%P: %s: can't set start address\n"), entry_symbol
.name
);
6222 /* We couldn't find the entry symbol. Try parsing it as a
6224 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
6227 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6228 einfo (_("%F%P: can't set start address\n"));
6234 /* Can't find the entry symbol, and it's not a number. Use
6235 the first address in the text section. */
6236 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
6240 einfo (_("%P: warning: cannot find entry symbol %s;"
6241 " defaulting to %V\n"),
6243 bfd_get_section_vma (link_info
.output_bfd
, ts
));
6244 if (!(bfd_set_start_address
6245 (link_info
.output_bfd
,
6246 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
6247 einfo (_("%F%P: can't set start address\n"));
6252 einfo (_("%P: warning: cannot find entry symbol %s;"
6253 " not setting start address\n"),
6260 /* This is a small function used when we want to ignore errors from
6264 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
6265 va_list ap ATTRIBUTE_UNUSED
)
6267 /* Don't do anything. */
6270 /* Check that the architecture of all the input files is compatible
6271 with the output file. Also call the backend to let it do any
6272 other checking that is needed. */
6277 lang_statement_union_type
*file
;
6279 const bfd_arch_info_type
*compatible
;
6281 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
6283 #ifdef ENABLE_PLUGINS
6284 /* Don't check format of files claimed by plugin. */
6285 if (file
->input_statement
.flags
.claimed
)
6287 #endif /* ENABLE_PLUGINS */
6288 input_bfd
= file
->input_statement
.the_bfd
;
6290 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
6291 command_line
.accept_unknown_input_arch
);
6293 /* In general it is not possible to perform a relocatable
6294 link between differing object formats when the input
6295 file has relocations, because the relocations in the
6296 input format may not have equivalent representations in
6297 the output format (and besides BFD does not translate
6298 relocs for other link purposes than a final link). */
6299 if ((bfd_link_relocatable (&link_info
)
6300 || link_info
.emitrelocations
)
6301 && (compatible
== NULL
6302 || (bfd_get_flavour (input_bfd
)
6303 != bfd_get_flavour (link_info
.output_bfd
)))
6304 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
6306 einfo (_("%F%P: relocatable linking with relocations from"
6307 " format %s (%pB) to format %s (%pB) is not supported\n"),
6308 bfd_get_target (input_bfd
), input_bfd
,
6309 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
6310 /* einfo with %F exits. */
6313 if (compatible
== NULL
)
6315 if (command_line
.warn_mismatch
)
6316 einfo (_("%X%P: %s architecture of input file `%pB'"
6317 " is incompatible with %s output\n"),
6318 bfd_printable_name (input_bfd
), input_bfd
,
6319 bfd_printable_name (link_info
.output_bfd
));
6321 else if (bfd_count_sections (input_bfd
))
6323 /* If the input bfd has no contents, it shouldn't set the
6324 private data of the output bfd. */
6326 bfd_error_handler_type pfn
= NULL
;
6328 /* If we aren't supposed to warn about mismatched input
6329 files, temporarily set the BFD error handler to a
6330 function which will do nothing. We still want to call
6331 bfd_merge_private_bfd_data, since it may set up
6332 information which is needed in the output file. */
6333 if (!command_line
.warn_mismatch
)
6334 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
6335 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
6337 if (command_line
.warn_mismatch
)
6338 einfo (_("%X%P: failed to merge target specific data"
6339 " of file %pB\n"), input_bfd
);
6341 if (!command_line
.warn_mismatch
)
6342 bfd_set_error_handler (pfn
);
6347 /* Look through all the global common symbols and attach them to the
6348 correct section. The -sort-common command line switch may be used
6349 to roughly sort the entries by alignment. */
6354 if (link_info
.inhibit_common_definition
)
6356 if (bfd_link_relocatable (&link_info
)
6357 && !command_line
.force_common_definition
)
6360 if (!config
.sort_common
)
6361 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
6366 if (config
.sort_common
== sort_descending
)
6368 for (power
= 4; power
> 0; power
--)
6369 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6372 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6376 for (power
= 0; power
<= 4; power
++)
6377 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6379 power
= (unsigned int) -1;
6380 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6385 /* Place one common symbol in the correct section. */
6388 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
6390 unsigned int power_of_two
;
6394 if (h
->type
!= bfd_link_hash_common
)
6398 power_of_two
= h
->u
.c
.p
->alignment_power
;
6400 if (config
.sort_common
== sort_descending
6401 && power_of_two
< *(unsigned int *) info
)
6403 else if (config
.sort_common
== sort_ascending
6404 && power_of_two
> *(unsigned int *) info
)
6407 section
= h
->u
.c
.p
->section
;
6408 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6409 einfo (_("%F%P: could not define common symbol `%pT': %E\n"),
6412 if (config
.map_file
!= NULL
)
6414 static bfd_boolean header_printed
;
6419 if (!header_printed
)
6421 minfo (_("\nAllocating common symbols\n"));
6422 minfo (_("Common symbol size file\n\n"));
6423 header_printed
= TRUE
;
6426 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6427 DMGL_ANSI
| DMGL_PARAMS
);
6430 minfo ("%s", h
->root
.string
);
6431 len
= strlen (h
->root
.string
);
6436 len
= strlen (name
);
6452 if (size
<= 0xffffffff)
6453 sprintf (buf
, "%lx", (unsigned long) size
);
6455 sprintf_vma (buf
, size
);
6465 minfo ("%pB\n", section
->owner
);
6471 /* Handle a single orphan section S, placing the orphan into an appropriate
6472 output section. The effects of the --orphan-handling command line
6473 option are handled here. */
6476 ldlang_place_orphan (asection
*s
)
6478 if (config
.orphan_handling
== orphan_handling_discard
)
6480 lang_output_section_statement_type
*os
;
6481 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0,
6483 if (os
->addr_tree
== NULL
6484 && (bfd_link_relocatable (&link_info
)
6485 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6486 os
->addr_tree
= exp_intop (0);
6487 lang_add_section (&os
->children
, s
, NULL
, os
);
6491 lang_output_section_statement_type
*os
;
6492 const char *name
= s
->name
;
6495 if (config
.orphan_handling
== orphan_handling_error
)
6496 einfo (_("%X%P: error: unplaced orphan section `%pA' from `%pB'\n"),
6499 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
6500 constraint
= SPECIAL
;
6502 os
= ldemul_place_orphan (s
, name
, constraint
);
6505 os
= lang_output_section_statement_lookup (name
, constraint
, TRUE
);
6506 if (os
->addr_tree
== NULL
6507 && (bfd_link_relocatable (&link_info
)
6508 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6509 os
->addr_tree
= exp_intop (0);
6510 lang_add_section (&os
->children
, s
, NULL
, os
);
6513 if (config
.orphan_handling
== orphan_handling_warn
)
6514 einfo (_("%P: warning: orphan section `%pA' from `%pB' being "
6515 "placed in section `%s'\n"),
6516 s
, s
->owner
, os
->name
);
6520 /* Run through the input files and ensure that every input section has
6521 somewhere to go. If one is found without a destination then create
6522 an input request and place it into the statement tree. */
6525 lang_place_orphans (void)
6527 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6531 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6533 if (s
->output_section
== NULL
)
6535 /* This section of the file is not attached, root
6536 around for a sensible place for it to go. */
6538 if (file
->flags
.just_syms
)
6539 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6540 else if (lang_discard_section_p (s
))
6541 s
->output_section
= bfd_abs_section_ptr
;
6542 else if (strcmp (s
->name
, "COMMON") == 0)
6544 /* This is a lonely common section which must have
6545 come from an archive. We attach to the section
6546 with the wildcard. */
6547 if (!bfd_link_relocatable (&link_info
)
6548 || command_line
.force_common_definition
)
6550 if (default_common_section
== NULL
)
6551 default_common_section
6552 = lang_output_section_statement_lookup (".bss", 0,
6554 lang_add_section (&default_common_section
->children
, s
,
6555 NULL
, default_common_section
);
6559 ldlang_place_orphan (s
);
6566 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6568 flagword
*ptr_flags
;
6570 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6576 /* PR 17900: An exclamation mark in the attributes reverses
6577 the sense of any of the attributes that follow. */
6580 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6584 *ptr_flags
|= SEC_ALLOC
;
6588 *ptr_flags
|= SEC_READONLY
;
6592 *ptr_flags
|= SEC_DATA
;
6596 *ptr_flags
|= SEC_CODE
;
6601 *ptr_flags
|= SEC_LOAD
;
6605 einfo (_("%F%P: invalid character %c (%d) in flags\n"),
6613 /* Call a function on each input file. This function will be called
6614 on an archive, but not on the elements. */
6617 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6619 lang_input_statement_type
*f
;
6621 for (f
= &input_file_chain
.head
->input_statement
;
6623 f
= &f
->next_real_file
->input_statement
)
6627 /* Call a function on each file. The function will be called on all
6628 the elements of an archive which are included in the link, but will
6629 not be called on the archive file itself. */
6632 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6634 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6641 ldlang_add_file (lang_input_statement_type
*entry
)
6643 lang_statement_append (&file_chain
,
6644 (lang_statement_union_type
*) entry
,
6647 /* The BFD linker needs to have a list of all input BFDs involved in
6649 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
6650 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6652 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6653 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
6654 entry
->the_bfd
->usrdata
= entry
;
6655 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6657 /* Look through the sections and check for any which should not be
6658 included in the link. We need to do this now, so that we can
6659 notice when the backend linker tries to report multiple
6660 definition errors for symbols which are in sections we aren't
6661 going to link. FIXME: It might be better to entirely ignore
6662 symbols which are defined in sections which are going to be
6663 discarded. This would require modifying the backend linker for
6664 each backend which might set the SEC_LINK_ONCE flag. If we do
6665 this, we should probably handle SEC_EXCLUDE in the same way. */
6667 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6671 lang_add_output (const char *name
, int from_script
)
6673 /* Make -o on command line override OUTPUT in script. */
6674 if (!had_output_filename
|| !from_script
)
6676 output_filename
= name
;
6677 had_output_filename
= TRUE
;
6681 lang_output_section_statement_type
*
6682 lang_enter_output_section_statement (const char *output_section_statement_name
,
6683 etree_type
*address_exp
,
6684 enum section_type sectype
,
6686 etree_type
*subalign
,
6689 int align_with_input
)
6691 lang_output_section_statement_type
*os
;
6693 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6695 current_section
= os
;
6697 if (os
->addr_tree
== NULL
)
6699 os
->addr_tree
= address_exp
;
6701 os
->sectype
= sectype
;
6702 if (sectype
!= noload_section
)
6703 os
->flags
= SEC_NO_FLAGS
;
6705 os
->flags
= SEC_NEVER_LOAD
;
6706 os
->block_value
= 1;
6708 /* Make next things chain into subchain of this. */
6709 push_stat_ptr (&os
->children
);
6711 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6712 if (os
->align_lma_with_input
&& align
!= NULL
)
6713 einfo (_("%F%P:%pS: error: align with input and explicit align specified\n"),
6716 os
->subsection_alignment
= subalign
;
6717 os
->section_alignment
= align
;
6719 os
->load_base
= ebase
;
6726 lang_output_statement_type
*new_stmt
;
6728 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6729 new_stmt
->name
= output_filename
;
6732 /* Reset the current counters in the regions. */
6735 lang_reset_memory_regions (void)
6737 lang_memory_region_type
*p
= lang_memory_region_list
;
6739 lang_output_section_statement_type
*os
;
6741 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6743 p
->current
= p
->origin
;
6747 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6751 os
->processed_vma
= FALSE
;
6752 os
->processed_lma
= FALSE
;
6755 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6757 /* Save the last size for possible use by bfd_relax_section. */
6758 o
->rawsize
= o
->size
;
6759 if (!(o
->flags
& SEC_FIXED_SIZE
))
6764 /* Worker for lang_gc_sections_1. */
6767 gc_section_callback (lang_wild_statement_type
*ptr
,
6768 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6770 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6771 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6772 void *data ATTRIBUTE_UNUSED
)
6774 /* If the wild pattern was marked KEEP, the member sections
6775 should be as well. */
6776 if (ptr
->keep_sections
)
6777 section
->flags
|= SEC_KEEP
;
6780 /* Iterate over sections marking them against GC. */
6783 lang_gc_sections_1 (lang_statement_union_type
*s
)
6785 for (; s
!= NULL
; s
= s
->header
.next
)
6787 switch (s
->header
.type
)
6789 case lang_wild_statement_enum
:
6790 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6792 case lang_constructors_statement_enum
:
6793 lang_gc_sections_1 (constructor_list
.head
);
6795 case lang_output_section_statement_enum
:
6796 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6798 case lang_group_statement_enum
:
6799 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6808 lang_gc_sections (void)
6810 /* Keep all sections so marked in the link script. */
6811 lang_gc_sections_1 (statement_list
.head
);
6813 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6814 the special case of debug info. (See bfd/stabs.c)
6815 Twiddle the flag here, to simplify later linker code. */
6816 if (bfd_link_relocatable (&link_info
))
6818 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6821 #ifdef ENABLE_PLUGINS
6822 if (f
->flags
.claimed
)
6825 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6826 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6827 sec
->flags
&= ~SEC_EXCLUDE
;
6831 if (link_info
.gc_sections
)
6832 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6835 /* Worker for lang_find_relro_sections_1. */
6838 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6839 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6841 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6842 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6845 /* Discarded, excluded and ignored sections effectively have zero
6847 if (section
->output_section
!= NULL
6848 && section
->output_section
->owner
== link_info
.output_bfd
6849 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6850 && !IGNORE_SECTION (section
)
6851 && section
->size
!= 0)
6853 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6854 *has_relro_section
= TRUE
;
6858 /* Iterate over sections for relro sections. */
6861 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6862 seg_align_type
*seg
,
6863 bfd_boolean
*has_relro_section
)
6865 if (*has_relro_section
)
6868 for (; s
!= NULL
; s
= s
->header
.next
)
6870 if (s
== seg
->relro_end_stat
)
6873 switch (s
->header
.type
)
6875 case lang_wild_statement_enum
:
6876 walk_wild (&s
->wild_statement
,
6877 find_relro_section_callback
,
6880 case lang_constructors_statement_enum
:
6881 lang_find_relro_sections_1 (constructor_list
.head
,
6882 seg
, has_relro_section
);
6884 case lang_output_section_statement_enum
:
6885 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6886 seg
, has_relro_section
);
6888 case lang_group_statement_enum
:
6889 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6890 seg
, has_relro_section
);
6899 lang_find_relro_sections (void)
6901 bfd_boolean has_relro_section
= FALSE
;
6903 /* Check all sections in the link script. */
6905 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6906 &expld
.dataseg
, &has_relro_section
);
6908 if (!has_relro_section
)
6909 link_info
.relro
= FALSE
;
6912 /* Relax all sections until bfd_relax_section gives up. */
6915 lang_relax_sections (bfd_boolean need_layout
)
6917 if (RELAXATION_ENABLED
)
6919 /* We may need more than one relaxation pass. */
6920 int i
= link_info
.relax_pass
;
6922 /* The backend can use it to determine the current pass. */
6923 link_info
.relax_pass
= 0;
6927 /* Keep relaxing until bfd_relax_section gives up. */
6928 bfd_boolean relax_again
;
6930 link_info
.relax_trip
= -1;
6933 link_info
.relax_trip
++;
6935 /* Note: pe-dll.c does something like this also. If you find
6936 you need to change this code, you probably need to change
6937 pe-dll.c also. DJ */
6939 /* Do all the assignments with our current guesses as to
6941 lang_do_assignments (lang_assigning_phase_enum
);
6943 /* We must do this after lang_do_assignments, because it uses
6945 lang_reset_memory_regions ();
6947 /* Perform another relax pass - this time we know where the
6948 globals are, so can make a better guess. */
6949 relax_again
= FALSE
;
6950 lang_size_sections (&relax_again
, FALSE
);
6952 while (relax_again
);
6954 link_info
.relax_pass
++;
6961 /* Final extra sizing to report errors. */
6962 lang_do_assignments (lang_assigning_phase_enum
);
6963 lang_reset_memory_regions ();
6964 lang_size_sections (NULL
, TRUE
);
6968 #ifdef ENABLE_PLUGINS
6969 /* Find the insert point for the plugin's replacement files. We
6970 place them after the first claimed real object file, or if the
6971 first claimed object is an archive member, after the last real
6972 object file immediately preceding the archive. In the event
6973 no objects have been claimed at all, we return the first dummy
6974 object file on the list as the insert point; that works, but
6975 the callee must be careful when relinking the file_chain as it
6976 is not actually on that chain, only the statement_list and the
6977 input_file list; in that case, the replacement files must be
6978 inserted at the head of the file_chain. */
6980 static lang_input_statement_type
*
6981 find_replacements_insert_point (void)
6983 lang_input_statement_type
*claim1
, *lastobject
;
6984 lastobject
= &input_file_chain
.head
->input_statement
;
6985 for (claim1
= &file_chain
.head
->input_statement
;
6987 claim1
= &claim1
->next
->input_statement
)
6989 if (claim1
->flags
.claimed
)
6990 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6991 /* Update lastobject if this is a real object file. */
6992 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
6993 lastobject
= claim1
;
6995 /* No files were claimed by the plugin. Choose the last object
6996 file found on the list (maybe the first, dummy entry) as the
7001 /* Find where to insert ADD, an archive element or shared library
7002 added during a rescan. */
7004 static lang_statement_union_type
**
7005 find_rescan_insertion (lang_input_statement_type
*add
)
7007 bfd
*add_bfd
= add
->the_bfd
;
7008 lang_input_statement_type
*f
;
7009 lang_input_statement_type
*last_loaded
= NULL
;
7010 lang_input_statement_type
*before
= NULL
;
7011 lang_statement_union_type
**iter
= NULL
;
7013 if (add_bfd
->my_archive
!= NULL
)
7014 add_bfd
= add_bfd
->my_archive
;
7016 /* First look through the input file chain, to find an object file
7017 before the one we've rescanned. Normal object files always
7018 appear on both the input file chain and the file chain, so this
7019 lets us get quickly to somewhere near the correct place on the
7020 file chain if it is full of archive elements. Archives don't
7021 appear on the file chain, but if an element has been extracted
7022 then their input_statement->next points at it. */
7023 for (f
= &input_file_chain
.head
->input_statement
;
7025 f
= &f
->next_real_file
->input_statement
)
7027 if (f
->the_bfd
== add_bfd
)
7029 before
= last_loaded
;
7030 if (f
->next
!= NULL
)
7031 return &f
->next
->input_statement
.next
;
7033 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7037 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7039 iter
= &(*iter
)->input_statement
.next
)
7040 if (!(*iter
)->input_statement
.flags
.claim_archive
7041 && (*iter
)->input_statement
.the_bfd
->my_archive
== NULL
)
7047 /* Insert SRCLIST into DESTLIST after given element by chaining
7048 on FIELD as the next-pointer. (Counterintuitively does not need
7049 a pointer to the actual after-node itself, just its chain field.) */
7052 lang_list_insert_after (lang_statement_list_type
*destlist
,
7053 lang_statement_list_type
*srclist
,
7054 lang_statement_union_type
**field
)
7056 *(srclist
->tail
) = *field
;
7057 *field
= srclist
->head
;
7058 if (destlist
->tail
== field
)
7059 destlist
->tail
= srclist
->tail
;
7062 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7063 was taken as a copy of it and leave them in ORIGLIST. */
7066 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7067 lang_statement_list_type
*origlist
)
7069 union lang_statement_union
**savetail
;
7070 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7071 ASSERT (origlist
->head
== destlist
->head
);
7072 savetail
= origlist
->tail
;
7073 origlist
->head
= *(savetail
);
7074 origlist
->tail
= destlist
->tail
;
7075 destlist
->tail
= savetail
;
7078 #endif /* ENABLE_PLUGINS */
7080 /* Add NAME to the list of garbage collection entry points. */
7083 lang_add_gc_name (const char *name
)
7085 struct bfd_sym_chain
*sym
;
7090 sym
= (struct bfd_sym_chain
*) stat_alloc (sizeof (*sym
));
7092 sym
->next
= link_info
.gc_sym_list
;
7094 link_info
.gc_sym_list
= sym
;
7097 /* Check relocations. */
7100 lang_check_relocs (void)
7102 if (link_info
.check_relocs_after_open_input
)
7106 for (abfd
= link_info
.input_bfds
;
7107 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7108 if (!bfd_link_check_relocs (abfd
, &link_info
))
7110 /* No object output, fail return. */
7111 config
.make_executable
= FALSE
;
7112 /* Note: we do not abort the loop, but rather
7113 continue the scan in case there are other
7114 bad relocations to report. */
7119 /* Look through all output sections looking for places where we can
7120 propagate forward the lma region. */
7123 lang_propagate_lma_regions (void)
7125 lang_output_section_statement_type
*os
;
7127 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7131 if (os
->prev
!= NULL
7132 && os
->lma_region
== NULL
7133 && os
->load_base
== NULL
7134 && os
->addr_tree
== NULL
7135 && os
->region
== os
->prev
->region
)
7136 os
->lma_region
= os
->prev
->lma_region
;
7143 /* Finalize dynamic list. */
7144 if (link_info
.dynamic_list
)
7145 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
7147 current_target
= default_target
;
7149 /* Open the output file. */
7150 lang_for_each_statement (ldlang_open_output
);
7153 ldemul_create_output_section_statements ();
7155 /* Add to the hash table all undefineds on the command line. */
7156 lang_place_undefineds ();
7158 if (!bfd_section_already_linked_table_init ())
7159 einfo (_("%F%P: can not create hash table: %E\n"));
7161 /* Create a bfd for each input file. */
7162 current_target
= default_target
;
7163 lang_statement_iteration
++;
7164 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
7166 #ifdef ENABLE_PLUGINS
7167 if (link_info
.lto_plugin_active
)
7169 lang_statement_list_type added
;
7170 lang_statement_list_type files
, inputfiles
;
7172 /* Now all files are read, let the plugin(s) decide if there
7173 are any more to be added to the link before we call the
7174 emulation's after_open hook. We create a private list of
7175 input statements for this purpose, which we will eventually
7176 insert into the global statement list after the first claimed
7179 /* We need to manipulate all three chains in synchrony. */
7181 inputfiles
= input_file_chain
;
7182 if (plugin_call_all_symbols_read ())
7183 einfo (_("%F%P: %s: plugin reported error after all symbols read\n"),
7184 plugin_error_plugin ());
7185 /* Open any newly added files, updating the file chains. */
7186 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
7187 /* Restore the global list pointer now they have all been added. */
7188 lang_list_remove_tail (stat_ptr
, &added
);
7189 /* And detach the fresh ends of the file lists. */
7190 lang_list_remove_tail (&file_chain
, &files
);
7191 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
7192 /* Were any new files added? */
7193 if (added
.head
!= NULL
)
7195 /* If so, we will insert them into the statement list immediately
7196 after the first input file that was claimed by the plugin. */
7197 plugin_insert
= find_replacements_insert_point ();
7198 /* If a plugin adds input files without having claimed any, we
7199 don't really have a good idea where to place them. Just putting
7200 them at the start or end of the list is liable to leave them
7201 outside the crtbegin...crtend range. */
7202 ASSERT (plugin_insert
!= NULL
);
7203 /* Splice the new statement list into the old one. */
7204 lang_list_insert_after (stat_ptr
, &added
,
7205 &plugin_insert
->header
.next
);
7206 /* Likewise for the file chains. */
7207 lang_list_insert_after (&input_file_chain
, &inputfiles
,
7208 &plugin_insert
->next_real_file
);
7209 /* We must be careful when relinking file_chain; we may need to
7210 insert the new files at the head of the list if the insert
7211 point chosen is the dummy first input file. */
7212 if (plugin_insert
->filename
)
7213 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
7215 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
7217 /* Rescan archives in case new undefined symbols have appeared. */
7219 lang_statement_iteration
++;
7220 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
7221 lang_list_remove_tail (&file_chain
, &files
);
7222 while (files
.head
!= NULL
)
7224 lang_statement_union_type
**insert
;
7225 lang_statement_union_type
**iter
, *temp
;
7228 insert
= find_rescan_insertion (&files
.head
->input_statement
);
7229 /* All elements from an archive can be added at once. */
7230 iter
= &files
.head
->input_statement
.next
;
7231 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
7232 if (my_arch
!= NULL
)
7233 for (; *iter
!= NULL
; iter
= &(*iter
)->input_statement
.next
)
7234 if ((*iter
)->input_statement
.the_bfd
->my_archive
!= my_arch
)
7237 *insert
= files
.head
;
7240 if (my_arch
!= NULL
)
7242 lang_input_statement_type
*parent
= my_arch
->usrdata
;
7244 parent
->next
= (lang_statement_union_type
*)
7246 - offsetof (lang_input_statement_type
, next
));
7251 #endif /* ENABLE_PLUGINS */
7253 /* Make sure that nobody has tried to add a symbol to this list
7255 ASSERT (link_info
.gc_sym_list
== NULL
);
7257 link_info
.gc_sym_list
= &entry_symbol
;
7259 if (entry_symbol
.name
== NULL
)
7261 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
7263 /* entry_symbol is normally initialied by a ENTRY definition in the
7264 linker script or the -e command line option. But if neither of
7265 these have been used, the target specific backend may still have
7266 provided an entry symbol via a call to lang_default_entry().
7267 Unfortunately this value will not be processed until lang_end()
7268 is called, long after this function has finished. So detect this
7269 case here and add the target's entry symbol to the list of starting
7270 points for garbage collection resolution. */
7271 lang_add_gc_name (entry_symbol_default
);
7274 lang_add_gc_name (link_info
.init_function
);
7275 lang_add_gc_name (link_info
.fini_function
);
7277 ldemul_after_open ();
7278 if (config
.map_file
!= NULL
)
7279 lang_print_asneeded ();
7281 bfd_section_already_linked_table_free ();
7283 /* Make sure that we're not mixing architectures. We call this
7284 after all the input files have been opened, but before we do any
7285 other processing, so that any operations merge_private_bfd_data
7286 does on the output file will be known during the rest of the
7290 /* Handle .exports instead of a version script if we're told to do so. */
7291 if (command_line
.version_exports_section
)
7292 lang_do_version_exports_section ();
7294 /* Build all sets based on the information gathered from the input
7296 ldctor_build_sets ();
7298 /* Give initial values for __start and __stop symbols, so that ELF
7299 gc_sections will keep sections referenced by these symbols. Must
7300 be done before lang_do_assignments below. */
7301 if (config
.build_constructors
)
7302 lang_init_start_stop ();
7304 /* PR 13683: We must rerun the assignments prior to running garbage
7305 collection in order to make sure that all symbol aliases are resolved. */
7306 lang_do_assignments (lang_mark_phase_enum
);
7308 lang_do_memory_regions();
7309 expld
.phase
= lang_first_phase_enum
;
7311 /* Size up the common data. */
7314 /* Remove unreferenced sections if asked to. */
7315 lang_gc_sections ();
7317 /* Check relocations. */
7318 lang_check_relocs ();
7320 ldemul_after_check_relocs ();
7322 /* Update wild statements. */
7323 update_wild_statements (statement_list
.head
);
7325 /* Run through the contours of the script and attach input sections
7326 to the correct output sections. */
7327 lang_statement_iteration
++;
7328 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
7330 process_insert_statements ();
7332 /* Find any sections not attached explicitly and handle them. */
7333 lang_place_orphans ();
7335 if (!bfd_link_relocatable (&link_info
))
7339 /* Merge SEC_MERGE sections. This has to be done after GC of
7340 sections, so that GCed sections are not merged, but before
7341 assigning dynamic symbols, since removing whole input sections
7343 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
7345 /* Look for a text section and set the readonly attribute in it. */
7346 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
7350 if (config
.text_read_only
)
7351 found
->flags
|= SEC_READONLY
;
7353 found
->flags
&= ~SEC_READONLY
;
7357 /* Copy forward lma regions for output sections in same lma region. */
7358 lang_propagate_lma_regions ();
7360 /* Defining __start/__stop symbols early for --gc-sections to work
7361 around a glibc build problem can result in these symbols being
7362 defined when they should not be. Fix them now. */
7363 if (config
.build_constructors
)
7364 lang_undef_start_stop ();
7366 /* Define .startof./.sizeof. symbols with preliminary values before
7367 dynamic symbols are created. */
7368 if (!bfd_link_relocatable (&link_info
))
7369 lang_init_startof_sizeof ();
7371 /* Do anything special before sizing sections. This is where ELF
7372 and other back-ends size dynamic sections. */
7373 ldemul_before_allocation ();
7375 /* We must record the program headers before we try to fix the
7376 section positions, since they will affect SIZEOF_HEADERS. */
7377 lang_record_phdrs ();
7379 /* Check relro sections. */
7380 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
7381 lang_find_relro_sections ();
7383 /* Size up the sections. */
7384 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
7386 /* See if anything special should be done now we know how big
7387 everything is. This is where relaxation is done. */
7388 ldemul_after_allocation ();
7390 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
7391 lang_finalize_start_stop ();
7393 /* Do all the assignments, now that we know the final resting places
7394 of all the symbols. */
7395 lang_do_assignments (lang_final_phase_enum
);
7399 /* Convert absolute symbols to section relative. */
7400 ldexp_finalize_syms ();
7402 /* Make sure that the section addresses make sense. */
7403 if (command_line
.check_section_addresses
)
7404 lang_check_section_addresses ();
7406 /* Check any required symbols are known. */
7407 ldlang_check_require_defined_symbols ();
7412 /* EXPORTED TO YACC */
7415 lang_add_wild (struct wildcard_spec
*filespec
,
7416 struct wildcard_list
*section_list
,
7417 bfd_boolean keep_sections
)
7419 struct wildcard_list
*curr
, *next
;
7420 lang_wild_statement_type
*new_stmt
;
7422 /* Reverse the list as the parser puts it back to front. */
7423 for (curr
= section_list
, section_list
= NULL
;
7425 section_list
= curr
, curr
= next
)
7428 curr
->next
= section_list
;
7431 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
7433 if (strcmp (filespec
->name
, "*") == 0)
7434 filespec
->name
= NULL
;
7435 else if (!wildcardp (filespec
->name
))
7436 lang_has_input_file
= TRUE
;
7439 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
7440 new_stmt
->filename
= NULL
;
7441 new_stmt
->filenames_sorted
= FALSE
;
7442 new_stmt
->section_flag_list
= NULL
;
7443 new_stmt
->exclude_name_list
= NULL
;
7444 if (filespec
!= NULL
)
7446 new_stmt
->filename
= filespec
->name
;
7447 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
7448 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
7449 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
7451 new_stmt
->section_list
= section_list
;
7452 new_stmt
->keep_sections
= keep_sections
;
7453 lang_list_init (&new_stmt
->children
);
7454 analyze_walk_wild_section_handler (new_stmt
);
7458 lang_section_start (const char *name
, etree_type
*address
,
7459 const segment_type
*segment
)
7461 lang_address_statement_type
*ad
;
7463 ad
= new_stat (lang_address_statement
, stat_ptr
);
7464 ad
->section_name
= name
;
7465 ad
->address
= address
;
7466 ad
->segment
= segment
;
7469 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7470 because of a -e argument on the command line, or zero if this is
7471 called by ENTRY in a linker script. Command line arguments take
7475 lang_add_entry (const char *name
, bfd_boolean cmdline
)
7477 if (entry_symbol
.name
== NULL
7479 || !entry_from_cmdline
)
7481 entry_symbol
.name
= name
;
7482 entry_from_cmdline
= cmdline
;
7486 /* Set the default start symbol to NAME. .em files should use this,
7487 not lang_add_entry, to override the use of "start" if neither the
7488 linker script nor the command line specifies an entry point. NAME
7489 must be permanently allocated. */
7491 lang_default_entry (const char *name
)
7493 entry_symbol_default
= name
;
7497 lang_add_target (const char *name
)
7499 lang_target_statement_type
*new_stmt
;
7501 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
7502 new_stmt
->target
= name
;
7506 lang_add_map (const char *name
)
7513 map_option_f
= TRUE
;
7521 lang_add_fill (fill_type
*fill
)
7523 lang_fill_statement_type
*new_stmt
;
7525 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
7526 new_stmt
->fill
= fill
;
7530 lang_add_data (int type
, union etree_union
*exp
)
7532 lang_data_statement_type
*new_stmt
;
7534 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
7535 new_stmt
->exp
= exp
;
7536 new_stmt
->type
= type
;
7539 /* Create a new reloc statement. RELOC is the BFD relocation type to
7540 generate. HOWTO is the corresponding howto structure (we could
7541 look this up, but the caller has already done so). SECTION is the
7542 section to generate a reloc against, or NAME is the name of the
7543 symbol to generate a reloc against. Exactly one of SECTION and
7544 NAME must be NULL. ADDEND is an expression for the addend. */
7547 lang_add_reloc (bfd_reloc_code_real_type reloc
,
7548 reloc_howto_type
*howto
,
7551 union etree_union
*addend
)
7553 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
7557 p
->section
= section
;
7559 p
->addend_exp
= addend
;
7561 p
->addend_value
= 0;
7562 p
->output_section
= NULL
;
7563 p
->output_offset
= 0;
7566 lang_assignment_statement_type
*
7567 lang_add_assignment (etree_type
*exp
)
7569 lang_assignment_statement_type
*new_stmt
;
7571 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
7572 new_stmt
->exp
= exp
;
7577 lang_add_attribute (enum statement_enum attribute
)
7579 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
7583 lang_startup (const char *name
)
7585 if (first_file
->filename
!= NULL
)
7587 einfo (_("%F%P: multiple STARTUP files\n"));
7589 first_file
->filename
= name
;
7590 first_file
->local_sym_name
= name
;
7591 first_file
->flags
.real
= TRUE
;
7595 lang_float (bfd_boolean maybe
)
7597 lang_float_flag
= maybe
;
7601 /* Work out the load- and run-time regions from a script statement, and
7602 store them in *LMA_REGION and *REGION respectively.
7604 MEMSPEC is the name of the run-time region, or the value of
7605 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7606 LMA_MEMSPEC is the name of the load-time region, or null if the
7607 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7608 had an explicit load address.
7610 It is an error to specify both a load region and a load address. */
7613 lang_get_regions (lang_memory_region_type
**region
,
7614 lang_memory_region_type
**lma_region
,
7615 const char *memspec
,
7616 const char *lma_memspec
,
7617 bfd_boolean have_lma
,
7618 bfd_boolean have_vma
)
7620 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7622 /* If no runtime region or VMA has been specified, but the load region
7623 has been specified, then use the load region for the runtime region
7625 if (lma_memspec
!= NULL
7627 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7628 *region
= *lma_region
;
7630 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7632 if (have_lma
&& lma_memspec
!= 0)
7633 einfo (_("%X%P:%pS: section has both a load address and a load region\n"),
7638 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7639 lang_output_section_phdr_list
*phdrs
,
7640 const char *lma_memspec
)
7642 lang_get_regions (¤t_section
->region
,
7643 ¤t_section
->lma_region
,
7644 memspec
, lma_memspec
,
7645 current_section
->load_base
!= NULL
,
7646 current_section
->addr_tree
!= NULL
);
7648 current_section
->fill
= fill
;
7649 current_section
->phdrs
= phdrs
;
7654 lang_statement_append (lang_statement_list_type
*list
,
7655 lang_statement_union_type
*element
,
7656 lang_statement_union_type
**field
)
7658 *(list
->tail
) = element
;
7662 /* Set the output format type. -oformat overrides scripts. */
7665 lang_add_output_format (const char *format
,
7670 if (output_target
== NULL
|| !from_script
)
7672 if (command_line
.endian
== ENDIAN_BIG
7675 else if (command_line
.endian
== ENDIAN_LITTLE
7679 output_target
= format
;
7684 lang_add_insert (const char *where
, int is_before
)
7686 lang_insert_statement_type
*new_stmt
;
7688 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7689 new_stmt
->where
= where
;
7690 new_stmt
->is_before
= is_before
;
7691 saved_script_handle
= previous_script_handle
;
7694 /* Enter a group. This creates a new lang_group_statement, and sets
7695 stat_ptr to build new statements within the group. */
7698 lang_enter_group (void)
7700 lang_group_statement_type
*g
;
7702 g
= new_stat (lang_group_statement
, stat_ptr
);
7703 lang_list_init (&g
->children
);
7704 push_stat_ptr (&g
->children
);
7707 /* Leave a group. This just resets stat_ptr to start writing to the
7708 regular list of statements again. Note that this will not work if
7709 groups can occur inside anything else which can adjust stat_ptr,
7710 but currently they can't. */
7713 lang_leave_group (void)
7718 /* Add a new program header. This is called for each entry in a PHDRS
7719 command in a linker script. */
7722 lang_new_phdr (const char *name
,
7724 bfd_boolean filehdr
,
7729 struct lang_phdr
*n
, **pp
;
7732 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7735 n
->type
= exp_get_vma (type
, 0, "program header type");
7736 n
->filehdr
= filehdr
;
7741 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7743 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7746 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7748 einfo (_("%X%P:%pS: PHDRS and FILEHDR are not supported"
7749 " when prior PT_LOAD headers lack them\n"), NULL
);
7756 /* Record the program header information in the output BFD. FIXME: We
7757 should not be calling an ELF specific function here. */
7760 lang_record_phdrs (void)
7764 lang_output_section_phdr_list
*last
;
7765 struct lang_phdr
*l
;
7766 lang_output_section_statement_type
*os
;
7769 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7772 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7779 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7783 lang_output_section_phdr_list
*pl
;
7785 if (os
->constraint
< 0)
7793 if (os
->sectype
== noload_section
7794 || os
->bfd_section
== NULL
7795 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7798 /* Don't add orphans to PT_INTERP header. */
7804 lang_output_section_statement_type
*tmp_os
;
7806 /* If we have not run across a section with a program
7807 header assigned to it yet, then scan forwards to find
7808 one. This prevents inconsistencies in the linker's
7809 behaviour when a script has specified just a single
7810 header and there are sections in that script which are
7811 not assigned to it, and which occur before the first
7812 use of that header. See here for more details:
7813 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7814 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7817 last
= tmp_os
->phdrs
;
7821 einfo (_("%F%P: no sections assigned to phdrs\n"));
7826 if (os
->bfd_section
== NULL
)
7829 for (; pl
!= NULL
; pl
= pl
->next
)
7831 if (strcmp (pl
->name
, l
->name
) == 0)
7836 secs
= (asection
**) xrealloc (secs
,
7837 alc
* sizeof (asection
*));
7839 secs
[c
] = os
->bfd_section
;
7846 if (l
->flags
== NULL
)
7849 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7854 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7856 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7857 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7858 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7859 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7864 /* Make sure all the phdr assignments succeeded. */
7865 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7869 lang_output_section_phdr_list
*pl
;
7871 if (os
->constraint
< 0
7872 || os
->bfd_section
== NULL
)
7875 for (pl
= os
->phdrs
;
7878 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7879 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7880 os
->name
, pl
->name
);
7884 /* Record a list of sections which may not be cross referenced. */
7887 lang_add_nocrossref (lang_nocrossref_type
*l
)
7889 struct lang_nocrossrefs
*n
;
7891 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7892 n
->next
= nocrossref_list
;
7894 n
->onlyfirst
= FALSE
;
7895 nocrossref_list
= n
;
7897 /* Set notice_all so that we get informed about all symbols. */
7898 link_info
.notice_all
= TRUE
;
7901 /* Record a section that cannot be referenced from a list of sections. */
7904 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
7906 lang_add_nocrossref (l
);
7907 nocrossref_list
->onlyfirst
= TRUE
;
7910 /* Overlay handling. We handle overlays with some static variables. */
7912 /* The overlay virtual address. */
7913 static etree_type
*overlay_vma
;
7914 /* And subsection alignment. */
7915 static etree_type
*overlay_subalign
;
7917 /* An expression for the maximum section size seen so far. */
7918 static etree_type
*overlay_max
;
7920 /* A list of all the sections in this overlay. */
7922 struct overlay_list
{
7923 struct overlay_list
*next
;
7924 lang_output_section_statement_type
*os
;
7927 static struct overlay_list
*overlay_list
;
7929 /* Start handling an overlay. */
7932 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7934 /* The grammar should prevent nested overlays from occurring. */
7935 ASSERT (overlay_vma
== NULL
7936 && overlay_subalign
== NULL
7937 && overlay_max
== NULL
);
7939 overlay_vma
= vma_expr
;
7940 overlay_subalign
= subalign
;
7943 /* Start a section in an overlay. We handle this by calling
7944 lang_enter_output_section_statement with the correct VMA.
7945 lang_leave_overlay sets up the LMA and memory regions. */
7948 lang_enter_overlay_section (const char *name
)
7950 struct overlay_list
*n
;
7953 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7954 0, overlay_subalign
, 0, 0, 0);
7956 /* If this is the first section, then base the VMA of future
7957 sections on this one. This will work correctly even if `.' is
7958 used in the addresses. */
7959 if (overlay_list
== NULL
)
7960 overlay_vma
= exp_nameop (ADDR
, name
);
7962 /* Remember the section. */
7963 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7964 n
->os
= current_section
;
7965 n
->next
= overlay_list
;
7968 size
= exp_nameop (SIZEOF
, name
);
7970 /* Arrange to work out the maximum section end address. */
7971 if (overlay_max
== NULL
)
7974 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7977 /* Finish a section in an overlay. There isn't any special to do
7981 lang_leave_overlay_section (fill_type
*fill
,
7982 lang_output_section_phdr_list
*phdrs
)
7989 name
= current_section
->name
;
7991 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7992 region and that no load-time region has been specified. It doesn't
7993 really matter what we say here, since lang_leave_overlay will
7995 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7997 /* Define the magic symbols. */
7999 clean
= (char *) xmalloc (strlen (name
) + 1);
8001 for (s1
= name
; *s1
!= '\0'; s1
++)
8002 if (ISALNUM (*s1
) || *s1
== '_')
8006 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8007 sprintf (buf
, "__load_start_%s", clean
);
8008 lang_add_assignment (exp_provide (buf
,
8009 exp_nameop (LOADADDR
, name
),
8012 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8013 sprintf (buf
, "__load_stop_%s", clean
);
8014 lang_add_assignment (exp_provide (buf
,
8016 exp_nameop (LOADADDR
, name
),
8017 exp_nameop (SIZEOF
, name
)),
8023 /* Finish an overlay. If there are any overlay wide settings, this
8024 looks through all the sections in the overlay and sets them. */
8027 lang_leave_overlay (etree_type
*lma_expr
,
8030 const char *memspec
,
8031 lang_output_section_phdr_list
*phdrs
,
8032 const char *lma_memspec
)
8034 lang_memory_region_type
*region
;
8035 lang_memory_region_type
*lma_region
;
8036 struct overlay_list
*l
;
8037 lang_nocrossref_type
*nocrossref
;
8039 lang_get_regions (®ion
, &lma_region
,
8040 memspec
, lma_memspec
,
8041 lma_expr
!= NULL
, FALSE
);
8045 /* After setting the size of the last section, set '.' to end of the
8047 if (overlay_list
!= NULL
)
8049 overlay_list
->os
->update_dot
= 1;
8050 overlay_list
->os
->update_dot_tree
8051 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
8057 struct overlay_list
*next
;
8059 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8062 l
->os
->region
= region
;
8063 l
->os
->lma_region
= lma_region
;
8065 /* The first section has the load address specified in the
8066 OVERLAY statement. The rest are worked out from that.
8067 The base address is not needed (and should be null) if
8068 an LMA region was specified. */
8071 l
->os
->load_base
= lma_expr
;
8072 l
->os
->sectype
= normal_section
;
8074 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
8075 l
->os
->phdrs
= phdrs
;
8079 lang_nocrossref_type
*nc
;
8081 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
8082 nc
->name
= l
->os
->name
;
8083 nc
->next
= nocrossref
;
8092 if (nocrossref
!= NULL
)
8093 lang_add_nocrossref (nocrossref
);
8096 overlay_list
= NULL
;
8098 overlay_subalign
= NULL
;
8101 /* Version handling. This is only useful for ELF. */
8103 /* If PREV is NULL, return first version pattern matching particular symbol.
8104 If PREV is non-NULL, return first version pattern matching particular
8105 symbol after PREV (previously returned by lang_vers_match). */
8107 static struct bfd_elf_version_expr
*
8108 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
8109 struct bfd_elf_version_expr
*prev
,
8113 const char *cxx_sym
= sym
;
8114 const char *java_sym
= sym
;
8115 struct bfd_elf_version_expr
*expr
= NULL
;
8116 enum demangling_styles curr_style
;
8118 curr_style
= CURRENT_DEMANGLING_STYLE
;
8119 cplus_demangle_set_style (no_demangling
);
8120 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
8123 cplus_demangle_set_style (curr_style
);
8125 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8127 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
8128 DMGL_PARAMS
| DMGL_ANSI
);
8132 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8134 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
8139 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
8141 struct bfd_elf_version_expr e
;
8143 switch (prev
? prev
->mask
: 0)
8146 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
8149 expr
= (struct bfd_elf_version_expr
*)
8150 htab_find ((htab_t
) head
->htab
, &e
);
8151 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
8152 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
8158 case BFD_ELF_VERSION_C_TYPE
:
8159 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8161 e
.pattern
= cxx_sym
;
8162 expr
= (struct bfd_elf_version_expr
*)
8163 htab_find ((htab_t
) head
->htab
, &e
);
8164 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
8165 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8171 case BFD_ELF_VERSION_CXX_TYPE
:
8172 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8174 e
.pattern
= java_sym
;
8175 expr
= (struct bfd_elf_version_expr
*)
8176 htab_find ((htab_t
) head
->htab
, &e
);
8177 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
8178 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8189 /* Finally, try the wildcards. */
8190 if (prev
== NULL
|| prev
->literal
)
8191 expr
= head
->remaining
;
8194 for (; expr
; expr
= expr
->next
)
8201 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
8204 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8206 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8210 if (fnmatch (expr
->pattern
, s
, 0) == 0)
8216 free ((char *) c_sym
);
8218 free ((char *) cxx_sym
);
8219 if (java_sym
!= sym
)
8220 free ((char *) java_sym
);
8224 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
8225 return a pointer to the symbol name with any backslash quotes removed. */
8228 realsymbol (const char *pattern
)
8231 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
8232 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
8234 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
8236 /* It is a glob pattern only if there is no preceding
8240 /* Remove the preceding backslash. */
8247 if (*p
== '?' || *p
== '*' || *p
== '[')
8254 backslash
= *p
== '\\';
8270 /* This is called for each variable name or match expression. NEW_NAME is
8271 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
8272 pattern to be matched against symbol names. */
8274 struct bfd_elf_version_expr
*
8275 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
8276 const char *new_name
,
8278 bfd_boolean literal_p
)
8280 struct bfd_elf_version_expr
*ret
;
8282 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
8286 ret
->literal
= TRUE
;
8287 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
8288 if (ret
->pattern
== NULL
)
8290 ret
->pattern
= new_name
;
8291 ret
->literal
= FALSE
;
8294 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
8295 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8296 else if (strcasecmp (lang
, "C++") == 0)
8297 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
8298 else if (strcasecmp (lang
, "Java") == 0)
8299 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
8302 einfo (_("%X%P: unknown language `%s' in version information\n"),
8304 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8307 return ldemul_new_vers_pattern (ret
);
8310 /* This is called for each set of variable names and match
8313 struct bfd_elf_version_tree
*
8314 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
8315 struct bfd_elf_version_expr
*locals
)
8317 struct bfd_elf_version_tree
*ret
;
8319 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
8320 ret
->globals
.list
= globals
;
8321 ret
->locals
.list
= locals
;
8322 ret
->match
= lang_vers_match
;
8323 ret
->name_indx
= (unsigned int) -1;
8327 /* This static variable keeps track of version indices. */
8329 static int version_index
;
8332 version_expr_head_hash (const void *p
)
8334 const struct bfd_elf_version_expr
*e
=
8335 (const struct bfd_elf_version_expr
*) p
;
8337 return htab_hash_string (e
->pattern
);
8341 version_expr_head_eq (const void *p1
, const void *p2
)
8343 const struct bfd_elf_version_expr
*e1
=
8344 (const struct bfd_elf_version_expr
*) p1
;
8345 const struct bfd_elf_version_expr
*e2
=
8346 (const struct bfd_elf_version_expr
*) p2
;
8348 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
8352 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
8355 struct bfd_elf_version_expr
*e
, *next
;
8356 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
8358 for (e
= head
->list
; e
; e
= e
->next
)
8362 head
->mask
|= e
->mask
;
8367 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
8368 version_expr_head_eq
, NULL
);
8369 list_loc
= &head
->list
;
8370 remaining_loc
= &head
->remaining
;
8371 for (e
= head
->list
; e
; e
= next
)
8377 remaining_loc
= &e
->next
;
8381 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
8385 struct bfd_elf_version_expr
*e1
, *last
;
8387 e1
= (struct bfd_elf_version_expr
*) *loc
;
8391 if (e1
->mask
== e
->mask
)
8399 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
8403 /* This is a duplicate. */
8404 /* FIXME: Memory leak. Sometimes pattern is not
8405 xmalloced alone, but in larger chunk of memory. */
8406 /* free (e->pattern); */
8411 e
->next
= last
->next
;
8419 list_loc
= &e
->next
;
8423 *remaining_loc
= NULL
;
8424 *list_loc
= head
->remaining
;
8427 head
->remaining
= head
->list
;
8430 /* This is called when we know the name and dependencies of the
8434 lang_register_vers_node (const char *name
,
8435 struct bfd_elf_version_tree
*version
,
8436 struct bfd_elf_version_deps
*deps
)
8438 struct bfd_elf_version_tree
*t
, **pp
;
8439 struct bfd_elf_version_expr
*e1
;
8444 if (link_info
.version_info
!= NULL
8445 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
8447 einfo (_("%X%P: anonymous version tag cannot be combined"
8448 " with other version tags\n"));
8453 /* Make sure this node has a unique name. */
8454 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8455 if (strcmp (t
->name
, name
) == 0)
8456 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
8458 lang_finalize_version_expr_head (&version
->globals
);
8459 lang_finalize_version_expr_head (&version
->locals
);
8461 /* Check the global and local match names, and make sure there
8462 aren't any duplicates. */
8464 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
8466 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8468 struct bfd_elf_version_expr
*e2
;
8470 if (t
->locals
.htab
&& e1
->literal
)
8472 e2
= (struct bfd_elf_version_expr
*)
8473 htab_find ((htab_t
) t
->locals
.htab
, e1
);
8474 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8476 if (e1
->mask
== e2
->mask
)
8477 einfo (_("%X%P: duplicate expression `%s'"
8478 " in version information\n"), e1
->pattern
);
8482 else if (!e1
->literal
)
8483 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8484 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8485 && e1
->mask
== e2
->mask
)
8486 einfo (_("%X%P: duplicate expression `%s'"
8487 " in version information\n"), e1
->pattern
);
8491 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
8493 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8495 struct bfd_elf_version_expr
*e2
;
8497 if (t
->globals
.htab
&& e1
->literal
)
8499 e2
= (struct bfd_elf_version_expr
*)
8500 htab_find ((htab_t
) t
->globals
.htab
, e1
);
8501 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8503 if (e1
->mask
== e2
->mask
)
8504 einfo (_("%X%P: duplicate expression `%s'"
8505 " in version information\n"),
8510 else if (!e1
->literal
)
8511 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8512 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8513 && e1
->mask
== e2
->mask
)
8514 einfo (_("%X%P: duplicate expression `%s'"
8515 " in version information\n"), e1
->pattern
);
8519 version
->deps
= deps
;
8520 version
->name
= name
;
8521 if (name
[0] != '\0')
8524 version
->vernum
= version_index
;
8527 version
->vernum
= 0;
8529 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8534 /* This is called when we see a version dependency. */
8536 struct bfd_elf_version_deps
*
8537 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
8539 struct bfd_elf_version_deps
*ret
;
8540 struct bfd_elf_version_tree
*t
;
8542 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
8545 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8547 if (strcmp (t
->name
, name
) == 0)
8549 ret
->version_needed
= t
;
8554 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
8556 ret
->version_needed
= NULL
;
8561 lang_do_version_exports_section (void)
8563 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
8565 LANG_FOR_EACH_INPUT_STATEMENT (is
)
8567 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
8575 contents
= (char *) xmalloc (len
);
8576 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
8577 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
8580 while (p
< contents
+ len
)
8582 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
8583 p
= strchr (p
, '\0') + 1;
8586 /* Do not free the contents, as we used them creating the regex. */
8588 /* Do not include this section in the link. */
8589 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
8592 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
8593 lang_register_vers_node (command_line
.version_exports_section
,
8594 lang_new_vers_node (greg
, lreg
), NULL
);
8597 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8600 lang_do_memory_regions (void)
8602 lang_memory_region_type
*r
= lang_memory_region_list
;
8604 for (; r
!= NULL
; r
= r
->next
)
8608 exp_fold_tree_no_dot (r
->origin_exp
);
8609 if (expld
.result
.valid_p
)
8611 r
->origin
= expld
.result
.value
;
8612 r
->current
= r
->origin
;
8615 einfo (_("%F%P: invalid origin for memory region %s\n"),
8620 exp_fold_tree_no_dot (r
->length_exp
);
8621 if (expld
.result
.valid_p
)
8622 r
->length
= expld
.result
.value
;
8624 einfo (_("%F%P: invalid length for memory region %s\n"),
8631 lang_add_unique (const char *name
)
8633 struct unique_sections
*ent
;
8635 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8636 if (strcmp (ent
->name
, name
) == 0)
8639 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8640 ent
->name
= xstrdup (name
);
8641 ent
->next
= unique_section_list
;
8642 unique_section_list
= ent
;
8645 /* Append the list of dynamic symbols to the existing one. */
8648 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8650 if (link_info
.dynamic_list
)
8652 struct bfd_elf_version_expr
*tail
;
8653 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8655 tail
->next
= link_info
.dynamic_list
->head
.list
;
8656 link_info
.dynamic_list
->head
.list
= dynamic
;
8660 struct bfd_elf_dynamic_list
*d
;
8662 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8663 d
->head
.list
= dynamic
;
8664 d
->match
= lang_vers_match
;
8665 link_info
.dynamic_list
= d
;
8669 /* Append the list of C++ typeinfo dynamic symbols to the existing
8673 lang_append_dynamic_list_cpp_typeinfo (void)
8675 const char *symbols
[] =
8677 "typeinfo name for*",
8680 struct bfd_elf_version_expr
*dynamic
= NULL
;
8683 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8684 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8687 lang_append_dynamic_list (dynamic
);
8690 /* Append the list of C++ operator new and delete dynamic symbols to the
8694 lang_append_dynamic_list_cpp_new (void)
8696 const char *symbols
[] =
8701 struct bfd_elf_version_expr
*dynamic
= NULL
;
8704 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8705 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8708 lang_append_dynamic_list (dynamic
);
8711 /* Scan a space and/or comma separated string of features. */
8714 lang_ld_feature (char *str
)
8722 while (*p
== ',' || ISSPACE (*p
))
8727 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8731 if (strcasecmp (p
, "SANE_EXPR") == 0)
8732 config
.sane_expr
= TRUE
;
8734 einfo (_("%X%P: unknown feature `%s'\n"), p
);
8740 /* Pretty print memory amount. */
8743 lang_print_memory_size (bfd_vma sz
)
8745 if ((sz
& 0x3fffffff) == 0)
8746 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
8747 else if ((sz
& 0xfffff) == 0)
8748 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
8749 else if ((sz
& 0x3ff) == 0)
8750 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
8752 printf (" %10" BFD_VMA_FMT
"u B", sz
);
8755 /* Implement --print-memory-usage: disply per region memory usage. */
8758 lang_print_memory_usage (void)
8760 lang_memory_region_type
*r
;
8762 printf ("Memory region Used Size Region Size %%age Used\n");
8763 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
8765 bfd_vma used_length
= r
->current
- r
->origin
;
8768 printf ("%16s: ",r
->name_list
.name
);
8769 lang_print_memory_size (used_length
);
8770 lang_print_memory_size ((bfd_vma
) r
->length
);
8772 percent
= used_length
* 100.0 / r
->length
;
8774 printf (" %6.2f%%\n", percent
);