1 /* Linker command language support.
2 Copyright (C) 1991-2014 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 /* Locals variables. */
52 static struct obstack stat_obstack
;
53 static struct obstack map_obstack
;
55 #define obstack_chunk_alloc xmalloc
56 #define obstack_chunk_free free
57 static const char *entry_symbol_default
= "start";
58 static bfd_boolean placed_commons
= FALSE
;
59 static bfd_boolean stripped_excluded_sections
= FALSE
;
60 static lang_output_section_statement_type
*default_common_section
;
61 static bfd_boolean map_option_f
;
62 static bfd_vma print_dot
;
63 static lang_input_statement_type
*first_file
;
64 static const char *current_target
;
65 static lang_statement_list_type statement_list
;
66 static struct bfd_hash_table lang_definedness_table
;
67 static lang_statement_list_type
*stat_save
[10];
68 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
69 static struct unique_sections
*unique_section_list
;
70 static struct asneeded_minfo
*asneeded_list_head
;
72 /* Forward declarations. */
73 static void exp_init_os (etree_type
*);
74 static lang_input_statement_type
*lookup_name (const char *);
75 static struct bfd_hash_entry
*lang_definedness_newfunc
76 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
77 static void insert_undefined (const char *);
78 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
79 static void print_statement (lang_statement_union_type
*,
80 lang_output_section_statement_type
*);
81 static void print_statement_list (lang_statement_union_type
*,
82 lang_output_section_statement_type
*);
83 static void print_statements (void);
84 static void print_input_section (asection
*, bfd_boolean
);
85 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
86 static void lang_record_phdrs (void);
87 static void lang_do_version_exports_section (void);
88 static void lang_finalize_version_expr_head
89 (struct bfd_elf_version_expr_head
*);
91 /* Exported variables. */
92 const char *output_target
;
93 lang_output_section_statement_type
*abs_output_section
;
94 lang_statement_list_type lang_output_section_statement
;
95 lang_statement_list_type
*stat_ptr
= &statement_list
;
96 lang_statement_list_type file_chain
= { NULL
, NULL
};
97 lang_statement_list_type input_file_chain
;
98 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
99 const char *entry_section
= ".text";
100 struct lang_input_statement_flags input_flags
;
101 bfd_boolean entry_from_cmdline
;
102 bfd_boolean undef_from_cmdline
;
103 bfd_boolean lang_has_input_file
= FALSE
;
104 bfd_boolean had_output_filename
= FALSE
;
105 bfd_boolean lang_float_flag
= FALSE
;
106 bfd_boolean delete_output_file_on_failure
= FALSE
;
107 struct lang_phdr
*lang_phdr_list
;
108 struct lang_nocrossrefs
*nocrossref_list
;
109 struct asneeded_minfo
**asneeded_list_tail
;
111 /* Functions that traverse the linker script and might evaluate
112 DEFINED() need to increment this at the start of the traversal. */
113 int lang_statement_iteration
= 0;
115 /* Return TRUE if the PATTERN argument is a wildcard pattern.
116 Although backslashes are treated specially if a pattern contains
117 wildcards, we do not consider the mere presence of a backslash to
118 be enough to cause the pattern to be treated as a wildcard.
119 That lets us handle DOS filenames more naturally. */
120 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
122 #define new_stat(x, y) \
123 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
125 #define outside_section_address(q) \
126 ((q)->output_offset + (q)->output_section->vma)
128 #define outside_symbol_address(q) \
129 ((q)->value + outside_section_address (q->section))
131 #define SECTION_NAME_MAP_LENGTH (16)
134 stat_alloc (size_t size
)
136 return obstack_alloc (&stat_obstack
, size
);
140 name_match (const char *pattern
, const char *name
)
142 if (wildcardp (pattern
))
143 return fnmatch (pattern
, name
, 0);
144 return strcmp (pattern
, name
);
147 /* If PATTERN is of the form archive:file, return a pointer to the
148 separator. If not, return NULL. */
151 archive_path (const char *pattern
)
155 if (link_info
.path_separator
== 0)
158 p
= strchr (pattern
, link_info
.path_separator
);
159 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
160 if (p
== NULL
|| link_info
.path_separator
!= ':')
163 /* Assume a match on the second char is part of drive specifier,
164 as in "c:\silly.dos". */
165 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
166 p
= strchr (p
+ 1, link_info
.path_separator
);
171 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
172 return whether F matches FILE_SPEC. */
175 input_statement_is_archive_path (const char *file_spec
, char *sep
,
176 lang_input_statement_type
*f
)
178 bfd_boolean match
= FALSE
;
181 || name_match (sep
+ 1, f
->filename
) == 0)
182 && ((sep
!= file_spec
)
183 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
187 if (sep
!= file_spec
)
189 const char *aname
= f
->the_bfd
->my_archive
->filename
;
191 match
= name_match (file_spec
, aname
) == 0;
192 *sep
= link_info
.path_separator
;
199 unique_section_p (const asection
*sec
,
200 const lang_output_section_statement_type
*os
)
202 struct unique_sections
*unam
;
205 if (link_info
.relocatable
206 && sec
->owner
!= NULL
207 && bfd_is_group_section (sec
->owner
, sec
))
209 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
212 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
213 if (name_match (unam
->name
, secnam
) == 0)
219 /* Generic traversal routines for finding matching sections. */
221 /* Try processing a section against a wildcard. This just calls
222 the callback unless the filename exclusion list is present
223 and excludes the file. It's hardly ever present so this
224 function is very fast. */
227 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
228 lang_input_statement_type
*file
,
230 struct wildcard_list
*sec
,
234 struct name_list
*list_tmp
;
236 /* Don't process sections from files which were excluded. */
237 for (list_tmp
= sec
->spec
.exclude_name_list
;
239 list_tmp
= list_tmp
->next
)
241 char *p
= archive_path (list_tmp
->name
);
245 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
249 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
252 /* FIXME: Perhaps remove the following at some stage? Matching
253 unadorned archives like this was never documented and has
254 been superceded by the archive:path syntax. */
255 else if (file
->the_bfd
!= NULL
256 && file
->the_bfd
->my_archive
!= NULL
257 && name_match (list_tmp
->name
,
258 file
->the_bfd
->my_archive
->filename
) == 0)
262 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
265 /* Lowest common denominator routine that can handle everything correctly,
269 walk_wild_section_general (lang_wild_statement_type
*ptr
,
270 lang_input_statement_type
*file
,
275 struct wildcard_list
*sec
;
277 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
279 sec
= ptr
->section_list
;
281 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
285 bfd_boolean skip
= FALSE
;
287 if (sec
->spec
.name
!= NULL
)
289 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
291 skip
= name_match (sec
->spec
.name
, sname
) != 0;
295 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
302 /* Routines to find a single section given its name. If there's more
303 than one section with that name, we report that. */
307 asection
*found_section
;
308 bfd_boolean multiple_sections_found
;
309 } section_iterator_callback_data
;
312 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
314 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
316 if (d
->found_section
!= NULL
)
318 d
->multiple_sections_found
= TRUE
;
322 d
->found_section
= s
;
327 find_section (lang_input_statement_type
*file
,
328 struct wildcard_list
*sec
,
329 bfd_boolean
*multiple_sections_found
)
331 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
333 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
334 section_iterator_callback
, &cb_data
);
335 *multiple_sections_found
= cb_data
.multiple_sections_found
;
336 return cb_data
.found_section
;
339 /* Code for handling simple wildcards without going through fnmatch,
340 which can be expensive because of charset translations etc. */
342 /* A simple wild is a literal string followed by a single '*',
343 where the literal part is at least 4 characters long. */
346 is_simple_wild (const char *name
)
348 size_t len
= strcspn (name
, "*?[");
349 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
353 match_simple_wild (const char *pattern
, const char *name
)
355 /* The first four characters of the pattern are guaranteed valid
356 non-wildcard characters. So we can go faster. */
357 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
358 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
363 while (*pattern
!= '*')
364 if (*name
++ != *pattern
++)
370 /* Return the numerical value of the init_priority attribute from
371 section name NAME. */
374 get_init_priority (const char *name
)
377 unsigned long init_priority
;
379 /* GCC uses the following section names for the init_priority
380 attribute with numerical values 101 and 65535 inclusive. A
381 lower value means a higher priority.
383 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
384 decimal numerical value of the init_priority attribute.
385 The order of execution in .init_array is forward and
386 .fini_array is backward.
387 2: .ctors.NNNN/.dtors.NNNN: Where NNNN is 65535 minus the
388 decimal numerical value of the init_priority attribute.
389 The order of execution in .ctors is backward and .dtors
392 if (strncmp (name
, ".init_array.", 12) == 0
393 || strncmp (name
, ".fini_array.", 12) == 0)
395 init_priority
= strtoul (name
+ 12, &end
, 10);
396 return *end
? 0 : init_priority
;
398 else if (strncmp (name
, ".ctors.", 7) == 0
399 || strncmp (name
, ".dtors.", 7) == 0)
401 init_priority
= strtoul (name
+ 7, &end
, 10);
402 return *end
? 0 : 65535 - init_priority
;
408 /* Compare sections ASEC and BSEC according to SORT. */
411 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
414 unsigned long ainit_priority
, binit_priority
;
421 case by_init_priority
:
423 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
425 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
426 if (ainit_priority
== 0 || binit_priority
== 0)
428 ret
= ainit_priority
- binit_priority
;
434 case by_alignment_name
:
435 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
436 - bfd_section_alignment (asec
->owner
, asec
));
443 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
444 bfd_get_section_name (bsec
->owner
, bsec
));
447 case by_name_alignment
:
448 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
449 bfd_get_section_name (bsec
->owner
, bsec
));
455 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
456 - bfd_section_alignment (asec
->owner
, asec
));
463 /* Build a Binary Search Tree to sort sections, unlike insertion sort
464 used in wild_sort(). BST is considerably faster if the number of
465 of sections are large. */
467 static lang_section_bst_type
**
468 wild_sort_fast (lang_wild_statement_type
*wild
,
469 struct wildcard_list
*sec
,
470 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
473 lang_section_bst_type
**tree
;
476 if (!wild
->filenames_sorted
477 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
479 /* Append at the right end of tree. */
481 tree
= &((*tree
)->right
);
487 /* Find the correct node to append this section. */
488 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
489 tree
= &((*tree
)->left
);
491 tree
= &((*tree
)->right
);
497 /* Use wild_sort_fast to build a BST to sort sections. */
500 output_section_callback_fast (lang_wild_statement_type
*ptr
,
501 struct wildcard_list
*sec
,
503 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
504 lang_input_statement_type
*file
,
507 lang_section_bst_type
*node
;
508 lang_section_bst_type
**tree
;
509 lang_output_section_statement_type
*os
;
511 os
= (lang_output_section_statement_type
*) output
;
513 if (unique_section_p (section
, os
))
516 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
519 node
->section
= section
;
521 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
526 /* Convert a sorted sections' BST back to list form. */
529 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
530 lang_section_bst_type
*tree
,
534 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
536 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
537 (lang_output_section_statement_type
*) output
);
540 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
545 /* Specialized, optimized routines for handling different kinds of
549 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
550 lang_input_statement_type
*file
,
554 /* We can just do a hash lookup for the section with the right name.
555 But if that lookup discovers more than one section with the name
556 (should be rare), we fall back to the general algorithm because
557 we would otherwise have to sort the sections to make sure they
558 get processed in the bfd's order. */
559 bfd_boolean multiple_sections_found
;
560 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
561 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
563 if (multiple_sections_found
)
564 walk_wild_section_general (ptr
, file
, callback
, data
);
566 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
570 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
571 lang_input_statement_type
*file
,
576 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
578 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
580 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
581 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
584 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
589 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
590 lang_input_statement_type
*file
,
595 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
596 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
597 bfd_boolean multiple_sections_found
;
598 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
600 if (multiple_sections_found
)
602 walk_wild_section_general (ptr
, file
, callback
, data
);
606 /* Note that if the section was not found, s0 is NULL and
607 we'll simply never succeed the s == s0 test below. */
608 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
610 /* Recall that in this code path, a section cannot satisfy more
611 than one spec, so if s == s0 then it cannot match
614 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
617 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
618 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
621 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
628 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
629 lang_input_statement_type
*file
,
634 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
635 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
636 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
637 bfd_boolean multiple_sections_found
;
638 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
640 if (multiple_sections_found
)
642 walk_wild_section_general (ptr
, file
, callback
, data
);
646 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
649 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
652 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
653 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
656 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
659 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
661 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
669 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
670 lang_input_statement_type
*file
,
675 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
676 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
677 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
678 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
679 bfd_boolean multiple_sections_found
;
680 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
682 if (multiple_sections_found
)
684 walk_wild_section_general (ptr
, file
, callback
, data
);
688 s1
= find_section (file
, sec1
, &multiple_sections_found
);
689 if (multiple_sections_found
)
691 walk_wild_section_general (ptr
, file
, callback
, data
);
695 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
698 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
701 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
704 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
705 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
709 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
713 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
715 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
723 walk_wild_section (lang_wild_statement_type
*ptr
,
724 lang_input_statement_type
*file
,
728 if (file
->flags
.just_syms
)
731 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
734 /* Returns TRUE when name1 is a wildcard spec that might match
735 something name2 can match. We're conservative: we return FALSE
736 only if the prefixes of name1 and name2 are different up to the
737 first wildcard character. */
740 wild_spec_can_overlap (const char *name1
, const char *name2
)
742 size_t prefix1_len
= strcspn (name1
, "?*[");
743 size_t prefix2_len
= strcspn (name2
, "?*[");
744 size_t min_prefix_len
;
746 /* Note that if there is no wildcard character, then we treat the
747 terminating 0 as part of the prefix. Thus ".text" won't match
748 ".text." or ".text.*", for example. */
749 if (name1
[prefix1_len
] == '\0')
751 if (name2
[prefix2_len
] == '\0')
754 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
756 return memcmp (name1
, name2
, min_prefix_len
) == 0;
759 /* Select specialized code to handle various kinds of wildcard
763 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
766 int wild_name_count
= 0;
767 struct wildcard_list
*sec
;
771 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
772 ptr
->handler_data
[0] = NULL
;
773 ptr
->handler_data
[1] = NULL
;
774 ptr
->handler_data
[2] = NULL
;
775 ptr
->handler_data
[3] = NULL
;
778 /* Count how many wildcard_specs there are, and how many of those
779 actually use wildcards in the name. Also, bail out if any of the
780 wildcard names are NULL. (Can this actually happen?
781 walk_wild_section used to test for it.) And bail out if any
782 of the wildcards are more complex than a simple string
783 ending in a single '*'. */
784 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
787 if (sec
->spec
.name
== NULL
)
789 if (wildcardp (sec
->spec
.name
))
792 if (!is_simple_wild (sec
->spec
.name
))
797 /* The zero-spec case would be easy to optimize but it doesn't
798 happen in practice. Likewise, more than 4 specs doesn't
799 happen in practice. */
800 if (sec_count
== 0 || sec_count
> 4)
803 /* Check that no two specs can match the same section. */
804 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
806 struct wildcard_list
*sec2
;
807 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
809 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
814 signature
= (sec_count
<< 8) + wild_name_count
;
818 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
821 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
824 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
827 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
830 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
836 /* Now fill the data array with pointers to the specs, first the
837 specs with non-wildcard names, then the specs with wildcard
838 names. It's OK to process the specs in different order from the
839 given order, because we've already determined that no section
840 will match more than one spec. */
842 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
843 if (!wildcardp (sec
->spec
.name
))
844 ptr
->handler_data
[data_counter
++] = sec
;
845 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
846 if (wildcardp (sec
->spec
.name
))
847 ptr
->handler_data
[data_counter
++] = sec
;
850 /* Handle a wild statement for a single file F. */
853 walk_wild_file (lang_wild_statement_type
*s
,
854 lang_input_statement_type
*f
,
858 if (f
->the_bfd
== NULL
859 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
860 walk_wild_section (s
, f
, callback
, data
);
865 /* This is an archive file. We must map each member of the
866 archive separately. */
867 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
868 while (member
!= NULL
)
870 /* When lookup_name is called, it will call the add_symbols
871 entry point for the archive. For each element of the
872 archive which is included, BFD will call ldlang_add_file,
873 which will set the usrdata field of the member to the
874 lang_input_statement. */
875 if (member
->usrdata
!= NULL
)
877 walk_wild_section (s
,
878 (lang_input_statement_type
*) member
->usrdata
,
882 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
888 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
890 const char *file_spec
= s
->filename
;
893 if (file_spec
== NULL
)
895 /* Perform the iteration over all files in the list. */
896 LANG_FOR_EACH_INPUT_STATEMENT (f
)
898 walk_wild_file (s
, f
, callback
, data
);
901 else if ((p
= archive_path (file_spec
)) != NULL
)
903 LANG_FOR_EACH_INPUT_STATEMENT (f
)
905 if (input_statement_is_archive_path (file_spec
, p
, f
))
906 walk_wild_file (s
, f
, callback
, data
);
909 else if (wildcardp (file_spec
))
911 LANG_FOR_EACH_INPUT_STATEMENT (f
)
913 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
914 walk_wild_file (s
, f
, callback
, data
);
919 lang_input_statement_type
*f
;
921 /* Perform the iteration over a single file. */
922 f
= lookup_name (file_spec
);
924 walk_wild_file (s
, f
, callback
, data
);
928 /* lang_for_each_statement walks the parse tree and calls the provided
929 function for each node, except those inside output section statements
930 with constraint set to -1. */
933 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
934 lang_statement_union_type
*s
)
936 for (; s
!= NULL
; s
= s
->header
.next
)
940 switch (s
->header
.type
)
942 case lang_constructors_statement_enum
:
943 lang_for_each_statement_worker (func
, constructor_list
.head
);
945 case lang_output_section_statement_enum
:
946 if (s
->output_section_statement
.constraint
!= -1)
947 lang_for_each_statement_worker
948 (func
, s
->output_section_statement
.children
.head
);
950 case lang_wild_statement_enum
:
951 lang_for_each_statement_worker (func
,
952 s
->wild_statement
.children
.head
);
954 case lang_group_statement_enum
:
955 lang_for_each_statement_worker (func
,
956 s
->group_statement
.children
.head
);
958 case lang_data_statement_enum
:
959 case lang_reloc_statement_enum
:
960 case lang_object_symbols_statement_enum
:
961 case lang_output_statement_enum
:
962 case lang_target_statement_enum
:
963 case lang_input_section_enum
:
964 case lang_input_statement_enum
:
965 case lang_assignment_statement_enum
:
966 case lang_padding_statement_enum
:
967 case lang_address_statement_enum
:
968 case lang_fill_statement_enum
:
969 case lang_insert_statement_enum
:
979 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
981 lang_for_each_statement_worker (func
, statement_list
.head
);
984 /*----------------------------------------------------------------------*/
987 lang_list_init (lang_statement_list_type
*list
)
990 list
->tail
= &list
->head
;
994 push_stat_ptr (lang_statement_list_type
*new_ptr
)
996 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
998 *stat_save_ptr
++ = stat_ptr
;
1005 if (stat_save_ptr
<= stat_save
)
1007 stat_ptr
= *--stat_save_ptr
;
1010 /* Build a new statement node for the parse tree. */
1012 static lang_statement_union_type
*
1013 new_statement (enum statement_enum type
,
1015 lang_statement_list_type
*list
)
1017 lang_statement_union_type
*new_stmt
;
1019 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1020 new_stmt
->header
.type
= type
;
1021 new_stmt
->header
.next
= NULL
;
1022 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1026 /* Build a new input file node for the language. There are several
1027 ways in which we treat an input file, eg, we only look at symbols,
1028 or prefix it with a -l etc.
1030 We can be supplied with requests for input files more than once;
1031 they may, for example be split over several lines like foo.o(.text)
1032 foo.o(.data) etc, so when asked for a file we check that we haven't
1033 got it already so we don't duplicate the bfd. */
1035 static lang_input_statement_type
*
1036 new_afile (const char *name
,
1037 lang_input_file_enum_type file_type
,
1039 bfd_boolean add_to_list
)
1041 lang_input_statement_type
*p
;
1043 lang_has_input_file
= TRUE
;
1046 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1049 p
= (lang_input_statement_type
*)
1050 stat_alloc (sizeof (lang_input_statement_type
));
1051 p
->header
.type
= lang_input_statement_enum
;
1052 p
->header
.next
= NULL
;
1055 memset (&p
->the_bfd
, 0,
1056 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1058 p
->flags
.dynamic
= input_flags
.dynamic
;
1059 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1060 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1061 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1062 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1066 case lang_input_file_is_symbols_only_enum
:
1068 p
->local_sym_name
= name
;
1069 p
->flags
.real
= TRUE
;
1070 p
->flags
.just_syms
= TRUE
;
1072 case lang_input_file_is_fake_enum
:
1074 p
->local_sym_name
= name
;
1076 case lang_input_file_is_l_enum
:
1077 if (name
[0] == ':' && name
[1] != '\0')
1079 p
->filename
= name
+ 1;
1080 p
->flags
.full_name_provided
= TRUE
;
1084 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1085 p
->flags
.maybe_archive
= TRUE
;
1086 p
->flags
.real
= TRUE
;
1087 p
->flags
.search_dirs
= TRUE
;
1089 case lang_input_file_is_marker_enum
:
1091 p
->local_sym_name
= name
;
1092 p
->flags
.search_dirs
= TRUE
;
1094 case lang_input_file_is_search_file_enum
:
1096 p
->local_sym_name
= name
;
1097 p
->flags
.real
= TRUE
;
1098 p
->flags
.search_dirs
= TRUE
;
1100 case lang_input_file_is_file_enum
:
1102 p
->local_sym_name
= name
;
1103 p
->flags
.real
= TRUE
;
1109 lang_statement_append (&input_file_chain
,
1110 (lang_statement_union_type
*) p
,
1111 &p
->next_real_file
);
1115 lang_input_statement_type
*
1116 lang_add_input_file (const char *name
,
1117 lang_input_file_enum_type file_type
,
1120 return new_afile (name
, file_type
, target
, TRUE
);
1123 struct out_section_hash_entry
1125 struct bfd_hash_entry root
;
1126 lang_statement_union_type s
;
1129 /* The hash table. */
1131 static struct bfd_hash_table output_section_statement_table
;
1133 /* Support routines for the hash table used by lang_output_section_find,
1134 initialize the table, fill in an entry and remove the table. */
1136 static struct bfd_hash_entry
*
1137 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1138 struct bfd_hash_table
*table
,
1141 lang_output_section_statement_type
**nextp
;
1142 struct out_section_hash_entry
*ret
;
1146 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1152 entry
= bfd_hash_newfunc (entry
, table
, string
);
1156 ret
= (struct out_section_hash_entry
*) entry
;
1157 memset (&ret
->s
, 0, sizeof (ret
->s
));
1158 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1159 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1160 ret
->s
.output_section_statement
.section_alignment
= -1;
1161 ret
->s
.output_section_statement
.block_value
= 1;
1162 lang_list_init (&ret
->s
.output_section_statement
.children
);
1163 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1165 /* For every output section statement added to the list, except the
1166 first one, lang_output_section_statement.tail points to the "next"
1167 field of the last element of the list. */
1168 if (lang_output_section_statement
.head
!= NULL
)
1169 ret
->s
.output_section_statement
.prev
1170 = ((lang_output_section_statement_type
*)
1171 ((char *) lang_output_section_statement
.tail
1172 - offsetof (lang_output_section_statement_type
, next
)));
1174 /* GCC's strict aliasing rules prevent us from just casting the
1175 address, so we store the pointer in a variable and cast that
1177 nextp
= &ret
->s
.output_section_statement
.next
;
1178 lang_statement_append (&lang_output_section_statement
,
1180 (lang_statement_union_type
**) nextp
);
1185 output_section_statement_table_init (void)
1187 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1188 output_section_statement_newfunc
,
1189 sizeof (struct out_section_hash_entry
),
1191 einfo (_("%P%F: can not create hash table: %E\n"));
1195 output_section_statement_table_free (void)
1197 bfd_hash_table_free (&output_section_statement_table
);
1200 /* Build enough state so that the parser can build its tree. */
1205 obstack_begin (&stat_obstack
, 1000);
1207 stat_ptr
= &statement_list
;
1209 output_section_statement_table_init ();
1211 lang_list_init (stat_ptr
);
1213 lang_list_init (&input_file_chain
);
1214 lang_list_init (&lang_output_section_statement
);
1215 lang_list_init (&file_chain
);
1216 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1218 abs_output_section
=
1219 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1221 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1223 /* The value "13" is ad-hoc, somewhat related to the expected number of
1224 assignments in a linker script. */
1225 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1226 lang_definedness_newfunc
,
1227 sizeof (struct lang_definedness_hash_entry
),
1229 einfo (_("%P%F: can not create hash table: %E\n"));
1231 asneeded_list_head
= NULL
;
1232 asneeded_list_tail
= &asneeded_list_head
;
1238 bfd_hash_table_free (&lang_definedness_table
);
1239 output_section_statement_table_free ();
1242 /*----------------------------------------------------------------------
1243 A region is an area of memory declared with the
1244 MEMORY { name:org=exp, len=exp ... }
1247 We maintain a list of all the regions here.
1249 If no regions are specified in the script, then the default is used
1250 which is created when looked up to be the entire data space.
1252 If create is true we are creating a region inside a MEMORY block.
1253 In this case it is probably an error to create a region that has
1254 already been created. If we are not inside a MEMORY block it is
1255 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1256 and so we issue a warning.
1258 Each region has at least one name. The first name is either
1259 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1260 alias names to an existing region within a script with
1261 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1264 static lang_memory_region_type
*lang_memory_region_list
;
1265 static lang_memory_region_type
**lang_memory_region_list_tail
1266 = &lang_memory_region_list
;
1268 lang_memory_region_type
*
1269 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1271 lang_memory_region_name
*n
;
1272 lang_memory_region_type
*r
;
1273 lang_memory_region_type
*new_region
;
1275 /* NAME is NULL for LMA memspecs if no region was specified. */
1279 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1280 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1281 if (strcmp (n
->name
, name
) == 0)
1284 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1289 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1290 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1293 new_region
= (lang_memory_region_type
*)
1294 stat_alloc (sizeof (lang_memory_region_type
));
1296 new_region
->name_list
.name
= xstrdup (name
);
1297 new_region
->name_list
.next
= NULL
;
1298 new_region
->next
= NULL
;
1299 new_region
->origin
= 0;
1300 new_region
->length
= ~(bfd_size_type
) 0;
1301 new_region
->current
= 0;
1302 new_region
->last_os
= NULL
;
1303 new_region
->flags
= 0;
1304 new_region
->not_flags
= 0;
1305 new_region
->had_full_message
= FALSE
;
1307 *lang_memory_region_list_tail
= new_region
;
1308 lang_memory_region_list_tail
= &new_region
->next
;
1314 lang_memory_region_alias (const char * alias
, const char * region_name
)
1316 lang_memory_region_name
* n
;
1317 lang_memory_region_type
* r
;
1318 lang_memory_region_type
* region
;
1320 /* The default region must be unique. This ensures that it is not necessary
1321 to iterate through the name list if someone wants the check if a region is
1322 the default memory region. */
1323 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1324 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1325 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL
);
1327 /* Look for the target region and check if the alias is not already
1330 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1331 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1333 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1335 if (strcmp (n
->name
, alias
) == 0)
1336 einfo (_("%F%P:%S: error: redefinition of memory region "
1341 /* Check if the target region exists. */
1343 einfo (_("%F%P:%S: error: memory region `%s' "
1344 "for alias `%s' does not exist\n"),
1345 NULL
, region_name
, alias
);
1347 /* Add alias to region name list. */
1348 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1349 n
->name
= xstrdup (alias
);
1350 n
->next
= region
->name_list
.next
;
1351 region
->name_list
.next
= n
;
1354 static lang_memory_region_type
*
1355 lang_memory_default (asection
* section
)
1357 lang_memory_region_type
*p
;
1359 flagword sec_flags
= section
->flags
;
1361 /* Override SEC_DATA to mean a writable section. */
1362 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1363 sec_flags
|= SEC_DATA
;
1365 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1367 if ((p
->flags
& sec_flags
) != 0
1368 && (p
->not_flags
& sec_flags
) == 0)
1373 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1376 /* Get the output section statement directly from the userdata. */
1378 lang_output_section_statement_type
*
1379 lang_output_section_get (const asection
*output_section
)
1381 return get_userdata (output_section
);
1384 /* Find or create an output_section_statement with the given NAME.
1385 If CONSTRAINT is non-zero match one with that constraint, otherwise
1386 match any non-negative constraint. If CREATE, always make a
1387 new output_section_statement for SPECIAL CONSTRAINT. */
1389 lang_output_section_statement_type
*
1390 lang_output_section_statement_lookup (const char *name
,
1394 struct out_section_hash_entry
*entry
;
1396 entry
= ((struct out_section_hash_entry
*)
1397 bfd_hash_lookup (&output_section_statement_table
, name
,
1402 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1406 if (entry
->s
.output_section_statement
.name
!= NULL
)
1408 /* We have a section of this name, but it might not have the correct
1410 struct out_section_hash_entry
*last_ent
;
1412 name
= entry
->s
.output_section_statement
.name
;
1413 if (create
&& constraint
== SPECIAL
)
1414 /* Not traversing to the end reverses the order of the second
1415 and subsequent SPECIAL sections in the hash table chain,
1416 but that shouldn't matter. */
1421 if (constraint
== entry
->s
.output_section_statement
.constraint
1423 && entry
->s
.output_section_statement
.constraint
>= 0))
1424 return &entry
->s
.output_section_statement
;
1426 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1428 while (entry
!= NULL
1429 && name
== entry
->s
.output_section_statement
.name
);
1435 = ((struct out_section_hash_entry
*)
1436 output_section_statement_newfunc (NULL
,
1437 &output_section_statement_table
,
1441 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1444 entry
->root
= last_ent
->root
;
1445 last_ent
->root
.next
= &entry
->root
;
1448 entry
->s
.output_section_statement
.name
= name
;
1449 entry
->s
.output_section_statement
.constraint
= constraint
;
1450 return &entry
->s
.output_section_statement
;
1453 /* Find the next output_section_statement with the same name as OS.
1454 If CONSTRAINT is non-zero, find one with that constraint otherwise
1455 match any non-negative constraint. */
1457 lang_output_section_statement_type
*
1458 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1461 /* All output_section_statements are actually part of a
1462 struct out_section_hash_entry. */
1463 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1465 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1466 const char *name
= os
->name
;
1468 ASSERT (name
== entry
->root
.string
);
1471 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1473 || name
!= entry
->s
.output_section_statement
.name
)
1476 while (constraint
!= entry
->s
.output_section_statement
.constraint
1478 || entry
->s
.output_section_statement
.constraint
< 0));
1480 return &entry
->s
.output_section_statement
;
1483 /* A variant of lang_output_section_find used by place_orphan.
1484 Returns the output statement that should precede a new output
1485 statement for SEC. If an exact match is found on certain flags,
1488 lang_output_section_statement_type
*
1489 lang_output_section_find_by_flags (const asection
*sec
,
1490 lang_output_section_statement_type
**exact
,
1491 lang_match_sec_type_func match_type
)
1493 lang_output_section_statement_type
*first
, *look
, *found
;
1494 flagword look_flags
, sec_flags
, differ
;
1496 /* We know the first statement on this list is *ABS*. May as well
1498 first
= &lang_output_section_statement
.head
->output_section_statement
;
1499 first
= first
->next
;
1501 /* First try for an exact match. */
1502 sec_flags
= sec
->flags
;
1504 for (look
= first
; look
; look
= look
->next
)
1506 look_flags
= look
->flags
;
1507 if (look
->bfd_section
!= NULL
)
1509 look_flags
= look
->bfd_section
->flags
;
1510 if (match_type
&& !match_type (link_info
.output_bfd
,
1515 differ
= look_flags
^ sec_flags
;
1516 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1517 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1527 if ((sec_flags
& SEC_CODE
) != 0
1528 && (sec_flags
& SEC_ALLOC
) != 0)
1530 /* Try for a rw code section. */
1531 for (look
= first
; look
; look
= look
->next
)
1533 look_flags
= look
->flags
;
1534 if (look
->bfd_section
!= NULL
)
1536 look_flags
= look
->bfd_section
->flags
;
1537 if (match_type
&& !match_type (link_info
.output_bfd
,
1542 differ
= look_flags
^ sec_flags
;
1543 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1544 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1548 else if ((sec_flags
& SEC_READONLY
) != 0
1549 && (sec_flags
& SEC_ALLOC
) != 0)
1551 /* .rodata can go after .text, .sdata2 after .rodata. */
1552 for (look
= first
; look
; look
= look
->next
)
1554 look_flags
= look
->flags
;
1555 if (look
->bfd_section
!= NULL
)
1557 look_flags
= look
->bfd_section
->flags
;
1558 if (match_type
&& !match_type (link_info
.output_bfd
,
1563 differ
= look_flags
^ sec_flags
;
1564 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1565 | SEC_READONLY
| SEC_SMALL_DATA
))
1566 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1568 && !(look_flags
& SEC_SMALL_DATA
)))
1572 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1573 && (sec_flags
& SEC_ALLOC
) != 0)
1575 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1576 as if it were a loaded section, and don't use match_type. */
1577 bfd_boolean seen_thread_local
= FALSE
;
1580 for (look
= first
; look
; look
= look
->next
)
1582 look_flags
= look
->flags
;
1583 if (look
->bfd_section
!= NULL
)
1584 look_flags
= look
->bfd_section
->flags
;
1586 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1587 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1589 /* .tdata and .tbss must be adjacent and in that order. */
1590 if (!(look_flags
& SEC_LOAD
)
1591 && (sec_flags
& SEC_LOAD
))
1592 /* ..so if we're at a .tbss section and we're placing
1593 a .tdata section stop looking and return the
1594 previous section. */
1597 seen_thread_local
= TRUE
;
1599 else if (seen_thread_local
)
1601 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1605 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1606 && (sec_flags
& SEC_ALLOC
) != 0)
1608 /* .sdata goes after .data, .sbss after .sdata. */
1609 for (look
= first
; look
; look
= look
->next
)
1611 look_flags
= look
->flags
;
1612 if (look
->bfd_section
!= NULL
)
1614 look_flags
= look
->bfd_section
->flags
;
1615 if (match_type
&& !match_type (link_info
.output_bfd
,
1620 differ
= look_flags
^ sec_flags
;
1621 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1622 | SEC_THREAD_LOCAL
))
1623 || ((look_flags
& SEC_SMALL_DATA
)
1624 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1628 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1629 && (sec_flags
& SEC_ALLOC
) != 0)
1631 /* .data goes after .rodata. */
1632 for (look
= first
; look
; look
= look
->next
)
1634 look_flags
= look
->flags
;
1635 if (look
->bfd_section
!= NULL
)
1637 look_flags
= look
->bfd_section
->flags
;
1638 if (match_type
&& !match_type (link_info
.output_bfd
,
1643 differ
= look_flags
^ sec_flags
;
1644 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1645 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1649 else if ((sec_flags
& SEC_ALLOC
) != 0)
1651 /* .bss goes after any other alloc section. */
1652 for (look
= first
; look
; look
= look
->next
)
1654 look_flags
= look
->flags
;
1655 if (look
->bfd_section
!= NULL
)
1657 look_flags
= look
->bfd_section
->flags
;
1658 if (match_type
&& !match_type (link_info
.output_bfd
,
1663 differ
= look_flags
^ sec_flags
;
1664 if (!(differ
& SEC_ALLOC
))
1670 /* non-alloc go last. */
1671 for (look
= first
; look
; look
= look
->next
)
1673 look_flags
= look
->flags
;
1674 if (look
->bfd_section
!= NULL
)
1675 look_flags
= look
->bfd_section
->flags
;
1676 differ
= look_flags
^ sec_flags
;
1677 if (!(differ
& SEC_DEBUGGING
))
1683 if (found
|| !match_type
)
1686 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1689 /* Find the last output section before given output statement.
1690 Used by place_orphan. */
1693 output_prev_sec_find (lang_output_section_statement_type
*os
)
1695 lang_output_section_statement_type
*lookup
;
1697 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1699 if (lookup
->constraint
< 0)
1702 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1703 return lookup
->bfd_section
;
1709 /* Look for a suitable place for a new output section statement. The
1710 idea is to skip over anything that might be inside a SECTIONS {}
1711 statement in a script, before we find another output section
1712 statement. Assignments to "dot" before an output section statement
1713 are assumed to belong to it, except in two cases; The first
1714 assignment to dot, and assignments before non-alloc sections.
1715 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1716 similar assignments that set the initial address, or we might
1717 insert non-alloc note sections among assignments setting end of
1720 static lang_statement_union_type
**
1721 insert_os_after (lang_output_section_statement_type
*after
)
1723 lang_statement_union_type
**where
;
1724 lang_statement_union_type
**assign
= NULL
;
1725 bfd_boolean ignore_first
;
1728 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1730 for (where
= &after
->header
.next
;
1732 where
= &(*where
)->header
.next
)
1734 switch ((*where
)->header
.type
)
1736 case lang_assignment_statement_enum
:
1739 lang_assignment_statement_type
*ass
;
1741 ass
= &(*where
)->assignment_statement
;
1742 if (ass
->exp
->type
.node_class
!= etree_assert
1743 && ass
->exp
->assign
.dst
[0] == '.'
1744 && ass
->exp
->assign
.dst
[1] == 0
1748 ignore_first
= FALSE
;
1750 case lang_wild_statement_enum
:
1751 case lang_input_section_enum
:
1752 case lang_object_symbols_statement_enum
:
1753 case lang_fill_statement_enum
:
1754 case lang_data_statement_enum
:
1755 case lang_reloc_statement_enum
:
1756 case lang_padding_statement_enum
:
1757 case lang_constructors_statement_enum
:
1760 case lang_output_section_statement_enum
:
1763 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1766 || s
->map_head
.s
== NULL
1767 || (s
->flags
& SEC_ALLOC
) != 0)
1771 case lang_input_statement_enum
:
1772 case lang_address_statement_enum
:
1773 case lang_target_statement_enum
:
1774 case lang_output_statement_enum
:
1775 case lang_group_statement_enum
:
1776 case lang_insert_statement_enum
:
1785 lang_output_section_statement_type
*
1786 lang_insert_orphan (asection
*s
,
1787 const char *secname
,
1789 lang_output_section_statement_type
*after
,
1790 struct orphan_save
*place
,
1791 etree_type
*address
,
1792 lang_statement_list_type
*add_child
)
1794 lang_statement_list_type add
;
1796 lang_output_section_statement_type
*os
;
1797 lang_output_section_statement_type
**os_tail
;
1799 /* If we have found an appropriate place for the output section
1800 statements for this orphan, add them to our own private list,
1801 inserting them later into the global statement list. */
1804 lang_list_init (&add
);
1805 push_stat_ptr (&add
);
1808 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1809 address
= exp_intop (0);
1811 os_tail
= ((lang_output_section_statement_type
**)
1812 lang_output_section_statement
.tail
);
1813 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1814 NULL
, NULL
, NULL
, constraint
, 0);
1817 if (config
.build_constructors
&& *os_tail
== os
)
1819 /* If the name of the section is representable in C, then create
1820 symbols to mark the start and the end of the section. */
1821 for (ps
= secname
; *ps
!= '\0'; ps
++)
1822 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1828 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1829 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1830 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1831 lang_add_assignment (exp_provide (symname
,
1832 exp_nameop (NAME
, "."),
1837 if (add_child
== NULL
)
1838 add_child
= &os
->children
;
1839 lang_add_section (add_child
, s
, NULL
, os
);
1841 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1843 const char *region
= (after
->region
1844 ? after
->region
->name_list
.name
1845 : DEFAULT_MEMORY_REGION
);
1846 const char *lma_region
= (after
->lma_region
1847 ? after
->lma_region
->name_list
.name
1849 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1853 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1856 if (ps
!= NULL
&& *ps
== '\0')
1860 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1861 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1862 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1863 lang_add_assignment (exp_provide (symname
,
1864 exp_nameop (NAME
, "."),
1868 /* Restore the global list pointer. */
1872 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1874 asection
*snew
, *as
;
1876 snew
= os
->bfd_section
;
1878 /* Shuffle the bfd section list to make the output file look
1879 neater. This is really only cosmetic. */
1880 if (place
->section
== NULL
1881 && after
!= (&lang_output_section_statement
.head
1882 ->output_section_statement
))
1884 asection
*bfd_section
= after
->bfd_section
;
1886 /* If the output statement hasn't been used to place any input
1887 sections (and thus doesn't have an output bfd_section),
1888 look for the closest prior output statement having an
1890 if (bfd_section
== NULL
)
1891 bfd_section
= output_prev_sec_find (after
);
1893 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1894 place
->section
= &bfd_section
->next
;
1897 if (place
->section
== NULL
)
1898 place
->section
= &link_info
.output_bfd
->sections
;
1900 as
= *place
->section
;
1904 /* Put the section at the end of the list. */
1906 /* Unlink the section. */
1907 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1909 /* Now tack it back on in the right place. */
1910 bfd_section_list_append (link_info
.output_bfd
, snew
);
1912 else if (as
!= snew
&& as
->prev
!= snew
)
1914 /* Unlink the section. */
1915 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1917 /* Now tack it back on in the right place. */
1918 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1921 /* Save the end of this list. Further ophans of this type will
1922 follow the one we've just added. */
1923 place
->section
= &snew
->next
;
1925 /* The following is non-cosmetic. We try to put the output
1926 statements in some sort of reasonable order here, because they
1927 determine the final load addresses of the orphan sections.
1928 In addition, placing output statements in the wrong order may
1929 require extra segments. For instance, given a typical
1930 situation of all read-only sections placed in one segment and
1931 following that a segment containing all the read-write
1932 sections, we wouldn't want to place an orphan read/write
1933 section before or amongst the read-only ones. */
1934 if (add
.head
!= NULL
)
1936 lang_output_section_statement_type
*newly_added_os
;
1938 if (place
->stmt
== NULL
)
1940 lang_statement_union_type
**where
= insert_os_after (after
);
1945 place
->os_tail
= &after
->next
;
1949 /* Put it after the last orphan statement we added. */
1950 *add
.tail
= *place
->stmt
;
1951 *place
->stmt
= add
.head
;
1954 /* Fix the global list pointer if we happened to tack our
1955 new list at the tail. */
1956 if (*stat_ptr
->tail
== add
.head
)
1957 stat_ptr
->tail
= add
.tail
;
1959 /* Save the end of this list. */
1960 place
->stmt
= add
.tail
;
1962 /* Do the same for the list of output section statements. */
1963 newly_added_os
= *os_tail
;
1965 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1966 ((char *) place
->os_tail
1967 - offsetof (lang_output_section_statement_type
, next
));
1968 newly_added_os
->next
= *place
->os_tail
;
1969 if (newly_added_os
->next
!= NULL
)
1970 newly_added_os
->next
->prev
= newly_added_os
;
1971 *place
->os_tail
= newly_added_os
;
1972 place
->os_tail
= &newly_added_os
->next
;
1974 /* Fixing the global list pointer here is a little different.
1975 We added to the list in lang_enter_output_section_statement,
1976 trimmed off the new output_section_statment above when
1977 assigning *os_tail = NULL, but possibly added it back in
1978 the same place when assigning *place->os_tail. */
1979 if (*os_tail
== NULL
)
1980 lang_output_section_statement
.tail
1981 = (lang_statement_union_type
**) os_tail
;
1988 lang_print_asneeded (void)
1990 struct asneeded_minfo
*m
;
1993 if (asneeded_list_head
== NULL
)
1996 sprintf (buf
, _("\nAs-needed library included "
1997 "to satisfy reference by file (symbol)\n\n"));
2000 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2004 minfo ("%s", m
->soname
);
2005 len
= strlen (m
->soname
);
2019 minfo ("%B ", m
->ref
);
2020 minfo ("(%T)\n", m
->name
);
2025 lang_map_flags (flagword flag
)
2027 if (flag
& SEC_ALLOC
)
2030 if (flag
& SEC_CODE
)
2033 if (flag
& SEC_READONLY
)
2036 if (flag
& SEC_DATA
)
2039 if (flag
& SEC_LOAD
)
2046 lang_memory_region_type
*m
;
2047 bfd_boolean dis_header_printed
= FALSE
;
2049 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2053 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2054 || file
->flags
.just_syms
)
2057 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2058 if ((s
->output_section
== NULL
2059 || s
->output_section
->owner
!= link_info
.output_bfd
)
2060 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2062 if (! dis_header_printed
)
2064 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2065 dis_header_printed
= TRUE
;
2068 print_input_section (s
, TRUE
);
2072 minfo (_("\nMemory Configuration\n\n"));
2073 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2074 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2076 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2081 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2083 sprintf_vma (buf
, m
->origin
);
2084 minfo ("0x%s ", buf
);
2092 minfo ("0x%V", m
->length
);
2093 if (m
->flags
|| m
->not_flags
)
2101 lang_map_flags (m
->flags
);
2107 lang_map_flags (m
->not_flags
);
2114 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2116 if (! link_info
.reduce_memory_overheads
)
2118 obstack_begin (&map_obstack
, 1000);
2119 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2121 lang_statement_iteration
++;
2122 print_statements ();
2124 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
, config
.map_file
);
2128 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2129 void *info ATTRIBUTE_UNUSED
)
2131 if ((hash_entry
->type
== bfd_link_hash_defined
2132 || hash_entry
->type
== bfd_link_hash_defweak
)
2133 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2134 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2136 input_section_userdata_type
*ud
;
2137 struct map_symbol_def
*def
;
2139 ud
= ((input_section_userdata_type
*)
2140 get_userdata (hash_entry
->u
.def
.section
));
2143 ud
= (input_section_userdata_type
*) stat_alloc (sizeof (*ud
));
2144 get_userdata (hash_entry
->u
.def
.section
) = ud
;
2145 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2146 ud
->map_symbol_def_count
= 0;
2148 else if (!ud
->map_symbol_def_tail
)
2149 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2151 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2152 def
->entry
= hash_entry
;
2153 *(ud
->map_symbol_def_tail
) = def
;
2154 ud
->map_symbol_def_tail
= &def
->next
;
2155 ud
->map_symbol_def_count
++;
2160 /* Initialize an output section. */
2163 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2165 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2166 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2168 if (s
->constraint
!= SPECIAL
)
2169 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2170 if (s
->bfd_section
== NULL
)
2171 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2173 if (s
->bfd_section
== NULL
)
2175 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2176 link_info
.output_bfd
->xvec
->name
, s
->name
);
2178 s
->bfd_section
->output_section
= s
->bfd_section
;
2179 s
->bfd_section
->output_offset
= 0;
2181 /* Set the userdata of the output section to the output section
2182 statement to avoid lookup. */
2183 get_userdata (s
->bfd_section
) = s
;
2185 /* If there is a base address, make sure that any sections it might
2186 mention are initialized. */
2187 if (s
->addr_tree
!= NULL
)
2188 exp_init_os (s
->addr_tree
);
2190 if (s
->load_base
!= NULL
)
2191 exp_init_os (s
->load_base
);
2193 /* If supplied an alignment, set it. */
2194 if (s
->section_alignment
!= -1)
2195 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2198 /* Make sure that all output sections mentioned in an expression are
2202 exp_init_os (etree_type
*exp
)
2204 switch (exp
->type
.node_class
)
2208 exp_init_os (exp
->assign
.src
);
2212 exp_init_os (exp
->binary
.lhs
);
2213 exp_init_os (exp
->binary
.rhs
);
2217 exp_init_os (exp
->trinary
.cond
);
2218 exp_init_os (exp
->trinary
.lhs
);
2219 exp_init_os (exp
->trinary
.rhs
);
2223 exp_init_os (exp
->assert_s
.child
);
2227 exp_init_os (exp
->unary
.child
);
2231 switch (exp
->type
.node_code
)
2237 lang_output_section_statement_type
*os
;
2239 os
= lang_output_section_find (exp
->name
.name
);
2240 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2252 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2254 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2256 /* If we are only reading symbols from this object, then we want to
2257 discard all sections. */
2258 if (entry
->flags
.just_syms
)
2260 bfd_link_just_syms (abfd
, sec
, &link_info
);
2264 if (!(abfd
->flags
& DYNAMIC
))
2265 bfd_section_already_linked (abfd
, sec
, &link_info
);
2268 /* The wild routines.
2270 These expand statements like *(.text) and foo.o to a list of
2271 explicit actions, like foo.o(.text), bar.o(.text) and
2272 foo.o(.text, .data). */
2274 /* Add SECTION to the output section OUTPUT. Do this by creating a
2275 lang_input_section statement which is placed at PTR. */
2278 lang_add_section (lang_statement_list_type
*ptr
,
2280 struct flag_info
*sflag_info
,
2281 lang_output_section_statement_type
*output
)
2283 flagword flags
= section
->flags
;
2285 bfd_boolean discard
;
2286 lang_input_section_type
*new_section
;
2287 bfd
*abfd
= link_info
.output_bfd
;
2289 /* Discard sections marked with SEC_EXCLUDE. */
2290 discard
= (flags
& SEC_EXCLUDE
) != 0;
2292 /* Discard input sections which are assigned to a section named
2293 DISCARD_SECTION_NAME. */
2294 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2297 /* Discard debugging sections if we are stripping debugging
2299 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2300 && (flags
& SEC_DEBUGGING
) != 0)
2305 if (section
->output_section
== NULL
)
2307 /* This prevents future calls from assigning this section. */
2308 section
->output_section
= bfd_abs_section_ptr
;
2317 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2322 if (section
->output_section
!= NULL
)
2325 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2326 to an output section, because we want to be able to include a
2327 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2328 section (I don't know why we want to do this, but we do).
2329 build_link_order in ldwrite.c handles this case by turning
2330 the embedded SEC_NEVER_LOAD section into a fill. */
2331 flags
&= ~ SEC_NEVER_LOAD
;
2333 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2334 already been processed. One reason to do this is that on pe
2335 format targets, .text$foo sections go into .text and it's odd
2336 to see .text with SEC_LINK_ONCE set. */
2338 if (!link_info
.relocatable
)
2339 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2341 switch (output
->sectype
)
2343 case normal_section
:
2344 case overlay_section
:
2346 case noalloc_section
:
2347 flags
&= ~SEC_ALLOC
;
2349 case noload_section
:
2351 flags
|= SEC_NEVER_LOAD
;
2352 /* Unfortunately GNU ld has managed to evolve two different
2353 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2354 alloc, no contents section. All others get a noload, noalloc
2356 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2357 flags
&= ~SEC_HAS_CONTENTS
;
2359 flags
&= ~SEC_ALLOC
;
2363 if (output
->bfd_section
== NULL
)
2364 init_os (output
, flags
);
2366 /* If SEC_READONLY is not set in the input section, then clear
2367 it from the output section. */
2368 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2370 if (output
->bfd_section
->linker_has_input
)
2372 /* Only set SEC_READONLY flag on the first input section. */
2373 flags
&= ~ SEC_READONLY
;
2375 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2376 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2377 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2378 || ((flags
& SEC_MERGE
) != 0
2379 && output
->bfd_section
->entsize
!= section
->entsize
))
2381 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2382 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2385 output
->bfd_section
->flags
|= flags
;
2387 if (!output
->bfd_section
->linker_has_input
)
2389 output
->bfd_section
->linker_has_input
= 1;
2390 /* This must happen after flags have been updated. The output
2391 section may have been created before we saw its first input
2392 section, eg. for a data statement. */
2393 bfd_init_private_section_data (section
->owner
, section
,
2394 link_info
.output_bfd
,
2395 output
->bfd_section
,
2397 if ((flags
& SEC_MERGE
) != 0)
2398 output
->bfd_section
->entsize
= section
->entsize
;
2401 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2402 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2404 /* FIXME: This value should really be obtained from the bfd... */
2405 output
->block_value
= 128;
2408 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2409 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2411 section
->output_section
= output
->bfd_section
;
2413 if (!link_info
.relocatable
2414 && !stripped_excluded_sections
)
2416 asection
*s
= output
->bfd_section
->map_tail
.s
;
2417 output
->bfd_section
->map_tail
.s
= section
;
2418 section
->map_head
.s
= NULL
;
2419 section
->map_tail
.s
= s
;
2421 s
->map_head
.s
= section
;
2423 output
->bfd_section
->map_head
.s
= section
;
2426 /* Add a section reference to the list. */
2427 new_section
= new_stat (lang_input_section
, ptr
);
2428 new_section
->section
= section
;
2431 /* Handle wildcard sorting. This returns the lang_input_section which
2432 should follow the one we are going to create for SECTION and FILE,
2433 based on the sorting requirements of WILD. It returns NULL if the
2434 new section should just go at the end of the current list. */
2436 static lang_statement_union_type
*
2437 wild_sort (lang_wild_statement_type
*wild
,
2438 struct wildcard_list
*sec
,
2439 lang_input_statement_type
*file
,
2442 lang_statement_union_type
*l
;
2444 if (!wild
->filenames_sorted
2445 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2448 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2450 lang_input_section_type
*ls
;
2452 if (l
->header
.type
!= lang_input_section_enum
)
2454 ls
= &l
->input_section
;
2456 /* Sorting by filename takes precedence over sorting by section
2459 if (wild
->filenames_sorted
)
2461 const char *fn
, *ln
;
2465 /* The PE support for the .idata section as generated by
2466 dlltool assumes that files will be sorted by the name of
2467 the archive and then the name of the file within the
2470 if (file
->the_bfd
!= NULL
2471 && bfd_my_archive (file
->the_bfd
) != NULL
)
2473 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2478 fn
= file
->filename
;
2482 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2484 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2489 ln
= ls
->section
->owner
->filename
;
2493 i
= filename_cmp (fn
, ln
);
2502 fn
= file
->filename
;
2504 ln
= ls
->section
->owner
->filename
;
2506 i
= filename_cmp (fn
, ln
);
2514 /* Here either the files are not sorted by name, or we are
2515 looking at the sections for this file. */
2518 && sec
->spec
.sorted
!= none
2519 && sec
->spec
.sorted
!= by_none
)
2520 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2527 /* Expand a wild statement for a particular FILE. SECTION may be
2528 NULL, in which case it is a wild card. */
2531 output_section_callback (lang_wild_statement_type
*ptr
,
2532 struct wildcard_list
*sec
,
2534 struct flag_info
*sflag_info
,
2535 lang_input_statement_type
*file
,
2538 lang_statement_union_type
*before
;
2539 lang_output_section_statement_type
*os
;
2541 os
= (lang_output_section_statement_type
*) output
;
2543 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2544 if (unique_section_p (section
, os
))
2547 before
= wild_sort (ptr
, sec
, file
, section
);
2549 /* Here BEFORE points to the lang_input_section which
2550 should follow the one we are about to add. If BEFORE
2551 is NULL, then the section should just go at the end
2552 of the current list. */
2555 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2558 lang_statement_list_type list
;
2559 lang_statement_union_type
**pp
;
2561 lang_list_init (&list
);
2562 lang_add_section (&list
, section
, sflag_info
, os
);
2564 /* If we are discarding the section, LIST.HEAD will
2566 if (list
.head
!= NULL
)
2568 ASSERT (list
.head
->header
.next
== NULL
);
2570 for (pp
= &ptr
->children
.head
;
2572 pp
= &(*pp
)->header
.next
)
2573 ASSERT (*pp
!= NULL
);
2575 list
.head
->header
.next
= *pp
;
2581 /* Check if all sections in a wild statement for a particular FILE
2585 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2586 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2588 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2589 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2592 lang_output_section_statement_type
*os
;
2594 os
= (lang_output_section_statement_type
*) output
;
2596 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2597 if (unique_section_p (section
, os
))
2600 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2601 os
->all_input_readonly
= FALSE
;
2604 /* This is passed a file name which must have been seen already and
2605 added to the statement tree. We will see if it has been opened
2606 already and had its symbols read. If not then we'll read it. */
2608 static lang_input_statement_type
*
2609 lookup_name (const char *name
)
2611 lang_input_statement_type
*search
;
2613 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2615 search
= (lang_input_statement_type
*) search
->next_real_file
)
2617 /* Use the local_sym_name as the name of the file that has
2618 already been loaded as filename might have been transformed
2619 via the search directory lookup mechanism. */
2620 const char *filename
= search
->local_sym_name
;
2622 if (filename
!= NULL
2623 && filename_cmp (filename
, name
) == 0)
2628 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2629 default_target
, FALSE
);
2631 /* If we have already added this file, or this file is not real
2632 don't add this file. */
2633 if (search
->flags
.loaded
|| !search
->flags
.real
)
2636 if (! load_symbols (search
, NULL
))
2642 /* Save LIST as a list of libraries whose symbols should not be exported. */
2647 struct excluded_lib
*next
;
2649 static struct excluded_lib
*excluded_libs
;
2652 add_excluded_libs (const char *list
)
2654 const char *p
= list
, *end
;
2658 struct excluded_lib
*entry
;
2659 end
= strpbrk (p
, ",:");
2661 end
= p
+ strlen (p
);
2662 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2663 entry
->next
= excluded_libs
;
2664 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2665 memcpy (entry
->name
, p
, end
- p
);
2666 entry
->name
[end
- p
] = '\0';
2667 excluded_libs
= entry
;
2675 check_excluded_libs (bfd
*abfd
)
2677 struct excluded_lib
*lib
= excluded_libs
;
2681 int len
= strlen (lib
->name
);
2682 const char *filename
= lbasename (abfd
->filename
);
2684 if (strcmp (lib
->name
, "ALL") == 0)
2686 abfd
->no_export
= TRUE
;
2690 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2691 && (filename
[len
] == '\0'
2692 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2693 && filename
[len
+ 2] == '\0')))
2695 abfd
->no_export
= TRUE
;
2703 /* Get the symbols for an input file. */
2706 load_symbols (lang_input_statement_type
*entry
,
2707 lang_statement_list_type
*place
)
2711 if (entry
->flags
.loaded
)
2714 ldfile_open_file (entry
);
2716 /* Do not process further if the file was missing. */
2717 if (entry
->flags
.missing_file
)
2720 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2721 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2724 struct lang_input_statement_flags save_flags
;
2727 err
= bfd_get_error ();
2729 /* See if the emulation has some special knowledge. */
2730 if (ldemul_unrecognized_file (entry
))
2733 if (err
== bfd_error_file_ambiguously_recognized
)
2737 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2738 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2739 for (p
= matching
; *p
!= NULL
; p
++)
2743 else if (err
!= bfd_error_file_not_recognized
2745 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2747 bfd_close (entry
->the_bfd
);
2748 entry
->the_bfd
= NULL
;
2750 /* Try to interpret the file as a linker script. */
2751 save_flags
= input_flags
;
2752 ldfile_open_command_file (entry
->filename
);
2754 push_stat_ptr (place
);
2755 input_flags
.add_DT_NEEDED_for_regular
2756 = entry
->flags
.add_DT_NEEDED_for_regular
;
2757 input_flags
.add_DT_NEEDED_for_dynamic
2758 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2759 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2760 input_flags
.dynamic
= entry
->flags
.dynamic
;
2762 ldfile_assumed_script
= TRUE
;
2763 parser_input
= input_script
;
2765 ldfile_assumed_script
= FALSE
;
2767 /* missing_file is sticky. sysrooted will already have been
2768 restored when seeing EOF in yyparse, but no harm to restore
2770 save_flags
.missing_file
|= input_flags
.missing_file
;
2771 input_flags
= save_flags
;
2775 entry
->flags
.loaded
= TRUE
;
2780 if (ldemul_recognized_file (entry
))
2783 /* We don't call ldlang_add_file for an archive. Instead, the
2784 add_symbols entry point will call ldlang_add_file, via the
2785 add_archive_element callback, for each element of the archive
2787 switch (bfd_get_format (entry
->the_bfd
))
2793 #ifdef ENABLE_PLUGINS
2794 if (!entry
->flags
.reload
)
2796 ldlang_add_file (entry
);
2797 if (trace_files
|| verbose
)
2798 info_msg ("%I\n", entry
);
2802 check_excluded_libs (entry
->the_bfd
);
2804 if (entry
->flags
.whole_archive
)
2807 bfd_boolean loaded
= TRUE
;
2812 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2817 if (! bfd_check_format (member
, bfd_object
))
2819 einfo (_("%F%B: member %B in archive is not an object\n"),
2820 entry
->the_bfd
, member
);
2825 if (!(*link_info
.callbacks
2826 ->add_archive_element
) (&link_info
, member
,
2827 "--whole-archive", &subsbfd
))
2830 /* Potentially, the add_archive_element hook may have set a
2831 substitute BFD for us. */
2832 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2834 einfo (_("%F%B: error adding symbols: %E\n"), member
);
2839 entry
->flags
.loaded
= loaded
;
2845 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2846 entry
->flags
.loaded
= TRUE
;
2848 einfo (_("%F%B: error adding symbols: %E\n"), entry
->the_bfd
);
2850 return entry
->flags
.loaded
;
2853 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2854 may be NULL, indicating that it is a wildcard. Separate
2855 lang_input_section statements are created for each part of the
2856 expansion; they are added after the wild statement S. OUTPUT is
2857 the output section. */
2860 wild (lang_wild_statement_type
*s
,
2861 const char *target ATTRIBUTE_UNUSED
,
2862 lang_output_section_statement_type
*output
)
2864 struct wildcard_list
*sec
;
2866 if (s
->handler_data
[0]
2867 && s
->handler_data
[0]->spec
.sorted
== by_name
2868 && !s
->filenames_sorted
)
2870 lang_section_bst_type
*tree
;
2872 walk_wild (s
, output_section_callback_fast
, output
);
2877 output_section_callback_tree_to_list (s
, tree
, output
);
2882 walk_wild (s
, output_section_callback
, output
);
2884 if (default_common_section
== NULL
)
2885 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2886 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2888 /* Remember the section that common is going to in case we
2889 later get something which doesn't know where to put it. */
2890 default_common_section
= output
;
2895 /* Return TRUE iff target is the sought target. */
2898 get_target (const bfd_target
*target
, void *data
)
2900 const char *sought
= (const char *) data
;
2902 return strcmp (target
->name
, sought
) == 0;
2905 /* Like strcpy() but convert to lower case as well. */
2908 stricpy (char *dest
, char *src
)
2912 while ((c
= *src
++) != 0)
2913 *dest
++ = TOLOWER (c
);
2918 /* Remove the first occurrence of needle (if any) in haystack
2922 strcut (char *haystack
, char *needle
)
2924 haystack
= strstr (haystack
, needle
);
2930 for (src
= haystack
+ strlen (needle
); *src
;)
2931 *haystack
++ = *src
++;
2937 /* Compare two target format name strings.
2938 Return a value indicating how "similar" they are. */
2941 name_compare (char *first
, char *second
)
2947 copy1
= (char *) xmalloc (strlen (first
) + 1);
2948 copy2
= (char *) xmalloc (strlen (second
) + 1);
2950 /* Convert the names to lower case. */
2951 stricpy (copy1
, first
);
2952 stricpy (copy2
, second
);
2954 /* Remove size and endian strings from the name. */
2955 strcut (copy1
, "big");
2956 strcut (copy1
, "little");
2957 strcut (copy2
, "big");
2958 strcut (copy2
, "little");
2960 /* Return a value based on how many characters match,
2961 starting from the beginning. If both strings are
2962 the same then return 10 * their length. */
2963 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2964 if (copy1
[result
] == 0)
2976 /* Set by closest_target_match() below. */
2977 static const bfd_target
*winner
;
2979 /* Scan all the valid bfd targets looking for one that has the endianness
2980 requirement that was specified on the command line, and is the nearest
2981 match to the original output target. */
2984 closest_target_match (const bfd_target
*target
, void *data
)
2986 const bfd_target
*original
= (const bfd_target
*) data
;
2988 if (command_line
.endian
== ENDIAN_BIG
2989 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2992 if (command_line
.endian
== ENDIAN_LITTLE
2993 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2996 /* Must be the same flavour. */
2997 if (target
->flavour
!= original
->flavour
)
3000 /* Ignore generic big and little endian elf vectors. */
3001 if (strcmp (target
->name
, "elf32-big") == 0
3002 || strcmp (target
->name
, "elf64-big") == 0
3003 || strcmp (target
->name
, "elf32-little") == 0
3004 || strcmp (target
->name
, "elf64-little") == 0)
3007 /* If we have not found a potential winner yet, then record this one. */
3014 /* Oh dear, we now have two potential candidates for a successful match.
3015 Compare their names and choose the better one. */
3016 if (name_compare (target
->name
, original
->name
)
3017 > name_compare (winner
->name
, original
->name
))
3020 /* Keep on searching until wqe have checked them all. */
3024 /* Return the BFD target format of the first input file. */
3027 get_first_input_target (void)
3029 char *target
= NULL
;
3031 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3033 if (s
->header
.type
== lang_input_statement_enum
3036 ldfile_open_file (s
);
3038 if (s
->the_bfd
!= NULL
3039 && bfd_check_format (s
->the_bfd
, bfd_object
))
3041 target
= bfd_get_target (s
->the_bfd
);
3053 lang_get_output_target (void)
3057 /* Has the user told us which output format to use? */
3058 if (output_target
!= NULL
)
3059 return output_target
;
3061 /* No - has the current target been set to something other than
3063 if (current_target
!= default_target
&& current_target
!= NULL
)
3064 return current_target
;
3066 /* No - can we determine the format of the first input file? */
3067 target
= get_first_input_target ();
3071 /* Failed - use the default output target. */
3072 return default_target
;
3075 /* Open the output file. */
3078 open_output (const char *name
)
3080 output_target
= lang_get_output_target ();
3082 /* Has the user requested a particular endianness on the command
3084 if (command_line
.endian
!= ENDIAN_UNSET
)
3086 const bfd_target
*target
;
3087 enum bfd_endian desired_endian
;
3089 /* Get the chosen target. */
3090 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3092 /* If the target is not supported, we cannot do anything. */
3095 if (command_line
.endian
== ENDIAN_BIG
)
3096 desired_endian
= BFD_ENDIAN_BIG
;
3098 desired_endian
= BFD_ENDIAN_LITTLE
;
3100 /* See if the target has the wrong endianness. This should
3101 not happen if the linker script has provided big and
3102 little endian alternatives, but some scrips don't do
3104 if (target
->byteorder
!= desired_endian
)
3106 /* If it does, then see if the target provides
3107 an alternative with the correct endianness. */
3108 if (target
->alternative_target
!= NULL
3109 && (target
->alternative_target
->byteorder
== desired_endian
))
3110 output_target
= target
->alternative_target
->name
;
3113 /* Try to find a target as similar as possible to
3114 the default target, but which has the desired
3115 endian characteristic. */
3116 bfd_search_for_target (closest_target_match
,
3119 /* Oh dear - we could not find any targets that
3120 satisfy our requirements. */
3122 einfo (_("%P: warning: could not find any targets"
3123 " that match endianness requirement\n"));
3125 output_target
= winner
->name
;
3131 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3133 if (link_info
.output_bfd
== NULL
)
3135 if (bfd_get_error () == bfd_error_invalid_target
)
3136 einfo (_("%P%F: target %s not found\n"), output_target
);
3138 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3141 delete_output_file_on_failure
= TRUE
;
3143 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3144 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3145 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3146 ldfile_output_architecture
,
3147 ldfile_output_machine
))
3148 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3150 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3151 if (link_info
.hash
== NULL
)
3152 einfo (_("%P%F: can not create hash table: %E\n"));
3154 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3158 ldlang_open_output (lang_statement_union_type
*statement
)
3160 switch (statement
->header
.type
)
3162 case lang_output_statement_enum
:
3163 ASSERT (link_info
.output_bfd
== NULL
);
3164 open_output (statement
->output_statement
.name
);
3165 ldemul_set_output_arch ();
3166 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3167 link_info
.output_bfd
->flags
|= D_PAGED
;
3169 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3170 if (config
.text_read_only
)
3171 link_info
.output_bfd
->flags
|= WP_TEXT
;
3173 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3174 if (link_info
.traditional_format
)
3175 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3177 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3180 case lang_target_statement_enum
:
3181 current_target
= statement
->target_statement
.target
;
3188 /* Convert between addresses in bytes and sizes in octets.
3189 For currently supported targets, octets_per_byte is always a power
3190 of two, so we can use shifts. */
3191 #define TO_ADDR(X) ((X) >> opb_shift)
3192 #define TO_SIZE(X) ((X) << opb_shift)
3194 /* Support the above. */
3195 static unsigned int opb_shift
= 0;
3200 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3201 ldfile_output_machine
);
3204 while ((x
& 1) == 0)
3212 /* Open all the input files. */
3216 OPEN_BFD_NORMAL
= 0,
3220 #ifdef ENABLE_PLUGINS
3221 static lang_input_statement_type
*plugin_insert
= NULL
;
3225 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3227 for (; s
!= NULL
; s
= s
->header
.next
)
3229 switch (s
->header
.type
)
3231 case lang_constructors_statement_enum
:
3232 open_input_bfds (constructor_list
.head
, mode
);
3234 case lang_output_section_statement_enum
:
3235 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3237 case lang_wild_statement_enum
:
3238 /* Maybe we should load the file's symbols. */
3239 if ((mode
& OPEN_BFD_RESCAN
) == 0
3240 && s
->wild_statement
.filename
3241 && !wildcardp (s
->wild_statement
.filename
)
3242 && !archive_path (s
->wild_statement
.filename
))
3243 lookup_name (s
->wild_statement
.filename
);
3244 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3246 case lang_group_statement_enum
:
3248 struct bfd_link_hash_entry
*undefs
;
3250 /* We must continually search the entries in the group
3251 until no new symbols are added to the list of undefined
3256 undefs
= link_info
.hash
->undefs_tail
;
3257 open_input_bfds (s
->group_statement
.children
.head
,
3258 mode
| OPEN_BFD_FORCE
);
3260 while (undefs
!= link_info
.hash
->undefs_tail
);
3263 case lang_target_statement_enum
:
3264 current_target
= s
->target_statement
.target
;
3266 case lang_input_statement_enum
:
3267 if (s
->input_statement
.flags
.real
)
3269 lang_statement_union_type
**os_tail
;
3270 lang_statement_list_type add
;
3272 s
->input_statement
.target
= current_target
;
3274 /* If we are being called from within a group, and this
3275 is an archive which has already been searched, then
3276 force it to be researched unless the whole archive
3277 has been loaded already. Do the same for a rescan. */
3278 if (mode
!= OPEN_BFD_NORMAL
3279 #ifdef ENABLE_PLUGINS
3280 && ((mode
& OPEN_BFD_RESCAN
) == 0
3281 || plugin_insert
== NULL
)
3283 && !s
->input_statement
.flags
.whole_archive
3284 && s
->input_statement
.flags
.loaded
3285 && s
->input_statement
.the_bfd
!= NULL
3286 && bfd_check_format (s
->input_statement
.the_bfd
,
3288 s
->input_statement
.flags
.loaded
= FALSE
;
3289 #ifdef ENABLE_PLUGINS
3290 /* When rescanning, reload --as-needed shared libs. */
3291 else if ((mode
& OPEN_BFD_RESCAN
) != 0
3292 && plugin_insert
== NULL
3293 && s
->input_statement
.flags
.loaded
3294 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3295 && s
->input_statement
.the_bfd
!= NULL
3296 && ((s
->input_statement
.the_bfd
->flags
) & DYNAMIC
) != 0
3297 && plugin_should_reload (s
->input_statement
.the_bfd
))
3299 s
->input_statement
.flags
.loaded
= FALSE
;
3300 s
->input_statement
.flags
.reload
= TRUE
;
3304 os_tail
= lang_output_section_statement
.tail
;
3305 lang_list_init (&add
);
3307 if (! load_symbols (&s
->input_statement
, &add
))
3308 config
.make_executable
= FALSE
;
3310 if (add
.head
!= NULL
)
3312 /* If this was a script with output sections then
3313 tack any added statements on to the end of the
3314 list. This avoids having to reorder the output
3315 section statement list. Very likely the user
3316 forgot -T, and whatever we do here will not meet
3317 naive user expectations. */
3318 if (os_tail
!= lang_output_section_statement
.tail
)
3320 einfo (_("%P: warning: %s contains output sections;"
3321 " did you forget -T?\n"),
3322 s
->input_statement
.filename
);
3323 *stat_ptr
->tail
= add
.head
;
3324 stat_ptr
->tail
= add
.tail
;
3328 *add
.tail
= s
->header
.next
;
3329 s
->header
.next
= add
.head
;
3333 #ifdef ENABLE_PLUGINS
3334 /* If we have found the point at which a plugin added new
3335 files, clear plugin_insert to enable archive rescan. */
3336 if (&s
->input_statement
== plugin_insert
)
3337 plugin_insert
= NULL
;
3340 case lang_assignment_statement_enum
:
3341 if (s
->assignment_statement
.exp
->assign
.defsym
)
3342 /* This is from a --defsym on the command line. */
3343 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3350 /* Exit if any of the files were missing. */
3351 if (input_flags
.missing_file
)
3355 /* New-function for the definedness hash table. */
3357 static struct bfd_hash_entry
*
3358 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3359 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3360 const char *name ATTRIBUTE_UNUSED
)
3362 struct lang_definedness_hash_entry
*ret
3363 = (struct lang_definedness_hash_entry
*) entry
;
3366 ret
= (struct lang_definedness_hash_entry
*)
3367 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3370 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3378 /* Called during processing of linker script script expressions.
3379 For symbols assigned in a linker script, return a struct describing
3380 where the symbol is defined relative to the current expression,
3381 otherwise return NULL. */
3383 struct lang_definedness_hash_entry
*
3384 lang_symbol_defined (const char *name
)
3386 return ((struct lang_definedness_hash_entry
*)
3387 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
));
3390 /* Update the definedness state of NAME. */
3393 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3395 struct lang_definedness_hash_entry
*defentry
3396 = (struct lang_definedness_hash_entry
*)
3397 bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
);
3399 if (defentry
== NULL
)
3400 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3402 /* If the symbol was already defined, and not by a script, then it
3403 must be defined by an object file. */
3404 if (!defentry
->by_script
3405 && h
->type
!= bfd_link_hash_undefined
3406 && h
->type
!= bfd_link_hash_common
3407 && h
->type
!= bfd_link_hash_new
)
3408 defentry
->by_object
= 1;
3410 defentry
->by_script
= 1;
3411 defentry
->iteration
= lang_statement_iteration
;
3414 /* Add the supplied name to the symbol table as an undefined reference.
3415 This is a two step process as the symbol table doesn't even exist at
3416 the time the ld command line is processed. First we put the name
3417 on a list, then, once the output file has been opened, transfer the
3418 name to the symbol table. */
3420 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3422 #define ldlang_undef_chain_list_head entry_symbol.next
3425 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3427 ldlang_undef_chain_list_type
*new_undef
;
3429 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3430 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3431 new_undef
->next
= ldlang_undef_chain_list_head
;
3432 ldlang_undef_chain_list_head
= new_undef
;
3434 new_undef
->name
= xstrdup (name
);
3436 if (link_info
.output_bfd
!= NULL
)
3437 insert_undefined (new_undef
->name
);
3440 /* Insert NAME as undefined in the symbol table. */
3443 insert_undefined (const char *name
)
3445 struct bfd_link_hash_entry
*h
;
3447 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3449 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3450 if (h
->type
== bfd_link_hash_new
)
3452 h
->type
= bfd_link_hash_undefined
;
3453 h
->u
.undef
.abfd
= NULL
;
3454 bfd_link_add_undef (link_info
.hash
, h
);
3458 /* Run through the list of undefineds created above and place them
3459 into the linker hash table as undefined symbols belonging to the
3463 lang_place_undefineds (void)
3465 ldlang_undef_chain_list_type
*ptr
;
3467 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3468 insert_undefined (ptr
->name
);
3471 /* Check for all readonly or some readwrite sections. */
3474 check_input_sections
3475 (lang_statement_union_type
*s
,
3476 lang_output_section_statement_type
*output_section_statement
)
3478 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3480 switch (s
->header
.type
)
3482 case lang_wild_statement_enum
:
3483 walk_wild (&s
->wild_statement
, check_section_callback
,
3484 output_section_statement
);
3485 if (! output_section_statement
->all_input_readonly
)
3488 case lang_constructors_statement_enum
:
3489 check_input_sections (constructor_list
.head
,
3490 output_section_statement
);
3491 if (! output_section_statement
->all_input_readonly
)
3494 case lang_group_statement_enum
:
3495 check_input_sections (s
->group_statement
.children
.head
,
3496 output_section_statement
);
3497 if (! output_section_statement
->all_input_readonly
)
3506 /* Update wildcard statements if needed. */
3509 update_wild_statements (lang_statement_union_type
*s
)
3511 struct wildcard_list
*sec
;
3513 switch (sort_section
)
3523 for (; s
!= NULL
; s
= s
->header
.next
)
3525 switch (s
->header
.type
)
3530 case lang_wild_statement_enum
:
3531 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3534 switch (sec
->spec
.sorted
)
3537 sec
->spec
.sorted
= sort_section
;
3540 if (sort_section
== by_alignment
)
3541 sec
->spec
.sorted
= by_name_alignment
;
3544 if (sort_section
== by_name
)
3545 sec
->spec
.sorted
= by_alignment_name
;
3553 case lang_constructors_statement_enum
:
3554 update_wild_statements (constructor_list
.head
);
3557 case lang_output_section_statement_enum
:
3558 /* Don't sort .init/.fini sections. */
3559 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3560 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3561 update_wild_statements
3562 (s
->output_section_statement
.children
.head
);
3565 case lang_group_statement_enum
:
3566 update_wild_statements (s
->group_statement
.children
.head
);
3574 /* Open input files and attach to output sections. */
3577 map_input_to_output_sections
3578 (lang_statement_union_type
*s
, const char *target
,
3579 lang_output_section_statement_type
*os
)
3581 for (; s
!= NULL
; s
= s
->header
.next
)
3583 lang_output_section_statement_type
*tos
;
3586 switch (s
->header
.type
)
3588 case lang_wild_statement_enum
:
3589 wild (&s
->wild_statement
, target
, os
);
3591 case lang_constructors_statement_enum
:
3592 map_input_to_output_sections (constructor_list
.head
,
3596 case lang_output_section_statement_enum
:
3597 tos
= &s
->output_section_statement
;
3598 if (tos
->constraint
!= 0)
3600 if (tos
->constraint
!= ONLY_IF_RW
3601 && tos
->constraint
!= ONLY_IF_RO
)
3603 tos
->all_input_readonly
= TRUE
;
3604 check_input_sections (tos
->children
.head
, tos
);
3605 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3607 tos
->constraint
= -1;
3611 map_input_to_output_sections (tos
->children
.head
,
3615 case lang_output_statement_enum
:
3617 case lang_target_statement_enum
:
3618 target
= s
->target_statement
.target
;
3620 case lang_group_statement_enum
:
3621 map_input_to_output_sections (s
->group_statement
.children
.head
,
3625 case lang_data_statement_enum
:
3626 /* Make sure that any sections mentioned in the expression
3628 exp_init_os (s
->data_statement
.exp
);
3629 /* The output section gets CONTENTS, ALLOC and LOAD, but
3630 these may be overridden by the script. */
3631 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3632 switch (os
->sectype
)
3634 case normal_section
:
3635 case overlay_section
:
3637 case noalloc_section
:
3638 flags
= SEC_HAS_CONTENTS
;
3640 case noload_section
:
3641 if (bfd_get_flavour (link_info
.output_bfd
)
3642 == bfd_target_elf_flavour
)
3643 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3645 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3648 if (os
->bfd_section
== NULL
)
3649 init_os (os
, flags
);
3651 os
->bfd_section
->flags
|= flags
;
3653 case lang_input_section_enum
:
3655 case lang_fill_statement_enum
:
3656 case lang_object_symbols_statement_enum
:
3657 case lang_reloc_statement_enum
:
3658 case lang_padding_statement_enum
:
3659 case lang_input_statement_enum
:
3660 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3663 case lang_assignment_statement_enum
:
3664 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3667 /* Make sure that any sections mentioned in the assignment
3669 exp_init_os (s
->assignment_statement
.exp
);
3671 case lang_address_statement_enum
:
3672 /* Mark the specified section with the supplied address.
3673 If this section was actually a segment marker, then the
3674 directive is ignored if the linker script explicitly
3675 processed the segment marker. Originally, the linker
3676 treated segment directives (like -Ttext on the
3677 command-line) as section directives. We honor the
3678 section directive semantics for backwards compatibilty;
3679 linker scripts that do not specifically check for
3680 SEGMENT_START automatically get the old semantics. */
3681 if (!s
->address_statement
.segment
3682 || !s
->address_statement
.segment
->used
)
3684 const char *name
= s
->address_statement
.section_name
;
3686 /* Create the output section statement here so that
3687 orphans with a set address will be placed after other
3688 script sections. If we let the orphan placement code
3689 place them in amongst other sections then the address
3690 will affect following script sections, which is
3691 likely to surprise naive users. */
3692 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3693 tos
->addr_tree
= s
->address_statement
.address
;
3694 if (tos
->bfd_section
== NULL
)
3698 case lang_insert_statement_enum
:
3704 /* An insert statement snips out all the linker statements from the
3705 start of the list and places them after the output section
3706 statement specified by the insert. This operation is complicated
3707 by the fact that we keep a doubly linked list of output section
3708 statements as well as the singly linked list of all statements. */
3711 process_insert_statements (void)
3713 lang_statement_union_type
**s
;
3714 lang_output_section_statement_type
*first_os
= NULL
;
3715 lang_output_section_statement_type
*last_os
= NULL
;
3716 lang_output_section_statement_type
*os
;
3718 /* "start of list" is actually the statement immediately after
3719 the special abs_section output statement, so that it isn't
3721 s
= &lang_output_section_statement
.head
;
3722 while (*(s
= &(*s
)->header
.next
) != NULL
)
3724 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3726 /* Keep pointers to the first and last output section
3727 statement in the sequence we may be about to move. */
3728 os
= &(*s
)->output_section_statement
;
3730 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3733 /* Set constraint negative so that lang_output_section_find
3734 won't match this output section statement. At this
3735 stage in linking constraint has values in the range
3736 [-1, ONLY_IN_RW]. */
3737 last_os
->constraint
= -2 - last_os
->constraint
;
3738 if (first_os
== NULL
)
3741 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3743 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3744 lang_output_section_statement_type
*where
;
3745 lang_statement_union_type
**ptr
;
3746 lang_statement_union_type
*first
;
3748 where
= lang_output_section_find (i
->where
);
3749 if (where
!= NULL
&& i
->is_before
)
3752 where
= where
->prev
;
3753 while (where
!= NULL
&& where
->constraint
< 0);
3757 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3761 /* Deal with reordering the output section statement list. */
3762 if (last_os
!= NULL
)
3764 asection
*first_sec
, *last_sec
;
3765 struct lang_output_section_statement_struct
**next
;
3767 /* Snip out the output sections we are moving. */
3768 first_os
->prev
->next
= last_os
->next
;
3769 if (last_os
->next
== NULL
)
3771 next
= &first_os
->prev
->next
;
3772 lang_output_section_statement
.tail
3773 = (lang_statement_union_type
**) next
;
3776 last_os
->next
->prev
= first_os
->prev
;
3777 /* Add them in at the new position. */
3778 last_os
->next
= where
->next
;
3779 if (where
->next
== NULL
)
3781 next
= &last_os
->next
;
3782 lang_output_section_statement
.tail
3783 = (lang_statement_union_type
**) next
;
3786 where
->next
->prev
= last_os
;
3787 first_os
->prev
= where
;
3788 where
->next
= first_os
;
3790 /* Move the bfd sections in the same way. */
3793 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3795 os
->constraint
= -2 - os
->constraint
;
3796 if (os
->bfd_section
!= NULL
3797 && os
->bfd_section
->owner
!= NULL
)
3799 last_sec
= os
->bfd_section
;
3800 if (first_sec
== NULL
)
3801 first_sec
= last_sec
;
3806 if (last_sec
!= NULL
)
3808 asection
*sec
= where
->bfd_section
;
3810 sec
= output_prev_sec_find (where
);
3812 /* The place we want to insert must come after the
3813 sections we are moving. So if we find no
3814 section or if the section is the same as our
3815 last section, then no move is needed. */
3816 if (sec
!= NULL
&& sec
!= last_sec
)
3818 /* Trim them off. */
3819 if (first_sec
->prev
!= NULL
)
3820 first_sec
->prev
->next
= last_sec
->next
;
3822 link_info
.output_bfd
->sections
= last_sec
->next
;
3823 if (last_sec
->next
!= NULL
)
3824 last_sec
->next
->prev
= first_sec
->prev
;
3826 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3828 last_sec
->next
= sec
->next
;
3829 if (sec
->next
!= NULL
)
3830 sec
->next
->prev
= last_sec
;
3832 link_info
.output_bfd
->section_last
= last_sec
;
3833 first_sec
->prev
= sec
;
3834 sec
->next
= first_sec
;
3842 ptr
= insert_os_after (where
);
3843 /* Snip everything after the abs_section output statement we
3844 know is at the start of the list, up to and including
3845 the insert statement we are currently processing. */
3846 first
= lang_output_section_statement
.head
->header
.next
;
3847 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3848 /* Add them back where they belong. */
3851 statement_list
.tail
= s
;
3853 s
= &lang_output_section_statement
.head
;
3857 /* Undo constraint twiddling. */
3858 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3860 os
->constraint
= -2 - os
->constraint
;
3866 /* An output section might have been removed after its statement was
3867 added. For example, ldemul_before_allocation can remove dynamic
3868 sections if they turn out to be not needed. Clean them up here. */
3871 strip_excluded_output_sections (void)
3873 lang_output_section_statement_type
*os
;
3875 /* Run lang_size_sections (if not already done). */
3876 if (expld
.phase
!= lang_mark_phase_enum
)
3878 expld
.phase
= lang_mark_phase_enum
;
3879 expld
.dataseg
.phase
= exp_dataseg_none
;
3880 one_lang_size_sections_pass (NULL
, FALSE
);
3881 lang_reset_memory_regions ();
3884 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3888 asection
*output_section
;
3889 bfd_boolean exclude
;
3891 if (os
->constraint
< 0)
3894 output_section
= os
->bfd_section
;
3895 if (output_section
== NULL
)
3898 exclude
= (output_section
->rawsize
== 0
3899 && (output_section
->flags
& SEC_KEEP
) == 0
3900 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3903 /* Some sections have not yet been sized, notably .gnu.version,
3904 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3905 input sections, so don't drop output sections that have such
3906 input sections unless they are also marked SEC_EXCLUDE. */
3907 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3911 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3912 if ((s
->flags
& SEC_EXCLUDE
) == 0
3913 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3914 || link_info
.emitrelocations
))
3921 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3922 output_section
->map_head
.link_order
= NULL
;
3923 output_section
->map_tail
.link_order
= NULL
;
3927 /* We don't set bfd_section to NULL since bfd_section of the
3928 removed output section statement may still be used. */
3929 if (!os
->update_dot
)
3931 output_section
->flags
|= SEC_EXCLUDE
;
3932 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3933 link_info
.output_bfd
->section_count
--;
3937 /* Stop future calls to lang_add_section from messing with map_head
3938 and map_tail link_order fields. */
3939 stripped_excluded_sections
= TRUE
;
3943 print_output_section_statement
3944 (lang_output_section_statement_type
*output_section_statement
)
3946 asection
*section
= output_section_statement
->bfd_section
;
3949 if (output_section_statement
!= abs_output_section
)
3951 minfo ("\n%s", output_section_statement
->name
);
3953 if (section
!= NULL
)
3955 print_dot
= section
->vma
;
3957 len
= strlen (output_section_statement
->name
);
3958 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3963 while (len
< SECTION_NAME_MAP_LENGTH
)
3969 minfo ("0x%V %W", section
->vma
, section
->size
);
3971 if (section
->vma
!= section
->lma
)
3972 minfo (_(" load address 0x%V"), section
->lma
);
3974 if (output_section_statement
->update_dot_tree
!= NULL
)
3975 exp_fold_tree (output_section_statement
->update_dot_tree
,
3976 bfd_abs_section_ptr
, &print_dot
);
3982 print_statement_list (output_section_statement
->children
.head
,
3983 output_section_statement
);
3987 print_assignment (lang_assignment_statement_type
*assignment
,
3988 lang_output_section_statement_type
*output_section
)
3995 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3998 if (assignment
->exp
->type
.node_class
== etree_assert
)
4001 tree
= assignment
->exp
->assert_s
.child
;
4005 const char *dst
= assignment
->exp
->assign
.dst
;
4007 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4009 expld
.assign_name
= dst
;
4010 tree
= assignment
->exp
->assign
.src
;
4013 osec
= output_section
->bfd_section
;
4015 osec
= bfd_abs_section_ptr
;
4016 exp_fold_tree (tree
, osec
, &print_dot
);
4017 if (expld
.result
.valid_p
)
4021 if (assignment
->exp
->type
.node_class
== etree_assert
4023 || expld
.assign_name
!= NULL
)
4025 value
= expld
.result
.value
;
4027 if (expld
.result
.section
!= NULL
)
4028 value
+= expld
.result
.section
->vma
;
4030 minfo ("0x%V", value
);
4036 struct bfd_link_hash_entry
*h
;
4038 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4039 FALSE
, FALSE
, TRUE
);
4042 value
= h
->u
.def
.value
;
4043 value
+= h
->u
.def
.section
->output_section
->vma
;
4044 value
+= h
->u
.def
.section
->output_offset
;
4046 minfo ("[0x%V]", value
);
4049 minfo ("[unresolved]");
4059 expld
.assign_name
= NULL
;
4062 exp_print_tree (assignment
->exp
);
4067 print_input_statement (lang_input_statement_type
*statm
)
4069 if (statm
->filename
!= NULL
4070 && (statm
->the_bfd
== NULL
4071 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4072 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4075 /* Print all symbols defined in a particular section. This is called
4076 via bfd_link_hash_traverse, or by print_all_symbols. */
4079 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4081 asection
*sec
= (asection
*) ptr
;
4083 if ((hash_entry
->type
== bfd_link_hash_defined
4084 || hash_entry
->type
== bfd_link_hash_defweak
)
4085 && sec
== hash_entry
->u
.def
.section
)
4089 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4092 (hash_entry
->u
.def
.value
4093 + hash_entry
->u
.def
.section
->output_offset
4094 + hash_entry
->u
.def
.section
->output_section
->vma
));
4096 minfo (" %T\n", hash_entry
->root
.string
);
4103 hash_entry_addr_cmp (const void *a
, const void *b
)
4105 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4106 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4108 if (l
->u
.def
.value
< r
->u
.def
.value
)
4110 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4117 print_all_symbols (asection
*sec
)
4119 input_section_userdata_type
*ud
4120 = (input_section_userdata_type
*) get_userdata (sec
);
4121 struct map_symbol_def
*def
;
4122 struct bfd_link_hash_entry
**entries
;
4128 *ud
->map_symbol_def_tail
= 0;
4130 /* Sort the symbols by address. */
4131 entries
= (struct bfd_link_hash_entry
**)
4132 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4134 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4135 entries
[i
] = def
->entry
;
4137 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4138 hash_entry_addr_cmp
);
4140 /* Print the symbols. */
4141 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4142 print_one_symbol (entries
[i
], sec
);
4144 obstack_free (&map_obstack
, entries
);
4147 /* Print information about an input section to the map file. */
4150 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4152 bfd_size_type size
= i
->size
;
4159 minfo ("%s", i
->name
);
4161 len
= 1 + strlen (i
->name
);
4162 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4167 while (len
< SECTION_NAME_MAP_LENGTH
)
4173 if (i
->output_section
!= NULL
4174 && i
->output_section
->owner
== link_info
.output_bfd
)
4175 addr
= i
->output_section
->vma
+ i
->output_offset
;
4183 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4185 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4187 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4199 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4202 if (i
->output_section
!= NULL
4203 && i
->output_section
->owner
== link_info
.output_bfd
)
4205 if (link_info
.reduce_memory_overheads
)
4206 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4208 print_all_symbols (i
);
4210 /* Update print_dot, but make sure that we do not move it
4211 backwards - this could happen if we have overlays and a
4212 later overlay is shorter than an earier one. */
4213 if (addr
+ TO_ADDR (size
) > print_dot
)
4214 print_dot
= addr
+ TO_ADDR (size
);
4219 print_fill_statement (lang_fill_statement_type
*fill
)
4223 fputs (" FILL mask 0x", config
.map_file
);
4224 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4225 fprintf (config
.map_file
, "%02x", *p
);
4226 fputs ("\n", config
.map_file
);
4230 print_data_statement (lang_data_statement_type
*data
)
4238 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4241 addr
= data
->output_offset
;
4242 if (data
->output_section
!= NULL
)
4243 addr
+= data
->output_section
->vma
;
4271 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4273 if (data
->exp
->type
.node_class
!= etree_value
)
4276 exp_print_tree (data
->exp
);
4281 print_dot
= addr
+ TO_ADDR (size
);
4284 /* Print an address statement. These are generated by options like
4288 print_address_statement (lang_address_statement_type
*address
)
4290 minfo (_("Address of section %s set to "), address
->section_name
);
4291 exp_print_tree (address
->address
);
4295 /* Print a reloc statement. */
4298 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4305 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4308 addr
= reloc
->output_offset
;
4309 if (reloc
->output_section
!= NULL
)
4310 addr
+= reloc
->output_section
->vma
;
4312 size
= bfd_get_reloc_size (reloc
->howto
);
4314 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4316 if (reloc
->name
!= NULL
)
4317 minfo ("%s+", reloc
->name
);
4319 minfo ("%s+", reloc
->section
->name
);
4321 exp_print_tree (reloc
->addend_exp
);
4325 print_dot
= addr
+ TO_ADDR (size
);
4329 print_padding_statement (lang_padding_statement_type
*s
)
4337 len
= sizeof " *fill*" - 1;
4338 while (len
< SECTION_NAME_MAP_LENGTH
)
4344 addr
= s
->output_offset
;
4345 if (s
->output_section
!= NULL
)
4346 addr
+= s
->output_section
->vma
;
4347 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4349 if (s
->fill
->size
!= 0)
4353 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4354 fprintf (config
.map_file
, "%02x", *p
);
4359 print_dot
= addr
+ TO_ADDR (s
->size
);
4363 print_wild_statement (lang_wild_statement_type
*w
,
4364 lang_output_section_statement_type
*os
)
4366 struct wildcard_list
*sec
;
4370 if (w
->filenames_sorted
)
4372 if (w
->filename
!= NULL
)
4373 minfo ("%s", w
->filename
);
4376 if (w
->filenames_sorted
)
4380 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4382 if (sec
->spec
.sorted
)
4384 if (sec
->spec
.exclude_name_list
!= NULL
)
4387 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4388 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4389 minfo (" %s", tmp
->name
);
4392 if (sec
->spec
.name
!= NULL
)
4393 minfo ("%s", sec
->spec
.name
);
4396 if (sec
->spec
.sorted
)
4405 print_statement_list (w
->children
.head
, os
);
4408 /* Print a group statement. */
4411 print_group (lang_group_statement_type
*s
,
4412 lang_output_section_statement_type
*os
)
4414 fprintf (config
.map_file
, "START GROUP\n");
4415 print_statement_list (s
->children
.head
, os
);
4416 fprintf (config
.map_file
, "END GROUP\n");
4419 /* Print the list of statements in S.
4420 This can be called for any statement type. */
4423 print_statement_list (lang_statement_union_type
*s
,
4424 lang_output_section_statement_type
*os
)
4428 print_statement (s
, os
);
4433 /* Print the first statement in statement list S.
4434 This can be called for any statement type. */
4437 print_statement (lang_statement_union_type
*s
,
4438 lang_output_section_statement_type
*os
)
4440 switch (s
->header
.type
)
4443 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4446 case lang_constructors_statement_enum
:
4447 if (constructor_list
.head
!= NULL
)
4449 if (constructors_sorted
)
4450 minfo (" SORT (CONSTRUCTORS)\n");
4452 minfo (" CONSTRUCTORS\n");
4453 print_statement_list (constructor_list
.head
, os
);
4456 case lang_wild_statement_enum
:
4457 print_wild_statement (&s
->wild_statement
, os
);
4459 case lang_address_statement_enum
:
4460 print_address_statement (&s
->address_statement
);
4462 case lang_object_symbols_statement_enum
:
4463 minfo (" CREATE_OBJECT_SYMBOLS\n");
4465 case lang_fill_statement_enum
:
4466 print_fill_statement (&s
->fill_statement
);
4468 case lang_data_statement_enum
:
4469 print_data_statement (&s
->data_statement
);
4471 case lang_reloc_statement_enum
:
4472 print_reloc_statement (&s
->reloc_statement
);
4474 case lang_input_section_enum
:
4475 print_input_section (s
->input_section
.section
, FALSE
);
4477 case lang_padding_statement_enum
:
4478 print_padding_statement (&s
->padding_statement
);
4480 case lang_output_section_statement_enum
:
4481 print_output_section_statement (&s
->output_section_statement
);
4483 case lang_assignment_statement_enum
:
4484 print_assignment (&s
->assignment_statement
, os
);
4486 case lang_target_statement_enum
:
4487 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4489 case lang_output_statement_enum
:
4490 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4491 if (output_target
!= NULL
)
4492 minfo (" %s", output_target
);
4495 case lang_input_statement_enum
:
4496 print_input_statement (&s
->input_statement
);
4498 case lang_group_statement_enum
:
4499 print_group (&s
->group_statement
, os
);
4501 case lang_insert_statement_enum
:
4502 minfo ("INSERT %s %s\n",
4503 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4504 s
->insert_statement
.where
);
4510 print_statements (void)
4512 print_statement_list (statement_list
.head
, abs_output_section
);
4515 /* Print the first N statements in statement list S to STDERR.
4516 If N == 0, nothing is printed.
4517 If N < 0, the entire list is printed.
4518 Intended to be called from GDB. */
4521 dprint_statement (lang_statement_union_type
*s
, int n
)
4523 FILE *map_save
= config
.map_file
;
4525 config
.map_file
= stderr
;
4528 print_statement_list (s
, abs_output_section
);
4531 while (s
&& --n
>= 0)
4533 print_statement (s
, abs_output_section
);
4538 config
.map_file
= map_save
;
4542 insert_pad (lang_statement_union_type
**ptr
,
4544 bfd_size_type alignment_needed
,
4545 asection
*output_section
,
4548 static fill_type zero_fill
;
4549 lang_statement_union_type
*pad
= NULL
;
4551 if (ptr
!= &statement_list
.head
)
4552 pad
= ((lang_statement_union_type
*)
4553 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4555 && pad
->header
.type
== lang_padding_statement_enum
4556 && pad
->padding_statement
.output_section
== output_section
)
4558 /* Use the existing pad statement. */
4560 else if ((pad
= *ptr
) != NULL
4561 && pad
->header
.type
== lang_padding_statement_enum
4562 && pad
->padding_statement
.output_section
== output_section
)
4564 /* Use the existing pad statement. */
4568 /* Make a new padding statement, linked into existing chain. */
4569 pad
= (lang_statement_union_type
*)
4570 stat_alloc (sizeof (lang_padding_statement_type
));
4571 pad
->header
.next
= *ptr
;
4573 pad
->header
.type
= lang_padding_statement_enum
;
4574 pad
->padding_statement
.output_section
= output_section
;
4577 pad
->padding_statement
.fill
= fill
;
4579 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4580 pad
->padding_statement
.size
= alignment_needed
;
4581 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4582 - output_section
->vma
);
4585 /* Work out how much this section will move the dot point. */
4589 (lang_statement_union_type
**this_ptr
,
4590 lang_output_section_statement_type
*output_section_statement
,
4594 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4595 asection
*i
= is
->section
;
4596 asection
*o
= output_section_statement
->bfd_section
;
4598 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4599 i
->output_offset
= i
->vma
- o
->vma
;
4600 else if ((i
->flags
& SEC_EXCLUDE
) != 0)
4601 i
->output_offset
= dot
- o
->vma
;
4604 bfd_size_type alignment_needed
;
4606 /* Align this section first to the input sections requirement,
4607 then to the output section's requirement. If this alignment
4608 is greater than any seen before, then record it too. Perform
4609 the alignment by inserting a magic 'padding' statement. */
4611 if (output_section_statement
->subsection_alignment
!= -1)
4612 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4614 if (o
->alignment_power
< i
->alignment_power
)
4615 o
->alignment_power
= i
->alignment_power
;
4617 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4619 if (alignment_needed
!= 0)
4621 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4622 dot
+= alignment_needed
;
4625 /* Remember where in the output section this input section goes. */
4626 i
->output_offset
= dot
- o
->vma
;
4628 /* Mark how big the output section must be to contain this now. */
4629 dot
+= TO_ADDR (i
->size
);
4630 o
->size
= TO_SIZE (dot
- o
->vma
);
4637 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4639 const asection
*sec1
= *(const asection
**) arg1
;
4640 const asection
*sec2
= *(const asection
**) arg2
;
4642 if (bfd_section_lma (sec1
->owner
, sec1
)
4643 < bfd_section_lma (sec2
->owner
, sec2
))
4645 else if (bfd_section_lma (sec1
->owner
, sec1
)
4646 > bfd_section_lma (sec2
->owner
, sec2
))
4648 else if (sec1
->id
< sec2
->id
)
4650 else if (sec1
->id
> sec2
->id
)
4656 #define IGNORE_SECTION(s) \
4657 ((s->flags & SEC_ALLOC) == 0 \
4658 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4659 && (s->flags & SEC_LOAD) == 0))
4661 /* Check to see if any allocated sections overlap with other allocated
4662 sections. This can happen if a linker script specifies the output
4663 section addresses of the two sections. Also check whether any memory
4664 region has overflowed. */
4667 lang_check_section_addresses (void)
4670 asection
**sections
, **spp
;
4677 lang_memory_region_type
*m
;
4679 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4682 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4683 sections
= (asection
**) xmalloc (amt
);
4685 /* Scan all sections in the output list. */
4687 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4689 /* Only consider loadable sections with real contents. */
4690 if (!(s
->flags
& SEC_LOAD
)
4691 || !(s
->flags
& SEC_ALLOC
)
4695 sections
[count
] = s
;
4702 qsort (sections
, (size_t) count
, sizeof (asection
*),
4703 sort_sections_by_lma
);
4708 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4709 for (count
--; count
; count
--)
4711 /* We must check the sections' LMA addresses not their VMA
4712 addresses because overlay sections can have overlapping VMAs
4713 but they must have distinct LMAs. */
4719 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4721 /* Look for an overlap. We have sorted sections by lma, so we
4722 know that s_start >= p_start. Besides the obvious case of
4723 overlap when the current section starts before the previous
4724 one ends, we also must have overlap if the previous section
4725 wraps around the address space. */
4726 if (s_start
<= p_end
4728 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4729 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4734 /* If any memory region has overflowed, report by how much.
4735 We do not issue this diagnostic for regions that had sections
4736 explicitly placed outside their bounds; os_region_check's
4737 diagnostics are adequate for that case.
4739 FIXME: It is conceivable that m->current - (m->origin + m->length)
4740 might overflow a 32-bit integer. There is, alas, no way to print
4741 a bfd_vma quantity in decimal. */
4742 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4743 if (m
->had_full_message
)
4744 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4745 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4749 /* Make sure the new address is within the region. We explicitly permit the
4750 current address to be at the exact end of the region when the address is
4751 non-zero, in case the region is at the end of addressable memory and the
4752 calculation wraps around. */
4755 os_region_check (lang_output_section_statement_type
*os
,
4756 lang_memory_region_type
*region
,
4760 if ((region
->current
< region
->origin
4761 || (region
->current
- region
->origin
> region
->length
))
4762 && ((region
->current
!= region
->origin
+ region
->length
)
4767 einfo (_("%X%P: address 0x%v of %B section `%s'"
4768 " is not within region `%s'\n"),
4770 os
->bfd_section
->owner
,
4771 os
->bfd_section
->name
,
4772 region
->name_list
.name
);
4774 else if (!region
->had_full_message
)
4776 region
->had_full_message
= TRUE
;
4778 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4779 os
->bfd_section
->owner
,
4780 os
->bfd_section
->name
,
4781 region
->name_list
.name
);
4786 /* Set the sizes for all the output sections. */
4789 lang_size_sections_1
4790 (lang_statement_union_type
**prev
,
4791 lang_output_section_statement_type
*output_section_statement
,
4795 bfd_boolean check_regions
)
4797 lang_statement_union_type
*s
;
4799 /* Size up the sections from their constituent parts. */
4800 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4802 switch (s
->header
.type
)
4804 case lang_output_section_statement_enum
:
4806 bfd_vma newdot
, after
, dotdelta
;
4807 lang_output_section_statement_type
*os
;
4808 lang_memory_region_type
*r
;
4809 int section_alignment
= 0;
4811 os
= &s
->output_section_statement
;
4812 if (os
->constraint
== -1)
4815 /* FIXME: We shouldn't need to zero section vmas for ld -r
4816 here, in lang_insert_orphan, or in the default linker scripts.
4817 This is covering for coff backend linker bugs. See PR6945. */
4818 if (os
->addr_tree
== NULL
4819 && link_info
.relocatable
4820 && (bfd_get_flavour (link_info
.output_bfd
)
4821 == bfd_target_coff_flavour
))
4822 os
->addr_tree
= exp_intop (0);
4823 if (os
->addr_tree
!= NULL
)
4825 os
->processed_vma
= FALSE
;
4826 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4828 if (expld
.result
.valid_p
)
4830 dot
= expld
.result
.value
;
4831 if (expld
.result
.section
!= NULL
)
4832 dot
+= expld
.result
.section
->vma
;
4834 else if (expld
.phase
!= lang_mark_phase_enum
)
4835 einfo (_("%F%S: non constant or forward reference"
4836 " address expression for section %s\n"),
4837 os
->addr_tree
, os
->name
);
4840 if (os
->bfd_section
== NULL
)
4841 /* This section was removed or never actually created. */
4844 /* If this is a COFF shared library section, use the size and
4845 address from the input section. FIXME: This is COFF
4846 specific; it would be cleaner if there were some other way
4847 to do this, but nothing simple comes to mind. */
4848 if (((bfd_get_flavour (link_info
.output_bfd
)
4849 == bfd_target_ecoff_flavour
)
4850 || (bfd_get_flavour (link_info
.output_bfd
)
4851 == bfd_target_coff_flavour
))
4852 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4856 if (os
->children
.head
== NULL
4857 || os
->children
.head
->header
.next
!= NULL
4858 || (os
->children
.head
->header
.type
4859 != lang_input_section_enum
))
4860 einfo (_("%P%X: Internal error on COFF shared library"
4861 " section %s\n"), os
->name
);
4863 input
= os
->children
.head
->input_section
.section
;
4864 bfd_set_section_vma (os
->bfd_section
->owner
,
4866 bfd_section_vma (input
->owner
, input
));
4867 os
->bfd_section
->size
= input
->size
;
4873 if (bfd_is_abs_section (os
->bfd_section
))
4875 /* No matter what happens, an abs section starts at zero. */
4876 ASSERT (os
->bfd_section
->vma
== 0);
4880 if (os
->addr_tree
== NULL
)
4882 /* No address specified for this section, get one
4883 from the region specification. */
4884 if (os
->region
== NULL
4885 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4886 && os
->region
->name_list
.name
[0] == '*'
4887 && strcmp (os
->region
->name_list
.name
,
4888 DEFAULT_MEMORY_REGION
) == 0))
4890 os
->region
= lang_memory_default (os
->bfd_section
);
4893 /* If a loadable section is using the default memory
4894 region, and some non default memory regions were
4895 defined, issue an error message. */
4897 && !IGNORE_SECTION (os
->bfd_section
)
4898 && ! link_info
.relocatable
4900 && strcmp (os
->region
->name_list
.name
,
4901 DEFAULT_MEMORY_REGION
) == 0
4902 && lang_memory_region_list
!= NULL
4903 && (strcmp (lang_memory_region_list
->name_list
.name
,
4904 DEFAULT_MEMORY_REGION
) != 0
4905 || lang_memory_region_list
->next
!= NULL
)
4906 && expld
.phase
!= lang_mark_phase_enum
)
4908 /* By default this is an error rather than just a
4909 warning because if we allocate the section to the
4910 default memory region we can end up creating an
4911 excessively large binary, or even seg faulting when
4912 attempting to perform a negative seek. See
4913 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4914 for an example of this. This behaviour can be
4915 overridden by the using the --no-check-sections
4917 if (command_line
.check_section_addresses
)
4918 einfo (_("%P%F: error: no memory region specified"
4919 " for loadable section `%s'\n"),
4920 bfd_get_section_name (link_info
.output_bfd
,
4923 einfo (_("%P: warning: no memory region specified"
4924 " for loadable section `%s'\n"),
4925 bfd_get_section_name (link_info
.output_bfd
,
4929 newdot
= os
->region
->current
;
4930 section_alignment
= os
->bfd_section
->alignment_power
;
4933 section_alignment
= os
->section_alignment
;
4935 /* Align to what the section needs. */
4936 if (section_alignment
> 0)
4938 bfd_vma savedot
= newdot
;
4939 newdot
= align_power (newdot
, section_alignment
);
4941 dotdelta
= newdot
- savedot
;
4943 && (config
.warn_section_align
4944 || os
->addr_tree
!= NULL
)
4945 && expld
.phase
!= lang_mark_phase_enum
)
4946 einfo (_("%P: warning: changing start of section"
4947 " %s by %lu bytes\n"),
4948 os
->name
, (unsigned long) dotdelta
);
4951 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4953 os
->bfd_section
->output_offset
= 0;
4956 lang_size_sections_1 (&os
->children
.head
, os
,
4957 os
->fill
, newdot
, relax
, check_regions
);
4959 os
->processed_vma
= TRUE
;
4961 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4962 /* Except for some special linker created sections,
4963 no output section should change from zero size
4964 after strip_excluded_output_sections. A non-zero
4965 size on an ignored section indicates that some
4966 input section was not sized early enough. */
4967 ASSERT (os
->bfd_section
->size
== 0);
4970 dot
= os
->bfd_section
->vma
;
4972 /* Put the section within the requested block size, or
4973 align at the block boundary. */
4975 + TO_ADDR (os
->bfd_section
->size
)
4976 + os
->block_value
- 1)
4977 & - (bfd_vma
) os
->block_value
);
4979 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4982 /* Set section lma. */
4985 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4989 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4990 os
->bfd_section
->lma
= lma
;
4992 else if (os
->lma_region
!= NULL
)
4994 bfd_vma lma
= os
->lma_region
->current
;
4996 if (os
->align_lma_with_input
)
5000 /* When LMA_REGION is the same as REGION, align the LMA
5001 as we did for the VMA, possibly including alignment
5002 from the bfd section. If a different region, then
5003 only align according to the value in the output
5005 if (os
->lma_region
!= os
->region
)
5006 section_alignment
= os
->section_alignment
;
5007 if (section_alignment
> 0)
5008 lma
= align_power (lma
, section_alignment
);
5010 os
->bfd_section
->lma
= lma
;
5012 else if (r
->last_os
!= NULL
5013 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5018 last
= r
->last_os
->output_section_statement
.bfd_section
;
5020 /* A backwards move of dot should be accompanied by
5021 an explicit assignment to the section LMA (ie.
5022 os->load_base set) because backwards moves can
5023 create overlapping LMAs. */
5025 && os
->bfd_section
->size
!= 0
5026 && dot
+ os
->bfd_section
->size
<= last
->vma
)
5028 /* If dot moved backwards then leave lma equal to
5029 vma. This is the old default lma, which might
5030 just happen to work when the backwards move is
5031 sufficiently large. Nag if this changes anything,
5032 so people can fix their linker scripts. */
5034 if (last
->vma
!= last
->lma
)
5035 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5040 /* If this is an overlay, set the current lma to that
5041 at the end of the previous section. */
5042 if (os
->sectype
== overlay_section
)
5043 lma
= last
->lma
+ last
->size
;
5045 /* Otherwise, keep the same lma to vma relationship
5046 as the previous section. */
5048 lma
= dot
+ last
->lma
- last
->vma
;
5050 if (section_alignment
> 0)
5051 lma
= align_power (lma
, section_alignment
);
5052 os
->bfd_section
->lma
= lma
;
5055 os
->processed_lma
= TRUE
;
5057 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5060 /* Keep track of normal sections using the default
5061 lma region. We use this to set the lma for
5062 following sections. Overlays or other linker
5063 script assignment to lma might mean that the
5064 default lma == vma is incorrect.
5065 To avoid warnings about dot moving backwards when using
5066 -Ttext, don't start tracking sections until we find one
5067 of non-zero size or with lma set differently to vma. */
5068 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5069 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5070 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5071 && (os
->bfd_section
->size
!= 0
5072 || (r
->last_os
== NULL
5073 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5074 || (r
->last_os
!= NULL
5075 && dot
>= (r
->last_os
->output_section_statement
5076 .bfd_section
->vma
)))
5077 && os
->lma_region
== NULL
5078 && !link_info
.relocatable
)
5081 /* .tbss sections effectively have zero size. */
5082 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5083 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5084 || link_info
.relocatable
)
5085 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5090 if (os
->update_dot_tree
!= 0)
5091 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5093 /* Update dot in the region ?
5094 We only do this if the section is going to be allocated,
5095 since unallocated sections do not contribute to the region's
5096 overall size in memory. */
5097 if (os
->region
!= NULL
5098 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5100 os
->region
->current
= dot
;
5103 /* Make sure the new address is within the region. */
5104 os_region_check (os
, os
->region
, os
->addr_tree
,
5105 os
->bfd_section
->vma
);
5107 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5108 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5109 || os
->align_lma_with_input
))
5111 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5114 os_region_check (os
, os
->lma_region
, NULL
,
5115 os
->bfd_section
->lma
);
5121 case lang_constructors_statement_enum
:
5122 dot
= lang_size_sections_1 (&constructor_list
.head
,
5123 output_section_statement
,
5124 fill
, dot
, relax
, check_regions
);
5127 case lang_data_statement_enum
:
5129 unsigned int size
= 0;
5131 s
->data_statement
.output_offset
=
5132 dot
- output_section_statement
->bfd_section
->vma
;
5133 s
->data_statement
.output_section
=
5134 output_section_statement
->bfd_section
;
5136 /* We might refer to provided symbols in the expression, and
5137 need to mark them as needed. */
5138 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5140 switch (s
->data_statement
.type
)
5158 if (size
< TO_SIZE ((unsigned) 1))
5159 size
= TO_SIZE ((unsigned) 1);
5160 dot
+= TO_ADDR (size
);
5161 output_section_statement
->bfd_section
->size
5162 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5167 case lang_reloc_statement_enum
:
5171 s
->reloc_statement
.output_offset
=
5172 dot
- output_section_statement
->bfd_section
->vma
;
5173 s
->reloc_statement
.output_section
=
5174 output_section_statement
->bfd_section
;
5175 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5176 dot
+= TO_ADDR (size
);
5177 output_section_statement
->bfd_section
->size
5178 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5182 case lang_wild_statement_enum
:
5183 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5184 output_section_statement
,
5185 fill
, dot
, relax
, check_regions
);
5188 case lang_object_symbols_statement_enum
:
5189 link_info
.create_object_symbols_section
=
5190 output_section_statement
->bfd_section
;
5193 case lang_output_statement_enum
:
5194 case lang_target_statement_enum
:
5197 case lang_input_section_enum
:
5201 i
= s
->input_section
.section
;
5206 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5207 einfo (_("%P%F: can't relax section: %E\n"));
5211 dot
= size_input_section (prev
, output_section_statement
,
5216 case lang_input_statement_enum
:
5219 case lang_fill_statement_enum
:
5220 s
->fill_statement
.output_section
=
5221 output_section_statement
->bfd_section
;
5223 fill
= s
->fill_statement
.fill
;
5226 case lang_assignment_statement_enum
:
5228 bfd_vma newdot
= dot
;
5229 etree_type
*tree
= s
->assignment_statement
.exp
;
5231 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5233 exp_fold_tree (tree
,
5234 output_section_statement
->bfd_section
,
5237 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5239 if (!expld
.dataseg
.relro_start_stat
)
5240 expld
.dataseg
.relro_start_stat
= s
;
5243 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5246 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5248 if (!expld
.dataseg
.relro_end_stat
)
5249 expld
.dataseg
.relro_end_stat
= s
;
5252 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5255 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5257 /* This symbol may be relative to this section. */
5258 if ((tree
->type
.node_class
== etree_provided
5259 || tree
->type
.node_class
== etree_assign
)
5260 && (tree
->assign
.dst
[0] != '.'
5261 || tree
->assign
.dst
[1] != '\0'))
5262 output_section_statement
->update_dot
= 1;
5264 if (!output_section_statement
->ignored
)
5266 if (output_section_statement
== abs_output_section
)
5268 /* If we don't have an output section, then just adjust
5269 the default memory address. */
5270 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5271 FALSE
)->current
= newdot
;
5273 else if (newdot
!= dot
)
5275 /* Insert a pad after this statement. We can't
5276 put the pad before when relaxing, in case the
5277 assignment references dot. */
5278 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5279 output_section_statement
->bfd_section
, dot
);
5281 /* Don't neuter the pad below when relaxing. */
5284 /* If dot is advanced, this implies that the section
5285 should have space allocated to it, unless the
5286 user has explicitly stated that the section
5287 should not be allocated. */
5288 if (output_section_statement
->sectype
!= noalloc_section
5289 && (output_section_statement
->sectype
!= noload_section
5290 || (bfd_get_flavour (link_info
.output_bfd
)
5291 == bfd_target_elf_flavour
)))
5292 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5299 case lang_padding_statement_enum
:
5300 /* If this is the first time lang_size_sections is called,
5301 we won't have any padding statements. If this is the
5302 second or later passes when relaxing, we should allow
5303 padding to shrink. If padding is needed on this pass, it
5304 will be added back in. */
5305 s
->padding_statement
.size
= 0;
5307 /* Make sure output_offset is valid. If relaxation shrinks
5308 the section and this pad isn't needed, it's possible to
5309 have output_offset larger than the final size of the
5310 section. bfd_set_section_contents will complain even for
5311 a pad size of zero. */
5312 s
->padding_statement
.output_offset
5313 = dot
- output_section_statement
->bfd_section
->vma
;
5316 case lang_group_statement_enum
:
5317 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5318 output_section_statement
,
5319 fill
, dot
, relax
, check_regions
);
5322 case lang_insert_statement_enum
:
5325 /* We can only get here when relaxing is turned on. */
5326 case lang_address_statement_enum
:
5333 prev
= &s
->header
.next
;
5338 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5339 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5340 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5341 segments. We are allowed an opportunity to override this decision. */
5344 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5345 bfd
* abfd ATTRIBUTE_UNUSED
,
5346 asection
* current_section
,
5347 asection
* previous_section
,
5348 bfd_boolean new_segment
)
5350 lang_output_section_statement_type
* cur
;
5351 lang_output_section_statement_type
* prev
;
5353 /* The checks below are only necessary when the BFD library has decided
5354 that the two sections ought to be placed into the same segment. */
5358 /* Paranoia checks. */
5359 if (current_section
== NULL
|| previous_section
== NULL
)
5362 /* If this flag is set, the target never wants code and non-code
5363 sections comingled in the same segment. */
5364 if (config
.separate_code
5365 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5368 /* Find the memory regions associated with the two sections.
5369 We call lang_output_section_find() here rather than scanning the list
5370 of output sections looking for a matching section pointer because if
5371 we have a large number of sections then a hash lookup is faster. */
5372 cur
= lang_output_section_find (current_section
->name
);
5373 prev
= lang_output_section_find (previous_section
->name
);
5375 /* More paranoia. */
5376 if (cur
== NULL
|| prev
== NULL
)
5379 /* If the regions are different then force the sections to live in
5380 different segments. See the email thread starting at the following
5381 URL for the reasons why this is necessary:
5382 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5383 return cur
->region
!= prev
->region
;
5387 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5389 lang_statement_iteration
++;
5390 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5391 0, 0, relax
, check_regions
);
5395 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5397 expld
.phase
= lang_allocating_phase_enum
;
5398 expld
.dataseg
.phase
= exp_dataseg_none
;
5400 one_lang_size_sections_pass (relax
, check_regions
);
5401 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5402 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5404 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5405 to put expld.dataseg.relro_end on a (common) page boundary. */
5406 bfd_vma min_base
, relro_end
, maxpage
;
5408 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5409 maxpage
= expld
.dataseg
.maxpagesize
;
5410 /* MIN_BASE is the absolute minimum address we are allowed to start the
5411 read-write segment (byte before will be mapped read-only). */
5412 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5413 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5414 & (expld
.dataseg
.pagesize
- 1));
5415 /* Compute the expected PT_GNU_RELRO segment end. */
5416 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5417 & ~(expld
.dataseg
.pagesize
- 1));
5418 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5420 expld
.dataseg
.base
-= maxpage
;
5421 relro_end
-= maxpage
;
5423 lang_reset_memory_regions ();
5424 one_lang_size_sections_pass (relax
, check_regions
);
5425 if (expld
.dataseg
.relro_end
> relro_end
)
5427 /* The alignment of sections between DATA_SEGMENT_ALIGN
5428 and DATA_SEGMENT_RELRO_END can cause excessive padding to
5429 be inserted at DATA_SEGMENT_RELRO_END. Try to start a
5430 bit lower so that the section alignments will fit in. */
5432 unsigned int max_alignment_power
= 0;
5434 /* Find maximum alignment power of sections between
5435 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5436 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5437 if (sec
->vma
>= expld
.dataseg
.base
5438 && sec
->vma
< expld
.dataseg
.relro_end
5439 && sec
->alignment_power
> max_alignment_power
)
5440 max_alignment_power
= sec
->alignment_power
;
5442 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5444 /* Aligning the adjusted base guarantees the padding
5445 between sections won't change. This is better than
5446 simply subtracting 1 << max_alignment_power which is
5447 what we used to do here. */
5448 expld
.dataseg
.base
&= ~((1 << max_alignment_power
) - 1);
5449 lang_reset_memory_regions ();
5450 one_lang_size_sections_pass (relax
, check_regions
);
5453 link_info
.relro_start
= expld
.dataseg
.base
;
5454 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5456 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5458 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5459 a page could be saved in the data segment. */
5460 bfd_vma first
, last
;
5462 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5463 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5465 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5466 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5467 && first
+ last
<= expld
.dataseg
.pagesize
)
5469 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5470 lang_reset_memory_regions ();
5471 one_lang_size_sections_pass (relax
, check_regions
);
5474 expld
.dataseg
.phase
= exp_dataseg_done
;
5477 expld
.dataseg
.phase
= exp_dataseg_done
;
5480 static lang_output_section_statement_type
*current_section
;
5481 static lang_assignment_statement_type
*current_assign
;
5482 static bfd_boolean prefer_next_section
;
5484 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5487 lang_do_assignments_1 (lang_statement_union_type
*s
,
5488 lang_output_section_statement_type
*current_os
,
5491 bfd_boolean
*found_end
)
5493 for (; s
!= NULL
; s
= s
->header
.next
)
5495 switch (s
->header
.type
)
5497 case lang_constructors_statement_enum
:
5498 dot
= lang_do_assignments_1 (constructor_list
.head
,
5499 current_os
, fill
, dot
, found_end
);
5502 case lang_output_section_statement_enum
:
5504 lang_output_section_statement_type
*os
;
5506 os
= &(s
->output_section_statement
);
5507 os
->after_end
= *found_end
;
5508 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5510 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5512 current_section
= os
;
5513 prefer_next_section
= FALSE
;
5515 dot
= os
->bfd_section
->vma
;
5517 lang_do_assignments_1 (os
->children
.head
,
5518 os
, os
->fill
, dot
, found_end
);
5520 /* .tbss sections effectively have zero size. */
5521 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5522 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5523 || link_info
.relocatable
)
5524 dot
+= TO_ADDR (os
->bfd_section
->size
);
5526 if (os
->update_dot_tree
!= NULL
)
5527 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5532 case lang_wild_statement_enum
:
5534 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5535 current_os
, fill
, dot
, found_end
);
5538 case lang_object_symbols_statement_enum
:
5539 case lang_output_statement_enum
:
5540 case lang_target_statement_enum
:
5543 case lang_data_statement_enum
:
5544 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5545 if (expld
.result
.valid_p
)
5547 s
->data_statement
.value
= expld
.result
.value
;
5548 if (expld
.result
.section
!= NULL
)
5549 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5552 einfo (_("%F%P: invalid data statement\n"));
5555 switch (s
->data_statement
.type
)
5573 if (size
< TO_SIZE ((unsigned) 1))
5574 size
= TO_SIZE ((unsigned) 1);
5575 dot
+= TO_ADDR (size
);
5579 case lang_reloc_statement_enum
:
5580 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5581 bfd_abs_section_ptr
, &dot
);
5582 if (expld
.result
.valid_p
)
5583 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5585 einfo (_("%F%P: invalid reloc statement\n"));
5586 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5589 case lang_input_section_enum
:
5591 asection
*in
= s
->input_section
.section
;
5593 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5594 dot
+= TO_ADDR (in
->size
);
5598 case lang_input_statement_enum
:
5601 case lang_fill_statement_enum
:
5602 fill
= s
->fill_statement
.fill
;
5605 case lang_assignment_statement_enum
:
5606 current_assign
= &s
->assignment_statement
;
5607 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5609 const char *p
= current_assign
->exp
->assign
.dst
;
5611 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5612 prefer_next_section
= TRUE
;
5616 if (strcmp (p
, "end") == 0)
5619 exp_fold_tree (s
->assignment_statement
.exp
,
5620 current_os
->bfd_section
,
5624 case lang_padding_statement_enum
:
5625 dot
+= TO_ADDR (s
->padding_statement
.size
);
5628 case lang_group_statement_enum
:
5629 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5630 current_os
, fill
, dot
, found_end
);
5633 case lang_insert_statement_enum
:
5636 case lang_address_statement_enum
:
5648 lang_do_assignments (lang_phase_type phase
)
5650 bfd_boolean found_end
= FALSE
;
5652 current_section
= NULL
;
5653 prefer_next_section
= FALSE
;
5654 expld
.phase
= phase
;
5655 lang_statement_iteration
++;
5656 lang_do_assignments_1 (statement_list
.head
,
5657 abs_output_section
, NULL
, 0, &found_end
);
5660 /* For an assignment statement outside of an output section statement,
5661 choose the best of neighbouring output sections to use for values
5665 section_for_dot (void)
5669 /* Assignments belong to the previous output section, unless there
5670 has been an assignment to "dot", in which case following
5671 assignments belong to the next output section. (The assumption
5672 is that an assignment to "dot" is setting up the address for the
5673 next output section.) Except that past the assignment to "_end"
5674 we always associate with the previous section. This exception is
5675 for targets like SH that define an alloc .stack or other
5676 weirdness after non-alloc sections. */
5677 if (current_section
== NULL
|| prefer_next_section
)
5679 lang_statement_union_type
*stmt
;
5680 lang_output_section_statement_type
*os
;
5682 for (stmt
= (lang_statement_union_type
*) current_assign
;
5684 stmt
= stmt
->header
.next
)
5685 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5688 os
= &stmt
->output_section_statement
;
5691 && (os
->bfd_section
== NULL
5692 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5693 || bfd_section_removed_from_list (link_info
.output_bfd
,
5697 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5700 s
= os
->bfd_section
;
5702 s
= link_info
.output_bfd
->section_last
;
5704 && ((s
->flags
& SEC_ALLOC
) == 0
5705 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5710 return bfd_abs_section_ptr
;
5714 s
= current_section
->bfd_section
;
5716 /* The section may have been stripped. */
5718 && ((s
->flags
& SEC_EXCLUDE
) != 0
5719 || (s
->flags
& SEC_ALLOC
) == 0
5720 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5721 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5724 s
= link_info
.output_bfd
->sections
;
5726 && ((s
->flags
& SEC_ALLOC
) == 0
5727 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5732 return bfd_abs_section_ptr
;
5735 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5736 operator .startof. (section_name), it produces an undefined symbol
5737 .startof.section_name. Similarly, when it sees
5738 .sizeof. (section_name), it produces an undefined symbol
5739 .sizeof.section_name. For all the output sections, we look for
5740 such symbols, and set them to the correct value. */
5743 lang_set_startof (void)
5747 if (link_info
.relocatable
)
5750 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5752 const char *secname
;
5754 struct bfd_link_hash_entry
*h
;
5756 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5757 buf
= (char *) xmalloc (10 + strlen (secname
));
5759 sprintf (buf
, ".startof.%s", secname
);
5760 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5761 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5763 h
->type
= bfd_link_hash_defined
;
5765 h
->u
.def
.section
= s
;
5768 sprintf (buf
, ".sizeof.%s", secname
);
5769 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5770 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5772 h
->type
= bfd_link_hash_defined
;
5773 h
->u
.def
.value
= TO_ADDR (s
->size
);
5774 h
->u
.def
.section
= bfd_abs_section_ptr
;
5784 struct bfd_link_hash_entry
*h
;
5787 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5788 || (link_info
.shared
&& !link_info
.executable
))
5789 warn
= entry_from_cmdline
;
5793 /* Force the user to specify a root when generating a relocatable with
5795 if (link_info
.gc_sections
&& link_info
.relocatable
5796 && !(entry_from_cmdline
|| undef_from_cmdline
))
5797 einfo (_("%P%F: gc-sections requires either an entry or "
5798 "an undefined symbol\n"));
5800 if (entry_symbol
.name
== NULL
)
5802 /* No entry has been specified. Look for the default entry, but
5803 don't warn if we don't find it. */
5804 entry_symbol
.name
= entry_symbol_default
;
5808 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5809 FALSE
, FALSE
, TRUE
);
5811 && (h
->type
== bfd_link_hash_defined
5812 || h
->type
== bfd_link_hash_defweak
)
5813 && h
->u
.def
.section
->output_section
!= NULL
)
5817 val
= (h
->u
.def
.value
5818 + bfd_get_section_vma (link_info
.output_bfd
,
5819 h
->u
.def
.section
->output_section
)
5820 + h
->u
.def
.section
->output_offset
);
5821 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5822 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5829 /* We couldn't find the entry symbol. Try parsing it as a
5831 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5834 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5835 einfo (_("%P%F: can't set start address\n"));
5841 /* Can't find the entry symbol, and it's not a number. Use
5842 the first address in the text section. */
5843 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5847 einfo (_("%P: warning: cannot find entry symbol %s;"
5848 " defaulting to %V\n"),
5850 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5851 if (!(bfd_set_start_address
5852 (link_info
.output_bfd
,
5853 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5854 einfo (_("%P%F: can't set start address\n"));
5859 einfo (_("%P: warning: cannot find entry symbol %s;"
5860 " not setting start address\n"),
5867 /* This is a small function used when we want to ignore errors from
5871 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5873 /* Don't do anything. */
5876 /* Check that the architecture of all the input files is compatible
5877 with the output file. Also call the backend to let it do any
5878 other checking that is needed. */
5883 lang_statement_union_type
*file
;
5885 const bfd_arch_info_type
*compatible
;
5887 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5889 #ifdef ENABLE_PLUGINS
5890 /* Don't check format of files claimed by plugin. */
5891 if (file
->input_statement
.flags
.claimed
)
5893 #endif /* ENABLE_PLUGINS */
5894 input_bfd
= file
->input_statement
.the_bfd
;
5896 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5897 command_line
.accept_unknown_input_arch
);
5899 /* In general it is not possible to perform a relocatable
5900 link between differing object formats when the input
5901 file has relocations, because the relocations in the
5902 input format may not have equivalent representations in
5903 the output format (and besides BFD does not translate
5904 relocs for other link purposes than a final link). */
5905 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5906 && (compatible
== NULL
5907 || (bfd_get_flavour (input_bfd
)
5908 != bfd_get_flavour (link_info
.output_bfd
)))
5909 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5911 einfo (_("%P%F: Relocatable linking with relocations from"
5912 " format %s (%B) to format %s (%B) is not supported\n"),
5913 bfd_get_target (input_bfd
), input_bfd
,
5914 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5915 /* einfo with %F exits. */
5918 if (compatible
== NULL
)
5920 if (command_line
.warn_mismatch
)
5921 einfo (_("%P%X: %s architecture of input file `%B'"
5922 " is incompatible with %s output\n"),
5923 bfd_printable_name (input_bfd
), input_bfd
,
5924 bfd_printable_name (link_info
.output_bfd
));
5926 else if (bfd_count_sections (input_bfd
))
5928 /* If the input bfd has no contents, it shouldn't set the
5929 private data of the output bfd. */
5931 bfd_error_handler_type pfn
= NULL
;
5933 /* If we aren't supposed to warn about mismatched input
5934 files, temporarily set the BFD error handler to a
5935 function which will do nothing. We still want to call
5936 bfd_merge_private_bfd_data, since it may set up
5937 information which is needed in the output file. */
5938 if (! command_line
.warn_mismatch
)
5939 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5940 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5942 if (command_line
.warn_mismatch
)
5943 einfo (_("%P%X: failed to merge target specific data"
5944 " of file %B\n"), input_bfd
);
5946 if (! command_line
.warn_mismatch
)
5947 bfd_set_error_handler (pfn
);
5952 /* Look through all the global common symbols and attach them to the
5953 correct section. The -sort-common command line switch may be used
5954 to roughly sort the entries by alignment. */
5959 if (command_line
.inhibit_common_definition
)
5961 if (link_info
.relocatable
5962 && ! command_line
.force_common_definition
)
5965 if (! config
.sort_common
)
5966 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5971 if (config
.sort_common
== sort_descending
)
5973 for (power
= 4; power
> 0; power
--)
5974 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5977 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5981 for (power
= 0; power
<= 4; power
++)
5982 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5985 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5990 /* Place one common symbol in the correct section. */
5993 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5995 unsigned int power_of_two
;
5999 if (h
->type
!= bfd_link_hash_common
)
6003 power_of_two
= h
->u
.c
.p
->alignment_power
;
6005 if (config
.sort_common
== sort_descending
6006 && power_of_two
< *(unsigned int *) info
)
6008 else if (config
.sort_common
== sort_ascending
6009 && power_of_two
> *(unsigned int *) info
)
6012 section
= h
->u
.c
.p
->section
;
6013 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6014 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6017 if (config
.map_file
!= NULL
)
6019 static bfd_boolean header_printed
;
6024 if (! header_printed
)
6026 minfo (_("\nAllocating common symbols\n"));
6027 minfo (_("Common symbol size file\n\n"));
6028 header_printed
= TRUE
;
6031 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6032 DMGL_ANSI
| DMGL_PARAMS
);
6035 minfo ("%s", h
->root
.string
);
6036 len
= strlen (h
->root
.string
);
6041 len
= strlen (name
);
6057 if (size
<= 0xffffffff)
6058 sprintf (buf
, "%lx", (unsigned long) size
);
6060 sprintf_vma (buf
, size
);
6070 minfo ("%B\n", section
->owner
);
6076 /* Run through the input files and ensure that every input section has
6077 somewhere to go. If one is found without a destination then create
6078 an input request and place it into the statement tree. */
6081 lang_place_orphans (void)
6083 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6087 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6089 if (s
->output_section
== NULL
)
6091 /* This section of the file is not attached, root
6092 around for a sensible place for it to go. */
6094 if (file
->flags
.just_syms
)
6095 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6096 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
6097 s
->output_section
= bfd_abs_section_ptr
;
6098 else if (strcmp (s
->name
, "COMMON") == 0)
6100 /* This is a lonely common section which must have
6101 come from an archive. We attach to the section
6102 with the wildcard. */
6103 if (! link_info
.relocatable
6104 || command_line
.force_common_definition
)
6106 if (default_common_section
== NULL
)
6107 default_common_section
6108 = lang_output_section_statement_lookup (".bss", 0,
6110 lang_add_section (&default_common_section
->children
, s
,
6111 NULL
, default_common_section
);
6116 const char *name
= s
->name
;
6119 if (config
.unique_orphan_sections
6120 || unique_section_p (s
, NULL
))
6121 constraint
= SPECIAL
;
6123 if (!ldemul_place_orphan (s
, name
, constraint
))
6125 lang_output_section_statement_type
*os
;
6126 os
= lang_output_section_statement_lookup (name
,
6129 if (os
->addr_tree
== NULL
6130 && (link_info
.relocatable
6131 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6132 os
->addr_tree
= exp_intop (0);
6133 lang_add_section (&os
->children
, s
, NULL
, os
);
6142 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6144 flagword
*ptr_flags
;
6146 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6152 *ptr_flags
|= SEC_ALLOC
;
6156 *ptr_flags
|= SEC_READONLY
;
6160 *ptr_flags
|= SEC_DATA
;
6164 *ptr_flags
|= SEC_CODE
;
6169 *ptr_flags
|= SEC_LOAD
;
6173 einfo (_("%P%F: invalid syntax in flags\n"));
6180 /* Call a function on each input file. This function will be called
6181 on an archive, but not on the elements. */
6184 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6186 lang_input_statement_type
*f
;
6188 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6190 f
= (lang_input_statement_type
*) f
->next_real_file
)
6194 /* Call a function on each file. The function will be called on all
6195 the elements of an archive which are included in the link, but will
6196 not be called on the archive file itself. */
6199 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6201 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6208 ldlang_add_file (lang_input_statement_type
*entry
)
6210 lang_statement_append (&file_chain
,
6211 (lang_statement_union_type
*) entry
,
6214 /* The BFD linker needs to have a list of all input BFDs involved in
6216 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
6217 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6219 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6220 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
6221 entry
->the_bfd
->usrdata
= entry
;
6222 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6224 /* Look through the sections and check for any which should not be
6225 included in the link. We need to do this now, so that we can
6226 notice when the backend linker tries to report multiple
6227 definition errors for symbols which are in sections we aren't
6228 going to link. FIXME: It might be better to entirely ignore
6229 symbols which are defined in sections which are going to be
6230 discarded. This would require modifying the backend linker for
6231 each backend which might set the SEC_LINK_ONCE flag. If we do
6232 this, we should probably handle SEC_EXCLUDE in the same way. */
6234 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6238 lang_add_output (const char *name
, int from_script
)
6240 /* Make -o on command line override OUTPUT in script. */
6241 if (!had_output_filename
|| !from_script
)
6243 output_filename
= name
;
6244 had_output_filename
= TRUE
;
6257 for (l
= 0; l
< 32; l
++)
6259 if (i
>= (unsigned int) x
)
6267 lang_output_section_statement_type
*
6268 lang_enter_output_section_statement (const char *output_section_statement_name
,
6269 etree_type
*address_exp
,
6270 enum section_type sectype
,
6272 etree_type
*subalign
,
6275 int align_with_input
)
6277 lang_output_section_statement_type
*os
;
6279 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6281 current_section
= os
;
6283 if (os
->addr_tree
== NULL
)
6285 os
->addr_tree
= address_exp
;
6287 os
->sectype
= sectype
;
6288 if (sectype
!= noload_section
)
6289 os
->flags
= SEC_NO_FLAGS
;
6291 os
->flags
= SEC_NEVER_LOAD
;
6292 os
->block_value
= 1;
6294 /* Make next things chain into subchain of this. */
6295 push_stat_ptr (&os
->children
);
6297 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6298 if (os
->align_lma_with_input
&& align
!= NULL
)
6299 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"), NULL
);
6301 os
->subsection_alignment
=
6302 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6303 os
->section_alignment
=
6304 topower (exp_get_value_int (align
, -1, "section alignment"));
6306 os
->load_base
= ebase
;
6313 lang_output_statement_type
*new_stmt
;
6315 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6316 new_stmt
->name
= output_filename
;
6320 /* Reset the current counters in the regions. */
6323 lang_reset_memory_regions (void)
6325 lang_memory_region_type
*p
= lang_memory_region_list
;
6327 lang_output_section_statement_type
*os
;
6329 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6331 p
->current
= p
->origin
;
6335 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6339 os
->processed_vma
= FALSE
;
6340 os
->processed_lma
= FALSE
;
6343 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6345 /* Save the last size for possible use by bfd_relax_section. */
6346 o
->rawsize
= o
->size
;
6351 /* Worker for lang_gc_sections_1. */
6354 gc_section_callback (lang_wild_statement_type
*ptr
,
6355 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6357 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6358 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6359 void *data ATTRIBUTE_UNUSED
)
6361 /* If the wild pattern was marked KEEP, the member sections
6362 should be as well. */
6363 if (ptr
->keep_sections
)
6364 section
->flags
|= SEC_KEEP
;
6367 /* Iterate over sections marking them against GC. */
6370 lang_gc_sections_1 (lang_statement_union_type
*s
)
6372 for (; s
!= NULL
; s
= s
->header
.next
)
6374 switch (s
->header
.type
)
6376 case lang_wild_statement_enum
:
6377 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6379 case lang_constructors_statement_enum
:
6380 lang_gc_sections_1 (constructor_list
.head
);
6382 case lang_output_section_statement_enum
:
6383 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6385 case lang_group_statement_enum
:
6386 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6395 lang_gc_sections (void)
6397 /* Keep all sections so marked in the link script. */
6399 lang_gc_sections_1 (statement_list
.head
);
6401 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6402 the special case of debug info. (See bfd/stabs.c)
6403 Twiddle the flag here, to simplify later linker code. */
6404 if (link_info
.relocatable
)
6406 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6409 #ifdef ENABLE_PLUGINS
6410 if (f
->flags
.claimed
)
6413 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6414 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6415 sec
->flags
&= ~SEC_EXCLUDE
;
6419 if (link_info
.gc_sections
)
6420 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6423 /* Worker for lang_find_relro_sections_1. */
6426 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6427 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6429 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6430 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6433 /* Discarded, excluded and ignored sections effectively have zero
6435 if (section
->output_section
!= NULL
6436 && section
->output_section
->owner
== link_info
.output_bfd
6437 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6438 && !IGNORE_SECTION (section
)
6439 && section
->size
!= 0)
6441 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6442 *has_relro_section
= TRUE
;
6446 /* Iterate over sections for relro sections. */
6449 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6450 bfd_boolean
*has_relro_section
)
6452 if (*has_relro_section
)
6455 for (; s
!= NULL
; s
= s
->header
.next
)
6457 if (s
== expld
.dataseg
.relro_end_stat
)
6460 switch (s
->header
.type
)
6462 case lang_wild_statement_enum
:
6463 walk_wild (&s
->wild_statement
,
6464 find_relro_section_callback
,
6467 case lang_constructors_statement_enum
:
6468 lang_find_relro_sections_1 (constructor_list
.head
,
6471 case lang_output_section_statement_enum
:
6472 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6475 case lang_group_statement_enum
:
6476 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6486 lang_find_relro_sections (void)
6488 bfd_boolean has_relro_section
= FALSE
;
6490 /* Check all sections in the link script. */
6492 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6493 &has_relro_section
);
6495 if (!has_relro_section
)
6496 link_info
.relro
= FALSE
;
6499 /* Relax all sections until bfd_relax_section gives up. */
6502 lang_relax_sections (bfd_boolean need_layout
)
6504 if (RELAXATION_ENABLED
)
6506 /* We may need more than one relaxation pass. */
6507 int i
= link_info
.relax_pass
;
6509 /* The backend can use it to determine the current pass. */
6510 link_info
.relax_pass
= 0;
6514 /* Keep relaxing until bfd_relax_section gives up. */
6515 bfd_boolean relax_again
;
6517 link_info
.relax_trip
= -1;
6520 link_info
.relax_trip
++;
6522 /* Note: pe-dll.c does something like this also. If you find
6523 you need to change this code, you probably need to change
6524 pe-dll.c also. DJ */
6526 /* Do all the assignments with our current guesses as to
6528 lang_do_assignments (lang_assigning_phase_enum
);
6530 /* We must do this after lang_do_assignments, because it uses
6532 lang_reset_memory_regions ();
6534 /* Perform another relax pass - this time we know where the
6535 globals are, so can make a better guess. */
6536 relax_again
= FALSE
;
6537 lang_size_sections (&relax_again
, FALSE
);
6539 while (relax_again
);
6541 link_info
.relax_pass
++;
6548 /* Final extra sizing to report errors. */
6549 lang_do_assignments (lang_assigning_phase_enum
);
6550 lang_reset_memory_regions ();
6551 lang_size_sections (NULL
, TRUE
);
6555 #ifdef ENABLE_PLUGINS
6556 /* Find the insert point for the plugin's replacement files. We
6557 place them after the first claimed real object file, or if the
6558 first claimed object is an archive member, after the last real
6559 object file immediately preceding the archive. In the event
6560 no objects have been claimed at all, we return the first dummy
6561 object file on the list as the insert point; that works, but
6562 the callee must be careful when relinking the file_chain as it
6563 is not actually on that chain, only the statement_list and the
6564 input_file list; in that case, the replacement files must be
6565 inserted at the head of the file_chain. */
6567 static lang_input_statement_type
*
6568 find_replacements_insert_point (void)
6570 lang_input_statement_type
*claim1
, *lastobject
;
6571 lastobject
= &input_file_chain
.head
->input_statement
;
6572 for (claim1
= &file_chain
.head
->input_statement
;
6574 claim1
= &claim1
->next
->input_statement
)
6576 if (claim1
->flags
.claimed
)
6577 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6578 /* Update lastobject if this is a real object file. */
6579 if (claim1
->the_bfd
&& (claim1
->the_bfd
->my_archive
== NULL
))
6580 lastobject
= claim1
;
6582 /* No files were claimed by the plugin. Choose the last object
6583 file found on the list (maybe the first, dummy entry) as the
6588 /* Insert SRCLIST into DESTLIST after given element by chaining
6589 on FIELD as the next-pointer. (Counterintuitively does not need
6590 a pointer to the actual after-node itself, just its chain field.) */
6593 lang_list_insert_after (lang_statement_list_type
*destlist
,
6594 lang_statement_list_type
*srclist
,
6595 lang_statement_union_type
**field
)
6597 *(srclist
->tail
) = *field
;
6598 *field
= srclist
->head
;
6599 if (destlist
->tail
== field
)
6600 destlist
->tail
= srclist
->tail
;
6603 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6604 was taken as a copy of it and leave them in ORIGLIST. */
6607 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6608 lang_statement_list_type
*origlist
)
6610 union lang_statement_union
**savetail
;
6611 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6612 ASSERT (origlist
->head
== destlist
->head
);
6613 savetail
= origlist
->tail
;
6614 origlist
->head
= *(savetail
);
6615 origlist
->tail
= destlist
->tail
;
6616 destlist
->tail
= savetail
;
6619 #endif /* ENABLE_PLUGINS */
6624 /* Finalize dynamic list. */
6625 if (link_info
.dynamic_list
)
6626 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6628 current_target
= default_target
;
6630 /* Open the output file. */
6631 lang_for_each_statement (ldlang_open_output
);
6634 ldemul_create_output_section_statements ();
6636 /* Add to the hash table all undefineds on the command line. */
6637 lang_place_undefineds ();
6639 if (!bfd_section_already_linked_table_init ())
6640 einfo (_("%P%F: Failed to create hash table\n"));
6642 /* Create a bfd for each input file. */
6643 current_target
= default_target
;
6644 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6646 #ifdef ENABLE_PLUGINS
6647 if (plugin_active_plugins_p ())
6649 lang_statement_list_type added
;
6650 lang_statement_list_type files
, inputfiles
;
6652 /* Now all files are read, let the plugin(s) decide if there
6653 are any more to be added to the link before we call the
6654 emulation's after_open hook. We create a private list of
6655 input statements for this purpose, which we will eventually
6656 insert into the global statment list after the first claimed
6659 /* We need to manipulate all three chains in synchrony. */
6661 inputfiles
= input_file_chain
;
6662 if (plugin_call_all_symbols_read ())
6663 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6664 plugin_error_plugin ());
6665 /* Open any newly added files, updating the file chains. */
6666 link_info
.loading_lto_outputs
= TRUE
;
6667 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6668 /* Restore the global list pointer now they have all been added. */
6669 lang_list_remove_tail (stat_ptr
, &added
);
6670 /* And detach the fresh ends of the file lists. */
6671 lang_list_remove_tail (&file_chain
, &files
);
6672 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6673 /* Were any new files added? */
6674 if (added
.head
!= NULL
)
6676 /* If so, we will insert them into the statement list immediately
6677 after the first input file that was claimed by the plugin. */
6678 plugin_insert
= find_replacements_insert_point ();
6679 /* If a plugin adds input files without having claimed any, we
6680 don't really have a good idea where to place them. Just putting
6681 them at the start or end of the list is liable to leave them
6682 outside the crtbegin...crtend range. */
6683 ASSERT (plugin_insert
!= NULL
);
6684 /* Splice the new statement list into the old one. */
6685 lang_list_insert_after (stat_ptr
, &added
,
6686 &plugin_insert
->header
.next
);
6687 /* Likewise for the file chains. */
6688 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6689 &plugin_insert
->next_real_file
);
6690 /* We must be careful when relinking file_chain; we may need to
6691 insert the new files at the head of the list if the insert
6692 point chosen is the dummy first input file. */
6693 if (plugin_insert
->filename
)
6694 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6696 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6698 /* Rescan archives in case new undefined symbols have appeared. */
6699 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6702 #endif /* ENABLE_PLUGINS */
6704 link_info
.gc_sym_list
= &entry_symbol
;
6705 if (entry_symbol
.name
== NULL
)
6706 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6708 ldemul_after_open ();
6709 if (config
.map_file
!= NULL
)
6710 lang_print_asneeded ();
6712 bfd_section_already_linked_table_free ();
6714 /* Make sure that we're not mixing architectures. We call this
6715 after all the input files have been opened, but before we do any
6716 other processing, so that any operations merge_private_bfd_data
6717 does on the output file will be known during the rest of the
6721 /* Handle .exports instead of a version script if we're told to do so. */
6722 if (command_line
.version_exports_section
)
6723 lang_do_version_exports_section ();
6725 /* Build all sets based on the information gathered from the input
6727 ldctor_build_sets ();
6729 /* PR 13683: We must rerun the assignments prior to running garbage
6730 collection in order to make sure that all symbol aliases are resolved. */
6731 lang_do_assignments (lang_mark_phase_enum
);
6732 expld
.phase
= lang_first_phase_enum
;
6734 /* Remove unreferenced sections if asked to. */
6735 lang_gc_sections ();
6737 /* Size up the common data. */
6740 /* Update wild statements. */
6741 update_wild_statements (statement_list
.head
);
6743 /* Run through the contours of the script and attach input sections
6744 to the correct output sections. */
6745 lang_statement_iteration
++;
6746 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6748 process_insert_statements ();
6750 /* Find any sections not attached explicitly and handle them. */
6751 lang_place_orphans ();
6753 if (! link_info
.relocatable
)
6757 /* Merge SEC_MERGE sections. This has to be done after GC of
6758 sections, so that GCed sections are not merged, but before
6759 assigning dynamic symbols, since removing whole input sections
6761 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6763 /* Look for a text section and set the readonly attribute in it. */
6764 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6768 if (config
.text_read_only
)
6769 found
->flags
|= SEC_READONLY
;
6771 found
->flags
&= ~SEC_READONLY
;
6775 /* Do anything special before sizing sections. This is where ELF
6776 and other back-ends size dynamic sections. */
6777 ldemul_before_allocation ();
6779 /* We must record the program headers before we try to fix the
6780 section positions, since they will affect SIZEOF_HEADERS. */
6781 lang_record_phdrs ();
6783 /* Check relro sections. */
6784 if (link_info
.relro
&& ! link_info
.relocatable
)
6785 lang_find_relro_sections ();
6787 /* Size up the sections. */
6788 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6790 /* See if anything special should be done now we know how big
6791 everything is. This is where relaxation is done. */
6792 ldemul_after_allocation ();
6794 /* Fix any .startof. or .sizeof. symbols. */
6795 lang_set_startof ();
6797 /* Do all the assignments, now that we know the final resting places
6798 of all the symbols. */
6799 lang_do_assignments (lang_final_phase_enum
);
6803 /* Make sure that the section addresses make sense. */
6804 if (command_line
.check_section_addresses
)
6805 lang_check_section_addresses ();
6810 /* EXPORTED TO YACC */
6813 lang_add_wild (struct wildcard_spec
*filespec
,
6814 struct wildcard_list
*section_list
,
6815 bfd_boolean keep_sections
)
6817 struct wildcard_list
*curr
, *next
;
6818 lang_wild_statement_type
*new_stmt
;
6820 /* Reverse the list as the parser puts it back to front. */
6821 for (curr
= section_list
, section_list
= NULL
;
6823 section_list
= curr
, curr
= next
)
6825 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6826 placed_commons
= TRUE
;
6829 curr
->next
= section_list
;
6832 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6834 if (strcmp (filespec
->name
, "*") == 0)
6835 filespec
->name
= NULL
;
6836 else if (! wildcardp (filespec
->name
))
6837 lang_has_input_file
= TRUE
;
6840 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6841 new_stmt
->filename
= NULL
;
6842 new_stmt
->filenames_sorted
= FALSE
;
6843 new_stmt
->section_flag_list
= NULL
;
6844 if (filespec
!= NULL
)
6846 new_stmt
->filename
= filespec
->name
;
6847 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6848 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
6850 new_stmt
->section_list
= section_list
;
6851 new_stmt
->keep_sections
= keep_sections
;
6852 lang_list_init (&new_stmt
->children
);
6853 analyze_walk_wild_section_handler (new_stmt
);
6857 lang_section_start (const char *name
, etree_type
*address
,
6858 const segment_type
*segment
)
6860 lang_address_statement_type
*ad
;
6862 ad
= new_stat (lang_address_statement
, stat_ptr
);
6863 ad
->section_name
= name
;
6864 ad
->address
= address
;
6865 ad
->segment
= segment
;
6868 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6869 because of a -e argument on the command line, or zero if this is
6870 called by ENTRY in a linker script. Command line arguments take
6874 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6876 if (entry_symbol
.name
== NULL
6878 || ! entry_from_cmdline
)
6880 entry_symbol
.name
= name
;
6881 entry_from_cmdline
= cmdline
;
6885 /* Set the default start symbol to NAME. .em files should use this,
6886 not lang_add_entry, to override the use of "start" if neither the
6887 linker script nor the command line specifies an entry point. NAME
6888 must be permanently allocated. */
6890 lang_default_entry (const char *name
)
6892 entry_symbol_default
= name
;
6896 lang_add_target (const char *name
)
6898 lang_target_statement_type
*new_stmt
;
6900 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6901 new_stmt
->target
= name
;
6905 lang_add_map (const char *name
)
6912 map_option_f
= TRUE
;
6920 lang_add_fill (fill_type
*fill
)
6922 lang_fill_statement_type
*new_stmt
;
6924 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6925 new_stmt
->fill
= fill
;
6929 lang_add_data (int type
, union etree_union
*exp
)
6931 lang_data_statement_type
*new_stmt
;
6933 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6934 new_stmt
->exp
= exp
;
6935 new_stmt
->type
= type
;
6938 /* Create a new reloc statement. RELOC is the BFD relocation type to
6939 generate. HOWTO is the corresponding howto structure (we could
6940 look this up, but the caller has already done so). SECTION is the
6941 section to generate a reloc against, or NAME is the name of the
6942 symbol to generate a reloc against. Exactly one of SECTION and
6943 NAME must be NULL. ADDEND is an expression for the addend. */
6946 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6947 reloc_howto_type
*howto
,
6950 union etree_union
*addend
)
6952 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6956 p
->section
= section
;
6958 p
->addend_exp
= addend
;
6960 p
->addend_value
= 0;
6961 p
->output_section
= NULL
;
6962 p
->output_offset
= 0;
6965 lang_assignment_statement_type
*
6966 lang_add_assignment (etree_type
*exp
)
6968 lang_assignment_statement_type
*new_stmt
;
6970 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6971 new_stmt
->exp
= exp
;
6976 lang_add_attribute (enum statement_enum attribute
)
6978 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6982 lang_startup (const char *name
)
6984 if (first_file
->filename
!= NULL
)
6986 einfo (_("%P%F: multiple STARTUP files\n"));
6988 first_file
->filename
= name
;
6989 first_file
->local_sym_name
= name
;
6990 first_file
->flags
.real
= TRUE
;
6994 lang_float (bfd_boolean maybe
)
6996 lang_float_flag
= maybe
;
7000 /* Work out the load- and run-time regions from a script statement, and
7001 store them in *LMA_REGION and *REGION respectively.
7003 MEMSPEC is the name of the run-time region, or the value of
7004 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7005 LMA_MEMSPEC is the name of the load-time region, or null if the
7006 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7007 had an explicit load address.
7009 It is an error to specify both a load region and a load address. */
7012 lang_get_regions (lang_memory_region_type
**region
,
7013 lang_memory_region_type
**lma_region
,
7014 const char *memspec
,
7015 const char *lma_memspec
,
7016 bfd_boolean have_lma
,
7017 bfd_boolean have_vma
)
7019 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7021 /* If no runtime region or VMA has been specified, but the load region
7022 has been specified, then use the load region for the runtime region
7024 if (lma_memspec
!= NULL
7026 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7027 *region
= *lma_region
;
7029 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7031 if (have_lma
&& lma_memspec
!= 0)
7032 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7037 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7038 lang_output_section_phdr_list
*phdrs
,
7039 const char *lma_memspec
)
7041 lang_get_regions (¤t_section
->region
,
7042 ¤t_section
->lma_region
,
7043 memspec
, lma_memspec
,
7044 current_section
->load_base
!= NULL
,
7045 current_section
->addr_tree
!= NULL
);
7047 /* If this section has no load region or base, but uses the same
7048 region as the previous section, then propagate the previous
7049 section's load region. */
7051 if (current_section
->lma_region
== NULL
7052 && current_section
->load_base
== NULL
7053 && current_section
->addr_tree
== NULL
7054 && current_section
->region
== current_section
->prev
->region
)
7055 current_section
->lma_region
= current_section
->prev
->lma_region
;
7057 current_section
->fill
= fill
;
7058 current_section
->phdrs
= phdrs
;
7063 lang_statement_append (lang_statement_list_type
*list
,
7064 lang_statement_union_type
*element
,
7065 lang_statement_union_type
**field
)
7067 *(list
->tail
) = element
;
7071 /* Set the output format type. -oformat overrides scripts. */
7074 lang_add_output_format (const char *format
,
7079 if (output_target
== NULL
|| !from_script
)
7081 if (command_line
.endian
== ENDIAN_BIG
7084 else if (command_line
.endian
== ENDIAN_LITTLE
7088 output_target
= format
;
7093 lang_add_insert (const char *where
, int is_before
)
7095 lang_insert_statement_type
*new_stmt
;
7097 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7098 new_stmt
->where
= where
;
7099 new_stmt
->is_before
= is_before
;
7100 saved_script_handle
= previous_script_handle
;
7103 /* Enter a group. This creates a new lang_group_statement, and sets
7104 stat_ptr to build new statements within the group. */
7107 lang_enter_group (void)
7109 lang_group_statement_type
*g
;
7111 g
= new_stat (lang_group_statement
, stat_ptr
);
7112 lang_list_init (&g
->children
);
7113 push_stat_ptr (&g
->children
);
7116 /* Leave a group. This just resets stat_ptr to start writing to the
7117 regular list of statements again. Note that this will not work if
7118 groups can occur inside anything else which can adjust stat_ptr,
7119 but currently they can't. */
7122 lang_leave_group (void)
7127 /* Add a new program header. This is called for each entry in a PHDRS
7128 command in a linker script. */
7131 lang_new_phdr (const char *name
,
7133 bfd_boolean filehdr
,
7138 struct lang_phdr
*n
, **pp
;
7141 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7144 n
->type
= exp_get_value_int (type
, 0, "program header type");
7145 n
->filehdr
= filehdr
;
7150 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7152 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7155 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7157 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7158 " when prior PT_LOAD headers lack them\n"), NULL
);
7165 /* Record the program header information in the output BFD. FIXME: We
7166 should not be calling an ELF specific function here. */
7169 lang_record_phdrs (void)
7173 lang_output_section_phdr_list
*last
;
7174 struct lang_phdr
*l
;
7175 lang_output_section_statement_type
*os
;
7178 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7181 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7188 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7192 lang_output_section_phdr_list
*pl
;
7194 if (os
->constraint
< 0)
7202 if (os
->sectype
== noload_section
7203 || os
->bfd_section
== NULL
7204 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7207 /* Don't add orphans to PT_INTERP header. */
7213 lang_output_section_statement_type
* tmp_os
;
7215 /* If we have not run across a section with a program
7216 header assigned to it yet, then scan forwards to find
7217 one. This prevents inconsistencies in the linker's
7218 behaviour when a script has specified just a single
7219 header and there are sections in that script which are
7220 not assigned to it, and which occur before the first
7221 use of that header. See here for more details:
7222 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7223 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7226 last
= tmp_os
->phdrs
;
7230 einfo (_("%F%P: no sections assigned to phdrs\n"));
7235 if (os
->bfd_section
== NULL
)
7238 for (; pl
!= NULL
; pl
= pl
->next
)
7240 if (strcmp (pl
->name
, l
->name
) == 0)
7245 secs
= (asection
**) xrealloc (secs
,
7246 alc
* sizeof (asection
*));
7248 secs
[c
] = os
->bfd_section
;
7255 if (l
->flags
== NULL
)
7258 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7263 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7265 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7266 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7267 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7268 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7273 /* Make sure all the phdr assignments succeeded. */
7274 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7278 lang_output_section_phdr_list
*pl
;
7280 if (os
->constraint
< 0
7281 || os
->bfd_section
== NULL
)
7284 for (pl
= os
->phdrs
;
7287 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7288 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7289 os
->name
, pl
->name
);
7293 /* Record a list of sections which may not be cross referenced. */
7296 lang_add_nocrossref (lang_nocrossref_type
*l
)
7298 struct lang_nocrossrefs
*n
;
7300 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7301 n
->next
= nocrossref_list
;
7303 nocrossref_list
= n
;
7305 /* Set notice_all so that we get informed about all symbols. */
7306 link_info
.notice_all
= TRUE
;
7309 /* Overlay handling. We handle overlays with some static variables. */
7311 /* The overlay virtual address. */
7312 static etree_type
*overlay_vma
;
7313 /* And subsection alignment. */
7314 static etree_type
*overlay_subalign
;
7316 /* An expression for the maximum section size seen so far. */
7317 static etree_type
*overlay_max
;
7319 /* A list of all the sections in this overlay. */
7321 struct overlay_list
{
7322 struct overlay_list
*next
;
7323 lang_output_section_statement_type
*os
;
7326 static struct overlay_list
*overlay_list
;
7328 /* Start handling an overlay. */
7331 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7333 /* The grammar should prevent nested overlays from occurring. */
7334 ASSERT (overlay_vma
== NULL
7335 && overlay_subalign
== NULL
7336 && overlay_max
== NULL
);
7338 overlay_vma
= vma_expr
;
7339 overlay_subalign
= subalign
;
7342 /* Start a section in an overlay. We handle this by calling
7343 lang_enter_output_section_statement with the correct VMA.
7344 lang_leave_overlay sets up the LMA and memory regions. */
7347 lang_enter_overlay_section (const char *name
)
7349 struct overlay_list
*n
;
7352 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7353 0, overlay_subalign
, 0, 0, 0);
7355 /* If this is the first section, then base the VMA of future
7356 sections on this one. This will work correctly even if `.' is
7357 used in the addresses. */
7358 if (overlay_list
== NULL
)
7359 overlay_vma
= exp_nameop (ADDR
, name
);
7361 /* Remember the section. */
7362 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7363 n
->os
= current_section
;
7364 n
->next
= overlay_list
;
7367 size
= exp_nameop (SIZEOF
, name
);
7369 /* Arrange to work out the maximum section end address. */
7370 if (overlay_max
== NULL
)
7373 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7376 /* Finish a section in an overlay. There isn't any special to do
7380 lang_leave_overlay_section (fill_type
*fill
,
7381 lang_output_section_phdr_list
*phdrs
)
7388 name
= current_section
->name
;
7390 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7391 region and that no load-time region has been specified. It doesn't
7392 really matter what we say here, since lang_leave_overlay will
7394 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7396 /* Define the magic symbols. */
7398 clean
= (char *) xmalloc (strlen (name
) + 1);
7400 for (s1
= name
; *s1
!= '\0'; s1
++)
7401 if (ISALNUM (*s1
) || *s1
== '_')
7405 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7406 sprintf (buf
, "__load_start_%s", clean
);
7407 lang_add_assignment (exp_provide (buf
,
7408 exp_nameop (LOADADDR
, name
),
7411 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7412 sprintf (buf
, "__load_stop_%s", clean
);
7413 lang_add_assignment (exp_provide (buf
,
7415 exp_nameop (LOADADDR
, name
),
7416 exp_nameop (SIZEOF
, name
)),
7422 /* Finish an overlay. If there are any overlay wide settings, this
7423 looks through all the sections in the overlay and sets them. */
7426 lang_leave_overlay (etree_type
*lma_expr
,
7429 const char *memspec
,
7430 lang_output_section_phdr_list
*phdrs
,
7431 const char *lma_memspec
)
7433 lang_memory_region_type
*region
;
7434 lang_memory_region_type
*lma_region
;
7435 struct overlay_list
*l
;
7436 lang_nocrossref_type
*nocrossref
;
7438 lang_get_regions (®ion
, &lma_region
,
7439 memspec
, lma_memspec
,
7440 lma_expr
!= NULL
, FALSE
);
7444 /* After setting the size of the last section, set '.' to end of the
7446 if (overlay_list
!= NULL
)
7448 overlay_list
->os
->update_dot
= 1;
7449 overlay_list
->os
->update_dot_tree
7450 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
7456 struct overlay_list
*next
;
7458 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7461 l
->os
->region
= region
;
7462 l
->os
->lma_region
= lma_region
;
7464 /* The first section has the load address specified in the
7465 OVERLAY statement. The rest are worked out from that.
7466 The base address is not needed (and should be null) if
7467 an LMA region was specified. */
7470 l
->os
->load_base
= lma_expr
;
7471 l
->os
->sectype
= normal_section
;
7473 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7474 l
->os
->phdrs
= phdrs
;
7478 lang_nocrossref_type
*nc
;
7480 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7481 nc
->name
= l
->os
->name
;
7482 nc
->next
= nocrossref
;
7491 if (nocrossref
!= NULL
)
7492 lang_add_nocrossref (nocrossref
);
7495 overlay_list
= NULL
;
7499 /* Version handling. This is only useful for ELF. */
7501 /* If PREV is NULL, return first version pattern matching particular symbol.
7502 If PREV is non-NULL, return first version pattern matching particular
7503 symbol after PREV (previously returned by lang_vers_match). */
7505 static struct bfd_elf_version_expr
*
7506 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7507 struct bfd_elf_version_expr
*prev
,
7511 const char *cxx_sym
= sym
;
7512 const char *java_sym
= sym
;
7513 struct bfd_elf_version_expr
*expr
= NULL
;
7514 enum demangling_styles curr_style
;
7516 curr_style
= CURRENT_DEMANGLING_STYLE
;
7517 cplus_demangle_set_style (no_demangling
);
7518 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7521 cplus_demangle_set_style (curr_style
);
7523 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7525 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7526 DMGL_PARAMS
| DMGL_ANSI
);
7530 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7532 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7537 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7539 struct bfd_elf_version_expr e
;
7541 switch (prev
? prev
->mask
: 0)
7544 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7547 expr
= (struct bfd_elf_version_expr
*)
7548 htab_find ((htab_t
) head
->htab
, &e
);
7549 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7550 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7556 case BFD_ELF_VERSION_C_TYPE
:
7557 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7559 e
.pattern
= cxx_sym
;
7560 expr
= (struct bfd_elf_version_expr
*)
7561 htab_find ((htab_t
) head
->htab
, &e
);
7562 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7563 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7569 case BFD_ELF_VERSION_CXX_TYPE
:
7570 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7572 e
.pattern
= java_sym
;
7573 expr
= (struct bfd_elf_version_expr
*)
7574 htab_find ((htab_t
) head
->htab
, &e
);
7575 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7576 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7587 /* Finally, try the wildcards. */
7588 if (prev
== NULL
|| prev
->literal
)
7589 expr
= head
->remaining
;
7592 for (; expr
; expr
= expr
->next
)
7599 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7602 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7604 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7608 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7614 free ((char *) c_sym
);
7616 free ((char *) cxx_sym
);
7617 if (java_sym
!= sym
)
7618 free ((char *) java_sym
);
7622 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7623 return a pointer to the symbol name with any backslash quotes removed. */
7626 realsymbol (const char *pattern
)
7629 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7630 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7632 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7634 /* It is a glob pattern only if there is no preceding
7638 /* Remove the preceding backslash. */
7645 if (*p
== '?' || *p
== '*' || *p
== '[')
7652 backslash
= *p
== '\\';
7668 /* This is called for each variable name or match expression. NEW_NAME is
7669 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7670 pattern to be matched against symbol names. */
7672 struct bfd_elf_version_expr
*
7673 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7674 const char *new_name
,
7676 bfd_boolean literal_p
)
7678 struct bfd_elf_version_expr
*ret
;
7680 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7684 ret
->literal
= TRUE
;
7685 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7686 if (ret
->pattern
== NULL
)
7688 ret
->pattern
= new_name
;
7689 ret
->literal
= FALSE
;
7692 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7693 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7694 else if (strcasecmp (lang
, "C++") == 0)
7695 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7696 else if (strcasecmp (lang
, "Java") == 0)
7697 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7700 einfo (_("%X%P: unknown language `%s' in version information\n"),
7702 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7705 return ldemul_new_vers_pattern (ret
);
7708 /* This is called for each set of variable names and match
7711 struct bfd_elf_version_tree
*
7712 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7713 struct bfd_elf_version_expr
*locals
)
7715 struct bfd_elf_version_tree
*ret
;
7717 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7718 ret
->globals
.list
= globals
;
7719 ret
->locals
.list
= locals
;
7720 ret
->match
= lang_vers_match
;
7721 ret
->name_indx
= (unsigned int) -1;
7725 /* This static variable keeps track of version indices. */
7727 static int version_index
;
7730 version_expr_head_hash (const void *p
)
7732 const struct bfd_elf_version_expr
*e
=
7733 (const struct bfd_elf_version_expr
*) p
;
7735 return htab_hash_string (e
->pattern
);
7739 version_expr_head_eq (const void *p1
, const void *p2
)
7741 const struct bfd_elf_version_expr
*e1
=
7742 (const struct bfd_elf_version_expr
*) p1
;
7743 const struct bfd_elf_version_expr
*e2
=
7744 (const struct bfd_elf_version_expr
*) p2
;
7746 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7750 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7753 struct bfd_elf_version_expr
*e
, *next
;
7754 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7756 for (e
= head
->list
; e
; e
= e
->next
)
7760 head
->mask
|= e
->mask
;
7765 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7766 version_expr_head_eq
, NULL
);
7767 list_loc
= &head
->list
;
7768 remaining_loc
= &head
->remaining
;
7769 for (e
= head
->list
; e
; e
= next
)
7775 remaining_loc
= &e
->next
;
7779 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7783 struct bfd_elf_version_expr
*e1
, *last
;
7785 e1
= (struct bfd_elf_version_expr
*) *loc
;
7789 if (e1
->mask
== e
->mask
)
7797 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7801 /* This is a duplicate. */
7802 /* FIXME: Memory leak. Sometimes pattern is not
7803 xmalloced alone, but in larger chunk of memory. */
7804 /* free (e->pattern); */
7809 e
->next
= last
->next
;
7817 list_loc
= &e
->next
;
7821 *remaining_loc
= NULL
;
7822 *list_loc
= head
->remaining
;
7825 head
->remaining
= head
->list
;
7828 /* This is called when we know the name and dependencies of the
7832 lang_register_vers_node (const char *name
,
7833 struct bfd_elf_version_tree
*version
,
7834 struct bfd_elf_version_deps
*deps
)
7836 struct bfd_elf_version_tree
*t
, **pp
;
7837 struct bfd_elf_version_expr
*e1
;
7842 if (link_info
.version_info
!= NULL
7843 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
7845 einfo (_("%X%P: anonymous version tag cannot be combined"
7846 " with other version tags\n"));
7851 /* Make sure this node has a unique name. */
7852 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7853 if (strcmp (t
->name
, name
) == 0)
7854 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7856 lang_finalize_version_expr_head (&version
->globals
);
7857 lang_finalize_version_expr_head (&version
->locals
);
7859 /* Check the global and local match names, and make sure there
7860 aren't any duplicates. */
7862 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7864 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7866 struct bfd_elf_version_expr
*e2
;
7868 if (t
->locals
.htab
&& e1
->literal
)
7870 e2
= (struct bfd_elf_version_expr
*)
7871 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7872 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7874 if (e1
->mask
== e2
->mask
)
7875 einfo (_("%X%P: duplicate expression `%s'"
7876 " in version information\n"), e1
->pattern
);
7880 else if (!e1
->literal
)
7881 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7882 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7883 && e1
->mask
== e2
->mask
)
7884 einfo (_("%X%P: duplicate expression `%s'"
7885 " in version information\n"), e1
->pattern
);
7889 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7891 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7893 struct bfd_elf_version_expr
*e2
;
7895 if (t
->globals
.htab
&& e1
->literal
)
7897 e2
= (struct bfd_elf_version_expr
*)
7898 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7899 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7901 if (e1
->mask
== e2
->mask
)
7902 einfo (_("%X%P: duplicate expression `%s'"
7903 " in version information\n"),
7908 else if (!e1
->literal
)
7909 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7910 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7911 && e1
->mask
== e2
->mask
)
7912 einfo (_("%X%P: duplicate expression `%s'"
7913 " in version information\n"), e1
->pattern
);
7917 version
->deps
= deps
;
7918 version
->name
= name
;
7919 if (name
[0] != '\0')
7922 version
->vernum
= version_index
;
7925 version
->vernum
= 0;
7927 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7932 /* This is called when we see a version dependency. */
7934 struct bfd_elf_version_deps
*
7935 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7937 struct bfd_elf_version_deps
*ret
;
7938 struct bfd_elf_version_tree
*t
;
7940 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7943 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7945 if (strcmp (t
->name
, name
) == 0)
7947 ret
->version_needed
= t
;
7952 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7954 ret
->version_needed
= NULL
;
7959 lang_do_version_exports_section (void)
7961 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7963 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7965 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7973 contents
= (char *) xmalloc (len
);
7974 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7975 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7978 while (p
< contents
+ len
)
7980 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7981 p
= strchr (p
, '\0') + 1;
7984 /* Do not free the contents, as we used them creating the regex. */
7986 /* Do not include this section in the link. */
7987 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7990 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7991 lang_register_vers_node (command_line
.version_exports_section
,
7992 lang_new_vers_node (greg
, lreg
), NULL
);
7996 lang_add_unique (const char *name
)
7998 struct unique_sections
*ent
;
8000 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8001 if (strcmp (ent
->name
, name
) == 0)
8004 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8005 ent
->name
= xstrdup (name
);
8006 ent
->next
= unique_section_list
;
8007 unique_section_list
= ent
;
8010 /* Append the list of dynamic symbols to the existing one. */
8013 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8015 if (link_info
.dynamic_list
)
8017 struct bfd_elf_version_expr
*tail
;
8018 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8020 tail
->next
= link_info
.dynamic_list
->head
.list
;
8021 link_info
.dynamic_list
->head
.list
= dynamic
;
8025 struct bfd_elf_dynamic_list
*d
;
8027 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8028 d
->head
.list
= dynamic
;
8029 d
->match
= lang_vers_match
;
8030 link_info
.dynamic_list
= d
;
8034 /* Append the list of C++ typeinfo dynamic symbols to the existing
8038 lang_append_dynamic_list_cpp_typeinfo (void)
8040 const char * symbols
[] =
8042 "typeinfo name for*",
8045 struct bfd_elf_version_expr
*dynamic
= NULL
;
8048 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8049 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8052 lang_append_dynamic_list (dynamic
);
8055 /* Append the list of C++ operator new and delete dynamic symbols to the
8059 lang_append_dynamic_list_cpp_new (void)
8061 const char * symbols
[] =
8066 struct bfd_elf_version_expr
*dynamic
= NULL
;
8069 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8070 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8073 lang_append_dynamic_list (dynamic
);
8076 /* Scan a space and/or comma separated string of features. */
8079 lang_ld_feature (char *str
)
8087 while (*p
== ',' || ISSPACE (*p
))
8092 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8096 if (strcasecmp (p
, "SANE_EXPR") == 0)
8097 config
.sane_expr
= TRUE
;
8099 einfo (_("%X%P: unknown feature `%s'\n"), p
);