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 placed_commons
= FALSE
;
65 static bfd_boolean map_head_is_link_order
= FALSE
;
66 static lang_output_section_statement_type
*default_common_section
;
67 static bfd_boolean map_option_f
;
68 static bfd_vma print_dot
;
69 static lang_input_statement_type
*first_file
;
70 static const char *current_target
;
71 static lang_statement_list_type statement_list
;
72 static lang_statement_list_type
*stat_save
[10];
73 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
74 static struct unique_sections
*unique_section_list
;
75 static struct asneeded_minfo
*asneeded_list_head
;
76 static unsigned int opb_shift
= 0;
78 /* Forward declarations. */
79 static void exp_init_os (etree_type
*);
80 static lang_input_statement_type
*lookup_name (const char *);
81 static void insert_undefined (const char *);
82 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
83 static void print_statement (lang_statement_union_type
*,
84 lang_output_section_statement_type
*);
85 static void print_statement_list (lang_statement_union_type
*,
86 lang_output_section_statement_type
*);
87 static void print_statements (void);
88 static void print_input_section (asection
*, bfd_boolean
);
89 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
90 static void lang_record_phdrs (void);
91 static void lang_do_version_exports_section (void);
92 static void lang_finalize_version_expr_head
93 (struct bfd_elf_version_expr_head
*);
94 static void lang_do_memory_regions (void);
96 /* Exported variables. */
97 const char *output_target
;
98 lang_output_section_statement_type
*abs_output_section
;
99 lang_statement_list_type lang_output_section_statement
;
100 lang_statement_list_type
*stat_ptr
= &statement_list
;
101 lang_statement_list_type file_chain
= { NULL
, NULL
};
102 lang_statement_list_type input_file_chain
;
103 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
104 const char *entry_section
= ".text";
105 struct lang_input_statement_flags input_flags
;
106 bfd_boolean entry_from_cmdline
;
107 bfd_boolean undef_from_cmdline
;
108 bfd_boolean lang_has_input_file
= FALSE
;
109 bfd_boolean had_output_filename
= FALSE
;
110 bfd_boolean lang_float_flag
= FALSE
;
111 bfd_boolean delete_output_file_on_failure
= FALSE
;
112 struct lang_phdr
*lang_phdr_list
;
113 struct lang_nocrossrefs
*nocrossref_list
;
114 struct asneeded_minfo
**asneeded_list_tail
;
116 /* Functions that traverse the linker script and might evaluate
117 DEFINED() need to increment this at the start of the traversal. */
118 int lang_statement_iteration
= 0;
120 /* Return TRUE if the PATTERN argument is a wildcard pattern.
121 Although backslashes are treated specially if a pattern contains
122 wildcards, we do not consider the mere presence of a backslash to
123 be enough to cause the pattern to be treated as a wildcard.
124 That lets us handle DOS filenames more naturally. */
125 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
127 #define new_stat(x, y) \
128 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
130 #define outside_section_address(q) \
131 ((q)->output_offset + (q)->output_section->vma)
133 #define outside_symbol_address(q) \
134 ((q)->value + outside_section_address (q->section))
136 #define SECTION_NAME_MAP_LENGTH (16)
139 stat_alloc (size_t size
)
141 return obstack_alloc (&stat_obstack
, size
);
145 name_match (const char *pattern
, const char *name
)
147 if (wildcardp (pattern
))
148 return fnmatch (pattern
, name
, 0);
149 return strcmp (pattern
, name
);
152 /* If PATTERN is of the form archive:file, return a pointer to the
153 separator. If not, return NULL. */
156 archive_path (const char *pattern
)
160 if (link_info
.path_separator
== 0)
163 p
= strchr (pattern
, link_info
.path_separator
);
164 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
165 if (p
== NULL
|| link_info
.path_separator
!= ':')
168 /* Assume a match on the second char is part of drive specifier,
169 as in "c:\silly.dos". */
170 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
171 p
= strchr (p
+ 1, link_info
.path_separator
);
176 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
177 return whether F matches FILE_SPEC. */
180 input_statement_is_archive_path (const char *file_spec
, char *sep
,
181 lang_input_statement_type
*f
)
183 bfd_boolean match
= FALSE
;
186 || name_match (sep
+ 1, f
->filename
) == 0)
187 && ((sep
!= file_spec
)
188 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
192 if (sep
!= file_spec
)
194 const char *aname
= f
->the_bfd
->my_archive
->filename
;
196 match
= name_match (file_spec
, aname
) == 0;
197 *sep
= link_info
.path_separator
;
204 unique_section_p (const asection
*sec
,
205 const lang_output_section_statement_type
*os
)
207 struct unique_sections
*unam
;
210 if (bfd_link_relocatable (&link_info
)
211 && sec
->owner
!= NULL
212 && bfd_is_group_section (sec
->owner
, sec
))
214 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
217 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
218 if (name_match (unam
->name
, secnam
) == 0)
224 /* Generic traversal routines for finding matching sections. */
226 /* Return true if FILE matches a pattern in EXCLUDE_LIST, otherwise return
230 walk_wild_file_in_exclude_list (struct name_list
*exclude_list
,
231 lang_input_statement_type
*file
)
233 struct name_list
*list_tmp
;
235 for (list_tmp
= exclude_list
;
237 list_tmp
= list_tmp
->next
)
239 char *p
= archive_path (list_tmp
->name
);
243 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
247 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
250 /* FIXME: Perhaps remove the following at some stage? Matching
251 unadorned archives like this was never documented and has
252 been superceded by the archive:path syntax. */
253 else if (file
->the_bfd
!= NULL
254 && file
->the_bfd
->my_archive
!= NULL
255 && name_match (list_tmp
->name
,
256 file
->the_bfd
->my_archive
->filename
) == 0)
263 /* Try processing a section against a wildcard. This just calls
264 the callback unless the filename exclusion list is present
265 and excludes the file. It's hardly ever present so this
266 function is very fast. */
269 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
270 lang_input_statement_type
*file
,
272 struct wildcard_list
*sec
,
276 /* Don't process sections from files which were excluded. */
277 if (walk_wild_file_in_exclude_list (sec
->spec
.exclude_name_list
, file
))
280 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
283 /* Lowest common denominator routine that can handle everything correctly,
287 walk_wild_section_general (lang_wild_statement_type
*ptr
,
288 lang_input_statement_type
*file
,
293 struct wildcard_list
*sec
;
295 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
297 sec
= ptr
->section_list
;
299 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
303 bfd_boolean skip
= FALSE
;
305 if (sec
->spec
.name
!= NULL
)
307 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
309 skip
= name_match (sec
->spec
.name
, sname
) != 0;
313 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
320 /* Routines to find a single section given its name. If there's more
321 than one section with that name, we report that. */
325 asection
*found_section
;
326 bfd_boolean multiple_sections_found
;
327 } section_iterator_callback_data
;
330 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
332 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
334 if (d
->found_section
!= NULL
)
336 d
->multiple_sections_found
= TRUE
;
340 d
->found_section
= s
;
345 find_section (lang_input_statement_type
*file
,
346 struct wildcard_list
*sec
,
347 bfd_boolean
*multiple_sections_found
)
349 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
351 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
352 section_iterator_callback
, &cb_data
);
353 *multiple_sections_found
= cb_data
.multiple_sections_found
;
354 return cb_data
.found_section
;
357 /* Code for handling simple wildcards without going through fnmatch,
358 which can be expensive because of charset translations etc. */
360 /* A simple wild is a literal string followed by a single '*',
361 where the literal part is at least 4 characters long. */
364 is_simple_wild (const char *name
)
366 size_t len
= strcspn (name
, "*?[");
367 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
371 match_simple_wild (const char *pattern
, const char *name
)
373 /* The first four characters of the pattern are guaranteed valid
374 non-wildcard characters. So we can go faster. */
375 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
376 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
381 while (*pattern
!= '*')
382 if (*name
++ != *pattern
++)
388 /* Return the numerical value of the init_priority attribute from
389 section name NAME. */
392 get_init_priority (const char *name
)
395 unsigned long init_priority
;
397 /* GCC uses the following section names for the init_priority
398 attribute with numerical values 101 and 65535 inclusive. A
399 lower value means a higher priority.
401 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
402 decimal numerical value of the init_priority attribute.
403 The order of execution in .init_array is forward and
404 .fini_array is backward.
405 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
406 decimal numerical value of the init_priority attribute.
407 The order of execution in .ctors is backward and .dtors
410 if (strncmp (name
, ".init_array.", 12) == 0
411 || strncmp (name
, ".fini_array.", 12) == 0)
413 init_priority
= strtoul (name
+ 12, &end
, 10);
414 return *end
? 0 : init_priority
;
416 else if (strncmp (name
, ".ctors.", 7) == 0
417 || strncmp (name
, ".dtors.", 7) == 0)
419 init_priority
= strtoul (name
+ 7, &end
, 10);
420 return *end
? 0 : 65535 - init_priority
;
426 /* Compare sections ASEC and BSEC according to SORT. */
429 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
432 unsigned long ainit_priority
, binit_priority
;
439 case by_init_priority
:
441 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
443 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
444 if (ainit_priority
== 0 || binit_priority
== 0)
446 ret
= ainit_priority
- binit_priority
;
452 case by_alignment_name
:
453 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
454 - bfd_section_alignment (asec
->owner
, asec
));
461 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
462 bfd_get_section_name (bsec
->owner
, bsec
));
465 case by_name_alignment
:
466 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
467 bfd_get_section_name (bsec
->owner
, bsec
));
473 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
474 - bfd_section_alignment (asec
->owner
, asec
));
481 /* Build a Binary Search Tree to sort sections, unlike insertion sort
482 used in wild_sort(). BST is considerably faster if the number of
483 of sections are large. */
485 static lang_section_bst_type
**
486 wild_sort_fast (lang_wild_statement_type
*wild
,
487 struct wildcard_list
*sec
,
488 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
491 lang_section_bst_type
**tree
;
494 if (!wild
->filenames_sorted
495 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
497 /* Append at the right end of tree. */
499 tree
= &((*tree
)->right
);
505 /* Find the correct node to append this section. */
506 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
507 tree
= &((*tree
)->left
);
509 tree
= &((*tree
)->right
);
515 /* Use wild_sort_fast to build a BST to sort sections. */
518 output_section_callback_fast (lang_wild_statement_type
*ptr
,
519 struct wildcard_list
*sec
,
521 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
522 lang_input_statement_type
*file
,
525 lang_section_bst_type
*node
;
526 lang_section_bst_type
**tree
;
527 lang_output_section_statement_type
*os
;
529 os
= (lang_output_section_statement_type
*) output
;
531 if (unique_section_p (section
, os
))
534 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
537 node
->section
= section
;
539 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
544 /* Convert a sorted sections' BST back to list form. */
547 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
548 lang_section_bst_type
*tree
,
552 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
554 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
555 (lang_output_section_statement_type
*) output
);
558 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
563 /* Specialized, optimized routines for handling different kinds of
567 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
568 lang_input_statement_type
*file
,
572 /* We can just do a hash lookup for the section with the right name.
573 But if that lookup discovers more than one section with the name
574 (should be rare), we fall back to the general algorithm because
575 we would otherwise have to sort the sections to make sure they
576 get processed in the bfd's order. */
577 bfd_boolean multiple_sections_found
;
578 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
579 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
581 if (multiple_sections_found
)
582 walk_wild_section_general (ptr
, file
, callback
, data
);
584 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
588 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
589 lang_input_statement_type
*file
,
594 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
596 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
598 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
599 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
602 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
607 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
608 lang_input_statement_type
*file
,
613 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
614 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
615 bfd_boolean multiple_sections_found
;
616 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
618 if (multiple_sections_found
)
620 walk_wild_section_general (ptr
, file
, callback
, data
);
624 /* Note that if the section was not found, s0 is NULL and
625 we'll simply never succeed the s == s0 test below. */
626 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
628 /* Recall that in this code path, a section cannot satisfy more
629 than one spec, so if s == s0 then it cannot match
632 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
635 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
636 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
639 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
646 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
647 lang_input_statement_type
*file
,
652 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
653 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
654 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
655 bfd_boolean multiple_sections_found
;
656 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
658 if (multiple_sections_found
)
660 walk_wild_section_general (ptr
, file
, callback
, data
);
664 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
667 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
670 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
671 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
674 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
677 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
679 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
687 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
688 lang_input_statement_type
*file
,
693 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
694 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
695 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
696 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
697 bfd_boolean multiple_sections_found
;
698 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
700 if (multiple_sections_found
)
702 walk_wild_section_general (ptr
, file
, callback
, data
);
706 s1
= find_section (file
, sec1
, &multiple_sections_found
);
707 if (multiple_sections_found
)
709 walk_wild_section_general (ptr
, file
, callback
, data
);
713 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
716 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
719 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
722 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
723 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
727 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
731 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
733 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
741 walk_wild_section (lang_wild_statement_type
*ptr
,
742 lang_input_statement_type
*file
,
746 if (file
->flags
.just_syms
)
749 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
752 /* Returns TRUE when name1 is a wildcard spec that might match
753 something name2 can match. We're conservative: we return FALSE
754 only if the prefixes of name1 and name2 are different up to the
755 first wildcard character. */
758 wild_spec_can_overlap (const char *name1
, const char *name2
)
760 size_t prefix1_len
= strcspn (name1
, "?*[");
761 size_t prefix2_len
= strcspn (name2
, "?*[");
762 size_t min_prefix_len
;
764 /* Note that if there is no wildcard character, then we treat the
765 terminating 0 as part of the prefix. Thus ".text" won't match
766 ".text." or ".text.*", for example. */
767 if (name1
[prefix1_len
] == '\0')
769 if (name2
[prefix2_len
] == '\0')
772 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
774 return memcmp (name1
, name2
, min_prefix_len
) == 0;
777 /* Select specialized code to handle various kinds of wildcard
781 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
784 int wild_name_count
= 0;
785 struct wildcard_list
*sec
;
789 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
790 ptr
->handler_data
[0] = NULL
;
791 ptr
->handler_data
[1] = NULL
;
792 ptr
->handler_data
[2] = NULL
;
793 ptr
->handler_data
[3] = NULL
;
796 /* Count how many wildcard_specs there are, and how many of those
797 actually use wildcards in the name. Also, bail out if any of the
798 wildcard names are NULL. (Can this actually happen?
799 walk_wild_section used to test for it.) And bail out if any
800 of the wildcards are more complex than a simple string
801 ending in a single '*'. */
802 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
805 if (sec
->spec
.name
== NULL
)
807 if (wildcardp (sec
->spec
.name
))
810 if (!is_simple_wild (sec
->spec
.name
))
815 /* The zero-spec case would be easy to optimize but it doesn't
816 happen in practice. Likewise, more than 4 specs doesn't
817 happen in practice. */
818 if (sec_count
== 0 || sec_count
> 4)
821 /* Check that no two specs can match the same section. */
822 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
824 struct wildcard_list
*sec2
;
825 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
827 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
832 signature
= (sec_count
<< 8) + wild_name_count
;
836 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
839 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
842 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
845 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
848 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
854 /* Now fill the data array with pointers to the specs, first the
855 specs with non-wildcard names, then the specs with wildcard
856 names. It's OK to process the specs in different order from the
857 given order, because we've already determined that no section
858 will match more than one spec. */
860 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
861 if (!wildcardp (sec
->spec
.name
))
862 ptr
->handler_data
[data_counter
++] = sec
;
863 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
864 if (wildcardp (sec
->spec
.name
))
865 ptr
->handler_data
[data_counter
++] = sec
;
868 /* Handle a wild statement for a single file F. */
871 walk_wild_file (lang_wild_statement_type
*s
,
872 lang_input_statement_type
*f
,
876 if (walk_wild_file_in_exclude_list (s
->exclude_name_list
, f
))
879 if (f
->the_bfd
== NULL
880 || !bfd_check_format (f
->the_bfd
, bfd_archive
))
881 walk_wild_section (s
, f
, callback
, data
);
886 /* This is an archive file. We must map each member of the
887 archive separately. */
888 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
889 while (member
!= NULL
)
891 /* When lookup_name is called, it will call the add_symbols
892 entry point for the archive. For each element of the
893 archive which is included, BFD will call ldlang_add_file,
894 which will set the usrdata field of the member to the
895 lang_input_statement. */
896 if (member
->usrdata
!= NULL
)
898 walk_wild_section (s
,
899 (lang_input_statement_type
*) member
->usrdata
,
903 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
909 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
911 const char *file_spec
= s
->filename
;
914 if (file_spec
== NULL
)
916 /* Perform the iteration over all files in the list. */
917 LANG_FOR_EACH_INPUT_STATEMENT (f
)
919 walk_wild_file (s
, f
, callback
, data
);
922 else if ((p
= archive_path (file_spec
)) != NULL
)
924 LANG_FOR_EACH_INPUT_STATEMENT (f
)
926 if (input_statement_is_archive_path (file_spec
, p
, f
))
927 walk_wild_file (s
, f
, callback
, data
);
930 else if (wildcardp (file_spec
))
932 LANG_FOR_EACH_INPUT_STATEMENT (f
)
934 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
935 walk_wild_file (s
, f
, callback
, data
);
940 lang_input_statement_type
*f
;
942 /* Perform the iteration over a single file. */
943 f
= lookup_name (file_spec
);
945 walk_wild_file (s
, f
, callback
, data
);
949 /* lang_for_each_statement walks the parse tree and calls the provided
950 function for each node, except those inside output section statements
951 with constraint set to -1. */
954 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
955 lang_statement_union_type
*s
)
957 for (; s
!= NULL
; s
= s
->header
.next
)
961 switch (s
->header
.type
)
963 case lang_constructors_statement_enum
:
964 lang_for_each_statement_worker (func
, constructor_list
.head
);
966 case lang_output_section_statement_enum
:
967 if (s
->output_section_statement
.constraint
!= -1)
968 lang_for_each_statement_worker
969 (func
, s
->output_section_statement
.children
.head
);
971 case lang_wild_statement_enum
:
972 lang_for_each_statement_worker (func
,
973 s
->wild_statement
.children
.head
);
975 case lang_group_statement_enum
:
976 lang_for_each_statement_worker (func
,
977 s
->group_statement
.children
.head
);
979 case lang_data_statement_enum
:
980 case lang_reloc_statement_enum
:
981 case lang_object_symbols_statement_enum
:
982 case lang_output_statement_enum
:
983 case lang_target_statement_enum
:
984 case lang_input_section_enum
:
985 case lang_input_statement_enum
:
986 case lang_assignment_statement_enum
:
987 case lang_padding_statement_enum
:
988 case lang_address_statement_enum
:
989 case lang_fill_statement_enum
:
990 case lang_insert_statement_enum
:
1000 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
1002 lang_for_each_statement_worker (func
, statement_list
.head
);
1005 /*----------------------------------------------------------------------*/
1008 lang_list_init (lang_statement_list_type
*list
)
1011 list
->tail
= &list
->head
;
1015 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1017 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1019 *stat_save_ptr
++ = stat_ptr
;
1026 if (stat_save_ptr
<= stat_save
)
1028 stat_ptr
= *--stat_save_ptr
;
1031 /* Build a new statement node for the parse tree. */
1033 static lang_statement_union_type
*
1034 new_statement (enum statement_enum type
,
1036 lang_statement_list_type
*list
)
1038 lang_statement_union_type
*new_stmt
;
1040 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1041 new_stmt
->header
.type
= type
;
1042 new_stmt
->header
.next
= NULL
;
1043 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1047 /* Build a new input file node for the language. There are several
1048 ways in which we treat an input file, eg, we only look at symbols,
1049 or prefix it with a -l etc.
1051 We can be supplied with requests for input files more than once;
1052 they may, for example be split over several lines like foo.o(.text)
1053 foo.o(.data) etc, so when asked for a file we check that we haven't
1054 got it already so we don't duplicate the bfd. */
1056 static lang_input_statement_type
*
1057 new_afile (const char *name
,
1058 lang_input_file_enum_type file_type
,
1060 bfd_boolean add_to_list
)
1062 lang_input_statement_type
*p
;
1064 lang_has_input_file
= TRUE
;
1067 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1070 p
= (lang_input_statement_type
*)
1071 stat_alloc (sizeof (lang_input_statement_type
));
1072 p
->header
.type
= lang_input_statement_enum
;
1073 p
->header
.next
= NULL
;
1076 memset (&p
->the_bfd
, 0,
1077 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1079 p
->flags
.dynamic
= input_flags
.dynamic
;
1080 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1081 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1082 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1083 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1087 case lang_input_file_is_symbols_only_enum
:
1089 p
->local_sym_name
= name
;
1090 p
->flags
.real
= TRUE
;
1091 p
->flags
.just_syms
= TRUE
;
1093 case lang_input_file_is_fake_enum
:
1095 p
->local_sym_name
= name
;
1097 case lang_input_file_is_l_enum
:
1098 if (name
[0] == ':' && name
[1] != '\0')
1100 p
->filename
= name
+ 1;
1101 p
->flags
.full_name_provided
= TRUE
;
1105 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1106 p
->flags
.maybe_archive
= TRUE
;
1107 p
->flags
.real
= TRUE
;
1108 p
->flags
.search_dirs
= TRUE
;
1110 case lang_input_file_is_marker_enum
:
1112 p
->local_sym_name
= name
;
1113 p
->flags
.search_dirs
= TRUE
;
1115 case lang_input_file_is_search_file_enum
:
1117 p
->local_sym_name
= name
;
1118 p
->flags
.real
= TRUE
;
1119 p
->flags
.search_dirs
= TRUE
;
1121 case lang_input_file_is_file_enum
:
1123 p
->local_sym_name
= name
;
1124 p
->flags
.real
= TRUE
;
1130 lang_statement_append (&input_file_chain
,
1131 (lang_statement_union_type
*) p
,
1132 &p
->next_real_file
);
1136 lang_input_statement_type
*
1137 lang_add_input_file (const char *name
,
1138 lang_input_file_enum_type file_type
,
1141 if (name
!= NULL
&& *name
== '=')
1143 lang_input_statement_type
*ret
;
1144 char *sysrooted_name
1145 = concat (ld_sysroot
, name
+ 1, (const char *) NULL
);
1147 /* We've now forcibly prepended the sysroot, making the input
1148 file independent of the context. Therefore, temporarily
1149 force a non-sysrooted context for this statement, so it won't
1150 get the sysroot prepended again when opened. (N.B. if it's a
1151 script, any child nodes with input files starting with "/"
1152 will be handled as "sysrooted" as they'll be found to be
1153 within the sysroot subdirectory.) */
1154 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1155 input_flags
.sysrooted
= 0;
1156 ret
= new_afile (sysrooted_name
, file_type
, target
, TRUE
);
1157 input_flags
.sysrooted
= outer_sysrooted
;
1161 return new_afile (name
, file_type
, target
, TRUE
);
1164 struct out_section_hash_entry
1166 struct bfd_hash_entry root
;
1167 lang_statement_union_type s
;
1170 /* The hash table. */
1172 static struct bfd_hash_table output_section_statement_table
;
1174 /* Support routines for the hash table used by lang_output_section_find,
1175 initialize the table, fill in an entry and remove the table. */
1177 static struct bfd_hash_entry
*
1178 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1179 struct bfd_hash_table
*table
,
1182 lang_output_section_statement_type
**nextp
;
1183 struct out_section_hash_entry
*ret
;
1187 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1193 entry
= bfd_hash_newfunc (entry
, table
, string
);
1197 ret
= (struct out_section_hash_entry
*) entry
;
1198 memset (&ret
->s
, 0, sizeof (ret
->s
));
1199 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1200 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1201 ret
->s
.output_section_statement
.section_alignment
= -1;
1202 ret
->s
.output_section_statement
.block_value
= 1;
1203 lang_list_init (&ret
->s
.output_section_statement
.children
);
1204 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1206 /* For every output section statement added to the list, except the
1207 first one, lang_output_section_statement.tail points to the "next"
1208 field of the last element of the list. */
1209 if (lang_output_section_statement
.head
!= NULL
)
1210 ret
->s
.output_section_statement
.prev
1211 = ((lang_output_section_statement_type
*)
1212 ((char *) lang_output_section_statement
.tail
1213 - offsetof (lang_output_section_statement_type
, next
)));
1215 /* GCC's strict aliasing rules prevent us from just casting the
1216 address, so we store the pointer in a variable and cast that
1218 nextp
= &ret
->s
.output_section_statement
.next
;
1219 lang_statement_append (&lang_output_section_statement
,
1221 (lang_statement_union_type
**) nextp
);
1226 output_section_statement_table_init (void)
1228 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1229 output_section_statement_newfunc
,
1230 sizeof (struct out_section_hash_entry
),
1232 einfo (_("%P%F: can not create hash table: %E\n"));
1236 output_section_statement_table_free (void)
1238 bfd_hash_table_free (&output_section_statement_table
);
1241 /* Build enough state so that the parser can build its tree. */
1246 obstack_begin (&stat_obstack
, 1000);
1248 stat_ptr
= &statement_list
;
1250 output_section_statement_table_init ();
1252 lang_list_init (stat_ptr
);
1254 lang_list_init (&input_file_chain
);
1255 lang_list_init (&lang_output_section_statement
);
1256 lang_list_init (&file_chain
);
1257 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1259 abs_output_section
=
1260 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1262 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1264 asneeded_list_head
= NULL
;
1265 asneeded_list_tail
= &asneeded_list_head
;
1271 output_section_statement_table_free ();
1274 /*----------------------------------------------------------------------
1275 A region is an area of memory declared with the
1276 MEMORY { name:org=exp, len=exp ... }
1279 We maintain a list of all the regions here.
1281 If no regions are specified in the script, then the default is used
1282 which is created when looked up to be the entire data space.
1284 If create is true we are creating a region inside a MEMORY block.
1285 In this case it is probably an error to create a region that has
1286 already been created. If we are not inside a MEMORY block it is
1287 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1288 and so we issue a warning.
1290 Each region has at least one name. The first name is either
1291 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1292 alias names to an existing region within a script with
1293 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1296 static lang_memory_region_type
*lang_memory_region_list
;
1297 static lang_memory_region_type
**lang_memory_region_list_tail
1298 = &lang_memory_region_list
;
1300 lang_memory_region_type
*
1301 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1303 lang_memory_region_name
*n
;
1304 lang_memory_region_type
*r
;
1305 lang_memory_region_type
*new_region
;
1307 /* NAME is NULL for LMA memspecs if no region was specified. */
1311 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1312 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1313 if (strcmp (n
->name
, name
) == 0)
1316 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1321 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1322 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1325 new_region
= (lang_memory_region_type
*)
1326 stat_alloc (sizeof (lang_memory_region_type
));
1328 new_region
->name_list
.name
= xstrdup (name
);
1329 new_region
->name_list
.next
= NULL
;
1330 new_region
->next
= NULL
;
1331 new_region
->origin_exp
= NULL
;
1332 new_region
->origin
= 0;
1333 new_region
->length_exp
= NULL
;
1334 new_region
->length
= ~(bfd_size_type
) 0;
1335 new_region
->current
= 0;
1336 new_region
->last_os
= NULL
;
1337 new_region
->flags
= 0;
1338 new_region
->not_flags
= 0;
1339 new_region
->had_full_message
= FALSE
;
1341 *lang_memory_region_list_tail
= new_region
;
1342 lang_memory_region_list_tail
= &new_region
->next
;
1348 lang_memory_region_alias (const char *alias
, const char *region_name
)
1350 lang_memory_region_name
*n
;
1351 lang_memory_region_type
*r
;
1352 lang_memory_region_type
*region
;
1354 /* The default region must be unique. This ensures that it is not necessary
1355 to iterate through the name list if someone wants the check if a region is
1356 the default memory region. */
1357 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1358 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1359 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL
);
1361 /* Look for the target region and check if the alias is not already
1364 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1365 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1367 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1369 if (strcmp (n
->name
, alias
) == 0)
1370 einfo (_("%F%P:%S: error: redefinition of memory region "
1375 /* Check if the target region exists. */
1377 einfo (_("%F%P:%S: error: memory region `%s' "
1378 "for alias `%s' does not exist\n"),
1379 NULL
, region_name
, alias
);
1381 /* Add alias to region name list. */
1382 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1383 n
->name
= xstrdup (alias
);
1384 n
->next
= region
->name_list
.next
;
1385 region
->name_list
.next
= n
;
1388 static lang_memory_region_type
*
1389 lang_memory_default (asection
*section
)
1391 lang_memory_region_type
*p
;
1393 flagword sec_flags
= section
->flags
;
1395 /* Override SEC_DATA to mean a writable section. */
1396 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1397 sec_flags
|= SEC_DATA
;
1399 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1401 if ((p
->flags
& sec_flags
) != 0
1402 && (p
->not_flags
& sec_flags
) == 0)
1407 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1410 /* Get the output section statement directly from the userdata. */
1412 lang_output_section_statement_type
*
1413 lang_output_section_get (const asection
*output_section
)
1415 return get_userdata (output_section
);
1418 /* Find or create an output_section_statement with the given NAME.
1419 If CONSTRAINT is non-zero match one with that constraint, otherwise
1420 match any non-negative constraint. If CREATE, always make a
1421 new output_section_statement for SPECIAL CONSTRAINT. */
1423 lang_output_section_statement_type
*
1424 lang_output_section_statement_lookup (const char *name
,
1428 struct out_section_hash_entry
*entry
;
1430 entry
= ((struct out_section_hash_entry
*)
1431 bfd_hash_lookup (&output_section_statement_table
, name
,
1436 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1440 if (entry
->s
.output_section_statement
.name
!= NULL
)
1442 /* We have a section of this name, but it might not have the correct
1444 struct out_section_hash_entry
*last_ent
;
1446 name
= entry
->s
.output_section_statement
.name
;
1447 if (create
&& constraint
== SPECIAL
)
1448 /* Not traversing to the end reverses the order of the second
1449 and subsequent SPECIAL sections in the hash table chain,
1450 but that shouldn't matter. */
1455 if (constraint
== entry
->s
.output_section_statement
.constraint
1457 && entry
->s
.output_section_statement
.constraint
>= 0))
1458 return &entry
->s
.output_section_statement
;
1460 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1462 while (entry
!= NULL
1463 && name
== entry
->s
.output_section_statement
.name
);
1469 = ((struct out_section_hash_entry
*)
1470 output_section_statement_newfunc (NULL
,
1471 &output_section_statement_table
,
1475 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1478 entry
->root
= last_ent
->root
;
1479 last_ent
->root
.next
= &entry
->root
;
1482 entry
->s
.output_section_statement
.name
= name
;
1483 entry
->s
.output_section_statement
.constraint
= constraint
;
1484 return &entry
->s
.output_section_statement
;
1487 /* Find the next output_section_statement with the same name as OS.
1488 If CONSTRAINT is non-zero, find one with that constraint otherwise
1489 match any non-negative constraint. */
1491 lang_output_section_statement_type
*
1492 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1495 /* All output_section_statements are actually part of a
1496 struct out_section_hash_entry. */
1497 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1499 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1500 const char *name
= os
->name
;
1502 ASSERT (name
== entry
->root
.string
);
1505 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1507 || name
!= entry
->s
.output_section_statement
.name
)
1510 while (constraint
!= entry
->s
.output_section_statement
.constraint
1512 || entry
->s
.output_section_statement
.constraint
< 0));
1514 return &entry
->s
.output_section_statement
;
1517 /* A variant of lang_output_section_find used by place_orphan.
1518 Returns the output statement that should precede a new output
1519 statement for SEC. If an exact match is found on certain flags,
1522 lang_output_section_statement_type
*
1523 lang_output_section_find_by_flags (const asection
*sec
,
1525 lang_output_section_statement_type
**exact
,
1526 lang_match_sec_type_func match_type
)
1528 lang_output_section_statement_type
*first
, *look
, *found
;
1529 flagword look_flags
, differ
;
1531 /* We know the first statement on this list is *ABS*. May as well
1533 first
= &lang_output_section_statement
.head
->output_section_statement
;
1534 first
= first
->next
;
1536 /* First try for an exact match. */
1538 for (look
= first
; look
; look
= look
->next
)
1540 look_flags
= look
->flags
;
1541 if (look
->bfd_section
!= NULL
)
1543 look_flags
= look
->bfd_section
->flags
;
1544 if (match_type
&& !match_type (link_info
.output_bfd
,
1549 differ
= look_flags
^ sec_flags
;
1550 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1551 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1561 if ((sec_flags
& SEC_CODE
) != 0
1562 && (sec_flags
& SEC_ALLOC
) != 0)
1564 /* Try for a rw code section. */
1565 for (look
= first
; look
; look
= look
->next
)
1567 look_flags
= look
->flags
;
1568 if (look
->bfd_section
!= NULL
)
1570 look_flags
= look
->bfd_section
->flags
;
1571 if (match_type
&& !match_type (link_info
.output_bfd
,
1576 differ
= look_flags
^ sec_flags
;
1577 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1578 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1582 else if ((sec_flags
& SEC_READONLY
) != 0
1583 && (sec_flags
& SEC_ALLOC
) != 0)
1585 /* .rodata can go after .text, .sdata2 after .rodata. */
1586 for (look
= first
; look
; look
= look
->next
)
1588 look_flags
= look
->flags
;
1589 if (look
->bfd_section
!= NULL
)
1591 look_flags
= look
->bfd_section
->flags
;
1592 if (match_type
&& !match_type (link_info
.output_bfd
,
1597 differ
= look_flags
^ sec_flags
;
1598 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1599 | SEC_READONLY
| SEC_SMALL_DATA
))
1600 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1602 && !(look_flags
& SEC_SMALL_DATA
)))
1606 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1607 && (sec_flags
& SEC_ALLOC
) != 0)
1609 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1610 as if it were a loaded section, and don't use match_type. */
1611 bfd_boolean seen_thread_local
= FALSE
;
1614 for (look
= first
; look
; look
= look
->next
)
1616 look_flags
= look
->flags
;
1617 if (look
->bfd_section
!= NULL
)
1618 look_flags
= look
->bfd_section
->flags
;
1620 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1621 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1623 /* .tdata and .tbss must be adjacent and in that order. */
1624 if (!(look_flags
& SEC_LOAD
)
1625 && (sec_flags
& SEC_LOAD
))
1626 /* ..so if we're at a .tbss section and we're placing
1627 a .tdata section stop looking and return the
1628 previous section. */
1631 seen_thread_local
= TRUE
;
1633 else if (seen_thread_local
)
1635 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1639 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1640 && (sec_flags
& SEC_ALLOC
) != 0)
1642 /* .sdata goes after .data, .sbss after .sdata. */
1643 for (look
= first
; look
; look
= look
->next
)
1645 look_flags
= look
->flags
;
1646 if (look
->bfd_section
!= NULL
)
1648 look_flags
= look
->bfd_section
->flags
;
1649 if (match_type
&& !match_type (link_info
.output_bfd
,
1654 differ
= look_flags
^ sec_flags
;
1655 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1656 | SEC_THREAD_LOCAL
))
1657 || ((look_flags
& SEC_SMALL_DATA
)
1658 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1662 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1663 && (sec_flags
& SEC_ALLOC
) != 0)
1665 /* .data goes after .rodata. */
1666 for (look
= first
; look
; look
= look
->next
)
1668 look_flags
= look
->flags
;
1669 if (look
->bfd_section
!= NULL
)
1671 look_flags
= look
->bfd_section
->flags
;
1672 if (match_type
&& !match_type (link_info
.output_bfd
,
1677 differ
= look_flags
^ sec_flags
;
1678 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1679 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1683 else if ((sec_flags
& SEC_ALLOC
) != 0)
1685 /* .bss goes after any other alloc section. */
1686 for (look
= first
; look
; look
= look
->next
)
1688 look_flags
= look
->flags
;
1689 if (look
->bfd_section
!= NULL
)
1691 look_flags
= look
->bfd_section
->flags
;
1692 if (match_type
&& !match_type (link_info
.output_bfd
,
1697 differ
= look_flags
^ sec_flags
;
1698 if (!(differ
& SEC_ALLOC
))
1704 /* non-alloc go last. */
1705 for (look
= first
; look
; look
= look
->next
)
1707 look_flags
= look
->flags
;
1708 if (look
->bfd_section
!= NULL
)
1709 look_flags
= look
->bfd_section
->flags
;
1710 differ
= look_flags
^ sec_flags
;
1711 if (!(differ
& SEC_DEBUGGING
))
1717 if (found
|| !match_type
)
1720 return lang_output_section_find_by_flags (sec
, sec_flags
, NULL
, NULL
);
1723 /* Find the last output section before given output statement.
1724 Used by place_orphan. */
1727 output_prev_sec_find (lang_output_section_statement_type
*os
)
1729 lang_output_section_statement_type
*lookup
;
1731 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1733 if (lookup
->constraint
< 0)
1736 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1737 return lookup
->bfd_section
;
1743 /* Look for a suitable place for a new output section statement. The
1744 idea is to skip over anything that might be inside a SECTIONS {}
1745 statement in a script, before we find another output section
1746 statement. Assignments to "dot" before an output section statement
1747 are assumed to belong to it, except in two cases; The first
1748 assignment to dot, and assignments before non-alloc sections.
1749 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1750 similar assignments that set the initial address, or we might
1751 insert non-alloc note sections among assignments setting end of
1754 static lang_statement_union_type
**
1755 insert_os_after (lang_output_section_statement_type
*after
)
1757 lang_statement_union_type
**where
;
1758 lang_statement_union_type
**assign
= NULL
;
1759 bfd_boolean ignore_first
;
1762 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1764 for (where
= &after
->header
.next
;
1766 where
= &(*where
)->header
.next
)
1768 switch ((*where
)->header
.type
)
1770 case lang_assignment_statement_enum
:
1773 lang_assignment_statement_type
*ass
;
1775 ass
= &(*where
)->assignment_statement
;
1776 if (ass
->exp
->type
.node_class
!= etree_assert
1777 && ass
->exp
->assign
.dst
[0] == '.'
1778 && ass
->exp
->assign
.dst
[1] == 0
1782 ignore_first
= FALSE
;
1784 case lang_wild_statement_enum
:
1785 case lang_input_section_enum
:
1786 case lang_object_symbols_statement_enum
:
1787 case lang_fill_statement_enum
:
1788 case lang_data_statement_enum
:
1789 case lang_reloc_statement_enum
:
1790 case lang_padding_statement_enum
:
1791 case lang_constructors_statement_enum
:
1794 case lang_output_section_statement_enum
:
1797 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1800 || s
->map_head
.s
== NULL
1801 || (s
->flags
& SEC_ALLOC
) != 0)
1805 case lang_input_statement_enum
:
1806 case lang_address_statement_enum
:
1807 case lang_target_statement_enum
:
1808 case lang_output_statement_enum
:
1809 case lang_group_statement_enum
:
1810 case lang_insert_statement_enum
:
1819 lang_output_section_statement_type
*
1820 lang_insert_orphan (asection
*s
,
1821 const char *secname
,
1823 lang_output_section_statement_type
*after
,
1824 struct orphan_save
*place
,
1825 etree_type
*address
,
1826 lang_statement_list_type
*add_child
)
1828 lang_statement_list_type add
;
1830 lang_assignment_statement_type
*start_assign
;
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);
1853 start_assign
= NULL
;
1854 if (config
.build_constructors
&& *os_tail
== os
)
1856 /* If the name of the section is representable in C, then create
1857 symbols to mark the start and the end of the section. */
1858 for (ps
= secname
; *ps
!= '\0'; ps
++)
1859 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1865 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1866 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1867 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1869 = lang_add_assignment (exp_provide (symname
,
1870 exp_nameop (NAME
, "."),
1875 if (add_child
== NULL
)
1876 add_child
= &os
->children
;
1877 lang_add_section (add_child
, s
, NULL
, os
);
1879 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1881 const char *region
= (after
->region
1882 ? after
->region
->name_list
.name
1883 : DEFAULT_MEMORY_REGION
);
1884 const char *lma_region
= (after
->lma_region
1885 ? after
->lma_region
->name_list
.name
1887 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1891 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1894 if (start_assign
!= NULL
)
1897 lang_assignment_statement_type
*stop_assign
;
1900 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1901 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1902 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1904 = lang_add_assignment (exp_provide (symname
,
1905 exp_nameop (NAME
, "."),
1907 /* Evaluate the expression to define the symbol if referenced,
1908 before sizing dynamic sections. */
1909 dot
= os
->bfd_section
->vma
;
1910 exp_fold_tree (start_assign
->exp
, os
->bfd_section
, &dot
);
1911 dot
+= TO_ADDR (s
->size
);
1912 exp_fold_tree (stop_assign
->exp
, os
->bfd_section
, &dot
);
1915 /* Restore the global list pointer. */
1919 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1921 asection
*snew
, *as
;
1923 snew
= os
->bfd_section
;
1925 /* Shuffle the bfd section list to make the output file look
1926 neater. This is really only cosmetic. */
1927 if (place
->section
== NULL
1928 && after
!= (&lang_output_section_statement
.head
1929 ->output_section_statement
))
1931 asection
*bfd_section
= after
->bfd_section
;
1933 /* If the output statement hasn't been used to place any input
1934 sections (and thus doesn't have an output bfd_section),
1935 look for the closest prior output statement having an
1937 if (bfd_section
== NULL
)
1938 bfd_section
= output_prev_sec_find (after
);
1940 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1941 place
->section
= &bfd_section
->next
;
1944 if (place
->section
== NULL
)
1945 place
->section
= &link_info
.output_bfd
->sections
;
1947 as
= *place
->section
;
1951 /* Put the section at the end of the list. */
1953 /* Unlink the section. */
1954 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1956 /* Now tack it back on in the right place. */
1957 bfd_section_list_append (link_info
.output_bfd
, snew
);
1959 else if (as
!= snew
&& as
->prev
!= snew
)
1961 /* Unlink the section. */
1962 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1964 /* Now tack it back on in the right place. */
1965 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1968 /* Save the end of this list. Further ophans of this type will
1969 follow the one we've just added. */
1970 place
->section
= &snew
->next
;
1972 /* The following is non-cosmetic. We try to put the output
1973 statements in some sort of reasonable order here, because they
1974 determine the final load addresses of the orphan sections.
1975 In addition, placing output statements in the wrong order may
1976 require extra segments. For instance, given a typical
1977 situation of all read-only sections placed in one segment and
1978 following that a segment containing all the read-write
1979 sections, we wouldn't want to place an orphan read/write
1980 section before or amongst the read-only ones. */
1981 if (add
.head
!= NULL
)
1983 lang_output_section_statement_type
*newly_added_os
;
1985 if (place
->stmt
== NULL
)
1987 lang_statement_union_type
**where
= insert_os_after (after
);
1992 place
->os_tail
= &after
->next
;
1996 /* Put it after the last orphan statement we added. */
1997 *add
.tail
= *place
->stmt
;
1998 *place
->stmt
= add
.head
;
2001 /* Fix the global list pointer if we happened to tack our
2002 new list at the tail. */
2003 if (*stat_ptr
->tail
== add
.head
)
2004 stat_ptr
->tail
= add
.tail
;
2006 /* Save the end of this list. */
2007 place
->stmt
= add
.tail
;
2009 /* Do the same for the list of output section statements. */
2010 newly_added_os
= *os_tail
;
2012 newly_added_os
->prev
= (lang_output_section_statement_type
*)
2013 ((char *) place
->os_tail
2014 - offsetof (lang_output_section_statement_type
, next
));
2015 newly_added_os
->next
= *place
->os_tail
;
2016 if (newly_added_os
->next
!= NULL
)
2017 newly_added_os
->next
->prev
= newly_added_os
;
2018 *place
->os_tail
= newly_added_os
;
2019 place
->os_tail
= &newly_added_os
->next
;
2021 /* Fixing the global list pointer here is a little different.
2022 We added to the list in lang_enter_output_section_statement,
2023 trimmed off the new output_section_statment above when
2024 assigning *os_tail = NULL, but possibly added it back in
2025 the same place when assigning *place->os_tail. */
2026 if (*os_tail
== NULL
)
2027 lang_output_section_statement
.tail
2028 = (lang_statement_union_type
**) os_tail
;
2035 lang_print_asneeded (void)
2037 struct asneeded_minfo
*m
;
2039 if (asneeded_list_head
== NULL
)
2042 minfo (_("\nAs-needed library included to satisfy reference by file (symbol)\n\n"));
2044 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2048 minfo ("%s", m
->soname
);
2049 len
= strlen (m
->soname
);
2063 minfo ("%B ", m
->ref
);
2064 minfo ("(%T)\n", m
->name
);
2069 lang_map_flags (flagword flag
)
2071 if (flag
& SEC_ALLOC
)
2074 if (flag
& SEC_CODE
)
2077 if (flag
& SEC_READONLY
)
2080 if (flag
& SEC_DATA
)
2083 if (flag
& SEC_LOAD
)
2090 lang_memory_region_type
*m
;
2091 bfd_boolean dis_header_printed
= FALSE
;
2093 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2097 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2098 || file
->flags
.just_syms
)
2101 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2102 if ((s
->output_section
== NULL
2103 || s
->output_section
->owner
!= link_info
.output_bfd
)
2104 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2106 if (!dis_header_printed
)
2108 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2109 dis_header_printed
= TRUE
;
2112 print_input_section (s
, TRUE
);
2116 minfo (_("\nMemory Configuration\n\n"));
2117 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2118 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2120 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2125 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2127 sprintf_vma (buf
, m
->origin
);
2128 minfo ("0x%s ", buf
);
2136 minfo ("0x%V", m
->length
);
2137 if (m
->flags
|| m
->not_flags
)
2145 lang_map_flags (m
->flags
);
2151 lang_map_flags (m
->not_flags
);
2158 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2160 if (!link_info
.reduce_memory_overheads
)
2162 obstack_begin (&map_obstack
, 1000);
2163 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2165 lang_statement_iteration
++;
2166 print_statements ();
2168 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
,
2173 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2174 void *info ATTRIBUTE_UNUSED
)
2176 if ((hash_entry
->type
== bfd_link_hash_defined
2177 || hash_entry
->type
== bfd_link_hash_defweak
)
2178 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2179 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2181 input_section_userdata_type
*ud
;
2182 struct map_symbol_def
*def
;
2184 ud
= ((input_section_userdata_type
*)
2185 get_userdata (hash_entry
->u
.def
.section
));
2188 ud
= (input_section_userdata_type
*) stat_alloc (sizeof (*ud
));
2189 get_userdata (hash_entry
->u
.def
.section
) = ud
;
2190 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2191 ud
->map_symbol_def_count
= 0;
2193 else if (!ud
->map_symbol_def_tail
)
2194 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2196 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2197 def
->entry
= hash_entry
;
2198 *(ud
->map_symbol_def_tail
) = def
;
2199 ud
->map_symbol_def_tail
= &def
->next
;
2200 ud
->map_symbol_def_count
++;
2205 /* Initialize an output section. */
2208 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2210 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2211 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2213 if (s
->constraint
!= SPECIAL
)
2214 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2215 if (s
->bfd_section
== NULL
)
2216 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2218 if (s
->bfd_section
== NULL
)
2220 einfo (_("%P%F: output format %s cannot represent section"
2221 " called %s: %E\n"),
2222 link_info
.output_bfd
->xvec
->name
, s
->name
);
2224 s
->bfd_section
->output_section
= s
->bfd_section
;
2225 s
->bfd_section
->output_offset
= 0;
2227 /* Set the userdata of the output section to the output section
2228 statement to avoid lookup. */
2229 get_userdata (s
->bfd_section
) = s
;
2231 /* If there is a base address, make sure that any sections it might
2232 mention are initialized. */
2233 if (s
->addr_tree
!= NULL
)
2234 exp_init_os (s
->addr_tree
);
2236 if (s
->load_base
!= NULL
)
2237 exp_init_os (s
->load_base
);
2239 /* If supplied an alignment, set it. */
2240 if (s
->section_alignment
!= -1)
2241 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2244 /* Make sure that all output sections mentioned in an expression are
2248 exp_init_os (etree_type
*exp
)
2250 switch (exp
->type
.node_class
)
2254 exp_init_os (exp
->assign
.src
);
2258 exp_init_os (exp
->binary
.lhs
);
2259 exp_init_os (exp
->binary
.rhs
);
2263 exp_init_os (exp
->trinary
.cond
);
2264 exp_init_os (exp
->trinary
.lhs
);
2265 exp_init_os (exp
->trinary
.rhs
);
2269 exp_init_os (exp
->assert_s
.child
);
2273 exp_init_os (exp
->unary
.child
);
2277 switch (exp
->type
.node_code
)
2283 lang_output_section_statement_type
*os
;
2285 os
= lang_output_section_find (exp
->name
.name
);
2286 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2298 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2300 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2302 /* If we are only reading symbols from this object, then we want to
2303 discard all sections. */
2304 if (entry
->flags
.just_syms
)
2306 bfd_link_just_syms (abfd
, sec
, &link_info
);
2310 /* Deal with SHF_EXCLUDE ELF sections. */
2311 if (!bfd_link_relocatable (&link_info
)
2312 && (abfd
->flags
& BFD_PLUGIN
) == 0
2313 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2314 sec
->output_section
= bfd_abs_section_ptr
;
2316 if (!(abfd
->flags
& DYNAMIC
))
2317 bfd_section_already_linked (abfd
, sec
, &link_info
);
2320 /* The wild routines.
2322 These expand statements like *(.text) and foo.o to a list of
2323 explicit actions, like foo.o(.text), bar.o(.text) and
2324 foo.o(.text, .data). */
2326 /* Add SECTION to the output section OUTPUT. Do this by creating a
2327 lang_input_section statement which is placed at PTR. */
2330 lang_add_section (lang_statement_list_type
*ptr
,
2332 struct flag_info
*sflag_info
,
2333 lang_output_section_statement_type
*output
)
2335 flagword flags
= section
->flags
;
2337 bfd_boolean discard
;
2338 lang_input_section_type
*new_section
;
2339 bfd
*abfd
= link_info
.output_bfd
;
2341 /* Discard sections marked with SEC_EXCLUDE. */
2342 discard
= (flags
& SEC_EXCLUDE
) != 0;
2344 /* Discard input sections which are assigned to a section named
2345 DISCARD_SECTION_NAME. */
2346 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2349 /* Discard debugging sections if we are stripping debugging
2351 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2352 && (flags
& SEC_DEBUGGING
) != 0)
2357 if (section
->output_section
== NULL
)
2359 /* This prevents future calls from assigning this section. */
2360 section
->output_section
= bfd_abs_section_ptr
;
2369 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2374 if (section
->output_section
!= NULL
)
2377 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2378 to an output section, because we want to be able to include a
2379 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2380 section (I don't know why we want to do this, but we do).
2381 build_link_order in ldwrite.c handles this case by turning
2382 the embedded SEC_NEVER_LOAD section into a fill. */
2383 flags
&= ~ SEC_NEVER_LOAD
;
2385 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2386 already been processed. One reason to do this is that on pe
2387 format targets, .text$foo sections go into .text and it's odd
2388 to see .text with SEC_LINK_ONCE set. */
2390 if (!bfd_link_relocatable (&link_info
))
2391 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2393 switch (output
->sectype
)
2395 case normal_section
:
2396 case overlay_section
:
2398 case noalloc_section
:
2399 flags
&= ~SEC_ALLOC
;
2401 case noload_section
:
2403 flags
|= SEC_NEVER_LOAD
;
2404 /* Unfortunately GNU ld has managed to evolve two different
2405 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2406 alloc, no contents section. All others get a noload, noalloc
2408 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2409 flags
&= ~SEC_HAS_CONTENTS
;
2411 flags
&= ~SEC_ALLOC
;
2415 if (output
->bfd_section
== NULL
)
2416 init_os (output
, flags
);
2418 /* If SEC_READONLY is not set in the input section, then clear
2419 it from the output section. */
2420 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2422 if (output
->bfd_section
->linker_has_input
)
2424 /* Only set SEC_READONLY flag on the first input section. */
2425 flags
&= ~ SEC_READONLY
;
2427 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2428 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2429 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2430 || ((flags
& SEC_MERGE
) != 0
2431 && output
->bfd_section
->entsize
!= section
->entsize
))
2433 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2434 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2437 output
->bfd_section
->flags
|= flags
;
2439 if (!output
->bfd_section
->linker_has_input
)
2441 output
->bfd_section
->linker_has_input
= 1;
2442 /* This must happen after flags have been updated. The output
2443 section may have been created before we saw its first input
2444 section, eg. for a data statement. */
2445 bfd_init_private_section_data (section
->owner
, section
,
2446 link_info
.output_bfd
,
2447 output
->bfd_section
,
2449 if ((flags
& SEC_MERGE
) != 0)
2450 output
->bfd_section
->entsize
= section
->entsize
;
2453 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2454 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2456 /* FIXME: This value should really be obtained from the bfd... */
2457 output
->block_value
= 128;
2460 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2461 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2463 section
->output_section
= output
->bfd_section
;
2465 if (!map_head_is_link_order
)
2467 asection
*s
= output
->bfd_section
->map_tail
.s
;
2468 output
->bfd_section
->map_tail
.s
= section
;
2469 section
->map_head
.s
= NULL
;
2470 section
->map_tail
.s
= s
;
2472 s
->map_head
.s
= section
;
2474 output
->bfd_section
->map_head
.s
= section
;
2477 /* Add a section reference to the list. */
2478 new_section
= new_stat (lang_input_section
, ptr
);
2479 new_section
->section
= section
;
2482 /* Handle wildcard sorting. This returns the lang_input_section which
2483 should follow the one we are going to create for SECTION and FILE,
2484 based on the sorting requirements of WILD. It returns NULL if the
2485 new section should just go at the end of the current list. */
2487 static lang_statement_union_type
*
2488 wild_sort (lang_wild_statement_type
*wild
,
2489 struct wildcard_list
*sec
,
2490 lang_input_statement_type
*file
,
2493 lang_statement_union_type
*l
;
2495 if (!wild
->filenames_sorted
2496 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2499 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2501 lang_input_section_type
*ls
;
2503 if (l
->header
.type
!= lang_input_section_enum
)
2505 ls
= &l
->input_section
;
2507 /* Sorting by filename takes precedence over sorting by section
2510 if (wild
->filenames_sorted
)
2512 const char *fn
, *ln
;
2516 /* The PE support for the .idata section as generated by
2517 dlltool assumes that files will be sorted by the name of
2518 the archive and then the name of the file within the
2521 if (file
->the_bfd
!= NULL
2522 && file
->the_bfd
->my_archive
!= NULL
)
2524 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2529 fn
= file
->filename
;
2533 if (ls
->section
->owner
->my_archive
!= NULL
)
2535 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2540 ln
= ls
->section
->owner
->filename
;
2544 i
= filename_cmp (fn
, ln
);
2553 fn
= file
->filename
;
2555 ln
= ls
->section
->owner
->filename
;
2557 i
= filename_cmp (fn
, ln
);
2565 /* Here either the files are not sorted by name, or we are
2566 looking at the sections for this file. */
2569 && sec
->spec
.sorted
!= none
2570 && sec
->spec
.sorted
!= by_none
)
2571 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2578 /* Expand a wild statement for a particular FILE. SECTION may be
2579 NULL, in which case it is a wild card. */
2582 output_section_callback (lang_wild_statement_type
*ptr
,
2583 struct wildcard_list
*sec
,
2585 struct flag_info
*sflag_info
,
2586 lang_input_statement_type
*file
,
2589 lang_statement_union_type
*before
;
2590 lang_output_section_statement_type
*os
;
2592 os
= (lang_output_section_statement_type
*) output
;
2594 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2595 if (unique_section_p (section
, os
))
2598 before
= wild_sort (ptr
, sec
, file
, section
);
2600 /* Here BEFORE points to the lang_input_section which
2601 should follow the one we are about to add. If BEFORE
2602 is NULL, then the section should just go at the end
2603 of the current list. */
2606 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2609 lang_statement_list_type list
;
2610 lang_statement_union_type
**pp
;
2612 lang_list_init (&list
);
2613 lang_add_section (&list
, section
, sflag_info
, os
);
2615 /* If we are discarding the section, LIST.HEAD will
2617 if (list
.head
!= NULL
)
2619 ASSERT (list
.head
->header
.next
== NULL
);
2621 for (pp
= &ptr
->children
.head
;
2623 pp
= &(*pp
)->header
.next
)
2624 ASSERT (*pp
!= NULL
);
2626 list
.head
->header
.next
= *pp
;
2632 /* Check if all sections in a wild statement for a particular FILE
2636 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2637 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2639 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2640 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2643 lang_output_section_statement_type
*os
;
2645 os
= (lang_output_section_statement_type
*) output
;
2647 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2648 if (unique_section_p (section
, os
))
2651 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2652 os
->all_input_readonly
= FALSE
;
2655 /* This is passed a file name which must have been seen already and
2656 added to the statement tree. We will see if it has been opened
2657 already and had its symbols read. If not then we'll read it. */
2659 static lang_input_statement_type
*
2660 lookup_name (const char *name
)
2662 lang_input_statement_type
*search
;
2664 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2666 search
= (lang_input_statement_type
*) search
->next_real_file
)
2668 /* Use the local_sym_name as the name of the file that has
2669 already been loaded as filename might have been transformed
2670 via the search directory lookup mechanism. */
2671 const char *filename
= search
->local_sym_name
;
2673 if (filename
!= NULL
2674 && filename_cmp (filename
, name
) == 0)
2679 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2680 default_target
, FALSE
);
2682 /* If we have already added this file, or this file is not real
2683 don't add this file. */
2684 if (search
->flags
.loaded
|| !search
->flags
.real
)
2687 if (!load_symbols (search
, NULL
))
2693 /* Save LIST as a list of libraries whose symbols should not be exported. */
2698 struct excluded_lib
*next
;
2700 static struct excluded_lib
*excluded_libs
;
2703 add_excluded_libs (const char *list
)
2705 const char *p
= list
, *end
;
2709 struct excluded_lib
*entry
;
2710 end
= strpbrk (p
, ",:");
2712 end
= p
+ strlen (p
);
2713 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2714 entry
->next
= excluded_libs
;
2715 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2716 memcpy (entry
->name
, p
, end
- p
);
2717 entry
->name
[end
- p
] = '\0';
2718 excluded_libs
= entry
;
2726 check_excluded_libs (bfd
*abfd
)
2728 struct excluded_lib
*lib
= excluded_libs
;
2732 int len
= strlen (lib
->name
);
2733 const char *filename
= lbasename (abfd
->filename
);
2735 if (strcmp (lib
->name
, "ALL") == 0)
2737 abfd
->no_export
= TRUE
;
2741 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2742 && (filename
[len
] == '\0'
2743 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2744 && filename
[len
+ 2] == '\0')))
2746 abfd
->no_export
= TRUE
;
2754 /* Get the symbols for an input file. */
2757 load_symbols (lang_input_statement_type
*entry
,
2758 lang_statement_list_type
*place
)
2762 if (entry
->flags
.loaded
)
2765 ldfile_open_file (entry
);
2767 /* Do not process further if the file was missing. */
2768 if (entry
->flags
.missing_file
)
2771 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
2772 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2775 struct lang_input_statement_flags save_flags
;
2778 err
= bfd_get_error ();
2780 /* See if the emulation has some special knowledge. */
2781 if (ldemul_unrecognized_file (entry
))
2784 if (err
== bfd_error_file_ambiguously_recognized
)
2788 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2789 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2790 for (p
= matching
; *p
!= NULL
; p
++)
2794 else if (err
!= bfd_error_file_not_recognized
2796 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2798 bfd_close (entry
->the_bfd
);
2799 entry
->the_bfd
= NULL
;
2801 /* Try to interpret the file as a linker script. */
2802 save_flags
= input_flags
;
2803 ldfile_open_command_file (entry
->filename
);
2805 push_stat_ptr (place
);
2806 input_flags
.add_DT_NEEDED_for_regular
2807 = entry
->flags
.add_DT_NEEDED_for_regular
;
2808 input_flags
.add_DT_NEEDED_for_dynamic
2809 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2810 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2811 input_flags
.dynamic
= entry
->flags
.dynamic
;
2813 ldfile_assumed_script
= TRUE
;
2814 parser_input
= input_script
;
2816 ldfile_assumed_script
= FALSE
;
2818 /* missing_file is sticky. sysrooted will already have been
2819 restored when seeing EOF in yyparse, but no harm to restore
2821 save_flags
.missing_file
|= input_flags
.missing_file
;
2822 input_flags
= save_flags
;
2826 entry
->flags
.loaded
= TRUE
;
2831 if (ldemul_recognized_file (entry
))
2834 /* We don't call ldlang_add_file for an archive. Instead, the
2835 add_symbols entry point will call ldlang_add_file, via the
2836 add_archive_element callback, for each element of the archive
2838 switch (bfd_get_format (entry
->the_bfd
))
2844 if (!entry
->flags
.reload
)
2845 ldlang_add_file (entry
);
2846 if (trace_files
|| verbose
)
2847 info_msg ("%I\n", entry
);
2851 check_excluded_libs (entry
->the_bfd
);
2853 if (entry
->flags
.whole_archive
)
2856 bfd_boolean loaded
= TRUE
;
2861 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2866 if (!bfd_check_format (member
, bfd_object
))
2868 einfo (_("%F%B: member %B in archive is not an object\n"),
2869 entry
->the_bfd
, member
);
2874 if (!(*link_info
.callbacks
2875 ->add_archive_element
) (&link_info
, member
,
2876 "--whole-archive", &subsbfd
))
2879 /* Potentially, the add_archive_element hook may have set a
2880 substitute BFD for us. */
2881 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2883 einfo (_("%F%B: error adding symbols: %E\n"), member
);
2888 entry
->flags
.loaded
= loaded
;
2894 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2895 entry
->flags
.loaded
= TRUE
;
2897 einfo (_("%F%B: error adding symbols: %E\n"), entry
->the_bfd
);
2899 return entry
->flags
.loaded
;
2902 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2903 may be NULL, indicating that it is a wildcard. Separate
2904 lang_input_section statements are created for each part of the
2905 expansion; they are added after the wild statement S. OUTPUT is
2906 the output section. */
2909 wild (lang_wild_statement_type
*s
,
2910 const char *target ATTRIBUTE_UNUSED
,
2911 lang_output_section_statement_type
*output
)
2913 struct wildcard_list
*sec
;
2915 if (s
->handler_data
[0]
2916 && s
->handler_data
[0]->spec
.sorted
== by_name
2917 && !s
->filenames_sorted
)
2919 lang_section_bst_type
*tree
;
2921 walk_wild (s
, output_section_callback_fast
, output
);
2926 output_section_callback_tree_to_list (s
, tree
, output
);
2931 walk_wild (s
, output_section_callback
, output
);
2933 if (default_common_section
== NULL
)
2934 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2935 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2937 /* Remember the section that common is going to in case we
2938 later get something which doesn't know where to put it. */
2939 default_common_section
= output
;
2944 /* Return TRUE iff target is the sought target. */
2947 get_target (const bfd_target
*target
, void *data
)
2949 const char *sought
= (const char *) data
;
2951 return strcmp (target
->name
, sought
) == 0;
2954 /* Like strcpy() but convert to lower case as well. */
2957 stricpy (char *dest
, char *src
)
2961 while ((c
= *src
++) != 0)
2962 *dest
++ = TOLOWER (c
);
2967 /* Remove the first occurrence of needle (if any) in haystack
2971 strcut (char *haystack
, char *needle
)
2973 haystack
= strstr (haystack
, needle
);
2979 for (src
= haystack
+ strlen (needle
); *src
;)
2980 *haystack
++ = *src
++;
2986 /* Compare two target format name strings.
2987 Return a value indicating how "similar" they are. */
2990 name_compare (char *first
, char *second
)
2996 copy1
= (char *) xmalloc (strlen (first
) + 1);
2997 copy2
= (char *) xmalloc (strlen (second
) + 1);
2999 /* Convert the names to lower case. */
3000 stricpy (copy1
, first
);
3001 stricpy (copy2
, second
);
3003 /* Remove size and endian strings from the name. */
3004 strcut (copy1
, "big");
3005 strcut (copy1
, "little");
3006 strcut (copy2
, "big");
3007 strcut (copy2
, "little");
3009 /* Return a value based on how many characters match,
3010 starting from the beginning. If both strings are
3011 the same then return 10 * their length. */
3012 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3013 if (copy1
[result
] == 0)
3025 /* Set by closest_target_match() below. */
3026 static const bfd_target
*winner
;
3028 /* Scan all the valid bfd targets looking for one that has the endianness
3029 requirement that was specified on the command line, and is the nearest
3030 match to the original output target. */
3033 closest_target_match (const bfd_target
*target
, void *data
)
3035 const bfd_target
*original
= (const bfd_target
*) data
;
3037 if (command_line
.endian
== ENDIAN_BIG
3038 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3041 if (command_line
.endian
== ENDIAN_LITTLE
3042 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3045 /* Must be the same flavour. */
3046 if (target
->flavour
!= original
->flavour
)
3049 /* Ignore generic big and little endian elf vectors. */
3050 if (strcmp (target
->name
, "elf32-big") == 0
3051 || strcmp (target
->name
, "elf64-big") == 0
3052 || strcmp (target
->name
, "elf32-little") == 0
3053 || strcmp (target
->name
, "elf64-little") == 0)
3056 /* If we have not found a potential winner yet, then record this one. */
3063 /* Oh dear, we now have two potential candidates for a successful match.
3064 Compare their names and choose the better one. */
3065 if (name_compare (target
->name
, original
->name
)
3066 > name_compare (winner
->name
, original
->name
))
3069 /* Keep on searching until wqe have checked them all. */
3073 /* Return the BFD target format of the first input file. */
3076 get_first_input_target (void)
3078 char *target
= NULL
;
3080 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3082 if (s
->header
.type
== lang_input_statement_enum
3085 ldfile_open_file (s
);
3087 if (s
->the_bfd
!= NULL
3088 && bfd_check_format (s
->the_bfd
, bfd_object
))
3090 target
= bfd_get_target (s
->the_bfd
);
3102 lang_get_output_target (void)
3106 /* Has the user told us which output format to use? */
3107 if (output_target
!= NULL
)
3108 return output_target
;
3110 /* No - has the current target been set to something other than
3112 if (current_target
!= default_target
&& current_target
!= NULL
)
3113 return current_target
;
3115 /* No - can we determine the format of the first input file? */
3116 target
= get_first_input_target ();
3120 /* Failed - use the default output target. */
3121 return default_target
;
3124 /* Open the output file. */
3127 open_output (const char *name
)
3129 output_target
= lang_get_output_target ();
3131 /* Has the user requested a particular endianness on the command
3133 if (command_line
.endian
!= ENDIAN_UNSET
)
3135 /* Get the chosen target. */
3136 const bfd_target
*target
3137 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3139 /* If the target is not supported, we cannot do anything. */
3142 enum bfd_endian desired_endian
;
3144 if (command_line
.endian
== ENDIAN_BIG
)
3145 desired_endian
= BFD_ENDIAN_BIG
;
3147 desired_endian
= BFD_ENDIAN_LITTLE
;
3149 /* See if the target has the wrong endianness. This should
3150 not happen if the linker script has provided big and
3151 little endian alternatives, but some scrips don't do
3153 if (target
->byteorder
!= desired_endian
)
3155 /* If it does, then see if the target provides
3156 an alternative with the correct endianness. */
3157 if (target
->alternative_target
!= NULL
3158 && (target
->alternative_target
->byteorder
== desired_endian
))
3159 output_target
= target
->alternative_target
->name
;
3162 /* Try to find a target as similar as possible to
3163 the default target, but which has the desired
3164 endian characteristic. */
3165 bfd_iterate_over_targets (closest_target_match
,
3168 /* Oh dear - we could not find any targets that
3169 satisfy our requirements. */
3171 einfo (_("%P: warning: could not find any targets"
3172 " that match endianness requirement\n"));
3174 output_target
= winner
->name
;
3180 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3182 if (link_info
.output_bfd
== NULL
)
3184 if (bfd_get_error () == bfd_error_invalid_target
)
3185 einfo (_("%P%F: target %s not found\n"), output_target
);
3187 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3190 delete_output_file_on_failure
= TRUE
;
3192 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3193 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3194 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3195 ldfile_output_architecture
,
3196 ldfile_output_machine
))
3197 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3199 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3200 if (link_info
.hash
== NULL
)
3201 einfo (_("%P%F: can not create hash table: %E\n"));
3203 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3207 ldlang_open_output (lang_statement_union_type
*statement
)
3209 switch (statement
->header
.type
)
3211 case lang_output_statement_enum
:
3212 ASSERT (link_info
.output_bfd
== NULL
);
3213 open_output (statement
->output_statement
.name
);
3214 ldemul_set_output_arch ();
3215 if (config
.magic_demand_paged
3216 && !bfd_link_relocatable (&link_info
))
3217 link_info
.output_bfd
->flags
|= D_PAGED
;
3219 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3220 if (config
.text_read_only
)
3221 link_info
.output_bfd
->flags
|= WP_TEXT
;
3223 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3224 if (link_info
.traditional_format
)
3225 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3227 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3230 case lang_target_statement_enum
:
3231 current_target
= statement
->target_statement
.target
;
3241 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3242 ldfile_output_machine
);
3245 while ((x
& 1) == 0)
3253 /* Open all the input files. */
3257 OPEN_BFD_NORMAL
= 0,
3261 #ifdef ENABLE_PLUGINS
3262 static lang_input_statement_type
*plugin_insert
= NULL
;
3266 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3268 for (; s
!= NULL
; s
= s
->header
.next
)
3270 switch (s
->header
.type
)
3272 case lang_constructors_statement_enum
:
3273 open_input_bfds (constructor_list
.head
, mode
);
3275 case lang_output_section_statement_enum
:
3276 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3278 case lang_wild_statement_enum
:
3279 /* Maybe we should load the file's symbols. */
3280 if ((mode
& OPEN_BFD_RESCAN
) == 0
3281 && s
->wild_statement
.filename
3282 && !wildcardp (s
->wild_statement
.filename
)
3283 && !archive_path (s
->wild_statement
.filename
))
3284 lookup_name (s
->wild_statement
.filename
);
3285 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3287 case lang_group_statement_enum
:
3289 struct bfd_link_hash_entry
*undefs
;
3291 /* We must continually search the entries in the group
3292 until no new symbols are added to the list of undefined
3297 undefs
= link_info
.hash
->undefs_tail
;
3298 open_input_bfds (s
->group_statement
.children
.head
,
3299 mode
| OPEN_BFD_FORCE
);
3301 while (undefs
!= link_info
.hash
->undefs_tail
);
3304 case lang_target_statement_enum
:
3305 current_target
= s
->target_statement
.target
;
3307 case lang_input_statement_enum
:
3308 if (s
->input_statement
.flags
.real
)
3310 lang_statement_union_type
**os_tail
;
3311 lang_statement_list_type add
;
3314 s
->input_statement
.target
= current_target
;
3316 /* If we are being called from within a group, and this
3317 is an archive which has already been searched, then
3318 force it to be researched unless the whole archive
3319 has been loaded already. Do the same for a rescan.
3320 Likewise reload --as-needed shared libs. */
3321 if (mode
!= OPEN_BFD_NORMAL
3322 #ifdef ENABLE_PLUGINS
3323 && ((mode
& OPEN_BFD_RESCAN
) == 0
3324 || plugin_insert
== NULL
)
3326 && s
->input_statement
.flags
.loaded
3327 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3328 && ((bfd_get_format (abfd
) == bfd_archive
3329 && !s
->input_statement
.flags
.whole_archive
)
3330 || (bfd_get_format (abfd
) == bfd_object
3331 && ((abfd
->flags
) & DYNAMIC
) != 0
3332 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3333 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3334 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3336 s
->input_statement
.flags
.loaded
= FALSE
;
3337 s
->input_statement
.flags
.reload
= TRUE
;
3340 os_tail
= lang_output_section_statement
.tail
;
3341 lang_list_init (&add
);
3343 if (!load_symbols (&s
->input_statement
, &add
))
3344 config
.make_executable
= FALSE
;
3346 if (add
.head
!= NULL
)
3348 /* If this was a script with output sections then
3349 tack any added statements on to the end of the
3350 list. This avoids having to reorder the output
3351 section statement list. Very likely the user
3352 forgot -T, and whatever we do here will not meet
3353 naive user expectations. */
3354 if (os_tail
!= lang_output_section_statement
.tail
)
3356 einfo (_("%P: warning: %s contains output sections;"
3357 " did you forget -T?\n"),
3358 s
->input_statement
.filename
);
3359 *stat_ptr
->tail
= add
.head
;
3360 stat_ptr
->tail
= add
.tail
;
3364 *add
.tail
= s
->header
.next
;
3365 s
->header
.next
= add
.head
;
3369 #ifdef ENABLE_PLUGINS
3370 /* If we have found the point at which a plugin added new
3371 files, clear plugin_insert to enable archive rescan. */
3372 if (&s
->input_statement
== plugin_insert
)
3373 plugin_insert
= NULL
;
3376 case lang_assignment_statement_enum
:
3377 if (s
->assignment_statement
.exp
->type
.node_class
!= etree_assert
3378 && s
->assignment_statement
.exp
->assign
.defsym
)
3379 /* This is from a --defsym on the command line. */
3380 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3387 /* Exit if any of the files were missing. */
3388 if (input_flags
.missing_file
)
3392 /* Add the supplied name to the symbol table as an undefined reference.
3393 This is a two step process as the symbol table doesn't even exist at
3394 the time the ld command line is processed. First we put the name
3395 on a list, then, once the output file has been opened, transfer the
3396 name to the symbol table. */
3398 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3400 #define ldlang_undef_chain_list_head entry_symbol.next
3403 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3405 ldlang_undef_chain_list_type
*new_undef
;
3407 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3408 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3409 new_undef
->next
= ldlang_undef_chain_list_head
;
3410 ldlang_undef_chain_list_head
= new_undef
;
3412 new_undef
->name
= xstrdup (name
);
3414 if (link_info
.output_bfd
!= NULL
)
3415 insert_undefined (new_undef
->name
);
3418 /* Insert NAME as undefined in the symbol table. */
3421 insert_undefined (const char *name
)
3423 struct bfd_link_hash_entry
*h
;
3425 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3427 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3428 if (h
->type
== bfd_link_hash_new
)
3430 h
->type
= bfd_link_hash_undefined
;
3431 h
->u
.undef
.abfd
= NULL
;
3432 bfd_link_add_undef (link_info
.hash
, h
);
3436 /* Run through the list of undefineds created above and place them
3437 into the linker hash table as undefined symbols belonging to the
3441 lang_place_undefineds (void)
3443 ldlang_undef_chain_list_type
*ptr
;
3445 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3446 insert_undefined (ptr
->name
);
3449 /* Structure used to build the list of symbols that the user has required
3452 struct require_defined_symbol
3455 struct require_defined_symbol
*next
;
3458 /* The list of symbols that the user has required be defined. */
3460 static struct require_defined_symbol
*require_defined_symbol_list
;
3462 /* Add a new symbol NAME to the list of symbols that are required to be
3466 ldlang_add_require_defined (const char *const name
)
3468 struct require_defined_symbol
*ptr
;
3470 ldlang_add_undef (name
, TRUE
);
3471 ptr
= (struct require_defined_symbol
*) stat_alloc (sizeof (*ptr
));
3472 ptr
->next
= require_defined_symbol_list
;
3473 ptr
->name
= strdup (name
);
3474 require_defined_symbol_list
= ptr
;
3477 /* Check that all symbols the user required to be defined, are defined,
3478 raise an error if we find a symbol that is not defined. */
3481 ldlang_check_require_defined_symbols (void)
3483 struct require_defined_symbol
*ptr
;
3485 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
3487 struct bfd_link_hash_entry
*h
;
3489 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
3490 FALSE
, FALSE
, TRUE
);
3492 || (h
->type
!= bfd_link_hash_defined
3493 && h
->type
!= bfd_link_hash_defweak
))
3494 einfo(_("%P%X: required symbol `%s' not defined\n"), ptr
->name
);
3498 /* Check for all readonly or some readwrite sections. */
3501 check_input_sections
3502 (lang_statement_union_type
*s
,
3503 lang_output_section_statement_type
*output_section_statement
)
3505 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3507 switch (s
->header
.type
)
3509 case lang_wild_statement_enum
:
3510 walk_wild (&s
->wild_statement
, check_section_callback
,
3511 output_section_statement
);
3512 if (!output_section_statement
->all_input_readonly
)
3515 case lang_constructors_statement_enum
:
3516 check_input_sections (constructor_list
.head
,
3517 output_section_statement
);
3518 if (!output_section_statement
->all_input_readonly
)
3521 case lang_group_statement_enum
:
3522 check_input_sections (s
->group_statement
.children
.head
,
3523 output_section_statement
);
3524 if (!output_section_statement
->all_input_readonly
)
3533 /* Update wildcard statements if needed. */
3536 update_wild_statements (lang_statement_union_type
*s
)
3538 struct wildcard_list
*sec
;
3540 switch (sort_section
)
3550 for (; s
!= NULL
; s
= s
->header
.next
)
3552 switch (s
->header
.type
)
3557 case lang_wild_statement_enum
:
3558 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3561 switch (sec
->spec
.sorted
)
3564 sec
->spec
.sorted
= sort_section
;
3567 if (sort_section
== by_alignment
)
3568 sec
->spec
.sorted
= by_name_alignment
;
3571 if (sort_section
== by_name
)
3572 sec
->spec
.sorted
= by_alignment_name
;
3580 case lang_constructors_statement_enum
:
3581 update_wild_statements (constructor_list
.head
);
3584 case lang_output_section_statement_enum
:
3585 /* Don't sort .init/.fini sections. */
3586 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3587 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3588 update_wild_statements
3589 (s
->output_section_statement
.children
.head
);
3592 case lang_group_statement_enum
:
3593 update_wild_statements (s
->group_statement
.children
.head
);
3601 /* Open input files and attach to output sections. */
3604 map_input_to_output_sections
3605 (lang_statement_union_type
*s
, const char *target
,
3606 lang_output_section_statement_type
*os
)
3608 for (; s
!= NULL
; s
= s
->header
.next
)
3610 lang_output_section_statement_type
*tos
;
3613 switch (s
->header
.type
)
3615 case lang_wild_statement_enum
:
3616 wild (&s
->wild_statement
, target
, os
);
3618 case lang_constructors_statement_enum
:
3619 map_input_to_output_sections (constructor_list
.head
,
3623 case lang_output_section_statement_enum
:
3624 tos
= &s
->output_section_statement
;
3625 if (tos
->constraint
!= 0)
3627 if (tos
->constraint
!= ONLY_IF_RW
3628 && tos
->constraint
!= ONLY_IF_RO
)
3630 tos
->all_input_readonly
= TRUE
;
3631 check_input_sections (tos
->children
.head
, tos
);
3632 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3634 tos
->constraint
= -1;
3638 map_input_to_output_sections (tos
->children
.head
,
3642 case lang_output_statement_enum
:
3644 case lang_target_statement_enum
:
3645 target
= s
->target_statement
.target
;
3647 case lang_group_statement_enum
:
3648 map_input_to_output_sections (s
->group_statement
.children
.head
,
3652 case lang_data_statement_enum
:
3653 /* Make sure that any sections mentioned in the expression
3655 exp_init_os (s
->data_statement
.exp
);
3656 /* The output section gets CONTENTS, ALLOC and LOAD, but
3657 these may be overridden by the script. */
3658 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3659 switch (os
->sectype
)
3661 case normal_section
:
3662 case overlay_section
:
3664 case noalloc_section
:
3665 flags
= SEC_HAS_CONTENTS
;
3667 case noload_section
:
3668 if (bfd_get_flavour (link_info
.output_bfd
)
3669 == bfd_target_elf_flavour
)
3670 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3672 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3675 if (os
->bfd_section
== NULL
)
3676 init_os (os
, flags
);
3678 os
->bfd_section
->flags
|= flags
;
3680 case lang_input_section_enum
:
3682 case lang_fill_statement_enum
:
3683 case lang_object_symbols_statement_enum
:
3684 case lang_reloc_statement_enum
:
3685 case lang_padding_statement_enum
:
3686 case lang_input_statement_enum
:
3687 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3690 case lang_assignment_statement_enum
:
3691 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3694 /* Make sure that any sections mentioned in the assignment
3696 exp_init_os (s
->assignment_statement
.exp
);
3698 case lang_address_statement_enum
:
3699 /* Mark the specified section with the supplied address.
3700 If this section was actually a segment marker, then the
3701 directive is ignored if the linker script explicitly
3702 processed the segment marker. Originally, the linker
3703 treated segment directives (like -Ttext on the
3704 command-line) as section directives. We honor the
3705 section directive semantics for backwards compatibility;
3706 linker scripts that do not specifically check for
3707 SEGMENT_START automatically get the old semantics. */
3708 if (!s
->address_statement
.segment
3709 || !s
->address_statement
.segment
->used
)
3711 const char *name
= s
->address_statement
.section_name
;
3713 /* Create the output section statement here so that
3714 orphans with a set address will be placed after other
3715 script sections. If we let the orphan placement code
3716 place them in amongst other sections then the address
3717 will affect following script sections, which is
3718 likely to surprise naive users. */
3719 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3720 tos
->addr_tree
= s
->address_statement
.address
;
3721 if (tos
->bfd_section
== NULL
)
3725 case lang_insert_statement_enum
:
3731 /* An insert statement snips out all the linker statements from the
3732 start of the list and places them after the output section
3733 statement specified by the insert. This operation is complicated
3734 by the fact that we keep a doubly linked list of output section
3735 statements as well as the singly linked list of all statements. */
3738 process_insert_statements (void)
3740 lang_statement_union_type
**s
;
3741 lang_output_section_statement_type
*first_os
= NULL
;
3742 lang_output_section_statement_type
*last_os
= NULL
;
3743 lang_output_section_statement_type
*os
;
3745 /* "start of list" is actually the statement immediately after
3746 the special abs_section output statement, so that it isn't
3748 s
= &lang_output_section_statement
.head
;
3749 while (*(s
= &(*s
)->header
.next
) != NULL
)
3751 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3753 /* Keep pointers to the first and last output section
3754 statement in the sequence we may be about to move. */
3755 os
= &(*s
)->output_section_statement
;
3757 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3760 /* Set constraint negative so that lang_output_section_find
3761 won't match this output section statement. At this
3762 stage in linking constraint has values in the range
3763 [-1, ONLY_IN_RW]. */
3764 last_os
->constraint
= -2 - last_os
->constraint
;
3765 if (first_os
== NULL
)
3768 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3770 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3771 lang_output_section_statement_type
*where
;
3772 lang_statement_union_type
**ptr
;
3773 lang_statement_union_type
*first
;
3775 where
= lang_output_section_find (i
->where
);
3776 if (where
!= NULL
&& i
->is_before
)
3779 where
= where
->prev
;
3780 while (where
!= NULL
&& where
->constraint
< 0);
3784 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3788 /* Deal with reordering the output section statement list. */
3789 if (last_os
!= NULL
)
3791 asection
*first_sec
, *last_sec
;
3792 struct lang_output_section_statement_struct
**next
;
3794 /* Snip out the output sections we are moving. */
3795 first_os
->prev
->next
= last_os
->next
;
3796 if (last_os
->next
== NULL
)
3798 next
= &first_os
->prev
->next
;
3799 lang_output_section_statement
.tail
3800 = (lang_statement_union_type
**) next
;
3803 last_os
->next
->prev
= first_os
->prev
;
3804 /* Add them in at the new position. */
3805 last_os
->next
= where
->next
;
3806 if (where
->next
== NULL
)
3808 next
= &last_os
->next
;
3809 lang_output_section_statement
.tail
3810 = (lang_statement_union_type
**) next
;
3813 where
->next
->prev
= last_os
;
3814 first_os
->prev
= where
;
3815 where
->next
= first_os
;
3817 /* Move the bfd sections in the same way. */
3820 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3822 os
->constraint
= -2 - os
->constraint
;
3823 if (os
->bfd_section
!= NULL
3824 && os
->bfd_section
->owner
!= NULL
)
3826 last_sec
= os
->bfd_section
;
3827 if (first_sec
== NULL
)
3828 first_sec
= last_sec
;
3833 if (last_sec
!= NULL
)
3835 asection
*sec
= where
->bfd_section
;
3837 sec
= output_prev_sec_find (where
);
3839 /* The place we want to insert must come after the
3840 sections we are moving. So if we find no
3841 section or if the section is the same as our
3842 last section, then no move is needed. */
3843 if (sec
!= NULL
&& sec
!= last_sec
)
3845 /* Trim them off. */
3846 if (first_sec
->prev
!= NULL
)
3847 first_sec
->prev
->next
= last_sec
->next
;
3849 link_info
.output_bfd
->sections
= last_sec
->next
;
3850 if (last_sec
->next
!= NULL
)
3851 last_sec
->next
->prev
= first_sec
->prev
;
3853 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3855 last_sec
->next
= sec
->next
;
3856 if (sec
->next
!= NULL
)
3857 sec
->next
->prev
= last_sec
;
3859 link_info
.output_bfd
->section_last
= last_sec
;
3860 first_sec
->prev
= sec
;
3861 sec
->next
= first_sec
;
3869 ptr
= insert_os_after (where
);
3870 /* Snip everything after the abs_section output statement we
3871 know is at the start of the list, up to and including
3872 the insert statement we are currently processing. */
3873 first
= lang_output_section_statement
.head
->header
.next
;
3874 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3875 /* Add them back where they belong. */
3878 statement_list
.tail
= s
;
3880 s
= &lang_output_section_statement
.head
;
3884 /* Undo constraint twiddling. */
3885 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3887 os
->constraint
= -2 - os
->constraint
;
3893 /* An output section might have been removed after its statement was
3894 added. For example, ldemul_before_allocation can remove dynamic
3895 sections if they turn out to be not needed. Clean them up here. */
3898 strip_excluded_output_sections (void)
3900 lang_output_section_statement_type
*os
;
3902 /* Run lang_size_sections (if not already done). */
3903 if (expld
.phase
!= lang_mark_phase_enum
)
3905 expld
.phase
= lang_mark_phase_enum
;
3906 expld
.dataseg
.phase
= exp_dataseg_none
;
3907 one_lang_size_sections_pass (NULL
, FALSE
);
3908 lang_reset_memory_regions ();
3911 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3915 asection
*output_section
;
3916 bfd_boolean exclude
;
3918 if (os
->constraint
< 0)
3921 output_section
= os
->bfd_section
;
3922 if (output_section
== NULL
)
3925 exclude
= (output_section
->rawsize
== 0
3926 && (output_section
->flags
& SEC_KEEP
) == 0
3927 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3930 /* Some sections have not yet been sized, notably .gnu.version,
3931 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3932 input sections, so don't drop output sections that have such
3933 input sections unless they are also marked SEC_EXCLUDE. */
3934 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3938 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3939 if ((s
->flags
& SEC_EXCLUDE
) == 0
3940 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3941 || link_info
.emitrelocations
))
3950 /* We don't set bfd_section to NULL since bfd_section of the
3951 removed output section statement may still be used. */
3952 if (!os
->update_dot
)
3954 output_section
->flags
|= SEC_EXCLUDE
;
3955 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3956 link_info
.output_bfd
->section_count
--;
3961 /* Called from ldwrite to clear out asection.map_head and
3962 asection.map_tail for use as link_orders in ldwrite.
3963 FIXME: Except for sh64elf.em which starts creating link_orders in
3964 its after_allocation routine so needs to call it early. */
3967 lang_clear_os_map (void)
3969 lang_output_section_statement_type
*os
;
3971 if (map_head_is_link_order
)
3974 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3978 asection
*output_section
;
3980 if (os
->constraint
< 0)
3983 output_section
= os
->bfd_section
;
3984 if (output_section
== NULL
)
3987 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3988 output_section
->map_head
.link_order
= NULL
;
3989 output_section
->map_tail
.link_order
= NULL
;
3992 /* Stop future calls to lang_add_section from messing with map_head
3993 and map_tail link_order fields. */
3994 map_head_is_link_order
= TRUE
;
3998 print_output_section_statement
3999 (lang_output_section_statement_type
*output_section_statement
)
4001 asection
*section
= output_section_statement
->bfd_section
;
4004 if (output_section_statement
!= abs_output_section
)
4006 minfo ("\n%s", output_section_statement
->name
);
4008 if (section
!= NULL
)
4010 print_dot
= section
->vma
;
4012 len
= strlen (output_section_statement
->name
);
4013 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4018 while (len
< SECTION_NAME_MAP_LENGTH
)
4024 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4026 if (section
->vma
!= section
->lma
)
4027 minfo (_(" load address 0x%V"), section
->lma
);
4029 if (output_section_statement
->update_dot_tree
!= NULL
)
4030 exp_fold_tree (output_section_statement
->update_dot_tree
,
4031 bfd_abs_section_ptr
, &print_dot
);
4037 print_statement_list (output_section_statement
->children
.head
,
4038 output_section_statement
);
4042 print_assignment (lang_assignment_statement_type
*assignment
,
4043 lang_output_section_statement_type
*output_section
)
4050 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4053 if (assignment
->exp
->type
.node_class
== etree_assert
)
4056 tree
= assignment
->exp
->assert_s
.child
;
4060 const char *dst
= assignment
->exp
->assign
.dst
;
4062 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4064 expld
.assign_name
= dst
;
4065 tree
= assignment
->exp
->assign
.src
;
4068 osec
= output_section
->bfd_section
;
4070 osec
= bfd_abs_section_ptr
;
4072 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4073 exp_fold_tree (tree
, osec
, &print_dot
);
4075 expld
.result
.valid_p
= FALSE
;
4077 if (expld
.result
.valid_p
)
4081 if (assignment
->exp
->type
.node_class
== etree_assert
4083 || expld
.assign_name
!= NULL
)
4085 value
= expld
.result
.value
;
4087 if (expld
.result
.section
!= NULL
)
4088 value
+= expld
.result
.section
->vma
;
4090 minfo ("0x%V", value
);
4096 struct bfd_link_hash_entry
*h
;
4098 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4099 FALSE
, FALSE
, TRUE
);
4102 value
= h
->u
.def
.value
;
4103 value
+= h
->u
.def
.section
->output_section
->vma
;
4104 value
+= h
->u
.def
.section
->output_offset
;
4106 minfo ("[0x%V]", value
);
4109 minfo ("[unresolved]");
4114 if (assignment
->exp
->type
.node_class
== etree_provide
)
4115 minfo ("[!provide]");
4122 expld
.assign_name
= NULL
;
4125 exp_print_tree (assignment
->exp
);
4130 print_input_statement (lang_input_statement_type
*statm
)
4132 if (statm
->filename
!= NULL
4133 && (statm
->the_bfd
== NULL
4134 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4135 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4138 /* Print all symbols defined in a particular section. This is called
4139 via bfd_link_hash_traverse, or by print_all_symbols. */
4142 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4144 asection
*sec
= (asection
*) ptr
;
4146 if ((hash_entry
->type
== bfd_link_hash_defined
4147 || hash_entry
->type
== bfd_link_hash_defweak
)
4148 && sec
== hash_entry
->u
.def
.section
)
4152 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4155 (hash_entry
->u
.def
.value
4156 + hash_entry
->u
.def
.section
->output_offset
4157 + hash_entry
->u
.def
.section
->output_section
->vma
));
4159 minfo (" %T\n", hash_entry
->root
.string
);
4166 hash_entry_addr_cmp (const void *a
, const void *b
)
4168 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4169 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4171 if (l
->u
.def
.value
< r
->u
.def
.value
)
4173 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4180 print_all_symbols (asection
*sec
)
4182 input_section_userdata_type
*ud
4183 = (input_section_userdata_type
*) get_userdata (sec
);
4184 struct map_symbol_def
*def
;
4185 struct bfd_link_hash_entry
**entries
;
4191 *ud
->map_symbol_def_tail
= 0;
4193 /* Sort the symbols by address. */
4194 entries
= (struct bfd_link_hash_entry
**)
4195 obstack_alloc (&map_obstack
,
4196 ud
->map_symbol_def_count
* sizeof (*entries
));
4198 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4199 entries
[i
] = def
->entry
;
4201 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4202 hash_entry_addr_cmp
);
4204 /* Print the symbols. */
4205 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4206 print_one_symbol (entries
[i
], sec
);
4208 obstack_free (&map_obstack
, entries
);
4211 /* Print information about an input section to the map file. */
4214 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4216 bfd_size_type size
= i
->size
;
4223 minfo ("%s", i
->name
);
4225 len
= 1 + strlen (i
->name
);
4226 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4231 while (len
< SECTION_NAME_MAP_LENGTH
)
4237 if (i
->output_section
!= NULL
4238 && i
->output_section
->owner
== link_info
.output_bfd
)
4239 addr
= i
->output_section
->vma
+ i
->output_offset
;
4247 minfo ("0x%V %W %B\n", addr
, size
, i
->owner
);
4249 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4251 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4263 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4266 if (i
->output_section
!= NULL
4267 && i
->output_section
->owner
== link_info
.output_bfd
)
4269 if (link_info
.reduce_memory_overheads
)
4270 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4272 print_all_symbols (i
);
4274 /* Update print_dot, but make sure that we do not move it
4275 backwards - this could happen if we have overlays and a
4276 later overlay is shorter than an earier one. */
4277 if (addr
+ TO_ADDR (size
) > print_dot
)
4278 print_dot
= addr
+ TO_ADDR (size
);
4283 print_fill_statement (lang_fill_statement_type
*fill
)
4287 fputs (" FILL mask 0x", config
.map_file
);
4288 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4289 fprintf (config
.map_file
, "%02x", *p
);
4290 fputs ("\n", config
.map_file
);
4294 print_data_statement (lang_data_statement_type
*data
)
4302 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4305 addr
= data
->output_offset
;
4306 if (data
->output_section
!= NULL
)
4307 addr
+= data
->output_section
->vma
;
4335 if (size
< TO_SIZE ((unsigned) 1))
4336 size
= TO_SIZE ((unsigned) 1);
4337 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4339 if (data
->exp
->type
.node_class
!= etree_value
)
4342 exp_print_tree (data
->exp
);
4347 print_dot
= addr
+ TO_ADDR (size
);
4350 /* Print an address statement. These are generated by options like
4354 print_address_statement (lang_address_statement_type
*address
)
4356 minfo (_("Address of section %s set to "), address
->section_name
);
4357 exp_print_tree (address
->address
);
4361 /* Print a reloc statement. */
4364 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4371 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4374 addr
= reloc
->output_offset
;
4375 if (reloc
->output_section
!= NULL
)
4376 addr
+= reloc
->output_section
->vma
;
4378 size
= bfd_get_reloc_size (reloc
->howto
);
4380 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4382 if (reloc
->name
!= NULL
)
4383 minfo ("%s+", reloc
->name
);
4385 minfo ("%s+", reloc
->section
->name
);
4387 exp_print_tree (reloc
->addend_exp
);
4391 print_dot
= addr
+ TO_ADDR (size
);
4395 print_padding_statement (lang_padding_statement_type
*s
)
4403 len
= sizeof " *fill*" - 1;
4404 while (len
< SECTION_NAME_MAP_LENGTH
)
4410 addr
= s
->output_offset
;
4411 if (s
->output_section
!= NULL
)
4412 addr
+= s
->output_section
->vma
;
4413 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4415 if (s
->fill
->size
!= 0)
4419 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4420 fprintf (config
.map_file
, "%02x", *p
);
4425 print_dot
= addr
+ TO_ADDR (s
->size
);
4429 print_wild_statement (lang_wild_statement_type
*w
,
4430 lang_output_section_statement_type
*os
)
4432 struct wildcard_list
*sec
;
4436 if (w
->exclude_name_list
)
4439 minfo ("EXCLUDE_FILE(%s", w
->exclude_name_list
->name
);
4440 for (tmp
= w
->exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4441 minfo (" %s", tmp
->name
);
4445 if (w
->filenames_sorted
)
4447 if (w
->filename
!= NULL
)
4448 minfo ("%s", w
->filename
);
4451 if (w
->filenames_sorted
)
4455 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4457 if (sec
->spec
.sorted
)
4459 if (sec
->spec
.exclude_name_list
!= NULL
)
4462 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4463 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4464 minfo (" %s", tmp
->name
);
4467 if (sec
->spec
.name
!= NULL
)
4468 minfo ("%s", sec
->spec
.name
);
4471 if (sec
->spec
.sorted
)
4480 print_statement_list (w
->children
.head
, os
);
4483 /* Print a group statement. */
4486 print_group (lang_group_statement_type
*s
,
4487 lang_output_section_statement_type
*os
)
4489 fprintf (config
.map_file
, "START GROUP\n");
4490 print_statement_list (s
->children
.head
, os
);
4491 fprintf (config
.map_file
, "END GROUP\n");
4494 /* Print the list of statements in S.
4495 This can be called for any statement type. */
4498 print_statement_list (lang_statement_union_type
*s
,
4499 lang_output_section_statement_type
*os
)
4503 print_statement (s
, os
);
4508 /* Print the first statement in statement list S.
4509 This can be called for any statement type. */
4512 print_statement (lang_statement_union_type
*s
,
4513 lang_output_section_statement_type
*os
)
4515 switch (s
->header
.type
)
4518 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4521 case lang_constructors_statement_enum
:
4522 if (constructor_list
.head
!= NULL
)
4524 if (constructors_sorted
)
4525 minfo (" SORT (CONSTRUCTORS)\n");
4527 minfo (" CONSTRUCTORS\n");
4528 print_statement_list (constructor_list
.head
, os
);
4531 case lang_wild_statement_enum
:
4532 print_wild_statement (&s
->wild_statement
, os
);
4534 case lang_address_statement_enum
:
4535 print_address_statement (&s
->address_statement
);
4537 case lang_object_symbols_statement_enum
:
4538 minfo (" CREATE_OBJECT_SYMBOLS\n");
4540 case lang_fill_statement_enum
:
4541 print_fill_statement (&s
->fill_statement
);
4543 case lang_data_statement_enum
:
4544 print_data_statement (&s
->data_statement
);
4546 case lang_reloc_statement_enum
:
4547 print_reloc_statement (&s
->reloc_statement
);
4549 case lang_input_section_enum
:
4550 print_input_section (s
->input_section
.section
, FALSE
);
4552 case lang_padding_statement_enum
:
4553 print_padding_statement (&s
->padding_statement
);
4555 case lang_output_section_statement_enum
:
4556 print_output_section_statement (&s
->output_section_statement
);
4558 case lang_assignment_statement_enum
:
4559 print_assignment (&s
->assignment_statement
, os
);
4561 case lang_target_statement_enum
:
4562 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4564 case lang_output_statement_enum
:
4565 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4566 if (output_target
!= NULL
)
4567 minfo (" %s", output_target
);
4570 case lang_input_statement_enum
:
4571 print_input_statement (&s
->input_statement
);
4573 case lang_group_statement_enum
:
4574 print_group (&s
->group_statement
, os
);
4576 case lang_insert_statement_enum
:
4577 minfo ("INSERT %s %s\n",
4578 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4579 s
->insert_statement
.where
);
4585 print_statements (void)
4587 print_statement_list (statement_list
.head
, abs_output_section
);
4590 /* Print the first N statements in statement list S to STDERR.
4591 If N == 0, nothing is printed.
4592 If N < 0, the entire list is printed.
4593 Intended to be called from GDB. */
4596 dprint_statement (lang_statement_union_type
*s
, int n
)
4598 FILE *map_save
= config
.map_file
;
4600 config
.map_file
= stderr
;
4603 print_statement_list (s
, abs_output_section
);
4606 while (s
&& --n
>= 0)
4608 print_statement (s
, abs_output_section
);
4613 config
.map_file
= map_save
;
4617 insert_pad (lang_statement_union_type
**ptr
,
4619 bfd_size_type alignment_needed
,
4620 asection
*output_section
,
4623 static fill_type zero_fill
;
4624 lang_statement_union_type
*pad
= NULL
;
4626 if (ptr
!= &statement_list
.head
)
4627 pad
= ((lang_statement_union_type
*)
4628 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4630 && pad
->header
.type
== lang_padding_statement_enum
4631 && pad
->padding_statement
.output_section
== output_section
)
4633 /* Use the existing pad statement. */
4635 else if ((pad
= *ptr
) != NULL
4636 && pad
->header
.type
== lang_padding_statement_enum
4637 && pad
->padding_statement
.output_section
== output_section
)
4639 /* Use the existing pad statement. */
4643 /* Make a new padding statement, linked into existing chain. */
4644 pad
= (lang_statement_union_type
*)
4645 stat_alloc (sizeof (lang_padding_statement_type
));
4646 pad
->header
.next
= *ptr
;
4648 pad
->header
.type
= lang_padding_statement_enum
;
4649 pad
->padding_statement
.output_section
= output_section
;
4652 pad
->padding_statement
.fill
= fill
;
4654 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4655 pad
->padding_statement
.size
= alignment_needed
;
4656 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4657 - output_section
->vma
);
4660 /* Work out how much this section will move the dot point. */
4664 (lang_statement_union_type
**this_ptr
,
4665 lang_output_section_statement_type
*output_section_statement
,
4669 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4670 asection
*i
= is
->section
;
4671 asection
*o
= output_section_statement
->bfd_section
;
4673 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4674 i
->output_offset
= i
->vma
- o
->vma
;
4675 else if (((i
->flags
& SEC_EXCLUDE
) != 0)
4676 || output_section_statement
->ignored
)
4677 i
->output_offset
= dot
- o
->vma
;
4680 bfd_size_type alignment_needed
;
4682 /* Align this section first to the input sections requirement,
4683 then to the output section's requirement. If this alignment
4684 is greater than any seen before, then record it too. Perform
4685 the alignment by inserting a magic 'padding' statement. */
4687 if (output_section_statement
->subsection_alignment
!= -1)
4688 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4690 if (o
->alignment_power
< i
->alignment_power
)
4691 o
->alignment_power
= i
->alignment_power
;
4693 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4695 if (alignment_needed
!= 0)
4697 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4698 dot
+= alignment_needed
;
4701 /* Remember where in the output section this input section goes. */
4702 i
->output_offset
= dot
- o
->vma
;
4704 /* Mark how big the output section must be to contain this now. */
4705 dot
+= TO_ADDR (i
->size
);
4706 o
->size
= TO_SIZE (dot
- o
->vma
);
4719 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4721 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4722 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4724 if (sec1
->lma
< sec2
->lma
)
4726 else if (sec1
->lma
> sec2
->lma
)
4728 else if (sec1
->id
< sec2
->id
)
4730 else if (sec1
->id
> sec2
->id
)
4737 sort_sections_by_vma (const void *arg1
, const void *arg2
)
4739 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4740 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4742 if (sec1
->vma
< sec2
->vma
)
4744 else if (sec1
->vma
> sec2
->vma
)
4746 else if (sec1
->id
< sec2
->id
)
4748 else if (sec1
->id
> sec2
->id
)
4754 #define IS_TBSS(s) \
4755 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4757 #define IGNORE_SECTION(s) \
4758 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4760 /* Check to see if any allocated sections overlap with other allocated
4761 sections. This can happen if a linker script specifies the output
4762 section addresses of the two sections. Also check whether any memory
4763 region has overflowed. */
4766 lang_check_section_addresses (void)
4769 struct check_sec
*sections
;
4774 bfd_vma p_start
= 0;
4776 lang_memory_region_type
*m
;
4777 bfd_boolean overlays
;
4779 /* Detect address space overflow. */
4780 addr_mask
= ((bfd_vma
) 1 <<
4781 (bfd_arch_bits_per_address (link_info
.output_bfd
) - 1)) - 1;
4782 addr_mask
= (addr_mask
<< 1) + 1;
4783 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4785 s_end
= (s
->vma
+ s
->size
) & addr_mask
;
4786 if (s_end
!= 0 && s_end
< s
->vma
)
4787 einfo (_("%X%P: section %s VMA wraps around address space\n"),
4791 s_end
= (s
->lma
+ s
->size
) & addr_mask
;
4792 if (s_end
!= 0 && s_end
< s
->lma
)
4793 einfo (_("%X%P: section %s LMA wraps around address space\n"),
4798 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4801 count
= bfd_count_sections (link_info
.output_bfd
);
4802 sections
= XNEWVEC (struct check_sec
, count
);
4804 /* Scan all sections in the output list. */
4806 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4808 if (IGNORE_SECTION (s
)
4812 sections
[count
].sec
= s
;
4813 sections
[count
].warned
= FALSE
;
4823 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
4825 /* First check section LMAs. There should be no overlap of LMAs on
4826 loadable sections, even with overlays. */
4827 for (p
= NULL
, i
= 0; i
< count
; i
++)
4829 s
= sections
[i
].sec
;
4830 if ((s
->flags
& SEC_LOAD
) != 0)
4833 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4835 /* Look for an overlap. We have sorted sections by lma, so
4836 we know that s_start >= p_start. Besides the obvious
4837 case of overlap when the current section starts before
4838 the previous one ends, we also must have overlap if the
4839 previous section wraps around the address space. */
4841 && (s_start
<= p_end
4842 || p_end
< p_start
))
4844 einfo (_("%X%P: section %s LMA [%V,%V]"
4845 " overlaps section %s LMA [%V,%V]\n"),
4846 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4847 sections
[i
].warned
= TRUE
;
4855 /* If any non-zero size allocated section (excluding tbss) starts at
4856 exactly the same VMA as another such section, then we have
4857 overlays. Overlays generated by the OVERLAY keyword will have
4858 this property. It is possible to intentionally generate overlays
4859 that fail this test, but it would be unusual. */
4860 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
4862 p_start
= sections
[0].sec
->vma
;
4863 for (i
= 1; i
< count
; i
++)
4865 s_start
= sections
[i
].sec
->vma
;
4866 if (p_start
== s_start
)
4874 /* Now check section VMAs if no overlays were detected. */
4877 for (p
= NULL
, i
= 0; i
< count
; i
++)
4879 s
= sections
[i
].sec
;
4881 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4884 && !sections
[i
].warned
4885 && (s_start
<= p_end
4886 || p_end
< p_start
))
4887 einfo (_("%X%P: section %s VMA [%V,%V]"
4888 " overlaps section %s VMA [%V,%V]\n"),
4889 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4898 /* If any memory region has overflowed, report by how much.
4899 We do not issue this diagnostic for regions that had sections
4900 explicitly placed outside their bounds; os_region_check's
4901 diagnostics are adequate for that case.
4903 FIXME: It is conceivable that m->current - (m->origin + m->length)
4904 might overflow a 32-bit integer. There is, alas, no way to print
4905 a bfd_vma quantity in decimal. */
4906 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4907 if (m
->had_full_message
)
4908 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4909 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4912 /* Make sure the new address is within the region. We explicitly permit the
4913 current address to be at the exact end of the region when the address is
4914 non-zero, in case the region is at the end of addressable memory and the
4915 calculation wraps around. */
4918 os_region_check (lang_output_section_statement_type
*os
,
4919 lang_memory_region_type
*region
,
4923 if ((region
->current
< region
->origin
4924 || (region
->current
- region
->origin
> region
->length
))
4925 && ((region
->current
!= region
->origin
+ region
->length
)
4930 einfo (_("%X%P: address 0x%v of %B section `%s'"
4931 " is not within region `%s'\n"),
4933 os
->bfd_section
->owner
,
4934 os
->bfd_section
->name
,
4935 region
->name_list
.name
);
4937 else if (!region
->had_full_message
)
4939 region
->had_full_message
= TRUE
;
4941 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4942 os
->bfd_section
->owner
,
4943 os
->bfd_section
->name
,
4944 region
->name_list
.name
);
4949 /* Set the sizes for all the output sections. */
4952 lang_size_sections_1
4953 (lang_statement_union_type
**prev
,
4954 lang_output_section_statement_type
*output_section_statement
,
4958 bfd_boolean check_regions
)
4960 lang_statement_union_type
*s
;
4962 /* Size up the sections from their constituent parts. */
4963 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4965 switch (s
->header
.type
)
4967 case lang_output_section_statement_enum
:
4969 bfd_vma newdot
, after
, dotdelta
;
4970 lang_output_section_statement_type
*os
;
4971 lang_memory_region_type
*r
;
4972 int section_alignment
= 0;
4974 os
= &s
->output_section_statement
;
4975 if (os
->constraint
== -1)
4978 /* FIXME: We shouldn't need to zero section vmas for ld -r
4979 here, in lang_insert_orphan, or in the default linker scripts.
4980 This is covering for coff backend linker bugs. See PR6945. */
4981 if (os
->addr_tree
== NULL
4982 && bfd_link_relocatable (&link_info
)
4983 && (bfd_get_flavour (link_info
.output_bfd
)
4984 == bfd_target_coff_flavour
))
4985 os
->addr_tree
= exp_intop (0);
4986 if (os
->addr_tree
!= NULL
)
4988 os
->processed_vma
= FALSE
;
4989 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4991 if (expld
.result
.valid_p
)
4993 dot
= expld
.result
.value
;
4994 if (expld
.result
.section
!= NULL
)
4995 dot
+= expld
.result
.section
->vma
;
4997 else if (expld
.phase
!= lang_mark_phase_enum
)
4998 einfo (_("%F%S: non constant or forward reference"
4999 " address expression for section %s\n"),
5000 os
->addr_tree
, os
->name
);
5003 if (os
->bfd_section
== NULL
)
5004 /* This section was removed or never actually created. */
5007 /* If this is a COFF shared library section, use the size and
5008 address from the input section. FIXME: This is COFF
5009 specific; it would be cleaner if there were some other way
5010 to do this, but nothing simple comes to mind. */
5011 if (((bfd_get_flavour (link_info
.output_bfd
)
5012 == bfd_target_ecoff_flavour
)
5013 || (bfd_get_flavour (link_info
.output_bfd
)
5014 == bfd_target_coff_flavour
))
5015 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
5019 if (os
->children
.head
== NULL
5020 || os
->children
.head
->header
.next
!= NULL
5021 || (os
->children
.head
->header
.type
5022 != lang_input_section_enum
))
5023 einfo (_("%P%X: Internal error on COFF shared library"
5024 " section %s\n"), os
->name
);
5026 input
= os
->children
.head
->input_section
.section
;
5027 bfd_set_section_vma (os
->bfd_section
->owner
,
5029 bfd_section_vma (input
->owner
, input
));
5030 os
->bfd_section
->size
= input
->size
;
5036 if (bfd_is_abs_section (os
->bfd_section
))
5038 /* No matter what happens, an abs section starts at zero. */
5039 ASSERT (os
->bfd_section
->vma
== 0);
5043 if (os
->addr_tree
== NULL
)
5045 /* No address specified for this section, get one
5046 from the region specification. */
5047 if (os
->region
== NULL
5048 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5049 && os
->region
->name_list
.name
[0] == '*'
5050 && strcmp (os
->region
->name_list
.name
,
5051 DEFAULT_MEMORY_REGION
) == 0))
5053 os
->region
= lang_memory_default (os
->bfd_section
);
5056 /* If a loadable section is using the default memory
5057 region, and some non default memory regions were
5058 defined, issue an error message. */
5060 && !IGNORE_SECTION (os
->bfd_section
)
5061 && !bfd_link_relocatable (&link_info
)
5063 && strcmp (os
->region
->name_list
.name
,
5064 DEFAULT_MEMORY_REGION
) == 0
5065 && lang_memory_region_list
!= NULL
5066 && (strcmp (lang_memory_region_list
->name_list
.name
,
5067 DEFAULT_MEMORY_REGION
) != 0
5068 || lang_memory_region_list
->next
!= NULL
)
5069 && expld
.phase
!= lang_mark_phase_enum
)
5071 /* By default this is an error rather than just a
5072 warning because if we allocate the section to the
5073 default memory region we can end up creating an
5074 excessively large binary, or even seg faulting when
5075 attempting to perform a negative seek. See
5076 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5077 for an example of this. This behaviour can be
5078 overridden by the using the --no-check-sections
5080 if (command_line
.check_section_addresses
)
5081 einfo (_("%P%F: error: no memory region specified"
5082 " for loadable section `%s'\n"),
5083 bfd_get_section_name (link_info
.output_bfd
,
5086 einfo (_("%P: warning: no memory region specified"
5087 " for loadable section `%s'\n"),
5088 bfd_get_section_name (link_info
.output_bfd
,
5092 newdot
= os
->region
->current
;
5093 section_alignment
= os
->bfd_section
->alignment_power
;
5096 section_alignment
= os
->section_alignment
;
5098 /* Align to what the section needs. */
5099 if (section_alignment
> 0)
5101 bfd_vma savedot
= newdot
;
5102 newdot
= align_power (newdot
, section_alignment
);
5104 dotdelta
= newdot
- savedot
;
5106 && (config
.warn_section_align
5107 || os
->addr_tree
!= NULL
)
5108 && expld
.phase
!= lang_mark_phase_enum
)
5109 einfo (_("%P: warning: changing start of section"
5110 " %s by %lu bytes\n"),
5111 os
->name
, (unsigned long) dotdelta
);
5114 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
5116 os
->bfd_section
->output_offset
= 0;
5119 lang_size_sections_1 (&os
->children
.head
, os
,
5120 os
->fill
, newdot
, relax
, check_regions
);
5122 os
->processed_vma
= TRUE
;
5124 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5125 /* Except for some special linker created sections,
5126 no output section should change from zero size
5127 after strip_excluded_output_sections. A non-zero
5128 size on an ignored section indicates that some
5129 input section was not sized early enough. */
5130 ASSERT (os
->bfd_section
->size
== 0);
5133 dot
= os
->bfd_section
->vma
;
5135 /* Put the section within the requested block size, or
5136 align at the block boundary. */
5138 + TO_ADDR (os
->bfd_section
->size
)
5139 + os
->block_value
- 1)
5140 & - (bfd_vma
) os
->block_value
);
5142 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
5145 /* Set section lma. */
5148 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5152 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5153 os
->bfd_section
->lma
= lma
;
5155 else if (os
->lma_region
!= NULL
)
5157 bfd_vma lma
= os
->lma_region
->current
;
5159 if (os
->align_lma_with_input
)
5163 /* When LMA_REGION is the same as REGION, align the LMA
5164 as we did for the VMA, possibly including alignment
5165 from the bfd section. If a different region, then
5166 only align according to the value in the output
5168 if (os
->lma_region
!= os
->region
)
5169 section_alignment
= os
->section_alignment
;
5170 if (section_alignment
> 0)
5171 lma
= align_power (lma
, section_alignment
);
5173 os
->bfd_section
->lma
= lma
;
5175 else if (r
->last_os
!= NULL
5176 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5181 last
= r
->last_os
->output_section_statement
.bfd_section
;
5183 /* A backwards move of dot should be accompanied by
5184 an explicit assignment to the section LMA (ie.
5185 os->load_base set) because backwards moves can
5186 create overlapping LMAs. */
5188 && os
->bfd_section
->size
!= 0
5189 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5191 /* If dot moved backwards then leave lma equal to
5192 vma. This is the old default lma, which might
5193 just happen to work when the backwards move is
5194 sufficiently large. Nag if this changes anything,
5195 so people can fix their linker scripts. */
5197 if (last
->vma
!= last
->lma
)
5198 einfo (_("%P: warning: dot moved backwards "
5199 "before `%s'\n"), os
->name
);
5203 /* If this is an overlay, set the current lma to that
5204 at the end of the previous section. */
5205 if (os
->sectype
== overlay_section
)
5206 lma
= last
->lma
+ TO_ADDR (last
->size
);
5208 /* Otherwise, keep the same lma to vma relationship
5209 as the previous section. */
5211 lma
= dot
+ last
->lma
- last
->vma
;
5213 if (section_alignment
> 0)
5214 lma
= align_power (lma
, section_alignment
);
5215 os
->bfd_section
->lma
= lma
;
5218 os
->processed_lma
= TRUE
;
5220 /* Keep track of normal sections using the default
5221 lma region. We use this to set the lma for
5222 following sections. Overlays or other linker
5223 script assignment to lma might mean that the
5224 default lma == vma is incorrect.
5225 To avoid warnings about dot moving backwards when using
5226 -Ttext, don't start tracking sections until we find one
5227 of non-zero size or with lma set differently to vma.
5228 Do this tracking before we short-cut the loop so that we
5229 track changes for the case where the section size is zero,
5230 but the lma is set differently to the vma. This is
5231 important, if an orphan section is placed after an
5232 otherwise empty output section that has an explicit lma
5233 set, we want that lma reflected in the orphans lma. */
5234 if (!IGNORE_SECTION (os
->bfd_section
)
5235 && (os
->bfd_section
->size
!= 0
5236 || (r
->last_os
== NULL
5237 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5238 || (r
->last_os
!= NULL
5239 && dot
>= (r
->last_os
->output_section_statement
5240 .bfd_section
->vma
)))
5241 && os
->lma_region
== NULL
5242 && !bfd_link_relocatable (&link_info
))
5245 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5248 /* .tbss sections effectively have zero size. */
5249 if (!IS_TBSS (os
->bfd_section
)
5250 || bfd_link_relocatable (&link_info
))
5251 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5256 if (os
->update_dot_tree
!= 0)
5257 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5259 /* Update dot in the region ?
5260 We only do this if the section is going to be allocated,
5261 since unallocated sections do not contribute to the region's
5262 overall size in memory. */
5263 if (os
->region
!= NULL
5264 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5266 os
->region
->current
= dot
;
5269 /* Make sure the new address is within the region. */
5270 os_region_check (os
, os
->region
, os
->addr_tree
,
5271 os
->bfd_section
->vma
);
5273 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5274 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5275 || os
->align_lma_with_input
))
5277 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5280 os_region_check (os
, os
->lma_region
, NULL
,
5281 os
->bfd_section
->lma
);
5287 case lang_constructors_statement_enum
:
5288 dot
= lang_size_sections_1 (&constructor_list
.head
,
5289 output_section_statement
,
5290 fill
, dot
, relax
, check_regions
);
5293 case lang_data_statement_enum
:
5295 unsigned int size
= 0;
5297 s
->data_statement
.output_offset
=
5298 dot
- output_section_statement
->bfd_section
->vma
;
5299 s
->data_statement
.output_section
=
5300 output_section_statement
->bfd_section
;
5302 /* We might refer to provided symbols in the expression, and
5303 need to mark them as needed. */
5304 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5306 switch (s
->data_statement
.type
)
5324 if (size
< TO_SIZE ((unsigned) 1))
5325 size
= TO_SIZE ((unsigned) 1);
5326 dot
+= TO_ADDR (size
);
5327 output_section_statement
->bfd_section
->size
5328 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5333 case lang_reloc_statement_enum
:
5337 s
->reloc_statement
.output_offset
=
5338 dot
- output_section_statement
->bfd_section
->vma
;
5339 s
->reloc_statement
.output_section
=
5340 output_section_statement
->bfd_section
;
5341 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5342 dot
+= TO_ADDR (size
);
5343 output_section_statement
->bfd_section
->size
5344 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5348 case lang_wild_statement_enum
:
5349 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5350 output_section_statement
,
5351 fill
, dot
, relax
, check_regions
);
5354 case lang_object_symbols_statement_enum
:
5355 link_info
.create_object_symbols_section
=
5356 output_section_statement
->bfd_section
;
5359 case lang_output_statement_enum
:
5360 case lang_target_statement_enum
:
5363 case lang_input_section_enum
:
5367 i
= s
->input_section
.section
;
5372 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5373 einfo (_("%P%F: can't relax section: %E\n"));
5377 dot
= size_input_section (prev
, output_section_statement
,
5382 case lang_input_statement_enum
:
5385 case lang_fill_statement_enum
:
5386 s
->fill_statement
.output_section
=
5387 output_section_statement
->bfd_section
;
5389 fill
= s
->fill_statement
.fill
;
5392 case lang_assignment_statement_enum
:
5394 bfd_vma newdot
= dot
;
5395 etree_type
*tree
= s
->assignment_statement
.exp
;
5397 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5399 exp_fold_tree (tree
,
5400 output_section_statement
->bfd_section
,
5403 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5405 if (!expld
.dataseg
.relro_start_stat
)
5406 expld
.dataseg
.relro_start_stat
= s
;
5409 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5412 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5414 if (!expld
.dataseg
.relro_end_stat
)
5415 expld
.dataseg
.relro_end_stat
= s
;
5418 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5421 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5423 /* This symbol may be relative to this section. */
5424 if ((tree
->type
.node_class
== etree_provided
5425 || tree
->type
.node_class
== etree_assign
)
5426 && (tree
->assign
.dst
[0] != '.'
5427 || tree
->assign
.dst
[1] != '\0'))
5428 output_section_statement
->update_dot
= 1;
5430 if (!output_section_statement
->ignored
)
5432 if (output_section_statement
== abs_output_section
)
5434 /* If we don't have an output section, then just adjust
5435 the default memory address. */
5436 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5437 FALSE
)->current
= newdot
;
5439 else if (newdot
!= dot
)
5441 /* Insert a pad after this statement. We can't
5442 put the pad before when relaxing, in case the
5443 assignment references dot. */
5444 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5445 output_section_statement
->bfd_section
, dot
);
5447 /* Don't neuter the pad below when relaxing. */
5450 /* If dot is advanced, this implies that the section
5451 should have space allocated to it, unless the
5452 user has explicitly stated that the section
5453 should not be allocated. */
5454 if (output_section_statement
->sectype
!= noalloc_section
5455 && (output_section_statement
->sectype
!= noload_section
5456 || (bfd_get_flavour (link_info
.output_bfd
)
5457 == bfd_target_elf_flavour
)))
5458 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5465 case lang_padding_statement_enum
:
5466 /* If this is the first time lang_size_sections is called,
5467 we won't have any padding statements. If this is the
5468 second or later passes when relaxing, we should allow
5469 padding to shrink. If padding is needed on this pass, it
5470 will be added back in. */
5471 s
->padding_statement
.size
= 0;
5473 /* Make sure output_offset is valid. If relaxation shrinks
5474 the section and this pad isn't needed, it's possible to
5475 have output_offset larger than the final size of the
5476 section. bfd_set_section_contents will complain even for
5477 a pad size of zero. */
5478 s
->padding_statement
.output_offset
5479 = dot
- output_section_statement
->bfd_section
->vma
;
5482 case lang_group_statement_enum
:
5483 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5484 output_section_statement
,
5485 fill
, dot
, relax
, check_regions
);
5488 case lang_insert_statement_enum
:
5491 /* We can only get here when relaxing is turned on. */
5492 case lang_address_statement_enum
:
5499 prev
= &s
->header
.next
;
5504 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5505 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5506 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5507 segments. We are allowed an opportunity to override this decision. */
5510 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
5511 bfd
*abfd ATTRIBUTE_UNUSED
,
5512 asection
*current_section
,
5513 asection
*previous_section
,
5514 bfd_boolean new_segment
)
5516 lang_output_section_statement_type
*cur
;
5517 lang_output_section_statement_type
*prev
;
5519 /* The checks below are only necessary when the BFD library has decided
5520 that the two sections ought to be placed into the same segment. */
5524 /* Paranoia checks. */
5525 if (current_section
== NULL
|| previous_section
== NULL
)
5528 /* If this flag is set, the target never wants code and non-code
5529 sections comingled in the same segment. */
5530 if (config
.separate_code
5531 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5534 /* Find the memory regions associated with the two sections.
5535 We call lang_output_section_find() here rather than scanning the list
5536 of output sections looking for a matching section pointer because if
5537 we have a large number of sections then a hash lookup is faster. */
5538 cur
= lang_output_section_find (current_section
->name
);
5539 prev
= lang_output_section_find (previous_section
->name
);
5541 /* More paranoia. */
5542 if (cur
== NULL
|| prev
== NULL
)
5545 /* If the regions are different then force the sections to live in
5546 different segments. See the email thread starting at the following
5547 URL for the reasons why this is necessary:
5548 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5549 return cur
->region
!= prev
->region
;
5553 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5555 lang_statement_iteration
++;
5556 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5557 0, 0, relax
, check_regions
);
5561 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5563 expld
.phase
= lang_allocating_phase_enum
;
5564 expld
.dataseg
.phase
= exp_dataseg_none
;
5566 one_lang_size_sections_pass (relax
, check_regions
);
5567 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5568 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5570 bfd_vma initial_base
, relro_end
, desired_end
;
5573 /* Compute the expected PT_GNU_RELRO segment end. */
5574 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5575 & ~(expld
.dataseg
.pagesize
- 1));
5577 /* Adjust by the offset arg of DATA_SEGMENT_RELRO_END. */
5578 desired_end
= relro_end
- expld
.dataseg
.relro_offset
;
5580 /* For sections in the relro segment.. */
5581 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
5582 if ((sec
->flags
& SEC_ALLOC
) != 0
5583 && sec
->vma
>= expld
.dataseg
.base
5584 && sec
->vma
< expld
.dataseg
.relro_end
- expld
.dataseg
.relro_offset
)
5586 /* Where do we want to put this section so that it ends as
5588 bfd_vma start
, end
, bump
;
5590 end
= start
= sec
->vma
;
5592 end
+= TO_ADDR (sec
->size
);
5593 bump
= desired_end
- end
;
5594 /* We'd like to increase START by BUMP, but we must heed
5595 alignment so the increase might be less than optimum. */
5597 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
5598 /* This is now the desired end for the previous section. */
5599 desired_end
= start
;
5602 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5603 ASSERT (desired_end
>= expld
.dataseg
.base
);
5604 initial_base
= expld
.dataseg
.base
;
5605 expld
.dataseg
.base
= desired_end
;
5606 lang_reset_memory_regions ();
5607 one_lang_size_sections_pass (relax
, check_regions
);
5609 if (expld
.dataseg
.relro_end
> relro_end
)
5611 /* Assignments to dot, or to output section address in a
5612 user script have increased padding over the original.
5614 expld
.dataseg
.base
= initial_base
;
5615 lang_reset_memory_regions ();
5616 one_lang_size_sections_pass (relax
, check_regions
);
5619 link_info
.relro_start
= expld
.dataseg
.base
;
5620 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5622 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5624 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5625 a page could be saved in the data segment. */
5626 bfd_vma first
, last
;
5628 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5629 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5631 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5632 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5633 && first
+ last
<= expld
.dataseg
.pagesize
)
5635 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5636 lang_reset_memory_regions ();
5637 one_lang_size_sections_pass (relax
, check_regions
);
5640 expld
.dataseg
.phase
= exp_dataseg_done
;
5643 expld
.dataseg
.phase
= exp_dataseg_done
;
5646 static lang_output_section_statement_type
*current_section
;
5647 static lang_assignment_statement_type
*current_assign
;
5648 static bfd_boolean prefer_next_section
;
5650 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5653 lang_do_assignments_1 (lang_statement_union_type
*s
,
5654 lang_output_section_statement_type
*current_os
,
5657 bfd_boolean
*found_end
)
5659 for (; s
!= NULL
; s
= s
->header
.next
)
5661 switch (s
->header
.type
)
5663 case lang_constructors_statement_enum
:
5664 dot
= lang_do_assignments_1 (constructor_list
.head
,
5665 current_os
, fill
, dot
, found_end
);
5668 case lang_output_section_statement_enum
:
5670 lang_output_section_statement_type
*os
;
5673 os
= &(s
->output_section_statement
);
5674 os
->after_end
= *found_end
;
5675 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5677 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5679 current_section
= os
;
5680 prefer_next_section
= FALSE
;
5682 dot
= os
->bfd_section
->vma
;
5684 newdot
= lang_do_assignments_1 (os
->children
.head
,
5685 os
, os
->fill
, dot
, found_end
);
5688 if (os
->bfd_section
!= NULL
)
5690 /* .tbss sections effectively have zero size. */
5691 if (!IS_TBSS (os
->bfd_section
)
5692 || bfd_link_relocatable (&link_info
))
5693 dot
+= TO_ADDR (os
->bfd_section
->size
);
5695 if (os
->update_dot_tree
!= NULL
)
5696 exp_fold_tree (os
->update_dot_tree
,
5697 bfd_abs_section_ptr
, &dot
);
5705 case lang_wild_statement_enum
:
5707 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5708 current_os
, fill
, dot
, found_end
);
5711 case lang_object_symbols_statement_enum
:
5712 case lang_output_statement_enum
:
5713 case lang_target_statement_enum
:
5716 case lang_data_statement_enum
:
5717 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5718 if (expld
.result
.valid_p
)
5720 s
->data_statement
.value
= expld
.result
.value
;
5721 if (expld
.result
.section
!= NULL
)
5722 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5724 else if (expld
.phase
== lang_final_phase_enum
)
5725 einfo (_("%F%P: invalid data statement\n"));
5728 switch (s
->data_statement
.type
)
5746 if (size
< TO_SIZE ((unsigned) 1))
5747 size
= TO_SIZE ((unsigned) 1);
5748 dot
+= TO_ADDR (size
);
5752 case lang_reloc_statement_enum
:
5753 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5754 bfd_abs_section_ptr
, &dot
);
5755 if (expld
.result
.valid_p
)
5756 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5757 else if (expld
.phase
== lang_final_phase_enum
)
5758 einfo (_("%F%P: invalid reloc statement\n"));
5759 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5762 case lang_input_section_enum
:
5764 asection
*in
= s
->input_section
.section
;
5766 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5767 dot
+= TO_ADDR (in
->size
);
5771 case lang_input_statement_enum
:
5774 case lang_fill_statement_enum
:
5775 fill
= s
->fill_statement
.fill
;
5778 case lang_assignment_statement_enum
:
5779 current_assign
= &s
->assignment_statement
;
5780 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5782 const char *p
= current_assign
->exp
->assign
.dst
;
5784 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5785 prefer_next_section
= TRUE
;
5789 if (strcmp (p
, "end") == 0)
5792 exp_fold_tree (s
->assignment_statement
.exp
,
5793 (current_os
->bfd_section
!= NULL
5794 ? current_os
->bfd_section
: bfd_und_section_ptr
),
5798 case lang_padding_statement_enum
:
5799 dot
+= TO_ADDR (s
->padding_statement
.size
);
5802 case lang_group_statement_enum
:
5803 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5804 current_os
, fill
, dot
, found_end
);
5807 case lang_insert_statement_enum
:
5810 case lang_address_statement_enum
:
5822 lang_do_assignments (lang_phase_type phase
)
5824 bfd_boolean found_end
= FALSE
;
5826 current_section
= NULL
;
5827 prefer_next_section
= FALSE
;
5828 expld
.phase
= phase
;
5829 lang_statement_iteration
++;
5830 lang_do_assignments_1 (statement_list
.head
,
5831 abs_output_section
, NULL
, 0, &found_end
);
5834 /* For an assignment statement outside of an output section statement,
5835 choose the best of neighbouring output sections to use for values
5839 section_for_dot (void)
5843 /* Assignments belong to the previous output section, unless there
5844 has been an assignment to "dot", in which case following
5845 assignments belong to the next output section. (The assumption
5846 is that an assignment to "dot" is setting up the address for the
5847 next output section.) Except that past the assignment to "_end"
5848 we always associate with the previous section. This exception is
5849 for targets like SH that define an alloc .stack or other
5850 weirdness after non-alloc sections. */
5851 if (current_section
== NULL
|| prefer_next_section
)
5853 lang_statement_union_type
*stmt
;
5854 lang_output_section_statement_type
*os
;
5856 for (stmt
= (lang_statement_union_type
*) current_assign
;
5858 stmt
= stmt
->header
.next
)
5859 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5862 os
= &stmt
->output_section_statement
;
5865 && (os
->bfd_section
== NULL
5866 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5867 || bfd_section_removed_from_list (link_info
.output_bfd
,
5871 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5874 s
= os
->bfd_section
;
5876 s
= link_info
.output_bfd
->section_last
;
5878 && ((s
->flags
& SEC_ALLOC
) == 0
5879 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5884 return bfd_abs_section_ptr
;
5888 s
= current_section
->bfd_section
;
5890 /* The section may have been stripped. */
5892 && ((s
->flags
& SEC_EXCLUDE
) != 0
5893 || (s
->flags
& SEC_ALLOC
) == 0
5894 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5895 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5898 s
= link_info
.output_bfd
->sections
;
5900 && ((s
->flags
& SEC_ALLOC
) == 0
5901 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5906 return bfd_abs_section_ptr
;
5909 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5910 operator .startof. (section_name), it produces an undefined symbol
5911 .startof.section_name. Similarly, when it sees
5912 .sizeof. (section_name), it produces an undefined symbol
5913 .sizeof.section_name. For all the output sections, we look for
5914 such symbols, and set them to the correct value. */
5917 lang_set_startof (void)
5921 if (bfd_link_relocatable (&link_info
))
5924 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5926 const char *secname
;
5928 struct bfd_link_hash_entry
*h
;
5930 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5931 buf
= (char *) xmalloc (10 + strlen (secname
));
5933 sprintf (buf
, ".startof.%s", secname
);
5934 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5935 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5937 h
->type
= bfd_link_hash_defined
;
5939 h
->u
.def
.section
= s
;
5942 sprintf (buf
, ".sizeof.%s", secname
);
5943 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5944 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5946 h
->type
= bfd_link_hash_defined
;
5947 h
->u
.def
.value
= TO_ADDR (s
->size
);
5948 h
->u
.def
.section
= bfd_abs_section_ptr
;
5958 struct bfd_link_hash_entry
*h
;
5961 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
5962 || bfd_link_dll (&link_info
))
5963 warn
= entry_from_cmdline
;
5967 /* Force the user to specify a root when generating a relocatable with
5969 if (link_info
.gc_sections
&& bfd_link_relocatable (&link_info
)
5970 && !(entry_from_cmdline
|| undef_from_cmdline
))
5971 einfo (_("%P%F: gc-sections requires either an entry or "
5972 "an undefined symbol\n"));
5974 if (entry_symbol
.name
== NULL
)
5976 /* No entry has been specified. Look for the default entry, but
5977 don't warn if we don't find it. */
5978 entry_symbol
.name
= entry_symbol_default
;
5982 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5983 FALSE
, FALSE
, TRUE
);
5985 && (h
->type
== bfd_link_hash_defined
5986 || h
->type
== bfd_link_hash_defweak
)
5987 && h
->u
.def
.section
->output_section
!= NULL
)
5991 val
= (h
->u
.def
.value
5992 + bfd_get_section_vma (link_info
.output_bfd
,
5993 h
->u
.def
.section
->output_section
)
5994 + h
->u
.def
.section
->output_offset
);
5995 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
5996 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
6003 /* We couldn't find the entry symbol. Try parsing it as a
6005 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
6008 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
6009 einfo (_("%P%F: can't set start address\n"));
6015 /* Can't find the entry symbol, and it's not a number. Use
6016 the first address in the text section. */
6017 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
6021 einfo (_("%P: warning: cannot find entry symbol %s;"
6022 " defaulting to %V\n"),
6024 bfd_get_section_vma (link_info
.output_bfd
, ts
));
6025 if (!(bfd_set_start_address
6026 (link_info
.output_bfd
,
6027 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
6028 einfo (_("%P%F: can't set start address\n"));
6033 einfo (_("%P: warning: cannot find entry symbol %s;"
6034 " not setting start address\n"),
6041 /* This is a small function used when we want to ignore errors from
6045 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
6046 va_list ap ATTRIBUTE_UNUSED
)
6048 /* Don't do anything. */
6051 /* Check that the architecture of all the input files is compatible
6052 with the output file. Also call the backend to let it do any
6053 other checking that is needed. */
6058 lang_statement_union_type
*file
;
6060 const bfd_arch_info_type
*compatible
;
6062 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
6064 #ifdef ENABLE_PLUGINS
6065 /* Don't check format of files claimed by plugin. */
6066 if (file
->input_statement
.flags
.claimed
)
6068 #endif /* ENABLE_PLUGINS */
6069 input_bfd
= file
->input_statement
.the_bfd
;
6071 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
6072 command_line
.accept_unknown_input_arch
);
6074 /* In general it is not possible to perform a relocatable
6075 link between differing object formats when the input
6076 file has relocations, because the relocations in the
6077 input format may not have equivalent representations in
6078 the output format (and besides BFD does not translate
6079 relocs for other link purposes than a final link). */
6080 if ((bfd_link_relocatable (&link_info
)
6081 || link_info
.emitrelocations
)
6082 && (compatible
== NULL
6083 || (bfd_get_flavour (input_bfd
)
6084 != bfd_get_flavour (link_info
.output_bfd
)))
6085 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
6087 einfo (_("%P%F: Relocatable linking with relocations from"
6088 " format %s (%B) to format %s (%B) is not supported\n"),
6089 bfd_get_target (input_bfd
), input_bfd
,
6090 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
6091 /* einfo with %F exits. */
6094 if (compatible
== NULL
)
6096 if (command_line
.warn_mismatch
)
6097 einfo (_("%P%X: %s architecture of input file `%B'"
6098 " is incompatible with %s output\n"),
6099 bfd_printable_name (input_bfd
), input_bfd
,
6100 bfd_printable_name (link_info
.output_bfd
));
6102 else if (bfd_count_sections (input_bfd
))
6104 /* If the input bfd has no contents, it shouldn't set the
6105 private data of the output bfd. */
6107 bfd_error_handler_type pfn
= NULL
;
6109 /* If we aren't supposed to warn about mismatched input
6110 files, temporarily set the BFD error handler to a
6111 function which will do nothing. We still want to call
6112 bfd_merge_private_bfd_data, since it may set up
6113 information which is needed in the output file. */
6114 if (!command_line
.warn_mismatch
)
6115 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
6116 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
6118 if (command_line
.warn_mismatch
)
6119 einfo (_("%P%X: failed to merge target specific data"
6120 " of file %B\n"), input_bfd
);
6122 if (!command_line
.warn_mismatch
)
6123 bfd_set_error_handler (pfn
);
6128 /* Look through all the global common symbols and attach them to the
6129 correct section. The -sort-common command line switch may be used
6130 to roughly sort the entries by alignment. */
6135 if (command_line
.inhibit_common_definition
)
6137 if (bfd_link_relocatable (&link_info
)
6138 && !command_line
.force_common_definition
)
6141 if (!config
.sort_common
)
6142 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
6147 if (config
.sort_common
== sort_descending
)
6149 for (power
= 4; power
> 0; power
--)
6150 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6153 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6157 for (power
= 0; power
<= 4; power
++)
6158 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6160 power
= (unsigned int) -1;
6161 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6166 /* Place one common symbol in the correct section. */
6169 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
6171 unsigned int power_of_two
;
6175 if (h
->type
!= bfd_link_hash_common
)
6179 power_of_two
= h
->u
.c
.p
->alignment_power
;
6181 if (config
.sort_common
== sort_descending
6182 && power_of_two
< *(unsigned int *) info
)
6184 else if (config
.sort_common
== sort_ascending
6185 && power_of_two
> *(unsigned int *) info
)
6188 section
= h
->u
.c
.p
->section
;
6189 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6190 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6193 if (config
.map_file
!= NULL
)
6195 static bfd_boolean header_printed
;
6200 if (!header_printed
)
6202 minfo (_("\nAllocating common symbols\n"));
6203 minfo (_("Common symbol size file\n\n"));
6204 header_printed
= TRUE
;
6207 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6208 DMGL_ANSI
| DMGL_PARAMS
);
6211 minfo ("%s", h
->root
.string
);
6212 len
= strlen (h
->root
.string
);
6217 len
= strlen (name
);
6233 if (size
<= 0xffffffff)
6234 sprintf (buf
, "%lx", (unsigned long) size
);
6236 sprintf_vma (buf
, size
);
6246 minfo ("%B\n", section
->owner
);
6252 /* Handle a single orphan section S, placing the orphan into an appropriate
6253 output section. The effects of the --orphan-handling command line
6254 option are handled here. */
6257 ldlang_place_orphan (asection
*s
)
6259 if (config
.orphan_handling
== orphan_handling_discard
)
6261 lang_output_section_statement_type
*os
;
6262 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0,
6264 if (os
->addr_tree
== NULL
6265 && (bfd_link_relocatable (&link_info
)
6266 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6267 os
->addr_tree
= exp_intop (0);
6268 lang_add_section (&os
->children
, s
, NULL
, os
);
6272 lang_output_section_statement_type
*os
;
6273 const char *name
= s
->name
;
6276 if (config
.orphan_handling
== orphan_handling_error
)
6277 einfo ("%X%P: error: unplaced orphan section `%A' from `%B'.\n",
6280 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
6281 constraint
= SPECIAL
;
6283 os
= ldemul_place_orphan (s
, name
, constraint
);
6286 os
= lang_output_section_statement_lookup (name
, constraint
, TRUE
);
6287 if (os
->addr_tree
== NULL
6288 && (bfd_link_relocatable (&link_info
)
6289 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6290 os
->addr_tree
= exp_intop (0);
6291 lang_add_section (&os
->children
, s
, NULL
, os
);
6294 if (config
.orphan_handling
== orphan_handling_warn
)
6295 einfo ("%P: warning: orphan section `%A' from `%B' being "
6296 "placed in section `%s'.\n",
6297 s
, s
->owner
, os
->name
);
6301 /* Run through the input files and ensure that every input section has
6302 somewhere to go. If one is found without a destination then create
6303 an input request and place it into the statement tree. */
6306 lang_place_orphans (void)
6308 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6312 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6314 if (s
->output_section
== NULL
)
6316 /* This section of the file is not attached, root
6317 around for a sensible place for it to go. */
6319 if (file
->flags
.just_syms
)
6320 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6321 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
6322 s
->output_section
= bfd_abs_section_ptr
;
6323 else if (strcmp (s
->name
, "COMMON") == 0)
6325 /* This is a lonely common section which must have
6326 come from an archive. We attach to the section
6327 with the wildcard. */
6328 if (!bfd_link_relocatable (&link_info
)
6329 || command_line
.force_common_definition
)
6331 if (default_common_section
== NULL
)
6332 default_common_section
6333 = lang_output_section_statement_lookup (".bss", 0,
6335 lang_add_section (&default_common_section
->children
, s
,
6336 NULL
, default_common_section
);
6340 ldlang_place_orphan (s
);
6347 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6349 flagword
*ptr_flags
;
6351 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6357 /* PR 17900: An exclamation mark in the attributes reverses
6358 the sense of any of the attributes that follow. */
6361 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6365 *ptr_flags
|= SEC_ALLOC
;
6369 *ptr_flags
|= SEC_READONLY
;
6373 *ptr_flags
|= SEC_DATA
;
6377 *ptr_flags
|= SEC_CODE
;
6382 *ptr_flags
|= SEC_LOAD
;
6386 einfo (_("%P%F: invalid character %c (%d) in flags\n"),
6394 /* Call a function on each input file. This function will be called
6395 on an archive, but not on the elements. */
6398 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6400 lang_input_statement_type
*f
;
6402 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6404 f
= (lang_input_statement_type
*) f
->next_real_file
)
6408 /* Call a function on each file. The function will be called on all
6409 the elements of an archive which are included in the link, but will
6410 not be called on the archive file itself. */
6413 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6415 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6422 ldlang_add_file (lang_input_statement_type
*entry
)
6424 lang_statement_append (&file_chain
,
6425 (lang_statement_union_type
*) entry
,
6428 /* The BFD linker needs to have a list of all input BFDs involved in
6430 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
6431 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6433 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6434 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
6435 entry
->the_bfd
->usrdata
= entry
;
6436 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6438 /* Look through the sections and check for any which should not be
6439 included in the link. We need to do this now, so that we can
6440 notice when the backend linker tries to report multiple
6441 definition errors for symbols which are in sections we aren't
6442 going to link. FIXME: It might be better to entirely ignore
6443 symbols which are defined in sections which are going to be
6444 discarded. This would require modifying the backend linker for
6445 each backend which might set the SEC_LINK_ONCE flag. If we do
6446 this, we should probably handle SEC_EXCLUDE in the same way. */
6448 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6452 lang_add_output (const char *name
, int from_script
)
6454 /* Make -o on command line override OUTPUT in script. */
6455 if (!had_output_filename
|| !from_script
)
6457 output_filename
= name
;
6458 had_output_filename
= TRUE
;
6471 for (l
= 0; l
< 32; l
++)
6473 if (i
>= (unsigned int) x
)
6481 lang_output_section_statement_type
*
6482 lang_enter_output_section_statement (const char *output_section_statement_name
,
6483 etree_type
*address_exp
,
6484 enum section_type sectype
,
6486 etree_type
*subalign
,
6489 int align_with_input
)
6491 lang_output_section_statement_type
*os
;
6493 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6495 current_section
= os
;
6497 if (os
->addr_tree
== NULL
)
6499 os
->addr_tree
= address_exp
;
6501 os
->sectype
= sectype
;
6502 if (sectype
!= noload_section
)
6503 os
->flags
= SEC_NO_FLAGS
;
6505 os
->flags
= SEC_NEVER_LOAD
;
6506 os
->block_value
= 1;
6508 /* Make next things chain into subchain of this. */
6509 push_stat_ptr (&os
->children
);
6511 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6512 if (os
->align_lma_with_input
&& align
!= NULL
)
6513 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"),
6516 os
->subsection_alignment
=
6517 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6518 os
->section_alignment
=
6519 topower (exp_get_value_int (align
, -1, "section alignment"));
6521 os
->load_base
= ebase
;
6528 lang_output_statement_type
*new_stmt
;
6530 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6531 new_stmt
->name
= output_filename
;
6534 /* Reset the current counters in the regions. */
6537 lang_reset_memory_regions (void)
6539 lang_memory_region_type
*p
= lang_memory_region_list
;
6541 lang_output_section_statement_type
*os
;
6543 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6545 p
->current
= p
->origin
;
6549 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6553 os
->processed_vma
= FALSE
;
6554 os
->processed_lma
= FALSE
;
6557 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6559 /* Save the last size for possible use by bfd_relax_section. */
6560 o
->rawsize
= o
->size
;
6565 /* Worker for lang_gc_sections_1. */
6568 gc_section_callback (lang_wild_statement_type
*ptr
,
6569 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6571 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6572 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6573 void *data ATTRIBUTE_UNUSED
)
6575 /* If the wild pattern was marked KEEP, the member sections
6576 should be as well. */
6577 if (ptr
->keep_sections
)
6578 section
->flags
|= SEC_KEEP
;
6581 /* Iterate over sections marking them against GC. */
6584 lang_gc_sections_1 (lang_statement_union_type
*s
)
6586 for (; s
!= NULL
; s
= s
->header
.next
)
6588 switch (s
->header
.type
)
6590 case lang_wild_statement_enum
:
6591 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6593 case lang_constructors_statement_enum
:
6594 lang_gc_sections_1 (constructor_list
.head
);
6596 case lang_output_section_statement_enum
:
6597 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6599 case lang_group_statement_enum
:
6600 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6609 lang_gc_sections (void)
6611 /* Keep all sections so marked in the link script. */
6612 lang_gc_sections_1 (statement_list
.head
);
6614 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6615 the special case of debug info. (See bfd/stabs.c)
6616 Twiddle the flag here, to simplify later linker code. */
6617 if (bfd_link_relocatable (&link_info
))
6619 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6622 #ifdef ENABLE_PLUGINS
6623 if (f
->flags
.claimed
)
6626 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6627 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6628 sec
->flags
&= ~SEC_EXCLUDE
;
6632 if (link_info
.gc_sections
)
6633 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6636 /* Worker for lang_find_relro_sections_1. */
6639 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6640 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6642 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6643 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6646 /* Discarded, excluded and ignored sections effectively have zero
6648 if (section
->output_section
!= NULL
6649 && section
->output_section
->owner
== link_info
.output_bfd
6650 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6651 && !IGNORE_SECTION (section
)
6652 && section
->size
!= 0)
6654 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6655 *has_relro_section
= TRUE
;
6659 /* Iterate over sections for relro sections. */
6662 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6663 bfd_boolean
*has_relro_section
)
6665 if (*has_relro_section
)
6668 for (; s
!= NULL
; s
= s
->header
.next
)
6670 if (s
== expld
.dataseg
.relro_end_stat
)
6673 switch (s
->header
.type
)
6675 case lang_wild_statement_enum
:
6676 walk_wild (&s
->wild_statement
,
6677 find_relro_section_callback
,
6680 case lang_constructors_statement_enum
:
6681 lang_find_relro_sections_1 (constructor_list
.head
,
6684 case lang_output_section_statement_enum
:
6685 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6688 case lang_group_statement_enum
:
6689 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6699 lang_find_relro_sections (void)
6701 bfd_boolean has_relro_section
= FALSE
;
6703 /* Check all sections in the link script. */
6705 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6706 &has_relro_section
);
6708 if (!has_relro_section
)
6709 link_info
.relro
= FALSE
;
6712 /* Relax all sections until bfd_relax_section gives up. */
6715 lang_relax_sections (bfd_boolean need_layout
)
6717 if (RELAXATION_ENABLED
)
6719 /* We may need more than one relaxation pass. */
6720 int i
= link_info
.relax_pass
;
6722 /* The backend can use it to determine the current pass. */
6723 link_info
.relax_pass
= 0;
6727 /* Keep relaxing until bfd_relax_section gives up. */
6728 bfd_boolean relax_again
;
6730 link_info
.relax_trip
= -1;
6733 link_info
.relax_trip
++;
6735 /* Note: pe-dll.c does something like this also. If you find
6736 you need to change this code, you probably need to change
6737 pe-dll.c also. DJ */
6739 /* Do all the assignments with our current guesses as to
6741 lang_do_assignments (lang_assigning_phase_enum
);
6743 /* We must do this after lang_do_assignments, because it uses
6745 lang_reset_memory_regions ();
6747 /* Perform another relax pass - this time we know where the
6748 globals are, so can make a better guess. */
6749 relax_again
= FALSE
;
6750 lang_size_sections (&relax_again
, FALSE
);
6752 while (relax_again
);
6754 link_info
.relax_pass
++;
6761 /* Final extra sizing to report errors. */
6762 lang_do_assignments (lang_assigning_phase_enum
);
6763 lang_reset_memory_regions ();
6764 lang_size_sections (NULL
, TRUE
);
6768 #ifdef ENABLE_PLUGINS
6769 /* Find the insert point for the plugin's replacement files. We
6770 place them after the first claimed real object file, or if the
6771 first claimed object is an archive member, after the last real
6772 object file immediately preceding the archive. In the event
6773 no objects have been claimed at all, we return the first dummy
6774 object file on the list as the insert point; that works, but
6775 the callee must be careful when relinking the file_chain as it
6776 is not actually on that chain, only the statement_list and the
6777 input_file list; in that case, the replacement files must be
6778 inserted at the head of the file_chain. */
6780 static lang_input_statement_type
*
6781 find_replacements_insert_point (void)
6783 lang_input_statement_type
*claim1
, *lastobject
;
6784 lastobject
= &input_file_chain
.head
->input_statement
;
6785 for (claim1
= &file_chain
.head
->input_statement
;
6787 claim1
= &claim1
->next
->input_statement
)
6789 if (claim1
->flags
.claimed
)
6790 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6791 /* Update lastobject if this is a real object file. */
6792 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
6793 lastobject
= claim1
;
6795 /* No files were claimed by the plugin. Choose the last object
6796 file found on the list (maybe the first, dummy entry) as the
6801 /* Insert SRCLIST into DESTLIST after given element by chaining
6802 on FIELD as the next-pointer. (Counterintuitively does not need
6803 a pointer to the actual after-node itself, just its chain field.) */
6806 lang_list_insert_after (lang_statement_list_type
*destlist
,
6807 lang_statement_list_type
*srclist
,
6808 lang_statement_union_type
**field
)
6810 *(srclist
->tail
) = *field
;
6811 *field
= srclist
->head
;
6812 if (destlist
->tail
== field
)
6813 destlist
->tail
= srclist
->tail
;
6816 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6817 was taken as a copy of it and leave them in ORIGLIST. */
6820 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6821 lang_statement_list_type
*origlist
)
6823 union lang_statement_union
**savetail
;
6824 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6825 ASSERT (origlist
->head
== destlist
->head
);
6826 savetail
= origlist
->tail
;
6827 origlist
->head
= *(savetail
);
6828 origlist
->tail
= destlist
->tail
;
6829 destlist
->tail
= savetail
;
6832 #endif /* ENABLE_PLUGINS */
6834 /* Add NAME to the list of garbage collection entry points. */
6837 lang_add_gc_name (const char *name
)
6839 struct bfd_sym_chain
*sym
;
6844 sym
= (struct bfd_sym_chain
*) stat_alloc (sizeof (*sym
));
6846 sym
->next
= link_info
.gc_sym_list
;
6848 link_info
.gc_sym_list
= sym
;
6851 /* Check relocations. */
6854 lang_check_relocs (void)
6856 if (link_info
.check_relocs_after_open_input
)
6860 for (abfd
= link_info
.input_bfds
;
6861 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
6862 if (!bfd_link_check_relocs (abfd
, &link_info
))
6864 /* No object output, fail return. */
6865 config
.make_executable
= FALSE
;
6866 /* Note: we do not abort the loop, but rather
6867 continue the scan in case there are other
6868 bad relocations to report. */
6873 /* Look through all output sections looking for places where we can
6874 propagate forward the lma region. */
6877 lang_propagate_lma_regions (void)
6879 lang_output_section_statement_type
*os
;
6881 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6885 if (os
->prev
!= NULL
6886 && os
->lma_region
== NULL
6887 && os
->load_base
== NULL
6888 && os
->addr_tree
== NULL
6889 && os
->region
== os
->prev
->region
)
6890 os
->lma_region
= os
->prev
->lma_region
;
6897 /* Finalize dynamic list. */
6898 if (link_info
.dynamic_list
)
6899 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6901 current_target
= default_target
;
6903 /* Open the output file. */
6904 lang_for_each_statement (ldlang_open_output
);
6907 ldemul_create_output_section_statements ();
6909 /* Add to the hash table all undefineds on the command line. */
6910 lang_place_undefineds ();
6912 if (!bfd_section_already_linked_table_init ())
6913 einfo (_("%P%F: Failed to create hash table\n"));
6915 /* Create a bfd for each input file. */
6916 current_target
= default_target
;
6917 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6919 #ifdef ENABLE_PLUGINS
6920 if (link_info
.lto_plugin_active
)
6922 lang_statement_list_type added
;
6923 lang_statement_list_type files
, inputfiles
;
6925 /* Now all files are read, let the plugin(s) decide if there
6926 are any more to be added to the link before we call the
6927 emulation's after_open hook. We create a private list of
6928 input statements for this purpose, which we will eventually
6929 insert into the global statement list after the first claimed
6932 /* We need to manipulate all three chains in synchrony. */
6934 inputfiles
= input_file_chain
;
6935 if (plugin_call_all_symbols_read ())
6936 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6937 plugin_error_plugin ());
6938 /* Open any newly added files, updating the file chains. */
6939 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6940 /* Restore the global list pointer now they have all been added. */
6941 lang_list_remove_tail (stat_ptr
, &added
);
6942 /* And detach the fresh ends of the file lists. */
6943 lang_list_remove_tail (&file_chain
, &files
);
6944 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6945 /* Were any new files added? */
6946 if (added
.head
!= NULL
)
6948 /* If so, we will insert them into the statement list immediately
6949 after the first input file that was claimed by the plugin. */
6950 plugin_insert
= find_replacements_insert_point ();
6951 /* If a plugin adds input files without having claimed any, we
6952 don't really have a good idea where to place them. Just putting
6953 them at the start or end of the list is liable to leave them
6954 outside the crtbegin...crtend range. */
6955 ASSERT (plugin_insert
!= NULL
);
6956 /* Splice the new statement list into the old one. */
6957 lang_list_insert_after (stat_ptr
, &added
,
6958 &plugin_insert
->header
.next
);
6959 /* Likewise for the file chains. */
6960 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6961 &plugin_insert
->next_real_file
);
6962 /* We must be careful when relinking file_chain; we may need to
6963 insert the new files at the head of the list if the insert
6964 point chosen is the dummy first input file. */
6965 if (plugin_insert
->filename
)
6966 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6968 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6970 /* Rescan archives in case new undefined symbols have appeared. */
6971 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6974 #endif /* ENABLE_PLUGINS */
6976 /* Make sure that nobody has tried to add a symbol to this list
6978 ASSERT (link_info
.gc_sym_list
== NULL
);
6980 link_info
.gc_sym_list
= &entry_symbol
;
6982 if (entry_symbol
.name
== NULL
)
6984 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6986 /* entry_symbol is normally initialied by a ENTRY definition in the
6987 linker script or the -e command line option. But if neither of
6988 these have been used, the target specific backend may still have
6989 provided an entry symbol via a call to lang_default_entry().
6990 Unfortunately this value will not be processed until lang_end()
6991 is called, long after this function has finished. So detect this
6992 case here and add the target's entry symbol to the list of starting
6993 points for garbage collection resolution. */
6994 lang_add_gc_name (entry_symbol_default
);
6997 lang_add_gc_name (link_info
.init_function
);
6998 lang_add_gc_name (link_info
.fini_function
);
7000 ldemul_after_open ();
7001 if (config
.map_file
!= NULL
)
7002 lang_print_asneeded ();
7004 bfd_section_already_linked_table_free ();
7006 /* Make sure that we're not mixing architectures. We call this
7007 after all the input files have been opened, but before we do any
7008 other processing, so that any operations merge_private_bfd_data
7009 does on the output file will be known during the rest of the
7013 /* Handle .exports instead of a version script if we're told to do so. */
7014 if (command_line
.version_exports_section
)
7015 lang_do_version_exports_section ();
7017 /* Build all sets based on the information gathered from the input
7019 ldctor_build_sets ();
7021 /* PR 13683: We must rerun the assignments prior to running garbage
7022 collection in order to make sure that all symbol aliases are resolved. */
7023 lang_do_assignments (lang_mark_phase_enum
);
7025 lang_do_memory_regions();
7026 expld
.phase
= lang_first_phase_enum
;
7028 /* Size up the common data. */
7031 /* Remove unreferenced sections if asked to. */
7032 lang_gc_sections ();
7034 /* Check relocations. */
7035 lang_check_relocs ();
7037 /* Update wild statements. */
7038 update_wild_statements (statement_list
.head
);
7040 /* Run through the contours of the script and attach input sections
7041 to the correct output sections. */
7042 lang_statement_iteration
++;
7043 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
7045 process_insert_statements ();
7047 /* Find any sections not attached explicitly and handle them. */
7048 lang_place_orphans ();
7050 if (!bfd_link_relocatable (&link_info
))
7054 /* Merge SEC_MERGE sections. This has to be done after GC of
7055 sections, so that GCed sections are not merged, but before
7056 assigning dynamic symbols, since removing whole input sections
7058 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
7060 /* Look for a text section and set the readonly attribute in it. */
7061 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
7065 if (config
.text_read_only
)
7066 found
->flags
|= SEC_READONLY
;
7068 found
->flags
&= ~SEC_READONLY
;
7072 /* Copy forward lma regions for output sections in same lma region. */
7073 lang_propagate_lma_regions ();
7075 /* Do anything special before sizing sections. This is where ELF
7076 and other back-ends size dynamic sections. */
7077 ldemul_before_allocation ();
7079 /* We must record the program headers before we try to fix the
7080 section positions, since they will affect SIZEOF_HEADERS. */
7081 lang_record_phdrs ();
7083 /* Check relro sections. */
7084 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
7085 lang_find_relro_sections ();
7087 /* Size up the sections. */
7088 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
7090 /* See if anything special should be done now we know how big
7091 everything is. This is where relaxation is done. */
7092 ldemul_after_allocation ();
7094 /* Fix any .startof. or .sizeof. symbols. */
7095 lang_set_startof ();
7097 /* Do all the assignments, now that we know the final resting places
7098 of all the symbols. */
7099 lang_do_assignments (lang_final_phase_enum
);
7103 /* Convert absolute symbols to section relative. */
7104 ldexp_finalize_syms ();
7106 /* Make sure that the section addresses make sense. */
7107 if (command_line
.check_section_addresses
)
7108 lang_check_section_addresses ();
7110 /* Check any required symbols are known. */
7111 ldlang_check_require_defined_symbols ();
7116 /* EXPORTED TO YACC */
7119 lang_add_wild (struct wildcard_spec
*filespec
,
7120 struct wildcard_list
*section_list
,
7121 bfd_boolean keep_sections
)
7123 struct wildcard_list
*curr
, *next
;
7124 lang_wild_statement_type
*new_stmt
;
7126 /* Reverse the list as the parser puts it back to front. */
7127 for (curr
= section_list
, section_list
= NULL
;
7129 section_list
= curr
, curr
= next
)
7131 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
7132 placed_commons
= TRUE
;
7135 curr
->next
= section_list
;
7138 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
7140 if (strcmp (filespec
->name
, "*") == 0)
7141 filespec
->name
= NULL
;
7142 else if (!wildcardp (filespec
->name
))
7143 lang_has_input_file
= TRUE
;
7146 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
7147 new_stmt
->filename
= NULL
;
7148 new_stmt
->filenames_sorted
= FALSE
;
7149 new_stmt
->section_flag_list
= NULL
;
7150 new_stmt
->exclude_name_list
= NULL
;
7151 if (filespec
!= NULL
)
7153 new_stmt
->filename
= filespec
->name
;
7154 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
7155 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
7156 new_stmt
->exclude_name_list
= filespec
->exclude_name_list
;
7158 new_stmt
->section_list
= section_list
;
7159 new_stmt
->keep_sections
= keep_sections
;
7160 lang_list_init (&new_stmt
->children
);
7161 analyze_walk_wild_section_handler (new_stmt
);
7165 lang_section_start (const char *name
, etree_type
*address
,
7166 const segment_type
*segment
)
7168 lang_address_statement_type
*ad
;
7170 ad
= new_stat (lang_address_statement
, stat_ptr
);
7171 ad
->section_name
= name
;
7172 ad
->address
= address
;
7173 ad
->segment
= segment
;
7176 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7177 because of a -e argument on the command line, or zero if this is
7178 called by ENTRY in a linker script. Command line arguments take
7182 lang_add_entry (const char *name
, bfd_boolean cmdline
)
7184 if (entry_symbol
.name
== NULL
7186 || !entry_from_cmdline
)
7188 entry_symbol
.name
= name
;
7189 entry_from_cmdline
= cmdline
;
7193 /* Set the default start symbol to NAME. .em files should use this,
7194 not lang_add_entry, to override the use of "start" if neither the
7195 linker script nor the command line specifies an entry point. NAME
7196 must be permanently allocated. */
7198 lang_default_entry (const char *name
)
7200 entry_symbol_default
= name
;
7204 lang_add_target (const char *name
)
7206 lang_target_statement_type
*new_stmt
;
7208 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
7209 new_stmt
->target
= name
;
7213 lang_add_map (const char *name
)
7220 map_option_f
= TRUE
;
7228 lang_add_fill (fill_type
*fill
)
7230 lang_fill_statement_type
*new_stmt
;
7232 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
7233 new_stmt
->fill
= fill
;
7237 lang_add_data (int type
, union etree_union
*exp
)
7239 lang_data_statement_type
*new_stmt
;
7241 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
7242 new_stmt
->exp
= exp
;
7243 new_stmt
->type
= type
;
7246 /* Create a new reloc statement. RELOC is the BFD relocation type to
7247 generate. HOWTO is the corresponding howto structure (we could
7248 look this up, but the caller has already done so). SECTION is the
7249 section to generate a reloc against, or NAME is the name of the
7250 symbol to generate a reloc against. Exactly one of SECTION and
7251 NAME must be NULL. ADDEND is an expression for the addend. */
7254 lang_add_reloc (bfd_reloc_code_real_type reloc
,
7255 reloc_howto_type
*howto
,
7258 union etree_union
*addend
)
7260 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
7264 p
->section
= section
;
7266 p
->addend_exp
= addend
;
7268 p
->addend_value
= 0;
7269 p
->output_section
= NULL
;
7270 p
->output_offset
= 0;
7273 lang_assignment_statement_type
*
7274 lang_add_assignment (etree_type
*exp
)
7276 lang_assignment_statement_type
*new_stmt
;
7278 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
7279 new_stmt
->exp
= exp
;
7284 lang_add_attribute (enum statement_enum attribute
)
7286 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
7290 lang_startup (const char *name
)
7292 if (first_file
->filename
!= NULL
)
7294 einfo (_("%P%F: multiple STARTUP files\n"));
7296 first_file
->filename
= name
;
7297 first_file
->local_sym_name
= name
;
7298 first_file
->flags
.real
= TRUE
;
7302 lang_float (bfd_boolean maybe
)
7304 lang_float_flag
= maybe
;
7308 /* Work out the load- and run-time regions from a script statement, and
7309 store them in *LMA_REGION and *REGION respectively.
7311 MEMSPEC is the name of the run-time region, or the value of
7312 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7313 LMA_MEMSPEC is the name of the load-time region, or null if the
7314 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7315 had an explicit load address.
7317 It is an error to specify both a load region and a load address. */
7320 lang_get_regions (lang_memory_region_type
**region
,
7321 lang_memory_region_type
**lma_region
,
7322 const char *memspec
,
7323 const char *lma_memspec
,
7324 bfd_boolean have_lma
,
7325 bfd_boolean have_vma
)
7327 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7329 /* If no runtime region or VMA has been specified, but the load region
7330 has been specified, then use the load region for the runtime region
7332 if (lma_memspec
!= NULL
7334 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7335 *region
= *lma_region
;
7337 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7339 if (have_lma
&& lma_memspec
!= 0)
7340 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7345 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7346 lang_output_section_phdr_list
*phdrs
,
7347 const char *lma_memspec
)
7349 lang_get_regions (¤t_section
->region
,
7350 ¤t_section
->lma_region
,
7351 memspec
, lma_memspec
,
7352 current_section
->load_base
!= NULL
,
7353 current_section
->addr_tree
!= NULL
);
7355 current_section
->fill
= fill
;
7356 current_section
->phdrs
= phdrs
;
7361 lang_statement_append (lang_statement_list_type
*list
,
7362 lang_statement_union_type
*element
,
7363 lang_statement_union_type
**field
)
7365 *(list
->tail
) = element
;
7369 /* Set the output format type. -oformat overrides scripts. */
7372 lang_add_output_format (const char *format
,
7377 if (output_target
== NULL
|| !from_script
)
7379 if (command_line
.endian
== ENDIAN_BIG
7382 else if (command_line
.endian
== ENDIAN_LITTLE
7386 output_target
= format
;
7391 lang_add_insert (const char *where
, int is_before
)
7393 lang_insert_statement_type
*new_stmt
;
7395 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7396 new_stmt
->where
= where
;
7397 new_stmt
->is_before
= is_before
;
7398 saved_script_handle
= previous_script_handle
;
7401 /* Enter a group. This creates a new lang_group_statement, and sets
7402 stat_ptr to build new statements within the group. */
7405 lang_enter_group (void)
7407 lang_group_statement_type
*g
;
7409 g
= new_stat (lang_group_statement
, stat_ptr
);
7410 lang_list_init (&g
->children
);
7411 push_stat_ptr (&g
->children
);
7414 /* Leave a group. This just resets stat_ptr to start writing to the
7415 regular list of statements again. Note that this will not work if
7416 groups can occur inside anything else which can adjust stat_ptr,
7417 but currently they can't. */
7420 lang_leave_group (void)
7425 /* Add a new program header. This is called for each entry in a PHDRS
7426 command in a linker script. */
7429 lang_new_phdr (const char *name
,
7431 bfd_boolean filehdr
,
7436 struct lang_phdr
*n
, **pp
;
7439 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7442 n
->type
= exp_get_value_int (type
, 0, "program header type");
7443 n
->filehdr
= filehdr
;
7448 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7450 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7453 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7455 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7456 " when prior PT_LOAD headers lack them\n"), NULL
);
7463 /* Record the program header information in the output BFD. FIXME: We
7464 should not be calling an ELF specific function here. */
7467 lang_record_phdrs (void)
7471 lang_output_section_phdr_list
*last
;
7472 struct lang_phdr
*l
;
7473 lang_output_section_statement_type
*os
;
7476 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7479 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7486 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7490 lang_output_section_phdr_list
*pl
;
7492 if (os
->constraint
< 0)
7500 if (os
->sectype
== noload_section
7501 || os
->bfd_section
== NULL
7502 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7505 /* Don't add orphans to PT_INTERP header. */
7511 lang_output_section_statement_type
*tmp_os
;
7513 /* If we have not run across a section with a program
7514 header assigned to it yet, then scan forwards to find
7515 one. This prevents inconsistencies in the linker's
7516 behaviour when a script has specified just a single
7517 header and there are sections in that script which are
7518 not assigned to it, and which occur before the first
7519 use of that header. See here for more details:
7520 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7521 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7524 last
= tmp_os
->phdrs
;
7528 einfo (_("%F%P: no sections assigned to phdrs\n"));
7533 if (os
->bfd_section
== NULL
)
7536 for (; pl
!= NULL
; pl
= pl
->next
)
7538 if (strcmp (pl
->name
, l
->name
) == 0)
7543 secs
= (asection
**) xrealloc (secs
,
7544 alc
* sizeof (asection
*));
7546 secs
[c
] = os
->bfd_section
;
7553 if (l
->flags
== NULL
)
7556 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7561 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7563 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7564 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7565 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7566 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7571 /* Make sure all the phdr assignments succeeded. */
7572 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7576 lang_output_section_phdr_list
*pl
;
7578 if (os
->constraint
< 0
7579 || os
->bfd_section
== NULL
)
7582 for (pl
= os
->phdrs
;
7585 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7586 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7587 os
->name
, pl
->name
);
7591 /* Record a list of sections which may not be cross referenced. */
7594 lang_add_nocrossref (lang_nocrossref_type
*l
)
7596 struct lang_nocrossrefs
*n
;
7598 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7599 n
->next
= nocrossref_list
;
7601 n
->onlyfirst
= FALSE
;
7602 nocrossref_list
= n
;
7604 /* Set notice_all so that we get informed about all symbols. */
7605 link_info
.notice_all
= TRUE
;
7608 /* Record a section that cannot be referenced from a list of sections. */
7611 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
7613 lang_add_nocrossref (l
);
7614 nocrossref_list
->onlyfirst
= TRUE
;
7617 /* Overlay handling. We handle overlays with some static variables. */
7619 /* The overlay virtual address. */
7620 static etree_type
*overlay_vma
;
7621 /* And subsection alignment. */
7622 static etree_type
*overlay_subalign
;
7624 /* An expression for the maximum section size seen so far. */
7625 static etree_type
*overlay_max
;
7627 /* A list of all the sections in this overlay. */
7629 struct overlay_list
{
7630 struct overlay_list
*next
;
7631 lang_output_section_statement_type
*os
;
7634 static struct overlay_list
*overlay_list
;
7636 /* Start handling an overlay. */
7639 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7641 /* The grammar should prevent nested overlays from occurring. */
7642 ASSERT (overlay_vma
== NULL
7643 && overlay_subalign
== NULL
7644 && overlay_max
== NULL
);
7646 overlay_vma
= vma_expr
;
7647 overlay_subalign
= subalign
;
7650 /* Start a section in an overlay. We handle this by calling
7651 lang_enter_output_section_statement with the correct VMA.
7652 lang_leave_overlay sets up the LMA and memory regions. */
7655 lang_enter_overlay_section (const char *name
)
7657 struct overlay_list
*n
;
7660 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7661 0, overlay_subalign
, 0, 0, 0);
7663 /* If this is the first section, then base the VMA of future
7664 sections on this one. This will work correctly even if `.' is
7665 used in the addresses. */
7666 if (overlay_list
== NULL
)
7667 overlay_vma
= exp_nameop (ADDR
, name
);
7669 /* Remember the section. */
7670 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7671 n
->os
= current_section
;
7672 n
->next
= overlay_list
;
7675 size
= exp_nameop (SIZEOF
, name
);
7677 /* Arrange to work out the maximum section end address. */
7678 if (overlay_max
== NULL
)
7681 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7684 /* Finish a section in an overlay. There isn't any special to do
7688 lang_leave_overlay_section (fill_type
*fill
,
7689 lang_output_section_phdr_list
*phdrs
)
7696 name
= current_section
->name
;
7698 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7699 region and that no load-time region has been specified. It doesn't
7700 really matter what we say here, since lang_leave_overlay will
7702 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7704 /* Define the magic symbols. */
7706 clean
= (char *) xmalloc (strlen (name
) + 1);
7708 for (s1
= name
; *s1
!= '\0'; s1
++)
7709 if (ISALNUM (*s1
) || *s1
== '_')
7713 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7714 sprintf (buf
, "__load_start_%s", clean
);
7715 lang_add_assignment (exp_provide (buf
,
7716 exp_nameop (LOADADDR
, name
),
7719 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7720 sprintf (buf
, "__load_stop_%s", clean
);
7721 lang_add_assignment (exp_provide (buf
,
7723 exp_nameop (LOADADDR
, name
),
7724 exp_nameop (SIZEOF
, name
)),
7730 /* Finish an overlay. If there are any overlay wide settings, this
7731 looks through all the sections in the overlay and sets them. */
7734 lang_leave_overlay (etree_type
*lma_expr
,
7737 const char *memspec
,
7738 lang_output_section_phdr_list
*phdrs
,
7739 const char *lma_memspec
)
7741 lang_memory_region_type
*region
;
7742 lang_memory_region_type
*lma_region
;
7743 struct overlay_list
*l
;
7744 lang_nocrossref_type
*nocrossref
;
7746 lang_get_regions (®ion
, &lma_region
,
7747 memspec
, lma_memspec
,
7748 lma_expr
!= NULL
, FALSE
);
7752 /* After setting the size of the last section, set '.' to end of the
7754 if (overlay_list
!= NULL
)
7756 overlay_list
->os
->update_dot
= 1;
7757 overlay_list
->os
->update_dot_tree
7758 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
7764 struct overlay_list
*next
;
7766 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7769 l
->os
->region
= region
;
7770 l
->os
->lma_region
= lma_region
;
7772 /* The first section has the load address specified in the
7773 OVERLAY statement. The rest are worked out from that.
7774 The base address is not needed (and should be null) if
7775 an LMA region was specified. */
7778 l
->os
->load_base
= lma_expr
;
7779 l
->os
->sectype
= normal_section
;
7781 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7782 l
->os
->phdrs
= phdrs
;
7786 lang_nocrossref_type
*nc
;
7788 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7789 nc
->name
= l
->os
->name
;
7790 nc
->next
= nocrossref
;
7799 if (nocrossref
!= NULL
)
7800 lang_add_nocrossref (nocrossref
);
7803 overlay_list
= NULL
;
7807 /* Version handling. This is only useful for ELF. */
7809 /* If PREV is NULL, return first version pattern matching particular symbol.
7810 If PREV is non-NULL, return first version pattern matching particular
7811 symbol after PREV (previously returned by lang_vers_match). */
7813 static struct bfd_elf_version_expr
*
7814 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7815 struct bfd_elf_version_expr
*prev
,
7819 const char *cxx_sym
= sym
;
7820 const char *java_sym
= sym
;
7821 struct bfd_elf_version_expr
*expr
= NULL
;
7822 enum demangling_styles curr_style
;
7824 curr_style
= CURRENT_DEMANGLING_STYLE
;
7825 cplus_demangle_set_style (no_demangling
);
7826 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7829 cplus_demangle_set_style (curr_style
);
7831 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7833 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7834 DMGL_PARAMS
| DMGL_ANSI
);
7838 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7840 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7845 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7847 struct bfd_elf_version_expr e
;
7849 switch (prev
? prev
->mask
: 0)
7852 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7855 expr
= (struct bfd_elf_version_expr
*)
7856 htab_find ((htab_t
) head
->htab
, &e
);
7857 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7858 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7864 case BFD_ELF_VERSION_C_TYPE
:
7865 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7867 e
.pattern
= cxx_sym
;
7868 expr
= (struct bfd_elf_version_expr
*)
7869 htab_find ((htab_t
) head
->htab
, &e
);
7870 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7871 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7877 case BFD_ELF_VERSION_CXX_TYPE
:
7878 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7880 e
.pattern
= java_sym
;
7881 expr
= (struct bfd_elf_version_expr
*)
7882 htab_find ((htab_t
) head
->htab
, &e
);
7883 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7884 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7895 /* Finally, try the wildcards. */
7896 if (prev
== NULL
|| prev
->literal
)
7897 expr
= head
->remaining
;
7900 for (; expr
; expr
= expr
->next
)
7907 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7910 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7912 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7916 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7922 free ((char *) c_sym
);
7924 free ((char *) cxx_sym
);
7925 if (java_sym
!= sym
)
7926 free ((char *) java_sym
);
7930 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7931 return a pointer to the symbol name with any backslash quotes removed. */
7934 realsymbol (const char *pattern
)
7937 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7938 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7940 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7942 /* It is a glob pattern only if there is no preceding
7946 /* Remove the preceding backslash. */
7953 if (*p
== '?' || *p
== '*' || *p
== '[')
7960 backslash
= *p
== '\\';
7976 /* This is called for each variable name or match expression. NEW_NAME is
7977 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7978 pattern to be matched against symbol names. */
7980 struct bfd_elf_version_expr
*
7981 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7982 const char *new_name
,
7984 bfd_boolean literal_p
)
7986 struct bfd_elf_version_expr
*ret
;
7988 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7992 ret
->literal
= TRUE
;
7993 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7994 if (ret
->pattern
== NULL
)
7996 ret
->pattern
= new_name
;
7997 ret
->literal
= FALSE
;
8000 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
8001 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8002 else if (strcasecmp (lang
, "C++") == 0)
8003 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
8004 else if (strcasecmp (lang
, "Java") == 0)
8005 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
8008 einfo (_("%X%P: unknown language `%s' in version information\n"),
8010 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
8013 return ldemul_new_vers_pattern (ret
);
8016 /* This is called for each set of variable names and match
8019 struct bfd_elf_version_tree
*
8020 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
8021 struct bfd_elf_version_expr
*locals
)
8023 struct bfd_elf_version_tree
*ret
;
8025 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
8026 ret
->globals
.list
= globals
;
8027 ret
->locals
.list
= locals
;
8028 ret
->match
= lang_vers_match
;
8029 ret
->name_indx
= (unsigned int) -1;
8033 /* This static variable keeps track of version indices. */
8035 static int version_index
;
8038 version_expr_head_hash (const void *p
)
8040 const struct bfd_elf_version_expr
*e
=
8041 (const struct bfd_elf_version_expr
*) p
;
8043 return htab_hash_string (e
->pattern
);
8047 version_expr_head_eq (const void *p1
, const void *p2
)
8049 const struct bfd_elf_version_expr
*e1
=
8050 (const struct bfd_elf_version_expr
*) p1
;
8051 const struct bfd_elf_version_expr
*e2
=
8052 (const struct bfd_elf_version_expr
*) p2
;
8054 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
8058 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
8061 struct bfd_elf_version_expr
*e
, *next
;
8062 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
8064 for (e
= head
->list
; e
; e
= e
->next
)
8068 head
->mask
|= e
->mask
;
8073 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
8074 version_expr_head_eq
, NULL
);
8075 list_loc
= &head
->list
;
8076 remaining_loc
= &head
->remaining
;
8077 for (e
= head
->list
; e
; e
= next
)
8083 remaining_loc
= &e
->next
;
8087 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
8091 struct bfd_elf_version_expr
*e1
, *last
;
8093 e1
= (struct bfd_elf_version_expr
*) *loc
;
8097 if (e1
->mask
== e
->mask
)
8105 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
8109 /* This is a duplicate. */
8110 /* FIXME: Memory leak. Sometimes pattern is not
8111 xmalloced alone, but in larger chunk of memory. */
8112 /* free (e->pattern); */
8117 e
->next
= last
->next
;
8125 list_loc
= &e
->next
;
8129 *remaining_loc
= NULL
;
8130 *list_loc
= head
->remaining
;
8133 head
->remaining
= head
->list
;
8136 /* This is called when we know the name and dependencies of the
8140 lang_register_vers_node (const char *name
,
8141 struct bfd_elf_version_tree
*version
,
8142 struct bfd_elf_version_deps
*deps
)
8144 struct bfd_elf_version_tree
*t
, **pp
;
8145 struct bfd_elf_version_expr
*e1
;
8150 if (link_info
.version_info
!= NULL
8151 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
8153 einfo (_("%X%P: anonymous version tag cannot be combined"
8154 " with other version tags\n"));
8159 /* Make sure this node has a unique name. */
8160 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8161 if (strcmp (t
->name
, name
) == 0)
8162 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
8164 lang_finalize_version_expr_head (&version
->globals
);
8165 lang_finalize_version_expr_head (&version
->locals
);
8167 /* Check the global and local match names, and make sure there
8168 aren't any duplicates. */
8170 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
8172 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8174 struct bfd_elf_version_expr
*e2
;
8176 if (t
->locals
.htab
&& e1
->literal
)
8178 e2
= (struct bfd_elf_version_expr
*)
8179 htab_find ((htab_t
) t
->locals
.htab
, e1
);
8180 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8182 if (e1
->mask
== e2
->mask
)
8183 einfo (_("%X%P: duplicate expression `%s'"
8184 " in version information\n"), e1
->pattern
);
8188 else if (!e1
->literal
)
8189 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8190 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8191 && e1
->mask
== e2
->mask
)
8192 einfo (_("%X%P: duplicate expression `%s'"
8193 " in version information\n"), e1
->pattern
);
8197 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
8199 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8201 struct bfd_elf_version_expr
*e2
;
8203 if (t
->globals
.htab
&& e1
->literal
)
8205 e2
= (struct bfd_elf_version_expr
*)
8206 htab_find ((htab_t
) t
->globals
.htab
, e1
);
8207 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8209 if (e1
->mask
== e2
->mask
)
8210 einfo (_("%X%P: duplicate expression `%s'"
8211 " in version information\n"),
8216 else if (!e1
->literal
)
8217 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8218 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8219 && e1
->mask
== e2
->mask
)
8220 einfo (_("%X%P: duplicate expression `%s'"
8221 " in version information\n"), e1
->pattern
);
8225 version
->deps
= deps
;
8226 version
->name
= name
;
8227 if (name
[0] != '\0')
8230 version
->vernum
= version_index
;
8233 version
->vernum
= 0;
8235 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8240 /* This is called when we see a version dependency. */
8242 struct bfd_elf_version_deps
*
8243 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
8245 struct bfd_elf_version_deps
*ret
;
8246 struct bfd_elf_version_tree
*t
;
8248 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
8251 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8253 if (strcmp (t
->name
, name
) == 0)
8255 ret
->version_needed
= t
;
8260 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
8262 ret
->version_needed
= NULL
;
8267 lang_do_version_exports_section (void)
8269 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
8271 LANG_FOR_EACH_INPUT_STATEMENT (is
)
8273 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
8281 contents
= (char *) xmalloc (len
);
8282 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
8283 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
8286 while (p
< contents
+ len
)
8288 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
8289 p
= strchr (p
, '\0') + 1;
8292 /* Do not free the contents, as we used them creating the regex. */
8294 /* Do not include this section in the link. */
8295 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
8298 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
8299 lang_register_vers_node (command_line
.version_exports_section
,
8300 lang_new_vers_node (greg
, lreg
), NULL
);
8303 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8306 lang_do_memory_regions (void)
8308 lang_memory_region_type
*r
= lang_memory_region_list
;
8310 for (; r
!= NULL
; r
= r
->next
)
8314 exp_fold_tree_no_dot (r
->origin_exp
);
8315 if (expld
.result
.valid_p
)
8317 r
->origin
= expld
.result
.value
;
8318 r
->current
= r
->origin
;
8321 einfo (_("%F%P: invalid origin for memory region %s\n"),
8326 exp_fold_tree_no_dot (r
->length_exp
);
8327 if (expld
.result
.valid_p
)
8328 r
->length
= expld
.result
.value
;
8330 einfo (_("%F%P: invalid length for memory region %s\n"),
8337 lang_add_unique (const char *name
)
8339 struct unique_sections
*ent
;
8341 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8342 if (strcmp (ent
->name
, name
) == 0)
8345 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8346 ent
->name
= xstrdup (name
);
8347 ent
->next
= unique_section_list
;
8348 unique_section_list
= ent
;
8351 /* Append the list of dynamic symbols to the existing one. */
8354 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8356 if (link_info
.dynamic_list
)
8358 struct bfd_elf_version_expr
*tail
;
8359 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8361 tail
->next
= link_info
.dynamic_list
->head
.list
;
8362 link_info
.dynamic_list
->head
.list
= dynamic
;
8366 struct bfd_elf_dynamic_list
*d
;
8368 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8369 d
->head
.list
= dynamic
;
8370 d
->match
= lang_vers_match
;
8371 link_info
.dynamic_list
= d
;
8375 /* Append the list of C++ typeinfo dynamic symbols to the existing
8379 lang_append_dynamic_list_cpp_typeinfo (void)
8381 const char *symbols
[] =
8383 "typeinfo name for*",
8386 struct bfd_elf_version_expr
*dynamic
= NULL
;
8389 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8390 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8393 lang_append_dynamic_list (dynamic
);
8396 /* Append the list of C++ operator new and delete dynamic symbols to the
8400 lang_append_dynamic_list_cpp_new (void)
8402 const char *symbols
[] =
8407 struct bfd_elf_version_expr
*dynamic
= NULL
;
8410 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8411 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8414 lang_append_dynamic_list (dynamic
);
8417 /* Scan a space and/or comma separated string of features. */
8420 lang_ld_feature (char *str
)
8428 while (*p
== ',' || ISSPACE (*p
))
8433 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8437 if (strcasecmp (p
, "SANE_EXPR") == 0)
8438 config
.sane_expr
= TRUE
;
8440 einfo (_("%X%P: unknown feature `%s'\n"), p
);
8446 /* Pretty print memory amount. */
8449 lang_print_memory_size (bfd_vma sz
)
8451 if ((sz
& 0x3fffffff) == 0)
8452 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
8453 else if ((sz
& 0xfffff) == 0)
8454 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
8455 else if ((sz
& 0x3ff) == 0)
8456 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
8458 printf (" %10" BFD_VMA_FMT
"u B", sz
);
8461 /* Implement --print-memory-usage: disply per region memory usage. */
8464 lang_print_memory_usage (void)
8466 lang_memory_region_type
*r
;
8468 printf ("Memory region Used Size Region Size %%age Used\n");
8469 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
8471 bfd_vma used_length
= r
->current
- r
->origin
;
8474 printf ("%16s: ",r
->name_list
.name
);
8475 lang_print_memory_size (used_length
);
8476 lang_print_memory_size ((bfd_vma
) r
->length
);
8478 percent
= used_length
* 100.0 / r
->length
;
8480 printf (" %6.2f%%\n", percent
);