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 GLD, the Gnu Linker.
8 GLD 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 2, or (at your option)
13 GLD 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 GLD; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
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 lang_statement_list_type input_file_chain
;
56 static bfd_boolean placed_commons
= FALSE
;
57 static bfd_boolean stripped_excluded_sections
= FALSE
;
58 static lang_output_section_statement_type
*default_common_section
;
59 static bfd_boolean map_option_f
;
60 static bfd_vma print_dot
;
61 static lang_input_statement_type
*first_file
;
62 static const char *current_target
;
63 static const char *output_target
;
64 static lang_statement_list_type statement_list
;
65 static struct bfd_hash_table lang_definedness_table
;
67 /* Forward declarations. */
68 static void exp_init_os (etree_type
*);
69 static void init_map_userdata (bfd
*, asection
*, void *);
70 static lang_input_statement_type
*lookup_name (const char *);
71 static struct bfd_hash_entry
*lang_definedness_newfunc
72 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
73 static void insert_undefined (const char *);
74 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
75 static void print_statement (lang_statement_union_type
*,
76 lang_output_section_statement_type
*);
77 static void print_statement_list (lang_statement_union_type
*,
78 lang_output_section_statement_type
*);
79 static void print_statements (void);
80 static void print_input_section (asection
*);
81 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
82 static void lang_record_phdrs (void);
83 static void lang_do_version_exports_section (void);
84 static void lang_finalize_version_expr_head
85 (struct bfd_elf_version_expr_head
*);
87 /* Exported variables. */
88 lang_output_section_statement_type
*abs_output_section
;
89 lang_statement_list_type lang_output_section_statement
;
90 lang_statement_list_type
*stat_ptr
= &statement_list
;
91 lang_statement_list_type file_chain
= { NULL
, NULL
};
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
;
918 case lang_input_file_is_symbols_only_enum
:
920 p
->is_archive
= FALSE
;
922 p
->local_sym_name
= name
;
923 p
->just_syms_flag
= TRUE
;
924 p
->search_dirs_flag
= FALSE
;
926 case lang_input_file_is_fake_enum
:
928 p
->is_archive
= FALSE
;
930 p
->local_sym_name
= name
;
931 p
->just_syms_flag
= FALSE
;
932 p
->search_dirs_flag
= FALSE
;
934 case lang_input_file_is_l_enum
:
935 p
->is_archive
= TRUE
;
938 p
->local_sym_name
= concat ("-l", name
, NULL
);
939 p
->just_syms_flag
= FALSE
;
940 p
->search_dirs_flag
= TRUE
;
942 case lang_input_file_is_marker_enum
:
944 p
->is_archive
= FALSE
;
946 p
->local_sym_name
= name
;
947 p
->just_syms_flag
= FALSE
;
948 p
->search_dirs_flag
= TRUE
;
950 case lang_input_file_is_search_file_enum
:
951 p
->sysrooted
= ldlang_sysrooted_script
;
953 p
->is_archive
= FALSE
;
955 p
->local_sym_name
= name
;
956 p
->just_syms_flag
= FALSE
;
957 p
->search_dirs_flag
= TRUE
;
959 case lang_input_file_is_file_enum
:
961 p
->is_archive
= FALSE
;
963 p
->local_sym_name
= name
;
964 p
->just_syms_flag
= FALSE
;
965 p
->search_dirs_flag
= FALSE
;
972 p
->next_real_file
= NULL
;
975 p
->dynamic
= config
.dynamic_link
;
976 p
->add_needed
= add_needed
;
977 p
->as_needed
= as_needed
;
978 p
->whole_archive
= whole_archive
;
980 lang_statement_append (&input_file_chain
,
981 (lang_statement_union_type
*) p
,
986 lang_input_statement_type
*
987 lang_add_input_file (const char *name
,
988 lang_input_file_enum_type file_type
,
991 lang_has_input_file
= TRUE
;
992 return new_afile (name
, file_type
, target
, TRUE
);
995 struct out_section_hash_entry
997 struct bfd_hash_entry root
;
998 lang_statement_union_type s
;
1001 /* The hash table. */
1003 static struct bfd_hash_table output_section_statement_table
;
1005 /* Support routines for the hash table used by lang_output_section_find,
1006 initialize the table, fill in an entry and remove the table. */
1008 static struct bfd_hash_entry
*
1009 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1010 struct bfd_hash_table
*table
,
1013 lang_output_section_statement_type
**nextp
;
1014 struct out_section_hash_entry
*ret
;
1018 entry
= bfd_hash_allocate (table
, sizeof (*ret
));
1023 entry
= bfd_hash_newfunc (entry
, table
, string
);
1027 ret
= (struct out_section_hash_entry
*) entry
;
1028 memset (&ret
->s
, 0, sizeof (ret
->s
));
1029 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1030 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1031 ret
->s
.output_section_statement
.section_alignment
= -1;
1032 ret
->s
.output_section_statement
.block_value
= 1;
1033 lang_list_init (&ret
->s
.output_section_statement
.children
);
1034 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1036 /* For every output section statement added to the list, except the
1037 first one, lang_output_section_statement.tail points to the "next"
1038 field of the last element of the list. */
1039 if (lang_output_section_statement
.head
!= NULL
)
1040 ret
->s
.output_section_statement
.prev
1041 = ((lang_output_section_statement_type
*)
1042 ((char *) lang_output_section_statement
.tail
1043 - offsetof (lang_output_section_statement_type
, next
)));
1045 /* GCC's strict aliasing rules prevent us from just casting the
1046 address, so we store the pointer in a variable and cast that
1048 nextp
= &ret
->s
.output_section_statement
.next
;
1049 lang_statement_append (&lang_output_section_statement
,
1051 (lang_statement_union_type
**) nextp
);
1056 output_section_statement_table_init (void)
1058 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1059 output_section_statement_newfunc
,
1060 sizeof (struct out_section_hash_entry
),
1062 einfo (_("%P%F: can not create hash table: %E\n"));
1066 output_section_statement_table_free (void)
1068 bfd_hash_table_free (&output_section_statement_table
);
1071 /* Build enough state so that the parser can build its tree. */
1076 obstack_begin (&stat_obstack
, 1000);
1078 stat_ptr
= &statement_list
;
1080 output_section_statement_table_init ();
1082 lang_list_init (stat_ptr
);
1084 lang_list_init (&input_file_chain
);
1085 lang_list_init (&lang_output_section_statement
);
1086 lang_list_init (&file_chain
);
1087 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1089 abs_output_section
=
1090 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
1092 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1094 /* The value "3" is ad-hoc, somewhat related to the expected number of
1095 DEFINED expressions in a linker script. For most default linker
1096 scripts, there are none. Why a hash table then? Well, it's somewhat
1097 simpler to re-use working machinery than using a linked list in terms
1098 of code-complexity here in ld, besides the initialization which just
1099 looks like other code here. */
1100 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1101 lang_definedness_newfunc
,
1102 sizeof (struct lang_definedness_hash_entry
),
1104 einfo (_("%P%F: can not create hash table: %E\n"));
1110 output_section_statement_table_free ();
1113 /*----------------------------------------------------------------------
1114 A region is an area of memory declared with the
1115 MEMORY { name:org=exp, len=exp ... }
1118 We maintain a list of all the regions here.
1120 If no regions are specified in the script, then the default is used
1121 which is created when looked up to be the entire data space.
1123 If create is true we are creating a region inside a MEMORY block.
1124 In this case it is probably an error to create a region that has
1125 already been created. If we are not inside a MEMORY block it is
1126 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1127 and so we issue a warning. */
1129 static lang_memory_region_type
*lang_memory_region_list
;
1130 static lang_memory_region_type
**lang_memory_region_list_tail
1131 = &lang_memory_region_list
;
1133 lang_memory_region_type
*
1134 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1136 lang_memory_region_type
*p
;
1137 lang_memory_region_type
*new;
1139 /* NAME is NULL for LMA memspecs if no region was specified. */
1143 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1144 if (strcmp (p
->name
, name
) == 0)
1147 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1152 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1153 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
1155 new = stat_alloc (sizeof (lang_memory_region_type
));
1157 new->name
= xstrdup (name
);
1160 new->length
= ~(bfd_size_type
) 0;
1162 new->last_os
= NULL
;
1165 new->had_full_message
= FALSE
;
1167 *lang_memory_region_list_tail
= new;
1168 lang_memory_region_list_tail
= &new->next
;
1173 static lang_memory_region_type
*
1174 lang_memory_default (asection
*section
)
1176 lang_memory_region_type
*p
;
1178 flagword sec_flags
= section
->flags
;
1180 /* Override SEC_DATA to mean a writable section. */
1181 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1182 sec_flags
|= SEC_DATA
;
1184 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1186 if ((p
->flags
& sec_flags
) != 0
1187 && (p
->not_flags
& sec_flags
) == 0)
1192 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1195 lang_output_section_statement_type
*
1196 lang_output_section_find (const char *const name
)
1198 struct out_section_hash_entry
*entry
;
1201 entry
= ((struct out_section_hash_entry
*)
1202 bfd_hash_lookup (&output_section_statement_table
, name
,
1207 hash
= entry
->root
.hash
;
1210 if (entry
->s
.output_section_statement
.constraint
!= -1)
1211 return &entry
->s
.output_section_statement
;
1212 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1214 while (entry
!= NULL
1215 && entry
->root
.hash
== hash
1216 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1221 static lang_output_section_statement_type
*
1222 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1224 struct out_section_hash_entry
*entry
;
1225 struct out_section_hash_entry
*last_ent
;
1228 entry
= ((struct out_section_hash_entry
*)
1229 bfd_hash_lookup (&output_section_statement_table
, name
,
1233 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1237 if (entry
->s
.output_section_statement
.name
!= NULL
)
1239 /* We have a section of this name, but it might not have the correct
1241 hash
= entry
->root
.hash
;
1244 if (entry
->s
.output_section_statement
.constraint
!= -1
1246 || (constraint
== entry
->s
.output_section_statement
.constraint
1247 && constraint
!= SPECIAL
)))
1248 return &entry
->s
.output_section_statement
;
1250 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1252 while (entry
!= NULL
1253 && entry
->root
.hash
== hash
1254 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1257 = ((struct out_section_hash_entry
*)
1258 output_section_statement_newfunc (NULL
,
1259 &output_section_statement_table
,
1263 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1266 entry
->root
= last_ent
->root
;
1267 last_ent
->root
.next
= &entry
->root
;
1270 entry
->s
.output_section_statement
.name
= name
;
1271 entry
->s
.output_section_statement
.constraint
= constraint
;
1272 return &entry
->s
.output_section_statement
;
1275 lang_output_section_statement_type
*
1276 lang_output_section_statement_lookup (const char *const name
)
1278 return lang_output_section_statement_lookup_1 (name
, 0);
1281 /* A variant of lang_output_section_find used by place_orphan.
1282 Returns the output statement that should precede a new output
1283 statement for SEC. If an exact match is found on certain flags,
1286 lang_output_section_statement_type
*
1287 lang_output_section_find_by_flags (const asection
*sec
,
1288 lang_output_section_statement_type
**exact
,
1289 lang_match_sec_type_func match_type
)
1291 lang_output_section_statement_type
*first
, *look
, *found
;
1294 /* We know the first statement on this list is *ABS*. May as well
1296 first
= &lang_output_section_statement
.head
->output_section_statement
;
1297 first
= first
->next
;
1299 /* First try for an exact match. */
1301 for (look
= first
; look
; look
= look
->next
)
1303 flags
= look
->flags
;
1304 if (look
->bfd_section
!= NULL
)
1306 flags
= look
->bfd_section
->flags
;
1307 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1311 flags
^= sec
->flags
;
1312 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1313 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1323 if (sec
->flags
& SEC_CODE
)
1325 /* Try for a rw code section. */
1326 for (look
= first
; look
; look
= look
->next
)
1328 flags
= look
->flags
;
1329 if (look
->bfd_section
!= NULL
)
1331 flags
= look
->bfd_section
->flags
;
1332 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1336 flags
^= sec
->flags
;
1337 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1338 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1342 else if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1344 /* .rodata can go after .text, .sdata2 after .rodata. */
1345 for (look
= first
; look
; look
= look
->next
)
1347 flags
= look
->flags
;
1348 if (look
->bfd_section
!= NULL
)
1350 flags
= look
->bfd_section
->flags
;
1351 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1355 flags
^= sec
->flags
;
1356 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1358 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1362 else if (sec
->flags
& SEC_SMALL_DATA
)
1364 /* .sdata goes after .data, .sbss after .sdata. */
1365 for (look
= first
; look
; look
= look
->next
)
1367 flags
= look
->flags
;
1368 if (look
->bfd_section
!= NULL
)
1370 flags
= look
->bfd_section
->flags
;
1371 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1375 flags
^= sec
->flags
;
1376 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1377 | SEC_THREAD_LOCAL
))
1378 || ((look
->flags
& SEC_SMALL_DATA
)
1379 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1383 else if (sec
->flags
& SEC_HAS_CONTENTS
)
1385 /* .data goes after .rodata. */
1386 for (look
= first
; look
; look
= look
->next
)
1388 flags
= look
->flags
;
1389 if (look
->bfd_section
!= NULL
)
1391 flags
= look
->bfd_section
->flags
;
1392 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1396 flags
^= sec
->flags
;
1397 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1398 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1404 /* .bss goes last. */
1405 for (look
= first
; look
; look
= look
->next
)
1407 flags
= look
->flags
;
1408 if (look
->bfd_section
!= NULL
)
1410 flags
= look
->bfd_section
->flags
;
1411 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1415 flags
^= sec
->flags
;
1416 if (!(flags
& SEC_ALLOC
))
1421 if (found
|| !match_type
)
1424 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1427 /* Find the last output section before given output statement.
1428 Used by place_orphan. */
1431 output_prev_sec_find (lang_output_section_statement_type
*os
)
1433 lang_output_section_statement_type
*lookup
;
1435 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1437 if (lookup
->constraint
== -1)
1440 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1441 return lookup
->bfd_section
;
1447 lang_output_section_statement_type
*
1448 lang_insert_orphan (asection
*s
,
1449 const char *secname
,
1450 lang_output_section_statement_type
*after
,
1451 struct orphan_save
*place
,
1452 etree_type
*address
,
1453 lang_statement_list_type
*add_child
)
1455 lang_statement_list_type
*old
;
1456 lang_statement_list_type add
;
1458 lang_output_section_statement_type
*os
;
1459 lang_output_section_statement_type
**os_tail
;
1461 /* Start building a list of statements for this section.
1462 First save the current statement pointer. */
1465 /* If we have found an appropriate place for the output section
1466 statements for this orphan, add them to our own private list,
1467 inserting them later into the global statement list. */
1471 lang_list_init (stat_ptr
);
1475 if (config
.build_constructors
)
1477 /* If the name of the section is representable in C, then create
1478 symbols to mark the start and the end of the section. */
1479 for (ps
= secname
; *ps
!= '\0'; ps
++)
1480 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1485 etree_type
*e_align
;
1487 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1488 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1489 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1490 e_align
= exp_unop (ALIGN_K
,
1491 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1492 lang_add_assignment (exp_assop ('=', ".", e_align
));
1493 lang_add_assignment (exp_assop ('=', symname
,
1494 exp_nameop (NAME
, ".")));
1498 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1499 address
= exp_intop (0);
1501 os_tail
= ((lang_output_section_statement_type
**)
1502 lang_output_section_statement
.tail
);
1503 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1506 if (add_child
== NULL
)
1507 add_child
= &os
->children
;
1508 lang_add_section (add_child
, s
, os
);
1510 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1512 if (config
.build_constructors
&& *ps
== '\0')
1516 /* lang_leave_ouput_section_statement resets stat_ptr.
1517 Put stat_ptr back where we want it. */
1521 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1522 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1523 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1524 lang_add_assignment (exp_assop ('=', symname
,
1525 exp_nameop (NAME
, ".")));
1528 /* Restore the global list pointer. */
1532 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1534 asection
*snew
, *as
;
1536 snew
= os
->bfd_section
;
1538 /* Shuffle the bfd section list to make the output file look
1539 neater. This is really only cosmetic. */
1540 if (place
->section
== NULL
1541 && after
!= (&lang_output_section_statement
.head
1542 ->output_section_statement
))
1544 asection
*bfd_section
= after
->bfd_section
;
1546 /* If the output statement hasn't been used to place any input
1547 sections (and thus doesn't have an output bfd_section),
1548 look for the closest prior output statement having an
1550 if (bfd_section
== NULL
)
1551 bfd_section
= output_prev_sec_find (after
);
1553 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1554 place
->section
= &bfd_section
->next
;
1557 if (place
->section
== NULL
)
1558 place
->section
= &output_bfd
->sections
;
1560 as
= *place
->section
;
1564 /* Put the section at the end of the list. */
1566 /* Unlink the section. */
1567 bfd_section_list_remove (output_bfd
, snew
);
1569 /* Now tack it back on in the right place. */
1570 bfd_section_list_append (output_bfd
, snew
);
1572 else if (as
!= snew
&& as
->prev
!= snew
)
1574 /* Unlink the section. */
1575 bfd_section_list_remove (output_bfd
, snew
);
1577 /* Now tack it back on in the right place. */
1578 bfd_section_list_insert_before (output_bfd
, as
, snew
);
1581 /* Save the end of this list. Further ophans of this type will
1582 follow the one we've just added. */
1583 place
->section
= &snew
->next
;
1585 /* The following is non-cosmetic. We try to put the output
1586 statements in some sort of reasonable order here, because they
1587 determine the final load addresses of the orphan sections.
1588 In addition, placing output statements in the wrong order may
1589 require extra segments. For instance, given a typical
1590 situation of all read-only sections placed in one segment and
1591 following that a segment containing all the read-write
1592 sections, we wouldn't want to place an orphan read/write
1593 section before or amongst the read-only ones. */
1594 if (add
.head
!= NULL
)
1596 lang_output_section_statement_type
*newly_added_os
;
1598 if (place
->stmt
== NULL
)
1600 lang_statement_union_type
**where
;
1601 lang_statement_union_type
**assign
= NULL
;
1602 bfd_boolean ignore_first
;
1604 /* Look for a suitable place for the new statement list.
1605 The idea is to skip over anything that might be inside
1606 a SECTIONS {} statement in a script, before we find
1607 another output_section_statement. Assignments to "dot"
1608 before an output section statement are assumed to
1609 belong to it. An exception to this rule is made for
1610 the first assignment to dot, otherwise we might put an
1611 orphan before . = . + SIZEOF_HEADERS or similar
1612 assignments that set the initial address. */
1614 ignore_first
= after
== (&lang_output_section_statement
.head
1615 ->output_section_statement
);
1616 for (where
= &after
->header
.next
;
1618 where
= &(*where
)->header
.next
)
1620 switch ((*where
)->header
.type
)
1622 case lang_assignment_statement_enum
:
1625 lang_assignment_statement_type
*ass
;
1626 ass
= &(*where
)->assignment_statement
;
1627 if (ass
->exp
->type
.node_class
!= etree_assert
1628 && ass
->exp
->assign
.dst
[0] == '.'
1629 && ass
->exp
->assign
.dst
[1] == 0
1633 ignore_first
= FALSE
;
1635 case lang_wild_statement_enum
:
1636 case lang_input_section_enum
:
1637 case lang_object_symbols_statement_enum
:
1638 case lang_fill_statement_enum
:
1639 case lang_data_statement_enum
:
1640 case lang_reloc_statement_enum
:
1641 case lang_padding_statement_enum
:
1642 case lang_constructors_statement_enum
:
1645 case lang_output_section_statement_enum
:
1648 case lang_input_statement_enum
:
1649 case lang_address_statement_enum
:
1650 case lang_target_statement_enum
:
1651 case lang_output_statement_enum
:
1652 case lang_group_statement_enum
:
1653 case lang_afile_asection_pair_statement_enum
:
1662 place
->os_tail
= &after
->next
;
1666 /* Put it after the last orphan statement we added. */
1667 *add
.tail
= *place
->stmt
;
1668 *place
->stmt
= add
.head
;
1671 /* Fix the global list pointer if we happened to tack our
1672 new list at the tail. */
1673 if (*old
->tail
== add
.head
)
1674 old
->tail
= add
.tail
;
1676 /* Save the end of this list. */
1677 place
->stmt
= add
.tail
;
1679 /* Do the same for the list of output section statements. */
1680 newly_added_os
= *os_tail
;
1682 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1683 ((char *) place
->os_tail
1684 - offsetof (lang_output_section_statement_type
, next
));
1685 newly_added_os
->next
= *place
->os_tail
;
1686 if (newly_added_os
->next
!= NULL
)
1687 newly_added_os
->next
->prev
= newly_added_os
;
1688 *place
->os_tail
= newly_added_os
;
1689 place
->os_tail
= &newly_added_os
->next
;
1691 /* Fixing the global list pointer here is a little different.
1692 We added to the list in lang_enter_output_section_statement,
1693 trimmed off the new output_section_statment above when
1694 assigning *os_tail = NULL, but possibly added it back in
1695 the same place when assigning *place->os_tail. */
1696 if (*os_tail
== NULL
)
1697 lang_output_section_statement
.tail
1698 = (lang_statement_union_type
**) os_tail
;
1705 lang_map_flags (flagword flag
)
1707 if (flag
& SEC_ALLOC
)
1710 if (flag
& SEC_CODE
)
1713 if (flag
& SEC_READONLY
)
1716 if (flag
& SEC_DATA
)
1719 if (flag
& SEC_LOAD
)
1726 lang_memory_region_type
*m
;
1727 bfd_boolean dis_header_printed
= FALSE
;
1730 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1734 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1735 || file
->just_syms_flag
)
1738 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1739 if ((s
->output_section
== NULL
1740 || s
->output_section
->owner
!= output_bfd
)
1741 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1743 if (! dis_header_printed
)
1745 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1746 dis_header_printed
= TRUE
;
1749 print_input_section (s
);
1753 minfo (_("\nMemory Configuration\n\n"));
1754 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1755 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1757 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1762 fprintf (config
.map_file
, "%-16s ", m
->name
);
1764 sprintf_vma (buf
, m
->origin
);
1765 minfo ("0x%s ", buf
);
1773 minfo ("0x%V", m
->length
);
1774 if (m
->flags
|| m
->not_flags
)
1782 lang_map_flags (m
->flags
);
1788 lang_map_flags (m
->not_flags
);
1795 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1797 if (! link_info
.reduce_memory_overheads
)
1799 obstack_begin (&map_obstack
, 1000);
1800 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1801 bfd_map_over_sections (p
, init_map_userdata
, 0);
1802 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1804 print_statements ();
1808 init_map_userdata (abfd
, sec
, data
)
1809 bfd
*abfd ATTRIBUTE_UNUSED
;
1811 void *data ATTRIBUTE_UNUSED
;
1813 fat_section_userdata_type
*new_data
1814 = ((fat_section_userdata_type
*) (stat_alloc
1815 (sizeof (fat_section_userdata_type
))));
1817 ASSERT (get_userdata (sec
) == NULL
);
1818 get_userdata (sec
) = new_data
;
1819 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1823 sort_def_symbol (hash_entry
, info
)
1824 struct bfd_link_hash_entry
*hash_entry
;
1825 void *info ATTRIBUTE_UNUSED
;
1827 if (hash_entry
->type
== bfd_link_hash_defined
1828 || hash_entry
->type
== bfd_link_hash_defweak
)
1830 struct fat_user_section_struct
*ud
;
1831 struct map_symbol_def
*def
;
1833 ud
= get_userdata (hash_entry
->u
.def
.section
);
1836 /* ??? What do we have to do to initialize this beforehand? */
1837 /* The first time we get here is bfd_abs_section... */
1838 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1839 ud
= get_userdata (hash_entry
->u
.def
.section
);
1841 else if (!ud
->map_symbol_def_tail
)
1842 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1844 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1845 def
->entry
= hash_entry
;
1846 *(ud
->map_symbol_def_tail
) = def
;
1847 ud
->map_symbol_def_tail
= &def
->next
;
1852 /* Initialize an output section. */
1855 init_os (lang_output_section_statement_type
*s
, asection
*isec
,
1858 if (s
->bfd_section
!= NULL
)
1861 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1862 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1864 s
->bfd_section
= bfd_get_section_by_name (output_bfd
, s
->name
);
1865 if (s
->bfd_section
== NULL
)
1866 s
->bfd_section
= bfd_make_section_with_flags (output_bfd
, s
->name
,
1868 if (s
->bfd_section
== NULL
)
1870 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1871 output_bfd
->xvec
->name
, s
->name
);
1873 s
->bfd_section
->output_section
= s
->bfd_section
;
1874 s
->bfd_section
->output_offset
= 0;
1876 if (!link_info
.reduce_memory_overheads
)
1878 fat_section_userdata_type
*new
1879 = stat_alloc (sizeof (fat_section_userdata_type
));
1880 memset (new, 0, sizeof (fat_section_userdata_type
));
1881 get_userdata (s
->bfd_section
) = new;
1884 /* If there is a base address, make sure that any sections it might
1885 mention are initialized. */
1886 if (s
->addr_tree
!= NULL
)
1887 exp_init_os (s
->addr_tree
);
1889 if (s
->load_base
!= NULL
)
1890 exp_init_os (s
->load_base
);
1892 /* If supplied an alignment, set it. */
1893 if (s
->section_alignment
!= -1)
1894 s
->bfd_section
->alignment_power
= s
->section_alignment
;
1897 bfd_init_private_section_data (isec
->owner
, isec
,
1898 output_bfd
, s
->bfd_section
,
1902 /* Make sure that all output sections mentioned in an expression are
1906 exp_init_os (etree_type
*exp
)
1908 switch (exp
->type
.node_class
)
1912 exp_init_os (exp
->assign
.src
);
1916 exp_init_os (exp
->binary
.lhs
);
1917 exp_init_os (exp
->binary
.rhs
);
1921 exp_init_os (exp
->trinary
.cond
);
1922 exp_init_os (exp
->trinary
.lhs
);
1923 exp_init_os (exp
->trinary
.rhs
);
1927 exp_init_os (exp
->assert_s
.child
);
1931 exp_init_os (exp
->unary
.child
);
1935 switch (exp
->type
.node_code
)
1941 lang_output_section_statement_type
*os
;
1943 os
= lang_output_section_find (exp
->name
.name
);
1944 if (os
!= NULL
&& os
->bfd_section
== NULL
)
1945 init_os (os
, NULL
, 0);
1956 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
1958 lang_input_statement_type
*entry
= data
;
1960 /* If we are only reading symbols from this object, then we want to
1961 discard all sections. */
1962 if (entry
->just_syms_flag
)
1964 bfd_link_just_syms (abfd
, sec
, &link_info
);
1968 if (!(abfd
->flags
& DYNAMIC
))
1969 bfd_section_already_linked (abfd
, sec
, &link_info
);
1972 /* The wild routines.
1974 These expand statements like *(.text) and foo.o to a list of
1975 explicit actions, like foo.o(.text), bar.o(.text) and
1976 foo.o(.text, .data). */
1978 /* Add SECTION to the output section OUTPUT. Do this by creating a
1979 lang_input_section statement which is placed at PTR. FILE is the
1980 input file which holds SECTION. */
1983 lang_add_section (lang_statement_list_type
*ptr
,
1985 lang_output_section_statement_type
*output
)
1987 flagword flags
= section
->flags
;
1988 bfd_boolean discard
;
1990 /* Discard sections marked with SEC_EXCLUDE. */
1991 discard
= (flags
& SEC_EXCLUDE
) != 0;
1993 /* Discard input sections which are assigned to a section named
1994 DISCARD_SECTION_NAME. */
1995 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
1998 /* Discard debugging sections if we are stripping debugging
2000 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2001 && (flags
& SEC_DEBUGGING
) != 0)
2006 if (section
->output_section
== NULL
)
2008 /* This prevents future calls from assigning this section. */
2009 section
->output_section
= bfd_abs_section_ptr
;
2014 if (section
->output_section
== NULL
)
2017 lang_input_section_type
*new;
2020 flags
= section
->flags
;
2022 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2023 to an output section, because we want to be able to include a
2024 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2025 section (I don't know why we want to do this, but we do).
2026 build_link_order in ldwrite.c handles this case by turning
2027 the embedded SEC_NEVER_LOAD section into a fill. */
2029 flags
&= ~ SEC_NEVER_LOAD
;
2031 switch (output
->sectype
)
2033 case normal_section
:
2035 case noalloc_section
:
2036 flags
&= ~SEC_ALLOC
;
2038 case noload_section
:
2040 flags
|= SEC_NEVER_LOAD
;
2044 if (output
->bfd_section
== NULL
)
2045 init_os (output
, section
, flags
);
2047 first
= ! output
->bfd_section
->linker_has_input
;
2048 output
->bfd_section
->linker_has_input
= 1;
2050 if (!link_info
.relocatable
2051 && !stripped_excluded_sections
)
2053 asection
*s
= output
->bfd_section
->map_tail
.s
;
2054 output
->bfd_section
->map_tail
.s
= section
;
2055 section
->map_head
.s
= NULL
;
2056 section
->map_tail
.s
= s
;
2058 s
->map_head
.s
= section
;
2060 output
->bfd_section
->map_head
.s
= section
;
2063 /* Add a section reference to the list. */
2064 new = new_stat (lang_input_section
, ptr
);
2066 new->section
= section
;
2067 section
->output_section
= output
->bfd_section
;
2069 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2070 already been processed. One reason to do this is that on pe
2071 format targets, .text$foo sections go into .text and it's odd
2072 to see .text with SEC_LINK_ONCE set. */
2074 if (! link_info
.relocatable
)
2075 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
2077 /* If this is not the first input section, and the SEC_READONLY
2078 flag is not currently set, then don't set it just because the
2079 input section has it set. */
2081 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
2082 flags
&= ~ SEC_READONLY
;
2084 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2086 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2087 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2088 || ((flags
& SEC_MERGE
)
2089 && output
->bfd_section
->entsize
!= section
->entsize
)))
2091 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2092 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2095 output
->bfd_section
->flags
|= flags
;
2097 if (flags
& SEC_MERGE
)
2098 output
->bfd_section
->entsize
= section
->entsize
;
2100 /* If SEC_READONLY is not set in the input section, then clear
2101 it from the output section. */
2102 if ((section
->flags
& SEC_READONLY
) == 0)
2103 output
->bfd_section
->flags
&= ~SEC_READONLY
;
2105 /* Copy over SEC_SMALL_DATA. */
2106 if (section
->flags
& SEC_SMALL_DATA
)
2107 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
2109 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2110 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2112 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
2113 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
2115 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
2116 /* FIXME: This value should really be obtained from the bfd... */
2117 output
->block_value
= 128;
2122 /* Handle wildcard sorting. This returns the lang_input_section which
2123 should follow the one we are going to create for SECTION and FILE,
2124 based on the sorting requirements of WILD. It returns NULL if the
2125 new section should just go at the end of the current list. */
2127 static lang_statement_union_type
*
2128 wild_sort (lang_wild_statement_type
*wild
,
2129 struct wildcard_list
*sec
,
2130 lang_input_statement_type
*file
,
2133 const char *section_name
;
2134 lang_statement_union_type
*l
;
2136 if (!wild
->filenames_sorted
2137 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2140 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2141 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2143 lang_input_section_type
*ls
;
2145 if (l
->header
.type
!= lang_input_section_enum
)
2147 ls
= &l
->input_section
;
2149 /* Sorting by filename takes precedence over sorting by section
2152 if (wild
->filenames_sorted
)
2154 const char *fn
, *ln
;
2158 /* The PE support for the .idata section as generated by
2159 dlltool assumes that files will be sorted by the name of
2160 the archive and then the name of the file within the
2163 if (file
->the_bfd
!= NULL
2164 && bfd_my_archive (file
->the_bfd
) != NULL
)
2166 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2171 fn
= file
->filename
;
2175 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2177 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2182 ln
= ls
->section
->owner
->filename
;
2186 i
= strcmp (fn
, ln
);
2195 fn
= file
->filename
;
2197 ln
= ls
->section
->owner
->filename
;
2199 i
= strcmp (fn
, ln
);
2207 /* Here either the files are not sorted by name, or we are
2208 looking at the sections for this file. */
2210 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2211 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2218 /* Expand a wild statement for a particular FILE. SECTION may be
2219 NULL, in which case it is a wild card. */
2222 output_section_callback (lang_wild_statement_type
*ptr
,
2223 struct wildcard_list
*sec
,
2225 lang_input_statement_type
*file
,
2228 lang_statement_union_type
*before
;
2230 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2231 if (unique_section_p (section
))
2234 before
= wild_sort (ptr
, sec
, file
, section
);
2236 /* Here BEFORE points to the lang_input_section which
2237 should follow the one we are about to add. If BEFORE
2238 is NULL, then the section should just go at the end
2239 of the current list. */
2242 lang_add_section (&ptr
->children
, section
,
2243 (lang_output_section_statement_type
*) output
);
2246 lang_statement_list_type list
;
2247 lang_statement_union_type
**pp
;
2249 lang_list_init (&list
);
2250 lang_add_section (&list
, section
,
2251 (lang_output_section_statement_type
*) output
);
2253 /* If we are discarding the section, LIST.HEAD will
2255 if (list
.head
!= NULL
)
2257 ASSERT (list
.head
->header
.next
== NULL
);
2259 for (pp
= &ptr
->children
.head
;
2261 pp
= &(*pp
)->header
.next
)
2262 ASSERT (*pp
!= NULL
);
2264 list
.head
->header
.next
= *pp
;
2270 /* Check if all sections in a wild statement for a particular FILE
2274 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2275 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2277 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2280 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2281 if (unique_section_p (section
))
2284 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2285 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2288 /* This is passed a file name which must have been seen already and
2289 added to the statement tree. We will see if it has been opened
2290 already and had its symbols read. If not then we'll read it. */
2292 static lang_input_statement_type
*
2293 lookup_name (const char *name
)
2295 lang_input_statement_type
*search
;
2297 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2299 search
= (lang_input_statement_type
*) search
->next_real_file
)
2301 /* Use the local_sym_name as the name of the file that has
2302 already been loaded as filename might have been transformed
2303 via the search directory lookup mechanism. */
2304 const char *filename
= search
->local_sym_name
;
2306 if (filename
!= NULL
2307 && strcmp (filename
, name
) == 0)
2312 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2313 default_target
, FALSE
);
2315 /* If we have already added this file, or this file is not real
2316 don't add this file. */
2317 if (search
->loaded
|| !search
->real
)
2320 if (! load_symbols (search
, NULL
))
2326 /* Save LIST as a list of libraries whose symbols should not be exported. */
2331 struct excluded_lib
*next
;
2333 static struct excluded_lib
*excluded_libs
;
2336 add_excluded_libs (const char *list
)
2338 const char *p
= list
, *end
;
2342 struct excluded_lib
*entry
;
2343 end
= strpbrk (p
, ",:");
2345 end
= p
+ strlen (p
);
2346 entry
= xmalloc (sizeof (*entry
));
2347 entry
->next
= excluded_libs
;
2348 entry
->name
= xmalloc (end
- p
+ 1);
2349 memcpy (entry
->name
, p
, end
- p
);
2350 entry
->name
[end
- p
] = '\0';
2351 excluded_libs
= entry
;
2359 check_excluded_libs (bfd
*abfd
)
2361 struct excluded_lib
*lib
= excluded_libs
;
2365 int len
= strlen (lib
->name
);
2366 const char *filename
= lbasename (abfd
->filename
);
2368 if (strcmp (lib
->name
, "ALL") == 0)
2370 abfd
->no_export
= TRUE
;
2374 if (strncmp (lib
->name
, filename
, len
) == 0
2375 && (filename
[len
] == '\0'
2376 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2377 && filename
[len
+ 2] == '\0')))
2379 abfd
->no_export
= TRUE
;
2387 /* Get the symbols for an input file. */
2390 load_symbols (lang_input_statement_type
*entry
,
2391 lang_statement_list_type
*place
)
2398 ldfile_open_file (entry
);
2400 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2401 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2404 lang_statement_list_type
*hold
;
2405 bfd_boolean bad_load
= TRUE
;
2406 bfd_boolean save_ldlang_sysrooted_script
;
2407 bfd_boolean save_as_needed
, save_add_needed
;
2409 err
= bfd_get_error ();
2411 /* See if the emulation has some special knowledge. */
2412 if (ldemul_unrecognized_file (entry
))
2415 if (err
== bfd_error_file_ambiguously_recognized
)
2419 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2420 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2421 for (p
= matching
; *p
!= NULL
; p
++)
2425 else if (err
!= bfd_error_file_not_recognized
2427 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2431 bfd_close (entry
->the_bfd
);
2432 entry
->the_bfd
= NULL
;
2434 /* Try to interpret the file as a linker script. */
2435 ldfile_open_command_file (entry
->filename
);
2439 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2440 ldlang_sysrooted_script
= entry
->sysrooted
;
2441 save_as_needed
= as_needed
;
2442 as_needed
= entry
->as_needed
;
2443 save_add_needed
= add_needed
;
2444 add_needed
= entry
->add_needed
;
2446 ldfile_assumed_script
= TRUE
;
2447 parser_input
= input_script
;
2448 /* We want to use the same -Bdynamic/-Bstatic as the one for
2450 config
.dynamic_link
= entry
->dynamic
;
2452 ldfile_assumed_script
= FALSE
;
2454 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2455 as_needed
= save_as_needed
;
2456 add_needed
= save_add_needed
;
2462 if (ldemul_recognized_file (entry
))
2465 /* We don't call ldlang_add_file for an archive. Instead, the
2466 add_symbols entry point will call ldlang_add_file, via the
2467 add_archive_element callback, for each element of the archive
2469 switch (bfd_get_format (entry
->the_bfd
))
2475 ldlang_add_file (entry
);
2476 if (trace_files
|| trace_file_tries
)
2477 info_msg ("%I\n", entry
);
2481 check_excluded_libs (entry
->the_bfd
);
2483 if (entry
->whole_archive
)
2486 bfd_boolean loaded
= TRUE
;
2490 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2495 if (! bfd_check_format (member
, bfd_object
))
2497 einfo (_("%F%B: member %B in archive is not an object\n"),
2498 entry
->the_bfd
, member
);
2502 if (! ((*link_info
.callbacks
->add_archive_element
)
2503 (&link_info
, member
, "--whole-archive")))
2506 if (! bfd_link_add_symbols (member
, &link_info
))
2508 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2513 entry
->loaded
= loaded
;
2519 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2520 entry
->loaded
= TRUE
;
2522 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2524 return entry
->loaded
;
2527 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2528 may be NULL, indicating that it is a wildcard. Separate
2529 lang_input_section statements are created for each part of the
2530 expansion; they are added after the wild statement S. OUTPUT is
2531 the output section. */
2534 wild (lang_wild_statement_type
*s
,
2535 const char *target ATTRIBUTE_UNUSED
,
2536 lang_output_section_statement_type
*output
)
2538 struct wildcard_list
*sec
;
2540 if (s
->handler_data
[0]
2541 && s
->handler_data
[0]->spec
.sorted
== by_name
2542 && !s
->filenames_sorted
)
2544 lang_section_bst_type
*tree
;
2546 walk_wild (s
, output_section_callback_fast
, output
);
2551 output_section_callback_tree_to_list (s
, tree
, output
);
2556 walk_wild (s
, output_section_callback
, output
);
2558 if (default_common_section
== NULL
)
2559 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2560 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2562 /* Remember the section that common is going to in case we
2563 later get something which doesn't know where to put it. */
2564 default_common_section
= output
;
2569 /* Return TRUE iff target is the sought target. */
2572 get_target (const bfd_target
*target
, void *data
)
2574 const char *sought
= data
;
2576 return strcmp (target
->name
, sought
) == 0;
2579 /* Like strcpy() but convert to lower case as well. */
2582 stricpy (char *dest
, char *src
)
2586 while ((c
= *src
++) != 0)
2587 *dest
++ = TOLOWER (c
);
2592 /* Remove the first occurrence of needle (if any) in haystack
2596 strcut (char *haystack
, char *needle
)
2598 haystack
= strstr (haystack
, needle
);
2604 for (src
= haystack
+ strlen (needle
); *src
;)
2605 *haystack
++ = *src
++;
2611 /* Compare two target format name strings.
2612 Return a value indicating how "similar" they are. */
2615 name_compare (char *first
, char *second
)
2621 copy1
= xmalloc (strlen (first
) + 1);
2622 copy2
= xmalloc (strlen (second
) + 1);
2624 /* Convert the names to lower case. */
2625 stricpy (copy1
, first
);
2626 stricpy (copy2
, second
);
2628 /* Remove size and endian strings from the name. */
2629 strcut (copy1
, "big");
2630 strcut (copy1
, "little");
2631 strcut (copy2
, "big");
2632 strcut (copy2
, "little");
2634 /* Return a value based on how many characters match,
2635 starting from the beginning. If both strings are
2636 the same then return 10 * their length. */
2637 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2638 if (copy1
[result
] == 0)
2650 /* Set by closest_target_match() below. */
2651 static const bfd_target
*winner
;
2653 /* Scan all the valid bfd targets looking for one that has the endianness
2654 requirement that was specified on the command line, and is the nearest
2655 match to the original output target. */
2658 closest_target_match (const bfd_target
*target
, void *data
)
2660 const bfd_target
*original
= data
;
2662 if (command_line
.endian
== ENDIAN_BIG
2663 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2666 if (command_line
.endian
== ENDIAN_LITTLE
2667 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2670 /* Must be the same flavour. */
2671 if (target
->flavour
!= original
->flavour
)
2674 /* If we have not found a potential winner yet, then record this one. */
2681 /* Oh dear, we now have two potential candidates for a successful match.
2682 Compare their names and choose the better one. */
2683 if (name_compare (target
->name
, original
->name
)
2684 > name_compare (winner
->name
, original
->name
))
2687 /* Keep on searching until wqe have checked them all. */
2691 /* Return the BFD target format of the first input file. */
2694 get_first_input_target (void)
2696 char *target
= NULL
;
2698 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2700 if (s
->header
.type
== lang_input_statement_enum
2703 ldfile_open_file (s
);
2705 if (s
->the_bfd
!= NULL
2706 && bfd_check_format (s
->the_bfd
, bfd_object
))
2708 target
= bfd_get_target (s
->the_bfd
);
2720 lang_get_output_target (void)
2724 /* Has the user told us which output format to use? */
2725 if (output_target
!= NULL
)
2726 return output_target
;
2728 /* No - has the current target been set to something other than
2730 if (current_target
!= default_target
)
2731 return current_target
;
2733 /* No - can we determine the format of the first input file? */
2734 target
= get_first_input_target ();
2738 /* Failed - use the default output target. */
2739 return default_target
;
2742 /* Open the output file. */
2745 open_output (const char *name
)
2749 output_target
= lang_get_output_target ();
2751 /* Has the user requested a particular endianness on the command
2753 if (command_line
.endian
!= ENDIAN_UNSET
)
2755 const bfd_target
*target
;
2756 enum bfd_endian desired_endian
;
2758 /* Get the chosen target. */
2759 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2761 /* If the target is not supported, we cannot do anything. */
2764 if (command_line
.endian
== ENDIAN_BIG
)
2765 desired_endian
= BFD_ENDIAN_BIG
;
2767 desired_endian
= BFD_ENDIAN_LITTLE
;
2769 /* See if the target has the wrong endianness. This should
2770 not happen if the linker script has provided big and
2771 little endian alternatives, but some scrips don't do
2773 if (target
->byteorder
!= desired_endian
)
2775 /* If it does, then see if the target provides
2776 an alternative with the correct endianness. */
2777 if (target
->alternative_target
!= NULL
2778 && (target
->alternative_target
->byteorder
== desired_endian
))
2779 output_target
= target
->alternative_target
->name
;
2782 /* Try to find a target as similar as possible to
2783 the default target, but which has the desired
2784 endian characteristic. */
2785 bfd_search_for_target (closest_target_match
,
2788 /* Oh dear - we could not find any targets that
2789 satisfy our requirements. */
2791 einfo (_("%P: warning: could not find any targets"
2792 " that match endianness requirement\n"));
2794 output_target
= winner
->name
;
2800 output
= bfd_openw (name
, output_target
);
2804 if (bfd_get_error () == bfd_error_invalid_target
)
2805 einfo (_("%P%F: target %s not found\n"), output_target
);
2807 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2810 delete_output_file_on_failure
= TRUE
;
2812 if (! bfd_set_format (output
, bfd_object
))
2813 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2814 if (! bfd_set_arch_mach (output
,
2815 ldfile_output_architecture
,
2816 ldfile_output_machine
))
2817 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2819 link_info
.hash
= bfd_link_hash_table_create (output
);
2820 if (link_info
.hash
== NULL
)
2821 einfo (_("%P%F: can not create hash table: %E\n"));
2823 bfd_set_gp_size (output
, g_switch_value
);
2828 ldlang_open_output (lang_statement_union_type
*statement
)
2830 switch (statement
->header
.type
)
2832 case lang_output_statement_enum
:
2833 ASSERT (output_bfd
== NULL
);
2834 output_bfd
= open_output (statement
->output_statement
.name
);
2835 ldemul_set_output_arch ();
2836 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2837 output_bfd
->flags
|= D_PAGED
;
2839 output_bfd
->flags
&= ~D_PAGED
;
2840 if (config
.text_read_only
)
2841 output_bfd
->flags
|= WP_TEXT
;
2843 output_bfd
->flags
&= ~WP_TEXT
;
2844 if (link_info
.traditional_format
)
2845 output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2847 output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2850 case lang_target_statement_enum
:
2851 current_target
= statement
->target_statement
.target
;
2858 /* Convert between addresses in bytes and sizes in octets.
2859 For currently supported targets, octets_per_byte is always a power
2860 of two, so we can use shifts. */
2861 #define TO_ADDR(X) ((X) >> opb_shift)
2862 #define TO_SIZE(X) ((X) << opb_shift)
2864 /* Support the above. */
2865 static unsigned int opb_shift
= 0;
2870 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2871 ldfile_output_machine
);
2874 while ((x
& 1) == 0)
2882 /* Open all the input files. */
2885 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2887 for (; s
!= NULL
; s
= s
->header
.next
)
2889 switch (s
->header
.type
)
2891 case lang_constructors_statement_enum
:
2892 open_input_bfds (constructor_list
.head
, force
);
2894 case lang_output_section_statement_enum
:
2895 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2897 case lang_wild_statement_enum
:
2898 /* Maybe we should load the file's symbols. */
2899 if (s
->wild_statement
.filename
2900 && ! wildcardp (s
->wild_statement
.filename
))
2901 lookup_name (s
->wild_statement
.filename
);
2902 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2904 case lang_group_statement_enum
:
2906 struct bfd_link_hash_entry
*undefs
;
2908 /* We must continually search the entries in the group
2909 until no new symbols are added to the list of undefined
2914 undefs
= link_info
.hash
->undefs_tail
;
2915 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2917 while (undefs
!= link_info
.hash
->undefs_tail
);
2920 case lang_target_statement_enum
:
2921 current_target
= s
->target_statement
.target
;
2923 case lang_input_statement_enum
:
2924 if (s
->input_statement
.real
)
2926 lang_statement_list_type add
;
2928 s
->input_statement
.target
= current_target
;
2930 /* If we are being called from within a group, and this
2931 is an archive which has already been searched, then
2932 force it to be researched unless the whole archive
2933 has been loaded already. */
2935 && !s
->input_statement
.whole_archive
2936 && s
->input_statement
.loaded
2937 && bfd_check_format (s
->input_statement
.the_bfd
,
2939 s
->input_statement
.loaded
= FALSE
;
2941 lang_list_init (&add
);
2943 if (! load_symbols (&s
->input_statement
, &add
))
2944 config
.make_executable
= FALSE
;
2946 if (add
.head
!= NULL
)
2948 *add
.tail
= s
->header
.next
;
2949 s
->header
.next
= add
.head
;
2959 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2962 lang_track_definedness (const char *name
)
2964 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2965 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2968 /* New-function for the definedness hash table. */
2970 static struct bfd_hash_entry
*
2971 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2972 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2973 const char *name ATTRIBUTE_UNUSED
)
2975 struct lang_definedness_hash_entry
*ret
2976 = (struct lang_definedness_hash_entry
*) entry
;
2979 ret
= (struct lang_definedness_hash_entry
*)
2980 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
2983 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
2985 ret
->iteration
= -1;
2989 /* Return the iteration when the definition of NAME was last updated. A
2990 value of -1 means that the symbol is not defined in the linker script
2991 or the command line, but may be defined in the linker symbol table. */
2994 lang_symbol_definition_iteration (const char *name
)
2996 struct lang_definedness_hash_entry
*defentry
2997 = (struct lang_definedness_hash_entry
*)
2998 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3000 /* We've already created this one on the presence of DEFINED in the
3001 script, so it can't be NULL unless something is borked elsewhere in
3003 if (defentry
== NULL
)
3006 return defentry
->iteration
;
3009 /* Update the definedness state of NAME. */
3012 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3014 struct lang_definedness_hash_entry
*defentry
3015 = (struct lang_definedness_hash_entry
*)
3016 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3018 /* We don't keep track of symbols not tested with DEFINED. */
3019 if (defentry
== NULL
)
3022 /* If the symbol was already defined, and not from an earlier statement
3023 iteration, don't update the definedness iteration, because that'd
3024 make the symbol seem defined in the linker script at this point, and
3025 it wasn't; it was defined in some object. If we do anyway, DEFINED
3026 would start to yield false before this point and the construct "sym =
3027 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3029 if (h
->type
!= bfd_link_hash_undefined
3030 && h
->type
!= bfd_link_hash_common
3031 && h
->type
!= bfd_link_hash_new
3032 && defentry
->iteration
== -1)
3035 defentry
->iteration
= lang_statement_iteration
;
3038 /* Add the supplied name to the symbol table as an undefined reference.
3039 This is a two step process as the symbol table doesn't even exist at
3040 the time the ld command line is processed. First we put the name
3041 on a list, then, once the output file has been opened, transfer the
3042 name to the symbol table. */
3044 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3046 #define ldlang_undef_chain_list_head entry_symbol.next
3049 ldlang_add_undef (const char *const name
)
3051 ldlang_undef_chain_list_type
*new =
3052 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
3054 new->next
= ldlang_undef_chain_list_head
;
3055 ldlang_undef_chain_list_head
= new;
3057 new->name
= xstrdup (name
);
3059 if (output_bfd
!= NULL
)
3060 insert_undefined (new->name
);
3063 /* Insert NAME as undefined in the symbol table. */
3066 insert_undefined (const char *name
)
3068 struct bfd_link_hash_entry
*h
;
3070 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3072 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3073 if (h
->type
== bfd_link_hash_new
)
3075 h
->type
= bfd_link_hash_undefined
;
3076 h
->u
.undef
.abfd
= NULL
;
3077 bfd_link_add_undef (link_info
.hash
, h
);
3081 /* Run through the list of undefineds created above and place them
3082 into the linker hash table as undefined symbols belonging to the
3086 lang_place_undefineds (void)
3088 ldlang_undef_chain_list_type
*ptr
;
3090 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3091 insert_undefined (ptr
->name
);
3094 /* Check for all readonly or some readwrite sections. */
3097 check_input_sections
3098 (lang_statement_union_type
*s
,
3099 lang_output_section_statement_type
*output_section_statement
)
3101 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3103 switch (s
->header
.type
)
3105 case lang_wild_statement_enum
:
3106 walk_wild (&s
->wild_statement
, check_section_callback
,
3107 output_section_statement
);
3108 if (! output_section_statement
->all_input_readonly
)
3111 case lang_constructors_statement_enum
:
3112 check_input_sections (constructor_list
.head
,
3113 output_section_statement
);
3114 if (! output_section_statement
->all_input_readonly
)
3117 case lang_group_statement_enum
:
3118 check_input_sections (s
->group_statement
.children
.head
,
3119 output_section_statement
);
3120 if (! output_section_statement
->all_input_readonly
)
3129 /* Update wildcard statements if needed. */
3132 update_wild_statements (lang_statement_union_type
*s
)
3134 struct wildcard_list
*sec
;
3136 switch (sort_section
)
3146 for (; s
!= NULL
; s
= s
->header
.next
)
3148 switch (s
->header
.type
)
3153 case lang_wild_statement_enum
:
3154 sec
= s
->wild_statement
.section_list
;
3155 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3158 switch (sec
->spec
.sorted
)
3161 sec
->spec
.sorted
= sort_section
;
3164 if (sort_section
== by_alignment
)
3165 sec
->spec
.sorted
= by_name_alignment
;
3168 if (sort_section
== by_name
)
3169 sec
->spec
.sorted
= by_alignment_name
;
3177 case lang_constructors_statement_enum
:
3178 update_wild_statements (constructor_list
.head
);
3181 case lang_output_section_statement_enum
:
3182 update_wild_statements
3183 (s
->output_section_statement
.children
.head
);
3186 case lang_group_statement_enum
:
3187 update_wild_statements (s
->group_statement
.children
.head
);
3195 /* Open input files and attach to output sections. */
3198 map_input_to_output_sections
3199 (lang_statement_union_type
*s
, const char *target
,
3200 lang_output_section_statement_type
*os
)
3204 for (; s
!= NULL
; s
= s
->header
.next
)
3206 switch (s
->header
.type
)
3208 case lang_wild_statement_enum
:
3209 wild (&s
->wild_statement
, target
, os
);
3211 case lang_constructors_statement_enum
:
3212 map_input_to_output_sections (constructor_list
.head
,
3216 case lang_output_section_statement_enum
:
3217 if (s
->output_section_statement
.constraint
)
3219 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3220 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3222 s
->output_section_statement
.all_input_readonly
= TRUE
;
3223 check_input_sections (s
->output_section_statement
.children
.head
,
3224 &s
->output_section_statement
);
3225 if ((s
->output_section_statement
.all_input_readonly
3226 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3227 || (!s
->output_section_statement
.all_input_readonly
3228 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3230 s
->output_section_statement
.constraint
= -1;
3235 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3237 &s
->output_section_statement
);
3239 case lang_output_statement_enum
:
3241 case lang_target_statement_enum
:
3242 target
= s
->target_statement
.target
;
3244 case lang_group_statement_enum
:
3245 map_input_to_output_sections (s
->group_statement
.children
.head
,
3249 case lang_data_statement_enum
:
3250 /* Make sure that any sections mentioned in the expression
3252 exp_init_os (s
->data_statement
.exp
);
3253 flags
= SEC_HAS_CONTENTS
;
3254 /* The output section gets contents, and then we inspect for
3255 any flags set in the input script which override any ALLOC. */
3256 if (!(os
->flags
& SEC_NEVER_LOAD
))
3257 flags
|= SEC_ALLOC
| SEC_LOAD
;
3258 if (os
->bfd_section
== NULL
)
3259 init_os (os
, NULL
, flags
);
3261 os
->bfd_section
->flags
|= flags
;
3263 case lang_input_section_enum
:
3265 case lang_fill_statement_enum
:
3266 case lang_object_symbols_statement_enum
:
3267 case lang_reloc_statement_enum
:
3268 case lang_padding_statement_enum
:
3269 case lang_input_statement_enum
:
3270 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3271 init_os (os
, NULL
, 0);
3273 case lang_assignment_statement_enum
:
3274 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3275 init_os (os
, NULL
, 0);
3277 /* Make sure that any sections mentioned in the assignment
3279 exp_init_os (s
->assignment_statement
.exp
);
3281 case lang_afile_asection_pair_statement_enum
:
3284 case lang_address_statement_enum
:
3285 /* Mark the specified section with the supplied address.
3287 If this section was actually a segment marker, then the
3288 directive is ignored if the linker script explicitly
3289 processed the segment marker. Originally, the linker
3290 treated segment directives (like -Ttext on the
3291 command-line) as section directives. We honor the
3292 section directive semantics for backwards compatibilty;
3293 linker scripts that do not specifically check for
3294 SEGMENT_START automatically get the old semantics. */
3295 if (!s
->address_statement
.segment
3296 || !s
->address_statement
.segment
->used
)
3298 lang_output_section_statement_type
*aos
3299 = (lang_output_section_statement_lookup
3300 (s
->address_statement
.section_name
));
3302 if (aos
->bfd_section
== NULL
)
3303 init_os (aos
, NULL
, 0);
3304 aos
->addr_tree
= s
->address_statement
.address
;
3311 /* An output section might have been removed after its statement was
3312 added. For example, ldemul_before_allocation can remove dynamic
3313 sections if they turn out to be not needed. Clean them up here. */
3316 strip_excluded_output_sections (void)
3318 lang_output_section_statement_type
*os
;
3320 /* Run lang_size_sections (if not already done). */
3321 if (expld
.phase
!= lang_mark_phase_enum
)
3323 expld
.phase
= lang_mark_phase_enum
;
3324 expld
.dataseg
.phase
= exp_dataseg_none
;
3325 one_lang_size_sections_pass (NULL
, FALSE
);
3326 lang_reset_memory_regions ();
3329 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3333 asection
*output_section
;
3334 bfd_boolean exclude
;
3336 if (os
->constraint
== -1)
3339 output_section
= os
->bfd_section
;
3340 if (output_section
== NULL
)
3343 exclude
= (output_section
->rawsize
== 0
3344 && (output_section
->flags
& SEC_KEEP
) == 0
3345 && !bfd_section_removed_from_list (output_bfd
,
3348 /* Some sections have not yet been sized, notably .gnu.version,
3349 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3350 input sections, so don't drop output sections that have such
3351 input sections unless they are also marked SEC_EXCLUDE. */
3352 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3356 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3357 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3358 && (s
->flags
& SEC_EXCLUDE
) == 0)
3365 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3366 output_section
->map_head
.link_order
= NULL
;
3367 output_section
->map_tail
.link_order
= NULL
;
3371 /* We don't set bfd_section to NULL since bfd_section of the
3372 removed output section statement may still be used. */
3373 if (!os
->section_relative_symbol
)
3375 output_section
->flags
|= SEC_EXCLUDE
;
3376 bfd_section_list_remove (output_bfd
, output_section
);
3377 output_bfd
->section_count
--;
3381 /* Stop future calls to lang_add_section from messing with map_head
3382 and map_tail link_order fields. */
3383 stripped_excluded_sections
= TRUE
;
3387 print_output_section_statement
3388 (lang_output_section_statement_type
*output_section_statement
)
3390 asection
*section
= output_section_statement
->bfd_section
;
3393 if (output_section_statement
!= abs_output_section
)
3395 minfo ("\n%s", output_section_statement
->name
);
3397 if (section
!= NULL
)
3399 print_dot
= section
->vma
;
3401 len
= strlen (output_section_statement
->name
);
3402 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3407 while (len
< SECTION_NAME_MAP_LENGTH
)
3413 minfo ("0x%V %W", section
->vma
, section
->size
);
3415 if (section
->vma
!= section
->lma
)
3416 minfo (_(" load address 0x%V"), section
->lma
);
3422 print_statement_list (output_section_statement
->children
.head
,
3423 output_section_statement
);
3426 /* Scan for the use of the destination in the right hand side
3427 of an expression. In such cases we will not compute the
3428 correct expression, since the value of DST that is used on
3429 the right hand side will be its final value, not its value
3430 just before this expression is evaluated. */
3433 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3435 if (rhs
== NULL
|| dst
== NULL
)
3438 switch (rhs
->type
.node_class
)
3441 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3442 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3445 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3446 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3449 case etree_provided
:
3451 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3453 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3456 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3460 return strcmp (dst
, rhs
->value
.str
) == 0;
3465 return strcmp (dst
, rhs
->name
.name
) == 0;
3477 print_assignment (lang_assignment_statement_type
*assignment
,
3478 lang_output_section_statement_type
*output_section
)
3482 bfd_boolean computation_is_valid
= TRUE
;
3485 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3488 if (assignment
->exp
->type
.node_class
== etree_assert
)
3491 tree
= assignment
->exp
->assert_s
.child
;
3492 computation_is_valid
= TRUE
;
3496 const char *dst
= assignment
->exp
->assign
.dst
;
3498 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3499 tree
= assignment
->exp
->assign
.src
;
3500 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3503 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3504 if (expld
.result
.valid_p
)
3508 if (computation_is_valid
)
3510 value
= expld
.result
.value
;
3512 if (expld
.result
.section
)
3513 value
+= expld
.result
.section
->vma
;
3515 minfo ("0x%V", value
);
3521 struct bfd_link_hash_entry
*h
;
3523 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3524 FALSE
, FALSE
, TRUE
);
3527 value
= h
->u
.def
.value
;
3529 if (expld
.result
.section
)
3530 value
+= expld
.result
.section
->vma
;
3532 minfo ("[0x%V]", value
);
3535 minfo ("[unresolved]");
3547 exp_print_tree (assignment
->exp
);
3552 print_input_statement (lang_input_statement_type
*statm
)
3554 if (statm
->filename
!= NULL
)
3556 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3560 /* Print all symbols defined in a particular section. This is called
3561 via bfd_link_hash_traverse, or by print_all_symbols. */
3564 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3566 asection
*sec
= ptr
;
3568 if ((hash_entry
->type
== bfd_link_hash_defined
3569 || hash_entry
->type
== bfd_link_hash_defweak
)
3570 && sec
== hash_entry
->u
.def
.section
)
3574 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3577 (hash_entry
->u
.def
.value
3578 + hash_entry
->u
.def
.section
->output_offset
3579 + hash_entry
->u
.def
.section
->output_section
->vma
));
3581 minfo (" %T\n", hash_entry
->root
.string
);
3588 print_all_symbols (asection
*sec
)
3590 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3591 struct map_symbol_def
*def
;
3596 *ud
->map_symbol_def_tail
= 0;
3597 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3598 print_one_symbol (def
->entry
, sec
);
3601 /* Print information about an input section to the map file. */
3604 print_input_section (asection
*i
)
3606 bfd_size_type size
= i
->size
;
3613 minfo ("%s", i
->name
);
3615 len
= 1 + strlen (i
->name
);
3616 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3621 while (len
< SECTION_NAME_MAP_LENGTH
)
3627 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3628 addr
= i
->output_section
->vma
+ i
->output_offset
;
3635 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3637 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3639 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3651 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3654 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3656 if (link_info
.reduce_memory_overheads
)
3657 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3659 print_all_symbols (i
);
3661 print_dot
= addr
+ TO_ADDR (size
);
3666 print_fill_statement (lang_fill_statement_type
*fill
)
3670 fputs (" FILL mask 0x", config
.map_file
);
3671 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3672 fprintf (config
.map_file
, "%02x", *p
);
3673 fputs ("\n", config
.map_file
);
3677 print_data_statement (lang_data_statement_type
*data
)
3685 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3688 addr
= data
->output_offset
;
3689 if (data
->output_section
!= NULL
)
3690 addr
+= data
->output_section
->vma
;
3718 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3720 if (data
->exp
->type
.node_class
!= etree_value
)
3723 exp_print_tree (data
->exp
);
3728 print_dot
= addr
+ TO_ADDR (size
);
3731 /* Print an address statement. These are generated by options like
3735 print_address_statement (lang_address_statement_type
*address
)
3737 minfo (_("Address of section %s set to "), address
->section_name
);
3738 exp_print_tree (address
->address
);
3742 /* Print a reloc statement. */
3745 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3752 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3755 addr
= reloc
->output_offset
;
3756 if (reloc
->output_section
!= NULL
)
3757 addr
+= reloc
->output_section
->vma
;
3759 size
= bfd_get_reloc_size (reloc
->howto
);
3761 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3763 if (reloc
->name
!= NULL
)
3764 minfo ("%s+", reloc
->name
);
3766 minfo ("%s+", reloc
->section
->name
);
3768 exp_print_tree (reloc
->addend_exp
);
3772 print_dot
= addr
+ TO_ADDR (size
);
3776 print_padding_statement (lang_padding_statement_type
*s
)
3784 len
= sizeof " *fill*" - 1;
3785 while (len
< SECTION_NAME_MAP_LENGTH
)
3791 addr
= s
->output_offset
;
3792 if (s
->output_section
!= NULL
)
3793 addr
+= s
->output_section
->vma
;
3794 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3796 if (s
->fill
->size
!= 0)
3800 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3801 fprintf (config
.map_file
, "%02x", *p
);
3806 print_dot
= addr
+ TO_ADDR (s
->size
);
3810 print_wild_statement (lang_wild_statement_type
*w
,
3811 lang_output_section_statement_type
*os
)
3813 struct wildcard_list
*sec
;
3817 if (w
->filenames_sorted
)
3819 if (w
->filename
!= NULL
)
3820 minfo ("%s", w
->filename
);
3823 if (w
->filenames_sorted
)
3827 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
3829 if (sec
->spec
.sorted
)
3831 if (sec
->spec
.exclude_name_list
!= NULL
)
3834 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
3835 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
3836 minfo (" %s", tmp
->name
);
3839 if (sec
->spec
.name
!= NULL
)
3840 minfo ("%s", sec
->spec
.name
);
3843 if (sec
->spec
.sorted
)
3852 print_statement_list (w
->children
.head
, os
);
3855 /* Print a group statement. */
3858 print_group (lang_group_statement_type
*s
,
3859 lang_output_section_statement_type
*os
)
3861 fprintf (config
.map_file
, "START GROUP\n");
3862 print_statement_list (s
->children
.head
, os
);
3863 fprintf (config
.map_file
, "END GROUP\n");
3866 /* Print the list of statements in S.
3867 This can be called for any statement type. */
3870 print_statement_list (lang_statement_union_type
*s
,
3871 lang_output_section_statement_type
*os
)
3875 print_statement (s
, os
);
3880 /* Print the first statement in statement list S.
3881 This can be called for any statement type. */
3884 print_statement (lang_statement_union_type
*s
,
3885 lang_output_section_statement_type
*os
)
3887 switch (s
->header
.type
)
3890 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
3893 case lang_constructors_statement_enum
:
3894 if (constructor_list
.head
!= NULL
)
3896 if (constructors_sorted
)
3897 minfo (" SORT (CONSTRUCTORS)\n");
3899 minfo (" CONSTRUCTORS\n");
3900 print_statement_list (constructor_list
.head
, os
);
3903 case lang_wild_statement_enum
:
3904 print_wild_statement (&s
->wild_statement
, os
);
3906 case lang_address_statement_enum
:
3907 print_address_statement (&s
->address_statement
);
3909 case lang_object_symbols_statement_enum
:
3910 minfo (" CREATE_OBJECT_SYMBOLS\n");
3912 case lang_fill_statement_enum
:
3913 print_fill_statement (&s
->fill_statement
);
3915 case lang_data_statement_enum
:
3916 print_data_statement (&s
->data_statement
);
3918 case lang_reloc_statement_enum
:
3919 print_reloc_statement (&s
->reloc_statement
);
3921 case lang_input_section_enum
:
3922 print_input_section (s
->input_section
.section
);
3924 case lang_padding_statement_enum
:
3925 print_padding_statement (&s
->padding_statement
);
3927 case lang_output_section_statement_enum
:
3928 print_output_section_statement (&s
->output_section_statement
);
3930 case lang_assignment_statement_enum
:
3931 print_assignment (&s
->assignment_statement
, os
);
3933 case lang_target_statement_enum
:
3934 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
3936 case lang_output_statement_enum
:
3937 minfo ("OUTPUT(%s", s
->output_statement
.name
);
3938 if (output_target
!= NULL
)
3939 minfo (" %s", output_target
);
3942 case lang_input_statement_enum
:
3943 print_input_statement (&s
->input_statement
);
3945 case lang_group_statement_enum
:
3946 print_group (&s
->group_statement
, os
);
3948 case lang_afile_asection_pair_statement_enum
:
3955 print_statements (void)
3957 print_statement_list (statement_list
.head
, abs_output_section
);
3960 /* Print the first N statements in statement list S to STDERR.
3961 If N == 0, nothing is printed.
3962 If N < 0, the entire list is printed.
3963 Intended to be called from GDB. */
3966 dprint_statement (lang_statement_union_type
*s
, int n
)
3968 FILE *map_save
= config
.map_file
;
3970 config
.map_file
= stderr
;
3973 print_statement_list (s
, abs_output_section
);
3976 while (s
&& --n
>= 0)
3978 print_statement (s
, abs_output_section
);
3983 config
.map_file
= map_save
;
3987 insert_pad (lang_statement_union_type
**ptr
,
3989 unsigned int alignment_needed
,
3990 asection
*output_section
,
3993 static fill_type zero_fill
= { 1, { 0 } };
3994 lang_statement_union_type
*pad
= NULL
;
3996 if (ptr
!= &statement_list
.head
)
3997 pad
= ((lang_statement_union_type
*)
3998 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4000 && pad
->header
.type
== lang_padding_statement_enum
4001 && pad
->padding_statement
.output_section
== output_section
)
4003 /* Use the existing pad statement. */
4005 else if ((pad
= *ptr
) != NULL
4006 && pad
->header
.type
== lang_padding_statement_enum
4007 && pad
->padding_statement
.output_section
== output_section
)
4009 /* Use the existing pad statement. */
4013 /* Make a new padding statement, linked into existing chain. */
4014 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
4015 pad
->header
.next
= *ptr
;
4017 pad
->header
.type
= lang_padding_statement_enum
;
4018 pad
->padding_statement
.output_section
= output_section
;
4021 pad
->padding_statement
.fill
= fill
;
4023 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4024 pad
->padding_statement
.size
= alignment_needed
;
4025 output_section
->size
+= alignment_needed
;
4028 /* Work out how much this section will move the dot point. */
4032 (lang_statement_union_type
**this_ptr
,
4033 lang_output_section_statement_type
*output_section_statement
,
4037 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4038 asection
*i
= is
->section
;
4040 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4041 && (i
->flags
& SEC_EXCLUDE
) == 0)
4043 unsigned int alignment_needed
;
4046 /* Align this section first to the input sections requirement,
4047 then to the output section's requirement. If this alignment
4048 is greater than any seen before, then record it too. Perform
4049 the alignment by inserting a magic 'padding' statement. */
4051 if (output_section_statement
->subsection_alignment
!= -1)
4052 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4054 o
= output_section_statement
->bfd_section
;
4055 if (o
->alignment_power
< i
->alignment_power
)
4056 o
->alignment_power
= i
->alignment_power
;
4058 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4060 if (alignment_needed
!= 0)
4062 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4063 dot
+= alignment_needed
;
4066 /* Remember where in the output section this input section goes. */
4068 i
->output_offset
= dot
- o
->vma
;
4070 /* Mark how big the output section must be to contain this now. */
4071 dot
+= TO_ADDR (i
->size
);
4072 o
->size
= TO_SIZE (dot
- o
->vma
);
4076 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4083 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4085 const asection
*sec1
= *(const asection
**) arg1
;
4086 const asection
*sec2
= *(const asection
**) arg2
;
4088 if (bfd_section_lma (sec1
->owner
, sec1
)
4089 < bfd_section_lma (sec2
->owner
, sec2
))
4091 else if (bfd_section_lma (sec1
->owner
, sec1
)
4092 > bfd_section_lma (sec2
->owner
, sec2
))
4098 #define IGNORE_SECTION(s) \
4099 ((s->flags & SEC_NEVER_LOAD) != 0 \
4100 || (s->flags & SEC_ALLOC) == 0 \
4101 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4102 && (s->flags & SEC_LOAD) == 0))
4104 /* Check to see if any allocated sections overlap with other allocated
4105 sections. This can happen if a linker script specifies the output
4106 section addresses of the two sections. */
4109 lang_check_section_addresses (void)
4112 asection
**sections
, **spp
;
4120 if (bfd_count_sections (output_bfd
) <= 1)
4123 amt
= bfd_count_sections (output_bfd
) * sizeof (asection
*);
4124 sections
= xmalloc (amt
);
4126 /* Scan all sections in the output list. */
4128 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4130 /* Only consider loadable sections with real contents. */
4131 if (IGNORE_SECTION (s
) || s
->size
== 0)
4134 sections
[count
] = s
;
4141 qsort (sections
, (size_t) count
, sizeof (asection
*),
4142 sort_sections_by_lma
);
4146 s_start
= bfd_section_lma (output_bfd
, s
);
4147 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4148 for (count
--; count
; count
--)
4150 /* We must check the sections' LMA addresses not their VMA
4151 addresses because overlay sections can have overlapping VMAs
4152 but they must have distinct LMAs. */
4157 s_start
= bfd_section_lma (output_bfd
, s
);
4158 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4160 /* Look for an overlap. */
4161 if (s_end
>= os_start
&& s_start
<= os_end
)
4162 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4163 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4169 /* Make sure the new address is within the region. We explicitly permit the
4170 current address to be at the exact end of the region when the address is
4171 non-zero, in case the region is at the end of addressable memory and the
4172 calculation wraps around. */
4175 os_region_check (lang_output_section_statement_type
*os
,
4176 lang_memory_region_type
*region
,
4180 if ((region
->current
< region
->origin
4181 || (region
->current
- region
->origin
> region
->length
))
4182 && ((region
->current
!= region
->origin
+ region
->length
)
4187 einfo (_("%X%P: address 0x%v of %B section %s"
4188 " is not within region %s\n"),
4190 os
->bfd_section
->owner
,
4191 os
->bfd_section
->name
,
4196 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4198 os
->bfd_section
->owner
,
4199 os
->bfd_section
->name
);
4201 /* Reset the region pointer. */
4202 region
->current
= region
->origin
;
4206 /* Set the sizes for all the output sections. */
4209 lang_size_sections_1
4210 (lang_statement_union_type
*s
,
4211 lang_output_section_statement_type
*output_section_statement
,
4212 lang_statement_union_type
**prev
,
4216 bfd_boolean check_regions
)
4218 /* Size up the sections from their constituent parts. */
4219 for (; s
!= NULL
; s
= s
->header
.next
)
4221 switch (s
->header
.type
)
4223 case lang_output_section_statement_enum
:
4225 bfd_vma newdot
, after
;
4226 lang_output_section_statement_type
*os
;
4227 lang_memory_region_type
*r
;
4229 os
= &s
->output_section_statement
;
4230 if (os
->addr_tree
!= NULL
)
4232 os
->processed_vma
= FALSE
;
4233 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4235 if (!expld
.result
.valid_p
4236 && expld
.phase
!= lang_mark_phase_enum
)
4237 einfo (_("%F%S: non constant or forward reference"
4238 " address expression for section %s\n"),
4241 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4244 if (os
->bfd_section
== NULL
)
4245 /* This section was removed or never actually created. */
4248 /* If this is a COFF shared library section, use the size and
4249 address from the input section. FIXME: This is COFF
4250 specific; it would be cleaner if there were some other way
4251 to do this, but nothing simple comes to mind. */
4252 if ((bfd_get_flavour (output_bfd
) == bfd_target_ecoff_flavour
4253 || bfd_get_flavour (output_bfd
) == bfd_target_coff_flavour
)
4254 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4258 if (os
->children
.head
== NULL
4259 || os
->children
.head
->header
.next
!= NULL
4260 || (os
->children
.head
->header
.type
4261 != lang_input_section_enum
))
4262 einfo (_("%P%X: Internal error on COFF shared library"
4263 " section %s\n"), os
->name
);
4265 input
= os
->children
.head
->input_section
.section
;
4266 bfd_set_section_vma (os
->bfd_section
->owner
,
4268 bfd_section_vma (input
->owner
, input
));
4269 os
->bfd_section
->size
= input
->size
;
4274 if (bfd_is_abs_section (os
->bfd_section
))
4276 /* No matter what happens, an abs section starts at zero. */
4277 ASSERT (os
->bfd_section
->vma
== 0);
4283 if (os
->addr_tree
== NULL
)
4285 /* No address specified for this section, get one
4286 from the region specification. */
4287 if (os
->region
== NULL
4288 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4289 && os
->region
->name
[0] == '*'
4290 && strcmp (os
->region
->name
,
4291 DEFAULT_MEMORY_REGION
) == 0))
4293 os
->region
= lang_memory_default (os
->bfd_section
);
4296 /* If a loadable section is using the default memory
4297 region, and some non default memory regions were
4298 defined, issue an error message. */
4300 && !IGNORE_SECTION (os
->bfd_section
)
4301 && ! link_info
.relocatable
4303 && strcmp (os
->region
->name
,
4304 DEFAULT_MEMORY_REGION
) == 0
4305 && lang_memory_region_list
!= NULL
4306 && (strcmp (lang_memory_region_list
->name
,
4307 DEFAULT_MEMORY_REGION
) != 0
4308 || lang_memory_region_list
->next
!= NULL
)
4309 && expld
.phase
!= lang_mark_phase_enum
)
4311 /* By default this is an error rather than just a
4312 warning because if we allocate the section to the
4313 default memory region we can end up creating an
4314 excessively large binary, or even seg faulting when
4315 attempting to perform a negative seek. See
4316 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4317 for an example of this. This behaviour can be
4318 overridden by the using the --no-check-sections
4320 if (command_line
.check_section_addresses
)
4321 einfo (_("%P%F: error: no memory region specified"
4322 " for loadable section `%s'\n"),
4323 bfd_get_section_name (output_bfd
,
4326 einfo (_("%P: warning: no memory region specified"
4327 " for loadable section `%s'\n"),
4328 bfd_get_section_name (output_bfd
,
4332 newdot
= os
->region
->current
;
4333 align
= os
->bfd_section
->alignment_power
;
4336 align
= os
->section_alignment
;
4338 /* Align to what the section needs. */
4341 bfd_vma savedot
= newdot
;
4342 newdot
= align_power (newdot
, align
);
4344 if (newdot
!= savedot
4345 && (config
.warn_section_align
4346 || os
->addr_tree
!= NULL
)
4347 && expld
.phase
!= lang_mark_phase_enum
)
4348 einfo (_("%P: warning: changing start of section"
4349 " %s by %lu bytes\n"),
4350 os
->name
, (unsigned long) (newdot
- savedot
));
4353 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4355 os
->bfd_section
->output_offset
= 0;
4358 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4359 os
->fill
, newdot
, relax
, check_regions
);
4361 os
->processed_vma
= TRUE
;
4363 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4364 /* Except for some special linker created sections,
4365 no output section should change from zero size
4366 after strip_excluded_output_sections. A non-zero
4367 size on an ignored section indicates that some
4368 input section was not sized early enough. */
4369 ASSERT (os
->bfd_section
->size
== 0);
4372 dot
= os
->bfd_section
->vma
;
4374 /* Put the section within the requested block size, or
4375 align at the block boundary. */
4377 + TO_ADDR (os
->bfd_section
->size
)
4378 + os
->block_value
- 1)
4379 & - (bfd_vma
) os
->block_value
);
4381 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4384 /* Set section lma. */
4387 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4391 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4392 os
->bfd_section
->lma
= lma
;
4394 else if (os
->region
!= NULL
4395 && os
->lma_region
!= NULL
4396 && os
->lma_region
!= os
->region
)
4398 bfd_vma lma
= os
->lma_region
->current
;
4400 if (os
->section_alignment
!= -1)
4401 lma
= align_power (lma
, os
->section_alignment
);
4402 os
->bfd_section
->lma
= lma
;
4404 else if (r
->last_os
!= NULL
4405 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4410 last
= r
->last_os
->output_section_statement
.bfd_section
;
4412 /* A backwards move of dot should be accompanied by
4413 an explicit assignment to the section LMA (ie.
4414 os->load_base set) because backwards moves can
4415 create overlapping LMAs. */
4417 && os
->bfd_section
->size
!= 0
4418 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4420 /* If dot moved backwards then leave lma equal to
4421 vma. This is the old default lma, which might
4422 just happen to work when the backwards move is
4423 sufficiently large. Nag if this changes anything,
4424 so people can fix their linker scripts. */
4426 if (last
->vma
!= last
->lma
)
4427 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4432 /* If the current vma overlaps the previous section,
4433 then set the current lma to that at the end of
4434 the previous section. The previous section was
4435 probably an overlay. */
4436 if ((dot
>= last
->vma
4437 && dot
< last
->vma
+ last
->size
)
4438 || (last
->vma
>= dot
4439 && last
->vma
< dot
+ os
->bfd_section
->size
))
4440 lma
= last
->lma
+ last
->size
;
4442 /* Otherwise, keep the same lma to vma relationship
4443 as the previous section. */
4445 lma
= dot
+ last
->lma
- last
->vma
;
4447 if (os
->section_alignment
!= -1)
4448 lma
= align_power (lma
, os
->section_alignment
);
4449 os
->bfd_section
->lma
= lma
;
4452 os
->processed_lma
= TRUE
;
4454 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4457 /* Keep track of normal sections using the default
4458 lma region. We use this to set the lma for
4459 following sections. Overlays or other linker
4460 script assignment to lma might mean that the
4461 default lma == vma is incorrect.
4462 To avoid warnings about dot moving backwards when using
4463 -Ttext, don't start tracking sections until we find one
4464 of non-zero size or with lma set differently to vma. */
4465 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4466 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
4467 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
4468 && (os
->bfd_section
->size
!= 0
4469 || (r
->last_os
== NULL
4470 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
4471 || (r
->last_os
!= NULL
4472 && dot
>= (r
->last_os
->output_section_statement
4473 .bfd_section
->vma
)))
4474 && os
->lma_region
== NULL
4475 && !link_info
.relocatable
)
4478 /* .tbss sections effectively have zero size. */
4479 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4480 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4481 || link_info
.relocatable
)
4482 dot
+= TO_ADDR (os
->bfd_section
->size
);
4484 if (os
->update_dot_tree
!= 0)
4485 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4487 /* Update dot in the region ?
4488 We only do this if the section is going to be allocated,
4489 since unallocated sections do not contribute to the region's
4490 overall size in memory.
4492 If the SEC_NEVER_LOAD bit is not set, it will affect the
4493 addresses of sections after it. We have to update
4495 if (os
->region
!= NULL
4496 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4497 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4499 os
->region
->current
= dot
;
4502 /* Make sure the new address is within the region. */
4503 os_region_check (os
, os
->region
, os
->addr_tree
,
4504 os
->bfd_section
->vma
);
4506 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
)
4508 os
->lma_region
->current
4509 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
4512 os_region_check (os
, os
->lma_region
, NULL
,
4513 os
->bfd_section
->lma
);
4519 case lang_constructors_statement_enum
:
4520 dot
= lang_size_sections_1 (constructor_list
.head
,
4521 output_section_statement
,
4522 &s
->wild_statement
.children
.head
,
4523 fill
, dot
, relax
, check_regions
);
4526 case lang_data_statement_enum
:
4528 unsigned int size
= 0;
4530 s
->data_statement
.output_offset
=
4531 dot
- output_section_statement
->bfd_section
->vma
;
4532 s
->data_statement
.output_section
=
4533 output_section_statement
->bfd_section
;
4535 /* We might refer to provided symbols in the expression, and
4536 need to mark them as needed. */
4537 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4539 switch (s
->data_statement
.type
)
4557 if (size
< TO_SIZE ((unsigned) 1))
4558 size
= TO_SIZE ((unsigned) 1);
4559 dot
+= TO_ADDR (size
);
4560 output_section_statement
->bfd_section
->size
+= size
;
4564 case lang_reloc_statement_enum
:
4568 s
->reloc_statement
.output_offset
=
4569 dot
- output_section_statement
->bfd_section
->vma
;
4570 s
->reloc_statement
.output_section
=
4571 output_section_statement
->bfd_section
;
4572 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4573 dot
+= TO_ADDR (size
);
4574 output_section_statement
->bfd_section
->size
+= size
;
4578 case lang_wild_statement_enum
:
4579 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4580 output_section_statement
,
4581 &s
->wild_statement
.children
.head
,
4582 fill
, dot
, relax
, check_regions
);
4585 case lang_object_symbols_statement_enum
:
4586 link_info
.create_object_symbols_section
=
4587 output_section_statement
->bfd_section
;
4590 case lang_output_statement_enum
:
4591 case lang_target_statement_enum
:
4594 case lang_input_section_enum
:
4598 i
= (*prev
)->input_section
.section
;
4603 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4604 einfo (_("%P%F: can't relax section: %E\n"));
4608 dot
= size_input_section (prev
, output_section_statement
,
4609 output_section_statement
->fill
, dot
);
4613 case lang_input_statement_enum
:
4616 case lang_fill_statement_enum
:
4617 s
->fill_statement
.output_section
=
4618 output_section_statement
->bfd_section
;
4620 fill
= s
->fill_statement
.fill
;
4623 case lang_assignment_statement_enum
:
4625 bfd_vma newdot
= dot
;
4626 etree_type
*tree
= s
->assignment_statement
.exp
;
4628 exp_fold_tree (tree
,
4629 output_section_statement
->bfd_section
,
4632 /* This symbol is relative to this section. */
4633 if ((tree
->type
.node_class
== etree_provided
4634 || tree
->type
.node_class
== etree_assign
)
4635 && (tree
->assign
.dst
[0] != '.'
4636 || tree
->assign
.dst
[1] != '\0'))
4637 output_section_statement
->section_relative_symbol
= 1;
4639 if (!output_section_statement
->ignored
)
4641 if (output_section_statement
== abs_output_section
)
4643 /* If we don't have an output section, then just adjust
4644 the default memory address. */
4645 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4646 FALSE
)->current
= newdot
;
4648 else if (newdot
!= dot
)
4650 /* Insert a pad after this statement. We can't
4651 put the pad before when relaxing, in case the
4652 assignment references dot. */
4653 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4654 output_section_statement
->bfd_section
, dot
);
4656 /* Don't neuter the pad below when relaxing. */
4659 /* If dot is advanced, this implies that the section
4660 should have space allocated to it, unless the
4661 user has explicitly stated that the section
4662 should never be loaded. */
4663 if (!(output_section_statement
->flags
4664 & (SEC_NEVER_LOAD
| SEC_ALLOC
)))
4665 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4672 case lang_padding_statement_enum
:
4673 /* If this is the first time lang_size_sections is called,
4674 we won't have any padding statements. If this is the
4675 second or later passes when relaxing, we should allow
4676 padding to shrink. If padding is needed on this pass, it
4677 will be added back in. */
4678 s
->padding_statement
.size
= 0;
4680 /* Make sure output_offset is valid. If relaxation shrinks
4681 the section and this pad isn't needed, it's possible to
4682 have output_offset larger than the final size of the
4683 section. bfd_set_section_contents will complain even for
4684 a pad size of zero. */
4685 s
->padding_statement
.output_offset
4686 = dot
- output_section_statement
->bfd_section
->vma
;
4689 case lang_group_statement_enum
:
4690 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4691 output_section_statement
,
4692 &s
->group_statement
.children
.head
,
4693 fill
, dot
, relax
, check_regions
);
4700 /* We can only get here when relaxing is turned on. */
4701 case lang_address_statement_enum
:
4704 prev
= &s
->header
.next
;
4709 /* Callback routine that is used in _bfd_elf_map_sections_to_segments. */
4712 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
4713 bfd
* abfd ATTRIBUTE_UNUSED
,
4714 asection
* current_section
,
4715 asection
* previous_section
,
4716 bfd_boolean new_segment
)
4718 lang_output_section_statement_type
* cur
;
4719 lang_output_section_statement_type
* prev
;
4724 /* Paranoia checks. */
4725 if (current_section
== NULL
|| previous_section
== NULL
)
4728 /* Find the memory regions associated with the two sections.
4729 We call lang_output_section_find() here rather than scanning the list
4730 of output sections looking for a matching section pointer because if
4731 we have a large number of sections a hash lookup is faster. */
4732 cur
= lang_output_section_find (current_section
->name
);
4733 prev
= lang_output_section_find (previous_section
->name
);
4735 if (cur
== NULL
|| prev
== NULL
)
4738 /* If the regions are different then force the sections to live in
4739 different segments. See the email thread starting here for the
4740 reasons why this is necessary:
4741 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
4742 return cur
->region
!= prev
->region
;
4746 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
4748 lang_statement_iteration
++;
4749 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
4750 &statement_list
.head
, 0, 0, relax
, check_regions
);
4754 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
4756 expld
.phase
= lang_allocating_phase_enum
;
4757 expld
.dataseg
.phase
= exp_dataseg_none
;
4759 one_lang_size_sections_pass (relax
, check_regions
);
4760 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
4761 && link_info
.relro
&& expld
.dataseg
.relro_end
)
4763 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4764 to put expld.dataseg.relro on a (common) page boundary. */
4765 bfd_vma old_min_base
, relro_end
, maxpage
;
4767 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
4768 old_min_base
= expld
.dataseg
.min_base
;
4769 maxpage
= expld
.dataseg
.maxpagesize
;
4770 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
4771 & (expld
.dataseg
.pagesize
- 1));
4772 /* Compute the expected PT_GNU_RELRO segment end. */
4773 relro_end
= (expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
4774 & ~(expld
.dataseg
.pagesize
- 1);
4775 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
4777 expld
.dataseg
.base
-= maxpage
;
4778 relro_end
-= maxpage
;
4780 lang_reset_memory_regions ();
4781 one_lang_size_sections_pass (relax
, check_regions
);
4782 if (expld
.dataseg
.relro_end
> relro_end
)
4784 /* The alignment of sections between DATA_SEGMENT_ALIGN
4785 and DATA_SEGMENT_RELRO_END caused huge padding to be
4786 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4788 unsigned int max_alignment_power
= 0;
4790 /* Find maximum alignment power of sections between
4791 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4792 for (sec
= output_bfd
->sections
; sec
; sec
= sec
->next
)
4793 if (sec
->vma
>= expld
.dataseg
.base
4794 && sec
->vma
< expld
.dataseg
.relro_end
4795 && sec
->alignment_power
> max_alignment_power
)
4796 max_alignment_power
= sec
->alignment_power
;
4798 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
4800 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
4802 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
4803 expld
.dataseg
.base
-= (1 << max_alignment_power
);
4804 lang_reset_memory_regions ();
4805 one_lang_size_sections_pass (relax
, check_regions
);
4808 link_info
.relro_start
= expld
.dataseg
.base
;
4809 link_info
.relro_end
= expld
.dataseg
.relro_end
;
4811 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
4813 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4814 a page could be saved in the data segment. */
4815 bfd_vma first
, last
;
4817 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
4818 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
4820 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
4821 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
4822 && first
+ last
<= expld
.dataseg
.pagesize
)
4824 expld
.dataseg
.phase
= exp_dataseg_adjust
;
4825 lang_reset_memory_regions ();
4826 one_lang_size_sections_pass (relax
, check_regions
);
4830 expld
.phase
= lang_final_phase_enum
;
4833 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4836 lang_do_assignments_1 (lang_statement_union_type
*s
,
4837 lang_output_section_statement_type
*current_os
,
4841 for (; s
!= NULL
; s
= s
->header
.next
)
4843 switch (s
->header
.type
)
4845 case lang_constructors_statement_enum
:
4846 dot
= lang_do_assignments_1 (constructor_list
.head
,
4847 current_os
, fill
, dot
);
4850 case lang_output_section_statement_enum
:
4852 lang_output_section_statement_type
*os
;
4854 os
= &(s
->output_section_statement
);
4855 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
4857 dot
= os
->bfd_section
->vma
;
4859 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
4861 /* .tbss sections effectively have zero size. */
4862 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4863 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4864 || link_info
.relocatable
)
4865 dot
+= TO_ADDR (os
->bfd_section
->size
);
4870 case lang_wild_statement_enum
:
4872 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
4873 current_os
, fill
, dot
);
4876 case lang_object_symbols_statement_enum
:
4877 case lang_output_statement_enum
:
4878 case lang_target_statement_enum
:
4881 case lang_data_statement_enum
:
4882 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4883 if (expld
.result
.valid_p
)
4884 s
->data_statement
.value
= (expld
.result
.value
4885 + expld
.result
.section
->vma
);
4887 einfo (_("%F%P: invalid data statement\n"));
4890 switch (s
->data_statement
.type
)
4908 if (size
< TO_SIZE ((unsigned) 1))
4909 size
= TO_SIZE ((unsigned) 1);
4910 dot
+= TO_ADDR (size
);
4914 case lang_reloc_statement_enum
:
4915 exp_fold_tree (s
->reloc_statement
.addend_exp
,
4916 bfd_abs_section_ptr
, &dot
);
4917 if (expld
.result
.valid_p
)
4918 s
->reloc_statement
.addend_value
= expld
.result
.value
;
4920 einfo (_("%F%P: invalid reloc statement\n"));
4921 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
4924 case lang_input_section_enum
:
4926 asection
*in
= s
->input_section
.section
;
4928 if ((in
->flags
& SEC_EXCLUDE
) == 0)
4929 dot
+= TO_ADDR (in
->size
);
4933 case lang_input_statement_enum
:
4936 case lang_fill_statement_enum
:
4937 fill
= s
->fill_statement
.fill
;
4940 case lang_assignment_statement_enum
:
4941 exp_fold_tree (s
->assignment_statement
.exp
,
4942 current_os
->bfd_section
,
4946 case lang_padding_statement_enum
:
4947 dot
+= TO_ADDR (s
->padding_statement
.size
);
4950 case lang_group_statement_enum
:
4951 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
4952 current_os
, fill
, dot
);
4959 case lang_address_statement_enum
:
4967 lang_do_assignments (void)
4969 lang_statement_iteration
++;
4970 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
4973 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4974 operator .startof. (section_name), it produces an undefined symbol
4975 .startof.section_name. Similarly, when it sees
4976 .sizeof. (section_name), it produces an undefined symbol
4977 .sizeof.section_name. For all the output sections, we look for
4978 such symbols, and set them to the correct value. */
4981 lang_set_startof (void)
4985 if (link_info
.relocatable
)
4988 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4990 const char *secname
;
4992 struct bfd_link_hash_entry
*h
;
4994 secname
= bfd_get_section_name (output_bfd
, s
);
4995 buf
= xmalloc (10 + strlen (secname
));
4997 sprintf (buf
, ".startof.%s", secname
);
4998 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4999 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5001 h
->type
= bfd_link_hash_defined
;
5002 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, s
);
5003 h
->u
.def
.section
= bfd_abs_section_ptr
;
5006 sprintf (buf
, ".sizeof.%s", secname
);
5007 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5008 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5010 h
->type
= bfd_link_hash_defined
;
5011 h
->u
.def
.value
= TO_ADDR (s
->size
);
5012 h
->u
.def
.section
= bfd_abs_section_ptr
;
5022 struct bfd_link_hash_entry
*h
;
5025 if (link_info
.relocatable
|| link_info
.shared
)
5030 if (entry_symbol
.name
== NULL
)
5032 /* No entry has been specified. Look for the default entry, but
5033 don't warn if we don't find it. */
5034 entry_symbol
.name
= entry_symbol_default
;
5038 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5039 FALSE
, FALSE
, TRUE
);
5041 && (h
->type
== bfd_link_hash_defined
5042 || h
->type
== bfd_link_hash_defweak
)
5043 && h
->u
.def
.section
->output_section
!= NULL
)
5047 val
= (h
->u
.def
.value
5048 + bfd_get_section_vma (output_bfd
,
5049 h
->u
.def
.section
->output_section
)
5050 + h
->u
.def
.section
->output_offset
);
5051 if (! bfd_set_start_address (output_bfd
, val
))
5052 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5059 /* We couldn't find the entry symbol. Try parsing it as a
5061 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5064 if (! bfd_set_start_address (output_bfd
, val
))
5065 einfo (_("%P%F: can't set start address\n"));
5071 /* Can't find the entry symbol, and it's not a number. Use
5072 the first address in the text section. */
5073 ts
= bfd_get_section_by_name (output_bfd
, entry_section
);
5077 einfo (_("%P: warning: cannot find entry symbol %s;"
5078 " defaulting to %V\n"),
5080 bfd_get_section_vma (output_bfd
, ts
));
5081 if (! bfd_set_start_address (output_bfd
,
5082 bfd_get_section_vma (output_bfd
,
5084 einfo (_("%P%F: can't set start address\n"));
5089 einfo (_("%P: warning: cannot find entry symbol %s;"
5090 " not setting start address\n"),
5096 /* Don't bfd_hash_table_free (&lang_definedness_table);
5097 map file output may result in a call of lang_track_definedness. */
5100 /* This is a small function used when we want to ignore errors from
5104 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5106 /* Don't do anything. */
5109 /* Check that the architecture of all the input files is compatible
5110 with the output file. Also call the backend to let it do any
5111 other checking that is needed. */
5116 lang_statement_union_type
*file
;
5118 const bfd_arch_info_type
*compatible
;
5120 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5122 input_bfd
= file
->input_statement
.the_bfd
;
5124 = bfd_arch_get_compatible (input_bfd
, output_bfd
,
5125 command_line
.accept_unknown_input_arch
);
5127 /* In general it is not possible to perform a relocatable
5128 link between differing object formats when the input
5129 file has relocations, because the relocations in the
5130 input format may not have equivalent representations in
5131 the output format (and besides BFD does not translate
5132 relocs for other link purposes than a final link). */
5133 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5134 && (compatible
== NULL
5135 || bfd_get_flavour (input_bfd
) != bfd_get_flavour (output_bfd
))
5136 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5138 einfo (_("%P%F: Relocatable linking with relocations from"
5139 " format %s (%B) to format %s (%B) is not supported\n"),
5140 bfd_get_target (input_bfd
), input_bfd
,
5141 bfd_get_target (output_bfd
), output_bfd
);
5142 /* einfo with %F exits. */
5145 if (compatible
== NULL
)
5147 if (command_line
.warn_mismatch
)
5148 einfo (_("%P: warning: %s architecture of input file `%B'"
5149 " is incompatible with %s output\n"),
5150 bfd_printable_name (input_bfd
), input_bfd
,
5151 bfd_printable_name (output_bfd
));
5153 else if (bfd_count_sections (input_bfd
))
5155 /* If the input bfd has no contents, it shouldn't set the
5156 private data of the output bfd. */
5158 bfd_error_handler_type pfn
= NULL
;
5160 /* If we aren't supposed to warn about mismatched input
5161 files, temporarily set the BFD error handler to a
5162 function which will do nothing. We still want to call
5163 bfd_merge_private_bfd_data, since it may set up
5164 information which is needed in the output file. */
5165 if (! command_line
.warn_mismatch
)
5166 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5167 if (! bfd_merge_private_bfd_data (input_bfd
, output_bfd
))
5169 if (command_line
.warn_mismatch
)
5170 einfo (_("%P%X: failed to merge target specific data"
5171 " of file %B\n"), input_bfd
);
5173 if (! command_line
.warn_mismatch
)
5174 bfd_set_error_handler (pfn
);
5179 /* Look through all the global common symbols and attach them to the
5180 correct section. The -sort-common command line switch may be used
5181 to roughly sort the entries by size. */
5186 if (command_line
.inhibit_common_definition
)
5188 if (link_info
.relocatable
5189 && ! command_line
.force_common_definition
)
5192 if (! config
.sort_common
)
5193 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5198 for (power
= 4; power
>= 0; power
--)
5199 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5203 /* Place one common symbol in the correct section. */
5206 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5208 unsigned int power_of_two
;
5212 if (h
->type
!= bfd_link_hash_common
)
5216 power_of_two
= h
->u
.c
.p
->alignment_power
;
5218 if (config
.sort_common
5219 && power_of_two
< (unsigned int) *(int *) info
)
5222 section
= h
->u
.c
.p
->section
;
5224 /* Increase the size of the section to align the common sym. */
5225 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
5226 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
5228 /* Adjust the alignment if necessary. */
5229 if (power_of_two
> section
->alignment_power
)
5230 section
->alignment_power
= power_of_two
;
5232 /* Change the symbol from common to defined. */
5233 h
->type
= bfd_link_hash_defined
;
5234 h
->u
.def
.section
= section
;
5235 h
->u
.def
.value
= section
->size
;
5237 /* Increase the size of the section. */
5238 section
->size
+= size
;
5240 /* Make sure the section is allocated in memory, and make sure that
5241 it is no longer a common section. */
5242 section
->flags
|= SEC_ALLOC
;
5243 section
->flags
&= ~SEC_IS_COMMON
;
5245 if (config
.map_file
!= NULL
)
5247 static bfd_boolean header_printed
;
5252 if (! header_printed
)
5254 minfo (_("\nAllocating common symbols\n"));
5255 minfo (_("Common symbol size file\n\n"));
5256 header_printed
= TRUE
;
5259 name
= demangle (h
->root
.string
);
5261 len
= strlen (name
);
5276 if (size
<= 0xffffffff)
5277 sprintf (buf
, "%lx", (unsigned long) size
);
5279 sprintf_vma (buf
, size
);
5289 minfo ("%B\n", section
->owner
);
5295 /* Run through the input files and ensure that every input section has
5296 somewhere to go. If one is found without a destination then create
5297 an input request and place it into the statement tree. */
5300 lang_place_orphans (void)
5302 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5306 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5308 if (s
->output_section
== NULL
)
5310 /* This section of the file is not attached, root
5311 around for a sensible place for it to go. */
5313 if (file
->just_syms_flag
)
5314 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5315 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5316 s
->output_section
= bfd_abs_section_ptr
;
5317 else if (strcmp (s
->name
, "COMMON") == 0)
5319 /* This is a lonely common section which must have
5320 come from an archive. We attach to the section
5321 with the wildcard. */
5322 if (! link_info
.relocatable
5323 || command_line
.force_common_definition
)
5325 if (default_common_section
== NULL
)
5327 default_common_section
=
5328 lang_output_section_statement_lookup (".bss");
5331 lang_add_section (&default_common_section
->children
, s
,
5332 default_common_section
);
5335 else if (ldemul_place_orphan (s
))
5339 lang_output_section_statement_type
*os
;
5341 os
= lang_output_section_statement_lookup (s
->name
);
5342 lang_add_section (&os
->children
, s
, os
);
5350 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5352 flagword
*ptr_flags
;
5354 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5360 *ptr_flags
|= SEC_ALLOC
;
5364 *ptr_flags
|= SEC_READONLY
;
5368 *ptr_flags
|= SEC_DATA
;
5372 *ptr_flags
|= SEC_CODE
;
5377 *ptr_flags
|= SEC_LOAD
;
5381 einfo (_("%P%F: invalid syntax in flags\n"));
5388 /* Call a function on each input file. This function will be called
5389 on an archive, but not on the elements. */
5392 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5394 lang_input_statement_type
*f
;
5396 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5398 f
= (lang_input_statement_type
*) f
->next_real_file
)
5402 /* Call a function on each file. The function will be called on all
5403 the elements of an archive which are included in the link, but will
5404 not be called on the archive file itself. */
5407 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5409 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5416 ldlang_add_file (lang_input_statement_type
*entry
)
5420 lang_statement_append (&file_chain
,
5421 (lang_statement_union_type
*) entry
,
5424 /* The BFD linker needs to have a list of all input BFDs involved in
5426 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5427 ASSERT (entry
->the_bfd
!= output_bfd
);
5428 for (pp
= &link_info
.input_bfds
; *pp
!= NULL
; pp
= &(*pp
)->link_next
)
5430 *pp
= entry
->the_bfd
;
5431 entry
->the_bfd
->usrdata
= entry
;
5432 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5434 /* Look through the sections and check for any which should not be
5435 included in the link. We need to do this now, so that we can
5436 notice when the backend linker tries to report multiple
5437 definition errors for symbols which are in sections we aren't
5438 going to link. FIXME: It might be better to entirely ignore
5439 symbols which are defined in sections which are going to be
5440 discarded. This would require modifying the backend linker for
5441 each backend which might set the SEC_LINK_ONCE flag. If we do
5442 this, we should probably handle SEC_EXCLUDE in the same way. */
5444 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5448 lang_add_output (const char *name
, int from_script
)
5450 /* Make -o on command line override OUTPUT in script. */
5451 if (!had_output_filename
|| !from_script
)
5453 output_filename
= name
;
5454 had_output_filename
= TRUE
;
5458 static lang_output_section_statement_type
*current_section
;
5469 for (l
= 0; l
< 32; l
++)
5471 if (i
>= (unsigned int) x
)
5479 lang_output_section_statement_type
*
5480 lang_enter_output_section_statement (const char *output_section_statement_name
,
5481 etree_type
*address_exp
,
5482 enum section_type sectype
,
5484 etree_type
*subalign
,
5488 lang_output_section_statement_type
*os
;
5490 os
= lang_output_section_statement_lookup_1 (output_section_statement_name
,
5492 current_section
= os
;
5494 /* Make next things chain into subchain of this. */
5496 if (os
->addr_tree
== NULL
)
5498 os
->addr_tree
= address_exp
;
5500 os
->sectype
= sectype
;
5501 if (sectype
!= noload_section
)
5502 os
->flags
= SEC_NO_FLAGS
;
5504 os
->flags
= SEC_NEVER_LOAD
;
5505 os
->block_value
= 1;
5506 stat_ptr
= &os
->children
;
5508 os
->subsection_alignment
=
5509 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5510 os
->section_alignment
=
5511 topower (exp_get_value_int (align
, -1, "section alignment"));
5513 os
->load_base
= ebase
;
5520 lang_output_statement_type
*new;
5522 new = new_stat (lang_output_statement
, stat_ptr
);
5523 new->name
= output_filename
;
5526 /* Reset the current counters in the regions. */
5529 lang_reset_memory_regions (void)
5531 lang_memory_region_type
*p
= lang_memory_region_list
;
5533 lang_output_section_statement_type
*os
;
5535 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5537 p
->current
= p
->origin
;
5541 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5545 os
->processed_vma
= FALSE
;
5546 os
->processed_lma
= FALSE
;
5549 for (o
= output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5551 /* Save the last size for possible use by bfd_relax_section. */
5552 o
->rawsize
= o
->size
;
5557 /* Worker for lang_gc_sections_1. */
5560 gc_section_callback (lang_wild_statement_type
*ptr
,
5561 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5563 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5564 void *data ATTRIBUTE_UNUSED
)
5566 /* If the wild pattern was marked KEEP, the member sections
5567 should be as well. */
5568 if (ptr
->keep_sections
)
5569 section
->flags
|= SEC_KEEP
;
5572 /* Iterate over sections marking them against GC. */
5575 lang_gc_sections_1 (lang_statement_union_type
*s
)
5577 for (; s
!= NULL
; s
= s
->header
.next
)
5579 switch (s
->header
.type
)
5581 case lang_wild_statement_enum
:
5582 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5584 case lang_constructors_statement_enum
:
5585 lang_gc_sections_1 (constructor_list
.head
);
5587 case lang_output_section_statement_enum
:
5588 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5590 case lang_group_statement_enum
:
5591 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5600 lang_gc_sections (void)
5602 struct bfd_link_hash_entry
*h
;
5603 ldlang_undef_chain_list_type
*ulist
;
5605 /* Keep all sections so marked in the link script. */
5607 lang_gc_sections_1 (statement_list
.head
);
5609 /* Keep all sections containing symbols undefined on the command-line,
5610 and the section containing the entry symbol. */
5612 for (ulist
= link_info
.gc_sym_list
; ulist
; ulist
= ulist
->next
)
5614 h
= bfd_link_hash_lookup (link_info
.hash
, ulist
->name
,
5615 FALSE
, FALSE
, FALSE
);
5618 && (h
->type
== bfd_link_hash_defined
5619 || h
->type
== bfd_link_hash_defweak
)
5620 && ! bfd_is_abs_section (h
->u
.def
.section
))
5622 h
->u
.def
.section
->flags
|= SEC_KEEP
;
5626 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5627 the special case of debug info. (See bfd/stabs.c)
5628 Twiddle the flag here, to simplify later linker code. */
5629 if (link_info
.relocatable
)
5631 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5634 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5635 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5636 sec
->flags
&= ~SEC_EXCLUDE
;
5640 if (link_info
.gc_sections
)
5641 bfd_gc_sections (output_bfd
, &link_info
);
5644 /* Relax all sections until bfd_relax_section gives up. */
5647 relax_sections (void)
5649 /* Keep relaxing until bfd_relax_section gives up. */
5650 bfd_boolean relax_again
;
5654 relax_again
= FALSE
;
5656 /* Note: pe-dll.c does something like this also. If you find
5657 you need to change this code, you probably need to change
5658 pe-dll.c also. DJ */
5660 /* Do all the assignments with our current guesses as to
5662 lang_do_assignments ();
5664 /* We must do this after lang_do_assignments, because it uses
5666 lang_reset_memory_regions ();
5668 /* Perform another relax pass - this time we know where the
5669 globals are, so can make a better guess. */
5670 lang_size_sections (&relax_again
, FALSE
);
5672 while (relax_again
);
5678 /* Finalize dynamic list. */
5679 if (link_info
.dynamic_list
)
5680 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
5682 current_target
= default_target
;
5684 /* Open the output file. */
5685 lang_for_each_statement (ldlang_open_output
);
5688 ldemul_create_output_section_statements ();
5690 /* Add to the hash table all undefineds on the command line. */
5691 lang_place_undefineds ();
5693 if (!bfd_section_already_linked_table_init ())
5694 einfo (_("%P%F: Failed to create hash table\n"));
5696 /* Create a bfd for each input file. */
5697 current_target
= default_target
;
5698 open_input_bfds (statement_list
.head
, FALSE
);
5700 link_info
.gc_sym_list
= &entry_symbol
;
5701 if (entry_symbol
.name
== NULL
)
5702 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
5704 ldemul_after_open ();
5706 bfd_section_already_linked_table_free ();
5708 /* Make sure that we're not mixing architectures. We call this
5709 after all the input files have been opened, but before we do any
5710 other processing, so that any operations merge_private_bfd_data
5711 does on the output file will be known during the rest of the
5715 /* Handle .exports instead of a version script if we're told to do so. */
5716 if (command_line
.version_exports_section
)
5717 lang_do_version_exports_section ();
5719 /* Build all sets based on the information gathered from the input
5721 ldctor_build_sets ();
5723 /* Remove unreferenced sections if asked to. */
5724 lang_gc_sections ();
5726 /* Size up the common data. */
5729 /* Update wild statements. */
5730 update_wild_statements (statement_list
.head
);
5732 /* Run through the contours of the script and attach input sections
5733 to the correct output sections. */
5734 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
5736 /* Find any sections not attached explicitly and handle them. */
5737 lang_place_orphans ();
5739 if (! link_info
.relocatable
)
5743 /* Merge SEC_MERGE sections. This has to be done after GC of
5744 sections, so that GCed sections are not merged, but before
5745 assigning dynamic symbols, since removing whole input sections
5747 bfd_merge_sections (output_bfd
, &link_info
);
5749 /* Look for a text section and set the readonly attribute in it. */
5750 found
= bfd_get_section_by_name (output_bfd
, ".text");
5754 if (config
.text_read_only
)
5755 found
->flags
|= SEC_READONLY
;
5757 found
->flags
&= ~SEC_READONLY
;
5761 /* Do anything special before sizing sections. This is where ELF
5762 and other back-ends size dynamic sections. */
5763 ldemul_before_allocation ();
5765 /* We must record the program headers before we try to fix the
5766 section positions, since they will affect SIZEOF_HEADERS. */
5767 lang_record_phdrs ();
5769 /* Size up the sections. */
5770 lang_size_sections (NULL
, !command_line
.relax
);
5772 /* Now run around and relax if we can. */
5773 if (command_line
.relax
)
5775 /* We may need more than one relaxation pass. */
5776 int i
= link_info
.relax_pass
;
5778 /* The backend can use it to determine the current pass. */
5779 link_info
.relax_pass
= 0;
5784 link_info
.relax_pass
++;
5787 /* Final extra sizing to report errors. */
5788 lang_do_assignments ();
5789 lang_reset_memory_regions ();
5790 lang_size_sections (NULL
, TRUE
);
5793 /* See if anything special should be done now we know how big
5795 ldemul_after_allocation ();
5797 /* Fix any .startof. or .sizeof. symbols. */
5798 lang_set_startof ();
5800 /* Do all the assignments, now that we know the final resting places
5801 of all the symbols. */
5803 lang_do_assignments ();
5807 /* Make sure that the section addresses make sense. */
5808 if (! link_info
.relocatable
5809 && command_line
.check_section_addresses
)
5810 lang_check_section_addresses ();
5815 /* EXPORTED TO YACC */
5818 lang_add_wild (struct wildcard_spec
*filespec
,
5819 struct wildcard_list
*section_list
,
5820 bfd_boolean keep_sections
)
5822 struct wildcard_list
*curr
, *next
;
5823 lang_wild_statement_type
*new;
5825 /* Reverse the list as the parser puts it back to front. */
5826 for (curr
= section_list
, section_list
= NULL
;
5828 section_list
= curr
, curr
= next
)
5830 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
5831 placed_commons
= TRUE
;
5834 curr
->next
= section_list
;
5837 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
5839 if (strcmp (filespec
->name
, "*") == 0)
5840 filespec
->name
= NULL
;
5841 else if (! wildcardp (filespec
->name
))
5842 lang_has_input_file
= TRUE
;
5845 new = new_stat (lang_wild_statement
, stat_ptr
);
5846 new->filename
= NULL
;
5847 new->filenames_sorted
= FALSE
;
5848 if (filespec
!= NULL
)
5850 new->filename
= filespec
->name
;
5851 new->filenames_sorted
= filespec
->sorted
== by_name
;
5853 new->section_list
= section_list
;
5854 new->keep_sections
= keep_sections
;
5855 lang_list_init (&new->children
);
5856 analyze_walk_wild_section_handler (new);
5860 lang_section_start (const char *name
, etree_type
*address
,
5861 const segment_type
*segment
)
5863 lang_address_statement_type
*ad
;
5865 ad
= new_stat (lang_address_statement
, stat_ptr
);
5866 ad
->section_name
= name
;
5867 ad
->address
= address
;
5868 ad
->segment
= segment
;
5871 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5872 because of a -e argument on the command line, or zero if this is
5873 called by ENTRY in a linker script. Command line arguments take
5877 lang_add_entry (const char *name
, bfd_boolean cmdline
)
5879 if (entry_symbol
.name
== NULL
5881 || ! entry_from_cmdline
)
5883 entry_symbol
.name
= name
;
5884 entry_from_cmdline
= cmdline
;
5888 /* Set the default start symbol to NAME. .em files should use this,
5889 not lang_add_entry, to override the use of "start" if neither the
5890 linker script nor the command line specifies an entry point. NAME
5891 must be permanently allocated. */
5893 lang_default_entry (const char *name
)
5895 entry_symbol_default
= name
;
5899 lang_add_target (const char *name
)
5901 lang_target_statement_type
*new;
5903 new = new_stat (lang_target_statement
, stat_ptr
);
5908 lang_add_map (const char *name
)
5915 map_option_f
= TRUE
;
5923 lang_add_fill (fill_type
*fill
)
5925 lang_fill_statement_type
*new;
5927 new = new_stat (lang_fill_statement
, stat_ptr
);
5932 lang_add_data (int type
, union etree_union
*exp
)
5934 lang_data_statement_type
*new;
5936 new = new_stat (lang_data_statement
, stat_ptr
);
5941 /* Create a new reloc statement. RELOC is the BFD relocation type to
5942 generate. HOWTO is the corresponding howto structure (we could
5943 look this up, but the caller has already done so). SECTION is the
5944 section to generate a reloc against, or NAME is the name of the
5945 symbol to generate a reloc against. Exactly one of SECTION and
5946 NAME must be NULL. ADDEND is an expression for the addend. */
5949 lang_add_reloc (bfd_reloc_code_real_type reloc
,
5950 reloc_howto_type
*howto
,
5953 union etree_union
*addend
)
5955 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
5959 p
->section
= section
;
5961 p
->addend_exp
= addend
;
5963 p
->addend_value
= 0;
5964 p
->output_section
= NULL
;
5965 p
->output_offset
= 0;
5968 lang_assignment_statement_type
*
5969 lang_add_assignment (etree_type
*exp
)
5971 lang_assignment_statement_type
*new;
5973 new = new_stat (lang_assignment_statement
, stat_ptr
);
5979 lang_add_attribute (enum statement_enum attribute
)
5981 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
5985 lang_startup (const char *name
)
5987 if (startup_file
!= NULL
)
5989 einfo (_("%P%F: multiple STARTUP files\n"));
5991 first_file
->filename
= name
;
5992 first_file
->local_sym_name
= name
;
5993 first_file
->real
= TRUE
;
5995 startup_file
= name
;
5999 lang_float (bfd_boolean maybe
)
6001 lang_float_flag
= maybe
;
6005 /* Work out the load- and run-time regions from a script statement, and
6006 store them in *LMA_REGION and *REGION respectively.
6008 MEMSPEC is the name of the run-time region, or the value of
6009 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6010 LMA_MEMSPEC is the name of the load-time region, or null if the
6011 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6012 had an explicit load address.
6014 It is an error to specify both a load region and a load address. */
6017 lang_get_regions (lang_memory_region_type
**region
,
6018 lang_memory_region_type
**lma_region
,
6019 const char *memspec
,
6020 const char *lma_memspec
,
6021 bfd_boolean have_lma
,
6022 bfd_boolean have_vma
)
6024 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6026 /* If no runtime region or VMA has been specified, but the load region
6027 has been specified, then use the load region for the runtime region
6029 if (lma_memspec
!= NULL
6031 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6032 *region
= *lma_region
;
6034 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6036 if (have_lma
&& lma_memspec
!= 0)
6037 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6041 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6042 lang_output_section_phdr_list
*phdrs
,
6043 const char *lma_memspec
)
6045 lang_get_regions (¤t_section
->region
,
6046 ¤t_section
->lma_region
,
6047 memspec
, lma_memspec
,
6048 current_section
->load_base
!= NULL
,
6049 current_section
->addr_tree
!= NULL
);
6050 current_section
->fill
= fill
;
6051 current_section
->phdrs
= phdrs
;
6052 stat_ptr
= &statement_list
;
6055 /* Create an absolute symbol with the given name with the value of the
6056 address of first byte of the section named.
6058 If the symbol already exists, then do nothing. */
6061 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6063 struct bfd_link_hash_entry
*h
;
6065 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6067 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6069 if (h
->type
== bfd_link_hash_new
6070 || h
->type
== bfd_link_hash_undefined
)
6074 h
->type
= bfd_link_hash_defined
;
6076 sec
= bfd_get_section_by_name (output_bfd
, secname
);
6080 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, sec
);
6082 h
->u
.def
.section
= bfd_abs_section_ptr
;
6086 /* Create an absolute symbol with the given name with the value of the
6087 address of the first byte after the end of the section named.
6089 If the symbol already exists, then do nothing. */
6092 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6094 struct bfd_link_hash_entry
*h
;
6096 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6098 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6100 if (h
->type
== bfd_link_hash_new
6101 || h
->type
== bfd_link_hash_undefined
)
6105 h
->type
= bfd_link_hash_defined
;
6107 sec
= bfd_get_section_by_name (output_bfd
, secname
);
6111 h
->u
.def
.value
= (bfd_get_section_vma (output_bfd
, sec
)
6112 + TO_ADDR (sec
->size
));
6114 h
->u
.def
.section
= bfd_abs_section_ptr
;
6119 lang_statement_append (lang_statement_list_type
*list
,
6120 lang_statement_union_type
*element
,
6121 lang_statement_union_type
**field
)
6123 *(list
->tail
) = element
;
6127 /* Set the output format type. -oformat overrides scripts. */
6130 lang_add_output_format (const char *format
,
6135 if (output_target
== NULL
|| !from_script
)
6137 if (command_line
.endian
== ENDIAN_BIG
6140 else if (command_line
.endian
== ENDIAN_LITTLE
6144 output_target
= format
;
6148 /* Enter a group. This creates a new lang_group_statement, and sets
6149 stat_ptr to build new statements within the group. */
6152 lang_enter_group (void)
6154 lang_group_statement_type
*g
;
6156 g
= new_stat (lang_group_statement
, stat_ptr
);
6157 lang_list_init (&g
->children
);
6158 stat_ptr
= &g
->children
;
6161 /* Leave a group. This just resets stat_ptr to start writing to the
6162 regular list of statements again. Note that this will not work if
6163 groups can occur inside anything else which can adjust stat_ptr,
6164 but currently they can't. */
6167 lang_leave_group (void)
6169 stat_ptr
= &statement_list
;
6172 /* Add a new program header. This is called for each entry in a PHDRS
6173 command in a linker script. */
6176 lang_new_phdr (const char *name
,
6178 bfd_boolean filehdr
,
6183 struct lang_phdr
*n
, **pp
;
6185 n
= stat_alloc (sizeof (struct lang_phdr
));
6188 n
->type
= exp_get_value_int (type
, 0, "program header type");
6189 n
->filehdr
= filehdr
;
6194 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6199 /* Record the program header information in the output BFD. FIXME: We
6200 should not be calling an ELF specific function here. */
6203 lang_record_phdrs (void)
6207 lang_output_section_phdr_list
*last
;
6208 struct lang_phdr
*l
;
6209 lang_output_section_statement_type
*os
;
6212 secs
= xmalloc (alc
* sizeof (asection
*));
6214 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
6221 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6225 lang_output_section_phdr_list
*pl
;
6227 if (os
->constraint
== -1)
6235 if (os
->sectype
== noload_section
6236 || os
->bfd_section
== NULL
6237 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6242 if (os
->bfd_section
== NULL
)
6245 for (; pl
!= NULL
; pl
= pl
->next
)
6247 if (strcmp (pl
->name
, l
->name
) == 0)
6252 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
6254 secs
[c
] = os
->bfd_section
;
6261 if (l
->flags
== NULL
)
6264 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6269 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6271 if (! bfd_record_phdr (output_bfd
, l
->type
,
6272 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6273 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6274 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6279 /* Make sure all the phdr assignments succeeded. */
6280 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6284 lang_output_section_phdr_list
*pl
;
6286 if (os
->constraint
== -1
6287 || os
->bfd_section
== NULL
)
6290 for (pl
= os
->phdrs
;
6293 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6294 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6295 os
->name
, pl
->name
);
6299 /* Record a list of sections which may not be cross referenced. */
6302 lang_add_nocrossref (lang_nocrossref_type
*l
)
6304 struct lang_nocrossrefs
*n
;
6306 n
= xmalloc (sizeof *n
);
6307 n
->next
= nocrossref_list
;
6309 nocrossref_list
= n
;
6311 /* Set notice_all so that we get informed about all symbols. */
6312 link_info
.notice_all
= TRUE
;
6315 /* Overlay handling. We handle overlays with some static variables. */
6317 /* The overlay virtual address. */
6318 static etree_type
*overlay_vma
;
6319 /* And subsection alignment. */
6320 static etree_type
*overlay_subalign
;
6322 /* An expression for the maximum section size seen so far. */
6323 static etree_type
*overlay_max
;
6325 /* A list of all the sections in this overlay. */
6327 struct overlay_list
{
6328 struct overlay_list
*next
;
6329 lang_output_section_statement_type
*os
;
6332 static struct overlay_list
*overlay_list
;
6334 /* Start handling an overlay. */
6337 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6339 /* The grammar should prevent nested overlays from occurring. */
6340 ASSERT (overlay_vma
== NULL
6341 && overlay_subalign
== NULL
6342 && overlay_max
== NULL
);
6344 overlay_vma
= vma_expr
;
6345 overlay_subalign
= subalign
;
6348 /* Start a section in an overlay. We handle this by calling
6349 lang_enter_output_section_statement with the correct VMA.
6350 lang_leave_overlay sets up the LMA and memory regions. */
6353 lang_enter_overlay_section (const char *name
)
6355 struct overlay_list
*n
;
6358 lang_enter_output_section_statement (name
, overlay_vma
, normal_section
,
6359 0, overlay_subalign
, 0, 0);
6361 /* If this is the first section, then base the VMA of future
6362 sections on this one. This will work correctly even if `.' is
6363 used in the addresses. */
6364 if (overlay_list
== NULL
)
6365 overlay_vma
= exp_nameop (ADDR
, name
);
6367 /* Remember the section. */
6368 n
= xmalloc (sizeof *n
);
6369 n
->os
= current_section
;
6370 n
->next
= overlay_list
;
6373 size
= exp_nameop (SIZEOF
, name
);
6375 /* Arrange to work out the maximum section end address. */
6376 if (overlay_max
== NULL
)
6379 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6382 /* Finish a section in an overlay. There isn't any special to do
6386 lang_leave_overlay_section (fill_type
*fill
,
6387 lang_output_section_phdr_list
*phdrs
)
6394 name
= current_section
->name
;
6396 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6397 region and that no load-time region has been specified. It doesn't
6398 really matter what we say here, since lang_leave_overlay will
6400 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6402 /* Define the magic symbols. */
6404 clean
= xmalloc (strlen (name
) + 1);
6406 for (s1
= name
; *s1
!= '\0'; s1
++)
6407 if (ISALNUM (*s1
) || *s1
== '_')
6411 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6412 sprintf (buf
, "__load_start_%s", clean
);
6413 lang_add_assignment (exp_assop ('=', buf
,
6414 exp_nameop (LOADADDR
, name
)));
6416 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6417 sprintf (buf
, "__load_stop_%s", clean
);
6418 lang_add_assignment (exp_assop ('=', buf
,
6420 exp_nameop (LOADADDR
, name
),
6421 exp_nameop (SIZEOF
, name
))));
6426 /* Finish an overlay. If there are any overlay wide settings, this
6427 looks through all the sections in the overlay and sets them. */
6430 lang_leave_overlay (etree_type
*lma_expr
,
6433 const char *memspec
,
6434 lang_output_section_phdr_list
*phdrs
,
6435 const char *lma_memspec
)
6437 lang_memory_region_type
*region
;
6438 lang_memory_region_type
*lma_region
;
6439 struct overlay_list
*l
;
6440 lang_nocrossref_type
*nocrossref
;
6442 lang_get_regions (®ion
, &lma_region
,
6443 memspec
, lma_memspec
,
6444 lma_expr
!= NULL
, FALSE
);
6448 /* After setting the size of the last section, set '.' to end of the
6450 if (overlay_list
!= NULL
)
6451 overlay_list
->os
->update_dot_tree
6452 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6457 struct overlay_list
*next
;
6459 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6462 l
->os
->region
= region
;
6463 l
->os
->lma_region
= lma_region
;
6465 /* The first section has the load address specified in the
6466 OVERLAY statement. The rest are worked out from that.
6467 The base address is not needed (and should be null) if
6468 an LMA region was specified. */
6470 l
->os
->load_base
= lma_expr
;
6472 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6473 l
->os
->phdrs
= phdrs
;
6477 lang_nocrossref_type
*nc
;
6479 nc
= xmalloc (sizeof *nc
);
6480 nc
->name
= l
->os
->name
;
6481 nc
->next
= nocrossref
;
6490 if (nocrossref
!= NULL
)
6491 lang_add_nocrossref (nocrossref
);
6494 overlay_list
= NULL
;
6498 /* Version handling. This is only useful for ELF. */
6500 /* This global variable holds the version tree that we build. */
6502 struct bfd_elf_version_tree
*lang_elf_version_info
;
6504 /* If PREV is NULL, return first version pattern matching particular symbol.
6505 If PREV is non-NULL, return first version pattern matching particular
6506 symbol after PREV (previously returned by lang_vers_match). */
6508 static struct bfd_elf_version_expr
*
6509 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6510 struct bfd_elf_version_expr
*prev
,
6513 const char *cxx_sym
= sym
;
6514 const char *java_sym
= sym
;
6515 struct bfd_elf_version_expr
*expr
= NULL
;
6517 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6519 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6523 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6525 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6530 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6532 struct bfd_elf_version_expr e
;
6534 switch (prev
? prev
->mask
: 0)
6537 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6540 expr
= htab_find (head
->htab
, &e
);
6541 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6542 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6548 case BFD_ELF_VERSION_C_TYPE
:
6549 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6552 expr
= htab_find (head
->htab
, &e
);
6553 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6554 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6560 case BFD_ELF_VERSION_CXX_TYPE
:
6561 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6563 e
.symbol
= java_sym
;
6564 expr
= htab_find (head
->htab
, &e
);
6565 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6566 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6577 /* Finally, try the wildcards. */
6578 if (prev
== NULL
|| prev
->symbol
)
6579 expr
= head
->remaining
;
6582 for (; expr
; expr
= expr
->next
)
6589 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6592 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6594 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6598 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6604 free ((char *) cxx_sym
);
6605 if (java_sym
!= sym
)
6606 free ((char *) java_sym
);
6610 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6611 return a string pointing to the symbol name. */
6614 realsymbol (const char *pattern
)
6617 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6618 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6620 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6622 /* It is a glob pattern only if there is no preceding
6624 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6632 /* Remove the preceding backslash. */
6639 backslash
= *p
== '\\';
6654 /* This is called for each variable name or match expression. NEW is
6655 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
6656 pattern to be matched against symbol names. */
6658 struct bfd_elf_version_expr
*
6659 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
6662 bfd_boolean literal_p
)
6664 struct bfd_elf_version_expr
*ret
;
6666 ret
= xmalloc (sizeof *ret
);
6668 ret
->pattern
= literal_p
? NULL
: new;
6671 ret
->symbol
= literal_p
? new : realsymbol (new);
6673 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
6674 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6675 else if (strcasecmp (lang
, "C++") == 0)
6676 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
6677 else if (strcasecmp (lang
, "Java") == 0)
6678 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
6681 einfo (_("%X%P: unknown language `%s' in version information\n"),
6683 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6686 return ldemul_new_vers_pattern (ret
);
6689 /* This is called for each set of variable names and match
6692 struct bfd_elf_version_tree
*
6693 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
6694 struct bfd_elf_version_expr
*locals
)
6696 struct bfd_elf_version_tree
*ret
;
6698 ret
= xcalloc (1, sizeof *ret
);
6699 ret
->globals
.list
= globals
;
6700 ret
->locals
.list
= locals
;
6701 ret
->match
= lang_vers_match
;
6702 ret
->name_indx
= (unsigned int) -1;
6706 /* This static variable keeps track of version indices. */
6708 static int version_index
;
6711 version_expr_head_hash (const void *p
)
6713 const struct bfd_elf_version_expr
*e
= p
;
6715 return htab_hash_string (e
->symbol
);
6719 version_expr_head_eq (const void *p1
, const void *p2
)
6721 const struct bfd_elf_version_expr
*e1
= p1
;
6722 const struct bfd_elf_version_expr
*e2
= p2
;
6724 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
6728 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
6731 struct bfd_elf_version_expr
*e
, *next
;
6732 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
6734 for (e
= head
->list
; e
; e
= e
->next
)
6738 head
->mask
|= e
->mask
;
6743 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
6744 version_expr_head_eq
, NULL
);
6745 list_loc
= &head
->list
;
6746 remaining_loc
= &head
->remaining
;
6747 for (e
= head
->list
; e
; e
= next
)
6753 remaining_loc
= &e
->next
;
6757 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
6761 struct bfd_elf_version_expr
*e1
, *last
;
6767 if (e1
->mask
== e
->mask
)
6775 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
6779 /* This is a duplicate. */
6780 /* FIXME: Memory leak. Sometimes pattern is not
6781 xmalloced alone, but in larger chunk of memory. */
6782 /* free (e->symbol); */
6787 e
->next
= last
->next
;
6795 list_loc
= &e
->next
;
6799 *remaining_loc
= NULL
;
6800 *list_loc
= head
->remaining
;
6803 head
->remaining
= head
->list
;
6806 /* This is called when we know the name and dependencies of the
6810 lang_register_vers_node (const char *name
,
6811 struct bfd_elf_version_tree
*version
,
6812 struct bfd_elf_version_deps
*deps
)
6814 struct bfd_elf_version_tree
*t
, **pp
;
6815 struct bfd_elf_version_expr
*e1
;
6820 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
6821 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
6823 einfo (_("%X%P: anonymous version tag cannot be combined"
6824 " with other version tags\n"));
6829 /* Make sure this node has a unique name. */
6830 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6831 if (strcmp (t
->name
, name
) == 0)
6832 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
6834 lang_finalize_version_expr_head (&version
->globals
);
6835 lang_finalize_version_expr_head (&version
->locals
);
6837 /* Check the global and local match names, and make sure there
6838 aren't any duplicates. */
6840 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
6842 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6844 struct bfd_elf_version_expr
*e2
;
6846 if (t
->locals
.htab
&& e1
->symbol
)
6848 e2
= htab_find (t
->locals
.htab
, e1
);
6849 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6851 if (e1
->mask
== e2
->mask
)
6852 einfo (_("%X%P: duplicate expression `%s'"
6853 " in version information\n"), e1
->symbol
);
6857 else if (!e1
->symbol
)
6858 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6859 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6860 && e1
->mask
== e2
->mask
)
6861 einfo (_("%X%P: duplicate expression `%s'"
6862 " in version information\n"), e1
->pattern
);
6866 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
6868 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6870 struct bfd_elf_version_expr
*e2
;
6872 if (t
->globals
.htab
&& e1
->symbol
)
6874 e2
= htab_find (t
->globals
.htab
, e1
);
6875 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6877 if (e1
->mask
== e2
->mask
)
6878 einfo (_("%X%P: duplicate expression `%s'"
6879 " in version information\n"),
6884 else if (!e1
->symbol
)
6885 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6886 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6887 && e1
->mask
== e2
->mask
)
6888 einfo (_("%X%P: duplicate expression `%s'"
6889 " in version information\n"), e1
->pattern
);
6893 version
->deps
= deps
;
6894 version
->name
= name
;
6895 if (name
[0] != '\0')
6898 version
->vernum
= version_index
;
6901 version
->vernum
= 0;
6903 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6908 /* This is called when we see a version dependency. */
6910 struct bfd_elf_version_deps
*
6911 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
6913 struct bfd_elf_version_deps
*ret
;
6914 struct bfd_elf_version_tree
*t
;
6916 ret
= xmalloc (sizeof *ret
);
6919 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6921 if (strcmp (t
->name
, name
) == 0)
6923 ret
->version_needed
= t
;
6928 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
6934 lang_do_version_exports_section (void)
6936 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
6938 LANG_FOR_EACH_INPUT_STATEMENT (is
)
6940 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
6948 contents
= xmalloc (len
);
6949 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
6950 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
6953 while (p
< contents
+ len
)
6955 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
6956 p
= strchr (p
, '\0') + 1;
6959 /* Do not free the contents, as we used them creating the regex. */
6961 /* Do not include this section in the link. */
6962 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
6965 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
6966 lang_register_vers_node (command_line
.version_exports_section
,
6967 lang_new_vers_node (greg
, lreg
), NULL
);
6971 lang_add_unique (const char *name
)
6973 struct unique_sections
*ent
;
6975 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
6976 if (strcmp (ent
->name
, name
) == 0)
6979 ent
= xmalloc (sizeof *ent
);
6980 ent
->name
= xstrdup (name
);
6981 ent
->next
= unique_section_list
;
6982 unique_section_list
= ent
;
6985 /* Append the list of dynamic symbols to the existing one. */
6988 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
6990 if (link_info
.dynamic_list
)
6992 struct bfd_elf_version_expr
*tail
;
6993 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
6995 tail
->next
= link_info
.dynamic_list
->head
.list
;
6996 link_info
.dynamic_list
->head
.list
= dynamic
;
7000 struct bfd_elf_dynamic_list
*d
;
7002 d
= xcalloc (1, sizeof *d
);
7003 d
->head
.list
= dynamic
;
7004 d
->match
= lang_vers_match
;
7005 link_info
.dynamic_list
= d
;
7009 /* Append the list of C++ typeinfo dynamic symbols to the existing
7013 lang_append_dynamic_list_cpp_typeinfo (void)
7015 const char * symbols
[] =
7017 "typeinfo name for*",
7020 struct bfd_elf_version_expr
*dynamic
= NULL
;
7023 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7024 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7027 lang_append_dynamic_list (dynamic
);
7030 /* Append the list of C++ operator new and delete dynamic symbols to the
7034 lang_append_dynamic_list_cpp_new (void)
7036 const char * symbols
[] =
7041 struct bfd_elf_version_expr
*dynamic
= NULL
;
7044 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7045 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7048 lang_append_dynamic_list (dynamic
);