1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 Free Software Foundation, Inc.
6 This file is part of the GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
25 #include "libiberty.h"
26 #include "safe-ctype.h"
45 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
48 /* Locals variables. */
49 static struct obstack stat_obstack
;
50 static struct obstack map_obstack
;
52 #define obstack_chunk_alloc xmalloc
53 #define obstack_chunk_free free
54 static const char *startup_file
;
55 static bfd_boolean placed_commons
= FALSE
;
56 static bfd_boolean stripped_excluded_sections
= FALSE
;
57 static lang_output_section_statement_type
*default_common_section
;
58 static bfd_boolean map_option_f
;
59 static bfd_vma print_dot
;
60 static lang_input_statement_type
*first_file
;
61 static const char *current_target
;
62 static const char *output_target
;
63 static lang_statement_list_type statement_list
;
64 static struct bfd_hash_table lang_definedness_table
;
66 /* Forward declarations. */
67 static void exp_init_os (etree_type
*);
68 static void init_map_userdata (bfd
*, asection
*, void *);
69 static lang_input_statement_type
*lookup_name (const char *);
70 static struct bfd_hash_entry
*lang_definedness_newfunc
71 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
72 static void insert_undefined (const char *);
73 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
74 static void print_statement (lang_statement_union_type
*,
75 lang_output_section_statement_type
*);
76 static void print_statement_list (lang_statement_union_type
*,
77 lang_output_section_statement_type
*);
78 static void print_statements (void);
79 static void print_input_section (asection
*);
80 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
81 static void lang_record_phdrs (void);
82 static void lang_do_version_exports_section (void);
83 static void lang_finalize_version_expr_head
84 (struct bfd_elf_version_expr_head
*);
86 /* Exported variables. */
87 lang_output_section_statement_type
*abs_output_section
;
88 lang_statement_list_type lang_output_section_statement
;
89 lang_statement_list_type
*stat_ptr
= &statement_list
;
90 lang_statement_list_type file_chain
= { NULL
, NULL
};
91 lang_statement_list_type input_file_chain
;
92 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
93 static const char *entry_symbol_default
= "start";
94 const char *entry_section
= ".text";
95 bfd_boolean entry_from_cmdline
;
96 bfd_boolean lang_has_input_file
= FALSE
;
97 bfd_boolean had_output_filename
= FALSE
;
98 bfd_boolean lang_float_flag
= FALSE
;
99 bfd_boolean delete_output_file_on_failure
= FALSE
;
100 struct lang_phdr
*lang_phdr_list
;
101 struct lang_nocrossrefs
*nocrossref_list
;
102 static struct unique_sections
*unique_section_list
;
103 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
105 /* Functions that traverse the linker script and might evaluate
106 DEFINED() need to increment this. */
107 int lang_statement_iteration
= 0;
109 etree_type
*base
; /* Relocation base - or null */
111 /* Return TRUE if the PATTERN argument is a wildcard pattern.
112 Although backslashes are treated specially if a pattern contains
113 wildcards, we do not consider the mere presence of a backslash to
114 be enough to cause the pattern to be treated as a wildcard.
115 That lets us handle DOS filenames more naturally. */
116 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
118 #define new_stat(x, y) \
119 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
121 #define outside_section_address(q) \
122 ((q)->output_offset + (q)->output_section->vma)
124 #define outside_symbol_address(q) \
125 ((q)->value + outside_section_address (q->section))
127 #define SECTION_NAME_MAP_LENGTH (16)
130 stat_alloc (size_t size
)
132 return obstack_alloc (&stat_obstack
, size
);
136 unique_section_p (const asection
*sec
)
138 struct unique_sections
*unam
;
141 if (link_info
.relocatable
142 && sec
->owner
!= NULL
143 && bfd_is_group_section (sec
->owner
, sec
))
147 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
148 if (wildcardp (unam
->name
)
149 ? fnmatch (unam
->name
, secnam
, 0) == 0
150 : strcmp (unam
->name
, secnam
) == 0)
158 /* Generic traversal routines for finding matching sections. */
160 /* Try processing a section against a wildcard. This just calls
161 the callback unless the filename exclusion list is present
162 and excludes the file. It's hardly ever present so this
163 function is very fast. */
166 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
167 lang_input_statement_type
*file
,
169 struct wildcard_list
*sec
,
173 bfd_boolean skip
= FALSE
;
174 struct name_list
*list_tmp
;
176 /* Don't process sections from files which were
178 for (list_tmp
= sec
->spec
.exclude_name_list
;
180 list_tmp
= list_tmp
->next
)
182 bfd_boolean is_wildcard
= wildcardp (list_tmp
->name
);
184 skip
= fnmatch (list_tmp
->name
, file
->filename
, 0) == 0;
186 skip
= strcmp (list_tmp
->name
, file
->filename
) == 0;
188 /* If this file is part of an archive, and the archive is
189 excluded, exclude this file. */
190 if (! skip
&& file
->the_bfd
!= NULL
191 && file
->the_bfd
->my_archive
!= NULL
192 && file
->the_bfd
->my_archive
->filename
!= NULL
)
195 skip
= fnmatch (list_tmp
->name
,
196 file
->the_bfd
->my_archive
->filename
,
199 skip
= strcmp (list_tmp
->name
,
200 file
->the_bfd
->my_archive
->filename
) == 0;
208 (*callback
) (ptr
, sec
, s
, file
, data
);
211 /* Lowest common denominator routine that can handle everything correctly,
215 walk_wild_section_general (lang_wild_statement_type
*ptr
,
216 lang_input_statement_type
*file
,
221 struct wildcard_list
*sec
;
223 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
225 sec
= ptr
->section_list
;
227 (*callback
) (ptr
, sec
, s
, file
, data
);
231 bfd_boolean skip
= FALSE
;
233 if (sec
->spec
.name
!= NULL
)
235 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
237 if (wildcardp (sec
->spec
.name
))
238 skip
= fnmatch (sec
->spec
.name
, sname
, 0) != 0;
240 skip
= strcmp (sec
->spec
.name
, sname
) != 0;
244 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
251 /* Routines to find a single section given its name. If there's more
252 than one section with that name, we report that. */
256 asection
*found_section
;
257 bfd_boolean multiple_sections_found
;
258 } section_iterator_callback_data
;
261 section_iterator_callback (bfd
*bfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
263 section_iterator_callback_data
*d
= data
;
265 if (d
->found_section
!= NULL
)
267 d
->multiple_sections_found
= TRUE
;
271 d
->found_section
= s
;
276 find_section (lang_input_statement_type
*file
,
277 struct wildcard_list
*sec
,
278 bfd_boolean
*multiple_sections_found
)
280 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
282 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
283 section_iterator_callback
, &cb_data
);
284 *multiple_sections_found
= cb_data
.multiple_sections_found
;
285 return cb_data
.found_section
;
288 /* Code for handling simple wildcards without going through fnmatch,
289 which can be expensive because of charset translations etc. */
291 /* A simple wild is a literal string followed by a single '*',
292 where the literal part is at least 4 characters long. */
295 is_simple_wild (const char *name
)
297 size_t len
= strcspn (name
, "*?[");
298 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
302 match_simple_wild (const char *pattern
, const char *name
)
304 /* The first four characters of the pattern are guaranteed valid
305 non-wildcard characters. So we can go faster. */
306 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
307 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
312 while (*pattern
!= '*')
313 if (*name
++ != *pattern
++)
319 /* Compare sections ASEC and BSEC according to SORT. */
322 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
331 case by_alignment_name
:
332 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
333 - bfd_section_alignment (asec
->owner
, asec
));
339 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
340 bfd_get_section_name (bsec
->owner
, bsec
));
343 case by_name_alignment
:
344 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
345 bfd_get_section_name (bsec
->owner
, bsec
));
351 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
352 - bfd_section_alignment (asec
->owner
, asec
));
359 /* Build a Binary Search Tree to sort sections, unlike insertion sort
360 used in wild_sort(). BST is considerably faster if the number of
361 of sections are large. */
363 static lang_section_bst_type
**
364 wild_sort_fast (lang_wild_statement_type
*wild
,
365 struct wildcard_list
*sec
,
366 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
369 lang_section_bst_type
**tree
;
372 if (!wild
->filenames_sorted
373 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
375 /* Append at the right end of tree. */
377 tree
= &((*tree
)->right
);
383 /* Find the correct node to append this section. */
384 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
385 tree
= &((*tree
)->left
);
387 tree
= &((*tree
)->right
);
393 /* Use wild_sort_fast to build a BST to sort sections. */
396 output_section_callback_fast (lang_wild_statement_type
*ptr
,
397 struct wildcard_list
*sec
,
399 lang_input_statement_type
*file
,
400 void *output ATTRIBUTE_UNUSED
)
402 lang_section_bst_type
*node
;
403 lang_section_bst_type
**tree
;
405 if (unique_section_p (section
))
408 node
= xmalloc (sizeof (lang_section_bst_type
));
411 node
->section
= section
;
413 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
418 /* Convert a sorted sections' BST back to list form. */
421 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
422 lang_section_bst_type
*tree
,
426 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
428 lang_add_section (&ptr
->children
, tree
->section
,
429 (lang_output_section_statement_type
*) output
);
432 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
437 /* Specialized, optimized routines for handling different kinds of
441 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
442 lang_input_statement_type
*file
,
446 /* We can just do a hash lookup for the section with the right name.
447 But if that lookup discovers more than one section with the name
448 (should be rare), we fall back to the general algorithm because
449 we would otherwise have to sort the sections to make sure they
450 get processed in the bfd's order. */
451 bfd_boolean multiple_sections_found
;
452 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
453 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
455 if (multiple_sections_found
)
456 walk_wild_section_general (ptr
, file
, callback
, data
);
458 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
462 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
463 lang_input_statement_type
*file
,
468 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
470 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
472 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
473 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
476 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
481 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
482 lang_input_statement_type
*file
,
487 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
488 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
489 bfd_boolean multiple_sections_found
;
490 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
492 if (multiple_sections_found
)
494 walk_wild_section_general (ptr
, file
, callback
, data
);
498 /* Note that if the section was not found, s0 is NULL and
499 we'll simply never succeed the s == s0 test below. */
500 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
502 /* Recall that in this code path, a section cannot satisfy more
503 than one spec, so if s == s0 then it cannot match
506 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
509 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
510 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
513 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
520 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
521 lang_input_statement_type
*file
,
526 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
527 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
528 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
529 bfd_boolean multiple_sections_found
;
530 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
532 if (multiple_sections_found
)
534 walk_wild_section_general (ptr
, file
, callback
, data
);
538 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
541 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
544 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
545 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
548 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
551 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
553 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
561 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
562 lang_input_statement_type
*file
,
567 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
568 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
569 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
570 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
571 bfd_boolean multiple_sections_found
;
572 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
574 if (multiple_sections_found
)
576 walk_wild_section_general (ptr
, file
, callback
, data
);
580 s1
= find_section (file
, sec1
, &multiple_sections_found
);
581 if (multiple_sections_found
)
583 walk_wild_section_general (ptr
, file
, callback
, data
);
587 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
590 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
593 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
596 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
597 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
601 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
605 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
607 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
615 walk_wild_section (lang_wild_statement_type
*ptr
,
616 lang_input_statement_type
*file
,
620 if (file
->just_syms_flag
)
623 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
626 /* Returns TRUE when name1 is a wildcard spec that might match
627 something name2 can match. We're conservative: we return FALSE
628 only if the prefixes of name1 and name2 are different up to the
629 first wildcard character. */
632 wild_spec_can_overlap (const char *name1
, const char *name2
)
634 size_t prefix1_len
= strcspn (name1
, "?*[");
635 size_t prefix2_len
= strcspn (name2
, "?*[");
636 size_t min_prefix_len
;
638 /* Note that if there is no wildcard character, then we treat the
639 terminating 0 as part of the prefix. Thus ".text" won't match
640 ".text." or ".text.*", for example. */
641 if (name1
[prefix1_len
] == '\0')
643 if (name2
[prefix2_len
] == '\0')
646 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
648 return memcmp (name1
, name2
, min_prefix_len
) == 0;
651 /* Select specialized code to handle various kinds of wildcard
655 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
658 int wild_name_count
= 0;
659 struct wildcard_list
*sec
;
663 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
664 ptr
->handler_data
[0] = NULL
;
665 ptr
->handler_data
[1] = NULL
;
666 ptr
->handler_data
[2] = NULL
;
667 ptr
->handler_data
[3] = NULL
;
670 /* Count how many wildcard_specs there are, and how many of those
671 actually use wildcards in the name. Also, bail out if any of the
672 wildcard names are NULL. (Can this actually happen?
673 walk_wild_section used to test for it.) And bail out if any
674 of the wildcards are more complex than a simple string
675 ending in a single '*'. */
676 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
679 if (sec
->spec
.name
== NULL
)
681 if (wildcardp (sec
->spec
.name
))
684 if (!is_simple_wild (sec
->spec
.name
))
689 /* The zero-spec case would be easy to optimize but it doesn't
690 happen in practice. Likewise, more than 4 specs doesn't
691 happen in practice. */
692 if (sec_count
== 0 || sec_count
> 4)
695 /* Check that no two specs can match the same section. */
696 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
698 struct wildcard_list
*sec2
;
699 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
701 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
706 signature
= (sec_count
<< 8) + wild_name_count
;
710 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
713 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
716 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
719 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
722 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
728 /* Now fill the data array with pointers to the specs, first the
729 specs with non-wildcard names, then the specs with wildcard
730 names. It's OK to process the specs in different order from the
731 given order, because we've already determined that no section
732 will match more than one spec. */
734 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
735 if (!wildcardp (sec
->spec
.name
))
736 ptr
->handler_data
[data_counter
++] = sec
;
737 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
738 if (wildcardp (sec
->spec
.name
))
739 ptr
->handler_data
[data_counter
++] = sec
;
742 /* Handle a wild statement for a single file F. */
745 walk_wild_file (lang_wild_statement_type
*s
,
746 lang_input_statement_type
*f
,
750 if (f
->the_bfd
== NULL
751 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
752 walk_wild_section (s
, f
, callback
, data
);
757 /* This is an archive file. We must map each member of the
758 archive separately. */
759 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
760 while (member
!= NULL
)
762 /* When lookup_name is called, it will call the add_symbols
763 entry point for the archive. For each element of the
764 archive which is included, BFD will call ldlang_add_file,
765 which will set the usrdata field of the member to the
766 lang_input_statement. */
767 if (member
->usrdata
!= NULL
)
769 walk_wild_section (s
, member
->usrdata
, callback
, data
);
772 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
778 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
780 const char *file_spec
= s
->filename
;
782 if (file_spec
== NULL
)
784 /* Perform the iteration over all files in the list. */
785 LANG_FOR_EACH_INPUT_STATEMENT (f
)
787 walk_wild_file (s
, f
, callback
, data
);
790 else if (wildcardp (file_spec
))
792 LANG_FOR_EACH_INPUT_STATEMENT (f
)
794 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
795 walk_wild_file (s
, f
, callback
, data
);
800 lang_input_statement_type
*f
;
802 /* Perform the iteration over a single file. */
803 f
= lookup_name (file_spec
);
805 walk_wild_file (s
, f
, callback
, data
);
809 /* lang_for_each_statement walks the parse tree and calls the provided
810 function for each node. */
813 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
814 lang_statement_union_type
*s
)
816 for (; s
!= NULL
; s
= s
->header
.next
)
820 switch (s
->header
.type
)
822 case lang_constructors_statement_enum
:
823 lang_for_each_statement_worker (func
, constructor_list
.head
);
825 case lang_output_section_statement_enum
:
826 lang_for_each_statement_worker
827 (func
, s
->output_section_statement
.children
.head
);
829 case lang_wild_statement_enum
:
830 lang_for_each_statement_worker (func
,
831 s
->wild_statement
.children
.head
);
833 case lang_group_statement_enum
:
834 lang_for_each_statement_worker (func
,
835 s
->group_statement
.children
.head
);
837 case lang_data_statement_enum
:
838 case lang_reloc_statement_enum
:
839 case lang_object_symbols_statement_enum
:
840 case lang_output_statement_enum
:
841 case lang_target_statement_enum
:
842 case lang_input_section_enum
:
843 case lang_input_statement_enum
:
844 case lang_assignment_statement_enum
:
845 case lang_padding_statement_enum
:
846 case lang_address_statement_enum
:
847 case lang_fill_statement_enum
:
857 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
859 lang_for_each_statement_worker (func
, statement_list
.head
);
862 /*----------------------------------------------------------------------*/
865 lang_list_init (lang_statement_list_type
*list
)
868 list
->tail
= &list
->head
;
871 /* Build a new statement node for the parse tree. */
873 static lang_statement_union_type
*
874 new_statement (enum statement_enum type
,
876 lang_statement_list_type
*list
)
878 lang_statement_union_type
*new;
880 new = stat_alloc (size
);
881 new->header
.type
= type
;
882 new->header
.next
= NULL
;
883 lang_statement_append (list
, new, &new->header
.next
);
887 /* Build a new input file node for the language. There are several
888 ways in which we treat an input file, eg, we only look at symbols,
889 or prefix it with a -l etc.
891 We can be supplied with requests for input files more than once;
892 they may, for example be split over several lines like foo.o(.text)
893 foo.o(.data) etc, so when asked for a file we check that we haven't
894 got it already so we don't duplicate the bfd. */
896 static lang_input_statement_type
*
897 new_afile (const char *name
,
898 lang_input_file_enum_type file_type
,
900 bfd_boolean add_to_list
)
902 lang_input_statement_type
*p
;
905 p
= new_stat (lang_input_statement
, stat_ptr
);
908 p
= stat_alloc (sizeof (lang_input_statement_type
));
909 p
->header
.type
= lang_input_statement_enum
;
910 p
->header
.next
= NULL
;
913 lang_has_input_file
= TRUE
;
915 p
->sysrooted
= FALSE
;
917 if (file_type
== lang_input_file_is_l_enum
918 && name
[0] == ':' && name
[1] != '\0')
920 file_type
= lang_input_file_is_search_file_enum
;
926 case lang_input_file_is_symbols_only_enum
:
928 p
->is_archive
= FALSE
;
930 p
->local_sym_name
= name
;
931 p
->just_syms_flag
= TRUE
;
932 p
->search_dirs_flag
= FALSE
;
934 case lang_input_file_is_fake_enum
:
936 p
->is_archive
= FALSE
;
938 p
->local_sym_name
= name
;
939 p
->just_syms_flag
= FALSE
;
940 p
->search_dirs_flag
= FALSE
;
942 case lang_input_file_is_l_enum
:
943 p
->is_archive
= TRUE
;
946 p
->local_sym_name
= concat ("-l", name
, NULL
);
947 p
->just_syms_flag
= FALSE
;
948 p
->search_dirs_flag
= TRUE
;
950 case lang_input_file_is_marker_enum
:
952 p
->is_archive
= FALSE
;
954 p
->local_sym_name
= name
;
955 p
->just_syms_flag
= FALSE
;
956 p
->search_dirs_flag
= TRUE
;
958 case lang_input_file_is_search_file_enum
:
959 p
->sysrooted
= ldlang_sysrooted_script
;
961 p
->is_archive
= FALSE
;
963 p
->local_sym_name
= name
;
964 p
->just_syms_flag
= FALSE
;
965 p
->search_dirs_flag
= TRUE
;
967 case lang_input_file_is_file_enum
:
969 p
->is_archive
= FALSE
;
971 p
->local_sym_name
= name
;
972 p
->just_syms_flag
= FALSE
;
973 p
->search_dirs_flag
= FALSE
;
980 p
->next_real_file
= NULL
;
983 p
->dynamic
= config
.dynamic_link
;
984 p
->add_needed
= add_needed
;
985 p
->as_needed
= as_needed
;
986 p
->whole_archive
= whole_archive
;
988 lang_statement_append (&input_file_chain
,
989 (lang_statement_union_type
*) p
,
994 lang_input_statement_type
*
995 lang_add_input_file (const char *name
,
996 lang_input_file_enum_type file_type
,
999 return new_afile (name
, file_type
, target
, TRUE
);
1002 struct out_section_hash_entry
1004 struct bfd_hash_entry root
;
1005 lang_statement_union_type s
;
1008 /* The hash table. */
1010 static struct bfd_hash_table output_section_statement_table
;
1012 /* Support routines for the hash table used by lang_output_section_find,
1013 initialize the table, fill in an entry and remove the table. */
1015 static struct bfd_hash_entry
*
1016 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1017 struct bfd_hash_table
*table
,
1020 lang_output_section_statement_type
**nextp
;
1021 struct out_section_hash_entry
*ret
;
1025 entry
= bfd_hash_allocate (table
, sizeof (*ret
));
1030 entry
= bfd_hash_newfunc (entry
, table
, string
);
1034 ret
= (struct out_section_hash_entry
*) entry
;
1035 memset (&ret
->s
, 0, sizeof (ret
->s
));
1036 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1037 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1038 ret
->s
.output_section_statement
.section_alignment
= -1;
1039 ret
->s
.output_section_statement
.block_value
= 1;
1040 lang_list_init (&ret
->s
.output_section_statement
.children
);
1041 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1043 /* For every output section statement added to the list, except the
1044 first one, lang_output_section_statement.tail points to the "next"
1045 field of the last element of the list. */
1046 if (lang_output_section_statement
.head
!= NULL
)
1047 ret
->s
.output_section_statement
.prev
1048 = ((lang_output_section_statement_type
*)
1049 ((char *) lang_output_section_statement
.tail
1050 - offsetof (lang_output_section_statement_type
, next
)));
1052 /* GCC's strict aliasing rules prevent us from just casting the
1053 address, so we store the pointer in a variable and cast that
1055 nextp
= &ret
->s
.output_section_statement
.next
;
1056 lang_statement_append (&lang_output_section_statement
,
1058 (lang_statement_union_type
**) nextp
);
1063 output_section_statement_table_init (void)
1065 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1066 output_section_statement_newfunc
,
1067 sizeof (struct out_section_hash_entry
),
1069 einfo (_("%P%F: can not create hash table: %E\n"));
1073 output_section_statement_table_free (void)
1075 bfd_hash_table_free (&output_section_statement_table
);
1078 /* Build enough state so that the parser can build its tree. */
1083 obstack_begin (&stat_obstack
, 1000);
1085 stat_ptr
= &statement_list
;
1087 output_section_statement_table_init ();
1089 lang_list_init (stat_ptr
);
1091 lang_list_init (&input_file_chain
);
1092 lang_list_init (&lang_output_section_statement
);
1093 lang_list_init (&file_chain
);
1094 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1096 abs_output_section
=
1097 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
1099 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1101 /* The value "3" is ad-hoc, somewhat related to the expected number of
1102 DEFINED expressions in a linker script. For most default linker
1103 scripts, there are none. Why a hash table then? Well, it's somewhat
1104 simpler to re-use working machinery than using a linked list in terms
1105 of code-complexity here in ld, besides the initialization which just
1106 looks like other code here. */
1107 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1108 lang_definedness_newfunc
,
1109 sizeof (struct lang_definedness_hash_entry
),
1111 einfo (_("%P%F: can not create hash table: %E\n"));
1117 output_section_statement_table_free ();
1120 /*----------------------------------------------------------------------
1121 A region is an area of memory declared with the
1122 MEMORY { name:org=exp, len=exp ... }
1125 We maintain a list of all the regions here.
1127 If no regions are specified in the script, then the default is used
1128 which is created when looked up to be the entire data space.
1130 If create is true we are creating a region inside a MEMORY block.
1131 In this case it is probably an error to create a region that has
1132 already been created. If we are not inside a MEMORY block it is
1133 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1134 and so we issue a warning. */
1136 static lang_memory_region_type
*lang_memory_region_list
;
1137 static lang_memory_region_type
**lang_memory_region_list_tail
1138 = &lang_memory_region_list
;
1140 lang_memory_region_type
*
1141 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1143 lang_memory_region_type
*p
;
1144 lang_memory_region_type
*new;
1146 /* NAME is NULL for LMA memspecs if no region was specified. */
1150 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1151 if (strcmp (p
->name
, name
) == 0)
1154 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1159 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1160 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
1162 new = stat_alloc (sizeof (lang_memory_region_type
));
1164 new->name
= xstrdup (name
);
1167 new->length
= ~(bfd_size_type
) 0;
1169 new->last_os
= NULL
;
1172 new->had_full_message
= FALSE
;
1174 *lang_memory_region_list_tail
= new;
1175 lang_memory_region_list_tail
= &new->next
;
1180 static lang_memory_region_type
*
1181 lang_memory_default (asection
*section
)
1183 lang_memory_region_type
*p
;
1185 flagword sec_flags
= section
->flags
;
1187 /* Override SEC_DATA to mean a writable section. */
1188 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1189 sec_flags
|= SEC_DATA
;
1191 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1193 if ((p
->flags
& sec_flags
) != 0
1194 && (p
->not_flags
& sec_flags
) == 0)
1199 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1202 lang_output_section_statement_type
*
1203 lang_output_section_find (const char *const name
)
1205 struct out_section_hash_entry
*entry
;
1208 entry
= ((struct out_section_hash_entry
*)
1209 bfd_hash_lookup (&output_section_statement_table
, name
,
1214 hash
= entry
->root
.hash
;
1217 if (entry
->s
.output_section_statement
.constraint
!= -1)
1218 return &entry
->s
.output_section_statement
;
1219 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1221 while (entry
!= NULL
1222 && entry
->root
.hash
== hash
1223 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1228 static lang_output_section_statement_type
*
1229 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1231 struct out_section_hash_entry
*entry
;
1232 struct out_section_hash_entry
*last_ent
;
1235 entry
= ((struct out_section_hash_entry
*)
1236 bfd_hash_lookup (&output_section_statement_table
, name
,
1240 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1244 if (entry
->s
.output_section_statement
.name
!= NULL
)
1246 /* We have a section of this name, but it might not have the correct
1248 hash
= entry
->root
.hash
;
1251 if (entry
->s
.output_section_statement
.constraint
!= -1
1253 || (constraint
== entry
->s
.output_section_statement
.constraint
1254 && constraint
!= SPECIAL
)))
1255 return &entry
->s
.output_section_statement
;
1257 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1259 while (entry
!= NULL
1260 && entry
->root
.hash
== hash
1261 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1264 = ((struct out_section_hash_entry
*)
1265 output_section_statement_newfunc (NULL
,
1266 &output_section_statement_table
,
1270 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1273 entry
->root
= last_ent
->root
;
1274 last_ent
->root
.next
= &entry
->root
;
1277 entry
->s
.output_section_statement
.name
= name
;
1278 entry
->s
.output_section_statement
.constraint
= constraint
;
1279 return &entry
->s
.output_section_statement
;
1282 lang_output_section_statement_type
*
1283 lang_output_section_statement_lookup (const char *const name
)
1285 return lang_output_section_statement_lookup_1 (name
, 0);
1288 /* A variant of lang_output_section_find used by place_orphan.
1289 Returns the output statement that should precede a new output
1290 statement for SEC. If an exact match is found on certain flags,
1293 lang_output_section_statement_type
*
1294 lang_output_section_find_by_flags (const asection
*sec
,
1295 lang_output_section_statement_type
**exact
,
1296 lang_match_sec_type_func match_type
)
1298 lang_output_section_statement_type
*first
, *look
, *found
;
1301 /* We know the first statement on this list is *ABS*. May as well
1303 first
= &lang_output_section_statement
.head
->output_section_statement
;
1304 first
= first
->next
;
1306 /* First try for an exact match. */
1308 for (look
= first
; look
; look
= look
->next
)
1310 flags
= look
->flags
;
1311 if (look
->bfd_section
!= NULL
)
1313 flags
= look
->bfd_section
->flags
;
1314 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1318 flags
^= sec
->flags
;
1319 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1320 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1330 if (sec
->flags
& SEC_CODE
)
1332 /* Try for a rw code section. */
1333 for (look
= first
; look
; look
= look
->next
)
1335 flags
= look
->flags
;
1336 if (look
->bfd_section
!= NULL
)
1338 flags
= look
->bfd_section
->flags
;
1339 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1343 flags
^= sec
->flags
;
1344 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1345 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1349 else if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1351 /* .rodata can go after .text, .sdata2 after .rodata. */
1352 for (look
= first
; look
; look
= look
->next
)
1354 flags
= look
->flags
;
1355 if (look
->bfd_section
!= NULL
)
1357 flags
= look
->bfd_section
->flags
;
1358 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1362 flags
^= sec
->flags
;
1363 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1365 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1369 else if (sec
->flags
& SEC_SMALL_DATA
)
1371 /* .sdata goes after .data, .sbss after .sdata. */
1372 for (look
= first
; look
; look
= look
->next
)
1374 flags
= look
->flags
;
1375 if (look
->bfd_section
!= NULL
)
1377 flags
= look
->bfd_section
->flags
;
1378 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1382 flags
^= sec
->flags
;
1383 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1384 | SEC_THREAD_LOCAL
))
1385 || ((look
->flags
& SEC_SMALL_DATA
)
1386 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1390 else if (sec
->flags
& SEC_HAS_CONTENTS
)
1392 /* .data goes after .rodata. */
1393 for (look
= first
; look
; look
= look
->next
)
1395 flags
= look
->flags
;
1396 if (look
->bfd_section
!= NULL
)
1398 flags
= look
->bfd_section
->flags
;
1399 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1403 flags
^= sec
->flags
;
1404 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1405 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1411 /* .bss goes last. */
1412 for (look
= first
; look
; look
= look
->next
)
1414 flags
= look
->flags
;
1415 if (look
->bfd_section
!= NULL
)
1417 flags
= look
->bfd_section
->flags
;
1418 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1422 flags
^= sec
->flags
;
1423 if (!(flags
& SEC_ALLOC
))
1428 if (found
|| !match_type
)
1431 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1434 /* Find the last output section before given output statement.
1435 Used by place_orphan. */
1438 output_prev_sec_find (lang_output_section_statement_type
*os
)
1440 lang_output_section_statement_type
*lookup
;
1442 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1444 if (lookup
->constraint
== -1)
1447 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1448 return lookup
->bfd_section
;
1454 lang_output_section_statement_type
*
1455 lang_insert_orphan (asection
*s
,
1456 const char *secname
,
1457 lang_output_section_statement_type
*after
,
1458 struct orphan_save
*place
,
1459 etree_type
*address
,
1460 lang_statement_list_type
*add_child
)
1462 lang_statement_list_type
*old
;
1463 lang_statement_list_type add
;
1465 lang_output_section_statement_type
*os
;
1466 lang_output_section_statement_type
**os_tail
;
1468 /* Start building a list of statements for this section.
1469 First save the current statement pointer. */
1472 /* If we have found an appropriate place for the output section
1473 statements for this orphan, add them to our own private list,
1474 inserting them later into the global statement list. */
1478 lang_list_init (stat_ptr
);
1482 if (config
.build_constructors
)
1484 /* If the name of the section is representable in C, then create
1485 symbols to mark the start and the end of the section. */
1486 for (ps
= secname
; *ps
!= '\0'; ps
++)
1487 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1492 etree_type
*e_align
;
1494 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1495 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1496 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1497 e_align
= exp_unop (ALIGN_K
,
1498 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1499 lang_add_assignment (exp_assop ('=', ".", e_align
));
1500 lang_add_assignment (exp_provide (symname
,
1501 exp_nameop (NAME
, "."),
1506 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1507 address
= exp_intop (0);
1509 os_tail
= ((lang_output_section_statement_type
**)
1510 lang_output_section_statement
.tail
);
1511 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1514 if (add_child
== NULL
)
1515 add_child
= &os
->children
;
1516 lang_add_section (add_child
, s
, os
);
1518 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1520 if (config
.build_constructors
&& *ps
== '\0')
1524 /* lang_leave_ouput_section_statement resets stat_ptr.
1525 Put stat_ptr back where we want it. */
1529 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1530 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1531 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1532 lang_add_assignment (exp_provide (symname
,
1533 exp_nameop (NAME
, "."),
1537 /* Restore the global list pointer. */
1541 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1543 asection
*snew
, *as
;
1545 snew
= os
->bfd_section
;
1547 /* Shuffle the bfd section list to make the output file look
1548 neater. This is really only cosmetic. */
1549 if (place
->section
== NULL
1550 && after
!= (&lang_output_section_statement
.head
1551 ->output_section_statement
))
1553 asection
*bfd_section
= after
->bfd_section
;
1555 /* If the output statement hasn't been used to place any input
1556 sections (and thus doesn't have an output bfd_section),
1557 look for the closest prior output statement having an
1559 if (bfd_section
== NULL
)
1560 bfd_section
= output_prev_sec_find (after
);
1562 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1563 place
->section
= &bfd_section
->next
;
1566 if (place
->section
== NULL
)
1567 place
->section
= &output_bfd
->sections
;
1569 as
= *place
->section
;
1573 /* Put the section at the end of the list. */
1575 /* Unlink the section. */
1576 bfd_section_list_remove (output_bfd
, snew
);
1578 /* Now tack it back on in the right place. */
1579 bfd_section_list_append (output_bfd
, snew
);
1581 else if (as
!= snew
&& as
->prev
!= snew
)
1583 /* Unlink the section. */
1584 bfd_section_list_remove (output_bfd
, snew
);
1586 /* Now tack it back on in the right place. */
1587 bfd_section_list_insert_before (output_bfd
, as
, snew
);
1590 /* Save the end of this list. Further ophans of this type will
1591 follow the one we've just added. */
1592 place
->section
= &snew
->next
;
1594 /* The following is non-cosmetic. We try to put the output
1595 statements in some sort of reasonable order here, because they
1596 determine the final load addresses of the orphan sections.
1597 In addition, placing output statements in the wrong order may
1598 require extra segments. For instance, given a typical
1599 situation of all read-only sections placed in one segment and
1600 following that a segment containing all the read-write
1601 sections, we wouldn't want to place an orphan read/write
1602 section before or amongst the read-only ones. */
1603 if (add
.head
!= NULL
)
1605 lang_output_section_statement_type
*newly_added_os
;
1607 if (place
->stmt
== NULL
)
1609 lang_statement_union_type
**where
;
1610 lang_statement_union_type
**assign
= NULL
;
1611 bfd_boolean ignore_first
;
1613 /* Look for a suitable place for the new statement list.
1614 The idea is to skip over anything that might be inside
1615 a SECTIONS {} statement in a script, before we find
1616 another output_section_statement. Assignments to "dot"
1617 before an output section statement are assumed to
1618 belong to it. An exception to this rule is made for
1619 the first assignment to dot, otherwise we might put an
1620 orphan before . = . + SIZEOF_HEADERS or similar
1621 assignments that set the initial address. */
1623 ignore_first
= after
== (&lang_output_section_statement
.head
1624 ->output_section_statement
);
1625 for (where
= &after
->header
.next
;
1627 where
= &(*where
)->header
.next
)
1629 switch ((*where
)->header
.type
)
1631 case lang_assignment_statement_enum
:
1634 lang_assignment_statement_type
*ass
;
1635 ass
= &(*where
)->assignment_statement
;
1636 if (ass
->exp
->type
.node_class
!= etree_assert
1637 && ass
->exp
->assign
.dst
[0] == '.'
1638 && ass
->exp
->assign
.dst
[1] == 0
1642 ignore_first
= FALSE
;
1644 case lang_wild_statement_enum
:
1645 case lang_input_section_enum
:
1646 case lang_object_symbols_statement_enum
:
1647 case lang_fill_statement_enum
:
1648 case lang_data_statement_enum
:
1649 case lang_reloc_statement_enum
:
1650 case lang_padding_statement_enum
:
1651 case lang_constructors_statement_enum
:
1654 case lang_output_section_statement_enum
:
1658 case lang_input_statement_enum
:
1659 case lang_address_statement_enum
:
1660 case lang_target_statement_enum
:
1661 case lang_output_statement_enum
:
1662 case lang_group_statement_enum
:
1663 case lang_afile_asection_pair_statement_enum
:
1672 place
->os_tail
= &after
->next
;
1676 /* Put it after the last orphan statement we added. */
1677 *add
.tail
= *place
->stmt
;
1678 *place
->stmt
= add
.head
;
1681 /* Fix the global list pointer if we happened to tack our
1682 new list at the tail. */
1683 if (*old
->tail
== add
.head
)
1684 old
->tail
= add
.tail
;
1686 /* Save the end of this list. */
1687 place
->stmt
= add
.tail
;
1689 /* Do the same for the list of output section statements. */
1690 newly_added_os
= *os_tail
;
1692 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1693 ((char *) place
->os_tail
1694 - offsetof (lang_output_section_statement_type
, next
));
1695 newly_added_os
->next
= *place
->os_tail
;
1696 if (newly_added_os
->next
!= NULL
)
1697 newly_added_os
->next
->prev
= newly_added_os
;
1698 *place
->os_tail
= newly_added_os
;
1699 place
->os_tail
= &newly_added_os
->next
;
1701 /* Fixing the global list pointer here is a little different.
1702 We added to the list in lang_enter_output_section_statement,
1703 trimmed off the new output_section_statment above when
1704 assigning *os_tail = NULL, but possibly added it back in
1705 the same place when assigning *place->os_tail. */
1706 if (*os_tail
== NULL
)
1707 lang_output_section_statement
.tail
1708 = (lang_statement_union_type
**) os_tail
;
1715 lang_map_flags (flagword flag
)
1717 if (flag
& SEC_ALLOC
)
1720 if (flag
& SEC_CODE
)
1723 if (flag
& SEC_READONLY
)
1726 if (flag
& SEC_DATA
)
1729 if (flag
& SEC_LOAD
)
1736 lang_memory_region_type
*m
;
1737 bfd_boolean dis_header_printed
= FALSE
;
1740 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1744 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1745 || file
->just_syms_flag
)
1748 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1749 if ((s
->output_section
== NULL
1750 || s
->output_section
->owner
!= output_bfd
)
1751 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1753 if (! dis_header_printed
)
1755 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1756 dis_header_printed
= TRUE
;
1759 print_input_section (s
);
1763 minfo (_("\nMemory Configuration\n\n"));
1764 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1765 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1767 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1772 fprintf (config
.map_file
, "%-16s ", m
->name
);
1774 sprintf_vma (buf
, m
->origin
);
1775 minfo ("0x%s ", buf
);
1783 minfo ("0x%V", m
->length
);
1784 if (m
->flags
|| m
->not_flags
)
1792 lang_map_flags (m
->flags
);
1798 lang_map_flags (m
->not_flags
);
1805 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1807 if (! link_info
.reduce_memory_overheads
)
1809 obstack_begin (&map_obstack
, 1000);
1810 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1811 bfd_map_over_sections (p
, init_map_userdata
, 0);
1812 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1814 print_statements ();
1818 init_map_userdata (abfd
, sec
, data
)
1819 bfd
*abfd ATTRIBUTE_UNUSED
;
1821 void *data ATTRIBUTE_UNUSED
;
1823 fat_section_userdata_type
*new_data
1824 = ((fat_section_userdata_type
*) (stat_alloc
1825 (sizeof (fat_section_userdata_type
))));
1827 ASSERT (get_userdata (sec
) == NULL
);
1828 get_userdata (sec
) = new_data
;
1829 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1833 sort_def_symbol (hash_entry
, info
)
1834 struct bfd_link_hash_entry
*hash_entry
;
1835 void *info ATTRIBUTE_UNUSED
;
1837 if (hash_entry
->type
== bfd_link_hash_defined
1838 || hash_entry
->type
== bfd_link_hash_defweak
)
1840 struct fat_user_section_struct
*ud
;
1841 struct map_symbol_def
*def
;
1843 ud
= get_userdata (hash_entry
->u
.def
.section
);
1846 /* ??? What do we have to do to initialize this beforehand? */
1847 /* The first time we get here is bfd_abs_section... */
1848 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1849 ud
= get_userdata (hash_entry
->u
.def
.section
);
1851 else if (!ud
->map_symbol_def_tail
)
1852 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1854 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1855 def
->entry
= hash_entry
;
1856 *(ud
->map_symbol_def_tail
) = def
;
1857 ud
->map_symbol_def_tail
= &def
->next
;
1862 /* Initialize an output section. */
1865 init_os (lang_output_section_statement_type
*s
, asection
*isec
,
1868 if (s
->bfd_section
!= NULL
)
1871 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1872 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1874 s
->bfd_section
= bfd_get_section_by_name (output_bfd
, s
->name
);
1875 if (s
->bfd_section
== NULL
)
1876 s
->bfd_section
= bfd_make_section_with_flags (output_bfd
, s
->name
,
1878 if (s
->bfd_section
== NULL
)
1880 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1881 output_bfd
->xvec
->name
, s
->name
);
1883 s
->bfd_section
->output_section
= s
->bfd_section
;
1884 s
->bfd_section
->output_offset
= 0;
1886 if (!link_info
.reduce_memory_overheads
)
1888 fat_section_userdata_type
*new
1889 = stat_alloc (sizeof (fat_section_userdata_type
));
1890 memset (new, 0, sizeof (fat_section_userdata_type
));
1891 get_userdata (s
->bfd_section
) = new;
1894 /* If there is a base address, make sure that any sections it might
1895 mention are initialized. */
1896 if (s
->addr_tree
!= NULL
)
1897 exp_init_os (s
->addr_tree
);
1899 if (s
->load_base
!= NULL
)
1900 exp_init_os (s
->load_base
);
1902 /* If supplied an alignment, set it. */
1903 if (s
->section_alignment
!= -1)
1904 s
->bfd_section
->alignment_power
= s
->section_alignment
;
1907 bfd_init_private_section_data (isec
->owner
, isec
,
1908 output_bfd
, s
->bfd_section
,
1912 /* Make sure that all output sections mentioned in an expression are
1916 exp_init_os (etree_type
*exp
)
1918 switch (exp
->type
.node_class
)
1922 exp_init_os (exp
->assign
.src
);
1926 exp_init_os (exp
->binary
.lhs
);
1927 exp_init_os (exp
->binary
.rhs
);
1931 exp_init_os (exp
->trinary
.cond
);
1932 exp_init_os (exp
->trinary
.lhs
);
1933 exp_init_os (exp
->trinary
.rhs
);
1937 exp_init_os (exp
->assert_s
.child
);
1941 exp_init_os (exp
->unary
.child
);
1945 switch (exp
->type
.node_code
)
1951 lang_output_section_statement_type
*os
;
1953 os
= lang_output_section_find (exp
->name
.name
);
1954 if (os
!= NULL
&& os
->bfd_section
== NULL
)
1955 init_os (os
, NULL
, 0);
1966 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
1968 lang_input_statement_type
*entry
= data
;
1970 /* If we are only reading symbols from this object, then we want to
1971 discard all sections. */
1972 if (entry
->just_syms_flag
)
1974 bfd_link_just_syms (abfd
, sec
, &link_info
);
1978 if (!(abfd
->flags
& DYNAMIC
))
1979 bfd_section_already_linked (abfd
, sec
, &link_info
);
1982 /* The wild routines.
1984 These expand statements like *(.text) and foo.o to a list of
1985 explicit actions, like foo.o(.text), bar.o(.text) and
1986 foo.o(.text, .data). */
1988 /* Add SECTION to the output section OUTPUT. Do this by creating a
1989 lang_input_section statement which is placed at PTR. FILE is the
1990 input file which holds SECTION. */
1993 lang_add_section (lang_statement_list_type
*ptr
,
1995 lang_output_section_statement_type
*output
)
1997 flagword flags
= section
->flags
;
1998 bfd_boolean discard
;
2000 /* Discard sections marked with SEC_EXCLUDE. */
2001 discard
= (flags
& SEC_EXCLUDE
) != 0;
2003 /* Discard input sections which are assigned to a section named
2004 DISCARD_SECTION_NAME. */
2005 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2008 /* Discard debugging sections if we are stripping debugging
2010 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2011 && (flags
& SEC_DEBUGGING
) != 0)
2016 if (section
->output_section
== NULL
)
2018 /* This prevents future calls from assigning this section. */
2019 section
->output_section
= bfd_abs_section_ptr
;
2024 if (section
->output_section
== NULL
)
2027 lang_input_section_type
*new;
2030 flags
= section
->flags
;
2032 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2033 to an output section, because we want to be able to include a
2034 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2035 section (I don't know why we want to do this, but we do).
2036 build_link_order in ldwrite.c handles this case by turning
2037 the embedded SEC_NEVER_LOAD section into a fill. */
2039 flags
&= ~ SEC_NEVER_LOAD
;
2041 switch (output
->sectype
)
2043 case normal_section
:
2044 case overlay_section
:
2046 case noalloc_section
:
2047 flags
&= ~SEC_ALLOC
;
2049 case noload_section
:
2051 flags
|= SEC_NEVER_LOAD
;
2055 if (output
->bfd_section
== NULL
)
2056 init_os (output
, section
, flags
);
2058 first
= ! output
->bfd_section
->linker_has_input
;
2059 output
->bfd_section
->linker_has_input
= 1;
2061 if (!link_info
.relocatable
2062 && !stripped_excluded_sections
)
2064 asection
*s
= output
->bfd_section
->map_tail
.s
;
2065 output
->bfd_section
->map_tail
.s
= section
;
2066 section
->map_head
.s
= NULL
;
2067 section
->map_tail
.s
= s
;
2069 s
->map_head
.s
= section
;
2071 output
->bfd_section
->map_head
.s
= section
;
2074 /* Add a section reference to the list. */
2075 new = new_stat (lang_input_section
, ptr
);
2077 new->section
= section
;
2078 section
->output_section
= output
->bfd_section
;
2080 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2081 already been processed. One reason to do this is that on pe
2082 format targets, .text$foo sections go into .text and it's odd
2083 to see .text with SEC_LINK_ONCE set. */
2085 if (! link_info
.relocatable
)
2086 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
2088 /* If this is not the first input section, and the SEC_READONLY
2089 flag is not currently set, then don't set it just because the
2090 input section has it set. */
2092 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
2093 flags
&= ~ SEC_READONLY
;
2095 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2097 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2098 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2099 || ((flags
& SEC_MERGE
)
2100 && output
->bfd_section
->entsize
!= section
->entsize
)))
2102 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2103 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2106 output
->bfd_section
->flags
|= flags
;
2108 if (flags
& SEC_MERGE
)
2109 output
->bfd_section
->entsize
= section
->entsize
;
2111 /* If SEC_READONLY is not set in the input section, then clear
2112 it from the output section. */
2113 if ((section
->flags
& SEC_READONLY
) == 0)
2114 output
->bfd_section
->flags
&= ~SEC_READONLY
;
2116 /* Copy over SEC_SMALL_DATA. */
2117 if (section
->flags
& SEC_SMALL_DATA
)
2118 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
2120 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2121 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2123 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
2124 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
2126 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
2127 /* FIXME: This value should really be obtained from the bfd... */
2128 output
->block_value
= 128;
2133 /* Handle wildcard sorting. This returns the lang_input_section which
2134 should follow the one we are going to create for SECTION and FILE,
2135 based on the sorting requirements of WILD. It returns NULL if the
2136 new section should just go at the end of the current list. */
2138 static lang_statement_union_type
*
2139 wild_sort (lang_wild_statement_type
*wild
,
2140 struct wildcard_list
*sec
,
2141 lang_input_statement_type
*file
,
2144 const char *section_name
;
2145 lang_statement_union_type
*l
;
2147 if (!wild
->filenames_sorted
2148 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2151 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2152 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2154 lang_input_section_type
*ls
;
2156 if (l
->header
.type
!= lang_input_section_enum
)
2158 ls
= &l
->input_section
;
2160 /* Sorting by filename takes precedence over sorting by section
2163 if (wild
->filenames_sorted
)
2165 const char *fn
, *ln
;
2169 /* The PE support for the .idata section as generated by
2170 dlltool assumes that files will be sorted by the name of
2171 the archive and then the name of the file within the
2174 if (file
->the_bfd
!= NULL
2175 && bfd_my_archive (file
->the_bfd
) != NULL
)
2177 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2182 fn
= file
->filename
;
2186 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2188 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2193 ln
= ls
->section
->owner
->filename
;
2197 i
= strcmp (fn
, ln
);
2206 fn
= file
->filename
;
2208 ln
= ls
->section
->owner
->filename
;
2210 i
= strcmp (fn
, ln
);
2218 /* Here either the files are not sorted by name, or we are
2219 looking at the sections for this file. */
2221 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2222 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2229 /* Expand a wild statement for a particular FILE. SECTION may be
2230 NULL, in which case it is a wild card. */
2233 output_section_callback (lang_wild_statement_type
*ptr
,
2234 struct wildcard_list
*sec
,
2236 lang_input_statement_type
*file
,
2239 lang_statement_union_type
*before
;
2241 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2242 if (unique_section_p (section
))
2245 before
= wild_sort (ptr
, sec
, file
, section
);
2247 /* Here BEFORE points to the lang_input_section which
2248 should follow the one we are about to add. If BEFORE
2249 is NULL, then the section should just go at the end
2250 of the current list. */
2253 lang_add_section (&ptr
->children
, section
,
2254 (lang_output_section_statement_type
*) output
);
2257 lang_statement_list_type list
;
2258 lang_statement_union_type
**pp
;
2260 lang_list_init (&list
);
2261 lang_add_section (&list
, section
,
2262 (lang_output_section_statement_type
*) output
);
2264 /* If we are discarding the section, LIST.HEAD will
2266 if (list
.head
!= NULL
)
2268 ASSERT (list
.head
->header
.next
== NULL
);
2270 for (pp
= &ptr
->children
.head
;
2272 pp
= &(*pp
)->header
.next
)
2273 ASSERT (*pp
!= NULL
);
2275 list
.head
->header
.next
= *pp
;
2281 /* Check if all sections in a wild statement for a particular FILE
2285 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2286 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2288 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2291 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2292 if (unique_section_p (section
))
2295 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2296 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2299 /* This is passed a file name which must have been seen already and
2300 added to the statement tree. We will see if it has been opened
2301 already and had its symbols read. If not then we'll read it. */
2303 static lang_input_statement_type
*
2304 lookup_name (const char *name
)
2306 lang_input_statement_type
*search
;
2308 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2310 search
= (lang_input_statement_type
*) search
->next_real_file
)
2312 /* Use the local_sym_name as the name of the file that has
2313 already been loaded as filename might have been transformed
2314 via the search directory lookup mechanism. */
2315 const char *filename
= search
->local_sym_name
;
2317 if (filename
!= NULL
2318 && strcmp (filename
, name
) == 0)
2323 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2324 default_target
, FALSE
);
2326 /* If we have already added this file, or this file is not real
2327 don't add this file. */
2328 if (search
->loaded
|| !search
->real
)
2331 if (! load_symbols (search
, NULL
))
2337 /* Save LIST as a list of libraries whose symbols should not be exported. */
2342 struct excluded_lib
*next
;
2344 static struct excluded_lib
*excluded_libs
;
2347 add_excluded_libs (const char *list
)
2349 const char *p
= list
, *end
;
2353 struct excluded_lib
*entry
;
2354 end
= strpbrk (p
, ",:");
2356 end
= p
+ strlen (p
);
2357 entry
= xmalloc (sizeof (*entry
));
2358 entry
->next
= excluded_libs
;
2359 entry
->name
= xmalloc (end
- p
+ 1);
2360 memcpy (entry
->name
, p
, end
- p
);
2361 entry
->name
[end
- p
] = '\0';
2362 excluded_libs
= entry
;
2370 check_excluded_libs (bfd
*abfd
)
2372 struct excluded_lib
*lib
= excluded_libs
;
2376 int len
= strlen (lib
->name
);
2377 const char *filename
= lbasename (abfd
->filename
);
2379 if (strcmp (lib
->name
, "ALL") == 0)
2381 abfd
->no_export
= TRUE
;
2385 if (strncmp (lib
->name
, filename
, len
) == 0
2386 && (filename
[len
] == '\0'
2387 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2388 && filename
[len
+ 2] == '\0')))
2390 abfd
->no_export
= TRUE
;
2398 /* Get the symbols for an input file. */
2401 load_symbols (lang_input_statement_type
*entry
,
2402 lang_statement_list_type
*place
)
2409 ldfile_open_file (entry
);
2411 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2412 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2415 lang_statement_list_type
*hold
;
2416 bfd_boolean bad_load
= TRUE
;
2417 bfd_boolean save_ldlang_sysrooted_script
;
2418 bfd_boolean save_as_needed
, save_add_needed
;
2420 err
= bfd_get_error ();
2422 /* See if the emulation has some special knowledge. */
2423 if (ldemul_unrecognized_file (entry
))
2426 if (err
== bfd_error_file_ambiguously_recognized
)
2430 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2431 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2432 for (p
= matching
; *p
!= NULL
; p
++)
2436 else if (err
!= bfd_error_file_not_recognized
2438 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2442 bfd_close (entry
->the_bfd
);
2443 entry
->the_bfd
= NULL
;
2445 /* Try to interpret the file as a linker script. */
2446 ldfile_open_command_file (entry
->filename
);
2450 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2451 ldlang_sysrooted_script
= entry
->sysrooted
;
2452 save_as_needed
= as_needed
;
2453 as_needed
= entry
->as_needed
;
2454 save_add_needed
= add_needed
;
2455 add_needed
= entry
->add_needed
;
2457 ldfile_assumed_script
= TRUE
;
2458 parser_input
= input_script
;
2459 /* We want to use the same -Bdynamic/-Bstatic as the one for
2461 config
.dynamic_link
= entry
->dynamic
;
2463 ldfile_assumed_script
= FALSE
;
2465 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2466 as_needed
= save_as_needed
;
2467 add_needed
= save_add_needed
;
2473 if (ldemul_recognized_file (entry
))
2476 /* We don't call ldlang_add_file for an archive. Instead, the
2477 add_symbols entry point will call ldlang_add_file, via the
2478 add_archive_element callback, for each element of the archive
2480 switch (bfd_get_format (entry
->the_bfd
))
2486 ldlang_add_file (entry
);
2487 if (trace_files
|| trace_file_tries
)
2488 info_msg ("%I\n", entry
);
2492 check_excluded_libs (entry
->the_bfd
);
2494 if (entry
->whole_archive
)
2497 bfd_boolean loaded
= TRUE
;
2501 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2506 if (! bfd_check_format (member
, bfd_object
))
2508 einfo (_("%F%B: member %B in archive is not an object\n"),
2509 entry
->the_bfd
, member
);
2513 if (! ((*link_info
.callbacks
->add_archive_element
)
2514 (&link_info
, member
, "--whole-archive")))
2517 if (! bfd_link_add_symbols (member
, &link_info
))
2519 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2524 entry
->loaded
= loaded
;
2530 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2531 entry
->loaded
= TRUE
;
2533 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2535 return entry
->loaded
;
2538 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2539 may be NULL, indicating that it is a wildcard. Separate
2540 lang_input_section statements are created for each part of the
2541 expansion; they are added after the wild statement S. OUTPUT is
2542 the output section. */
2545 wild (lang_wild_statement_type
*s
,
2546 const char *target ATTRIBUTE_UNUSED
,
2547 lang_output_section_statement_type
*output
)
2549 struct wildcard_list
*sec
;
2551 if (s
->handler_data
[0]
2552 && s
->handler_data
[0]->spec
.sorted
== by_name
2553 && !s
->filenames_sorted
)
2555 lang_section_bst_type
*tree
;
2557 walk_wild (s
, output_section_callback_fast
, output
);
2562 output_section_callback_tree_to_list (s
, tree
, output
);
2567 walk_wild (s
, output_section_callback
, output
);
2569 if (default_common_section
== NULL
)
2570 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2571 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2573 /* Remember the section that common is going to in case we
2574 later get something which doesn't know where to put it. */
2575 default_common_section
= output
;
2580 /* Return TRUE iff target is the sought target. */
2583 get_target (const bfd_target
*target
, void *data
)
2585 const char *sought
= data
;
2587 return strcmp (target
->name
, sought
) == 0;
2590 /* Like strcpy() but convert to lower case as well. */
2593 stricpy (char *dest
, char *src
)
2597 while ((c
= *src
++) != 0)
2598 *dest
++ = TOLOWER (c
);
2603 /* Remove the first occurrence of needle (if any) in haystack
2607 strcut (char *haystack
, char *needle
)
2609 haystack
= strstr (haystack
, needle
);
2615 for (src
= haystack
+ strlen (needle
); *src
;)
2616 *haystack
++ = *src
++;
2622 /* Compare two target format name strings.
2623 Return a value indicating how "similar" they are. */
2626 name_compare (char *first
, char *second
)
2632 copy1
= xmalloc (strlen (first
) + 1);
2633 copy2
= xmalloc (strlen (second
) + 1);
2635 /* Convert the names to lower case. */
2636 stricpy (copy1
, first
);
2637 stricpy (copy2
, second
);
2639 /* Remove size and endian strings from the name. */
2640 strcut (copy1
, "big");
2641 strcut (copy1
, "little");
2642 strcut (copy2
, "big");
2643 strcut (copy2
, "little");
2645 /* Return a value based on how many characters match,
2646 starting from the beginning. If both strings are
2647 the same then return 10 * their length. */
2648 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2649 if (copy1
[result
] == 0)
2661 /* Set by closest_target_match() below. */
2662 static const bfd_target
*winner
;
2664 /* Scan all the valid bfd targets looking for one that has the endianness
2665 requirement that was specified on the command line, and is the nearest
2666 match to the original output target. */
2669 closest_target_match (const bfd_target
*target
, void *data
)
2671 const bfd_target
*original
= data
;
2673 if (command_line
.endian
== ENDIAN_BIG
2674 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2677 if (command_line
.endian
== ENDIAN_LITTLE
2678 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2681 /* Must be the same flavour. */
2682 if (target
->flavour
!= original
->flavour
)
2685 /* If we have not found a potential winner yet, then record this one. */
2692 /* Oh dear, we now have two potential candidates for a successful match.
2693 Compare their names and choose the better one. */
2694 if (name_compare (target
->name
, original
->name
)
2695 > name_compare (winner
->name
, original
->name
))
2698 /* Keep on searching until wqe have checked them all. */
2702 /* Return the BFD target format of the first input file. */
2705 get_first_input_target (void)
2707 char *target
= NULL
;
2709 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2711 if (s
->header
.type
== lang_input_statement_enum
2714 ldfile_open_file (s
);
2716 if (s
->the_bfd
!= NULL
2717 && bfd_check_format (s
->the_bfd
, bfd_object
))
2719 target
= bfd_get_target (s
->the_bfd
);
2731 lang_get_output_target (void)
2735 /* Has the user told us which output format to use? */
2736 if (output_target
!= NULL
)
2737 return output_target
;
2739 /* No - has the current target been set to something other than
2741 if (current_target
!= default_target
)
2742 return current_target
;
2744 /* No - can we determine the format of the first input file? */
2745 target
= get_first_input_target ();
2749 /* Failed - use the default output target. */
2750 return default_target
;
2753 /* Open the output file. */
2756 open_output (const char *name
)
2760 output_target
= lang_get_output_target ();
2762 /* Has the user requested a particular endianness on the command
2764 if (command_line
.endian
!= ENDIAN_UNSET
)
2766 const bfd_target
*target
;
2767 enum bfd_endian desired_endian
;
2769 /* Get the chosen target. */
2770 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2772 /* If the target is not supported, we cannot do anything. */
2775 if (command_line
.endian
== ENDIAN_BIG
)
2776 desired_endian
= BFD_ENDIAN_BIG
;
2778 desired_endian
= BFD_ENDIAN_LITTLE
;
2780 /* See if the target has the wrong endianness. This should
2781 not happen if the linker script has provided big and
2782 little endian alternatives, but some scrips don't do
2784 if (target
->byteorder
!= desired_endian
)
2786 /* If it does, then see if the target provides
2787 an alternative with the correct endianness. */
2788 if (target
->alternative_target
!= NULL
2789 && (target
->alternative_target
->byteorder
== desired_endian
))
2790 output_target
= target
->alternative_target
->name
;
2793 /* Try to find a target as similar as possible to
2794 the default target, but which has the desired
2795 endian characteristic. */
2796 bfd_search_for_target (closest_target_match
,
2799 /* Oh dear - we could not find any targets that
2800 satisfy our requirements. */
2802 einfo (_("%P: warning: could not find any targets"
2803 " that match endianness requirement\n"));
2805 output_target
= winner
->name
;
2811 output
= bfd_openw (name
, output_target
);
2815 if (bfd_get_error () == bfd_error_invalid_target
)
2816 einfo (_("%P%F: target %s not found\n"), output_target
);
2818 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2821 delete_output_file_on_failure
= TRUE
;
2823 if (! bfd_set_format (output
, bfd_object
))
2824 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2825 if (! bfd_set_arch_mach (output
,
2826 ldfile_output_architecture
,
2827 ldfile_output_machine
))
2828 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2830 link_info
.hash
= bfd_link_hash_table_create (output
);
2831 if (link_info
.hash
== NULL
)
2832 einfo (_("%P%F: can not create hash table: %E\n"));
2834 bfd_set_gp_size (output
, g_switch_value
);
2839 ldlang_open_output (lang_statement_union_type
*statement
)
2841 switch (statement
->header
.type
)
2843 case lang_output_statement_enum
:
2844 ASSERT (output_bfd
== NULL
);
2845 output_bfd
= open_output (statement
->output_statement
.name
);
2846 ldemul_set_output_arch ();
2847 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2848 output_bfd
->flags
|= D_PAGED
;
2850 output_bfd
->flags
&= ~D_PAGED
;
2851 if (config
.text_read_only
)
2852 output_bfd
->flags
|= WP_TEXT
;
2854 output_bfd
->flags
&= ~WP_TEXT
;
2855 if (link_info
.traditional_format
)
2856 output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2858 output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2861 case lang_target_statement_enum
:
2862 current_target
= statement
->target_statement
.target
;
2869 /* Convert between addresses in bytes and sizes in octets.
2870 For currently supported targets, octets_per_byte is always a power
2871 of two, so we can use shifts. */
2872 #define TO_ADDR(X) ((X) >> opb_shift)
2873 #define TO_SIZE(X) ((X) << opb_shift)
2875 /* Support the above. */
2876 static unsigned int opb_shift
= 0;
2881 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2882 ldfile_output_machine
);
2885 while ((x
& 1) == 0)
2893 /* Open all the input files. */
2896 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2898 for (; s
!= NULL
; s
= s
->header
.next
)
2900 switch (s
->header
.type
)
2902 case lang_constructors_statement_enum
:
2903 open_input_bfds (constructor_list
.head
, force
);
2905 case lang_output_section_statement_enum
:
2906 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2908 case lang_wild_statement_enum
:
2909 /* Maybe we should load the file's symbols. */
2910 if (s
->wild_statement
.filename
2911 && ! wildcardp (s
->wild_statement
.filename
))
2912 lookup_name (s
->wild_statement
.filename
);
2913 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2915 case lang_group_statement_enum
:
2917 struct bfd_link_hash_entry
*undefs
;
2919 /* We must continually search the entries in the group
2920 until no new symbols are added to the list of undefined
2925 undefs
= link_info
.hash
->undefs_tail
;
2926 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2928 while (undefs
!= link_info
.hash
->undefs_tail
);
2931 case lang_target_statement_enum
:
2932 current_target
= s
->target_statement
.target
;
2934 case lang_input_statement_enum
:
2935 if (s
->input_statement
.real
)
2937 lang_statement_list_type add
;
2939 s
->input_statement
.target
= current_target
;
2941 /* If we are being called from within a group, and this
2942 is an archive which has already been searched, then
2943 force it to be researched unless the whole archive
2944 has been loaded already. */
2946 && !s
->input_statement
.whole_archive
2947 && s
->input_statement
.loaded
2948 && bfd_check_format (s
->input_statement
.the_bfd
,
2950 s
->input_statement
.loaded
= FALSE
;
2952 lang_list_init (&add
);
2954 if (! load_symbols (&s
->input_statement
, &add
))
2955 config
.make_executable
= FALSE
;
2957 if (add
.head
!= NULL
)
2959 *add
.tail
= s
->header
.next
;
2960 s
->header
.next
= add
.head
;
2970 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2973 lang_track_definedness (const char *name
)
2975 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2976 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2979 /* New-function for the definedness hash table. */
2981 static struct bfd_hash_entry
*
2982 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2983 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2984 const char *name ATTRIBUTE_UNUSED
)
2986 struct lang_definedness_hash_entry
*ret
2987 = (struct lang_definedness_hash_entry
*) entry
;
2990 ret
= (struct lang_definedness_hash_entry
*)
2991 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
2994 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
2996 ret
->iteration
= -1;
3000 /* Return the iteration when the definition of NAME was last updated. A
3001 value of -1 means that the symbol is not defined in the linker script
3002 or the command line, but may be defined in the linker symbol table. */
3005 lang_symbol_definition_iteration (const char *name
)
3007 struct lang_definedness_hash_entry
*defentry
3008 = (struct lang_definedness_hash_entry
*)
3009 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3011 /* We've already created this one on the presence of DEFINED in the
3012 script, so it can't be NULL unless something is borked elsewhere in
3014 if (defentry
== NULL
)
3017 return defentry
->iteration
;
3020 /* Update the definedness state of NAME. */
3023 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3025 struct lang_definedness_hash_entry
*defentry
3026 = (struct lang_definedness_hash_entry
*)
3027 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3029 /* We don't keep track of symbols not tested with DEFINED. */
3030 if (defentry
== NULL
)
3033 /* If the symbol was already defined, and not from an earlier statement
3034 iteration, don't update the definedness iteration, because that'd
3035 make the symbol seem defined in the linker script at this point, and
3036 it wasn't; it was defined in some object. If we do anyway, DEFINED
3037 would start to yield false before this point and the construct "sym =
3038 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3040 if (h
->type
!= bfd_link_hash_undefined
3041 && h
->type
!= bfd_link_hash_common
3042 && h
->type
!= bfd_link_hash_new
3043 && defentry
->iteration
== -1)
3046 defentry
->iteration
= lang_statement_iteration
;
3049 /* Add the supplied name to the symbol table as an undefined reference.
3050 This is a two step process as the symbol table doesn't even exist at
3051 the time the ld command line is processed. First we put the name
3052 on a list, then, once the output file has been opened, transfer the
3053 name to the symbol table. */
3055 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3057 #define ldlang_undef_chain_list_head entry_symbol.next
3060 ldlang_add_undef (const char *const name
)
3062 ldlang_undef_chain_list_type
*new =
3063 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
3065 new->next
= ldlang_undef_chain_list_head
;
3066 ldlang_undef_chain_list_head
= new;
3068 new->name
= xstrdup (name
);
3070 if (output_bfd
!= NULL
)
3071 insert_undefined (new->name
);
3074 /* Insert NAME as undefined in the symbol table. */
3077 insert_undefined (const char *name
)
3079 struct bfd_link_hash_entry
*h
;
3081 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3083 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3084 if (h
->type
== bfd_link_hash_new
)
3086 h
->type
= bfd_link_hash_undefined
;
3087 h
->u
.undef
.abfd
= NULL
;
3088 bfd_link_add_undef (link_info
.hash
, h
);
3092 /* Run through the list of undefineds created above and place them
3093 into the linker hash table as undefined symbols belonging to the
3097 lang_place_undefineds (void)
3099 ldlang_undef_chain_list_type
*ptr
;
3101 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3102 insert_undefined (ptr
->name
);
3105 /* Check for all readonly or some readwrite sections. */
3108 check_input_sections
3109 (lang_statement_union_type
*s
,
3110 lang_output_section_statement_type
*output_section_statement
)
3112 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3114 switch (s
->header
.type
)
3116 case lang_wild_statement_enum
:
3117 walk_wild (&s
->wild_statement
, check_section_callback
,
3118 output_section_statement
);
3119 if (! output_section_statement
->all_input_readonly
)
3122 case lang_constructors_statement_enum
:
3123 check_input_sections (constructor_list
.head
,
3124 output_section_statement
);
3125 if (! output_section_statement
->all_input_readonly
)
3128 case lang_group_statement_enum
:
3129 check_input_sections (s
->group_statement
.children
.head
,
3130 output_section_statement
);
3131 if (! output_section_statement
->all_input_readonly
)
3140 /* Update wildcard statements if needed. */
3143 update_wild_statements (lang_statement_union_type
*s
)
3145 struct wildcard_list
*sec
;
3147 switch (sort_section
)
3157 for (; s
!= NULL
; s
= s
->header
.next
)
3159 switch (s
->header
.type
)
3164 case lang_wild_statement_enum
:
3165 sec
= s
->wild_statement
.section_list
;
3166 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3169 switch (sec
->spec
.sorted
)
3172 sec
->spec
.sorted
= sort_section
;
3175 if (sort_section
== by_alignment
)
3176 sec
->spec
.sorted
= by_name_alignment
;
3179 if (sort_section
== by_name
)
3180 sec
->spec
.sorted
= by_alignment_name
;
3188 case lang_constructors_statement_enum
:
3189 update_wild_statements (constructor_list
.head
);
3192 case lang_output_section_statement_enum
:
3193 update_wild_statements
3194 (s
->output_section_statement
.children
.head
);
3197 case lang_group_statement_enum
:
3198 update_wild_statements (s
->group_statement
.children
.head
);
3206 /* Open input files and attach to output sections. */
3209 map_input_to_output_sections
3210 (lang_statement_union_type
*s
, const char *target
,
3211 lang_output_section_statement_type
*os
)
3215 for (; s
!= NULL
; s
= s
->header
.next
)
3217 switch (s
->header
.type
)
3219 case lang_wild_statement_enum
:
3220 wild (&s
->wild_statement
, target
, os
);
3222 case lang_constructors_statement_enum
:
3223 map_input_to_output_sections (constructor_list
.head
,
3227 case lang_output_section_statement_enum
:
3228 if (s
->output_section_statement
.constraint
)
3230 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3231 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3233 s
->output_section_statement
.all_input_readonly
= TRUE
;
3234 check_input_sections (s
->output_section_statement
.children
.head
,
3235 &s
->output_section_statement
);
3236 if ((s
->output_section_statement
.all_input_readonly
3237 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3238 || (!s
->output_section_statement
.all_input_readonly
3239 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3241 s
->output_section_statement
.constraint
= -1;
3246 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3248 &s
->output_section_statement
);
3250 case lang_output_statement_enum
:
3252 case lang_target_statement_enum
:
3253 target
= s
->target_statement
.target
;
3255 case lang_group_statement_enum
:
3256 map_input_to_output_sections (s
->group_statement
.children
.head
,
3260 case lang_data_statement_enum
:
3261 /* Make sure that any sections mentioned in the expression
3263 exp_init_os (s
->data_statement
.exp
);
3264 flags
= SEC_HAS_CONTENTS
;
3265 /* The output section gets contents, and then we inspect for
3266 any flags set in the input script which override any ALLOC. */
3267 if (!(os
->flags
& SEC_NEVER_LOAD
))
3268 flags
|= SEC_ALLOC
| SEC_LOAD
;
3269 if (os
->bfd_section
== NULL
)
3270 init_os (os
, NULL
, flags
);
3272 os
->bfd_section
->flags
|= flags
;
3274 case lang_input_section_enum
:
3276 case lang_fill_statement_enum
:
3277 case lang_object_symbols_statement_enum
:
3278 case lang_reloc_statement_enum
:
3279 case lang_padding_statement_enum
:
3280 case lang_input_statement_enum
:
3281 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3282 init_os (os
, NULL
, 0);
3284 case lang_assignment_statement_enum
:
3285 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3286 init_os (os
, NULL
, 0);
3288 /* Make sure that any sections mentioned in the assignment
3290 exp_init_os (s
->assignment_statement
.exp
);
3292 case lang_afile_asection_pair_statement_enum
:
3295 case lang_address_statement_enum
:
3296 /* Mark the specified section with the supplied address.
3298 If this section was actually a segment marker, then the
3299 directive is ignored if the linker script explicitly
3300 processed the segment marker. Originally, the linker
3301 treated segment directives (like -Ttext on the
3302 command-line) as section directives. We honor the
3303 section directive semantics for backwards compatibilty;
3304 linker scripts that do not specifically check for
3305 SEGMENT_START automatically get the old semantics. */
3306 if (!s
->address_statement
.segment
3307 || !s
->address_statement
.segment
->used
)
3309 lang_output_section_statement_type
*aos
3310 = (lang_output_section_statement_lookup
3311 (s
->address_statement
.section_name
));
3313 if (aos
->bfd_section
== NULL
)
3314 init_os (aos
, NULL
, 0);
3315 aos
->addr_tree
= s
->address_statement
.address
;
3322 /* An output section might have been removed after its statement was
3323 added. For example, ldemul_before_allocation can remove dynamic
3324 sections if they turn out to be not needed. Clean them up here. */
3327 strip_excluded_output_sections (void)
3329 lang_output_section_statement_type
*os
;
3331 /* Run lang_size_sections (if not already done). */
3332 if (expld
.phase
!= lang_mark_phase_enum
)
3334 expld
.phase
= lang_mark_phase_enum
;
3335 expld
.dataseg
.phase
= exp_dataseg_none
;
3336 one_lang_size_sections_pass (NULL
, FALSE
);
3337 lang_reset_memory_regions ();
3340 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3344 asection
*output_section
;
3345 bfd_boolean exclude
;
3347 if (os
->constraint
== -1)
3350 output_section
= os
->bfd_section
;
3351 if (output_section
== NULL
)
3354 exclude
= (output_section
->rawsize
== 0
3355 && (output_section
->flags
& SEC_KEEP
) == 0
3356 && !bfd_section_removed_from_list (output_bfd
,
3359 /* Some sections have not yet been sized, notably .gnu.version,
3360 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3361 input sections, so don't drop output sections that have such
3362 input sections unless they are also marked SEC_EXCLUDE. */
3363 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3367 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3368 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3369 && (s
->flags
& SEC_EXCLUDE
) == 0)
3376 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3377 output_section
->map_head
.link_order
= NULL
;
3378 output_section
->map_tail
.link_order
= NULL
;
3382 /* We don't set bfd_section to NULL since bfd_section of the
3383 removed output section statement may still be used. */
3384 if (!os
->section_relative_symbol
3385 && !os
->update_dot_tree
)
3387 output_section
->flags
|= SEC_EXCLUDE
;
3388 bfd_section_list_remove (output_bfd
, output_section
);
3389 output_bfd
->section_count
--;
3393 /* Stop future calls to lang_add_section from messing with map_head
3394 and map_tail link_order fields. */
3395 stripped_excluded_sections
= TRUE
;
3399 print_output_section_statement
3400 (lang_output_section_statement_type
*output_section_statement
)
3402 asection
*section
= output_section_statement
->bfd_section
;
3405 if (output_section_statement
!= abs_output_section
)
3407 minfo ("\n%s", output_section_statement
->name
);
3409 if (section
!= NULL
)
3411 print_dot
= section
->vma
;
3413 len
= strlen (output_section_statement
->name
);
3414 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3419 while (len
< SECTION_NAME_MAP_LENGTH
)
3425 minfo ("0x%V %W", section
->vma
, section
->size
);
3427 if (section
->vma
!= section
->lma
)
3428 minfo (_(" load address 0x%V"), section
->lma
);
3434 print_statement_list (output_section_statement
->children
.head
,
3435 output_section_statement
);
3438 /* Scan for the use of the destination in the right hand side
3439 of an expression. In such cases we will not compute the
3440 correct expression, since the value of DST that is used on
3441 the right hand side will be its final value, not its value
3442 just before this expression is evaluated. */
3445 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3447 if (rhs
== NULL
|| dst
== NULL
)
3450 switch (rhs
->type
.node_class
)
3453 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3454 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3457 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3458 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3461 case etree_provided
:
3463 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3465 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3468 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3472 return strcmp (dst
, rhs
->value
.str
) == 0;
3477 return strcmp (dst
, rhs
->name
.name
) == 0;
3489 print_assignment (lang_assignment_statement_type
*assignment
,
3490 lang_output_section_statement_type
*output_section
)
3494 bfd_boolean computation_is_valid
= TRUE
;
3497 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3500 if (assignment
->exp
->type
.node_class
== etree_assert
)
3503 tree
= assignment
->exp
->assert_s
.child
;
3504 computation_is_valid
= TRUE
;
3508 const char *dst
= assignment
->exp
->assign
.dst
;
3510 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3511 tree
= assignment
->exp
->assign
.src
;
3512 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3515 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3516 if (expld
.result
.valid_p
)
3520 if (computation_is_valid
)
3522 value
= expld
.result
.value
;
3524 if (expld
.result
.section
)
3525 value
+= expld
.result
.section
->vma
;
3527 minfo ("0x%V", value
);
3533 struct bfd_link_hash_entry
*h
;
3535 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3536 FALSE
, FALSE
, TRUE
);
3539 value
= h
->u
.def
.value
;
3541 if (expld
.result
.section
)
3542 value
+= expld
.result
.section
->vma
;
3544 minfo ("[0x%V]", value
);
3547 minfo ("[unresolved]");
3559 exp_print_tree (assignment
->exp
);
3564 print_input_statement (lang_input_statement_type
*statm
)
3566 if (statm
->filename
!= NULL
)
3568 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3572 /* Print all symbols defined in a particular section. This is called
3573 via bfd_link_hash_traverse, or by print_all_symbols. */
3576 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3578 asection
*sec
= ptr
;
3580 if ((hash_entry
->type
== bfd_link_hash_defined
3581 || hash_entry
->type
== bfd_link_hash_defweak
)
3582 && sec
== hash_entry
->u
.def
.section
)
3586 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3589 (hash_entry
->u
.def
.value
3590 + hash_entry
->u
.def
.section
->output_offset
3591 + hash_entry
->u
.def
.section
->output_section
->vma
));
3593 minfo (" %T\n", hash_entry
->root
.string
);
3600 print_all_symbols (asection
*sec
)
3602 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3603 struct map_symbol_def
*def
;
3608 *ud
->map_symbol_def_tail
= 0;
3609 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3610 print_one_symbol (def
->entry
, sec
);
3613 /* Print information about an input section to the map file. */
3616 print_input_section (asection
*i
)
3618 bfd_size_type size
= i
->size
;
3625 minfo ("%s", i
->name
);
3627 len
= 1 + strlen (i
->name
);
3628 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3633 while (len
< SECTION_NAME_MAP_LENGTH
)
3639 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3640 addr
= i
->output_section
->vma
+ i
->output_offset
;
3647 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3649 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3651 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3663 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3666 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3668 if (link_info
.reduce_memory_overheads
)
3669 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3671 print_all_symbols (i
);
3673 print_dot
= addr
+ TO_ADDR (size
);
3678 print_fill_statement (lang_fill_statement_type
*fill
)
3682 fputs (" FILL mask 0x", config
.map_file
);
3683 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3684 fprintf (config
.map_file
, "%02x", *p
);
3685 fputs ("\n", config
.map_file
);
3689 print_data_statement (lang_data_statement_type
*data
)
3697 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3700 addr
= data
->output_offset
;
3701 if (data
->output_section
!= NULL
)
3702 addr
+= data
->output_section
->vma
;
3730 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3732 if (data
->exp
->type
.node_class
!= etree_value
)
3735 exp_print_tree (data
->exp
);
3740 print_dot
= addr
+ TO_ADDR (size
);
3743 /* Print an address statement. These are generated by options like
3747 print_address_statement (lang_address_statement_type
*address
)
3749 minfo (_("Address of section %s set to "), address
->section_name
);
3750 exp_print_tree (address
->address
);
3754 /* Print a reloc statement. */
3757 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3764 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3767 addr
= reloc
->output_offset
;
3768 if (reloc
->output_section
!= NULL
)
3769 addr
+= reloc
->output_section
->vma
;
3771 size
= bfd_get_reloc_size (reloc
->howto
);
3773 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3775 if (reloc
->name
!= NULL
)
3776 minfo ("%s+", reloc
->name
);
3778 minfo ("%s+", reloc
->section
->name
);
3780 exp_print_tree (reloc
->addend_exp
);
3784 print_dot
= addr
+ TO_ADDR (size
);
3788 print_padding_statement (lang_padding_statement_type
*s
)
3796 len
= sizeof " *fill*" - 1;
3797 while (len
< SECTION_NAME_MAP_LENGTH
)
3803 addr
= s
->output_offset
;
3804 if (s
->output_section
!= NULL
)
3805 addr
+= s
->output_section
->vma
;
3806 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3808 if (s
->fill
->size
!= 0)
3812 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3813 fprintf (config
.map_file
, "%02x", *p
);
3818 print_dot
= addr
+ TO_ADDR (s
->size
);
3822 print_wild_statement (lang_wild_statement_type
*w
,
3823 lang_output_section_statement_type
*os
)
3825 struct wildcard_list
*sec
;
3829 if (w
->filenames_sorted
)
3831 if (w
->filename
!= NULL
)
3832 minfo ("%s", w
->filename
);
3835 if (w
->filenames_sorted
)
3839 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
3841 if (sec
->spec
.sorted
)
3843 if (sec
->spec
.exclude_name_list
!= NULL
)
3846 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
3847 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
3848 minfo (" %s", tmp
->name
);
3851 if (sec
->spec
.name
!= NULL
)
3852 minfo ("%s", sec
->spec
.name
);
3855 if (sec
->spec
.sorted
)
3864 print_statement_list (w
->children
.head
, os
);
3867 /* Print a group statement. */
3870 print_group (lang_group_statement_type
*s
,
3871 lang_output_section_statement_type
*os
)
3873 fprintf (config
.map_file
, "START GROUP\n");
3874 print_statement_list (s
->children
.head
, os
);
3875 fprintf (config
.map_file
, "END GROUP\n");
3878 /* Print the list of statements in S.
3879 This can be called for any statement type. */
3882 print_statement_list (lang_statement_union_type
*s
,
3883 lang_output_section_statement_type
*os
)
3887 print_statement (s
, os
);
3892 /* Print the first statement in statement list S.
3893 This can be called for any statement type. */
3896 print_statement (lang_statement_union_type
*s
,
3897 lang_output_section_statement_type
*os
)
3899 switch (s
->header
.type
)
3902 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
3905 case lang_constructors_statement_enum
:
3906 if (constructor_list
.head
!= NULL
)
3908 if (constructors_sorted
)
3909 minfo (" SORT (CONSTRUCTORS)\n");
3911 minfo (" CONSTRUCTORS\n");
3912 print_statement_list (constructor_list
.head
, os
);
3915 case lang_wild_statement_enum
:
3916 print_wild_statement (&s
->wild_statement
, os
);
3918 case lang_address_statement_enum
:
3919 print_address_statement (&s
->address_statement
);
3921 case lang_object_symbols_statement_enum
:
3922 minfo (" CREATE_OBJECT_SYMBOLS\n");
3924 case lang_fill_statement_enum
:
3925 print_fill_statement (&s
->fill_statement
);
3927 case lang_data_statement_enum
:
3928 print_data_statement (&s
->data_statement
);
3930 case lang_reloc_statement_enum
:
3931 print_reloc_statement (&s
->reloc_statement
);
3933 case lang_input_section_enum
:
3934 print_input_section (s
->input_section
.section
);
3936 case lang_padding_statement_enum
:
3937 print_padding_statement (&s
->padding_statement
);
3939 case lang_output_section_statement_enum
:
3940 print_output_section_statement (&s
->output_section_statement
);
3942 case lang_assignment_statement_enum
:
3943 print_assignment (&s
->assignment_statement
, os
);
3945 case lang_target_statement_enum
:
3946 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
3948 case lang_output_statement_enum
:
3949 minfo ("OUTPUT(%s", s
->output_statement
.name
);
3950 if (output_target
!= NULL
)
3951 minfo (" %s", output_target
);
3954 case lang_input_statement_enum
:
3955 print_input_statement (&s
->input_statement
);
3957 case lang_group_statement_enum
:
3958 print_group (&s
->group_statement
, os
);
3960 case lang_afile_asection_pair_statement_enum
:
3967 print_statements (void)
3969 print_statement_list (statement_list
.head
, abs_output_section
);
3972 /* Print the first N statements in statement list S to STDERR.
3973 If N == 0, nothing is printed.
3974 If N < 0, the entire list is printed.
3975 Intended to be called from GDB. */
3978 dprint_statement (lang_statement_union_type
*s
, int n
)
3980 FILE *map_save
= config
.map_file
;
3982 config
.map_file
= stderr
;
3985 print_statement_list (s
, abs_output_section
);
3988 while (s
&& --n
>= 0)
3990 print_statement (s
, abs_output_section
);
3995 config
.map_file
= map_save
;
3999 insert_pad (lang_statement_union_type
**ptr
,
4001 unsigned int alignment_needed
,
4002 asection
*output_section
,
4005 /* Hack: pad with the x86's NOP instruction by default */
4006 static fill_type nop_fill
= { 1, { 0x90 } };
4007 lang_statement_union_type
*pad
= NULL
;
4009 if (ptr
!= &statement_list
.head
)
4010 pad
= ((lang_statement_union_type
*)
4011 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4013 && pad
->header
.type
== lang_padding_statement_enum
4014 && pad
->padding_statement
.output_section
== output_section
)
4016 /* Use the existing pad statement. */
4018 else if ((pad
= *ptr
) != NULL
4019 && pad
->header
.type
== lang_padding_statement_enum
4020 && pad
->padding_statement
.output_section
== output_section
)
4022 /* Use the existing pad statement. */
4026 /* Make a new padding statement, linked into existing chain. */
4027 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
4028 pad
->header
.next
= *ptr
;
4030 pad
->header
.type
= lang_padding_statement_enum
;
4031 pad
->padding_statement
.output_section
= output_section
;
4034 pad
->padding_statement
.fill
= fill
;
4036 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4037 pad
->padding_statement
.size
= alignment_needed
;
4038 output_section
->size
+= alignment_needed
;
4041 /* Work out how much this section will move the dot point. */
4045 (lang_statement_union_type
**this_ptr
,
4046 lang_output_section_statement_type
*output_section_statement
,
4050 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4051 asection
*i
= is
->section
;
4053 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4054 && (i
->flags
& SEC_EXCLUDE
) == 0)
4056 unsigned int alignment_needed
;
4059 /* Align this section first to the input sections requirement,
4060 then to the output section's requirement. If this alignment
4061 is greater than any seen before, then record it too. Perform
4062 the alignment by inserting a magic 'padding' statement. */
4064 if (output_section_statement
->subsection_alignment
!= -1)
4065 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4067 o
= output_section_statement
->bfd_section
;
4068 if (o
->alignment_power
< i
->alignment_power
)
4069 o
->alignment_power
= i
->alignment_power
;
4071 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4073 if (alignment_needed
!= 0)
4075 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4076 dot
+= alignment_needed
;
4079 /* Remember where in the output section this input section goes. */
4081 i
->output_offset
= dot
- o
->vma
;
4083 /* Mark how big the output section must be to contain this now. */
4084 dot
+= TO_ADDR (i
->size
);
4085 o
->size
= TO_SIZE (dot
- o
->vma
);
4089 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4096 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4098 const asection
*sec1
= *(const asection
**) arg1
;
4099 const asection
*sec2
= *(const asection
**) arg2
;
4101 if (bfd_section_lma (sec1
->owner
, sec1
)
4102 < bfd_section_lma (sec2
->owner
, sec2
))
4104 else if (bfd_section_lma (sec1
->owner
, sec1
)
4105 > bfd_section_lma (sec2
->owner
, sec2
))
4111 #define IGNORE_SECTION(s) \
4112 ((s->flags & SEC_NEVER_LOAD) != 0 \
4113 || (s->flags & SEC_ALLOC) == 0 \
4114 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4115 && (s->flags & SEC_LOAD) == 0))
4117 /* Check to see if any allocated sections overlap with other allocated
4118 sections. This can happen if a linker script specifies the output
4119 section addresses of the two sections. */
4122 lang_check_section_addresses (void)
4125 asection
**sections
, **spp
;
4133 if (bfd_count_sections (output_bfd
) <= 1)
4136 amt
= bfd_count_sections (output_bfd
) * sizeof (asection
*);
4137 sections
= xmalloc (amt
);
4139 /* Scan all sections in the output list. */
4141 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4143 /* Only consider loadable sections with real contents. */
4144 if (IGNORE_SECTION (s
) || s
->size
== 0)
4147 sections
[count
] = s
;
4154 qsort (sections
, (size_t) count
, sizeof (asection
*),
4155 sort_sections_by_lma
);
4159 s_start
= bfd_section_lma (output_bfd
, s
);
4160 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4161 for (count
--; count
; count
--)
4163 /* We must check the sections' LMA addresses not their VMA
4164 addresses because overlay sections can have overlapping VMAs
4165 but they must have distinct LMAs. */
4170 s_start
= bfd_section_lma (output_bfd
, s
);
4171 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4173 /* Look for an overlap. */
4174 if (s_end
>= os_start
&& s_start
<= os_end
)
4175 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4176 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4182 /* Make sure the new address is within the region. We explicitly permit the
4183 current address to be at the exact end of the region when the address is
4184 non-zero, in case the region is at the end of addressable memory and the
4185 calculation wraps around. */
4188 os_region_check (lang_output_section_statement_type
*os
,
4189 lang_memory_region_type
*region
,
4193 if ((region
->current
< region
->origin
4194 || (region
->current
- region
->origin
> region
->length
))
4195 && ((region
->current
!= region
->origin
+ region
->length
)
4200 einfo (_("%X%P: address 0x%v of %B section %s"
4201 " is not within region %s\n"),
4203 os
->bfd_section
->owner
,
4204 os
->bfd_section
->name
,
4209 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4211 os
->bfd_section
->owner
,
4212 os
->bfd_section
->name
);
4214 /* Reset the region pointer. */
4215 region
->current
= region
->origin
;
4219 /* Set the sizes for all the output sections. */
4222 lang_size_sections_1
4223 (lang_statement_union_type
*s
,
4224 lang_output_section_statement_type
*output_section_statement
,
4225 lang_statement_union_type
**prev
,
4229 bfd_boolean check_regions
)
4231 /* Size up the sections from their constituent parts. */
4232 for (; s
!= NULL
; s
= s
->header
.next
)
4234 switch (s
->header
.type
)
4236 case lang_output_section_statement_enum
:
4238 bfd_vma newdot
, after
;
4239 lang_output_section_statement_type
*os
;
4240 lang_memory_region_type
*r
;
4242 os
= &s
->output_section_statement
;
4243 if (os
->addr_tree
!= NULL
)
4245 os
->processed_vma
= FALSE
;
4246 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4248 if (expld
.result
.valid_p
)
4249 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4250 else if (expld
.phase
!= lang_mark_phase_enum
)
4251 einfo (_("%F%S: non constant or forward reference"
4252 " address expression for section %s\n"),
4256 if (os
->bfd_section
== NULL
)
4257 /* This section was removed or never actually created. */
4260 /* If this is a COFF shared library section, use the size and
4261 address from the input section. FIXME: This is COFF
4262 specific; it would be cleaner if there were some other way
4263 to do this, but nothing simple comes to mind. */
4264 if ((bfd_get_flavour (output_bfd
) == bfd_target_ecoff_flavour
4265 || bfd_get_flavour (output_bfd
) == bfd_target_coff_flavour
)
4266 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4270 if (os
->children
.head
== NULL
4271 || os
->children
.head
->header
.next
!= NULL
4272 || (os
->children
.head
->header
.type
4273 != lang_input_section_enum
))
4274 einfo (_("%P%X: Internal error on COFF shared library"
4275 " section %s\n"), os
->name
);
4277 input
= os
->children
.head
->input_section
.section
;
4278 bfd_set_section_vma (os
->bfd_section
->owner
,
4280 bfd_section_vma (input
->owner
, input
));
4281 os
->bfd_section
->size
= input
->size
;
4286 if (bfd_is_abs_section (os
->bfd_section
))
4288 /* No matter what happens, an abs section starts at zero. */
4289 ASSERT (os
->bfd_section
->vma
== 0);
4295 if (os
->addr_tree
== NULL
)
4297 /* No address specified for this section, get one
4298 from the region specification. */
4299 if (os
->region
== NULL
4300 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4301 && os
->region
->name
[0] == '*'
4302 && strcmp (os
->region
->name
,
4303 DEFAULT_MEMORY_REGION
) == 0))
4305 os
->region
= lang_memory_default (os
->bfd_section
);
4308 /* If a loadable section is using the default memory
4309 region, and some non default memory regions were
4310 defined, issue an error message. */
4312 && !IGNORE_SECTION (os
->bfd_section
)
4313 && ! link_info
.relocatable
4315 && strcmp (os
->region
->name
,
4316 DEFAULT_MEMORY_REGION
) == 0
4317 && lang_memory_region_list
!= NULL
4318 && (strcmp (lang_memory_region_list
->name
,
4319 DEFAULT_MEMORY_REGION
) != 0
4320 || lang_memory_region_list
->next
!= NULL
)
4321 && expld
.phase
!= lang_mark_phase_enum
)
4323 /* By default this is an error rather than just a
4324 warning because if we allocate the section to the
4325 default memory region we can end up creating an
4326 excessively large binary, or even seg faulting when
4327 attempting to perform a negative seek. See
4328 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4329 for an example of this. This behaviour can be
4330 overridden by the using the --no-check-sections
4332 if (command_line
.check_section_addresses
)
4333 einfo (_("%P%F: error: no memory region specified"
4334 " for loadable section `%s'\n"),
4335 bfd_get_section_name (output_bfd
,
4338 einfo (_("%P: warning: no memory region specified"
4339 " for loadable section `%s'\n"),
4340 bfd_get_section_name (output_bfd
,
4344 newdot
= os
->region
->current
;
4345 align
= os
->bfd_section
->alignment_power
;
4348 align
= os
->section_alignment
;
4350 /* Align to what the section needs. */
4353 bfd_vma savedot
= newdot
;
4354 newdot
= align_power (newdot
, align
);
4356 if (newdot
!= savedot
4357 && (config
.warn_section_align
4358 || os
->addr_tree
!= NULL
)
4359 && expld
.phase
!= lang_mark_phase_enum
)
4360 einfo (_("%P: warning: changing start of section"
4361 " %s by %lu bytes\n"),
4362 os
->name
, (unsigned long) (newdot
- savedot
));
4365 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4367 os
->bfd_section
->output_offset
= 0;
4370 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4371 os
->fill
, newdot
, relax
, check_regions
);
4373 os
->processed_vma
= TRUE
;
4375 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4376 /* Except for some special linker created sections,
4377 no output section should change from zero size
4378 after strip_excluded_output_sections. A non-zero
4379 size on an ignored section indicates that some
4380 input section was not sized early enough. */
4381 ASSERT (os
->bfd_section
->size
== 0);
4384 dot
= os
->bfd_section
->vma
;
4386 /* Put the section within the requested block size, or
4387 align at the block boundary. */
4389 + TO_ADDR (os
->bfd_section
->size
)
4390 + os
->block_value
- 1)
4391 & - (bfd_vma
) os
->block_value
);
4393 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4396 /* Set section lma. */
4399 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4403 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4404 os
->bfd_section
->lma
= lma
;
4406 else if (os
->region
!= NULL
4407 && os
->lma_region
!= NULL
4408 && os
->lma_region
!= os
->region
)
4410 bfd_vma lma
= os
->lma_region
->current
;
4412 if (os
->section_alignment
!= -1)
4413 lma
= align_power (lma
, os
->section_alignment
);
4414 os
->bfd_section
->lma
= lma
;
4416 else if (r
->last_os
!= NULL
4417 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4422 last
= r
->last_os
->output_section_statement
.bfd_section
;
4424 /* A backwards move of dot should be accompanied by
4425 an explicit assignment to the section LMA (ie.
4426 os->load_base set) because backwards moves can
4427 create overlapping LMAs. */
4429 && os
->bfd_section
->size
!= 0
4430 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4432 /* If dot moved backwards then leave lma equal to
4433 vma. This is the old default lma, which might
4434 just happen to work when the backwards move is
4435 sufficiently large. Nag if this changes anything,
4436 so people can fix their linker scripts. */
4438 if (last
->vma
!= last
->lma
)
4439 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4444 /* If this is an overlay, set the current lma to that
4445 at the end of the previous section. */
4446 if (os
->sectype
== overlay_section
)
4447 lma
= last
->lma
+ last
->size
;
4449 /* Otherwise, keep the same lma to vma relationship
4450 as the previous section. */
4452 lma
= dot
+ last
->lma
- last
->vma
;
4454 if (os
->section_alignment
!= -1)
4455 lma
= align_power (lma
, os
->section_alignment
);
4456 os
->bfd_section
->lma
= lma
;
4459 os
->processed_lma
= TRUE
;
4461 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4464 /* Keep track of normal sections using the default
4465 lma region. We use this to set the lma for
4466 following sections. Overlays or other linker
4467 script assignment to lma might mean that the
4468 default lma == vma is incorrect.
4469 To avoid warnings about dot moving backwards when using
4470 -Ttext, don't start tracking sections until we find one
4471 of non-zero size or with lma set differently to vma. */
4472 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4473 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
4474 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
4475 && (os
->bfd_section
->size
!= 0
4476 || (r
->last_os
== NULL
4477 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
4478 || (r
->last_os
!= NULL
4479 && dot
>= (r
->last_os
->output_section_statement
4480 .bfd_section
->vma
)))
4481 && os
->lma_region
== NULL
4482 && !link_info
.relocatable
)
4485 /* .tbss sections effectively have zero size. */
4486 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4487 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4488 || link_info
.relocatable
)
4489 dot
+= TO_ADDR (os
->bfd_section
->size
);
4491 if (os
->update_dot_tree
!= 0)
4492 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4494 /* Update dot in the region ?
4495 We only do this if the section is going to be allocated,
4496 since unallocated sections do not contribute to the region's
4497 overall size in memory.
4499 If the SEC_NEVER_LOAD bit is not set, it will affect the
4500 addresses of sections after it. We have to update
4502 if (os
->region
!= NULL
4503 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4504 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4506 os
->region
->current
= dot
;
4509 /* Make sure the new address is within the region. */
4510 os_region_check (os
, os
->region
, os
->addr_tree
,
4511 os
->bfd_section
->vma
);
4513 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
)
4515 os
->lma_region
->current
4516 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
4519 os_region_check (os
, os
->lma_region
, NULL
,
4520 os
->bfd_section
->lma
);
4526 case lang_constructors_statement_enum
:
4527 dot
= lang_size_sections_1 (constructor_list
.head
,
4528 output_section_statement
,
4529 &s
->wild_statement
.children
.head
,
4530 fill
, dot
, relax
, check_regions
);
4533 case lang_data_statement_enum
:
4535 unsigned int size
= 0;
4537 s
->data_statement
.output_offset
=
4538 dot
- output_section_statement
->bfd_section
->vma
;
4539 s
->data_statement
.output_section
=
4540 output_section_statement
->bfd_section
;
4542 /* We might refer to provided symbols in the expression, and
4543 need to mark them as needed. */
4544 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4546 switch (s
->data_statement
.type
)
4564 if (size
< TO_SIZE ((unsigned) 1))
4565 size
= TO_SIZE ((unsigned) 1);
4566 dot
+= TO_ADDR (size
);
4567 output_section_statement
->bfd_section
->size
+= size
;
4571 case lang_reloc_statement_enum
:
4575 s
->reloc_statement
.output_offset
=
4576 dot
- output_section_statement
->bfd_section
->vma
;
4577 s
->reloc_statement
.output_section
=
4578 output_section_statement
->bfd_section
;
4579 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4580 dot
+= TO_ADDR (size
);
4581 output_section_statement
->bfd_section
->size
+= size
;
4585 case lang_wild_statement_enum
:
4586 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4587 output_section_statement
,
4588 &s
->wild_statement
.children
.head
,
4589 fill
, dot
, relax
, check_regions
);
4592 case lang_object_symbols_statement_enum
:
4593 link_info
.create_object_symbols_section
=
4594 output_section_statement
->bfd_section
;
4597 case lang_output_statement_enum
:
4598 case lang_target_statement_enum
:
4601 case lang_input_section_enum
:
4605 i
= (*prev
)->input_section
.section
;
4610 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4611 einfo (_("%P%F: can't relax section: %E\n"));
4615 dot
= size_input_section (prev
, output_section_statement
,
4616 output_section_statement
->fill
, dot
);
4620 case lang_input_statement_enum
:
4623 case lang_fill_statement_enum
:
4624 s
->fill_statement
.output_section
=
4625 output_section_statement
->bfd_section
;
4627 fill
= s
->fill_statement
.fill
;
4630 case lang_assignment_statement_enum
:
4632 bfd_vma newdot
= dot
;
4633 etree_type
*tree
= s
->assignment_statement
.exp
;
4635 exp_fold_tree (tree
,
4636 output_section_statement
->bfd_section
,
4639 /* This symbol is relative to this section. */
4640 if ((tree
->type
.node_class
== etree_provided
4641 || tree
->type
.node_class
== etree_assign
)
4642 && (tree
->assign
.dst
[0] != '.'
4643 || tree
->assign
.dst
[1] != '\0'))
4644 output_section_statement
->section_relative_symbol
= 1;
4646 if (!output_section_statement
->ignored
)
4648 if (output_section_statement
== abs_output_section
)
4650 /* If we don't have an output section, then just adjust
4651 the default memory address. */
4652 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4653 FALSE
)->current
= newdot
;
4655 else if (newdot
!= dot
)
4657 /* Insert a pad after this statement. We can't
4658 put the pad before when relaxing, in case the
4659 assignment references dot. */
4660 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4661 output_section_statement
->bfd_section
, dot
);
4663 /* Don't neuter the pad below when relaxing. */
4666 /* If dot is advanced, this implies that the section
4667 should have space allocated to it, unless the
4668 user has explicitly stated that the section
4669 should never be loaded. */
4670 if (!(output_section_statement
->flags
4671 & (SEC_NEVER_LOAD
| SEC_ALLOC
)))
4672 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4679 case lang_padding_statement_enum
:
4680 /* If this is the first time lang_size_sections is called,
4681 we won't have any padding statements. If this is the
4682 second or later passes when relaxing, we should allow
4683 padding to shrink. If padding is needed on this pass, it
4684 will be added back in. */
4685 s
->padding_statement
.size
= 0;
4687 /* Make sure output_offset is valid. If relaxation shrinks
4688 the section and this pad isn't needed, it's possible to
4689 have output_offset larger than the final size of the
4690 section. bfd_set_section_contents will complain even for
4691 a pad size of zero. */
4692 s
->padding_statement
.output_offset
4693 = dot
- output_section_statement
->bfd_section
->vma
;
4696 case lang_group_statement_enum
:
4697 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4698 output_section_statement
,
4699 &s
->group_statement
.children
.head
,
4700 fill
, dot
, relax
, check_regions
);
4707 /* We can only get here when relaxing is turned on. */
4708 case lang_address_statement_enum
:
4711 prev
= &s
->header
.next
;
4716 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
4717 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
4718 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
4719 segments. We are allowed an opportunity to override this decision. */
4722 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
4723 bfd
* abfd ATTRIBUTE_UNUSED
,
4724 asection
* current_section
,
4725 asection
* previous_section
,
4726 bfd_boolean new_segment
)
4728 lang_output_section_statement_type
* cur
;
4729 lang_output_section_statement_type
* prev
;
4731 /* The checks below are only necessary when the BFD library has decided
4732 that the two sections ought to be placed into the same segment. */
4736 /* Paranoia checks. */
4737 if (current_section
== NULL
|| previous_section
== NULL
)
4740 /* Find the memory regions associated with the two sections.
4741 We call lang_output_section_find() here rather than scanning the list
4742 of output sections looking for a matching section pointer because if
4743 we have a large number of sections then a hash lookup is faster. */
4744 cur
= lang_output_section_find (current_section
->name
);
4745 prev
= lang_output_section_find (previous_section
->name
);
4747 /* More paranoia. */
4748 if (cur
== NULL
|| prev
== NULL
)
4751 /* If the regions are different then force the sections to live in
4752 different segments. See the email thread starting at the following
4753 URL for the reasons why this is necessary:
4754 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
4755 return cur
->region
!= prev
->region
;
4759 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
4761 lang_statement_iteration
++;
4762 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
4763 &statement_list
.head
, 0, 0, relax
, check_regions
);
4767 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
4769 expld
.phase
= lang_allocating_phase_enum
;
4770 expld
.dataseg
.phase
= exp_dataseg_none
;
4772 one_lang_size_sections_pass (relax
, check_regions
);
4773 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
4774 && link_info
.relro
&& expld
.dataseg
.relro_end
)
4776 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4777 to put expld.dataseg.relro on a (common) page boundary. */
4778 bfd_vma old_min_base
, relro_end
, maxpage
;
4780 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
4781 old_min_base
= expld
.dataseg
.min_base
;
4782 maxpage
= expld
.dataseg
.maxpagesize
;
4783 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
4784 & (expld
.dataseg
.pagesize
- 1));
4785 /* Compute the expected PT_GNU_RELRO segment end. */
4786 relro_end
= (expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
4787 & ~(expld
.dataseg
.pagesize
- 1);
4788 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
4790 expld
.dataseg
.base
-= maxpage
;
4791 relro_end
-= maxpage
;
4793 lang_reset_memory_regions ();
4794 one_lang_size_sections_pass (relax
, check_regions
);
4795 if (expld
.dataseg
.relro_end
> relro_end
)
4797 /* The alignment of sections between DATA_SEGMENT_ALIGN
4798 and DATA_SEGMENT_RELRO_END caused huge padding to be
4799 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4801 unsigned int max_alignment_power
= 0;
4803 /* Find maximum alignment power of sections between
4804 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4805 for (sec
= output_bfd
->sections
; sec
; sec
= sec
->next
)
4806 if (sec
->vma
>= expld
.dataseg
.base
4807 && sec
->vma
< expld
.dataseg
.relro_end
4808 && sec
->alignment_power
> max_alignment_power
)
4809 max_alignment_power
= sec
->alignment_power
;
4811 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
4813 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
4815 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
4816 expld
.dataseg
.base
-= (1 << max_alignment_power
);
4817 lang_reset_memory_regions ();
4818 one_lang_size_sections_pass (relax
, check_regions
);
4821 link_info
.relro_start
= expld
.dataseg
.base
;
4822 link_info
.relro_end
= expld
.dataseg
.relro_end
;
4824 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
4826 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4827 a page could be saved in the data segment. */
4828 bfd_vma first
, last
;
4830 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
4831 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
4833 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
4834 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
4835 && first
+ last
<= expld
.dataseg
.pagesize
)
4837 expld
.dataseg
.phase
= exp_dataseg_adjust
;
4838 lang_reset_memory_regions ();
4839 one_lang_size_sections_pass (relax
, check_regions
);
4843 expld
.phase
= lang_final_phase_enum
;
4846 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4849 lang_do_assignments_1 (lang_statement_union_type
*s
,
4850 lang_output_section_statement_type
*current_os
,
4854 for (; s
!= NULL
; s
= s
->header
.next
)
4856 switch (s
->header
.type
)
4858 case lang_constructors_statement_enum
:
4859 dot
= lang_do_assignments_1 (constructor_list
.head
,
4860 current_os
, fill
, dot
);
4863 case lang_output_section_statement_enum
:
4865 lang_output_section_statement_type
*os
;
4867 os
= &(s
->output_section_statement
);
4868 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
4870 dot
= os
->bfd_section
->vma
;
4872 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
4874 /* .tbss sections effectively have zero size. */
4875 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4876 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4877 || link_info
.relocatable
)
4878 dot
+= TO_ADDR (os
->bfd_section
->size
);
4883 case lang_wild_statement_enum
:
4885 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
4886 current_os
, fill
, dot
);
4889 case lang_object_symbols_statement_enum
:
4890 case lang_output_statement_enum
:
4891 case lang_target_statement_enum
:
4894 case lang_data_statement_enum
:
4895 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4896 if (expld
.result
.valid_p
)
4897 s
->data_statement
.value
= (expld
.result
.value
4898 + expld
.result
.section
->vma
);
4900 einfo (_("%F%P: invalid data statement\n"));
4903 switch (s
->data_statement
.type
)
4921 if (size
< TO_SIZE ((unsigned) 1))
4922 size
= TO_SIZE ((unsigned) 1);
4923 dot
+= TO_ADDR (size
);
4927 case lang_reloc_statement_enum
:
4928 exp_fold_tree (s
->reloc_statement
.addend_exp
,
4929 bfd_abs_section_ptr
, &dot
);
4930 if (expld
.result
.valid_p
)
4931 s
->reloc_statement
.addend_value
= expld
.result
.value
;
4933 einfo (_("%F%P: invalid reloc statement\n"));
4934 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
4937 case lang_input_section_enum
:
4939 asection
*in
= s
->input_section
.section
;
4941 if ((in
->flags
& SEC_EXCLUDE
) == 0)
4942 dot
+= TO_ADDR (in
->size
);
4946 case lang_input_statement_enum
:
4949 case lang_fill_statement_enum
:
4950 fill
= s
->fill_statement
.fill
;
4953 case lang_assignment_statement_enum
:
4954 exp_fold_tree (s
->assignment_statement
.exp
,
4955 current_os
->bfd_section
,
4959 case lang_padding_statement_enum
:
4960 dot
+= TO_ADDR (s
->padding_statement
.size
);
4963 case lang_group_statement_enum
:
4964 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
4965 current_os
, fill
, dot
);
4972 case lang_address_statement_enum
:
4980 lang_do_assignments (void)
4982 lang_statement_iteration
++;
4983 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
4986 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4987 operator .startof. (section_name), it produces an undefined symbol
4988 .startof.section_name. Similarly, when it sees
4989 .sizeof. (section_name), it produces an undefined symbol
4990 .sizeof.section_name. For all the output sections, we look for
4991 such symbols, and set them to the correct value. */
4994 lang_set_startof (void)
4998 if (link_info
.relocatable
)
5001 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5003 const char *secname
;
5005 struct bfd_link_hash_entry
*h
;
5007 secname
= bfd_get_section_name (output_bfd
, s
);
5008 buf
= xmalloc (10 + strlen (secname
));
5010 sprintf (buf
, ".startof.%s", secname
);
5011 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5012 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5014 h
->type
= bfd_link_hash_defined
;
5015 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, s
);
5016 h
->u
.def
.section
= bfd_abs_section_ptr
;
5019 sprintf (buf
, ".sizeof.%s", secname
);
5020 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5021 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5023 h
->type
= bfd_link_hash_defined
;
5024 h
->u
.def
.value
= TO_ADDR (s
->size
);
5025 h
->u
.def
.section
= bfd_abs_section_ptr
;
5035 struct bfd_link_hash_entry
*h
;
5038 if (link_info
.relocatable
|| link_info
.shared
)
5043 if (entry_symbol
.name
== NULL
)
5045 /* No entry has been specified. Look for the default entry, but
5046 don't warn if we don't find it. */
5047 entry_symbol
.name
= entry_symbol_default
;
5051 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5052 FALSE
, FALSE
, TRUE
);
5054 && (h
->type
== bfd_link_hash_defined
5055 || h
->type
== bfd_link_hash_defweak
)
5056 && h
->u
.def
.section
->output_section
!= NULL
)
5060 val
= (h
->u
.def
.value
5061 + bfd_get_section_vma (output_bfd
,
5062 h
->u
.def
.section
->output_section
)
5063 + h
->u
.def
.section
->output_offset
);
5064 if (! bfd_set_start_address (output_bfd
, val
))
5065 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5072 /* We couldn't find the entry symbol. Try parsing it as a
5074 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5077 if (! bfd_set_start_address (output_bfd
, val
))
5078 einfo (_("%P%F: can't set start address\n"));
5084 /* Can't find the entry symbol, and it's not a number. Use
5085 the first address in the text section. */
5086 ts
= bfd_get_section_by_name (output_bfd
, entry_section
);
5090 einfo (_("%P: warning: cannot find entry symbol %s;"
5091 " defaulting to %V\n"),
5093 bfd_get_section_vma (output_bfd
, ts
));
5094 if (! bfd_set_start_address (output_bfd
,
5095 bfd_get_section_vma (output_bfd
,
5097 einfo (_("%P%F: can't set start address\n"));
5102 einfo (_("%P: warning: cannot find entry symbol %s;"
5103 " not setting start address\n"),
5109 /* Don't bfd_hash_table_free (&lang_definedness_table);
5110 map file output may result in a call of lang_track_definedness. */
5113 /* This is a small function used when we want to ignore errors from
5117 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5119 /* Don't do anything. */
5122 /* Check that the architecture of all the input files is compatible
5123 with the output file. Also call the backend to let it do any
5124 other checking that is needed. */
5129 lang_statement_union_type
*file
;
5131 const bfd_arch_info_type
*compatible
;
5133 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5135 input_bfd
= file
->input_statement
.the_bfd
;
5137 = bfd_arch_get_compatible (input_bfd
, output_bfd
,
5138 command_line
.accept_unknown_input_arch
);
5140 /* In general it is not possible to perform a relocatable
5141 link between differing object formats when the input
5142 file has relocations, because the relocations in the
5143 input format may not have equivalent representations in
5144 the output format (and besides BFD does not translate
5145 relocs for other link purposes than a final link). */
5146 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5147 && (compatible
== NULL
5148 || bfd_get_flavour (input_bfd
) != bfd_get_flavour (output_bfd
))
5149 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5151 einfo (_("%P%F: Relocatable linking with relocations from"
5152 " format %s (%B) to format %s (%B) is not supported\n"),
5153 bfd_get_target (input_bfd
), input_bfd
,
5154 bfd_get_target (output_bfd
), output_bfd
);
5155 /* einfo with %F exits. */
5158 if (compatible
== NULL
)
5160 if (command_line
.warn_mismatch
)
5161 einfo (_("%P%X: %s architecture of input file `%B'"
5162 " is incompatible with %s output\n"),
5163 bfd_printable_name (input_bfd
), input_bfd
,
5164 bfd_printable_name (output_bfd
));
5166 else if (bfd_count_sections (input_bfd
))
5168 /* If the input bfd has no contents, it shouldn't set the
5169 private data of the output bfd. */
5171 bfd_error_handler_type pfn
= NULL
;
5173 /* If we aren't supposed to warn about mismatched input
5174 files, temporarily set the BFD error handler to a
5175 function which will do nothing. We still want to call
5176 bfd_merge_private_bfd_data, since it may set up
5177 information which is needed in the output file. */
5178 if (! command_line
.warn_mismatch
)
5179 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5180 if (! bfd_merge_private_bfd_data (input_bfd
, output_bfd
))
5182 if (command_line
.warn_mismatch
)
5183 einfo (_("%P%X: failed to merge target specific data"
5184 " of file %B\n"), input_bfd
);
5186 if (! command_line
.warn_mismatch
)
5187 bfd_set_error_handler (pfn
);
5192 /* Look through all the global common symbols and attach them to the
5193 correct section. The -sort-common command line switch may be used
5194 to roughly sort the entries by size. */
5199 if (command_line
.inhibit_common_definition
)
5201 if (link_info
.relocatable
5202 && ! command_line
.force_common_definition
)
5205 if (! config
.sort_common
)
5206 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5211 for (power
= 4; power
>= 0; power
--)
5212 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5216 /* Place one common symbol in the correct section. */
5219 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5221 unsigned int power_of_two
;
5225 if (h
->type
!= bfd_link_hash_common
)
5229 power_of_two
= h
->u
.c
.p
->alignment_power
;
5231 if (config
.sort_common
5232 && power_of_two
< (unsigned int) *(int *) info
)
5235 section
= h
->u
.c
.p
->section
;
5237 /* Increase the size of the section to align the common sym. */
5238 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
5239 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
5241 /* Adjust the alignment if necessary. */
5242 if (power_of_two
> section
->alignment_power
)
5243 section
->alignment_power
= power_of_two
;
5245 /* Change the symbol from common to defined. */
5246 h
->type
= bfd_link_hash_defined
;
5247 h
->u
.def
.section
= section
;
5248 h
->u
.def
.value
= section
->size
;
5250 /* Increase the size of the section. */
5251 section
->size
+= size
;
5253 /* Make sure the section is allocated in memory, and make sure that
5254 it is no longer a common section. */
5255 section
->flags
|= SEC_ALLOC
;
5256 section
->flags
&= ~SEC_IS_COMMON
;
5258 if (config
.map_file
!= NULL
)
5260 static bfd_boolean header_printed
;
5265 if (! header_printed
)
5267 minfo (_("\nAllocating common symbols\n"));
5268 minfo (_("Common symbol size file\n\n"));
5269 header_printed
= TRUE
;
5272 name
= bfd_demangle (output_bfd
, h
->root
.string
,
5273 DMGL_ANSI
| DMGL_PARAMS
);
5276 minfo ("%s", h
->root
.string
);
5277 len
= strlen (h
->root
.string
);
5282 len
= strlen (name
);
5298 if (size
<= 0xffffffff)
5299 sprintf (buf
, "%lx", (unsigned long) size
);
5301 sprintf_vma (buf
, size
);
5311 minfo ("%B\n", section
->owner
);
5317 /* Run through the input files and ensure that every input section has
5318 somewhere to go. If one is found without a destination then create
5319 an input request and place it into the statement tree. */
5322 lang_place_orphans (void)
5324 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5328 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5330 if (s
->output_section
== NULL
)
5332 /* This section of the file is not attached, root
5333 around for a sensible place for it to go. */
5335 if (file
->just_syms_flag
)
5336 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5337 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5338 s
->output_section
= bfd_abs_section_ptr
;
5339 else if (strcmp (s
->name
, "COMMON") == 0)
5341 /* This is a lonely common section which must have
5342 come from an archive. We attach to the section
5343 with the wildcard. */
5344 if (! link_info
.relocatable
5345 || command_line
.force_common_definition
)
5347 if (default_common_section
== NULL
)
5349 default_common_section
=
5350 lang_output_section_statement_lookup (".bss");
5353 lang_add_section (&default_common_section
->children
, s
,
5354 default_common_section
);
5357 else if (ldemul_place_orphan (s
))
5361 lang_output_section_statement_type
*os
;
5363 os
= lang_output_section_statement_lookup (s
->name
);
5364 lang_add_section (&os
->children
, s
, os
);
5372 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5374 flagword
*ptr_flags
;
5376 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5382 *ptr_flags
|= SEC_ALLOC
;
5386 *ptr_flags
|= SEC_READONLY
;
5390 *ptr_flags
|= SEC_DATA
;
5394 *ptr_flags
|= SEC_CODE
;
5399 *ptr_flags
|= SEC_LOAD
;
5403 einfo (_("%P%F: invalid syntax in flags\n"));
5410 /* Call a function on each input file. This function will be called
5411 on an archive, but not on the elements. */
5414 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5416 lang_input_statement_type
*f
;
5418 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5420 f
= (lang_input_statement_type
*) f
->next_real_file
)
5424 /* Call a function on each file. The function will be called on all
5425 the elements of an archive which are included in the link, but will
5426 not be called on the archive file itself. */
5429 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5431 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5438 ldlang_add_file (lang_input_statement_type
*entry
)
5440 lang_statement_append (&file_chain
,
5441 (lang_statement_union_type
*) entry
,
5444 /* The BFD linker needs to have a list of all input BFDs involved in
5446 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5447 ASSERT (entry
->the_bfd
!= output_bfd
);
5449 *link_info
.input_bfds_tail
= entry
->the_bfd
;
5450 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
5451 entry
->the_bfd
->usrdata
= entry
;
5452 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5454 /* Look through the sections and check for any which should not be
5455 included in the link. We need to do this now, so that we can
5456 notice when the backend linker tries to report multiple
5457 definition errors for symbols which are in sections we aren't
5458 going to link. FIXME: It might be better to entirely ignore
5459 symbols which are defined in sections which are going to be
5460 discarded. This would require modifying the backend linker for
5461 each backend which might set the SEC_LINK_ONCE flag. If we do
5462 this, we should probably handle SEC_EXCLUDE in the same way. */
5464 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5468 lang_add_output (const char *name
, int from_script
)
5470 /* Make -o on command line override OUTPUT in script. */
5471 if (!had_output_filename
|| !from_script
)
5473 output_filename
= name
;
5474 had_output_filename
= TRUE
;
5478 static lang_output_section_statement_type
*current_section
;
5489 for (l
= 0; l
< 32; l
++)
5491 if (i
>= (unsigned int) x
)
5499 lang_output_section_statement_type
*
5500 lang_enter_output_section_statement (const char *output_section_statement_name
,
5501 etree_type
*address_exp
,
5502 enum section_type sectype
,
5504 etree_type
*subalign
,
5508 lang_output_section_statement_type
*os
;
5510 os
= lang_output_section_statement_lookup_1 (output_section_statement_name
,
5512 current_section
= os
;
5514 /* Make next things chain into subchain of this. */
5516 if (os
->addr_tree
== NULL
)
5518 os
->addr_tree
= address_exp
;
5520 os
->sectype
= sectype
;
5521 if (sectype
!= noload_section
)
5522 os
->flags
= SEC_NO_FLAGS
;
5524 os
->flags
= SEC_NEVER_LOAD
;
5525 os
->block_value
= 1;
5526 stat_ptr
= &os
->children
;
5528 os
->subsection_alignment
=
5529 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5530 os
->section_alignment
=
5531 topower (exp_get_value_int (align
, -1, "section alignment"));
5533 os
->load_base
= ebase
;
5540 lang_output_statement_type
*new;
5542 new = new_stat (lang_output_statement
, stat_ptr
);
5543 new->name
= output_filename
;
5546 /* Reset the current counters in the regions. */
5549 lang_reset_memory_regions (void)
5551 lang_memory_region_type
*p
= lang_memory_region_list
;
5553 lang_output_section_statement_type
*os
;
5555 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5557 p
->current
= p
->origin
;
5561 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5565 os
->processed_vma
= FALSE
;
5566 os
->processed_lma
= FALSE
;
5569 for (o
= output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5571 /* Save the last size for possible use by bfd_relax_section. */
5572 o
->rawsize
= o
->size
;
5577 /* Worker for lang_gc_sections_1. */
5580 gc_section_callback (lang_wild_statement_type
*ptr
,
5581 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5583 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5584 void *data ATTRIBUTE_UNUSED
)
5586 /* If the wild pattern was marked KEEP, the member sections
5587 should be as well. */
5588 if (ptr
->keep_sections
)
5589 section
->flags
|= SEC_KEEP
;
5592 /* Iterate over sections marking them against GC. */
5595 lang_gc_sections_1 (lang_statement_union_type
*s
)
5597 for (; s
!= NULL
; s
= s
->header
.next
)
5599 switch (s
->header
.type
)
5601 case lang_wild_statement_enum
:
5602 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5604 case lang_constructors_statement_enum
:
5605 lang_gc_sections_1 (constructor_list
.head
);
5607 case lang_output_section_statement_enum
:
5608 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5610 case lang_group_statement_enum
:
5611 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5620 lang_gc_sections (void)
5622 struct bfd_link_hash_entry
*h
;
5623 ldlang_undef_chain_list_type
*ulist
;
5625 /* Keep all sections so marked in the link script. */
5627 lang_gc_sections_1 (statement_list
.head
);
5629 /* Keep all sections containing symbols undefined on the command-line,
5630 and the section containing the entry symbol. */
5632 for (ulist
= link_info
.gc_sym_list
; ulist
; ulist
= ulist
->next
)
5634 h
= bfd_link_hash_lookup (link_info
.hash
, ulist
->name
,
5635 FALSE
, FALSE
, FALSE
);
5638 && (h
->type
== bfd_link_hash_defined
5639 || h
->type
== bfd_link_hash_defweak
)
5640 && ! bfd_is_abs_section (h
->u
.def
.section
))
5642 h
->u
.def
.section
->flags
|= SEC_KEEP
;
5646 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5647 the special case of debug info. (See bfd/stabs.c)
5648 Twiddle the flag here, to simplify later linker code. */
5649 if (link_info
.relocatable
)
5651 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5654 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5655 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5656 sec
->flags
&= ~SEC_EXCLUDE
;
5660 if (link_info
.gc_sections
)
5661 bfd_gc_sections (output_bfd
, &link_info
);
5664 /* Relax all sections until bfd_relax_section gives up. */
5667 relax_sections (void)
5669 /* Keep relaxing until bfd_relax_section gives up. */
5670 bfd_boolean relax_again
;
5672 link_info
.relax_trip
= -1;
5675 relax_again
= FALSE
;
5676 link_info
.relax_trip
++;
5678 /* Note: pe-dll.c does something like this also. If you find
5679 you need to change this code, you probably need to change
5680 pe-dll.c also. DJ */
5682 /* Do all the assignments with our current guesses as to
5684 lang_do_assignments ();
5686 /* We must do this after lang_do_assignments, because it uses
5688 lang_reset_memory_regions ();
5690 /* Perform another relax pass - this time we know where the
5691 globals are, so can make a better guess. */
5692 lang_size_sections (&relax_again
, FALSE
);
5694 while (relax_again
);
5700 /* Finalize dynamic list. */
5701 if (link_info
.dynamic_list
)
5702 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
5704 current_target
= default_target
;
5706 /* Open the output file. */
5707 lang_for_each_statement (ldlang_open_output
);
5710 ldemul_create_output_section_statements ();
5712 /* Add to the hash table all undefineds on the command line. */
5713 lang_place_undefineds ();
5715 if (!bfd_section_already_linked_table_init ())
5716 einfo (_("%P%F: Failed to create hash table\n"));
5718 /* Create a bfd for each input file. */
5719 current_target
= default_target
;
5720 open_input_bfds (statement_list
.head
, FALSE
);
5722 link_info
.gc_sym_list
= &entry_symbol
;
5723 if (entry_symbol
.name
== NULL
)
5724 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
5726 ldemul_after_open ();
5728 bfd_section_already_linked_table_free ();
5730 /* Make sure that we're not mixing architectures. We call this
5731 after all the input files have been opened, but before we do any
5732 other processing, so that any operations merge_private_bfd_data
5733 does on the output file will be known during the rest of the
5737 /* Handle .exports instead of a version script if we're told to do so. */
5738 if (command_line
.version_exports_section
)
5739 lang_do_version_exports_section ();
5741 /* Build all sets based on the information gathered from the input
5743 ldctor_build_sets ();
5745 /* Remove unreferenced sections if asked to. */
5746 lang_gc_sections ();
5748 /* Size up the common data. */
5751 /* Update wild statements. */
5752 update_wild_statements (statement_list
.head
);
5754 /* Run through the contours of the script and attach input sections
5755 to the correct output sections. */
5756 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
5758 /* Find any sections not attached explicitly and handle them. */
5759 lang_place_orphans ();
5761 if (! link_info
.relocatable
)
5765 /* Merge SEC_MERGE sections. This has to be done after GC of
5766 sections, so that GCed sections are not merged, but before
5767 assigning dynamic symbols, since removing whole input sections
5769 bfd_merge_sections (output_bfd
, &link_info
);
5771 /* Look for a text section and set the readonly attribute in it. */
5772 found
= bfd_get_section_by_name (output_bfd
, ".text");
5776 if (config
.text_read_only
)
5777 found
->flags
|= SEC_READONLY
;
5779 found
->flags
&= ~SEC_READONLY
;
5783 /* Do anything special before sizing sections. This is where ELF
5784 and other back-ends size dynamic sections. */
5785 ldemul_before_allocation ();
5787 /* We must record the program headers before we try to fix the
5788 section positions, since they will affect SIZEOF_HEADERS. */
5789 lang_record_phdrs ();
5791 /* Size up the sections. */
5792 lang_size_sections (NULL
, !command_line
.relax
);
5794 /* Now run around and relax if we can. */
5795 if (command_line
.relax
)
5797 /* We may need more than one relaxation pass. */
5798 int i
= link_info
.relax_pass
;
5800 /* The backend can use it to determine the current pass. */
5801 link_info
.relax_pass
= 0;
5806 link_info
.relax_pass
++;
5809 /* Final extra sizing to report errors. */
5810 lang_do_assignments ();
5811 lang_reset_memory_regions ();
5812 lang_size_sections (NULL
, TRUE
);
5815 /* See if anything special should be done now we know how big
5817 ldemul_after_allocation ();
5819 /* Fix any .startof. or .sizeof. symbols. */
5820 lang_set_startof ();
5822 /* Do all the assignments, now that we know the final resting places
5823 of all the symbols. */
5825 lang_do_assignments ();
5829 /* Make sure that the section addresses make sense. */
5830 if (! link_info
.relocatable
5831 && command_line
.check_section_addresses
)
5832 lang_check_section_addresses ();
5837 /* EXPORTED TO YACC */
5840 lang_add_wild (struct wildcard_spec
*filespec
,
5841 struct wildcard_list
*section_list
,
5842 bfd_boolean keep_sections
)
5844 struct wildcard_list
*curr
, *next
;
5845 lang_wild_statement_type
*new;
5847 /* Reverse the list as the parser puts it back to front. */
5848 for (curr
= section_list
, section_list
= NULL
;
5850 section_list
= curr
, curr
= next
)
5852 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
5853 placed_commons
= TRUE
;
5856 curr
->next
= section_list
;
5859 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
5861 if (strcmp (filespec
->name
, "*") == 0)
5862 filespec
->name
= NULL
;
5863 else if (! wildcardp (filespec
->name
))
5864 lang_has_input_file
= TRUE
;
5867 new = new_stat (lang_wild_statement
, stat_ptr
);
5868 new->filename
= NULL
;
5869 new->filenames_sorted
= FALSE
;
5870 if (filespec
!= NULL
)
5872 new->filename
= filespec
->name
;
5873 new->filenames_sorted
= filespec
->sorted
== by_name
;
5875 new->section_list
= section_list
;
5876 new->keep_sections
= keep_sections
;
5877 lang_list_init (&new->children
);
5878 analyze_walk_wild_section_handler (new);
5882 lang_section_start (const char *name
, etree_type
*address
,
5883 const segment_type
*segment
)
5885 lang_address_statement_type
*ad
;
5887 ad
= new_stat (lang_address_statement
, stat_ptr
);
5888 ad
->section_name
= name
;
5889 ad
->address
= address
;
5890 ad
->segment
= segment
;
5893 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5894 because of a -e argument on the command line, or zero if this is
5895 called by ENTRY in a linker script. Command line arguments take
5899 lang_add_entry (const char *name
, bfd_boolean cmdline
)
5901 if (entry_symbol
.name
== NULL
5903 || ! entry_from_cmdline
)
5905 entry_symbol
.name
= name
;
5906 entry_from_cmdline
= cmdline
;
5910 /* Set the default start symbol to NAME. .em files should use this,
5911 not lang_add_entry, to override the use of "start" if neither the
5912 linker script nor the command line specifies an entry point. NAME
5913 must be permanently allocated. */
5915 lang_default_entry (const char *name
)
5917 entry_symbol_default
= name
;
5921 lang_add_target (const char *name
)
5923 lang_target_statement_type
*new;
5925 new = new_stat (lang_target_statement
, stat_ptr
);
5930 lang_add_map (const char *name
)
5937 map_option_f
= TRUE
;
5945 lang_add_fill (fill_type
*fill
)
5947 lang_fill_statement_type
*new;
5949 new = new_stat (lang_fill_statement
, stat_ptr
);
5954 lang_add_data (int type
, union etree_union
*exp
)
5956 lang_data_statement_type
*new;
5958 new = new_stat (lang_data_statement
, stat_ptr
);
5963 /* Create a new reloc statement. RELOC is the BFD relocation type to
5964 generate. HOWTO is the corresponding howto structure (we could
5965 look this up, but the caller has already done so). SECTION is the
5966 section to generate a reloc against, or NAME is the name of the
5967 symbol to generate a reloc against. Exactly one of SECTION and
5968 NAME must be NULL. ADDEND is an expression for the addend. */
5971 lang_add_reloc (bfd_reloc_code_real_type reloc
,
5972 reloc_howto_type
*howto
,
5975 union etree_union
*addend
)
5977 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
5981 p
->section
= section
;
5983 p
->addend_exp
= addend
;
5985 p
->addend_value
= 0;
5986 p
->output_section
= NULL
;
5987 p
->output_offset
= 0;
5990 lang_assignment_statement_type
*
5991 lang_add_assignment (etree_type
*exp
)
5993 lang_assignment_statement_type
*new;
5995 new = new_stat (lang_assignment_statement
, stat_ptr
);
6001 lang_add_attribute (enum statement_enum attribute
)
6003 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6007 lang_startup (const char *name
)
6009 if (startup_file
!= NULL
)
6011 einfo (_("%P%F: multiple STARTUP files\n"));
6013 first_file
->filename
= name
;
6014 first_file
->local_sym_name
= name
;
6015 first_file
->real
= TRUE
;
6017 startup_file
= name
;
6021 lang_float (bfd_boolean maybe
)
6023 lang_float_flag
= maybe
;
6027 /* Work out the load- and run-time regions from a script statement, and
6028 store them in *LMA_REGION and *REGION respectively.
6030 MEMSPEC is the name of the run-time region, or the value of
6031 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6032 LMA_MEMSPEC is the name of the load-time region, or null if the
6033 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6034 had an explicit load address.
6036 It is an error to specify both a load region and a load address. */
6039 lang_get_regions (lang_memory_region_type
**region
,
6040 lang_memory_region_type
**lma_region
,
6041 const char *memspec
,
6042 const char *lma_memspec
,
6043 bfd_boolean have_lma
,
6044 bfd_boolean have_vma
)
6046 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6048 /* If no runtime region or VMA has been specified, but the load region
6049 has been specified, then use the load region for the runtime region
6051 if (lma_memspec
!= NULL
6053 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6054 *region
= *lma_region
;
6056 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6058 if (have_lma
&& lma_memspec
!= 0)
6059 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6063 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6064 lang_output_section_phdr_list
*phdrs
,
6065 const char *lma_memspec
)
6067 lang_get_regions (¤t_section
->region
,
6068 ¤t_section
->lma_region
,
6069 memspec
, lma_memspec
,
6070 current_section
->load_base
!= NULL
,
6071 current_section
->addr_tree
!= NULL
);
6072 current_section
->fill
= fill
;
6073 current_section
->phdrs
= phdrs
;
6074 stat_ptr
= &statement_list
;
6077 /* Create an absolute symbol with the given name with the value of the
6078 address of first byte of the section named.
6080 If the symbol already exists, then do nothing. */
6083 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6085 struct bfd_link_hash_entry
*h
;
6087 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6089 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6091 if (h
->type
== bfd_link_hash_new
6092 || h
->type
== bfd_link_hash_undefined
)
6096 h
->type
= bfd_link_hash_defined
;
6098 sec
= bfd_get_section_by_name (output_bfd
, secname
);
6102 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, sec
);
6104 h
->u
.def
.section
= bfd_abs_section_ptr
;
6108 /* Create an absolute symbol with the given name with the value of the
6109 address of the first byte after the end of the section named.
6111 If the symbol already exists, then do nothing. */
6114 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6116 struct bfd_link_hash_entry
*h
;
6118 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6120 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6122 if (h
->type
== bfd_link_hash_new
6123 || h
->type
== bfd_link_hash_undefined
)
6127 h
->type
= bfd_link_hash_defined
;
6129 sec
= bfd_get_section_by_name (output_bfd
, secname
);
6133 h
->u
.def
.value
= (bfd_get_section_vma (output_bfd
, sec
)
6134 + TO_ADDR (sec
->size
));
6136 h
->u
.def
.section
= bfd_abs_section_ptr
;
6141 lang_statement_append (lang_statement_list_type
*list
,
6142 lang_statement_union_type
*element
,
6143 lang_statement_union_type
**field
)
6145 *(list
->tail
) = element
;
6149 /* Set the output format type. -oformat overrides scripts. */
6152 lang_add_output_format (const char *format
,
6157 if (output_target
== NULL
|| !from_script
)
6159 if (command_line
.endian
== ENDIAN_BIG
6162 else if (command_line
.endian
== ENDIAN_LITTLE
6166 output_target
= format
;
6170 /* Enter a group. This creates a new lang_group_statement, and sets
6171 stat_ptr to build new statements within the group. */
6174 lang_enter_group (void)
6176 lang_group_statement_type
*g
;
6178 g
= new_stat (lang_group_statement
, stat_ptr
);
6179 lang_list_init (&g
->children
);
6180 stat_ptr
= &g
->children
;
6183 /* Leave a group. This just resets stat_ptr to start writing to the
6184 regular list of statements again. Note that this will not work if
6185 groups can occur inside anything else which can adjust stat_ptr,
6186 but currently they can't. */
6189 lang_leave_group (void)
6191 stat_ptr
= &statement_list
;
6194 /* Add a new program header. This is called for each entry in a PHDRS
6195 command in a linker script. */
6198 lang_new_phdr (const char *name
,
6200 bfd_boolean filehdr
,
6205 struct lang_phdr
*n
, **pp
;
6207 n
= stat_alloc (sizeof (struct lang_phdr
));
6210 n
->type
= exp_get_value_int (type
, 0, "program header type");
6211 n
->filehdr
= filehdr
;
6216 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6221 /* Record the program header information in the output BFD. FIXME: We
6222 should not be calling an ELF specific function here. */
6225 lang_record_phdrs (void)
6229 lang_output_section_phdr_list
*last
;
6230 struct lang_phdr
*l
;
6231 lang_output_section_statement_type
*os
;
6234 secs
= xmalloc (alc
* sizeof (asection
*));
6237 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
6244 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6248 lang_output_section_phdr_list
*pl
;
6250 if (os
->constraint
== -1)
6258 if (os
->sectype
== noload_section
6259 || os
->bfd_section
== NULL
6260 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6267 lang_output_section_statement_type
* tmp_os
;
6269 /* If we have not run across a section with a program
6270 header assigned to it yet, then scan forwards to find
6271 one. This prevents inconsistencies in the linker's
6272 behaviour when a script has specified just a single
6273 header and there are sections in that script which are
6274 not assigned to it, and which occur before the first
6275 use of that header. See here for more details:
6276 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6277 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
6284 if (os
->bfd_section
== NULL
)
6287 for (; pl
!= NULL
; pl
= pl
->next
)
6289 if (strcmp (pl
->name
, l
->name
) == 0)
6294 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
6296 secs
[c
] = os
->bfd_section
;
6303 if (l
->flags
== NULL
)
6306 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6311 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6313 if (! bfd_record_phdr (output_bfd
, l
->type
,
6314 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6315 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6316 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6321 /* Make sure all the phdr assignments succeeded. */
6322 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6326 lang_output_section_phdr_list
*pl
;
6328 if (os
->constraint
== -1
6329 || os
->bfd_section
== NULL
)
6332 for (pl
= os
->phdrs
;
6335 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6336 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6337 os
->name
, pl
->name
);
6341 /* Record a list of sections which may not be cross referenced. */
6344 lang_add_nocrossref (lang_nocrossref_type
*l
)
6346 struct lang_nocrossrefs
*n
;
6348 n
= xmalloc (sizeof *n
);
6349 n
->next
= nocrossref_list
;
6351 nocrossref_list
= n
;
6353 /* Set notice_all so that we get informed about all symbols. */
6354 link_info
.notice_all
= TRUE
;
6357 /* Overlay handling. We handle overlays with some static variables. */
6359 /* The overlay virtual address. */
6360 static etree_type
*overlay_vma
;
6361 /* And subsection alignment. */
6362 static etree_type
*overlay_subalign
;
6364 /* An expression for the maximum section size seen so far. */
6365 static etree_type
*overlay_max
;
6367 /* A list of all the sections in this overlay. */
6369 struct overlay_list
{
6370 struct overlay_list
*next
;
6371 lang_output_section_statement_type
*os
;
6374 static struct overlay_list
*overlay_list
;
6376 /* Start handling an overlay. */
6379 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6381 /* The grammar should prevent nested overlays from occurring. */
6382 ASSERT (overlay_vma
== NULL
6383 && overlay_subalign
== NULL
6384 && overlay_max
== NULL
);
6386 overlay_vma
= vma_expr
;
6387 overlay_subalign
= subalign
;
6390 /* Start a section in an overlay. We handle this by calling
6391 lang_enter_output_section_statement with the correct VMA.
6392 lang_leave_overlay sets up the LMA and memory regions. */
6395 lang_enter_overlay_section (const char *name
)
6397 struct overlay_list
*n
;
6400 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
6401 0, overlay_subalign
, 0, 0);
6403 /* If this is the first section, then base the VMA of future
6404 sections on this one. This will work correctly even if `.' is
6405 used in the addresses. */
6406 if (overlay_list
== NULL
)
6407 overlay_vma
= exp_nameop (ADDR
, name
);
6409 /* Remember the section. */
6410 n
= xmalloc (sizeof *n
);
6411 n
->os
= current_section
;
6412 n
->next
= overlay_list
;
6415 size
= exp_nameop (SIZEOF
, name
);
6417 /* Arrange to work out the maximum section end address. */
6418 if (overlay_max
== NULL
)
6421 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6424 /* Finish a section in an overlay. There isn't any special to do
6428 lang_leave_overlay_section (fill_type
*fill
,
6429 lang_output_section_phdr_list
*phdrs
)
6436 name
= current_section
->name
;
6438 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6439 region and that no load-time region has been specified. It doesn't
6440 really matter what we say here, since lang_leave_overlay will
6442 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6444 /* Define the magic symbols. */
6446 clean
= xmalloc (strlen (name
) + 1);
6448 for (s1
= name
; *s1
!= '\0'; s1
++)
6449 if (ISALNUM (*s1
) || *s1
== '_')
6453 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6454 sprintf (buf
, "__load_start_%s", clean
);
6455 lang_add_assignment (exp_provide (buf
,
6456 exp_nameop (LOADADDR
, name
),
6459 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6460 sprintf (buf
, "__load_stop_%s", clean
);
6461 lang_add_assignment (exp_provide (buf
,
6463 exp_nameop (LOADADDR
, name
),
6464 exp_nameop (SIZEOF
, name
)),
6470 /* Finish an overlay. If there are any overlay wide settings, this
6471 looks through all the sections in the overlay and sets them. */
6474 lang_leave_overlay (etree_type
*lma_expr
,
6477 const char *memspec
,
6478 lang_output_section_phdr_list
*phdrs
,
6479 const char *lma_memspec
)
6481 lang_memory_region_type
*region
;
6482 lang_memory_region_type
*lma_region
;
6483 struct overlay_list
*l
;
6484 lang_nocrossref_type
*nocrossref
;
6486 lang_get_regions (®ion
, &lma_region
,
6487 memspec
, lma_memspec
,
6488 lma_expr
!= NULL
, FALSE
);
6492 /* After setting the size of the last section, set '.' to end of the
6494 if (overlay_list
!= NULL
)
6495 overlay_list
->os
->update_dot_tree
6496 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6501 struct overlay_list
*next
;
6503 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6506 l
->os
->region
= region
;
6507 l
->os
->lma_region
= lma_region
;
6509 /* The first section has the load address specified in the
6510 OVERLAY statement. The rest are worked out from that.
6511 The base address is not needed (and should be null) if
6512 an LMA region was specified. */
6515 l
->os
->load_base
= lma_expr
;
6516 l
->os
->sectype
= normal_section
;
6518 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6519 l
->os
->phdrs
= phdrs
;
6523 lang_nocrossref_type
*nc
;
6525 nc
= xmalloc (sizeof *nc
);
6526 nc
->name
= l
->os
->name
;
6527 nc
->next
= nocrossref
;
6536 if (nocrossref
!= NULL
)
6537 lang_add_nocrossref (nocrossref
);
6540 overlay_list
= NULL
;
6544 /* Version handling. This is only useful for ELF. */
6546 /* This global variable holds the version tree that we build. */
6548 struct bfd_elf_version_tree
*lang_elf_version_info
;
6550 /* If PREV is NULL, return first version pattern matching particular symbol.
6551 If PREV is non-NULL, return first version pattern matching particular
6552 symbol after PREV (previously returned by lang_vers_match). */
6554 static struct bfd_elf_version_expr
*
6555 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6556 struct bfd_elf_version_expr
*prev
,
6559 const char *cxx_sym
= sym
;
6560 const char *java_sym
= sym
;
6561 struct bfd_elf_version_expr
*expr
= NULL
;
6563 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6565 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6569 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6571 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6576 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6578 struct bfd_elf_version_expr e
;
6580 switch (prev
? prev
->mask
: 0)
6583 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6586 expr
= htab_find (head
->htab
, &e
);
6587 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6588 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6594 case BFD_ELF_VERSION_C_TYPE
:
6595 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6598 expr
= htab_find (head
->htab
, &e
);
6599 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6600 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6606 case BFD_ELF_VERSION_CXX_TYPE
:
6607 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6609 e
.symbol
= java_sym
;
6610 expr
= htab_find (head
->htab
, &e
);
6611 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6612 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6623 /* Finally, try the wildcards. */
6624 if (prev
== NULL
|| prev
->symbol
)
6625 expr
= head
->remaining
;
6628 for (; expr
; expr
= expr
->next
)
6635 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6638 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6640 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6644 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6650 free ((char *) cxx_sym
);
6651 if (java_sym
!= sym
)
6652 free ((char *) java_sym
);
6656 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6657 return a string pointing to the symbol name. */
6660 realsymbol (const char *pattern
)
6663 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6664 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6666 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6668 /* It is a glob pattern only if there is no preceding
6670 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6678 /* Remove the preceding backslash. */
6685 backslash
= *p
== '\\';
6700 /* This is called for each variable name or match expression. NEW is
6701 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
6702 pattern to be matched against symbol names. */
6704 struct bfd_elf_version_expr
*
6705 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
6708 bfd_boolean literal_p
)
6710 struct bfd_elf_version_expr
*ret
;
6712 ret
= xmalloc (sizeof *ret
);
6714 ret
->pattern
= literal_p
? NULL
: new;
6717 ret
->symbol
= literal_p
? new : realsymbol (new);
6719 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
6720 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6721 else if (strcasecmp (lang
, "C++") == 0)
6722 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
6723 else if (strcasecmp (lang
, "Java") == 0)
6724 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
6727 einfo (_("%X%P: unknown language `%s' in version information\n"),
6729 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6732 return ldemul_new_vers_pattern (ret
);
6735 /* This is called for each set of variable names and match
6738 struct bfd_elf_version_tree
*
6739 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
6740 struct bfd_elf_version_expr
*locals
)
6742 struct bfd_elf_version_tree
*ret
;
6744 ret
= xcalloc (1, sizeof *ret
);
6745 ret
->globals
.list
= globals
;
6746 ret
->locals
.list
= locals
;
6747 ret
->match
= lang_vers_match
;
6748 ret
->name_indx
= (unsigned int) -1;
6752 /* This static variable keeps track of version indices. */
6754 static int version_index
;
6757 version_expr_head_hash (const void *p
)
6759 const struct bfd_elf_version_expr
*e
= p
;
6761 return htab_hash_string (e
->symbol
);
6765 version_expr_head_eq (const void *p1
, const void *p2
)
6767 const struct bfd_elf_version_expr
*e1
= p1
;
6768 const struct bfd_elf_version_expr
*e2
= p2
;
6770 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
6774 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
6777 struct bfd_elf_version_expr
*e
, *next
;
6778 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
6780 for (e
= head
->list
; e
; e
= e
->next
)
6784 head
->mask
|= e
->mask
;
6789 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
6790 version_expr_head_eq
, NULL
);
6791 list_loc
= &head
->list
;
6792 remaining_loc
= &head
->remaining
;
6793 for (e
= head
->list
; e
; e
= next
)
6799 remaining_loc
= &e
->next
;
6803 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
6807 struct bfd_elf_version_expr
*e1
, *last
;
6813 if (e1
->mask
== e
->mask
)
6821 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
6825 /* This is a duplicate. */
6826 /* FIXME: Memory leak. Sometimes pattern is not
6827 xmalloced alone, but in larger chunk of memory. */
6828 /* free (e->symbol); */
6833 e
->next
= last
->next
;
6841 list_loc
= &e
->next
;
6845 *remaining_loc
= NULL
;
6846 *list_loc
= head
->remaining
;
6849 head
->remaining
= head
->list
;
6852 /* This is called when we know the name and dependencies of the
6856 lang_register_vers_node (const char *name
,
6857 struct bfd_elf_version_tree
*version
,
6858 struct bfd_elf_version_deps
*deps
)
6860 struct bfd_elf_version_tree
*t
, **pp
;
6861 struct bfd_elf_version_expr
*e1
;
6866 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
6867 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
6869 einfo (_("%X%P: anonymous version tag cannot be combined"
6870 " with other version tags\n"));
6875 /* Make sure this node has a unique name. */
6876 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6877 if (strcmp (t
->name
, name
) == 0)
6878 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
6880 lang_finalize_version_expr_head (&version
->globals
);
6881 lang_finalize_version_expr_head (&version
->locals
);
6883 /* Check the global and local match names, and make sure there
6884 aren't any duplicates. */
6886 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
6888 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6890 struct bfd_elf_version_expr
*e2
;
6892 if (t
->locals
.htab
&& e1
->symbol
)
6894 e2
= htab_find (t
->locals
.htab
, e1
);
6895 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6897 if (e1
->mask
== e2
->mask
)
6898 einfo (_("%X%P: duplicate expression `%s'"
6899 " in version information\n"), e1
->symbol
);
6903 else if (!e1
->symbol
)
6904 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6905 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6906 && e1
->mask
== e2
->mask
)
6907 einfo (_("%X%P: duplicate expression `%s'"
6908 " in version information\n"), e1
->pattern
);
6912 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
6914 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6916 struct bfd_elf_version_expr
*e2
;
6918 if (t
->globals
.htab
&& e1
->symbol
)
6920 e2
= htab_find (t
->globals
.htab
, e1
);
6921 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6923 if (e1
->mask
== e2
->mask
)
6924 einfo (_("%X%P: duplicate expression `%s'"
6925 " in version information\n"),
6930 else if (!e1
->symbol
)
6931 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6932 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6933 && e1
->mask
== e2
->mask
)
6934 einfo (_("%X%P: duplicate expression `%s'"
6935 " in version information\n"), e1
->pattern
);
6939 version
->deps
= deps
;
6940 version
->name
= name
;
6941 if (name
[0] != '\0')
6944 version
->vernum
= version_index
;
6947 version
->vernum
= 0;
6949 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6954 /* This is called when we see a version dependency. */
6956 struct bfd_elf_version_deps
*
6957 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
6959 struct bfd_elf_version_deps
*ret
;
6960 struct bfd_elf_version_tree
*t
;
6962 ret
= xmalloc (sizeof *ret
);
6965 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6967 if (strcmp (t
->name
, name
) == 0)
6969 ret
->version_needed
= t
;
6974 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
6980 lang_do_version_exports_section (void)
6982 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
6984 LANG_FOR_EACH_INPUT_STATEMENT (is
)
6986 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
6994 contents
= xmalloc (len
);
6995 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
6996 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
6999 while (p
< contents
+ len
)
7001 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7002 p
= strchr (p
, '\0') + 1;
7005 /* Do not free the contents, as we used them creating the regex. */
7007 /* Do not include this section in the link. */
7008 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7011 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7012 lang_register_vers_node (command_line
.version_exports_section
,
7013 lang_new_vers_node (greg
, lreg
), NULL
);
7017 lang_add_unique (const char *name
)
7019 struct unique_sections
*ent
;
7021 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7022 if (strcmp (ent
->name
, name
) == 0)
7025 ent
= xmalloc (sizeof *ent
);
7026 ent
->name
= xstrdup (name
);
7027 ent
->next
= unique_section_list
;
7028 unique_section_list
= ent
;
7031 /* Append the list of dynamic symbols to the existing one. */
7034 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7036 if (link_info
.dynamic_list
)
7038 struct bfd_elf_version_expr
*tail
;
7039 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7041 tail
->next
= link_info
.dynamic_list
->head
.list
;
7042 link_info
.dynamic_list
->head
.list
= dynamic
;
7046 struct bfd_elf_dynamic_list
*d
;
7048 d
= xcalloc (1, sizeof *d
);
7049 d
->head
.list
= dynamic
;
7050 d
->match
= lang_vers_match
;
7051 link_info
.dynamic_list
= d
;
7055 /* Append the list of C++ typeinfo dynamic symbols to the existing
7059 lang_append_dynamic_list_cpp_typeinfo (void)
7061 const char * symbols
[] =
7063 "typeinfo name for*",
7066 struct bfd_elf_version_expr
*dynamic
= NULL
;
7069 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7070 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7073 lang_append_dynamic_list (dynamic
);
7076 /* Append the list of C++ operator new and delete dynamic symbols to the
7080 lang_append_dynamic_list_cpp_new (void)
7082 const char * symbols
[] =
7087 struct bfd_elf_version_expr
*dynamic
= NULL
;
7090 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7091 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7094 lang_append_dynamic_list (dynamic
);