1 /* Linker command language support.
2 Copyright (C) 1991-2018 Free Software Foundation, Inc.
4 This file is part of the GNU Binutils.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
23 #include "libiberty.h"
24 #include "filenames.h"
25 #include "safe-ctype.h"
45 #endif /* ENABLE_PLUGINS */
48 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
51 /* Convert between addresses in bytes and sizes in octets.
52 For currently supported targets, octets_per_byte is always a power
53 of two, so we can use shifts. */
54 #define TO_ADDR(X) ((X) >> opb_shift)
55 #define TO_SIZE(X) ((X) << opb_shift)
57 /* Local variables. */
58 static struct obstack stat_obstack
;
59 static struct obstack map_obstack
;
61 #define obstack_chunk_alloc xmalloc
62 #define obstack_chunk_free free
63 static const char *entry_symbol_default
= "start";
64 static bfd_boolean map_head_is_link_order
= FALSE
;
65 static lang_output_section_statement_type
*default_common_section
;
66 static bfd_boolean map_option_f
;
67 static bfd_vma print_dot
;
68 static lang_input_statement_type
*first_file
;
69 static const char *current_target
;
70 static lang_statement_list_type statement_list
;
71 static lang_statement_list_type
*stat_save
[10];
72 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
73 static struct unique_sections
*unique_section_list
;
74 static struct asneeded_minfo
*asneeded_list_head
;
75 static unsigned int opb_shift
= 0;
77 /* Forward declarations. */
78 static void exp_init_os (etree_type
*);
79 static lang_input_statement_type
*lookup_name (const char *);
80 static void insert_undefined (const char *);
81 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
82 static void print_statement (lang_statement_union_type
*,
83 lang_output_section_statement_type
*);
84 static void print_statement_list (lang_statement_union_type
*,
85 lang_output_section_statement_type
*);
86 static void print_statements (void);
87 static void print_input_section (asection
*, bfd_boolean
);
88 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
89 static void lang_record_phdrs (void);
90 static void lang_do_version_exports_section (void);
91 static void lang_finalize_version_expr_head
92 (struct bfd_elf_version_expr_head
*);
93 static void lang_do_memory_regions (void);
95 /* Exported variables. */
96 const char *output_target
;
97 lang_output_section_statement_type
*abs_output_section
;
98 lang_statement_list_type lang_output_section_statement
;
99 lang_statement_list_type
*stat_ptr
= &statement_list
;
100 lang_statement_list_type file_chain
= { NULL
, NULL
};
101 lang_statement_list_type input_file_chain
;
102 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
103 const char *entry_section
= ".text";
104 struct lang_input_statement_flags input_flags
;
105 bfd_boolean entry_from_cmdline
;
106 bfd_boolean undef_from_cmdline
;
107 bfd_boolean lang_has_input_file
= FALSE
;
108 bfd_boolean had_output_filename
= FALSE
;
109 bfd_boolean lang_float_flag
= FALSE
;
110 bfd_boolean delete_output_file_on_failure
= FALSE
;
111 struct lang_phdr
*lang_phdr_list
;
112 struct lang_nocrossrefs
*nocrossref_list
;
113 struct asneeded_minfo
**asneeded_list_tail
;
115 /* Functions that traverse the linker script and might evaluate
116 DEFINED() need to increment this at the start of the traversal. */
117 int lang_statement_iteration
= 0;
119 /* Return TRUE if the PATTERN argument is a wildcard pattern.
120 Although backslashes are treated specially if a pattern contains
121 wildcards, we do not consider the mere presence of a backslash to
122 be enough to cause the pattern to be treated as a wildcard.
123 That lets us handle DOS filenames more naturally. */
124 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
126 #define new_stat(x, y) \
127 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
129 #define outside_section_address(q) \
130 ((q)->output_offset + (q)->output_section->vma)
132 #define outside_symbol_address(q) \
133 ((q)->value + outside_section_address (q->section))
135 #define SECTION_NAME_MAP_LENGTH (16)
138 stat_alloc (size_t size
)
140 return obstack_alloc (&stat_obstack
, size
);
144 name_match (const char *pattern
, const char *name
)
146 if (wildcardp (pattern
))
147 return fnmatch (pattern
, name
, 0);
148 return strcmp (pattern
, name
);
151 /* If PATTERN is of the form archive:file, return a pointer to the
152 separator. If not, return NULL. */
155 archive_path (const char *pattern
)
159 if (link_info
.path_separator
== 0)
162 p
= strchr (pattern
, link_info
.path_separator
);
163 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
164 if (p
== NULL
|| link_info
.path_separator
!= ':')
167 /* Assume a match on the second char is part of drive specifier,
168 as in "c:\silly.dos". */
169 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
170 p
= strchr (p
+ 1, link_info
.path_separator
);
175 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
176 return whether F matches FILE_SPEC. */
179 input_statement_is_archive_path (const char *file_spec
, char *sep
,
180 lang_input_statement_type
*f
)
182 bfd_boolean match
= FALSE
;
185 || name_match (sep
+ 1, f
->filename
) == 0)
186 && ((sep
!= file_spec
)
187 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
191 if (sep
!= file_spec
)
193 const char *aname
= f
->the_bfd
->my_archive
->filename
;
195 match
= name_match (file_spec
, aname
) == 0;
196 *sep
= link_info
.path_separator
;
203 unique_section_p (const asection
*sec
,
204 const lang_output_section_statement_type
*os
)
206 struct unique_sections
*unam
;
209 if (!link_info
.resolve_section_groups
210 && sec
->owner
!= NULL
211 && bfd_is_group_section (sec
->owner
, sec
))
213 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
216 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
217 if (name_match (unam
->name
, secnam
) == 0)
223 /* Generic traversal routines for finding matching sections. */
225 /* Return true if FILE matches a pattern in EXCLUDE_LIST, otherwise return
229 walk_wild_file_in_exclude_list (struct name_list
*exclude_list
,
230 lang_input_statement_type
*file
)
232 struct name_list
*list_tmp
;
234 for (list_tmp
= exclude_list
;
236 list_tmp
= list_tmp
->next
)
238 char *p
= archive_path (list_tmp
->name
);
242 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
246 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
249 /* FIXME: Perhaps remove the following at some stage? Matching
250 unadorned archives like this was never documented and has
251 been superceded by the archive:path syntax. */
252 else if (file
->the_bfd
!= NULL
253 && file
->the_bfd
->my_archive
!= NULL
254 && name_match (list_tmp
->name
,
255 file
->the_bfd
->my_archive
->filename
) == 0)
262 /* Try processing a section against a wildcard. This just calls
263 the callback unless the filename exclusion list is present
264 and excludes the file. It's hardly ever present so this
265 function is very fast. */
268 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
269 lang_input_statement_type
*file
,
271 struct wildcard_list
*sec
,
275 /* Don't process sections from files which were excluded. */
276 if (walk_wild_file_in_exclude_list (sec
->spec
.exclude_name_list
, file
))
279 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
282 /* Lowest common denominator routine that can handle everything correctly,
286 walk_wild_section_general (lang_wild_statement_type
*ptr
,
287 lang_input_statement_type
*file
,
292 struct wildcard_list
*sec
;
294 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
296 sec
= ptr
->section_list
;
298 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
302 bfd_boolean skip
= FALSE
;
304 if (sec
->spec
.name
!= NULL
)
306 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
308 skip
= name_match (sec
->spec
.name
, sname
) != 0;
312 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
319 /* Routines to find a single section given its name. If there's more
320 than one section with that name, we report that. */
324 asection
*found_section
;
325 bfd_boolean multiple_sections_found
;
326 } section_iterator_callback_data
;
329 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
331 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
333 if (d
->found_section
!= NULL
)
335 d
->multiple_sections_found
= TRUE
;
339 d
->found_section
= s
;
344 find_section (lang_input_statement_type
*file
,
345 struct wildcard_list
*sec
,
346 bfd_boolean
*multiple_sections_found
)
348 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
350 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
351 section_iterator_callback
, &cb_data
);
352 *multiple_sections_found
= cb_data
.multiple_sections_found
;
353 return cb_data
.found_section
;
356 /* Code for handling simple wildcards without going through fnmatch,
357 which can be expensive because of charset translations etc. */
359 /* A simple wild is a literal string followed by a single '*',
360 where the literal part is at least 4 characters long. */
363 is_simple_wild (const char *name
)
365 size_t len
= strcspn (name
, "*?[");
366 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
370 match_simple_wild (const char *pattern
, const char *name
)
372 /* The first four characters of the pattern are guaranteed valid
373 non-wildcard characters. So we can go faster. */
374 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
375 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
380 while (*pattern
!= '*')
381 if (*name
++ != *pattern
++)
387 /* Return the numerical value of the init_priority attribute from
388 section name NAME. */
391 get_init_priority (const char *name
)
394 unsigned long init_priority
;
396 /* GCC uses the following section names for the init_priority
397 attribute with numerical values 101 and 65535 inclusive. A
398 lower value means a higher priority.
400 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
401 decimal numerical value of the init_priority attribute.
402 The order of execution in .init_array is forward and
403 .fini_array is backward.
404 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
405 decimal numerical value of the init_priority attribute.
406 The order of execution in .ctors is backward and .dtors
409 if (strncmp (name
, ".init_array.", 12) == 0
410 || strncmp (name
, ".fini_array.", 12) == 0)
412 init_priority
= strtoul (name
+ 12, &end
, 10);
413 return *end
? 0 : init_priority
;
415 else if (strncmp (name
, ".ctors.", 7) == 0
416 || strncmp (name
, ".dtors.", 7) == 0)
418 init_priority
= strtoul (name
+ 7, &end
, 10);
419 return *end
? 0 : 65535 - init_priority
;
425 /* Compare sections ASEC and BSEC according to SORT. */
428 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
431 unsigned long ainit_priority
, binit_priority
;
438 case by_init_priority
:
440 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
442 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
443 if (ainit_priority
== 0 || binit_priority
== 0)
445 ret
= ainit_priority
- binit_priority
;
451 case by_alignment_name
:
452 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
453 - bfd_section_alignment (asec
->owner
, asec
));
460 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
461 bfd_get_section_name (bsec
->owner
, bsec
));
464 case by_name_alignment
:
465 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
466 bfd_get_section_name (bsec
->owner
, bsec
));
472 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
473 - bfd_section_alignment (asec
->owner
, asec
));
480 /* Build a Binary Search Tree to sort sections, unlike insertion sort
481 used in wild_sort(). BST is considerably faster if the number of
482 of sections are large. */
484 static lang_section_bst_type
**
485 wild_sort_fast (lang_wild_statement_type
*wild
,
486 struct wildcard_list
*sec
,
487 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
490 lang_section_bst_type
**tree
;
493 if (!wild
->filenames_sorted
494 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
496 /* Append at the right end of tree. */
498 tree
= &((*tree
)->right
);
504 /* Find the correct node to append this section. */
505 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
506 tree
= &((*tree
)->left
);
508 tree
= &((*tree
)->right
);
514 /* Use wild_sort_fast to build a BST to sort sections. */
517 output_section_callback_fast (lang_wild_statement_type
*ptr
,
518 struct wildcard_list
*sec
,
520 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
521 lang_input_statement_type
*file
,
524 lang_section_bst_type
*node
;
525 lang_section_bst_type
**tree
;
526 lang_output_section_statement_type
*os
;
528 os
= (lang_output_section_statement_type
*) output
;
530 if (unique_section_p (section
, os
))
533 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
536 node
->section
= section
;
538 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
543 /* Convert a sorted sections' BST back to list form. */
546 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
547 lang_section_bst_type
*tree
,
551 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
553 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
554 (lang_output_section_statement_type
*) output
);
557 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
562 /* Specialized, optimized routines for handling different kinds of
566 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
567 lang_input_statement_type
*file
,
571 /* We can just do a hash lookup for the section with the right name.
572 But if that lookup discovers more than one section with the name
573 (should be rare), we fall back to the general algorithm because
574 we would otherwise have to sort the sections to make sure they
575 get processed in the bfd's order. */
576 bfd_boolean multiple_sections_found
;
577 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
578 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
580 if (multiple_sections_found
)
581 walk_wild_section_general (ptr
, file
, callback
, data
);
583 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
587 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
588 lang_input_statement_type
*file
,
593 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
595 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
597 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
598 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
601 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
606 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
607 lang_input_statement_type
*file
,
612 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
613 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
614 bfd_boolean multiple_sections_found
;
615 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
617 if (multiple_sections_found
)
619 walk_wild_section_general (ptr
, file
, callback
, data
);
623 /* Note that if the section was not found, s0 is NULL and
624 we'll simply never succeed the s == s0 test below. */
625 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
627 /* Recall that in this code path, a section cannot satisfy more
628 than one spec, so if s == s0 then it cannot match
631 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
634 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
635 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
638 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
645 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
646 lang_input_statement_type
*file
,
651 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
652 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
653 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
654 bfd_boolean multiple_sections_found
;
655 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
657 if (multiple_sections_found
)
659 walk_wild_section_general (ptr
, file
, callback
, data
);
663 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
666 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
669 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
670 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
673 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
676 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
678 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
686 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
687 lang_input_statement_type
*file
,
692 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
693 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
694 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
695 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
696 bfd_boolean multiple_sections_found
;
697 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
699 if (multiple_sections_found
)
701 walk_wild_section_general (ptr
, file
, callback
, data
);
705 s1
= find_section (file
, sec1
, &multiple_sections_found
);
706 if (multiple_sections_found
)
708 walk_wild_section_general (ptr
, file
, callback
, data
);
712 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
715 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
718 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
721 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
722 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
726 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
730 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
732 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
740 walk_wild_section (lang_wild_statement_type
*ptr
,
741 lang_input_statement_type
*file
,
745 if (file
->flags
.just_syms
)
748 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
751 /* Returns TRUE when name1 is a wildcard spec that might match
752 something name2 can match. We're conservative: we return FALSE
753 only if the prefixes of name1 and name2 are different up to the
754 first wildcard character. */
757 wild_spec_can_overlap (const char *name1
, const char *name2
)
759 size_t prefix1_len
= strcspn (name1
, "?*[");
760 size_t prefix2_len
= strcspn (name2
, "?*[");
761 size_t min_prefix_len
;
763 /* Note that if there is no wildcard character, then we treat the
764 terminating 0 as part of the prefix. Thus ".text" won't match
765 ".text." or ".text.*", for example. */
766 if (name1
[prefix1_len
] == '\0')
768 if (name2
[prefix2_len
] == '\0')
771 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
773 return memcmp (name1
, name2
, min_prefix_len
) == 0;
776 /* Select specialized code to handle various kinds of wildcard
780 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
783 int wild_name_count
= 0;
784 struct wildcard_list
*sec
;
788 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
789 ptr
->handler_data
[0] = NULL
;
790 ptr
->handler_data
[1] = NULL
;
791 ptr
->handler_data
[2] = NULL
;
792 ptr
->handler_data
[3] = NULL
;
795 /* Count how many wildcard_specs there are, and how many of those
796 actually use wildcards in the name. Also, bail out if any of the
797 wildcard names are NULL. (Can this actually happen?
798 walk_wild_section used to test for it.) And bail out if any
799 of the wildcards are more complex than a simple string
800 ending in a single '*'. */
801 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
804 if (sec
->spec
.name
== NULL
)
806 if (wildcardp (sec
->spec
.name
))
809 if (!is_simple_wild (sec
->spec
.name
))
814 /* The zero-spec case would be easy to optimize but it doesn't
815 happen in practice. Likewise, more than 4 specs doesn't
816 happen in practice. */
817 if (sec_count
== 0 || sec_count
> 4)
820 /* Check that no two specs can match the same section. */
821 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
823 struct wildcard_list
*sec2
;
824 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
826 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
831 signature
= (sec_count
<< 8) + wild_name_count
;
835 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
838 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
841 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
844 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
847 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
853 /* Now fill the data array with pointers to the specs, first the
854 specs with non-wildcard names, then the specs with wildcard
855 names. It's OK to process the specs in different order from the
856 given order, because we've already determined that no section
857 will match more than one spec. */
859 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
860 if (!wildcardp (sec
->spec
.name
))
861 ptr
->handler_data
[data_counter
++] = sec
;
862 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
863 if (wildcardp (sec
->spec
.name
))
864 ptr
->handler_data
[data_counter
++] = sec
;
867 /* Handle a wild statement for a single file F. */
870 walk_wild_file (lang_wild_statement_type
*s
,
871 lang_input_statement_type
*f
,
875 if (walk_wild_file_in_exclude_list (s
->exclude_name_list
, f
))
878 if (f
->the_bfd
== NULL
879 || !bfd_check_format (f
->the_bfd
, bfd_archive
))
880 walk_wild_section (s
, f
, callback
, data
);
885 /* This is an archive file. We must map each member of the
886 archive separately. */
887 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
888 while (member
!= NULL
)
890 /* When lookup_name is called, it will call the add_symbols
891 entry point for the archive. For each element of the
892 archive which is included, BFD will call ldlang_add_file,
893 which will set the usrdata field of the member to the
894 lang_input_statement. */
895 if (member
->usrdata
!= NULL
)
897 walk_wild_section (s
,
898 (lang_input_statement_type
*) member
->usrdata
,
902 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
908 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
910 const char *file_spec
= s
->filename
;
913 if (file_spec
== NULL
)
915 /* Perform the iteration over all files in the list. */
916 LANG_FOR_EACH_INPUT_STATEMENT (f
)
918 walk_wild_file (s
, f
, callback
, data
);
921 else if ((p
= archive_path (file_spec
)) != NULL
)
923 LANG_FOR_EACH_INPUT_STATEMENT (f
)
925 if (input_statement_is_archive_path (file_spec
, p
, f
))
926 walk_wild_file (s
, f
, callback
, data
);
929 else if (wildcardp (file_spec
))
931 LANG_FOR_EACH_INPUT_STATEMENT (f
)
933 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
934 walk_wild_file (s
, f
, callback
, data
);
939 lang_input_statement_type
*f
;
941 /* Perform the iteration over a single file. */
942 f
= lookup_name (file_spec
);
944 walk_wild_file (s
, f
, callback
, data
);
948 /* lang_for_each_statement walks the parse tree and calls the provided
949 function for each node, except those inside output section statements
950 with constraint set to -1. */
953 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
954 lang_statement_union_type
*s
)
956 for (; s
!= NULL
; s
= s
->header
.next
)
960 switch (s
->header
.type
)
962 case lang_constructors_statement_enum
:
963 lang_for_each_statement_worker (func
, constructor_list
.head
);
965 case lang_output_section_statement_enum
:
966 if (s
->output_section_statement
.constraint
!= -1)
967 lang_for_each_statement_worker
968 (func
, s
->output_section_statement
.children
.head
);
970 case lang_wild_statement_enum
:
971 lang_for_each_statement_worker (func
,
972 s
->wild_statement
.children
.head
);
974 case lang_group_statement_enum
:
975 lang_for_each_statement_worker (func
,
976 s
->group_statement
.children
.head
);
978 case lang_data_statement_enum
:
979 case lang_reloc_statement_enum
:
980 case lang_object_symbols_statement_enum
:
981 case lang_output_statement_enum
:
982 case lang_target_statement_enum
:
983 case lang_input_section_enum
:
984 case lang_input_statement_enum
:
985 case lang_assignment_statement_enum
:
986 case lang_padding_statement_enum
:
987 case lang_address_statement_enum
:
988 case lang_fill_statement_enum
:
989 case lang_insert_statement_enum
:
999 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
1001 lang_for_each_statement_worker (func
, statement_list
.head
);
1004 /*----------------------------------------------------------------------*/
1007 lang_list_init (lang_statement_list_type
*list
)
1010 list
->tail
= &list
->head
;
1014 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1016 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1018 *stat_save_ptr
++ = stat_ptr
;
1025 if (stat_save_ptr
<= stat_save
)
1027 stat_ptr
= *--stat_save_ptr
;
1030 /* Build a new statement node for the parse tree. */
1032 static lang_statement_union_type
*
1033 new_statement (enum statement_enum type
,
1035 lang_statement_list_type
*list
)
1037 lang_statement_union_type
*new_stmt
;
1039 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1040 new_stmt
->header
.type
= type
;
1041 new_stmt
->header
.next
= NULL
;
1042 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1046 /* Build a new input file node for the language. There are several
1047 ways in which we treat an input file, eg, we only look at symbols,
1048 or prefix it with a -l etc.
1050 We can be supplied with requests for input files more than once;
1051 they may, for example be split over several lines like foo.o(.text)
1052 foo.o(.data) etc, so when asked for a file we check that we haven't
1053 got it already so we don't duplicate the bfd. */
1055 static lang_input_statement_type
*
1056 new_afile (const char *name
,
1057 lang_input_file_enum_type file_type
,
1059 bfd_boolean add_to_list
)
1061 lang_input_statement_type
*p
;
1063 lang_has_input_file
= TRUE
;
1066 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1069 p
= (lang_input_statement_type
*)
1070 stat_alloc (sizeof (lang_input_statement_type
));
1071 p
->header
.type
= lang_input_statement_enum
;
1072 p
->header
.next
= NULL
;
1075 memset (&p
->the_bfd
, 0,
1076 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1078 p
->flags
.dynamic
= input_flags
.dynamic
;
1079 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1080 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1081 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1082 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1086 case lang_input_file_is_symbols_only_enum
:
1088 p
->local_sym_name
= name
;
1089 p
->flags
.real
= TRUE
;
1090 p
->flags
.just_syms
= TRUE
;
1092 case lang_input_file_is_fake_enum
:
1094 p
->local_sym_name
= name
;
1096 case lang_input_file_is_l_enum
:
1097 if (name
[0] == ':' && name
[1] != '\0')
1099 p
->filename
= name
+ 1;
1100 p
->flags
.full_name_provided
= TRUE
;
1104 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1105 p
->flags
.maybe_archive
= TRUE
;
1106 p
->flags
.real
= TRUE
;
1107 p
->flags
.search_dirs
= TRUE
;
1109 case lang_input_file_is_marker_enum
:
1111 p
->local_sym_name
= name
;
1112 p
->flags
.search_dirs
= TRUE
;
1114 case lang_input_file_is_search_file_enum
:
1116 p
->local_sym_name
= name
;
1117 p
->flags
.real
= TRUE
;
1118 p
->flags
.search_dirs
= TRUE
;
1120 case lang_input_file_is_file_enum
:
1122 p
->local_sym_name
= name
;
1123 p
->flags
.real
= TRUE
;
1129 lang_statement_append (&input_file_chain
,
1130 (lang_statement_union_type
*) p
,
1131 &p
->next_real_file
);
1135 lang_input_statement_type
*
1136 lang_add_input_file (const char *name
,
1137 lang_input_file_enum_type file_type
,
1141 && (*name
== '=' || CONST_STRNEQ (name
, "$SYSROOT")))
1143 lang_input_statement_type
*ret
;
1144 char *sysrooted_name
1145 = concat (ld_sysroot
,
1146 name
+ (*name
== '=' ? 1 : strlen ("$SYSROOT")),
1147 (const char *) NULL
);
1149 /* We've now forcibly prepended the sysroot, making the input
1150 file independent of the context. Therefore, temporarily
1151 force a non-sysrooted context for this statement, so it won't
1152 get the sysroot prepended again when opened. (N.B. if it's a
1153 script, any child nodes with input files starting with "/"
1154 will be handled as "sysrooted" as they'll be found to be
1155 within the sysroot subdirectory.) */
1156 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1157 input_flags
.sysrooted
= 0;
1158 ret
= new_afile (sysrooted_name
, file_type
, target
, TRUE
);
1159 input_flags
.sysrooted
= outer_sysrooted
;
1163 return new_afile (name
, file_type
, target
, TRUE
);
1166 struct out_section_hash_entry
1168 struct bfd_hash_entry root
;
1169 lang_statement_union_type s
;
1172 /* The hash table. */
1174 static struct bfd_hash_table output_section_statement_table
;
1176 /* Support routines for the hash table used by lang_output_section_find,
1177 initialize the table, fill in an entry and remove the table. */
1179 static struct bfd_hash_entry
*
1180 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1181 struct bfd_hash_table
*table
,
1184 lang_output_section_statement_type
**nextp
;
1185 struct out_section_hash_entry
*ret
;
1189 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1195 entry
= bfd_hash_newfunc (entry
, table
, string
);
1199 ret
= (struct out_section_hash_entry
*) entry
;
1200 memset (&ret
->s
, 0, sizeof (ret
->s
));
1201 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1202 ret
->s
.output_section_statement
.subsection_alignment
= NULL
;
1203 ret
->s
.output_section_statement
.section_alignment
= NULL
;
1204 ret
->s
.output_section_statement
.block_value
= 1;
1205 lang_list_init (&ret
->s
.output_section_statement
.children
);
1206 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1208 /* For every output section statement added to the list, except the
1209 first one, lang_output_section_statement.tail points to the "next"
1210 field of the last element of the list. */
1211 if (lang_output_section_statement
.head
!= NULL
)
1212 ret
->s
.output_section_statement
.prev
1213 = ((lang_output_section_statement_type
*)
1214 ((char *) lang_output_section_statement
.tail
1215 - offsetof (lang_output_section_statement_type
, next
)));
1217 /* GCC's strict aliasing rules prevent us from just casting the
1218 address, so we store the pointer in a variable and cast that
1220 nextp
= &ret
->s
.output_section_statement
.next
;
1221 lang_statement_append (&lang_output_section_statement
,
1223 (lang_statement_union_type
**) nextp
);
1228 output_section_statement_table_init (void)
1230 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1231 output_section_statement_newfunc
,
1232 sizeof (struct out_section_hash_entry
),
1234 einfo (_("%F%P: can not create hash table: %E\n"));
1238 output_section_statement_table_free (void)
1240 bfd_hash_table_free (&output_section_statement_table
);
1243 /* Build enough state so that the parser can build its tree. */
1248 obstack_begin (&stat_obstack
, 1000);
1250 stat_ptr
= &statement_list
;
1252 output_section_statement_table_init ();
1254 lang_list_init (stat_ptr
);
1256 lang_list_init (&input_file_chain
);
1257 lang_list_init (&lang_output_section_statement
);
1258 lang_list_init (&file_chain
);
1259 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1261 abs_output_section
=
1262 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1264 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1266 asneeded_list_head
= NULL
;
1267 asneeded_list_tail
= &asneeded_list_head
;
1273 output_section_statement_table_free ();
1276 /*----------------------------------------------------------------------
1277 A region is an area of memory declared with the
1278 MEMORY { name:org=exp, len=exp ... }
1281 We maintain a list of all the regions here.
1283 If no regions are specified in the script, then the default is used
1284 which is created when looked up to be the entire data space.
1286 If create is true we are creating a region inside a MEMORY block.
1287 In this case it is probably an error to create a region that has
1288 already been created. If we are not inside a MEMORY block it is
1289 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1290 and so we issue a warning.
1292 Each region has at least one name. The first name is either
1293 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1294 alias names to an existing region within a script with
1295 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1298 static lang_memory_region_type
*lang_memory_region_list
;
1299 static lang_memory_region_type
**lang_memory_region_list_tail
1300 = &lang_memory_region_list
;
1302 lang_memory_region_type
*
1303 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1305 lang_memory_region_name
*n
;
1306 lang_memory_region_type
*r
;
1307 lang_memory_region_type
*new_region
;
1309 /* NAME is NULL for LMA memspecs if no region was specified. */
1313 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1314 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1315 if (strcmp (n
->name
, name
) == 0)
1318 einfo (_("%P:%pS: warning: redeclaration of memory region `%s'\n"),
1323 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1324 einfo (_("%P:%pS: warning: memory region `%s' not declared\n"),
1327 new_region
= (lang_memory_region_type
*)
1328 stat_alloc (sizeof (lang_memory_region_type
));
1330 new_region
->name_list
.name
= xstrdup (name
);
1331 new_region
->name_list
.next
= NULL
;
1332 new_region
->next
= NULL
;
1333 new_region
->origin_exp
= NULL
;
1334 new_region
->origin
= 0;
1335 new_region
->length_exp
= NULL
;
1336 new_region
->length
= ~(bfd_size_type
) 0;
1337 new_region
->current
= 0;
1338 new_region
->last_os
= NULL
;
1339 new_region
->flags
= 0;
1340 new_region
->not_flags
= 0;
1341 new_region
->had_full_message
= FALSE
;
1343 *lang_memory_region_list_tail
= new_region
;
1344 lang_memory_region_list_tail
= &new_region
->next
;
1350 lang_memory_region_alias (const char *alias
, const char *region_name
)
1352 lang_memory_region_name
*n
;
1353 lang_memory_region_type
*r
;
1354 lang_memory_region_type
*region
;
1356 /* The default region must be unique. This ensures that it is not necessary
1357 to iterate through the name list if someone wants the check if a region is
1358 the default memory region. */
1359 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1360 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1361 einfo (_("%F%P:%pS: error: alias for default memory region\n"), NULL
);
1363 /* Look for the target region and check if the alias is not already
1366 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1367 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1369 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1371 if (strcmp (n
->name
, alias
) == 0)
1372 einfo (_("%F%P:%pS: error: redefinition of memory region "
1377 /* Check if the target region exists. */
1379 einfo (_("%F%P:%pS: error: memory region `%s' "
1380 "for alias `%s' does not exist\n"),
1381 NULL
, region_name
, alias
);
1383 /* Add alias to region name list. */
1384 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1385 n
->name
= xstrdup (alias
);
1386 n
->next
= region
->name_list
.next
;
1387 region
->name_list
.next
= n
;
1390 static lang_memory_region_type
*
1391 lang_memory_default (asection
*section
)
1393 lang_memory_region_type
*p
;
1395 flagword sec_flags
= section
->flags
;
1397 /* Override SEC_DATA to mean a writable section. */
1398 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1399 sec_flags
|= SEC_DATA
;
1401 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1403 if ((p
->flags
& sec_flags
) != 0
1404 && (p
->not_flags
& sec_flags
) == 0)
1409 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1412 /* Get the output section statement directly from the userdata. */
1414 lang_output_section_statement_type
*
1415 lang_output_section_get (const asection
*output_section
)
1417 return get_userdata (output_section
);
1420 /* Find or create an output_section_statement with the given NAME.
1421 If CONSTRAINT is non-zero match one with that constraint, otherwise
1422 match any non-negative constraint. If CREATE, always make a
1423 new output_section_statement for SPECIAL CONSTRAINT. */
1425 lang_output_section_statement_type
*
1426 lang_output_section_statement_lookup (const char *name
,
1430 struct out_section_hash_entry
*entry
;
1432 entry
= ((struct out_section_hash_entry
*)
1433 bfd_hash_lookup (&output_section_statement_table
, name
,
1438 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1442 if (entry
->s
.output_section_statement
.name
!= NULL
)
1444 /* We have a section of this name, but it might not have the correct
1446 struct out_section_hash_entry
*last_ent
;
1448 name
= entry
->s
.output_section_statement
.name
;
1449 if (create
&& constraint
== SPECIAL
)
1450 /* Not traversing to the end reverses the order of the second
1451 and subsequent SPECIAL sections in the hash table chain,
1452 but that shouldn't matter. */
1457 if (constraint
== entry
->s
.output_section_statement
.constraint
1459 && entry
->s
.output_section_statement
.constraint
>= 0))
1460 return &entry
->s
.output_section_statement
;
1462 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1464 while (entry
!= NULL
1465 && name
== entry
->s
.output_section_statement
.name
);
1471 = ((struct out_section_hash_entry
*)
1472 output_section_statement_newfunc (NULL
,
1473 &output_section_statement_table
,
1477 einfo (_("%F%P: failed creating section `%s': %E\n"), name
);
1480 entry
->root
= last_ent
->root
;
1481 last_ent
->root
.next
= &entry
->root
;
1484 entry
->s
.output_section_statement
.name
= name
;
1485 entry
->s
.output_section_statement
.constraint
= constraint
;
1486 return &entry
->s
.output_section_statement
;
1489 /* Find the next output_section_statement with the same name as OS.
1490 If CONSTRAINT is non-zero, find one with that constraint otherwise
1491 match any non-negative constraint. */
1493 lang_output_section_statement_type
*
1494 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1497 /* All output_section_statements are actually part of a
1498 struct out_section_hash_entry. */
1499 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1501 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1502 const char *name
= os
->name
;
1504 ASSERT (name
== entry
->root
.string
);
1507 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1509 || name
!= entry
->s
.output_section_statement
.name
)
1512 while (constraint
!= entry
->s
.output_section_statement
.constraint
1514 || entry
->s
.output_section_statement
.constraint
< 0));
1516 return &entry
->s
.output_section_statement
;
1519 /* A variant of lang_output_section_find used by place_orphan.
1520 Returns the output statement that should precede a new output
1521 statement for SEC. If an exact match is found on certain flags,
1524 lang_output_section_statement_type
*
1525 lang_output_section_find_by_flags (const asection
*sec
,
1527 lang_output_section_statement_type
**exact
,
1528 lang_match_sec_type_func match_type
)
1530 lang_output_section_statement_type
*first
, *look
, *found
;
1531 flagword look_flags
, differ
;
1533 /* We know the first statement on this list is *ABS*. May as well
1535 first
= &lang_output_section_statement
.head
->output_section_statement
;
1536 first
= first
->next
;
1538 /* First try for an exact match. */
1540 for (look
= first
; look
; look
= look
->next
)
1542 look_flags
= look
->flags
;
1543 if (look
->bfd_section
!= NULL
)
1545 look_flags
= look
->bfd_section
->flags
;
1546 if (match_type
&& !match_type (link_info
.output_bfd
,
1551 differ
= look_flags
^ sec_flags
;
1552 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1553 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1563 if ((sec_flags
& SEC_CODE
) != 0
1564 && (sec_flags
& SEC_ALLOC
) != 0)
1566 /* Try for a rw code section. */
1567 for (look
= first
; look
; look
= look
->next
)
1569 look_flags
= look
->flags
;
1570 if (look
->bfd_section
!= NULL
)
1572 look_flags
= look
->bfd_section
->flags
;
1573 if (match_type
&& !match_type (link_info
.output_bfd
,
1578 differ
= look_flags
^ sec_flags
;
1579 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1580 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1584 else if ((sec_flags
& SEC_READONLY
) != 0
1585 && (sec_flags
& SEC_ALLOC
) != 0)
1587 /* .rodata can go after .text, .sdata2 after .rodata. */
1588 for (look
= first
; look
; look
= look
->next
)
1590 look_flags
= look
->flags
;
1591 if (look
->bfd_section
!= NULL
)
1593 look_flags
= look
->bfd_section
->flags
;
1594 if (match_type
&& !match_type (link_info
.output_bfd
,
1599 differ
= look_flags
^ sec_flags
;
1600 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1601 | SEC_READONLY
| SEC_SMALL_DATA
))
1602 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1604 && !(look_flags
& SEC_SMALL_DATA
)))
1608 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1609 && (sec_flags
& SEC_ALLOC
) != 0)
1611 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1612 as if it were a loaded section, and don't use match_type. */
1613 bfd_boolean seen_thread_local
= FALSE
;
1616 for (look
= first
; look
; look
= look
->next
)
1618 look_flags
= look
->flags
;
1619 if (look
->bfd_section
!= NULL
)
1620 look_flags
= look
->bfd_section
->flags
;
1622 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1623 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1625 /* .tdata and .tbss must be adjacent and in that order. */
1626 if (!(look_flags
& SEC_LOAD
)
1627 && (sec_flags
& SEC_LOAD
))
1628 /* ..so if we're at a .tbss section and we're placing
1629 a .tdata section stop looking and return the
1630 previous section. */
1633 seen_thread_local
= TRUE
;
1635 else if (seen_thread_local
)
1637 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1641 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1642 && (sec_flags
& SEC_ALLOC
) != 0)
1644 /* .sdata goes after .data, .sbss after .sdata. */
1645 for (look
= first
; look
; look
= look
->next
)
1647 look_flags
= look
->flags
;
1648 if (look
->bfd_section
!= NULL
)
1650 look_flags
= look
->bfd_section
->flags
;
1651 if (match_type
&& !match_type (link_info
.output_bfd
,
1656 differ
= look_flags
^ sec_flags
;
1657 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1658 | SEC_THREAD_LOCAL
))
1659 || ((look_flags
& SEC_SMALL_DATA
)
1660 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1664 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1665 && (sec_flags
& SEC_ALLOC
) != 0)
1667 /* .data goes after .rodata. */
1668 for (look
= first
; look
; look
= look
->next
)
1670 look_flags
= look
->flags
;
1671 if (look
->bfd_section
!= NULL
)
1673 look_flags
= look
->bfd_section
->flags
;
1674 if (match_type
&& !match_type (link_info
.output_bfd
,
1679 differ
= look_flags
^ sec_flags
;
1680 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1681 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1685 else if ((sec_flags
& SEC_ALLOC
) != 0)
1687 /* .bss goes after any other alloc section. */
1688 for (look
= first
; look
; look
= look
->next
)
1690 look_flags
= look
->flags
;
1691 if (look
->bfd_section
!= NULL
)
1693 look_flags
= look
->bfd_section
->flags
;
1694 if (match_type
&& !match_type (link_info
.output_bfd
,
1699 differ
= look_flags
^ sec_flags
;
1700 if (!(differ
& SEC_ALLOC
))
1706 /* non-alloc go last. */
1707 for (look
= first
; look
; look
= look
->next
)
1709 look_flags
= look
->flags
;
1710 if (look
->bfd_section
!= NULL
)
1711 look_flags
= look
->bfd_section
->flags
;
1712 differ
= look_flags
^ sec_flags
;
1713 if (!(differ
& SEC_DEBUGGING
))
1719 if (found
|| !match_type
)
1722 return lang_output_section_find_by_flags (sec
, sec_flags
, NULL
, NULL
);
1725 /* Find the last output section before given output statement.
1726 Used by place_orphan. */
1729 output_prev_sec_find (lang_output_section_statement_type
*os
)
1731 lang_output_section_statement_type
*lookup
;
1733 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1735 if (lookup
->constraint
< 0)
1738 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1739 return lookup
->bfd_section
;
1745 /* Look for a suitable place for a new output section statement. The
1746 idea is to skip over anything that might be inside a SECTIONS {}
1747 statement in a script, before we find another output section
1748 statement. Assignments to "dot" before an output section statement
1749 are assumed to belong to it, except in two cases; The first
1750 assignment to dot, and assignments before non-alloc sections.
1751 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1752 similar assignments that set the initial address, or we might
1753 insert non-alloc note sections among assignments setting end of
1756 static lang_statement_union_type
**
1757 insert_os_after (lang_output_section_statement_type
*after
)
1759 lang_statement_union_type
**where
;
1760 lang_statement_union_type
**assign
= NULL
;
1761 bfd_boolean ignore_first
;
1764 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1766 for (where
= &after
->header
.next
;
1768 where
= &(*where
)->header
.next
)
1770 switch ((*where
)->header
.type
)
1772 case lang_assignment_statement_enum
:
1775 lang_assignment_statement_type
*ass
;
1777 ass
= &(*where
)->assignment_statement
;
1778 if (ass
->exp
->type
.node_class
!= etree_assert
1779 && ass
->exp
->assign
.dst
[0] == '.'
1780 && ass
->exp
->assign
.dst
[1] == 0
1784 ignore_first
= FALSE
;
1786 case lang_wild_statement_enum
:
1787 case lang_input_section_enum
:
1788 case lang_object_symbols_statement_enum
:
1789 case lang_fill_statement_enum
:
1790 case lang_data_statement_enum
:
1791 case lang_reloc_statement_enum
:
1792 case lang_padding_statement_enum
:
1793 case lang_constructors_statement_enum
:
1796 case lang_output_section_statement_enum
:
1799 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1802 || s
->map_head
.s
== NULL
1803 || (s
->flags
& SEC_ALLOC
) != 0)
1807 case lang_input_statement_enum
:
1808 case lang_address_statement_enum
:
1809 case lang_target_statement_enum
:
1810 case lang_output_statement_enum
:
1811 case lang_group_statement_enum
:
1812 case lang_insert_statement_enum
:
1821 lang_output_section_statement_type
*
1822 lang_insert_orphan (asection
*s
,
1823 const char *secname
,
1825 lang_output_section_statement_type
*after
,
1826 struct orphan_save
*place
,
1827 etree_type
*address
,
1828 lang_statement_list_type
*add_child
)
1830 lang_statement_list_type add
;
1831 lang_output_section_statement_type
*os
;
1832 lang_output_section_statement_type
**os_tail
;
1834 /* If we have found an appropriate place for the output section
1835 statements for this orphan, add them to our own private list,
1836 inserting them later into the global statement list. */
1839 lang_list_init (&add
);
1840 push_stat_ptr (&add
);
1843 if (bfd_link_relocatable (&link_info
)
1844 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1845 address
= exp_intop (0);
1847 os_tail
= ((lang_output_section_statement_type
**)
1848 lang_output_section_statement
.tail
);
1849 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1850 NULL
, NULL
, NULL
, constraint
, 0);
1852 if (add_child
== NULL
)
1853 add_child
= &os
->children
;
1854 lang_add_section (add_child
, s
, NULL
, os
);
1856 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1858 const char *region
= (after
->region
1859 ? after
->region
->name_list
.name
1860 : DEFAULT_MEMORY_REGION
);
1861 const char *lma_region
= (after
->lma_region
1862 ? after
->lma_region
->name_list
.name
1864 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1868 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1871 /* Restore the global list pointer. */
1875 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1877 asection
*snew
, *as
;
1878 bfd_boolean place_after
= place
->stmt
== NULL
;
1880 snew
= os
->bfd_section
;
1882 /* Shuffle the bfd section list to make the output file look
1883 neater. This is really only cosmetic. */
1884 if (place
->section
== NULL
1885 && after
!= (&lang_output_section_statement
.head
1886 ->output_section_statement
))
1888 asection
*bfd_section
= after
->bfd_section
;
1890 /* If the output statement hasn't been used to place any input
1891 sections (and thus doesn't have an output bfd_section),
1892 look for the closest prior output statement having an
1894 if (bfd_section
== NULL
)
1895 bfd_section
= output_prev_sec_find (after
);
1897 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1898 place
->section
= &bfd_section
->next
;
1901 if (place
->section
== NULL
)
1902 place
->section
= &link_info
.output_bfd
->sections
;
1904 as
= *place
->section
;
1908 /* Put the section at the end of the list. */
1910 /* Unlink the section. */
1911 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1913 /* Now tack it back on in the right place. */
1914 bfd_section_list_append (link_info
.output_bfd
, snew
);
1916 else if ((bfd_get_flavour (link_info
.output_bfd
)
1917 == bfd_target_elf_flavour
)
1918 && (bfd_get_flavour (s
->owner
)
1919 == bfd_target_elf_flavour
)
1920 && ((elf_section_type (s
) == SHT_NOTE
1921 && (s
->flags
& SEC_LOAD
) != 0)
1922 || (elf_section_type (as
) == SHT_NOTE
1923 && (as
->flags
& SEC_LOAD
) != 0)))
1925 /* Make sure that output note sections are grouped and sorted
1926 by alignments when inserting a note section or insert a
1927 section after a note section, */
1929 /* A specific section after which the output note section
1930 should be placed. */
1931 asection
*after_sec
;
1932 /* True if we need to insert the orphan section after a
1933 specific section to maintain output note section order. */
1934 bfd_boolean after_sec_note
;
1936 /* Group and sort output note section by alignments in
1939 if (elf_section_type (s
) == SHT_NOTE
1940 && (s
->flags
& SEC_LOAD
) != 0)
1942 /* Search forward for the last output note section
1943 with equal or larger alignments. */
1944 asection
*first_note
= NULL
;
1948 && !bfd_is_abs_section (sec
));
1951 && elf_section_type (sec
) == SHT_NOTE
1952 && (sec
->flags
& SEC_LOAD
) != 0)
1956 if (sec
->alignment_power
>= s
->alignment_power
)
1961 after_sec_note
= TRUE
;
1964 /* Search backward for the first output note section
1965 as well as the last output note section with equal
1966 or larger alignments. */
1970 && !bfd_is_abs_section (sec
));
1973 && elf_section_type (sec
) == SHT_NOTE
1974 && (sec
->flags
& SEC_LOAD
) != 0)
1978 && sec
->alignment_power
>= s
->alignment_power
)
1982 /* If this will be the first note section, it can be
1983 placed at the default location. */
1984 after_sec_note
= first_note
!= NULL
;
1985 if (after_sec
== NULL
&& after_sec_note
)
1987 /* If all output note sections have smaller
1988 alignments, place the section before all
1989 output note sections. AFTER_SEC will be
1990 NULL if FIRST_NOTE is the first output
1992 after_sec
= first_note
->prev
;
1998 /* Don't place non-note sections in the middle of note
2000 after_sec_note
= TRUE
;
2002 for (sec
= as
->next
;
2004 && !bfd_is_abs_section (sec
));
2006 if (elf_section_type (sec
) == SHT_NOTE
2007 && (sec
->flags
& SEC_LOAD
) != 0)
2015 /* Insert OS after AFTER_SEC output statement. */
2016 lang_output_section_statement_type
*stmt
;
2020 if (stmt
->bfd_section
== after_sec
)
2028 if (after_sec
== NULL
|| after_sec
->next
!= snew
)
2030 /* Unlink the section. */
2031 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2033 /* Place SNEW after AFTER_SEC. If AFTER_SEC is NULL,
2036 bfd_section_list_insert_after (link_info
.output_bfd
,
2039 bfd_section_list_prepend (link_info
.output_bfd
, snew
);
2042 else if (as
!= snew
&& as
->prev
!= snew
)
2044 /* Unlink the section. */
2045 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2047 /* Now tack it back on in the right place. */
2048 bfd_section_list_insert_before (link_info
.output_bfd
,
2052 else if (as
!= snew
&& as
->prev
!= snew
)
2054 /* Unlink the section. */
2055 bfd_section_list_remove (link_info
.output_bfd
, snew
);
2057 /* Now tack it back on in the right place. */
2058 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
2061 /* Save the end of this list. Further ophans of this type will
2062 follow the one we've just added. */
2063 place
->section
= &snew
->next
;
2065 /* The following is non-cosmetic. We try to put the output
2066 statements in some sort of reasonable order here, because they
2067 determine the final load addresses of the orphan sections.
2068 In addition, placing output statements in the wrong order may
2069 require extra segments. For instance, given a typical
2070 situation of all read-only sections placed in one segment and
2071 following that a segment containing all the read-write
2072 sections, we wouldn't want to place an orphan read/write
2073 section before or amongst the read-only ones. */
2074 if (add
.head
!= NULL
)
2076 lang_output_section_statement_type
*newly_added_os
;
2078 /* Place OS after AFTER if AFTER_NOTE is TRUE. */
2081 lang_statement_union_type
**where
= insert_os_after (after
);
2086 place
->os_tail
= &after
->next
;
2090 /* Put it after the last orphan statement we added. */
2091 *add
.tail
= *place
->stmt
;
2092 *place
->stmt
= add
.head
;
2095 /* Fix the global list pointer if we happened to tack our
2096 new list at the tail. */
2097 if (*stat_ptr
->tail
== add
.head
)
2098 stat_ptr
->tail
= add
.tail
;
2100 /* Save the end of this list. */
2101 place
->stmt
= add
.tail
;
2103 /* Do the same for the list of output section statements. */
2104 newly_added_os
= *os_tail
;
2106 newly_added_os
->prev
= (lang_output_section_statement_type
*)
2107 ((char *) place
->os_tail
2108 - offsetof (lang_output_section_statement_type
, next
));
2109 newly_added_os
->next
= *place
->os_tail
;
2110 if (newly_added_os
->next
!= NULL
)
2111 newly_added_os
->next
->prev
= newly_added_os
;
2112 *place
->os_tail
= newly_added_os
;
2113 place
->os_tail
= &newly_added_os
->next
;
2115 /* Fixing the global list pointer here is a little different.
2116 We added to the list in lang_enter_output_section_statement,
2117 trimmed off the new output_section_statment above when
2118 assigning *os_tail = NULL, but possibly added it back in
2119 the same place when assigning *place->os_tail. */
2120 if (*os_tail
== NULL
)
2121 lang_output_section_statement
.tail
2122 = (lang_statement_union_type
**) os_tail
;
2129 lang_print_asneeded (void)
2131 struct asneeded_minfo
*m
;
2133 if (asneeded_list_head
== NULL
)
2136 minfo (_("\nAs-needed library included to satisfy reference by file (symbol)\n\n"));
2138 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2142 minfo ("%s", m
->soname
);
2143 len
= strlen (m
->soname
);
2157 minfo ("%pB ", m
->ref
);
2158 minfo ("(%pT)\n", m
->name
);
2163 lang_map_flags (flagword flag
)
2165 if (flag
& SEC_ALLOC
)
2168 if (flag
& SEC_CODE
)
2171 if (flag
& SEC_READONLY
)
2174 if (flag
& SEC_DATA
)
2177 if (flag
& SEC_LOAD
)
2184 lang_memory_region_type
*m
;
2185 bfd_boolean dis_header_printed
= FALSE
;
2187 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2191 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2192 || file
->flags
.just_syms
)
2195 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2196 if ((s
->output_section
== NULL
2197 || s
->output_section
->owner
!= link_info
.output_bfd
)
2198 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2200 if (!dis_header_printed
)
2202 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2203 dis_header_printed
= TRUE
;
2206 print_input_section (s
, TRUE
);
2210 minfo (_("\nMemory Configuration\n\n"));
2211 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2212 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2214 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2219 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2221 sprintf_vma (buf
, m
->origin
);
2222 minfo ("0x%s ", buf
);
2230 minfo ("0x%V", m
->length
);
2231 if (m
->flags
|| m
->not_flags
)
2239 lang_map_flags (m
->flags
);
2245 lang_map_flags (m
->not_flags
);
2252 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2254 if (!link_info
.reduce_memory_overheads
)
2256 obstack_begin (&map_obstack
, 1000);
2257 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2259 lang_statement_iteration
++;
2260 print_statements ();
2262 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
,
2267 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2268 void *info ATTRIBUTE_UNUSED
)
2270 if ((hash_entry
->type
== bfd_link_hash_defined
2271 || hash_entry
->type
== bfd_link_hash_defweak
)
2272 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2273 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2275 input_section_userdata_type
*ud
;
2276 struct map_symbol_def
*def
;
2278 ud
= ((input_section_userdata_type
*)
2279 get_userdata (hash_entry
->u
.def
.section
));
2282 ud
= (input_section_userdata_type
*) stat_alloc (sizeof (*ud
));
2283 get_userdata (hash_entry
->u
.def
.section
) = ud
;
2284 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2285 ud
->map_symbol_def_count
= 0;
2287 else if (!ud
->map_symbol_def_tail
)
2288 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2290 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2291 def
->entry
= hash_entry
;
2292 *(ud
->map_symbol_def_tail
) = def
;
2293 ud
->map_symbol_def_tail
= &def
->next
;
2294 ud
->map_symbol_def_count
++;
2299 /* Initialize an output section. */
2302 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2304 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2305 einfo (_("%F%P: illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2307 if (s
->constraint
!= SPECIAL
)
2308 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2309 if (s
->bfd_section
== NULL
)
2310 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2312 if (s
->bfd_section
== NULL
)
2314 einfo (_("%F%P: output format %s cannot represent section"
2315 " called %s: %E\n"),
2316 link_info
.output_bfd
->xvec
->name
, s
->name
);
2318 s
->bfd_section
->output_section
= s
->bfd_section
;
2319 s
->bfd_section
->output_offset
= 0;
2321 /* Set the userdata of the output section to the output section
2322 statement to avoid lookup. */
2323 get_userdata (s
->bfd_section
) = s
;
2325 /* If there is a base address, make sure that any sections it might
2326 mention are initialized. */
2327 if (s
->addr_tree
!= NULL
)
2328 exp_init_os (s
->addr_tree
);
2330 if (s
->load_base
!= NULL
)
2331 exp_init_os (s
->load_base
);
2333 /* If supplied an alignment, set it. */
2334 if (s
->section_alignment
!= NULL
)
2335 s
->bfd_section
->alignment_power
= exp_get_power (s
->section_alignment
,
2336 "section alignment");
2339 /* Make sure that all output sections mentioned in an expression are
2343 exp_init_os (etree_type
*exp
)
2345 switch (exp
->type
.node_class
)
2349 case etree_provided
:
2350 exp_init_os (exp
->assign
.src
);
2354 exp_init_os (exp
->binary
.lhs
);
2355 exp_init_os (exp
->binary
.rhs
);
2359 exp_init_os (exp
->trinary
.cond
);
2360 exp_init_os (exp
->trinary
.lhs
);
2361 exp_init_os (exp
->trinary
.rhs
);
2365 exp_init_os (exp
->assert_s
.child
);
2369 exp_init_os (exp
->unary
.child
);
2373 switch (exp
->type
.node_code
)
2379 lang_output_section_statement_type
*os
;
2381 os
= lang_output_section_find (exp
->name
.name
);
2382 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2394 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2396 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2398 /* If we are only reading symbols from this object, then we want to
2399 discard all sections. */
2400 if (entry
->flags
.just_syms
)
2402 bfd_link_just_syms (abfd
, sec
, &link_info
);
2406 /* Deal with SHF_EXCLUDE ELF sections. */
2407 if (!bfd_link_relocatable (&link_info
)
2408 && (abfd
->flags
& BFD_PLUGIN
) == 0
2409 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2410 sec
->output_section
= bfd_abs_section_ptr
;
2412 if (!(abfd
->flags
& DYNAMIC
))
2413 bfd_section_already_linked (abfd
, sec
, &link_info
);
2417 /* Returns true if SECTION is one we know will be discarded based on its
2418 section flags, otherwise returns false. */
2421 lang_discard_section_p (asection
*section
)
2423 bfd_boolean discard
;
2424 flagword flags
= section
->flags
;
2426 /* Discard sections marked with SEC_EXCLUDE. */
2427 discard
= (flags
& SEC_EXCLUDE
) != 0;
2429 /* Discard the group descriptor sections when we're finally placing the
2430 sections from within the group. */
2431 if ((flags
& SEC_GROUP
) != 0
2432 && link_info
.resolve_section_groups
)
2435 /* Discard debugging sections if we are stripping debugging
2437 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2438 && (flags
& SEC_DEBUGGING
) != 0)
2444 /* The wild routines.
2446 These expand statements like *(.text) and foo.o to a list of
2447 explicit actions, like foo.o(.text), bar.o(.text) and
2448 foo.o(.text, .data). */
2450 /* Add SECTION to the output section OUTPUT. Do this by creating a
2451 lang_input_section statement which is placed at PTR. */
2454 lang_add_section (lang_statement_list_type
*ptr
,
2456 struct flag_info
*sflag_info
,
2457 lang_output_section_statement_type
*output
)
2459 flagword flags
= section
->flags
;
2461 bfd_boolean discard
;
2462 lang_input_section_type
*new_section
;
2463 bfd
*abfd
= link_info
.output_bfd
;
2465 /* Is this section one we know should be discarded? */
2466 discard
= lang_discard_section_p (section
);
2468 /* Discard input sections which are assigned to a section named
2469 DISCARD_SECTION_NAME. */
2470 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2475 if (section
->output_section
== NULL
)
2477 /* This prevents future calls from assigning this section. */
2478 section
->output_section
= bfd_abs_section_ptr
;
2487 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2492 if (section
->output_section
!= NULL
)
2495 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2496 to an output section, because we want to be able to include a
2497 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2498 section (I don't know why we want to do this, but we do).
2499 build_link_order in ldwrite.c handles this case by turning
2500 the embedded SEC_NEVER_LOAD section into a fill. */
2501 flags
&= ~ SEC_NEVER_LOAD
;
2503 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2504 already been processed. One reason to do this is that on pe
2505 format targets, .text$foo sections go into .text and it's odd
2506 to see .text with SEC_LINK_ONCE set. */
2507 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2509 if (link_info
.resolve_section_groups
)
2510 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2512 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2514 else if (!bfd_link_relocatable (&link_info
))
2515 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2517 switch (output
->sectype
)
2519 case normal_section
:
2520 case overlay_section
:
2522 case noalloc_section
:
2523 flags
&= ~SEC_ALLOC
;
2525 case noload_section
:
2527 flags
|= SEC_NEVER_LOAD
;
2528 /* Unfortunately GNU ld has managed to evolve two different
2529 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2530 alloc, no contents section. All others get a noload, noalloc
2532 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2533 flags
&= ~SEC_HAS_CONTENTS
;
2535 flags
&= ~SEC_ALLOC
;
2539 if (output
->bfd_section
== NULL
)
2540 init_os (output
, flags
);
2542 /* If SEC_READONLY is not set in the input section, then clear
2543 it from the output section. */
2544 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2546 if (output
->bfd_section
->linker_has_input
)
2548 /* Only set SEC_READONLY flag on the first input section. */
2549 flags
&= ~ SEC_READONLY
;
2551 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2552 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2553 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2554 || ((flags
& SEC_MERGE
) != 0
2555 && output
->bfd_section
->entsize
!= section
->entsize
))
2557 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2558 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2561 output
->bfd_section
->flags
|= flags
;
2563 if (!output
->bfd_section
->linker_has_input
)
2565 output
->bfd_section
->linker_has_input
= 1;
2566 /* This must happen after flags have been updated. The output
2567 section may have been created before we saw its first input
2568 section, eg. for a data statement. */
2569 bfd_init_private_section_data (section
->owner
, section
,
2570 link_info
.output_bfd
,
2571 output
->bfd_section
,
2573 if ((flags
& SEC_MERGE
) != 0)
2574 output
->bfd_section
->entsize
= section
->entsize
;
2577 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2578 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2580 /* FIXME: This value should really be obtained from the bfd... */
2581 output
->block_value
= 128;
2584 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2585 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2587 section
->output_section
= output
->bfd_section
;
2589 if (!map_head_is_link_order
)
2591 asection
*s
= output
->bfd_section
->map_tail
.s
;
2592 output
->bfd_section
->map_tail
.s
= section
;
2593 section
->map_head
.s
= NULL
;
2594 section
->map_tail
.s
= s
;
2596 s
->map_head
.s
= section
;
2598 output
->bfd_section
->map_head
.s
= section
;
2601 /* Add a section reference to the list. */
2602 new_section
= new_stat (lang_input_section
, ptr
);
2603 new_section
->section
= section
;
2606 /* Handle wildcard sorting. This returns the lang_input_section which
2607 should follow the one we are going to create for SECTION and FILE,
2608 based on the sorting requirements of WILD. It returns NULL if the
2609 new section should just go at the end of the current list. */
2611 static lang_statement_union_type
*
2612 wild_sort (lang_wild_statement_type
*wild
,
2613 struct wildcard_list
*sec
,
2614 lang_input_statement_type
*file
,
2617 lang_statement_union_type
*l
;
2619 if (!wild
->filenames_sorted
2620 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2623 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2625 lang_input_section_type
*ls
;
2627 if (l
->header
.type
!= lang_input_section_enum
)
2629 ls
= &l
->input_section
;
2631 /* Sorting by filename takes precedence over sorting by section
2634 if (wild
->filenames_sorted
)
2636 const char *fn
, *ln
;
2640 /* The PE support for the .idata section as generated by
2641 dlltool assumes that files will be sorted by the name of
2642 the archive and then the name of the file within the
2645 if (file
->the_bfd
!= NULL
2646 && file
->the_bfd
->my_archive
!= NULL
)
2648 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2653 fn
= file
->filename
;
2657 if (ls
->section
->owner
->my_archive
!= NULL
)
2659 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2664 ln
= ls
->section
->owner
->filename
;
2668 i
= filename_cmp (fn
, ln
);
2677 fn
= file
->filename
;
2679 ln
= ls
->section
->owner
->filename
;
2681 i
= filename_cmp (fn
, ln
);
2689 /* Here either the files are not sorted by name, or we are
2690 looking at the sections for this file. */
2693 && sec
->spec
.sorted
!= none
2694 && sec
->spec
.sorted
!= by_none
)
2695 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2702 /* Expand a wild statement for a particular FILE. SECTION may be
2703 NULL, in which case it is a wild card. */
2706 output_section_callback (lang_wild_statement_type
*ptr
,
2707 struct wildcard_list
*sec
,
2709 struct flag_info
*sflag_info
,
2710 lang_input_statement_type
*file
,
2713 lang_statement_union_type
*before
;
2714 lang_output_section_statement_type
*os
;
2716 os
= (lang_output_section_statement_type
*) output
;
2718 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2719 if (unique_section_p (section
, os
))
2722 before
= wild_sort (ptr
, sec
, file
, section
);
2724 /* Here BEFORE points to the lang_input_section which
2725 should follow the one we are about to add. If BEFORE
2726 is NULL, then the section should just go at the end
2727 of the current list. */
2730 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2733 lang_statement_list_type list
;
2734 lang_statement_union_type
**pp
;
2736 lang_list_init (&list
);
2737 lang_add_section (&list
, section
, sflag_info
, os
);
2739 /* If we are discarding the section, LIST.HEAD will
2741 if (list
.head
!= NULL
)
2743 ASSERT (list
.head
->header
.next
== NULL
);
2745 for (pp
= &ptr
->children
.head
;
2747 pp
= &(*pp
)->header
.next
)
2748 ASSERT (*pp
!= NULL
);
2750 list
.head
->header
.next
= *pp
;
2756 /* Check if all sections in a wild statement for a particular FILE
2760 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2761 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2763 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2764 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2767 lang_output_section_statement_type
*os
;
2769 os
= (lang_output_section_statement_type
*) output
;
2771 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2772 if (unique_section_p (section
, os
))
2775 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2776 os
->all_input_readonly
= FALSE
;
2779 /* This is passed a file name which must have been seen already and
2780 added to the statement tree. We will see if it has been opened
2781 already and had its symbols read. If not then we'll read it. */
2783 static lang_input_statement_type
*
2784 lookup_name (const char *name
)
2786 lang_input_statement_type
*search
;
2788 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2790 search
= (lang_input_statement_type
*) search
->next_real_file
)
2792 /* Use the local_sym_name as the name of the file that has
2793 already been loaded as filename might have been transformed
2794 via the search directory lookup mechanism. */
2795 const char *filename
= search
->local_sym_name
;
2797 if (filename
!= NULL
2798 && filename_cmp (filename
, name
) == 0)
2803 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2804 default_target
, FALSE
);
2806 /* If we have already added this file, or this file is not real
2807 don't add this file. */
2808 if (search
->flags
.loaded
|| !search
->flags
.real
)
2811 if (!load_symbols (search
, NULL
))
2817 /* Save LIST as a list of libraries whose symbols should not be exported. */
2822 struct excluded_lib
*next
;
2824 static struct excluded_lib
*excluded_libs
;
2827 add_excluded_libs (const char *list
)
2829 const char *p
= list
, *end
;
2833 struct excluded_lib
*entry
;
2834 end
= strpbrk (p
, ",:");
2836 end
= p
+ strlen (p
);
2837 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2838 entry
->next
= excluded_libs
;
2839 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2840 memcpy (entry
->name
, p
, end
- p
);
2841 entry
->name
[end
- p
] = '\0';
2842 excluded_libs
= entry
;
2850 check_excluded_libs (bfd
*abfd
)
2852 struct excluded_lib
*lib
= excluded_libs
;
2856 int len
= strlen (lib
->name
);
2857 const char *filename
= lbasename (abfd
->filename
);
2859 if (strcmp (lib
->name
, "ALL") == 0)
2861 abfd
->no_export
= TRUE
;
2865 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2866 && (filename
[len
] == '\0'
2867 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2868 && filename
[len
+ 2] == '\0')))
2870 abfd
->no_export
= TRUE
;
2878 /* Get the symbols for an input file. */
2881 load_symbols (lang_input_statement_type
*entry
,
2882 lang_statement_list_type
*place
)
2886 if (entry
->flags
.loaded
)
2889 ldfile_open_file (entry
);
2891 /* Do not process further if the file was missing. */
2892 if (entry
->flags
.missing_file
)
2895 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
2896 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2899 struct lang_input_statement_flags save_flags
;
2902 err
= bfd_get_error ();
2904 /* See if the emulation has some special knowledge. */
2905 if (ldemul_unrecognized_file (entry
))
2908 if (err
== bfd_error_file_ambiguously_recognized
)
2912 einfo (_("%P: %pB: file not recognized: %E;"
2913 " matching formats:"), entry
->the_bfd
);
2914 for (p
= matching
; *p
!= NULL
; p
++)
2918 else if (err
!= bfd_error_file_not_recognized
2920 einfo (_("%F%P: %pB: file not recognized: %E\n"), entry
->the_bfd
);
2922 bfd_close (entry
->the_bfd
);
2923 entry
->the_bfd
= NULL
;
2925 /* Try to interpret the file as a linker script. */
2926 save_flags
= input_flags
;
2927 ldfile_open_command_file (entry
->filename
);
2929 push_stat_ptr (place
);
2930 input_flags
.add_DT_NEEDED_for_regular
2931 = entry
->flags
.add_DT_NEEDED_for_regular
;
2932 input_flags
.add_DT_NEEDED_for_dynamic
2933 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2934 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2935 input_flags
.dynamic
= entry
->flags
.dynamic
;
2937 ldfile_assumed_script
= TRUE
;
2938 parser_input
= input_script
;
2940 ldfile_assumed_script
= FALSE
;
2942 /* missing_file is sticky. sysrooted will already have been
2943 restored when seeing EOF in yyparse, but no harm to restore
2945 save_flags
.missing_file
|= input_flags
.missing_file
;
2946 input_flags
= save_flags
;
2950 entry
->flags
.loaded
= TRUE
;
2955 if (ldemul_recognized_file (entry
))
2958 /* We don't call ldlang_add_file for an archive. Instead, the
2959 add_symbols entry point will call ldlang_add_file, via the
2960 add_archive_element callback, for each element of the archive
2962 switch (bfd_get_format (entry
->the_bfd
))
2968 if (!entry
->flags
.reload
)
2969 ldlang_add_file (entry
);
2970 if (trace_files
|| verbose
)
2971 info_msg ("%pI\n", entry
);
2975 check_excluded_libs (entry
->the_bfd
);
2977 entry
->the_bfd
->usrdata
= entry
;
2978 if (entry
->flags
.whole_archive
)
2981 bfd_boolean loaded
= TRUE
;
2986 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2991 if (!bfd_check_format (member
, bfd_object
))
2993 einfo (_("%F%P: %pB: member %pB in archive is not an object\n"),
2994 entry
->the_bfd
, member
);
2999 if (!(*link_info
.callbacks
3000 ->add_archive_element
) (&link_info
, member
,
3001 "--whole-archive", &subsbfd
))
3004 /* Potentially, the add_archive_element hook may have set a
3005 substitute BFD for us. */
3006 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
3008 einfo (_("%F%P: %pB: error adding symbols: %E\n"), member
);
3013 entry
->flags
.loaded
= loaded
;
3019 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
3020 entry
->flags
.loaded
= TRUE
;
3022 einfo (_("%F%P: %pB: error adding symbols: %E\n"), entry
->the_bfd
);
3024 return entry
->flags
.loaded
;
3027 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
3028 may be NULL, indicating that it is a wildcard. Separate
3029 lang_input_section statements are created for each part of the
3030 expansion; they are added after the wild statement S. OUTPUT is
3031 the output section. */
3034 wild (lang_wild_statement_type
*s
,
3035 const char *target ATTRIBUTE_UNUSED
,
3036 lang_output_section_statement_type
*output
)
3038 struct wildcard_list
*sec
;
3040 if (s
->handler_data
[0]
3041 && s
->handler_data
[0]->spec
.sorted
== by_name
3042 && !s
->filenames_sorted
)
3044 lang_section_bst_type
*tree
;
3046 walk_wild (s
, output_section_callback_fast
, output
);
3051 output_section_callback_tree_to_list (s
, tree
, output
);
3056 walk_wild (s
, output_section_callback
, output
);
3058 if (default_common_section
== NULL
)
3059 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
3060 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
3062 /* Remember the section that common is going to in case we
3063 later get something which doesn't know where to put it. */
3064 default_common_section
= output
;
3069 /* Return TRUE iff target is the sought target. */
3072 get_target (const bfd_target
*target
, void *data
)
3074 const char *sought
= (const char *) data
;
3076 return strcmp (target
->name
, sought
) == 0;
3079 /* Like strcpy() but convert to lower case as well. */
3082 stricpy (char *dest
, char *src
)
3086 while ((c
= *src
++) != 0)
3087 *dest
++ = TOLOWER (c
);
3092 /* Remove the first occurrence of needle (if any) in haystack
3096 strcut (char *haystack
, char *needle
)
3098 haystack
= strstr (haystack
, needle
);
3104 for (src
= haystack
+ strlen (needle
); *src
;)
3105 *haystack
++ = *src
++;
3111 /* Compare two target format name strings.
3112 Return a value indicating how "similar" they are. */
3115 name_compare (char *first
, char *second
)
3121 copy1
= (char *) xmalloc (strlen (first
) + 1);
3122 copy2
= (char *) xmalloc (strlen (second
) + 1);
3124 /* Convert the names to lower case. */
3125 stricpy (copy1
, first
);
3126 stricpy (copy2
, second
);
3128 /* Remove size and endian strings from the name. */
3129 strcut (copy1
, "big");
3130 strcut (copy1
, "little");
3131 strcut (copy2
, "big");
3132 strcut (copy2
, "little");
3134 /* Return a value based on how many characters match,
3135 starting from the beginning. If both strings are
3136 the same then return 10 * their length. */
3137 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3138 if (copy1
[result
] == 0)
3150 /* Set by closest_target_match() below. */
3151 static const bfd_target
*winner
;
3153 /* Scan all the valid bfd targets looking for one that has the endianness
3154 requirement that was specified on the command line, and is the nearest
3155 match to the original output target. */
3158 closest_target_match (const bfd_target
*target
, void *data
)
3160 const bfd_target
*original
= (const bfd_target
*) data
;
3162 if (command_line
.endian
== ENDIAN_BIG
3163 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3166 if (command_line
.endian
== ENDIAN_LITTLE
3167 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3170 /* Must be the same flavour. */
3171 if (target
->flavour
!= original
->flavour
)
3174 /* Ignore generic big and little endian elf vectors. */
3175 if (strcmp (target
->name
, "elf32-big") == 0
3176 || strcmp (target
->name
, "elf64-big") == 0
3177 || strcmp (target
->name
, "elf32-little") == 0
3178 || strcmp (target
->name
, "elf64-little") == 0)
3181 /* If we have not found a potential winner yet, then record this one. */
3188 /* Oh dear, we now have two potential candidates for a successful match.
3189 Compare their names and choose the better one. */
3190 if (name_compare (target
->name
, original
->name
)
3191 > name_compare (winner
->name
, original
->name
))
3194 /* Keep on searching until wqe have checked them all. */
3198 /* Return the BFD target format of the first input file. */
3201 get_first_input_target (void)
3203 char *target
= NULL
;
3205 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3207 if (s
->header
.type
== lang_input_statement_enum
3210 ldfile_open_file (s
);
3212 if (s
->the_bfd
!= NULL
3213 && bfd_check_format (s
->the_bfd
, bfd_object
))
3215 target
= bfd_get_target (s
->the_bfd
);
3227 lang_get_output_target (void)
3231 /* Has the user told us which output format to use? */
3232 if (output_target
!= NULL
)
3233 return output_target
;
3235 /* No - has the current target been set to something other than
3237 if (current_target
!= default_target
&& current_target
!= NULL
)
3238 return current_target
;
3240 /* No - can we determine the format of the first input file? */
3241 target
= get_first_input_target ();
3245 /* Failed - use the default output target. */
3246 return default_target
;
3249 /* Open the output file. */
3252 open_output (const char *name
)
3254 output_target
= lang_get_output_target ();
3256 /* Has the user requested a particular endianness on the command
3258 if (command_line
.endian
!= ENDIAN_UNSET
)
3260 /* Get the chosen target. */
3261 const bfd_target
*target
3262 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3264 /* If the target is not supported, we cannot do anything. */
3267 enum bfd_endian desired_endian
;
3269 if (command_line
.endian
== ENDIAN_BIG
)
3270 desired_endian
= BFD_ENDIAN_BIG
;
3272 desired_endian
= BFD_ENDIAN_LITTLE
;
3274 /* See if the target has the wrong endianness. This should
3275 not happen if the linker script has provided big and
3276 little endian alternatives, but some scrips don't do
3278 if (target
->byteorder
!= desired_endian
)
3280 /* If it does, then see if the target provides
3281 an alternative with the correct endianness. */
3282 if (target
->alternative_target
!= NULL
3283 && (target
->alternative_target
->byteorder
== desired_endian
))
3284 output_target
= target
->alternative_target
->name
;
3287 /* Try to find a target as similar as possible to
3288 the default target, but which has the desired
3289 endian characteristic. */
3290 bfd_iterate_over_targets (closest_target_match
,
3293 /* Oh dear - we could not find any targets that
3294 satisfy our requirements. */
3296 einfo (_("%P: warning: could not find any targets"
3297 " that match endianness requirement\n"));
3299 output_target
= winner
->name
;
3305 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3307 if (link_info
.output_bfd
== NULL
)
3309 if (bfd_get_error () == bfd_error_invalid_target
)
3310 einfo (_("%F%P: target %s not found\n"), output_target
);
3312 einfo (_("%F%P: cannot open output file %s: %E\n"), name
);
3315 delete_output_file_on_failure
= TRUE
;
3317 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3318 einfo (_("%F%P: %s: can not make object file: %E\n"), name
);
3319 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3320 ldfile_output_architecture
,
3321 ldfile_output_machine
))
3322 einfo (_("%F%P: %s: can not set architecture: %E\n"), name
);
3324 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3325 if (link_info
.hash
== NULL
)
3326 einfo (_("%F%P: can not create hash table: %E\n"));
3328 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3332 ldlang_open_output (lang_statement_union_type
*statement
)
3334 switch (statement
->header
.type
)
3336 case lang_output_statement_enum
:
3337 ASSERT (link_info
.output_bfd
== NULL
);
3338 open_output (statement
->output_statement
.name
);
3339 ldemul_set_output_arch ();
3340 if (config
.magic_demand_paged
3341 && !bfd_link_relocatable (&link_info
))
3342 link_info
.output_bfd
->flags
|= D_PAGED
;
3344 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3345 if (config
.text_read_only
)
3346 link_info
.output_bfd
->flags
|= WP_TEXT
;
3348 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3349 if (link_info
.traditional_format
)
3350 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3352 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3355 case lang_target_statement_enum
:
3356 current_target
= statement
->target_statement
.target
;
3366 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3367 ldfile_output_machine
);
3370 while ((x
& 1) == 0)
3378 /* Open all the input files. */
3382 OPEN_BFD_NORMAL
= 0,
3386 #ifdef ENABLE_PLUGINS
3387 static lang_input_statement_type
*plugin_insert
= NULL
;
3391 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3393 for (; s
!= NULL
; s
= s
->header
.next
)
3395 switch (s
->header
.type
)
3397 case lang_constructors_statement_enum
:
3398 open_input_bfds (constructor_list
.head
, mode
);
3400 case lang_output_section_statement_enum
:
3401 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3403 case lang_wild_statement_enum
:
3404 /* Maybe we should load the file's symbols. */
3405 if ((mode
& OPEN_BFD_RESCAN
) == 0
3406 && s
->wild_statement
.filename
3407 && !wildcardp (s
->wild_statement
.filename
)
3408 && !archive_path (s
->wild_statement
.filename
))
3409 lookup_name (s
->wild_statement
.filename
);
3410 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3412 case lang_group_statement_enum
:
3414 struct bfd_link_hash_entry
*undefs
;
3416 /* We must continually search the entries in the group
3417 until no new symbols are added to the list of undefined
3422 undefs
= link_info
.hash
->undefs_tail
;
3423 open_input_bfds (s
->group_statement
.children
.head
,
3424 mode
| OPEN_BFD_FORCE
);
3426 while (undefs
!= link_info
.hash
->undefs_tail
);
3429 case lang_target_statement_enum
:
3430 current_target
= s
->target_statement
.target
;
3432 case lang_input_statement_enum
:
3433 if (s
->input_statement
.flags
.real
)
3435 lang_statement_union_type
**os_tail
;
3436 lang_statement_list_type add
;
3439 s
->input_statement
.target
= current_target
;
3441 /* If we are being called from within a group, and this
3442 is an archive which has already been searched, then
3443 force it to be researched unless the whole archive
3444 has been loaded already. Do the same for a rescan.
3445 Likewise reload --as-needed shared libs. */
3446 if (mode
!= OPEN_BFD_NORMAL
3447 #ifdef ENABLE_PLUGINS
3448 && ((mode
& OPEN_BFD_RESCAN
) == 0
3449 || plugin_insert
== NULL
)
3451 && s
->input_statement
.flags
.loaded
3452 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3453 && ((bfd_get_format (abfd
) == bfd_archive
3454 && !s
->input_statement
.flags
.whole_archive
)
3455 || (bfd_get_format (abfd
) == bfd_object
3456 && ((abfd
->flags
) & DYNAMIC
) != 0
3457 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3458 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3459 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3461 s
->input_statement
.flags
.loaded
= FALSE
;
3462 s
->input_statement
.flags
.reload
= TRUE
;
3465 os_tail
= lang_output_section_statement
.tail
;
3466 lang_list_init (&add
);
3468 if (!load_symbols (&s
->input_statement
, &add
))
3469 config
.make_executable
= FALSE
;
3471 if (add
.head
!= NULL
)
3473 /* If this was a script with output sections then
3474 tack any added statements on to the end of the
3475 list. This avoids having to reorder the output
3476 section statement list. Very likely the user
3477 forgot -T, and whatever we do here will not meet
3478 naive user expectations. */
3479 if (os_tail
!= lang_output_section_statement
.tail
)
3481 einfo (_("%P: warning: %s contains output sections;"
3482 " did you forget -T?\n"),
3483 s
->input_statement
.filename
);
3484 *stat_ptr
->tail
= add
.head
;
3485 stat_ptr
->tail
= add
.tail
;
3489 *add
.tail
= s
->header
.next
;
3490 s
->header
.next
= add
.head
;
3494 #ifdef ENABLE_PLUGINS
3495 /* If we have found the point at which a plugin added new
3496 files, clear plugin_insert to enable archive rescan. */
3497 if (&s
->input_statement
== plugin_insert
)
3498 plugin_insert
= NULL
;
3501 case lang_assignment_statement_enum
:
3502 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
)
3503 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3510 /* Exit if any of the files were missing. */
3511 if (input_flags
.missing_file
)
3515 /* Add the supplied name to the symbol table as an undefined reference.
3516 This is a two step process as the symbol table doesn't even exist at
3517 the time the ld command line is processed. First we put the name
3518 on a list, then, once the output file has been opened, transfer the
3519 name to the symbol table. */
3521 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3523 #define ldlang_undef_chain_list_head entry_symbol.next
3526 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3528 ldlang_undef_chain_list_type
*new_undef
;
3530 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3531 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3532 new_undef
->next
= ldlang_undef_chain_list_head
;
3533 ldlang_undef_chain_list_head
= new_undef
;
3535 new_undef
->name
= xstrdup (name
);
3537 if (link_info
.output_bfd
!= NULL
)
3538 insert_undefined (new_undef
->name
);
3541 /* Insert NAME as undefined in the symbol table. */
3544 insert_undefined (const char *name
)
3546 struct bfd_link_hash_entry
*h
;
3548 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3550 einfo (_("%F%P: bfd_link_hash_lookup failed: %E\n"));
3551 if (h
->type
== bfd_link_hash_new
)
3553 h
->type
= bfd_link_hash_undefined
;
3554 h
->u
.undef
.abfd
= NULL
;
3555 h
->non_ir_ref_regular
= TRUE
;
3556 if (is_elf_hash_table (link_info
.hash
))
3557 ((struct elf_link_hash_entry
*) h
)->mark
= 1;
3558 bfd_link_add_undef (link_info
.hash
, h
);
3562 /* Run through the list of undefineds created above and place them
3563 into the linker hash table as undefined symbols belonging to the
3567 lang_place_undefineds (void)
3569 ldlang_undef_chain_list_type
*ptr
;
3571 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3572 insert_undefined (ptr
->name
);
3575 /* Structure used to build the list of symbols that the user has required
3578 struct require_defined_symbol
3581 struct require_defined_symbol
*next
;
3584 /* The list of symbols that the user has required be defined. */
3586 static struct require_defined_symbol
*require_defined_symbol_list
;
3588 /* Add a new symbol NAME to the list of symbols that are required to be
3592 ldlang_add_require_defined (const char *const name
)
3594 struct require_defined_symbol
*ptr
;
3596 ldlang_add_undef (name
, TRUE
);
3597 ptr
= (struct require_defined_symbol
*) stat_alloc (sizeof (*ptr
));
3598 ptr
->next
= require_defined_symbol_list
;
3599 ptr
->name
= strdup (name
);
3600 require_defined_symbol_list
= ptr
;
3603 /* Check that all symbols the user required to be defined, are defined,
3604 raise an error if we find a symbol that is not defined. */
3607 ldlang_check_require_defined_symbols (void)
3609 struct require_defined_symbol
*ptr
;
3611 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
3613 struct bfd_link_hash_entry
*h
;
3615 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
3616 FALSE
, FALSE
, TRUE
);
3618 || (h
->type
!= bfd_link_hash_defined
3619 && h
->type
!= bfd_link_hash_defweak
))
3620 einfo(_("%X%P: required symbol `%s' not defined\n"), ptr
->name
);
3624 /* Check for all readonly or some readwrite sections. */
3627 check_input_sections
3628 (lang_statement_union_type
*s
,
3629 lang_output_section_statement_type
*output_section_statement
)
3631 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3633 switch (s
->header
.type
)
3635 case lang_wild_statement_enum
:
3636 walk_wild (&s
->wild_statement
, check_section_callback
,
3637 output_section_statement
);
3638 if (!output_section_statement
->all_input_readonly
)
3641 case lang_constructors_statement_enum
:
3642 check_input_sections (constructor_list
.head
,
3643 output_section_statement
);
3644 if (!output_section_statement
->all_input_readonly
)
3647 case lang_group_statement_enum
:
3648 check_input_sections (s
->group_statement
.children
.head
,
3649 output_section_statement
);
3650 if (!output_section_statement
->all_input_readonly
)
3659 /* Update wildcard statements if needed. */
3662 update_wild_statements (lang_statement_union_type
*s
)
3664 struct wildcard_list
*sec
;
3666 switch (sort_section
)
3676 for (; s
!= NULL
; s
= s
->header
.next
)
3678 switch (s
->header
.type
)
3683 case lang_wild_statement_enum
:
3684 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3687 switch (sec
->spec
.sorted
)
3690 sec
->spec
.sorted
= sort_section
;
3693 if (sort_section
== by_alignment
)
3694 sec
->spec
.sorted
= by_name_alignment
;
3697 if (sort_section
== by_name
)
3698 sec
->spec
.sorted
= by_alignment_name
;
3706 case lang_constructors_statement_enum
:
3707 update_wild_statements (constructor_list
.head
);
3710 case lang_output_section_statement_enum
:
3711 /* Don't sort .init/.fini sections. */
3712 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3713 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3714 update_wild_statements
3715 (s
->output_section_statement
.children
.head
);
3718 case lang_group_statement_enum
:
3719 update_wild_statements (s
->group_statement
.children
.head
);
3727 /* Open input files and attach to output sections. */
3730 map_input_to_output_sections
3731 (lang_statement_union_type
*s
, const char *target
,
3732 lang_output_section_statement_type
*os
)
3734 for (; s
!= NULL
; s
= s
->header
.next
)
3736 lang_output_section_statement_type
*tos
;
3739 switch (s
->header
.type
)
3741 case lang_wild_statement_enum
:
3742 wild (&s
->wild_statement
, target
, os
);
3744 case lang_constructors_statement_enum
:
3745 map_input_to_output_sections (constructor_list
.head
,
3749 case lang_output_section_statement_enum
:
3750 tos
= &s
->output_section_statement
;
3751 if (tos
->constraint
!= 0)
3753 if (tos
->constraint
!= ONLY_IF_RW
3754 && tos
->constraint
!= ONLY_IF_RO
)
3756 tos
->all_input_readonly
= TRUE
;
3757 check_input_sections (tos
->children
.head
, tos
);
3758 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3760 tos
->constraint
= -1;
3764 map_input_to_output_sections (tos
->children
.head
,
3768 case lang_output_statement_enum
:
3770 case lang_target_statement_enum
:
3771 target
= s
->target_statement
.target
;
3773 case lang_group_statement_enum
:
3774 map_input_to_output_sections (s
->group_statement
.children
.head
,
3778 case lang_data_statement_enum
:
3779 /* Make sure that any sections mentioned in the expression
3781 exp_init_os (s
->data_statement
.exp
);
3782 /* The output section gets CONTENTS, ALLOC and LOAD, but
3783 these may be overridden by the script. */
3784 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3785 switch (os
->sectype
)
3787 case normal_section
:
3788 case overlay_section
:
3790 case noalloc_section
:
3791 flags
= SEC_HAS_CONTENTS
;
3793 case noload_section
:
3794 if (bfd_get_flavour (link_info
.output_bfd
)
3795 == bfd_target_elf_flavour
)
3796 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3798 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3801 if (os
->bfd_section
== NULL
)
3802 init_os (os
, flags
);
3804 os
->bfd_section
->flags
|= flags
;
3806 case lang_input_section_enum
:
3808 case lang_fill_statement_enum
:
3809 case lang_object_symbols_statement_enum
:
3810 case lang_reloc_statement_enum
:
3811 case lang_padding_statement_enum
:
3812 case lang_input_statement_enum
:
3813 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3816 case lang_assignment_statement_enum
:
3817 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3820 /* Make sure that any sections mentioned in the assignment
3822 exp_init_os (s
->assignment_statement
.exp
);
3824 case lang_address_statement_enum
:
3825 /* Mark the specified section with the supplied address.
3826 If this section was actually a segment marker, then the
3827 directive is ignored if the linker script explicitly
3828 processed the segment marker. Originally, the linker
3829 treated segment directives (like -Ttext on the
3830 command-line) as section directives. We honor the
3831 section directive semantics for backwards compatibility;
3832 linker scripts that do not specifically check for
3833 SEGMENT_START automatically get the old semantics. */
3834 if (!s
->address_statement
.segment
3835 || !s
->address_statement
.segment
->used
)
3837 const char *name
= s
->address_statement
.section_name
;
3839 /* Create the output section statement here so that
3840 orphans with a set address will be placed after other
3841 script sections. If we let the orphan placement code
3842 place them in amongst other sections then the address
3843 will affect following script sections, which is
3844 likely to surprise naive users. */
3845 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3846 tos
->addr_tree
= s
->address_statement
.address
;
3847 if (tos
->bfd_section
== NULL
)
3851 case lang_insert_statement_enum
:
3857 /* An insert statement snips out all the linker statements from the
3858 start of the list and places them after the output section
3859 statement specified by the insert. This operation is complicated
3860 by the fact that we keep a doubly linked list of output section
3861 statements as well as the singly linked list of all statements. */
3864 process_insert_statements (void)
3866 lang_statement_union_type
**s
;
3867 lang_output_section_statement_type
*first_os
= NULL
;
3868 lang_output_section_statement_type
*last_os
= NULL
;
3869 lang_output_section_statement_type
*os
;
3871 /* "start of list" is actually the statement immediately after
3872 the special abs_section output statement, so that it isn't
3874 s
= &lang_output_section_statement
.head
;
3875 while (*(s
= &(*s
)->header
.next
) != NULL
)
3877 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3879 /* Keep pointers to the first and last output section
3880 statement in the sequence we may be about to move. */
3881 os
= &(*s
)->output_section_statement
;
3883 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3886 /* Set constraint negative so that lang_output_section_find
3887 won't match this output section statement. At this
3888 stage in linking constraint has values in the range
3889 [-1, ONLY_IN_RW]. */
3890 last_os
->constraint
= -2 - last_os
->constraint
;
3891 if (first_os
== NULL
)
3894 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3896 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3897 lang_output_section_statement_type
*where
;
3898 lang_statement_union_type
**ptr
;
3899 lang_statement_union_type
*first
;
3901 where
= lang_output_section_find (i
->where
);
3902 if (where
!= NULL
&& i
->is_before
)
3905 where
= where
->prev
;
3906 while (where
!= NULL
&& where
->constraint
< 0);
3910 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3914 /* Deal with reordering the output section statement list. */
3915 if (last_os
!= NULL
)
3917 asection
*first_sec
, *last_sec
;
3918 struct lang_output_section_statement_struct
**next
;
3920 /* Snip out the output sections we are moving. */
3921 first_os
->prev
->next
= last_os
->next
;
3922 if (last_os
->next
== NULL
)
3924 next
= &first_os
->prev
->next
;
3925 lang_output_section_statement
.tail
3926 = (lang_statement_union_type
**) next
;
3929 last_os
->next
->prev
= first_os
->prev
;
3930 /* Add them in at the new position. */
3931 last_os
->next
= where
->next
;
3932 if (where
->next
== NULL
)
3934 next
= &last_os
->next
;
3935 lang_output_section_statement
.tail
3936 = (lang_statement_union_type
**) next
;
3939 where
->next
->prev
= last_os
;
3940 first_os
->prev
= where
;
3941 where
->next
= first_os
;
3943 /* Move the bfd sections in the same way. */
3946 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3948 os
->constraint
= -2 - os
->constraint
;
3949 if (os
->bfd_section
!= NULL
3950 && os
->bfd_section
->owner
!= NULL
)
3952 last_sec
= os
->bfd_section
;
3953 if (first_sec
== NULL
)
3954 first_sec
= last_sec
;
3959 if (last_sec
!= NULL
)
3961 asection
*sec
= where
->bfd_section
;
3963 sec
= output_prev_sec_find (where
);
3965 /* The place we want to insert must come after the
3966 sections we are moving. So if we find no
3967 section or if the section is the same as our
3968 last section, then no move is needed. */
3969 if (sec
!= NULL
&& sec
!= last_sec
)
3971 /* Trim them off. */
3972 if (first_sec
->prev
!= NULL
)
3973 first_sec
->prev
->next
= last_sec
->next
;
3975 link_info
.output_bfd
->sections
= last_sec
->next
;
3976 if (last_sec
->next
!= NULL
)
3977 last_sec
->next
->prev
= first_sec
->prev
;
3979 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3981 last_sec
->next
= sec
->next
;
3982 if (sec
->next
!= NULL
)
3983 sec
->next
->prev
= last_sec
;
3985 link_info
.output_bfd
->section_last
= last_sec
;
3986 first_sec
->prev
= sec
;
3987 sec
->next
= first_sec
;
3995 ptr
= insert_os_after (where
);
3996 /* Snip everything after the abs_section output statement we
3997 know is at the start of the list, up to and including
3998 the insert statement we are currently processing. */
3999 first
= lang_output_section_statement
.head
->header
.next
;
4000 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
4001 /* Add them back where they belong. */
4004 statement_list
.tail
= s
;
4006 s
= &lang_output_section_statement
.head
;
4010 /* Undo constraint twiddling. */
4011 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
4013 os
->constraint
= -2 - os
->constraint
;
4019 /* An output section might have been removed after its statement was
4020 added. For example, ldemul_before_allocation can remove dynamic
4021 sections if they turn out to be not needed. Clean them up here. */
4024 strip_excluded_output_sections (void)
4026 lang_output_section_statement_type
*os
;
4028 /* Run lang_size_sections (if not already done). */
4029 if (expld
.phase
!= lang_mark_phase_enum
)
4031 expld
.phase
= lang_mark_phase_enum
;
4032 expld
.dataseg
.phase
= exp_seg_none
;
4033 one_lang_size_sections_pass (NULL
, FALSE
);
4034 lang_reset_memory_regions ();
4037 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
4041 asection
*output_section
;
4042 bfd_boolean exclude
;
4044 if (os
->constraint
< 0)
4047 output_section
= os
->bfd_section
;
4048 if (output_section
== NULL
)
4051 exclude
= (output_section
->rawsize
== 0
4052 && (output_section
->flags
& SEC_KEEP
) == 0
4053 && !bfd_section_removed_from_list (link_info
.output_bfd
,
4056 /* Some sections have not yet been sized, notably .gnu.version,
4057 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
4058 input sections, so don't drop output sections that have such
4059 input sections unless they are also marked SEC_EXCLUDE. */
4060 if (exclude
&& output_section
->map_head
.s
!= NULL
)
4064 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
4065 if ((s
->flags
& SEC_EXCLUDE
) == 0
4066 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
4067 || link_info
.emitrelocations
))
4076 /* We don't set bfd_section to NULL since bfd_section of the
4077 removed output section statement may still be used. */
4078 if (!os
->update_dot
)
4080 output_section
->flags
|= SEC_EXCLUDE
;
4081 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
4082 link_info
.output_bfd
->section_count
--;
4087 /* Called from ldwrite to clear out asection.map_head and
4088 asection.map_tail for use as link_orders in ldwrite. */
4091 lang_clear_os_map (void)
4093 lang_output_section_statement_type
*os
;
4095 if (map_head_is_link_order
)
4098 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
4102 asection
*output_section
;
4104 if (os
->constraint
< 0)
4107 output_section
= os
->bfd_section
;
4108 if (output_section
== NULL
)
4111 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
4112 output_section
->map_head
.link_order
= NULL
;
4113 output_section
->map_tail
.link_order
= NULL
;
4116 /* Stop future calls to lang_add_section from messing with map_head
4117 and map_tail link_order fields. */
4118 map_head_is_link_order
= TRUE
;
4122 print_output_section_statement
4123 (lang_output_section_statement_type
*output_section_statement
)
4125 asection
*section
= output_section_statement
->bfd_section
;
4128 if (output_section_statement
!= abs_output_section
)
4130 minfo ("\n%s", output_section_statement
->name
);
4132 if (section
!= NULL
)
4134 print_dot
= section
->vma
;
4136 len
= strlen (output_section_statement
->name
);
4137 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4142 while (len
< SECTION_NAME_MAP_LENGTH
)
4148 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4150 if (section
->vma
!= section
->lma
)
4151 minfo (_(" load address 0x%V"), section
->lma
);
4153 if (output_section_statement
->update_dot_tree
!= NULL
)
4154 exp_fold_tree (output_section_statement
->update_dot_tree
,
4155 bfd_abs_section_ptr
, &print_dot
);
4161 print_statement_list (output_section_statement
->children
.head
,
4162 output_section_statement
);
4166 print_assignment (lang_assignment_statement_type
*assignment
,
4167 lang_output_section_statement_type
*output_section
)
4174 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4177 if (assignment
->exp
->type
.node_class
== etree_assert
)
4180 tree
= assignment
->exp
->assert_s
.child
;
4184 const char *dst
= assignment
->exp
->assign
.dst
;
4186 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4188 expld
.assign_name
= dst
;
4189 tree
= assignment
->exp
->assign
.src
;
4192 osec
= output_section
->bfd_section
;
4194 osec
= bfd_abs_section_ptr
;
4196 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4197 exp_fold_tree (tree
, osec
, &print_dot
);
4199 expld
.result
.valid_p
= FALSE
;
4201 if (expld
.result
.valid_p
)
4205 if (assignment
->exp
->type
.node_class
== etree_assert
4207 || expld
.assign_name
!= NULL
)
4209 value
= expld
.result
.value
;
4211 if (expld
.result
.section
!= NULL
)
4212 value
+= expld
.result
.section
->vma
;
4214 minfo ("0x%V", value
);
4220 struct bfd_link_hash_entry
*h
;
4222 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4223 FALSE
, FALSE
, TRUE
);
4226 value
= h
->u
.def
.value
;
4227 value
+= h
->u
.def
.section
->output_section
->vma
;
4228 value
+= h
->u
.def
.section
->output_offset
;
4230 minfo ("[0x%V]", value
);
4233 minfo ("[unresolved]");
4238 if (assignment
->exp
->type
.node_class
== etree_provide
)
4239 minfo ("[!provide]");
4246 expld
.assign_name
= NULL
;
4249 exp_print_tree (assignment
->exp
);
4254 print_input_statement (lang_input_statement_type
*statm
)
4256 if (statm
->filename
!= NULL
4257 && (statm
->the_bfd
== NULL
4258 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4259 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4262 /* Print all symbols defined in a particular section. This is called
4263 via bfd_link_hash_traverse, or by print_all_symbols. */
4266 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4268 asection
*sec
= (asection
*) ptr
;
4270 if ((hash_entry
->type
== bfd_link_hash_defined
4271 || hash_entry
->type
== bfd_link_hash_defweak
)
4272 && sec
== hash_entry
->u
.def
.section
)
4276 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4279 (hash_entry
->u
.def
.value
4280 + hash_entry
->u
.def
.section
->output_offset
4281 + hash_entry
->u
.def
.section
->output_section
->vma
));
4283 minfo (" %pT\n", hash_entry
->root
.string
);
4290 hash_entry_addr_cmp (const void *a
, const void *b
)
4292 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4293 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4295 if (l
->u
.def
.value
< r
->u
.def
.value
)
4297 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4304 print_all_symbols (asection
*sec
)
4306 input_section_userdata_type
*ud
4307 = (input_section_userdata_type
*) get_userdata (sec
);
4308 struct map_symbol_def
*def
;
4309 struct bfd_link_hash_entry
**entries
;
4315 *ud
->map_symbol_def_tail
= 0;
4317 /* Sort the symbols by address. */
4318 entries
= (struct bfd_link_hash_entry
**)
4319 obstack_alloc (&map_obstack
,
4320 ud
->map_symbol_def_count
* sizeof (*entries
));
4322 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4323 entries
[i
] = def
->entry
;
4325 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4326 hash_entry_addr_cmp
);
4328 /* Print the symbols. */
4329 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4330 print_one_symbol (entries
[i
], sec
);
4332 obstack_free (&map_obstack
, entries
);
4335 /* Print information about an input section to the map file. */
4338 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4340 bfd_size_type size
= i
->size
;
4347 minfo ("%s", i
->name
);
4349 len
= 1 + strlen (i
->name
);
4350 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4355 while (len
< SECTION_NAME_MAP_LENGTH
)
4361 if (i
->output_section
!= NULL
4362 && i
->output_section
->owner
== link_info
.output_bfd
)
4363 addr
= i
->output_section
->vma
+ i
->output_offset
;
4371 minfo ("0x%V %W %pB\n", addr
, size
, i
->owner
);
4373 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4375 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4387 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4390 if (i
->output_section
!= NULL
4391 && i
->output_section
->owner
== link_info
.output_bfd
)
4393 if (link_info
.reduce_memory_overheads
)
4394 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4396 print_all_symbols (i
);
4398 /* Update print_dot, but make sure that we do not move it
4399 backwards - this could happen if we have overlays and a
4400 later overlay is shorter than an earier one. */
4401 if (addr
+ TO_ADDR (size
) > print_dot
)
4402 print_dot
= addr
+ TO_ADDR (size
);
4407 print_fill_statement (lang_fill_statement_type
*fill
)
4411 fputs (" FILL mask 0x", config
.map_file
);
4412 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4413 fprintf (config
.map_file
, "%02x", *p
);
4414 fputs ("\n", config
.map_file
);
4418 print_data_statement (lang_data_statement_type
*data
)
4426 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4429 addr
= data
->output_offset
;
4430 if (data
->output_section
!= NULL
)
4431 addr
+= data
->output_section
->vma
;
4459 if (size
< TO_SIZE ((unsigned) 1))
4460 size
= TO_SIZE ((unsigned) 1);
4461 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4463 if (data
->exp
->type
.node_class
!= etree_value
)
4466 exp_print_tree (data
->exp
);
4471 print_dot
= addr
+ TO_ADDR (size
);
4474 /* Print an address statement. These are generated by options like
4478 print_address_statement (lang_address_statement_type
*address
)
4480 minfo (_("Address of section %s set to "), address
->section_name
);
4481 exp_print_tree (address
->address
);
4485 /* Print a reloc statement. */
4488 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4495 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4498 addr
= reloc
->output_offset
;
4499 if (reloc
->output_section
!= NULL
)
4500 addr
+= reloc
->output_section
->vma
;
4502 size
= bfd_get_reloc_size (reloc
->howto
);
4504 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4506 if (reloc
->name
!= NULL
)
4507 minfo ("%s+", reloc
->name
);
4509 minfo ("%s+", reloc
->section
->name
);
4511 exp_print_tree (reloc
->addend_exp
);
4515 print_dot
= addr
+ TO_ADDR (size
);
4519 print_padding_statement (lang_padding_statement_type
*s
)
4527 len
= sizeof " *fill*" - 1;
4528 while (len
< SECTION_NAME_MAP_LENGTH
)
4534 addr
= s
->output_offset
;
4535 if (s
->output_section
!= NULL
)
4536 addr
+= s
->output_section
->vma
;
4537 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4539 if (s
->fill
->size
!= 0)
4543 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4544 fprintf (config
.map_file
, "%02x", *p
);
4549 print_dot
= addr
+ TO_ADDR (s
->size
);
4553 print_wild_statement (lang_wild_statement_type
*w
,
4554 lang_output_section_statement_type
*os
)
4556 struct wildcard_list
*sec
;
4560 if (w
->exclude_name_list
)
4563 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
4564 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4565 minfo (" %s", tmp
->name
);
4569 if (w
->filenames_sorted
)
4570 minfo ("SORT_BY_NAME(");
4571 if (w
->filename
!= NULL
)
4572 minfo ("%s", w
->filename
);
4575 if (w
->filenames_sorted
)
4579 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4581 int closing_paren
= 0;
4583 switch (sec
->spec
.sorted
)
4589 minfo ("SORT_BY_NAME(");
4594 minfo ("SORT_BY_ALIGNMENT(");
4598 case by_name_alignment
:
4599 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
4603 case by_alignment_name
:
4604 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
4609 minfo ("SORT_NONE(");
4613 case by_init_priority
:
4614 minfo ("SORT_BY_INIT_PRIORITY(");
4619 if (sec
->spec
.exclude_name_list
!= NULL
)
4622 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4623 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4624 minfo (" %s", tmp
->name
);
4627 if (sec
->spec
.name
!= NULL
)
4628 minfo ("%s", sec
->spec
.name
);
4631 for (;closing_paren
> 0; closing_paren
--)
4640 print_statement_list (w
->children
.head
, os
);
4643 /* Print a group statement. */
4646 print_group (lang_group_statement_type
*s
,
4647 lang_output_section_statement_type
*os
)
4649 fprintf (config
.map_file
, "START GROUP\n");
4650 print_statement_list (s
->children
.head
, os
);
4651 fprintf (config
.map_file
, "END GROUP\n");
4654 /* Print the list of statements in S.
4655 This can be called for any statement type. */
4658 print_statement_list (lang_statement_union_type
*s
,
4659 lang_output_section_statement_type
*os
)
4663 print_statement (s
, os
);
4668 /* Print the first statement in statement list S.
4669 This can be called for any statement type. */
4672 print_statement (lang_statement_union_type
*s
,
4673 lang_output_section_statement_type
*os
)
4675 switch (s
->header
.type
)
4678 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4681 case lang_constructors_statement_enum
:
4682 if (constructor_list
.head
!= NULL
)
4684 if (constructors_sorted
)
4685 minfo (" SORT (CONSTRUCTORS)\n");
4687 minfo (" CONSTRUCTORS\n");
4688 print_statement_list (constructor_list
.head
, os
);
4691 case lang_wild_statement_enum
:
4692 print_wild_statement (&s
->wild_statement
, os
);
4694 case lang_address_statement_enum
:
4695 print_address_statement (&s
->address_statement
);
4697 case lang_object_symbols_statement_enum
:
4698 minfo (" CREATE_OBJECT_SYMBOLS\n");
4700 case lang_fill_statement_enum
:
4701 print_fill_statement (&s
->fill_statement
);
4703 case lang_data_statement_enum
:
4704 print_data_statement (&s
->data_statement
);
4706 case lang_reloc_statement_enum
:
4707 print_reloc_statement (&s
->reloc_statement
);
4709 case lang_input_section_enum
:
4710 print_input_section (s
->input_section
.section
, FALSE
);
4712 case lang_padding_statement_enum
:
4713 print_padding_statement (&s
->padding_statement
);
4715 case lang_output_section_statement_enum
:
4716 print_output_section_statement (&s
->output_section_statement
);
4718 case lang_assignment_statement_enum
:
4719 print_assignment (&s
->assignment_statement
, os
);
4721 case lang_target_statement_enum
:
4722 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4724 case lang_output_statement_enum
:
4725 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4726 if (output_target
!= NULL
)
4727 minfo (" %s", output_target
);
4730 case lang_input_statement_enum
:
4731 print_input_statement (&s
->input_statement
);
4733 case lang_group_statement_enum
:
4734 print_group (&s
->group_statement
, os
);
4736 case lang_insert_statement_enum
:
4737 minfo ("INSERT %s %s\n",
4738 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4739 s
->insert_statement
.where
);
4745 print_statements (void)
4747 print_statement_list (statement_list
.head
, abs_output_section
);
4750 /* Print the first N statements in statement list S to STDERR.
4751 If N == 0, nothing is printed.
4752 If N < 0, the entire list is printed.
4753 Intended to be called from GDB. */
4756 dprint_statement (lang_statement_union_type
*s
, int n
)
4758 FILE *map_save
= config
.map_file
;
4760 config
.map_file
= stderr
;
4763 print_statement_list (s
, abs_output_section
);
4766 while (s
&& --n
>= 0)
4768 print_statement (s
, abs_output_section
);
4773 config
.map_file
= map_save
;
4777 insert_pad (lang_statement_union_type
**ptr
,
4779 bfd_size_type alignment_needed
,
4780 asection
*output_section
,
4783 static fill_type zero_fill
;
4784 lang_statement_union_type
*pad
= NULL
;
4786 if (ptr
!= &statement_list
.head
)
4787 pad
= ((lang_statement_union_type
*)
4788 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4790 && pad
->header
.type
== lang_padding_statement_enum
4791 && pad
->padding_statement
.output_section
== output_section
)
4793 /* Use the existing pad statement. */
4795 else if ((pad
= *ptr
) != NULL
4796 && pad
->header
.type
== lang_padding_statement_enum
4797 && pad
->padding_statement
.output_section
== output_section
)
4799 /* Use the existing pad statement. */
4803 /* Make a new padding statement, linked into existing chain. */
4804 pad
= (lang_statement_union_type
*)
4805 stat_alloc (sizeof (lang_padding_statement_type
));
4806 pad
->header
.next
= *ptr
;
4808 pad
->header
.type
= lang_padding_statement_enum
;
4809 pad
->padding_statement
.output_section
= output_section
;
4812 pad
->padding_statement
.fill
= fill
;
4814 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4815 pad
->padding_statement
.size
= alignment_needed
;
4816 if (!(output_section
->flags
& SEC_FIXED_SIZE
))
4817 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4818 - output_section
->vma
);
4821 /* Work out how much this section will move the dot point. */
4825 (lang_statement_union_type
**this_ptr
,
4826 lang_output_section_statement_type
*output_section_statement
,
4830 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4831 asection
*i
= is
->section
;
4832 asection
*o
= output_section_statement
->bfd_section
;
4834 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4835 i
->output_offset
= i
->vma
- o
->vma
;
4836 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
4837 || output_section_statement
->ignored
)
4838 i
->output_offset
= dot
- o
->vma
;
4841 bfd_size_type alignment_needed
;
4843 /* Align this section first to the input sections requirement,
4844 then to the output section's requirement. If this alignment
4845 is greater than any seen before, then record it too. Perform
4846 the alignment by inserting a magic 'padding' statement. */
4848 if (output_section_statement
->subsection_alignment
!= NULL
)
4850 = exp_get_power (output_section_statement
->subsection_alignment
,
4851 "subsection alignment");
4853 if (o
->alignment_power
< i
->alignment_power
)
4854 o
->alignment_power
= i
->alignment_power
;
4856 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4858 if (alignment_needed
!= 0)
4860 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4861 dot
+= alignment_needed
;
4864 /* Remember where in the output section this input section goes. */
4865 i
->output_offset
= dot
- o
->vma
;
4867 /* Mark how big the output section must be to contain this now. */
4868 dot
+= TO_ADDR (i
->size
);
4869 if (!(o
->flags
& SEC_FIXED_SIZE
))
4870 o
->size
= TO_SIZE (dot
- o
->vma
);
4883 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4885 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4886 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4888 if (sec1
->lma
< sec2
->lma
)
4890 else if (sec1
->lma
> sec2
->lma
)
4892 else if (sec1
->id
< sec2
->id
)
4894 else if (sec1
->id
> sec2
->id
)
4901 sort_sections_by_vma (const void *arg1
, const void *arg2
)
4903 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4904 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4906 if (sec1
->vma
< sec2
->vma
)
4908 else if (sec1
->vma
> sec2
->vma
)
4910 else if (sec1
->id
< sec2
->id
)
4912 else if (sec1
->id
> sec2
->id
)
4918 #define IS_TBSS(s) \
4919 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4921 #define IGNORE_SECTION(s) \
4922 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4924 /* Check to see if any allocated sections overlap with other allocated
4925 sections. This can happen if a linker script specifies the output
4926 section addresses of the two sections. Also check whether any memory
4927 region has overflowed. */
4930 lang_check_section_addresses (void)
4933 struct check_sec
*sections
;
4938 bfd_vma p_start
= 0;
4940 lang_memory_region_type
*m
;
4941 bfd_boolean overlays
;
4943 /* Detect address space overflow on allocated sections. */
4944 addr_mask
= ((bfd_vma
) 1 <<
4945 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
4946 addr_mask
= (addr_mask
<< 1) + 1;
4947 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4948 if ((s
->flags
& SEC_ALLOC
) != 0)
4950 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
4951 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
4952 einfo (_("%X%P: section %s VMA wraps around address space\n"),
4956 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
4957 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
4958 einfo (_("%X%P: section %s LMA wraps around address space\n"),
4963 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4966 count
= bfd_count_sections (link_info
.output_bfd
);
4967 sections
= XNEWVEC (struct check_sec
, count
);
4969 /* Scan all sections in the output list. */
4971 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4973 if (IGNORE_SECTION (s
)
4977 sections
[count
].sec
= s
;
4978 sections
[count
].warned
= FALSE
;
4988 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
4990 /* First check section LMAs. There should be no overlap of LMAs on
4991 loadable sections, even with overlays. */
4992 for (p
= NULL
, i
= 0; i
< count
; i
++)
4994 s
= sections
[i
].sec
;
4995 if ((s
->flags
& SEC_LOAD
) != 0)
4998 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5000 /* Look for an overlap. We have sorted sections by lma, so
5001 we know that s_start >= p_start. Besides the obvious
5002 case of overlap when the current section starts before
5003 the previous one ends, we also must have overlap if the
5004 previous section wraps around the address space. */
5006 && (s_start
<= p_end
5007 || p_end
< p_start
))
5009 einfo (_("%X%P: section %s LMA [%V,%V]"
5010 " overlaps section %s LMA [%V,%V]\n"),
5011 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5012 sections
[i
].warned
= TRUE
;
5020 /* If any non-zero size allocated section (excluding tbss) starts at
5021 exactly the same VMA as another such section, then we have
5022 overlays. Overlays generated by the OVERLAY keyword will have
5023 this property. It is possible to intentionally generate overlays
5024 that fail this test, but it would be unusual. */
5025 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
5027 p_start
= sections
[0].sec
->vma
;
5028 for (i
= 1; i
< count
; i
++)
5030 s_start
= sections
[i
].sec
->vma
;
5031 if (p_start
== s_start
)
5039 /* Now check section VMAs if no overlays were detected. */
5042 for (p
= NULL
, i
= 0; i
< count
; i
++)
5044 s
= sections
[i
].sec
;
5046 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
5049 && !sections
[i
].warned
5050 && (s_start
<= p_end
5051 || p_end
< p_start
))
5052 einfo (_("%X%P: section %s VMA [%V,%V]"
5053 " overlaps section %s VMA [%V,%V]\n"),
5054 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
5063 /* If any memory region has overflowed, report by how much.
5064 We do not issue this diagnostic for regions that had sections
5065 explicitly placed outside their bounds; os_region_check's
5066 diagnostics are adequate for that case.
5068 FIXME: It is conceivable that m->current - (m->origin + m->length)
5069 might overflow a 32-bit integer. There is, alas, no way to print
5070 a bfd_vma quantity in decimal. */
5071 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
5072 if (m
->had_full_message
)
5074 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
5075 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
5076 "%X%P: region `%s' overflowed by %lu bytes\n",
5078 m
->name_list
.name
, over
);
5082 /* Make sure the new address is within the region. We explicitly permit the
5083 current address to be at the exact end of the region when the address is
5084 non-zero, in case the region is at the end of addressable memory and the
5085 calculation wraps around. */
5088 os_region_check (lang_output_section_statement_type
*os
,
5089 lang_memory_region_type
*region
,
5093 if ((region
->current
< region
->origin
5094 || (region
->current
- region
->origin
> region
->length
))
5095 && ((region
->current
!= region
->origin
+ region
->length
)
5100 einfo (_("%X%P: address 0x%v of %pB section `%s'"
5101 " is not within region `%s'\n"),
5103 os
->bfd_section
->owner
,
5104 os
->bfd_section
->name
,
5105 region
->name_list
.name
);
5107 else if (!region
->had_full_message
)
5109 region
->had_full_message
= TRUE
;
5111 einfo (_("%X%P: %pB section `%s' will not fit in region `%s'\n"),
5112 os
->bfd_section
->owner
,
5113 os
->bfd_section
->name
,
5114 region
->name_list
.name
);
5120 ldlang_check_relro_region (lang_statement_union_type
*s
,
5121 seg_align_type
*seg
)
5123 if (seg
->relro
== exp_seg_relro_start
)
5125 if (!seg
->relro_start_stat
)
5126 seg
->relro_start_stat
= s
;
5129 ASSERT (seg
->relro_start_stat
== s
);
5132 else if (seg
->relro
== exp_seg_relro_end
)
5134 if (!seg
->relro_end_stat
)
5135 seg
->relro_end_stat
= s
;
5138 ASSERT (seg
->relro_end_stat
== s
);
5143 /* Set the sizes for all the output sections. */
5146 lang_size_sections_1
5147 (lang_statement_union_type
**prev
,
5148 lang_output_section_statement_type
*output_section_statement
,
5152 bfd_boolean check_regions
)
5154 lang_statement_union_type
*s
;
5156 /* Size up the sections from their constituent parts. */
5157 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
5159 switch (s
->header
.type
)
5161 case lang_output_section_statement_enum
:
5163 bfd_vma newdot
, after
, dotdelta
;
5164 lang_output_section_statement_type
*os
;
5165 lang_memory_region_type
*r
;
5166 int section_alignment
= 0;
5168 os
= &s
->output_section_statement
;
5169 if (os
->constraint
== -1)
5172 /* FIXME: We shouldn't need to zero section vmas for ld -r
5173 here, in lang_insert_orphan, or in the default linker scripts.
5174 This is covering for coff backend linker bugs. See PR6945. */
5175 if (os
->addr_tree
== NULL
5176 && bfd_link_relocatable (&link_info
)
5177 && (bfd_get_flavour (link_info
.output_bfd
)
5178 == bfd_target_coff_flavour
))
5179 os
->addr_tree
= exp_intop (0);
5180 if (os
->addr_tree
!= NULL
)
5182 os
->processed_vma
= FALSE
;
5183 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5185 if (expld
.result
.valid_p
)
5187 dot
= expld
.result
.value
;
5188 if (expld
.result
.section
!= NULL
)
5189 dot
+= expld
.result
.section
->vma
;
5191 else if (expld
.phase
!= lang_mark_phase_enum
)
5192 einfo (_("%F%P:%pS: non constant or forward reference"
5193 " address expression for section %s\n"),
5194 os
->addr_tree
, os
->name
);
5197 if (os
->bfd_section
== NULL
)
5198 /* This section was removed or never actually created. */
5201 /* If this is a COFF shared library section, use the size and
5202 address from the input section. FIXME: This is COFF
5203 specific; it would be cleaner if there were some other way
5204 to do this, but nothing simple comes to mind. */
5205 if (((bfd_get_flavour (link_info
.output_bfd
)
5206 == bfd_target_ecoff_flavour
)
5207 || (bfd_get_flavour (link_info
.output_bfd
)
5208 == bfd_target_coff_flavour
))
5209 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5213 if (os
->children
.head
== NULL
5214 || os
->children
.head
->header
.next
!= NULL
5215 || (os
->children
.head
->header
.type
5216 != lang_input_section_enum
))
5217 einfo (_("%X%P: internal error on COFF shared library"
5218 " section %s\n"), os
->name
);
5220 input
= os
->children
.head
->input_section
.section
;
5221 bfd_set_section_vma (os
->bfd_section
->owner
,
5223 bfd_section_vma (input
->owner
, input
));
5224 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5225 os
->bfd_section
->size
= input
->size
;
5231 if (bfd_is_abs_section (os
->bfd_section
))
5233 /* No matter what happens, an abs section starts at zero. */
5234 ASSERT (os
->bfd_section
->vma
== 0);
5238 if (os
->addr_tree
== NULL
)
5240 /* No address specified for this section, get one
5241 from the region specification. */
5242 if (os
->region
== NULL
5243 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5244 && os
->region
->name_list
.name
[0] == '*'
5245 && strcmp (os
->region
->name_list
.name
,
5246 DEFAULT_MEMORY_REGION
) == 0))
5248 os
->region
= lang_memory_default (os
->bfd_section
);
5251 /* If a loadable section is using the default memory
5252 region, and some non default memory regions were
5253 defined, issue an error message. */
5255 && !IGNORE_SECTION (os
->bfd_section
)
5256 && !bfd_link_relocatable (&link_info
)
5258 && strcmp (os
->region
->name_list
.name
,
5259 DEFAULT_MEMORY_REGION
) == 0
5260 && lang_memory_region_list
!= NULL
5261 && (strcmp (lang_memory_region_list
->name_list
.name
,
5262 DEFAULT_MEMORY_REGION
) != 0
5263 || lang_memory_region_list
->next
!= NULL
)
5264 && expld
.phase
!= lang_mark_phase_enum
)
5266 /* By default this is an error rather than just a
5267 warning because if we allocate the section to the
5268 default memory region we can end up creating an
5269 excessively large binary, or even seg faulting when
5270 attempting to perform a negative seek. See
5271 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5272 for an example of this. This behaviour can be
5273 overridden by the using the --no-check-sections
5275 if (command_line
.check_section_addresses
)
5276 einfo (_("%F%P: error: no memory region specified"
5277 " for loadable section `%s'\n"),
5278 bfd_get_section_name (link_info
.output_bfd
,
5281 einfo (_("%P: warning: no memory region specified"
5282 " for loadable section `%s'\n"),
5283 bfd_get_section_name (link_info
.output_bfd
,
5287 newdot
= os
->region
->current
;
5288 section_alignment
= os
->bfd_section
->alignment_power
;
5291 section_alignment
= exp_get_power (os
->section_alignment
,
5292 "section alignment");
5294 /* Align to what the section needs. */
5295 if (section_alignment
> 0)
5297 bfd_vma savedot
= newdot
;
5298 newdot
= align_power (newdot
, section_alignment
);
5300 dotdelta
= newdot
- savedot
;
5302 && (config
.warn_section_align
5303 || os
->addr_tree
!= NULL
)
5304 && expld
.phase
!= lang_mark_phase_enum
)
5305 einfo (ngettext ("%P: warning: changing start of "
5306 "section %s by %lu byte\n",
5307 "%P: warning: changing start of "
5308 "section %s by %lu bytes\n",
5309 (unsigned long) dotdelta
),
5310 os
->name
, (unsigned long) dotdelta
);
5313 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
5315 os
->bfd_section
->output_offset
= 0;
5318 lang_size_sections_1 (&os
->children
.head
, os
,
5319 os
->fill
, newdot
, relax
, check_regions
);
5321 os
->processed_vma
= TRUE
;
5323 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5324 /* Except for some special linker created sections,
5325 no output section should change from zero size
5326 after strip_excluded_output_sections. A non-zero
5327 size on an ignored section indicates that some
5328 input section was not sized early enough. */
5329 ASSERT (os
->bfd_section
->size
== 0);
5332 dot
= os
->bfd_section
->vma
;
5334 /* Put the section within the requested block size, or
5335 align at the block boundary. */
5337 + TO_ADDR (os
->bfd_section
->size
)
5338 + os
->block_value
- 1)
5339 & - (bfd_vma
) os
->block_value
);
5341 if (!(os
->bfd_section
->flags
& SEC_FIXED_SIZE
))
5342 os
->bfd_section
->size
= TO_SIZE (after
5343 - os
->bfd_section
->vma
);
5346 /* Set section lma. */
5349 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5353 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5354 os
->bfd_section
->lma
= lma
;
5356 else if (os
->lma_region
!= NULL
)
5358 bfd_vma lma
= os
->lma_region
->current
;
5360 if (os
->align_lma_with_input
)
5364 /* When LMA_REGION is the same as REGION, align the LMA
5365 as we did for the VMA, possibly including alignment
5366 from the bfd section. If a different region, then
5367 only align according to the value in the output
5369 if (os
->lma_region
!= os
->region
)
5370 section_alignment
= exp_get_power (os
->section_alignment
,
5371 "section alignment");
5372 if (section_alignment
> 0)
5373 lma
= align_power (lma
, section_alignment
);
5375 os
->bfd_section
->lma
= lma
;
5377 else if (r
->last_os
!= NULL
5378 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5383 last
= r
->last_os
->output_section_statement
.bfd_section
;
5385 /* A backwards move of dot should be accompanied by
5386 an explicit assignment to the section LMA (ie.
5387 os->load_base set) because backwards moves can
5388 create overlapping LMAs. */
5390 && os
->bfd_section
->size
!= 0
5391 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5393 /* If dot moved backwards then leave lma equal to
5394 vma. This is the old default lma, which might
5395 just happen to work when the backwards move is
5396 sufficiently large. Nag if this changes anything,
5397 so people can fix their linker scripts. */
5399 if (last
->vma
!= last
->lma
)
5400 einfo (_("%P: warning: dot moved backwards "
5401 "before `%s'\n"), os
->name
);
5405 /* If this is an overlay, set the current lma to that
5406 at the end of the previous section. */
5407 if (os
->sectype
== overlay_section
)
5408 lma
= last
->lma
+ TO_ADDR (last
->size
);
5410 /* Otherwise, keep the same lma to vma relationship
5411 as the previous section. */
5413 lma
= dot
+ last
->lma
- last
->vma
;
5415 if (section_alignment
> 0)
5416 lma
= align_power (lma
, section_alignment
);
5417 os
->bfd_section
->lma
= lma
;
5420 os
->processed_lma
= TRUE
;
5422 /* Keep track of normal sections using the default
5423 lma region. We use this to set the lma for
5424 following sections. Overlays or other linker
5425 script assignment to lma might mean that the
5426 default lma == vma is incorrect.
5427 To avoid warnings about dot moving backwards when using
5428 -Ttext, don't start tracking sections until we find one
5429 of non-zero size or with lma set differently to vma.
5430 Do this tracking before we short-cut the loop so that we
5431 track changes for the case where the section size is zero,
5432 but the lma is set differently to the vma. This is
5433 important, if an orphan section is placed after an
5434 otherwise empty output section that has an explicit lma
5435 set, we want that lma reflected in the orphans lma. */
5436 if (!IGNORE_SECTION (os
->bfd_section
)
5437 && (os
->bfd_section
->size
!= 0
5438 || (r
->last_os
== NULL
5439 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5440 || (r
->last_os
!= NULL
5441 && dot
>= (r
->last_os
->output_section_statement
5442 .bfd_section
->vma
)))
5443 && os
->lma_region
== NULL
5444 && !bfd_link_relocatable (&link_info
))
5447 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5450 /* .tbss sections effectively have zero size. */
5451 if (!IS_TBSS (os
->bfd_section
)
5452 || bfd_link_relocatable (&link_info
))
5453 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5458 if (os
->update_dot_tree
!= 0)
5459 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5461 /* Update dot in the region ?
5462 We only do this if the section is going to be allocated,
5463 since unallocated sections do not contribute to the region's
5464 overall size in memory. */
5465 if (os
->region
!= NULL
5466 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5468 os
->region
->current
= dot
;
5471 /* Make sure the new address is within the region. */
5472 os_region_check (os
, os
->region
, os
->addr_tree
,
5473 os
->bfd_section
->vma
);
5475 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5476 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5477 || os
->align_lma_with_input
))
5479 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5482 os_region_check (os
, os
->lma_region
, NULL
,
5483 os
->bfd_section
->lma
);
5489 case lang_constructors_statement_enum
:
5490 dot
= lang_size_sections_1 (&constructor_list
.head
,
5491 output_section_statement
,
5492 fill
, dot
, relax
, check_regions
);
5495 case lang_data_statement_enum
:
5497 unsigned int size
= 0;
5499 s
->data_statement
.output_offset
=
5500 dot
- output_section_statement
->bfd_section
->vma
;
5501 s
->data_statement
.output_section
=
5502 output_section_statement
->bfd_section
;
5504 /* We might refer to provided symbols in the expression, and
5505 need to mark them as needed. */
5506 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5508 switch (s
->data_statement
.type
)
5526 if (size
< TO_SIZE ((unsigned) 1))
5527 size
= TO_SIZE ((unsigned) 1);
5528 dot
+= TO_ADDR (size
);
5529 if (!(output_section_statement
->bfd_section
->flags
5531 output_section_statement
->bfd_section
->size
5532 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5537 case lang_reloc_statement_enum
:
5541 s
->reloc_statement
.output_offset
=
5542 dot
- output_section_statement
->bfd_section
->vma
;
5543 s
->reloc_statement
.output_section
=
5544 output_section_statement
->bfd_section
;
5545 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5546 dot
+= TO_ADDR (size
);
5547 if (!(output_section_statement
->bfd_section
->flags
5549 output_section_statement
->bfd_section
->size
5550 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5554 case lang_wild_statement_enum
:
5555 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5556 output_section_statement
,
5557 fill
, dot
, relax
, check_regions
);
5560 case lang_object_symbols_statement_enum
:
5561 link_info
.create_object_symbols_section
=
5562 output_section_statement
->bfd_section
;
5565 case lang_output_statement_enum
:
5566 case lang_target_statement_enum
:
5569 case lang_input_section_enum
:
5573 i
= s
->input_section
.section
;
5578 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5579 einfo (_("%F%P: can't relax section: %E\n"));
5583 dot
= size_input_section (prev
, output_section_statement
,
5588 case lang_input_statement_enum
:
5591 case lang_fill_statement_enum
:
5592 s
->fill_statement
.output_section
=
5593 output_section_statement
->bfd_section
;
5595 fill
= s
->fill_statement
.fill
;
5598 case lang_assignment_statement_enum
:
5600 bfd_vma newdot
= dot
;
5601 etree_type
*tree
= s
->assignment_statement
.exp
;
5603 expld
.dataseg
.relro
= exp_seg_relro_none
;
5605 exp_fold_tree (tree
,
5606 output_section_statement
->bfd_section
,
5609 ldlang_check_relro_region (s
, &expld
.dataseg
);
5611 expld
.dataseg
.relro
= exp_seg_relro_none
;
5613 /* This symbol may be relative to this section. */
5614 if ((tree
->type
.node_class
== etree_provided
5615 || tree
->type
.node_class
== etree_assign
)
5616 && (tree
->assign
.dst
[0] != '.'
5617 || tree
->assign
.dst
[1] != '\0'))
5618 output_section_statement
->update_dot
= 1;
5620 if (!output_section_statement
->ignored
)
5622 if (output_section_statement
== abs_output_section
)
5624 /* If we don't have an output section, then just adjust
5625 the default memory address. */
5626 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5627 FALSE
)->current
= newdot
;
5629 else if (newdot
!= dot
)
5631 /* Insert a pad after this statement. We can't
5632 put the pad before when relaxing, in case the
5633 assignment references dot. */
5634 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5635 output_section_statement
->bfd_section
, dot
);
5637 /* Don't neuter the pad below when relaxing. */
5640 /* If dot is advanced, this implies that the section
5641 should have space allocated to it, unless the
5642 user has explicitly stated that the section
5643 should not be allocated. */
5644 if (output_section_statement
->sectype
!= noalloc_section
5645 && (output_section_statement
->sectype
!= noload_section
5646 || (bfd_get_flavour (link_info
.output_bfd
)
5647 == bfd_target_elf_flavour
)))
5648 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5655 case lang_padding_statement_enum
:
5656 /* If this is the first time lang_size_sections is called,
5657 we won't have any padding statements. If this is the
5658 second or later passes when relaxing, we should allow
5659 padding to shrink. If padding is needed on this pass, it
5660 will be added back in. */
5661 s
->padding_statement
.size
= 0;
5663 /* Make sure output_offset is valid. If relaxation shrinks
5664 the section and this pad isn't needed, it's possible to
5665 have output_offset larger than the final size of the
5666 section. bfd_set_section_contents will complain even for
5667 a pad size of zero. */
5668 s
->padding_statement
.output_offset
5669 = dot
- output_section_statement
->bfd_section
->vma
;
5672 case lang_group_statement_enum
:
5673 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5674 output_section_statement
,
5675 fill
, dot
, relax
, check_regions
);
5678 case lang_insert_statement_enum
:
5681 /* We can only get here when relaxing is turned on. */
5682 case lang_address_statement_enum
:
5689 prev
= &s
->header
.next
;
5694 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5695 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5696 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5697 segments. We are allowed an opportunity to override this decision. */
5700 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
5701 bfd
*abfd ATTRIBUTE_UNUSED
,
5702 asection
*current_section
,
5703 asection
*previous_section
,
5704 bfd_boolean new_segment
)
5706 lang_output_section_statement_type
*cur
;
5707 lang_output_section_statement_type
*prev
;
5709 /* The checks below are only necessary when the BFD library has decided
5710 that the two sections ought to be placed into the same segment. */
5714 /* Paranoia checks. */
5715 if (current_section
== NULL
|| previous_section
== NULL
)
5718 /* If this flag is set, the target never wants code and non-code
5719 sections comingled in the same segment. */
5720 if (config
.separate_code
5721 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5724 /* Find the memory regions associated with the two sections.
5725 We call lang_output_section_find() here rather than scanning the list
5726 of output sections looking for a matching section pointer because if
5727 we have a large number of sections then a hash lookup is faster. */
5728 cur
= lang_output_section_find (current_section
->name
);
5729 prev
= lang_output_section_find (previous_section
->name
);
5731 /* More paranoia. */
5732 if (cur
== NULL
|| prev
== NULL
)
5735 /* If the regions are different then force the sections to live in
5736 different segments. See the email thread starting at the following
5737 URL for the reasons why this is necessary:
5738 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5739 return cur
->region
!= prev
->region
;
5743 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5745 lang_statement_iteration
++;
5746 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5747 0, 0, relax
, check_regions
);
5751 lang_size_segment (seg_align_type
*seg
)
5753 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
5754 a page could be saved in the data segment. */
5755 bfd_vma first
, last
;
5757 first
= -seg
->base
& (seg
->pagesize
- 1);
5758 last
= seg
->end
& (seg
->pagesize
- 1);
5760 && ((seg
->base
& ~(seg
->pagesize
- 1))
5761 != (seg
->end
& ~(seg
->pagesize
- 1)))
5762 && first
+ last
<= seg
->pagesize
)
5764 seg
->phase
= exp_seg_adjust
;
5768 seg
->phase
= exp_seg_done
;
5773 lang_size_relro_segment_1 (seg_align_type
*seg
)
5775 bfd_vma relro_end
, desired_end
;
5778 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
5779 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
5780 & ~(seg
->pagesize
- 1));
5782 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
5783 desired_end
= relro_end
- seg
->relro_offset
;
5785 /* For sections in the relro segment.. */
5786 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
5787 if ((sec
->flags
& SEC_ALLOC
) != 0
5788 && sec
->vma
>= seg
->base
5789 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
5791 /* Where do we want to put this section so that it ends as
5793 bfd_vma start
, end
, bump
;
5795 end
= start
= sec
->vma
;
5797 end
+= TO_ADDR (sec
->size
);
5798 bump
= desired_end
- end
;
5799 /* We'd like to increase START by BUMP, but we must heed
5800 alignment so the increase might be less than optimum. */
5802 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
5803 /* This is now the desired end for the previous section. */
5804 desired_end
= start
;
5807 seg
->phase
= exp_seg_relro_adjust
;
5808 ASSERT (desired_end
>= seg
->base
);
5809 seg
->base
= desired_end
;
5814 lang_size_relro_segment (bfd_boolean
*relax
, bfd_boolean check_regions
)
5816 bfd_boolean do_reset
= FALSE
;
5817 bfd_boolean do_data_relro
;
5818 bfd_vma data_initial_base
, data_relro_end
;
5820 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5822 do_data_relro
= TRUE
;
5823 data_initial_base
= expld
.dataseg
.base
;
5824 data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
5828 do_data_relro
= FALSE
;
5829 data_initial_base
= data_relro_end
= 0;
5834 lang_reset_memory_regions ();
5835 one_lang_size_sections_pass (relax
, check_regions
);
5837 /* Assignments to dot, or to output section address in a user
5838 script have increased padding over the original. Revert. */
5839 if (do_data_relro
&& expld
.dataseg
.relro_end
> data_relro_end
)
5841 expld
.dataseg
.base
= data_initial_base
;;
5846 if (!do_data_relro
&& lang_size_segment (&expld
.dataseg
))
5853 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5855 expld
.phase
= lang_allocating_phase_enum
;
5856 expld
.dataseg
.phase
= exp_seg_none
;
5858 one_lang_size_sections_pass (relax
, check_regions
);
5860 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
5861 expld
.dataseg
.phase
= exp_seg_done
;
5863 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
5865 bfd_boolean do_reset
5866 = lang_size_relro_segment (relax
, check_regions
);
5870 lang_reset_memory_regions ();
5871 one_lang_size_sections_pass (relax
, check_regions
);
5874 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5876 link_info
.relro_start
= expld
.dataseg
.base
;
5877 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5882 static lang_output_section_statement_type
*current_section
;
5883 static lang_assignment_statement_type
*current_assign
;
5884 static bfd_boolean prefer_next_section
;
5886 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5889 lang_do_assignments_1 (lang_statement_union_type
*s
,
5890 lang_output_section_statement_type
*current_os
,
5893 bfd_boolean
*found_end
)
5895 for (; s
!= NULL
; s
= s
->header
.next
)
5897 switch (s
->header
.type
)
5899 case lang_constructors_statement_enum
:
5900 dot
= lang_do_assignments_1 (constructor_list
.head
,
5901 current_os
, fill
, dot
, found_end
);
5904 case lang_output_section_statement_enum
:
5906 lang_output_section_statement_type
*os
;
5909 os
= &(s
->output_section_statement
);
5910 os
->after_end
= *found_end
;
5911 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5913 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5915 current_section
= os
;
5916 prefer_next_section
= FALSE
;
5918 dot
= os
->bfd_section
->vma
;
5920 newdot
= lang_do_assignments_1 (os
->children
.head
,
5921 os
, os
->fill
, dot
, found_end
);
5924 if (os
->bfd_section
!= NULL
)
5926 /* .tbss sections effectively have zero size. */
5927 if (!IS_TBSS (os
->bfd_section
)
5928 || bfd_link_relocatable (&link_info
))
5929 dot
+= TO_ADDR (os
->bfd_section
->size
);
5931 if (os
->update_dot_tree
!= NULL
)
5932 exp_fold_tree (os
->update_dot_tree
,
5933 bfd_abs_section_ptr
, &dot
);
5941 case lang_wild_statement_enum
:
5943 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5944 current_os
, fill
, dot
, found_end
);
5947 case lang_object_symbols_statement_enum
:
5948 case lang_output_statement_enum
:
5949 case lang_target_statement_enum
:
5952 case lang_data_statement_enum
:
5953 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5954 if (expld
.result
.valid_p
)
5956 s
->data_statement
.value
= expld
.result
.value
;
5957 if (expld
.result
.section
!= NULL
)
5958 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5960 else if (expld
.phase
== lang_final_phase_enum
)
5961 einfo (_("%F%P: invalid data statement\n"));
5964 switch (s
->data_statement
.type
)
5982 if (size
< TO_SIZE ((unsigned) 1))
5983 size
= TO_SIZE ((unsigned) 1);
5984 dot
+= TO_ADDR (size
);
5988 case lang_reloc_statement_enum
:
5989 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5990 bfd_abs_section_ptr
, &dot
);
5991 if (expld
.result
.valid_p
)
5992 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5993 else if (expld
.phase
== lang_final_phase_enum
)
5994 einfo (_("%F%P: invalid reloc statement\n"));
5995 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5998 case lang_input_section_enum
:
6000 asection
*in
= s
->input_section
.section
;
6002 if ((in
->flags
& SEC_EXCLUDE
) == 0)
6003 dot
+= TO_ADDR (in
->size
);
6007 case lang_input_statement_enum
:
6010 case lang_fill_statement_enum
:
6011 fill
= s
->fill_statement
.fill
;
6014 case lang_assignment_statement_enum
:
6015 current_assign
= &s
->assignment_statement
;
6016 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
6018 const char *p
= current_assign
->exp
->assign
.dst
;
6020 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
6021 prefer_next_section
= TRUE
;
6025 if (strcmp (p
, "end") == 0)
6028 exp_fold_tree (s
->assignment_statement
.exp
,
6029 (current_os
->bfd_section
!= NULL
6030 ? current_os
->bfd_section
: bfd_und_section_ptr
),
6034 case lang_padding_statement_enum
:
6035 dot
+= TO_ADDR (s
->padding_statement
.size
);
6038 case lang_group_statement_enum
:
6039 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
6040 current_os
, fill
, dot
, found_end
);
6043 case lang_insert_statement_enum
:
6046 case lang_address_statement_enum
:
6058 lang_do_assignments (lang_phase_type phase
)
6060 bfd_boolean found_end
= FALSE
;
6062 current_section
= NULL
;
6063 prefer_next_section
= FALSE
;
6064 expld
.phase
= phase
;
6065 lang_statement_iteration
++;
6066 lang_do_assignments_1 (statement_list
.head
,
6067 abs_output_section
, NULL
, 0, &found_end
);
6070 /* For an assignment statement outside of an output section statement,
6071 choose the best of neighbouring output sections to use for values
6075 section_for_dot (void)
6079 /* Assignments belong to the previous output section, unless there
6080 has been an assignment to "dot", in which case following
6081 assignments belong to the next output section. (The assumption
6082 is that an assignment to "dot" is setting up the address for the
6083 next output section.) Except that past the assignment to "_end"
6084 we always associate with the previous section. This exception is
6085 for targets like SH that define an alloc .stack or other
6086 weirdness after non-alloc sections. */
6087 if (current_section
== NULL
|| prefer_next_section
)
6089 lang_statement_union_type
*stmt
;
6090 lang_output_section_statement_type
*os
;
6092 for (stmt
= (lang_statement_union_type
*) current_assign
;
6094 stmt
= stmt
->header
.next
)
6095 if (stmt
->header
.type
== lang_output_section_statement_enum
)
6098 os
= &stmt
->output_section_statement
;
6101 && (os
->bfd_section
== NULL
6102 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
6103 || bfd_section_removed_from_list (link_info
.output_bfd
,
6107 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
6110 s
= os
->bfd_section
;
6112 s
= link_info
.output_bfd
->section_last
;
6114 && ((s
->flags
& SEC_ALLOC
) == 0
6115 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6120 return bfd_abs_section_ptr
;
6124 s
= current_section
->bfd_section
;
6126 /* The section may have been stripped. */
6128 && ((s
->flags
& SEC_EXCLUDE
) != 0
6129 || (s
->flags
& SEC_ALLOC
) == 0
6130 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
6131 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
6134 s
= link_info
.output_bfd
->sections
;
6136 && ((s
->flags
& SEC_ALLOC
) == 0
6137 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
6142 return bfd_abs_section_ptr
;
6145 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
6147 static struct bfd_link_hash_entry
**start_stop_syms
;
6148 static size_t start_stop_count
= 0;
6149 static size_t start_stop_alloc
= 0;
6151 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
6152 to start_stop_syms. */
6155 lang_define_start_stop (const char *symbol
, asection
*sec
)
6157 struct bfd_link_hash_entry
*h
;
6159 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6162 if (start_stop_count
== start_stop_alloc
)
6164 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6166 = xrealloc (start_stop_syms
,
6167 start_stop_alloc
* sizeof (*start_stop_syms
));
6169 start_stop_syms
[start_stop_count
++] = h
;
6173 /* Check for input sections whose names match references to
6174 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6175 preliminary definitions. */
6178 lang_init_start_stop (void)
6182 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6184 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6185 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6188 const char *secname
= s
->name
;
6190 for (ps
= secname
; *ps
!= '\0'; ps
++)
6191 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6195 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6197 symbol
[0] = leading_char
;
6198 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6199 lang_define_start_stop (symbol
, s
);
6201 symbol
[1] = leading_char
;
6202 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6203 lang_define_start_stop (symbol
+ 1, s
);
6210 /* Iterate over start_stop_syms. */
6213 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6217 for (i
= 0; i
< start_stop_count
; ++i
)
6218 func (start_stop_syms
[i
]);
6221 /* __start and __stop symbols are only supposed to be defined by the
6222 linker for orphan sections, but we now extend that to sections that
6223 map to an output section of the same name. The symbols were
6224 defined early for --gc-sections, before we mapped input to output
6225 sections, so undo those that don't satisfy this rule. */
6228 undef_start_stop (struct bfd_link_hash_entry
*h
)
6230 if (h
->ldscript_def
)
6233 if (h
->u
.def
.section
->output_section
== NULL
6234 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6235 || strcmp (h
->u
.def
.section
->name
,
6236 h
->u
.def
.section
->output_section
->name
) != 0)
6238 asection
*sec
= bfd_get_section_by_name (link_info
.output_bfd
,
6239 h
->u
.def
.section
->name
);
6242 /* When there are more than one input sections with the same
6243 section name, SECNAME, linker picks the first one to define
6244 __start_SECNAME and __stop_SECNAME symbols. When the first
6245 input section is removed by comdat group, we need to check
6246 if there is still an output section with section name
6249 for (i
= sec
->map_head
.s
; i
!= NULL
; i
= i
->map_head
.s
)
6250 if (strcmp (h
->u
.def
.section
->name
, i
->name
) == 0)
6252 h
->u
.def
.section
= i
;
6256 h
->type
= bfd_link_hash_undefined
;
6257 h
->u
.undef
.abfd
= NULL
;
6262 lang_undef_start_stop (void)
6264 foreach_start_stop (undef_start_stop
);
6267 /* Check for output sections whose names match references to
6268 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6269 preliminary definitions. */
6272 lang_init_startof_sizeof (void)
6276 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6278 const char *secname
= s
->name
;
6279 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6281 sprintf (symbol
, ".startof.%s", secname
);
6282 lang_define_start_stop (symbol
, s
);
6284 memcpy (symbol
+ 1, ".size", 5);
6285 lang_define_start_stop (symbol
+ 1, s
);
6290 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6293 set_start_stop (struct bfd_link_hash_entry
*h
)
6296 || h
->type
!= bfd_link_hash_defined
)
6299 if (h
->root
.string
[0] == '.')
6301 /* .startof. or .sizeof. symbol.
6302 .startof. already has final value. */
6303 if (h
->root
.string
[2] == 'i')
6306 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6307 h
->u
.def
.section
= bfd_abs_section_ptr
;
6312 /* __start or __stop symbol. */
6313 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6315 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6316 if (h
->root
.string
[4 + has_lead
] == 'o')
6319 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6325 lang_finalize_start_stop (void)
6327 foreach_start_stop (set_start_stop
);
6333 struct bfd_link_hash_entry
*h
;
6336 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
6337 || bfd_link_dll (&link_info
))
6338 warn
= entry_from_cmdline
;
6342 /* Force the user to specify a root when generating a relocatable with
6344 if (link_info
.gc_sections
&& bfd_link_relocatable (&link_info
)
6345 && !(entry_from_cmdline
|| undef_from_cmdline
))
6346 einfo (_("%F%P: gc-sections requires either an entry or "
6347 "an undefined symbol\n"));
6349 if (entry_symbol
.name
== NULL
)
6351 /* No entry has been specified. Look for the default entry, but
6352 don't warn if we don't find it. */
6353 entry_symbol
.name
= entry_symbol_default
;
6357 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
6358 FALSE
, FALSE
, TRUE
);
6360 && (h
->type
== bfd_link_hash_defined
6361 || h
->type
== bfd_link_hash_defweak
)
6362 && h
->u
.def
.section
->output_section
!= NULL
)
6366 val
= (h
->u
.def
.value
6367 + bfd_get_section_vma (link_info
.output_bfd
,
6368 h
->u
.def
.section
->output_section
)
6369 + h
->u
.def
.section
->output_offset
);
6370 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6371 einfo (_("%F%P: %s: can't set start address\n"), entry_symbol
.name
);
6378 /* We couldn't find the entry symbol. Try parsing it as a
6380 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
6383 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6384 einfo (_("%F%P: can't set start address\n"));
6390 /* Can't find the entry symbol, and it's not a number. Use
6391 the first address in the text section. */
6392 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
6396 einfo (_("%P: warning: cannot find entry symbol %s;"
6397 " defaulting to %V\n"),
6399 bfd_get_section_vma (link_info
.output_bfd
, ts
));
6400 if (!(bfd_set_start_address
6401 (link_info
.output_bfd
,
6402 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
6403 einfo (_("%F%P: can't set start address\n"));
6408 einfo (_("%P: warning: cannot find entry symbol %s;"
6409 " not setting start address\n"),
6416 /* This is a small function used when we want to ignore errors from
6420 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
6421 va_list ap ATTRIBUTE_UNUSED
)
6423 /* Don't do anything. */
6426 /* Check that the architecture of all the input files is compatible
6427 with the output file. Also call the backend to let it do any
6428 other checking that is needed. */
6433 lang_statement_union_type
*file
;
6435 const bfd_arch_info_type
*compatible
;
6437 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
6439 #ifdef ENABLE_PLUGINS
6440 /* Don't check format of files claimed by plugin. */
6441 if (file
->input_statement
.flags
.claimed
)
6443 #endif /* ENABLE_PLUGINS */
6444 input_bfd
= file
->input_statement
.the_bfd
;
6446 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
6447 command_line
.accept_unknown_input_arch
);
6449 /* In general it is not possible to perform a relocatable
6450 link between differing object formats when the input
6451 file has relocations, because the relocations in the
6452 input format may not have equivalent representations in
6453 the output format (and besides BFD does not translate
6454 relocs for other link purposes than a final link). */
6455 if ((bfd_link_relocatable (&link_info
)
6456 || link_info
.emitrelocations
)
6457 && (compatible
== NULL
6458 || (bfd_get_flavour (input_bfd
)
6459 != bfd_get_flavour (link_info
.output_bfd
)))
6460 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
6462 einfo (_("%F%P: relocatable linking with relocations from"
6463 " format %s (%pB) to format %s (%pB) is not supported\n"),
6464 bfd_get_target (input_bfd
), input_bfd
,
6465 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
6466 /* einfo with %F exits. */
6469 if (compatible
== NULL
)
6471 if (command_line
.warn_mismatch
)
6472 einfo (_("%X%P: %s architecture of input file `%pB'"
6473 " is incompatible with %s output\n"),
6474 bfd_printable_name (input_bfd
), input_bfd
,
6475 bfd_printable_name (link_info
.output_bfd
));
6477 else if (bfd_count_sections (input_bfd
))
6479 /* If the input bfd has no contents, it shouldn't set the
6480 private data of the output bfd. */
6482 bfd_error_handler_type pfn
= NULL
;
6484 /* If we aren't supposed to warn about mismatched input
6485 files, temporarily set the BFD error handler to a
6486 function which will do nothing. We still want to call
6487 bfd_merge_private_bfd_data, since it may set up
6488 information which is needed in the output file. */
6489 if (!command_line
.warn_mismatch
)
6490 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
6491 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
6493 if (command_line
.warn_mismatch
)
6494 einfo (_("%X%P: failed to merge target specific data"
6495 " of file %pB\n"), input_bfd
);
6497 if (!command_line
.warn_mismatch
)
6498 bfd_set_error_handler (pfn
);
6503 /* Look through all the global common symbols and attach them to the
6504 correct section. The -sort-common command line switch may be used
6505 to roughly sort the entries by alignment. */
6510 if (link_info
.inhibit_common_definition
)
6512 if (bfd_link_relocatable (&link_info
)
6513 && !command_line
.force_common_definition
)
6516 if (!config
.sort_common
)
6517 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
6522 if (config
.sort_common
== sort_descending
)
6524 for (power
= 4; power
> 0; power
--)
6525 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6528 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6532 for (power
= 0; power
<= 4; power
++)
6533 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6535 power
= (unsigned int) -1;
6536 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6541 /* Place one common symbol in the correct section. */
6544 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
6546 unsigned int power_of_two
;
6550 if (h
->type
!= bfd_link_hash_common
)
6554 power_of_two
= h
->u
.c
.p
->alignment_power
;
6556 if (config
.sort_common
== sort_descending
6557 && power_of_two
< *(unsigned int *) info
)
6559 else if (config
.sort_common
== sort_ascending
6560 && power_of_two
> *(unsigned int *) info
)
6563 section
= h
->u
.c
.p
->section
;
6564 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6565 einfo (_("%F%P: could not define common symbol `%pT': %E\n"),
6568 if (config
.map_file
!= NULL
)
6570 static bfd_boolean header_printed
;
6575 if (!header_printed
)
6577 minfo (_("\nAllocating common symbols\n"));
6578 minfo (_("Common symbol size file\n\n"));
6579 header_printed
= TRUE
;
6582 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6583 DMGL_ANSI
| DMGL_PARAMS
);
6586 minfo ("%s", h
->root
.string
);
6587 len
= strlen (h
->root
.string
);
6592 len
= strlen (name
);
6608 if (size
<= 0xffffffff)
6609 sprintf (buf
, "%lx", (unsigned long) size
);
6611 sprintf_vma (buf
, size
);
6621 minfo ("%pB\n", section
->owner
);
6627 /* Handle a single orphan section S, placing the orphan into an appropriate
6628 output section. The effects of the --orphan-handling command line
6629 option are handled here. */
6632 ldlang_place_orphan (asection
*s
)
6634 if (config
.orphan_handling
== orphan_handling_discard
)
6636 lang_output_section_statement_type
*os
;
6637 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0,
6639 if (os
->addr_tree
== NULL
6640 && (bfd_link_relocatable (&link_info
)
6641 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6642 os
->addr_tree
= exp_intop (0);
6643 lang_add_section (&os
->children
, s
, NULL
, os
);
6647 lang_output_section_statement_type
*os
;
6648 const char *name
= s
->name
;
6651 if (config
.orphan_handling
== orphan_handling_error
)
6652 einfo (_("%X%P: error: unplaced orphan section `%pA' from `%pB'\n"),
6655 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
6656 constraint
= SPECIAL
;
6658 os
= ldemul_place_orphan (s
, name
, constraint
);
6661 os
= lang_output_section_statement_lookup (name
, constraint
, TRUE
);
6662 if (os
->addr_tree
== NULL
6663 && (bfd_link_relocatable (&link_info
)
6664 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6665 os
->addr_tree
= exp_intop (0);
6666 lang_add_section (&os
->children
, s
, NULL
, os
);
6669 if (config
.orphan_handling
== orphan_handling_warn
)
6670 einfo (_("%P: warning: orphan section `%pA' from `%pB' being "
6671 "placed in section `%s'\n"),
6672 s
, s
->owner
, os
->name
);
6676 /* Run through the input files and ensure that every input section has
6677 somewhere to go. If one is found without a destination then create
6678 an input request and place it into the statement tree. */
6681 lang_place_orphans (void)
6683 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6687 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6689 if (s
->output_section
== NULL
)
6691 /* This section of the file is not attached, root
6692 around for a sensible place for it to go. */
6694 if (file
->flags
.just_syms
)
6695 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6696 else if (lang_discard_section_p (s
))
6697 s
->output_section
= bfd_abs_section_ptr
;
6698 else if (strcmp (s
->name
, "COMMON") == 0)
6700 /* This is a lonely common section which must have
6701 come from an archive. We attach to the section
6702 with the wildcard. */
6703 if (!bfd_link_relocatable (&link_info
)
6704 || command_line
.force_common_definition
)
6706 if (default_common_section
== NULL
)
6707 default_common_section
6708 = lang_output_section_statement_lookup (".bss", 0,
6710 lang_add_section (&default_common_section
->children
, s
,
6711 NULL
, default_common_section
);
6715 ldlang_place_orphan (s
);
6722 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6724 flagword
*ptr_flags
;
6726 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6732 /* PR 17900: An exclamation mark in the attributes reverses
6733 the sense of any of the attributes that follow. */
6736 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6740 *ptr_flags
|= SEC_ALLOC
;
6744 *ptr_flags
|= SEC_READONLY
;
6748 *ptr_flags
|= SEC_DATA
;
6752 *ptr_flags
|= SEC_CODE
;
6757 *ptr_flags
|= SEC_LOAD
;
6761 einfo (_("%F%P: invalid character %c (%d) in flags\n"),
6769 /* Call a function on each input file. This function will be called
6770 on an archive, but not on the elements. */
6773 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6775 lang_input_statement_type
*f
;
6777 for (f
= &input_file_chain
.head
->input_statement
;
6779 f
= &f
->next_real_file
->input_statement
)
6783 /* Call a function on each file. The function will be called on all
6784 the elements of an archive which are included in the link, but will
6785 not be called on the archive file itself. */
6788 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6790 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6797 ldlang_add_file (lang_input_statement_type
*entry
)
6799 lang_statement_append (&file_chain
,
6800 (lang_statement_union_type
*) entry
,
6803 /* The BFD linker needs to have a list of all input BFDs involved in
6805 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
6806 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6808 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6809 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
6810 entry
->the_bfd
->usrdata
= entry
;
6811 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6813 /* Look through the sections and check for any which should not be
6814 included in the link. We need to do this now, so that we can
6815 notice when the backend linker tries to report multiple
6816 definition errors for symbols which are in sections we aren't
6817 going to link. FIXME: It might be better to entirely ignore
6818 symbols which are defined in sections which are going to be
6819 discarded. This would require modifying the backend linker for
6820 each backend which might set the SEC_LINK_ONCE flag. If we do
6821 this, we should probably handle SEC_EXCLUDE in the same way. */
6823 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6827 lang_add_output (const char *name
, int from_script
)
6829 /* Make -o on command line override OUTPUT in script. */
6830 if (!had_output_filename
|| !from_script
)
6832 output_filename
= name
;
6833 had_output_filename
= TRUE
;
6837 lang_output_section_statement_type
*
6838 lang_enter_output_section_statement (const char *output_section_statement_name
,
6839 etree_type
*address_exp
,
6840 enum section_type sectype
,
6842 etree_type
*subalign
,
6845 int align_with_input
)
6847 lang_output_section_statement_type
*os
;
6849 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6851 current_section
= os
;
6853 if (os
->addr_tree
== NULL
)
6855 os
->addr_tree
= address_exp
;
6857 os
->sectype
= sectype
;
6858 if (sectype
!= noload_section
)
6859 os
->flags
= SEC_NO_FLAGS
;
6861 os
->flags
= SEC_NEVER_LOAD
;
6862 os
->block_value
= 1;
6864 /* Make next things chain into subchain of this. */
6865 push_stat_ptr (&os
->children
);
6867 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6868 if (os
->align_lma_with_input
&& align
!= NULL
)
6869 einfo (_("%F%P:%pS: error: align with input and explicit align specified\n"),
6872 os
->subsection_alignment
= subalign
;
6873 os
->section_alignment
= align
;
6875 os
->load_base
= ebase
;
6882 lang_output_statement_type
*new_stmt
;
6884 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6885 new_stmt
->name
= output_filename
;
6888 /* Reset the current counters in the regions. */
6891 lang_reset_memory_regions (void)
6893 lang_memory_region_type
*p
= lang_memory_region_list
;
6895 lang_output_section_statement_type
*os
;
6897 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6899 p
->current
= p
->origin
;
6903 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6907 os
->processed_vma
= FALSE
;
6908 os
->processed_lma
= FALSE
;
6911 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6913 /* Save the last size for possible use by bfd_relax_section. */
6914 o
->rawsize
= o
->size
;
6915 if (!(o
->flags
& SEC_FIXED_SIZE
))
6920 /* Worker for lang_gc_sections_1. */
6923 gc_section_callback (lang_wild_statement_type
*ptr
,
6924 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6926 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6927 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6928 void *data ATTRIBUTE_UNUSED
)
6930 /* If the wild pattern was marked KEEP, the member sections
6931 should be as well. */
6932 if (ptr
->keep_sections
)
6933 section
->flags
|= SEC_KEEP
;
6936 /* Iterate over sections marking them against GC. */
6939 lang_gc_sections_1 (lang_statement_union_type
*s
)
6941 for (; s
!= NULL
; s
= s
->header
.next
)
6943 switch (s
->header
.type
)
6945 case lang_wild_statement_enum
:
6946 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6948 case lang_constructors_statement_enum
:
6949 lang_gc_sections_1 (constructor_list
.head
);
6951 case lang_output_section_statement_enum
:
6952 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6954 case lang_group_statement_enum
:
6955 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6964 lang_gc_sections (void)
6966 /* Keep all sections so marked in the link script. */
6967 lang_gc_sections_1 (statement_list
.head
);
6969 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6970 the special case of debug info. (See bfd/stabs.c)
6971 Twiddle the flag here, to simplify later linker code. */
6972 if (bfd_link_relocatable (&link_info
))
6974 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6977 #ifdef ENABLE_PLUGINS
6978 if (f
->flags
.claimed
)
6981 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6982 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6983 sec
->flags
&= ~SEC_EXCLUDE
;
6987 if (link_info
.gc_sections
)
6988 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6991 /* Worker for lang_find_relro_sections_1. */
6994 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6995 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6997 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6998 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
7001 /* Discarded, excluded and ignored sections effectively have zero
7003 if (section
->output_section
!= NULL
7004 && section
->output_section
->owner
== link_info
.output_bfd
7005 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
7006 && !IGNORE_SECTION (section
)
7007 && section
->size
!= 0)
7009 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
7010 *has_relro_section
= TRUE
;
7014 /* Iterate over sections for relro sections. */
7017 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
7018 seg_align_type
*seg
,
7019 bfd_boolean
*has_relro_section
)
7021 if (*has_relro_section
)
7024 for (; s
!= NULL
; s
= s
->header
.next
)
7026 if (s
== seg
->relro_end_stat
)
7029 switch (s
->header
.type
)
7031 case lang_wild_statement_enum
:
7032 walk_wild (&s
->wild_statement
,
7033 find_relro_section_callback
,
7036 case lang_constructors_statement_enum
:
7037 lang_find_relro_sections_1 (constructor_list
.head
,
7038 seg
, has_relro_section
);
7040 case lang_output_section_statement_enum
:
7041 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
7042 seg
, has_relro_section
);
7044 case lang_group_statement_enum
:
7045 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
7046 seg
, has_relro_section
);
7055 lang_find_relro_sections (void)
7057 bfd_boolean has_relro_section
= FALSE
;
7059 /* Check all sections in the link script. */
7061 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
7062 &expld
.dataseg
, &has_relro_section
);
7064 if (!has_relro_section
)
7065 link_info
.relro
= FALSE
;
7068 /* Relax all sections until bfd_relax_section gives up. */
7071 lang_relax_sections (bfd_boolean need_layout
)
7073 if (RELAXATION_ENABLED
)
7075 /* We may need more than one relaxation pass. */
7076 int i
= link_info
.relax_pass
;
7078 /* The backend can use it to determine the current pass. */
7079 link_info
.relax_pass
= 0;
7083 /* Keep relaxing until bfd_relax_section gives up. */
7084 bfd_boolean relax_again
;
7086 link_info
.relax_trip
= -1;
7089 link_info
.relax_trip
++;
7091 /* Note: pe-dll.c does something like this also. If you find
7092 you need to change this code, you probably need to change
7093 pe-dll.c also. DJ */
7095 /* Do all the assignments with our current guesses as to
7097 lang_do_assignments (lang_assigning_phase_enum
);
7099 /* We must do this after lang_do_assignments, because it uses
7101 lang_reset_memory_regions ();
7103 /* Perform another relax pass - this time we know where the
7104 globals are, so can make a better guess. */
7105 relax_again
= FALSE
;
7106 lang_size_sections (&relax_again
, FALSE
);
7108 while (relax_again
);
7110 link_info
.relax_pass
++;
7117 /* Final extra sizing to report errors. */
7118 lang_do_assignments (lang_assigning_phase_enum
);
7119 lang_reset_memory_regions ();
7120 lang_size_sections (NULL
, TRUE
);
7124 #ifdef ENABLE_PLUGINS
7125 /* Find the insert point for the plugin's replacement files. We
7126 place them after the first claimed real object file, or if the
7127 first claimed object is an archive member, after the last real
7128 object file immediately preceding the archive. In the event
7129 no objects have been claimed at all, we return the first dummy
7130 object file on the list as the insert point; that works, but
7131 the callee must be careful when relinking the file_chain as it
7132 is not actually on that chain, only the statement_list and the
7133 input_file list; in that case, the replacement files must be
7134 inserted at the head of the file_chain. */
7136 static lang_input_statement_type
*
7137 find_replacements_insert_point (void)
7139 lang_input_statement_type
*claim1
, *lastobject
;
7140 lastobject
= &input_file_chain
.head
->input_statement
;
7141 for (claim1
= &file_chain
.head
->input_statement
;
7143 claim1
= &claim1
->next
->input_statement
)
7145 if (claim1
->flags
.claimed
)
7146 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
7147 /* Update lastobject if this is a real object file. */
7148 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
7149 lastobject
= claim1
;
7151 /* No files were claimed by the plugin. Choose the last object
7152 file found on the list (maybe the first, dummy entry) as the
7157 /* Find where to insert ADD, an archive element or shared library
7158 added during a rescan. */
7160 static lang_statement_union_type
**
7161 find_rescan_insertion (lang_input_statement_type
*add
)
7163 bfd
*add_bfd
= add
->the_bfd
;
7164 lang_input_statement_type
*f
;
7165 lang_input_statement_type
*last_loaded
= NULL
;
7166 lang_input_statement_type
*before
= NULL
;
7167 lang_statement_union_type
**iter
= NULL
;
7169 if (add_bfd
->my_archive
!= NULL
)
7170 add_bfd
= add_bfd
->my_archive
;
7172 /* First look through the input file chain, to find an object file
7173 before the one we've rescanned. Normal object files always
7174 appear on both the input file chain and the file chain, so this
7175 lets us get quickly to somewhere near the correct place on the
7176 file chain if it is full of archive elements. Archives don't
7177 appear on the file chain, but if an element has been extracted
7178 then their input_statement->next points at it. */
7179 for (f
= &input_file_chain
.head
->input_statement
;
7181 f
= &f
->next_real_file
->input_statement
)
7183 if (f
->the_bfd
== add_bfd
)
7185 before
= last_loaded
;
7186 if (f
->next
!= NULL
)
7187 return &f
->next
->input_statement
.next
;
7189 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7193 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7195 iter
= &(*iter
)->input_statement
.next
)
7196 if (!(*iter
)->input_statement
.flags
.claim_archive
7197 && (*iter
)->input_statement
.the_bfd
->my_archive
== NULL
)
7203 /* Insert SRCLIST into DESTLIST after given element by chaining
7204 on FIELD as the next-pointer. (Counterintuitively does not need
7205 a pointer to the actual after-node itself, just its chain field.) */
7208 lang_list_insert_after (lang_statement_list_type
*destlist
,
7209 lang_statement_list_type
*srclist
,
7210 lang_statement_union_type
**field
)
7212 *(srclist
->tail
) = *field
;
7213 *field
= srclist
->head
;
7214 if (destlist
->tail
== field
)
7215 destlist
->tail
= srclist
->tail
;
7218 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7219 was taken as a copy of it and leave them in ORIGLIST. */
7222 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7223 lang_statement_list_type
*origlist
)
7225 union lang_statement_union
**savetail
;
7226 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7227 ASSERT (origlist
->head
== destlist
->head
);
7228 savetail
= origlist
->tail
;
7229 origlist
->head
= *(savetail
);
7230 origlist
->tail
= destlist
->tail
;
7231 destlist
->tail
= savetail
;
7234 #endif /* ENABLE_PLUGINS */
7236 /* Add NAME to the list of garbage collection entry points. */
7239 lang_add_gc_name (const char *name
)
7241 struct bfd_sym_chain
*sym
;
7246 sym
= (struct bfd_sym_chain
*) stat_alloc (sizeof (*sym
));
7248 sym
->next
= link_info
.gc_sym_list
;
7250 link_info
.gc_sym_list
= sym
;
7253 /* Check relocations. */
7256 lang_check_relocs (void)
7258 if (link_info
.check_relocs_after_open_input
)
7262 for (abfd
= link_info
.input_bfds
;
7263 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7264 if (!bfd_link_check_relocs (abfd
, &link_info
))
7266 /* No object output, fail return. */
7267 config
.make_executable
= FALSE
;
7268 /* Note: we do not abort the loop, but rather
7269 continue the scan in case there are other
7270 bad relocations to report. */
7275 /* Look through all output sections looking for places where we can
7276 propagate forward the lma region. */
7279 lang_propagate_lma_regions (void)
7281 lang_output_section_statement_type
*os
;
7283 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7287 if (os
->prev
!= NULL
7288 && os
->lma_region
== NULL
7289 && os
->load_base
== NULL
7290 && os
->addr_tree
== NULL
7291 && os
->region
== os
->prev
->region
)
7292 os
->lma_region
= os
->prev
->lma_region
;
7299 /* Finalize dynamic list. */
7300 if (link_info
.dynamic_list
)
7301 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
7303 current_target
= default_target
;
7305 /* Open the output file. */
7306 lang_for_each_statement (ldlang_open_output
);
7309 ldemul_create_output_section_statements ();
7311 /* Add to the hash table all undefineds on the command line. */
7312 lang_place_undefineds ();
7314 if (!bfd_section_already_linked_table_init ())
7315 einfo (_("%F%P: can not create hash table: %E\n"));
7317 /* Create a bfd for each input file. */
7318 current_target
= default_target
;
7319 lang_statement_iteration
++;
7320 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
7321 /* open_input_bfds also handles assignments, so we can give values
7322 to symbolic origin/length now. */
7323 lang_do_memory_regions ();
7325 #ifdef ENABLE_PLUGINS
7326 if (link_info
.lto_plugin_active
)
7328 lang_statement_list_type added
;
7329 lang_statement_list_type files
, inputfiles
;
7331 /* Now all files are read, let the plugin(s) decide if there
7332 are any more to be added to the link before we call the
7333 emulation's after_open hook. We create a private list of
7334 input statements for this purpose, which we will eventually
7335 insert into the global statement list after the first claimed
7338 /* We need to manipulate all three chains in synchrony. */
7340 inputfiles
= input_file_chain
;
7341 if (plugin_call_all_symbols_read ())
7342 einfo (_("%F%P: %s: plugin reported error after all symbols read\n"),
7343 plugin_error_plugin ());
7344 /* Open any newly added files, updating the file chains. */
7345 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
7346 /* Restore the global list pointer now they have all been added. */
7347 lang_list_remove_tail (stat_ptr
, &added
);
7348 /* And detach the fresh ends of the file lists. */
7349 lang_list_remove_tail (&file_chain
, &files
);
7350 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
7351 /* Were any new files added? */
7352 if (added
.head
!= NULL
)
7354 /* If so, we will insert them into the statement list immediately
7355 after the first input file that was claimed by the plugin. */
7356 plugin_insert
= find_replacements_insert_point ();
7357 /* If a plugin adds input files without having claimed any, we
7358 don't really have a good idea where to place them. Just putting
7359 them at the start or end of the list is liable to leave them
7360 outside the crtbegin...crtend range. */
7361 ASSERT (plugin_insert
!= NULL
);
7362 /* Splice the new statement list into the old one. */
7363 lang_list_insert_after (stat_ptr
, &added
,
7364 &plugin_insert
->header
.next
);
7365 /* Likewise for the file chains. */
7366 lang_list_insert_after (&input_file_chain
, &inputfiles
,
7367 &plugin_insert
->next_real_file
);
7368 /* We must be careful when relinking file_chain; we may need to
7369 insert the new files at the head of the list if the insert
7370 point chosen is the dummy first input file. */
7371 if (plugin_insert
->filename
)
7372 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
7374 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
7376 /* Rescan archives in case new undefined symbols have appeared. */
7378 lang_statement_iteration
++;
7379 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
7380 lang_list_remove_tail (&file_chain
, &files
);
7381 while (files
.head
!= NULL
)
7383 lang_statement_union_type
**insert
;
7384 lang_statement_union_type
**iter
, *temp
;
7387 insert
= find_rescan_insertion (&files
.head
->input_statement
);
7388 /* All elements from an archive can be added at once. */
7389 iter
= &files
.head
->input_statement
.next
;
7390 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
7391 if (my_arch
!= NULL
)
7392 for (; *iter
!= NULL
; iter
= &(*iter
)->input_statement
.next
)
7393 if ((*iter
)->input_statement
.the_bfd
->my_archive
!= my_arch
)
7396 *insert
= files
.head
;
7399 if (my_arch
!= NULL
)
7401 lang_input_statement_type
*parent
= my_arch
->usrdata
;
7403 parent
->next
= (lang_statement_union_type
*)
7405 - offsetof (lang_input_statement_type
, next
));
7410 #endif /* ENABLE_PLUGINS */
7412 /* Make sure that nobody has tried to add a symbol to this list
7414 ASSERT (link_info
.gc_sym_list
== NULL
);
7416 link_info
.gc_sym_list
= &entry_symbol
;
7418 if (entry_symbol
.name
== NULL
)
7420 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
7422 /* entry_symbol is normally initialied by a ENTRY definition in the
7423 linker script or the -e command line option. But if neither of
7424 these have been used, the target specific backend may still have
7425 provided an entry symbol via a call to lang_default_entry().
7426 Unfortunately this value will not be processed until lang_end()
7427 is called, long after this function has finished. So detect this
7428 case here and add the target's entry symbol to the list of starting
7429 points for garbage collection resolution. */
7430 lang_add_gc_name (entry_symbol_default
);
7433 lang_add_gc_name (link_info
.init_function
);
7434 lang_add_gc_name (link_info
.fini_function
);
7436 ldemul_after_open ();
7437 if (config
.map_file
!= NULL
)
7438 lang_print_asneeded ();
7440 bfd_section_already_linked_table_free ();
7442 /* Make sure that we're not mixing architectures. We call this
7443 after all the input files have been opened, but before we do any
7444 other processing, so that any operations merge_private_bfd_data
7445 does on the output file will be known during the rest of the
7449 /* Handle .exports instead of a version script if we're told to do so. */
7450 if (command_line
.version_exports_section
)
7451 lang_do_version_exports_section ();
7453 /* Build all sets based on the information gathered from the input
7455 ldctor_build_sets ();
7457 /* Give initial values for __start and __stop symbols, so that ELF
7458 gc_sections will keep sections referenced by these symbols. Must
7459 be done before lang_do_assignments below. */
7460 if (config
.build_constructors
)
7461 lang_init_start_stop ();
7463 /* PR 13683: We must rerun the assignments prior to running garbage
7464 collection in order to make sure that all symbol aliases are resolved. */
7465 lang_do_assignments (lang_mark_phase_enum
);
7466 expld
.phase
= lang_first_phase_enum
;
7468 /* Size up the common data. */
7471 /* Remove unreferenced sections if asked to. */
7472 lang_gc_sections ();
7474 /* Check relocations. */
7475 lang_check_relocs ();
7477 ldemul_after_check_relocs ();
7479 /* Update wild statements. */
7480 update_wild_statements (statement_list
.head
);
7482 /* Run through the contours of the script and attach input sections
7483 to the correct output sections. */
7484 lang_statement_iteration
++;
7485 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
7487 process_insert_statements ();
7489 /* Find any sections not attached explicitly and handle them. */
7490 lang_place_orphans ();
7492 if (!bfd_link_relocatable (&link_info
))
7496 /* Merge SEC_MERGE sections. This has to be done after GC of
7497 sections, so that GCed sections are not merged, but before
7498 assigning dynamic symbols, since removing whole input sections
7500 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
7502 /* Look for a text section and set the readonly attribute in it. */
7503 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
7507 if (config
.text_read_only
)
7508 found
->flags
|= SEC_READONLY
;
7510 found
->flags
&= ~SEC_READONLY
;
7514 /* Copy forward lma regions for output sections in same lma region. */
7515 lang_propagate_lma_regions ();
7517 /* Defining __start/__stop symbols early for --gc-sections to work
7518 around a glibc build problem can result in these symbols being
7519 defined when they should not be. Fix them now. */
7520 if (config
.build_constructors
)
7521 lang_undef_start_stop ();
7523 /* Define .startof./.sizeof. symbols with preliminary values before
7524 dynamic symbols are created. */
7525 if (!bfd_link_relocatable (&link_info
))
7526 lang_init_startof_sizeof ();
7528 /* Do anything special before sizing sections. This is where ELF
7529 and other back-ends size dynamic sections. */
7530 ldemul_before_allocation ();
7532 /* We must record the program headers before we try to fix the
7533 section positions, since they will affect SIZEOF_HEADERS. */
7534 lang_record_phdrs ();
7536 /* Check relro sections. */
7537 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
7538 lang_find_relro_sections ();
7540 /* Size up the sections. */
7541 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
7543 /* See if anything special should be done now we know how big
7544 everything is. This is where relaxation is done. */
7545 ldemul_after_allocation ();
7547 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
7548 lang_finalize_start_stop ();
7550 /* Do all the assignments again, to report errors. Assignment
7551 statements are processed multiple times, updating symbols; In
7552 open_input_bfds, lang_do_assignments, and lang_size_sections.
7553 Since lang_relax_sections calls lang_do_assignments, symbols are
7554 also updated in ldemul_after_allocation. */
7555 lang_do_assignments (lang_final_phase_enum
);
7559 /* Convert absolute symbols to section relative. */
7560 ldexp_finalize_syms ();
7562 /* Make sure that the section addresses make sense. */
7563 if (command_line
.check_section_addresses
)
7564 lang_check_section_addresses ();
7566 /* Check any required symbols are known. */
7567 ldlang_check_require_defined_symbols ();
7572 /* EXPORTED TO YACC */
7575 lang_add_wild (struct wildcard_spec
*filespec
,
7576 struct wildcard_list
*section_list
,
7577 bfd_boolean keep_sections
)
7579 struct wildcard_list
*curr
, *next
;
7580 lang_wild_statement_type
*new_stmt
;
7582 /* Reverse the list as the parser puts it back to front. */
7583 for (curr
= section_list
, section_list
= NULL
;
7585 section_list
= curr
, curr
= next
)
7588 curr
->next
= section_list
;
7591 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
7593 if (strcmp (filespec
->name
, "*") == 0)
7594 filespec
->name
= NULL
;
7595 else if (!wildcardp (filespec
->name
))
7596 lang_has_input_file
= TRUE
;
7599 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
7600 new_stmt
->filename
= NULL
;
7601 new_stmt
->filenames_sorted
= FALSE
;
7602 new_stmt
->section_flag_list
= NULL
;
7603 new_stmt
->exclude_name_list
= NULL
;
7604 if (filespec
!= NULL
)
7606 new_stmt
->filename
= filespec
->name
;
7607 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
7608 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
7609 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
7611 new_stmt
->section_list
= section_list
;
7612 new_stmt
->keep_sections
= keep_sections
;
7613 lang_list_init (&new_stmt
->children
);
7614 analyze_walk_wild_section_handler (new_stmt
);
7618 lang_section_start (const char *name
, etree_type
*address
,
7619 const segment_type
*segment
)
7621 lang_address_statement_type
*ad
;
7623 ad
= new_stat (lang_address_statement
, stat_ptr
);
7624 ad
->section_name
= name
;
7625 ad
->address
= address
;
7626 ad
->segment
= segment
;
7629 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7630 because of a -e argument on the command line, or zero if this is
7631 called by ENTRY in a linker script. Command line arguments take
7635 lang_add_entry (const char *name
, bfd_boolean cmdline
)
7637 if (entry_symbol
.name
== NULL
7639 || !entry_from_cmdline
)
7641 entry_symbol
.name
= name
;
7642 entry_from_cmdline
= cmdline
;
7646 /* Set the default start symbol to NAME. .em files should use this,
7647 not lang_add_entry, to override the use of "start" if neither the
7648 linker script nor the command line specifies an entry point. NAME
7649 must be permanently allocated. */
7651 lang_default_entry (const char *name
)
7653 entry_symbol_default
= name
;
7657 lang_add_target (const char *name
)
7659 lang_target_statement_type
*new_stmt
;
7661 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
7662 new_stmt
->target
= name
;
7666 lang_add_map (const char *name
)
7673 map_option_f
= TRUE
;
7681 lang_add_fill (fill_type
*fill
)
7683 lang_fill_statement_type
*new_stmt
;
7685 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
7686 new_stmt
->fill
= fill
;
7690 lang_add_data (int type
, union etree_union
*exp
)
7692 lang_data_statement_type
*new_stmt
;
7694 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
7695 new_stmt
->exp
= exp
;
7696 new_stmt
->type
= type
;
7699 /* Create a new reloc statement. RELOC is the BFD relocation type to
7700 generate. HOWTO is the corresponding howto structure (we could
7701 look this up, but the caller has already done so). SECTION is the
7702 section to generate a reloc against, or NAME is the name of the
7703 symbol to generate a reloc against. Exactly one of SECTION and
7704 NAME must be NULL. ADDEND is an expression for the addend. */
7707 lang_add_reloc (bfd_reloc_code_real_type reloc
,
7708 reloc_howto_type
*howto
,
7711 union etree_union
*addend
)
7713 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
7717 p
->section
= section
;
7719 p
->addend_exp
= addend
;
7721 p
->addend_value
= 0;
7722 p
->output_section
= NULL
;
7723 p
->output_offset
= 0;
7726 lang_assignment_statement_type
*
7727 lang_add_assignment (etree_type
*exp
)
7729 lang_assignment_statement_type
*new_stmt
;
7731 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
7732 new_stmt
->exp
= exp
;
7737 lang_add_attribute (enum statement_enum attribute
)
7739 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
7743 lang_startup (const char *name
)
7745 if (first_file
->filename
!= NULL
)
7747 einfo (_("%F%P: multiple STARTUP files\n"));
7749 first_file
->filename
= name
;
7750 first_file
->local_sym_name
= name
;
7751 first_file
->flags
.real
= TRUE
;
7755 lang_float (bfd_boolean maybe
)
7757 lang_float_flag
= maybe
;
7761 /* Work out the load- and run-time regions from a script statement, and
7762 store them in *LMA_REGION and *REGION respectively.
7764 MEMSPEC is the name of the run-time region, or the value of
7765 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7766 LMA_MEMSPEC is the name of the load-time region, or null if the
7767 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7768 had an explicit load address.
7770 It is an error to specify both a load region and a load address. */
7773 lang_get_regions (lang_memory_region_type
**region
,
7774 lang_memory_region_type
**lma_region
,
7775 const char *memspec
,
7776 const char *lma_memspec
,
7777 bfd_boolean have_lma
,
7778 bfd_boolean have_vma
)
7780 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7782 /* If no runtime region or VMA has been specified, but the load region
7783 has been specified, then use the load region for the runtime region
7785 if (lma_memspec
!= NULL
7787 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7788 *region
= *lma_region
;
7790 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7792 if (have_lma
&& lma_memspec
!= 0)
7793 einfo (_("%X%P:%pS: section has both a load address and a load region\n"),
7798 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7799 lang_output_section_phdr_list
*phdrs
,
7800 const char *lma_memspec
)
7802 lang_get_regions (¤t_section
->region
,
7803 ¤t_section
->lma_region
,
7804 memspec
, lma_memspec
,
7805 current_section
->load_base
!= NULL
,
7806 current_section
->addr_tree
!= NULL
);
7808 current_section
->fill
= fill
;
7809 current_section
->phdrs
= phdrs
;
7814 lang_statement_append (lang_statement_list_type
*list
,
7815 lang_statement_union_type
*element
,
7816 lang_statement_union_type
**field
)
7818 *(list
->tail
) = element
;
7822 /* Set the output format type. -oformat overrides scripts. */
7825 lang_add_output_format (const char *format
,
7830 if (output_target
== NULL
|| !from_script
)
7832 if (command_line
.endian
== ENDIAN_BIG
7835 else if (command_line
.endian
== ENDIAN_LITTLE
7839 output_target
= format
;
7844 lang_add_insert (const char *where
, int is_before
)
7846 lang_insert_statement_type
*new_stmt
;
7848 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7849 new_stmt
->where
= where
;
7850 new_stmt
->is_before
= is_before
;
7851 saved_script_handle
= previous_script_handle
;
7854 /* Enter a group. This creates a new lang_group_statement, and sets
7855 stat_ptr to build new statements within the group. */
7858 lang_enter_group (void)
7860 lang_group_statement_type
*g
;
7862 g
= new_stat (lang_group_statement
, stat_ptr
);
7863 lang_list_init (&g
->children
);
7864 push_stat_ptr (&g
->children
);
7867 /* Leave a group. This just resets stat_ptr to start writing to the
7868 regular list of statements again. Note that this will not work if
7869 groups can occur inside anything else which can adjust stat_ptr,
7870 but currently they can't. */
7873 lang_leave_group (void)
7878 /* Add a new program header. This is called for each entry in a PHDRS
7879 command in a linker script. */
7882 lang_new_phdr (const char *name
,
7884 bfd_boolean filehdr
,
7889 struct lang_phdr
*n
, **pp
;
7892 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7895 n
->type
= exp_get_vma (type
, 0, "program header type");
7896 n
->filehdr
= filehdr
;
7901 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7903 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7906 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7908 einfo (_("%X%P:%pS: PHDRS and FILEHDR are not supported"
7909 " when prior PT_LOAD headers lack them\n"), NULL
);
7916 /* Record the program header information in the output BFD. FIXME: We
7917 should not be calling an ELF specific function here. */
7920 lang_record_phdrs (void)
7924 lang_output_section_phdr_list
*last
;
7925 struct lang_phdr
*l
;
7926 lang_output_section_statement_type
*os
;
7929 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7932 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7939 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7943 lang_output_section_phdr_list
*pl
;
7945 if (os
->constraint
< 0)
7953 if (os
->sectype
== noload_section
7954 || os
->bfd_section
== NULL
7955 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7958 /* Don't add orphans to PT_INTERP header. */
7964 lang_output_section_statement_type
*tmp_os
;
7966 /* If we have not run across a section with a program
7967 header assigned to it yet, then scan forwards to find
7968 one. This prevents inconsistencies in the linker's
7969 behaviour when a script has specified just a single
7970 header and there are sections in that script which are
7971 not assigned to it, and which occur before the first
7972 use of that header. See here for more details:
7973 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7974 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7977 last
= tmp_os
->phdrs
;
7981 einfo (_("%F%P: no sections assigned to phdrs\n"));
7986 if (os
->bfd_section
== NULL
)
7989 for (; pl
!= NULL
; pl
= pl
->next
)
7991 if (strcmp (pl
->name
, l
->name
) == 0)
7996 secs
= (asection
**) xrealloc (secs
,
7997 alc
* sizeof (asection
*));
7999 secs
[c
] = os
->bfd_section
;
8006 if (l
->flags
== NULL
)
8009 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
8014 at
= exp_get_vma (l
->at
, 0, "phdr load address");
8016 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
8017 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
8018 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
8019 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
8024 /* Make sure all the phdr assignments succeeded. */
8025 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
8029 lang_output_section_phdr_list
*pl
;
8031 if (os
->constraint
< 0
8032 || os
->bfd_section
== NULL
)
8035 for (pl
= os
->phdrs
;
8038 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
8039 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
8040 os
->name
, pl
->name
);
8044 /* Record a list of sections which may not be cross referenced. */
8047 lang_add_nocrossref (lang_nocrossref_type
*l
)
8049 struct lang_nocrossrefs
*n
;
8051 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
8052 n
->next
= nocrossref_list
;
8054 n
->onlyfirst
= FALSE
;
8055 nocrossref_list
= n
;
8057 /* Set notice_all so that we get informed about all symbols. */
8058 link_info
.notice_all
= TRUE
;
8061 /* Record a section that cannot be referenced from a list of sections. */
8064 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
8066 lang_add_nocrossref (l
);
8067 nocrossref_list
->onlyfirst
= TRUE
;
8070 /* Overlay handling. We handle overlays with some static variables. */
8072 /* The overlay virtual address. */
8073 static etree_type
*overlay_vma
;
8074 /* And subsection alignment. */
8075 static etree_type
*overlay_subalign
;
8077 /* An expression for the maximum section size seen so far. */
8078 static etree_type
*overlay_max
;
8080 /* A list of all the sections in this overlay. */
8082 struct overlay_list
{
8083 struct overlay_list
*next
;
8084 lang_output_section_statement_type
*os
;
8087 static struct overlay_list
*overlay_list
;
8089 /* Start handling an overlay. */
8092 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
8094 /* The grammar should prevent nested overlays from occurring. */
8095 ASSERT (overlay_vma
== NULL
8096 && overlay_subalign
== NULL
8097 && overlay_max
== NULL
);
8099 overlay_vma
= vma_expr
;
8100 overlay_subalign
= subalign
;
8103 /* Start a section in an overlay. We handle this by calling
8104 lang_enter_output_section_statement with the correct VMA.
8105 lang_leave_overlay sets up the LMA and memory regions. */
8108 lang_enter_overlay_section (const char *name
)
8110 struct overlay_list
*n
;
8113 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
8114 0, overlay_subalign
, 0, 0, 0);
8116 /* If this is the first section, then base the VMA of future
8117 sections on this one. This will work correctly even if `.' is
8118 used in the addresses. */
8119 if (overlay_list
== NULL
)
8120 overlay_vma
= exp_nameop (ADDR
, name
);
8122 /* Remember the section. */
8123 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
8124 n
->os
= current_section
;
8125 n
->next
= overlay_list
;
8128 size
= exp_nameop (SIZEOF
, name
);
8130 /* Arrange to work out the maximum section end address. */
8131 if (overlay_max
== NULL
)
8134 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
8137 /* Finish a section in an overlay. There isn't any special to do
8141 lang_leave_overlay_section (fill_type
*fill
,
8142 lang_output_section_phdr_list
*phdrs
)
8149 name
= current_section
->name
;
8151 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
8152 region and that no load-time region has been specified. It doesn't
8153 really matter what we say here, since lang_leave_overlay will
8155 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
8157 /* Define the magic symbols. */
8159 clean
= (char *) xmalloc (strlen (name
) + 1);
8161 for (s1
= name
; *s1
!= '\0'; s1
++)
8162 if (ISALNUM (*s1
) || *s1
== '_')
8166 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8167 sprintf (buf
, "__load_start_%s", clean
);
8168 lang_add_assignment (exp_provide (buf
,
8169 exp_nameop (LOADADDR
, name
),
8172 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8173 sprintf (buf
, "__load_stop_%s", clean
);
8174 lang_add_assignment (exp_provide (buf
,
8176 exp_nameop (LOADADDR
, name
),
8177 exp_nameop (SIZEOF
, name
)),
8183 /* Finish an overlay. If there are any overlay wide settings, this
8184 looks through all the sections in the overlay and sets them. */
8187 lang_leave_overlay (etree_type
*lma_expr
,
8190 const char *memspec
,
8191 lang_output_section_phdr_list
*phdrs
,
8192 const char *lma_memspec
)
8194 lang_memory_region_type
*region
;
8195 lang_memory_region_type
*lma_region
;
8196 struct overlay_list
*l
;
8197 lang_nocrossref_type
*nocrossref
;
8199 lang_get_regions (®ion
, &lma_region
,
8200 memspec
, lma_memspec
,
8201 lma_expr
!= NULL
, FALSE
);
8205 /* After setting the size of the last section, set '.' to end of the
8207 if (overlay_list
!= NULL
)
8209 overlay_list
->os
->update_dot
= 1;
8210 overlay_list
->os
->update_dot_tree
8211 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
8217 struct overlay_list
*next
;
8219 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8222 l
->os
->region
= region
;
8223 l
->os
->lma_region
= lma_region
;
8225 /* The first section has the load address specified in the
8226 OVERLAY statement. The rest are worked out from that.
8227 The base address is not needed (and should be null) if
8228 an LMA region was specified. */
8231 l
->os
->load_base
= lma_expr
;
8232 l
->os
->sectype
= normal_section
;
8234 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
8235 l
->os
->phdrs
= phdrs
;
8239 lang_nocrossref_type
*nc
;
8241 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
8242 nc
->name
= l
->os
->name
;
8243 nc
->next
= nocrossref
;
8252 if (nocrossref
!= NULL
)
8253 lang_add_nocrossref (nocrossref
);
8256 overlay_list
= NULL
;
8258 overlay_subalign
= NULL
;
8261 /* Version handling. This is only useful for ELF. */
8263 /* If PREV is NULL, return first version pattern matching particular symbol.
8264 If PREV is non-NULL, return first version pattern matching particular
8265 symbol after PREV (previously returned by lang_vers_match). */
8267 static struct bfd_elf_version_expr
*
8268 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
8269 struct bfd_elf_version_expr
*prev
,
8273 const char *cxx_sym
= sym
;
8274 const char *java_sym
= sym
;
8275 struct bfd_elf_version_expr
*expr
= NULL
;
8276 enum demangling_styles curr_style
;
8278 curr_style
= CURRENT_DEMANGLING_STYLE
;
8279 cplus_demangle_set_style (no_demangling
);
8280 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
8283 cplus_demangle_set_style (curr_style
);
8285 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8287 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
8288 DMGL_PARAMS
| DMGL_ANSI
);
8292 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8294 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
8299 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
8301 struct bfd_elf_version_expr e
;
8303 switch (prev
? prev
->mask
: 0)
8306 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
8309 expr
= (struct bfd_elf_version_expr
*)
8310 htab_find ((htab_t
) head
->htab
, &e
);
8311 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
8312 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
8318 case BFD_ELF_VERSION_C_TYPE
:
8319 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8321 e
.pattern
= cxx_sym
;
8322 expr
= (struct bfd_elf_version_expr
*)
8323 htab_find ((htab_t
) head
->htab
, &e
);
8324 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
8325 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8331 case BFD_ELF_VERSION_CXX_TYPE
:
8332 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8334 e
.pattern
= java_sym
;
8335 expr
= (struct bfd_elf_version_expr
*)
8336 htab_find ((htab_t
) head
->htab
, &e
);
8337 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
8338 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8349 /* Finally, try the wildcards. */
8350 if (prev
== NULL
|| prev
->literal
)
8351 expr
= head
->remaining
;
8354 for (; expr
; expr
= expr
->next
)
8361 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
8364 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8366 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8370 if (fnmatch (expr
->pattern
, s
, 0) == 0)
8376 free ((char *) c_sym
);
8378 free ((char *) cxx_sym
);
8379 if (java_sym
!= sym
)
8380 free ((char *) java_sym
);
8384 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
8385 return a pointer to the symbol name with any backslash quotes removed. */
8388 realsymbol (const char *pattern
)
8391 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
8392 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
8394 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
8396 /* It is a glob pattern only if there is no preceding
8400 /* Remove the preceding backslash. */
8407 if (*p
== '?' || *p
== '*' || *p
== '[')
8414 backslash
= *p
== '\\';
8430 /* This is called for each variable name or match expression. NEW_NAME is
8431 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
8432 pattern to be matched against symbol names. */
8434 struct bfd_elf_version_expr
*
8435 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
8436 const char *new_name
,
8438 bfd_boolean literal_p
)
8440 struct bfd_elf_version_expr
*ret
;
8442 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
8446 ret
->literal
= TRUE
;
8447 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
8448 if (ret
->pattern
== NULL
)
8450 ret
->pattern
= new_name
;
8451 ret
->literal
= FALSE
;
8454 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
8455 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8456 else if (strcasecmp (lang
, "C++") == 0)
8457 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
8458 else if (strcasecmp (lang
, "Java") == 0)
8459 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
8462 einfo (_("%X%P: unknown language `%s' in version information\n"),
8464 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8467 return ldemul_new_vers_pattern (ret
);
8470 /* This is called for each set of variable names and match
8473 struct bfd_elf_version_tree
*
8474 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
8475 struct bfd_elf_version_expr
*locals
)
8477 struct bfd_elf_version_tree
*ret
;
8479 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
8480 ret
->globals
.list
= globals
;
8481 ret
->locals
.list
= locals
;
8482 ret
->match
= lang_vers_match
;
8483 ret
->name_indx
= (unsigned int) -1;
8487 /* This static variable keeps track of version indices. */
8489 static int version_index
;
8492 version_expr_head_hash (const void *p
)
8494 const struct bfd_elf_version_expr
*e
=
8495 (const struct bfd_elf_version_expr
*) p
;
8497 return htab_hash_string (e
->pattern
);
8501 version_expr_head_eq (const void *p1
, const void *p2
)
8503 const struct bfd_elf_version_expr
*e1
=
8504 (const struct bfd_elf_version_expr
*) p1
;
8505 const struct bfd_elf_version_expr
*e2
=
8506 (const struct bfd_elf_version_expr
*) p2
;
8508 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
8512 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
8515 struct bfd_elf_version_expr
*e
, *next
;
8516 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
8518 for (e
= head
->list
; e
; e
= e
->next
)
8522 head
->mask
|= e
->mask
;
8527 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
8528 version_expr_head_eq
, NULL
);
8529 list_loc
= &head
->list
;
8530 remaining_loc
= &head
->remaining
;
8531 for (e
= head
->list
; e
; e
= next
)
8537 remaining_loc
= &e
->next
;
8541 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
8545 struct bfd_elf_version_expr
*e1
, *last
;
8547 e1
= (struct bfd_elf_version_expr
*) *loc
;
8551 if (e1
->mask
== e
->mask
)
8559 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
8563 /* This is a duplicate. */
8564 /* FIXME: Memory leak. Sometimes pattern is not
8565 xmalloced alone, but in larger chunk of memory. */
8566 /* free (e->pattern); */
8571 e
->next
= last
->next
;
8579 list_loc
= &e
->next
;
8583 *remaining_loc
= NULL
;
8584 *list_loc
= head
->remaining
;
8587 head
->remaining
= head
->list
;
8590 /* This is called when we know the name and dependencies of the
8594 lang_register_vers_node (const char *name
,
8595 struct bfd_elf_version_tree
*version
,
8596 struct bfd_elf_version_deps
*deps
)
8598 struct bfd_elf_version_tree
*t
, **pp
;
8599 struct bfd_elf_version_expr
*e1
;
8604 if (link_info
.version_info
!= NULL
8605 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
8607 einfo (_("%X%P: anonymous version tag cannot be combined"
8608 " with other version tags\n"));
8613 /* Make sure this node has a unique name. */
8614 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8615 if (strcmp (t
->name
, name
) == 0)
8616 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
8618 lang_finalize_version_expr_head (&version
->globals
);
8619 lang_finalize_version_expr_head (&version
->locals
);
8621 /* Check the global and local match names, and make sure there
8622 aren't any duplicates. */
8624 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
8626 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8628 struct bfd_elf_version_expr
*e2
;
8630 if (t
->locals
.htab
&& e1
->literal
)
8632 e2
= (struct bfd_elf_version_expr
*)
8633 htab_find ((htab_t
) t
->locals
.htab
, e1
);
8634 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8636 if (e1
->mask
== e2
->mask
)
8637 einfo (_("%X%P: duplicate expression `%s'"
8638 " in version information\n"), e1
->pattern
);
8642 else if (!e1
->literal
)
8643 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8644 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8645 && e1
->mask
== e2
->mask
)
8646 einfo (_("%X%P: duplicate expression `%s'"
8647 " in version information\n"), e1
->pattern
);
8651 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
8653 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8655 struct bfd_elf_version_expr
*e2
;
8657 if (t
->globals
.htab
&& e1
->literal
)
8659 e2
= (struct bfd_elf_version_expr
*)
8660 htab_find ((htab_t
) t
->globals
.htab
, e1
);
8661 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8663 if (e1
->mask
== e2
->mask
)
8664 einfo (_("%X%P: duplicate expression `%s'"
8665 " in version information\n"),
8670 else if (!e1
->literal
)
8671 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8672 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8673 && e1
->mask
== e2
->mask
)
8674 einfo (_("%X%P: duplicate expression `%s'"
8675 " in version information\n"), e1
->pattern
);
8679 version
->deps
= deps
;
8680 version
->name
= name
;
8681 if (name
[0] != '\0')
8684 version
->vernum
= version_index
;
8687 version
->vernum
= 0;
8689 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8694 /* This is called when we see a version dependency. */
8696 struct bfd_elf_version_deps
*
8697 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
8699 struct bfd_elf_version_deps
*ret
;
8700 struct bfd_elf_version_tree
*t
;
8702 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
8705 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8707 if (strcmp (t
->name
, name
) == 0)
8709 ret
->version_needed
= t
;
8714 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
8716 ret
->version_needed
= NULL
;
8721 lang_do_version_exports_section (void)
8723 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
8725 LANG_FOR_EACH_INPUT_STATEMENT (is
)
8727 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
8735 contents
= (char *) xmalloc (len
);
8736 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
8737 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
8740 while (p
< contents
+ len
)
8742 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
8743 p
= strchr (p
, '\0') + 1;
8746 /* Do not free the contents, as we used them creating the regex. */
8748 /* Do not include this section in the link. */
8749 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
8752 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
8753 lang_register_vers_node (command_line
.version_exports_section
,
8754 lang_new_vers_node (greg
, lreg
), NULL
);
8757 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8760 lang_do_memory_regions (void)
8762 lang_memory_region_type
*r
= lang_memory_region_list
;
8764 for (; r
!= NULL
; r
= r
->next
)
8768 exp_fold_tree_no_dot (r
->origin_exp
);
8769 if (expld
.result
.valid_p
)
8771 r
->origin
= expld
.result
.value
;
8772 r
->current
= r
->origin
;
8775 einfo (_("%F%P: invalid origin for memory region %s\n"),
8780 exp_fold_tree_no_dot (r
->length_exp
);
8781 if (expld
.result
.valid_p
)
8782 r
->length
= expld
.result
.value
;
8784 einfo (_("%F%P: invalid length for memory region %s\n"),
8791 lang_add_unique (const char *name
)
8793 struct unique_sections
*ent
;
8795 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8796 if (strcmp (ent
->name
, name
) == 0)
8799 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8800 ent
->name
= xstrdup (name
);
8801 ent
->next
= unique_section_list
;
8802 unique_section_list
= ent
;
8805 /* Append the list of dynamic symbols to the existing one. */
8808 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8810 if (link_info
.dynamic_list
)
8812 struct bfd_elf_version_expr
*tail
;
8813 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8815 tail
->next
= link_info
.dynamic_list
->head
.list
;
8816 link_info
.dynamic_list
->head
.list
= dynamic
;
8820 struct bfd_elf_dynamic_list
*d
;
8822 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8823 d
->head
.list
= dynamic
;
8824 d
->match
= lang_vers_match
;
8825 link_info
.dynamic_list
= d
;
8829 /* Append the list of C++ typeinfo dynamic symbols to the existing
8833 lang_append_dynamic_list_cpp_typeinfo (void)
8835 const char *symbols
[] =
8837 "typeinfo name for*",
8840 struct bfd_elf_version_expr
*dynamic
= NULL
;
8843 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8844 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8847 lang_append_dynamic_list (dynamic
);
8850 /* Append the list of C++ operator new and delete dynamic symbols to the
8854 lang_append_dynamic_list_cpp_new (void)
8856 const char *symbols
[] =
8861 struct bfd_elf_version_expr
*dynamic
= NULL
;
8864 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8865 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8868 lang_append_dynamic_list (dynamic
);
8871 /* Scan a space and/or comma separated string of features. */
8874 lang_ld_feature (char *str
)
8882 while (*p
== ',' || ISSPACE (*p
))
8887 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8891 if (strcasecmp (p
, "SANE_EXPR") == 0)
8892 config
.sane_expr
= TRUE
;
8894 einfo (_("%X%P: unknown feature `%s'\n"), p
);
8900 /* Pretty print memory amount. */
8903 lang_print_memory_size (bfd_vma sz
)
8905 if ((sz
& 0x3fffffff) == 0)
8906 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
8907 else if ((sz
& 0xfffff) == 0)
8908 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
8909 else if ((sz
& 0x3ff) == 0)
8910 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
8912 printf (" %10" BFD_VMA_FMT
"u B", sz
);
8915 /* Implement --print-memory-usage: disply per region memory usage. */
8918 lang_print_memory_usage (void)
8920 lang_memory_region_type
*r
;
8922 printf ("Memory region Used Size Region Size %%age Used\n");
8923 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
8925 bfd_vma used_length
= r
->current
- r
->origin
;
8928 printf ("%16s: ",r
->name_list
.name
);
8929 lang_print_memory_size (used_length
);
8930 lang_print_memory_size ((bfd_vma
) r
->length
);
8932 percent
= used_length
* 100.0 / r
->length
;
8934 printf (" %6.2f%%\n", percent
);