1 /* Linker command language support.
2 Copyright 1991-2013 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
;
71 /* Forward declarations. */
72 static void exp_init_os (etree_type
*);
73 static lang_input_statement_type
*lookup_name (const char *);
74 static struct bfd_hash_entry
*lang_definedness_newfunc
75 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
76 static void insert_undefined (const char *);
77 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
78 static void print_statement (lang_statement_union_type
*,
79 lang_output_section_statement_type
*);
80 static void print_statement_list (lang_statement_union_type
*,
81 lang_output_section_statement_type
*);
82 static void print_statements (void);
83 static void print_input_section (asection
*, bfd_boolean
);
84 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
85 static void lang_record_phdrs (void);
86 static void lang_do_version_exports_section (void);
87 static void lang_finalize_version_expr_head
88 (struct bfd_elf_version_expr_head
*);
90 /* Exported variables. */
91 const char *output_target
;
92 lang_output_section_statement_type
*abs_output_section
;
93 lang_statement_list_type lang_output_section_statement
;
94 lang_statement_list_type
*stat_ptr
= &statement_list
;
95 lang_statement_list_type file_chain
= { NULL
, NULL
};
96 lang_statement_list_type input_file_chain
;
97 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
98 const char *entry_section
= ".text";
99 struct lang_input_statement_flags input_flags
;
100 bfd_boolean entry_from_cmdline
;
101 bfd_boolean undef_from_cmdline
;
102 bfd_boolean lang_has_input_file
= FALSE
;
103 bfd_boolean had_output_filename
= FALSE
;
104 bfd_boolean lang_float_flag
= FALSE
;
105 bfd_boolean delete_output_file_on_failure
= FALSE
;
106 struct lang_phdr
*lang_phdr_list
;
107 struct lang_nocrossrefs
*nocrossref_list
;
109 /* Functions that traverse the linker script and might evaluate
110 DEFINED() need to increment this. */
111 int lang_statement_iteration
= 0;
113 etree_type
*base
; /* Relocation base - or null */
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
;
1064 if (file_type
== lang_input_file_is_l_enum
1065 && name
[0] == ':' && name
[1] != '\0')
1067 file_type
= lang_input_file_is_search_file_enum
;
1073 case lang_input_file_is_symbols_only_enum
:
1075 p
->local_sym_name
= name
;
1076 p
->flags
.real
= TRUE
;
1077 p
->flags
.just_syms
= TRUE
;
1079 case lang_input_file_is_fake_enum
:
1081 p
->local_sym_name
= name
;
1083 case lang_input_file_is_l_enum
:
1085 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1086 p
->flags
.maybe_archive
= TRUE
;
1087 p
->flags
.real
= TRUE
;
1088 p
->flags
.search_dirs
= TRUE
;
1090 case lang_input_file_is_marker_enum
:
1092 p
->local_sym_name
= name
;
1093 p
->flags
.search_dirs
= TRUE
;
1095 case lang_input_file_is_search_file_enum
:
1097 p
->local_sym_name
= name
;
1098 p
->flags
.real
= TRUE
;
1099 p
->flags
.search_dirs
= TRUE
;
1101 case lang_input_file_is_file_enum
:
1103 p
->local_sym_name
= name
;
1104 p
->flags
.real
= TRUE
;
1110 lang_statement_append (&input_file_chain
,
1111 (lang_statement_union_type
*) p
,
1112 &p
->next_real_file
);
1116 lang_input_statement_type
*
1117 lang_add_input_file (const char *name
,
1118 lang_input_file_enum_type file_type
,
1121 return new_afile (name
, file_type
, target
, TRUE
);
1124 struct out_section_hash_entry
1126 struct bfd_hash_entry root
;
1127 lang_statement_union_type s
;
1130 /* The hash table. */
1132 static struct bfd_hash_table output_section_statement_table
;
1134 /* Support routines for the hash table used by lang_output_section_find,
1135 initialize the table, fill in an entry and remove the table. */
1137 static struct bfd_hash_entry
*
1138 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1139 struct bfd_hash_table
*table
,
1142 lang_output_section_statement_type
**nextp
;
1143 struct out_section_hash_entry
*ret
;
1147 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1153 entry
= bfd_hash_newfunc (entry
, table
, string
);
1157 ret
= (struct out_section_hash_entry
*) entry
;
1158 memset (&ret
->s
, 0, sizeof (ret
->s
));
1159 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1160 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1161 ret
->s
.output_section_statement
.section_alignment
= -1;
1162 ret
->s
.output_section_statement
.block_value
= 1;
1163 lang_list_init (&ret
->s
.output_section_statement
.children
);
1164 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1166 /* For every output section statement added to the list, except the
1167 first one, lang_output_section_statement.tail points to the "next"
1168 field of the last element of the list. */
1169 if (lang_output_section_statement
.head
!= NULL
)
1170 ret
->s
.output_section_statement
.prev
1171 = ((lang_output_section_statement_type
*)
1172 ((char *) lang_output_section_statement
.tail
1173 - offsetof (lang_output_section_statement_type
, next
)));
1175 /* GCC's strict aliasing rules prevent us from just casting the
1176 address, so we store the pointer in a variable and cast that
1178 nextp
= &ret
->s
.output_section_statement
.next
;
1179 lang_statement_append (&lang_output_section_statement
,
1181 (lang_statement_union_type
**) nextp
);
1186 output_section_statement_table_init (void)
1188 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1189 output_section_statement_newfunc
,
1190 sizeof (struct out_section_hash_entry
),
1192 einfo (_("%P%F: can not create hash table: %E\n"));
1196 output_section_statement_table_free (void)
1198 bfd_hash_table_free (&output_section_statement_table
);
1201 /* Build enough state so that the parser can build its tree. */
1206 obstack_begin (&stat_obstack
, 1000);
1208 stat_ptr
= &statement_list
;
1210 output_section_statement_table_init ();
1212 lang_list_init (stat_ptr
);
1214 lang_list_init (&input_file_chain
);
1215 lang_list_init (&lang_output_section_statement
);
1216 lang_list_init (&file_chain
);
1217 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1219 abs_output_section
=
1220 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1222 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1224 /* The value "3" is ad-hoc, somewhat related to the expected number of
1225 DEFINED expressions in a linker script. For most default linker
1226 scripts, there are none. Why a hash table then? Well, it's somewhat
1227 simpler to re-use working machinery than using a linked list in terms
1228 of code-complexity here in ld, besides the initialization which just
1229 looks like other code here. */
1230 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1231 lang_definedness_newfunc
,
1232 sizeof (struct lang_definedness_hash_entry
),
1234 einfo (_("%P%F: can not create hash table: %E\n"));
1240 bfd_link_hash_table_free (link_info
.output_bfd
, link_info
.hash
);
1241 bfd_hash_table_free (&lang_definedness_table
);
1242 output_section_statement_table_free ();
1245 /*----------------------------------------------------------------------
1246 A region is an area of memory declared with the
1247 MEMORY { name:org=exp, len=exp ... }
1250 We maintain a list of all the regions here.
1252 If no regions are specified in the script, then the default is used
1253 which is created when looked up to be the entire data space.
1255 If create is true we are creating a region inside a MEMORY block.
1256 In this case it is probably an error to create a region that has
1257 already been created. If we are not inside a MEMORY block it is
1258 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1259 and so we issue a warning.
1261 Each region has at least one name. The first name is either
1262 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1263 alias names to an existing region within a script with
1264 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1267 static lang_memory_region_type
*lang_memory_region_list
;
1268 static lang_memory_region_type
**lang_memory_region_list_tail
1269 = &lang_memory_region_list
;
1271 lang_memory_region_type
*
1272 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1274 lang_memory_region_name
*n
;
1275 lang_memory_region_type
*r
;
1276 lang_memory_region_type
*new_region
;
1278 /* NAME is NULL for LMA memspecs if no region was specified. */
1282 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1283 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1284 if (strcmp (n
->name
, name
) == 0)
1287 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1292 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1293 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1296 new_region
= (lang_memory_region_type
*)
1297 stat_alloc (sizeof (lang_memory_region_type
));
1299 new_region
->name_list
.name
= xstrdup (name
);
1300 new_region
->name_list
.next
= NULL
;
1301 new_region
->next
= NULL
;
1302 new_region
->origin
= 0;
1303 new_region
->length
= ~(bfd_size_type
) 0;
1304 new_region
->current
= 0;
1305 new_region
->last_os
= NULL
;
1306 new_region
->flags
= 0;
1307 new_region
->not_flags
= 0;
1308 new_region
->had_full_message
= FALSE
;
1310 *lang_memory_region_list_tail
= new_region
;
1311 lang_memory_region_list_tail
= &new_region
->next
;
1317 lang_memory_region_alias (const char * alias
, const char * region_name
)
1319 lang_memory_region_name
* n
;
1320 lang_memory_region_type
* r
;
1321 lang_memory_region_type
* region
;
1323 /* The default region must be unique. This ensures that it is not necessary
1324 to iterate through the name list if someone wants the check if a region is
1325 the default memory region. */
1326 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1327 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1328 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL
);
1330 /* Look for the target region and check if the alias is not already
1333 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1334 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1336 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1338 if (strcmp (n
->name
, alias
) == 0)
1339 einfo (_("%F%P:%S: error: redefinition of memory region "
1344 /* Check if the target region exists. */
1346 einfo (_("%F%P:%S: error: memory region `%s' "
1347 "for alias `%s' does not exist\n"),
1348 NULL
, region_name
, alias
);
1350 /* Add alias to region name list. */
1351 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1352 n
->name
= xstrdup (alias
);
1353 n
->next
= region
->name_list
.next
;
1354 region
->name_list
.next
= n
;
1357 static lang_memory_region_type
*
1358 lang_memory_default (asection
* section
)
1360 lang_memory_region_type
*p
;
1362 flagword sec_flags
= section
->flags
;
1364 /* Override SEC_DATA to mean a writable section. */
1365 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1366 sec_flags
|= SEC_DATA
;
1368 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1370 if ((p
->flags
& sec_flags
) != 0
1371 && (p
->not_flags
& sec_flags
) == 0)
1376 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1379 /* Get the output section statement directly from the userdata. */
1381 lang_output_section_statement_type
*
1382 lang_output_section_get (const asection
*output_section
)
1384 return get_userdata (output_section
);
1387 /* Find or create an output_section_statement with the given NAME.
1388 If CONSTRAINT is non-zero match one with that constraint, otherwise
1389 match any non-negative constraint. If CREATE, always make a
1390 new output_section_statement for SPECIAL CONSTRAINT. */
1392 lang_output_section_statement_type
*
1393 lang_output_section_statement_lookup (const char *name
,
1397 struct out_section_hash_entry
*entry
;
1399 entry
= ((struct out_section_hash_entry
*)
1400 bfd_hash_lookup (&output_section_statement_table
, name
,
1405 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1409 if (entry
->s
.output_section_statement
.name
!= NULL
)
1411 /* We have a section of this name, but it might not have the correct
1413 struct out_section_hash_entry
*last_ent
;
1415 name
= entry
->s
.output_section_statement
.name
;
1416 if (create
&& constraint
== SPECIAL
)
1417 /* Not traversing to the end reverses the order of the second
1418 and subsequent SPECIAL sections in the hash table chain,
1419 but that shouldn't matter. */
1424 if (constraint
== entry
->s
.output_section_statement
.constraint
1426 && entry
->s
.output_section_statement
.constraint
>= 0))
1427 return &entry
->s
.output_section_statement
;
1429 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1431 while (entry
!= NULL
1432 && name
== entry
->s
.output_section_statement
.name
);
1438 = ((struct out_section_hash_entry
*)
1439 output_section_statement_newfunc (NULL
,
1440 &output_section_statement_table
,
1444 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1447 entry
->root
= last_ent
->root
;
1448 last_ent
->root
.next
= &entry
->root
;
1451 entry
->s
.output_section_statement
.name
= name
;
1452 entry
->s
.output_section_statement
.constraint
= constraint
;
1453 return &entry
->s
.output_section_statement
;
1456 /* Find the next output_section_statement with the same name as OS.
1457 If CONSTRAINT is non-zero, find one with that constraint otherwise
1458 match any non-negative constraint. */
1460 lang_output_section_statement_type
*
1461 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1464 /* All output_section_statements are actually part of a
1465 struct out_section_hash_entry. */
1466 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1468 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1469 const char *name
= os
->name
;
1471 ASSERT (name
== entry
->root
.string
);
1474 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1476 || name
!= entry
->s
.output_section_statement
.name
)
1479 while (constraint
!= entry
->s
.output_section_statement
.constraint
1481 || entry
->s
.output_section_statement
.constraint
< 0));
1483 return &entry
->s
.output_section_statement
;
1486 /* A variant of lang_output_section_find used by place_orphan.
1487 Returns the output statement that should precede a new output
1488 statement for SEC. If an exact match is found on certain flags,
1491 lang_output_section_statement_type
*
1492 lang_output_section_find_by_flags (const asection
*sec
,
1493 lang_output_section_statement_type
**exact
,
1494 lang_match_sec_type_func match_type
)
1496 lang_output_section_statement_type
*first
, *look
, *found
;
1499 /* We know the first statement on this list is *ABS*. May as well
1501 first
= &lang_output_section_statement
.head
->output_section_statement
;
1502 first
= first
->next
;
1504 /* First try for an exact match. */
1506 for (look
= first
; look
; look
= look
->next
)
1508 flags
= look
->flags
;
1509 if (look
->bfd_section
!= NULL
)
1511 flags
= look
->bfd_section
->flags
;
1512 if (match_type
&& !match_type (link_info
.output_bfd
,
1517 flags
^= sec
->flags
;
1518 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1519 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1529 if ((sec
->flags
& SEC_CODE
) != 0
1530 && (sec
->flags
& SEC_ALLOC
) != 0)
1532 /* Try for a rw code section. */
1533 for (look
= first
; look
; look
= look
->next
)
1535 flags
= look
->flags
;
1536 if (look
->bfd_section
!= NULL
)
1538 flags
= look
->bfd_section
->flags
;
1539 if (match_type
&& !match_type (link_info
.output_bfd
,
1544 flags
^= sec
->flags
;
1545 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1546 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1550 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1551 && (sec
->flags
& SEC_ALLOC
) != 0)
1553 /* .rodata can go after .text, .sdata2 after .rodata. */
1554 for (look
= first
; look
; look
= look
->next
)
1556 flags
= look
->flags
;
1557 if (look
->bfd_section
!= NULL
)
1559 flags
= look
->bfd_section
->flags
;
1560 if (match_type
&& !match_type (link_info
.output_bfd
,
1565 flags
^= sec
->flags
;
1566 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1567 | SEC_READONLY
| SEC_SMALL_DATA
))
1568 || (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1570 && !(look
->flags
& SEC_SMALL_DATA
))
1571 || (!(flags
& (SEC_THREAD_LOCAL
| SEC_ALLOC
))
1572 && (look
->flags
& SEC_THREAD_LOCAL
)
1573 && (!(flags
& SEC_LOAD
)
1574 || (look
->flags
& SEC_LOAD
))))
1578 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1579 && (sec
->flags
& SEC_ALLOC
) != 0)
1581 /* .sdata goes after .data, .sbss after .sdata. */
1582 for (look
= first
; look
; look
= look
->next
)
1584 flags
= look
->flags
;
1585 if (look
->bfd_section
!= NULL
)
1587 flags
= look
->bfd_section
->flags
;
1588 if (match_type
&& !match_type (link_info
.output_bfd
,
1593 flags
^= sec
->flags
;
1594 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1595 | SEC_THREAD_LOCAL
))
1596 || ((look
->flags
& SEC_SMALL_DATA
)
1597 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1601 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1602 && (sec
->flags
& SEC_ALLOC
) != 0)
1604 /* .data goes after .rodata. */
1605 for (look
= first
; look
; look
= look
->next
)
1607 flags
= look
->flags
;
1608 if (look
->bfd_section
!= NULL
)
1610 flags
= look
->bfd_section
->flags
;
1611 if (match_type
&& !match_type (link_info
.output_bfd
,
1616 flags
^= sec
->flags
;
1617 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1618 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1622 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1624 /* .bss goes after any other alloc section. */
1625 for (look
= first
; look
; look
= look
->next
)
1627 flags
= look
->flags
;
1628 if (look
->bfd_section
!= NULL
)
1630 flags
= look
->bfd_section
->flags
;
1631 if (match_type
&& !match_type (link_info
.output_bfd
,
1636 flags
^= sec
->flags
;
1637 if (!(flags
& SEC_ALLOC
))
1643 /* non-alloc go last. */
1644 for (look
= first
; look
; look
= look
->next
)
1646 flags
= look
->flags
;
1647 if (look
->bfd_section
!= NULL
)
1648 flags
= look
->bfd_section
->flags
;
1649 flags
^= sec
->flags
;
1650 if (!(flags
& SEC_DEBUGGING
))
1656 if (found
|| !match_type
)
1659 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1662 /* Find the last output section before given output statement.
1663 Used by place_orphan. */
1666 output_prev_sec_find (lang_output_section_statement_type
*os
)
1668 lang_output_section_statement_type
*lookup
;
1670 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1672 if (lookup
->constraint
< 0)
1675 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1676 return lookup
->bfd_section
;
1682 /* Look for a suitable place for a new output section statement. The
1683 idea is to skip over anything that might be inside a SECTIONS {}
1684 statement in a script, before we find another output section
1685 statement. Assignments to "dot" before an output section statement
1686 are assumed to belong to it, except in two cases; The first
1687 assignment to dot, and assignments before non-alloc sections.
1688 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1689 similar assignments that set the initial address, or we might
1690 insert non-alloc note sections among assignments setting end of
1693 static lang_statement_union_type
**
1694 insert_os_after (lang_output_section_statement_type
*after
)
1696 lang_statement_union_type
**where
;
1697 lang_statement_union_type
**assign
= NULL
;
1698 bfd_boolean ignore_first
;
1701 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1703 for (where
= &after
->header
.next
;
1705 where
= &(*where
)->header
.next
)
1707 switch ((*where
)->header
.type
)
1709 case lang_assignment_statement_enum
:
1712 lang_assignment_statement_type
*ass
;
1714 ass
= &(*where
)->assignment_statement
;
1715 if (ass
->exp
->type
.node_class
!= etree_assert
1716 && ass
->exp
->assign
.dst
[0] == '.'
1717 && ass
->exp
->assign
.dst
[1] == 0
1721 ignore_first
= FALSE
;
1723 case lang_wild_statement_enum
:
1724 case lang_input_section_enum
:
1725 case lang_object_symbols_statement_enum
:
1726 case lang_fill_statement_enum
:
1727 case lang_data_statement_enum
:
1728 case lang_reloc_statement_enum
:
1729 case lang_padding_statement_enum
:
1730 case lang_constructors_statement_enum
:
1733 case lang_output_section_statement_enum
:
1736 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1739 || s
->map_head
.s
== NULL
1740 || (s
->flags
& SEC_ALLOC
) != 0)
1744 case lang_input_statement_enum
:
1745 case lang_address_statement_enum
:
1746 case lang_target_statement_enum
:
1747 case lang_output_statement_enum
:
1748 case lang_group_statement_enum
:
1749 case lang_insert_statement_enum
:
1758 lang_output_section_statement_type
*
1759 lang_insert_orphan (asection
*s
,
1760 const char *secname
,
1762 lang_output_section_statement_type
*after
,
1763 struct orphan_save
*place
,
1764 etree_type
*address
,
1765 lang_statement_list_type
*add_child
)
1767 lang_statement_list_type add
;
1769 lang_output_section_statement_type
*os
;
1770 lang_output_section_statement_type
**os_tail
;
1772 /* If we have found an appropriate place for the output section
1773 statements for this orphan, add them to our own private list,
1774 inserting them later into the global statement list. */
1777 lang_list_init (&add
);
1778 push_stat_ptr (&add
);
1781 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1782 address
= exp_intop (0);
1784 os_tail
= ((lang_output_section_statement_type
**)
1785 lang_output_section_statement
.tail
);
1786 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1787 NULL
, NULL
, NULL
, constraint
, 0);
1790 if (config
.build_constructors
&& *os_tail
== os
)
1792 /* If the name of the section is representable in C, then create
1793 symbols to mark the start and the end of the section. */
1794 for (ps
= secname
; *ps
!= '\0'; ps
++)
1795 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1801 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1802 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1803 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1804 lang_add_assignment (exp_provide (symname
,
1805 exp_nameop (NAME
, "."),
1810 if (add_child
== NULL
)
1811 add_child
= &os
->children
;
1812 lang_add_section (add_child
, s
, NULL
, os
);
1814 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1816 const char *region
= (after
->region
1817 ? after
->region
->name_list
.name
1818 : DEFAULT_MEMORY_REGION
);
1819 const char *lma_region
= (after
->lma_region
1820 ? after
->lma_region
->name_list
.name
1822 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1826 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1829 if (ps
!= NULL
&& *ps
== '\0')
1833 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1834 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1835 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1836 lang_add_assignment (exp_provide (symname
,
1837 exp_nameop (NAME
, "."),
1841 /* Restore the global list pointer. */
1845 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1847 asection
*snew
, *as
;
1849 snew
= os
->bfd_section
;
1851 /* Shuffle the bfd section list to make the output file look
1852 neater. This is really only cosmetic. */
1853 if (place
->section
== NULL
1854 && after
!= (&lang_output_section_statement
.head
1855 ->output_section_statement
))
1857 asection
*bfd_section
= after
->bfd_section
;
1859 /* If the output statement hasn't been used to place any input
1860 sections (and thus doesn't have an output bfd_section),
1861 look for the closest prior output statement having an
1863 if (bfd_section
== NULL
)
1864 bfd_section
= output_prev_sec_find (after
);
1866 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1867 place
->section
= &bfd_section
->next
;
1870 if (place
->section
== NULL
)
1871 place
->section
= &link_info
.output_bfd
->sections
;
1873 as
= *place
->section
;
1877 /* Put the section at the end of the list. */
1879 /* Unlink the section. */
1880 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1882 /* Now tack it back on in the right place. */
1883 bfd_section_list_append (link_info
.output_bfd
, snew
);
1885 else if (as
!= snew
&& as
->prev
!= snew
)
1887 /* Unlink the section. */
1888 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1890 /* Now tack it back on in the right place. */
1891 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1894 /* Save the end of this list. Further ophans of this type will
1895 follow the one we've just added. */
1896 place
->section
= &snew
->next
;
1898 /* The following is non-cosmetic. We try to put the output
1899 statements in some sort of reasonable order here, because they
1900 determine the final load addresses of the orphan sections.
1901 In addition, placing output statements in the wrong order may
1902 require extra segments. For instance, given a typical
1903 situation of all read-only sections placed in one segment and
1904 following that a segment containing all the read-write
1905 sections, we wouldn't want to place an orphan read/write
1906 section before or amongst the read-only ones. */
1907 if (add
.head
!= NULL
)
1909 lang_output_section_statement_type
*newly_added_os
;
1911 if (place
->stmt
== NULL
)
1913 lang_statement_union_type
**where
= insert_os_after (after
);
1918 place
->os_tail
= &after
->next
;
1922 /* Put it after the last orphan statement we added. */
1923 *add
.tail
= *place
->stmt
;
1924 *place
->stmt
= add
.head
;
1927 /* Fix the global list pointer if we happened to tack our
1928 new list at the tail. */
1929 if (*stat_ptr
->tail
== add
.head
)
1930 stat_ptr
->tail
= add
.tail
;
1932 /* Save the end of this list. */
1933 place
->stmt
= add
.tail
;
1935 /* Do the same for the list of output section statements. */
1936 newly_added_os
= *os_tail
;
1938 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1939 ((char *) place
->os_tail
1940 - offsetof (lang_output_section_statement_type
, next
));
1941 newly_added_os
->next
= *place
->os_tail
;
1942 if (newly_added_os
->next
!= NULL
)
1943 newly_added_os
->next
->prev
= newly_added_os
;
1944 *place
->os_tail
= newly_added_os
;
1945 place
->os_tail
= &newly_added_os
->next
;
1947 /* Fixing the global list pointer here is a little different.
1948 We added to the list in lang_enter_output_section_statement,
1949 trimmed off the new output_section_statment above when
1950 assigning *os_tail = NULL, but possibly added it back in
1951 the same place when assigning *place->os_tail. */
1952 if (*os_tail
== NULL
)
1953 lang_output_section_statement
.tail
1954 = (lang_statement_union_type
**) os_tail
;
1961 lang_map_flags (flagword flag
)
1963 if (flag
& SEC_ALLOC
)
1966 if (flag
& SEC_CODE
)
1969 if (flag
& SEC_READONLY
)
1972 if (flag
& SEC_DATA
)
1975 if (flag
& SEC_LOAD
)
1982 lang_memory_region_type
*m
;
1983 bfd_boolean dis_header_printed
= FALSE
;
1985 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1989 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1990 || file
->flags
.just_syms
)
1993 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1994 if ((s
->output_section
== NULL
1995 || s
->output_section
->owner
!= link_info
.output_bfd
)
1996 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1998 if (! dis_header_printed
)
2000 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2001 dis_header_printed
= TRUE
;
2004 print_input_section (s
, TRUE
);
2008 minfo (_("\nMemory Configuration\n\n"));
2009 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2010 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2012 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2017 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2019 sprintf_vma (buf
, m
->origin
);
2020 minfo ("0x%s ", buf
);
2028 minfo ("0x%V", m
->length
);
2029 if (m
->flags
|| m
->not_flags
)
2037 lang_map_flags (m
->flags
);
2043 lang_map_flags (m
->not_flags
);
2050 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2052 if (! link_info
.reduce_memory_overheads
)
2054 obstack_begin (&map_obstack
, 1000);
2055 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2057 lang_statement_iteration
++;
2058 print_statements ();
2062 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2063 void *info ATTRIBUTE_UNUSED
)
2065 if ((hash_entry
->type
== bfd_link_hash_defined
2066 || hash_entry
->type
== bfd_link_hash_defweak
)
2067 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2068 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2070 input_section_userdata_type
*ud
;
2071 struct map_symbol_def
*def
;
2073 ud
= ((input_section_userdata_type
*)
2074 get_userdata (hash_entry
->u
.def
.section
));
2077 ud
= (input_section_userdata_type
*) stat_alloc (sizeof (*ud
));
2078 get_userdata (hash_entry
->u
.def
.section
) = ud
;
2079 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2080 ud
->map_symbol_def_count
= 0;
2082 else if (!ud
->map_symbol_def_tail
)
2083 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2085 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2086 def
->entry
= hash_entry
;
2087 *(ud
->map_symbol_def_tail
) = def
;
2088 ud
->map_symbol_def_tail
= &def
->next
;
2089 ud
->map_symbol_def_count
++;
2094 /* Initialize an output section. */
2097 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2099 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2100 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2102 if (s
->constraint
!= SPECIAL
)
2103 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2104 if (s
->bfd_section
== NULL
)
2105 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2107 if (s
->bfd_section
== NULL
)
2109 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2110 link_info
.output_bfd
->xvec
->name
, s
->name
);
2112 s
->bfd_section
->output_section
= s
->bfd_section
;
2113 s
->bfd_section
->output_offset
= 0;
2115 /* Set the userdata of the output section to the output section
2116 statement to avoid lookup. */
2117 get_userdata (s
->bfd_section
) = s
;
2119 /* If there is a base address, make sure that any sections it might
2120 mention are initialized. */
2121 if (s
->addr_tree
!= NULL
)
2122 exp_init_os (s
->addr_tree
);
2124 if (s
->load_base
!= NULL
)
2125 exp_init_os (s
->load_base
);
2127 /* If supplied an alignment, set it. */
2128 if (s
->section_alignment
!= -1)
2129 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2132 /* Make sure that all output sections mentioned in an expression are
2136 exp_init_os (etree_type
*exp
)
2138 switch (exp
->type
.node_class
)
2142 exp_init_os (exp
->assign
.src
);
2146 exp_init_os (exp
->binary
.lhs
);
2147 exp_init_os (exp
->binary
.rhs
);
2151 exp_init_os (exp
->trinary
.cond
);
2152 exp_init_os (exp
->trinary
.lhs
);
2153 exp_init_os (exp
->trinary
.rhs
);
2157 exp_init_os (exp
->assert_s
.child
);
2161 exp_init_os (exp
->unary
.child
);
2165 switch (exp
->type
.node_code
)
2171 lang_output_section_statement_type
*os
;
2173 os
= lang_output_section_find (exp
->name
.name
);
2174 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2186 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2188 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2190 /* If we are only reading symbols from this object, then we want to
2191 discard all sections. */
2192 if (entry
->flags
.just_syms
)
2194 bfd_link_just_syms (abfd
, sec
, &link_info
);
2198 if (!(abfd
->flags
& DYNAMIC
))
2199 bfd_section_already_linked (abfd
, sec
, &link_info
);
2202 /* The wild routines.
2204 These expand statements like *(.text) and foo.o to a list of
2205 explicit actions, like foo.o(.text), bar.o(.text) and
2206 foo.o(.text, .data). */
2208 /* Add SECTION to the output section OUTPUT. Do this by creating a
2209 lang_input_section statement which is placed at PTR. */
2212 lang_add_section (lang_statement_list_type
*ptr
,
2214 struct flag_info
*sflag_info
,
2215 lang_output_section_statement_type
*output
)
2217 flagword flags
= section
->flags
;
2219 bfd_boolean discard
;
2220 lang_input_section_type
*new_section
;
2221 bfd
*abfd
= link_info
.output_bfd
;
2223 /* Discard sections marked with SEC_EXCLUDE. */
2224 discard
= (flags
& SEC_EXCLUDE
) != 0;
2226 /* Discard input sections which are assigned to a section named
2227 DISCARD_SECTION_NAME. */
2228 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2231 /* Discard debugging sections if we are stripping debugging
2233 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2234 && (flags
& SEC_DEBUGGING
) != 0)
2239 if (section
->output_section
== NULL
)
2241 /* This prevents future calls from assigning this section. */
2242 section
->output_section
= bfd_abs_section_ptr
;
2251 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2256 if (section
->output_section
!= NULL
)
2259 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2260 to an output section, because we want to be able to include a
2261 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2262 section (I don't know why we want to do this, but we do).
2263 build_link_order in ldwrite.c handles this case by turning
2264 the embedded SEC_NEVER_LOAD section into a fill. */
2265 flags
&= ~ SEC_NEVER_LOAD
;
2267 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2268 already been processed. One reason to do this is that on pe
2269 format targets, .text$foo sections go into .text and it's odd
2270 to see .text with SEC_LINK_ONCE set. */
2272 if (!link_info
.relocatable
)
2273 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2275 switch (output
->sectype
)
2277 case normal_section
:
2278 case overlay_section
:
2280 case noalloc_section
:
2281 flags
&= ~SEC_ALLOC
;
2283 case noload_section
:
2285 flags
|= SEC_NEVER_LOAD
;
2286 /* Unfortunately GNU ld has managed to evolve two different
2287 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2288 alloc, no contents section. All others get a noload, noalloc
2290 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2291 flags
&= ~SEC_HAS_CONTENTS
;
2293 flags
&= ~SEC_ALLOC
;
2297 if (output
->bfd_section
== NULL
)
2298 init_os (output
, flags
);
2300 /* If SEC_READONLY is not set in the input section, then clear
2301 it from the output section. */
2302 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2304 if (output
->bfd_section
->linker_has_input
)
2306 /* Only set SEC_READONLY flag on the first input section. */
2307 flags
&= ~ SEC_READONLY
;
2309 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2310 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2311 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2312 || ((flags
& SEC_MERGE
) != 0
2313 && output
->bfd_section
->entsize
!= section
->entsize
))
2315 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2316 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2319 output
->bfd_section
->flags
|= flags
;
2321 if (!output
->bfd_section
->linker_has_input
)
2323 output
->bfd_section
->linker_has_input
= 1;
2324 /* This must happen after flags have been updated. The output
2325 section may have been created before we saw its first input
2326 section, eg. for a data statement. */
2327 bfd_init_private_section_data (section
->owner
, section
,
2328 link_info
.output_bfd
,
2329 output
->bfd_section
,
2331 if ((flags
& SEC_MERGE
) != 0)
2332 output
->bfd_section
->entsize
= section
->entsize
;
2335 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2336 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2338 /* FIXME: This value should really be obtained from the bfd... */
2339 output
->block_value
= 128;
2342 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2343 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2345 section
->output_section
= output
->bfd_section
;
2347 if (!link_info
.relocatable
2348 && !stripped_excluded_sections
)
2350 asection
*s
= output
->bfd_section
->map_tail
.s
;
2351 output
->bfd_section
->map_tail
.s
= section
;
2352 section
->map_head
.s
= NULL
;
2353 section
->map_tail
.s
= s
;
2355 s
->map_head
.s
= section
;
2357 output
->bfd_section
->map_head
.s
= section
;
2360 /* Add a section reference to the list. */
2361 new_section
= new_stat (lang_input_section
, ptr
);
2362 new_section
->section
= section
;
2365 /* Handle wildcard sorting. This returns the lang_input_section which
2366 should follow the one we are going to create for SECTION and FILE,
2367 based on the sorting requirements of WILD. It returns NULL if the
2368 new section should just go at the end of the current list. */
2370 static lang_statement_union_type
*
2371 wild_sort (lang_wild_statement_type
*wild
,
2372 struct wildcard_list
*sec
,
2373 lang_input_statement_type
*file
,
2376 lang_statement_union_type
*l
;
2378 if (!wild
->filenames_sorted
2379 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2382 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2384 lang_input_section_type
*ls
;
2386 if (l
->header
.type
!= lang_input_section_enum
)
2388 ls
= &l
->input_section
;
2390 /* Sorting by filename takes precedence over sorting by section
2393 if (wild
->filenames_sorted
)
2395 const char *fn
, *ln
;
2399 /* The PE support for the .idata section as generated by
2400 dlltool assumes that files will be sorted by the name of
2401 the archive and then the name of the file within the
2404 if (file
->the_bfd
!= NULL
2405 && bfd_my_archive (file
->the_bfd
) != NULL
)
2407 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2412 fn
= file
->filename
;
2416 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2418 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2423 ln
= ls
->section
->owner
->filename
;
2427 i
= filename_cmp (fn
, ln
);
2436 fn
= file
->filename
;
2438 ln
= ls
->section
->owner
->filename
;
2440 i
= filename_cmp (fn
, ln
);
2448 /* Here either the files are not sorted by name, or we are
2449 looking at the sections for this file. */
2452 && sec
->spec
.sorted
!= none
2453 && sec
->spec
.sorted
!= by_none
)
2454 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2461 /* Expand a wild statement for a particular FILE. SECTION may be
2462 NULL, in which case it is a wild card. */
2465 output_section_callback (lang_wild_statement_type
*ptr
,
2466 struct wildcard_list
*sec
,
2468 struct flag_info
*sflag_info
,
2469 lang_input_statement_type
*file
,
2472 lang_statement_union_type
*before
;
2473 lang_output_section_statement_type
*os
;
2475 os
= (lang_output_section_statement_type
*) output
;
2477 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2478 if (unique_section_p (section
, os
))
2481 before
= wild_sort (ptr
, sec
, file
, section
);
2483 /* Here BEFORE points to the lang_input_section which
2484 should follow the one we are about to add. If BEFORE
2485 is NULL, then the section should just go at the end
2486 of the current list. */
2489 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2492 lang_statement_list_type list
;
2493 lang_statement_union_type
**pp
;
2495 lang_list_init (&list
);
2496 lang_add_section (&list
, section
, sflag_info
, os
);
2498 /* If we are discarding the section, LIST.HEAD will
2500 if (list
.head
!= NULL
)
2502 ASSERT (list
.head
->header
.next
== NULL
);
2504 for (pp
= &ptr
->children
.head
;
2506 pp
= &(*pp
)->header
.next
)
2507 ASSERT (*pp
!= NULL
);
2509 list
.head
->header
.next
= *pp
;
2515 /* Check if all sections in a wild statement for a particular FILE
2519 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2520 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2522 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2523 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2526 lang_output_section_statement_type
*os
;
2528 os
= (lang_output_section_statement_type
*) output
;
2530 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2531 if (unique_section_p (section
, os
))
2534 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2535 os
->all_input_readonly
= FALSE
;
2538 /* This is passed a file name which must have been seen already and
2539 added to the statement tree. We will see if it has been opened
2540 already and had its symbols read. If not then we'll read it. */
2542 static lang_input_statement_type
*
2543 lookup_name (const char *name
)
2545 lang_input_statement_type
*search
;
2547 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2549 search
= (lang_input_statement_type
*) search
->next_real_file
)
2551 /* Use the local_sym_name as the name of the file that has
2552 already been loaded as filename might have been transformed
2553 via the search directory lookup mechanism. */
2554 const char *filename
= search
->local_sym_name
;
2556 if (filename
!= NULL
2557 && filename_cmp (filename
, name
) == 0)
2562 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2563 default_target
, FALSE
);
2565 /* If we have already added this file, or this file is not real
2566 don't add this file. */
2567 if (search
->flags
.loaded
|| !search
->flags
.real
)
2570 if (! load_symbols (search
, NULL
))
2576 /* Save LIST as a list of libraries whose symbols should not be exported. */
2581 struct excluded_lib
*next
;
2583 static struct excluded_lib
*excluded_libs
;
2586 add_excluded_libs (const char *list
)
2588 const char *p
= list
, *end
;
2592 struct excluded_lib
*entry
;
2593 end
= strpbrk (p
, ",:");
2595 end
= p
+ strlen (p
);
2596 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2597 entry
->next
= excluded_libs
;
2598 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2599 memcpy (entry
->name
, p
, end
- p
);
2600 entry
->name
[end
- p
] = '\0';
2601 excluded_libs
= entry
;
2609 check_excluded_libs (bfd
*abfd
)
2611 struct excluded_lib
*lib
= excluded_libs
;
2615 int len
= strlen (lib
->name
);
2616 const char *filename
= lbasename (abfd
->filename
);
2618 if (strcmp (lib
->name
, "ALL") == 0)
2620 abfd
->no_export
= TRUE
;
2624 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2625 && (filename
[len
] == '\0'
2626 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2627 && filename
[len
+ 2] == '\0')))
2629 abfd
->no_export
= TRUE
;
2637 /* Get the symbols for an input file. */
2640 load_symbols (lang_input_statement_type
*entry
,
2641 lang_statement_list_type
*place
)
2645 if (entry
->flags
.loaded
)
2648 ldfile_open_file (entry
);
2650 /* Do not process further if the file was missing. */
2651 if (entry
->flags
.missing_file
)
2654 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2655 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2658 struct lang_input_statement_flags save_flags
;
2661 err
= bfd_get_error ();
2663 /* See if the emulation has some special knowledge. */
2664 if (ldemul_unrecognized_file (entry
))
2667 if (err
== bfd_error_file_ambiguously_recognized
)
2671 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2672 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2673 for (p
= matching
; *p
!= NULL
; p
++)
2677 else if (err
!= bfd_error_file_not_recognized
2679 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2681 bfd_close (entry
->the_bfd
);
2682 entry
->the_bfd
= NULL
;
2684 /* Try to interpret the file as a linker script. */
2685 save_flags
= input_flags
;
2686 ldfile_open_command_file (entry
->filename
);
2688 push_stat_ptr (place
);
2689 input_flags
.add_DT_NEEDED_for_regular
2690 = entry
->flags
.add_DT_NEEDED_for_regular
;
2691 input_flags
.add_DT_NEEDED_for_dynamic
2692 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2693 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2694 input_flags
.dynamic
= entry
->flags
.dynamic
;
2696 ldfile_assumed_script
= TRUE
;
2697 parser_input
= input_script
;
2699 ldfile_assumed_script
= FALSE
;
2701 /* missing_file is sticky. sysrooted will already have been
2702 restored when seeing EOF in yyparse, but no harm to restore
2704 save_flags
.missing_file
|= input_flags
.missing_file
;
2705 input_flags
= save_flags
;
2709 entry
->flags
.loaded
= TRUE
;
2714 if (ldemul_recognized_file (entry
))
2717 /* We don't call ldlang_add_file for an archive. Instead, the
2718 add_symbols entry point will call ldlang_add_file, via the
2719 add_archive_element callback, for each element of the archive
2721 switch (bfd_get_format (entry
->the_bfd
))
2727 #ifdef ENABLE_PLUGINS
2728 if (!entry
->flags
.reload
)
2730 ldlang_add_file (entry
);
2731 if (trace_files
|| verbose
)
2732 info_msg ("%I\n", entry
);
2736 check_excluded_libs (entry
->the_bfd
);
2738 if (entry
->flags
.whole_archive
)
2741 bfd_boolean loaded
= TRUE
;
2746 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2751 if (! bfd_check_format (member
, bfd_object
))
2753 einfo (_("%F%B: member %B in archive is not an object\n"),
2754 entry
->the_bfd
, member
);
2759 if (!(*link_info
.callbacks
2760 ->add_archive_element
) (&link_info
, member
,
2761 "--whole-archive", &subsbfd
))
2764 /* Potentially, the add_archive_element hook may have set a
2765 substitute BFD for us. */
2766 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2768 einfo (_("%F%B: error adding symbols: %E\n"), member
);
2773 entry
->flags
.loaded
= loaded
;
2779 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2780 entry
->flags
.loaded
= TRUE
;
2782 einfo (_("%F%B: error adding symbols: %E\n"), entry
->the_bfd
);
2784 return entry
->flags
.loaded
;
2787 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2788 may be NULL, indicating that it is a wildcard. Separate
2789 lang_input_section statements are created for each part of the
2790 expansion; they are added after the wild statement S. OUTPUT is
2791 the output section. */
2794 wild (lang_wild_statement_type
*s
,
2795 const char *target ATTRIBUTE_UNUSED
,
2796 lang_output_section_statement_type
*output
)
2798 struct wildcard_list
*sec
;
2800 if (s
->handler_data
[0]
2801 && s
->handler_data
[0]->spec
.sorted
== by_name
2802 && !s
->filenames_sorted
)
2804 lang_section_bst_type
*tree
;
2806 walk_wild (s
, output_section_callback_fast
, output
);
2811 output_section_callback_tree_to_list (s
, tree
, output
);
2816 walk_wild (s
, output_section_callback
, output
);
2818 if (default_common_section
== NULL
)
2819 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2820 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2822 /* Remember the section that common is going to in case we
2823 later get something which doesn't know where to put it. */
2824 default_common_section
= output
;
2829 /* Return TRUE iff target is the sought target. */
2832 get_target (const bfd_target
*target
, void *data
)
2834 const char *sought
= (const char *) data
;
2836 return strcmp (target
->name
, sought
) == 0;
2839 /* Like strcpy() but convert to lower case as well. */
2842 stricpy (char *dest
, char *src
)
2846 while ((c
= *src
++) != 0)
2847 *dest
++ = TOLOWER (c
);
2852 /* Remove the first occurrence of needle (if any) in haystack
2856 strcut (char *haystack
, char *needle
)
2858 haystack
= strstr (haystack
, needle
);
2864 for (src
= haystack
+ strlen (needle
); *src
;)
2865 *haystack
++ = *src
++;
2871 /* Compare two target format name strings.
2872 Return a value indicating how "similar" they are. */
2875 name_compare (char *first
, char *second
)
2881 copy1
= (char *) xmalloc (strlen (first
) + 1);
2882 copy2
= (char *) xmalloc (strlen (second
) + 1);
2884 /* Convert the names to lower case. */
2885 stricpy (copy1
, first
);
2886 stricpy (copy2
, second
);
2888 /* Remove size and endian strings from the name. */
2889 strcut (copy1
, "big");
2890 strcut (copy1
, "little");
2891 strcut (copy2
, "big");
2892 strcut (copy2
, "little");
2894 /* Return a value based on how many characters match,
2895 starting from the beginning. If both strings are
2896 the same then return 10 * their length. */
2897 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2898 if (copy1
[result
] == 0)
2910 /* Set by closest_target_match() below. */
2911 static const bfd_target
*winner
;
2913 /* Scan all the valid bfd targets looking for one that has the endianness
2914 requirement that was specified on the command line, and is the nearest
2915 match to the original output target. */
2918 closest_target_match (const bfd_target
*target
, void *data
)
2920 const bfd_target
*original
= (const bfd_target
*) data
;
2922 if (command_line
.endian
== ENDIAN_BIG
2923 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2926 if (command_line
.endian
== ENDIAN_LITTLE
2927 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2930 /* Must be the same flavour. */
2931 if (target
->flavour
!= original
->flavour
)
2934 /* Ignore generic big and little endian elf vectors. */
2935 if (strcmp (target
->name
, "elf32-big") == 0
2936 || strcmp (target
->name
, "elf64-big") == 0
2937 || strcmp (target
->name
, "elf32-little") == 0
2938 || strcmp (target
->name
, "elf64-little") == 0)
2941 /* If we have not found a potential winner yet, then record this one. */
2948 /* Oh dear, we now have two potential candidates for a successful match.
2949 Compare their names and choose the better one. */
2950 if (name_compare (target
->name
, original
->name
)
2951 > name_compare (winner
->name
, original
->name
))
2954 /* Keep on searching until wqe have checked them all. */
2958 /* Return the BFD target format of the first input file. */
2961 get_first_input_target (void)
2963 char *target
= NULL
;
2965 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2967 if (s
->header
.type
== lang_input_statement_enum
2970 ldfile_open_file (s
);
2972 if (s
->the_bfd
!= NULL
2973 && bfd_check_format (s
->the_bfd
, bfd_object
))
2975 target
= bfd_get_target (s
->the_bfd
);
2987 lang_get_output_target (void)
2991 /* Has the user told us which output format to use? */
2992 if (output_target
!= NULL
)
2993 return output_target
;
2995 /* No - has the current target been set to something other than
2997 if (current_target
!= default_target
&& current_target
!= NULL
)
2998 return current_target
;
3000 /* No - can we determine the format of the first input file? */
3001 target
= get_first_input_target ();
3005 /* Failed - use the default output target. */
3006 return default_target
;
3009 /* Open the output file. */
3012 open_output (const char *name
)
3014 output_target
= lang_get_output_target ();
3016 /* Has the user requested a particular endianness on the command
3018 if (command_line
.endian
!= ENDIAN_UNSET
)
3020 const bfd_target
*target
;
3021 enum bfd_endian desired_endian
;
3023 /* Get the chosen target. */
3024 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3026 /* If the target is not supported, we cannot do anything. */
3029 if (command_line
.endian
== ENDIAN_BIG
)
3030 desired_endian
= BFD_ENDIAN_BIG
;
3032 desired_endian
= BFD_ENDIAN_LITTLE
;
3034 /* See if the target has the wrong endianness. This should
3035 not happen if the linker script has provided big and
3036 little endian alternatives, but some scrips don't do
3038 if (target
->byteorder
!= desired_endian
)
3040 /* If it does, then see if the target provides
3041 an alternative with the correct endianness. */
3042 if (target
->alternative_target
!= NULL
3043 && (target
->alternative_target
->byteorder
== desired_endian
))
3044 output_target
= target
->alternative_target
->name
;
3047 /* Try to find a target as similar as possible to
3048 the default target, but which has the desired
3049 endian characteristic. */
3050 bfd_search_for_target (closest_target_match
,
3053 /* Oh dear - we could not find any targets that
3054 satisfy our requirements. */
3056 einfo (_("%P: warning: could not find any targets"
3057 " that match endianness requirement\n"));
3059 output_target
= winner
->name
;
3065 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3067 if (link_info
.output_bfd
== NULL
)
3069 if (bfd_get_error () == bfd_error_invalid_target
)
3070 einfo (_("%P%F: target %s not found\n"), output_target
);
3072 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3075 delete_output_file_on_failure
= TRUE
;
3077 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3078 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3079 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3080 ldfile_output_architecture
,
3081 ldfile_output_machine
))
3082 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3084 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3085 if (link_info
.hash
== NULL
)
3086 einfo (_("%P%F: can not create hash table: %E\n"));
3088 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3092 ldlang_open_output (lang_statement_union_type
*statement
)
3094 switch (statement
->header
.type
)
3096 case lang_output_statement_enum
:
3097 ASSERT (link_info
.output_bfd
== NULL
);
3098 open_output (statement
->output_statement
.name
);
3099 ldemul_set_output_arch ();
3100 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3101 link_info
.output_bfd
->flags
|= D_PAGED
;
3103 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3104 if (config
.text_read_only
)
3105 link_info
.output_bfd
->flags
|= WP_TEXT
;
3107 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3108 if (link_info
.traditional_format
)
3109 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3111 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3114 case lang_target_statement_enum
:
3115 current_target
= statement
->target_statement
.target
;
3122 /* Convert between addresses in bytes and sizes in octets.
3123 For currently supported targets, octets_per_byte is always a power
3124 of two, so we can use shifts. */
3125 #define TO_ADDR(X) ((X) >> opb_shift)
3126 #define TO_SIZE(X) ((X) << opb_shift)
3128 /* Support the above. */
3129 static unsigned int opb_shift
= 0;
3134 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3135 ldfile_output_machine
);
3138 while ((x
& 1) == 0)
3146 /* Open all the input files. */
3150 OPEN_BFD_NORMAL
= 0,
3154 #ifdef ENABLE_PLUGINS
3155 static lang_input_statement_type
*plugin_insert
= NULL
;
3159 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3161 for (; s
!= NULL
; s
= s
->header
.next
)
3163 switch (s
->header
.type
)
3165 case lang_constructors_statement_enum
:
3166 open_input_bfds (constructor_list
.head
, mode
);
3168 case lang_output_section_statement_enum
:
3169 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3171 case lang_wild_statement_enum
:
3172 /* Maybe we should load the file's symbols. */
3173 if ((mode
& OPEN_BFD_RESCAN
) == 0
3174 && s
->wild_statement
.filename
3175 && !wildcardp (s
->wild_statement
.filename
)
3176 && !archive_path (s
->wild_statement
.filename
))
3177 lookup_name (s
->wild_statement
.filename
);
3178 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3180 case lang_group_statement_enum
:
3182 struct bfd_link_hash_entry
*undefs
;
3184 /* We must continually search the entries in the group
3185 until no new symbols are added to the list of undefined
3190 undefs
= link_info
.hash
->undefs_tail
;
3191 open_input_bfds (s
->group_statement
.children
.head
,
3192 mode
| OPEN_BFD_FORCE
);
3194 while (undefs
!= link_info
.hash
->undefs_tail
);
3197 case lang_target_statement_enum
:
3198 current_target
= s
->target_statement
.target
;
3200 case lang_input_statement_enum
:
3201 if (s
->input_statement
.flags
.real
)
3203 lang_statement_union_type
**os_tail
;
3204 lang_statement_list_type add
;
3206 s
->input_statement
.target
= current_target
;
3208 /* If we are being called from within a group, and this
3209 is an archive which has already been searched, then
3210 force it to be researched unless the whole archive
3211 has been loaded already. Do the same for a rescan. */
3212 if (mode
!= OPEN_BFD_NORMAL
3213 #ifdef ENABLE_PLUGINS
3214 && ((mode
& OPEN_BFD_RESCAN
) == 0
3215 || plugin_insert
== NULL
)
3217 && !s
->input_statement
.flags
.whole_archive
3218 && s
->input_statement
.flags
.loaded
3219 && s
->input_statement
.the_bfd
!= NULL
3220 && bfd_check_format (s
->input_statement
.the_bfd
,
3222 s
->input_statement
.flags
.loaded
= FALSE
;
3223 #ifdef ENABLE_PLUGINS
3224 /* When rescanning, reload --as-needed shared libs. */
3225 else if ((mode
& OPEN_BFD_RESCAN
) != 0
3226 && plugin_insert
== NULL
3227 && s
->input_statement
.flags
.loaded
3228 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3229 && s
->input_statement
.the_bfd
!= NULL
3230 && ((s
->input_statement
.the_bfd
->flags
) & DYNAMIC
) != 0
3231 && plugin_should_reload (s
->input_statement
.the_bfd
))
3233 s
->input_statement
.flags
.loaded
= FALSE
;
3234 s
->input_statement
.flags
.reload
= TRUE
;
3238 os_tail
= lang_output_section_statement
.tail
;
3239 lang_list_init (&add
);
3241 if (! load_symbols (&s
->input_statement
, &add
))
3242 config
.make_executable
= FALSE
;
3244 if (add
.head
!= NULL
)
3246 /* If this was a script with output sections then
3247 tack any added statements on to the end of the
3248 list. This avoids having to reorder the output
3249 section statement list. Very likely the user
3250 forgot -T, and whatever we do here will not meet
3251 naive user expectations. */
3252 if (os_tail
!= lang_output_section_statement
.tail
)
3254 einfo (_("%P: warning: %s contains output sections;"
3255 " did you forget -T?\n"),
3256 s
->input_statement
.filename
);
3257 *stat_ptr
->tail
= add
.head
;
3258 stat_ptr
->tail
= add
.tail
;
3262 *add
.tail
= s
->header
.next
;
3263 s
->header
.next
= add
.head
;
3267 #ifdef ENABLE_PLUGINS
3268 /* If we have found the point at which a plugin added new
3269 files, clear plugin_insert to enable archive rescan. */
3270 if (&s
->input_statement
== plugin_insert
)
3271 plugin_insert
= NULL
;
3274 case lang_assignment_statement_enum
:
3275 if (s
->assignment_statement
.exp
->assign
.defsym
)
3276 /* This is from a --defsym on the command line. */
3277 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3284 /* Exit if any of the files were missing. */
3285 if (input_flags
.missing_file
)
3289 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3292 lang_track_definedness (const char *name
)
3294 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3295 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3298 /* New-function for the definedness hash table. */
3300 static struct bfd_hash_entry
*
3301 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3302 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3303 const char *name ATTRIBUTE_UNUSED
)
3305 struct lang_definedness_hash_entry
*ret
3306 = (struct lang_definedness_hash_entry
*) entry
;
3309 ret
= (struct lang_definedness_hash_entry
*)
3310 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3313 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3315 ret
->iteration
= -1;
3319 /* Return the iteration when the definition of NAME was last updated. A
3320 value of -1 means that the symbol is not defined in the linker script
3321 or the command line, but may be defined in the linker symbol table. */
3324 lang_symbol_definition_iteration (const char *name
)
3326 struct lang_definedness_hash_entry
*defentry
3327 = (struct lang_definedness_hash_entry
*)
3328 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3330 /* We've already created this one on the presence of DEFINED in the
3331 script, so it can't be NULL unless something is borked elsewhere in
3333 if (defentry
== NULL
)
3336 return defentry
->iteration
;
3339 /* Update the definedness state of NAME. */
3342 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3344 struct lang_definedness_hash_entry
*defentry
3345 = (struct lang_definedness_hash_entry
*)
3346 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3348 /* We don't keep track of symbols not tested with DEFINED. */
3349 if (defentry
== NULL
)
3352 /* If the symbol was already defined, and not from an earlier statement
3353 iteration, don't update the definedness iteration, because that'd
3354 make the symbol seem defined in the linker script at this point, and
3355 it wasn't; it was defined in some object. If we do anyway, DEFINED
3356 would start to yield false before this point and the construct "sym =
3357 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3359 if (h
->type
!= bfd_link_hash_undefined
3360 && h
->type
!= bfd_link_hash_common
3361 && h
->type
!= bfd_link_hash_new
3362 && defentry
->iteration
== -1)
3365 defentry
->iteration
= lang_statement_iteration
;
3368 /* Add the supplied name to the symbol table as an undefined reference.
3369 This is a two step process as the symbol table doesn't even exist at
3370 the time the ld command line is processed. First we put the name
3371 on a list, then, once the output file has been opened, transfer the
3372 name to the symbol table. */
3374 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3376 #define ldlang_undef_chain_list_head entry_symbol.next
3379 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3381 ldlang_undef_chain_list_type
*new_undef
;
3383 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3384 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3385 new_undef
->next
= ldlang_undef_chain_list_head
;
3386 ldlang_undef_chain_list_head
= new_undef
;
3388 new_undef
->name
= xstrdup (name
);
3390 if (link_info
.output_bfd
!= NULL
)
3391 insert_undefined (new_undef
->name
);
3394 /* Insert NAME as undefined in the symbol table. */
3397 insert_undefined (const char *name
)
3399 struct bfd_link_hash_entry
*h
;
3401 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3403 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3404 if (h
->type
== bfd_link_hash_new
)
3406 h
->type
= bfd_link_hash_undefined
;
3407 h
->u
.undef
.abfd
= NULL
;
3408 bfd_link_add_undef (link_info
.hash
, h
);
3412 /* Run through the list of undefineds created above and place them
3413 into the linker hash table as undefined symbols belonging to the
3417 lang_place_undefineds (void)
3419 ldlang_undef_chain_list_type
*ptr
;
3421 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3422 insert_undefined (ptr
->name
);
3425 /* Check for all readonly or some readwrite sections. */
3428 check_input_sections
3429 (lang_statement_union_type
*s
,
3430 lang_output_section_statement_type
*output_section_statement
)
3432 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3434 switch (s
->header
.type
)
3436 case lang_wild_statement_enum
:
3437 walk_wild (&s
->wild_statement
, check_section_callback
,
3438 output_section_statement
);
3439 if (! output_section_statement
->all_input_readonly
)
3442 case lang_constructors_statement_enum
:
3443 check_input_sections (constructor_list
.head
,
3444 output_section_statement
);
3445 if (! output_section_statement
->all_input_readonly
)
3448 case lang_group_statement_enum
:
3449 check_input_sections (s
->group_statement
.children
.head
,
3450 output_section_statement
);
3451 if (! output_section_statement
->all_input_readonly
)
3460 /* Update wildcard statements if needed. */
3463 update_wild_statements (lang_statement_union_type
*s
)
3465 struct wildcard_list
*sec
;
3467 switch (sort_section
)
3477 for (; s
!= NULL
; s
= s
->header
.next
)
3479 switch (s
->header
.type
)
3484 case lang_wild_statement_enum
:
3485 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3488 switch (sec
->spec
.sorted
)
3491 sec
->spec
.sorted
= sort_section
;
3494 if (sort_section
== by_alignment
)
3495 sec
->spec
.sorted
= by_name_alignment
;
3498 if (sort_section
== by_name
)
3499 sec
->spec
.sorted
= by_alignment_name
;
3507 case lang_constructors_statement_enum
:
3508 update_wild_statements (constructor_list
.head
);
3511 case lang_output_section_statement_enum
:
3512 /* Don't sort .init/.fini sections. */
3513 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3514 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3515 update_wild_statements
3516 (s
->output_section_statement
.children
.head
);
3519 case lang_group_statement_enum
:
3520 update_wild_statements (s
->group_statement
.children
.head
);
3528 /* Open input files and attach to output sections. */
3531 map_input_to_output_sections
3532 (lang_statement_union_type
*s
, const char *target
,
3533 lang_output_section_statement_type
*os
)
3535 for (; s
!= NULL
; s
= s
->header
.next
)
3537 lang_output_section_statement_type
*tos
;
3540 switch (s
->header
.type
)
3542 case lang_wild_statement_enum
:
3543 wild (&s
->wild_statement
, target
, os
);
3545 case lang_constructors_statement_enum
:
3546 map_input_to_output_sections (constructor_list
.head
,
3550 case lang_output_section_statement_enum
:
3551 tos
= &s
->output_section_statement
;
3552 if (tos
->constraint
!= 0)
3554 if (tos
->constraint
!= ONLY_IF_RW
3555 && tos
->constraint
!= ONLY_IF_RO
)
3557 tos
->all_input_readonly
= TRUE
;
3558 check_input_sections (tos
->children
.head
, tos
);
3559 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3561 tos
->constraint
= -1;
3565 map_input_to_output_sections (tos
->children
.head
,
3569 case lang_output_statement_enum
:
3571 case lang_target_statement_enum
:
3572 target
= s
->target_statement
.target
;
3574 case lang_group_statement_enum
:
3575 map_input_to_output_sections (s
->group_statement
.children
.head
,
3579 case lang_data_statement_enum
:
3580 /* Make sure that any sections mentioned in the expression
3582 exp_init_os (s
->data_statement
.exp
);
3583 /* The output section gets CONTENTS, ALLOC and LOAD, but
3584 these may be overridden by the script. */
3585 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3586 switch (os
->sectype
)
3588 case normal_section
:
3589 case overlay_section
:
3591 case noalloc_section
:
3592 flags
= SEC_HAS_CONTENTS
;
3594 case noload_section
:
3595 if (bfd_get_flavour (link_info
.output_bfd
)
3596 == bfd_target_elf_flavour
)
3597 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3599 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3602 if (os
->bfd_section
== NULL
)
3603 init_os (os
, flags
);
3605 os
->bfd_section
->flags
|= flags
;
3607 case lang_input_section_enum
:
3609 case lang_fill_statement_enum
:
3610 case lang_object_symbols_statement_enum
:
3611 case lang_reloc_statement_enum
:
3612 case lang_padding_statement_enum
:
3613 case lang_input_statement_enum
:
3614 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3617 case lang_assignment_statement_enum
:
3618 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3621 /* Make sure that any sections mentioned in the assignment
3623 exp_init_os (s
->assignment_statement
.exp
);
3625 case lang_address_statement_enum
:
3626 /* Mark the specified section with the supplied address.
3627 If this section was actually a segment marker, then the
3628 directive is ignored if the linker script explicitly
3629 processed the segment marker. Originally, the linker
3630 treated segment directives (like -Ttext on the
3631 command-line) as section directives. We honor the
3632 section directive semantics for backwards compatibilty;
3633 linker scripts that do not specifically check for
3634 SEGMENT_START automatically get the old semantics. */
3635 if (!s
->address_statement
.segment
3636 || !s
->address_statement
.segment
->used
)
3638 const char *name
= s
->address_statement
.section_name
;
3640 /* Create the output section statement here so that
3641 orphans with a set address will be placed after other
3642 script sections. If we let the orphan placement code
3643 place them in amongst other sections then the address
3644 will affect following script sections, which is
3645 likely to surprise naive users. */
3646 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3647 tos
->addr_tree
= s
->address_statement
.address
;
3648 if (tos
->bfd_section
== NULL
)
3652 case lang_insert_statement_enum
:
3658 /* An insert statement snips out all the linker statements from the
3659 start of the list and places them after the output section
3660 statement specified by the insert. This operation is complicated
3661 by the fact that we keep a doubly linked list of output section
3662 statements as well as the singly linked list of all statements. */
3665 process_insert_statements (void)
3667 lang_statement_union_type
**s
;
3668 lang_output_section_statement_type
*first_os
= NULL
;
3669 lang_output_section_statement_type
*last_os
= NULL
;
3670 lang_output_section_statement_type
*os
;
3672 /* "start of list" is actually the statement immediately after
3673 the special abs_section output statement, so that it isn't
3675 s
= &lang_output_section_statement
.head
;
3676 while (*(s
= &(*s
)->header
.next
) != NULL
)
3678 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3680 /* Keep pointers to the first and last output section
3681 statement in the sequence we may be about to move. */
3682 os
= &(*s
)->output_section_statement
;
3684 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3687 /* Set constraint negative so that lang_output_section_find
3688 won't match this output section statement. At this
3689 stage in linking constraint has values in the range
3690 [-1, ONLY_IN_RW]. */
3691 last_os
->constraint
= -2 - last_os
->constraint
;
3692 if (first_os
== NULL
)
3695 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3697 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3698 lang_output_section_statement_type
*where
;
3699 lang_statement_union_type
**ptr
;
3700 lang_statement_union_type
*first
;
3702 where
= lang_output_section_find (i
->where
);
3703 if (where
!= NULL
&& i
->is_before
)
3706 where
= where
->prev
;
3707 while (where
!= NULL
&& where
->constraint
< 0);
3711 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3715 /* Deal with reordering the output section statement list. */
3716 if (last_os
!= NULL
)
3718 asection
*first_sec
, *last_sec
;
3719 struct lang_output_section_statement_struct
**next
;
3721 /* Snip out the output sections we are moving. */
3722 first_os
->prev
->next
= last_os
->next
;
3723 if (last_os
->next
== NULL
)
3725 next
= &first_os
->prev
->next
;
3726 lang_output_section_statement
.tail
3727 = (lang_statement_union_type
**) next
;
3730 last_os
->next
->prev
= first_os
->prev
;
3731 /* Add them in at the new position. */
3732 last_os
->next
= where
->next
;
3733 if (where
->next
== NULL
)
3735 next
= &last_os
->next
;
3736 lang_output_section_statement
.tail
3737 = (lang_statement_union_type
**) next
;
3740 where
->next
->prev
= last_os
;
3741 first_os
->prev
= where
;
3742 where
->next
= first_os
;
3744 /* Move the bfd sections in the same way. */
3747 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3749 os
->constraint
= -2 - os
->constraint
;
3750 if (os
->bfd_section
!= NULL
3751 && os
->bfd_section
->owner
!= NULL
)
3753 last_sec
= os
->bfd_section
;
3754 if (first_sec
== NULL
)
3755 first_sec
= last_sec
;
3760 if (last_sec
!= NULL
)
3762 asection
*sec
= where
->bfd_section
;
3764 sec
= output_prev_sec_find (where
);
3766 /* The place we want to insert must come after the
3767 sections we are moving. So if we find no
3768 section or if the section is the same as our
3769 last section, then no move is needed. */
3770 if (sec
!= NULL
&& sec
!= last_sec
)
3772 /* Trim them off. */
3773 if (first_sec
->prev
!= NULL
)
3774 first_sec
->prev
->next
= last_sec
->next
;
3776 link_info
.output_bfd
->sections
= last_sec
->next
;
3777 if (last_sec
->next
!= NULL
)
3778 last_sec
->next
->prev
= first_sec
->prev
;
3780 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3782 last_sec
->next
= sec
->next
;
3783 if (sec
->next
!= NULL
)
3784 sec
->next
->prev
= last_sec
;
3786 link_info
.output_bfd
->section_last
= last_sec
;
3787 first_sec
->prev
= sec
;
3788 sec
->next
= first_sec
;
3796 ptr
= insert_os_after (where
);
3797 /* Snip everything after the abs_section output statement we
3798 know is at the start of the list, up to and including
3799 the insert statement we are currently processing. */
3800 first
= lang_output_section_statement
.head
->header
.next
;
3801 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3802 /* Add them back where they belong. */
3805 statement_list
.tail
= s
;
3807 s
= &lang_output_section_statement
.head
;
3811 /* Undo constraint twiddling. */
3812 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3814 os
->constraint
= -2 - os
->constraint
;
3820 /* An output section might have been removed after its statement was
3821 added. For example, ldemul_before_allocation can remove dynamic
3822 sections if they turn out to be not needed. Clean them up here. */
3825 strip_excluded_output_sections (void)
3827 lang_output_section_statement_type
*os
;
3829 /* Run lang_size_sections (if not already done). */
3830 if (expld
.phase
!= lang_mark_phase_enum
)
3832 expld
.phase
= lang_mark_phase_enum
;
3833 expld
.dataseg
.phase
= exp_dataseg_none
;
3834 one_lang_size_sections_pass (NULL
, FALSE
);
3835 lang_reset_memory_regions ();
3838 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3842 asection
*output_section
;
3843 bfd_boolean exclude
;
3845 if (os
->constraint
< 0)
3848 output_section
= os
->bfd_section
;
3849 if (output_section
== NULL
)
3852 exclude
= (output_section
->rawsize
== 0
3853 && (output_section
->flags
& SEC_KEEP
) == 0
3854 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3857 /* Some sections have not yet been sized, notably .gnu.version,
3858 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3859 input sections, so don't drop output sections that have such
3860 input sections unless they are also marked SEC_EXCLUDE. */
3861 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3865 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3866 if ((s
->flags
& SEC_EXCLUDE
) == 0
3867 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3868 || link_info
.emitrelocations
))
3875 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3876 output_section
->map_head
.link_order
= NULL
;
3877 output_section
->map_tail
.link_order
= NULL
;
3881 /* We don't set bfd_section to NULL since bfd_section of the
3882 removed output section statement may still be used. */
3883 if (!os
->update_dot
)
3885 output_section
->flags
|= SEC_EXCLUDE
;
3886 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3887 link_info
.output_bfd
->section_count
--;
3891 /* Stop future calls to lang_add_section from messing with map_head
3892 and map_tail link_order fields. */
3893 stripped_excluded_sections
= TRUE
;
3897 print_output_section_statement
3898 (lang_output_section_statement_type
*output_section_statement
)
3900 asection
*section
= output_section_statement
->bfd_section
;
3903 if (output_section_statement
!= abs_output_section
)
3905 minfo ("\n%s", output_section_statement
->name
);
3907 if (section
!= NULL
)
3909 print_dot
= section
->vma
;
3911 len
= strlen (output_section_statement
->name
);
3912 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3917 while (len
< SECTION_NAME_MAP_LENGTH
)
3923 minfo ("0x%V %W", section
->vma
, section
->size
);
3925 if (section
->vma
!= section
->lma
)
3926 minfo (_(" load address 0x%V"), section
->lma
);
3928 if (output_section_statement
->update_dot_tree
!= NULL
)
3929 exp_fold_tree (output_section_statement
->update_dot_tree
,
3930 bfd_abs_section_ptr
, &print_dot
);
3936 print_statement_list (output_section_statement
->children
.head
,
3937 output_section_statement
);
3941 print_assignment (lang_assignment_statement_type
*assignment
,
3942 lang_output_section_statement_type
*output_section
)
3949 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3952 if (assignment
->exp
->type
.node_class
== etree_assert
)
3955 tree
= assignment
->exp
->assert_s
.child
;
3959 const char *dst
= assignment
->exp
->assign
.dst
;
3961 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3962 expld
.assign_name
= dst
;
3963 tree
= assignment
->exp
->assign
.src
;
3966 osec
= output_section
->bfd_section
;
3968 osec
= bfd_abs_section_ptr
;
3969 exp_fold_tree (tree
, osec
, &print_dot
);
3970 if (expld
.result
.valid_p
)
3974 if (assignment
->exp
->type
.node_class
== etree_assert
3976 || expld
.assign_name
!= NULL
)
3978 value
= expld
.result
.value
;
3980 if (expld
.result
.section
!= NULL
)
3981 value
+= expld
.result
.section
->vma
;
3983 minfo ("0x%V", value
);
3989 struct bfd_link_hash_entry
*h
;
3991 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3992 FALSE
, FALSE
, TRUE
);
3995 value
= h
->u
.def
.value
;
3996 value
+= h
->u
.def
.section
->output_section
->vma
;
3997 value
+= h
->u
.def
.section
->output_offset
;
3999 minfo ("[0x%V]", value
);
4002 minfo ("[unresolved]");
4012 expld
.assign_name
= NULL
;
4015 exp_print_tree (assignment
->exp
);
4020 print_input_statement (lang_input_statement_type
*statm
)
4022 if (statm
->filename
!= NULL
4023 && (statm
->the_bfd
== NULL
4024 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4025 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4028 /* Print all symbols defined in a particular section. This is called
4029 via bfd_link_hash_traverse, or by print_all_symbols. */
4032 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4034 asection
*sec
= (asection
*) ptr
;
4036 if ((hash_entry
->type
== bfd_link_hash_defined
4037 || hash_entry
->type
== bfd_link_hash_defweak
)
4038 && sec
== hash_entry
->u
.def
.section
)
4042 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4045 (hash_entry
->u
.def
.value
4046 + hash_entry
->u
.def
.section
->output_offset
4047 + hash_entry
->u
.def
.section
->output_section
->vma
));
4049 minfo (" %T\n", hash_entry
->root
.string
);
4056 hash_entry_addr_cmp (const void *a
, const void *b
)
4058 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4059 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4061 if (l
->u
.def
.value
< r
->u
.def
.value
)
4063 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4070 print_all_symbols (asection
*sec
)
4072 input_section_userdata_type
*ud
4073 = (input_section_userdata_type
*) get_userdata (sec
);
4074 struct map_symbol_def
*def
;
4075 struct bfd_link_hash_entry
**entries
;
4081 *ud
->map_symbol_def_tail
= 0;
4083 /* Sort the symbols by address. */
4084 entries
= (struct bfd_link_hash_entry
**)
4085 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4087 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4088 entries
[i
] = def
->entry
;
4090 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4091 hash_entry_addr_cmp
);
4093 /* Print the symbols. */
4094 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4095 print_one_symbol (entries
[i
], sec
);
4097 obstack_free (&map_obstack
, entries
);
4100 /* Print information about an input section to the map file. */
4103 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4105 bfd_size_type size
= i
->size
;
4112 minfo ("%s", i
->name
);
4114 len
= 1 + strlen (i
->name
);
4115 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4120 while (len
< SECTION_NAME_MAP_LENGTH
)
4126 if (i
->output_section
!= NULL
4127 && i
->output_section
->owner
== link_info
.output_bfd
)
4128 addr
= i
->output_section
->vma
+ i
->output_offset
;
4136 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4138 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4140 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4152 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4155 if (i
->output_section
!= NULL
4156 && i
->output_section
->owner
== link_info
.output_bfd
)
4158 if (link_info
.reduce_memory_overheads
)
4159 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4161 print_all_symbols (i
);
4163 /* Update print_dot, but make sure that we do not move it
4164 backwards - this could happen if we have overlays and a
4165 later overlay is shorter than an earier one. */
4166 if (addr
+ TO_ADDR (size
) > print_dot
)
4167 print_dot
= addr
+ TO_ADDR (size
);
4172 print_fill_statement (lang_fill_statement_type
*fill
)
4176 fputs (" FILL mask 0x", config
.map_file
);
4177 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4178 fprintf (config
.map_file
, "%02x", *p
);
4179 fputs ("\n", config
.map_file
);
4183 print_data_statement (lang_data_statement_type
*data
)
4191 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4194 addr
= data
->output_offset
;
4195 if (data
->output_section
!= NULL
)
4196 addr
+= data
->output_section
->vma
;
4224 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4226 if (data
->exp
->type
.node_class
!= etree_value
)
4229 exp_print_tree (data
->exp
);
4234 print_dot
= addr
+ TO_ADDR (size
);
4237 /* Print an address statement. These are generated by options like
4241 print_address_statement (lang_address_statement_type
*address
)
4243 minfo (_("Address of section %s set to "), address
->section_name
);
4244 exp_print_tree (address
->address
);
4248 /* Print a reloc statement. */
4251 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4258 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4261 addr
= reloc
->output_offset
;
4262 if (reloc
->output_section
!= NULL
)
4263 addr
+= reloc
->output_section
->vma
;
4265 size
= bfd_get_reloc_size (reloc
->howto
);
4267 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4269 if (reloc
->name
!= NULL
)
4270 minfo ("%s+", reloc
->name
);
4272 minfo ("%s+", reloc
->section
->name
);
4274 exp_print_tree (reloc
->addend_exp
);
4278 print_dot
= addr
+ TO_ADDR (size
);
4282 print_padding_statement (lang_padding_statement_type
*s
)
4290 len
= sizeof " *fill*" - 1;
4291 while (len
< SECTION_NAME_MAP_LENGTH
)
4297 addr
= s
->output_offset
;
4298 if (s
->output_section
!= NULL
)
4299 addr
+= s
->output_section
->vma
;
4300 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4302 if (s
->fill
->size
!= 0)
4306 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4307 fprintf (config
.map_file
, "%02x", *p
);
4312 print_dot
= addr
+ TO_ADDR (s
->size
);
4316 print_wild_statement (lang_wild_statement_type
*w
,
4317 lang_output_section_statement_type
*os
)
4319 struct wildcard_list
*sec
;
4323 if (w
->filenames_sorted
)
4325 if (w
->filename
!= NULL
)
4326 minfo ("%s", w
->filename
);
4329 if (w
->filenames_sorted
)
4333 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4335 if (sec
->spec
.sorted
)
4337 if (sec
->spec
.exclude_name_list
!= NULL
)
4340 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4341 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4342 minfo (" %s", tmp
->name
);
4345 if (sec
->spec
.name
!= NULL
)
4346 minfo ("%s", sec
->spec
.name
);
4349 if (sec
->spec
.sorted
)
4358 print_statement_list (w
->children
.head
, os
);
4361 /* Print a group statement. */
4364 print_group (lang_group_statement_type
*s
,
4365 lang_output_section_statement_type
*os
)
4367 fprintf (config
.map_file
, "START GROUP\n");
4368 print_statement_list (s
->children
.head
, os
);
4369 fprintf (config
.map_file
, "END GROUP\n");
4372 /* Print the list of statements in S.
4373 This can be called for any statement type. */
4376 print_statement_list (lang_statement_union_type
*s
,
4377 lang_output_section_statement_type
*os
)
4381 print_statement (s
, os
);
4386 /* Print the first statement in statement list S.
4387 This can be called for any statement type. */
4390 print_statement (lang_statement_union_type
*s
,
4391 lang_output_section_statement_type
*os
)
4393 switch (s
->header
.type
)
4396 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4399 case lang_constructors_statement_enum
:
4400 if (constructor_list
.head
!= NULL
)
4402 if (constructors_sorted
)
4403 minfo (" SORT (CONSTRUCTORS)\n");
4405 minfo (" CONSTRUCTORS\n");
4406 print_statement_list (constructor_list
.head
, os
);
4409 case lang_wild_statement_enum
:
4410 print_wild_statement (&s
->wild_statement
, os
);
4412 case lang_address_statement_enum
:
4413 print_address_statement (&s
->address_statement
);
4415 case lang_object_symbols_statement_enum
:
4416 minfo (" CREATE_OBJECT_SYMBOLS\n");
4418 case lang_fill_statement_enum
:
4419 print_fill_statement (&s
->fill_statement
);
4421 case lang_data_statement_enum
:
4422 print_data_statement (&s
->data_statement
);
4424 case lang_reloc_statement_enum
:
4425 print_reloc_statement (&s
->reloc_statement
);
4427 case lang_input_section_enum
:
4428 print_input_section (s
->input_section
.section
, FALSE
);
4430 case lang_padding_statement_enum
:
4431 print_padding_statement (&s
->padding_statement
);
4433 case lang_output_section_statement_enum
:
4434 print_output_section_statement (&s
->output_section_statement
);
4436 case lang_assignment_statement_enum
:
4437 print_assignment (&s
->assignment_statement
, os
);
4439 case lang_target_statement_enum
:
4440 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4442 case lang_output_statement_enum
:
4443 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4444 if (output_target
!= NULL
)
4445 minfo (" %s", output_target
);
4448 case lang_input_statement_enum
:
4449 print_input_statement (&s
->input_statement
);
4451 case lang_group_statement_enum
:
4452 print_group (&s
->group_statement
, os
);
4454 case lang_insert_statement_enum
:
4455 minfo ("INSERT %s %s\n",
4456 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4457 s
->insert_statement
.where
);
4463 print_statements (void)
4465 print_statement_list (statement_list
.head
, abs_output_section
);
4468 /* Print the first N statements in statement list S to STDERR.
4469 If N == 0, nothing is printed.
4470 If N < 0, the entire list is printed.
4471 Intended to be called from GDB. */
4474 dprint_statement (lang_statement_union_type
*s
, int n
)
4476 FILE *map_save
= config
.map_file
;
4478 config
.map_file
= stderr
;
4481 print_statement_list (s
, abs_output_section
);
4484 while (s
&& --n
>= 0)
4486 print_statement (s
, abs_output_section
);
4491 config
.map_file
= map_save
;
4495 insert_pad (lang_statement_union_type
**ptr
,
4497 bfd_size_type alignment_needed
,
4498 asection
*output_section
,
4501 static fill_type zero_fill
;
4502 lang_statement_union_type
*pad
= NULL
;
4504 if (ptr
!= &statement_list
.head
)
4505 pad
= ((lang_statement_union_type
*)
4506 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4508 && pad
->header
.type
== lang_padding_statement_enum
4509 && pad
->padding_statement
.output_section
== output_section
)
4511 /* Use the existing pad statement. */
4513 else if ((pad
= *ptr
) != NULL
4514 && pad
->header
.type
== lang_padding_statement_enum
4515 && pad
->padding_statement
.output_section
== output_section
)
4517 /* Use the existing pad statement. */
4521 /* Make a new padding statement, linked into existing chain. */
4522 pad
= (lang_statement_union_type
*)
4523 stat_alloc (sizeof (lang_padding_statement_type
));
4524 pad
->header
.next
= *ptr
;
4526 pad
->header
.type
= lang_padding_statement_enum
;
4527 pad
->padding_statement
.output_section
= output_section
;
4530 pad
->padding_statement
.fill
= fill
;
4532 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4533 pad
->padding_statement
.size
= alignment_needed
;
4534 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4535 - output_section
->vma
);
4538 /* Work out how much this section will move the dot point. */
4542 (lang_statement_union_type
**this_ptr
,
4543 lang_output_section_statement_type
*output_section_statement
,
4547 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4548 asection
*i
= is
->section
;
4550 if (i
->sec_info_type
!= SEC_INFO_TYPE_JUST_SYMS
4551 && (i
->flags
& SEC_EXCLUDE
) == 0)
4553 bfd_size_type alignment_needed
;
4556 /* Align this section first to the input sections requirement,
4557 then to the output section's requirement. If this alignment
4558 is greater than any seen before, then record it too. Perform
4559 the alignment by inserting a magic 'padding' statement. */
4561 if (output_section_statement
->subsection_alignment
!= -1)
4562 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4564 o
= output_section_statement
->bfd_section
;
4565 if (o
->alignment_power
< i
->alignment_power
)
4566 o
->alignment_power
= i
->alignment_power
;
4568 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4570 if (alignment_needed
!= 0)
4572 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4573 dot
+= alignment_needed
;
4576 /* Remember where in the output section this input section goes. */
4578 i
->output_offset
= dot
- o
->vma
;
4580 /* Mark how big the output section must be to contain this now. */
4581 dot
+= TO_ADDR (i
->size
);
4582 o
->size
= TO_SIZE (dot
- o
->vma
);
4586 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4593 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4595 const asection
*sec1
= *(const asection
**) arg1
;
4596 const asection
*sec2
= *(const asection
**) arg2
;
4598 if (bfd_section_lma (sec1
->owner
, sec1
)
4599 < bfd_section_lma (sec2
->owner
, sec2
))
4601 else if (bfd_section_lma (sec1
->owner
, sec1
)
4602 > bfd_section_lma (sec2
->owner
, sec2
))
4604 else if (sec1
->id
< sec2
->id
)
4606 else if (sec1
->id
> sec2
->id
)
4612 #define IGNORE_SECTION(s) \
4613 ((s->flags & SEC_ALLOC) == 0 \
4614 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4615 && (s->flags & SEC_LOAD) == 0))
4617 /* Check to see if any allocated sections overlap with other allocated
4618 sections. This can happen if a linker script specifies the output
4619 section addresses of the two sections. Also check whether any memory
4620 region has overflowed. */
4623 lang_check_section_addresses (void)
4626 asection
**sections
, **spp
;
4633 lang_memory_region_type
*m
;
4635 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4638 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4639 sections
= (asection
**) xmalloc (amt
);
4641 /* Scan all sections in the output list. */
4643 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4645 /* Only consider loadable sections with real contents. */
4646 if (!(s
->flags
& SEC_LOAD
)
4647 || !(s
->flags
& SEC_ALLOC
)
4651 sections
[count
] = s
;
4658 qsort (sections
, (size_t) count
, sizeof (asection
*),
4659 sort_sections_by_lma
);
4664 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4665 for (count
--; count
; count
--)
4667 /* We must check the sections' LMA addresses not their VMA
4668 addresses because overlay sections can have overlapping VMAs
4669 but they must have distinct LMAs. */
4675 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4677 /* Look for an overlap. We have sorted sections by lma, so we
4678 know that s_start >= p_start. Besides the obvious case of
4679 overlap when the current section starts before the previous
4680 one ends, we also must have overlap if the previous section
4681 wraps around the address space. */
4682 if (s_start
<= p_end
4684 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4685 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4690 /* If any memory region has overflowed, report by how much.
4691 We do not issue this diagnostic for regions that had sections
4692 explicitly placed outside their bounds; os_region_check's
4693 diagnostics are adequate for that case.
4695 FIXME: It is conceivable that m->current - (m->origin + m->length)
4696 might overflow a 32-bit integer. There is, alas, no way to print
4697 a bfd_vma quantity in decimal. */
4698 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4699 if (m
->had_full_message
)
4700 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4701 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4705 /* Make sure the new address is within the region. We explicitly permit the
4706 current address to be at the exact end of the region when the address is
4707 non-zero, in case the region is at the end of addressable memory and the
4708 calculation wraps around. */
4711 os_region_check (lang_output_section_statement_type
*os
,
4712 lang_memory_region_type
*region
,
4716 if ((region
->current
< region
->origin
4717 || (region
->current
- region
->origin
> region
->length
))
4718 && ((region
->current
!= region
->origin
+ region
->length
)
4723 einfo (_("%X%P: address 0x%v of %B section `%s'"
4724 " is not within region `%s'\n"),
4726 os
->bfd_section
->owner
,
4727 os
->bfd_section
->name
,
4728 region
->name_list
.name
);
4730 else if (!region
->had_full_message
)
4732 region
->had_full_message
= TRUE
;
4734 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4735 os
->bfd_section
->owner
,
4736 os
->bfd_section
->name
,
4737 region
->name_list
.name
);
4742 /* Set the sizes for all the output sections. */
4745 lang_size_sections_1
4746 (lang_statement_union_type
**prev
,
4747 lang_output_section_statement_type
*output_section_statement
,
4751 bfd_boolean check_regions
)
4753 lang_statement_union_type
*s
;
4755 /* Size up the sections from their constituent parts. */
4756 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4758 switch (s
->header
.type
)
4760 case lang_output_section_statement_enum
:
4762 bfd_vma newdot
, after
;
4763 lang_output_section_statement_type
*os
;
4764 lang_memory_region_type
*r
;
4765 int section_alignment
= 0;
4767 os
= &s
->output_section_statement
;
4768 if (os
->constraint
== -1)
4771 /* FIXME: We shouldn't need to zero section vmas for ld -r
4772 here, in lang_insert_orphan, or in the default linker scripts.
4773 This is covering for coff backend linker bugs. See PR6945. */
4774 if (os
->addr_tree
== NULL
4775 && link_info
.relocatable
4776 && (bfd_get_flavour (link_info
.output_bfd
)
4777 == bfd_target_coff_flavour
))
4778 os
->addr_tree
= exp_intop (0);
4779 if (os
->addr_tree
!= NULL
)
4781 os
->processed_vma
= FALSE
;
4782 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4784 if (expld
.result
.valid_p
)
4786 dot
= expld
.result
.value
;
4787 if (expld
.result
.section
!= NULL
)
4788 dot
+= expld
.result
.section
->vma
;
4790 else if (expld
.phase
!= lang_mark_phase_enum
)
4791 einfo (_("%F%S: non constant or forward reference"
4792 " address expression for section %s\n"),
4793 os
->addr_tree
, os
->name
);
4796 if (os
->bfd_section
== NULL
)
4797 /* This section was removed or never actually created. */
4800 /* If this is a COFF shared library section, use the size and
4801 address from the input section. FIXME: This is COFF
4802 specific; it would be cleaner if there were some other way
4803 to do this, but nothing simple comes to mind. */
4804 if (((bfd_get_flavour (link_info
.output_bfd
)
4805 == bfd_target_ecoff_flavour
)
4806 || (bfd_get_flavour (link_info
.output_bfd
)
4807 == bfd_target_coff_flavour
))
4808 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4812 if (os
->children
.head
== NULL
4813 || os
->children
.head
->header
.next
!= NULL
4814 || (os
->children
.head
->header
.type
4815 != lang_input_section_enum
))
4816 einfo (_("%P%X: Internal error on COFF shared library"
4817 " section %s\n"), os
->name
);
4819 input
= os
->children
.head
->input_section
.section
;
4820 bfd_set_section_vma (os
->bfd_section
->owner
,
4822 bfd_section_vma (input
->owner
, input
));
4823 os
->bfd_section
->size
= input
->size
;
4828 if (bfd_is_abs_section (os
->bfd_section
))
4830 /* No matter what happens, an abs section starts at zero. */
4831 ASSERT (os
->bfd_section
->vma
== 0);
4835 if (os
->addr_tree
== NULL
)
4837 /* No address specified for this section, get one
4838 from the region specification. */
4839 if (os
->region
== NULL
4840 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4841 && os
->region
->name_list
.name
[0] == '*'
4842 && strcmp (os
->region
->name_list
.name
,
4843 DEFAULT_MEMORY_REGION
) == 0))
4845 os
->region
= lang_memory_default (os
->bfd_section
);
4848 /* If a loadable section is using the default memory
4849 region, and some non default memory regions were
4850 defined, issue an error message. */
4852 && !IGNORE_SECTION (os
->bfd_section
)
4853 && ! link_info
.relocatable
4855 && strcmp (os
->region
->name_list
.name
,
4856 DEFAULT_MEMORY_REGION
) == 0
4857 && lang_memory_region_list
!= NULL
4858 && (strcmp (lang_memory_region_list
->name_list
.name
,
4859 DEFAULT_MEMORY_REGION
) != 0
4860 || lang_memory_region_list
->next
!= NULL
)
4861 && expld
.phase
!= lang_mark_phase_enum
)
4863 /* By default this is an error rather than just a
4864 warning because if we allocate the section to the
4865 default memory region we can end up creating an
4866 excessively large binary, or even seg faulting when
4867 attempting to perform a negative seek. See
4868 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4869 for an example of this. This behaviour can be
4870 overridden by the using the --no-check-sections
4872 if (command_line
.check_section_addresses
)
4873 einfo (_("%P%F: error: no memory region specified"
4874 " for loadable section `%s'\n"),
4875 bfd_get_section_name (link_info
.output_bfd
,
4878 einfo (_("%P: warning: no memory region specified"
4879 " for loadable section `%s'\n"),
4880 bfd_get_section_name (link_info
.output_bfd
,
4884 newdot
= os
->region
->current
;
4885 section_alignment
= os
->bfd_section
->alignment_power
;
4888 section_alignment
= os
->section_alignment
;
4890 /* Align to what the section needs. */
4891 if (section_alignment
> 0)
4893 bfd_vma savedot
= newdot
;
4894 newdot
= align_power (newdot
, section_alignment
);
4896 if (newdot
!= savedot
4897 && (config
.warn_section_align
4898 || os
->addr_tree
!= NULL
)
4899 && expld
.phase
!= lang_mark_phase_enum
)
4900 einfo (_("%P: warning: changing start of section"
4901 " %s by %lu bytes\n"),
4902 os
->name
, (unsigned long) (newdot
- savedot
));
4905 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4907 os
->bfd_section
->output_offset
= 0;
4910 lang_size_sections_1 (&os
->children
.head
, os
,
4911 os
->fill
, newdot
, relax
, check_regions
);
4913 os
->processed_vma
= TRUE
;
4915 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4916 /* Except for some special linker created sections,
4917 no output section should change from zero size
4918 after strip_excluded_output_sections. A non-zero
4919 size on an ignored section indicates that some
4920 input section was not sized early enough. */
4921 ASSERT (os
->bfd_section
->size
== 0);
4924 dot
= os
->bfd_section
->vma
;
4926 /* Put the section within the requested block size, or
4927 align at the block boundary. */
4929 + TO_ADDR (os
->bfd_section
->size
)
4930 + os
->block_value
- 1)
4931 & - (bfd_vma
) os
->block_value
);
4933 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4936 /* Set section lma. */
4939 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4943 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4944 os
->bfd_section
->lma
= lma
;
4946 else if (os
->lma_region
!= NULL
)
4948 bfd_vma lma
= os
->lma_region
->current
;
4950 /* When LMA_REGION is the same as REGION, align the LMA
4951 as we did for the VMA, possibly including alignment
4952 from the bfd section. If a different region, then
4953 only align according to the value in the output
4954 statement unless specified otherwise. */
4955 if (os
->lma_region
!= os
->region
&& !os
->align_lma_with_input
)
4956 section_alignment
= os
->section_alignment
;
4957 if (section_alignment
> 0)
4958 lma
= align_power (lma
, section_alignment
);
4959 os
->bfd_section
->lma
= lma
;
4961 else if (r
->last_os
!= NULL
4962 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4967 last
= r
->last_os
->output_section_statement
.bfd_section
;
4969 /* A backwards move of dot should be accompanied by
4970 an explicit assignment to the section LMA (ie.
4971 os->load_base set) because backwards moves can
4972 create overlapping LMAs. */
4974 && os
->bfd_section
->size
!= 0
4975 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4977 /* If dot moved backwards then leave lma equal to
4978 vma. This is the old default lma, which might
4979 just happen to work when the backwards move is
4980 sufficiently large. Nag if this changes anything,
4981 so people can fix their linker scripts. */
4983 if (last
->vma
!= last
->lma
)
4984 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4989 /* If this is an overlay, set the current lma to that
4990 at the end of the previous section. */
4991 if (os
->sectype
== overlay_section
)
4992 lma
= last
->lma
+ last
->size
;
4994 /* Otherwise, keep the same lma to vma relationship
4995 as the previous section. */
4997 lma
= dot
+ last
->lma
- last
->vma
;
4999 if (section_alignment
> 0)
5000 lma
= align_power (lma
, section_alignment
);
5001 os
->bfd_section
->lma
= lma
;
5004 os
->processed_lma
= TRUE
;
5006 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5009 /* Keep track of normal sections using the default
5010 lma region. We use this to set the lma for
5011 following sections. Overlays or other linker
5012 script assignment to lma might mean that the
5013 default lma == vma is incorrect.
5014 To avoid warnings about dot moving backwards when using
5015 -Ttext, don't start tracking sections until we find one
5016 of non-zero size or with lma set differently to vma. */
5017 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5018 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5019 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5020 && (os
->bfd_section
->size
!= 0
5021 || (r
->last_os
== NULL
5022 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5023 || (r
->last_os
!= NULL
5024 && dot
>= (r
->last_os
->output_section_statement
5025 .bfd_section
->vma
)))
5026 && os
->lma_region
== NULL
5027 && !link_info
.relocatable
)
5030 /* .tbss sections effectively have zero size. */
5031 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5032 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5033 || link_info
.relocatable
)
5034 dot
+= TO_ADDR (os
->bfd_section
->size
);
5036 if (os
->update_dot_tree
!= 0)
5037 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5039 /* Update dot in the region ?
5040 We only do this if the section is going to be allocated,
5041 since unallocated sections do not contribute to the region's
5042 overall size in memory. */
5043 if (os
->region
!= NULL
5044 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5046 os
->region
->current
= dot
;
5049 /* Make sure the new address is within the region. */
5050 os_region_check (os
, os
->region
, os
->addr_tree
,
5051 os
->bfd_section
->vma
);
5053 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5054 && (os
->bfd_section
->flags
& SEC_LOAD
))
5056 os
->lma_region
->current
5057 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5060 os_region_check (os
, os
->lma_region
, NULL
,
5061 os
->bfd_section
->lma
);
5067 case lang_constructors_statement_enum
:
5068 dot
= lang_size_sections_1 (&constructor_list
.head
,
5069 output_section_statement
,
5070 fill
, dot
, relax
, check_regions
);
5073 case lang_data_statement_enum
:
5075 unsigned int size
= 0;
5077 s
->data_statement
.output_offset
=
5078 dot
- output_section_statement
->bfd_section
->vma
;
5079 s
->data_statement
.output_section
=
5080 output_section_statement
->bfd_section
;
5082 /* We might refer to provided symbols in the expression, and
5083 need to mark them as needed. */
5084 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5086 switch (s
->data_statement
.type
)
5104 if (size
< TO_SIZE ((unsigned) 1))
5105 size
= TO_SIZE ((unsigned) 1);
5106 dot
+= TO_ADDR (size
);
5107 output_section_statement
->bfd_section
->size
5108 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5113 case lang_reloc_statement_enum
:
5117 s
->reloc_statement
.output_offset
=
5118 dot
- output_section_statement
->bfd_section
->vma
;
5119 s
->reloc_statement
.output_section
=
5120 output_section_statement
->bfd_section
;
5121 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5122 dot
+= TO_ADDR (size
);
5123 output_section_statement
->bfd_section
->size
5124 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5128 case lang_wild_statement_enum
:
5129 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5130 output_section_statement
,
5131 fill
, dot
, relax
, check_regions
);
5134 case lang_object_symbols_statement_enum
:
5135 link_info
.create_object_symbols_section
=
5136 output_section_statement
->bfd_section
;
5139 case lang_output_statement_enum
:
5140 case lang_target_statement_enum
:
5143 case lang_input_section_enum
:
5147 i
= s
->input_section
.section
;
5152 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5153 einfo (_("%P%F: can't relax section: %E\n"));
5157 dot
= size_input_section (prev
, output_section_statement
,
5158 output_section_statement
->fill
, dot
);
5162 case lang_input_statement_enum
:
5165 case lang_fill_statement_enum
:
5166 s
->fill_statement
.output_section
=
5167 output_section_statement
->bfd_section
;
5169 fill
= s
->fill_statement
.fill
;
5172 case lang_assignment_statement_enum
:
5174 bfd_vma newdot
= dot
;
5175 etree_type
*tree
= s
->assignment_statement
.exp
;
5177 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5179 exp_fold_tree (tree
,
5180 output_section_statement
->bfd_section
,
5183 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5185 if (!expld
.dataseg
.relro_start_stat
)
5186 expld
.dataseg
.relro_start_stat
= s
;
5189 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5192 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5194 if (!expld
.dataseg
.relro_end_stat
)
5195 expld
.dataseg
.relro_end_stat
= s
;
5198 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5201 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5203 /* This symbol may be relative to this section. */
5204 if ((tree
->type
.node_class
== etree_provided
5205 || tree
->type
.node_class
== etree_assign
)
5206 && (tree
->assign
.dst
[0] != '.'
5207 || tree
->assign
.dst
[1] != '\0'))
5208 output_section_statement
->update_dot
= 1;
5210 if (!output_section_statement
->ignored
)
5212 if (output_section_statement
== abs_output_section
)
5214 /* If we don't have an output section, then just adjust
5215 the default memory address. */
5216 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5217 FALSE
)->current
= newdot
;
5219 else if (newdot
!= dot
)
5221 /* Insert a pad after this statement. We can't
5222 put the pad before when relaxing, in case the
5223 assignment references dot. */
5224 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5225 output_section_statement
->bfd_section
, dot
);
5227 /* Don't neuter the pad below when relaxing. */
5230 /* If dot is advanced, this implies that the section
5231 should have space allocated to it, unless the
5232 user has explicitly stated that the section
5233 should not be allocated. */
5234 if (output_section_statement
->sectype
!= noalloc_section
5235 && (output_section_statement
->sectype
!= noload_section
5236 || (bfd_get_flavour (link_info
.output_bfd
)
5237 == bfd_target_elf_flavour
)))
5238 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5245 case lang_padding_statement_enum
:
5246 /* If this is the first time lang_size_sections is called,
5247 we won't have any padding statements. If this is the
5248 second or later passes when relaxing, we should allow
5249 padding to shrink. If padding is needed on this pass, it
5250 will be added back in. */
5251 s
->padding_statement
.size
= 0;
5253 /* Make sure output_offset is valid. If relaxation shrinks
5254 the section and this pad isn't needed, it's possible to
5255 have output_offset larger than the final size of the
5256 section. bfd_set_section_contents will complain even for
5257 a pad size of zero. */
5258 s
->padding_statement
.output_offset
5259 = dot
- output_section_statement
->bfd_section
->vma
;
5262 case lang_group_statement_enum
:
5263 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5264 output_section_statement
,
5265 fill
, dot
, relax
, check_regions
);
5268 case lang_insert_statement_enum
:
5271 /* We can only get here when relaxing is turned on. */
5272 case lang_address_statement_enum
:
5279 prev
= &s
->header
.next
;
5284 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5285 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5286 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5287 segments. We are allowed an opportunity to override this decision. */
5290 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5291 bfd
* abfd ATTRIBUTE_UNUSED
,
5292 asection
* current_section
,
5293 asection
* previous_section
,
5294 bfd_boolean new_segment
)
5296 lang_output_section_statement_type
* cur
;
5297 lang_output_section_statement_type
* prev
;
5299 /* The checks below are only necessary when the BFD library has decided
5300 that the two sections ought to be placed into the same segment. */
5304 /* Paranoia checks. */
5305 if (current_section
== NULL
|| previous_section
== NULL
)
5308 /* If this flag is set, the target never wants code and non-code
5309 sections comingled in the same segment. */
5310 if (config
.separate_code
5311 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5314 /* Find the memory regions associated with the two sections.
5315 We call lang_output_section_find() here rather than scanning the list
5316 of output sections looking for a matching section pointer because if
5317 we have a large number of sections then a hash lookup is faster. */
5318 cur
= lang_output_section_find (current_section
->name
);
5319 prev
= lang_output_section_find (previous_section
->name
);
5321 /* More paranoia. */
5322 if (cur
== NULL
|| prev
== NULL
)
5325 /* If the regions are different then force the sections to live in
5326 different segments. See the email thread starting at the following
5327 URL for the reasons why this is necessary:
5328 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5329 return cur
->region
!= prev
->region
;
5333 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5335 lang_statement_iteration
++;
5336 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5337 0, 0, relax
, check_regions
);
5341 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5343 expld
.phase
= lang_allocating_phase_enum
;
5344 expld
.dataseg
.phase
= exp_dataseg_none
;
5346 one_lang_size_sections_pass (relax
, check_regions
);
5347 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5348 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5350 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5351 to put expld.dataseg.relro_end on a (common) page boundary. */
5352 bfd_vma min_base
, relro_end
, maxpage
;
5354 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5355 maxpage
= expld
.dataseg
.maxpagesize
;
5356 /* MIN_BASE is the absolute minimum address we are allowed to start the
5357 read-write segment (byte before will be mapped read-only). */
5358 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5359 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5360 & (expld
.dataseg
.pagesize
- 1));
5361 /* Compute the expected PT_GNU_RELRO segment end. */
5362 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5363 & ~(expld
.dataseg
.pagesize
- 1));
5364 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5366 expld
.dataseg
.base
-= maxpage
;
5367 relro_end
-= maxpage
;
5369 lang_reset_memory_regions ();
5370 one_lang_size_sections_pass (relax
, check_regions
);
5371 if (expld
.dataseg
.relro_end
> relro_end
)
5373 /* The alignment of sections between DATA_SEGMENT_ALIGN
5374 and DATA_SEGMENT_RELRO_END can cause excessive padding to
5375 be inserted at DATA_SEGMENT_RELRO_END. Try to start a
5376 bit lower so that the section alignments will fit in. */
5378 unsigned int max_alignment_power
= 0;
5380 /* Find maximum alignment power of sections between
5381 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5382 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5383 if (sec
->vma
>= expld
.dataseg
.base
5384 && sec
->vma
< expld
.dataseg
.relro_end
5385 && sec
->alignment_power
> max_alignment_power
)
5386 max_alignment_power
= sec
->alignment_power
;
5388 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5390 /* Aligning the adjusted base guarantees the padding
5391 between sections won't change. This is better than
5392 simply subtracting 1 << max_alignment_power which is
5393 what we used to do here. */
5394 expld
.dataseg
.base
&= ~((1 << max_alignment_power
) - 1);
5395 lang_reset_memory_regions ();
5396 one_lang_size_sections_pass (relax
, check_regions
);
5399 link_info
.relro_start
= expld
.dataseg
.base
;
5400 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5402 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5404 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5405 a page could be saved in the data segment. */
5406 bfd_vma first
, last
;
5408 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5409 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5411 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5412 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5413 && first
+ last
<= expld
.dataseg
.pagesize
)
5415 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5416 lang_reset_memory_regions ();
5417 one_lang_size_sections_pass (relax
, check_regions
);
5420 expld
.dataseg
.phase
= exp_dataseg_done
;
5423 expld
.dataseg
.phase
= exp_dataseg_done
;
5426 static lang_output_section_statement_type
*current_section
;
5427 static lang_assignment_statement_type
*current_assign
;
5428 static bfd_boolean prefer_next_section
;
5430 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5433 lang_do_assignments_1 (lang_statement_union_type
*s
,
5434 lang_output_section_statement_type
*current_os
,
5437 bfd_boolean
*found_end
)
5439 for (; s
!= NULL
; s
= s
->header
.next
)
5441 switch (s
->header
.type
)
5443 case lang_constructors_statement_enum
:
5444 dot
= lang_do_assignments_1 (constructor_list
.head
,
5445 current_os
, fill
, dot
, found_end
);
5448 case lang_output_section_statement_enum
:
5450 lang_output_section_statement_type
*os
;
5452 os
= &(s
->output_section_statement
);
5453 os
->after_end
= *found_end
;
5454 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5456 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5458 current_section
= os
;
5459 prefer_next_section
= FALSE
;
5461 dot
= os
->bfd_section
->vma
;
5463 lang_do_assignments_1 (os
->children
.head
,
5464 os
, os
->fill
, dot
, found_end
);
5466 /* .tbss sections effectively have zero size. */
5467 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5468 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5469 || link_info
.relocatable
)
5470 dot
+= TO_ADDR (os
->bfd_section
->size
);
5472 if (os
->update_dot_tree
!= NULL
)
5473 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5478 case lang_wild_statement_enum
:
5480 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5481 current_os
, fill
, dot
, found_end
);
5484 case lang_object_symbols_statement_enum
:
5485 case lang_output_statement_enum
:
5486 case lang_target_statement_enum
:
5489 case lang_data_statement_enum
:
5490 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5491 if (expld
.result
.valid_p
)
5493 s
->data_statement
.value
= expld
.result
.value
;
5494 if (expld
.result
.section
!= NULL
)
5495 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5498 einfo (_("%F%P: invalid data statement\n"));
5501 switch (s
->data_statement
.type
)
5519 if (size
< TO_SIZE ((unsigned) 1))
5520 size
= TO_SIZE ((unsigned) 1);
5521 dot
+= TO_ADDR (size
);
5525 case lang_reloc_statement_enum
:
5526 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5527 bfd_abs_section_ptr
, &dot
);
5528 if (expld
.result
.valid_p
)
5529 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5531 einfo (_("%F%P: invalid reloc statement\n"));
5532 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5535 case lang_input_section_enum
:
5537 asection
*in
= s
->input_section
.section
;
5539 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5540 dot
+= TO_ADDR (in
->size
);
5544 case lang_input_statement_enum
:
5547 case lang_fill_statement_enum
:
5548 fill
= s
->fill_statement
.fill
;
5551 case lang_assignment_statement_enum
:
5552 current_assign
= &s
->assignment_statement
;
5553 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5555 const char *p
= current_assign
->exp
->assign
.dst
;
5557 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5558 prefer_next_section
= TRUE
;
5562 if (strcmp (p
, "end") == 0)
5565 exp_fold_tree (s
->assignment_statement
.exp
,
5566 current_os
->bfd_section
,
5570 case lang_padding_statement_enum
:
5571 dot
+= TO_ADDR (s
->padding_statement
.size
);
5574 case lang_group_statement_enum
:
5575 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5576 current_os
, fill
, dot
, found_end
);
5579 case lang_insert_statement_enum
:
5582 case lang_address_statement_enum
:
5594 lang_do_assignments (lang_phase_type phase
)
5596 bfd_boolean found_end
= FALSE
;
5598 current_section
= NULL
;
5599 prefer_next_section
= FALSE
;
5600 expld
.phase
= phase
;
5601 lang_statement_iteration
++;
5602 lang_do_assignments_1 (statement_list
.head
,
5603 abs_output_section
, NULL
, 0, &found_end
);
5606 /* For an assignment statement outside of an output section statement,
5607 choose the best of neighbouring output sections to use for values
5611 section_for_dot (void)
5615 /* Assignments belong to the previous output section, unless there
5616 has been an assignment to "dot", in which case following
5617 assignments belong to the next output section. (The assumption
5618 is that an assignment to "dot" is setting up the address for the
5619 next output section.) Except that past the assignment to "_end"
5620 we always associate with the previous section. This exception is
5621 for targets like SH that define an alloc .stack or other
5622 weirdness after non-alloc sections. */
5623 if (current_section
== NULL
|| prefer_next_section
)
5625 lang_statement_union_type
*stmt
;
5626 lang_output_section_statement_type
*os
;
5628 for (stmt
= (lang_statement_union_type
*) current_assign
;
5630 stmt
= stmt
->header
.next
)
5631 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5634 os
= &stmt
->output_section_statement
;
5637 && (os
->bfd_section
== NULL
5638 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5639 || bfd_section_removed_from_list (link_info
.output_bfd
,
5643 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5646 s
= os
->bfd_section
;
5648 s
= link_info
.output_bfd
->section_last
;
5650 && ((s
->flags
& SEC_ALLOC
) == 0
5651 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5656 return bfd_abs_section_ptr
;
5660 s
= current_section
->bfd_section
;
5662 /* The section may have been stripped. */
5664 && ((s
->flags
& SEC_EXCLUDE
) != 0
5665 || (s
->flags
& SEC_ALLOC
) == 0
5666 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5667 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5670 s
= link_info
.output_bfd
->sections
;
5672 && ((s
->flags
& SEC_ALLOC
) == 0
5673 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5678 return bfd_abs_section_ptr
;
5681 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5682 operator .startof. (section_name), it produces an undefined symbol
5683 .startof.section_name. Similarly, when it sees
5684 .sizeof. (section_name), it produces an undefined symbol
5685 .sizeof.section_name. For all the output sections, we look for
5686 such symbols, and set them to the correct value. */
5689 lang_set_startof (void)
5693 if (link_info
.relocatable
)
5696 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5698 const char *secname
;
5700 struct bfd_link_hash_entry
*h
;
5702 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5703 buf
= (char *) xmalloc (10 + strlen (secname
));
5705 sprintf (buf
, ".startof.%s", secname
);
5706 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5707 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5709 h
->type
= bfd_link_hash_defined
;
5711 h
->u
.def
.section
= s
;
5714 sprintf (buf
, ".sizeof.%s", secname
);
5715 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5716 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5718 h
->type
= bfd_link_hash_defined
;
5719 h
->u
.def
.value
= TO_ADDR (s
->size
);
5720 h
->u
.def
.section
= bfd_abs_section_ptr
;
5730 struct bfd_link_hash_entry
*h
;
5733 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5734 || (link_info
.shared
&& !link_info
.executable
))
5735 warn
= entry_from_cmdline
;
5739 /* Force the user to specify a root when generating a relocatable with
5741 if (link_info
.gc_sections
&& link_info
.relocatable
5742 && !(entry_from_cmdline
|| undef_from_cmdline
))
5743 einfo (_("%P%F: gc-sections requires either an entry or "
5744 "an undefined symbol\n"));
5746 if (entry_symbol
.name
== NULL
)
5748 /* No entry has been specified. Look for the default entry, but
5749 don't warn if we don't find it. */
5750 entry_symbol
.name
= entry_symbol_default
;
5754 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5755 FALSE
, FALSE
, TRUE
);
5757 && (h
->type
== bfd_link_hash_defined
5758 || h
->type
== bfd_link_hash_defweak
)
5759 && h
->u
.def
.section
->output_section
!= NULL
)
5763 val
= (h
->u
.def
.value
5764 + bfd_get_section_vma (link_info
.output_bfd
,
5765 h
->u
.def
.section
->output_section
)
5766 + h
->u
.def
.section
->output_offset
);
5767 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5768 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5775 /* We couldn't find the entry symbol. Try parsing it as a
5777 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5780 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5781 einfo (_("%P%F: can't set start address\n"));
5787 /* Can't find the entry symbol, and it's not a number. Use
5788 the first address in the text section. */
5789 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5793 einfo (_("%P: warning: cannot find entry symbol %s;"
5794 " defaulting to %V\n"),
5796 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5797 if (!(bfd_set_start_address
5798 (link_info
.output_bfd
,
5799 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5800 einfo (_("%P%F: can't set start address\n"));
5805 einfo (_("%P: warning: cannot find entry symbol %s;"
5806 " not setting start address\n"),
5813 /* This is a small function used when we want to ignore errors from
5817 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5819 /* Don't do anything. */
5822 /* Check that the architecture of all the input files is compatible
5823 with the output file. Also call the backend to let it do any
5824 other checking that is needed. */
5829 lang_statement_union_type
*file
;
5831 const bfd_arch_info_type
*compatible
;
5833 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5835 #ifdef ENABLE_PLUGINS
5836 /* Don't check format of files claimed by plugin. */
5837 if (file
->input_statement
.flags
.claimed
)
5839 #endif /* ENABLE_PLUGINS */
5840 input_bfd
= file
->input_statement
.the_bfd
;
5842 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5843 command_line
.accept_unknown_input_arch
);
5845 /* In general it is not possible to perform a relocatable
5846 link between differing object formats when the input
5847 file has relocations, because the relocations in the
5848 input format may not have equivalent representations in
5849 the output format (and besides BFD does not translate
5850 relocs for other link purposes than a final link). */
5851 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5852 && (compatible
== NULL
5853 || (bfd_get_flavour (input_bfd
)
5854 != bfd_get_flavour (link_info
.output_bfd
)))
5855 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5857 einfo (_("%P%F: Relocatable linking with relocations from"
5858 " format %s (%B) to format %s (%B) is not supported\n"),
5859 bfd_get_target (input_bfd
), input_bfd
,
5860 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5861 /* einfo with %F exits. */
5864 if (compatible
== NULL
)
5866 if (command_line
.warn_mismatch
)
5867 einfo (_("%P%X: %s architecture of input file `%B'"
5868 " is incompatible with %s output\n"),
5869 bfd_printable_name (input_bfd
), input_bfd
,
5870 bfd_printable_name (link_info
.output_bfd
));
5872 else if (bfd_count_sections (input_bfd
))
5874 /* If the input bfd has no contents, it shouldn't set the
5875 private data of the output bfd. */
5877 bfd_error_handler_type pfn
= NULL
;
5879 /* If we aren't supposed to warn about mismatched input
5880 files, temporarily set the BFD error handler to a
5881 function which will do nothing. We still want to call
5882 bfd_merge_private_bfd_data, since it may set up
5883 information which is needed in the output file. */
5884 if (! command_line
.warn_mismatch
)
5885 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5886 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5888 if (command_line
.warn_mismatch
)
5889 einfo (_("%P%X: failed to merge target specific data"
5890 " of file %B\n"), input_bfd
);
5892 if (! command_line
.warn_mismatch
)
5893 bfd_set_error_handler (pfn
);
5898 /* Look through all the global common symbols and attach them to the
5899 correct section. The -sort-common command line switch may be used
5900 to roughly sort the entries by alignment. */
5905 if (command_line
.inhibit_common_definition
)
5907 if (link_info
.relocatable
5908 && ! command_line
.force_common_definition
)
5911 if (! config
.sort_common
)
5912 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5917 if (config
.sort_common
== sort_descending
)
5919 for (power
= 4; power
> 0; power
--)
5920 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5923 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5927 for (power
= 0; power
<= 4; power
++)
5928 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5931 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5936 /* Place one common symbol in the correct section. */
5939 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5941 unsigned int power_of_two
;
5945 if (h
->type
!= bfd_link_hash_common
)
5949 power_of_two
= h
->u
.c
.p
->alignment_power
;
5951 if (config
.sort_common
== sort_descending
5952 && power_of_two
< *(unsigned int *) info
)
5954 else if (config
.sort_common
== sort_ascending
5955 && power_of_two
> *(unsigned int *) info
)
5958 section
= h
->u
.c
.p
->section
;
5959 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
5960 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5963 if (config
.map_file
!= NULL
)
5965 static bfd_boolean header_printed
;
5970 if (! header_printed
)
5972 minfo (_("\nAllocating common symbols\n"));
5973 minfo (_("Common symbol size file\n\n"));
5974 header_printed
= TRUE
;
5977 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5978 DMGL_ANSI
| DMGL_PARAMS
);
5981 minfo ("%s", h
->root
.string
);
5982 len
= strlen (h
->root
.string
);
5987 len
= strlen (name
);
6003 if (size
<= 0xffffffff)
6004 sprintf (buf
, "%lx", (unsigned long) size
);
6006 sprintf_vma (buf
, size
);
6016 minfo ("%B\n", section
->owner
);
6022 /* Run through the input files and ensure that every input section has
6023 somewhere to go. If one is found without a destination then create
6024 an input request and place it into the statement tree. */
6027 lang_place_orphans (void)
6029 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6033 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6035 if (s
->output_section
== NULL
)
6037 /* This section of the file is not attached, root
6038 around for a sensible place for it to go. */
6040 if (file
->flags
.just_syms
)
6041 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6042 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
6043 s
->output_section
= bfd_abs_section_ptr
;
6044 else if (strcmp (s
->name
, "COMMON") == 0)
6046 /* This is a lonely common section which must have
6047 come from an archive. We attach to the section
6048 with the wildcard. */
6049 if (! link_info
.relocatable
6050 || command_line
.force_common_definition
)
6052 if (default_common_section
== NULL
)
6053 default_common_section
6054 = lang_output_section_statement_lookup (".bss", 0,
6056 lang_add_section (&default_common_section
->children
, s
,
6057 NULL
, default_common_section
);
6062 const char *name
= s
->name
;
6065 if (config
.unique_orphan_sections
6066 || unique_section_p (s
, NULL
))
6067 constraint
= SPECIAL
;
6069 if (!ldemul_place_orphan (s
, name
, constraint
))
6071 lang_output_section_statement_type
*os
;
6072 os
= lang_output_section_statement_lookup (name
,
6075 if (os
->addr_tree
== NULL
6076 && (link_info
.relocatable
6077 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6078 os
->addr_tree
= exp_intop (0);
6079 lang_add_section (&os
->children
, s
, NULL
, os
);
6088 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6090 flagword
*ptr_flags
;
6092 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6098 *ptr_flags
|= SEC_ALLOC
;
6102 *ptr_flags
|= SEC_READONLY
;
6106 *ptr_flags
|= SEC_DATA
;
6110 *ptr_flags
|= SEC_CODE
;
6115 *ptr_flags
|= SEC_LOAD
;
6119 einfo (_("%P%F: invalid syntax in flags\n"));
6126 /* Call a function on each input file. This function will be called
6127 on an archive, but not on the elements. */
6130 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6132 lang_input_statement_type
*f
;
6134 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6136 f
= (lang_input_statement_type
*) f
->next_real_file
)
6140 /* Call a function on each file. The function will be called on all
6141 the elements of an archive which are included in the link, but will
6142 not be called on the archive file itself. */
6145 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6147 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6154 ldlang_add_file (lang_input_statement_type
*entry
)
6156 lang_statement_append (&file_chain
,
6157 (lang_statement_union_type
*) entry
,
6160 /* The BFD linker needs to have a list of all input BFDs involved in
6162 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6163 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6165 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6166 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6167 entry
->the_bfd
->usrdata
= entry
;
6168 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6170 /* Look through the sections and check for any which should not be
6171 included in the link. We need to do this now, so that we can
6172 notice when the backend linker tries to report multiple
6173 definition errors for symbols which are in sections we aren't
6174 going to link. FIXME: It might be better to entirely ignore
6175 symbols which are defined in sections which are going to be
6176 discarded. This would require modifying the backend linker for
6177 each backend which might set the SEC_LINK_ONCE flag. If we do
6178 this, we should probably handle SEC_EXCLUDE in the same way. */
6180 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6184 lang_add_output (const char *name
, int from_script
)
6186 /* Make -o on command line override OUTPUT in script. */
6187 if (!had_output_filename
|| !from_script
)
6189 output_filename
= name
;
6190 had_output_filename
= TRUE
;
6203 for (l
= 0; l
< 32; l
++)
6205 if (i
>= (unsigned int) x
)
6213 lang_output_section_statement_type
*
6214 lang_enter_output_section_statement (const char *output_section_statement_name
,
6215 etree_type
*address_exp
,
6216 enum section_type sectype
,
6218 etree_type
*subalign
,
6221 int align_with_input
)
6223 lang_output_section_statement_type
*os
;
6225 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6227 current_section
= os
;
6229 if (os
->addr_tree
== NULL
)
6231 os
->addr_tree
= address_exp
;
6233 os
->sectype
= sectype
;
6234 if (sectype
!= noload_section
)
6235 os
->flags
= SEC_NO_FLAGS
;
6237 os
->flags
= SEC_NEVER_LOAD
;
6238 os
->block_value
= 1;
6240 /* Make next things chain into subchain of this. */
6241 push_stat_ptr (&os
->children
);
6243 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6244 if (os
->align_lma_with_input
&& align
!= NULL
)
6245 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"), NULL
);
6247 os
->subsection_alignment
=
6248 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6249 os
->section_alignment
=
6250 topower (exp_get_value_int (align
, -1, "section alignment"));
6252 os
->load_base
= ebase
;
6259 lang_output_statement_type
*new_stmt
;
6261 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6262 new_stmt
->name
= output_filename
;
6266 /* Reset the current counters in the regions. */
6269 lang_reset_memory_regions (void)
6271 lang_memory_region_type
*p
= lang_memory_region_list
;
6273 lang_output_section_statement_type
*os
;
6275 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6277 p
->current
= p
->origin
;
6281 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6285 os
->processed_vma
= FALSE
;
6286 os
->processed_lma
= FALSE
;
6289 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6291 /* Save the last size for possible use by bfd_relax_section. */
6292 o
->rawsize
= o
->size
;
6297 /* Worker for lang_gc_sections_1. */
6300 gc_section_callback (lang_wild_statement_type
*ptr
,
6301 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6303 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6304 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6305 void *data ATTRIBUTE_UNUSED
)
6307 /* If the wild pattern was marked KEEP, the member sections
6308 should be as well. */
6309 if (ptr
->keep_sections
)
6310 section
->flags
|= SEC_KEEP
;
6313 /* Iterate over sections marking them against GC. */
6316 lang_gc_sections_1 (lang_statement_union_type
*s
)
6318 for (; s
!= NULL
; s
= s
->header
.next
)
6320 switch (s
->header
.type
)
6322 case lang_wild_statement_enum
:
6323 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6325 case lang_constructors_statement_enum
:
6326 lang_gc_sections_1 (constructor_list
.head
);
6328 case lang_output_section_statement_enum
:
6329 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6331 case lang_group_statement_enum
:
6332 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6341 lang_gc_sections (void)
6343 /* Keep all sections so marked in the link script. */
6345 lang_gc_sections_1 (statement_list
.head
);
6347 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6348 the special case of debug info. (See bfd/stabs.c)
6349 Twiddle the flag here, to simplify later linker code. */
6350 if (link_info
.relocatable
)
6352 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6355 #ifdef ENABLE_PLUGINS
6356 if (f
->flags
.claimed
)
6359 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6360 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6361 sec
->flags
&= ~SEC_EXCLUDE
;
6365 if (link_info
.gc_sections
)
6366 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6369 /* Worker for lang_find_relro_sections_1. */
6372 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6373 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6375 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6376 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6379 /* Discarded, excluded and ignored sections effectively have zero
6381 if (section
->output_section
!= NULL
6382 && section
->output_section
->owner
== link_info
.output_bfd
6383 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6384 && !IGNORE_SECTION (section
)
6385 && section
->size
!= 0)
6387 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6388 *has_relro_section
= TRUE
;
6392 /* Iterate over sections for relro sections. */
6395 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6396 bfd_boolean
*has_relro_section
)
6398 if (*has_relro_section
)
6401 for (; s
!= NULL
; s
= s
->header
.next
)
6403 if (s
== expld
.dataseg
.relro_end_stat
)
6406 switch (s
->header
.type
)
6408 case lang_wild_statement_enum
:
6409 walk_wild (&s
->wild_statement
,
6410 find_relro_section_callback
,
6413 case lang_constructors_statement_enum
:
6414 lang_find_relro_sections_1 (constructor_list
.head
,
6417 case lang_output_section_statement_enum
:
6418 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6421 case lang_group_statement_enum
:
6422 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6432 lang_find_relro_sections (void)
6434 bfd_boolean has_relro_section
= FALSE
;
6436 /* Check all sections in the link script. */
6438 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6439 &has_relro_section
);
6441 if (!has_relro_section
)
6442 link_info
.relro
= FALSE
;
6445 /* Relax all sections until bfd_relax_section gives up. */
6448 lang_relax_sections (bfd_boolean need_layout
)
6450 if (RELAXATION_ENABLED
)
6452 /* We may need more than one relaxation pass. */
6453 int i
= link_info
.relax_pass
;
6455 /* The backend can use it to determine the current pass. */
6456 link_info
.relax_pass
= 0;
6460 /* Keep relaxing until bfd_relax_section gives up. */
6461 bfd_boolean relax_again
;
6463 link_info
.relax_trip
= -1;
6466 link_info
.relax_trip
++;
6468 /* Note: pe-dll.c does something like this also. If you find
6469 you need to change this code, you probably need to change
6470 pe-dll.c also. DJ */
6472 /* Do all the assignments with our current guesses as to
6474 lang_do_assignments (lang_assigning_phase_enum
);
6476 /* We must do this after lang_do_assignments, because it uses
6478 lang_reset_memory_regions ();
6480 /* Perform another relax pass - this time we know where the
6481 globals are, so can make a better guess. */
6482 relax_again
= FALSE
;
6483 lang_size_sections (&relax_again
, FALSE
);
6485 while (relax_again
);
6487 link_info
.relax_pass
++;
6494 /* Final extra sizing to report errors. */
6495 lang_do_assignments (lang_assigning_phase_enum
);
6496 lang_reset_memory_regions ();
6497 lang_size_sections (NULL
, TRUE
);
6501 #ifdef ENABLE_PLUGINS
6502 /* Find the insert point for the plugin's replacement files. We
6503 place them after the first claimed real object file, or if the
6504 first claimed object is an archive member, after the last real
6505 object file immediately preceding the archive. In the event
6506 no objects have been claimed at all, we return the first dummy
6507 object file on the list as the insert point; that works, but
6508 the callee must be careful when relinking the file_chain as it
6509 is not actually on that chain, only the statement_list and the
6510 input_file list; in that case, the replacement files must be
6511 inserted at the head of the file_chain. */
6513 static lang_input_statement_type
*
6514 find_replacements_insert_point (void)
6516 lang_input_statement_type
*claim1
, *lastobject
;
6517 lastobject
= &input_file_chain
.head
->input_statement
;
6518 for (claim1
= &file_chain
.head
->input_statement
;
6520 claim1
= &claim1
->next
->input_statement
)
6522 if (claim1
->flags
.claimed
)
6523 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6524 /* Update lastobject if this is a real object file. */
6525 if (claim1
->the_bfd
&& (claim1
->the_bfd
->my_archive
== NULL
))
6526 lastobject
= claim1
;
6528 /* No files were claimed by the plugin. Choose the last object
6529 file found on the list (maybe the first, dummy entry) as the
6534 /* Insert SRCLIST into DESTLIST after given element by chaining
6535 on FIELD as the next-pointer. (Counterintuitively does not need
6536 a pointer to the actual after-node itself, just its chain field.) */
6539 lang_list_insert_after (lang_statement_list_type
*destlist
,
6540 lang_statement_list_type
*srclist
,
6541 lang_statement_union_type
**field
)
6543 *(srclist
->tail
) = *field
;
6544 *field
= srclist
->head
;
6545 if (destlist
->tail
== field
)
6546 destlist
->tail
= srclist
->tail
;
6549 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6550 was taken as a copy of it and leave them in ORIGLIST. */
6553 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6554 lang_statement_list_type
*origlist
)
6556 union lang_statement_union
**savetail
;
6557 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6558 ASSERT (origlist
->head
== destlist
->head
);
6559 savetail
= origlist
->tail
;
6560 origlist
->head
= *(savetail
);
6561 origlist
->tail
= destlist
->tail
;
6562 destlist
->tail
= savetail
;
6565 #endif /* ENABLE_PLUGINS */
6570 /* Finalize dynamic list. */
6571 if (link_info
.dynamic_list
)
6572 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6574 current_target
= default_target
;
6576 /* Open the output file. */
6577 lang_for_each_statement (ldlang_open_output
);
6580 ldemul_create_output_section_statements ();
6582 /* Add to the hash table all undefineds on the command line. */
6583 lang_place_undefineds ();
6585 if (!bfd_section_already_linked_table_init ())
6586 einfo (_("%P%F: Failed to create hash table\n"));
6588 /* Create a bfd for each input file. */
6589 current_target
= default_target
;
6590 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6592 #ifdef ENABLE_PLUGINS
6593 if (plugin_active_plugins_p ())
6595 lang_statement_list_type added
;
6596 lang_statement_list_type files
, inputfiles
;
6598 /* Now all files are read, let the plugin(s) decide if there
6599 are any more to be added to the link before we call the
6600 emulation's after_open hook. We create a private list of
6601 input statements for this purpose, which we will eventually
6602 insert into the global statment list after the first claimed
6605 /* We need to manipulate all three chains in synchrony. */
6607 inputfiles
= input_file_chain
;
6608 if (plugin_call_all_symbols_read ())
6609 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6610 plugin_error_plugin ());
6611 /* Open any newly added files, updating the file chains. */
6612 link_info
.loading_lto_outputs
= TRUE
;
6613 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6614 /* Restore the global list pointer now they have all been added. */
6615 lang_list_remove_tail (stat_ptr
, &added
);
6616 /* And detach the fresh ends of the file lists. */
6617 lang_list_remove_tail (&file_chain
, &files
);
6618 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6619 /* Were any new files added? */
6620 if (added
.head
!= NULL
)
6622 /* If so, we will insert them into the statement list immediately
6623 after the first input file that was claimed by the plugin. */
6624 plugin_insert
= find_replacements_insert_point ();
6625 /* If a plugin adds input files without having claimed any, we
6626 don't really have a good idea where to place them. Just putting
6627 them at the start or end of the list is liable to leave them
6628 outside the crtbegin...crtend range. */
6629 ASSERT (plugin_insert
!= NULL
);
6630 /* Splice the new statement list into the old one. */
6631 lang_list_insert_after (stat_ptr
, &added
,
6632 &plugin_insert
->header
.next
);
6633 /* Likewise for the file chains. */
6634 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6635 &plugin_insert
->next_real_file
);
6636 /* We must be careful when relinking file_chain; we may need to
6637 insert the new files at the head of the list if the insert
6638 point chosen is the dummy first input file. */
6639 if (plugin_insert
->filename
)
6640 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6642 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6644 /* Rescan archives in case new undefined symbols have appeared. */
6645 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6648 #endif /* ENABLE_PLUGINS */
6650 link_info
.gc_sym_list
= &entry_symbol
;
6651 if (entry_symbol
.name
== NULL
)
6652 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6654 ldemul_after_open ();
6656 bfd_section_already_linked_table_free ();
6658 /* Make sure that we're not mixing architectures. We call this
6659 after all the input files have been opened, but before we do any
6660 other processing, so that any operations merge_private_bfd_data
6661 does on the output file will be known during the rest of the
6665 /* Handle .exports instead of a version script if we're told to do so. */
6666 if (command_line
.version_exports_section
)
6667 lang_do_version_exports_section ();
6669 /* Build all sets based on the information gathered from the input
6671 ldctor_build_sets ();
6673 /* PR 13683: We must rerun the assignments prior to running garbage
6674 collection in order to make sure that all symbol aliases are resolved. */
6675 lang_do_assignments (lang_mark_phase_enum
);
6676 expld
.phase
= lang_first_phase_enum
;
6678 /* Remove unreferenced sections if asked to. */
6679 lang_gc_sections ();
6681 /* Size up the common data. */
6684 /* Update wild statements. */
6685 update_wild_statements (statement_list
.head
);
6687 /* Run through the contours of the script and attach input sections
6688 to the correct output sections. */
6689 lang_statement_iteration
++;
6690 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6692 process_insert_statements ();
6694 /* Find any sections not attached explicitly and handle them. */
6695 lang_place_orphans ();
6697 if (! link_info
.relocatable
)
6701 /* Merge SEC_MERGE sections. This has to be done after GC of
6702 sections, so that GCed sections are not merged, but before
6703 assigning dynamic symbols, since removing whole input sections
6705 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6707 /* Look for a text section and set the readonly attribute in it. */
6708 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6712 if (config
.text_read_only
)
6713 found
->flags
|= SEC_READONLY
;
6715 found
->flags
&= ~SEC_READONLY
;
6719 /* Do anything special before sizing sections. This is where ELF
6720 and other back-ends size dynamic sections. */
6721 ldemul_before_allocation ();
6723 /* We must record the program headers before we try to fix the
6724 section positions, since they will affect SIZEOF_HEADERS. */
6725 lang_record_phdrs ();
6727 /* Check relro sections. */
6728 if (link_info
.relro
&& ! link_info
.relocatable
)
6729 lang_find_relro_sections ();
6731 /* Size up the sections. */
6732 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6734 /* See if anything special should be done now we know how big
6735 everything is. This is where relaxation is done. */
6736 ldemul_after_allocation ();
6738 /* Fix any .startof. or .sizeof. symbols. */
6739 lang_set_startof ();
6741 /* Do all the assignments, now that we know the final resting places
6742 of all the symbols. */
6743 lang_do_assignments (lang_final_phase_enum
);
6747 /* Make sure that the section addresses make sense. */
6748 if (command_line
.check_section_addresses
)
6749 lang_check_section_addresses ();
6754 /* EXPORTED TO YACC */
6757 lang_add_wild (struct wildcard_spec
*filespec
,
6758 struct wildcard_list
*section_list
,
6759 bfd_boolean keep_sections
)
6761 struct wildcard_list
*curr
, *next
;
6762 lang_wild_statement_type
*new_stmt
;
6764 /* Reverse the list as the parser puts it back to front. */
6765 for (curr
= section_list
, section_list
= NULL
;
6767 section_list
= curr
, curr
= next
)
6769 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6770 placed_commons
= TRUE
;
6773 curr
->next
= section_list
;
6776 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6778 if (strcmp (filespec
->name
, "*") == 0)
6779 filespec
->name
= NULL
;
6780 else if (! wildcardp (filespec
->name
))
6781 lang_has_input_file
= TRUE
;
6784 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6785 new_stmt
->filename
= NULL
;
6786 new_stmt
->filenames_sorted
= FALSE
;
6787 new_stmt
->section_flag_list
= NULL
;
6788 if (filespec
!= NULL
)
6790 new_stmt
->filename
= filespec
->name
;
6791 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6792 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
6794 new_stmt
->section_list
= section_list
;
6795 new_stmt
->keep_sections
= keep_sections
;
6796 lang_list_init (&new_stmt
->children
);
6797 analyze_walk_wild_section_handler (new_stmt
);
6801 lang_section_start (const char *name
, etree_type
*address
,
6802 const segment_type
*segment
)
6804 lang_address_statement_type
*ad
;
6806 ad
= new_stat (lang_address_statement
, stat_ptr
);
6807 ad
->section_name
= name
;
6808 ad
->address
= address
;
6809 ad
->segment
= segment
;
6812 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6813 because of a -e argument on the command line, or zero if this is
6814 called by ENTRY in a linker script. Command line arguments take
6818 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6820 if (entry_symbol
.name
== NULL
6822 || ! entry_from_cmdline
)
6824 entry_symbol
.name
= name
;
6825 entry_from_cmdline
= cmdline
;
6829 /* Set the default start symbol to NAME. .em files should use this,
6830 not lang_add_entry, to override the use of "start" if neither the
6831 linker script nor the command line specifies an entry point. NAME
6832 must be permanently allocated. */
6834 lang_default_entry (const char *name
)
6836 entry_symbol_default
= name
;
6840 lang_add_target (const char *name
)
6842 lang_target_statement_type
*new_stmt
;
6844 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6845 new_stmt
->target
= name
;
6849 lang_add_map (const char *name
)
6856 map_option_f
= TRUE
;
6864 lang_add_fill (fill_type
*fill
)
6866 lang_fill_statement_type
*new_stmt
;
6868 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6869 new_stmt
->fill
= fill
;
6873 lang_add_data (int type
, union etree_union
*exp
)
6875 lang_data_statement_type
*new_stmt
;
6877 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6878 new_stmt
->exp
= exp
;
6879 new_stmt
->type
= type
;
6882 /* Create a new reloc statement. RELOC is the BFD relocation type to
6883 generate. HOWTO is the corresponding howto structure (we could
6884 look this up, but the caller has already done so). SECTION is the
6885 section to generate a reloc against, or NAME is the name of the
6886 symbol to generate a reloc against. Exactly one of SECTION and
6887 NAME must be NULL. ADDEND is an expression for the addend. */
6890 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6891 reloc_howto_type
*howto
,
6894 union etree_union
*addend
)
6896 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6900 p
->section
= section
;
6902 p
->addend_exp
= addend
;
6904 p
->addend_value
= 0;
6905 p
->output_section
= NULL
;
6906 p
->output_offset
= 0;
6909 lang_assignment_statement_type
*
6910 lang_add_assignment (etree_type
*exp
)
6912 lang_assignment_statement_type
*new_stmt
;
6914 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6915 new_stmt
->exp
= exp
;
6920 lang_add_attribute (enum statement_enum attribute
)
6922 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6926 lang_startup (const char *name
)
6928 if (first_file
->filename
!= NULL
)
6930 einfo (_("%P%F: multiple STARTUP files\n"));
6932 first_file
->filename
= name
;
6933 first_file
->local_sym_name
= name
;
6934 first_file
->flags
.real
= TRUE
;
6938 lang_float (bfd_boolean maybe
)
6940 lang_float_flag
= maybe
;
6944 /* Work out the load- and run-time regions from a script statement, and
6945 store them in *LMA_REGION and *REGION respectively.
6947 MEMSPEC is the name of the run-time region, or the value of
6948 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6949 LMA_MEMSPEC is the name of the load-time region, or null if the
6950 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6951 had an explicit load address.
6953 It is an error to specify both a load region and a load address. */
6956 lang_get_regions (lang_memory_region_type
**region
,
6957 lang_memory_region_type
**lma_region
,
6958 const char *memspec
,
6959 const char *lma_memspec
,
6960 bfd_boolean have_lma
,
6961 bfd_boolean have_vma
)
6963 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6965 /* If no runtime region or VMA has been specified, but the load region
6966 has been specified, then use the load region for the runtime region
6968 if (lma_memspec
!= NULL
6970 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6971 *region
= *lma_region
;
6973 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6975 if (have_lma
&& lma_memspec
!= 0)
6976 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
6981 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6982 lang_output_section_phdr_list
*phdrs
,
6983 const char *lma_memspec
)
6985 lang_get_regions (¤t_section
->region
,
6986 ¤t_section
->lma_region
,
6987 memspec
, lma_memspec
,
6988 current_section
->load_base
!= NULL
,
6989 current_section
->addr_tree
!= NULL
);
6991 /* If this section has no load region or base, but uses the same
6992 region as the previous section, then propagate the previous
6993 section's load region. */
6995 if (current_section
->lma_region
== NULL
6996 && current_section
->load_base
== NULL
6997 && current_section
->addr_tree
== NULL
6998 && current_section
->region
== current_section
->prev
->region
)
6999 current_section
->lma_region
= current_section
->prev
->lma_region
;
7001 current_section
->fill
= fill
;
7002 current_section
->phdrs
= phdrs
;
7007 lang_statement_append (lang_statement_list_type
*list
,
7008 lang_statement_union_type
*element
,
7009 lang_statement_union_type
**field
)
7011 *(list
->tail
) = element
;
7015 /* Set the output format type. -oformat overrides scripts. */
7018 lang_add_output_format (const char *format
,
7023 if (output_target
== NULL
|| !from_script
)
7025 if (command_line
.endian
== ENDIAN_BIG
7028 else if (command_line
.endian
== ENDIAN_LITTLE
7032 output_target
= format
;
7037 lang_add_insert (const char *where
, int is_before
)
7039 lang_insert_statement_type
*new_stmt
;
7041 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7042 new_stmt
->where
= where
;
7043 new_stmt
->is_before
= is_before
;
7044 saved_script_handle
= previous_script_handle
;
7047 /* Enter a group. This creates a new lang_group_statement, and sets
7048 stat_ptr to build new statements within the group. */
7051 lang_enter_group (void)
7053 lang_group_statement_type
*g
;
7055 g
= new_stat (lang_group_statement
, stat_ptr
);
7056 lang_list_init (&g
->children
);
7057 push_stat_ptr (&g
->children
);
7060 /* Leave a group. This just resets stat_ptr to start writing to the
7061 regular list of statements again. Note that this will not work if
7062 groups can occur inside anything else which can adjust stat_ptr,
7063 but currently they can't. */
7066 lang_leave_group (void)
7071 /* Add a new program header. This is called for each entry in a PHDRS
7072 command in a linker script. */
7075 lang_new_phdr (const char *name
,
7077 bfd_boolean filehdr
,
7082 struct lang_phdr
*n
, **pp
;
7085 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7088 n
->type
= exp_get_value_int (type
, 0, "program header type");
7089 n
->filehdr
= filehdr
;
7094 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7096 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7099 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7101 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7102 " when prior PT_LOAD headers lack them\n"), NULL
);
7109 /* Record the program header information in the output BFD. FIXME: We
7110 should not be calling an ELF specific function here. */
7113 lang_record_phdrs (void)
7117 lang_output_section_phdr_list
*last
;
7118 struct lang_phdr
*l
;
7119 lang_output_section_statement_type
*os
;
7122 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7125 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7132 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7136 lang_output_section_phdr_list
*pl
;
7138 if (os
->constraint
< 0)
7146 if (os
->sectype
== noload_section
7147 || os
->bfd_section
== NULL
7148 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7151 /* Don't add orphans to PT_INTERP header. */
7157 lang_output_section_statement_type
* tmp_os
;
7159 /* If we have not run across a section with a program
7160 header assigned to it yet, then scan forwards to find
7161 one. This prevents inconsistencies in the linker's
7162 behaviour when a script has specified just a single
7163 header and there are sections in that script which are
7164 not assigned to it, and which occur before the first
7165 use of that header. See here for more details:
7166 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7167 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7170 last
= tmp_os
->phdrs
;
7174 einfo (_("%F%P: no sections assigned to phdrs\n"));
7179 if (os
->bfd_section
== NULL
)
7182 for (; pl
!= NULL
; pl
= pl
->next
)
7184 if (strcmp (pl
->name
, l
->name
) == 0)
7189 secs
= (asection
**) xrealloc (secs
,
7190 alc
* sizeof (asection
*));
7192 secs
[c
] = os
->bfd_section
;
7199 if (l
->flags
== NULL
)
7202 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7207 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7209 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7210 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7211 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7212 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7217 /* Make sure all the phdr assignments succeeded. */
7218 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7222 lang_output_section_phdr_list
*pl
;
7224 if (os
->constraint
< 0
7225 || os
->bfd_section
== NULL
)
7228 for (pl
= os
->phdrs
;
7231 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7232 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7233 os
->name
, pl
->name
);
7237 /* Record a list of sections which may not be cross referenced. */
7240 lang_add_nocrossref (lang_nocrossref_type
*l
)
7242 struct lang_nocrossrefs
*n
;
7244 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7245 n
->next
= nocrossref_list
;
7247 nocrossref_list
= n
;
7249 /* Set notice_all so that we get informed about all symbols. */
7250 link_info
.notice_all
= TRUE
;
7253 /* Overlay handling. We handle overlays with some static variables. */
7255 /* The overlay virtual address. */
7256 static etree_type
*overlay_vma
;
7257 /* And subsection alignment. */
7258 static etree_type
*overlay_subalign
;
7260 /* An expression for the maximum section size seen so far. */
7261 static etree_type
*overlay_max
;
7263 /* A list of all the sections in this overlay. */
7265 struct overlay_list
{
7266 struct overlay_list
*next
;
7267 lang_output_section_statement_type
*os
;
7270 static struct overlay_list
*overlay_list
;
7272 /* Start handling an overlay. */
7275 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7277 /* The grammar should prevent nested overlays from occurring. */
7278 ASSERT (overlay_vma
== NULL
7279 && overlay_subalign
== NULL
7280 && overlay_max
== NULL
);
7282 overlay_vma
= vma_expr
;
7283 overlay_subalign
= subalign
;
7286 /* Start a section in an overlay. We handle this by calling
7287 lang_enter_output_section_statement with the correct VMA.
7288 lang_leave_overlay sets up the LMA and memory regions. */
7291 lang_enter_overlay_section (const char *name
)
7293 struct overlay_list
*n
;
7296 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7297 0, overlay_subalign
, 0, 0, 0);
7299 /* If this is the first section, then base the VMA of future
7300 sections on this one. This will work correctly even if `.' is
7301 used in the addresses. */
7302 if (overlay_list
== NULL
)
7303 overlay_vma
= exp_nameop (ADDR
, name
);
7305 /* Remember the section. */
7306 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7307 n
->os
= current_section
;
7308 n
->next
= overlay_list
;
7311 size
= exp_nameop (SIZEOF
, name
);
7313 /* Arrange to work out the maximum section end address. */
7314 if (overlay_max
== NULL
)
7317 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7320 /* Finish a section in an overlay. There isn't any special to do
7324 lang_leave_overlay_section (fill_type
*fill
,
7325 lang_output_section_phdr_list
*phdrs
)
7332 name
= current_section
->name
;
7334 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7335 region and that no load-time region has been specified. It doesn't
7336 really matter what we say here, since lang_leave_overlay will
7338 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7340 /* Define the magic symbols. */
7342 clean
= (char *) xmalloc (strlen (name
) + 1);
7344 for (s1
= name
; *s1
!= '\0'; s1
++)
7345 if (ISALNUM (*s1
) || *s1
== '_')
7349 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7350 sprintf (buf
, "__load_start_%s", clean
);
7351 lang_add_assignment (exp_provide (buf
,
7352 exp_nameop (LOADADDR
, name
),
7355 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7356 sprintf (buf
, "__load_stop_%s", clean
);
7357 lang_add_assignment (exp_provide (buf
,
7359 exp_nameop (LOADADDR
, name
),
7360 exp_nameop (SIZEOF
, name
)),
7366 /* Finish an overlay. If there are any overlay wide settings, this
7367 looks through all the sections in the overlay and sets them. */
7370 lang_leave_overlay (etree_type
*lma_expr
,
7373 const char *memspec
,
7374 lang_output_section_phdr_list
*phdrs
,
7375 const char *lma_memspec
)
7377 lang_memory_region_type
*region
;
7378 lang_memory_region_type
*lma_region
;
7379 struct overlay_list
*l
;
7380 lang_nocrossref_type
*nocrossref
;
7382 lang_get_regions (®ion
, &lma_region
,
7383 memspec
, lma_memspec
,
7384 lma_expr
!= NULL
, FALSE
);
7388 /* After setting the size of the last section, set '.' to end of the
7390 if (overlay_list
!= NULL
)
7392 overlay_list
->os
->update_dot
= 1;
7393 overlay_list
->os
->update_dot_tree
7394 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
7400 struct overlay_list
*next
;
7402 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7405 l
->os
->region
= region
;
7406 l
->os
->lma_region
= lma_region
;
7408 /* The first section has the load address specified in the
7409 OVERLAY statement. The rest are worked out from that.
7410 The base address is not needed (and should be null) if
7411 an LMA region was specified. */
7414 l
->os
->load_base
= lma_expr
;
7415 l
->os
->sectype
= normal_section
;
7417 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7418 l
->os
->phdrs
= phdrs
;
7422 lang_nocrossref_type
*nc
;
7424 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7425 nc
->name
= l
->os
->name
;
7426 nc
->next
= nocrossref
;
7435 if (nocrossref
!= NULL
)
7436 lang_add_nocrossref (nocrossref
);
7439 overlay_list
= NULL
;
7443 /* Version handling. This is only useful for ELF. */
7445 /* If PREV is NULL, return first version pattern matching particular symbol.
7446 If PREV is non-NULL, return first version pattern matching particular
7447 symbol after PREV (previously returned by lang_vers_match). */
7449 static struct bfd_elf_version_expr
*
7450 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7451 struct bfd_elf_version_expr
*prev
,
7455 const char *cxx_sym
= sym
;
7456 const char *java_sym
= sym
;
7457 struct bfd_elf_version_expr
*expr
= NULL
;
7458 enum demangling_styles curr_style
;
7460 curr_style
= CURRENT_DEMANGLING_STYLE
;
7461 cplus_demangle_set_style (no_demangling
);
7462 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7465 cplus_demangle_set_style (curr_style
);
7467 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7469 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7470 DMGL_PARAMS
| DMGL_ANSI
);
7474 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7476 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7481 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7483 struct bfd_elf_version_expr e
;
7485 switch (prev
? prev
->mask
: 0)
7488 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7491 expr
= (struct bfd_elf_version_expr
*)
7492 htab_find ((htab_t
) head
->htab
, &e
);
7493 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7494 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7500 case BFD_ELF_VERSION_C_TYPE
:
7501 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7503 e
.pattern
= cxx_sym
;
7504 expr
= (struct bfd_elf_version_expr
*)
7505 htab_find ((htab_t
) head
->htab
, &e
);
7506 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7507 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7513 case BFD_ELF_VERSION_CXX_TYPE
:
7514 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7516 e
.pattern
= java_sym
;
7517 expr
= (struct bfd_elf_version_expr
*)
7518 htab_find ((htab_t
) head
->htab
, &e
);
7519 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7520 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7531 /* Finally, try the wildcards. */
7532 if (prev
== NULL
|| prev
->literal
)
7533 expr
= head
->remaining
;
7536 for (; expr
; expr
= expr
->next
)
7543 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7546 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7548 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7552 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7558 free ((char *) c_sym
);
7560 free ((char *) cxx_sym
);
7561 if (java_sym
!= sym
)
7562 free ((char *) java_sym
);
7566 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7567 return a pointer to the symbol name with any backslash quotes removed. */
7570 realsymbol (const char *pattern
)
7573 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7574 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7576 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7578 /* It is a glob pattern only if there is no preceding
7582 /* Remove the preceding backslash. */
7589 if (*p
== '?' || *p
== '*' || *p
== '[')
7596 backslash
= *p
== '\\';
7612 /* This is called for each variable name or match expression. NEW_NAME is
7613 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7614 pattern to be matched against symbol names. */
7616 struct bfd_elf_version_expr
*
7617 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7618 const char *new_name
,
7620 bfd_boolean literal_p
)
7622 struct bfd_elf_version_expr
*ret
;
7624 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7628 ret
->literal
= TRUE
;
7629 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7630 if (ret
->pattern
== NULL
)
7632 ret
->pattern
= new_name
;
7633 ret
->literal
= FALSE
;
7636 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7637 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7638 else if (strcasecmp (lang
, "C++") == 0)
7639 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7640 else if (strcasecmp (lang
, "Java") == 0)
7641 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7644 einfo (_("%X%P: unknown language `%s' in version information\n"),
7646 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7649 return ldemul_new_vers_pattern (ret
);
7652 /* This is called for each set of variable names and match
7655 struct bfd_elf_version_tree
*
7656 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7657 struct bfd_elf_version_expr
*locals
)
7659 struct bfd_elf_version_tree
*ret
;
7661 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7662 ret
->globals
.list
= globals
;
7663 ret
->locals
.list
= locals
;
7664 ret
->match
= lang_vers_match
;
7665 ret
->name_indx
= (unsigned int) -1;
7669 /* This static variable keeps track of version indices. */
7671 static int version_index
;
7674 version_expr_head_hash (const void *p
)
7676 const struct bfd_elf_version_expr
*e
=
7677 (const struct bfd_elf_version_expr
*) p
;
7679 return htab_hash_string (e
->pattern
);
7683 version_expr_head_eq (const void *p1
, const void *p2
)
7685 const struct bfd_elf_version_expr
*e1
=
7686 (const struct bfd_elf_version_expr
*) p1
;
7687 const struct bfd_elf_version_expr
*e2
=
7688 (const struct bfd_elf_version_expr
*) p2
;
7690 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7694 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7697 struct bfd_elf_version_expr
*e
, *next
;
7698 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7700 for (e
= head
->list
; e
; e
= e
->next
)
7704 head
->mask
|= e
->mask
;
7709 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7710 version_expr_head_eq
, NULL
);
7711 list_loc
= &head
->list
;
7712 remaining_loc
= &head
->remaining
;
7713 for (e
= head
->list
; e
; e
= next
)
7719 remaining_loc
= &e
->next
;
7723 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7727 struct bfd_elf_version_expr
*e1
, *last
;
7729 e1
= (struct bfd_elf_version_expr
*) *loc
;
7733 if (e1
->mask
== e
->mask
)
7741 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7745 /* This is a duplicate. */
7746 /* FIXME: Memory leak. Sometimes pattern is not
7747 xmalloced alone, but in larger chunk of memory. */
7748 /* free (e->pattern); */
7753 e
->next
= last
->next
;
7761 list_loc
= &e
->next
;
7765 *remaining_loc
= NULL
;
7766 *list_loc
= head
->remaining
;
7769 head
->remaining
= head
->list
;
7772 /* This is called when we know the name and dependencies of the
7776 lang_register_vers_node (const char *name
,
7777 struct bfd_elf_version_tree
*version
,
7778 struct bfd_elf_version_deps
*deps
)
7780 struct bfd_elf_version_tree
*t
, **pp
;
7781 struct bfd_elf_version_expr
*e1
;
7786 if (link_info
.version_info
!= NULL
7787 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
7789 einfo (_("%X%P: anonymous version tag cannot be combined"
7790 " with other version tags\n"));
7795 /* Make sure this node has a unique name. */
7796 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7797 if (strcmp (t
->name
, name
) == 0)
7798 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7800 lang_finalize_version_expr_head (&version
->globals
);
7801 lang_finalize_version_expr_head (&version
->locals
);
7803 /* Check the global and local match names, and make sure there
7804 aren't any duplicates. */
7806 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7808 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7810 struct bfd_elf_version_expr
*e2
;
7812 if (t
->locals
.htab
&& e1
->literal
)
7814 e2
= (struct bfd_elf_version_expr
*)
7815 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7816 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7818 if (e1
->mask
== e2
->mask
)
7819 einfo (_("%X%P: duplicate expression `%s'"
7820 " in version information\n"), e1
->pattern
);
7824 else if (!e1
->literal
)
7825 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7826 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7827 && e1
->mask
== e2
->mask
)
7828 einfo (_("%X%P: duplicate expression `%s'"
7829 " in version information\n"), e1
->pattern
);
7833 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7835 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7837 struct bfd_elf_version_expr
*e2
;
7839 if (t
->globals
.htab
&& e1
->literal
)
7841 e2
= (struct bfd_elf_version_expr
*)
7842 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7843 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7845 if (e1
->mask
== e2
->mask
)
7846 einfo (_("%X%P: duplicate expression `%s'"
7847 " in version information\n"),
7852 else if (!e1
->literal
)
7853 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7854 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7855 && e1
->mask
== e2
->mask
)
7856 einfo (_("%X%P: duplicate expression `%s'"
7857 " in version information\n"), e1
->pattern
);
7861 version
->deps
= deps
;
7862 version
->name
= name
;
7863 if (name
[0] != '\0')
7866 version
->vernum
= version_index
;
7869 version
->vernum
= 0;
7871 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7876 /* This is called when we see a version dependency. */
7878 struct bfd_elf_version_deps
*
7879 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7881 struct bfd_elf_version_deps
*ret
;
7882 struct bfd_elf_version_tree
*t
;
7884 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7887 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7889 if (strcmp (t
->name
, name
) == 0)
7891 ret
->version_needed
= t
;
7896 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7898 ret
->version_needed
= NULL
;
7903 lang_do_version_exports_section (void)
7905 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7907 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7909 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7917 contents
= (char *) xmalloc (len
);
7918 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7919 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7922 while (p
< contents
+ len
)
7924 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7925 p
= strchr (p
, '\0') + 1;
7928 /* Do not free the contents, as we used them creating the regex. */
7930 /* Do not include this section in the link. */
7931 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7934 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7935 lang_register_vers_node (command_line
.version_exports_section
,
7936 lang_new_vers_node (greg
, lreg
), NULL
);
7940 lang_add_unique (const char *name
)
7942 struct unique_sections
*ent
;
7944 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7945 if (strcmp (ent
->name
, name
) == 0)
7948 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7949 ent
->name
= xstrdup (name
);
7950 ent
->next
= unique_section_list
;
7951 unique_section_list
= ent
;
7954 /* Append the list of dynamic symbols to the existing one. */
7957 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7959 if (link_info
.dynamic_list
)
7961 struct bfd_elf_version_expr
*tail
;
7962 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7964 tail
->next
= link_info
.dynamic_list
->head
.list
;
7965 link_info
.dynamic_list
->head
.list
= dynamic
;
7969 struct bfd_elf_dynamic_list
*d
;
7971 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
7972 d
->head
.list
= dynamic
;
7973 d
->match
= lang_vers_match
;
7974 link_info
.dynamic_list
= d
;
7978 /* Append the list of C++ typeinfo dynamic symbols to the existing
7982 lang_append_dynamic_list_cpp_typeinfo (void)
7984 const char * symbols
[] =
7986 "typeinfo name for*",
7989 struct bfd_elf_version_expr
*dynamic
= NULL
;
7992 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7993 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7996 lang_append_dynamic_list (dynamic
);
7999 /* Append the list of C++ operator new and delete dynamic symbols to the
8003 lang_append_dynamic_list_cpp_new (void)
8005 const char * symbols
[] =
8010 struct bfd_elf_version_expr
*dynamic
= NULL
;
8013 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8014 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8017 lang_append_dynamic_list (dynamic
);
8020 /* Scan a space and/or comma separated string of features. */
8023 lang_ld_feature (char *str
)
8031 while (*p
== ',' || ISSPACE (*p
))
8036 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8040 if (strcasecmp (p
, "SANE_EXPR") == 0)
8041 config
.sane_expr
= TRUE
;
8043 einfo (_("%X%P: unknown feature `%s'\n"), p
);