1 /* Linker command language support.
2 Copyright (C) 1991-2017 Free Software Foundation, Inc.
4 This file is part of the GNU Binutils.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
23 #include "libiberty.h"
24 #include "filenames.h"
25 #include "safe-ctype.h"
45 #endif /* ENABLE_PLUGINS */
48 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
51 /* Convert between addresses in bytes and sizes in octets.
52 For currently supported targets, octets_per_byte is always a power
53 of two, so we can use shifts. */
54 #define TO_ADDR(X) ((X) >> opb_shift)
55 #define TO_SIZE(X) ((X) << opb_shift)
57 /* Local variables. */
58 static struct obstack stat_obstack
;
59 static struct obstack map_obstack
;
61 #define obstack_chunk_alloc xmalloc
62 #define obstack_chunk_free free
63 static const char *entry_symbol_default
= "start";
64 static bfd_boolean map_head_is_link_order
= FALSE
;
65 static lang_output_section_statement_type
*default_common_section
;
66 static bfd_boolean map_option_f
;
67 static bfd_vma print_dot
;
68 static lang_input_statement_type
*first_file
;
69 static const char *current_target
;
70 static lang_statement_list_type statement_list
;
71 static lang_statement_list_type
*stat_save
[10];
72 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
73 static struct unique_sections
*unique_section_list
;
74 static struct asneeded_minfo
*asneeded_list_head
;
75 static unsigned int opb_shift
= 0;
77 /* Forward declarations. */
78 static void exp_init_os (etree_type
*);
79 static lang_input_statement_type
*lookup_name (const char *);
80 static void insert_undefined (const char *);
81 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
82 static void print_statement (lang_statement_union_type
*,
83 lang_output_section_statement_type
*);
84 static void print_statement_list (lang_statement_union_type
*,
85 lang_output_section_statement_type
*);
86 static void print_statements (void);
87 static void print_input_section (asection
*, bfd_boolean
);
88 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
89 static void lang_record_phdrs (void);
90 static void lang_do_version_exports_section (void);
91 static void lang_finalize_version_expr_head
92 (struct bfd_elf_version_expr_head
*);
93 static void lang_do_memory_regions (void);
95 /* Exported variables. */
96 const char *output_target
;
97 lang_output_section_statement_type
*abs_output_section
;
98 lang_statement_list_type lang_output_section_statement
;
99 lang_statement_list_type
*stat_ptr
= &statement_list
;
100 lang_statement_list_type file_chain
= { NULL
, NULL
};
101 lang_statement_list_type input_file_chain
;
102 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
103 const char *entry_section
= ".text";
104 struct lang_input_statement_flags input_flags
;
105 bfd_boolean entry_from_cmdline
;
106 bfd_boolean undef_from_cmdline
;
107 bfd_boolean lang_has_input_file
= FALSE
;
108 bfd_boolean had_output_filename
= FALSE
;
109 bfd_boolean lang_float_flag
= FALSE
;
110 bfd_boolean delete_output_file_on_failure
= FALSE
;
111 struct lang_phdr
*lang_phdr_list
;
112 struct lang_nocrossrefs
*nocrossref_list
;
113 struct asneeded_minfo
**asneeded_list_tail
;
115 /* Functions that traverse the linker script and might evaluate
116 DEFINED() need to increment this at the start of the traversal. */
117 int lang_statement_iteration
= 0;
119 /* Return TRUE if the PATTERN argument is a wildcard pattern.
120 Although backslashes are treated specially if a pattern contains
121 wildcards, we do not consider the mere presence of a backslash to
122 be enough to cause the pattern to be treated as a wildcard.
123 That lets us handle DOS filenames more naturally. */
124 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
126 #define new_stat(x, y) \
127 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
129 #define outside_section_address(q) \
130 ((q)->output_offset + (q)->output_section->vma)
132 #define outside_symbol_address(q) \
133 ((q)->value + outside_section_address (q->section))
135 #define SECTION_NAME_MAP_LENGTH (16)
138 stat_alloc (size_t size
)
140 return obstack_alloc (&stat_obstack
, size
);
144 name_match (const char *pattern
, const char *name
)
146 if (wildcardp (pattern
))
147 return fnmatch (pattern
, name
, 0);
148 return strcmp (pattern
, name
);
151 /* If PATTERN is of the form archive:file, return a pointer to the
152 separator. If not, return NULL. */
155 archive_path (const char *pattern
)
159 if (link_info
.path_separator
== 0)
162 p
= strchr (pattern
, link_info
.path_separator
);
163 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
164 if (p
== NULL
|| link_info
.path_separator
!= ':')
167 /* Assume a match on the second char is part of drive specifier,
168 as in "c:\silly.dos". */
169 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
170 p
= strchr (p
+ 1, link_info
.path_separator
);
175 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
176 return whether F matches FILE_SPEC. */
179 input_statement_is_archive_path (const char *file_spec
, char *sep
,
180 lang_input_statement_type
*f
)
182 bfd_boolean match
= FALSE
;
185 || name_match (sep
+ 1, f
->filename
) == 0)
186 && ((sep
!= file_spec
)
187 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
191 if (sep
!= file_spec
)
193 const char *aname
= f
->the_bfd
->my_archive
->filename
;
195 match
= name_match (file_spec
, aname
) == 0;
196 *sep
= link_info
.path_separator
;
203 unique_section_p (const asection
*sec
,
204 const lang_output_section_statement_type
*os
)
206 struct unique_sections
*unam
;
209 if (!link_info
.resolve_section_groups
210 && sec
->owner
!= NULL
211 && bfd_is_group_section (sec
->owner
, sec
))
213 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
216 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
217 if (name_match (unam
->name
, secnam
) == 0)
223 /* Generic traversal routines for finding matching sections. */
225 /* Return true if FILE matches a pattern in EXCLUDE_LIST, otherwise return
229 walk_wild_file_in_exclude_list (struct name_list
*exclude_list
,
230 lang_input_statement_type
*file
)
232 struct name_list
*list_tmp
;
234 for (list_tmp
= exclude_list
;
236 list_tmp
= list_tmp
->next
)
238 char *p
= archive_path (list_tmp
->name
);
242 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
246 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
249 /* FIXME: Perhaps remove the following at some stage? Matching
250 unadorned archives like this was never documented and has
251 been superceded by the archive:path syntax. */
252 else if (file
->the_bfd
!= NULL
253 && file
->the_bfd
->my_archive
!= NULL
254 && name_match (list_tmp
->name
,
255 file
->the_bfd
->my_archive
->filename
) == 0)
262 /* Try processing a section against a wildcard. This just calls
263 the callback unless the filename exclusion list is present
264 and excludes the file. It's hardly ever present so this
265 function is very fast. */
268 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
269 lang_input_statement_type
*file
,
271 struct wildcard_list
*sec
,
275 /* Don't process sections from files which were excluded. */
276 if (walk_wild_file_in_exclude_list (sec
->spec
.exclude_name_list
, file
))
279 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
282 /* Lowest common denominator routine that can handle everything correctly,
286 walk_wild_section_general (lang_wild_statement_type
*ptr
,
287 lang_input_statement_type
*file
,
292 struct wildcard_list
*sec
;
294 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
296 sec
= ptr
->section_list
;
298 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
302 bfd_boolean skip
= FALSE
;
304 if (sec
->spec
.name
!= NULL
)
306 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
308 skip
= name_match (sec
->spec
.name
, sname
) != 0;
312 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
319 /* Routines to find a single section given its name. If there's more
320 than one section with that name, we report that. */
324 asection
*found_section
;
325 bfd_boolean multiple_sections_found
;
326 } section_iterator_callback_data
;
329 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
331 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
333 if (d
->found_section
!= NULL
)
335 d
->multiple_sections_found
= TRUE
;
339 d
->found_section
= s
;
344 find_section (lang_input_statement_type
*file
,
345 struct wildcard_list
*sec
,
346 bfd_boolean
*multiple_sections_found
)
348 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
350 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
351 section_iterator_callback
, &cb_data
);
352 *multiple_sections_found
= cb_data
.multiple_sections_found
;
353 return cb_data
.found_section
;
356 /* Code for handling simple wildcards without going through fnmatch,
357 which can be expensive because of charset translations etc. */
359 /* A simple wild is a literal string followed by a single '*',
360 where the literal part is at least 4 characters long. */
363 is_simple_wild (const char *name
)
365 size_t len
= strcspn (name
, "*?[");
366 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
370 match_simple_wild (const char *pattern
, const char *name
)
372 /* The first four characters of the pattern are guaranteed valid
373 non-wildcard characters. So we can go faster. */
374 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
375 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
380 while (*pattern
!= '*')
381 if (*name
++ != *pattern
++)
387 /* Return the numerical value of the init_priority attribute from
388 section name NAME. */
391 get_init_priority (const char *name
)
394 unsigned long init_priority
;
396 /* GCC uses the following section names for the init_priority
397 attribute with numerical values 101 and 65535 inclusive. A
398 lower value means a higher priority.
400 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
401 decimal numerical value of the init_priority attribute.
402 The order of execution in .init_array is forward and
403 .fini_array is backward.
404 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
405 decimal numerical value of the init_priority attribute.
406 The order of execution in .ctors is backward and .dtors
409 if (strncmp (name
, ".init_array.", 12) == 0
410 || strncmp (name
, ".fini_array.", 12) == 0)
412 init_priority
= strtoul (name
+ 12, &end
, 10);
413 return *end
? 0 : init_priority
;
415 else if (strncmp (name
, ".ctors.", 7) == 0
416 || strncmp (name
, ".dtors.", 7) == 0)
418 init_priority
= strtoul (name
+ 7, &end
, 10);
419 return *end
? 0 : 65535 - init_priority
;
425 /* Compare sections ASEC and BSEC according to SORT. */
428 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
431 unsigned long ainit_priority
, binit_priority
;
438 case by_init_priority
:
440 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
442 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
443 if (ainit_priority
== 0 || binit_priority
== 0)
445 ret
= ainit_priority
- binit_priority
;
451 case by_alignment_name
:
452 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
453 - bfd_section_alignment (asec
->owner
, asec
));
460 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
461 bfd_get_section_name (bsec
->owner
, bsec
));
464 case by_name_alignment
:
465 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
466 bfd_get_section_name (bsec
->owner
, bsec
));
472 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
473 - bfd_section_alignment (asec
->owner
, asec
));
480 /* Build a Binary Search Tree to sort sections, unlike insertion sort
481 used in wild_sort(). BST is considerably faster if the number of
482 of sections are large. */
484 static lang_section_bst_type
**
485 wild_sort_fast (lang_wild_statement_type
*wild
,
486 struct wildcard_list
*sec
,
487 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
490 lang_section_bst_type
**tree
;
493 if (!wild
->filenames_sorted
494 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
496 /* Append at the right end of tree. */
498 tree
= &((*tree
)->right
);
504 /* Find the correct node to append this section. */
505 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
506 tree
= &((*tree
)->left
);
508 tree
= &((*tree
)->right
);
514 /* Use wild_sort_fast to build a BST to sort sections. */
517 output_section_callback_fast (lang_wild_statement_type
*ptr
,
518 struct wildcard_list
*sec
,
520 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
521 lang_input_statement_type
*file
,
524 lang_section_bst_type
*node
;
525 lang_section_bst_type
**tree
;
526 lang_output_section_statement_type
*os
;
528 os
= (lang_output_section_statement_type
*) output
;
530 if (unique_section_p (section
, os
))
533 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
536 node
->section
= section
;
538 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
543 /* Convert a sorted sections' BST back to list form. */
546 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
547 lang_section_bst_type
*tree
,
551 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
553 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
554 (lang_output_section_statement_type
*) output
);
557 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
562 /* Specialized, optimized routines for handling different kinds of
566 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
567 lang_input_statement_type
*file
,
571 /* We can just do a hash lookup for the section with the right name.
572 But if that lookup discovers more than one section with the name
573 (should be rare), we fall back to the general algorithm because
574 we would otherwise have to sort the sections to make sure they
575 get processed in the bfd's order. */
576 bfd_boolean multiple_sections_found
;
577 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
578 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
580 if (multiple_sections_found
)
581 walk_wild_section_general (ptr
, file
, callback
, data
);
583 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
587 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
588 lang_input_statement_type
*file
,
593 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
595 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
597 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
598 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
601 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
606 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
607 lang_input_statement_type
*file
,
612 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
613 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
614 bfd_boolean multiple_sections_found
;
615 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
617 if (multiple_sections_found
)
619 walk_wild_section_general (ptr
, file
, callback
, data
);
623 /* Note that if the section was not found, s0 is NULL and
624 we'll simply never succeed the s == s0 test below. */
625 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
627 /* Recall that in this code path, a section cannot satisfy more
628 than one spec, so if s == s0 then it cannot match
631 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
634 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
635 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
638 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
645 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
646 lang_input_statement_type
*file
,
651 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
652 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
653 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
654 bfd_boolean multiple_sections_found
;
655 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
657 if (multiple_sections_found
)
659 walk_wild_section_general (ptr
, file
, callback
, data
);
663 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
666 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
669 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
670 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
673 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
676 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
678 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
686 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
687 lang_input_statement_type
*file
,
692 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
693 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
694 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
695 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
696 bfd_boolean multiple_sections_found
;
697 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
699 if (multiple_sections_found
)
701 walk_wild_section_general (ptr
, file
, callback
, data
);
705 s1
= find_section (file
, sec1
, &multiple_sections_found
);
706 if (multiple_sections_found
)
708 walk_wild_section_general (ptr
, file
, callback
, data
);
712 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
715 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
718 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
721 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
722 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
726 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
730 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
732 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
740 walk_wild_section (lang_wild_statement_type
*ptr
,
741 lang_input_statement_type
*file
,
745 if (file
->flags
.just_syms
)
748 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
751 /* Returns TRUE when name1 is a wildcard spec that might match
752 something name2 can match. We're conservative: we return FALSE
753 only if the prefixes of name1 and name2 are different up to the
754 first wildcard character. */
757 wild_spec_can_overlap (const char *name1
, const char *name2
)
759 size_t prefix1_len
= strcspn (name1
, "?*[");
760 size_t prefix2_len
= strcspn (name2
, "?*[");
761 size_t min_prefix_len
;
763 /* Note that if there is no wildcard character, then we treat the
764 terminating 0 as part of the prefix. Thus ".text" won't match
765 ".text." or ".text.*", for example. */
766 if (name1
[prefix1_len
] == '\0')
768 if (name2
[prefix2_len
] == '\0')
771 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
773 return memcmp (name1
, name2
, min_prefix_len
) == 0;
776 /* Select specialized code to handle various kinds of wildcard
780 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
783 int wild_name_count
= 0;
784 struct wildcard_list
*sec
;
788 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
789 ptr
->handler_data
[0] = NULL
;
790 ptr
->handler_data
[1] = NULL
;
791 ptr
->handler_data
[2] = NULL
;
792 ptr
->handler_data
[3] = NULL
;
795 /* Count how many wildcard_specs there are, and how many of those
796 actually use wildcards in the name. Also, bail out if any of the
797 wildcard names are NULL. (Can this actually happen?
798 walk_wild_section used to test for it.) And bail out if any
799 of the wildcards are more complex than a simple string
800 ending in a single '*'. */
801 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
804 if (sec
->spec
.name
== NULL
)
806 if (wildcardp (sec
->spec
.name
))
809 if (!is_simple_wild (sec
->spec
.name
))
814 /* The zero-spec case would be easy to optimize but it doesn't
815 happen in practice. Likewise, more than 4 specs doesn't
816 happen in practice. */
817 if (sec_count
== 0 || sec_count
> 4)
820 /* Check that no two specs can match the same section. */
821 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
823 struct wildcard_list
*sec2
;
824 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
826 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
831 signature
= (sec_count
<< 8) + wild_name_count
;
835 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
838 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
841 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
844 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
847 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
853 /* Now fill the data array with pointers to the specs, first the
854 specs with non-wildcard names, then the specs with wildcard
855 names. It's OK to process the specs in different order from the
856 given order, because we've already determined that no section
857 will match more than one spec. */
859 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
860 if (!wildcardp (sec
->spec
.name
))
861 ptr
->handler_data
[data_counter
++] = sec
;
862 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
863 if (wildcardp (sec
->spec
.name
))
864 ptr
->handler_data
[data_counter
++] = sec
;
867 /* Handle a wild statement for a single file F. */
870 walk_wild_file (lang_wild_statement_type
*s
,
871 lang_input_statement_type
*f
,
875 if (walk_wild_file_in_exclude_list (s
->exclude_name_list
, f
))
878 if (f
->the_bfd
== NULL
879 || !bfd_check_format (f
->the_bfd
, bfd_archive
))
880 walk_wild_section (s
, f
, callback
, data
);
885 /* This is an archive file. We must map each member of the
886 archive separately. */
887 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
888 while (member
!= NULL
)
890 /* When lookup_name is called, it will call the add_symbols
891 entry point for the archive. For each element of the
892 archive which is included, BFD will call ldlang_add_file,
893 which will set the usrdata field of the member to the
894 lang_input_statement. */
895 if (member
->usrdata
!= NULL
)
897 walk_wild_section (s
,
898 (lang_input_statement_type
*) member
->usrdata
,
902 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
908 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
910 const char *file_spec
= s
->filename
;
913 if (file_spec
== NULL
)
915 /* Perform the iteration over all files in the list. */
916 LANG_FOR_EACH_INPUT_STATEMENT (f
)
918 walk_wild_file (s
, f
, callback
, data
);
921 else if ((p
= archive_path (file_spec
)) != NULL
)
923 LANG_FOR_EACH_INPUT_STATEMENT (f
)
925 if (input_statement_is_archive_path (file_spec
, p
, f
))
926 walk_wild_file (s
, f
, callback
, data
);
929 else if (wildcardp (file_spec
))
931 LANG_FOR_EACH_INPUT_STATEMENT (f
)
933 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
934 walk_wild_file (s
, f
, callback
, data
);
939 lang_input_statement_type
*f
;
941 /* Perform the iteration over a single file. */
942 f
= lookup_name (file_spec
);
944 walk_wild_file (s
, f
, callback
, data
);
948 /* lang_for_each_statement walks the parse tree and calls the provided
949 function for each node, except those inside output section statements
950 with constraint set to -1. */
953 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
954 lang_statement_union_type
*s
)
956 for (; s
!= NULL
; s
= s
->header
.next
)
960 switch (s
->header
.type
)
962 case lang_constructors_statement_enum
:
963 lang_for_each_statement_worker (func
, constructor_list
.head
);
965 case lang_output_section_statement_enum
:
966 if (s
->output_section_statement
.constraint
!= -1)
967 lang_for_each_statement_worker
968 (func
, s
->output_section_statement
.children
.head
);
970 case lang_wild_statement_enum
:
971 lang_for_each_statement_worker (func
,
972 s
->wild_statement
.children
.head
);
974 case lang_group_statement_enum
:
975 lang_for_each_statement_worker (func
,
976 s
->group_statement
.children
.head
);
978 case lang_data_statement_enum
:
979 case lang_reloc_statement_enum
:
980 case lang_object_symbols_statement_enum
:
981 case lang_output_statement_enum
:
982 case lang_target_statement_enum
:
983 case lang_input_section_enum
:
984 case lang_input_statement_enum
:
985 case lang_assignment_statement_enum
:
986 case lang_padding_statement_enum
:
987 case lang_address_statement_enum
:
988 case lang_fill_statement_enum
:
989 case lang_insert_statement_enum
:
999 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
1001 lang_for_each_statement_worker (func
, statement_list
.head
);
1004 /*----------------------------------------------------------------------*/
1007 lang_list_init (lang_statement_list_type
*list
)
1010 list
->tail
= &list
->head
;
1014 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1016 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1018 *stat_save_ptr
++ = stat_ptr
;
1025 if (stat_save_ptr
<= stat_save
)
1027 stat_ptr
= *--stat_save_ptr
;
1030 /* Build a new statement node for the parse tree. */
1032 static lang_statement_union_type
*
1033 new_statement (enum statement_enum type
,
1035 lang_statement_list_type
*list
)
1037 lang_statement_union_type
*new_stmt
;
1039 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1040 new_stmt
->header
.type
= type
;
1041 new_stmt
->header
.next
= NULL
;
1042 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1046 /* Build a new input file node for the language. There are several
1047 ways in which we treat an input file, eg, we only look at symbols,
1048 or prefix it with a -l etc.
1050 We can be supplied with requests for input files more than once;
1051 they may, for example be split over several lines like foo.o(.text)
1052 foo.o(.data) etc, so when asked for a file we check that we haven't
1053 got it already so we don't duplicate the bfd. */
1055 static lang_input_statement_type
*
1056 new_afile (const char *name
,
1057 lang_input_file_enum_type file_type
,
1059 bfd_boolean add_to_list
)
1061 lang_input_statement_type
*p
;
1063 lang_has_input_file
= TRUE
;
1066 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1069 p
= (lang_input_statement_type
*)
1070 stat_alloc (sizeof (lang_input_statement_type
));
1071 p
->header
.type
= lang_input_statement_enum
;
1072 p
->header
.next
= NULL
;
1075 memset (&p
->the_bfd
, 0,
1076 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1078 p
->flags
.dynamic
= input_flags
.dynamic
;
1079 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1080 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1081 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1082 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1086 case lang_input_file_is_symbols_only_enum
:
1088 p
->local_sym_name
= name
;
1089 p
->flags
.real
= TRUE
;
1090 p
->flags
.just_syms
= TRUE
;
1092 case lang_input_file_is_fake_enum
:
1094 p
->local_sym_name
= name
;
1096 case lang_input_file_is_l_enum
:
1097 if (name
[0] == ':' && name
[1] != '\0')
1099 p
->filename
= name
+ 1;
1100 p
->flags
.full_name_provided
= TRUE
;
1104 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1105 p
->flags
.maybe_archive
= TRUE
;
1106 p
->flags
.real
= TRUE
;
1107 p
->flags
.search_dirs
= TRUE
;
1109 case lang_input_file_is_marker_enum
:
1111 p
->local_sym_name
= name
;
1112 p
->flags
.search_dirs
= TRUE
;
1114 case lang_input_file_is_search_file_enum
:
1116 p
->local_sym_name
= name
;
1117 p
->flags
.real
= TRUE
;
1118 p
->flags
.search_dirs
= TRUE
;
1120 case lang_input_file_is_file_enum
:
1122 p
->local_sym_name
= name
;
1123 p
->flags
.real
= TRUE
;
1129 lang_statement_append (&input_file_chain
,
1130 (lang_statement_union_type
*) p
,
1131 &p
->next_real_file
);
1135 lang_input_statement_type
*
1136 lang_add_input_file (const char *name
,
1137 lang_input_file_enum_type file_type
,
1141 && (*name
== '=' || CONST_STRNEQ (name
, "$SYSROOT")))
1143 lang_input_statement_type
*ret
;
1144 char *sysrooted_name
1145 = concat (ld_sysroot
,
1146 name
+ (*name
== '=' ? 1 : strlen ("$SYSROOT")),
1147 (const char *) NULL
);
1149 /* We've now forcibly prepended the sysroot, making the input
1150 file independent of the context. Therefore, temporarily
1151 force a non-sysrooted context for this statement, so it won't
1152 get the sysroot prepended again when opened. (N.B. if it's a
1153 script, any child nodes with input files starting with "/"
1154 will be handled as "sysrooted" as they'll be found to be
1155 within the sysroot subdirectory.) */
1156 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1157 input_flags
.sysrooted
= 0;
1158 ret
= new_afile (sysrooted_name
, file_type
, target
, TRUE
);
1159 input_flags
.sysrooted
= outer_sysrooted
;
1163 return new_afile (name
, file_type
, target
, TRUE
);
1166 struct out_section_hash_entry
1168 struct bfd_hash_entry root
;
1169 lang_statement_union_type s
;
1172 /* The hash table. */
1174 static struct bfd_hash_table output_section_statement_table
;
1176 /* Support routines for the hash table used by lang_output_section_find,
1177 initialize the table, fill in an entry and remove the table. */
1179 static struct bfd_hash_entry
*
1180 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1181 struct bfd_hash_table
*table
,
1184 lang_output_section_statement_type
**nextp
;
1185 struct out_section_hash_entry
*ret
;
1189 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1195 entry
= bfd_hash_newfunc (entry
, table
, string
);
1199 ret
= (struct out_section_hash_entry
*) entry
;
1200 memset (&ret
->s
, 0, sizeof (ret
->s
));
1201 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1202 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1203 ret
->s
.output_section_statement
.section_alignment
= -1;
1204 ret
->s
.output_section_statement
.block_value
= 1;
1205 lang_list_init (&ret
->s
.output_section_statement
.children
);
1206 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1208 /* For every output section statement added to the list, except the
1209 first one, lang_output_section_statement.tail points to the "next"
1210 field of the last element of the list. */
1211 if (lang_output_section_statement
.head
!= NULL
)
1212 ret
->s
.output_section_statement
.prev
1213 = ((lang_output_section_statement_type
*)
1214 ((char *) lang_output_section_statement
.tail
1215 - offsetof (lang_output_section_statement_type
, next
)));
1217 /* GCC's strict aliasing rules prevent us from just casting the
1218 address, so we store the pointer in a variable and cast that
1220 nextp
= &ret
->s
.output_section_statement
.next
;
1221 lang_statement_append (&lang_output_section_statement
,
1223 (lang_statement_union_type
**) nextp
);
1228 output_section_statement_table_init (void)
1230 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1231 output_section_statement_newfunc
,
1232 sizeof (struct out_section_hash_entry
),
1234 einfo (_("%P%F: can not create hash table: %E\n"));
1238 output_section_statement_table_free (void)
1240 bfd_hash_table_free (&output_section_statement_table
);
1243 /* Build enough state so that the parser can build its tree. */
1248 obstack_begin (&stat_obstack
, 1000);
1250 stat_ptr
= &statement_list
;
1252 output_section_statement_table_init ();
1254 lang_list_init (stat_ptr
);
1256 lang_list_init (&input_file_chain
);
1257 lang_list_init (&lang_output_section_statement
);
1258 lang_list_init (&file_chain
);
1259 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1261 abs_output_section
=
1262 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1264 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1266 asneeded_list_head
= NULL
;
1267 asneeded_list_tail
= &asneeded_list_head
;
1273 output_section_statement_table_free ();
1276 /*----------------------------------------------------------------------
1277 A region is an area of memory declared with the
1278 MEMORY { name:org=exp, len=exp ... }
1281 We maintain a list of all the regions here.
1283 If no regions are specified in the script, then the default is used
1284 which is created when looked up to be the entire data space.
1286 If create is true we are creating a region inside a MEMORY block.
1287 In this case it is probably an error to create a region that has
1288 already been created. If we are not inside a MEMORY block it is
1289 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1290 and so we issue a warning.
1292 Each region has at least one name. The first name is either
1293 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1294 alias names to an existing region within a script with
1295 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1298 static lang_memory_region_type
*lang_memory_region_list
;
1299 static lang_memory_region_type
**lang_memory_region_list_tail
1300 = &lang_memory_region_list
;
1302 lang_memory_region_type
*
1303 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1305 lang_memory_region_name
*n
;
1306 lang_memory_region_type
*r
;
1307 lang_memory_region_type
*new_region
;
1309 /* NAME is NULL for LMA memspecs if no region was specified. */
1313 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1314 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1315 if (strcmp (n
->name
, name
) == 0)
1318 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1323 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1324 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1327 new_region
= (lang_memory_region_type
*)
1328 stat_alloc (sizeof (lang_memory_region_type
));
1330 new_region
->name_list
.name
= xstrdup (name
);
1331 new_region
->name_list
.next
= NULL
;
1332 new_region
->next
= NULL
;
1333 new_region
->origin_exp
= NULL
;
1334 new_region
->origin
= 0;
1335 new_region
->length_exp
= NULL
;
1336 new_region
->length
= ~(bfd_size_type
) 0;
1337 new_region
->current
= 0;
1338 new_region
->last_os
= NULL
;
1339 new_region
->flags
= 0;
1340 new_region
->not_flags
= 0;
1341 new_region
->had_full_message
= FALSE
;
1343 *lang_memory_region_list_tail
= new_region
;
1344 lang_memory_region_list_tail
= &new_region
->next
;
1350 lang_memory_region_alias (const char *alias
, const char *region_name
)
1352 lang_memory_region_name
*n
;
1353 lang_memory_region_type
*r
;
1354 lang_memory_region_type
*region
;
1356 /* The default region must be unique. This ensures that it is not necessary
1357 to iterate through the name list if someone wants the check if a region is
1358 the default memory region. */
1359 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1360 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1361 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL
);
1363 /* Look for the target region and check if the alias is not already
1366 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1367 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1369 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1371 if (strcmp (n
->name
, alias
) == 0)
1372 einfo (_("%F%P:%S: error: redefinition of memory region "
1377 /* Check if the target region exists. */
1379 einfo (_("%F%P:%S: error: memory region `%s' "
1380 "for alias `%s' does not exist\n"),
1381 NULL
, region_name
, alias
);
1383 /* Add alias to region name list. */
1384 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1385 n
->name
= xstrdup (alias
);
1386 n
->next
= region
->name_list
.next
;
1387 region
->name_list
.next
= n
;
1390 static lang_memory_region_type
*
1391 lang_memory_default (asection
*section
)
1393 lang_memory_region_type
*p
;
1395 flagword sec_flags
= section
->flags
;
1397 /* Override SEC_DATA to mean a writable section. */
1398 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1399 sec_flags
|= SEC_DATA
;
1401 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1403 if ((p
->flags
& sec_flags
) != 0
1404 && (p
->not_flags
& sec_flags
) == 0)
1409 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1412 /* Get the output section statement directly from the userdata. */
1414 lang_output_section_statement_type
*
1415 lang_output_section_get (const asection
*output_section
)
1417 return get_userdata (output_section
);
1420 /* Find or create an output_section_statement with the given NAME.
1421 If CONSTRAINT is non-zero match one with that constraint, otherwise
1422 match any non-negative constraint. If CREATE, always make a
1423 new output_section_statement for SPECIAL CONSTRAINT. */
1425 lang_output_section_statement_type
*
1426 lang_output_section_statement_lookup (const char *name
,
1430 struct out_section_hash_entry
*entry
;
1432 entry
= ((struct out_section_hash_entry
*)
1433 bfd_hash_lookup (&output_section_statement_table
, name
,
1438 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1442 if (entry
->s
.output_section_statement
.name
!= NULL
)
1444 /* We have a section of this name, but it might not have the correct
1446 struct out_section_hash_entry
*last_ent
;
1448 name
= entry
->s
.output_section_statement
.name
;
1449 if (create
&& constraint
== SPECIAL
)
1450 /* Not traversing to the end reverses the order of the second
1451 and subsequent SPECIAL sections in the hash table chain,
1452 but that shouldn't matter. */
1457 if (constraint
== entry
->s
.output_section_statement
.constraint
1459 && entry
->s
.output_section_statement
.constraint
>= 0))
1460 return &entry
->s
.output_section_statement
;
1462 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1464 while (entry
!= NULL
1465 && name
== entry
->s
.output_section_statement
.name
);
1471 = ((struct out_section_hash_entry
*)
1472 output_section_statement_newfunc (NULL
,
1473 &output_section_statement_table
,
1477 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1480 entry
->root
= last_ent
->root
;
1481 last_ent
->root
.next
= &entry
->root
;
1484 entry
->s
.output_section_statement
.name
= name
;
1485 entry
->s
.output_section_statement
.constraint
= constraint
;
1486 return &entry
->s
.output_section_statement
;
1489 /* Find the next output_section_statement with the same name as OS.
1490 If CONSTRAINT is non-zero, find one with that constraint otherwise
1491 match any non-negative constraint. */
1493 lang_output_section_statement_type
*
1494 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1497 /* All output_section_statements are actually part of a
1498 struct out_section_hash_entry. */
1499 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1501 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1502 const char *name
= os
->name
;
1504 ASSERT (name
== entry
->root
.string
);
1507 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1509 || name
!= entry
->s
.output_section_statement
.name
)
1512 while (constraint
!= entry
->s
.output_section_statement
.constraint
1514 || entry
->s
.output_section_statement
.constraint
< 0));
1516 return &entry
->s
.output_section_statement
;
1519 /* A variant of lang_output_section_find used by place_orphan.
1520 Returns the output statement that should precede a new output
1521 statement for SEC. If an exact match is found on certain flags,
1524 lang_output_section_statement_type
*
1525 lang_output_section_find_by_flags (const asection
*sec
,
1527 lang_output_section_statement_type
**exact
,
1528 lang_match_sec_type_func match_type
)
1530 lang_output_section_statement_type
*first
, *look
, *found
;
1531 flagword look_flags
, differ
;
1533 /* We know the first statement on this list is *ABS*. May as well
1535 first
= &lang_output_section_statement
.head
->output_section_statement
;
1536 first
= first
->next
;
1538 /* First try for an exact match. */
1540 for (look
= first
; look
; look
= look
->next
)
1542 look_flags
= look
->flags
;
1543 if (look
->bfd_section
!= NULL
)
1545 look_flags
= look
->bfd_section
->flags
;
1546 if (match_type
&& !match_type (link_info
.output_bfd
,
1551 differ
= look_flags
^ sec_flags
;
1552 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1553 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1563 if ((sec_flags
& SEC_CODE
) != 0
1564 && (sec_flags
& SEC_ALLOC
) != 0)
1566 /* Try for a rw code section. */
1567 for (look
= first
; look
; look
= look
->next
)
1569 look_flags
= look
->flags
;
1570 if (look
->bfd_section
!= NULL
)
1572 look_flags
= look
->bfd_section
->flags
;
1573 if (match_type
&& !match_type (link_info
.output_bfd
,
1578 differ
= look_flags
^ sec_flags
;
1579 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1580 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1584 else if ((sec_flags
& SEC_READONLY
) != 0
1585 && (sec_flags
& SEC_ALLOC
) != 0)
1587 /* .rodata can go after .text, .sdata2 after .rodata. */
1588 for (look
= first
; look
; look
= look
->next
)
1590 look_flags
= look
->flags
;
1591 if (look
->bfd_section
!= NULL
)
1593 look_flags
= look
->bfd_section
->flags
;
1594 if (match_type
&& !match_type (link_info
.output_bfd
,
1599 differ
= look_flags
^ sec_flags
;
1600 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1601 | SEC_READONLY
| SEC_SMALL_DATA
))
1602 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1604 && !(look_flags
& SEC_SMALL_DATA
)))
1608 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1609 && (sec_flags
& SEC_ALLOC
) != 0)
1611 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1612 as if it were a loaded section, and don't use match_type. */
1613 bfd_boolean seen_thread_local
= FALSE
;
1616 for (look
= first
; look
; look
= look
->next
)
1618 look_flags
= look
->flags
;
1619 if (look
->bfd_section
!= NULL
)
1620 look_flags
= look
->bfd_section
->flags
;
1622 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1623 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1625 /* .tdata and .tbss must be adjacent and in that order. */
1626 if (!(look_flags
& SEC_LOAD
)
1627 && (sec_flags
& SEC_LOAD
))
1628 /* ..so if we're at a .tbss section and we're placing
1629 a .tdata section stop looking and return the
1630 previous section. */
1633 seen_thread_local
= TRUE
;
1635 else if (seen_thread_local
)
1637 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1641 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1642 && (sec_flags
& SEC_ALLOC
) != 0)
1644 /* .sdata goes after .data, .sbss after .sdata. */
1645 for (look
= first
; look
; look
= look
->next
)
1647 look_flags
= look
->flags
;
1648 if (look
->bfd_section
!= NULL
)
1650 look_flags
= look
->bfd_section
->flags
;
1651 if (match_type
&& !match_type (link_info
.output_bfd
,
1656 differ
= look_flags
^ sec_flags
;
1657 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1658 | SEC_THREAD_LOCAL
))
1659 || ((look_flags
& SEC_SMALL_DATA
)
1660 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1664 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1665 && (sec_flags
& SEC_ALLOC
) != 0)
1667 /* .data goes after .rodata. */
1668 for (look
= first
; look
; look
= look
->next
)
1670 look_flags
= look
->flags
;
1671 if (look
->bfd_section
!= NULL
)
1673 look_flags
= look
->bfd_section
->flags
;
1674 if (match_type
&& !match_type (link_info
.output_bfd
,
1679 differ
= look_flags
^ sec_flags
;
1680 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1681 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1685 else if ((sec_flags
& SEC_ALLOC
) != 0)
1687 /* .bss goes after any other alloc section. */
1688 for (look
= first
; look
; look
= look
->next
)
1690 look_flags
= look
->flags
;
1691 if (look
->bfd_section
!= NULL
)
1693 look_flags
= look
->bfd_section
->flags
;
1694 if (match_type
&& !match_type (link_info
.output_bfd
,
1699 differ
= look_flags
^ sec_flags
;
1700 if (!(differ
& SEC_ALLOC
))
1706 /* non-alloc go last. */
1707 for (look
= first
; look
; look
= look
->next
)
1709 look_flags
= look
->flags
;
1710 if (look
->bfd_section
!= NULL
)
1711 look_flags
= look
->bfd_section
->flags
;
1712 differ
= look_flags
^ sec_flags
;
1713 if (!(differ
& SEC_DEBUGGING
))
1719 if (found
|| !match_type
)
1722 return lang_output_section_find_by_flags (sec
, sec_flags
, NULL
, NULL
);
1725 /* Find the last output section before given output statement.
1726 Used by place_orphan. */
1729 output_prev_sec_find (lang_output_section_statement_type
*os
)
1731 lang_output_section_statement_type
*lookup
;
1733 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1735 if (lookup
->constraint
< 0)
1738 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1739 return lookup
->bfd_section
;
1745 /* Look for a suitable place for a new output section statement. The
1746 idea is to skip over anything that might be inside a SECTIONS {}
1747 statement in a script, before we find another output section
1748 statement. Assignments to "dot" before an output section statement
1749 are assumed to belong to it, except in two cases; The first
1750 assignment to dot, and assignments before non-alloc sections.
1751 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1752 similar assignments that set the initial address, or we might
1753 insert non-alloc note sections among assignments setting end of
1756 static lang_statement_union_type
**
1757 insert_os_after (lang_output_section_statement_type
*after
)
1759 lang_statement_union_type
**where
;
1760 lang_statement_union_type
**assign
= NULL
;
1761 bfd_boolean ignore_first
;
1764 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1766 for (where
= &after
->header
.next
;
1768 where
= &(*where
)->header
.next
)
1770 switch ((*where
)->header
.type
)
1772 case lang_assignment_statement_enum
:
1775 lang_assignment_statement_type
*ass
;
1777 ass
= &(*where
)->assignment_statement
;
1778 if (ass
->exp
->type
.node_class
!= etree_assert
1779 && ass
->exp
->assign
.dst
[0] == '.'
1780 && ass
->exp
->assign
.dst
[1] == 0
1784 ignore_first
= FALSE
;
1786 case lang_wild_statement_enum
:
1787 case lang_input_section_enum
:
1788 case lang_object_symbols_statement_enum
:
1789 case lang_fill_statement_enum
:
1790 case lang_data_statement_enum
:
1791 case lang_reloc_statement_enum
:
1792 case lang_padding_statement_enum
:
1793 case lang_constructors_statement_enum
:
1796 case lang_output_section_statement_enum
:
1799 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1802 || s
->map_head
.s
== NULL
1803 || (s
->flags
& SEC_ALLOC
) != 0)
1807 case lang_input_statement_enum
:
1808 case lang_address_statement_enum
:
1809 case lang_target_statement_enum
:
1810 case lang_output_statement_enum
:
1811 case lang_group_statement_enum
:
1812 case lang_insert_statement_enum
:
1821 lang_output_section_statement_type
*
1822 lang_insert_orphan (asection
*s
,
1823 const char *secname
,
1825 lang_output_section_statement_type
*after
,
1826 struct orphan_save
*place
,
1827 etree_type
*address
,
1828 lang_statement_list_type
*add_child
)
1830 lang_statement_list_type add
;
1831 lang_output_section_statement_type
*os
;
1832 lang_output_section_statement_type
**os_tail
;
1834 /* If we have found an appropriate place for the output section
1835 statements for this orphan, add them to our own private list,
1836 inserting them later into the global statement list. */
1839 lang_list_init (&add
);
1840 push_stat_ptr (&add
);
1843 if (bfd_link_relocatable (&link_info
)
1844 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1845 address
= exp_intop (0);
1847 os_tail
= ((lang_output_section_statement_type
**)
1848 lang_output_section_statement
.tail
);
1849 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1850 NULL
, NULL
, NULL
, constraint
, 0);
1852 if (add_child
== NULL
)
1853 add_child
= &os
->children
;
1854 lang_add_section (add_child
, s
, NULL
, os
);
1856 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1858 const char *region
= (after
->region
1859 ? after
->region
->name_list
.name
1860 : DEFAULT_MEMORY_REGION
);
1861 const char *lma_region
= (after
->lma_region
1862 ? after
->lma_region
->name_list
.name
1864 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1868 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1871 /* Restore the global list pointer. */
1875 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1877 asection
*snew
, *as
;
1879 snew
= os
->bfd_section
;
1881 /* Shuffle the bfd section list to make the output file look
1882 neater. This is really only cosmetic. */
1883 if (place
->section
== NULL
1884 && after
!= (&lang_output_section_statement
.head
1885 ->output_section_statement
))
1887 asection
*bfd_section
= after
->bfd_section
;
1889 /* If the output statement hasn't been used to place any input
1890 sections (and thus doesn't have an output bfd_section),
1891 look for the closest prior output statement having an
1893 if (bfd_section
== NULL
)
1894 bfd_section
= output_prev_sec_find (after
);
1896 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1897 place
->section
= &bfd_section
->next
;
1900 if (place
->section
== NULL
)
1901 place
->section
= &link_info
.output_bfd
->sections
;
1903 as
= *place
->section
;
1907 /* Put the section at the end of the list. */
1909 /* Unlink the section. */
1910 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1912 /* Now tack it back on in the right place. */
1913 bfd_section_list_append (link_info
.output_bfd
, snew
);
1915 else if (as
!= snew
&& as
->prev
!= snew
)
1917 /* Unlink the section. */
1918 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1920 /* Now tack it back on in the right place. */
1921 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1924 /* Save the end of this list. Further ophans of this type will
1925 follow the one we've just added. */
1926 place
->section
= &snew
->next
;
1928 /* The following is non-cosmetic. We try to put the output
1929 statements in some sort of reasonable order here, because they
1930 determine the final load addresses of the orphan sections.
1931 In addition, placing output statements in the wrong order may
1932 require extra segments. For instance, given a typical
1933 situation of all read-only sections placed in one segment and
1934 following that a segment containing all the read-write
1935 sections, we wouldn't want to place an orphan read/write
1936 section before or amongst the read-only ones. */
1937 if (add
.head
!= NULL
)
1939 lang_output_section_statement_type
*newly_added_os
;
1941 if (place
->stmt
== NULL
)
1943 lang_statement_union_type
**where
= insert_os_after (after
);
1948 place
->os_tail
= &after
->next
;
1952 /* Put it after the last orphan statement we added. */
1953 *add
.tail
= *place
->stmt
;
1954 *place
->stmt
= add
.head
;
1957 /* Fix the global list pointer if we happened to tack our
1958 new list at the tail. */
1959 if (*stat_ptr
->tail
== add
.head
)
1960 stat_ptr
->tail
= add
.tail
;
1962 /* Save the end of this list. */
1963 place
->stmt
= add
.tail
;
1965 /* Do the same for the list of output section statements. */
1966 newly_added_os
= *os_tail
;
1968 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1969 ((char *) place
->os_tail
1970 - offsetof (lang_output_section_statement_type
, next
));
1971 newly_added_os
->next
= *place
->os_tail
;
1972 if (newly_added_os
->next
!= NULL
)
1973 newly_added_os
->next
->prev
= newly_added_os
;
1974 *place
->os_tail
= newly_added_os
;
1975 place
->os_tail
= &newly_added_os
->next
;
1977 /* Fixing the global list pointer here is a little different.
1978 We added to the list in lang_enter_output_section_statement,
1979 trimmed off the new output_section_statment above when
1980 assigning *os_tail = NULL, but possibly added it back in
1981 the same place when assigning *place->os_tail. */
1982 if (*os_tail
== NULL
)
1983 lang_output_section_statement
.tail
1984 = (lang_statement_union_type
**) os_tail
;
1991 lang_print_asneeded (void)
1993 struct asneeded_minfo
*m
;
1995 if (asneeded_list_head
== NULL
)
1998 minfo (_("\nAs-needed library included to satisfy reference by file (symbol)\n\n"));
2000 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2004 minfo ("%s", m
->soname
);
2005 len
= strlen (m
->soname
);
2019 minfo ("%B ", m
->ref
);
2020 minfo ("(%T)\n", m
->name
);
2025 lang_map_flags (flagword flag
)
2027 if (flag
& SEC_ALLOC
)
2030 if (flag
& SEC_CODE
)
2033 if (flag
& SEC_READONLY
)
2036 if (flag
& SEC_DATA
)
2039 if (flag
& SEC_LOAD
)
2046 lang_memory_region_type
*m
;
2047 bfd_boolean dis_header_printed
= FALSE
;
2049 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2053 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2054 || file
->flags
.just_syms
)
2057 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2058 if ((s
->output_section
== NULL
2059 || s
->output_section
->owner
!= link_info
.output_bfd
)
2060 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2062 if (!dis_header_printed
)
2064 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2065 dis_header_printed
= TRUE
;
2068 print_input_section (s
, TRUE
);
2072 minfo (_("\nMemory Configuration\n\n"));
2073 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2074 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2076 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2081 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2083 sprintf_vma (buf
, m
->origin
);
2084 minfo ("0x%s ", buf
);
2092 minfo ("0x%V", m
->length
);
2093 if (m
->flags
|| m
->not_flags
)
2101 lang_map_flags (m
->flags
);
2107 lang_map_flags (m
->not_flags
);
2114 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2116 if (!link_info
.reduce_memory_overheads
)
2118 obstack_begin (&map_obstack
, 1000);
2119 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2121 lang_statement_iteration
++;
2122 print_statements ();
2124 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
,
2129 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2130 void *info ATTRIBUTE_UNUSED
)
2132 if ((hash_entry
->type
== bfd_link_hash_defined
2133 || hash_entry
->type
== bfd_link_hash_defweak
)
2134 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2135 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2137 input_section_userdata_type
*ud
;
2138 struct map_symbol_def
*def
;
2140 ud
= ((input_section_userdata_type
*)
2141 get_userdata (hash_entry
->u
.def
.section
));
2144 ud
= (input_section_userdata_type
*) stat_alloc (sizeof (*ud
));
2145 get_userdata (hash_entry
->u
.def
.section
) = ud
;
2146 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2147 ud
->map_symbol_def_count
= 0;
2149 else if (!ud
->map_symbol_def_tail
)
2150 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2152 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2153 def
->entry
= hash_entry
;
2154 *(ud
->map_symbol_def_tail
) = def
;
2155 ud
->map_symbol_def_tail
= &def
->next
;
2156 ud
->map_symbol_def_count
++;
2161 /* Initialize an output section. */
2164 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2166 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2167 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2169 if (s
->constraint
!= SPECIAL
)
2170 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2171 if (s
->bfd_section
== NULL
)
2172 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2174 if (s
->bfd_section
== NULL
)
2176 einfo (_("%P%F: output format %s cannot represent section"
2177 " called %s: %E\n"),
2178 link_info
.output_bfd
->xvec
->name
, s
->name
);
2180 s
->bfd_section
->output_section
= s
->bfd_section
;
2181 s
->bfd_section
->output_offset
= 0;
2183 /* Set the userdata of the output section to the output section
2184 statement to avoid lookup. */
2185 get_userdata (s
->bfd_section
) = s
;
2187 /* If there is a base address, make sure that any sections it might
2188 mention are initialized. */
2189 if (s
->addr_tree
!= NULL
)
2190 exp_init_os (s
->addr_tree
);
2192 if (s
->load_base
!= NULL
)
2193 exp_init_os (s
->load_base
);
2195 /* If supplied an alignment, set it. */
2196 if (s
->section_alignment
!= -1)
2197 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2200 /* Make sure that all output sections mentioned in an expression are
2204 exp_init_os (etree_type
*exp
)
2206 switch (exp
->type
.node_class
)
2210 exp_init_os (exp
->assign
.src
);
2214 exp_init_os (exp
->binary
.lhs
);
2215 exp_init_os (exp
->binary
.rhs
);
2219 exp_init_os (exp
->trinary
.cond
);
2220 exp_init_os (exp
->trinary
.lhs
);
2221 exp_init_os (exp
->trinary
.rhs
);
2225 exp_init_os (exp
->assert_s
.child
);
2229 exp_init_os (exp
->unary
.child
);
2233 switch (exp
->type
.node_code
)
2239 lang_output_section_statement_type
*os
;
2241 os
= lang_output_section_find (exp
->name
.name
);
2242 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2254 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2256 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2258 /* If we are only reading symbols from this object, then we want to
2259 discard all sections. */
2260 if (entry
->flags
.just_syms
)
2262 bfd_link_just_syms (abfd
, sec
, &link_info
);
2266 /* Deal with SHF_EXCLUDE ELF sections. */
2267 if (!bfd_link_relocatable (&link_info
)
2268 && (abfd
->flags
& BFD_PLUGIN
) == 0
2269 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2270 sec
->output_section
= bfd_abs_section_ptr
;
2272 if (!(abfd
->flags
& DYNAMIC
))
2273 bfd_section_already_linked (abfd
, sec
, &link_info
);
2277 /* Returns true if SECTION is one we know will be discarded based on its
2278 section flags, otherwise returns false. */
2281 lang_discard_section_p (asection
*section
)
2283 bfd_boolean discard
;
2284 flagword flags
= section
->flags
;
2286 /* Discard sections marked with SEC_EXCLUDE. */
2287 discard
= (flags
& SEC_EXCLUDE
) != 0;
2289 /* Discard the group descriptor sections when we're finally placing the
2290 sections from within the group. */
2291 if ((flags
& SEC_GROUP
) != 0
2292 && link_info
.resolve_section_groups
)
2295 /* Discard debugging sections if we are stripping debugging
2297 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2298 && (flags
& SEC_DEBUGGING
) != 0)
2304 /* The wild routines.
2306 These expand statements like *(.text) and foo.o to a list of
2307 explicit actions, like foo.o(.text), bar.o(.text) and
2308 foo.o(.text, .data). */
2310 /* Add SECTION to the output section OUTPUT. Do this by creating a
2311 lang_input_section statement which is placed at PTR. */
2314 lang_add_section (lang_statement_list_type
*ptr
,
2316 struct flag_info
*sflag_info
,
2317 lang_output_section_statement_type
*output
)
2319 flagword flags
= section
->flags
;
2321 bfd_boolean discard
;
2322 lang_input_section_type
*new_section
;
2323 bfd
*abfd
= link_info
.output_bfd
;
2325 /* Is this section one we know should be discarded? */
2326 discard
= lang_discard_section_p (section
);
2328 /* Discard input sections which are assigned to a section named
2329 DISCARD_SECTION_NAME. */
2330 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2335 if (section
->output_section
== NULL
)
2337 /* This prevents future calls from assigning this section. */
2338 section
->output_section
= bfd_abs_section_ptr
;
2347 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2352 if (section
->output_section
!= NULL
)
2355 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2356 to an output section, because we want to be able to include a
2357 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2358 section (I don't know why we want to do this, but we do).
2359 build_link_order in ldwrite.c handles this case by turning
2360 the embedded SEC_NEVER_LOAD section into a fill. */
2361 flags
&= ~ SEC_NEVER_LOAD
;
2363 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2364 already been processed. One reason to do this is that on pe
2365 format targets, .text$foo sections go into .text and it's odd
2366 to see .text with SEC_LINK_ONCE set. */
2367 if ((flags
& (SEC_LINK_ONCE
| SEC_GROUP
)) == (SEC_LINK_ONCE
| SEC_GROUP
))
2369 if (link_info
.resolve_section_groups
)
2370 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2372 flags
&= ~(SEC_LINK_DUPLICATES
| SEC_RELOC
);
2374 else if (!bfd_link_relocatable (&link_info
))
2375 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2377 switch (output
->sectype
)
2379 case normal_section
:
2380 case overlay_section
:
2382 case noalloc_section
:
2383 flags
&= ~SEC_ALLOC
;
2385 case noload_section
:
2387 flags
|= SEC_NEVER_LOAD
;
2388 /* Unfortunately GNU ld has managed to evolve two different
2389 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2390 alloc, no contents section. All others get a noload, noalloc
2392 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2393 flags
&= ~SEC_HAS_CONTENTS
;
2395 flags
&= ~SEC_ALLOC
;
2399 if (output
->bfd_section
== NULL
)
2400 init_os (output
, flags
);
2402 /* If SEC_READONLY is not set in the input section, then clear
2403 it from the output section. */
2404 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2406 if (output
->bfd_section
->linker_has_input
)
2408 /* Only set SEC_READONLY flag on the first input section. */
2409 flags
&= ~ SEC_READONLY
;
2411 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2412 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2413 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2414 || ((flags
& SEC_MERGE
) != 0
2415 && output
->bfd_section
->entsize
!= section
->entsize
))
2417 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2418 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2421 output
->bfd_section
->flags
|= flags
;
2423 if (!output
->bfd_section
->linker_has_input
)
2425 output
->bfd_section
->linker_has_input
= 1;
2426 /* This must happen after flags have been updated. The output
2427 section may have been created before we saw its first input
2428 section, eg. for a data statement. */
2429 bfd_init_private_section_data (section
->owner
, section
,
2430 link_info
.output_bfd
,
2431 output
->bfd_section
,
2433 if ((flags
& SEC_MERGE
) != 0)
2434 output
->bfd_section
->entsize
= section
->entsize
;
2437 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2438 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2440 /* FIXME: This value should really be obtained from the bfd... */
2441 output
->block_value
= 128;
2444 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2445 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2447 section
->output_section
= output
->bfd_section
;
2449 if (!map_head_is_link_order
)
2451 asection
*s
= output
->bfd_section
->map_tail
.s
;
2452 output
->bfd_section
->map_tail
.s
= section
;
2453 section
->map_head
.s
= NULL
;
2454 section
->map_tail
.s
= s
;
2456 s
->map_head
.s
= section
;
2458 output
->bfd_section
->map_head
.s
= section
;
2461 /* Add a section reference to the list. */
2462 new_section
= new_stat (lang_input_section
, ptr
);
2463 new_section
->section
= section
;
2466 /* Handle wildcard sorting. This returns the lang_input_section which
2467 should follow the one we are going to create for SECTION and FILE,
2468 based on the sorting requirements of WILD. It returns NULL if the
2469 new section should just go at the end of the current list. */
2471 static lang_statement_union_type
*
2472 wild_sort (lang_wild_statement_type
*wild
,
2473 struct wildcard_list
*sec
,
2474 lang_input_statement_type
*file
,
2477 lang_statement_union_type
*l
;
2479 if (!wild
->filenames_sorted
2480 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2483 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2485 lang_input_section_type
*ls
;
2487 if (l
->header
.type
!= lang_input_section_enum
)
2489 ls
= &l
->input_section
;
2491 /* Sorting by filename takes precedence over sorting by section
2494 if (wild
->filenames_sorted
)
2496 const char *fn
, *ln
;
2500 /* The PE support for the .idata section as generated by
2501 dlltool assumes that files will be sorted by the name of
2502 the archive and then the name of the file within the
2505 if (file
->the_bfd
!= NULL
2506 && file
->the_bfd
->my_archive
!= NULL
)
2508 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2513 fn
= file
->filename
;
2517 if (ls
->section
->owner
->my_archive
!= NULL
)
2519 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2524 ln
= ls
->section
->owner
->filename
;
2528 i
= filename_cmp (fn
, ln
);
2537 fn
= file
->filename
;
2539 ln
= ls
->section
->owner
->filename
;
2541 i
= filename_cmp (fn
, ln
);
2549 /* Here either the files are not sorted by name, or we are
2550 looking at the sections for this file. */
2553 && sec
->spec
.sorted
!= none
2554 && sec
->spec
.sorted
!= by_none
)
2555 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2562 /* Expand a wild statement for a particular FILE. SECTION may be
2563 NULL, in which case it is a wild card. */
2566 output_section_callback (lang_wild_statement_type
*ptr
,
2567 struct wildcard_list
*sec
,
2569 struct flag_info
*sflag_info
,
2570 lang_input_statement_type
*file
,
2573 lang_statement_union_type
*before
;
2574 lang_output_section_statement_type
*os
;
2576 os
= (lang_output_section_statement_type
*) output
;
2578 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2579 if (unique_section_p (section
, os
))
2582 before
= wild_sort (ptr
, sec
, file
, section
);
2584 /* Here BEFORE points to the lang_input_section which
2585 should follow the one we are about to add. If BEFORE
2586 is NULL, then the section should just go at the end
2587 of the current list. */
2590 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2593 lang_statement_list_type list
;
2594 lang_statement_union_type
**pp
;
2596 lang_list_init (&list
);
2597 lang_add_section (&list
, section
, sflag_info
, os
);
2599 /* If we are discarding the section, LIST.HEAD will
2601 if (list
.head
!= NULL
)
2603 ASSERT (list
.head
->header
.next
== NULL
);
2605 for (pp
= &ptr
->children
.head
;
2607 pp
= &(*pp
)->header
.next
)
2608 ASSERT (*pp
!= NULL
);
2610 list
.head
->header
.next
= *pp
;
2616 /* Check if all sections in a wild statement for a particular FILE
2620 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2621 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2623 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2624 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2627 lang_output_section_statement_type
*os
;
2629 os
= (lang_output_section_statement_type
*) output
;
2631 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2632 if (unique_section_p (section
, os
))
2635 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2636 os
->all_input_readonly
= FALSE
;
2639 /* This is passed a file name which must have been seen already and
2640 added to the statement tree. We will see if it has been opened
2641 already and had its symbols read. If not then we'll read it. */
2643 static lang_input_statement_type
*
2644 lookup_name (const char *name
)
2646 lang_input_statement_type
*search
;
2648 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2650 search
= (lang_input_statement_type
*) search
->next_real_file
)
2652 /* Use the local_sym_name as the name of the file that has
2653 already been loaded as filename might have been transformed
2654 via the search directory lookup mechanism. */
2655 const char *filename
= search
->local_sym_name
;
2657 if (filename
!= NULL
2658 && filename_cmp (filename
, name
) == 0)
2663 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2664 default_target
, FALSE
);
2666 /* If we have already added this file, or this file is not real
2667 don't add this file. */
2668 if (search
->flags
.loaded
|| !search
->flags
.real
)
2671 if (!load_symbols (search
, NULL
))
2677 /* Save LIST as a list of libraries whose symbols should not be exported. */
2682 struct excluded_lib
*next
;
2684 static struct excluded_lib
*excluded_libs
;
2687 add_excluded_libs (const char *list
)
2689 const char *p
= list
, *end
;
2693 struct excluded_lib
*entry
;
2694 end
= strpbrk (p
, ",:");
2696 end
= p
+ strlen (p
);
2697 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2698 entry
->next
= excluded_libs
;
2699 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2700 memcpy (entry
->name
, p
, end
- p
);
2701 entry
->name
[end
- p
] = '\0';
2702 excluded_libs
= entry
;
2710 check_excluded_libs (bfd
*abfd
)
2712 struct excluded_lib
*lib
= excluded_libs
;
2716 int len
= strlen (lib
->name
);
2717 const char *filename
= lbasename (abfd
->filename
);
2719 if (strcmp (lib
->name
, "ALL") == 0)
2721 abfd
->no_export
= TRUE
;
2725 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2726 && (filename
[len
] == '\0'
2727 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2728 && filename
[len
+ 2] == '\0')))
2730 abfd
->no_export
= TRUE
;
2738 /* Get the symbols for an input file. */
2741 load_symbols (lang_input_statement_type
*entry
,
2742 lang_statement_list_type
*place
)
2746 if (entry
->flags
.loaded
)
2749 ldfile_open_file (entry
);
2751 /* Do not process further if the file was missing. */
2752 if (entry
->flags
.missing_file
)
2755 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
2756 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2759 struct lang_input_statement_flags save_flags
;
2762 err
= bfd_get_error ();
2764 /* See if the emulation has some special knowledge. */
2765 if (ldemul_unrecognized_file (entry
))
2768 if (err
== bfd_error_file_ambiguously_recognized
)
2772 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2773 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2774 for (p
= matching
; *p
!= NULL
; p
++)
2778 else if (err
!= bfd_error_file_not_recognized
2780 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2782 bfd_close (entry
->the_bfd
);
2783 entry
->the_bfd
= NULL
;
2785 /* Try to interpret the file as a linker script. */
2786 save_flags
= input_flags
;
2787 ldfile_open_command_file (entry
->filename
);
2789 push_stat_ptr (place
);
2790 input_flags
.add_DT_NEEDED_for_regular
2791 = entry
->flags
.add_DT_NEEDED_for_regular
;
2792 input_flags
.add_DT_NEEDED_for_dynamic
2793 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2794 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2795 input_flags
.dynamic
= entry
->flags
.dynamic
;
2797 ldfile_assumed_script
= TRUE
;
2798 parser_input
= input_script
;
2800 ldfile_assumed_script
= FALSE
;
2802 /* missing_file is sticky. sysrooted will already have been
2803 restored when seeing EOF in yyparse, but no harm to restore
2805 save_flags
.missing_file
|= input_flags
.missing_file
;
2806 input_flags
= save_flags
;
2810 entry
->flags
.loaded
= TRUE
;
2815 if (ldemul_recognized_file (entry
))
2818 /* We don't call ldlang_add_file for an archive. Instead, the
2819 add_symbols entry point will call ldlang_add_file, via the
2820 add_archive_element callback, for each element of the archive
2822 switch (bfd_get_format (entry
->the_bfd
))
2828 if (!entry
->flags
.reload
)
2829 ldlang_add_file (entry
);
2830 if (trace_files
|| verbose
)
2831 info_msg ("%I\n", entry
);
2835 check_excluded_libs (entry
->the_bfd
);
2837 entry
->the_bfd
->usrdata
= entry
;
2838 if (entry
->flags
.whole_archive
)
2841 bfd_boolean loaded
= TRUE
;
2846 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2851 if (!bfd_check_format (member
, bfd_object
))
2853 einfo (_("%F%B: member %B in archive is not an object\n"),
2854 entry
->the_bfd
, member
);
2859 if (!(*link_info
.callbacks
2860 ->add_archive_element
) (&link_info
, member
,
2861 "--whole-archive", &subsbfd
))
2864 /* Potentially, the add_archive_element hook may have set a
2865 substitute BFD for us. */
2866 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2868 einfo (_("%F%B: error adding symbols: %E\n"), member
);
2873 entry
->flags
.loaded
= loaded
;
2879 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2880 entry
->flags
.loaded
= TRUE
;
2882 einfo (_("%F%B: error adding symbols: %E\n"), entry
->the_bfd
);
2884 return entry
->flags
.loaded
;
2887 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2888 may be NULL, indicating that it is a wildcard. Separate
2889 lang_input_section statements are created for each part of the
2890 expansion; they are added after the wild statement S. OUTPUT is
2891 the output section. */
2894 wild (lang_wild_statement_type
*s
,
2895 const char *target ATTRIBUTE_UNUSED
,
2896 lang_output_section_statement_type
*output
)
2898 struct wildcard_list
*sec
;
2900 if (s
->handler_data
[0]
2901 && s
->handler_data
[0]->spec
.sorted
== by_name
2902 && !s
->filenames_sorted
)
2904 lang_section_bst_type
*tree
;
2906 walk_wild (s
, output_section_callback_fast
, output
);
2911 output_section_callback_tree_to_list (s
, tree
, output
);
2916 walk_wild (s
, output_section_callback
, output
);
2918 if (default_common_section
== NULL
)
2919 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2920 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2922 /* Remember the section that common is going to in case we
2923 later get something which doesn't know where to put it. */
2924 default_common_section
= output
;
2929 /* Return TRUE iff target is the sought target. */
2932 get_target (const bfd_target
*target
, void *data
)
2934 const char *sought
= (const char *) data
;
2936 return strcmp (target
->name
, sought
) == 0;
2939 /* Like strcpy() but convert to lower case as well. */
2942 stricpy (char *dest
, char *src
)
2946 while ((c
= *src
++) != 0)
2947 *dest
++ = TOLOWER (c
);
2952 /* Remove the first occurrence of needle (if any) in haystack
2956 strcut (char *haystack
, char *needle
)
2958 haystack
= strstr (haystack
, needle
);
2964 for (src
= haystack
+ strlen (needle
); *src
;)
2965 *haystack
++ = *src
++;
2971 /* Compare two target format name strings.
2972 Return a value indicating how "similar" they are. */
2975 name_compare (char *first
, char *second
)
2981 copy1
= (char *) xmalloc (strlen (first
) + 1);
2982 copy2
= (char *) xmalloc (strlen (second
) + 1);
2984 /* Convert the names to lower case. */
2985 stricpy (copy1
, first
);
2986 stricpy (copy2
, second
);
2988 /* Remove size and endian strings from the name. */
2989 strcut (copy1
, "big");
2990 strcut (copy1
, "little");
2991 strcut (copy2
, "big");
2992 strcut (copy2
, "little");
2994 /* Return a value based on how many characters match,
2995 starting from the beginning. If both strings are
2996 the same then return 10 * their length. */
2997 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2998 if (copy1
[result
] == 0)
3010 /* Set by closest_target_match() below. */
3011 static const bfd_target
*winner
;
3013 /* Scan all the valid bfd targets looking for one that has the endianness
3014 requirement that was specified on the command line, and is the nearest
3015 match to the original output target. */
3018 closest_target_match (const bfd_target
*target
, void *data
)
3020 const bfd_target
*original
= (const bfd_target
*) data
;
3022 if (command_line
.endian
== ENDIAN_BIG
3023 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3026 if (command_line
.endian
== ENDIAN_LITTLE
3027 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3030 /* Must be the same flavour. */
3031 if (target
->flavour
!= original
->flavour
)
3034 /* Ignore generic big and little endian elf vectors. */
3035 if (strcmp (target
->name
, "elf32-big") == 0
3036 || strcmp (target
->name
, "elf64-big") == 0
3037 || strcmp (target
->name
, "elf32-little") == 0
3038 || strcmp (target
->name
, "elf64-little") == 0)
3041 /* If we have not found a potential winner yet, then record this one. */
3048 /* Oh dear, we now have two potential candidates for a successful match.
3049 Compare their names and choose the better one. */
3050 if (name_compare (target
->name
, original
->name
)
3051 > name_compare (winner
->name
, original
->name
))
3054 /* Keep on searching until wqe have checked them all. */
3058 /* Return the BFD target format of the first input file. */
3061 get_first_input_target (void)
3063 char *target
= NULL
;
3065 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3067 if (s
->header
.type
== lang_input_statement_enum
3070 ldfile_open_file (s
);
3072 if (s
->the_bfd
!= NULL
3073 && bfd_check_format (s
->the_bfd
, bfd_object
))
3075 target
= bfd_get_target (s
->the_bfd
);
3087 lang_get_output_target (void)
3091 /* Has the user told us which output format to use? */
3092 if (output_target
!= NULL
)
3093 return output_target
;
3095 /* No - has the current target been set to something other than
3097 if (current_target
!= default_target
&& current_target
!= NULL
)
3098 return current_target
;
3100 /* No - can we determine the format of the first input file? */
3101 target
= get_first_input_target ();
3105 /* Failed - use the default output target. */
3106 return default_target
;
3109 /* Open the output file. */
3112 open_output (const char *name
)
3114 output_target
= lang_get_output_target ();
3116 /* Has the user requested a particular endianness on the command
3118 if (command_line
.endian
!= ENDIAN_UNSET
)
3120 /* Get the chosen target. */
3121 const bfd_target
*target
3122 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3124 /* If the target is not supported, we cannot do anything. */
3127 enum bfd_endian desired_endian
;
3129 if (command_line
.endian
== ENDIAN_BIG
)
3130 desired_endian
= BFD_ENDIAN_BIG
;
3132 desired_endian
= BFD_ENDIAN_LITTLE
;
3134 /* See if the target has the wrong endianness. This should
3135 not happen if the linker script has provided big and
3136 little endian alternatives, but some scrips don't do
3138 if (target
->byteorder
!= desired_endian
)
3140 /* If it does, then see if the target provides
3141 an alternative with the correct endianness. */
3142 if (target
->alternative_target
!= NULL
3143 && (target
->alternative_target
->byteorder
== desired_endian
))
3144 output_target
= target
->alternative_target
->name
;
3147 /* Try to find a target as similar as possible to
3148 the default target, but which has the desired
3149 endian characteristic. */
3150 bfd_iterate_over_targets (closest_target_match
,
3153 /* Oh dear - we could not find any targets that
3154 satisfy our requirements. */
3156 einfo (_("%P: warning: could not find any targets"
3157 " that match endianness requirement\n"));
3159 output_target
= winner
->name
;
3165 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3167 if (link_info
.output_bfd
== NULL
)
3169 if (bfd_get_error () == bfd_error_invalid_target
)
3170 einfo (_("%P%F: target %s not found\n"), output_target
);
3172 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3175 delete_output_file_on_failure
= TRUE
;
3177 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3178 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3179 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3180 ldfile_output_architecture
,
3181 ldfile_output_machine
))
3182 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3184 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3185 if (link_info
.hash
== NULL
)
3186 einfo (_("%P%F: can not create hash table: %E\n"));
3188 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3192 ldlang_open_output (lang_statement_union_type
*statement
)
3194 switch (statement
->header
.type
)
3196 case lang_output_statement_enum
:
3197 ASSERT (link_info
.output_bfd
== NULL
);
3198 open_output (statement
->output_statement
.name
);
3199 ldemul_set_output_arch ();
3200 if (config
.magic_demand_paged
3201 && !bfd_link_relocatable (&link_info
))
3202 link_info
.output_bfd
->flags
|= D_PAGED
;
3204 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3205 if (config
.text_read_only
)
3206 link_info
.output_bfd
->flags
|= WP_TEXT
;
3208 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3209 if (link_info
.traditional_format
)
3210 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3212 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3215 case lang_target_statement_enum
:
3216 current_target
= statement
->target_statement
.target
;
3226 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3227 ldfile_output_machine
);
3230 while ((x
& 1) == 0)
3238 /* Open all the input files. */
3242 OPEN_BFD_NORMAL
= 0,
3246 #ifdef ENABLE_PLUGINS
3247 static lang_input_statement_type
*plugin_insert
= NULL
;
3251 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3253 for (; s
!= NULL
; s
= s
->header
.next
)
3255 switch (s
->header
.type
)
3257 case lang_constructors_statement_enum
:
3258 open_input_bfds (constructor_list
.head
, mode
);
3260 case lang_output_section_statement_enum
:
3261 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3263 case lang_wild_statement_enum
:
3264 /* Maybe we should load the file's symbols. */
3265 if ((mode
& OPEN_BFD_RESCAN
) == 0
3266 && s
->wild_statement
.filename
3267 && !wildcardp (s
->wild_statement
.filename
)
3268 && !archive_path (s
->wild_statement
.filename
))
3269 lookup_name (s
->wild_statement
.filename
);
3270 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3272 case lang_group_statement_enum
:
3274 struct bfd_link_hash_entry
*undefs
;
3276 /* We must continually search the entries in the group
3277 until no new symbols are added to the list of undefined
3282 undefs
= link_info
.hash
->undefs_tail
;
3283 open_input_bfds (s
->group_statement
.children
.head
,
3284 mode
| OPEN_BFD_FORCE
);
3286 while (undefs
!= link_info
.hash
->undefs_tail
);
3289 case lang_target_statement_enum
:
3290 current_target
= s
->target_statement
.target
;
3292 case lang_input_statement_enum
:
3293 if (s
->input_statement
.flags
.real
)
3295 lang_statement_union_type
**os_tail
;
3296 lang_statement_list_type add
;
3299 s
->input_statement
.target
= current_target
;
3301 /* If we are being called from within a group, and this
3302 is an archive which has already been searched, then
3303 force it to be researched unless the whole archive
3304 has been loaded already. Do the same for a rescan.
3305 Likewise reload --as-needed shared libs. */
3306 if (mode
!= OPEN_BFD_NORMAL
3307 #ifdef ENABLE_PLUGINS
3308 && ((mode
& OPEN_BFD_RESCAN
) == 0
3309 || plugin_insert
== NULL
)
3311 && s
->input_statement
.flags
.loaded
3312 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3313 && ((bfd_get_format (abfd
) == bfd_archive
3314 && !s
->input_statement
.flags
.whole_archive
)
3315 || (bfd_get_format (abfd
) == bfd_object
3316 && ((abfd
->flags
) & DYNAMIC
) != 0
3317 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3318 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3319 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3321 s
->input_statement
.flags
.loaded
= FALSE
;
3322 s
->input_statement
.flags
.reload
= TRUE
;
3325 os_tail
= lang_output_section_statement
.tail
;
3326 lang_list_init (&add
);
3328 if (!load_symbols (&s
->input_statement
, &add
))
3329 config
.make_executable
= FALSE
;
3331 if (add
.head
!= NULL
)
3333 /* If this was a script with output sections then
3334 tack any added statements on to the end of the
3335 list. This avoids having to reorder the output
3336 section statement list. Very likely the user
3337 forgot -T, and whatever we do here will not meet
3338 naive user expectations. */
3339 if (os_tail
!= lang_output_section_statement
.tail
)
3341 einfo (_("%P: warning: %s contains output sections;"
3342 " did you forget -T?\n"),
3343 s
->input_statement
.filename
);
3344 *stat_ptr
->tail
= add
.head
;
3345 stat_ptr
->tail
= add
.tail
;
3349 *add
.tail
= s
->header
.next
;
3350 s
->header
.next
= add
.head
;
3354 #ifdef ENABLE_PLUGINS
3355 /* If we have found the point at which a plugin added new
3356 files, clear plugin_insert to enable archive rescan. */
3357 if (&s
->input_statement
== plugin_insert
)
3358 plugin_insert
= NULL
;
3361 case lang_assignment_statement_enum
:
3362 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
3363 && s
->assignment_statement
.exp
->assign
.defsym
)
3364 /* This is from a --defsym on the command line. */
3365 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3372 /* Exit if any of the files were missing. */
3373 if (input_flags
.missing_file
)
3377 /* Add the supplied name to the symbol table as an undefined reference.
3378 This is a two step process as the symbol table doesn't even exist at
3379 the time the ld command line is processed. First we put the name
3380 on a list, then, once the output file has been opened, transfer the
3381 name to the symbol table. */
3383 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3385 #define ldlang_undef_chain_list_head entry_symbol.next
3388 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3390 ldlang_undef_chain_list_type
*new_undef
;
3392 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3393 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3394 new_undef
->next
= ldlang_undef_chain_list_head
;
3395 ldlang_undef_chain_list_head
= new_undef
;
3397 new_undef
->name
= xstrdup (name
);
3399 if (link_info
.output_bfd
!= NULL
)
3400 insert_undefined (new_undef
->name
);
3403 /* Insert NAME as undefined in the symbol table. */
3406 insert_undefined (const char *name
)
3408 struct bfd_link_hash_entry
*h
;
3410 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3412 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3413 if (h
->type
== bfd_link_hash_new
)
3415 h
->type
= bfd_link_hash_undefined
;
3416 h
->u
.undef
.abfd
= NULL
;
3417 if (is_elf_hash_table (link_info
.hash
))
3418 ((struct elf_link_hash_entry
*) h
)->mark
= 1;
3419 bfd_link_add_undef (link_info
.hash
, h
);
3423 /* Run through the list of undefineds created above and place them
3424 into the linker hash table as undefined symbols belonging to the
3428 lang_place_undefineds (void)
3430 ldlang_undef_chain_list_type
*ptr
;
3432 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3433 insert_undefined (ptr
->name
);
3436 /* Structure used to build the list of symbols that the user has required
3439 struct require_defined_symbol
3442 struct require_defined_symbol
*next
;
3445 /* The list of symbols that the user has required be defined. */
3447 static struct require_defined_symbol
*require_defined_symbol_list
;
3449 /* Add a new symbol NAME to the list of symbols that are required to be
3453 ldlang_add_require_defined (const char *const name
)
3455 struct require_defined_symbol
*ptr
;
3457 ldlang_add_undef (name
, TRUE
);
3458 ptr
= (struct require_defined_symbol
*) stat_alloc (sizeof (*ptr
));
3459 ptr
->next
= require_defined_symbol_list
;
3460 ptr
->name
= strdup (name
);
3461 require_defined_symbol_list
= ptr
;
3464 /* Check that all symbols the user required to be defined, are defined,
3465 raise an error if we find a symbol that is not defined. */
3468 ldlang_check_require_defined_symbols (void)
3470 struct require_defined_symbol
*ptr
;
3472 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
3474 struct bfd_link_hash_entry
*h
;
3476 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
3477 FALSE
, FALSE
, TRUE
);
3479 || (h
->type
!= bfd_link_hash_defined
3480 && h
->type
!= bfd_link_hash_defweak
))
3481 einfo(_("%P%X: required symbol `%s' not defined\n"), ptr
->name
);
3485 /* Check for all readonly or some readwrite sections. */
3488 check_input_sections
3489 (lang_statement_union_type
*s
,
3490 lang_output_section_statement_type
*output_section_statement
)
3492 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3494 switch (s
->header
.type
)
3496 case lang_wild_statement_enum
:
3497 walk_wild (&s
->wild_statement
, check_section_callback
,
3498 output_section_statement
);
3499 if (!output_section_statement
->all_input_readonly
)
3502 case lang_constructors_statement_enum
:
3503 check_input_sections (constructor_list
.head
,
3504 output_section_statement
);
3505 if (!output_section_statement
->all_input_readonly
)
3508 case lang_group_statement_enum
:
3509 check_input_sections (s
->group_statement
.children
.head
,
3510 output_section_statement
);
3511 if (!output_section_statement
->all_input_readonly
)
3520 /* Update wildcard statements if needed. */
3523 update_wild_statements (lang_statement_union_type
*s
)
3525 struct wildcard_list
*sec
;
3527 switch (sort_section
)
3537 for (; s
!= NULL
; s
= s
->header
.next
)
3539 switch (s
->header
.type
)
3544 case lang_wild_statement_enum
:
3545 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3548 switch (sec
->spec
.sorted
)
3551 sec
->spec
.sorted
= sort_section
;
3554 if (sort_section
== by_alignment
)
3555 sec
->spec
.sorted
= by_name_alignment
;
3558 if (sort_section
== by_name
)
3559 sec
->spec
.sorted
= by_alignment_name
;
3567 case lang_constructors_statement_enum
:
3568 update_wild_statements (constructor_list
.head
);
3571 case lang_output_section_statement_enum
:
3572 /* Don't sort .init/.fini sections. */
3573 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3574 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3575 update_wild_statements
3576 (s
->output_section_statement
.children
.head
);
3579 case lang_group_statement_enum
:
3580 update_wild_statements (s
->group_statement
.children
.head
);
3588 /* Open input files and attach to output sections. */
3591 map_input_to_output_sections
3592 (lang_statement_union_type
*s
, const char *target
,
3593 lang_output_section_statement_type
*os
)
3595 for (; s
!= NULL
; s
= s
->header
.next
)
3597 lang_output_section_statement_type
*tos
;
3600 switch (s
->header
.type
)
3602 case lang_wild_statement_enum
:
3603 wild (&s
->wild_statement
, target
, os
);
3605 case lang_constructors_statement_enum
:
3606 map_input_to_output_sections (constructor_list
.head
,
3610 case lang_output_section_statement_enum
:
3611 tos
= &s
->output_section_statement
;
3612 if (tos
->constraint
!= 0)
3614 if (tos
->constraint
!= ONLY_IF_RW
3615 && tos
->constraint
!= ONLY_IF_RO
)
3617 tos
->all_input_readonly
= TRUE
;
3618 check_input_sections (tos
->children
.head
, tos
);
3619 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3621 tos
->constraint
= -1;
3625 map_input_to_output_sections (tos
->children
.head
,
3629 case lang_output_statement_enum
:
3631 case lang_target_statement_enum
:
3632 target
= s
->target_statement
.target
;
3634 case lang_group_statement_enum
:
3635 map_input_to_output_sections (s
->group_statement
.children
.head
,
3639 case lang_data_statement_enum
:
3640 /* Make sure that any sections mentioned in the expression
3642 exp_init_os (s
->data_statement
.exp
);
3643 /* The output section gets CONTENTS, ALLOC and LOAD, but
3644 these may be overridden by the script. */
3645 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3646 switch (os
->sectype
)
3648 case normal_section
:
3649 case overlay_section
:
3651 case noalloc_section
:
3652 flags
= SEC_HAS_CONTENTS
;
3654 case noload_section
:
3655 if (bfd_get_flavour (link_info
.output_bfd
)
3656 == bfd_target_elf_flavour
)
3657 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3659 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3662 if (os
->bfd_section
== NULL
)
3663 init_os (os
, flags
);
3665 os
->bfd_section
->flags
|= flags
;
3667 case lang_input_section_enum
:
3669 case lang_fill_statement_enum
:
3670 case lang_object_symbols_statement_enum
:
3671 case lang_reloc_statement_enum
:
3672 case lang_padding_statement_enum
:
3673 case lang_input_statement_enum
:
3674 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3677 case lang_assignment_statement_enum
:
3678 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3681 /* Make sure that any sections mentioned in the assignment
3683 exp_init_os (s
->assignment_statement
.exp
);
3685 case lang_address_statement_enum
:
3686 /* Mark the specified section with the supplied address.
3687 If this section was actually a segment marker, then the
3688 directive is ignored if the linker script explicitly
3689 processed the segment marker. Originally, the linker
3690 treated segment directives (like -Ttext on the
3691 command-line) as section directives. We honor the
3692 section directive semantics for backwards compatibility;
3693 linker scripts that do not specifically check for
3694 SEGMENT_START automatically get the old semantics. */
3695 if (!s
->address_statement
.segment
3696 || !s
->address_statement
.segment
->used
)
3698 const char *name
= s
->address_statement
.section_name
;
3700 /* Create the output section statement here so that
3701 orphans with a set address will be placed after other
3702 script sections. If we let the orphan placement code
3703 place them in amongst other sections then the address
3704 will affect following script sections, which is
3705 likely to surprise naive users. */
3706 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3707 tos
->addr_tree
= s
->address_statement
.address
;
3708 if (tos
->bfd_section
== NULL
)
3712 case lang_insert_statement_enum
:
3718 /* An insert statement snips out all the linker statements from the
3719 start of the list and places them after the output section
3720 statement specified by the insert. This operation is complicated
3721 by the fact that we keep a doubly linked list of output section
3722 statements as well as the singly linked list of all statements. */
3725 process_insert_statements (void)
3727 lang_statement_union_type
**s
;
3728 lang_output_section_statement_type
*first_os
= NULL
;
3729 lang_output_section_statement_type
*last_os
= NULL
;
3730 lang_output_section_statement_type
*os
;
3732 /* "start of list" is actually the statement immediately after
3733 the special abs_section output statement, so that it isn't
3735 s
= &lang_output_section_statement
.head
;
3736 while (*(s
= &(*s
)->header
.next
) != NULL
)
3738 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3740 /* Keep pointers to the first and last output section
3741 statement in the sequence we may be about to move. */
3742 os
= &(*s
)->output_section_statement
;
3744 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3747 /* Set constraint negative so that lang_output_section_find
3748 won't match this output section statement. At this
3749 stage in linking constraint has values in the range
3750 [-1, ONLY_IN_RW]. */
3751 last_os
->constraint
= -2 - last_os
->constraint
;
3752 if (first_os
== NULL
)
3755 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3757 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3758 lang_output_section_statement_type
*where
;
3759 lang_statement_union_type
**ptr
;
3760 lang_statement_union_type
*first
;
3762 where
= lang_output_section_find (i
->where
);
3763 if (where
!= NULL
&& i
->is_before
)
3766 where
= where
->prev
;
3767 while (where
!= NULL
&& where
->constraint
< 0);
3771 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3775 /* Deal with reordering the output section statement list. */
3776 if (last_os
!= NULL
)
3778 asection
*first_sec
, *last_sec
;
3779 struct lang_output_section_statement_struct
**next
;
3781 /* Snip out the output sections we are moving. */
3782 first_os
->prev
->next
= last_os
->next
;
3783 if (last_os
->next
== NULL
)
3785 next
= &first_os
->prev
->next
;
3786 lang_output_section_statement
.tail
3787 = (lang_statement_union_type
**) next
;
3790 last_os
->next
->prev
= first_os
->prev
;
3791 /* Add them in at the new position. */
3792 last_os
->next
= where
->next
;
3793 if (where
->next
== NULL
)
3795 next
= &last_os
->next
;
3796 lang_output_section_statement
.tail
3797 = (lang_statement_union_type
**) next
;
3800 where
->next
->prev
= last_os
;
3801 first_os
->prev
= where
;
3802 where
->next
= first_os
;
3804 /* Move the bfd sections in the same way. */
3807 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3809 os
->constraint
= -2 - os
->constraint
;
3810 if (os
->bfd_section
!= NULL
3811 && os
->bfd_section
->owner
!= NULL
)
3813 last_sec
= os
->bfd_section
;
3814 if (first_sec
== NULL
)
3815 first_sec
= last_sec
;
3820 if (last_sec
!= NULL
)
3822 asection
*sec
= where
->bfd_section
;
3824 sec
= output_prev_sec_find (where
);
3826 /* The place we want to insert must come after the
3827 sections we are moving. So if we find no
3828 section or if the section is the same as our
3829 last section, then no move is needed. */
3830 if (sec
!= NULL
&& sec
!= last_sec
)
3832 /* Trim them off. */
3833 if (first_sec
->prev
!= NULL
)
3834 first_sec
->prev
->next
= last_sec
->next
;
3836 link_info
.output_bfd
->sections
= last_sec
->next
;
3837 if (last_sec
->next
!= NULL
)
3838 last_sec
->next
->prev
= first_sec
->prev
;
3840 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3842 last_sec
->next
= sec
->next
;
3843 if (sec
->next
!= NULL
)
3844 sec
->next
->prev
= last_sec
;
3846 link_info
.output_bfd
->section_last
= last_sec
;
3847 first_sec
->prev
= sec
;
3848 sec
->next
= first_sec
;
3856 ptr
= insert_os_after (where
);
3857 /* Snip everything after the abs_section output statement we
3858 know is at the start of the list, up to and including
3859 the insert statement we are currently processing. */
3860 first
= lang_output_section_statement
.head
->header
.next
;
3861 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3862 /* Add them back where they belong. */
3865 statement_list
.tail
= s
;
3867 s
= &lang_output_section_statement
.head
;
3871 /* Undo constraint twiddling. */
3872 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3874 os
->constraint
= -2 - os
->constraint
;
3880 /* An output section might have been removed after its statement was
3881 added. For example, ldemul_before_allocation can remove dynamic
3882 sections if they turn out to be not needed. Clean them up here. */
3885 strip_excluded_output_sections (void)
3887 lang_output_section_statement_type
*os
;
3889 /* Run lang_size_sections (if not already done). */
3890 if (expld
.phase
!= lang_mark_phase_enum
)
3892 expld
.phase
= lang_mark_phase_enum
;
3893 expld
.dataseg
.phase
= exp_seg_none
;
3894 one_lang_size_sections_pass (NULL
, FALSE
);
3895 lang_reset_memory_regions ();
3898 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3902 asection
*output_section
;
3903 bfd_boolean exclude
;
3905 if (os
->constraint
< 0)
3908 output_section
= os
->bfd_section
;
3909 if (output_section
== NULL
)
3912 exclude
= (output_section
->rawsize
== 0
3913 && (output_section
->flags
& SEC_KEEP
) == 0
3914 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3917 /* Some sections have not yet been sized, notably .gnu.version,
3918 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3919 input sections, so don't drop output sections that have such
3920 input sections unless they are also marked SEC_EXCLUDE. */
3921 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3925 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3926 if ((s
->flags
& SEC_EXCLUDE
) == 0
3927 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3928 || link_info
.emitrelocations
))
3937 /* We don't set bfd_section to NULL since bfd_section of the
3938 removed output section statement may still be used. */
3939 if (!os
->update_dot
)
3941 output_section
->flags
|= SEC_EXCLUDE
;
3942 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3943 link_info
.output_bfd
->section_count
--;
3948 /* Called from ldwrite to clear out asection.map_head and
3949 asection.map_tail for use as link_orders in ldwrite.
3950 FIXME: Except for sh64elf.em which starts creating link_orders in
3951 its after_allocation routine so needs to call it early. */
3954 lang_clear_os_map (void)
3956 lang_output_section_statement_type
*os
;
3958 if (map_head_is_link_order
)
3961 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3965 asection
*output_section
;
3967 if (os
->constraint
< 0)
3970 output_section
= os
->bfd_section
;
3971 if (output_section
== NULL
)
3974 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3975 output_section
->map_head
.link_order
= NULL
;
3976 output_section
->map_tail
.link_order
= NULL
;
3979 /* Stop future calls to lang_add_section from messing with map_head
3980 and map_tail link_order fields. */
3981 map_head_is_link_order
= TRUE
;
3985 print_output_section_statement
3986 (lang_output_section_statement_type
*output_section_statement
)
3988 asection
*section
= output_section_statement
->bfd_section
;
3991 if (output_section_statement
!= abs_output_section
)
3993 minfo ("\n%s", output_section_statement
->name
);
3995 if (section
!= NULL
)
3997 print_dot
= section
->vma
;
3999 len
= strlen (output_section_statement
->name
);
4000 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4005 while (len
< SECTION_NAME_MAP_LENGTH
)
4011 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4013 if (section
->vma
!= section
->lma
)
4014 minfo (_(" load address 0x%V"), section
->lma
);
4016 if (output_section_statement
->update_dot_tree
!= NULL
)
4017 exp_fold_tree (output_section_statement
->update_dot_tree
,
4018 bfd_abs_section_ptr
, &print_dot
);
4024 print_statement_list (output_section_statement
->children
.head
,
4025 output_section_statement
);
4029 print_assignment (lang_assignment_statement_type
*assignment
,
4030 lang_output_section_statement_type
*output_section
)
4037 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4040 if (assignment
->exp
->type
.node_class
== etree_assert
)
4043 tree
= assignment
->exp
->assert_s
.child
;
4047 const char *dst
= assignment
->exp
->assign
.dst
;
4049 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4051 expld
.assign_name
= dst
;
4052 tree
= assignment
->exp
->assign
.src
;
4055 osec
= output_section
->bfd_section
;
4057 osec
= bfd_abs_section_ptr
;
4059 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4060 exp_fold_tree (tree
, osec
, &print_dot
);
4062 expld
.result
.valid_p
= FALSE
;
4064 if (expld
.result
.valid_p
)
4068 if (assignment
->exp
->type
.node_class
== etree_assert
4070 || expld
.assign_name
!= NULL
)
4072 value
= expld
.result
.value
;
4074 if (expld
.result
.section
!= NULL
)
4075 value
+= expld
.result
.section
->vma
;
4077 minfo ("0x%V", value
);
4083 struct bfd_link_hash_entry
*h
;
4085 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4086 FALSE
, FALSE
, TRUE
);
4089 value
= h
->u
.def
.value
;
4090 value
+= h
->u
.def
.section
->output_section
->vma
;
4091 value
+= h
->u
.def
.section
->output_offset
;
4093 minfo ("[0x%V]", value
);
4096 minfo ("[unresolved]");
4101 if (assignment
->exp
->type
.node_class
== etree_provide
)
4102 minfo ("[!provide]");
4109 expld
.assign_name
= NULL
;
4112 exp_print_tree (assignment
->exp
);
4117 print_input_statement (lang_input_statement_type
*statm
)
4119 if (statm
->filename
!= NULL
4120 && (statm
->the_bfd
== NULL
4121 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4122 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4125 /* Print all symbols defined in a particular section. This is called
4126 via bfd_link_hash_traverse, or by print_all_symbols. */
4129 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4131 asection
*sec
= (asection
*) ptr
;
4133 if ((hash_entry
->type
== bfd_link_hash_defined
4134 || hash_entry
->type
== bfd_link_hash_defweak
)
4135 && sec
== hash_entry
->u
.def
.section
)
4139 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4142 (hash_entry
->u
.def
.value
4143 + hash_entry
->u
.def
.section
->output_offset
4144 + hash_entry
->u
.def
.section
->output_section
->vma
));
4146 minfo (" %T\n", hash_entry
->root
.string
);
4153 hash_entry_addr_cmp (const void *a
, const void *b
)
4155 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4156 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4158 if (l
->u
.def
.value
< r
->u
.def
.value
)
4160 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4167 print_all_symbols (asection
*sec
)
4169 input_section_userdata_type
*ud
4170 = (input_section_userdata_type
*) get_userdata (sec
);
4171 struct map_symbol_def
*def
;
4172 struct bfd_link_hash_entry
**entries
;
4178 *ud
->map_symbol_def_tail
= 0;
4180 /* Sort the symbols by address. */
4181 entries
= (struct bfd_link_hash_entry
**)
4182 obstack_alloc (&map_obstack
,
4183 ud
->map_symbol_def_count
* sizeof (*entries
));
4185 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4186 entries
[i
] = def
->entry
;
4188 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4189 hash_entry_addr_cmp
);
4191 /* Print the symbols. */
4192 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4193 print_one_symbol (entries
[i
], sec
);
4195 obstack_free (&map_obstack
, entries
);
4198 /* Print information about an input section to the map file. */
4201 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4203 bfd_size_type size
= i
->size
;
4210 minfo ("%s", i
->name
);
4212 len
= 1 + strlen (i
->name
);
4213 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4218 while (len
< SECTION_NAME_MAP_LENGTH
)
4224 if (i
->output_section
!= NULL
4225 && i
->output_section
->owner
== link_info
.output_bfd
)
4226 addr
= i
->output_section
->vma
+ i
->output_offset
;
4234 minfo ("0x%V %W %B\n", addr
, size
, i
->owner
);
4236 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4238 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4250 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4253 if (i
->output_section
!= NULL
4254 && i
->output_section
->owner
== link_info
.output_bfd
)
4256 if (link_info
.reduce_memory_overheads
)
4257 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4259 print_all_symbols (i
);
4261 /* Update print_dot, but make sure that we do not move it
4262 backwards - this could happen if we have overlays and a
4263 later overlay is shorter than an earier one. */
4264 if (addr
+ TO_ADDR (size
) > print_dot
)
4265 print_dot
= addr
+ TO_ADDR (size
);
4270 print_fill_statement (lang_fill_statement_type
*fill
)
4274 fputs (" FILL mask 0x", config
.map_file
);
4275 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4276 fprintf (config
.map_file
, "%02x", *p
);
4277 fputs ("\n", config
.map_file
);
4281 print_data_statement (lang_data_statement_type
*data
)
4289 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4292 addr
= data
->output_offset
;
4293 if (data
->output_section
!= NULL
)
4294 addr
+= data
->output_section
->vma
;
4322 if (size
< TO_SIZE ((unsigned) 1))
4323 size
= TO_SIZE ((unsigned) 1);
4324 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4326 if (data
->exp
->type
.node_class
!= etree_value
)
4329 exp_print_tree (data
->exp
);
4334 print_dot
= addr
+ TO_ADDR (size
);
4337 /* Print an address statement. These are generated by options like
4341 print_address_statement (lang_address_statement_type
*address
)
4343 minfo (_("Address of section %s set to "), address
->section_name
);
4344 exp_print_tree (address
->address
);
4348 /* Print a reloc statement. */
4351 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4358 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4361 addr
= reloc
->output_offset
;
4362 if (reloc
->output_section
!= NULL
)
4363 addr
+= reloc
->output_section
->vma
;
4365 size
= bfd_get_reloc_size (reloc
->howto
);
4367 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4369 if (reloc
->name
!= NULL
)
4370 minfo ("%s+", reloc
->name
);
4372 minfo ("%s+", reloc
->section
->name
);
4374 exp_print_tree (reloc
->addend_exp
);
4378 print_dot
= addr
+ TO_ADDR (size
);
4382 print_padding_statement (lang_padding_statement_type
*s
)
4390 len
= sizeof " *fill*" - 1;
4391 while (len
< SECTION_NAME_MAP_LENGTH
)
4397 addr
= s
->output_offset
;
4398 if (s
->output_section
!= NULL
)
4399 addr
+= s
->output_section
->vma
;
4400 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4402 if (s
->fill
->size
!= 0)
4406 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4407 fprintf (config
.map_file
, "%02x", *p
);
4412 print_dot
= addr
+ TO_ADDR (s
->size
);
4416 print_wild_statement (lang_wild_statement_type
*w
,
4417 lang_output_section_statement_type
*os
)
4419 struct wildcard_list
*sec
;
4423 if (w
->exclude_name_list
)
4426 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
4427 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4428 minfo (" %s", tmp
->name
);
4432 if (w
->filenames_sorted
)
4433 minfo ("SORT_BY_NAME(");
4434 if (w
->filename
!= NULL
)
4435 minfo ("%s", w
->filename
);
4438 if (w
->filenames_sorted
)
4442 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4444 int closing_paren
= 0;
4446 switch (sec
->spec
.sorted
)
4452 minfo ("SORT_BY_NAME(");
4457 minfo ("SORT_BY_ALIGNMENT(");
4461 case by_name_alignment
:
4462 minfo ("SORT_BY_NAME(SORT_BY_ALIGNMENT(");
4466 case by_alignment_name
:
4467 minfo ("SORT_BY_ALIGNMENT(SORT_BY_NAME(");
4472 minfo ("SORT_NONE(");
4476 case by_init_priority
:
4477 minfo ("SORT_BY_INIT_PRIORITY(");
4482 if (sec
->spec
.exclude_name_list
!= NULL
)
4485 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4486 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4487 minfo (" %s", tmp
->name
);
4490 if (sec
->spec
.name
!= NULL
)
4491 minfo ("%s", sec
->spec
.name
);
4494 for (;closing_paren
> 0; closing_paren
--)
4503 print_statement_list (w
->children
.head
, os
);
4506 /* Print a group statement. */
4509 print_group (lang_group_statement_type
*s
,
4510 lang_output_section_statement_type
*os
)
4512 fprintf (config
.map_file
, "START GROUP\n");
4513 print_statement_list (s
->children
.head
, os
);
4514 fprintf (config
.map_file
, "END GROUP\n");
4517 /* Print the list of statements in S.
4518 This can be called for any statement type. */
4521 print_statement_list (lang_statement_union_type
*s
,
4522 lang_output_section_statement_type
*os
)
4526 print_statement (s
, os
);
4531 /* Print the first statement in statement list S.
4532 This can be called for any statement type. */
4535 print_statement (lang_statement_union_type
*s
,
4536 lang_output_section_statement_type
*os
)
4538 switch (s
->header
.type
)
4541 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4544 case lang_constructors_statement_enum
:
4545 if (constructor_list
.head
!= NULL
)
4547 if (constructors_sorted
)
4548 minfo (" SORT (CONSTRUCTORS)\n");
4550 minfo (" CONSTRUCTORS\n");
4551 print_statement_list (constructor_list
.head
, os
);
4554 case lang_wild_statement_enum
:
4555 print_wild_statement (&s
->wild_statement
, os
);
4557 case lang_address_statement_enum
:
4558 print_address_statement (&s
->address_statement
);
4560 case lang_object_symbols_statement_enum
:
4561 minfo (" CREATE_OBJECT_SYMBOLS\n");
4563 case lang_fill_statement_enum
:
4564 print_fill_statement (&s
->fill_statement
);
4566 case lang_data_statement_enum
:
4567 print_data_statement (&s
->data_statement
);
4569 case lang_reloc_statement_enum
:
4570 print_reloc_statement (&s
->reloc_statement
);
4572 case lang_input_section_enum
:
4573 print_input_section (s
->input_section
.section
, FALSE
);
4575 case lang_padding_statement_enum
:
4576 print_padding_statement (&s
->padding_statement
);
4578 case lang_output_section_statement_enum
:
4579 print_output_section_statement (&s
->output_section_statement
);
4581 case lang_assignment_statement_enum
:
4582 print_assignment (&s
->assignment_statement
, os
);
4584 case lang_target_statement_enum
:
4585 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4587 case lang_output_statement_enum
:
4588 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4589 if (output_target
!= NULL
)
4590 minfo (" %s", output_target
);
4593 case lang_input_statement_enum
:
4594 print_input_statement (&s
->input_statement
);
4596 case lang_group_statement_enum
:
4597 print_group (&s
->group_statement
, os
);
4599 case lang_insert_statement_enum
:
4600 minfo ("INSERT %s %s\n",
4601 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4602 s
->insert_statement
.where
);
4608 print_statements (void)
4610 print_statement_list (statement_list
.head
, abs_output_section
);
4613 /* Print the first N statements in statement list S to STDERR.
4614 If N == 0, nothing is printed.
4615 If N < 0, the entire list is printed.
4616 Intended to be called from GDB. */
4619 dprint_statement (lang_statement_union_type
*s
, int n
)
4621 FILE *map_save
= config
.map_file
;
4623 config
.map_file
= stderr
;
4626 print_statement_list (s
, abs_output_section
);
4629 while (s
&& --n
>= 0)
4631 print_statement (s
, abs_output_section
);
4636 config
.map_file
= map_save
;
4640 insert_pad (lang_statement_union_type
**ptr
,
4642 bfd_size_type alignment_needed
,
4643 asection
*output_section
,
4646 static fill_type zero_fill
;
4647 lang_statement_union_type
*pad
= NULL
;
4649 if (ptr
!= &statement_list
.head
)
4650 pad
= ((lang_statement_union_type
*)
4651 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4653 && pad
->header
.type
== lang_padding_statement_enum
4654 && pad
->padding_statement
.output_section
== output_section
)
4656 /* Use the existing pad statement. */
4658 else if ((pad
= *ptr
) != NULL
4659 && pad
->header
.type
== lang_padding_statement_enum
4660 && pad
->padding_statement
.output_section
== output_section
)
4662 /* Use the existing pad statement. */
4666 /* Make a new padding statement, linked into existing chain. */
4667 pad
= (lang_statement_union_type
*)
4668 stat_alloc (sizeof (lang_padding_statement_type
));
4669 pad
->header
.next
= *ptr
;
4671 pad
->header
.type
= lang_padding_statement_enum
;
4672 pad
->padding_statement
.output_section
= output_section
;
4675 pad
->padding_statement
.fill
= fill
;
4677 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4678 pad
->padding_statement
.size
= alignment_needed
;
4679 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4680 - output_section
->vma
);
4683 /* Work out how much this section will move the dot point. */
4687 (lang_statement_union_type
**this_ptr
,
4688 lang_output_section_statement_type
*output_section_statement
,
4692 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4693 asection
*i
= is
->section
;
4694 asection
*o
= output_section_statement
->bfd_section
;
4696 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4697 i
->output_offset
= i
->vma
- o
->vma
;
4698 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
4699 || output_section_statement
->ignored
)
4700 i
->output_offset
= dot
- o
->vma
;
4703 bfd_size_type alignment_needed
;
4705 /* Align this section first to the input sections requirement,
4706 then to the output section's requirement. If this alignment
4707 is greater than any seen before, then record it too. Perform
4708 the alignment by inserting a magic 'padding' statement. */
4710 if (output_section_statement
->subsection_alignment
!= -1)
4711 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4713 if (o
->alignment_power
< i
->alignment_power
)
4714 o
->alignment_power
= i
->alignment_power
;
4716 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4718 if (alignment_needed
!= 0)
4720 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4721 dot
+= alignment_needed
;
4724 /* Remember where in the output section this input section goes. */
4725 i
->output_offset
= dot
- o
->vma
;
4727 /* Mark how big the output section must be to contain this now. */
4728 dot
+= TO_ADDR (i
->size
);
4729 o
->size
= TO_SIZE (dot
- o
->vma
);
4742 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4744 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4745 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4747 if (sec1
->lma
< sec2
->lma
)
4749 else if (sec1
->lma
> sec2
->lma
)
4751 else if (sec1
->id
< sec2
->id
)
4753 else if (sec1
->id
> sec2
->id
)
4760 sort_sections_by_vma (const void *arg1
, const void *arg2
)
4762 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4763 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4765 if (sec1
->vma
< sec2
->vma
)
4767 else if (sec1
->vma
> sec2
->vma
)
4769 else if (sec1
->id
< sec2
->id
)
4771 else if (sec1
->id
> sec2
->id
)
4777 #define IS_TBSS(s) \
4778 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4780 #define IGNORE_SECTION(s) \
4781 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4783 /* Check to see if any allocated sections overlap with other allocated
4784 sections. This can happen if a linker script specifies the output
4785 section addresses of the two sections. Also check whether any memory
4786 region has overflowed. */
4789 lang_check_section_addresses (void)
4792 struct check_sec
*sections
;
4797 bfd_vma p_start
= 0;
4799 lang_memory_region_type
*m
;
4800 bfd_boolean overlays
;
4802 /* Detect address space overflow on allocated sections. */
4803 addr_mask
= ((bfd_vma
) 1 <<
4804 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
4805 addr_mask
= (addr_mask
<< 1) + 1;
4806 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4807 if ((s
->flags
& SEC_ALLOC
) != 0)
4809 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
4810 if (s_end
!= 0 && s_end
< (s
->vma
& addr_mask
))
4811 einfo (_("%X%P: section %s VMA wraps around address space\n"),
4815 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
4816 if (s_end
!= 0 && s_end
< (s
->lma
& addr_mask
))
4817 einfo (_("%X%P: section %s LMA wraps around address space\n"),
4822 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4825 count
= bfd_count_sections (link_info
.output_bfd
);
4826 sections
= XNEWVEC (struct check_sec
, count
);
4828 /* Scan all sections in the output list. */
4830 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4832 if (IGNORE_SECTION (s
)
4836 sections
[count
].sec
= s
;
4837 sections
[count
].warned
= FALSE
;
4847 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
4849 /* First check section LMAs. There should be no overlap of LMAs on
4850 loadable sections, even with overlays. */
4851 for (p
= NULL
, i
= 0; i
< count
; i
++)
4853 s
= sections
[i
].sec
;
4854 if ((s
->flags
& SEC_LOAD
) != 0)
4857 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4859 /* Look for an overlap. We have sorted sections by lma, so
4860 we know that s_start >= p_start. Besides the obvious
4861 case of overlap when the current section starts before
4862 the previous one ends, we also must have overlap if the
4863 previous section wraps around the address space. */
4865 && (s_start
<= p_end
4866 || p_end
< p_start
))
4868 einfo (_("%X%P: section %s LMA [%V,%V]"
4869 " overlaps section %s LMA [%V,%V]\n"),
4870 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4871 sections
[i
].warned
= TRUE
;
4879 /* If any non-zero size allocated section (excluding tbss) starts at
4880 exactly the same VMA as another such section, then we have
4881 overlays. Overlays generated by the OVERLAY keyword will have
4882 this property. It is possible to intentionally generate overlays
4883 that fail this test, but it would be unusual. */
4884 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
4886 p_start
= sections
[0].sec
->vma
;
4887 for (i
= 1; i
< count
; i
++)
4889 s_start
= sections
[i
].sec
->vma
;
4890 if (p_start
== s_start
)
4898 /* Now check section VMAs if no overlays were detected. */
4901 for (p
= NULL
, i
= 0; i
< count
; i
++)
4903 s
= sections
[i
].sec
;
4905 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4908 && !sections
[i
].warned
4909 && (s_start
<= p_end
4910 || p_end
< p_start
))
4911 einfo (_("%X%P: section %s VMA [%V,%V]"
4912 " overlaps section %s VMA [%V,%V]\n"),
4913 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4922 /* If any memory region has overflowed, report by how much.
4923 We do not issue this diagnostic for regions that had sections
4924 explicitly placed outside their bounds; os_region_check's
4925 diagnostics are adequate for that case.
4927 FIXME: It is conceivable that m->current - (m->origin + m->length)
4928 might overflow a 32-bit integer. There is, alas, no way to print
4929 a bfd_vma quantity in decimal. */
4930 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4931 if (m
->had_full_message
)
4933 unsigned long over
= m
->current
- (m
->origin
+ m
->length
);
4934 einfo (ngettext ("%X%P: region `%s' overflowed by %lu byte\n",
4935 "%X%P: region `%s' overflowed by %lu bytes\n",
4937 m
->name_list
.name
, over
);
4941 /* Make sure the new address is within the region. We explicitly permit the
4942 current address to be at the exact end of the region when the address is
4943 non-zero, in case the region is at the end of addressable memory and the
4944 calculation wraps around. */
4947 os_region_check (lang_output_section_statement_type
*os
,
4948 lang_memory_region_type
*region
,
4952 if ((region
->current
< region
->origin
4953 || (region
->current
- region
->origin
> region
->length
))
4954 && ((region
->current
!= region
->origin
+ region
->length
)
4959 einfo (_("%X%P: address 0x%v of %B section `%s'"
4960 " is not within region `%s'\n"),
4962 os
->bfd_section
->owner
,
4963 os
->bfd_section
->name
,
4964 region
->name_list
.name
);
4966 else if (!region
->had_full_message
)
4968 region
->had_full_message
= TRUE
;
4970 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4971 os
->bfd_section
->owner
,
4972 os
->bfd_section
->name
,
4973 region
->name_list
.name
);
4978 /* Set the sizes for all the output sections. */
4981 lang_size_sections_1
4982 (lang_statement_union_type
**prev
,
4983 lang_output_section_statement_type
*output_section_statement
,
4987 bfd_boolean check_regions
)
4989 lang_statement_union_type
*s
;
4991 /* Size up the sections from their constituent parts. */
4992 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4994 switch (s
->header
.type
)
4996 case lang_output_section_statement_enum
:
4998 bfd_vma newdot
, after
, dotdelta
;
4999 lang_output_section_statement_type
*os
;
5000 lang_memory_region_type
*r
;
5001 int section_alignment
= 0;
5003 os
= &s
->output_section_statement
;
5004 if (os
->constraint
== -1)
5007 /* FIXME: We shouldn't need to zero section vmas for ld -r
5008 here, in lang_insert_orphan, or in the default linker scripts.
5009 This is covering for coff backend linker bugs. See PR6945. */
5010 if (os
->addr_tree
== NULL
5011 && bfd_link_relocatable (&link_info
)
5012 && (bfd_get_flavour (link_info
.output_bfd
)
5013 == bfd_target_coff_flavour
))
5014 os
->addr_tree
= exp_intop (0);
5015 if (os
->addr_tree
!= NULL
)
5017 os
->processed_vma
= FALSE
;
5018 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
5020 if (expld
.result
.valid_p
)
5022 dot
= expld
.result
.value
;
5023 if (expld
.result
.section
!= NULL
)
5024 dot
+= expld
.result
.section
->vma
;
5026 else if (expld
.phase
!= lang_mark_phase_enum
)
5027 einfo (_("%F%S: non constant or forward reference"
5028 " address expression for section %s\n"),
5029 os
->addr_tree
, os
->name
);
5032 if (os
->bfd_section
== NULL
)
5033 /* This section was removed or never actually created. */
5036 /* If this is a COFF shared library section, use the size and
5037 address from the input section. FIXME: This is COFF
5038 specific; it would be cleaner if there were some other way
5039 to do this, but nothing simple comes to mind. */
5040 if (((bfd_get_flavour (link_info
.output_bfd
)
5041 == bfd_target_ecoff_flavour
)
5042 || (bfd_get_flavour (link_info
.output_bfd
)
5043 == bfd_target_coff_flavour
))
5044 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5048 if (os
->children
.head
== NULL
5049 || os
->children
.head
->header
.next
!= NULL
5050 || (os
->children
.head
->header
.type
5051 != lang_input_section_enum
))
5052 einfo (_("%P%X: Internal error on COFF shared library"
5053 " section %s\n"), os
->name
);
5055 input
= os
->children
.head
->input_section
.section
;
5056 bfd_set_section_vma (os
->bfd_section
->owner
,
5058 bfd_section_vma (input
->owner
, input
));
5059 os
->bfd_section
->size
= input
->size
;
5065 if (bfd_is_abs_section (os
->bfd_section
))
5067 /* No matter what happens, an abs section starts at zero. */
5068 ASSERT (os
->bfd_section
->vma
== 0);
5072 if (os
->addr_tree
== NULL
)
5074 /* No address specified for this section, get one
5075 from the region specification. */
5076 if (os
->region
== NULL
5077 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5078 && os
->region
->name_list
.name
[0] == '*'
5079 && strcmp (os
->region
->name_list
.name
,
5080 DEFAULT_MEMORY_REGION
) == 0))
5082 os
->region
= lang_memory_default (os
->bfd_section
);
5085 /* If a loadable section is using the default memory
5086 region, and some non default memory regions were
5087 defined, issue an error message. */
5089 && !IGNORE_SECTION (os
->bfd_section
)
5090 && !bfd_link_relocatable (&link_info
)
5092 && strcmp (os
->region
->name_list
.name
,
5093 DEFAULT_MEMORY_REGION
) == 0
5094 && lang_memory_region_list
!= NULL
5095 && (strcmp (lang_memory_region_list
->name_list
.name
,
5096 DEFAULT_MEMORY_REGION
) != 0
5097 || lang_memory_region_list
->next
!= NULL
)
5098 && expld
.phase
!= lang_mark_phase_enum
)
5100 /* By default this is an error rather than just a
5101 warning because if we allocate the section to the
5102 default memory region we can end up creating an
5103 excessively large binary, or even seg faulting when
5104 attempting to perform a negative seek. See
5105 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5106 for an example of this. This behaviour can be
5107 overridden by the using the --no-check-sections
5109 if (command_line
.check_section_addresses
)
5110 einfo (_("%P%F: error: no memory region specified"
5111 " for loadable section `%s'\n"),
5112 bfd_get_section_name (link_info
.output_bfd
,
5115 einfo (_("%P: warning: no memory region specified"
5116 " for loadable section `%s'\n"),
5117 bfd_get_section_name (link_info
.output_bfd
,
5121 newdot
= os
->region
->current
;
5122 section_alignment
= os
->bfd_section
->alignment_power
;
5125 section_alignment
= os
->section_alignment
;
5127 /* Align to what the section needs. */
5128 if (section_alignment
> 0)
5130 bfd_vma savedot
= newdot
;
5131 newdot
= align_power (newdot
, section_alignment
);
5133 dotdelta
= newdot
- savedot
;
5135 && (config
.warn_section_align
5136 || os
->addr_tree
!= NULL
)
5137 && expld
.phase
!= lang_mark_phase_enum
)
5138 einfo (ngettext ("%P: warning: changing start of "
5139 "section %s by %lu byte\n",
5140 "%P: warning: changing start of "
5141 "section %s by %lu bytes\n",
5142 (unsigned long) dotdelta
),
5143 os
->name
, (unsigned long) dotdelta
);
5146 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
5148 os
->bfd_section
->output_offset
= 0;
5151 lang_size_sections_1 (&os
->children
.head
, os
,
5152 os
->fill
, newdot
, relax
, check_regions
);
5154 os
->processed_vma
= TRUE
;
5156 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5157 /* Except for some special linker created sections,
5158 no output section should change from zero size
5159 after strip_excluded_output_sections. A non-zero
5160 size on an ignored section indicates that some
5161 input section was not sized early enough. */
5162 ASSERT (os
->bfd_section
->size
== 0);
5165 dot
= os
->bfd_section
->vma
;
5167 /* Put the section within the requested block size, or
5168 align at the block boundary. */
5170 + TO_ADDR (os
->bfd_section
->size
)
5171 + os
->block_value
- 1)
5172 & - (bfd_vma
) os
->block_value
);
5174 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
5177 /* Set section lma. */
5180 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5184 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5185 os
->bfd_section
->lma
= lma
;
5187 else if (os
->lma_region
!= NULL
)
5189 bfd_vma lma
= os
->lma_region
->current
;
5191 if (os
->align_lma_with_input
)
5195 /* When LMA_REGION is the same as REGION, align the LMA
5196 as we did for the VMA, possibly including alignment
5197 from the bfd section. If a different region, then
5198 only align according to the value in the output
5200 if (os
->lma_region
!= os
->region
)
5201 section_alignment
= os
->section_alignment
;
5202 if (section_alignment
> 0)
5203 lma
= align_power (lma
, section_alignment
);
5205 os
->bfd_section
->lma
= lma
;
5207 else if (r
->last_os
!= NULL
5208 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5213 last
= r
->last_os
->output_section_statement
.bfd_section
;
5215 /* A backwards move of dot should be accompanied by
5216 an explicit assignment to the section LMA (ie.
5217 os->load_base set) because backwards moves can
5218 create overlapping LMAs. */
5220 && os
->bfd_section
->size
!= 0
5221 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5223 /* If dot moved backwards then leave lma equal to
5224 vma. This is the old default lma, which might
5225 just happen to work when the backwards move is
5226 sufficiently large. Nag if this changes anything,
5227 so people can fix their linker scripts. */
5229 if (last
->vma
!= last
->lma
)
5230 einfo (_("%P: warning: dot moved backwards "
5231 "before `%s'\n"), os
->name
);
5235 /* If this is an overlay, set the current lma to that
5236 at the end of the previous section. */
5237 if (os
->sectype
== overlay_section
)
5238 lma
= last
->lma
+ TO_ADDR (last
->size
);
5240 /* Otherwise, keep the same lma to vma relationship
5241 as the previous section. */
5243 lma
= dot
+ last
->lma
- last
->vma
;
5245 if (section_alignment
> 0)
5246 lma
= align_power (lma
, section_alignment
);
5247 os
->bfd_section
->lma
= lma
;
5250 os
->processed_lma
= TRUE
;
5252 /* Keep track of normal sections using the default
5253 lma region. We use this to set the lma for
5254 following sections. Overlays or other linker
5255 script assignment to lma might mean that the
5256 default lma == vma is incorrect.
5257 To avoid warnings about dot moving backwards when using
5258 -Ttext, don't start tracking sections until we find one
5259 of non-zero size or with lma set differently to vma.
5260 Do this tracking before we short-cut the loop so that we
5261 track changes for the case where the section size is zero,
5262 but the lma is set differently to the vma. This is
5263 important, if an orphan section is placed after an
5264 otherwise empty output section that has an explicit lma
5265 set, we want that lma reflected in the orphans lma. */
5266 if (!IGNORE_SECTION (os
->bfd_section
)
5267 && (os
->bfd_section
->size
!= 0
5268 || (r
->last_os
== NULL
5269 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5270 || (r
->last_os
!= NULL
5271 && dot
>= (r
->last_os
->output_section_statement
5272 .bfd_section
->vma
)))
5273 && os
->lma_region
== NULL
5274 && !bfd_link_relocatable (&link_info
))
5277 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5280 /* .tbss sections effectively have zero size. */
5281 if (!IS_TBSS (os
->bfd_section
)
5282 || bfd_link_relocatable (&link_info
))
5283 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5288 if (os
->update_dot_tree
!= 0)
5289 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5291 /* Update dot in the region ?
5292 We only do this if the section is going to be allocated,
5293 since unallocated sections do not contribute to the region's
5294 overall size in memory. */
5295 if (os
->region
!= NULL
5296 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5298 os
->region
->current
= dot
;
5301 /* Make sure the new address is within the region. */
5302 os_region_check (os
, os
->region
, os
->addr_tree
,
5303 os
->bfd_section
->vma
);
5305 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5306 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5307 || os
->align_lma_with_input
))
5309 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5312 os_region_check (os
, os
->lma_region
, NULL
,
5313 os
->bfd_section
->lma
);
5319 case lang_constructors_statement_enum
:
5320 dot
= lang_size_sections_1 (&constructor_list
.head
,
5321 output_section_statement
,
5322 fill
, dot
, relax
, check_regions
);
5325 case lang_data_statement_enum
:
5327 unsigned int size
= 0;
5329 s
->data_statement
.output_offset
=
5330 dot
- output_section_statement
->bfd_section
->vma
;
5331 s
->data_statement
.output_section
=
5332 output_section_statement
->bfd_section
;
5334 /* We might refer to provided symbols in the expression, and
5335 need to mark them as needed. */
5336 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5338 switch (s
->data_statement
.type
)
5356 if (size
< TO_SIZE ((unsigned) 1))
5357 size
= TO_SIZE ((unsigned) 1);
5358 dot
+= TO_ADDR (size
);
5359 output_section_statement
->bfd_section
->size
5360 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5365 case lang_reloc_statement_enum
:
5369 s
->reloc_statement
.output_offset
=
5370 dot
- output_section_statement
->bfd_section
->vma
;
5371 s
->reloc_statement
.output_section
=
5372 output_section_statement
->bfd_section
;
5373 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5374 dot
+= TO_ADDR (size
);
5375 output_section_statement
->bfd_section
->size
5376 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5380 case lang_wild_statement_enum
:
5381 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5382 output_section_statement
,
5383 fill
, dot
, relax
, check_regions
);
5386 case lang_object_symbols_statement_enum
:
5387 link_info
.create_object_symbols_section
=
5388 output_section_statement
->bfd_section
;
5391 case lang_output_statement_enum
:
5392 case lang_target_statement_enum
:
5395 case lang_input_section_enum
:
5399 i
= s
->input_section
.section
;
5404 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5405 einfo (_("%P%F: can't relax section: %E\n"));
5409 dot
= size_input_section (prev
, output_section_statement
,
5414 case lang_input_statement_enum
:
5417 case lang_fill_statement_enum
:
5418 s
->fill_statement
.output_section
=
5419 output_section_statement
->bfd_section
;
5421 fill
= s
->fill_statement
.fill
;
5424 case lang_assignment_statement_enum
:
5426 bfd_vma newdot
= dot
;
5427 etree_type
*tree
= s
->assignment_statement
.exp
;
5429 expld
.dataseg
.relro
= exp_seg_relro_none
;
5431 exp_fold_tree (tree
,
5432 output_section_statement
->bfd_section
,
5435 if (expld
.dataseg
.relro
== exp_seg_relro_start
)
5437 if (!expld
.dataseg
.relro_start_stat
)
5438 expld
.dataseg
.relro_start_stat
= s
;
5441 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5444 else if (expld
.dataseg
.relro
== exp_seg_relro_end
)
5446 if (!expld
.dataseg
.relro_end_stat
)
5447 expld
.dataseg
.relro_end_stat
= s
;
5450 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5453 expld
.dataseg
.relro
= exp_seg_relro_none
;
5455 /* This symbol may be relative to this section. */
5456 if ((tree
->type
.node_class
== etree_provided
5457 || tree
->type
.node_class
== etree_assign
)
5458 && (tree
->assign
.dst
[0] != '.'
5459 || tree
->assign
.dst
[1] != '\0'))
5460 output_section_statement
->update_dot
= 1;
5462 if (!output_section_statement
->ignored
)
5464 if (output_section_statement
== abs_output_section
)
5466 /* If we don't have an output section, then just adjust
5467 the default memory address. */
5468 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5469 FALSE
)->current
= newdot
;
5471 else if (newdot
!= dot
)
5473 /* Insert a pad after this statement. We can't
5474 put the pad before when relaxing, in case the
5475 assignment references dot. */
5476 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5477 output_section_statement
->bfd_section
, dot
);
5479 /* Don't neuter the pad below when relaxing. */
5482 /* If dot is advanced, this implies that the section
5483 should have space allocated to it, unless the
5484 user has explicitly stated that the section
5485 should not be allocated. */
5486 if (output_section_statement
->sectype
!= noalloc_section
5487 && (output_section_statement
->sectype
!= noload_section
5488 || (bfd_get_flavour (link_info
.output_bfd
)
5489 == bfd_target_elf_flavour
)))
5490 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5497 case lang_padding_statement_enum
:
5498 /* If this is the first time lang_size_sections is called,
5499 we won't have any padding statements. If this is the
5500 second or later passes when relaxing, we should allow
5501 padding to shrink. If padding is needed on this pass, it
5502 will be added back in. */
5503 s
->padding_statement
.size
= 0;
5505 /* Make sure output_offset is valid. If relaxation shrinks
5506 the section and this pad isn't needed, it's possible to
5507 have output_offset larger than the final size of the
5508 section. bfd_set_section_contents will complain even for
5509 a pad size of zero. */
5510 s
->padding_statement
.output_offset
5511 = dot
- output_section_statement
->bfd_section
->vma
;
5514 case lang_group_statement_enum
:
5515 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5516 output_section_statement
,
5517 fill
, dot
, relax
, check_regions
);
5520 case lang_insert_statement_enum
:
5523 /* We can only get here when relaxing is turned on. */
5524 case lang_address_statement_enum
:
5531 prev
= &s
->header
.next
;
5536 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5537 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5538 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5539 segments. We are allowed an opportunity to override this decision. */
5542 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
5543 bfd
*abfd ATTRIBUTE_UNUSED
,
5544 asection
*current_section
,
5545 asection
*previous_section
,
5546 bfd_boolean new_segment
)
5548 lang_output_section_statement_type
*cur
;
5549 lang_output_section_statement_type
*prev
;
5551 /* The checks below are only necessary when the BFD library has decided
5552 that the two sections ought to be placed into the same segment. */
5556 /* Paranoia checks. */
5557 if (current_section
== NULL
|| previous_section
== NULL
)
5560 /* If this flag is set, the target never wants code and non-code
5561 sections comingled in the same segment. */
5562 if (config
.separate_code
5563 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5566 /* Find the memory regions associated with the two sections.
5567 We call lang_output_section_find() here rather than scanning the list
5568 of output sections looking for a matching section pointer because if
5569 we have a large number of sections then a hash lookup is faster. */
5570 cur
= lang_output_section_find (current_section
->name
);
5571 prev
= lang_output_section_find (previous_section
->name
);
5573 /* More paranoia. */
5574 if (cur
== NULL
|| prev
== NULL
)
5577 /* If the regions are different then force the sections to live in
5578 different segments. See the email thread starting at the following
5579 URL for the reasons why this is necessary:
5580 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5581 return cur
->region
!= prev
->region
;
5585 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5587 lang_statement_iteration
++;
5588 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5589 0, 0, relax
, check_regions
);
5593 lang_size_segment (seg_align_type
*seg
)
5595 /* If XXX_SEGMENT_ALIGN XXX_SEGMENT_END pair was seen, check whether
5596 a page could be saved in the data segment. */
5597 bfd_vma first
, last
;
5599 first
= -seg
->base
& (seg
->pagesize
- 1);
5600 last
= seg
->end
& (seg
->pagesize
- 1);
5602 && ((seg
->base
& ~(seg
->pagesize
- 1))
5603 != (seg
->end
& ~(seg
->pagesize
- 1)))
5604 && first
+ last
<= seg
->pagesize
)
5606 seg
->phase
= exp_seg_adjust
;
5610 seg
->phase
= exp_seg_done
;
5615 lang_size_relro_segment_1 (seg_align_type
*seg
)
5617 bfd_vma relro_end
, desired_end
;
5620 /* Compute the expected PT_GNU_RELRO/PT_LOAD segment end. */
5621 relro_end
= ((seg
->relro_end
+ seg
->pagesize
- 1)
5622 & ~(seg
->pagesize
- 1));
5624 /* Adjust by the offset arg of XXX_SEGMENT_RELRO_END. */
5625 desired_end
= relro_end
- seg
->relro_offset
;
5627 /* For sections in the relro segment.. */
5628 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
5629 if ((sec
->flags
& SEC_ALLOC
) != 0
5630 && sec
->vma
>= seg
->base
5631 && sec
->vma
< seg
->relro_end
- seg
->relro_offset
)
5633 /* Where do we want to put this section so that it ends as
5635 bfd_vma start
, end
, bump
;
5637 end
= start
= sec
->vma
;
5639 end
+= TO_ADDR (sec
->size
);
5640 bump
= desired_end
- end
;
5641 /* We'd like to increase START by BUMP, but we must heed
5642 alignment so the increase might be less than optimum. */
5644 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
5645 /* This is now the desired end for the previous section. */
5646 desired_end
= start
;
5649 seg
->phase
= exp_seg_relro_adjust
;
5650 ASSERT (desired_end
>= seg
->base
);
5651 seg
->base
= desired_end
;
5656 lang_size_relro_segment (bfd_boolean
*relax
, bfd_boolean check_regions
)
5658 bfd_boolean do_reset
= FALSE
;
5659 bfd_boolean do_data_relro
;
5660 bfd_vma data_initial_base
, data_relro_end
;
5662 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5664 do_data_relro
= TRUE
;
5665 data_initial_base
= expld
.dataseg
.base
;
5666 data_relro_end
= lang_size_relro_segment_1 (&expld
.dataseg
);
5670 do_data_relro
= FALSE
;
5671 data_initial_base
= data_relro_end
= 0;
5676 lang_reset_memory_regions ();
5677 one_lang_size_sections_pass (relax
, check_regions
);
5679 /* Assignments to dot, or to output section address in a user
5680 script have increased padding over the original. Revert. */
5681 if (do_data_relro
&& expld
.dataseg
.relro_end
> data_relro_end
)
5683 expld
.dataseg
.base
= data_initial_base
;;
5688 if (!do_data_relro
&& lang_size_segment (&expld
.dataseg
))
5695 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5697 expld
.phase
= lang_allocating_phase_enum
;
5698 expld
.dataseg
.phase
= exp_seg_none
;
5700 one_lang_size_sections_pass (relax
, check_regions
);
5702 if (expld
.dataseg
.phase
!= exp_seg_end_seen
)
5703 expld
.dataseg
.phase
= exp_seg_done
;
5705 if (expld
.dataseg
.phase
== exp_seg_end_seen
)
5707 bfd_boolean do_reset
5708 = lang_size_relro_segment (relax
, check_regions
);
5712 lang_reset_memory_regions ();
5713 one_lang_size_sections_pass (relax
, check_regions
);
5716 if (link_info
.relro
&& expld
.dataseg
.relro_end
)
5718 link_info
.relro_start
= expld
.dataseg
.base
;
5719 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5724 static lang_output_section_statement_type
*current_section
;
5725 static lang_assignment_statement_type
*current_assign
;
5726 static bfd_boolean prefer_next_section
;
5728 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5731 lang_do_assignments_1 (lang_statement_union_type
*s
,
5732 lang_output_section_statement_type
*current_os
,
5735 bfd_boolean
*found_end
)
5737 for (; s
!= NULL
; s
= s
->header
.next
)
5739 switch (s
->header
.type
)
5741 case lang_constructors_statement_enum
:
5742 dot
= lang_do_assignments_1 (constructor_list
.head
,
5743 current_os
, fill
, dot
, found_end
);
5746 case lang_output_section_statement_enum
:
5748 lang_output_section_statement_type
*os
;
5751 os
= &(s
->output_section_statement
);
5752 os
->after_end
= *found_end
;
5753 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5755 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5757 current_section
= os
;
5758 prefer_next_section
= FALSE
;
5760 dot
= os
->bfd_section
->vma
;
5762 newdot
= lang_do_assignments_1 (os
->children
.head
,
5763 os
, os
->fill
, dot
, found_end
);
5766 if (os
->bfd_section
!= NULL
)
5768 /* .tbss sections effectively have zero size. */
5769 if (!IS_TBSS (os
->bfd_section
)
5770 || bfd_link_relocatable (&link_info
))
5771 dot
+= TO_ADDR (os
->bfd_section
->size
);
5773 if (os
->update_dot_tree
!= NULL
)
5774 exp_fold_tree (os
->update_dot_tree
,
5775 bfd_abs_section_ptr
, &dot
);
5783 case lang_wild_statement_enum
:
5785 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5786 current_os
, fill
, dot
, found_end
);
5789 case lang_object_symbols_statement_enum
:
5790 case lang_output_statement_enum
:
5791 case lang_target_statement_enum
:
5794 case lang_data_statement_enum
:
5795 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5796 if (expld
.result
.valid_p
)
5798 s
->data_statement
.value
= expld
.result
.value
;
5799 if (expld
.result
.section
!= NULL
)
5800 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5802 else if (expld
.phase
== lang_final_phase_enum
)
5803 einfo (_("%F%P: invalid data statement\n"));
5806 switch (s
->data_statement
.type
)
5824 if (size
< TO_SIZE ((unsigned) 1))
5825 size
= TO_SIZE ((unsigned) 1);
5826 dot
+= TO_ADDR (size
);
5830 case lang_reloc_statement_enum
:
5831 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5832 bfd_abs_section_ptr
, &dot
);
5833 if (expld
.result
.valid_p
)
5834 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5835 else if (expld
.phase
== lang_final_phase_enum
)
5836 einfo (_("%F%P: invalid reloc statement\n"));
5837 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5840 case lang_input_section_enum
:
5842 asection
*in
= s
->input_section
.section
;
5844 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5845 dot
+= TO_ADDR (in
->size
);
5849 case lang_input_statement_enum
:
5852 case lang_fill_statement_enum
:
5853 fill
= s
->fill_statement
.fill
;
5856 case lang_assignment_statement_enum
:
5857 current_assign
= &s
->assignment_statement
;
5858 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5860 const char *p
= current_assign
->exp
->assign
.dst
;
5862 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5863 prefer_next_section
= TRUE
;
5867 if (strcmp (p
, "end") == 0)
5870 exp_fold_tree (s
->assignment_statement
.exp
,
5871 (current_os
->bfd_section
!= NULL
5872 ? current_os
->bfd_section
: bfd_und_section_ptr
),
5876 case lang_padding_statement_enum
:
5877 dot
+= TO_ADDR (s
->padding_statement
.size
);
5880 case lang_group_statement_enum
:
5881 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5882 current_os
, fill
, dot
, found_end
);
5885 case lang_insert_statement_enum
:
5888 case lang_address_statement_enum
:
5900 lang_do_assignments (lang_phase_type phase
)
5902 bfd_boolean found_end
= FALSE
;
5904 current_section
= NULL
;
5905 prefer_next_section
= FALSE
;
5906 expld
.phase
= phase
;
5907 lang_statement_iteration
++;
5908 lang_do_assignments_1 (statement_list
.head
,
5909 abs_output_section
, NULL
, 0, &found_end
);
5912 /* For an assignment statement outside of an output section statement,
5913 choose the best of neighbouring output sections to use for values
5917 section_for_dot (void)
5921 /* Assignments belong to the previous output section, unless there
5922 has been an assignment to "dot", in which case following
5923 assignments belong to the next output section. (The assumption
5924 is that an assignment to "dot" is setting up the address for the
5925 next output section.) Except that past the assignment to "_end"
5926 we always associate with the previous section. This exception is
5927 for targets like SH that define an alloc .stack or other
5928 weirdness after non-alloc sections. */
5929 if (current_section
== NULL
|| prefer_next_section
)
5931 lang_statement_union_type
*stmt
;
5932 lang_output_section_statement_type
*os
;
5934 for (stmt
= (lang_statement_union_type
*) current_assign
;
5936 stmt
= stmt
->header
.next
)
5937 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5940 os
= &stmt
->output_section_statement
;
5943 && (os
->bfd_section
== NULL
5944 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5945 || bfd_section_removed_from_list (link_info
.output_bfd
,
5949 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5952 s
= os
->bfd_section
;
5954 s
= link_info
.output_bfd
->section_last
;
5956 && ((s
->flags
& SEC_ALLOC
) == 0
5957 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5962 return bfd_abs_section_ptr
;
5966 s
= current_section
->bfd_section
;
5968 /* The section may have been stripped. */
5970 && ((s
->flags
& SEC_EXCLUDE
) != 0
5971 || (s
->flags
& SEC_ALLOC
) == 0
5972 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5973 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5976 s
= link_info
.output_bfd
->sections
;
5978 && ((s
->flags
& SEC_ALLOC
) == 0
5979 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5984 return bfd_abs_section_ptr
;
5987 /* Array of __start/__stop/.startof./.sizeof/ symbols. */
5989 static struct bfd_link_hash_entry
**start_stop_syms
;
5990 static size_t start_stop_count
= 0;
5991 static size_t start_stop_alloc
= 0;
5993 /* Give start/stop SYMBOL for SEC a preliminary definition, and add it
5994 to start_stop_syms. */
5997 lang_define_start_stop (const char *symbol
, asection
*sec
)
5999 struct bfd_link_hash_entry
*h
;
6001 h
= bfd_define_start_stop (link_info
.output_bfd
, &link_info
, symbol
, sec
);
6004 if (start_stop_count
== start_stop_alloc
)
6006 start_stop_alloc
= 2 * start_stop_alloc
+ 10;
6008 = xrealloc (start_stop_syms
,
6009 start_stop_alloc
* sizeof (*start_stop_syms
));
6011 start_stop_syms
[start_stop_count
++] = h
;
6015 /* Check for input sections whose names match references to
6016 __start_SECNAME or __stop_SECNAME symbols. Give the symbols
6017 preliminary definitions. */
6020 lang_init_start_stop (void)
6024 char leading_char
= bfd_get_symbol_leading_char (link_info
.output_bfd
);
6026 for (abfd
= link_info
.input_bfds
; abfd
!= NULL
; abfd
= abfd
->link
.next
)
6027 for (s
= abfd
->sections
; s
!= NULL
; s
= s
->next
)
6030 const char *secname
= s
->name
;
6032 for (ps
= secname
; *ps
!= '\0'; ps
++)
6033 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
6037 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6039 symbol
[0] = leading_char
;
6040 sprintf (symbol
+ (leading_char
!= 0), "__start_%s", secname
);
6041 lang_define_start_stop (symbol
, s
);
6043 symbol
[1] = leading_char
;
6044 memcpy (symbol
+ 1 + (leading_char
!= 0), "__stop", 6);
6045 lang_define_start_stop (symbol
+ 1, s
);
6052 /* Iterate over start_stop_syms. */
6055 foreach_start_stop (void (*func
) (struct bfd_link_hash_entry
*))
6059 for (i
= 0; i
< start_stop_count
; ++i
)
6060 func (start_stop_syms
[i
]);
6063 /* __start and __stop symbols are only supposed to be defined by the
6064 linker for orphan sections, but we now extend that to sections that
6065 map to an output section of the same name. The symbols were
6066 defined early for --gc-sections, before we mapped input to output
6067 sections, so undo those that don't satisfy this rule. */
6070 undef_start_stop (struct bfd_link_hash_entry
*h
)
6072 if (h
->ldscript_def
)
6075 if (h
->u
.def
.section
->output_section
== NULL
6076 || h
->u
.def
.section
->output_section
->owner
!= link_info
.output_bfd
6077 || strcmp (h
->u
.def
.section
->name
,
6078 h
->u
.def
.section
->output_section
->name
) != 0)
6080 h
->type
= bfd_link_hash_undefined
;
6081 h
->u
.undef
.abfd
= NULL
;
6086 lang_undef_start_stop (void)
6088 foreach_start_stop (undef_start_stop
);
6091 /* Check for output sections whose names match references to
6092 .startof.SECNAME or .sizeof.SECNAME symbols. Give the symbols
6093 preliminary definitions. */
6096 lang_init_startof_sizeof (void)
6100 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6102 const char *secname
= s
->name
;
6103 char *symbol
= (char *) xmalloc (10 + strlen (secname
));
6105 sprintf (symbol
, ".startof.%s", secname
);
6106 lang_define_start_stop (symbol
, s
);
6108 memcpy (symbol
+ 1, ".size", 5);
6109 lang_define_start_stop (symbol
+ 1, s
);
6114 /* Set .startof., .sizeof., __start and __stop symbols final values. */
6117 set_start_stop (struct bfd_link_hash_entry
*h
)
6120 || h
->type
!= bfd_link_hash_defined
)
6123 if (h
->root
.string
[0] == '.')
6125 /* .startof. or .sizeof. symbol.
6126 .startof. already has final value. */
6127 if (h
->root
.string
[2] == 'i')
6130 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6131 h
->u
.def
.section
= bfd_abs_section_ptr
;
6136 /* __start or __stop symbol. */
6137 int has_lead
= bfd_get_symbol_leading_char (link_info
.output_bfd
) != 0;
6139 h
->u
.def
.section
= h
->u
.def
.section
->output_section
;
6140 if (h
->root
.string
[4 + has_lead
] == 'o')
6143 h
->u
.def
.value
= TO_ADDR (h
->u
.def
.section
->size
);
6149 lang_finalize_start_stop (void)
6151 foreach_start_stop (set_start_stop
);
6157 struct bfd_link_hash_entry
*h
;
6160 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
6161 || bfd_link_dll (&link_info
))
6162 warn
= entry_from_cmdline
;
6166 /* Force the user to specify a root when generating a relocatable with
6168 if (link_info
.gc_sections
&& bfd_link_relocatable (&link_info
)
6169 && !(entry_from_cmdline
|| undef_from_cmdline
))
6170 einfo (_("%P%F: gc-sections requires either an entry or "
6171 "an undefined symbol\n"));
6173 if (entry_symbol
.name
== NULL
)
6175 /* No entry has been specified. Look for the default entry, but
6176 don't warn if we don't find it. */
6177 entry_symbol
.name
= entry_symbol_default
;
6181 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
6182 FALSE
, FALSE
, TRUE
);
6184 && (h
->type
== bfd_link_hash_defined
6185 || h
->type
== bfd_link_hash_defweak
)
6186 && h
->u
.def
.section
->output_section
!= NULL
)
6190 val
= (h
->u
.def
.value
6191 + bfd_get_section_vma (link_info
.output_bfd
,
6192 h
->u
.def
.section
->output_section
)
6193 + h
->u
.def
.section
->output_offset
);
6194 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6195 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
6202 /* We couldn't find the entry symbol. Try parsing it as a
6204 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
6207 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6208 einfo (_("%P%F: can't set start address\n"));
6214 /* Can't find the entry symbol, and it's not a number. Use
6215 the first address in the text section. */
6216 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
6220 einfo (_("%P: warning: cannot find entry symbol %s;"
6221 " defaulting to %V\n"),
6223 bfd_get_section_vma (link_info
.output_bfd
, ts
));
6224 if (!(bfd_set_start_address
6225 (link_info
.output_bfd
,
6226 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
6227 einfo (_("%P%F: can't set start address\n"));
6232 einfo (_("%P: warning: cannot find entry symbol %s;"
6233 " not setting start address\n"),
6240 /* This is a small function used when we want to ignore errors from
6244 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
6245 va_list ap ATTRIBUTE_UNUSED
)
6247 /* Don't do anything. */
6250 /* Check that the architecture of all the input files is compatible
6251 with the output file. Also call the backend to let it do any
6252 other checking that is needed. */
6257 lang_statement_union_type
*file
;
6259 const bfd_arch_info_type
*compatible
;
6261 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
6263 #ifdef ENABLE_PLUGINS
6264 /* Don't check format of files claimed by plugin. */
6265 if (file
->input_statement
.flags
.claimed
)
6267 #endif /* ENABLE_PLUGINS */
6268 input_bfd
= file
->input_statement
.the_bfd
;
6270 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
6271 command_line
.accept_unknown_input_arch
);
6273 /* In general it is not possible to perform a relocatable
6274 link between differing object formats when the input
6275 file has relocations, because the relocations in the
6276 input format may not have equivalent representations in
6277 the output format (and besides BFD does not translate
6278 relocs for other link purposes than a final link). */
6279 if ((bfd_link_relocatable (&link_info
)
6280 || link_info
.emitrelocations
)
6281 && (compatible
== NULL
6282 || (bfd_get_flavour (input_bfd
)
6283 != bfd_get_flavour (link_info
.output_bfd
)))
6284 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
6286 einfo (_("%P%F: Relocatable linking with relocations from"
6287 " format %s (%B) to format %s (%B) is not supported\n"),
6288 bfd_get_target (input_bfd
), input_bfd
,
6289 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
6290 /* einfo with %F exits. */
6293 if (compatible
== NULL
)
6295 if (command_line
.warn_mismatch
)
6296 einfo (_("%P%X: %s architecture of input file `%B'"
6297 " is incompatible with %s output\n"),
6298 bfd_printable_name (input_bfd
), input_bfd
,
6299 bfd_printable_name (link_info
.output_bfd
));
6301 else if (bfd_count_sections (input_bfd
))
6303 /* If the input bfd has no contents, it shouldn't set the
6304 private data of the output bfd. */
6306 bfd_error_handler_type pfn
= NULL
;
6308 /* If we aren't supposed to warn about mismatched input
6309 files, temporarily set the BFD error handler to a
6310 function which will do nothing. We still want to call
6311 bfd_merge_private_bfd_data, since it may set up
6312 information which is needed in the output file. */
6313 if (!command_line
.warn_mismatch
)
6314 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
6315 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
6317 if (command_line
.warn_mismatch
)
6318 einfo (_("%P%X: failed to merge target specific data"
6319 " of file %B\n"), input_bfd
);
6321 if (!command_line
.warn_mismatch
)
6322 bfd_set_error_handler (pfn
);
6327 /* Look through all the global common symbols and attach them to the
6328 correct section. The -sort-common command line switch may be used
6329 to roughly sort the entries by alignment. */
6334 if (link_info
.inhibit_common_definition
)
6336 if (bfd_link_relocatable (&link_info
)
6337 && !command_line
.force_common_definition
)
6340 if (!config
.sort_common
)
6341 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
6346 if (config
.sort_common
== sort_descending
)
6348 for (power
= 4; power
> 0; power
--)
6349 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6352 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6356 for (power
= 0; power
<= 4; power
++)
6357 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6359 power
= (unsigned int) -1;
6360 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6365 /* Place one common symbol in the correct section. */
6368 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
6370 unsigned int power_of_two
;
6374 if (h
->type
!= bfd_link_hash_common
)
6378 power_of_two
= h
->u
.c
.p
->alignment_power
;
6380 if (config
.sort_common
== sort_descending
6381 && power_of_two
< *(unsigned int *) info
)
6383 else if (config
.sort_common
== sort_ascending
6384 && power_of_two
> *(unsigned int *) info
)
6387 section
= h
->u
.c
.p
->section
;
6388 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6389 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6392 if (config
.map_file
!= NULL
)
6394 static bfd_boolean header_printed
;
6399 if (!header_printed
)
6401 minfo (_("\nAllocating common symbols\n"));
6402 minfo (_("Common symbol size file\n\n"));
6403 header_printed
= TRUE
;
6406 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6407 DMGL_ANSI
| DMGL_PARAMS
);
6410 minfo ("%s", h
->root
.string
);
6411 len
= strlen (h
->root
.string
);
6416 len
= strlen (name
);
6432 if (size
<= 0xffffffff)
6433 sprintf (buf
, "%lx", (unsigned long) size
);
6435 sprintf_vma (buf
, size
);
6445 minfo ("%B\n", section
->owner
);
6451 /* Handle a single orphan section S, placing the orphan into an appropriate
6452 output section. The effects of the --orphan-handling command line
6453 option are handled here. */
6456 ldlang_place_orphan (asection
*s
)
6458 if (config
.orphan_handling
== orphan_handling_discard
)
6460 lang_output_section_statement_type
*os
;
6461 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0,
6463 if (os
->addr_tree
== NULL
6464 && (bfd_link_relocatable (&link_info
)
6465 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6466 os
->addr_tree
= exp_intop (0);
6467 lang_add_section (&os
->children
, s
, NULL
, os
);
6471 lang_output_section_statement_type
*os
;
6472 const char *name
= s
->name
;
6475 if (config
.orphan_handling
== orphan_handling_error
)
6476 einfo (_("%X%P: error: unplaced orphan section `%A' from `%B'.\n"),
6479 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
6480 constraint
= SPECIAL
;
6482 os
= ldemul_place_orphan (s
, name
, constraint
);
6485 os
= lang_output_section_statement_lookup (name
, constraint
, TRUE
);
6486 if (os
->addr_tree
== NULL
6487 && (bfd_link_relocatable (&link_info
)
6488 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6489 os
->addr_tree
= exp_intop (0);
6490 lang_add_section (&os
->children
, s
, NULL
, os
);
6493 if (config
.orphan_handling
== orphan_handling_warn
)
6494 einfo (_("%P: warning: orphan section `%A' from `%B' being "
6495 "placed in section `%s'.\n"),
6496 s
, s
->owner
, os
->name
);
6500 /* Run through the input files and ensure that every input section has
6501 somewhere to go. If one is found without a destination then create
6502 an input request and place it into the statement tree. */
6505 lang_place_orphans (void)
6507 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6511 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6513 if (s
->output_section
== NULL
)
6515 /* This section of the file is not attached, root
6516 around for a sensible place for it to go. */
6518 if (file
->flags
.just_syms
)
6519 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6520 else if (lang_discard_section_p (s
))
6521 s
->output_section
= bfd_abs_section_ptr
;
6522 else if (strcmp (s
->name
, "COMMON") == 0)
6524 /* This is a lonely common section which must have
6525 come from an archive. We attach to the section
6526 with the wildcard. */
6527 if (!bfd_link_relocatable (&link_info
)
6528 || command_line
.force_common_definition
)
6530 if (default_common_section
== NULL
)
6531 default_common_section
6532 = lang_output_section_statement_lookup (".bss", 0,
6534 lang_add_section (&default_common_section
->children
, s
,
6535 NULL
, default_common_section
);
6539 ldlang_place_orphan (s
);
6546 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6548 flagword
*ptr_flags
;
6550 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6556 /* PR 17900: An exclamation mark in the attributes reverses
6557 the sense of any of the attributes that follow. */
6560 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6564 *ptr_flags
|= SEC_ALLOC
;
6568 *ptr_flags
|= SEC_READONLY
;
6572 *ptr_flags
|= SEC_DATA
;
6576 *ptr_flags
|= SEC_CODE
;
6581 *ptr_flags
|= SEC_LOAD
;
6585 einfo (_("%P%F: invalid character %c (%d) in flags\n"),
6593 /* Call a function on each input file. This function will be called
6594 on an archive, but not on the elements. */
6597 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6599 lang_input_statement_type
*f
;
6601 for (f
= &input_file_chain
.head
->input_statement
;
6603 f
= &f
->next_real_file
->input_statement
)
6607 /* Call a function on each file. The function will be called on all
6608 the elements of an archive which are included in the link, but will
6609 not be called on the archive file itself. */
6612 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6614 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6621 ldlang_add_file (lang_input_statement_type
*entry
)
6623 lang_statement_append (&file_chain
,
6624 (lang_statement_union_type
*) entry
,
6627 /* The BFD linker needs to have a list of all input BFDs involved in
6629 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
6630 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6632 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6633 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
6634 entry
->the_bfd
->usrdata
= entry
;
6635 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6637 /* Look through the sections and check for any which should not be
6638 included in the link. We need to do this now, so that we can
6639 notice when the backend linker tries to report multiple
6640 definition errors for symbols which are in sections we aren't
6641 going to link. FIXME: It might be better to entirely ignore
6642 symbols which are defined in sections which are going to be
6643 discarded. This would require modifying the backend linker for
6644 each backend which might set the SEC_LINK_ONCE flag. If we do
6645 this, we should probably handle SEC_EXCLUDE in the same way. */
6647 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6651 lang_add_output (const char *name
, int from_script
)
6653 /* Make -o on command line override OUTPUT in script. */
6654 if (!had_output_filename
|| !from_script
)
6656 output_filename
= name
;
6657 had_output_filename
= TRUE
;
6670 for (l
= 0; l
< 32; l
++)
6672 if (i
>= (unsigned int) x
)
6680 lang_output_section_statement_type
*
6681 lang_enter_output_section_statement (const char *output_section_statement_name
,
6682 etree_type
*address_exp
,
6683 enum section_type sectype
,
6685 etree_type
*subalign
,
6688 int align_with_input
)
6690 lang_output_section_statement_type
*os
;
6692 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6694 current_section
= os
;
6696 if (os
->addr_tree
== NULL
)
6698 os
->addr_tree
= address_exp
;
6700 os
->sectype
= sectype
;
6701 if (sectype
!= noload_section
)
6702 os
->flags
= SEC_NO_FLAGS
;
6704 os
->flags
= SEC_NEVER_LOAD
;
6705 os
->block_value
= 1;
6707 /* Make next things chain into subchain of this. */
6708 push_stat_ptr (&os
->children
);
6710 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6711 if (os
->align_lma_with_input
&& align
!= NULL
)
6712 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"),
6715 os
->subsection_alignment
=
6716 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6717 os
->section_alignment
=
6718 topower (exp_get_value_int (align
, -1, "section alignment"));
6720 os
->load_base
= ebase
;
6727 lang_output_statement_type
*new_stmt
;
6729 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6730 new_stmt
->name
= output_filename
;
6733 /* Reset the current counters in the regions. */
6736 lang_reset_memory_regions (void)
6738 lang_memory_region_type
*p
= lang_memory_region_list
;
6740 lang_output_section_statement_type
*os
;
6742 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6744 p
->current
= p
->origin
;
6748 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6752 os
->processed_vma
= FALSE
;
6753 os
->processed_lma
= FALSE
;
6756 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6758 /* Save the last size for possible use by bfd_relax_section. */
6759 o
->rawsize
= o
->size
;
6764 /* Worker for lang_gc_sections_1. */
6767 gc_section_callback (lang_wild_statement_type
*ptr
,
6768 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6770 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6771 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6772 void *data ATTRIBUTE_UNUSED
)
6774 /* If the wild pattern was marked KEEP, the member sections
6775 should be as well. */
6776 if (ptr
->keep_sections
)
6777 section
->flags
|= SEC_KEEP
;
6780 /* Iterate over sections marking them against GC. */
6783 lang_gc_sections_1 (lang_statement_union_type
*s
)
6785 for (; s
!= NULL
; s
= s
->header
.next
)
6787 switch (s
->header
.type
)
6789 case lang_wild_statement_enum
:
6790 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6792 case lang_constructors_statement_enum
:
6793 lang_gc_sections_1 (constructor_list
.head
);
6795 case lang_output_section_statement_enum
:
6796 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6798 case lang_group_statement_enum
:
6799 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6808 lang_gc_sections (void)
6810 /* Keep all sections so marked in the link script. */
6811 lang_gc_sections_1 (statement_list
.head
);
6813 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6814 the special case of debug info. (See bfd/stabs.c)
6815 Twiddle the flag here, to simplify later linker code. */
6816 if (bfd_link_relocatable (&link_info
))
6818 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6821 #ifdef ENABLE_PLUGINS
6822 if (f
->flags
.claimed
)
6825 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6826 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6827 sec
->flags
&= ~SEC_EXCLUDE
;
6831 if (link_info
.gc_sections
)
6832 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6835 /* Worker for lang_find_relro_sections_1. */
6838 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6839 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6841 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6842 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6845 /* Discarded, excluded and ignored sections effectively have zero
6847 if (section
->output_section
!= NULL
6848 && section
->output_section
->owner
== link_info
.output_bfd
6849 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6850 && !IGNORE_SECTION (section
)
6851 && section
->size
!= 0)
6853 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6854 *has_relro_section
= TRUE
;
6858 /* Iterate over sections for relro sections. */
6861 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6862 bfd_boolean
*has_relro_section
)
6864 if (*has_relro_section
)
6867 for (; s
!= NULL
; s
= s
->header
.next
)
6869 if (s
== expld
.dataseg
.relro_end_stat
)
6872 switch (s
->header
.type
)
6874 case lang_wild_statement_enum
:
6875 walk_wild (&s
->wild_statement
,
6876 find_relro_section_callback
,
6879 case lang_constructors_statement_enum
:
6880 lang_find_relro_sections_1 (constructor_list
.head
,
6883 case lang_output_section_statement_enum
:
6884 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6887 case lang_group_statement_enum
:
6888 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6898 lang_find_relro_sections (void)
6900 bfd_boolean has_relro_section
= FALSE
;
6902 /* Check all sections in the link script. */
6904 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6905 &has_relro_section
);
6907 if (!has_relro_section
)
6908 link_info
.relro
= FALSE
;
6911 /* Relax all sections until bfd_relax_section gives up. */
6914 lang_relax_sections (bfd_boolean need_layout
)
6916 if (RELAXATION_ENABLED
)
6918 /* We may need more than one relaxation pass. */
6919 int i
= link_info
.relax_pass
;
6921 /* The backend can use it to determine the current pass. */
6922 link_info
.relax_pass
= 0;
6926 /* Keep relaxing until bfd_relax_section gives up. */
6927 bfd_boolean relax_again
;
6929 link_info
.relax_trip
= -1;
6932 link_info
.relax_trip
++;
6934 /* Note: pe-dll.c does something like this also. If you find
6935 you need to change this code, you probably need to change
6936 pe-dll.c also. DJ */
6938 /* Do all the assignments with our current guesses as to
6940 lang_do_assignments (lang_assigning_phase_enum
);
6942 /* We must do this after lang_do_assignments, because it uses
6944 lang_reset_memory_regions ();
6946 /* Perform another relax pass - this time we know where the
6947 globals are, so can make a better guess. */
6948 relax_again
= FALSE
;
6949 lang_size_sections (&relax_again
, FALSE
);
6951 while (relax_again
);
6953 link_info
.relax_pass
++;
6960 /* Final extra sizing to report errors. */
6961 lang_do_assignments (lang_assigning_phase_enum
);
6962 lang_reset_memory_regions ();
6963 lang_size_sections (NULL
, TRUE
);
6967 #ifdef ENABLE_PLUGINS
6968 /* Find the insert point for the plugin's replacement files. We
6969 place them after the first claimed real object file, or if the
6970 first claimed object is an archive member, after the last real
6971 object file immediately preceding the archive. In the event
6972 no objects have been claimed at all, we return the first dummy
6973 object file on the list as the insert point; that works, but
6974 the callee must be careful when relinking the file_chain as it
6975 is not actually on that chain, only the statement_list and the
6976 input_file list; in that case, the replacement files must be
6977 inserted at the head of the file_chain. */
6979 static lang_input_statement_type
*
6980 find_replacements_insert_point (void)
6982 lang_input_statement_type
*claim1
, *lastobject
;
6983 lastobject
= &input_file_chain
.head
->input_statement
;
6984 for (claim1
= &file_chain
.head
->input_statement
;
6986 claim1
= &claim1
->next
->input_statement
)
6988 if (claim1
->flags
.claimed
)
6989 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6990 /* Update lastobject if this is a real object file. */
6991 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
6992 lastobject
= claim1
;
6994 /* No files were claimed by the plugin. Choose the last object
6995 file found on the list (maybe the first, dummy entry) as the
7000 /* Find where to insert ADD, an archive element or shared library
7001 added during a rescan. */
7003 static lang_statement_union_type
**
7004 find_rescan_insertion (lang_input_statement_type
*add
)
7006 bfd
*add_bfd
= add
->the_bfd
;
7007 lang_input_statement_type
*f
;
7008 lang_input_statement_type
*last_loaded
= NULL
;
7009 lang_input_statement_type
*before
= NULL
;
7010 lang_statement_union_type
**iter
= NULL
;
7012 if (add_bfd
->my_archive
!= NULL
)
7013 add_bfd
= add_bfd
->my_archive
;
7015 /* First look through the input file chain, to find an object file
7016 before the one we've rescanned. Normal object files always
7017 appear on both the input file chain and the file chain, so this
7018 lets us get quickly to somewhere near the correct place on the
7019 file chain if it is full of archive elements. Archives don't
7020 appear on the file chain, but if an element has been extracted
7021 then their input_statement->next points at it. */
7022 for (f
= &input_file_chain
.head
->input_statement
;
7024 f
= &f
->next_real_file
->input_statement
)
7026 if (f
->the_bfd
== add_bfd
)
7028 before
= last_loaded
;
7029 if (f
->next
!= NULL
)
7030 return &f
->next
->input_statement
.next
;
7032 if (f
->the_bfd
!= NULL
&& f
->next
!= NULL
)
7036 for (iter
= before
? &before
->next
: &file_chain
.head
->input_statement
.next
;
7038 iter
= &(*iter
)->input_statement
.next
)
7039 if ((*iter
)->input_statement
.the_bfd
->my_archive
== NULL
)
7045 /* Insert SRCLIST into DESTLIST after given element by chaining
7046 on FIELD as the next-pointer. (Counterintuitively does not need
7047 a pointer to the actual after-node itself, just its chain field.) */
7050 lang_list_insert_after (lang_statement_list_type
*destlist
,
7051 lang_statement_list_type
*srclist
,
7052 lang_statement_union_type
**field
)
7054 *(srclist
->tail
) = *field
;
7055 *field
= srclist
->head
;
7056 if (destlist
->tail
== field
)
7057 destlist
->tail
= srclist
->tail
;
7060 /* Detach new nodes added to DESTLIST since the time ORIGLIST
7061 was taken as a copy of it and leave them in ORIGLIST. */
7064 lang_list_remove_tail (lang_statement_list_type
*destlist
,
7065 lang_statement_list_type
*origlist
)
7067 union lang_statement_union
**savetail
;
7068 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
7069 ASSERT (origlist
->head
== destlist
->head
);
7070 savetail
= origlist
->tail
;
7071 origlist
->head
= *(savetail
);
7072 origlist
->tail
= destlist
->tail
;
7073 destlist
->tail
= savetail
;
7076 #endif /* ENABLE_PLUGINS */
7078 /* Add NAME to the list of garbage collection entry points. */
7081 lang_add_gc_name (const char *name
)
7083 struct bfd_sym_chain
*sym
;
7088 sym
= (struct bfd_sym_chain
*) stat_alloc (sizeof (*sym
));
7090 sym
->next
= link_info
.gc_sym_list
;
7092 link_info
.gc_sym_list
= sym
;
7095 /* Check relocations. */
7098 lang_check_relocs (void)
7100 if (link_info
.check_relocs_after_open_input
)
7104 for (abfd
= link_info
.input_bfds
;
7105 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
7106 if (!bfd_link_check_relocs (abfd
, &link_info
))
7108 /* No object output, fail return. */
7109 config
.make_executable
= FALSE
;
7110 /* Note: we do not abort the loop, but rather
7111 continue the scan in case there are other
7112 bad relocations to report. */
7117 /* Look through all output sections looking for places where we can
7118 propagate forward the lma region. */
7121 lang_propagate_lma_regions (void)
7123 lang_output_section_statement_type
*os
;
7125 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7129 if (os
->prev
!= NULL
7130 && os
->lma_region
== NULL
7131 && os
->load_base
== NULL
7132 && os
->addr_tree
== NULL
7133 && os
->region
== os
->prev
->region
)
7134 os
->lma_region
= os
->prev
->lma_region
;
7141 /* Finalize dynamic list. */
7142 if (link_info
.dynamic_list
)
7143 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
7145 current_target
= default_target
;
7147 /* Open the output file. */
7148 lang_for_each_statement (ldlang_open_output
);
7151 ldemul_create_output_section_statements ();
7153 /* Add to the hash table all undefineds on the command line. */
7154 lang_place_undefineds ();
7156 if (!bfd_section_already_linked_table_init ())
7157 einfo (_("%P%F: Failed to create hash table\n"));
7159 /* Create a bfd for each input file. */
7160 current_target
= default_target
;
7161 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
7163 #ifdef ENABLE_PLUGINS
7164 if (link_info
.lto_plugin_active
)
7166 lang_statement_list_type added
;
7167 lang_statement_list_type files
, inputfiles
;
7169 /* Now all files are read, let the plugin(s) decide if there
7170 are any more to be added to the link before we call the
7171 emulation's after_open hook. We create a private list of
7172 input statements for this purpose, which we will eventually
7173 insert into the global statement list after the first claimed
7176 /* We need to manipulate all three chains in synchrony. */
7178 inputfiles
= input_file_chain
;
7179 if (plugin_call_all_symbols_read ())
7180 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
7181 plugin_error_plugin ());
7182 /* Open any newly added files, updating the file chains. */
7183 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
7184 /* Restore the global list pointer now they have all been added. */
7185 lang_list_remove_tail (stat_ptr
, &added
);
7186 /* And detach the fresh ends of the file lists. */
7187 lang_list_remove_tail (&file_chain
, &files
);
7188 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
7189 /* Were any new files added? */
7190 if (added
.head
!= NULL
)
7192 /* If so, we will insert them into the statement list immediately
7193 after the first input file that was claimed by the plugin. */
7194 plugin_insert
= find_replacements_insert_point ();
7195 /* If a plugin adds input files without having claimed any, we
7196 don't really have a good idea where to place them. Just putting
7197 them at the start or end of the list is liable to leave them
7198 outside the crtbegin...crtend range. */
7199 ASSERT (plugin_insert
!= NULL
);
7200 /* Splice the new statement list into the old one. */
7201 lang_list_insert_after (stat_ptr
, &added
,
7202 &plugin_insert
->header
.next
);
7203 /* Likewise for the file chains. */
7204 lang_list_insert_after (&input_file_chain
, &inputfiles
,
7205 &plugin_insert
->next_real_file
);
7206 /* We must be careful when relinking file_chain; we may need to
7207 insert the new files at the head of the list if the insert
7208 point chosen is the dummy first input file. */
7209 if (plugin_insert
->filename
)
7210 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
7212 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
7214 /* Rescan archives in case new undefined symbols have appeared. */
7216 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
7217 lang_list_remove_tail (&file_chain
, &files
);
7218 while (files
.head
!= NULL
)
7220 lang_statement_union_type
**insert
;
7221 lang_statement_union_type
**iter
, *temp
;
7224 insert
= find_rescan_insertion (&files
.head
->input_statement
);
7225 /* All elements from an archive can be added at once. */
7226 iter
= &files
.head
->input_statement
.next
;
7227 my_arch
= files
.head
->input_statement
.the_bfd
->my_archive
;
7228 if (my_arch
!= NULL
)
7229 for (; *iter
!= NULL
; iter
= &(*iter
)->input_statement
.next
)
7230 if ((*iter
)->input_statement
.the_bfd
->my_archive
!= my_arch
)
7233 *insert
= files
.head
;
7236 if (my_arch
!= NULL
)
7238 lang_input_statement_type
*parent
= my_arch
->usrdata
;
7240 parent
->next
= (lang_statement_union_type
*)
7242 - offsetof (lang_input_statement_type
, next
));
7247 #endif /* ENABLE_PLUGINS */
7249 /* Make sure that nobody has tried to add a symbol to this list
7251 ASSERT (link_info
.gc_sym_list
== NULL
);
7253 link_info
.gc_sym_list
= &entry_symbol
;
7255 if (entry_symbol
.name
== NULL
)
7257 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
7259 /* entry_symbol is normally initialied by a ENTRY definition in the
7260 linker script or the -e command line option. But if neither of
7261 these have been used, the target specific backend may still have
7262 provided an entry symbol via a call to lang_default_entry().
7263 Unfortunately this value will not be processed until lang_end()
7264 is called, long after this function has finished. So detect this
7265 case here and add the target's entry symbol to the list of starting
7266 points for garbage collection resolution. */
7267 lang_add_gc_name (entry_symbol_default
);
7270 lang_add_gc_name (link_info
.init_function
);
7271 lang_add_gc_name (link_info
.fini_function
);
7273 ldemul_after_open ();
7274 if (config
.map_file
!= NULL
)
7275 lang_print_asneeded ();
7277 bfd_section_already_linked_table_free ();
7279 /* Make sure that we're not mixing architectures. We call this
7280 after all the input files have been opened, but before we do any
7281 other processing, so that any operations merge_private_bfd_data
7282 does on the output file will be known during the rest of the
7286 /* Handle .exports instead of a version script if we're told to do so. */
7287 if (command_line
.version_exports_section
)
7288 lang_do_version_exports_section ();
7290 /* Build all sets based on the information gathered from the input
7292 ldctor_build_sets ();
7294 /* Give initial values for __start and __stop symbols, so that ELF
7295 gc_sections will keep sections referenced by these symbols. Must
7296 be done before lang_do_assignments below. */
7297 if (config
.build_constructors
)
7298 lang_init_start_stop ();
7300 /* PR 13683: We must rerun the assignments prior to running garbage
7301 collection in order to make sure that all symbol aliases are resolved. */
7302 lang_do_assignments (lang_mark_phase_enum
);
7304 lang_do_memory_regions();
7305 expld
.phase
= lang_first_phase_enum
;
7307 /* Size up the common data. */
7310 /* Remove unreferenced sections if asked to. */
7311 lang_gc_sections ();
7313 /* Check relocations. */
7314 lang_check_relocs ();
7316 ldemul_after_check_relocs ();
7318 /* Update wild statements. */
7319 update_wild_statements (statement_list
.head
);
7321 /* Run through the contours of the script and attach input sections
7322 to the correct output sections. */
7323 lang_statement_iteration
++;
7324 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
7326 process_insert_statements ();
7328 /* Find any sections not attached explicitly and handle them. */
7329 lang_place_orphans ();
7331 if (!bfd_link_relocatable (&link_info
))
7335 /* Merge SEC_MERGE sections. This has to be done after GC of
7336 sections, so that GCed sections are not merged, but before
7337 assigning dynamic symbols, since removing whole input sections
7339 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
7341 /* Look for a text section and set the readonly attribute in it. */
7342 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
7346 if (config
.text_read_only
)
7347 found
->flags
|= SEC_READONLY
;
7349 found
->flags
&= ~SEC_READONLY
;
7353 /* Copy forward lma regions for output sections in same lma region. */
7354 lang_propagate_lma_regions ();
7356 /* Defining __start/__stop symbols early for --gc-sections to work
7357 around a glibc build problem can result in these symbols being
7358 defined when they should not be. Fix them now. */
7359 if (config
.build_constructors
)
7360 lang_undef_start_stop ();
7362 /* Define .startof./.sizeof. symbols with preliminary values before
7363 dynamic symbols are created. */
7364 if (!bfd_link_relocatable (&link_info
))
7365 lang_init_startof_sizeof ();
7367 /* Do anything special before sizing sections. This is where ELF
7368 and other back-ends size dynamic sections. */
7369 ldemul_before_allocation ();
7371 /* We must record the program headers before we try to fix the
7372 section positions, since they will affect SIZEOF_HEADERS. */
7373 lang_record_phdrs ();
7375 /* Check relro sections. */
7376 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
7377 lang_find_relro_sections ();
7379 /* Size up the sections. */
7380 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
7382 /* See if anything special should be done now we know how big
7383 everything is. This is where relaxation is done. */
7384 ldemul_after_allocation ();
7386 /* Fix any __start, __stop, .startof. or .sizeof. symbols. */
7387 lang_finalize_start_stop ();
7389 /* Do all the assignments, now that we know the final resting places
7390 of all the symbols. */
7391 lang_do_assignments (lang_final_phase_enum
);
7395 /* Convert absolute symbols to section relative. */
7396 ldexp_finalize_syms ();
7398 /* Make sure that the section addresses make sense. */
7399 if (command_line
.check_section_addresses
)
7400 lang_check_section_addresses ();
7402 /* Check any required symbols are known. */
7403 ldlang_check_require_defined_symbols ();
7408 /* EXPORTED TO YACC */
7411 lang_add_wild (struct wildcard_spec
*filespec
,
7412 struct wildcard_list
*section_list
,
7413 bfd_boolean keep_sections
)
7415 struct wildcard_list
*curr
, *next
;
7416 lang_wild_statement_type
*new_stmt
;
7418 /* Reverse the list as the parser puts it back to front. */
7419 for (curr
= section_list
, section_list
= NULL
;
7421 section_list
= curr
, curr
= next
)
7424 curr
->next
= section_list
;
7427 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
7429 if (strcmp (filespec
->name
, "*") == 0)
7430 filespec
->name
= NULL
;
7431 else if (!wildcardp (filespec
->name
))
7432 lang_has_input_file
= TRUE
;
7435 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
7436 new_stmt
->filename
= NULL
;
7437 new_stmt
->filenames_sorted
= FALSE
;
7438 new_stmt
->section_flag_list
= NULL
;
7439 new_stmt
->exclude_name_list
= NULL
;
7440 if (filespec
!= NULL
)
7442 new_stmt
->filename
= filespec
->name
;
7443 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
7444 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
7445 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
7447 new_stmt
->section_list
= section_list
;
7448 new_stmt
->keep_sections
= keep_sections
;
7449 lang_list_init (&new_stmt
->children
);
7450 analyze_walk_wild_section_handler (new_stmt
);
7454 lang_section_start (const char *name
, etree_type
*address
,
7455 const segment_type
*segment
)
7457 lang_address_statement_type
*ad
;
7459 ad
= new_stat (lang_address_statement
, stat_ptr
);
7460 ad
->section_name
= name
;
7461 ad
->address
= address
;
7462 ad
->segment
= segment
;
7465 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7466 because of a -e argument on the command line, or zero if this is
7467 called by ENTRY in a linker script. Command line arguments take
7471 lang_add_entry (const char *name
, bfd_boolean cmdline
)
7473 if (entry_symbol
.name
== NULL
7475 || !entry_from_cmdline
)
7477 entry_symbol
.name
= name
;
7478 entry_from_cmdline
= cmdline
;
7482 /* Set the default start symbol to NAME. .em files should use this,
7483 not lang_add_entry, to override the use of "start" if neither the
7484 linker script nor the command line specifies an entry point. NAME
7485 must be permanently allocated. */
7487 lang_default_entry (const char *name
)
7489 entry_symbol_default
= name
;
7493 lang_add_target (const char *name
)
7495 lang_target_statement_type
*new_stmt
;
7497 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
7498 new_stmt
->target
= name
;
7502 lang_add_map (const char *name
)
7509 map_option_f
= TRUE
;
7517 lang_add_fill (fill_type
*fill
)
7519 lang_fill_statement_type
*new_stmt
;
7521 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
7522 new_stmt
->fill
= fill
;
7526 lang_add_data (int type
, union etree_union
*exp
)
7528 lang_data_statement_type
*new_stmt
;
7530 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
7531 new_stmt
->exp
= exp
;
7532 new_stmt
->type
= type
;
7535 /* Create a new reloc statement. RELOC is the BFD relocation type to
7536 generate. HOWTO is the corresponding howto structure (we could
7537 look this up, but the caller has already done so). SECTION is the
7538 section to generate a reloc against, or NAME is the name of the
7539 symbol to generate a reloc against. Exactly one of SECTION and
7540 NAME must be NULL. ADDEND is an expression for the addend. */
7543 lang_add_reloc (bfd_reloc_code_real_type reloc
,
7544 reloc_howto_type
*howto
,
7547 union etree_union
*addend
)
7549 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
7553 p
->section
= section
;
7555 p
->addend_exp
= addend
;
7557 p
->addend_value
= 0;
7558 p
->output_section
= NULL
;
7559 p
->output_offset
= 0;
7562 lang_assignment_statement_type
*
7563 lang_add_assignment (etree_type
*exp
)
7565 lang_assignment_statement_type
*new_stmt
;
7567 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
7568 new_stmt
->exp
= exp
;
7573 lang_add_attribute (enum statement_enum attribute
)
7575 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
7579 lang_startup (const char *name
)
7581 if (first_file
->filename
!= NULL
)
7583 einfo (_("%P%F: multiple STARTUP files\n"));
7585 first_file
->filename
= name
;
7586 first_file
->local_sym_name
= name
;
7587 first_file
->flags
.real
= TRUE
;
7591 lang_float (bfd_boolean maybe
)
7593 lang_float_flag
= maybe
;
7597 /* Work out the load- and run-time regions from a script statement, and
7598 store them in *LMA_REGION and *REGION respectively.
7600 MEMSPEC is the name of the run-time region, or the value of
7601 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7602 LMA_MEMSPEC is the name of the load-time region, or null if the
7603 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7604 had an explicit load address.
7606 It is an error to specify both a load region and a load address. */
7609 lang_get_regions (lang_memory_region_type
**region
,
7610 lang_memory_region_type
**lma_region
,
7611 const char *memspec
,
7612 const char *lma_memspec
,
7613 bfd_boolean have_lma
,
7614 bfd_boolean have_vma
)
7616 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7618 /* If no runtime region or VMA has been specified, but the load region
7619 has been specified, then use the load region for the runtime region
7621 if (lma_memspec
!= NULL
7623 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7624 *region
= *lma_region
;
7626 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7628 if (have_lma
&& lma_memspec
!= 0)
7629 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7634 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7635 lang_output_section_phdr_list
*phdrs
,
7636 const char *lma_memspec
)
7638 lang_get_regions (¤t_section
->region
,
7639 ¤t_section
->lma_region
,
7640 memspec
, lma_memspec
,
7641 current_section
->load_base
!= NULL
,
7642 current_section
->addr_tree
!= NULL
);
7644 current_section
->fill
= fill
;
7645 current_section
->phdrs
= phdrs
;
7650 lang_statement_append (lang_statement_list_type
*list
,
7651 lang_statement_union_type
*element
,
7652 lang_statement_union_type
**field
)
7654 *(list
->tail
) = element
;
7658 /* Set the output format type. -oformat overrides scripts. */
7661 lang_add_output_format (const char *format
,
7666 if (output_target
== NULL
|| !from_script
)
7668 if (command_line
.endian
== ENDIAN_BIG
7671 else if (command_line
.endian
== ENDIAN_LITTLE
7675 output_target
= format
;
7680 lang_add_insert (const char *where
, int is_before
)
7682 lang_insert_statement_type
*new_stmt
;
7684 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7685 new_stmt
->where
= where
;
7686 new_stmt
->is_before
= is_before
;
7687 saved_script_handle
= previous_script_handle
;
7690 /* Enter a group. This creates a new lang_group_statement, and sets
7691 stat_ptr to build new statements within the group. */
7694 lang_enter_group (void)
7696 lang_group_statement_type
*g
;
7698 g
= new_stat (lang_group_statement
, stat_ptr
);
7699 lang_list_init (&g
->children
);
7700 push_stat_ptr (&g
->children
);
7703 /* Leave a group. This just resets stat_ptr to start writing to the
7704 regular list of statements again. Note that this will not work if
7705 groups can occur inside anything else which can adjust stat_ptr,
7706 but currently they can't. */
7709 lang_leave_group (void)
7714 /* Add a new program header. This is called for each entry in a PHDRS
7715 command in a linker script. */
7718 lang_new_phdr (const char *name
,
7720 bfd_boolean filehdr
,
7725 struct lang_phdr
*n
, **pp
;
7728 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7731 n
->type
= exp_get_value_int (type
, 0, "program header type");
7732 n
->filehdr
= filehdr
;
7737 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7739 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7742 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7744 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7745 " when prior PT_LOAD headers lack them\n"), NULL
);
7752 /* Record the program header information in the output BFD. FIXME: We
7753 should not be calling an ELF specific function here. */
7756 lang_record_phdrs (void)
7760 lang_output_section_phdr_list
*last
;
7761 struct lang_phdr
*l
;
7762 lang_output_section_statement_type
*os
;
7765 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7768 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7775 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7779 lang_output_section_phdr_list
*pl
;
7781 if (os
->constraint
< 0)
7789 if (os
->sectype
== noload_section
7790 || os
->bfd_section
== NULL
7791 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7794 /* Don't add orphans to PT_INTERP header. */
7800 lang_output_section_statement_type
*tmp_os
;
7802 /* If we have not run across a section with a program
7803 header assigned to it yet, then scan forwards to find
7804 one. This prevents inconsistencies in the linker's
7805 behaviour when a script has specified just a single
7806 header and there are sections in that script which are
7807 not assigned to it, and which occur before the first
7808 use of that header. See here for more details:
7809 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7810 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7813 last
= tmp_os
->phdrs
;
7817 einfo (_("%F%P: no sections assigned to phdrs\n"));
7822 if (os
->bfd_section
== NULL
)
7825 for (; pl
!= NULL
; pl
= pl
->next
)
7827 if (strcmp (pl
->name
, l
->name
) == 0)
7832 secs
= (asection
**) xrealloc (secs
,
7833 alc
* sizeof (asection
*));
7835 secs
[c
] = os
->bfd_section
;
7842 if (l
->flags
== NULL
)
7845 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7850 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7852 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7853 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7854 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7855 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7860 /* Make sure all the phdr assignments succeeded. */
7861 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7865 lang_output_section_phdr_list
*pl
;
7867 if (os
->constraint
< 0
7868 || os
->bfd_section
== NULL
)
7871 for (pl
= os
->phdrs
;
7874 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7875 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7876 os
->name
, pl
->name
);
7880 /* Record a list of sections which may not be cross referenced. */
7883 lang_add_nocrossref (lang_nocrossref_type
*l
)
7885 struct lang_nocrossrefs
*n
;
7887 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7888 n
->next
= nocrossref_list
;
7890 n
->onlyfirst
= FALSE
;
7891 nocrossref_list
= n
;
7893 /* Set notice_all so that we get informed about all symbols. */
7894 link_info
.notice_all
= TRUE
;
7897 /* Record a section that cannot be referenced from a list of sections. */
7900 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
7902 lang_add_nocrossref (l
);
7903 nocrossref_list
->onlyfirst
= TRUE
;
7906 /* Overlay handling. We handle overlays with some static variables. */
7908 /* The overlay virtual address. */
7909 static etree_type
*overlay_vma
;
7910 /* And subsection alignment. */
7911 static etree_type
*overlay_subalign
;
7913 /* An expression for the maximum section size seen so far. */
7914 static etree_type
*overlay_max
;
7916 /* A list of all the sections in this overlay. */
7918 struct overlay_list
{
7919 struct overlay_list
*next
;
7920 lang_output_section_statement_type
*os
;
7923 static struct overlay_list
*overlay_list
;
7925 /* Start handling an overlay. */
7928 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7930 /* The grammar should prevent nested overlays from occurring. */
7931 ASSERT (overlay_vma
== NULL
7932 && overlay_subalign
== NULL
7933 && overlay_max
== NULL
);
7935 overlay_vma
= vma_expr
;
7936 overlay_subalign
= subalign
;
7939 /* Start a section in an overlay. We handle this by calling
7940 lang_enter_output_section_statement with the correct VMA.
7941 lang_leave_overlay sets up the LMA and memory regions. */
7944 lang_enter_overlay_section (const char *name
)
7946 struct overlay_list
*n
;
7949 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7950 0, overlay_subalign
, 0, 0, 0);
7952 /* If this is the first section, then base the VMA of future
7953 sections on this one. This will work correctly even if `.' is
7954 used in the addresses. */
7955 if (overlay_list
== NULL
)
7956 overlay_vma
= exp_nameop (ADDR
, name
);
7958 /* Remember the section. */
7959 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7960 n
->os
= current_section
;
7961 n
->next
= overlay_list
;
7964 size
= exp_nameop (SIZEOF
, name
);
7966 /* Arrange to work out the maximum section end address. */
7967 if (overlay_max
== NULL
)
7970 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7973 /* Finish a section in an overlay. There isn't any special to do
7977 lang_leave_overlay_section (fill_type
*fill
,
7978 lang_output_section_phdr_list
*phdrs
)
7985 name
= current_section
->name
;
7987 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7988 region and that no load-time region has been specified. It doesn't
7989 really matter what we say here, since lang_leave_overlay will
7991 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7993 /* Define the magic symbols. */
7995 clean
= (char *) xmalloc (strlen (name
) + 1);
7997 for (s1
= name
; *s1
!= '\0'; s1
++)
7998 if (ISALNUM (*s1
) || *s1
== '_')
8002 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
8003 sprintf (buf
, "__load_start_%s", clean
);
8004 lang_add_assignment (exp_provide (buf
,
8005 exp_nameop (LOADADDR
, name
),
8008 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
8009 sprintf (buf
, "__load_stop_%s", clean
);
8010 lang_add_assignment (exp_provide (buf
,
8012 exp_nameop (LOADADDR
, name
),
8013 exp_nameop (SIZEOF
, name
)),
8019 /* Finish an overlay. If there are any overlay wide settings, this
8020 looks through all the sections in the overlay and sets them. */
8023 lang_leave_overlay (etree_type
*lma_expr
,
8026 const char *memspec
,
8027 lang_output_section_phdr_list
*phdrs
,
8028 const char *lma_memspec
)
8030 lang_memory_region_type
*region
;
8031 lang_memory_region_type
*lma_region
;
8032 struct overlay_list
*l
;
8033 lang_nocrossref_type
*nocrossref
;
8035 lang_get_regions (®ion
, &lma_region
,
8036 memspec
, lma_memspec
,
8037 lma_expr
!= NULL
, FALSE
);
8041 /* After setting the size of the last section, set '.' to end of the
8043 if (overlay_list
!= NULL
)
8045 overlay_list
->os
->update_dot
= 1;
8046 overlay_list
->os
->update_dot_tree
8047 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
8053 struct overlay_list
*next
;
8055 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
8058 l
->os
->region
= region
;
8059 l
->os
->lma_region
= lma_region
;
8061 /* The first section has the load address specified in the
8062 OVERLAY statement. The rest are worked out from that.
8063 The base address is not needed (and should be null) if
8064 an LMA region was specified. */
8067 l
->os
->load_base
= lma_expr
;
8068 l
->os
->sectype
= normal_section
;
8070 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
8071 l
->os
->phdrs
= phdrs
;
8075 lang_nocrossref_type
*nc
;
8077 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
8078 nc
->name
= l
->os
->name
;
8079 nc
->next
= nocrossref
;
8088 if (nocrossref
!= NULL
)
8089 lang_add_nocrossref (nocrossref
);
8092 overlay_list
= NULL
;
8094 overlay_subalign
= NULL
;
8097 /* Version handling. This is only useful for ELF. */
8099 /* If PREV is NULL, return first version pattern matching particular symbol.
8100 If PREV is non-NULL, return first version pattern matching particular
8101 symbol after PREV (previously returned by lang_vers_match). */
8103 static struct bfd_elf_version_expr
*
8104 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
8105 struct bfd_elf_version_expr
*prev
,
8109 const char *cxx_sym
= sym
;
8110 const char *java_sym
= sym
;
8111 struct bfd_elf_version_expr
*expr
= NULL
;
8112 enum demangling_styles curr_style
;
8114 curr_style
= CURRENT_DEMANGLING_STYLE
;
8115 cplus_demangle_set_style (no_demangling
);
8116 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
8119 cplus_demangle_set_style (curr_style
);
8121 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8123 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
8124 DMGL_PARAMS
| DMGL_ANSI
);
8128 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8130 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
8135 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
8137 struct bfd_elf_version_expr e
;
8139 switch (prev
? prev
->mask
: 0)
8142 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
8145 expr
= (struct bfd_elf_version_expr
*)
8146 htab_find ((htab_t
) head
->htab
, &e
);
8147 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
8148 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
8154 case BFD_ELF_VERSION_C_TYPE
:
8155 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
8157 e
.pattern
= cxx_sym
;
8158 expr
= (struct bfd_elf_version_expr
*)
8159 htab_find ((htab_t
) head
->htab
, &e
);
8160 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
8161 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8167 case BFD_ELF_VERSION_CXX_TYPE
:
8168 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
8170 e
.pattern
= java_sym
;
8171 expr
= (struct bfd_elf_version_expr
*)
8172 htab_find ((htab_t
) head
->htab
, &e
);
8173 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
8174 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8185 /* Finally, try the wildcards. */
8186 if (prev
== NULL
|| prev
->literal
)
8187 expr
= head
->remaining
;
8190 for (; expr
; expr
= expr
->next
)
8197 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
8200 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
8202 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
8206 if (fnmatch (expr
->pattern
, s
, 0) == 0)
8212 free ((char *) c_sym
);
8214 free ((char *) cxx_sym
);
8215 if (java_sym
!= sym
)
8216 free ((char *) java_sym
);
8220 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
8221 return a pointer to the symbol name with any backslash quotes removed. */
8224 realsymbol (const char *pattern
)
8227 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
8228 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
8230 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
8232 /* It is a glob pattern only if there is no preceding
8236 /* Remove the preceding backslash. */
8243 if (*p
== '?' || *p
== '*' || *p
== '[')
8250 backslash
= *p
== '\\';
8266 /* This is called for each variable name or match expression. NEW_NAME is
8267 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
8268 pattern to be matched against symbol names. */
8270 struct bfd_elf_version_expr
*
8271 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
8272 const char *new_name
,
8274 bfd_boolean literal_p
)
8276 struct bfd_elf_version_expr
*ret
;
8278 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
8282 ret
->literal
= TRUE
;
8283 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
8284 if (ret
->pattern
== NULL
)
8286 ret
->pattern
= new_name
;
8287 ret
->literal
= FALSE
;
8290 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
8291 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8292 else if (strcasecmp (lang
, "C++") == 0)
8293 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
8294 else if (strcasecmp (lang
, "Java") == 0)
8295 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
8298 einfo (_("%X%P: unknown language `%s' in version information\n"),
8300 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8303 return ldemul_new_vers_pattern (ret
);
8306 /* This is called for each set of variable names and match
8309 struct bfd_elf_version_tree
*
8310 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
8311 struct bfd_elf_version_expr
*locals
)
8313 struct bfd_elf_version_tree
*ret
;
8315 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
8316 ret
->globals
.list
= globals
;
8317 ret
->locals
.list
= locals
;
8318 ret
->match
= lang_vers_match
;
8319 ret
->name_indx
= (unsigned int) -1;
8323 /* This static variable keeps track of version indices. */
8325 static int version_index
;
8328 version_expr_head_hash (const void *p
)
8330 const struct bfd_elf_version_expr
*e
=
8331 (const struct bfd_elf_version_expr
*) p
;
8333 return htab_hash_string (e
->pattern
);
8337 version_expr_head_eq (const void *p1
, const void *p2
)
8339 const struct bfd_elf_version_expr
*e1
=
8340 (const struct bfd_elf_version_expr
*) p1
;
8341 const struct bfd_elf_version_expr
*e2
=
8342 (const struct bfd_elf_version_expr
*) p2
;
8344 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
8348 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
8351 struct bfd_elf_version_expr
*e
, *next
;
8352 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
8354 for (e
= head
->list
; e
; e
= e
->next
)
8358 head
->mask
|= e
->mask
;
8363 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
8364 version_expr_head_eq
, NULL
);
8365 list_loc
= &head
->list
;
8366 remaining_loc
= &head
->remaining
;
8367 for (e
= head
->list
; e
; e
= next
)
8373 remaining_loc
= &e
->next
;
8377 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
8381 struct bfd_elf_version_expr
*e1
, *last
;
8383 e1
= (struct bfd_elf_version_expr
*) *loc
;
8387 if (e1
->mask
== e
->mask
)
8395 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
8399 /* This is a duplicate. */
8400 /* FIXME: Memory leak. Sometimes pattern is not
8401 xmalloced alone, but in larger chunk of memory. */
8402 /* free (e->pattern); */
8407 e
->next
= last
->next
;
8415 list_loc
= &e
->next
;
8419 *remaining_loc
= NULL
;
8420 *list_loc
= head
->remaining
;
8423 head
->remaining
= head
->list
;
8426 /* This is called when we know the name and dependencies of the
8430 lang_register_vers_node (const char *name
,
8431 struct bfd_elf_version_tree
*version
,
8432 struct bfd_elf_version_deps
*deps
)
8434 struct bfd_elf_version_tree
*t
, **pp
;
8435 struct bfd_elf_version_expr
*e1
;
8440 if (link_info
.version_info
!= NULL
8441 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
8443 einfo (_("%X%P: anonymous version tag cannot be combined"
8444 " with other version tags\n"));
8449 /* Make sure this node has a unique name. */
8450 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8451 if (strcmp (t
->name
, name
) == 0)
8452 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
8454 lang_finalize_version_expr_head (&version
->globals
);
8455 lang_finalize_version_expr_head (&version
->locals
);
8457 /* Check the global and local match names, and make sure there
8458 aren't any duplicates. */
8460 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
8462 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8464 struct bfd_elf_version_expr
*e2
;
8466 if (t
->locals
.htab
&& e1
->literal
)
8468 e2
= (struct bfd_elf_version_expr
*)
8469 htab_find ((htab_t
) t
->locals
.htab
, e1
);
8470 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8472 if (e1
->mask
== e2
->mask
)
8473 einfo (_("%X%P: duplicate expression `%s'"
8474 " in version information\n"), e1
->pattern
);
8478 else if (!e1
->literal
)
8479 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8480 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8481 && e1
->mask
== e2
->mask
)
8482 einfo (_("%X%P: duplicate expression `%s'"
8483 " in version information\n"), e1
->pattern
);
8487 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
8489 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8491 struct bfd_elf_version_expr
*e2
;
8493 if (t
->globals
.htab
&& e1
->literal
)
8495 e2
= (struct bfd_elf_version_expr
*)
8496 htab_find ((htab_t
) t
->globals
.htab
, e1
);
8497 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8499 if (e1
->mask
== e2
->mask
)
8500 einfo (_("%X%P: duplicate expression `%s'"
8501 " in version information\n"),
8506 else if (!e1
->literal
)
8507 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8508 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8509 && e1
->mask
== e2
->mask
)
8510 einfo (_("%X%P: duplicate expression `%s'"
8511 " in version information\n"), e1
->pattern
);
8515 version
->deps
= deps
;
8516 version
->name
= name
;
8517 if (name
[0] != '\0')
8520 version
->vernum
= version_index
;
8523 version
->vernum
= 0;
8525 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8530 /* This is called when we see a version dependency. */
8532 struct bfd_elf_version_deps
*
8533 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
8535 struct bfd_elf_version_deps
*ret
;
8536 struct bfd_elf_version_tree
*t
;
8538 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
8541 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8543 if (strcmp (t
->name
, name
) == 0)
8545 ret
->version_needed
= t
;
8550 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
8552 ret
->version_needed
= NULL
;
8557 lang_do_version_exports_section (void)
8559 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
8561 LANG_FOR_EACH_INPUT_STATEMENT (is
)
8563 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
8571 contents
= (char *) xmalloc (len
);
8572 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
8573 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
8576 while (p
< contents
+ len
)
8578 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
8579 p
= strchr (p
, '\0') + 1;
8582 /* Do not free the contents, as we used them creating the regex. */
8584 /* Do not include this section in the link. */
8585 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
8588 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
8589 lang_register_vers_node (command_line
.version_exports_section
,
8590 lang_new_vers_node (greg
, lreg
), NULL
);
8593 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8596 lang_do_memory_regions (void)
8598 lang_memory_region_type
*r
= lang_memory_region_list
;
8600 for (; r
!= NULL
; r
= r
->next
)
8604 exp_fold_tree_no_dot (r
->origin_exp
);
8605 if (expld
.result
.valid_p
)
8607 r
->origin
= expld
.result
.value
;
8608 r
->current
= r
->origin
;
8611 einfo (_("%F%P: invalid origin for memory region %s\n"),
8616 exp_fold_tree_no_dot (r
->length_exp
);
8617 if (expld
.result
.valid_p
)
8618 r
->length
= expld
.result
.value
;
8620 einfo (_("%F%P: invalid length for memory region %s\n"),
8627 lang_add_unique (const char *name
)
8629 struct unique_sections
*ent
;
8631 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8632 if (strcmp (ent
->name
, name
) == 0)
8635 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8636 ent
->name
= xstrdup (name
);
8637 ent
->next
= unique_section_list
;
8638 unique_section_list
= ent
;
8641 /* Append the list of dynamic symbols to the existing one. */
8644 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8646 if (link_info
.dynamic_list
)
8648 struct bfd_elf_version_expr
*tail
;
8649 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8651 tail
->next
= link_info
.dynamic_list
->head
.list
;
8652 link_info
.dynamic_list
->head
.list
= dynamic
;
8656 struct bfd_elf_dynamic_list
*d
;
8658 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8659 d
->head
.list
= dynamic
;
8660 d
->match
= lang_vers_match
;
8661 link_info
.dynamic_list
= d
;
8665 /* Append the list of C++ typeinfo dynamic symbols to the existing
8669 lang_append_dynamic_list_cpp_typeinfo (void)
8671 const char *symbols
[] =
8673 "typeinfo name for*",
8676 struct bfd_elf_version_expr
*dynamic
= NULL
;
8679 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8680 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8683 lang_append_dynamic_list (dynamic
);
8686 /* Append the list of C++ operator new and delete dynamic symbols to the
8690 lang_append_dynamic_list_cpp_new (void)
8692 const char *symbols
[] =
8697 struct bfd_elf_version_expr
*dynamic
= NULL
;
8700 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8701 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8704 lang_append_dynamic_list (dynamic
);
8707 /* Scan a space and/or comma separated string of features. */
8710 lang_ld_feature (char *str
)
8718 while (*p
== ',' || ISSPACE (*p
))
8723 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8727 if (strcasecmp (p
, "SANE_EXPR") == 0)
8728 config
.sane_expr
= TRUE
;
8730 einfo (_("%X%P: unknown feature `%s'\n"), p
);
8736 /* Pretty print memory amount. */
8739 lang_print_memory_size (bfd_vma sz
)
8741 if ((sz
& 0x3fffffff) == 0)
8742 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
8743 else if ((sz
& 0xfffff) == 0)
8744 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
8745 else if ((sz
& 0x3ff) == 0)
8746 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
8748 printf (" %10" BFD_VMA_FMT
"u B", sz
);
8751 /* Implement --print-memory-usage: disply per region memory usage. */
8754 lang_print_memory_usage (void)
8756 lang_memory_region_type
*r
;
8758 printf ("Memory region Used Size Region Size %%age Used\n");
8759 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
8761 bfd_vma used_length
= r
->current
- r
->origin
;
8764 printf ("%16s: ",r
->name_list
.name
);
8765 lang_print_memory_size (used_length
);
8766 lang_print_memory_size ((bfd_vma
) r
->length
);
8768 percent
= used_length
* 100.0 / r
->length
;
8770 printf (" %6.2f%%\n", percent
);