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 ();
2126 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2127 void *info ATTRIBUTE_UNUSED
)
2129 if ((hash_entry
->type
== bfd_link_hash_defined
2130 || hash_entry
->type
== bfd_link_hash_defweak
)
2131 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2132 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2134 input_section_userdata_type
*ud
;
2135 struct map_symbol_def
*def
;
2137 ud
= ((input_section_userdata_type
*)
2138 get_userdata (hash_entry
->u
.def
.section
));
2141 ud
= (input_section_userdata_type
*) stat_alloc (sizeof (*ud
));
2142 get_userdata (hash_entry
->u
.def
.section
) = ud
;
2143 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2144 ud
->map_symbol_def_count
= 0;
2146 else if (!ud
->map_symbol_def_tail
)
2147 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2149 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2150 def
->entry
= hash_entry
;
2151 *(ud
->map_symbol_def_tail
) = def
;
2152 ud
->map_symbol_def_tail
= &def
->next
;
2153 ud
->map_symbol_def_count
++;
2158 /* Initialize an output section. */
2161 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2163 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2164 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2166 if (s
->constraint
!= SPECIAL
)
2167 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2168 if (s
->bfd_section
== NULL
)
2169 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2171 if (s
->bfd_section
== NULL
)
2173 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2174 link_info
.output_bfd
->xvec
->name
, s
->name
);
2176 s
->bfd_section
->output_section
= s
->bfd_section
;
2177 s
->bfd_section
->output_offset
= 0;
2179 /* Set the userdata of the output section to the output section
2180 statement to avoid lookup. */
2181 get_userdata (s
->bfd_section
) = s
;
2183 /* If there is a base address, make sure that any sections it might
2184 mention are initialized. */
2185 if (s
->addr_tree
!= NULL
)
2186 exp_init_os (s
->addr_tree
);
2188 if (s
->load_base
!= NULL
)
2189 exp_init_os (s
->load_base
);
2191 /* If supplied an alignment, set it. */
2192 if (s
->section_alignment
!= -1)
2193 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2196 /* Make sure that all output sections mentioned in an expression are
2200 exp_init_os (etree_type
*exp
)
2202 switch (exp
->type
.node_class
)
2206 exp_init_os (exp
->assign
.src
);
2210 exp_init_os (exp
->binary
.lhs
);
2211 exp_init_os (exp
->binary
.rhs
);
2215 exp_init_os (exp
->trinary
.cond
);
2216 exp_init_os (exp
->trinary
.lhs
);
2217 exp_init_os (exp
->trinary
.rhs
);
2221 exp_init_os (exp
->assert_s
.child
);
2225 exp_init_os (exp
->unary
.child
);
2229 switch (exp
->type
.node_code
)
2235 lang_output_section_statement_type
*os
;
2237 os
= lang_output_section_find (exp
->name
.name
);
2238 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2250 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2252 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2254 /* If we are only reading symbols from this object, then we want to
2255 discard all sections. */
2256 if (entry
->flags
.just_syms
)
2258 bfd_link_just_syms (abfd
, sec
, &link_info
);
2262 if (!(abfd
->flags
& DYNAMIC
))
2263 bfd_section_already_linked (abfd
, sec
, &link_info
);
2266 /* The wild routines.
2268 These expand statements like *(.text) and foo.o to a list of
2269 explicit actions, like foo.o(.text), bar.o(.text) and
2270 foo.o(.text, .data). */
2272 /* Add SECTION to the output section OUTPUT. Do this by creating a
2273 lang_input_section statement which is placed at PTR. */
2276 lang_add_section (lang_statement_list_type
*ptr
,
2278 struct flag_info
*sflag_info
,
2279 lang_output_section_statement_type
*output
)
2281 flagword flags
= section
->flags
;
2283 bfd_boolean discard
;
2284 lang_input_section_type
*new_section
;
2285 bfd
*abfd
= link_info
.output_bfd
;
2287 /* Discard sections marked with SEC_EXCLUDE. */
2288 discard
= (flags
& SEC_EXCLUDE
) != 0;
2290 /* Discard input sections which are assigned to a section named
2291 DISCARD_SECTION_NAME. */
2292 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2295 /* Discard debugging sections if we are stripping debugging
2297 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2298 && (flags
& SEC_DEBUGGING
) != 0)
2303 if (section
->output_section
== NULL
)
2305 /* This prevents future calls from assigning this section. */
2306 section
->output_section
= bfd_abs_section_ptr
;
2315 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2320 if (section
->output_section
!= NULL
)
2323 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2324 to an output section, because we want to be able to include a
2325 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2326 section (I don't know why we want to do this, but we do).
2327 build_link_order in ldwrite.c handles this case by turning
2328 the embedded SEC_NEVER_LOAD section into a fill. */
2329 flags
&= ~ SEC_NEVER_LOAD
;
2331 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2332 already been processed. One reason to do this is that on pe
2333 format targets, .text$foo sections go into .text and it's odd
2334 to see .text with SEC_LINK_ONCE set. */
2336 if (!link_info
.relocatable
)
2337 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2339 switch (output
->sectype
)
2341 case normal_section
:
2342 case overlay_section
:
2344 case noalloc_section
:
2345 flags
&= ~SEC_ALLOC
;
2347 case noload_section
:
2349 flags
|= SEC_NEVER_LOAD
;
2350 /* Unfortunately GNU ld has managed to evolve two different
2351 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2352 alloc, no contents section. All others get a noload, noalloc
2354 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2355 flags
&= ~SEC_HAS_CONTENTS
;
2357 flags
&= ~SEC_ALLOC
;
2361 if (output
->bfd_section
== NULL
)
2362 init_os (output
, flags
);
2364 /* If SEC_READONLY is not set in the input section, then clear
2365 it from the output section. */
2366 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2368 if (output
->bfd_section
->linker_has_input
)
2370 /* Only set SEC_READONLY flag on the first input section. */
2371 flags
&= ~ SEC_READONLY
;
2373 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2374 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2375 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2376 || ((flags
& SEC_MERGE
) != 0
2377 && output
->bfd_section
->entsize
!= section
->entsize
))
2379 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2380 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2383 output
->bfd_section
->flags
|= flags
;
2385 if (!output
->bfd_section
->linker_has_input
)
2387 output
->bfd_section
->linker_has_input
= 1;
2388 /* This must happen after flags have been updated. The output
2389 section may have been created before we saw its first input
2390 section, eg. for a data statement. */
2391 bfd_init_private_section_data (section
->owner
, section
,
2392 link_info
.output_bfd
,
2393 output
->bfd_section
,
2395 if ((flags
& SEC_MERGE
) != 0)
2396 output
->bfd_section
->entsize
= section
->entsize
;
2399 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2400 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2402 /* FIXME: This value should really be obtained from the bfd... */
2403 output
->block_value
= 128;
2406 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2407 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2409 section
->output_section
= output
->bfd_section
;
2411 if (!link_info
.relocatable
2412 && !stripped_excluded_sections
)
2414 asection
*s
= output
->bfd_section
->map_tail
.s
;
2415 output
->bfd_section
->map_tail
.s
= section
;
2416 section
->map_head
.s
= NULL
;
2417 section
->map_tail
.s
= s
;
2419 s
->map_head
.s
= section
;
2421 output
->bfd_section
->map_head
.s
= section
;
2424 /* Add a section reference to the list. */
2425 new_section
= new_stat (lang_input_section
, ptr
);
2426 new_section
->section
= section
;
2429 /* Handle wildcard sorting. This returns the lang_input_section which
2430 should follow the one we are going to create for SECTION and FILE,
2431 based on the sorting requirements of WILD. It returns NULL if the
2432 new section should just go at the end of the current list. */
2434 static lang_statement_union_type
*
2435 wild_sort (lang_wild_statement_type
*wild
,
2436 struct wildcard_list
*sec
,
2437 lang_input_statement_type
*file
,
2440 lang_statement_union_type
*l
;
2442 if (!wild
->filenames_sorted
2443 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2446 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2448 lang_input_section_type
*ls
;
2450 if (l
->header
.type
!= lang_input_section_enum
)
2452 ls
= &l
->input_section
;
2454 /* Sorting by filename takes precedence over sorting by section
2457 if (wild
->filenames_sorted
)
2459 const char *fn
, *ln
;
2463 /* The PE support for the .idata section as generated by
2464 dlltool assumes that files will be sorted by the name of
2465 the archive and then the name of the file within the
2468 if (file
->the_bfd
!= NULL
2469 && bfd_my_archive (file
->the_bfd
) != NULL
)
2471 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2476 fn
= file
->filename
;
2480 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2482 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2487 ln
= ls
->section
->owner
->filename
;
2491 i
= filename_cmp (fn
, ln
);
2500 fn
= file
->filename
;
2502 ln
= ls
->section
->owner
->filename
;
2504 i
= filename_cmp (fn
, ln
);
2512 /* Here either the files are not sorted by name, or we are
2513 looking at the sections for this file. */
2516 && sec
->spec
.sorted
!= none
2517 && sec
->spec
.sorted
!= by_none
)
2518 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2525 /* Expand a wild statement for a particular FILE. SECTION may be
2526 NULL, in which case it is a wild card. */
2529 output_section_callback (lang_wild_statement_type
*ptr
,
2530 struct wildcard_list
*sec
,
2532 struct flag_info
*sflag_info
,
2533 lang_input_statement_type
*file
,
2536 lang_statement_union_type
*before
;
2537 lang_output_section_statement_type
*os
;
2539 os
= (lang_output_section_statement_type
*) output
;
2541 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2542 if (unique_section_p (section
, os
))
2545 before
= wild_sort (ptr
, sec
, file
, section
);
2547 /* Here BEFORE points to the lang_input_section which
2548 should follow the one we are about to add. If BEFORE
2549 is NULL, then the section should just go at the end
2550 of the current list. */
2553 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2556 lang_statement_list_type list
;
2557 lang_statement_union_type
**pp
;
2559 lang_list_init (&list
);
2560 lang_add_section (&list
, section
, sflag_info
, os
);
2562 /* If we are discarding the section, LIST.HEAD will
2564 if (list
.head
!= NULL
)
2566 ASSERT (list
.head
->header
.next
== NULL
);
2568 for (pp
= &ptr
->children
.head
;
2570 pp
= &(*pp
)->header
.next
)
2571 ASSERT (*pp
!= NULL
);
2573 list
.head
->header
.next
= *pp
;
2579 /* Check if all sections in a wild statement for a particular FILE
2583 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2584 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2586 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2587 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2590 lang_output_section_statement_type
*os
;
2592 os
= (lang_output_section_statement_type
*) output
;
2594 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2595 if (unique_section_p (section
, os
))
2598 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2599 os
->all_input_readonly
= FALSE
;
2602 /* This is passed a file name which must have been seen already and
2603 added to the statement tree. We will see if it has been opened
2604 already and had its symbols read. If not then we'll read it. */
2606 static lang_input_statement_type
*
2607 lookup_name (const char *name
)
2609 lang_input_statement_type
*search
;
2611 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2613 search
= (lang_input_statement_type
*) search
->next_real_file
)
2615 /* Use the local_sym_name as the name of the file that has
2616 already been loaded as filename might have been transformed
2617 via the search directory lookup mechanism. */
2618 const char *filename
= search
->local_sym_name
;
2620 if (filename
!= NULL
2621 && filename_cmp (filename
, name
) == 0)
2626 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2627 default_target
, FALSE
);
2629 /* If we have already added this file, or this file is not real
2630 don't add this file. */
2631 if (search
->flags
.loaded
|| !search
->flags
.real
)
2634 if (! load_symbols (search
, NULL
))
2640 /* Save LIST as a list of libraries whose symbols should not be exported. */
2645 struct excluded_lib
*next
;
2647 static struct excluded_lib
*excluded_libs
;
2650 add_excluded_libs (const char *list
)
2652 const char *p
= list
, *end
;
2656 struct excluded_lib
*entry
;
2657 end
= strpbrk (p
, ",:");
2659 end
= p
+ strlen (p
);
2660 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2661 entry
->next
= excluded_libs
;
2662 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2663 memcpy (entry
->name
, p
, end
- p
);
2664 entry
->name
[end
- p
] = '\0';
2665 excluded_libs
= entry
;
2673 check_excluded_libs (bfd
*abfd
)
2675 struct excluded_lib
*lib
= excluded_libs
;
2679 int len
= strlen (lib
->name
);
2680 const char *filename
= lbasename (abfd
->filename
);
2682 if (strcmp (lib
->name
, "ALL") == 0)
2684 abfd
->no_export
= TRUE
;
2688 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2689 && (filename
[len
] == '\0'
2690 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2691 && filename
[len
+ 2] == '\0')))
2693 abfd
->no_export
= TRUE
;
2701 /* Get the symbols for an input file. */
2704 load_symbols (lang_input_statement_type
*entry
,
2705 lang_statement_list_type
*place
)
2709 if (entry
->flags
.loaded
)
2712 ldfile_open_file (entry
);
2714 /* Do not process further if the file was missing. */
2715 if (entry
->flags
.missing_file
)
2718 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2719 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2722 struct lang_input_statement_flags save_flags
;
2725 err
= bfd_get_error ();
2727 /* See if the emulation has some special knowledge. */
2728 if (ldemul_unrecognized_file (entry
))
2731 if (err
== bfd_error_file_ambiguously_recognized
)
2735 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2736 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2737 for (p
= matching
; *p
!= NULL
; p
++)
2741 else if (err
!= bfd_error_file_not_recognized
2743 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2745 bfd_close (entry
->the_bfd
);
2746 entry
->the_bfd
= NULL
;
2748 /* Try to interpret the file as a linker script. */
2749 save_flags
= input_flags
;
2750 ldfile_open_command_file (entry
->filename
);
2752 push_stat_ptr (place
);
2753 input_flags
.add_DT_NEEDED_for_regular
2754 = entry
->flags
.add_DT_NEEDED_for_regular
;
2755 input_flags
.add_DT_NEEDED_for_dynamic
2756 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2757 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2758 input_flags
.dynamic
= entry
->flags
.dynamic
;
2760 ldfile_assumed_script
= TRUE
;
2761 parser_input
= input_script
;
2763 ldfile_assumed_script
= FALSE
;
2765 /* missing_file is sticky. sysrooted will already have been
2766 restored when seeing EOF in yyparse, but no harm to restore
2768 save_flags
.missing_file
|= input_flags
.missing_file
;
2769 input_flags
= save_flags
;
2773 entry
->flags
.loaded
= TRUE
;
2778 if (ldemul_recognized_file (entry
))
2781 /* We don't call ldlang_add_file for an archive. Instead, the
2782 add_symbols entry point will call ldlang_add_file, via the
2783 add_archive_element callback, for each element of the archive
2785 switch (bfd_get_format (entry
->the_bfd
))
2791 #ifdef ENABLE_PLUGINS
2792 if (!entry
->flags
.reload
)
2794 ldlang_add_file (entry
);
2795 if (trace_files
|| verbose
)
2796 info_msg ("%I\n", entry
);
2800 check_excluded_libs (entry
->the_bfd
);
2802 if (entry
->flags
.whole_archive
)
2805 bfd_boolean loaded
= TRUE
;
2810 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2815 if (! bfd_check_format (member
, bfd_object
))
2817 einfo (_("%F%B: member %B in archive is not an object\n"),
2818 entry
->the_bfd
, member
);
2823 if (!(*link_info
.callbacks
2824 ->add_archive_element
) (&link_info
, member
,
2825 "--whole-archive", &subsbfd
))
2828 /* Potentially, the add_archive_element hook may have set a
2829 substitute BFD for us. */
2830 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2832 einfo (_("%F%B: error adding symbols: %E\n"), member
);
2837 entry
->flags
.loaded
= loaded
;
2843 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2844 entry
->flags
.loaded
= TRUE
;
2846 einfo (_("%F%B: error adding symbols: %E\n"), entry
->the_bfd
);
2848 return entry
->flags
.loaded
;
2851 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2852 may be NULL, indicating that it is a wildcard. Separate
2853 lang_input_section statements are created for each part of the
2854 expansion; they are added after the wild statement S. OUTPUT is
2855 the output section. */
2858 wild (lang_wild_statement_type
*s
,
2859 const char *target ATTRIBUTE_UNUSED
,
2860 lang_output_section_statement_type
*output
)
2862 struct wildcard_list
*sec
;
2864 if (s
->handler_data
[0]
2865 && s
->handler_data
[0]->spec
.sorted
== by_name
2866 && !s
->filenames_sorted
)
2868 lang_section_bst_type
*tree
;
2870 walk_wild (s
, output_section_callback_fast
, output
);
2875 output_section_callback_tree_to_list (s
, tree
, output
);
2880 walk_wild (s
, output_section_callback
, output
);
2882 if (default_common_section
== NULL
)
2883 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2884 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2886 /* Remember the section that common is going to in case we
2887 later get something which doesn't know where to put it. */
2888 default_common_section
= output
;
2893 /* Return TRUE iff target is the sought target. */
2896 get_target (const bfd_target
*target
, void *data
)
2898 const char *sought
= (const char *) data
;
2900 return strcmp (target
->name
, sought
) == 0;
2903 /* Like strcpy() but convert to lower case as well. */
2906 stricpy (char *dest
, char *src
)
2910 while ((c
= *src
++) != 0)
2911 *dest
++ = TOLOWER (c
);
2916 /* Remove the first occurrence of needle (if any) in haystack
2920 strcut (char *haystack
, char *needle
)
2922 haystack
= strstr (haystack
, needle
);
2928 for (src
= haystack
+ strlen (needle
); *src
;)
2929 *haystack
++ = *src
++;
2935 /* Compare two target format name strings.
2936 Return a value indicating how "similar" they are. */
2939 name_compare (char *first
, char *second
)
2945 copy1
= (char *) xmalloc (strlen (first
) + 1);
2946 copy2
= (char *) xmalloc (strlen (second
) + 1);
2948 /* Convert the names to lower case. */
2949 stricpy (copy1
, first
);
2950 stricpy (copy2
, second
);
2952 /* Remove size and endian strings from the name. */
2953 strcut (copy1
, "big");
2954 strcut (copy1
, "little");
2955 strcut (copy2
, "big");
2956 strcut (copy2
, "little");
2958 /* Return a value based on how many characters match,
2959 starting from the beginning. If both strings are
2960 the same then return 10 * their length. */
2961 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2962 if (copy1
[result
] == 0)
2974 /* Set by closest_target_match() below. */
2975 static const bfd_target
*winner
;
2977 /* Scan all the valid bfd targets looking for one that has the endianness
2978 requirement that was specified on the command line, and is the nearest
2979 match to the original output target. */
2982 closest_target_match (const bfd_target
*target
, void *data
)
2984 const bfd_target
*original
= (const bfd_target
*) data
;
2986 if (command_line
.endian
== ENDIAN_BIG
2987 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2990 if (command_line
.endian
== ENDIAN_LITTLE
2991 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2994 /* Must be the same flavour. */
2995 if (target
->flavour
!= original
->flavour
)
2998 /* Ignore generic big and little endian elf vectors. */
2999 if (strcmp (target
->name
, "elf32-big") == 0
3000 || strcmp (target
->name
, "elf64-big") == 0
3001 || strcmp (target
->name
, "elf32-little") == 0
3002 || strcmp (target
->name
, "elf64-little") == 0)
3005 /* If we have not found a potential winner yet, then record this one. */
3012 /* Oh dear, we now have two potential candidates for a successful match.
3013 Compare their names and choose the better one. */
3014 if (name_compare (target
->name
, original
->name
)
3015 > name_compare (winner
->name
, original
->name
))
3018 /* Keep on searching until wqe have checked them all. */
3022 /* Return the BFD target format of the first input file. */
3025 get_first_input_target (void)
3027 char *target
= NULL
;
3029 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3031 if (s
->header
.type
== lang_input_statement_enum
3034 ldfile_open_file (s
);
3036 if (s
->the_bfd
!= NULL
3037 && bfd_check_format (s
->the_bfd
, bfd_object
))
3039 target
= bfd_get_target (s
->the_bfd
);
3051 lang_get_output_target (void)
3055 /* Has the user told us which output format to use? */
3056 if (output_target
!= NULL
)
3057 return output_target
;
3059 /* No - has the current target been set to something other than
3061 if (current_target
!= default_target
&& current_target
!= NULL
)
3062 return current_target
;
3064 /* No - can we determine the format of the first input file? */
3065 target
= get_first_input_target ();
3069 /* Failed - use the default output target. */
3070 return default_target
;
3073 /* Stashed function to free link_info.hash; see open_output. */
3074 void (*output_bfd_hash_table_free_fn
) (struct bfd_link_hash_table
*);
3076 /* Open the output file. */
3079 open_output (const char *name
)
3081 output_target
= lang_get_output_target ();
3083 /* Has the user requested a particular endianness on the command
3085 if (command_line
.endian
!= ENDIAN_UNSET
)
3087 const bfd_target
*target
;
3088 enum bfd_endian desired_endian
;
3090 /* Get the chosen target. */
3091 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3093 /* If the target is not supported, we cannot do anything. */
3096 if (command_line
.endian
== ENDIAN_BIG
)
3097 desired_endian
= BFD_ENDIAN_BIG
;
3099 desired_endian
= BFD_ENDIAN_LITTLE
;
3101 /* See if the target has the wrong endianness. This should
3102 not happen if the linker script has provided big and
3103 little endian alternatives, but some scrips don't do
3105 if (target
->byteorder
!= desired_endian
)
3107 /* If it does, then see if the target provides
3108 an alternative with the correct endianness. */
3109 if (target
->alternative_target
!= NULL
3110 && (target
->alternative_target
->byteorder
== desired_endian
))
3111 output_target
= target
->alternative_target
->name
;
3114 /* Try to find a target as similar as possible to
3115 the default target, but which has the desired
3116 endian characteristic. */
3117 bfd_search_for_target (closest_target_match
,
3120 /* Oh dear - we could not find any targets that
3121 satisfy our requirements. */
3123 einfo (_("%P: warning: could not find any targets"
3124 " that match endianness requirement\n"));
3126 output_target
= winner
->name
;
3132 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3134 if (link_info
.output_bfd
== NULL
)
3136 if (bfd_get_error () == bfd_error_invalid_target
)
3137 einfo (_("%P%F: target %s not found\n"), output_target
);
3139 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3142 delete_output_file_on_failure
= TRUE
;
3144 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3145 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3146 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3147 ldfile_output_architecture
,
3148 ldfile_output_machine
))
3149 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3151 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3152 if (link_info
.hash
== NULL
)
3153 einfo (_("%P%F: can not create hash table: %E\n"));
3155 /* We want to please memory leak checkers by deleting link_info.hash.
3156 We can't do it in lang_finish, as a bfd target may hold references to
3157 symbols in this table and use them when their _bfd_write_contents
3158 function is invoked, as part of bfd_close on the output_bfd. But,
3159 output_bfd is deallocated at bfd_close, so we can't refer to
3160 output_bfd after that time, and dereferencing it is needed to call
3161 "bfd_link_hash_table_free". Smash this dependency deadlock and grab
3162 the function pointer; arrange to call it on link_info.hash in
3164 output_bfd_hash_table_free_fn
3165 = link_info
.output_bfd
->xvec
->_bfd_link_hash_table_free
;
3167 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3171 ldlang_open_output (lang_statement_union_type
*statement
)
3173 switch (statement
->header
.type
)
3175 case lang_output_statement_enum
:
3176 ASSERT (link_info
.output_bfd
== NULL
);
3177 open_output (statement
->output_statement
.name
);
3178 ldemul_set_output_arch ();
3179 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3180 link_info
.output_bfd
->flags
|= D_PAGED
;
3182 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3183 if (config
.text_read_only
)
3184 link_info
.output_bfd
->flags
|= WP_TEXT
;
3186 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3187 if (link_info
.traditional_format
)
3188 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3190 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3193 case lang_target_statement_enum
:
3194 current_target
= statement
->target_statement
.target
;
3201 /* Convert between addresses in bytes and sizes in octets.
3202 For currently supported targets, octets_per_byte is always a power
3203 of two, so we can use shifts. */
3204 #define TO_ADDR(X) ((X) >> opb_shift)
3205 #define TO_SIZE(X) ((X) << opb_shift)
3207 /* Support the above. */
3208 static unsigned int opb_shift
= 0;
3213 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3214 ldfile_output_machine
);
3217 while ((x
& 1) == 0)
3225 /* Open all the input files. */
3229 OPEN_BFD_NORMAL
= 0,
3233 #ifdef ENABLE_PLUGINS
3234 static lang_input_statement_type
*plugin_insert
= NULL
;
3238 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3240 for (; s
!= NULL
; s
= s
->header
.next
)
3242 switch (s
->header
.type
)
3244 case lang_constructors_statement_enum
:
3245 open_input_bfds (constructor_list
.head
, mode
);
3247 case lang_output_section_statement_enum
:
3248 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3250 case lang_wild_statement_enum
:
3251 /* Maybe we should load the file's symbols. */
3252 if ((mode
& OPEN_BFD_RESCAN
) == 0
3253 && s
->wild_statement
.filename
3254 && !wildcardp (s
->wild_statement
.filename
)
3255 && !archive_path (s
->wild_statement
.filename
))
3256 lookup_name (s
->wild_statement
.filename
);
3257 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3259 case lang_group_statement_enum
:
3261 struct bfd_link_hash_entry
*undefs
;
3263 /* We must continually search the entries in the group
3264 until no new symbols are added to the list of undefined
3269 undefs
= link_info
.hash
->undefs_tail
;
3270 open_input_bfds (s
->group_statement
.children
.head
,
3271 mode
| OPEN_BFD_FORCE
);
3273 while (undefs
!= link_info
.hash
->undefs_tail
);
3276 case lang_target_statement_enum
:
3277 current_target
= s
->target_statement
.target
;
3279 case lang_input_statement_enum
:
3280 if (s
->input_statement
.flags
.real
)
3282 lang_statement_union_type
**os_tail
;
3283 lang_statement_list_type add
;
3285 s
->input_statement
.target
= current_target
;
3287 /* If we are being called from within a group, and this
3288 is an archive which has already been searched, then
3289 force it to be researched unless the whole archive
3290 has been loaded already. Do the same for a rescan. */
3291 if (mode
!= OPEN_BFD_NORMAL
3292 #ifdef ENABLE_PLUGINS
3293 && ((mode
& OPEN_BFD_RESCAN
) == 0
3294 || plugin_insert
== NULL
)
3296 && !s
->input_statement
.flags
.whole_archive
3297 && s
->input_statement
.flags
.loaded
3298 && s
->input_statement
.the_bfd
!= NULL
3299 && bfd_check_format (s
->input_statement
.the_bfd
,
3301 s
->input_statement
.flags
.loaded
= FALSE
;
3302 #ifdef ENABLE_PLUGINS
3303 /* When rescanning, reload --as-needed shared libs. */
3304 else if ((mode
& OPEN_BFD_RESCAN
) != 0
3305 && plugin_insert
== NULL
3306 && s
->input_statement
.flags
.loaded
3307 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3308 && s
->input_statement
.the_bfd
!= NULL
3309 && ((s
->input_statement
.the_bfd
->flags
) & DYNAMIC
) != 0
3310 && plugin_should_reload (s
->input_statement
.the_bfd
))
3312 s
->input_statement
.flags
.loaded
= FALSE
;
3313 s
->input_statement
.flags
.reload
= TRUE
;
3317 os_tail
= lang_output_section_statement
.tail
;
3318 lang_list_init (&add
);
3320 if (! load_symbols (&s
->input_statement
, &add
))
3321 config
.make_executable
= FALSE
;
3323 if (add
.head
!= NULL
)
3325 /* If this was a script with output sections then
3326 tack any added statements on to the end of the
3327 list. This avoids having to reorder the output
3328 section statement list. Very likely the user
3329 forgot -T, and whatever we do here will not meet
3330 naive user expectations. */
3331 if (os_tail
!= lang_output_section_statement
.tail
)
3333 einfo (_("%P: warning: %s contains output sections;"
3334 " did you forget -T?\n"),
3335 s
->input_statement
.filename
);
3336 *stat_ptr
->tail
= add
.head
;
3337 stat_ptr
->tail
= add
.tail
;
3341 *add
.tail
= s
->header
.next
;
3342 s
->header
.next
= add
.head
;
3346 #ifdef ENABLE_PLUGINS
3347 /* If we have found the point at which a plugin added new
3348 files, clear plugin_insert to enable archive rescan. */
3349 if (&s
->input_statement
== plugin_insert
)
3350 plugin_insert
= NULL
;
3353 case lang_assignment_statement_enum
:
3354 if (s
->assignment_statement
.exp
->assign
.defsym
)
3355 /* This is from a --defsym on the command line. */
3356 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3363 /* Exit if any of the files were missing. */
3364 if (input_flags
.missing_file
)
3368 /* New-function for the definedness hash table. */
3370 static struct bfd_hash_entry
*
3371 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3372 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3373 const char *name ATTRIBUTE_UNUSED
)
3375 struct lang_definedness_hash_entry
*ret
3376 = (struct lang_definedness_hash_entry
*) entry
;
3379 ret
= (struct lang_definedness_hash_entry
*)
3380 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3383 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3391 /* Called during processing of linker script script expressions.
3392 For symbols assigned in a linker script, return a struct describing
3393 where the symbol is defined relative to the current expression,
3394 otherwise return NULL. */
3396 struct lang_definedness_hash_entry
*
3397 lang_symbol_defined (const char *name
)
3399 return ((struct lang_definedness_hash_entry
*)
3400 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
));
3403 /* Update the definedness state of NAME. */
3406 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3408 struct lang_definedness_hash_entry
*defentry
3409 = (struct lang_definedness_hash_entry
*)
3410 bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
);
3412 if (defentry
== NULL
)
3413 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3415 /* If the symbol was already defined, and not by a script, then it
3416 must be defined by an object file. */
3417 if (!defentry
->by_script
3418 && h
->type
!= bfd_link_hash_undefined
3419 && h
->type
!= bfd_link_hash_common
3420 && h
->type
!= bfd_link_hash_new
)
3421 defentry
->by_object
= 1;
3423 defentry
->by_script
= 1;
3424 defentry
->iteration
= lang_statement_iteration
;
3427 /* Add the supplied name to the symbol table as an undefined reference.
3428 This is a two step process as the symbol table doesn't even exist at
3429 the time the ld command line is processed. First we put the name
3430 on a list, then, once the output file has been opened, transfer the
3431 name to the symbol table. */
3433 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3435 #define ldlang_undef_chain_list_head entry_symbol.next
3438 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3440 ldlang_undef_chain_list_type
*new_undef
;
3442 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3443 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3444 new_undef
->next
= ldlang_undef_chain_list_head
;
3445 ldlang_undef_chain_list_head
= new_undef
;
3447 new_undef
->name
= xstrdup (name
);
3449 if (link_info
.output_bfd
!= NULL
)
3450 insert_undefined (new_undef
->name
);
3453 /* Insert NAME as undefined in the symbol table. */
3456 insert_undefined (const char *name
)
3458 struct bfd_link_hash_entry
*h
;
3460 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3462 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3463 if (h
->type
== bfd_link_hash_new
)
3465 h
->type
= bfd_link_hash_undefined
;
3466 h
->u
.undef
.abfd
= NULL
;
3467 bfd_link_add_undef (link_info
.hash
, h
);
3471 /* Run through the list of undefineds created above and place them
3472 into the linker hash table as undefined symbols belonging to the
3476 lang_place_undefineds (void)
3478 ldlang_undef_chain_list_type
*ptr
;
3480 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3481 insert_undefined (ptr
->name
);
3484 /* Check for all readonly or some readwrite sections. */
3487 check_input_sections
3488 (lang_statement_union_type
*s
,
3489 lang_output_section_statement_type
*output_section_statement
)
3491 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3493 switch (s
->header
.type
)
3495 case lang_wild_statement_enum
:
3496 walk_wild (&s
->wild_statement
, check_section_callback
,
3497 output_section_statement
);
3498 if (! output_section_statement
->all_input_readonly
)
3501 case lang_constructors_statement_enum
:
3502 check_input_sections (constructor_list
.head
,
3503 output_section_statement
);
3504 if (! output_section_statement
->all_input_readonly
)
3507 case lang_group_statement_enum
:
3508 check_input_sections (s
->group_statement
.children
.head
,
3509 output_section_statement
);
3510 if (! output_section_statement
->all_input_readonly
)
3519 /* Update wildcard statements if needed. */
3522 update_wild_statements (lang_statement_union_type
*s
)
3524 struct wildcard_list
*sec
;
3526 switch (sort_section
)
3536 for (; s
!= NULL
; s
= s
->header
.next
)
3538 switch (s
->header
.type
)
3543 case lang_wild_statement_enum
:
3544 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3547 switch (sec
->spec
.sorted
)
3550 sec
->spec
.sorted
= sort_section
;
3553 if (sort_section
== by_alignment
)
3554 sec
->spec
.sorted
= by_name_alignment
;
3557 if (sort_section
== by_name
)
3558 sec
->spec
.sorted
= by_alignment_name
;
3566 case lang_constructors_statement_enum
:
3567 update_wild_statements (constructor_list
.head
);
3570 case lang_output_section_statement_enum
:
3571 /* Don't sort .init/.fini sections. */
3572 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3573 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3574 update_wild_statements
3575 (s
->output_section_statement
.children
.head
);
3578 case lang_group_statement_enum
:
3579 update_wild_statements (s
->group_statement
.children
.head
);
3587 /* Open input files and attach to output sections. */
3590 map_input_to_output_sections
3591 (lang_statement_union_type
*s
, const char *target
,
3592 lang_output_section_statement_type
*os
)
3594 for (; s
!= NULL
; s
= s
->header
.next
)
3596 lang_output_section_statement_type
*tos
;
3599 switch (s
->header
.type
)
3601 case lang_wild_statement_enum
:
3602 wild (&s
->wild_statement
, target
, os
);
3604 case lang_constructors_statement_enum
:
3605 map_input_to_output_sections (constructor_list
.head
,
3609 case lang_output_section_statement_enum
:
3610 tos
= &s
->output_section_statement
;
3611 if (tos
->constraint
!= 0)
3613 if (tos
->constraint
!= ONLY_IF_RW
3614 && tos
->constraint
!= ONLY_IF_RO
)
3616 tos
->all_input_readonly
= TRUE
;
3617 check_input_sections (tos
->children
.head
, tos
);
3618 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3620 tos
->constraint
= -1;
3624 map_input_to_output_sections (tos
->children
.head
,
3628 case lang_output_statement_enum
:
3630 case lang_target_statement_enum
:
3631 target
= s
->target_statement
.target
;
3633 case lang_group_statement_enum
:
3634 map_input_to_output_sections (s
->group_statement
.children
.head
,
3638 case lang_data_statement_enum
:
3639 /* Make sure that any sections mentioned in the expression
3641 exp_init_os (s
->data_statement
.exp
);
3642 /* The output section gets CONTENTS, ALLOC and LOAD, but
3643 these may be overridden by the script. */
3644 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3645 switch (os
->sectype
)
3647 case normal_section
:
3648 case overlay_section
:
3650 case noalloc_section
:
3651 flags
= SEC_HAS_CONTENTS
;
3653 case noload_section
:
3654 if (bfd_get_flavour (link_info
.output_bfd
)
3655 == bfd_target_elf_flavour
)
3656 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3658 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3661 if (os
->bfd_section
== NULL
)
3662 init_os (os
, flags
);
3664 os
->bfd_section
->flags
|= flags
;
3666 case lang_input_section_enum
:
3668 case lang_fill_statement_enum
:
3669 case lang_object_symbols_statement_enum
:
3670 case lang_reloc_statement_enum
:
3671 case lang_padding_statement_enum
:
3672 case lang_input_statement_enum
:
3673 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3676 case lang_assignment_statement_enum
:
3677 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3680 /* Make sure that any sections mentioned in the assignment
3682 exp_init_os (s
->assignment_statement
.exp
);
3684 case lang_address_statement_enum
:
3685 /* Mark the specified section with the supplied address.
3686 If this section was actually a segment marker, then the
3687 directive is ignored if the linker script explicitly
3688 processed the segment marker. Originally, the linker
3689 treated segment directives (like -Ttext on the
3690 command-line) as section directives. We honor the
3691 section directive semantics for backwards compatibilty;
3692 linker scripts that do not specifically check for
3693 SEGMENT_START automatically get the old semantics. */
3694 if (!s
->address_statement
.segment
3695 || !s
->address_statement
.segment
->used
)
3697 const char *name
= s
->address_statement
.section_name
;
3699 /* Create the output section statement here so that
3700 orphans with a set address will be placed after other
3701 script sections. If we let the orphan placement code
3702 place them in amongst other sections then the address
3703 will affect following script sections, which is
3704 likely to surprise naive users. */
3705 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3706 tos
->addr_tree
= s
->address_statement
.address
;
3707 if (tos
->bfd_section
== NULL
)
3711 case lang_insert_statement_enum
:
3717 /* An insert statement snips out all the linker statements from the
3718 start of the list and places them after the output section
3719 statement specified by the insert. This operation is complicated
3720 by the fact that we keep a doubly linked list of output section
3721 statements as well as the singly linked list of all statements. */
3724 process_insert_statements (void)
3726 lang_statement_union_type
**s
;
3727 lang_output_section_statement_type
*first_os
= NULL
;
3728 lang_output_section_statement_type
*last_os
= NULL
;
3729 lang_output_section_statement_type
*os
;
3731 /* "start of list" is actually the statement immediately after
3732 the special abs_section output statement, so that it isn't
3734 s
= &lang_output_section_statement
.head
;
3735 while (*(s
= &(*s
)->header
.next
) != NULL
)
3737 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3739 /* Keep pointers to the first and last output section
3740 statement in the sequence we may be about to move. */
3741 os
= &(*s
)->output_section_statement
;
3743 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3746 /* Set constraint negative so that lang_output_section_find
3747 won't match this output section statement. At this
3748 stage in linking constraint has values in the range
3749 [-1, ONLY_IN_RW]. */
3750 last_os
->constraint
= -2 - last_os
->constraint
;
3751 if (first_os
== NULL
)
3754 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3756 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3757 lang_output_section_statement_type
*where
;
3758 lang_statement_union_type
**ptr
;
3759 lang_statement_union_type
*first
;
3761 where
= lang_output_section_find (i
->where
);
3762 if (where
!= NULL
&& i
->is_before
)
3765 where
= where
->prev
;
3766 while (where
!= NULL
&& where
->constraint
< 0);
3770 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3774 /* Deal with reordering the output section statement list. */
3775 if (last_os
!= NULL
)
3777 asection
*first_sec
, *last_sec
;
3778 struct lang_output_section_statement_struct
**next
;
3780 /* Snip out the output sections we are moving. */
3781 first_os
->prev
->next
= last_os
->next
;
3782 if (last_os
->next
== NULL
)
3784 next
= &first_os
->prev
->next
;
3785 lang_output_section_statement
.tail
3786 = (lang_statement_union_type
**) next
;
3789 last_os
->next
->prev
= first_os
->prev
;
3790 /* Add them in at the new position. */
3791 last_os
->next
= where
->next
;
3792 if (where
->next
== NULL
)
3794 next
= &last_os
->next
;
3795 lang_output_section_statement
.tail
3796 = (lang_statement_union_type
**) next
;
3799 where
->next
->prev
= last_os
;
3800 first_os
->prev
= where
;
3801 where
->next
= first_os
;
3803 /* Move the bfd sections in the same way. */
3806 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3808 os
->constraint
= -2 - os
->constraint
;
3809 if (os
->bfd_section
!= NULL
3810 && os
->bfd_section
->owner
!= NULL
)
3812 last_sec
= os
->bfd_section
;
3813 if (first_sec
== NULL
)
3814 first_sec
= last_sec
;
3819 if (last_sec
!= NULL
)
3821 asection
*sec
= where
->bfd_section
;
3823 sec
= output_prev_sec_find (where
);
3825 /* The place we want to insert must come after the
3826 sections we are moving. So if we find no
3827 section or if the section is the same as our
3828 last section, then no move is needed. */
3829 if (sec
!= NULL
&& sec
!= last_sec
)
3831 /* Trim them off. */
3832 if (first_sec
->prev
!= NULL
)
3833 first_sec
->prev
->next
= last_sec
->next
;
3835 link_info
.output_bfd
->sections
= last_sec
->next
;
3836 if (last_sec
->next
!= NULL
)
3837 last_sec
->next
->prev
= first_sec
->prev
;
3839 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3841 last_sec
->next
= sec
->next
;
3842 if (sec
->next
!= NULL
)
3843 sec
->next
->prev
= last_sec
;
3845 link_info
.output_bfd
->section_last
= last_sec
;
3846 first_sec
->prev
= sec
;
3847 sec
->next
= first_sec
;
3855 ptr
= insert_os_after (where
);
3856 /* Snip everything after the abs_section output statement we
3857 know is at the start of the list, up to and including
3858 the insert statement we are currently processing. */
3859 first
= lang_output_section_statement
.head
->header
.next
;
3860 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3861 /* Add them back where they belong. */
3864 statement_list
.tail
= s
;
3866 s
= &lang_output_section_statement
.head
;
3870 /* Undo constraint twiddling. */
3871 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3873 os
->constraint
= -2 - os
->constraint
;
3879 /* An output section might have been removed after its statement was
3880 added. For example, ldemul_before_allocation can remove dynamic
3881 sections if they turn out to be not needed. Clean them up here. */
3884 strip_excluded_output_sections (void)
3886 lang_output_section_statement_type
*os
;
3888 /* Run lang_size_sections (if not already done). */
3889 if (expld
.phase
!= lang_mark_phase_enum
)
3891 expld
.phase
= lang_mark_phase_enum
;
3892 expld
.dataseg
.phase
= exp_dataseg_none
;
3893 one_lang_size_sections_pass (NULL
, FALSE
);
3894 lang_reset_memory_regions ();
3897 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3901 asection
*output_section
;
3902 bfd_boolean exclude
;
3904 if (os
->constraint
< 0)
3907 output_section
= os
->bfd_section
;
3908 if (output_section
== NULL
)
3911 exclude
= (output_section
->rawsize
== 0
3912 && (output_section
->flags
& SEC_KEEP
) == 0
3913 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3916 /* Some sections have not yet been sized, notably .gnu.version,
3917 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3918 input sections, so don't drop output sections that have such
3919 input sections unless they are also marked SEC_EXCLUDE. */
3920 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3924 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3925 if ((s
->flags
& SEC_EXCLUDE
) == 0
3926 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3927 || link_info
.emitrelocations
))
3934 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3935 output_section
->map_head
.link_order
= NULL
;
3936 output_section
->map_tail
.link_order
= NULL
;
3940 /* We don't set bfd_section to NULL since bfd_section of the
3941 removed output section statement may still be used. */
3942 if (!os
->update_dot
)
3944 output_section
->flags
|= SEC_EXCLUDE
;
3945 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3946 link_info
.output_bfd
->section_count
--;
3950 /* Stop future calls to lang_add_section from messing with map_head
3951 and map_tail link_order fields. */
3952 stripped_excluded_sections
= TRUE
;
3956 print_output_section_statement
3957 (lang_output_section_statement_type
*output_section_statement
)
3959 asection
*section
= output_section_statement
->bfd_section
;
3962 if (output_section_statement
!= abs_output_section
)
3964 minfo ("\n%s", output_section_statement
->name
);
3966 if (section
!= NULL
)
3968 print_dot
= section
->vma
;
3970 len
= strlen (output_section_statement
->name
);
3971 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3976 while (len
< SECTION_NAME_MAP_LENGTH
)
3982 minfo ("0x%V %W", section
->vma
, section
->size
);
3984 if (section
->vma
!= section
->lma
)
3985 minfo (_(" load address 0x%V"), section
->lma
);
3987 if (output_section_statement
->update_dot_tree
!= NULL
)
3988 exp_fold_tree (output_section_statement
->update_dot_tree
,
3989 bfd_abs_section_ptr
, &print_dot
);
3995 print_statement_list (output_section_statement
->children
.head
,
3996 output_section_statement
);
4000 print_assignment (lang_assignment_statement_type
*assignment
,
4001 lang_output_section_statement_type
*output_section
)
4008 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4011 if (assignment
->exp
->type
.node_class
== etree_assert
)
4014 tree
= assignment
->exp
->assert_s
.child
;
4018 const char *dst
= assignment
->exp
->assign
.dst
;
4020 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4022 expld
.assign_name
= dst
;
4023 tree
= assignment
->exp
->assign
.src
;
4026 osec
= output_section
->bfd_section
;
4028 osec
= bfd_abs_section_ptr
;
4029 exp_fold_tree (tree
, osec
, &print_dot
);
4030 if (expld
.result
.valid_p
)
4034 if (assignment
->exp
->type
.node_class
== etree_assert
4036 || expld
.assign_name
!= NULL
)
4038 value
= expld
.result
.value
;
4040 if (expld
.result
.section
!= NULL
)
4041 value
+= expld
.result
.section
->vma
;
4043 minfo ("0x%V", value
);
4049 struct bfd_link_hash_entry
*h
;
4051 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4052 FALSE
, FALSE
, TRUE
);
4055 value
= h
->u
.def
.value
;
4056 value
+= h
->u
.def
.section
->output_section
->vma
;
4057 value
+= h
->u
.def
.section
->output_offset
;
4059 minfo ("[0x%V]", value
);
4062 minfo ("[unresolved]");
4072 expld
.assign_name
= NULL
;
4075 exp_print_tree (assignment
->exp
);
4080 print_input_statement (lang_input_statement_type
*statm
)
4082 if (statm
->filename
!= NULL
4083 && (statm
->the_bfd
== NULL
4084 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4085 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4088 /* Print all symbols defined in a particular section. This is called
4089 via bfd_link_hash_traverse, or by print_all_symbols. */
4092 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4094 asection
*sec
= (asection
*) ptr
;
4096 if ((hash_entry
->type
== bfd_link_hash_defined
4097 || hash_entry
->type
== bfd_link_hash_defweak
)
4098 && sec
== hash_entry
->u
.def
.section
)
4102 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4105 (hash_entry
->u
.def
.value
4106 + hash_entry
->u
.def
.section
->output_offset
4107 + hash_entry
->u
.def
.section
->output_section
->vma
));
4109 minfo (" %T\n", hash_entry
->root
.string
);
4116 hash_entry_addr_cmp (const void *a
, const void *b
)
4118 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4119 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4121 if (l
->u
.def
.value
< r
->u
.def
.value
)
4123 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4130 print_all_symbols (asection
*sec
)
4132 input_section_userdata_type
*ud
4133 = (input_section_userdata_type
*) get_userdata (sec
);
4134 struct map_symbol_def
*def
;
4135 struct bfd_link_hash_entry
**entries
;
4141 *ud
->map_symbol_def_tail
= 0;
4143 /* Sort the symbols by address. */
4144 entries
= (struct bfd_link_hash_entry
**)
4145 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4147 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4148 entries
[i
] = def
->entry
;
4150 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4151 hash_entry_addr_cmp
);
4153 /* Print the symbols. */
4154 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4155 print_one_symbol (entries
[i
], sec
);
4157 obstack_free (&map_obstack
, entries
);
4160 /* Print information about an input section to the map file. */
4163 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4165 bfd_size_type size
= i
->size
;
4172 minfo ("%s", i
->name
);
4174 len
= 1 + strlen (i
->name
);
4175 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4180 while (len
< SECTION_NAME_MAP_LENGTH
)
4186 if (i
->output_section
!= NULL
4187 && i
->output_section
->owner
== link_info
.output_bfd
)
4188 addr
= i
->output_section
->vma
+ i
->output_offset
;
4196 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4198 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4200 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4212 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4215 if (i
->output_section
!= NULL
4216 && i
->output_section
->owner
== link_info
.output_bfd
)
4218 if (link_info
.reduce_memory_overheads
)
4219 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4221 print_all_symbols (i
);
4223 /* Update print_dot, but make sure that we do not move it
4224 backwards - this could happen if we have overlays and a
4225 later overlay is shorter than an earier one. */
4226 if (addr
+ TO_ADDR (size
) > print_dot
)
4227 print_dot
= addr
+ TO_ADDR (size
);
4232 print_fill_statement (lang_fill_statement_type
*fill
)
4236 fputs (" FILL mask 0x", config
.map_file
);
4237 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4238 fprintf (config
.map_file
, "%02x", *p
);
4239 fputs ("\n", config
.map_file
);
4243 print_data_statement (lang_data_statement_type
*data
)
4251 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4254 addr
= data
->output_offset
;
4255 if (data
->output_section
!= NULL
)
4256 addr
+= data
->output_section
->vma
;
4284 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4286 if (data
->exp
->type
.node_class
!= etree_value
)
4289 exp_print_tree (data
->exp
);
4294 print_dot
= addr
+ TO_ADDR (size
);
4297 /* Print an address statement. These are generated by options like
4301 print_address_statement (lang_address_statement_type
*address
)
4303 minfo (_("Address of section %s set to "), address
->section_name
);
4304 exp_print_tree (address
->address
);
4308 /* Print a reloc statement. */
4311 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4318 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4321 addr
= reloc
->output_offset
;
4322 if (reloc
->output_section
!= NULL
)
4323 addr
+= reloc
->output_section
->vma
;
4325 size
= bfd_get_reloc_size (reloc
->howto
);
4327 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4329 if (reloc
->name
!= NULL
)
4330 minfo ("%s+", reloc
->name
);
4332 minfo ("%s+", reloc
->section
->name
);
4334 exp_print_tree (reloc
->addend_exp
);
4338 print_dot
= addr
+ TO_ADDR (size
);
4342 print_padding_statement (lang_padding_statement_type
*s
)
4350 len
= sizeof " *fill*" - 1;
4351 while (len
< SECTION_NAME_MAP_LENGTH
)
4357 addr
= s
->output_offset
;
4358 if (s
->output_section
!= NULL
)
4359 addr
+= s
->output_section
->vma
;
4360 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4362 if (s
->fill
->size
!= 0)
4366 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4367 fprintf (config
.map_file
, "%02x", *p
);
4372 print_dot
= addr
+ TO_ADDR (s
->size
);
4376 print_wild_statement (lang_wild_statement_type
*w
,
4377 lang_output_section_statement_type
*os
)
4379 struct wildcard_list
*sec
;
4383 if (w
->filenames_sorted
)
4385 if (w
->filename
!= NULL
)
4386 minfo ("%s", w
->filename
);
4389 if (w
->filenames_sorted
)
4393 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4395 if (sec
->spec
.sorted
)
4397 if (sec
->spec
.exclude_name_list
!= NULL
)
4400 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4401 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4402 minfo (" %s", tmp
->name
);
4405 if (sec
->spec
.name
!= NULL
)
4406 minfo ("%s", sec
->spec
.name
);
4409 if (sec
->spec
.sorted
)
4418 print_statement_list (w
->children
.head
, os
);
4421 /* Print a group statement. */
4424 print_group (lang_group_statement_type
*s
,
4425 lang_output_section_statement_type
*os
)
4427 fprintf (config
.map_file
, "START GROUP\n");
4428 print_statement_list (s
->children
.head
, os
);
4429 fprintf (config
.map_file
, "END GROUP\n");
4432 /* Print the list of statements in S.
4433 This can be called for any statement type. */
4436 print_statement_list (lang_statement_union_type
*s
,
4437 lang_output_section_statement_type
*os
)
4441 print_statement (s
, os
);
4446 /* Print the first statement in statement list S.
4447 This can be called for any statement type. */
4450 print_statement (lang_statement_union_type
*s
,
4451 lang_output_section_statement_type
*os
)
4453 switch (s
->header
.type
)
4456 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4459 case lang_constructors_statement_enum
:
4460 if (constructor_list
.head
!= NULL
)
4462 if (constructors_sorted
)
4463 minfo (" SORT (CONSTRUCTORS)\n");
4465 minfo (" CONSTRUCTORS\n");
4466 print_statement_list (constructor_list
.head
, os
);
4469 case lang_wild_statement_enum
:
4470 print_wild_statement (&s
->wild_statement
, os
);
4472 case lang_address_statement_enum
:
4473 print_address_statement (&s
->address_statement
);
4475 case lang_object_symbols_statement_enum
:
4476 minfo (" CREATE_OBJECT_SYMBOLS\n");
4478 case lang_fill_statement_enum
:
4479 print_fill_statement (&s
->fill_statement
);
4481 case lang_data_statement_enum
:
4482 print_data_statement (&s
->data_statement
);
4484 case lang_reloc_statement_enum
:
4485 print_reloc_statement (&s
->reloc_statement
);
4487 case lang_input_section_enum
:
4488 print_input_section (s
->input_section
.section
, FALSE
);
4490 case lang_padding_statement_enum
:
4491 print_padding_statement (&s
->padding_statement
);
4493 case lang_output_section_statement_enum
:
4494 print_output_section_statement (&s
->output_section_statement
);
4496 case lang_assignment_statement_enum
:
4497 print_assignment (&s
->assignment_statement
, os
);
4499 case lang_target_statement_enum
:
4500 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4502 case lang_output_statement_enum
:
4503 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4504 if (output_target
!= NULL
)
4505 minfo (" %s", output_target
);
4508 case lang_input_statement_enum
:
4509 print_input_statement (&s
->input_statement
);
4511 case lang_group_statement_enum
:
4512 print_group (&s
->group_statement
, os
);
4514 case lang_insert_statement_enum
:
4515 minfo ("INSERT %s %s\n",
4516 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4517 s
->insert_statement
.where
);
4523 print_statements (void)
4525 print_statement_list (statement_list
.head
, abs_output_section
);
4528 /* Print the first N statements in statement list S to STDERR.
4529 If N == 0, nothing is printed.
4530 If N < 0, the entire list is printed.
4531 Intended to be called from GDB. */
4534 dprint_statement (lang_statement_union_type
*s
, int n
)
4536 FILE *map_save
= config
.map_file
;
4538 config
.map_file
= stderr
;
4541 print_statement_list (s
, abs_output_section
);
4544 while (s
&& --n
>= 0)
4546 print_statement (s
, abs_output_section
);
4551 config
.map_file
= map_save
;
4555 insert_pad (lang_statement_union_type
**ptr
,
4557 bfd_size_type alignment_needed
,
4558 asection
*output_section
,
4561 static fill_type zero_fill
;
4562 lang_statement_union_type
*pad
= NULL
;
4564 if (ptr
!= &statement_list
.head
)
4565 pad
= ((lang_statement_union_type
*)
4566 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4568 && pad
->header
.type
== lang_padding_statement_enum
4569 && pad
->padding_statement
.output_section
== output_section
)
4571 /* Use the existing pad statement. */
4573 else if ((pad
= *ptr
) != NULL
4574 && pad
->header
.type
== lang_padding_statement_enum
4575 && pad
->padding_statement
.output_section
== output_section
)
4577 /* Use the existing pad statement. */
4581 /* Make a new padding statement, linked into existing chain. */
4582 pad
= (lang_statement_union_type
*)
4583 stat_alloc (sizeof (lang_padding_statement_type
));
4584 pad
->header
.next
= *ptr
;
4586 pad
->header
.type
= lang_padding_statement_enum
;
4587 pad
->padding_statement
.output_section
= output_section
;
4590 pad
->padding_statement
.fill
= fill
;
4592 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4593 pad
->padding_statement
.size
= alignment_needed
;
4594 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4595 - output_section
->vma
);
4598 /* Work out how much this section will move the dot point. */
4602 (lang_statement_union_type
**this_ptr
,
4603 lang_output_section_statement_type
*output_section_statement
,
4607 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4608 asection
*i
= is
->section
;
4609 asection
*o
= output_section_statement
->bfd_section
;
4611 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4612 i
->output_offset
= i
->vma
- o
->vma
;
4613 else if ((i
->flags
& SEC_EXCLUDE
) != 0)
4614 i
->output_offset
= dot
- o
->vma
;
4617 bfd_size_type alignment_needed
;
4619 /* Align this section first to the input sections requirement,
4620 then to the output section's requirement. If this alignment
4621 is greater than any seen before, then record it too. Perform
4622 the alignment by inserting a magic 'padding' statement. */
4624 if (output_section_statement
->subsection_alignment
!= -1)
4625 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4627 if (o
->alignment_power
< i
->alignment_power
)
4628 o
->alignment_power
= i
->alignment_power
;
4630 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4632 if (alignment_needed
!= 0)
4634 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4635 dot
+= alignment_needed
;
4638 /* Remember where in the output section this input section goes. */
4639 i
->output_offset
= dot
- o
->vma
;
4641 /* Mark how big the output section must be to contain this now. */
4642 dot
+= TO_ADDR (i
->size
);
4643 o
->size
= TO_SIZE (dot
- o
->vma
);
4650 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4652 const asection
*sec1
= *(const asection
**) arg1
;
4653 const asection
*sec2
= *(const asection
**) arg2
;
4655 if (bfd_section_lma (sec1
->owner
, sec1
)
4656 < bfd_section_lma (sec2
->owner
, sec2
))
4658 else if (bfd_section_lma (sec1
->owner
, sec1
)
4659 > bfd_section_lma (sec2
->owner
, sec2
))
4661 else if (sec1
->id
< sec2
->id
)
4663 else if (sec1
->id
> sec2
->id
)
4669 #define IGNORE_SECTION(s) \
4670 ((s->flags & SEC_ALLOC) == 0 \
4671 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4672 && (s->flags & SEC_LOAD) == 0))
4674 /* Check to see if any allocated sections overlap with other allocated
4675 sections. This can happen if a linker script specifies the output
4676 section addresses of the two sections. Also check whether any memory
4677 region has overflowed. */
4680 lang_check_section_addresses (void)
4683 asection
**sections
, **spp
;
4690 lang_memory_region_type
*m
;
4692 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4695 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4696 sections
= (asection
**) xmalloc (amt
);
4698 /* Scan all sections in the output list. */
4700 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4702 /* Only consider loadable sections with real contents. */
4703 if (!(s
->flags
& SEC_LOAD
)
4704 || !(s
->flags
& SEC_ALLOC
)
4708 sections
[count
] = s
;
4715 qsort (sections
, (size_t) count
, sizeof (asection
*),
4716 sort_sections_by_lma
);
4721 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4722 for (count
--; count
; count
--)
4724 /* We must check the sections' LMA addresses not their VMA
4725 addresses because overlay sections can have overlapping VMAs
4726 but they must have distinct LMAs. */
4732 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4734 /* Look for an overlap. We have sorted sections by lma, so we
4735 know that s_start >= p_start. Besides the obvious case of
4736 overlap when the current section starts before the previous
4737 one ends, we also must have overlap if the previous section
4738 wraps around the address space. */
4739 if (s_start
<= p_end
4741 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4742 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4747 /* If any memory region has overflowed, report by how much.
4748 We do not issue this diagnostic for regions that had sections
4749 explicitly placed outside their bounds; os_region_check's
4750 diagnostics are adequate for that case.
4752 FIXME: It is conceivable that m->current - (m->origin + m->length)
4753 might overflow a 32-bit integer. There is, alas, no way to print
4754 a bfd_vma quantity in decimal. */
4755 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4756 if (m
->had_full_message
)
4757 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4758 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4762 /* Make sure the new address is within the region. We explicitly permit the
4763 current address to be at the exact end of the region when the address is
4764 non-zero, in case the region is at the end of addressable memory and the
4765 calculation wraps around. */
4768 os_region_check (lang_output_section_statement_type
*os
,
4769 lang_memory_region_type
*region
,
4773 if ((region
->current
< region
->origin
4774 || (region
->current
- region
->origin
> region
->length
))
4775 && ((region
->current
!= region
->origin
+ region
->length
)
4780 einfo (_("%X%P: address 0x%v of %B section `%s'"
4781 " is not within region `%s'\n"),
4783 os
->bfd_section
->owner
,
4784 os
->bfd_section
->name
,
4785 region
->name_list
.name
);
4787 else if (!region
->had_full_message
)
4789 region
->had_full_message
= TRUE
;
4791 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4792 os
->bfd_section
->owner
,
4793 os
->bfd_section
->name
,
4794 region
->name_list
.name
);
4799 /* Set the sizes for all the output sections. */
4802 lang_size_sections_1
4803 (lang_statement_union_type
**prev
,
4804 lang_output_section_statement_type
*output_section_statement
,
4808 bfd_boolean check_regions
)
4810 lang_statement_union_type
*s
;
4812 /* Size up the sections from their constituent parts. */
4813 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4815 switch (s
->header
.type
)
4817 case lang_output_section_statement_enum
:
4819 bfd_vma newdot
, after
, dotdelta
;
4820 lang_output_section_statement_type
*os
;
4821 lang_memory_region_type
*r
;
4822 int section_alignment
= 0;
4824 os
= &s
->output_section_statement
;
4825 if (os
->constraint
== -1)
4828 /* FIXME: We shouldn't need to zero section vmas for ld -r
4829 here, in lang_insert_orphan, or in the default linker scripts.
4830 This is covering for coff backend linker bugs. See PR6945. */
4831 if (os
->addr_tree
== NULL
4832 && link_info
.relocatable
4833 && (bfd_get_flavour (link_info
.output_bfd
)
4834 == bfd_target_coff_flavour
))
4835 os
->addr_tree
= exp_intop (0);
4836 if (os
->addr_tree
!= NULL
)
4838 os
->processed_vma
= FALSE
;
4839 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4841 if (expld
.result
.valid_p
)
4843 dot
= expld
.result
.value
;
4844 if (expld
.result
.section
!= NULL
)
4845 dot
+= expld
.result
.section
->vma
;
4847 else if (expld
.phase
!= lang_mark_phase_enum
)
4848 einfo (_("%F%S: non constant or forward reference"
4849 " address expression for section %s\n"),
4850 os
->addr_tree
, os
->name
);
4853 if (os
->bfd_section
== NULL
)
4854 /* This section was removed or never actually created. */
4857 /* If this is a COFF shared library section, use the size and
4858 address from the input section. FIXME: This is COFF
4859 specific; it would be cleaner if there were some other way
4860 to do this, but nothing simple comes to mind. */
4861 if (((bfd_get_flavour (link_info
.output_bfd
)
4862 == bfd_target_ecoff_flavour
)
4863 || (bfd_get_flavour (link_info
.output_bfd
)
4864 == bfd_target_coff_flavour
))
4865 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4869 if (os
->children
.head
== NULL
4870 || os
->children
.head
->header
.next
!= NULL
4871 || (os
->children
.head
->header
.type
4872 != lang_input_section_enum
))
4873 einfo (_("%P%X: Internal error on COFF shared library"
4874 " section %s\n"), os
->name
);
4876 input
= os
->children
.head
->input_section
.section
;
4877 bfd_set_section_vma (os
->bfd_section
->owner
,
4879 bfd_section_vma (input
->owner
, input
));
4880 os
->bfd_section
->size
= input
->size
;
4886 if (bfd_is_abs_section (os
->bfd_section
))
4888 /* No matter what happens, an abs section starts at zero. */
4889 ASSERT (os
->bfd_section
->vma
== 0);
4893 if (os
->addr_tree
== NULL
)
4895 /* No address specified for this section, get one
4896 from the region specification. */
4897 if (os
->region
== NULL
4898 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4899 && os
->region
->name_list
.name
[0] == '*'
4900 && strcmp (os
->region
->name_list
.name
,
4901 DEFAULT_MEMORY_REGION
) == 0))
4903 os
->region
= lang_memory_default (os
->bfd_section
);
4906 /* If a loadable section is using the default memory
4907 region, and some non default memory regions were
4908 defined, issue an error message. */
4910 && !IGNORE_SECTION (os
->bfd_section
)
4911 && ! link_info
.relocatable
4913 && strcmp (os
->region
->name_list
.name
,
4914 DEFAULT_MEMORY_REGION
) == 0
4915 && lang_memory_region_list
!= NULL
4916 && (strcmp (lang_memory_region_list
->name_list
.name
,
4917 DEFAULT_MEMORY_REGION
) != 0
4918 || lang_memory_region_list
->next
!= NULL
)
4919 && expld
.phase
!= lang_mark_phase_enum
)
4921 /* By default this is an error rather than just a
4922 warning because if we allocate the section to the
4923 default memory region we can end up creating an
4924 excessively large binary, or even seg faulting when
4925 attempting to perform a negative seek. See
4926 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4927 for an example of this. This behaviour can be
4928 overridden by the using the --no-check-sections
4930 if (command_line
.check_section_addresses
)
4931 einfo (_("%P%F: error: no memory region specified"
4932 " for loadable section `%s'\n"),
4933 bfd_get_section_name (link_info
.output_bfd
,
4936 einfo (_("%P: warning: no memory region specified"
4937 " for loadable section `%s'\n"),
4938 bfd_get_section_name (link_info
.output_bfd
,
4942 newdot
= os
->region
->current
;
4943 section_alignment
= os
->bfd_section
->alignment_power
;
4946 section_alignment
= os
->section_alignment
;
4948 /* Align to what the section needs. */
4949 if (section_alignment
> 0)
4951 bfd_vma savedot
= newdot
;
4952 newdot
= align_power (newdot
, section_alignment
);
4954 dotdelta
= newdot
- savedot
;
4956 && (config
.warn_section_align
4957 || os
->addr_tree
!= NULL
)
4958 && expld
.phase
!= lang_mark_phase_enum
)
4959 einfo (_("%P: warning: changing start of section"
4960 " %s by %lu bytes\n"),
4961 os
->name
, (unsigned long) dotdelta
);
4964 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4966 os
->bfd_section
->output_offset
= 0;
4969 lang_size_sections_1 (&os
->children
.head
, os
,
4970 os
->fill
, newdot
, relax
, check_regions
);
4972 os
->processed_vma
= TRUE
;
4974 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4975 /* Except for some special linker created sections,
4976 no output section should change from zero size
4977 after strip_excluded_output_sections. A non-zero
4978 size on an ignored section indicates that some
4979 input section was not sized early enough. */
4980 ASSERT (os
->bfd_section
->size
== 0);
4983 dot
= os
->bfd_section
->vma
;
4985 /* Put the section within the requested block size, or
4986 align at the block boundary. */
4988 + TO_ADDR (os
->bfd_section
->size
)
4989 + os
->block_value
- 1)
4990 & - (bfd_vma
) os
->block_value
);
4992 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4995 /* Set section lma. */
4998 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5002 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5003 os
->bfd_section
->lma
= lma
;
5005 else if (os
->lma_region
!= NULL
)
5007 bfd_vma lma
= os
->lma_region
->current
;
5009 if (os
->align_lma_with_input
)
5013 /* When LMA_REGION is the same as REGION, align the LMA
5014 as we did for the VMA, possibly including alignment
5015 from the bfd section. If a different region, then
5016 only align according to the value in the output
5018 if (os
->lma_region
!= os
->region
)
5019 section_alignment
= os
->section_alignment
;
5020 if (section_alignment
> 0)
5021 lma
= align_power (lma
, section_alignment
);
5023 os
->bfd_section
->lma
= lma
;
5025 else if (r
->last_os
!= NULL
5026 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5031 last
= r
->last_os
->output_section_statement
.bfd_section
;
5033 /* A backwards move of dot should be accompanied by
5034 an explicit assignment to the section LMA (ie.
5035 os->load_base set) because backwards moves can
5036 create overlapping LMAs. */
5038 && os
->bfd_section
->size
!= 0
5039 && dot
+ os
->bfd_section
->size
<= last
->vma
)
5041 /* If dot moved backwards then leave lma equal to
5042 vma. This is the old default lma, which might
5043 just happen to work when the backwards move is
5044 sufficiently large. Nag if this changes anything,
5045 so people can fix their linker scripts. */
5047 if (last
->vma
!= last
->lma
)
5048 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5053 /* If this is an overlay, set the current lma to that
5054 at the end of the previous section. */
5055 if (os
->sectype
== overlay_section
)
5056 lma
= last
->lma
+ last
->size
;
5058 /* Otherwise, keep the same lma to vma relationship
5059 as the previous section. */
5061 lma
= dot
+ last
->lma
- last
->vma
;
5063 if (section_alignment
> 0)
5064 lma
= align_power (lma
, section_alignment
);
5065 os
->bfd_section
->lma
= lma
;
5068 os
->processed_lma
= TRUE
;
5070 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5073 /* Keep track of normal sections using the default
5074 lma region. We use this to set the lma for
5075 following sections. Overlays or other linker
5076 script assignment to lma might mean that the
5077 default lma == vma is incorrect.
5078 To avoid warnings about dot moving backwards when using
5079 -Ttext, don't start tracking sections until we find one
5080 of non-zero size or with lma set differently to vma. */
5081 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5082 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5083 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5084 && (os
->bfd_section
->size
!= 0
5085 || (r
->last_os
== NULL
5086 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5087 || (r
->last_os
!= NULL
5088 && dot
>= (r
->last_os
->output_section_statement
5089 .bfd_section
->vma
)))
5090 && os
->lma_region
== NULL
5091 && !link_info
.relocatable
)
5094 /* .tbss sections effectively have zero size. */
5095 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5096 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5097 || link_info
.relocatable
)
5098 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5103 if (os
->update_dot_tree
!= 0)
5104 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5106 /* Update dot in the region ?
5107 We only do this if the section is going to be allocated,
5108 since unallocated sections do not contribute to the region's
5109 overall size in memory. */
5110 if (os
->region
!= NULL
5111 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5113 os
->region
->current
= dot
;
5116 /* Make sure the new address is within the region. */
5117 os_region_check (os
, os
->region
, os
->addr_tree
,
5118 os
->bfd_section
->vma
);
5120 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5121 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5122 || os
->align_lma_with_input
))
5124 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5127 os_region_check (os
, os
->lma_region
, NULL
,
5128 os
->bfd_section
->lma
);
5134 case lang_constructors_statement_enum
:
5135 dot
= lang_size_sections_1 (&constructor_list
.head
,
5136 output_section_statement
,
5137 fill
, dot
, relax
, check_regions
);
5140 case lang_data_statement_enum
:
5142 unsigned int size
= 0;
5144 s
->data_statement
.output_offset
=
5145 dot
- output_section_statement
->bfd_section
->vma
;
5146 s
->data_statement
.output_section
=
5147 output_section_statement
->bfd_section
;
5149 /* We might refer to provided symbols in the expression, and
5150 need to mark them as needed. */
5151 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5153 switch (s
->data_statement
.type
)
5171 if (size
< TO_SIZE ((unsigned) 1))
5172 size
= TO_SIZE ((unsigned) 1);
5173 dot
+= TO_ADDR (size
);
5174 output_section_statement
->bfd_section
->size
5175 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5180 case lang_reloc_statement_enum
:
5184 s
->reloc_statement
.output_offset
=
5185 dot
- output_section_statement
->bfd_section
->vma
;
5186 s
->reloc_statement
.output_section
=
5187 output_section_statement
->bfd_section
;
5188 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5189 dot
+= TO_ADDR (size
);
5190 output_section_statement
->bfd_section
->size
5191 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5195 case lang_wild_statement_enum
:
5196 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5197 output_section_statement
,
5198 fill
, dot
, relax
, check_regions
);
5201 case lang_object_symbols_statement_enum
:
5202 link_info
.create_object_symbols_section
=
5203 output_section_statement
->bfd_section
;
5206 case lang_output_statement_enum
:
5207 case lang_target_statement_enum
:
5210 case lang_input_section_enum
:
5214 i
= s
->input_section
.section
;
5219 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5220 einfo (_("%P%F: can't relax section: %E\n"));
5224 dot
= size_input_section (prev
, output_section_statement
,
5229 case lang_input_statement_enum
:
5232 case lang_fill_statement_enum
:
5233 s
->fill_statement
.output_section
=
5234 output_section_statement
->bfd_section
;
5236 fill
= s
->fill_statement
.fill
;
5239 case lang_assignment_statement_enum
:
5241 bfd_vma newdot
= dot
;
5242 etree_type
*tree
= s
->assignment_statement
.exp
;
5244 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5246 exp_fold_tree (tree
,
5247 output_section_statement
->bfd_section
,
5250 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5252 if (!expld
.dataseg
.relro_start_stat
)
5253 expld
.dataseg
.relro_start_stat
= s
;
5256 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5259 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5261 if (!expld
.dataseg
.relro_end_stat
)
5262 expld
.dataseg
.relro_end_stat
= s
;
5265 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5268 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5270 /* This symbol may be relative to this section. */
5271 if ((tree
->type
.node_class
== etree_provided
5272 || tree
->type
.node_class
== etree_assign
)
5273 && (tree
->assign
.dst
[0] != '.'
5274 || tree
->assign
.dst
[1] != '\0'))
5275 output_section_statement
->update_dot
= 1;
5277 if (!output_section_statement
->ignored
)
5279 if (output_section_statement
== abs_output_section
)
5281 /* If we don't have an output section, then just adjust
5282 the default memory address. */
5283 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5284 FALSE
)->current
= newdot
;
5286 else if (newdot
!= dot
)
5288 /* Insert a pad after this statement. We can't
5289 put the pad before when relaxing, in case the
5290 assignment references dot. */
5291 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5292 output_section_statement
->bfd_section
, dot
);
5294 /* Don't neuter the pad below when relaxing. */
5297 /* If dot is advanced, this implies that the section
5298 should have space allocated to it, unless the
5299 user has explicitly stated that the section
5300 should not be allocated. */
5301 if (output_section_statement
->sectype
!= noalloc_section
5302 && (output_section_statement
->sectype
!= noload_section
5303 || (bfd_get_flavour (link_info
.output_bfd
)
5304 == bfd_target_elf_flavour
)))
5305 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5312 case lang_padding_statement_enum
:
5313 /* If this is the first time lang_size_sections is called,
5314 we won't have any padding statements. If this is the
5315 second or later passes when relaxing, we should allow
5316 padding to shrink. If padding is needed on this pass, it
5317 will be added back in. */
5318 s
->padding_statement
.size
= 0;
5320 /* Make sure output_offset is valid. If relaxation shrinks
5321 the section and this pad isn't needed, it's possible to
5322 have output_offset larger than the final size of the
5323 section. bfd_set_section_contents will complain even for
5324 a pad size of zero. */
5325 s
->padding_statement
.output_offset
5326 = dot
- output_section_statement
->bfd_section
->vma
;
5329 case lang_group_statement_enum
:
5330 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5331 output_section_statement
,
5332 fill
, dot
, relax
, check_regions
);
5335 case lang_insert_statement_enum
:
5338 /* We can only get here when relaxing is turned on. */
5339 case lang_address_statement_enum
:
5346 prev
= &s
->header
.next
;
5351 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5352 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5353 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5354 segments. We are allowed an opportunity to override this decision. */
5357 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5358 bfd
* abfd ATTRIBUTE_UNUSED
,
5359 asection
* current_section
,
5360 asection
* previous_section
,
5361 bfd_boolean new_segment
)
5363 lang_output_section_statement_type
* cur
;
5364 lang_output_section_statement_type
* prev
;
5366 /* The checks below are only necessary when the BFD library has decided
5367 that the two sections ought to be placed into the same segment. */
5371 /* Paranoia checks. */
5372 if (current_section
== NULL
|| previous_section
== NULL
)
5375 /* If this flag is set, the target never wants code and non-code
5376 sections comingled in the same segment. */
5377 if (config
.separate_code
5378 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5381 /* Find the memory regions associated with the two sections.
5382 We call lang_output_section_find() here rather than scanning the list
5383 of output sections looking for a matching section pointer because if
5384 we have a large number of sections then a hash lookup is faster. */
5385 cur
= lang_output_section_find (current_section
->name
);
5386 prev
= lang_output_section_find (previous_section
->name
);
5388 /* More paranoia. */
5389 if (cur
== NULL
|| prev
== NULL
)
5392 /* If the regions are different then force the sections to live in
5393 different segments. See the email thread starting at the following
5394 URL for the reasons why this is necessary:
5395 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5396 return cur
->region
!= prev
->region
;
5400 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5402 lang_statement_iteration
++;
5403 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5404 0, 0, relax
, check_regions
);
5408 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5410 expld
.phase
= lang_allocating_phase_enum
;
5411 expld
.dataseg
.phase
= exp_dataseg_none
;
5413 one_lang_size_sections_pass (relax
, check_regions
);
5414 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5415 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5417 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5418 to put expld.dataseg.relro_end on a (common) page boundary. */
5419 bfd_vma min_base
, relro_end
, maxpage
;
5421 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5422 maxpage
= expld
.dataseg
.maxpagesize
;
5423 /* MIN_BASE is the absolute minimum address we are allowed to start the
5424 read-write segment (byte before will be mapped read-only). */
5425 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5426 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5427 & (expld
.dataseg
.pagesize
- 1));
5428 /* Compute the expected PT_GNU_RELRO segment end. */
5429 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5430 & ~(expld
.dataseg
.pagesize
- 1));
5431 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5433 expld
.dataseg
.base
-= maxpage
;
5434 relro_end
-= maxpage
;
5436 lang_reset_memory_regions ();
5437 one_lang_size_sections_pass (relax
, check_regions
);
5438 if (expld
.dataseg
.relro_end
> relro_end
)
5440 /* The alignment of sections between DATA_SEGMENT_ALIGN
5441 and DATA_SEGMENT_RELRO_END can cause excessive padding to
5442 be inserted at DATA_SEGMENT_RELRO_END. Try to start a
5443 bit lower so that the section alignments will fit in. */
5445 unsigned int max_alignment_power
= 0;
5447 /* Find maximum alignment power of sections between
5448 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5449 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5450 if (sec
->vma
>= expld
.dataseg
.base
5451 && sec
->vma
< expld
.dataseg
.relro_end
5452 && sec
->alignment_power
> max_alignment_power
)
5453 max_alignment_power
= sec
->alignment_power
;
5455 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5457 /* Aligning the adjusted base guarantees the padding
5458 between sections won't change. This is better than
5459 simply subtracting 1 << max_alignment_power which is
5460 what we used to do here. */
5461 expld
.dataseg
.base
&= ~((1 << max_alignment_power
) - 1);
5462 lang_reset_memory_regions ();
5463 one_lang_size_sections_pass (relax
, check_regions
);
5466 link_info
.relro_start
= expld
.dataseg
.base
;
5467 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5469 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5471 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5472 a page could be saved in the data segment. */
5473 bfd_vma first
, last
;
5475 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5476 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5478 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5479 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5480 && first
+ last
<= expld
.dataseg
.pagesize
)
5482 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5483 lang_reset_memory_regions ();
5484 one_lang_size_sections_pass (relax
, check_regions
);
5487 expld
.dataseg
.phase
= exp_dataseg_done
;
5490 expld
.dataseg
.phase
= exp_dataseg_done
;
5493 static lang_output_section_statement_type
*current_section
;
5494 static lang_assignment_statement_type
*current_assign
;
5495 static bfd_boolean prefer_next_section
;
5497 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5500 lang_do_assignments_1 (lang_statement_union_type
*s
,
5501 lang_output_section_statement_type
*current_os
,
5504 bfd_boolean
*found_end
)
5506 for (; s
!= NULL
; s
= s
->header
.next
)
5508 switch (s
->header
.type
)
5510 case lang_constructors_statement_enum
:
5511 dot
= lang_do_assignments_1 (constructor_list
.head
,
5512 current_os
, fill
, dot
, found_end
);
5515 case lang_output_section_statement_enum
:
5517 lang_output_section_statement_type
*os
;
5519 os
= &(s
->output_section_statement
);
5520 os
->after_end
= *found_end
;
5521 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5523 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5525 current_section
= os
;
5526 prefer_next_section
= FALSE
;
5528 dot
= os
->bfd_section
->vma
;
5530 lang_do_assignments_1 (os
->children
.head
,
5531 os
, os
->fill
, dot
, found_end
);
5533 /* .tbss sections effectively have zero size. */
5534 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5535 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5536 || link_info
.relocatable
)
5537 dot
+= TO_ADDR (os
->bfd_section
->size
);
5539 if (os
->update_dot_tree
!= NULL
)
5540 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5545 case lang_wild_statement_enum
:
5547 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5548 current_os
, fill
, dot
, found_end
);
5551 case lang_object_symbols_statement_enum
:
5552 case lang_output_statement_enum
:
5553 case lang_target_statement_enum
:
5556 case lang_data_statement_enum
:
5557 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5558 if (expld
.result
.valid_p
)
5560 s
->data_statement
.value
= expld
.result
.value
;
5561 if (expld
.result
.section
!= NULL
)
5562 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5565 einfo (_("%F%P: invalid data statement\n"));
5568 switch (s
->data_statement
.type
)
5586 if (size
< TO_SIZE ((unsigned) 1))
5587 size
= TO_SIZE ((unsigned) 1);
5588 dot
+= TO_ADDR (size
);
5592 case lang_reloc_statement_enum
:
5593 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5594 bfd_abs_section_ptr
, &dot
);
5595 if (expld
.result
.valid_p
)
5596 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5598 einfo (_("%F%P: invalid reloc statement\n"));
5599 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5602 case lang_input_section_enum
:
5604 asection
*in
= s
->input_section
.section
;
5606 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5607 dot
+= TO_ADDR (in
->size
);
5611 case lang_input_statement_enum
:
5614 case lang_fill_statement_enum
:
5615 fill
= s
->fill_statement
.fill
;
5618 case lang_assignment_statement_enum
:
5619 current_assign
= &s
->assignment_statement
;
5620 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5622 const char *p
= current_assign
->exp
->assign
.dst
;
5624 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5625 prefer_next_section
= TRUE
;
5629 if (strcmp (p
, "end") == 0)
5632 exp_fold_tree (s
->assignment_statement
.exp
,
5633 current_os
->bfd_section
,
5637 case lang_padding_statement_enum
:
5638 dot
+= TO_ADDR (s
->padding_statement
.size
);
5641 case lang_group_statement_enum
:
5642 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5643 current_os
, fill
, dot
, found_end
);
5646 case lang_insert_statement_enum
:
5649 case lang_address_statement_enum
:
5661 lang_do_assignments (lang_phase_type phase
)
5663 bfd_boolean found_end
= FALSE
;
5665 current_section
= NULL
;
5666 prefer_next_section
= FALSE
;
5667 expld
.phase
= phase
;
5668 lang_statement_iteration
++;
5669 lang_do_assignments_1 (statement_list
.head
,
5670 abs_output_section
, NULL
, 0, &found_end
);
5673 /* For an assignment statement outside of an output section statement,
5674 choose the best of neighbouring output sections to use for values
5678 section_for_dot (void)
5682 /* Assignments belong to the previous output section, unless there
5683 has been an assignment to "dot", in which case following
5684 assignments belong to the next output section. (The assumption
5685 is that an assignment to "dot" is setting up the address for the
5686 next output section.) Except that past the assignment to "_end"
5687 we always associate with the previous section. This exception is
5688 for targets like SH that define an alloc .stack or other
5689 weirdness after non-alloc sections. */
5690 if (current_section
== NULL
|| prefer_next_section
)
5692 lang_statement_union_type
*stmt
;
5693 lang_output_section_statement_type
*os
;
5695 for (stmt
= (lang_statement_union_type
*) current_assign
;
5697 stmt
= stmt
->header
.next
)
5698 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5701 os
= &stmt
->output_section_statement
;
5704 && (os
->bfd_section
== NULL
5705 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5706 || bfd_section_removed_from_list (link_info
.output_bfd
,
5710 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5713 s
= os
->bfd_section
;
5715 s
= link_info
.output_bfd
->section_last
;
5717 && ((s
->flags
& SEC_ALLOC
) == 0
5718 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5723 return bfd_abs_section_ptr
;
5727 s
= current_section
->bfd_section
;
5729 /* The section may have been stripped. */
5731 && ((s
->flags
& SEC_EXCLUDE
) != 0
5732 || (s
->flags
& SEC_ALLOC
) == 0
5733 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5734 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5737 s
= link_info
.output_bfd
->sections
;
5739 && ((s
->flags
& SEC_ALLOC
) == 0
5740 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5745 return bfd_abs_section_ptr
;
5748 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5749 operator .startof. (section_name), it produces an undefined symbol
5750 .startof.section_name. Similarly, when it sees
5751 .sizeof. (section_name), it produces an undefined symbol
5752 .sizeof.section_name. For all the output sections, we look for
5753 such symbols, and set them to the correct value. */
5756 lang_set_startof (void)
5760 if (link_info
.relocatable
)
5763 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5765 const char *secname
;
5767 struct bfd_link_hash_entry
*h
;
5769 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5770 buf
= (char *) xmalloc (10 + strlen (secname
));
5772 sprintf (buf
, ".startof.%s", secname
);
5773 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5774 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5776 h
->type
= bfd_link_hash_defined
;
5778 h
->u
.def
.section
= s
;
5781 sprintf (buf
, ".sizeof.%s", secname
);
5782 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5783 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5785 h
->type
= bfd_link_hash_defined
;
5786 h
->u
.def
.value
= TO_ADDR (s
->size
);
5787 h
->u
.def
.section
= bfd_abs_section_ptr
;
5797 struct bfd_link_hash_entry
*h
;
5800 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5801 || (link_info
.shared
&& !link_info
.executable
))
5802 warn
= entry_from_cmdline
;
5806 /* Force the user to specify a root when generating a relocatable with
5808 if (link_info
.gc_sections
&& link_info
.relocatable
5809 && !(entry_from_cmdline
|| undef_from_cmdline
))
5810 einfo (_("%P%F: gc-sections requires either an entry or "
5811 "an undefined symbol\n"));
5813 if (entry_symbol
.name
== NULL
)
5815 /* No entry has been specified. Look for the default entry, but
5816 don't warn if we don't find it. */
5817 entry_symbol
.name
= entry_symbol_default
;
5821 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5822 FALSE
, FALSE
, TRUE
);
5824 && (h
->type
== bfd_link_hash_defined
5825 || h
->type
== bfd_link_hash_defweak
)
5826 && h
->u
.def
.section
->output_section
!= NULL
)
5830 val
= (h
->u
.def
.value
5831 + bfd_get_section_vma (link_info
.output_bfd
,
5832 h
->u
.def
.section
->output_section
)
5833 + h
->u
.def
.section
->output_offset
);
5834 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5835 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5842 /* We couldn't find the entry symbol. Try parsing it as a
5844 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5847 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5848 einfo (_("%P%F: can't set start address\n"));
5854 /* Can't find the entry symbol, and it's not a number. Use
5855 the first address in the text section. */
5856 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5860 einfo (_("%P: warning: cannot find entry symbol %s;"
5861 " defaulting to %V\n"),
5863 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5864 if (!(bfd_set_start_address
5865 (link_info
.output_bfd
,
5866 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5867 einfo (_("%P%F: can't set start address\n"));
5872 einfo (_("%P: warning: cannot find entry symbol %s;"
5873 " not setting start address\n"),
5880 /* This is a small function used when we want to ignore errors from
5884 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5886 /* Don't do anything. */
5889 /* Check that the architecture of all the input files is compatible
5890 with the output file. Also call the backend to let it do any
5891 other checking that is needed. */
5896 lang_statement_union_type
*file
;
5898 const bfd_arch_info_type
*compatible
;
5900 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5902 #ifdef ENABLE_PLUGINS
5903 /* Don't check format of files claimed by plugin. */
5904 if (file
->input_statement
.flags
.claimed
)
5906 #endif /* ENABLE_PLUGINS */
5907 input_bfd
= file
->input_statement
.the_bfd
;
5909 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5910 command_line
.accept_unknown_input_arch
);
5912 /* In general it is not possible to perform a relocatable
5913 link between differing object formats when the input
5914 file has relocations, because the relocations in the
5915 input format may not have equivalent representations in
5916 the output format (and besides BFD does not translate
5917 relocs for other link purposes than a final link). */
5918 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5919 && (compatible
== NULL
5920 || (bfd_get_flavour (input_bfd
)
5921 != bfd_get_flavour (link_info
.output_bfd
)))
5922 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5924 einfo (_("%P%F: Relocatable linking with relocations from"
5925 " format %s (%B) to format %s (%B) is not supported\n"),
5926 bfd_get_target (input_bfd
), input_bfd
,
5927 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5928 /* einfo with %F exits. */
5931 if (compatible
== NULL
)
5933 if (command_line
.warn_mismatch
)
5934 einfo (_("%P%X: %s architecture of input file `%B'"
5935 " is incompatible with %s output\n"),
5936 bfd_printable_name (input_bfd
), input_bfd
,
5937 bfd_printable_name (link_info
.output_bfd
));
5939 else if (bfd_count_sections (input_bfd
))
5941 /* If the input bfd has no contents, it shouldn't set the
5942 private data of the output bfd. */
5944 bfd_error_handler_type pfn
= NULL
;
5946 /* If we aren't supposed to warn about mismatched input
5947 files, temporarily set the BFD error handler to a
5948 function which will do nothing. We still want to call
5949 bfd_merge_private_bfd_data, since it may set up
5950 information which is needed in the output file. */
5951 if (! command_line
.warn_mismatch
)
5952 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5953 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5955 if (command_line
.warn_mismatch
)
5956 einfo (_("%P%X: failed to merge target specific data"
5957 " of file %B\n"), input_bfd
);
5959 if (! command_line
.warn_mismatch
)
5960 bfd_set_error_handler (pfn
);
5965 /* Look through all the global common symbols and attach them to the
5966 correct section. The -sort-common command line switch may be used
5967 to roughly sort the entries by alignment. */
5972 if (command_line
.inhibit_common_definition
)
5974 if (link_info
.relocatable
5975 && ! command_line
.force_common_definition
)
5978 if (! config
.sort_common
)
5979 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5984 if (config
.sort_common
== sort_descending
)
5986 for (power
= 4; power
> 0; power
--)
5987 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5990 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5994 for (power
= 0; power
<= 4; power
++)
5995 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5998 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6003 /* Place one common symbol in the correct section. */
6006 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
6008 unsigned int power_of_two
;
6012 if (h
->type
!= bfd_link_hash_common
)
6016 power_of_two
= h
->u
.c
.p
->alignment_power
;
6018 if (config
.sort_common
== sort_descending
6019 && power_of_two
< *(unsigned int *) info
)
6021 else if (config
.sort_common
== sort_ascending
6022 && power_of_two
> *(unsigned int *) info
)
6025 section
= h
->u
.c
.p
->section
;
6026 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6027 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6030 if (config
.map_file
!= NULL
)
6032 static bfd_boolean header_printed
;
6037 if (! header_printed
)
6039 minfo (_("\nAllocating common symbols\n"));
6040 minfo (_("Common symbol size file\n\n"));
6041 header_printed
= TRUE
;
6044 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6045 DMGL_ANSI
| DMGL_PARAMS
);
6048 minfo ("%s", h
->root
.string
);
6049 len
= strlen (h
->root
.string
);
6054 len
= strlen (name
);
6070 if (size
<= 0xffffffff)
6071 sprintf (buf
, "%lx", (unsigned long) size
);
6073 sprintf_vma (buf
, size
);
6083 minfo ("%B\n", section
->owner
);
6089 /* Run through the input files and ensure that every input section has
6090 somewhere to go. If one is found without a destination then create
6091 an input request and place it into the statement tree. */
6094 lang_place_orphans (void)
6096 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6100 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6102 if (s
->output_section
== NULL
)
6104 /* This section of the file is not attached, root
6105 around for a sensible place for it to go. */
6107 if (file
->flags
.just_syms
)
6108 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6109 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
6110 s
->output_section
= bfd_abs_section_ptr
;
6111 else if (strcmp (s
->name
, "COMMON") == 0)
6113 /* This is a lonely common section which must have
6114 come from an archive. We attach to the section
6115 with the wildcard. */
6116 if (! link_info
.relocatable
6117 || command_line
.force_common_definition
)
6119 if (default_common_section
== NULL
)
6120 default_common_section
6121 = lang_output_section_statement_lookup (".bss", 0,
6123 lang_add_section (&default_common_section
->children
, s
,
6124 NULL
, default_common_section
);
6129 const char *name
= s
->name
;
6132 if (config
.unique_orphan_sections
6133 || unique_section_p (s
, NULL
))
6134 constraint
= SPECIAL
;
6136 if (!ldemul_place_orphan (s
, name
, constraint
))
6138 lang_output_section_statement_type
*os
;
6139 os
= lang_output_section_statement_lookup (name
,
6142 if (os
->addr_tree
== NULL
6143 && (link_info
.relocatable
6144 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6145 os
->addr_tree
= exp_intop (0);
6146 lang_add_section (&os
->children
, s
, NULL
, os
);
6155 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6157 flagword
*ptr_flags
;
6159 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6165 *ptr_flags
|= SEC_ALLOC
;
6169 *ptr_flags
|= SEC_READONLY
;
6173 *ptr_flags
|= SEC_DATA
;
6177 *ptr_flags
|= SEC_CODE
;
6182 *ptr_flags
|= SEC_LOAD
;
6186 einfo (_("%P%F: invalid syntax in flags\n"));
6193 /* Call a function on each input file. This function will be called
6194 on an archive, but not on the elements. */
6197 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6199 lang_input_statement_type
*f
;
6201 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6203 f
= (lang_input_statement_type
*) f
->next_real_file
)
6207 /* Call a function on each file. The function will be called on all
6208 the elements of an archive which are included in the link, but will
6209 not be called on the archive file itself. */
6212 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6214 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6221 ldlang_add_file (lang_input_statement_type
*entry
)
6223 lang_statement_append (&file_chain
,
6224 (lang_statement_union_type
*) entry
,
6227 /* The BFD linker needs to have a list of all input BFDs involved in
6229 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6230 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6232 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6233 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6234 entry
->the_bfd
->usrdata
= entry
;
6235 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6237 /* Look through the sections and check for any which should not be
6238 included in the link. We need to do this now, so that we can
6239 notice when the backend linker tries to report multiple
6240 definition errors for symbols which are in sections we aren't
6241 going to link. FIXME: It might be better to entirely ignore
6242 symbols which are defined in sections which are going to be
6243 discarded. This would require modifying the backend linker for
6244 each backend which might set the SEC_LINK_ONCE flag. If we do
6245 this, we should probably handle SEC_EXCLUDE in the same way. */
6247 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6251 lang_add_output (const char *name
, int from_script
)
6253 /* Make -o on command line override OUTPUT in script. */
6254 if (!had_output_filename
|| !from_script
)
6256 output_filename
= name
;
6257 had_output_filename
= TRUE
;
6270 for (l
= 0; l
< 32; l
++)
6272 if (i
>= (unsigned int) x
)
6280 lang_output_section_statement_type
*
6281 lang_enter_output_section_statement (const char *output_section_statement_name
,
6282 etree_type
*address_exp
,
6283 enum section_type sectype
,
6285 etree_type
*subalign
,
6288 int align_with_input
)
6290 lang_output_section_statement_type
*os
;
6292 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6294 current_section
= os
;
6296 if (os
->addr_tree
== NULL
)
6298 os
->addr_tree
= address_exp
;
6300 os
->sectype
= sectype
;
6301 if (sectype
!= noload_section
)
6302 os
->flags
= SEC_NO_FLAGS
;
6304 os
->flags
= SEC_NEVER_LOAD
;
6305 os
->block_value
= 1;
6307 /* Make next things chain into subchain of this. */
6308 push_stat_ptr (&os
->children
);
6310 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6311 if (os
->align_lma_with_input
&& align
!= NULL
)
6312 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"), NULL
);
6314 os
->subsection_alignment
=
6315 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6316 os
->section_alignment
=
6317 topower (exp_get_value_int (align
, -1, "section alignment"));
6319 os
->load_base
= ebase
;
6326 lang_output_statement_type
*new_stmt
;
6328 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6329 new_stmt
->name
= output_filename
;
6333 /* Reset the current counters in the regions. */
6336 lang_reset_memory_regions (void)
6338 lang_memory_region_type
*p
= lang_memory_region_list
;
6340 lang_output_section_statement_type
*os
;
6342 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6344 p
->current
= p
->origin
;
6348 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6352 os
->processed_vma
= FALSE
;
6353 os
->processed_lma
= FALSE
;
6356 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6358 /* Save the last size for possible use by bfd_relax_section. */
6359 o
->rawsize
= o
->size
;
6364 /* Worker for lang_gc_sections_1. */
6367 gc_section_callback (lang_wild_statement_type
*ptr
,
6368 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6370 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6371 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6372 void *data ATTRIBUTE_UNUSED
)
6374 /* If the wild pattern was marked KEEP, the member sections
6375 should be as well. */
6376 if (ptr
->keep_sections
)
6377 section
->flags
|= SEC_KEEP
;
6380 /* Iterate over sections marking them against GC. */
6383 lang_gc_sections_1 (lang_statement_union_type
*s
)
6385 for (; s
!= NULL
; s
= s
->header
.next
)
6387 switch (s
->header
.type
)
6389 case lang_wild_statement_enum
:
6390 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6392 case lang_constructors_statement_enum
:
6393 lang_gc_sections_1 (constructor_list
.head
);
6395 case lang_output_section_statement_enum
:
6396 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6398 case lang_group_statement_enum
:
6399 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6408 lang_gc_sections (void)
6410 /* Keep all sections so marked in the link script. */
6412 lang_gc_sections_1 (statement_list
.head
);
6414 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6415 the special case of debug info. (See bfd/stabs.c)
6416 Twiddle the flag here, to simplify later linker code. */
6417 if (link_info
.relocatable
)
6419 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6422 #ifdef ENABLE_PLUGINS
6423 if (f
->flags
.claimed
)
6426 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6427 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6428 sec
->flags
&= ~SEC_EXCLUDE
;
6432 if (link_info
.gc_sections
)
6433 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6436 /* Worker for lang_find_relro_sections_1. */
6439 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6440 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6442 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6443 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6446 /* Discarded, excluded and ignored sections effectively have zero
6448 if (section
->output_section
!= NULL
6449 && section
->output_section
->owner
== link_info
.output_bfd
6450 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6451 && !IGNORE_SECTION (section
)
6452 && section
->size
!= 0)
6454 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6455 *has_relro_section
= TRUE
;
6459 /* Iterate over sections for relro sections. */
6462 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6463 bfd_boolean
*has_relro_section
)
6465 if (*has_relro_section
)
6468 for (; s
!= NULL
; s
= s
->header
.next
)
6470 if (s
== expld
.dataseg
.relro_end_stat
)
6473 switch (s
->header
.type
)
6475 case lang_wild_statement_enum
:
6476 walk_wild (&s
->wild_statement
,
6477 find_relro_section_callback
,
6480 case lang_constructors_statement_enum
:
6481 lang_find_relro_sections_1 (constructor_list
.head
,
6484 case lang_output_section_statement_enum
:
6485 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6488 case lang_group_statement_enum
:
6489 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6499 lang_find_relro_sections (void)
6501 bfd_boolean has_relro_section
= FALSE
;
6503 /* Check all sections in the link script. */
6505 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6506 &has_relro_section
);
6508 if (!has_relro_section
)
6509 link_info
.relro
= FALSE
;
6512 /* Relax all sections until bfd_relax_section gives up. */
6515 lang_relax_sections (bfd_boolean need_layout
)
6517 if (RELAXATION_ENABLED
)
6519 /* We may need more than one relaxation pass. */
6520 int i
= link_info
.relax_pass
;
6522 /* The backend can use it to determine the current pass. */
6523 link_info
.relax_pass
= 0;
6527 /* Keep relaxing until bfd_relax_section gives up. */
6528 bfd_boolean relax_again
;
6530 link_info
.relax_trip
= -1;
6533 link_info
.relax_trip
++;
6535 /* Note: pe-dll.c does something like this also. If you find
6536 you need to change this code, you probably need to change
6537 pe-dll.c also. DJ */
6539 /* Do all the assignments with our current guesses as to
6541 lang_do_assignments (lang_assigning_phase_enum
);
6543 /* We must do this after lang_do_assignments, because it uses
6545 lang_reset_memory_regions ();
6547 /* Perform another relax pass - this time we know where the
6548 globals are, so can make a better guess. */
6549 relax_again
= FALSE
;
6550 lang_size_sections (&relax_again
, FALSE
);
6552 while (relax_again
);
6554 link_info
.relax_pass
++;
6561 /* Final extra sizing to report errors. */
6562 lang_do_assignments (lang_assigning_phase_enum
);
6563 lang_reset_memory_regions ();
6564 lang_size_sections (NULL
, TRUE
);
6568 #ifdef ENABLE_PLUGINS
6569 /* Find the insert point for the plugin's replacement files. We
6570 place them after the first claimed real object file, or if the
6571 first claimed object is an archive member, after the last real
6572 object file immediately preceding the archive. In the event
6573 no objects have been claimed at all, we return the first dummy
6574 object file on the list as the insert point; that works, but
6575 the callee must be careful when relinking the file_chain as it
6576 is not actually on that chain, only the statement_list and the
6577 input_file list; in that case, the replacement files must be
6578 inserted at the head of the file_chain. */
6580 static lang_input_statement_type
*
6581 find_replacements_insert_point (void)
6583 lang_input_statement_type
*claim1
, *lastobject
;
6584 lastobject
= &input_file_chain
.head
->input_statement
;
6585 for (claim1
= &file_chain
.head
->input_statement
;
6587 claim1
= &claim1
->next
->input_statement
)
6589 if (claim1
->flags
.claimed
)
6590 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6591 /* Update lastobject if this is a real object file. */
6592 if (claim1
->the_bfd
&& (claim1
->the_bfd
->my_archive
== NULL
))
6593 lastobject
= claim1
;
6595 /* No files were claimed by the plugin. Choose the last object
6596 file found on the list (maybe the first, dummy entry) as the
6601 /* Insert SRCLIST into DESTLIST after given element by chaining
6602 on FIELD as the next-pointer. (Counterintuitively does not need
6603 a pointer to the actual after-node itself, just its chain field.) */
6606 lang_list_insert_after (lang_statement_list_type
*destlist
,
6607 lang_statement_list_type
*srclist
,
6608 lang_statement_union_type
**field
)
6610 *(srclist
->tail
) = *field
;
6611 *field
= srclist
->head
;
6612 if (destlist
->tail
== field
)
6613 destlist
->tail
= srclist
->tail
;
6616 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6617 was taken as a copy of it and leave them in ORIGLIST. */
6620 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6621 lang_statement_list_type
*origlist
)
6623 union lang_statement_union
**savetail
;
6624 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6625 ASSERT (origlist
->head
== destlist
->head
);
6626 savetail
= origlist
->tail
;
6627 origlist
->head
= *(savetail
);
6628 origlist
->tail
= destlist
->tail
;
6629 destlist
->tail
= savetail
;
6632 #endif /* ENABLE_PLUGINS */
6637 /* Finalize dynamic list. */
6638 if (link_info
.dynamic_list
)
6639 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6641 current_target
= default_target
;
6643 /* Open the output file. */
6644 lang_for_each_statement (ldlang_open_output
);
6647 ldemul_create_output_section_statements ();
6649 /* Add to the hash table all undefineds on the command line. */
6650 lang_place_undefineds ();
6652 if (!bfd_section_already_linked_table_init ())
6653 einfo (_("%P%F: Failed to create hash table\n"));
6655 /* Create a bfd for each input file. */
6656 current_target
= default_target
;
6657 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6659 #ifdef ENABLE_PLUGINS
6660 if (plugin_active_plugins_p ())
6662 lang_statement_list_type added
;
6663 lang_statement_list_type files
, inputfiles
;
6665 /* Now all files are read, let the plugin(s) decide if there
6666 are any more to be added to the link before we call the
6667 emulation's after_open hook. We create a private list of
6668 input statements for this purpose, which we will eventually
6669 insert into the global statment list after the first claimed
6672 /* We need to manipulate all three chains in synchrony. */
6674 inputfiles
= input_file_chain
;
6675 if (plugin_call_all_symbols_read ())
6676 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6677 plugin_error_plugin ());
6678 /* Open any newly added files, updating the file chains. */
6679 link_info
.loading_lto_outputs
= TRUE
;
6680 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6681 /* Restore the global list pointer now they have all been added. */
6682 lang_list_remove_tail (stat_ptr
, &added
);
6683 /* And detach the fresh ends of the file lists. */
6684 lang_list_remove_tail (&file_chain
, &files
);
6685 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6686 /* Were any new files added? */
6687 if (added
.head
!= NULL
)
6689 /* If so, we will insert them into the statement list immediately
6690 after the first input file that was claimed by the plugin. */
6691 plugin_insert
= find_replacements_insert_point ();
6692 /* If a plugin adds input files without having claimed any, we
6693 don't really have a good idea where to place them. Just putting
6694 them at the start or end of the list is liable to leave them
6695 outside the crtbegin...crtend range. */
6696 ASSERT (plugin_insert
!= NULL
);
6697 /* Splice the new statement list into the old one. */
6698 lang_list_insert_after (stat_ptr
, &added
,
6699 &plugin_insert
->header
.next
);
6700 /* Likewise for the file chains. */
6701 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6702 &plugin_insert
->next_real_file
);
6703 /* We must be careful when relinking file_chain; we may need to
6704 insert the new files at the head of the list if the insert
6705 point chosen is the dummy first input file. */
6706 if (plugin_insert
->filename
)
6707 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6709 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6711 /* Rescan archives in case new undefined symbols have appeared. */
6712 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6715 #endif /* ENABLE_PLUGINS */
6717 link_info
.gc_sym_list
= &entry_symbol
;
6718 if (entry_symbol
.name
== NULL
)
6719 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6721 ldemul_after_open ();
6722 if (config
.map_file
!= NULL
)
6723 lang_print_asneeded ();
6725 bfd_section_already_linked_table_free ();
6727 /* Make sure that we're not mixing architectures. We call this
6728 after all the input files have been opened, but before we do any
6729 other processing, so that any operations merge_private_bfd_data
6730 does on the output file will be known during the rest of the
6734 /* Handle .exports instead of a version script if we're told to do so. */
6735 if (command_line
.version_exports_section
)
6736 lang_do_version_exports_section ();
6738 /* Build all sets based on the information gathered from the input
6740 ldctor_build_sets ();
6742 /* PR 13683: We must rerun the assignments prior to running garbage
6743 collection in order to make sure that all symbol aliases are resolved. */
6744 lang_do_assignments (lang_mark_phase_enum
);
6745 expld
.phase
= lang_first_phase_enum
;
6747 /* Remove unreferenced sections if asked to. */
6748 lang_gc_sections ();
6750 /* Size up the common data. */
6753 /* Update wild statements. */
6754 update_wild_statements (statement_list
.head
);
6756 /* Run through the contours of the script and attach input sections
6757 to the correct output sections. */
6758 lang_statement_iteration
++;
6759 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6761 process_insert_statements ();
6763 /* Find any sections not attached explicitly and handle them. */
6764 lang_place_orphans ();
6766 if (! link_info
.relocatable
)
6770 /* Merge SEC_MERGE sections. This has to be done after GC of
6771 sections, so that GCed sections are not merged, but before
6772 assigning dynamic symbols, since removing whole input sections
6774 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6776 /* Look for a text section and set the readonly attribute in it. */
6777 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6781 if (config
.text_read_only
)
6782 found
->flags
|= SEC_READONLY
;
6784 found
->flags
&= ~SEC_READONLY
;
6788 /* Do anything special before sizing sections. This is where ELF
6789 and other back-ends size dynamic sections. */
6790 ldemul_before_allocation ();
6792 /* We must record the program headers before we try to fix the
6793 section positions, since they will affect SIZEOF_HEADERS. */
6794 lang_record_phdrs ();
6796 /* Check relro sections. */
6797 if (link_info
.relro
&& ! link_info
.relocatable
)
6798 lang_find_relro_sections ();
6800 /* Size up the sections. */
6801 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6803 /* See if anything special should be done now we know how big
6804 everything is. This is where relaxation is done. */
6805 ldemul_after_allocation ();
6807 /* Fix any .startof. or .sizeof. symbols. */
6808 lang_set_startof ();
6810 /* Do all the assignments, now that we know the final resting places
6811 of all the symbols. */
6812 lang_do_assignments (lang_final_phase_enum
);
6816 /* Make sure that the section addresses make sense. */
6817 if (command_line
.check_section_addresses
)
6818 lang_check_section_addresses ();
6823 /* EXPORTED TO YACC */
6826 lang_add_wild (struct wildcard_spec
*filespec
,
6827 struct wildcard_list
*section_list
,
6828 bfd_boolean keep_sections
)
6830 struct wildcard_list
*curr
, *next
;
6831 lang_wild_statement_type
*new_stmt
;
6833 /* Reverse the list as the parser puts it back to front. */
6834 for (curr
= section_list
, section_list
= NULL
;
6836 section_list
= curr
, curr
= next
)
6838 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6839 placed_commons
= TRUE
;
6842 curr
->next
= section_list
;
6845 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6847 if (strcmp (filespec
->name
, "*") == 0)
6848 filespec
->name
= NULL
;
6849 else if (! wildcardp (filespec
->name
))
6850 lang_has_input_file
= TRUE
;
6853 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6854 new_stmt
->filename
= NULL
;
6855 new_stmt
->filenames_sorted
= FALSE
;
6856 new_stmt
->section_flag_list
= NULL
;
6857 if (filespec
!= NULL
)
6859 new_stmt
->filename
= filespec
->name
;
6860 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6861 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
6863 new_stmt
->section_list
= section_list
;
6864 new_stmt
->keep_sections
= keep_sections
;
6865 lang_list_init (&new_stmt
->children
);
6866 analyze_walk_wild_section_handler (new_stmt
);
6870 lang_section_start (const char *name
, etree_type
*address
,
6871 const segment_type
*segment
)
6873 lang_address_statement_type
*ad
;
6875 ad
= new_stat (lang_address_statement
, stat_ptr
);
6876 ad
->section_name
= name
;
6877 ad
->address
= address
;
6878 ad
->segment
= segment
;
6881 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6882 because of a -e argument on the command line, or zero if this is
6883 called by ENTRY in a linker script. Command line arguments take
6887 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6889 if (entry_symbol
.name
== NULL
6891 || ! entry_from_cmdline
)
6893 entry_symbol
.name
= name
;
6894 entry_from_cmdline
= cmdline
;
6898 /* Set the default start symbol to NAME. .em files should use this,
6899 not lang_add_entry, to override the use of "start" if neither the
6900 linker script nor the command line specifies an entry point. NAME
6901 must be permanently allocated. */
6903 lang_default_entry (const char *name
)
6905 entry_symbol_default
= name
;
6909 lang_add_target (const char *name
)
6911 lang_target_statement_type
*new_stmt
;
6913 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6914 new_stmt
->target
= name
;
6918 lang_add_map (const char *name
)
6925 map_option_f
= TRUE
;
6933 lang_add_fill (fill_type
*fill
)
6935 lang_fill_statement_type
*new_stmt
;
6937 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6938 new_stmt
->fill
= fill
;
6942 lang_add_data (int type
, union etree_union
*exp
)
6944 lang_data_statement_type
*new_stmt
;
6946 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6947 new_stmt
->exp
= exp
;
6948 new_stmt
->type
= type
;
6951 /* Create a new reloc statement. RELOC is the BFD relocation type to
6952 generate. HOWTO is the corresponding howto structure (we could
6953 look this up, but the caller has already done so). SECTION is the
6954 section to generate a reloc against, or NAME is the name of the
6955 symbol to generate a reloc against. Exactly one of SECTION and
6956 NAME must be NULL. ADDEND is an expression for the addend. */
6959 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6960 reloc_howto_type
*howto
,
6963 union etree_union
*addend
)
6965 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6969 p
->section
= section
;
6971 p
->addend_exp
= addend
;
6973 p
->addend_value
= 0;
6974 p
->output_section
= NULL
;
6975 p
->output_offset
= 0;
6978 lang_assignment_statement_type
*
6979 lang_add_assignment (etree_type
*exp
)
6981 lang_assignment_statement_type
*new_stmt
;
6983 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6984 new_stmt
->exp
= exp
;
6989 lang_add_attribute (enum statement_enum attribute
)
6991 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6995 lang_startup (const char *name
)
6997 if (first_file
->filename
!= NULL
)
6999 einfo (_("%P%F: multiple STARTUP files\n"));
7001 first_file
->filename
= name
;
7002 first_file
->local_sym_name
= name
;
7003 first_file
->flags
.real
= TRUE
;
7007 lang_float (bfd_boolean maybe
)
7009 lang_float_flag
= maybe
;
7013 /* Work out the load- and run-time regions from a script statement, and
7014 store them in *LMA_REGION and *REGION respectively.
7016 MEMSPEC is the name of the run-time region, or the value of
7017 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7018 LMA_MEMSPEC is the name of the load-time region, or null if the
7019 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7020 had an explicit load address.
7022 It is an error to specify both a load region and a load address. */
7025 lang_get_regions (lang_memory_region_type
**region
,
7026 lang_memory_region_type
**lma_region
,
7027 const char *memspec
,
7028 const char *lma_memspec
,
7029 bfd_boolean have_lma
,
7030 bfd_boolean have_vma
)
7032 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7034 /* If no runtime region or VMA has been specified, but the load region
7035 has been specified, then use the load region for the runtime region
7037 if (lma_memspec
!= NULL
7039 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7040 *region
= *lma_region
;
7042 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7044 if (have_lma
&& lma_memspec
!= 0)
7045 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7050 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7051 lang_output_section_phdr_list
*phdrs
,
7052 const char *lma_memspec
)
7054 lang_get_regions (¤t_section
->region
,
7055 ¤t_section
->lma_region
,
7056 memspec
, lma_memspec
,
7057 current_section
->load_base
!= NULL
,
7058 current_section
->addr_tree
!= NULL
);
7060 /* If this section has no load region or base, but uses the same
7061 region as the previous section, then propagate the previous
7062 section's load region. */
7064 if (current_section
->lma_region
== NULL
7065 && current_section
->load_base
== NULL
7066 && current_section
->addr_tree
== NULL
7067 && current_section
->region
== current_section
->prev
->region
)
7068 current_section
->lma_region
= current_section
->prev
->lma_region
;
7070 current_section
->fill
= fill
;
7071 current_section
->phdrs
= phdrs
;
7076 lang_statement_append (lang_statement_list_type
*list
,
7077 lang_statement_union_type
*element
,
7078 lang_statement_union_type
**field
)
7080 *(list
->tail
) = element
;
7084 /* Set the output format type. -oformat overrides scripts. */
7087 lang_add_output_format (const char *format
,
7092 if (output_target
== NULL
|| !from_script
)
7094 if (command_line
.endian
== ENDIAN_BIG
7097 else if (command_line
.endian
== ENDIAN_LITTLE
7101 output_target
= format
;
7106 lang_add_insert (const char *where
, int is_before
)
7108 lang_insert_statement_type
*new_stmt
;
7110 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7111 new_stmt
->where
= where
;
7112 new_stmt
->is_before
= is_before
;
7113 saved_script_handle
= previous_script_handle
;
7116 /* Enter a group. This creates a new lang_group_statement, and sets
7117 stat_ptr to build new statements within the group. */
7120 lang_enter_group (void)
7122 lang_group_statement_type
*g
;
7124 g
= new_stat (lang_group_statement
, stat_ptr
);
7125 lang_list_init (&g
->children
);
7126 push_stat_ptr (&g
->children
);
7129 /* Leave a group. This just resets stat_ptr to start writing to the
7130 regular list of statements again. Note that this will not work if
7131 groups can occur inside anything else which can adjust stat_ptr,
7132 but currently they can't. */
7135 lang_leave_group (void)
7140 /* Add a new program header. This is called for each entry in a PHDRS
7141 command in a linker script. */
7144 lang_new_phdr (const char *name
,
7146 bfd_boolean filehdr
,
7151 struct lang_phdr
*n
, **pp
;
7154 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7157 n
->type
= exp_get_value_int (type
, 0, "program header type");
7158 n
->filehdr
= filehdr
;
7163 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7165 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7168 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7170 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7171 " when prior PT_LOAD headers lack them\n"), NULL
);
7178 /* Record the program header information in the output BFD. FIXME: We
7179 should not be calling an ELF specific function here. */
7182 lang_record_phdrs (void)
7186 lang_output_section_phdr_list
*last
;
7187 struct lang_phdr
*l
;
7188 lang_output_section_statement_type
*os
;
7191 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7194 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7201 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7205 lang_output_section_phdr_list
*pl
;
7207 if (os
->constraint
< 0)
7215 if (os
->sectype
== noload_section
7216 || os
->bfd_section
== NULL
7217 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7220 /* Don't add orphans to PT_INTERP header. */
7226 lang_output_section_statement_type
* tmp_os
;
7228 /* If we have not run across a section with a program
7229 header assigned to it yet, then scan forwards to find
7230 one. This prevents inconsistencies in the linker's
7231 behaviour when a script has specified just a single
7232 header and there are sections in that script which are
7233 not assigned to it, and which occur before the first
7234 use of that header. See here for more details:
7235 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7236 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7239 last
= tmp_os
->phdrs
;
7243 einfo (_("%F%P: no sections assigned to phdrs\n"));
7248 if (os
->bfd_section
== NULL
)
7251 for (; pl
!= NULL
; pl
= pl
->next
)
7253 if (strcmp (pl
->name
, l
->name
) == 0)
7258 secs
= (asection
**) xrealloc (secs
,
7259 alc
* sizeof (asection
*));
7261 secs
[c
] = os
->bfd_section
;
7268 if (l
->flags
== NULL
)
7271 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7276 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7278 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7279 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7280 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7281 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7286 /* Make sure all the phdr assignments succeeded. */
7287 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7291 lang_output_section_phdr_list
*pl
;
7293 if (os
->constraint
< 0
7294 || os
->bfd_section
== NULL
)
7297 for (pl
= os
->phdrs
;
7300 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7301 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7302 os
->name
, pl
->name
);
7306 /* Record a list of sections which may not be cross referenced. */
7309 lang_add_nocrossref (lang_nocrossref_type
*l
)
7311 struct lang_nocrossrefs
*n
;
7313 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7314 n
->next
= nocrossref_list
;
7316 nocrossref_list
= n
;
7318 /* Set notice_all so that we get informed about all symbols. */
7319 link_info
.notice_all
= TRUE
;
7322 /* Overlay handling. We handle overlays with some static variables. */
7324 /* The overlay virtual address. */
7325 static etree_type
*overlay_vma
;
7326 /* And subsection alignment. */
7327 static etree_type
*overlay_subalign
;
7329 /* An expression for the maximum section size seen so far. */
7330 static etree_type
*overlay_max
;
7332 /* A list of all the sections in this overlay. */
7334 struct overlay_list
{
7335 struct overlay_list
*next
;
7336 lang_output_section_statement_type
*os
;
7339 static struct overlay_list
*overlay_list
;
7341 /* Start handling an overlay. */
7344 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7346 /* The grammar should prevent nested overlays from occurring. */
7347 ASSERT (overlay_vma
== NULL
7348 && overlay_subalign
== NULL
7349 && overlay_max
== NULL
);
7351 overlay_vma
= vma_expr
;
7352 overlay_subalign
= subalign
;
7355 /* Start a section in an overlay. We handle this by calling
7356 lang_enter_output_section_statement with the correct VMA.
7357 lang_leave_overlay sets up the LMA and memory regions. */
7360 lang_enter_overlay_section (const char *name
)
7362 struct overlay_list
*n
;
7365 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7366 0, overlay_subalign
, 0, 0, 0);
7368 /* If this is the first section, then base the VMA of future
7369 sections on this one. This will work correctly even if `.' is
7370 used in the addresses. */
7371 if (overlay_list
== NULL
)
7372 overlay_vma
= exp_nameop (ADDR
, name
);
7374 /* Remember the section. */
7375 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7376 n
->os
= current_section
;
7377 n
->next
= overlay_list
;
7380 size
= exp_nameop (SIZEOF
, name
);
7382 /* Arrange to work out the maximum section end address. */
7383 if (overlay_max
== NULL
)
7386 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7389 /* Finish a section in an overlay. There isn't any special to do
7393 lang_leave_overlay_section (fill_type
*fill
,
7394 lang_output_section_phdr_list
*phdrs
)
7401 name
= current_section
->name
;
7403 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7404 region and that no load-time region has been specified. It doesn't
7405 really matter what we say here, since lang_leave_overlay will
7407 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7409 /* Define the magic symbols. */
7411 clean
= (char *) xmalloc (strlen (name
) + 1);
7413 for (s1
= name
; *s1
!= '\0'; s1
++)
7414 if (ISALNUM (*s1
) || *s1
== '_')
7418 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7419 sprintf (buf
, "__load_start_%s", clean
);
7420 lang_add_assignment (exp_provide (buf
,
7421 exp_nameop (LOADADDR
, name
),
7424 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7425 sprintf (buf
, "__load_stop_%s", clean
);
7426 lang_add_assignment (exp_provide (buf
,
7428 exp_nameop (LOADADDR
, name
),
7429 exp_nameop (SIZEOF
, name
)),
7435 /* Finish an overlay. If there are any overlay wide settings, this
7436 looks through all the sections in the overlay and sets them. */
7439 lang_leave_overlay (etree_type
*lma_expr
,
7442 const char *memspec
,
7443 lang_output_section_phdr_list
*phdrs
,
7444 const char *lma_memspec
)
7446 lang_memory_region_type
*region
;
7447 lang_memory_region_type
*lma_region
;
7448 struct overlay_list
*l
;
7449 lang_nocrossref_type
*nocrossref
;
7451 lang_get_regions (®ion
, &lma_region
,
7452 memspec
, lma_memspec
,
7453 lma_expr
!= NULL
, FALSE
);
7457 /* After setting the size of the last section, set '.' to end of the
7459 if (overlay_list
!= NULL
)
7461 overlay_list
->os
->update_dot
= 1;
7462 overlay_list
->os
->update_dot_tree
7463 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
7469 struct overlay_list
*next
;
7471 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7474 l
->os
->region
= region
;
7475 l
->os
->lma_region
= lma_region
;
7477 /* The first section has the load address specified in the
7478 OVERLAY statement. The rest are worked out from that.
7479 The base address is not needed (and should be null) if
7480 an LMA region was specified. */
7483 l
->os
->load_base
= lma_expr
;
7484 l
->os
->sectype
= normal_section
;
7486 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7487 l
->os
->phdrs
= phdrs
;
7491 lang_nocrossref_type
*nc
;
7493 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7494 nc
->name
= l
->os
->name
;
7495 nc
->next
= nocrossref
;
7504 if (nocrossref
!= NULL
)
7505 lang_add_nocrossref (nocrossref
);
7508 overlay_list
= NULL
;
7512 /* Version handling. This is only useful for ELF. */
7514 /* If PREV is NULL, return first version pattern matching particular symbol.
7515 If PREV is non-NULL, return first version pattern matching particular
7516 symbol after PREV (previously returned by lang_vers_match). */
7518 static struct bfd_elf_version_expr
*
7519 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7520 struct bfd_elf_version_expr
*prev
,
7524 const char *cxx_sym
= sym
;
7525 const char *java_sym
= sym
;
7526 struct bfd_elf_version_expr
*expr
= NULL
;
7527 enum demangling_styles curr_style
;
7529 curr_style
= CURRENT_DEMANGLING_STYLE
;
7530 cplus_demangle_set_style (no_demangling
);
7531 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7534 cplus_demangle_set_style (curr_style
);
7536 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7538 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7539 DMGL_PARAMS
| DMGL_ANSI
);
7543 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7545 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7550 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7552 struct bfd_elf_version_expr e
;
7554 switch (prev
? prev
->mask
: 0)
7557 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7560 expr
= (struct bfd_elf_version_expr
*)
7561 htab_find ((htab_t
) head
->htab
, &e
);
7562 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7563 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7569 case BFD_ELF_VERSION_C_TYPE
:
7570 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7572 e
.pattern
= cxx_sym
;
7573 expr
= (struct bfd_elf_version_expr
*)
7574 htab_find ((htab_t
) head
->htab
, &e
);
7575 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7576 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7582 case BFD_ELF_VERSION_CXX_TYPE
:
7583 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7585 e
.pattern
= java_sym
;
7586 expr
= (struct bfd_elf_version_expr
*)
7587 htab_find ((htab_t
) head
->htab
, &e
);
7588 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7589 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7600 /* Finally, try the wildcards. */
7601 if (prev
== NULL
|| prev
->literal
)
7602 expr
= head
->remaining
;
7605 for (; expr
; expr
= expr
->next
)
7612 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7615 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7617 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7621 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7627 free ((char *) c_sym
);
7629 free ((char *) cxx_sym
);
7630 if (java_sym
!= sym
)
7631 free ((char *) java_sym
);
7635 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7636 return a pointer to the symbol name with any backslash quotes removed. */
7639 realsymbol (const char *pattern
)
7642 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7643 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7645 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7647 /* It is a glob pattern only if there is no preceding
7651 /* Remove the preceding backslash. */
7658 if (*p
== '?' || *p
== '*' || *p
== '[')
7665 backslash
= *p
== '\\';
7681 /* This is called for each variable name or match expression. NEW_NAME is
7682 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7683 pattern to be matched against symbol names. */
7685 struct bfd_elf_version_expr
*
7686 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7687 const char *new_name
,
7689 bfd_boolean literal_p
)
7691 struct bfd_elf_version_expr
*ret
;
7693 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7697 ret
->literal
= TRUE
;
7698 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7699 if (ret
->pattern
== NULL
)
7701 ret
->pattern
= new_name
;
7702 ret
->literal
= FALSE
;
7705 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7706 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7707 else if (strcasecmp (lang
, "C++") == 0)
7708 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7709 else if (strcasecmp (lang
, "Java") == 0)
7710 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7713 einfo (_("%X%P: unknown language `%s' in version information\n"),
7715 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7718 return ldemul_new_vers_pattern (ret
);
7721 /* This is called for each set of variable names and match
7724 struct bfd_elf_version_tree
*
7725 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7726 struct bfd_elf_version_expr
*locals
)
7728 struct bfd_elf_version_tree
*ret
;
7730 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7731 ret
->globals
.list
= globals
;
7732 ret
->locals
.list
= locals
;
7733 ret
->match
= lang_vers_match
;
7734 ret
->name_indx
= (unsigned int) -1;
7738 /* This static variable keeps track of version indices. */
7740 static int version_index
;
7743 version_expr_head_hash (const void *p
)
7745 const struct bfd_elf_version_expr
*e
=
7746 (const struct bfd_elf_version_expr
*) p
;
7748 return htab_hash_string (e
->pattern
);
7752 version_expr_head_eq (const void *p1
, const void *p2
)
7754 const struct bfd_elf_version_expr
*e1
=
7755 (const struct bfd_elf_version_expr
*) p1
;
7756 const struct bfd_elf_version_expr
*e2
=
7757 (const struct bfd_elf_version_expr
*) p2
;
7759 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7763 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7766 struct bfd_elf_version_expr
*e
, *next
;
7767 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7769 for (e
= head
->list
; e
; e
= e
->next
)
7773 head
->mask
|= e
->mask
;
7778 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7779 version_expr_head_eq
, NULL
);
7780 list_loc
= &head
->list
;
7781 remaining_loc
= &head
->remaining
;
7782 for (e
= head
->list
; e
; e
= next
)
7788 remaining_loc
= &e
->next
;
7792 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7796 struct bfd_elf_version_expr
*e1
, *last
;
7798 e1
= (struct bfd_elf_version_expr
*) *loc
;
7802 if (e1
->mask
== e
->mask
)
7810 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7814 /* This is a duplicate. */
7815 /* FIXME: Memory leak. Sometimes pattern is not
7816 xmalloced alone, but in larger chunk of memory. */
7817 /* free (e->pattern); */
7822 e
->next
= last
->next
;
7830 list_loc
= &e
->next
;
7834 *remaining_loc
= NULL
;
7835 *list_loc
= head
->remaining
;
7838 head
->remaining
= head
->list
;
7841 /* This is called when we know the name and dependencies of the
7845 lang_register_vers_node (const char *name
,
7846 struct bfd_elf_version_tree
*version
,
7847 struct bfd_elf_version_deps
*deps
)
7849 struct bfd_elf_version_tree
*t
, **pp
;
7850 struct bfd_elf_version_expr
*e1
;
7855 if (link_info
.version_info
!= NULL
7856 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
7858 einfo (_("%X%P: anonymous version tag cannot be combined"
7859 " with other version tags\n"));
7864 /* Make sure this node has a unique name. */
7865 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7866 if (strcmp (t
->name
, name
) == 0)
7867 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7869 lang_finalize_version_expr_head (&version
->globals
);
7870 lang_finalize_version_expr_head (&version
->locals
);
7872 /* Check the global and local match names, and make sure there
7873 aren't any duplicates. */
7875 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7877 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7879 struct bfd_elf_version_expr
*e2
;
7881 if (t
->locals
.htab
&& e1
->literal
)
7883 e2
= (struct bfd_elf_version_expr
*)
7884 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7885 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7887 if (e1
->mask
== e2
->mask
)
7888 einfo (_("%X%P: duplicate expression `%s'"
7889 " in version information\n"), e1
->pattern
);
7893 else if (!e1
->literal
)
7894 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7895 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7896 && e1
->mask
== e2
->mask
)
7897 einfo (_("%X%P: duplicate expression `%s'"
7898 " in version information\n"), e1
->pattern
);
7902 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7904 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7906 struct bfd_elf_version_expr
*e2
;
7908 if (t
->globals
.htab
&& e1
->literal
)
7910 e2
= (struct bfd_elf_version_expr
*)
7911 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7912 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7914 if (e1
->mask
== e2
->mask
)
7915 einfo (_("%X%P: duplicate expression `%s'"
7916 " in version information\n"),
7921 else if (!e1
->literal
)
7922 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7923 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7924 && e1
->mask
== e2
->mask
)
7925 einfo (_("%X%P: duplicate expression `%s'"
7926 " in version information\n"), e1
->pattern
);
7930 version
->deps
= deps
;
7931 version
->name
= name
;
7932 if (name
[0] != '\0')
7935 version
->vernum
= version_index
;
7938 version
->vernum
= 0;
7940 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7945 /* This is called when we see a version dependency. */
7947 struct bfd_elf_version_deps
*
7948 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7950 struct bfd_elf_version_deps
*ret
;
7951 struct bfd_elf_version_tree
*t
;
7953 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7956 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7958 if (strcmp (t
->name
, name
) == 0)
7960 ret
->version_needed
= t
;
7965 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7967 ret
->version_needed
= NULL
;
7972 lang_do_version_exports_section (void)
7974 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7976 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7978 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7986 contents
= (char *) xmalloc (len
);
7987 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7988 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7991 while (p
< contents
+ len
)
7993 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7994 p
= strchr (p
, '\0') + 1;
7997 /* Do not free the contents, as we used them creating the regex. */
7999 /* Do not include this section in the link. */
8000 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
8003 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
8004 lang_register_vers_node (command_line
.version_exports_section
,
8005 lang_new_vers_node (greg
, lreg
), NULL
);
8009 lang_add_unique (const char *name
)
8011 struct unique_sections
*ent
;
8013 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8014 if (strcmp (ent
->name
, name
) == 0)
8017 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8018 ent
->name
= xstrdup (name
);
8019 ent
->next
= unique_section_list
;
8020 unique_section_list
= ent
;
8023 /* Append the list of dynamic symbols to the existing one. */
8026 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8028 if (link_info
.dynamic_list
)
8030 struct bfd_elf_version_expr
*tail
;
8031 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8033 tail
->next
= link_info
.dynamic_list
->head
.list
;
8034 link_info
.dynamic_list
->head
.list
= dynamic
;
8038 struct bfd_elf_dynamic_list
*d
;
8040 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8041 d
->head
.list
= dynamic
;
8042 d
->match
= lang_vers_match
;
8043 link_info
.dynamic_list
= d
;
8047 /* Append the list of C++ typeinfo dynamic symbols to the existing
8051 lang_append_dynamic_list_cpp_typeinfo (void)
8053 const char * symbols
[] =
8055 "typeinfo name for*",
8058 struct bfd_elf_version_expr
*dynamic
= NULL
;
8061 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8062 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8065 lang_append_dynamic_list (dynamic
);
8068 /* Append the list of C++ operator new and delete dynamic symbols to the
8072 lang_append_dynamic_list_cpp_new (void)
8074 const char * symbols
[] =
8079 struct bfd_elf_version_expr
*dynamic
= NULL
;
8082 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8083 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8086 lang_append_dynamic_list (dynamic
);
8089 /* Scan a space and/or comma separated string of features. */
8092 lang_ld_feature (char *str
)
8100 while (*p
== ',' || ISSPACE (*p
))
8105 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8109 if (strcasecmp (p
, "SANE_EXPR") == 0)
8110 config
.sane_expr
= TRUE
;
8112 einfo (_("%X%P: unknown feature `%s'\n"), p
);