1 /* Linker command language support.
2 Copyright (C) 1991-2018 Free Software Foundation, Inc.
4 This file is part of the GNU Binutils.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
23 #include "libiberty.h"
24 #include "filenames.h"
25 #include "safe-ctype.h"
45 #endif /* ENABLE_PLUGINS */
48 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
51 /* Convert between addresses in bytes and sizes in octets.
52 For currently supported targets, octets_per_byte is always a power
53 of two, so we can use shifts. */
54 #define TO_ADDR(X) ((X) >> opb_shift)
55 #define TO_SIZE(X) ((X) << opb_shift)
57 /* Local variables. */
58 static struct obstack stat_obstack
;
59 static struct obstack map_obstack
;
61 #define obstack_chunk_alloc xmalloc
62 #define obstack_chunk_free free
63 static const char *entry_symbol_default
= "start";
64 static bfd_boolean map_head_is_link_order
= FALSE
;
65 static lang_output_section_statement_type
*default_common_section
;
66 static bfd_boolean map_option_f
;
67 static bfd_vma print_dot
;
68 static lang_input_statement_type
*first_file
;
69 static const char *current_target
;
70 static lang_statement_list_type statement_list
;
71 static lang_statement_list_type
*stat_save
[10];
72 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
73 static struct unique_sections
*unique_section_list
;
74 static struct asneeded_minfo
*asneeded_list_head
;
75 static unsigned int opb_shift
= 0;
77 /* Forward declarations. */
78 static void exp_init_os (etree_type
*);
79 static lang_input_statement_type
*lookup_name (const char *);
80 static void insert_undefined (const char *);
81 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
82 static void print_statement (lang_statement_union_type
*,
83 lang_output_section_statement_type
*);
84 static void print_statement_list (lang_statement_union_type
*,
85 lang_output_section_statement_type
*);
86 static void print_statements (void);
87 static void print_input_section (asection
*, bfd_boolean
);
88 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
89 static void lang_record_phdrs (void);
90 static void lang_do_version_exports_section (void);
91 static void lang_finalize_version_expr_head
92 (struct bfd_elf_version_expr_head
*);
93 static void lang_do_memory_regions (void);
95 /* Exported variables. */
96 const char *output_target
;
97 lang_output_section_statement_type
*abs_output_section
;
98 lang_statement_list_type lang_output_section_statement
;
99 lang_statement_list_type
*stat_ptr
= &statement_list
;
100 lang_statement_list_type file_chain
= { NULL
, NULL
};
101 lang_statement_list_type input_file_chain
;
102 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
103 const char *entry_section
= ".text";
104 struct lang_input_statement_flags input_flags
;
105 bfd_boolean entry_from_cmdline
;
106 bfd_boolean undef_from_cmdline
;
107 bfd_boolean lang_has_input_file
= FALSE
;
108 bfd_boolean had_output_filename
= FALSE
;
109 bfd_boolean lang_float_flag
= FALSE
;
110 bfd_boolean delete_output_file_on_failure
= FALSE
;
111 struct lang_phdr
*lang_phdr_list
;
112 struct lang_nocrossrefs
*nocrossref_list
;
113 struct asneeded_minfo
**asneeded_list_tail
;
115 /* Functions that traverse the linker script and might evaluate
116 DEFINED() need to increment this at the start of the traversal. */
117 int lang_statement_iteration
= 0;
119 /* Return TRUE if the PATTERN argument is a wildcard pattern.
120 Although backslashes are treated specially if a pattern contains
121 wildcards, we do not consider the mere presence of a backslash to
122 be enough to cause the pattern to be treated as a wildcard.
123 That lets us handle DOS filenames more naturally. */
124 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
126 #define new_stat(x, y) \
127 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
129 #define outside_section_address(q) \
130 ((q)->output_offset + (q)->output_section->vma)
132 #define outside_symbol_address(q) \
133 ((q)->value + outside_section_address (q->section))
135 #define SECTION_NAME_MAP_LENGTH (16)
138 stat_alloc (size_t size
)
140 return obstack_alloc (&stat_obstack
, size
);
144 name_match (const char *pattern
, const char *name
)
146 if (wildcardp (pattern
))
147 return fnmatch (pattern
, name
, 0);
148 return strcmp (pattern
, name
);
151 /* If PATTERN is of the form archive:file, return a pointer to the
152 separator. If not, return NULL. */
155 archive_path (const char *pattern
)
159 if (link_info
.path_separator
== 0)
162 p
= strchr (pattern
, link_info
.path_separator
);
163 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
164 if (p
== NULL
|| link_info
.path_separator
!= ':')
167 /* Assume a match on the second char is part of drive specifier,
168 as in "c:\silly.dos". */
169 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
170 p
= strchr (p
+ 1, link_info
.path_separator
);
175 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
176 return whether F matches FILE_SPEC. */
179 input_statement_is_archive_path (const char *file_spec
, char *sep
,
180 lang_input_statement_type
*f
)
182 bfd_boolean match
= FALSE
;
185 || name_match (sep
+ 1, f
->filename
) == 0)
186 && ((sep
!= file_spec
)
187 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
191 if (sep
!= file_spec
)
193 const char *aname
= f
->the_bfd
->my_archive
->filename
;
195 match
= name_match (file_spec
, aname
) == 0;
196 *sep
= link_info
.path_separator
;
203 unique_section_p (const asection
*sec
,
204 const lang_output_section_statement_type
*os
)
206 struct unique_sections
*unam
;
209 if (!link_info
.resolve_section_groups
210 && sec
->owner
!= NULL
211 && bfd_is_group_section (sec
->owner
, sec
))
213 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
216 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
217 if (name_match (unam
->name
, secnam
) == 0)
223 /* Generic traversal routines for finding matching sections. */
225 /* Return true if FILE matches a pattern in EXCLUDE_LIST, otherwise return
229 walk_wild_file_in_exclude_list (struct name_list
*exclude_list
,
230 lang_input_statement_type
*file
)
232 struct name_list
*list_tmp
;
234 for (list_tmp
= exclude_list
;
236 list_tmp
= list_tmp
->next
)
238 char *p
= archive_path (list_tmp
->name
);
242 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
246 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
249 /* FIXME: Perhaps remove the following at some stage? Matching
250 unadorned archives like this was never documented and has
251 been superceded by the archive:path syntax. */
252 else if (file
->the_bfd
!= NULL
253 && file
->the_bfd
->my_archive
!= NULL
254 && name_match (list_tmp
->name
,
255 file
->the_bfd
->my_archive
->filename
) == 0)
262 /* Try processing a section against a wildcard. This just calls
263 the callback unless the filename exclusion list is present
264 and excludes the file. It's hardly ever present so this
265 function is very fast. */
268 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
269 lang_input_statement_type
*file
,
271 struct wildcard_list
*sec
,
275 /* Don't process sections from files which were excluded. */
276 if (walk_wild_file_in_exclude_list (sec
->spec
.exclude_name_list
, file
))
279 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
282 /* Lowest common denominator routine that can handle everything correctly,
286 walk_wild_section_general (lang_wild_statement_type
*ptr
,
287 lang_input_statement_type
*file
,
292 struct wildcard_list
*sec
;
294 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
296 sec
= ptr
->section_list
;
298 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
302 bfd_boolean skip
= FALSE
;
304 if (sec
->spec
.name
!= NULL
)
306 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
308 skip
= name_match (sec
->spec
.name
, sname
) != 0;
312 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
319 /* Routines to find a single section given its name. If there's more
320 than one section with that name, we report that. */
324 asection
*found_section
;
325 bfd_boolean multiple_sections_found
;
326 } section_iterator_callback_data
;
329 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
331 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
333 if (d
->found_section
!= NULL
)
335 d
->multiple_sections_found
= TRUE
;
339 d
->found_section
= s
;
344 find_section (lang_input_statement_type
*file
,
345 struct wildcard_list
*sec
,
346 bfd_boolean
*multiple_sections_found
)
348 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
350 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
351 section_iterator_callback
, &cb_data
);
352 *multiple_sections_found
= cb_data
.multiple_sections_found
;
353 return cb_data
.found_section
;
356 /* Code for handling simple wildcards without going through fnmatch,
357 which can be expensive because of charset translations etc. */
359 /* A simple wild is a literal string followed by a single '*',
360 where the literal part is at least 4 characters long. */
363 is_simple_wild (const char *name
)
365 size_t len
= strcspn (name
, "*?[");
366 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
370 match_simple_wild (const char *pattern
, const char *name
)
372 /* The first four characters of the pattern are guaranteed valid
373 non-wildcard characters. So we can go faster. */
374 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
375 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
380 while (*pattern
!= '*')
381 if (*name
++ != *pattern
++)
387 /* Return the numerical value of the init_priority attribute from
388 section name NAME. */
391 get_init_priority (const char *name
)
394 unsigned long init_priority
;
396 /* GCC uses the following section names for the init_priority
397 attribute with numerical values 101 and 65535 inclusive. A
398 lower value means a higher priority.
400 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
401 decimal numerical value of the init_priority attribute.
402 The order of execution in .init_array is forward and
403 .fini_array is backward.
404 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
405 decimal numerical value of the init_priority attribute.
406 The order of execution in .ctors is backward and .dtors
409 if (strncmp (name
, ".init_array.", 12) == 0
410 || strncmp (name
, ".fini_array.", 12) == 0)
412 init_priority
= strtoul (name
+ 12, &end
, 10);
413 return *end
? 0 : init_priority
;
415 else if (strncmp (name
, ".ctors.", 7) == 0
416 || strncmp (name
, ".dtors.", 7) == 0)
418 init_priority
= strtoul (name
+ 7, &end
, 10);
419 return *end
? 0 : 65535 - init_priority
;
425 /* Compare sections ASEC and BSEC according to SORT. */
428 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
431 unsigned long ainit_priority
, binit_priority
;
438 case by_init_priority
:
440 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
442 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
443 if (ainit_priority
== 0 || binit_priority
== 0)
445 ret
= ainit_priority
- binit_priority
;
451 case by_alignment_name
:
452 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
453 - bfd_section_alignment (asec
->owner
, asec
));
460 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
461 bfd_get_section_name (bsec
->owner
, bsec
));
464 case by_name_alignment
:
465 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
466 bfd_get_section_name (bsec
->owner
, bsec
));
472 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
473 - bfd_section_alignment (asec
->owner
, asec
));
480 /* Build a Binary Search Tree to sort sections, unlike insertion sort
481 used in wild_sort(). BST is considerably faster if the number of
482 of sections are large. */
484 static lang_section_bst_type
**
485 wild_sort_fast (lang_wild_statement_type
*wild
,
486 struct wildcard_list
*sec
,
487 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
490 lang_section_bst_type
**tree
;
493 if (!wild
->filenames_sorted
494 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
496 /* Append at the right end of tree. */
498 tree
= &((*tree
)->right
);
504 /* Find the correct node to append this section. */
505 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
506 tree
= &((*tree
)->left
);
508 tree
= &((*tree
)->right
);
514 /* Use wild_sort_fast to build a BST to sort sections. */
517 output_section_callback_fast (lang_wild_statement_type
*ptr
,
518 struct wildcard_list
*sec
,
520 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
521 lang_input_statement_type
*file
,
524 lang_section_bst_type
*node
;
525 lang_section_bst_type
**tree
;
526 lang_output_section_statement_type
*os
;
528 os
= (lang_output_section_statement_type
*) output
;
530 if (unique_section_p (section
, os
))
533 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
536 node
->section
= section
;
538 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
543 /* Convert a sorted sections' BST back to list form. */
546 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
547 lang_section_bst_type
*tree
,
551 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
553 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
554 (lang_output_section_statement_type
*) output
);
557 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
562 /* Specialized, optimized routines for handling different kinds of
566 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
567 lang_input_statement_type
*file
,
571 /* We can just do a hash lookup for the section with the right name.
572 But if that lookup discovers more than one section with the name
573 (should be rare), we fall back to the general algorithm because
574 we would otherwise have to sort the sections to make sure they
575 get processed in the bfd's order. */
576 bfd_boolean multiple_sections_found
;
577 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
578 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
580 if (multiple_sections_found
)
581 walk_wild_section_general (ptr
, file
, callback
, data
);
583 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
587 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
588 lang_input_statement_type
*file
,
593 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
595 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
597 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
598 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
601 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
606 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
607 lang_input_statement_type
*file
,
612 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
613 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
614 bfd_boolean multiple_sections_found
;
615 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
617 if (multiple_sections_found
)
619 walk_wild_section_general (ptr
, file
, callback
, data
);
623 /* Note that if the section was not found, s0 is NULL and
624 we'll simply never succeed the s == s0 test below. */
625 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
627 /* Recall that in this code path, a section cannot satisfy more
628 than one spec, so if s == s0 then it cannot match
631 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
634 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
635 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
638 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
645 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
646 lang_input_statement_type
*file
,
651 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
652 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
653 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
654 bfd_boolean multiple_sections_found
;
655 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
657 if (multiple_sections_found
)
659 walk_wild_section_general (ptr
, file
, callback
, data
);
663 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
666 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
669 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
670 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
673 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
676 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
678 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
686 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
687 lang_input_statement_type
*file
,
692 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
693 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
694 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
695 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
696 bfd_boolean multiple_sections_found
;
697 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
699 if (multiple_sections_found
)
701 walk_wild_section_general (ptr
, file
, callback
, data
);
705 s1
= find_section (file
, sec1
, &multiple_sections_found
);
706 if (multiple_sections_found
)
708 walk_wild_section_general (ptr
, file
, callback
, data
);
712 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
715 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
718 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
721 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
722 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
726 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
730 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
732 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
740 walk_wild_section (lang_wild_statement_type
*ptr
,
741 lang_input_statement_type
*file
,
745 if (file
->flags
.just_syms
)
748 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
751 /* Returns TRUE when name1 is a wildcard spec that might match
752 something name2 can match. We're conservative: we return FALSE
753 only if the prefixes of name1 and name2 are different up to the
754 first wildcard character. */
757 wild_spec_can_overlap (const char *name1
, const char *name2
)
759 size_t prefix1_len
= strcspn (name1
, "?*[");
760 size_t prefix2_len
= strcspn (name2
, "?*[");
761 size_t min_prefix_len
;
763 /* Note that if there is no wildcard character, then we treat the
764 terminating 0 as part of the prefix. Thus ".text" won't match
765 ".text." or ".text.*", for example. */
766 if (name1
[prefix1_len
] == '\0')
768 if (name2
[prefix2_len
] == '\0')
771 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
773 return memcmp (name1
, name2
, min_prefix_len
) == 0;
776 /* Select specialized code to handle various kinds of wildcard
780 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
783 int wild_name_count
= 0;
784 struct wildcard_list
*sec
;
788 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
789 ptr
->handler_data
[0] = NULL
;
790 ptr
->handler_data
[1] = NULL
;
791 ptr
->handler_data
[2] = NULL
;
792 ptr
->handler_data
[3] = NULL
;
795 /* Count how many wildcard_specs there are, and how many of those
796 actually use wildcards in the name. Also, bail out if any of the
797 wildcard names are NULL. (Can this actually happen?
798 walk_wild_section used to test for it.) And bail out if any
799 of the wildcards are more complex than a simple string
800 ending in a single '*'. */
801 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
804 if (sec
->spec
.name
== NULL
)
806 if (wildcardp (sec
->spec
.name
))
809 if (!is_simple_wild (sec
->spec
.name
))
814 /* The zero-spec case would be easy to optimize but it doesn't
815 happen in practice. Likewise, more than 4 specs doesn't
816 happen in practice. */
817 if (sec_count
== 0 || sec_count
> 4)
820 /* Check that no two specs can match the same section. */
821 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
823 struct wildcard_list
*sec2
;
824 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
826 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
831 signature
= (sec_count
<< 8) + wild_name_count
;
835 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
838 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
841 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
844 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
847 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
853 /* Now fill the data array with pointers to the specs, first the
854 specs with non-wildcard names, then the specs with wildcard
855 names. It's OK to process the specs in different order from the
856 given order, because we've already determined that no section
857 will match more than one spec. */
859 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
860 if (!wildcardp (sec
->spec
.name
))
861 ptr
->handler_data
[data_counter
++] = sec
;
862 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
863 if (wildcardp (sec
->spec
.name
))
864 ptr
->handler_data
[data_counter
++] = sec
;
867 /* Handle a wild statement for a single file F. */
870 walk_wild_file (lang_wild_statement_type
*s
,
871 lang_input_statement_type
*f
,
875 if (walk_wild_file_in_exclude_list (s
->exclude_name_list
, f
))
878 if (f
->the_bfd
== NULL
879 || !bfd_check_format (f
->the_bfd
, bfd_archive
))
880 walk_wild_section (s
, f
, callback
, data
);
885 /* This is an archive file. We must map each member of the
886 archive separately. */
887 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
888 while (member
!= NULL
)
890 /* When lookup_name is called, it will call the add_symbols
891 entry point for the archive. For each element of the
892 archive which is included, BFD will call ldlang_add_file,
893 which will set the usrdata field of the member to the
894 lang_input_statement. */
895 if (member
->usrdata
!= NULL
)
897 walk_wild_section (s
,
898 (lang_input_statement_type
*) member
->usrdata
,
902 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
908 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
910 const char *file_spec
= s
->filename
;
913 if (file_spec
== NULL
)
915 /* Perform the iteration over all files in the list. */
916 LANG_FOR_EACH_INPUT_STATEMENT (f
)
918 walk_wild_file (s
, f
, callback
, data
);
921 else if ((p
= archive_path (file_spec
)) != NULL
)
923 LANG_FOR_EACH_INPUT_STATEMENT (f
)
925 if (input_statement_is_archive_path (file_spec
, p
, f
))
926 walk_wild_file (s
, f
, callback
, data
);
929 else if (wildcardp (file_spec
))
931 LANG_FOR_EACH_INPUT_STATEMENT (f
)
933 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
934 walk_wild_file (s
, f
, callback
, data
);
939 lang_input_statement_type
*f
;
941 /* Perform the iteration over a single file. */
942 f
= lookup_name (file_spec
);
944 walk_wild_file (s
, f
, callback
, data
);
948 /* lang_for_each_statement walks the parse tree and calls the provided
949 function for each node, except those inside output section statements
950 with constraint set to -1. */
953 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
954 lang_statement_union_type
*s
)
956 for (; s
!= NULL
; s
= s
->header
.next
)
960 switch (s
->header
.type
)
962 case lang_constructors_statement_enum
:
963 lang_for_each_statement_worker (func
, constructor_list
.head
);
965 case lang_output_section_statement_enum
:
966 if (s
->output_section_statement
.constraint
!= -1)
967 lang_for_each_statement_worker
968 (func
, s
->output_section_statement
.children
.head
);
970 case lang_wild_statement_enum
:
971 lang_for_each_statement_worker (func
,
972 s
->wild_statement
.children
.head
);
974 case lang_group_statement_enum
:
975 lang_for_each_statement_worker (func
,
976 s
->group_statement
.children
.head
);
978 case lang_data_statement_enum
:
979 case lang_reloc_statement_enum
:
980 case lang_object_symbols_statement_enum
:
981 case lang_output_statement_enum
:
982 case lang_target_statement_enum
:
983 case lang_input_section_enum
:
984 case lang_input_statement_enum
:
985 case lang_assignment_statement_enum
:
986 case lang_padding_statement_enum
:
987 case lang_address_statement_enum
:
988 case lang_fill_statement_enum
:
989 case lang_insert_statement_enum
:
999 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
1001 lang_for_each_statement_worker (func
, statement_list
.head
);
1004 /*----------------------------------------------------------------------*/
1007 lang_list_init (lang_statement_list_type
*list
)
1010 list
->tail
= &list
->head
;
1014 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1016 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1018 *stat_save_ptr
++ = stat_ptr
;
1025 if (stat_save_ptr
<= stat_save
)
1027 stat_ptr
= *--stat_save_ptr
;
1030 /* Build a new statement node for the parse tree. */
1032 static lang_statement_union_type
*
1033 new_statement (enum statement_enum type
,
1035 lang_statement_list_type
*list
)
1037 lang_statement_union_type
*new_stmt
;
1039 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1040 new_stmt
->header
.type
= type
;
1041 new_stmt
->header
.next
= NULL
;
1042 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1046 /* Build a new input file node for the language. There are several
1047 ways in which we treat an input file, eg, we only look at symbols,
1048 or prefix it with a -l etc.
1050 We can be supplied with requests for input files more than once;
1051 they may, for example be split over several lines like foo.o(.text)
1052 foo.o(.data) etc, so when asked for a file we check that we haven't
1053 got it already so we don't duplicate the bfd. */
1055 static lang_input_statement_type
*
1056 new_afile (const char *name
,
1057 lang_input_file_enum_type file_type
,
1059 bfd_boolean add_to_list
)
1061 lang_input_statement_type
*p
;
1063 lang_has_input_file
= TRUE
;
1066 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1069 p
= (lang_input_statement_type
*)
1070 stat_alloc (sizeof (lang_input_statement_type
));
1071 p
->header
.type
= lang_input_statement_enum
;
1072 p
->header
.next
= NULL
;
1075 memset (&p
->the_bfd
, 0,
1076 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1078 p
->flags
.dynamic
= input_flags
.dynamic
;
1079 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1080 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1081 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1082 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1086 case lang_input_file_is_symbols_only_enum
:
1088 p
->local_sym_name
= name
;
1089 p
->flags
.real
= TRUE
;
1090 p
->flags
.just_syms
= TRUE
;
1092 case lang_input_file_is_fake_enum
:
1094 p
->local_sym_name
= name
;
1096 case lang_input_file_is_l_enum
:
1097 if (name
[0] == ':' && name
[1] != '\0')
1099 p
->filename
= name
+ 1;
1100 p
->flags
.full_name_provided
= TRUE
;
1104 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1105 p
->flags
.maybe_archive
= TRUE
;
1106 p
->flags
.real
= TRUE
;
1107 p
->flags
.search_dirs
= TRUE
;
1109 case lang_input_file_is_marker_enum
:
1111 p
->local_sym_name
= name
;
1112 p
->flags
.search_dirs
= TRUE
;
1114 case lang_input_file_is_search_file_enum
:
1116 p
->local_sym_name
= name
;
1117 p
->flags
.real
= TRUE
;
1118 p
->flags
.search_dirs
= TRUE
;
1120 case lang_input_file_is_file_enum
:
1122 p
->local_sym_name
= name
;
1123 p
->flags
.real
= TRUE
;
1129 lang_statement_append (&input_file_chain
,
1130 (lang_statement_union_type
*) p
,
1131 &p
->next_real_file
);
1135 lang_input_statement_type
*
1136 lang_add_input_file (const char *name
,
1137 lang_input_file_enum_type file_type
,
1141 && (*name
== '=' || CONST_STRNEQ (name
, "$SYSROOT")))
1143 lang_input_statement_type
*ret
;
1144 char *sysrooted_name
1145 = concat (ld_sysroot
,
1146 name
+ (*name
== '=' ? 1 : strlen ("$SYSROOT")),
1147 (const char *) NULL
);
1149 /* We've now forcibly prepended the sysroot, making the input
1150 file independent of the context. Therefore, temporarily
1151 force a non-sysrooted context for this statement, so it won't
1152 get the sysroot prepended again when opened. (N.B. if it's a
1153 script, any child nodes with input files starting with "/"
1154 will be handled as "sysrooted" as they'll be found to be
1155 within the sysroot subdirectory.) */
1156 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1157 input_flags
.sysrooted
= 0;
1158 ret
= new_afile (sysrooted_name
, file_type
, target
, TRUE
);
1159 input_flags
.sysrooted
= outer_sysrooted
;
1163 return new_afile (name
, file_type
, target
, TRUE
);
1166 struct out_section_hash_entry
1168 struct bfd_hash_entry root
;
1169 lang_statement_union_type s
;
1172 /* The hash table. */
1174 static struct bfd_hash_table output_section_statement_table
;
1176 /* Support routines for the hash table used by lang_output_section_find,
1177 initialize the table, fill in an entry and remove the table. */
1179 static struct bfd_hash_entry
*
1180 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1181 struct bfd_hash_table
*table
,
1184 lang_output_section_statement_type
**nextp
;
1185 struct out_section_hash_entry
*ret
;
1189 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1195 entry
= bfd_hash_newfunc (entry
, table
, string
);
1199 ret
= (struct out_section_hash_entry
*) entry
;
1200 memset (&ret
->s
, 0, sizeof (ret
->s
));
1201 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1202 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1203 ret
->s
.output_section_statement
.section_alignment
= -1;
1204 ret
->s
.output_section_statement
.block_value
= 1;
1205 lang_list_init (&ret
->s
.output_section_statement
.children
);
1206 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1208 /* For every output section statement added to the list, except the
1209 first one, lang_output_section_statement.tail points to the "next"
1210 field of the last element of the list. */
1211 if (lang_output_section_statement
.head
!= NULL
)
1212 ret
->s
.output_section_statement
.prev
1213 = ((lang_output_section_statement_type
*)
1214 ((char *) lang_output_section_statement
.tail
1215 - offsetof (lang_output_section_statement_type
, next
)));
1217 /* GCC's strict aliasing rules prevent us from just casting the
1218 address, so we store the pointer in a variable and cast that
1220 nextp
= &ret
->s
.output_section_statement
.next
;
1221 lang_statement_append (&lang_output_section_statement
,
1223 (lang_statement_union_type
**) nextp
);
1228 output_section_statement_table_init (void)
1230 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1231 output_section_statement_newfunc
,
1232 sizeof (struct out_section_hash_entry
),
1234 einfo (_("%P%F: 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:%S: warning: redeclaration of memory region `%s'\n"),
1323 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1324 einfo (_("%P:%S: 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:%S: 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:%S: error: redefinition of memory region "
1377 /* Check if the target region exists. */
1379 einfo (_("%F%P:%S: 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 (_("%P%F: 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 (_("%P%F: 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 ("%B ", m
->ref
);
2020 minfo ("(%T)\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 (_("%P%F: 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 (_("%P%F: output format %s cannot represent section"
2177 " called %s: %E\n"),
2178 link_info
.output_bfd
->xvec
->name
, s
->name
);
2180 s
->bfd_section
->output_section
= s
->bfd_section
;
2181 s
->bfd_section
->output_offset
= 0;
2183 /* Set the userdata of the output section to the output section
2184 statement to avoid lookup. */
2185 get_userdata (s
->bfd_section
) = s
;
2187 /* If there is a base address, make sure that any sections it might
2188 mention are initialized. */
2189 if (s
->addr_tree
!= NULL
)
2190 exp_init_os (s
->addr_tree
);
2192 if (s
->load_base
!= NULL
)
2193 exp_init_os (s
->load_base
);
2195 /* If supplied an alignment, set it. */
2196 if (s
->section_alignment
!= -1)
2197 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2200 /* Make sure that all output sections mentioned in an expression are
2204 exp_init_os (etree_type
*exp
)
2206 switch (exp
->type
.node_class
)
2210 case etree_provided
:
2211 exp_init_os (exp
->assign
.src
);
2215 exp_init_os (exp
->binary
.lhs
);
2216 exp_init_os (exp
->binary
.rhs
);
2220 exp_init_os (exp
->trinary
.cond
);
2221 exp_init_os (exp
->trinary
.lhs
);
2222 exp_init_os (exp
->trinary
.rhs
);
2226 exp_init_os (exp
->assert_s
.child
);
2230 exp_init_os (exp
->unary
.child
);
2234 switch (exp
->type
.node_code
)
2240 lang_output_section_statement_type
*os
;
2242 os
= lang_output_section_find (exp
->name
.name
);
2243 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2255 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2257 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2259 /* If we are only reading symbols from this object, then we want to
2260 discard all sections. */
2261 if (entry
->flags
.just_syms
)
2263 bfd_link_just_syms (abfd
, sec
, &link_info
);
2267 /* Deal with SHF_EXCLUDE ELF sections. */
2268 if (!bfd_link_relocatable (&link_info
)
2269 && (abfd
->flags
& BFD_PLUGIN
) == 0
2270 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2271 sec
->output_section
= bfd_abs_section_ptr
;
2273 if (!(abfd
->flags
& DYNAMIC
))
2274 bfd_section_already_linked (abfd
, sec
, &link_info
);
2278 /* Returns true if SECTION is one we know will be discarded based on its
2279 section flags, otherwise returns false. */
2282 lang_discard_section_p (asection
*section
)
2284 bfd_boolean discard
;
2285 flagword flags
= section
->flags
;
2287 /* Discard sections marked with SEC_EXCLUDE. */
2288 discard
= (flags
& SEC_EXCLUDE
) != 0;
2290 /* Discard the group descriptor sections when we're finally placing the
2291 sections from within the group. */
2292 if ((flags
& SEC_GROUP
) != 0
2293 && link_info
.resolve_section_groups
)
2296 /* Discard debugging sections if we are stripping debugging
2298 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2299 && (flags
& SEC_DEBUGGING
) != 0)
2305 /* The wild routines.
2307 These expand statements like *(.text) and foo.o to a list of
2308 explicit actions, like foo.o(.text), bar.o(.text) and
2309 foo.o(.text, .data). */
2311 /* Add SECTION to the output section OUTPUT. Do this by creating a
2312 lang_input_section statement which is placed at PTR. */
2315 lang_add_section (lang_statement_list_type
*ptr
,
2317 struct flag_info
*sflag_info
,
2318 lang_output_section_statement_type
*output
)
2320 flagword flags
= section
->flags
;
2322 bfd_boolean discard
;
2323 lang_input_section_type
*new_section
;
2324 bfd
*abfd
= link_info
.output_bfd
;
2326 /* Is this section one we know should be discarded? */
2327 discard
= lang_discard_section_p (section
);
2329 /* Discard input sections which are assigned to a section named
2330 DISCARD_SECTION_NAME. */
2331 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2336 if (section
->output_section
== NULL
)
2338 /* This prevents future calls from assigning this section. */
2339 section
->output_section
= bfd_abs_section_ptr
;
2348 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2353 if (section
->output_section
!= NULL
)
2356 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2357 to an output section, because we want to be able to include a
2358 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2359 section (I don't know why we want to do this, but we do).
2360 build_link_order in ldwrite.c handles this case by turning
2361 the embedded SEC_NEVER_LOAD section into a fill. */
2362 flags
&= ~ SEC_NEVER_LOAD
;
2364 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2365 already been processed. One reason to do this is that on pe
2366 format targets, .text$foo sections go into .text and it's odd
2367 to see .text with SEC_LINK_ONCE set. */
2368 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2370 if (link_info
.resolve_section_groups
)
2371 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2373 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2375 else if (!bfd_link_relocatable (&link_info
))
2376 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2378 switch (output
->sectype
)
2380 case normal_section
:
2381 case overlay_section
:
2383 case noalloc_section
:
2384 flags
&= ~SEC_ALLOC
;
2386 case noload_section
:
2388 flags
|= SEC_NEVER_LOAD
;
2389 /* Unfortunately GNU ld has managed to evolve two different
2390 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2391 alloc, no contents section. All others get a noload, noalloc
2393 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2394 flags
&= ~SEC_HAS_CONTENTS
;
2396 flags
&= ~SEC_ALLOC
;
2400 if (output
->bfd_section
== NULL
)
2401 init_os (output
, flags
);
2403 /* If SEC_READONLY is not set in the input section, then clear
2404 it from the output section. */
2405 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2407 if (output
->bfd_section
->linker_has_input
)
2409 /* Only set SEC_READONLY flag on the first input section. */
2410 flags
&= ~ SEC_READONLY
;
2412 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2413 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2414 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2415 || ((flags
& SEC_MERGE
) != 0
2416 && output
->bfd_section
->entsize
!= section
->entsize
))
2418 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2419 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2422 output
->bfd_section
->flags
|= flags
;
2424 if (!output
->bfd_section
->linker_has_input
)
2426 output
->bfd_section
->linker_has_input
= 1;
2427 /* This must happen after flags have been updated. The output
2428 section may have been created before we saw its first input
2429 section, eg. for a data statement. */
2430 bfd_init_private_section_data (section
->owner
, section
,
2431 link_info
.output_bfd
,
2432 output
->bfd_section
,
2434 if ((flags
& SEC_MERGE
) != 0)
2435 output
->bfd_section
->entsize
= section
->entsize
;
2438 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2439 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2441 /* FIXME: This value should really be obtained from the bfd... */
2442 output
->block_value
= 128;
2445 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2446 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2448 section
->output_section
= output
->bfd_section
;
2450 if (!map_head_is_link_order
)
2452 asection
*s
= output
->bfd_section
->map_tail
.s
;
2453 output
->bfd_section
->map_tail
.s
= section
;
2454 section
->map_head
.s
= NULL
;
2455 section
->map_tail
.s
= s
;
2457 s
->map_head
.s
= section
;
2459 output
->bfd_section
->map_head
.s
= section
;
2462 /* Add a section reference to the list. */
2463 new_section
= new_stat (lang_input_section
, ptr
);
2464 new_section
->section
= section
;
2467 /* Handle wildcard sorting. This returns the lang_input_section which
2468 should follow the one we are going to create for SECTION and FILE,
2469 based on the sorting requirements of WILD. It returns NULL if the
2470 new section should just go at the end of the current list. */
2472 static lang_statement_union_type
*
2473 wild_sort (lang_wild_statement_type
*wild
,
2474 struct wildcard_list
*sec
,
2475 lang_input_statement_type
*file
,
2478 lang_statement_union_type
*l
;
2480 if (!wild
->filenames_sorted
2481 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2484 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2486 lang_input_section_type
*ls
;
2488 if (l
->header
.type
!= lang_input_section_enum
)
2490 ls
= &l
->input_section
;
2492 /* Sorting by filename takes precedence over sorting by section
2495 if (wild
->filenames_sorted
)
2497 const char *fn
, *ln
;
2501 /* The PE support for the .idata section as generated by
2502 dlltool assumes that files will be sorted by the name of
2503 the archive and then the name of the file within the
2506 if (file
->the_bfd
!= NULL
2507 && file
->the_bfd
->my_archive
!= NULL
)
2509 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2514 fn
= file
->filename
;
2518 if (ls
->section
->owner
->my_archive
!= NULL
)
2520 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2525 ln
= ls
->section
->owner
->filename
;
2529 i
= filename_cmp (fn
, ln
);
2538 fn
= file
->filename
;
2540 ln
= ls
->section
->owner
->filename
;
2542 i
= filename_cmp (fn
, ln
);
2550 /* Here either the files are not sorted by name, or we are
2551 looking at the sections for this file. */
2554 && sec
->spec
.sorted
!= none
2555 && sec
->spec
.sorted
!= by_none
)
2556 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2563 /* Expand a wild statement for a particular FILE. SECTION may be
2564 NULL, in which case it is a wild card. */
2567 output_section_callback (lang_wild_statement_type
*ptr
,
2568 struct wildcard_list
*sec
,
2570 struct flag_info
*sflag_info
,
2571 lang_input_statement_type
*file
,
2574 lang_statement_union_type
*before
;
2575 lang_output_section_statement_type
*os
;
2577 os
= (lang_output_section_statement_type
*) output
;
2579 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2580 if (unique_section_p (section
, os
))
2583 before
= wild_sort (ptr
, sec
, file
, section
);
2585 /* Here BEFORE points to the lang_input_section which
2586 should follow the one we are about to add. If BEFORE
2587 is NULL, then the section should just go at the end
2588 of the current list. */
2591 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2594 lang_statement_list_type list
;
2595 lang_statement_union_type
**pp
;
2597 lang_list_init (&list
);
2598 lang_add_section (&list
, section
, sflag_info
, os
);
2600 /* If we are discarding the section, LIST.HEAD will
2602 if (list
.head
!= NULL
)
2604 ASSERT (list
.head
->header
.next
== NULL
);
2606 for (pp
= &ptr
->children
.head
;
2608 pp
= &(*pp
)->header
.next
)
2609 ASSERT (*pp
!= NULL
);
2611 list
.head
->header
.next
= *pp
;
2617 /* Check if all sections in a wild statement for a particular FILE
2621 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2622 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2624 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2625 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2628 lang_output_section_statement_type
*os
;
2630 os
= (lang_output_section_statement_type
*) output
;
2632 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2633 if (unique_section_p (section
, os
))
2636 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2637 os
->all_input_readonly
= FALSE
;
2640 /* This is passed a file name which must have been seen already and
2641 added to the statement tree. We will see if it has been opened
2642 already and had its symbols read. If not then we'll read it. */
2644 static lang_input_statement_type
*
2645 lookup_name (const char *name
)
2647 lang_input_statement_type
*search
;
2649 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2651 search
= (lang_input_statement_type
*) search
->next_real_file
)
2653 /* Use the local_sym_name as the name of the file that has
2654 already been loaded as filename might have been transformed
2655 via the search directory lookup mechanism. */
2656 const char *filename
= search
->local_sym_name
;
2658 if (filename
!= NULL
2659 && filename_cmp (filename
, name
) == 0)
2664 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2665 default_target
, FALSE
);
2667 /* If we have already added this file, or this file is not real
2668 don't add this file. */
2669 if (search
->flags
.loaded
|| !search
->flags
.real
)
2672 if (!load_symbols (search
, NULL
))
2678 /* Save LIST as a list of libraries whose symbols should not be exported. */
2683 struct excluded_lib
*next
;
2685 static struct excluded_lib
*excluded_libs
;
2688 add_excluded_libs (const char *list
)
2690 const char *p
= list
, *end
;
2694 struct excluded_lib
*entry
;
2695 end
= strpbrk (p
, ",:");
2697 end
= p
+ strlen (p
);
2698 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2699 entry
->next
= excluded_libs
;
2700 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2701 memcpy (entry
->name
, p
, end
- p
);
2702 entry
->name
[end
- p
] = '\0';
2703 excluded_libs
= entry
;
2711 check_excluded_libs (bfd
*abfd
)
2713 struct excluded_lib
*lib
= excluded_libs
;
2717 int len
= strlen (lib
->name
);
2718 const char *filename
= lbasename (abfd
->filename
);
2720 if (strcmp (lib
->name
, "ALL") == 0)
2722 abfd
->no_export
= TRUE
;
2726 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2727 && (filename
[len
] == '\0'
2728 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2729 && filename
[len
+ 2] == '\0')))
2731 abfd
->no_export
= TRUE
;
2739 /* Get the symbols for an input file. */
2742 load_symbols (lang_input_statement_type
*entry
,
2743 lang_statement_list_type
*place
)
2747 if (entry
->flags
.loaded
)
2750 ldfile_open_file (entry
);
2752 /* Do not process further if the file was missing. */
2753 if (entry
->flags
.missing_file
)
2756 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
2757 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2760 struct lang_input_statement_flags save_flags
;
2763 err
= bfd_get_error ();
2765 /* See if the emulation has some special knowledge. */
2766 if (ldemul_unrecognized_file (entry
))
2769 if (err
== bfd_error_file_ambiguously_recognized
)
2773 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2774 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2775 for (p
= matching
; *p
!= NULL
; p
++)
2779 else if (err
!= bfd_error_file_not_recognized
2781 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2783 bfd_close (entry
->the_bfd
);
2784 entry
->the_bfd
= NULL
;
2786 /* Try to interpret the file as a linker script. */
2787 save_flags
= input_flags
;
2788 ldfile_open_command_file (entry
->filename
);
2790 push_stat_ptr (place
);
2791 input_flags
.add_DT_NEEDED_for_regular
2792 = entry
->flags
.add_DT_NEEDED_for_regular
;
2793 input_flags
.add_DT_NEEDED_for_dynamic
2794 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2795 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2796 input_flags
.dynamic
= entry
->flags
.dynamic
;
2798 ldfile_assumed_script
= TRUE
;
2799 parser_input
= input_script
;
2801 ldfile_assumed_script
= FALSE
;
2803 /* missing_file is sticky. sysrooted will already have been
2804 restored when seeing EOF in yyparse, but no harm to restore
2806 save_flags
.missing_file
|= input_flags
.missing_file
;
2807 input_flags
= save_flags
;
2811 entry
->flags
.loaded
= TRUE
;
2816 if (ldemul_recognized_file (entry
))
2819 /* We don't call ldlang_add_file for an archive. Instead, the
2820 add_symbols entry point will call ldlang_add_file, via the
2821 add_archive_element callback, for each element of the archive
2823 switch (bfd_get_format (entry
->the_bfd
))
2829 if (!entry
->flags
.reload
)
2830 ldlang_add_file (entry
);
2831 if (trace_files
|| verbose
)
2832 info_msg ("%I\n", entry
);
2836 check_excluded_libs (entry
->the_bfd
);
2838 entry
->the_bfd
->usrdata
= entry
;
2839 if (entry
->flags
.whole_archive
)
2842 bfd_boolean loaded
= TRUE
;
2847 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2852 if (!bfd_check_format (member
, bfd_object
))
2854 einfo (_("%F%B: member %B in archive is not an object\n"),
2855 entry
->the_bfd
, member
);
2860 if (!(*link_info
.callbacks
2861 ->add_archive_element
) (&link_info
, member
,
2862 "--whole-archive", &subsbfd
))
2865 /* Potentially, the add_archive_element hook may have set a
2866 substitute BFD for us. */
2867 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2869 einfo (_("%F%B: error adding symbols: %E\n"), member
);
2874 entry
->flags
.loaded
= loaded
;
2880 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2881 entry
->flags
.loaded
= TRUE
;
2883 einfo (_("%F%B: error adding symbols: %E\n"), entry
->the_bfd
);
2885 return entry
->flags
.loaded
;
2888 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2889 may be NULL, indicating that it is a wildcard. Separate
2890 lang_input_section statements are created for each part of the
2891 expansion; they are added after the wild statement S. OUTPUT is
2892 the output section. */
2895 wild (lang_wild_statement_type
*s
,
2896 const char *target ATTRIBUTE_UNUSED
,
2897 lang_output_section_statement_type
*output
)
2899 struct wildcard_list
*sec
;
2901 if (s
->handler_data
[0]
2902 && s
->handler_data
[0]->spec
.sorted
== by_name
2903 && !s
->filenames_sorted
)
2905 lang_section_bst_type
*tree
;
2907 walk_wild (s
, output_section_callback_fast
, output
);
2912 output_section_callback_tree_to_list (s
, tree
, output
);
2917 walk_wild (s
, output_section_callback
, output
);
2919 if (default_common_section
== NULL
)
2920 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2921 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2923 /* Remember the section that common is going to in case we
2924 later get something which doesn't know where to put it. */
2925 default_common_section
= output
;
2930 /* Return TRUE iff target is the sought target. */
2933 get_target (const bfd_target
*target
, void *data
)
2935 const char *sought
= (const char *) data
;
2937 return strcmp (target
->name
, sought
) == 0;
2940 /* Like strcpy() but convert to lower case as well. */
2943 stricpy (char *dest
, char *src
)
2947 while ((c
= *src
++) != 0)
2948 *dest
++ = TOLOWER (c
);
2953 /* Remove the first occurrence of needle (if any) in haystack
2957 strcut (char *haystack
, char *needle
)
2959 haystack
= strstr (haystack
, needle
);
2965 for (src
= haystack
+ strlen (needle
); *src
;)
2966 *haystack
++ = *src
++;
2972 /* Compare two target format name strings.
2973 Return a value indicating how "similar" they are. */
2976 name_compare (char *first
, char *second
)
2982 copy1
= (char *) xmalloc (strlen (first
) + 1);
2983 copy2
= (char *) xmalloc (strlen (second
) + 1);
2985 /* Convert the names to lower case. */
2986 stricpy (copy1
, first
);
2987 stricpy (copy2
, second
);
2989 /* Remove size and endian strings from the name. */
2990 strcut (copy1
, "big");
2991 strcut (copy1
, "little");
2992 strcut (copy2
, "big");
2993 strcut (copy2
, "little");
2995 /* Return a value based on how many characters match,
2996 starting from the beginning. If both strings are
2997 the same then return 10 * their length. */
2998 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2999 if (copy1
[result
] == 0)
3011 /* Set by closest_target_match() below. */
3012 static const bfd_target
*winner
;
3014 /* Scan all the valid bfd targets looking for one that has the endianness
3015 requirement that was specified on the command line, and is the nearest
3016 match to the original output target. */
3019 closest_target_match (const bfd_target
*target
, void *data
)
3021 const bfd_target
*original
= (const bfd_target
*) data
;
3023 if (command_line
.endian
== ENDIAN_BIG
3024 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3027 if (command_line
.endian
== ENDIAN_LITTLE
3028 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3031 /* Must be the same flavour. */
3032 if (target
->flavour
!= original
->flavour
)
3035 /* Ignore generic big and little endian elf vectors. */
3036 if (strcmp (target
->name
, "elf32-big") == 0
3037 || strcmp (target
->name
, "elf64-big") == 0
3038 || strcmp (target
->name
, "elf32-little") == 0
3039 || strcmp (target
->name
, "elf64-little") == 0)
3042 /* If we have not found a potential winner yet, then record this one. */
3049 /* Oh dear, we now have two potential candidates for a successful match.
3050 Compare their names and choose the better one. */
3051 if (name_compare (target
->name
, original
->name
)
3052 > name_compare (winner
->name
, original
->name
))
3055 /* Keep on searching until wqe have checked them all. */
3059 /* Return the BFD target format of the first input file. */
3062 get_first_input_target (void)
3064 char *target
= NULL
;
3066 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3068 if (s
->header
.type
== lang_input_statement_enum
3071 ldfile_open_file (s
);
3073 if (s
->the_bfd
!= NULL
3074 && bfd_check_format (s
->the_bfd
, bfd_object
))
3076 target
= bfd_get_target (s
->the_bfd
);
3088 lang_get_output_target (void)
3092 /* Has the user told us which output format to use? */
3093 if (output_target
!= NULL
)
3094 return output_target
;
3096 /* No - has the current target been set to something other than
3098 if (current_target
!= default_target
&& current_target
!= NULL
)
3099 return current_target
;
3101 /* No - can we determine the format of the first input file? */
3102 target
= get_first_input_target ();
3106 /* Failed - use the default output target. */
3107 return default_target
;
3110 /* Open the output file. */
3113 open_output (const char *name
)
3115 output_target
= lang_get_output_target ();
3117 /* Has the user requested a particular endianness on the command
3119 if (command_line
.endian
!= ENDIAN_UNSET
)
3121 /* Get the chosen target. */
3122 const bfd_target
*target
3123 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3125 /* If the target is not supported, we cannot do anything. */
3128 enum bfd_endian desired_endian
;
3130 if (command_line
.endian
== ENDIAN_BIG
)
3131 desired_endian
= BFD_ENDIAN_BIG
;
3133 desired_endian
= BFD_ENDIAN_LITTLE
;
3135 /* See if the target has the wrong endianness. This should
3136 not happen if the linker script has provided big and
3137 little endian alternatives, but some scrips don't do
3139 if (target
->byteorder
!= desired_endian
)
3141 /* If it does, then see if the target provides
3142 an alternative with the correct endianness. */
3143 if (target
->alternative_target
!= NULL
3144 && (target
->alternative_target
->byteorder
== desired_endian
))
3145 output_target
= target
->alternative_target
->name
;
3148 /* Try to find a target as similar as possible to
3149 the default target, but which has the desired
3150 endian characteristic. */
3151 bfd_iterate_over_targets (closest_target_match
,
3154 /* Oh dear - we could not find any targets that
3155 satisfy our requirements. */
3157 einfo (_("%P: warning: could not find any targets"
3158 " that match endianness requirement\n"));
3160 output_target
= winner
->name
;
3166 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3168 if (link_info
.output_bfd
== NULL
)
3170 if (bfd_get_error () == bfd_error_invalid_target
)
3171 einfo (_("%P%F: target %s not found\n"), output_target
);
3173 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3176 delete_output_file_on_failure
= TRUE
;
3178 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3179 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3180 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3181 ldfile_output_architecture
,
3182 ldfile_output_machine
))
3183 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3185 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3186 if (link_info
.hash
== NULL
)
3187 einfo (_("%P%F: can not create hash table: %E\n"));
3189 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3193 ldlang_open_output (lang_statement_union_type
*statement
)
3195 switch (statement
->header
.type
)
3197 case lang_output_statement_enum
:
3198 ASSERT (link_info
.output_bfd
== NULL
);
3199 open_output (statement
->output_statement
.name
);
3200 ldemul_set_output_arch ();
3201 if (config
.magic_demand_paged
3202 && !bfd_link_relocatable (&link_info
))
3203 link_info
.output_bfd
->flags
|= D_PAGED
;
3205 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3206 if (config
.text_read_only
)
3207 link_info
.output_bfd
->flags
|= WP_TEXT
;
3209 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3210 if (link_info
.traditional_format
)
3211 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3213 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3216 case lang_target_statement_enum
:
3217 current_target
= statement
->target_statement
.target
;
3227 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3228 ldfile_output_machine
);
3231 while ((x
& 1) == 0)
3239 /* Open all the input files. */
3243 OPEN_BFD_NORMAL
= 0,
3247 #ifdef ENABLE_PLUGINS
3248 static lang_input_statement_type
*plugin_insert
= NULL
;
3252 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3254 for (; s
!= NULL
; s
= s
->header
.next
)
3256 switch (s
->header
.type
)
3258 case lang_constructors_statement_enum
:
3259 open_input_bfds (constructor_list
.head
, mode
);
3261 case lang_output_section_statement_enum
:
3262 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3264 case lang_wild_statement_enum
:
3265 /* Maybe we should load the file's symbols. */
3266 if ((mode
& OPEN_BFD_RESCAN
) == 0
3267 && s
->wild_statement
.filename
3268 && !wildcardp (s
->wild_statement
.filename
)
3269 && !archive_path (s
->wild_statement
.filename
))
3270 lookup_name (s
->wild_statement
.filename
);
3271 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3273 case lang_group_statement_enum
:
3275 struct bfd_link_hash_entry
*undefs
;
3277 /* We must continually search the entries in the group
3278 until no new symbols are added to the list of undefined
3283 undefs
= link_info
.hash
->undefs_tail
;
3284 open_input_bfds (s
->group_statement
.children
.head
,
3285 mode
| OPEN_BFD_FORCE
);
3287 while (undefs
!= link_info
.hash
->undefs_tail
);
3290 case lang_target_statement_enum
:
3291 current_target
= s
->target_statement
.target
;
3293 case lang_input_statement_enum
:
3294 if (s
->input_statement
.flags
.real
)
3296 lang_statement_union_type
**os_tail
;
3297 lang_statement_list_type add
;
3300 s
->input_statement
.target
= current_target
;
3302 /* If we are being called from within a group, and this
3303 is an archive which has already been searched, then
3304 force it to be researched unless the whole archive
3305 has been loaded already. Do the same for a rescan.
3306 Likewise reload --as-needed shared libs. */
3307 if (mode
!= OPEN_BFD_NORMAL
3308 #ifdef ENABLE_PLUGINS
3309 && ((mode
& OPEN_BFD_RESCAN
) == 0
3310 || plugin_insert
== NULL
)
3312 && s
->input_statement
.flags
.loaded
3313 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3314 && ((bfd_get_format (abfd
) == bfd_archive
3315 && !s
->input_statement
.flags
.whole_archive
)
3316 || (bfd_get_format (abfd
) == bfd_object
3317 && ((abfd
->flags
) & DYNAMIC
) != 0
3318 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3319 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3320 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3322 s
->input_statement
.flags
.loaded
= FALSE
;
3323 s
->input_statement
.flags
.reload
= TRUE
;
3326 os_tail
= lang_output_section_statement
.tail
;
3327 lang_list_init (&add
);
3329 if (!load_symbols (&s
->input_statement
, &add
))
3330 config
.make_executable
= FALSE
;
3332 if (add
.head
!= NULL
)
3334 /* If this was a script with output sections then
3335 tack any added statements on to the end of the
3336 list. This avoids having to reorder the output
3337 section statement list. Very likely the user
3338 forgot -T, and whatever we do here will not meet
3339 naive user expectations. */
3340 if (os_tail
!= lang_output_section_statement
.tail
)
3342 einfo (_("%P: warning: %s contains output sections;"
3343 " did you forget -T?\n"),
3344 s
->input_statement
.filename
);
3345 *stat_ptr
->tail
= add
.head
;
3346 stat_ptr
->tail
= add
.tail
;
3350 *add
.tail
= s
->header
.next
;
3351 s
->header
.next
= add
.head
;
3355 #ifdef ENABLE_PLUGINS
3356 /* If we have found the point at which a plugin added new
3357 files, clear plugin_insert to enable archive rescan. */
3358 if (&s
->input_statement
== plugin_insert
)
3359 plugin_insert
= NULL
;
3362 case lang_assignment_statement_enum
:
3363 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3364 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3371 /* Exit if any of the files were missing. */
3372 if (input_flags
.missing_file
)
3376 /* Add the supplied name to the symbol table as an undefined reference.
3377 This is a two step process as the symbol table doesn't even exist at
3378 the time the ld command line is processed. First we put the name
3379 on a list, then, once the output file has been opened, transfer the
3380 name to the symbol table. */
3382 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3384 #define ldlang_undef_chain_list_head entry_symbol.next
3387 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3389 ldlang_undef_chain_list_type
*new_undef
;
3391 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3392 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3393 new_undef
->next
= ldlang_undef_chain_list_head
;
3394 ldlang_undef_chain_list_head
= new_undef
;
3396 new_undef
->name
= xstrdup (name
);
3398 if (link_info
.output_bfd
!= NULL
)
3399 insert_undefined (new_undef
->name
);
3402 /* Insert NAME as undefined in the symbol table. */
3405 insert_undefined (const char *name
)
3407 struct bfd_link_hash_entry
*h
;
3409 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3411 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3412 if (h
->type
== bfd_link_hash_new
)
3414 h
->type
= bfd_link_hash_undefined
;
3415 h
->u
.undef
.abfd
= NULL
;
3416 if (is_elf_hash_table (link_info
.hash
))
3417 ((struct elf_link_hash_entry
*) h
)->mark
= 1;
3418 bfd_link_add_undef (link_info
.hash
, h
);
3422 /* Run through the list of undefineds created above and place them
3423 into the linker hash table as undefined symbols belonging to the
3427 lang_place_undefineds (void)
3429 ldlang_undef_chain_list_type
*ptr
;
3431 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3432 insert_undefined (ptr
->name
);
3435 /* Structure used to build the list of symbols that the user has required
3438 struct require_defined_symbol
3441 struct require_defined_symbol
*next
;
3444 /* The list of symbols that the user has required be defined. */
3446 static struct require_defined_symbol
*require_defined_symbol_list
;
3448 /* Add a new symbol NAME to the list of symbols that are required to be
3452 ldlang_add_require_defined (const char *const name
)
3454 struct require_defined_symbol
*ptr
;
3456 ldlang_add_undef (name
, TRUE
);
3457 ptr
= (struct require_defined_symbol
*) stat_alloc (sizeof (*ptr
));
3458 ptr
->next
= require_defined_symbol_list
;
3459 ptr
->name
= strdup (name
);
3460 require_defined_symbol_list
= ptr
;
3463 /* Check that all symbols the user required to be defined, are defined,
3464 raise an error if we find a symbol that is not defined. */
3467 ldlang_check_require_defined_symbols (void)
3469 struct require_defined_symbol
*ptr
;
3471 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
3473 struct bfd_link_hash_entry
*h
;
3475 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
3476 FALSE
, FALSE
, TRUE
);
3478 || (h
->type
!= bfd_link_hash_defined
3479 && h
->type
!= bfd_link_hash_defweak
))
3480 einfo(_("%P%X: required symbol `%s' not defined\n"), ptr
->name
);
3484 /* Check for all readonly or some readwrite sections. */
3487 check_input_sections
3488 (lang_statement_union_type
*s
,
3489 lang_output_section_statement_type
*output_section_statement
)
3491 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3493 switch (s
->header
.type
)
3495 case lang_wild_statement_enum
:
3496 walk_wild (&s
->wild_statement
, check_section_callback
,
3497 output_section_statement
);
3498 if (!output_section_statement
->all_input_readonly
)
3501 case lang_constructors_statement_enum
:
3502 check_input_sections (constructor_list
.head
,
3503 output_section_statement
);
3504 if (!output_section_statement
->all_input_readonly
)
3507 case lang_group_statement_enum
:
3508 check_input_sections (s
->group_statement
.children
.head
,
3509 output_section_statement
);
3510 if (!output_section_statement
->all_input_readonly
)
3519 /* Update wildcard statements if needed. */
3522 update_wild_statements (lang_statement_union_type
*s
)
3524 struct wildcard_list
*sec
;
3526 switch (sort_section
)
3536 for (; s
!= NULL
; s
= s
->header
.next
)
3538 switch (s
->header
.type
)
3543 case lang_wild_statement_enum
:
3544 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3547 switch (sec
->spec
.sorted
)
3550 sec
->spec
.sorted
= sort_section
;
3553 if (sort_section
== by_alignment
)
3554 sec
->spec
.sorted
= by_name_alignment
;
3557 if (sort_section
== by_name
)
3558 sec
->spec
.sorted
= by_alignment_name
;
3566 case lang_constructors_statement_enum
:
3567 update_wild_statements (constructor_list
.head
);
3570 case lang_output_section_statement_enum
:
3571 /* Don't sort .init/.fini sections. */
3572 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3573 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3574 update_wild_statements
3575 (s
->output_section_statement
.children
.head
);
3578 case lang_group_statement_enum
:
3579 update_wild_statements (s
->group_statement
.children
.head
);
3587 /* Open input files and attach to output sections. */
3590 map_input_to_output_sections
3591 (lang_statement_union_type
*s
, const char *target
,
3592 lang_output_section_statement_type
*os
)
3594 for (; s
!= NULL
; s
= s
->header
.next
)
3596 lang_output_section_statement_type
*tos
;
3599 switch (s
->header
.type
)
3601 case lang_wild_statement_enum
:
3602 wild (&s
->wild_statement
, target
, os
);
3604 case lang_constructors_statement_enum
:
3605 map_input_to_output_sections (constructor_list
.head
,
3609 case lang_output_section_statement_enum
:
3610 tos
= &s
->output_section_statement
;
3611 if (tos
->constraint
!= 0)
3613 if (tos
->constraint
!= ONLY_IF_RW
3614 && tos
->constraint
!= ONLY_IF_RO
)
3616 tos
->all_input_readonly
= TRUE
;
3617 check_input_sections (tos
->children
.head
, tos
);
3618 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3620 tos
->constraint
= -1;
3624 map_input_to_output_sections (tos
->children
.head
,
3628 case lang_output_statement_enum
:
3630 case lang_target_statement_enum
:
3631 target
= s
->target_statement
.target
;
3633 case lang_group_statement_enum
:
3634 map_input_to_output_sections (s
->group_statement
.children
.head
,
3638 case lang_data_statement_enum
:
3639 /* Make sure that any sections mentioned in the expression
3641 exp_init_os (s
->data_statement
.exp
);
3642 /* The output section gets CONTENTS, ALLOC and LOAD, but
3643 these may be overridden by the script. */
3644 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3645 switch (os
->sectype
)
3647 case normal_section
:
3648 case overlay_section
:
3650 case noalloc_section
:
3651 flags
= SEC_HAS_CONTENTS
;
3653 case noload_section
:
3654 if (bfd_get_flavour (link_info
.output_bfd
)
3655 == bfd_target_elf_flavour
)
3656 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3658 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3661 if (os
->bfd_section
== NULL
)
3662 init_os (os
, flags
);
3664 os
->bfd_section
->flags
|= flags
;
3666 case lang_input_section_enum
:
3668 case lang_fill_statement_enum
:
3669 case lang_object_symbols_statement_enum
:
3670 case lang_reloc_statement_enum
:
3671 case lang_padding_statement_enum
:
3672 case lang_input_statement_enum
:
3673 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3676 case lang_assignment_statement_enum
:
3677 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3680 /* Make sure that any sections mentioned in the assignment
3682 exp_init_os (s
->assignment_statement
.exp
);
3684 case lang_address_statement_enum
:
3685 /* Mark the specified section with the supplied address.
3686 If this section was actually a segment marker, then the
3687 directive is ignored if the linker script explicitly
3688 processed the segment marker. Originally, the linker
3689 treated segment directives (like -Ttext on the
3690 command-line) as section directives. We honor the
3691 section directive semantics for backwards compatibility;
3692 linker scripts that do not specifically check for
3693 SEGMENT_START automatically get the old semantics. */
3694 if (!s
->address_statement
.segment
3695 || !s
->address_statement
.segment
->used
)
3697 const char *name
= s
->address_statement
.section_name
;
3699 /* Create the output section statement here so that
3700 orphans with a set address will be placed after other
3701 script sections. If we let the orphan placement code
3702 place them in amongst other sections then the address
3703 will affect following script sections, which is
3704 likely to surprise naive users. */
3705 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3706 tos
->addr_tree
= s
->address_statement
.address
;
3707 if (tos
->bfd_section
== NULL
)
3711 case lang_insert_statement_enum
:
3717 /* An insert statement snips out all the linker statements from the
3718 start of the list and places them after the output section
3719 statement specified by the insert. This operation is complicated
3720 by the fact that we keep a doubly linked list of output section
3721 statements as well as the singly linked list of all statements. */
3724 process_insert_statements (void)
3726 lang_statement_union_type
**s
;
3727 lang_output_section_statement_type
*first_os
= NULL
;
3728 lang_output_section_statement_type
*last_os
= NULL
;
3729 lang_output_section_statement_type
*os
;
3731 /* "start of list" is actually the statement immediately after
3732 the special abs_section output statement, so that it isn't
3734 s
= &lang_output_section_statement
.head
;
3735 while (*(s
= &(*s
)->header
.next
) != NULL
)
3737 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3739 /* Keep pointers to the first and last output section
3740 statement in the sequence we may be about to move. */
3741 os
= &(*s
)->output_section_statement
;
3743 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3746 /* Set constraint negative so that lang_output_section_find
3747 won't match this output section statement. At this
3748 stage in linking constraint has values in the range
3749 [-1, ONLY_IN_RW]. */
3750 last_os
->constraint
= -2 - last_os
->constraint
;
3751 if (first_os
== NULL
)
3754 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3756 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3757 lang_output_section_statement_type
*where
;
3758 lang_statement_union_type
**ptr
;
3759 lang_statement_union_type
*first
;
3761 where
= lang_output_section_find (i
->where
);
3762 if (where
!= NULL
&& i
->is_before
)
3765 where
= where
->prev
;
3766 while (where
!= NULL
&& where
->constraint
< 0);
3770 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3774 /* Deal with reordering the output section statement list. */
3775 if (last_os
!= NULL
)
3777 asection
*first_sec
, *last_sec
;
3778 struct lang_output_section_statement_struct
**next
;
3780 /* Snip out the output sections we are moving. */
3781 first_os
->prev
->next
= last_os
->next
;
3782 if (last_os
->next
== NULL
)
3784 next
= &first_os
->prev
->next
;
3785 lang_output_section_statement
.tail
3786 = (lang_statement_union_type
**) next
;
3789 last_os
->next
->prev
= first_os
->prev
;
3790 /* Add them in at the new position. */
3791 last_os
->next
= where
->next
;
3792 if (where
->next
== NULL
)
3794 next
= &last_os
->next
;
3795 lang_output_section_statement
.tail
3796 = (lang_statement_union_type
**) next
;
3799 where
->next
->prev
= last_os
;
3800 first_os
->prev
= where
;
3801 where
->next
= first_os
;
3803 /* Move the bfd sections in the same way. */
3806 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3808 os
->constraint
= -2 - os
->constraint
;
3809 if (os
->bfd_section
!= NULL
3810 && os
->bfd_section
->owner
!= NULL
)
3812 last_sec
= os
->bfd_section
;
3813 if (first_sec
== NULL
)
3814 first_sec
= last_sec
;
3819 if (last_sec
!= NULL
)
3821 asection
*sec
= where
->bfd_section
;
3823 sec
= output_prev_sec_find (where
);
3825 /* The place we want to insert must come after the
3826 sections we are moving. So if we find no
3827 section or if the section is the same as our
3828 last section, then no move is needed. */
3829 if (sec
!= NULL
&& sec
!= last_sec
)
3831 /* Trim them off. */
3832 if (first_sec
->prev
!= NULL
)
3833 first_sec
->prev
->next
= last_sec
->next
;
3835 link_info
.output_bfd
->sections
= last_sec
->next
;
3836 if (last_sec
->next
!= NULL
)
3837 last_sec
->next
->prev
= first_sec
->prev
;
3839 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3841 last_sec
->next
= sec
->next
;
3842 if (sec
->next
!= NULL
)
3843 sec
->next
->prev
= last_sec
;
3845 link_info
.output_bfd
->section_last
= last_sec
;
3846 first_sec
->prev
= sec
;
3847 sec
->next
= first_sec
;
3855 ptr
= insert_os_after (where
);
3856 /* Snip everything after the abs_section output statement we
3857 know is at the start of the list, up to and including
3858 the insert statement we are currently processing. */
3859 first
= lang_output_section_statement
.head
->header
.next
;
3860 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3861 /* Add them back where they belong. */
3864 statement_list
.tail
= s
;
3866 s
= &lang_output_section_statement
.head
;
3870 /* Undo constraint twiddling. */
3871 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3873 os
->constraint
= -2 - os
->constraint
;
3879 /* An output section might have been removed after its statement was
3880 added. For example, ldemul_before_allocation can remove dynamic
3881 sections if they turn out to be not needed. Clean them up here. */
3884 strip_excluded_output_sections (void)
3886 lang_output_section_statement_type
*os
;
3888 /* Run lang_size_sections (if not already done). */
3889 if (expld
.phase
!= lang_mark_phase_enum
)
3891 expld
.phase
= lang_mark_phase_enum
;
3892 expld
.dataseg
.phase
= exp_seg_none
;
3893 one_lang_size_sections_pass (NULL
, FALSE
);
3894 lang_reset_memory_regions ();
3897 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3901 asection
*output_section
;
3902 bfd_boolean exclude
;
3904 if (os
->constraint
< 0)
3907 output_section
= os
->bfd_section
;
3908 if (output_section
== NULL
)
3911 exclude
= (output_section
->rawsize
== 0
3912 && (output_section
->flags
& SEC_KEEP
) == 0
3913 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3916 /* Some sections have not yet been sized, notably .gnu.version,
3917 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3918 input sections, so don't drop output sections that have such
3919 input sections unless they are also marked SEC_EXCLUDE. */
3920 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3924 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3925 if ((s
->flags
& SEC_EXCLUDE
) == 0
3926 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3927 || link_info
.emitrelocations
))
3936 /* We don't set bfd_section to NULL since bfd_section of the
3937 removed output section statement may still be used. */
3938 if (!os
->update_dot
)
3940 output_section
->flags
|= SEC_EXCLUDE
;
3941 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3942 link_info
.output_bfd
->section_count
--;
3947 /* Called from ldwrite to clear out asection.map_head and
3948 asection.map_tail for use as link_orders in ldwrite.
3949 FIXME: Except for sh64elf.em which starts creating link_orders in
3950 its after_allocation routine so needs to call it early. */
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 (" %T\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 %B\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 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4679 - output_section
->vma
);
4682 /* Work out how much this section will move the dot point. */
4686 (lang_statement_union_type
**this_ptr
,
4687 lang_output_section_statement_type
*output_section_statement
,
4691 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4692 asection
*i
= is
->section
;
4693 asection
*o
= output_section_statement
->bfd_section
;
4695 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4696 i
->output_offset
= i
->vma
- o
->vma
;
4697 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
4698 || output_section_statement
->ignored
)
4699 i
->output_offset
= dot
- o
->vma
;
4702 bfd_size_type alignment_needed
;
4704 /* Align this section first to the input sections requirement,
4705 then to the output section's requirement. If this alignment
4706 is greater than any seen before, then record it too. Perform
4707 the alignment by inserting a magic 'padding' statement. */
4709 if (output_section_statement
->subsection_alignment
!= -1)
4710 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4712 if (o
->alignment_power
< i
->alignment_power
)
4713 o
->alignment_power
= i
->alignment_power
;
4715 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4717 if (alignment_needed
!= 0)
4719 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4720 dot
+= alignment_needed
;
4723 /* Remember where in the output section this input section goes. */
4724 i
->output_offset
= dot
- o
->vma
;
4726 /* Mark how big the output section must be to contain this now. */
4727 dot
+= TO_ADDR (i
->size
);
4728 o
->size
= TO_SIZE (dot
- o
->vma
);
4741 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4743 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4744 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4746 if (sec1
->lma
< sec2
->lma
)
4748 else if (sec1
->lma
> sec2
->lma
)
4750 else if (sec1
->id
< sec2
->id
)
4752 else if (sec1
->id
> sec2
->id
)
4759 sort_sections_by_vma (const void *arg1
, const void *arg2
)
4761 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4762 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4764 if (sec1
->vma
< sec2
->vma
)
4766 else if (sec1
->vma
> sec2
->vma
)
4768 else if (sec1
->id
< sec2
->id
)
4770 else if (sec1
->id
> sec2
->id
)
4776 #define IS_TBSS(s) \
4777 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4779 #define IGNORE_SECTION(s) \
4780 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4782 /* Check to see if any allocated sections overlap with other allocated
4783 sections. This can happen if a linker script specifies the output
4784 section addresses of the two sections. Also check whether any memory
4785 region has overflowed. */
4788 lang_check_section_addresses (void)
4791 struct check_sec
*sections
;
4796 bfd_vma p_start
= 0;
4798 lang_memory_region_type
*m
;
4799 bfd_boolean overlays
;
4801 /* Detect address space overflow on allocated sections. */
4802 addr_mask
= ((bfd_vma
) 1 <<
4803 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
4804 addr_mask
= (addr_mask
<< 1) + 1;
4805 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4806 if ((s
->flags
& SEC_ALLOC
) != 0)
4808 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
4809 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
4810 einfo (_("%X%P: section %s VMA wraps around address space\n"),
4814 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
4815 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
4816 einfo (_("%X%P: section %s LMA wraps around address space\n"),
4821 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4824 count
= bfd_count_sections (link_info
.output_bfd
);
4825 sections
= XNEWVEC (struct check_sec
, count
);
4827 /* Scan all sections in the output list. */
4829 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4831 if (IGNORE_SECTION (s
)
4835 sections
[count
].sec
= s
;
4836 sections
[count
].warned
= FALSE
;
4846 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
4848 /* First check section LMAs. There should be no overlap of LMAs on
4849 loadable sections, even with overlays. */
4850 for (p
= NULL
, i
= 0; i
< count
; i
++)
4852 s
= sections
[i
].sec
;
4853 if ((s
->flags
& SEC_LOAD
) != 0)
4856 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4858 /* Look for an overlap. We have sorted sections by lma, so
4859 we know that s_start >= p_start. Besides the obvious
4860 case of overlap when the current section starts before
4861 the previous one ends, we also must have overlap if the
4862 previous section wraps around the address space. */
4864 && (s_start
<= p_end
4865 || p_end
< p_start
))
4867 einfo (_("%X%P: section %s LMA [%V,%V]"
4868 " overlaps section %s LMA [%V,%V]\n"),
4869 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4870 sections
[i
].warned
= TRUE
;
4878 /* If any non-zero size allocated section (excluding tbss) starts at
4879 exactly the same VMA as another such section, then we have
4880 overlays. Overlays generated by the OVERLAY keyword will have
4881 this property. It is possible to intentionally generate overlays
4882 that fail this test, but it would be unusual. */
4883 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
4885 p_start
= sections
[0].sec
->vma
;
4886 for (i
= 1; i
< count
; i
++)
4888 s_start
= sections
[i
].sec
->vma
;
4889 if (p_start
== s_start
)
4897 /* Now check section VMAs if no overlays were detected. */
4900 for (p
= NULL
, i
= 0; i
< count
; i
++)
4902 s
= sections
[i
].sec
;
4904 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4907 && !sections
[i
].warned
4908 && (s_start
<= p_end
4909 || p_end
< p_start
))
4910 einfo (_("%X%P: section %s VMA [%V,%V]"
4911 " overlaps section %s VMA [%V,%V]\n"),
4912 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4921 /* If any memory region has overflowed, report by how much.
4922 We do not issue this diagnostic for regions that had sections
4923 explicitly placed outside their bounds; os_region_check's
4924 diagnostics are adequate for that case.
4926 FIXME: It is conceivable that m->current - (m->origin + m->length)
4927 might overflow a 32-bit integer. There is, alas, no way to print
4928 a bfd_vma quantity in decimal. */
4929 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4930 if (m
->had_full_message
)
4932 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
4933 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
4934 "%X%P: region `%s' overflowed by %lu bytes\n",
4936 m
->name_list
.name
, over
);
4940 /* Make sure the new address is within the region. We explicitly permit the
4941 current address to be at the exact end of the region when the address is
4942 non-zero, in case the region is at the end of addressable memory and the
4943 calculation wraps around. */
4946 os_region_check (lang_output_section_statement_type
*os
,
4947 lang_memory_region_type
*region
,
4951 if ((region
->current
< region
->origin
4952 || (region
->current
- region
->origin
> region
->length
))
4953 && ((region
->current
!= region
->origin
+ region
->length
)
4958 einfo (_("%X%P: address 0x%v of %B section `%s'"
4959 " is not within region `%s'\n"),
4961 os
->bfd_section
->owner
,
4962 os
->bfd_section
->name
,
4963 region
->name_list
.name
);
4965 else if (!region
->had_full_message
)
4967 region
->had_full_message
= TRUE
;
4969 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4970 os
->bfd_section
->owner
,
4971 os
->bfd_section
->name
,
4972 region
->name_list
.name
);
4978 ldlang_check_relro_region (lang_statement_union_type
*s
,
4979 seg_align_type
*seg
)
4981 if (seg
->relro
== exp_seg_relro_start
)
4983 if (!seg
->relro_start_stat
)
4984 seg
->relro_start_stat
= s
;
4987 ASSERT (seg
->relro_start_stat
== s
);
4990 else if (seg
->relro
== exp_seg_relro_end
)
4992 if (!seg
->relro_end_stat
)
4993 seg
->relro_end_stat
= s
;
4996 ASSERT (seg
->relro_end_stat
== s
);
5001 /* Set the sizes for all the output sections. */
5004 lang_size_sections_1
5005 (lang_statement_union_type
**prev
,
5006 lang_output_section_statement_type
*output_section_statement
,
5010 bfd_boolean check_regions
)
5012 lang_statement_union_type
*s
;
5014 /* Size up the sections from their constituent parts. */
5015 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
5017 switch (s
->header
.type
)
5019 case lang_output_section_statement_enum
:
5021 bfd_vma newdot
, after
, dotdelta
;
5022 lang_output_section_statement_type
*os
;
5023 lang_memory_region_type
*r
;
5024 int section_alignment
= 0;
5026 os
= &s
->output_section_statement
;
5027 if (os
->constraint
== -1)
5030 /* FIXME: We shouldn't need to zero section vmas for ld -r
5031 here, in lang_insert_orphan, or in the default linker scripts.
5032 This is covering for coff backend linker bugs. See PR6945. */
5033 if (os
->addr_tree
== NULL
5034 && bfd_link_relocatable (&link_info
)
5035 && (bfd_get_flavour (link_info
.output_bfd
)
5036 == bfd_target_coff_flavour
))
5037 os
->addr_tree
= exp_intop (0);
5038 if (os
->addr_tree
!= NULL
)
5040 os
->processed_vma
= FALSE
;
5041 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5043 if (expld
.result
.valid_p
)
5045 dot
= expld
.result
.value
;
5046 if (expld
.result
.section
!= NULL
)
5047 dot
+= expld
.result
.section
->vma
;
5049 else if (expld
.phase
!= lang_mark_phase_enum
)
5050 einfo (_("%F%S: non constant or forward reference"
5051 " address expression for section %s\n"),
5052 os
->addr_tree
, os
->name
);
5055 if (os
->bfd_section
== NULL
)
5056 /* This section was removed or never actually created. */
5059 /* If this is a COFF shared library section, use the size and
5060 address from the input section. FIXME: This is COFF
5061 specific; it would be cleaner if there were some other way
5062 to do this, but nothing simple comes to mind. */
5063 if (((bfd_get_flavour (link_info
.output_bfd
)
5064 == bfd_target_ecoff_flavour
)
5065 || (bfd_get_flavour (link_info
.output_bfd
)
5066 == bfd_target_coff_flavour
))
5067 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5071 if (os
->children
.head
== NULL
5072 || os
->children
.head
->header
.next
!= NULL
5073 || (os
->children
.head
->header
.type
5074 != lang_input_section_enum
))
5075 einfo (_("%P%X: Internal error on COFF shared library"
5076 " section %s\n"), os
->name
);
5078 input
= os
->children
.head
->input_section
.section
;
5079 bfd_set_section_vma (os
->bfd_section
->owner
,
5081 bfd_section_vma (input
->owner
, input
));
5082 os
->bfd_section
->size
= input
->size
;
5088 if (bfd_is_abs_section (os
->bfd_section
))
5090 /* No matter what happens, an abs section starts at zero. */
5091 ASSERT (os
->bfd_section
->vma
== 0);
5095 if (os
->addr_tree
== NULL
)
5097 /* No address specified for this section, get one
5098 from the region specification. */
5099 if (os
->region
== NULL
5100 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5101 && os
->region
->name_list
.name
[0] == '*'
5102 && strcmp (os
->region
->name_list
.name
,
5103 DEFAULT_MEMORY_REGION
) == 0))
5105 os
->region
= lang_memory_default (os
->bfd_section
);
5108 /* If a loadable section is using the default memory
5109 region, and some non default memory regions were
5110 defined, issue an error message. */
5112 && !IGNORE_SECTION (os
->bfd_section
)
5113 && !bfd_link_relocatable (&link_info
)
5115 && strcmp (os
->region
->name_list
.name
,
5116 DEFAULT_MEMORY_REGION
) == 0
5117 && lang_memory_region_list
!= NULL
5118 && (strcmp (lang_memory_region_list
->name_list
.name
,
5119 DEFAULT_MEMORY_REGION
) != 0
5120 || lang_memory_region_list
->next
!= NULL
)
5121 && expld
.phase
!= lang_mark_phase_enum
)
5123 /* By default this is an error rather than just a
5124 warning because if we allocate the section to the
5125 default memory region we can end up creating an
5126 excessively large binary, or even seg faulting when
5127 attempting to perform a negative seek. See
5128 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5129 for an example of this. This behaviour can be
5130 overridden by the using the --no-check-sections
5132 if (command_line
.check_section_addresses
)
5133 einfo (_("%P%F: error: no memory region specified"
5134 " for loadable section `%s'\n"),
5135 bfd_get_section_name (link_info
.output_bfd
,
5138 einfo (_("%P: warning: no memory region specified"
5139 " for loadable section `%s'\n"),
5140 bfd_get_section_name (link_info
.output_bfd
,
5144 newdot
= os
->region
->current
;
5145 section_alignment
= os
->bfd_section
->alignment_power
;
5148 section_alignment
= os
->section_alignment
;
5150 /* Align to what the section needs. */
5151 if (section_alignment
> 0)
5153 bfd_vma savedot
= newdot
;
5154 newdot
= align_power (newdot
, section_alignment
);
5156 dotdelta
= newdot
- savedot
;
5158 && (config
.warn_section_align
5159 || os
->addr_tree
!= NULL
)
5160 && expld
.phase
!= lang_mark_phase_enum
)
5161 einfo (ngettext ("%P: warning: changing start of "
5162 "section %s by %lu byte\n",
5163 "%P: warning: changing start of "
5164 "section %s by %lu bytes\n",
5165 (unsigned long) dotdelta
),
5166 os
->name
, (unsigned long) dotdelta
);
5169 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
5171 os
->bfd_section
->output_offset
= 0;
5174 lang_size_sections_1 (&os
->children
.head
, os
,
5175 os
->fill
, newdot
, relax
, check_regions
);
5177 os
->processed_vma
= TRUE
;
5179 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5180 /* Except for some special linker created sections,
5181 no output section should change from zero size
5182 after strip_excluded_output_sections. A non-zero
5183 size on an ignored section indicates that some
5184 input section was not sized early enough. */
5185 ASSERT (os
->bfd_section
->size
== 0);
5188 dot
= os
->bfd_section
->vma
;
5190 /* Put the section within the requested block size, or
5191 align at the block boundary. */
5193 + TO_ADDR (os
->bfd_section
->size
)
5194 + os
->block_value
- 1)
5195 & - (bfd_vma
) os
->block_value
);
5197 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
5200 /* Set section lma. */
5203 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5207 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5208 os
->bfd_section
->lma
= lma
;
5210 else if (os
->lma_region
!= NULL
)
5212 bfd_vma lma
= os
->lma_region
->current
;
5214 if (os
->align_lma_with_input
)
5218 /* When LMA_REGION is the same as REGION, align the LMA
5219 as we did for the VMA, possibly including alignment
5220 from the bfd section. If a different region, then
5221 only align according to the value in the output
5223 if (os
->lma_region
!= os
->region
)
5224 section_alignment
= os
->section_alignment
;
5225 if (section_alignment
> 0)
5226 lma
= align_power (lma
, section_alignment
);
5228 os
->bfd_section
->lma
= lma
;
5230 else if (r
->last_os
!= NULL
5231 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5236 last
= r
->last_os
->output_section_statement
.bfd_section
;
5238 /* A backwards move of dot should be accompanied by
5239 an explicit assignment to the section LMA (ie.
5240 os->load_base set) because backwards moves can
5241 create overlapping LMAs. */
5243 && os
->bfd_section
->size
!= 0
5244 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5246 /* If dot moved backwards then leave lma equal to
5247 vma. This is the old default lma, which might
5248 just happen to work when the backwards move is
5249 sufficiently large. Nag if this changes anything,
5250 so people can fix their linker scripts. */
5252 if (last
->vma
!= last
->lma
)
5253 einfo (_("%P: warning: dot moved backwards "
5254 "before `%s'\n"), os
->name
);
5258 /* If this is an overlay, set the current lma to that
5259 at the end of the previous section. */
5260 if (os
->sectype
== overlay_section
)
5261 lma
= last
->lma
+ TO_ADDR (last
->size
);
5263 /* Otherwise, keep the same lma to vma relationship
5264 as the previous section. */
5266 lma
= dot
+ last
->lma
- last
->vma
;
5268 if (section_alignment
> 0)
5269 lma
= align_power (lma
, section_alignment
);
5270 os
->bfd_section
->lma
= lma
;
5273 os
->processed_lma
= TRUE
;
5275 /* Keep track of normal sections using the default
5276 lma region. We use this to set the lma for
5277 following sections. Overlays or other linker
5278 script assignment to lma might mean that the
5279 default lma == vma is incorrect.
5280 To avoid warnings about dot moving backwards when using
5281 -Ttext, don't start tracking sections until we find one
5282 of non-zero size or with lma set differently to vma.
5283 Do this tracking before we short-cut the loop so that we
5284 track changes for the case where the section size is zero,
5285 but the lma is set differently to the vma. This is
5286 important, if an orphan section is placed after an
5287 otherwise empty output section that has an explicit lma
5288 set, we want that lma reflected in the orphans lma. */
5289 if (!IGNORE_SECTION (os
->bfd_section
)
5290 && (os
->bfd_section
->size
!= 0
5291 || (r
->last_os
== NULL
5292 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5293 || (r
->last_os
!= NULL
5294 && dot
>= (r
->last_os
->output_section_statement
5295 .bfd_section
->vma
)))
5296 && os
->lma_region
== NULL
5297 && !bfd_link_relocatable (&link_info
))
5300 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5303 /* .tbss sections effectively have zero size. */
5304 if (!IS_TBSS (os
->bfd_section
)
5305 || bfd_link_relocatable (&link_info
))
5306 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5311 if (os
->update_dot_tree
!= 0)
5312 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5314 /* Update dot in the region ?
5315 We only do this if the section is going to be allocated,
5316 since unallocated sections do not contribute to the region's
5317 overall size in memory. */
5318 if (os
->region
!= NULL
5319 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5321 os
->region
->current
= dot
;
5324 /* Make sure the new address is within the region. */
5325 os_region_check (os
, os
->region
, os
->addr_tree
,
5326 os
->bfd_section
->vma
);
5328 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5329 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5330 || os
->align_lma_with_input
))
5332 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5335 os_region_check (os
, os
->lma_region
, NULL
,
5336 os
->bfd_section
->lma
);
5342 case lang_constructors_statement_enum
:
5343 dot
= lang_size_sections_1 (&constructor_list
.head
,
5344 output_section_statement
,
5345 fill
, dot
, relax
, check_regions
);
5348 case lang_data_statement_enum
:
5350 unsigned int size
= 0;
5352 s
->data_statement
.output_offset
=
5353 dot
- output_section_statement
->bfd_section
->vma
;
5354 s
->data_statement
.output_section
=
5355 output_section_statement
->bfd_section
;
5357 /* We might refer to provided symbols in the expression, and
5358 need to mark them as needed. */
5359 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5361 switch (s
->data_statement
.type
)
5379 if (size
< TO_SIZE ((unsigned) 1))
5380 size
= TO_SIZE ((unsigned) 1);
5381 dot
+= TO_ADDR (size
);
5382 output_section_statement
->bfd_section
->size
5383 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5388 case lang_reloc_statement_enum
:
5392 s
->reloc_statement
.output_offset
=
5393 dot
- output_section_statement
->bfd_section
->vma
;
5394 s
->reloc_statement
.output_section
=
5395 output_section_statement
->bfd_section
;
5396 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5397 dot
+= TO_ADDR (size
);
5398 output_section_statement
->bfd_section
->size
5399 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5403 case lang_wild_statement_enum
:
5404 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5405 output_section_statement
,
5406 fill
, dot
, relax
, check_regions
);
5409 case lang_object_symbols_statement_enum
:
5410 link_info
.create_object_symbols_section
=
5411 output_section_statement
->bfd_section
;
5414 case lang_output_statement_enum
:
5415 case lang_target_statement_enum
:
5418 case lang_input_section_enum
:
5422 i
= s
->input_section
.section
;
5427 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5428 einfo (_("%P%F: can't relax section: %E\n"));
5432 dot
= size_input_section (prev
, output_section_statement
,
5437 case lang_input_statement_enum
:
5440 case lang_fill_statement_enum
:
5441 s
->fill_statement
.output_section
=
5442 output_section_statement
->bfd_section
;
5444 fill
= s
->fill_statement
.fill
;
5447 case lang_assignment_statement_enum
:
5449 bfd_vma newdot
= dot
;
5450 etree_type
*tree
= s
->assignment_statement
.exp
;
5452 expld
.dataseg
.relro
= exp_seg_relro_none
;
5454 exp_fold_tree (tree
,
5455 output_section_statement
->bfd_section
,
5458 ldlang_check_relro_region (s
, &expld
.dataseg
);
5460 expld
.dataseg
.relro
= exp_seg_relro_none
;
5462 /* This symbol may be relative to this section. */
5463 if ((tree
->type
.node_class
== etree_provided
5464 || tree
->type
.node_class
== etree_assign
)
5465 && (tree
->assign
.dst
[0] != '.'
5466 || tree
->assign
.dst
[1] != '\0'))
5467 output_section_statement
->update_dot
= 1;
5469 if (!output_section_statement
->ignored
)
5471 if (output_section_statement
== abs_output_section
)
5473 /* If we don't have an output section, then just adjust
5474 the default memory address. */
5475 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5476 FALSE
)->current
= newdot
;
5478 else if (newdot
!= dot
)
5480 /* Insert a pad after this statement. We can't
5481 put the pad before when relaxing, in case the
5482 assignment references dot. */
5483 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5484 output_section_statement
->bfd_section
, dot
);
5486 /* Don't neuter the pad below when relaxing. */
5489 /* If dot is advanced, this implies that the section
5490 should have space allocated to it, unless the
5491 user has explicitly stated that the section
5492 should not be allocated. */
5493 if (output_section_statement
->sectype
!= noalloc_section
5494 && (output_section_statement
->sectype
!= noload_section
5495 || (bfd_get_flavour (link_info
.output_bfd
)
5496 == bfd_target_elf_flavour
)))
5497 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5504 case lang_padding_statement_enum
:
5505 /* If this is the first time lang_size_sections is called,
5506 we won't have any padding statements. If this is the
5507 second or later passes when relaxing, we should allow
5508 padding to shrink. If padding is needed on this pass, it
5509 will be added back in. */
5510 s
->padding_statement
.size
= 0;
5512 /* Make sure output_offset is valid. If relaxation shrinks
5513 the section and this pad isn't needed, it's possible to
5514 have output_offset larger than the final size of the
5515 section. bfd_set_section_contents will complain even for
5516 a pad size of zero. */
5517 s
->padding_statement
.output_offset
5518 = dot
- output_section_statement
->bfd_section
->vma
;
5521 case lang_group_statement_enum
:
5522 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5523 output_section_statement
,
5524 fill
, dot
, relax
, check_regions
);
5527 case lang_insert_statement_enum
:
5530 /* We can only get here when relaxing is turned on. */
5531 case lang_address_statement_enum
:
5538 prev
= &s
->header
.next
;
5543 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5544 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5545 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5546 segments. We are allowed an opportunity to override this decision. */
5549 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
5550 bfd
*abfd ATTRIBUTE_UNUSED
,
5551 asection
*current_section
,
5552 asection
*previous_section
,
5553 bfd_boolean new_segment
)
5555 lang_output_section_statement_type
*cur
;
5556 lang_output_section_statement_type
*prev
;
5558 /* The checks below are only necessary when the BFD library has decided
5559 that the two sections ought to be placed into the same segment. */
5563 /* Paranoia checks. */
5564 if (current_section
== NULL
|| previous_section
== NULL
)
5567 /* If this flag is set, the target never wants code and non-code
5568 sections comingled in the same segment. */
5569 if (config
.separate_code
5570 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5573 /* Find the memory regions associated with the two sections.
5574 We call lang_output_section_find() here rather than scanning the list
5575 of output sections looking for a matching section pointer because if
5576 we have a large number of sections then a hash lookup is faster. */
5577 cur
= lang_output_section_find (current_section
->name
);
5578 prev
= lang_output_section_find (previous_section
->name
);
5580 /* More paranoia. */
5581 if (cur
== NULL
|| prev
== NULL
)
5584 /* If the regions are different then force the sections to live in
5585 different segments. See the email thread starting at the following
5586 URL for the reasons why this is necessary:
5587 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5588 return cur
->region
!= prev
->region
;
5592 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5594 lang_statement_iteration
++;
5595 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5596 0, 0, relax
, check_regions
);
5600 lang_size_segment (seg_align_type
*seg
)
5602 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
5603 a page could be saved in the data segment. */
5604 bfd_vma first
, last
;
5606 first
= -seg
->base
& (seg
->pagesize
- 1);
5607 last
= seg
->end
& (seg
->pagesize
- 1);
5609 && ((seg
->base
& ~(seg
->pagesize
- 1))
5610 != (seg
->end
& ~(seg
->pagesize
- 1)))
5611 && first
+ last
<= seg
->pagesize
)
5613 seg
->phase
= exp_seg_adjust
;
5617 seg
->phase
= exp_seg_done
;
5622 lang_size_relro_segment_1 (seg_align_type
*seg
)
5624 bfd_vma relro_end
, desired_end
;
5627 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
5628 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
5629 & ~(seg
->pagesize
- 1));
5631 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
5632 desired_end
= relro_end
- seg
->relro_offset
;
5634 /* For sections in the relro segment.. */
5635 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
5636 if ((sec
->flags
& SEC_ALLOC
) != 0
5637 && sec
->vma
>= seg
->base
5638 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
5640 /* Where do we want to put this section so that it ends as
5642 bfd_vma start
, end
, bump
;
5644 end
= start
= sec
->vma
;
5646 end
+= TO_ADDR (sec
->size
);
5647 bump
= desired_end
- end
;
5648 /* We'd like to increase START by BUMP, but we must heed
5649 alignment so the increase might be less than optimum. */
5651 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
5652 /* This is now the desired end for the previous section. */
5653 desired_end
= start
;
5656 seg
->phase
= exp_seg_relro_adjust
;
5657 ASSERT (desired_end
>= seg
->base
);
5658 seg
->base
= desired_end
;
5663 lang_size_relro_segment (bfd_boolean
*relax
, bfd_boolean check_regions
)
5665 bfd_boolean do_reset
= FALSE
;
5666 bfd_boolean do_data_relro
;
5667 bfd_vma data_initial_base
, data_relro_end
;
5669 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5671 do_data_relro
= TRUE
;
5672 data_initial_base
= expld
.dataseg
.base
;
5673 data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
5677 do_data_relro
= FALSE
;
5678 data_initial_base
= data_relro_end
= 0;
5683 lang_reset_memory_regions ();
5684 one_lang_size_sections_pass (relax
, check_regions
);
5686 /* Assignments to dot, or to output section address in a user
5687 script have increased padding over the original. Revert. */
5688 if (do_data_relro
&& expld
.dataseg
.relro_end
> data_relro_end
)
5690 expld
.dataseg
.base
= data_initial_base
;;
5695 if (!do_data_relro
&& lang_size_segment (&expld
.dataseg
))
5702 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5704 expld
.phase
= lang_allocating_phase_enum
;
5705 expld
.dataseg
.phase
= exp_seg_none
;
5707 one_lang_size_sections_pass (relax
, check_regions
);
5709 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
5710 expld
.dataseg
.phase
= exp_seg_done
;
5712 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
5714 bfd_boolean do_reset
5715 = lang_size_relro_segment (relax
, check_regions
);
5719 lang_reset_memory_regions ();
5720 one_lang_size_sections_pass (relax
, check_regions
);
5723 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5725 link_info
.relro_start
= expld
.dataseg
.base
;
5726 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5731 static lang_output_section_statement_type
*current_section
;
5732 static lang_assignment_statement_type
*current_assign
;
5733 static bfd_boolean prefer_next_section
;
5735 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5738 lang_do_assignments_1 (lang_statement_union_type
*s
,
5739 lang_output_section_statement_type
*current_os
,
5742 bfd_boolean
*found_end
)
5744 for (; s
!= NULL
; s
= s
->header
.next
)
5746 switch (s
->header
.type
)
5748 case lang_constructors_statement_enum
:
5749 dot
= lang_do_assignments_1 (constructor_list
.head
,
5750 current_os
, fill
, dot
, found_end
);
5753 case lang_output_section_statement_enum
:
5755 lang_output_section_statement_type
*os
;
5758 os
= &(s
->output_section_statement
);
5759 os
->after_end
= *found_end
;
5760 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5762 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5764 current_section
= os
;
5765 prefer_next_section
= FALSE
;
5767 dot
= os
->bfd_section
->vma
;
5769 newdot
= lang_do_assignments_1 (os
->children
.head
,
5770 os
, os
->fill
, dot
, found_end
);
5773 if (os
->bfd_section
!= NULL
)
5775 /* .tbss sections effectively have zero size. */
5776 if (!IS_TBSS (os
->bfd_section
)
5777 || bfd_link_relocatable (&link_info
))
5778 dot
+= TO_ADDR (os
->bfd_section
->size
);
5780 if (os
->update_dot_tree
!= NULL
)
5781 exp_fold_tree (os
->update_dot_tree
,
5782 bfd_abs_section_ptr
, &dot
);
5790 case lang_wild_statement_enum
:
5792 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5793 current_os
, fill
, dot
, found_end
);
5796 case lang_object_symbols_statement_enum
:
5797 case lang_output_statement_enum
:
5798 case lang_target_statement_enum
:
5801 case lang_data_statement_enum
:
5802 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5803 if (expld
.result
.valid_p
)
5805 s
->data_statement
.value
= expld
.result
.value
;
5806 if (expld
.result
.section
!= NULL
)
5807 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5809 else if (expld
.phase
== lang_final_phase_enum
)
5810 einfo (_("%F%P: invalid data statement\n"));
5813 switch (s
->data_statement
.type
)
5831 if (size
< TO_SIZE ((unsigned) 1))
5832 size
= TO_SIZE ((unsigned) 1);
5833 dot
+= TO_ADDR (size
);
5837 case lang_reloc_statement_enum
:
5838 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5839 bfd_abs_section_ptr
, &dot
);
5840 if (expld
.result
.valid_p
)
5841 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5842 else if (expld
.phase
== lang_final_phase_enum
)
5843 einfo (_("%F%P: invalid reloc statement\n"));
5844 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5847 case lang_input_section_enum
:
5849 asection
*in
= s
->input_section
.section
;
5851 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5852 dot
+= TO_ADDR (in
->size
);
5856 case lang_input_statement_enum
:
5859 case lang_fill_statement_enum
:
5860 fill
= s
->fill_statement
.fill
;
5863 case lang_assignment_statement_enum
:
5864 current_assign
= &s
->assignment_statement
;
5865 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5867 const char *p
= current_assign
->exp
->assign
.dst
;
5869 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5870 prefer_next_section
= TRUE
;
5874 if (strcmp (p
, "end") == 0)
5877 exp_fold_tree (s
->assignment_statement
.exp
,
5878 (current_os
->bfd_section
!= NULL
5879 ? current_os
->bfd_section
: bfd_und_section_ptr
),
5883 case lang_padding_statement_enum
:
5884 dot
+= TO_ADDR (s
->padding_statement
.size
);
5887 case lang_group_statement_enum
:
5888 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5889 current_os
, fill
, dot
, found_end
);
5892 case lang_insert_statement_enum
:
5895 case lang_address_statement_enum
:
5907 lang_do_assignments (lang_phase_type phase
)
5909 bfd_boolean found_end
= FALSE
;
5911 current_section
= NULL
;
5912 prefer_next_section
= FALSE
;
5913 expld
.phase
= phase
;
5914 lang_statement_iteration
++;
5915 lang_do_assignments_1 (statement_list
.head
,
5916 abs_output_section
, NULL
, 0, &found_end
);
5919 /* For an assignment statement outside of an output section statement,
5920 choose the best of neighbouring output sections to use for values
5924 section_for_dot (void)
5928 /* Assignments belong to the previous output section, unless there
5929 has been an assignment to "dot", in which case following
5930 assignments belong to the next output section. (The assumption
5931 is that an assignment to "dot" is setting up the address for the
5932 next output section.) Except that past the assignment to "_end"
5933 we always associate with the previous section. This exception is
5934 for targets like SH that define an alloc .stack or other
5935 weirdness after non-alloc sections. */
5936 if (current_section
== NULL
|| prefer_next_section
)
5938 lang_statement_union_type
*stmt
;
5939 lang_output_section_statement_type
*os
;
5941 for (stmt
= (lang_statement_union_type
*) current_assign
;
5943 stmt
= stmt
->header
.next
)
5944 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5947 os
= &stmt
->output_section_statement
;
5950 && (os
->bfd_section
== NULL
5951 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5952 || bfd_section_removed_from_list (link_info
.output_bfd
,
5956 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5959 s
= os
->bfd_section
;
5961 s
= link_info
.output_bfd
->section_last
;
5963 && ((s
->flags
& SEC_ALLOC
) == 0
5964 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5969 return bfd_abs_section_ptr
;
5973 s
= current_section
->bfd_section
;
5975 /* The section may have been stripped. */
5977 && ((s
->flags
& SEC_EXCLUDE
) != 0
5978 || (s
->flags
& SEC_ALLOC
) == 0
5979 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5980 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5983 s
= link_info
.output_bfd
->sections
;
5985 && ((s
->flags
& SEC_ALLOC
) == 0
5986 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5991 return bfd_abs_section_ptr
;
5994 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
5996 static struct bfd_link_hash_entry
**start_stop_syms
;
5997 static size_t start_stop_count
= 0;
5998 static size_t start_stop_alloc
= 0;
6000 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6001 to start_stop_syms. */
6004 lang_define_start_stop (const char *symbol
, asection
*sec
)
6006 struct bfd_link_hash_entry
*h
;
6008 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6011 if (start_stop_count
== start_stop_alloc
)
6013 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6015 = xrealloc (start_stop_syms
,
6016 start_stop_alloc
* sizeof (*start_stop_syms
));
6018 start_stop_syms
[start_stop_count
++] = h
;
6022 /* Check for input sections whose names match references to
6023 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6024 preliminary definitions. */
6027 lang_init_start_stop (void)
6031 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6033 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6034 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6037 const char *secname
= s
->name
;
6039 for (ps
= secname
; *ps
!= '\0'; ps
++)
6040 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6044 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6046 symbol
[0] = leading_char
;
6047 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6048 lang_define_start_stop (symbol
, s
);
6050 symbol
[1] = leading_char
;
6051 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6052 lang_define_start_stop (symbol
+ 1, s
);
6059 /* Iterate over start_stop_syms. */
6062 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6066 for (i
= 0; i
< start_stop_count
; ++i
)
6067 func (start_stop_syms
[i
]);
6070 /* __start and __stop symbols are only supposed to be defined by the
6071 linker for orphan sections, but we now extend that to sections that
6072 map to an output section of the same name. The symbols were
6073 defined early for --gc-sections, before we mapped input to output
6074 sections, so undo those that don't satisfy this rule. */
6077 undef_start_stop (struct bfd_link_hash_entry
*h
)
6079 if (h
->ldscript_def
)
6082 if (h
->u
.def
.section
->output_section
== NULL
6083 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6084 || strcmp (h
->u
.def
.section
->name
,
6085 h
->u
.def
.section
->output_section
->name
) != 0)
6087 h
->type
= bfd_link_hash_undefined
;
6088 h
->u
.undef
.abfd
= NULL
;
6093 lang_undef_start_stop (void)
6095 foreach_start_stop (undef_start_stop
);
6098 /* Check for output sections whose names match references to
6099 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6100 preliminary definitions. */
6103 lang_init_startof_sizeof (void)
6107 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6109 const char *secname
= s
->name
;
6110 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6112 sprintf (symbol
, ".startof.%s", secname
);
6113 lang_define_start_stop (symbol
, s
);
6115 memcpy (symbol
+ 1, ".size", 5);
6116 lang_define_start_stop (symbol
+ 1, s
);
6121 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6124 set_start_stop (struct bfd_link_hash_entry
*h
)
6127 || h
->type
!= bfd_link_hash_defined
)
6130 if (h
->root
.string
[0] == '.')
6132 /* .startof. or .sizeof. symbol.
6133 .startof. already has final value. */
6134 if (h
->root
.string
[2] == 'i')
6137 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6138 h
->u
.def
.section
= bfd_abs_section_ptr
;
6143 /* __start or __stop symbol. */
6144 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6146 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6147 if (h
->root
.string
[4 + has_lead
] == 'o')
6150 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6156 lang_finalize_start_stop (void)
6158 foreach_start_stop (set_start_stop
);
6164 struct bfd_link_hash_entry
*h
;
6167 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
6168 || bfd_link_dll (&link_info
))
6169 warn
= entry_from_cmdline
;
6173 /* Force the user to specify a root when generating a relocatable with
6175 if (link_info
.gc_sections
&& bfd_link_relocatable (&link_info
)
6176 && !(entry_from_cmdline
|| undef_from_cmdline
))
6177 einfo (_("%P%F: gc-sections requires either an entry or "
6178 "an undefined symbol\n"));
6180 if (entry_symbol
.name
== NULL
)
6182 /* No entry has been specified. Look for the default entry, but
6183 don't warn if we don't find it. */
6184 entry_symbol
.name
= entry_symbol_default
;
6188 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
6189 FALSE
, FALSE
, TRUE
);
6191 && (h
->type
== bfd_link_hash_defined
6192 || h
->type
== bfd_link_hash_defweak
)
6193 && h
->u
.def
.section
->output_section
!= NULL
)
6197 val
= (h
->u
.def
.value
6198 + bfd_get_section_vma (link_info
.output_bfd
,
6199 h
->u
.def
.section
->output_section
)
6200 + h
->u
.def
.section
->output_offset
);
6201 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6202 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
6209 /* We couldn't find the entry symbol. Try parsing it as a
6211 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
6214 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6215 einfo (_("%P%F: can't set start address\n"));
6221 /* Can't find the entry symbol, and it's not a number. Use
6222 the first address in the text section. */
6223 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
6227 einfo (_("%P: warning: cannot find entry symbol %s;"
6228 " defaulting to %V\n"),
6230 bfd_get_section_vma (link_info
.output_bfd
, ts
));
6231 if (!(bfd_set_start_address
6232 (link_info
.output_bfd
,
6233 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
6234 einfo (_("%P%F: can't set start address\n"));
6239 einfo (_("%P: warning: cannot find entry symbol %s;"
6240 " not setting start address\n"),
6247 /* This is a small function used when we want to ignore errors from
6251 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
6252 va_list ap ATTRIBUTE_UNUSED
)
6254 /* Don't do anything. */
6257 /* Check that the architecture of all the input files is compatible
6258 with the output file. Also call the backend to let it do any
6259 other checking that is needed. */
6264 lang_statement_union_type
*file
;
6266 const bfd_arch_info_type
*compatible
;
6268 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
6270 #ifdef ENABLE_PLUGINS
6271 /* Don't check format of files claimed by plugin. */
6272 if (file
->input_statement
.flags
.claimed
)
6274 #endif /* ENABLE_PLUGINS */
6275 input_bfd
= file
->input_statement
.the_bfd
;
6277 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
6278 command_line
.accept_unknown_input_arch
);
6280 /* In general it is not possible to perform a relocatable
6281 link between differing object formats when the input
6282 file has relocations, because the relocations in the
6283 input format may not have equivalent representations in
6284 the output format (and besides BFD does not translate
6285 relocs for other link purposes than a final link). */
6286 if ((bfd_link_relocatable (&link_info
)
6287 || link_info
.emitrelocations
)
6288 && (compatible
== NULL
6289 || (bfd_get_flavour (input_bfd
)
6290 != bfd_get_flavour (link_info
.output_bfd
)))
6291 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
6293 einfo (_("%P%F: Relocatable linking with relocations from"
6294 " format %s (%B) to format %s (%B) is not supported\n"),
6295 bfd_get_target (input_bfd
), input_bfd
,
6296 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
6297 /* einfo with %F exits. */
6300 if (compatible
== NULL
)
6302 if (command_line
.warn_mismatch
)
6303 einfo (_("%P%X: %s architecture of input file `%B'"
6304 " is incompatible with %s output\n"),
6305 bfd_printable_name (input_bfd
), input_bfd
,
6306 bfd_printable_name (link_info
.output_bfd
));
6308 else if (bfd_count_sections (input_bfd
))
6310 /* If the input bfd has no contents, it shouldn't set the
6311 private data of the output bfd. */
6313 bfd_error_handler_type pfn
= NULL
;
6315 /* If we aren't supposed to warn about mismatched input
6316 files, temporarily set the BFD error handler to a
6317 function which will do nothing. We still want to call
6318 bfd_merge_private_bfd_data, since it may set up
6319 information which is needed in the output file. */
6320 if (!command_line
.warn_mismatch
)
6321 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
6322 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
6324 if (command_line
.warn_mismatch
)
6325 einfo (_("%P%X: failed to merge target specific data"
6326 " of file %B\n"), input_bfd
);
6328 if (!command_line
.warn_mismatch
)
6329 bfd_set_error_handler (pfn
);
6334 /* Look through all the global common symbols and attach them to the
6335 correct section. The -sort-common command line switch may be used
6336 to roughly sort the entries by alignment. */
6341 if (link_info
.inhibit_common_definition
)
6343 if (bfd_link_relocatable (&link_info
)
6344 && !command_line
.force_common_definition
)
6347 if (!config
.sort_common
)
6348 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
6353 if (config
.sort_common
== sort_descending
)
6355 for (power
= 4; power
> 0; power
--)
6356 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6359 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6363 for (power
= 0; power
<= 4; power
++)
6364 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6366 power
= (unsigned int) -1;
6367 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6372 /* Place one common symbol in the correct section. */
6375 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
6377 unsigned int power_of_two
;
6381 if (h
->type
!= bfd_link_hash_common
)
6385 power_of_two
= h
->u
.c
.p
->alignment_power
;
6387 if (config
.sort_common
== sort_descending
6388 && power_of_two
< *(unsigned int *) info
)
6390 else if (config
.sort_common
== sort_ascending
6391 && power_of_two
> *(unsigned int *) info
)
6394 section
= h
->u
.c
.p
->section
;
6395 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6396 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6399 if (config
.map_file
!= NULL
)
6401 static bfd_boolean header_printed
;
6406 if (!header_printed
)
6408 minfo (_("\nAllocating common symbols\n"));
6409 minfo (_("Common symbol size file\n\n"));
6410 header_printed
= TRUE
;
6413 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6414 DMGL_ANSI
| DMGL_PARAMS
);
6417 minfo ("%s", h
->root
.string
);
6418 len
= strlen (h
->root
.string
);
6423 len
= strlen (name
);
6439 if (size
<= 0xffffffff)
6440 sprintf (buf
, "%lx", (unsigned long) size
);
6442 sprintf_vma (buf
, size
);
6452 minfo ("%B\n", section
->owner
);
6458 /* Handle a single orphan section S, placing the orphan into an appropriate
6459 output section. The effects of the --orphan-handling command line
6460 option are handled here. */
6463 ldlang_place_orphan (asection
*s
)
6465 if (config
.orphan_handling
== orphan_handling_discard
)
6467 lang_output_section_statement_type
*os
;
6468 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0,
6470 if (os
->addr_tree
== NULL
6471 && (bfd_link_relocatable (&link_info
)
6472 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6473 os
->addr_tree
= exp_intop (0);
6474 lang_add_section (&os
->children
, s
, NULL
, os
);
6478 lang_output_section_statement_type
*os
;
6479 const char *name
= s
->name
;
6482 if (config
.orphan_handling
== orphan_handling_error
)
6483 einfo (_("%X%P: error: unplaced orphan section `%A' from `%B'.\n"),
6486 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
6487 constraint
= SPECIAL
;
6489 os
= ldemul_place_orphan (s
, name
, constraint
);
6492 os
= lang_output_section_statement_lookup (name
, constraint
, TRUE
);
6493 if (os
->addr_tree
== NULL
6494 && (bfd_link_relocatable (&link_info
)
6495 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6496 os
->addr_tree
= exp_intop (0);
6497 lang_add_section (&os
->children
, s
, NULL
, os
);
6500 if (config
.orphan_handling
== orphan_handling_warn
)
6501 einfo (_("%P: warning: orphan section `%A' from `%B' being "
6502 "placed in section `%s'.\n"),
6503 s
, s
->owner
, os
->name
);
6507 /* Run through the input files and ensure that every input section has
6508 somewhere to go. If one is found without a destination then create
6509 an input request and place it into the statement tree. */
6512 lang_place_orphans (void)
6514 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6518 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6520 if (s
->output_section
== NULL
)
6522 /* This section of the file is not attached, root
6523 around for a sensible place for it to go. */
6525 if (file
->flags
.just_syms
)
6526 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6527 else if (lang_discard_section_p (s
))
6528 s
->output_section
= bfd_abs_section_ptr
;
6529 else if (strcmp (s
->name
, "COMMON") == 0)
6531 /* This is a lonely common section which must have
6532 come from an archive. We attach to the section
6533 with the wildcard. */
6534 if (!bfd_link_relocatable (&link_info
)
6535 || command_line
.force_common_definition
)
6537 if (default_common_section
== NULL
)
6538 default_common_section
6539 = lang_output_section_statement_lookup (".bss", 0,
6541 lang_add_section (&default_common_section
->children
, s
,
6542 NULL
, default_common_section
);
6546 ldlang_place_orphan (s
);
6553 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6555 flagword
*ptr_flags
;
6557 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6563 /* PR 17900: An exclamation mark in the attributes reverses
6564 the sense of any of the attributes that follow. */
6567 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6571 *ptr_flags
|= SEC_ALLOC
;
6575 *ptr_flags
|= SEC_READONLY
;
6579 *ptr_flags
|= SEC_DATA
;
6583 *ptr_flags
|= SEC_CODE
;
6588 *ptr_flags
|= SEC_LOAD
;
6592 einfo (_("%P%F: invalid character %c (%d) in flags\n"),
6600 /* Call a function on each input file. This function will be called
6601 on an archive, but not on the elements. */
6604 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6606 lang_input_statement_type
*f
;
6608 for (f
= &input_file_chain
.head
->input_statement
;
6610 f
= &f
->next_real_file
->input_statement
)
6614 /* Call a function on each file. The function will be called on all
6615 the elements of an archive which are included in the link, but will
6616 not be called on the archive file itself. */
6619 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6621 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6628 ldlang_add_file (lang_input_statement_type
*entry
)
6630 lang_statement_append (&file_chain
,
6631 (lang_statement_union_type
*) entry
,
6634 /* The BFD linker needs to have a list of all input BFDs involved in
6636 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
6637 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6639 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6640 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
6641 entry
->the_bfd
->usrdata
= entry
;
6642 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6644 /* Look through the sections and check for any which should not be
6645 included in the link. We need to do this now, so that we can
6646 notice when the backend linker tries to report multiple
6647 definition errors for symbols which are in sections we aren't
6648 going to link. FIXME: It might be better to entirely ignore
6649 symbols which are defined in sections which are going to be
6650 discarded. This would require modifying the backend linker for
6651 each backend which might set the SEC_LINK_ONCE flag. If we do
6652 this, we should probably handle SEC_EXCLUDE in the same way. */
6654 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6658 lang_add_output (const char *name
, int from_script
)
6660 /* Make -o on command line override OUTPUT in script. */
6661 if (!had_output_filename
|| !from_script
)
6663 output_filename
= name
;
6664 had_output_filename
= TRUE
;
6677 for (l
= 0; l
< 32; l
++)
6679 if (i
>= (unsigned int) x
)
6687 lang_output_section_statement_type
*
6688 lang_enter_output_section_statement (const char *output_section_statement_name
,
6689 etree_type
*address_exp
,
6690 enum section_type sectype
,
6692 etree_type
*subalign
,
6695 int align_with_input
)
6697 lang_output_section_statement_type
*os
;
6699 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6701 current_section
= os
;
6703 if (os
->addr_tree
== NULL
)
6705 os
->addr_tree
= address_exp
;
6707 os
->sectype
= sectype
;
6708 if (sectype
!= noload_section
)
6709 os
->flags
= SEC_NO_FLAGS
;
6711 os
->flags
= SEC_NEVER_LOAD
;
6712 os
->block_value
= 1;
6714 /* Make next things chain into subchain of this. */
6715 push_stat_ptr (&os
->children
);
6717 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6718 if (os
->align_lma_with_input
&& align
!= NULL
)
6719 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"),
6722 os
->subsection_alignment
=
6723 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6724 os
->section_alignment
=
6725 topower (exp_get_value_int (align
, -1, "section alignment"));
6727 os
->load_base
= ebase
;
6734 lang_output_statement_type
*new_stmt
;
6736 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6737 new_stmt
->name
= output_filename
;
6740 /* Reset the current counters in the regions. */
6743 lang_reset_memory_regions (void)
6745 lang_memory_region_type
*p
= lang_memory_region_list
;
6747 lang_output_section_statement_type
*os
;
6749 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6751 p
->current
= p
->origin
;
6755 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6759 os
->processed_vma
= FALSE
;
6760 os
->processed_lma
= FALSE
;
6763 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6765 /* Save the last size for possible use by bfd_relax_section. */
6766 o
->rawsize
= o
->size
;
6771 /* Worker for lang_gc_sections_1. */
6774 gc_section_callback (lang_wild_statement_type
*ptr
,
6775 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6777 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6778 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6779 void *data ATTRIBUTE_UNUSED
)
6781 /* If the wild pattern was marked KEEP, the member sections
6782 should be as well. */
6783 if (ptr
->keep_sections
)
6784 section
->flags
|= SEC_KEEP
;
6787 /* Iterate over sections marking them against GC. */
6790 lang_gc_sections_1 (lang_statement_union_type
*s
)
6792 for (; s
!= NULL
; s
= s
->header
.next
)
6794 switch (s
->header
.type
)
6796 case lang_wild_statement_enum
:
6797 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6799 case lang_constructors_statement_enum
:
6800 lang_gc_sections_1 (constructor_list
.head
);
6802 case lang_output_section_statement_enum
:
6803 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6805 case lang_group_statement_enum
:
6806 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6815 lang_gc_sections (void)
6817 /* Keep all sections so marked in the link script. */
6818 lang_gc_sections_1 (statement_list
.head
);
6820 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6821 the special case of debug info. (See bfd/stabs.c)
6822 Twiddle the flag here, to simplify later linker code. */
6823 if (bfd_link_relocatable (&link_info
))
6825 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6828 #ifdef ENABLE_PLUGINS
6829 if (f
->flags
.claimed
)
6832 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6833 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6834 sec
->flags
&= ~SEC_EXCLUDE
;
6838 if (link_info
.gc_sections
)
6839 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6842 /* Worker for lang_find_relro_sections_1. */
6845 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6846 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6848 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6849 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6852 /* Discarded, excluded and ignored sections effectively have zero
6854 if (section
->output_section
!= NULL
6855 && section
->output_section
->owner
== link_info
.output_bfd
6856 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6857 && !IGNORE_SECTION (section
)
6858 && section
->size
!= 0)
6860 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6861 *has_relro_section
= TRUE
;
6865 /* Iterate over sections for relro sections. */
6868 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6869 seg_align_type
*seg
,
6870 bfd_boolean
*has_relro_section
)
6872 if (*has_relro_section
)
6875 for (; s
!= NULL
; s
= s
->header
.next
)
6877 if (s
== seg
->relro_end_stat
)
6880 switch (s
->header
.type
)
6882 case lang_wild_statement_enum
:
6883 walk_wild (&s
->wild_statement
,
6884 find_relro_section_callback
,
6887 case lang_constructors_statement_enum
:
6888 lang_find_relro_sections_1 (constructor_list
.head
,
6889 seg
, has_relro_section
);
6891 case lang_output_section_statement_enum
:
6892 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6893 seg
, has_relro_section
);
6895 case lang_group_statement_enum
:
6896 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6897 seg
, has_relro_section
);
6906 lang_find_relro_sections (void)
6908 bfd_boolean has_relro_section
= FALSE
;
6910 /* Check all sections in the link script. */
6912 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6913 &expld
.dataseg
, &has_relro_section
);
6915 if (!has_relro_section
)
6916 link_info
.relro
= FALSE
;
6919 /* Relax all sections until bfd_relax_section gives up. */
6922 lang_relax_sections (bfd_boolean need_layout
)
6924 if (RELAXATION_ENABLED
)
6926 /* We may need more than one relaxation pass. */
6927 int i
= link_info
.relax_pass
;
6929 /* The backend can use it to determine the current pass. */
6930 link_info
.relax_pass
= 0;
6934 /* Keep relaxing until bfd_relax_section gives up. */
6935 bfd_boolean relax_again
;
6937 link_info
.relax_trip
= -1;
6940 link_info
.relax_trip
++;
6942 /* Note: pe-dll.c does something like this also. If you find
6943 you need to change this code, you probably need to change
6944 pe-dll.c also. DJ */
6946 /* Do all the assignments with our current guesses as to
6948 lang_do_assignments (lang_assigning_phase_enum
);
6950 /* We must do this after lang_do_assignments, because it uses
6952 lang_reset_memory_regions ();
6954 /* Perform another relax pass - this time we know where the
6955 globals are, so can make a better guess. */
6956 relax_again
= FALSE
;
6957 lang_size_sections (&relax_again
, FALSE
);
6959 while (relax_again
);
6961 link_info
.relax_pass
++;
6968 /* Final extra sizing to report errors. */
6969 lang_do_assignments (lang_assigning_phase_enum
);
6970 lang_reset_memory_regions ();
6971 lang_size_sections (NULL
, TRUE
);
6975 #ifdef ENABLE_PLUGINS
6976 /* Find the insert point for the plugin's replacement files. We
6977 place them after the first claimed real object file, or if the
6978 first claimed object is an archive member, after the last real
6979 object file immediately preceding the archive. In the event
6980 no objects have been claimed at all, we return the first dummy
6981 object file on the list as the insert point; that works, but
6982 the callee must be careful when relinking the file_chain as it
6983 is not actually on that chain, only the statement_list and the
6984 input_file list; in that case, the replacement files must be
6985 inserted at the head of the file_chain. */
6987 static lang_input_statement_type
*
6988 find_replacements_insert_point (void)
6990 lang_input_statement_type
*claim1
, *lastobject
;
6991 lastobject
= &input_file_chain
.head
->input_statement
;
6992 for (claim1
= &file_chain
.head
->input_statement
;
6994 claim1
= &claim1
->next
->input_statement
)
6996 if (claim1
->flags
.claimed
)
6997 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6998 /* Update lastobject if this is a real object file. */
6999 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
7000 lastobject
= claim1
;
7002 /* No files were claimed by the plugin. Choose the last object
7003 file found on the list (maybe the first, dummy entry) as the
7008 /* Find where to insert ADD, an archive element or shared library
7009 added during a rescan. */
7011 static lang_statement_union_type
**
7012 find_rescan_insertion (lang_input_statement_type
*add
)
7014 bfd
*add_bfd
= add
->the_bfd
;
7015 lang_input_statement_type
*f
;
7016 lang_input_statement_type
*last_loaded
= NULL
;
7017 lang_input_statement_type
*before
= NULL
;
7018 lang_statement_union_type
**iter
= NULL
;
7020 if (add_bfd
->my_archive
!= NULL
)
7021 add_bfd
= add_bfd
->my_archive
;
7023 /* First look through the input file chain, to find an object file
7024 before the one we've rescanned. Normal object files always
7025 appear on both the input file chain and the file chain, so this
7026 lets us get quickly to somewhere near the correct place on the
7027 file chain if it is full of archive elements. Archives don't
7028 appear on the file chain, but if an element has been extracted
7029 then their input_statement->next points at it. */
7030 for (f
= &input_file_chain
.head
->input_statement
;
7032 f
= &f
->next_real_file
->input_statement
)
7034 if (f
->the_bfd
== add_bfd
)
7036 before
= last_loaded
;
7037 if (f
->next
!= NULL
)
7038 return &f
->next
->input_statement
.next
;
7040 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7044 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7046 iter
= &(*iter
)->input_statement
.next
)
7047 if (!(*iter
)->input_statement
.flags
.claim_archive
7048 && (*iter
)->input_statement
.the_bfd
->my_archive
== NULL
)
7054 /* Insert SRCLIST into DESTLIST after given element by chaining
7055 on FIELD as the next-pointer. (Counterintuitively does not need
7056 a pointer to the actual after-node itself, just its chain field.) */
7059 lang_list_insert_after (lang_statement_list_type
*destlist
,
7060 lang_statement_list_type
*srclist
,
7061 lang_statement_union_type
**field
)
7063 *(srclist
->tail
) = *field
;
7064 *field
= srclist
->head
;
7065 if (destlist
->tail
== field
)
7066 destlist
->tail
= srclist
->tail
;
7069 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7070 was taken as a copy of it and leave them in ORIGLIST. */
7073 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7074 lang_statement_list_type
*origlist
)
7076 union lang_statement_union
**savetail
;
7077 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7078 ASSERT (origlist
->head
== destlist
->head
);
7079 savetail
= origlist
->tail
;
7080 origlist
->head
= *(savetail
);
7081 origlist
->tail
= destlist
->tail
;
7082 destlist
->tail
= savetail
;
7085 #endif /* ENABLE_PLUGINS */
7087 /* Add NAME to the list of garbage collection entry points. */
7090 lang_add_gc_name (const char *name
)
7092 struct bfd_sym_chain
*sym
;
7097 sym
= (struct bfd_sym_chain
*) stat_alloc (sizeof (*sym
));
7099 sym
->next
= link_info
.gc_sym_list
;
7101 link_info
.gc_sym_list
= sym
;
7104 /* Check relocations. */
7107 lang_check_relocs (void)
7109 if (link_info
.check_relocs_after_open_input
)
7113 for (abfd
= link_info
.input_bfds
;
7114 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7115 if (!bfd_link_check_relocs (abfd
, &link_info
))
7117 /* No object output, fail return. */
7118 config
.make_executable
= FALSE
;
7119 /* Note: we do not abort the loop, but rather
7120 continue the scan in case there are other
7121 bad relocations to report. */
7126 /* Look through all output sections looking for places where we can
7127 propagate forward the lma region. */
7130 lang_propagate_lma_regions (void)
7132 lang_output_section_statement_type
*os
;
7134 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7138 if (os
->prev
!= NULL
7139 && os
->lma_region
== NULL
7140 && os
->load_base
== NULL
7141 && os
->addr_tree
== NULL
7142 && os
->region
== os
->prev
->region
)
7143 os
->lma_region
= os
->prev
->lma_region
;
7150 /* Finalize dynamic list. */
7151 if (link_info
.dynamic_list
)
7152 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
7154 current_target
= default_target
;
7156 /* Open the output file. */
7157 lang_for_each_statement (ldlang_open_output
);
7160 ldemul_create_output_section_statements ();
7162 /* Add to the hash table all undefineds on the command line. */
7163 lang_place_undefineds ();
7165 if (!bfd_section_already_linked_table_init ())
7166 einfo (_("%P%F: Failed to create hash table\n"));
7168 /* Create a bfd for each input file. */
7169 current_target
= default_target
;
7170 lang_statement_iteration
++;
7171 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
7173 #ifdef ENABLE_PLUGINS
7174 if (link_info
.lto_plugin_active
)
7176 lang_statement_list_type added
;
7177 lang_statement_list_type files
, inputfiles
;
7179 /* Now all files are read, let the plugin(s) decide if there
7180 are any more to be added to the link before we call the
7181 emulation's after_open hook. We create a private list of
7182 input statements for this purpose, which we will eventually
7183 insert into the global statement list after the first claimed
7186 /* We need to manipulate all three chains in synchrony. */
7188 inputfiles
= input_file_chain
;
7189 if (plugin_call_all_symbols_read ())
7190 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
7191 plugin_error_plugin ());
7192 /* Open any newly added files, updating the file chains. */
7193 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
7194 /* Restore the global list pointer now they have all been added. */
7195 lang_list_remove_tail (stat_ptr
, &added
);
7196 /* And detach the fresh ends of the file lists. */
7197 lang_list_remove_tail (&file_chain
, &files
);
7198 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
7199 /* Were any new files added? */
7200 if (added
.head
!= NULL
)
7202 /* If so, we will insert them into the statement list immediately
7203 after the first input file that was claimed by the plugin. */
7204 plugin_insert
= find_replacements_insert_point ();
7205 /* If a plugin adds input files without having claimed any, we
7206 don't really have a good idea where to place them. Just putting
7207 them at the start or end of the list is liable to leave them
7208 outside the crtbegin...crtend range. */
7209 ASSERT (plugin_insert
!= NULL
);
7210 /* Splice the new statement list into the old one. */
7211 lang_list_insert_after (stat_ptr
, &added
,
7212 &plugin_insert
->header
.next
);
7213 /* Likewise for the file chains. */
7214 lang_list_insert_after (&input_file_chain
, &inputfiles
,
7215 &plugin_insert
->next_real_file
);
7216 /* We must be careful when relinking file_chain; we may need to
7217 insert the new files at the head of the list if the insert
7218 point chosen is the dummy first input file. */
7219 if (plugin_insert
->filename
)
7220 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
7222 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
7224 /* Rescan archives in case new undefined symbols have appeared. */
7226 lang_statement_iteration
++;
7227 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
7228 lang_list_remove_tail (&file_chain
, &files
);
7229 while (files
.head
!= NULL
)
7231 lang_statement_union_type
**insert
;
7232 lang_statement_union_type
**iter
, *temp
;
7235 insert
= find_rescan_insertion (&files
.head
->input_statement
);
7236 /* All elements from an archive can be added at once. */
7237 iter
= &files
.head
->input_statement
.next
;
7238 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
7239 if (my_arch
!= NULL
)
7240 for (; *iter
!= NULL
; iter
= &(*iter
)->input_statement
.next
)
7241 if ((*iter
)->input_statement
.the_bfd
->my_archive
!= my_arch
)
7244 *insert
= files
.head
;
7247 if (my_arch
!= NULL
)
7249 lang_input_statement_type
*parent
= my_arch
->usrdata
;
7251 parent
->next
= (lang_statement_union_type
*)
7253 - offsetof (lang_input_statement_type
, next
));
7258 #endif /* ENABLE_PLUGINS */
7260 /* Make sure that nobody has tried to add a symbol to this list
7262 ASSERT (link_info
.gc_sym_list
== NULL
);
7264 link_info
.gc_sym_list
= &entry_symbol
;
7266 if (entry_symbol
.name
== NULL
)
7268 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
7270 /* entry_symbol is normally initialied by a ENTRY definition in the
7271 linker script or the -e command line option. But if neither of
7272 these have been used, the target specific backend may still have
7273 provided an entry symbol via a call to lang_default_entry().
7274 Unfortunately this value will not be processed until lang_end()
7275 is called, long after this function has finished. So detect this
7276 case here and add the target's entry symbol to the list of starting
7277 points for garbage collection resolution. */
7278 lang_add_gc_name (entry_symbol_default
);
7281 lang_add_gc_name (link_info
.init_function
);
7282 lang_add_gc_name (link_info
.fini_function
);
7284 ldemul_after_open ();
7285 if (config
.map_file
!= NULL
)
7286 lang_print_asneeded ();
7288 bfd_section_already_linked_table_free ();
7290 /* Make sure that we're not mixing architectures. We call this
7291 after all the input files have been opened, but before we do any
7292 other processing, so that any operations merge_private_bfd_data
7293 does on the output file will be known during the rest of the
7297 /* Handle .exports instead of a version script if we're told to do so. */
7298 if (command_line
.version_exports_section
)
7299 lang_do_version_exports_section ();
7301 /* Build all sets based on the information gathered from the input
7303 ldctor_build_sets ();
7305 /* Give initial values for __start and __stop symbols, so that ELF
7306 gc_sections will keep sections referenced by these symbols. Must
7307 be done before lang_do_assignments below. */
7308 if (config
.build_constructors
)
7309 lang_init_start_stop ();
7311 /* PR 13683: We must rerun the assignments prior to running garbage
7312 collection in order to make sure that all symbol aliases are resolved. */
7313 lang_do_assignments (lang_mark_phase_enum
);
7315 lang_do_memory_regions();
7316 expld
.phase
= lang_first_phase_enum
;
7318 /* Size up the common data. */
7321 /* Remove unreferenced sections if asked to. */
7322 lang_gc_sections ();
7324 /* Check relocations. */
7325 lang_check_relocs ();
7327 ldemul_after_check_relocs ();
7329 /* Update wild statements. */
7330 update_wild_statements (statement_list
.head
);
7332 /* Run through the contours of the script and attach input sections
7333 to the correct output sections. */
7334 lang_statement_iteration
++;
7335 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
7337 process_insert_statements ();
7339 /* Find any sections not attached explicitly and handle them. */
7340 lang_place_orphans ();
7342 if (!bfd_link_relocatable (&link_info
))
7346 /* Merge SEC_MERGE sections. This has to be done after GC of
7347 sections, so that GCed sections are not merged, but before
7348 assigning dynamic symbols, since removing whole input sections
7350 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
7352 /* Look for a text section and set the readonly attribute in it. */
7353 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
7357 if (config
.text_read_only
)
7358 found
->flags
|= SEC_READONLY
;
7360 found
->flags
&= ~SEC_READONLY
;
7364 /* Copy forward lma regions for output sections in same lma region. */
7365 lang_propagate_lma_regions ();
7367 /* Defining __start/__stop symbols early for --gc-sections to work
7368 around a glibc build problem can result in these symbols being
7369 defined when they should not be. Fix them now. */
7370 if (config
.build_constructors
)
7371 lang_undef_start_stop ();
7373 /* Define .startof./.sizeof. symbols with preliminary values before
7374 dynamic symbols are created. */
7375 if (!bfd_link_relocatable (&link_info
))
7376 lang_init_startof_sizeof ();
7378 /* Do anything special before sizing sections. This is where ELF
7379 and other back-ends size dynamic sections. */
7380 ldemul_before_allocation ();
7382 /* We must record the program headers before we try to fix the
7383 section positions, since they will affect SIZEOF_HEADERS. */
7384 lang_record_phdrs ();
7386 /* Check relro sections. */
7387 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
7388 lang_find_relro_sections ();
7390 /* Size up the sections. */
7391 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
7393 /* See if anything special should be done now we know how big
7394 everything is. This is where relaxation is done. */
7395 ldemul_after_allocation ();
7397 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
7398 lang_finalize_start_stop ();
7400 /* Do all the assignments, now that we know the final resting places
7401 of all the symbols. */
7402 lang_do_assignments (lang_final_phase_enum
);
7406 /* Convert absolute symbols to section relative. */
7407 ldexp_finalize_syms ();
7409 /* Make sure that the section addresses make sense. */
7410 if (command_line
.check_section_addresses
)
7411 lang_check_section_addresses ();
7413 /* Check any required symbols are known. */
7414 ldlang_check_require_defined_symbols ();
7419 /* EXPORTED TO YACC */
7422 lang_add_wild (struct wildcard_spec
*filespec
,
7423 struct wildcard_list
*section_list
,
7424 bfd_boolean keep_sections
)
7426 struct wildcard_list
*curr
, *next
;
7427 lang_wild_statement_type
*new_stmt
;
7429 /* Reverse the list as the parser puts it back to front. */
7430 for (curr
= section_list
, section_list
= NULL
;
7432 section_list
= curr
, curr
= next
)
7435 curr
->next
= section_list
;
7438 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
7440 if (strcmp (filespec
->name
, "*") == 0)
7441 filespec
->name
= NULL
;
7442 else if (!wildcardp (filespec
->name
))
7443 lang_has_input_file
= TRUE
;
7446 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
7447 new_stmt
->filename
= NULL
;
7448 new_stmt
->filenames_sorted
= FALSE
;
7449 new_stmt
->section_flag_list
= NULL
;
7450 new_stmt
->exclude_name_list
= NULL
;
7451 if (filespec
!= NULL
)
7453 new_stmt
->filename
= filespec
->name
;
7454 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
7455 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
7456 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
7458 new_stmt
->section_list
= section_list
;
7459 new_stmt
->keep_sections
= keep_sections
;
7460 lang_list_init (&new_stmt
->children
);
7461 analyze_walk_wild_section_handler (new_stmt
);
7465 lang_section_start (const char *name
, etree_type
*address
,
7466 const segment_type
*segment
)
7468 lang_address_statement_type
*ad
;
7470 ad
= new_stat (lang_address_statement
, stat_ptr
);
7471 ad
->section_name
= name
;
7472 ad
->address
= address
;
7473 ad
->segment
= segment
;
7476 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7477 because of a -e argument on the command line, or zero if this is
7478 called by ENTRY in a linker script. Command line arguments take
7482 lang_add_entry (const char *name
, bfd_boolean cmdline
)
7484 if (entry_symbol
.name
== NULL
7486 || !entry_from_cmdline
)
7488 entry_symbol
.name
= name
;
7489 entry_from_cmdline
= cmdline
;
7493 /* Set the default start symbol to NAME. .em files should use this,
7494 not lang_add_entry, to override the use of "start" if neither the
7495 linker script nor the command line specifies an entry point. NAME
7496 must be permanently allocated. */
7498 lang_default_entry (const char *name
)
7500 entry_symbol_default
= name
;
7504 lang_add_target (const char *name
)
7506 lang_target_statement_type
*new_stmt
;
7508 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
7509 new_stmt
->target
= name
;
7513 lang_add_map (const char *name
)
7520 map_option_f
= TRUE
;
7528 lang_add_fill (fill_type
*fill
)
7530 lang_fill_statement_type
*new_stmt
;
7532 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
7533 new_stmt
->fill
= fill
;
7537 lang_add_data (int type
, union etree_union
*exp
)
7539 lang_data_statement_type
*new_stmt
;
7541 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
7542 new_stmt
->exp
= exp
;
7543 new_stmt
->type
= type
;
7546 /* Create a new reloc statement. RELOC is the BFD relocation type to
7547 generate. HOWTO is the corresponding howto structure (we could
7548 look this up, but the caller has already done so). SECTION is the
7549 section to generate a reloc against, or NAME is the name of the
7550 symbol to generate a reloc against. Exactly one of SECTION and
7551 NAME must be NULL. ADDEND is an expression for the addend. */
7554 lang_add_reloc (bfd_reloc_code_real_type reloc
,
7555 reloc_howto_type
*howto
,
7558 union etree_union
*addend
)
7560 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
7564 p
->section
= section
;
7566 p
->addend_exp
= addend
;
7568 p
->addend_value
= 0;
7569 p
->output_section
= NULL
;
7570 p
->output_offset
= 0;
7573 lang_assignment_statement_type
*
7574 lang_add_assignment (etree_type
*exp
)
7576 lang_assignment_statement_type
*new_stmt
;
7578 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
7579 new_stmt
->exp
= exp
;
7584 lang_add_attribute (enum statement_enum attribute
)
7586 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
7590 lang_startup (const char *name
)
7592 if (first_file
->filename
!= NULL
)
7594 einfo (_("%P%F: multiple STARTUP files\n"));
7596 first_file
->filename
= name
;
7597 first_file
->local_sym_name
= name
;
7598 first_file
->flags
.real
= TRUE
;
7602 lang_float (bfd_boolean maybe
)
7604 lang_float_flag
= maybe
;
7608 /* Work out the load- and run-time regions from a script statement, and
7609 store them in *LMA_REGION and *REGION respectively.
7611 MEMSPEC is the name of the run-time region, or the value of
7612 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7613 LMA_MEMSPEC is the name of the load-time region, or null if the
7614 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7615 had an explicit load address.
7617 It is an error to specify both a load region and a load address. */
7620 lang_get_regions (lang_memory_region_type
**region
,
7621 lang_memory_region_type
**lma_region
,
7622 const char *memspec
,
7623 const char *lma_memspec
,
7624 bfd_boolean have_lma
,
7625 bfd_boolean have_vma
)
7627 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7629 /* If no runtime region or VMA has been specified, but the load region
7630 has been specified, then use the load region for the runtime region
7632 if (lma_memspec
!= NULL
7634 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7635 *region
= *lma_region
;
7637 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7639 if (have_lma
&& lma_memspec
!= 0)
7640 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7645 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7646 lang_output_section_phdr_list
*phdrs
,
7647 const char *lma_memspec
)
7649 lang_get_regions (¤t_section
->region
,
7650 ¤t_section
->lma_region
,
7651 memspec
, lma_memspec
,
7652 current_section
->load_base
!= NULL
,
7653 current_section
->addr_tree
!= NULL
);
7655 current_section
->fill
= fill
;
7656 current_section
->phdrs
= phdrs
;
7661 lang_statement_append (lang_statement_list_type
*list
,
7662 lang_statement_union_type
*element
,
7663 lang_statement_union_type
**field
)
7665 *(list
->tail
) = element
;
7669 /* Set the output format type. -oformat overrides scripts. */
7672 lang_add_output_format (const char *format
,
7677 if (output_target
== NULL
|| !from_script
)
7679 if (command_line
.endian
== ENDIAN_BIG
7682 else if (command_line
.endian
== ENDIAN_LITTLE
7686 output_target
= format
;
7691 lang_add_insert (const char *where
, int is_before
)
7693 lang_insert_statement_type
*new_stmt
;
7695 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7696 new_stmt
->where
= where
;
7697 new_stmt
->is_before
= is_before
;
7698 saved_script_handle
= previous_script_handle
;
7701 /* Enter a group. This creates a new lang_group_statement, and sets
7702 stat_ptr to build new statements within the group. */
7705 lang_enter_group (void)
7707 lang_group_statement_type
*g
;
7709 g
= new_stat (lang_group_statement
, stat_ptr
);
7710 lang_list_init (&g
->children
);
7711 push_stat_ptr (&g
->children
);
7714 /* Leave a group. This just resets stat_ptr to start writing to the
7715 regular list of statements again. Note that this will not work if
7716 groups can occur inside anything else which can adjust stat_ptr,
7717 but currently they can't. */
7720 lang_leave_group (void)
7725 /* Add a new program header. This is called for each entry in a PHDRS
7726 command in a linker script. */
7729 lang_new_phdr (const char *name
,
7731 bfd_boolean filehdr
,
7736 struct lang_phdr
*n
, **pp
;
7739 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7742 n
->type
= exp_get_value_int (type
, 0, "program header type");
7743 n
->filehdr
= filehdr
;
7748 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7750 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7753 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7755 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7756 " when prior PT_LOAD headers lack them\n"), NULL
);
7763 /* Record the program header information in the output BFD. FIXME: We
7764 should not be calling an ELF specific function here. */
7767 lang_record_phdrs (void)
7771 lang_output_section_phdr_list
*last
;
7772 struct lang_phdr
*l
;
7773 lang_output_section_statement_type
*os
;
7776 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7779 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7786 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7790 lang_output_section_phdr_list
*pl
;
7792 if (os
->constraint
< 0)
7800 if (os
->sectype
== noload_section
7801 || os
->bfd_section
== NULL
7802 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7805 /* Don't add orphans to PT_INTERP header. */
7811 lang_output_section_statement_type
*tmp_os
;
7813 /* If we have not run across a section with a program
7814 header assigned to it yet, then scan forwards to find
7815 one. This prevents inconsistencies in the linker's
7816 behaviour when a script has specified just a single
7817 header and there are sections in that script which are
7818 not assigned to it, and which occur before the first
7819 use of that header. See here for more details:
7820 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7821 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7824 last
= tmp_os
->phdrs
;
7828 einfo (_("%F%P: no sections assigned to phdrs\n"));
7833 if (os
->bfd_section
== NULL
)
7836 for (; pl
!= NULL
; pl
= pl
->next
)
7838 if (strcmp (pl
->name
, l
->name
) == 0)
7843 secs
= (asection
**) xrealloc (secs
,
7844 alc
* sizeof (asection
*));
7846 secs
[c
] = os
->bfd_section
;
7853 if (l
->flags
== NULL
)
7856 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7861 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7863 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7864 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7865 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7866 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7871 /* Make sure all the phdr assignments succeeded. */
7872 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7876 lang_output_section_phdr_list
*pl
;
7878 if (os
->constraint
< 0
7879 || os
->bfd_section
== NULL
)
7882 for (pl
= os
->phdrs
;
7885 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7886 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7887 os
->name
, pl
->name
);
7891 /* Record a list of sections which may not be cross referenced. */
7894 lang_add_nocrossref (lang_nocrossref_type
*l
)
7896 struct lang_nocrossrefs
*n
;
7898 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7899 n
->next
= nocrossref_list
;
7901 n
->onlyfirst
= FALSE
;
7902 nocrossref_list
= n
;
7904 /* Set notice_all so that we get informed about all symbols. */
7905 link_info
.notice_all
= TRUE
;
7908 /* Record a section that cannot be referenced from a list of sections. */
7911 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
7913 lang_add_nocrossref (l
);
7914 nocrossref_list
->onlyfirst
= TRUE
;
7917 /* Overlay handling. We handle overlays with some static variables. */
7919 /* The overlay virtual address. */
7920 static etree_type
*overlay_vma
;
7921 /* And subsection alignment. */
7922 static etree_type
*overlay_subalign
;
7924 /* An expression for the maximum section size seen so far. */
7925 static etree_type
*overlay_max
;
7927 /* A list of all the sections in this overlay. */
7929 struct overlay_list
{
7930 struct overlay_list
*next
;
7931 lang_output_section_statement_type
*os
;
7934 static struct overlay_list
*overlay_list
;
7936 /* Start handling an overlay. */
7939 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7941 /* The grammar should prevent nested overlays from occurring. */
7942 ASSERT (overlay_vma
== NULL
7943 && overlay_subalign
== NULL
7944 && overlay_max
== NULL
);
7946 overlay_vma
= vma_expr
;
7947 overlay_subalign
= subalign
;
7950 /* Start a section in an overlay. We handle this by calling
7951 lang_enter_output_section_statement with the correct VMA.
7952 lang_leave_overlay sets up the LMA and memory regions. */
7955 lang_enter_overlay_section (const char *name
)
7957 struct overlay_list
*n
;
7960 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7961 0, overlay_subalign
, 0, 0, 0);
7963 /* If this is the first section, then base the VMA of future
7964 sections on this one. This will work correctly even if `.' is
7965 used in the addresses. */
7966 if (overlay_list
== NULL
)
7967 overlay_vma
= exp_nameop (ADDR
, name
);
7969 /* Remember the section. */
7970 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7971 n
->os
= current_section
;
7972 n
->next
= overlay_list
;
7975 size
= exp_nameop (SIZEOF
, name
);
7977 /* Arrange to work out the maximum section end address. */
7978 if (overlay_max
== NULL
)
7981 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7984 /* Finish a section in an overlay. There isn't any special to do
7988 lang_leave_overlay_section (fill_type
*fill
,
7989 lang_output_section_phdr_list
*phdrs
)
7996 name
= current_section
->name
;
7998 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7999 region and that no load-time region has been specified. It doesn't
8000 really matter what we say here, since lang_leave_overlay will
8002 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
8004 /* Define the magic symbols. */
8006 clean
= (char *) xmalloc (strlen (name
) + 1);
8008 for (s1
= name
; *s1
!= '\0'; s1
++)
8009 if (ISALNUM (*s1
) || *s1
== '_')
8013 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8014 sprintf (buf
, "__load_start_%s", clean
);
8015 lang_add_assignment (exp_provide (buf
,
8016 exp_nameop (LOADADDR
, name
),
8019 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8020 sprintf (buf
, "__load_stop_%s", clean
);
8021 lang_add_assignment (exp_provide (buf
,
8023 exp_nameop (LOADADDR
, name
),
8024 exp_nameop (SIZEOF
, name
)),
8030 /* Finish an overlay. If there are any overlay wide settings, this
8031 looks through all the sections in the overlay and sets them. */
8034 lang_leave_overlay (etree_type
*lma_expr
,
8037 const char *memspec
,
8038 lang_output_section_phdr_list
*phdrs
,
8039 const char *lma_memspec
)
8041 lang_memory_region_type
*region
;
8042 lang_memory_region_type
*lma_region
;
8043 struct overlay_list
*l
;
8044 lang_nocrossref_type
*nocrossref
;
8046 lang_get_regions (®ion
, &lma_region
,
8047 memspec
, lma_memspec
,
8048 lma_expr
!= NULL
, FALSE
);
8052 /* After setting the size of the last section, set '.' to end of the
8054 if (overlay_list
!= NULL
)
8056 overlay_list
->os
->update_dot
= 1;
8057 overlay_list
->os
->update_dot_tree
8058 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
8064 struct overlay_list
*next
;
8066 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8069 l
->os
->region
= region
;
8070 l
->os
->lma_region
= lma_region
;
8072 /* The first section has the load address specified in the
8073 OVERLAY statement. The rest are worked out from that.
8074 The base address is not needed (and should be null) if
8075 an LMA region was specified. */
8078 l
->os
->load_base
= lma_expr
;
8079 l
->os
->sectype
= normal_section
;
8081 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
8082 l
->os
->phdrs
= phdrs
;
8086 lang_nocrossref_type
*nc
;
8088 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
8089 nc
->name
= l
->os
->name
;
8090 nc
->next
= nocrossref
;
8099 if (nocrossref
!= NULL
)
8100 lang_add_nocrossref (nocrossref
);
8103 overlay_list
= NULL
;
8105 overlay_subalign
= NULL
;
8108 /* Version handling. This is only useful for ELF. */
8110 /* If PREV is NULL, return first version pattern matching particular symbol.
8111 If PREV is non-NULL, return first version pattern matching particular
8112 symbol after PREV (previously returned by lang_vers_match). */
8114 static struct bfd_elf_version_expr
*
8115 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
8116 struct bfd_elf_version_expr
*prev
,
8120 const char *cxx_sym
= sym
;
8121 const char *java_sym
= sym
;
8122 struct bfd_elf_version_expr
*expr
= NULL
;
8123 enum demangling_styles curr_style
;
8125 curr_style
= CURRENT_DEMANGLING_STYLE
;
8126 cplus_demangle_set_style (no_demangling
);
8127 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
8130 cplus_demangle_set_style (curr_style
);
8132 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8134 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
8135 DMGL_PARAMS
| DMGL_ANSI
);
8139 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8141 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
8146 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
8148 struct bfd_elf_version_expr e
;
8150 switch (prev
? prev
->mask
: 0)
8153 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
8156 expr
= (struct bfd_elf_version_expr
*)
8157 htab_find ((htab_t
) head
->htab
, &e
);
8158 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
8159 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
8165 case BFD_ELF_VERSION_C_TYPE
:
8166 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8168 e
.pattern
= cxx_sym
;
8169 expr
= (struct bfd_elf_version_expr
*)
8170 htab_find ((htab_t
) head
->htab
, &e
);
8171 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
8172 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8178 case BFD_ELF_VERSION_CXX_TYPE
:
8179 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8181 e
.pattern
= java_sym
;
8182 expr
= (struct bfd_elf_version_expr
*)
8183 htab_find ((htab_t
) head
->htab
, &e
);
8184 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
8185 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8196 /* Finally, try the wildcards. */
8197 if (prev
== NULL
|| prev
->literal
)
8198 expr
= head
->remaining
;
8201 for (; expr
; expr
= expr
->next
)
8208 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
8211 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8213 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8217 if (fnmatch (expr
->pattern
, s
, 0) == 0)
8223 free ((char *) c_sym
);
8225 free ((char *) cxx_sym
);
8226 if (java_sym
!= sym
)
8227 free ((char *) java_sym
);
8231 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
8232 return a pointer to the symbol name with any backslash quotes removed. */
8235 realsymbol (const char *pattern
)
8238 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
8239 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
8241 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
8243 /* It is a glob pattern only if there is no preceding
8247 /* Remove the preceding backslash. */
8254 if (*p
== '?' || *p
== '*' || *p
== '[')
8261 backslash
= *p
== '\\';
8277 /* This is called for each variable name or match expression. NEW_NAME is
8278 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
8279 pattern to be matched against symbol names. */
8281 struct bfd_elf_version_expr
*
8282 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
8283 const char *new_name
,
8285 bfd_boolean literal_p
)
8287 struct bfd_elf_version_expr
*ret
;
8289 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
8293 ret
->literal
= TRUE
;
8294 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
8295 if (ret
->pattern
== NULL
)
8297 ret
->pattern
= new_name
;
8298 ret
->literal
= FALSE
;
8301 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
8302 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8303 else if (strcasecmp (lang
, "C++") == 0)
8304 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
8305 else if (strcasecmp (lang
, "Java") == 0)
8306 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
8309 einfo (_("%X%P: unknown language `%s' in version information\n"),
8311 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8314 return ldemul_new_vers_pattern (ret
);
8317 /* This is called for each set of variable names and match
8320 struct bfd_elf_version_tree
*
8321 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
8322 struct bfd_elf_version_expr
*locals
)
8324 struct bfd_elf_version_tree
*ret
;
8326 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
8327 ret
->globals
.list
= globals
;
8328 ret
->locals
.list
= locals
;
8329 ret
->match
= lang_vers_match
;
8330 ret
->name_indx
= (unsigned int) -1;
8334 /* This static variable keeps track of version indices. */
8336 static int version_index
;
8339 version_expr_head_hash (const void *p
)
8341 const struct bfd_elf_version_expr
*e
=
8342 (const struct bfd_elf_version_expr
*) p
;
8344 return htab_hash_string (e
->pattern
);
8348 version_expr_head_eq (const void *p1
, const void *p2
)
8350 const struct bfd_elf_version_expr
*e1
=
8351 (const struct bfd_elf_version_expr
*) p1
;
8352 const struct bfd_elf_version_expr
*e2
=
8353 (const struct bfd_elf_version_expr
*) p2
;
8355 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
8359 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
8362 struct bfd_elf_version_expr
*e
, *next
;
8363 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
8365 for (e
= head
->list
; e
; e
= e
->next
)
8369 head
->mask
|= e
->mask
;
8374 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
8375 version_expr_head_eq
, NULL
);
8376 list_loc
= &head
->list
;
8377 remaining_loc
= &head
->remaining
;
8378 for (e
= head
->list
; e
; e
= next
)
8384 remaining_loc
= &e
->next
;
8388 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
8392 struct bfd_elf_version_expr
*e1
, *last
;
8394 e1
= (struct bfd_elf_version_expr
*) *loc
;
8398 if (e1
->mask
== e
->mask
)
8406 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
8410 /* This is a duplicate. */
8411 /* FIXME: Memory leak. Sometimes pattern is not
8412 xmalloced alone, but in larger chunk of memory. */
8413 /* free (e->pattern); */
8418 e
->next
= last
->next
;
8426 list_loc
= &e
->next
;
8430 *remaining_loc
= NULL
;
8431 *list_loc
= head
->remaining
;
8434 head
->remaining
= head
->list
;
8437 /* This is called when we know the name and dependencies of the
8441 lang_register_vers_node (const char *name
,
8442 struct bfd_elf_version_tree
*version
,
8443 struct bfd_elf_version_deps
*deps
)
8445 struct bfd_elf_version_tree
*t
, **pp
;
8446 struct bfd_elf_version_expr
*e1
;
8451 if (link_info
.version_info
!= NULL
8452 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
8454 einfo (_("%X%P: anonymous version tag cannot be combined"
8455 " with other version tags\n"));
8460 /* Make sure this node has a unique name. */
8461 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8462 if (strcmp (t
->name
, name
) == 0)
8463 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
8465 lang_finalize_version_expr_head (&version
->globals
);
8466 lang_finalize_version_expr_head (&version
->locals
);
8468 /* Check the global and local match names, and make sure there
8469 aren't any duplicates. */
8471 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
8473 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8475 struct bfd_elf_version_expr
*e2
;
8477 if (t
->locals
.htab
&& e1
->literal
)
8479 e2
= (struct bfd_elf_version_expr
*)
8480 htab_find ((htab_t
) t
->locals
.htab
, e1
);
8481 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8483 if (e1
->mask
== e2
->mask
)
8484 einfo (_("%X%P: duplicate expression `%s'"
8485 " in version information\n"), e1
->pattern
);
8489 else if (!e1
->literal
)
8490 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8491 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8492 && e1
->mask
== e2
->mask
)
8493 einfo (_("%X%P: duplicate expression `%s'"
8494 " in version information\n"), e1
->pattern
);
8498 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
8500 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8502 struct bfd_elf_version_expr
*e2
;
8504 if (t
->globals
.htab
&& e1
->literal
)
8506 e2
= (struct bfd_elf_version_expr
*)
8507 htab_find ((htab_t
) t
->globals
.htab
, e1
);
8508 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8510 if (e1
->mask
== e2
->mask
)
8511 einfo (_("%X%P: duplicate expression `%s'"
8512 " in version information\n"),
8517 else if (!e1
->literal
)
8518 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8519 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8520 && e1
->mask
== e2
->mask
)
8521 einfo (_("%X%P: duplicate expression `%s'"
8522 " in version information\n"), e1
->pattern
);
8526 version
->deps
= deps
;
8527 version
->name
= name
;
8528 if (name
[0] != '\0')
8531 version
->vernum
= version_index
;
8534 version
->vernum
= 0;
8536 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8541 /* This is called when we see a version dependency. */
8543 struct bfd_elf_version_deps
*
8544 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
8546 struct bfd_elf_version_deps
*ret
;
8547 struct bfd_elf_version_tree
*t
;
8549 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
8552 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8554 if (strcmp (t
->name
, name
) == 0)
8556 ret
->version_needed
= t
;
8561 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
8563 ret
->version_needed
= NULL
;
8568 lang_do_version_exports_section (void)
8570 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
8572 LANG_FOR_EACH_INPUT_STATEMENT (is
)
8574 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
8582 contents
= (char *) xmalloc (len
);
8583 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
8584 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
8587 while (p
< contents
+ len
)
8589 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
8590 p
= strchr (p
, '\0') + 1;
8593 /* Do not free the contents, as we used them creating the regex. */
8595 /* Do not include this section in the link. */
8596 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
8599 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
8600 lang_register_vers_node (command_line
.version_exports_section
,
8601 lang_new_vers_node (greg
, lreg
), NULL
);
8604 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8607 lang_do_memory_regions (void)
8609 lang_memory_region_type
*r
= lang_memory_region_list
;
8611 for (; r
!= NULL
; r
= r
->next
)
8615 exp_fold_tree_no_dot (r
->origin_exp
);
8616 if (expld
.result
.valid_p
)
8618 r
->origin
= expld
.result
.value
;
8619 r
->current
= r
->origin
;
8622 einfo (_("%F%P: invalid origin for memory region %s\n"),
8627 exp_fold_tree_no_dot (r
->length_exp
);
8628 if (expld
.result
.valid_p
)
8629 r
->length
= expld
.result
.value
;
8631 einfo (_("%F%P: invalid length for memory region %s\n"),
8638 lang_add_unique (const char *name
)
8640 struct unique_sections
*ent
;
8642 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8643 if (strcmp (ent
->name
, name
) == 0)
8646 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8647 ent
->name
= xstrdup (name
);
8648 ent
->next
= unique_section_list
;
8649 unique_section_list
= ent
;
8652 /* Append the list of dynamic symbols to the existing one. */
8655 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8657 if (link_info
.dynamic_list
)
8659 struct bfd_elf_version_expr
*tail
;
8660 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8662 tail
->next
= link_info
.dynamic_list
->head
.list
;
8663 link_info
.dynamic_list
->head
.list
= dynamic
;
8667 struct bfd_elf_dynamic_list
*d
;
8669 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8670 d
->head
.list
= dynamic
;
8671 d
->match
= lang_vers_match
;
8672 link_info
.dynamic_list
= d
;
8676 /* Append the list of C++ typeinfo dynamic symbols to the existing
8680 lang_append_dynamic_list_cpp_typeinfo (void)
8682 const char *symbols
[] =
8684 "typeinfo name for*",
8687 struct bfd_elf_version_expr
*dynamic
= NULL
;
8690 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8691 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8694 lang_append_dynamic_list (dynamic
);
8697 /* Append the list of C++ operator new and delete dynamic symbols to the
8701 lang_append_dynamic_list_cpp_new (void)
8703 const char *symbols
[] =
8708 struct bfd_elf_version_expr
*dynamic
= NULL
;
8711 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8712 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8715 lang_append_dynamic_list (dynamic
);
8718 /* Scan a space and/or comma separated string of features. */
8721 lang_ld_feature (char *str
)
8729 while (*p
== ',' || ISSPACE (*p
))
8734 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8738 if (strcasecmp (p
, "SANE_EXPR") == 0)
8739 config
.sane_expr
= TRUE
;
8741 einfo (_("%X%P: unknown feature `%s'\n"), p
);
8747 /* Pretty print memory amount. */
8750 lang_print_memory_size (bfd_vma sz
)
8752 if ((sz
& 0x3fffffff) == 0)
8753 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
8754 else if ((sz
& 0xfffff) == 0)
8755 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
8756 else if ((sz
& 0x3ff) == 0)
8757 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
8759 printf (" %10" BFD_VMA_FMT
"u B", sz
);
8762 /* Implement --print-memory-usage: disply per region memory usage. */
8765 lang_print_memory_usage (void)
8767 lang_memory_region_type
*r
;
8769 printf ("Memory region Used Size Region Size %%age Used\n");
8770 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
8772 bfd_vma used_length
= r
->current
- r
->origin
;
8775 printf ("%16s: ",r
->name_list
.name
);
8776 lang_print_memory_size (used_length
);
8777 lang_print_memory_size ((bfd_vma
) r
->length
);
8779 percent
= used_length
* 100.0 / r
->length
;
8781 printf (" %6.2f%%\n", percent
);