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, 2008
4 Free Software Foundation, Inc.
6 This file is part of the GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
25 #include "libiberty.h"
26 #include "safe-ctype.h"
45 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
48 /* Locals variables. */
49 static struct obstack stat_obstack
;
50 static struct obstack map_obstack
;
52 #define obstack_chunk_alloc xmalloc
53 #define obstack_chunk_free free
54 static const char *startup_file
;
55 static bfd_boolean placed_commons
= FALSE
;
56 static bfd_boolean stripped_excluded_sections
= FALSE
;
57 static lang_output_section_statement_type
*default_common_section
;
58 static bfd_boolean map_option_f
;
59 static bfd_vma print_dot
;
60 static lang_input_statement_type
*first_file
;
61 static const char *current_target
;
62 static const char *output_target
;
63 static lang_statement_list_type statement_list
;
64 static struct bfd_hash_table lang_definedness_table
;
66 /* Forward declarations. */
67 static void exp_init_os (etree_type
*);
68 static void init_map_userdata (bfd
*, asection
*, void *);
69 static lang_input_statement_type
*lookup_name (const char *);
70 static struct bfd_hash_entry
*lang_definedness_newfunc
71 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
72 static void insert_undefined (const char *);
73 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
74 static void print_statement (lang_statement_union_type
*,
75 lang_output_section_statement_type
*);
76 static void print_statement_list (lang_statement_union_type
*,
77 lang_output_section_statement_type
*);
78 static void print_statements (void);
79 static void print_input_section (asection
*);
80 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
81 static void lang_record_phdrs (void);
82 static void lang_do_version_exports_section (void);
83 static void lang_finalize_version_expr_head
84 (struct bfd_elf_version_expr_head
*);
86 /* Exported variables. */
87 lang_output_section_statement_type
*abs_output_section
;
88 lang_statement_list_type lang_output_section_statement
;
89 lang_statement_list_type
*stat_ptr
= &statement_list
;
90 lang_statement_list_type file_chain
= { NULL
, NULL
};
91 lang_statement_list_type input_file_chain
;
92 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
93 static const char *entry_symbol_default
= "start";
94 const char *entry_section
= ".text";
95 bfd_boolean entry_from_cmdline
;
96 bfd_boolean lang_has_input_file
= FALSE
;
97 bfd_boolean had_output_filename
= FALSE
;
98 bfd_boolean lang_float_flag
= FALSE
;
99 bfd_boolean delete_output_file_on_failure
= FALSE
;
100 struct lang_phdr
*lang_phdr_list
;
101 struct lang_nocrossrefs
*nocrossref_list
;
102 static struct unique_sections
*unique_section_list
;
103 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
105 /* Functions that traverse the linker script and might evaluate
106 DEFINED() need to increment this. */
107 int lang_statement_iteration
= 0;
109 etree_type
*base
; /* Relocation base - or null */
111 /* Return TRUE if the PATTERN argument is a wildcard pattern.
112 Although backslashes are treated specially if a pattern contains
113 wildcards, we do not consider the mere presence of a backslash to
114 be enough to cause the pattern to be treated as a wildcard.
115 That lets us handle DOS filenames more naturally. */
116 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
118 #define new_stat(x, y) \
119 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
121 #define outside_section_address(q) \
122 ((q)->output_offset + (q)->output_section->vma)
124 #define outside_symbol_address(q) \
125 ((q)->value + outside_section_address (q->section))
127 #define SECTION_NAME_MAP_LENGTH (16)
130 stat_alloc (size_t size
)
132 return obstack_alloc (&stat_obstack
, size
);
136 unique_section_p (const asection
*sec
)
138 struct unique_sections
*unam
;
141 if (link_info
.relocatable
142 && sec
->owner
!= NULL
143 && bfd_is_group_section (sec
->owner
, sec
))
147 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
148 if (wildcardp (unam
->name
)
149 ? fnmatch (unam
->name
, secnam
, 0) == 0
150 : strcmp (unam
->name
, secnam
) == 0)
158 /* Generic traversal routines for finding matching sections. */
160 /* Try processing a section against a wildcard. This just calls
161 the callback unless the filename exclusion list is present
162 and excludes the file. It's hardly ever present so this
163 function is very fast. */
166 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
167 lang_input_statement_type
*file
,
169 struct wildcard_list
*sec
,
173 bfd_boolean skip
= FALSE
;
174 struct name_list
*list_tmp
;
176 /* Don't process sections from files which were
178 for (list_tmp
= sec
->spec
.exclude_name_list
;
180 list_tmp
= list_tmp
->next
)
182 bfd_boolean is_wildcard
= wildcardp (list_tmp
->name
);
184 skip
= fnmatch (list_tmp
->name
, file
->filename
, 0) == 0;
186 skip
= strcmp (list_tmp
->name
, file
->filename
) == 0;
188 /* If this file is part of an archive, and the archive is
189 excluded, exclude this file. */
190 if (! skip
&& file
->the_bfd
!= NULL
191 && file
->the_bfd
->my_archive
!= NULL
192 && file
->the_bfd
->my_archive
->filename
!= NULL
)
195 skip
= fnmatch (list_tmp
->name
,
196 file
->the_bfd
->my_archive
->filename
,
199 skip
= strcmp (list_tmp
->name
,
200 file
->the_bfd
->my_archive
->filename
) == 0;
208 (*callback
) (ptr
, sec
, s
, file
, data
);
211 /* Lowest common denominator routine that can handle everything correctly,
215 walk_wild_section_general (lang_wild_statement_type
*ptr
,
216 lang_input_statement_type
*file
,
221 struct wildcard_list
*sec
;
223 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
225 sec
= ptr
->section_list
;
227 (*callback
) (ptr
, sec
, s
, file
, data
);
231 bfd_boolean skip
= FALSE
;
233 if (sec
->spec
.name
!= NULL
)
235 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
237 if (wildcardp (sec
->spec
.name
))
238 skip
= fnmatch (sec
->spec
.name
, sname
, 0) != 0;
240 skip
= strcmp (sec
->spec
.name
, sname
) != 0;
244 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
251 /* Routines to find a single section given its name. If there's more
252 than one section with that name, we report that. */
256 asection
*found_section
;
257 bfd_boolean multiple_sections_found
;
258 } section_iterator_callback_data
;
261 section_iterator_callback (bfd
*bfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
263 section_iterator_callback_data
*d
= data
;
265 if (d
->found_section
!= NULL
)
267 d
->multiple_sections_found
= TRUE
;
271 d
->found_section
= s
;
276 find_section (lang_input_statement_type
*file
,
277 struct wildcard_list
*sec
,
278 bfd_boolean
*multiple_sections_found
)
280 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
282 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
283 section_iterator_callback
, &cb_data
);
284 *multiple_sections_found
= cb_data
.multiple_sections_found
;
285 return cb_data
.found_section
;
288 /* Code for handling simple wildcards without going through fnmatch,
289 which can be expensive because of charset translations etc. */
291 /* A simple wild is a literal string followed by a single '*',
292 where the literal part is at least 4 characters long. */
295 is_simple_wild (const char *name
)
297 size_t len
= strcspn (name
, "*?[");
298 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
302 match_simple_wild (const char *pattern
, const char *name
)
304 /* The first four characters of the pattern are guaranteed valid
305 non-wildcard characters. So we can go faster. */
306 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
307 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
312 while (*pattern
!= '*')
313 if (*name
++ != *pattern
++)
319 /* Compare sections ASEC and BSEC according to SORT. */
322 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
331 case by_alignment_name
:
332 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
333 - bfd_section_alignment (asec
->owner
, asec
));
339 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
340 bfd_get_section_name (bsec
->owner
, bsec
));
343 case by_name_alignment
:
344 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
345 bfd_get_section_name (bsec
->owner
, bsec
));
351 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
352 - bfd_section_alignment (asec
->owner
, asec
));
359 /* Build a Binary Search Tree to sort sections, unlike insertion sort
360 used in wild_sort(). BST is considerably faster if the number of
361 of sections are large. */
363 static lang_section_bst_type
**
364 wild_sort_fast (lang_wild_statement_type
*wild
,
365 struct wildcard_list
*sec
,
366 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
369 lang_section_bst_type
**tree
;
372 if (!wild
->filenames_sorted
373 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
375 /* Append at the right end of tree. */
377 tree
= &((*tree
)->right
);
383 /* Find the correct node to append this section. */
384 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
385 tree
= &((*tree
)->left
);
387 tree
= &((*tree
)->right
);
393 /* Use wild_sort_fast to build a BST to sort sections. */
396 output_section_callback_fast (lang_wild_statement_type
*ptr
,
397 struct wildcard_list
*sec
,
399 lang_input_statement_type
*file
,
400 void *output ATTRIBUTE_UNUSED
)
402 lang_section_bst_type
*node
;
403 lang_section_bst_type
**tree
;
405 if (unique_section_p (section
))
408 node
= xmalloc (sizeof (lang_section_bst_type
));
411 node
->section
= section
;
413 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
418 /* Convert a sorted sections' BST back to list form. */
421 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
422 lang_section_bst_type
*tree
,
426 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
428 lang_add_section (&ptr
->children
, tree
->section
,
429 (lang_output_section_statement_type
*) output
);
432 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
437 /* Specialized, optimized routines for handling different kinds of
441 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
442 lang_input_statement_type
*file
,
446 /* We can just do a hash lookup for the section with the right name.
447 But if that lookup discovers more than one section with the name
448 (should be rare), we fall back to the general algorithm because
449 we would otherwise have to sort the sections to make sure they
450 get processed in the bfd's order. */
451 bfd_boolean multiple_sections_found
;
452 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
453 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
455 if (multiple_sections_found
)
456 walk_wild_section_general (ptr
, file
, callback
, data
);
458 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
462 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
463 lang_input_statement_type
*file
,
468 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
470 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
472 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
473 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
476 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
481 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
482 lang_input_statement_type
*file
,
487 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
488 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
489 bfd_boolean multiple_sections_found
;
490 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
492 if (multiple_sections_found
)
494 walk_wild_section_general (ptr
, file
, callback
, data
);
498 /* Note that if the section was not found, s0 is NULL and
499 we'll simply never succeed the s == s0 test below. */
500 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
502 /* Recall that in this code path, a section cannot satisfy more
503 than one spec, so if s == s0 then it cannot match
506 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
509 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
510 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
513 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
520 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
521 lang_input_statement_type
*file
,
526 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
527 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
528 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
529 bfd_boolean multiple_sections_found
;
530 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
532 if (multiple_sections_found
)
534 walk_wild_section_general (ptr
, file
, callback
, data
);
538 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
541 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
544 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
545 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
548 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
551 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
553 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
561 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
562 lang_input_statement_type
*file
,
567 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
568 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
569 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
570 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
571 bfd_boolean multiple_sections_found
;
572 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
574 if (multiple_sections_found
)
576 walk_wild_section_general (ptr
, file
, callback
, data
);
580 s1
= find_section (file
, sec1
, &multiple_sections_found
);
581 if (multiple_sections_found
)
583 walk_wild_section_general (ptr
, file
, callback
, data
);
587 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
590 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
593 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
596 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
597 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
601 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
605 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
607 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
615 walk_wild_section (lang_wild_statement_type
*ptr
,
616 lang_input_statement_type
*file
,
620 if (file
->just_syms_flag
)
623 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
626 /* Returns TRUE when name1 is a wildcard spec that might match
627 something name2 can match. We're conservative: we return FALSE
628 only if the prefixes of name1 and name2 are different up to the
629 first wildcard character. */
632 wild_spec_can_overlap (const char *name1
, const char *name2
)
634 size_t prefix1_len
= strcspn (name1
, "?*[");
635 size_t prefix2_len
= strcspn (name2
, "?*[");
636 size_t min_prefix_len
;
638 /* Note that if there is no wildcard character, then we treat the
639 terminating 0 as part of the prefix. Thus ".text" won't match
640 ".text." or ".text.*", for example. */
641 if (name1
[prefix1_len
] == '\0')
643 if (name2
[prefix2_len
] == '\0')
646 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
648 return memcmp (name1
, name2
, min_prefix_len
) == 0;
651 /* Select specialized code to handle various kinds of wildcard
655 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
658 int wild_name_count
= 0;
659 struct wildcard_list
*sec
;
663 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
664 ptr
->handler_data
[0] = NULL
;
665 ptr
->handler_data
[1] = NULL
;
666 ptr
->handler_data
[2] = NULL
;
667 ptr
->handler_data
[3] = NULL
;
670 /* Count how many wildcard_specs there are, and how many of those
671 actually use wildcards in the name. Also, bail out if any of the
672 wildcard names are NULL. (Can this actually happen?
673 walk_wild_section used to test for it.) And bail out if any
674 of the wildcards are more complex than a simple string
675 ending in a single '*'. */
676 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
679 if (sec
->spec
.name
== NULL
)
681 if (wildcardp (sec
->spec
.name
))
684 if (!is_simple_wild (sec
->spec
.name
))
689 /* The zero-spec case would be easy to optimize but it doesn't
690 happen in practice. Likewise, more than 4 specs doesn't
691 happen in practice. */
692 if (sec_count
== 0 || sec_count
> 4)
695 /* Check that no two specs can match the same section. */
696 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
698 struct wildcard_list
*sec2
;
699 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
701 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
706 signature
= (sec_count
<< 8) + wild_name_count
;
710 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
713 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
716 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
719 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
722 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
728 /* Now fill the data array with pointers to the specs, first the
729 specs with non-wildcard names, then the specs with wildcard
730 names. It's OK to process the specs in different order from the
731 given order, because we've already determined that no section
732 will match more than one spec. */
734 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
735 if (!wildcardp (sec
->spec
.name
))
736 ptr
->handler_data
[data_counter
++] = sec
;
737 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
738 if (wildcardp (sec
->spec
.name
))
739 ptr
->handler_data
[data_counter
++] = sec
;
742 /* Handle a wild statement for a single file F. */
745 walk_wild_file (lang_wild_statement_type
*s
,
746 lang_input_statement_type
*f
,
750 if (f
->the_bfd
== NULL
751 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
752 walk_wild_section (s
, f
, callback
, data
);
757 /* This is an archive file. We must map each member of the
758 archive separately. */
759 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
760 while (member
!= NULL
)
762 /* When lookup_name is called, it will call the add_symbols
763 entry point for the archive. For each element of the
764 archive which is included, BFD will call ldlang_add_file,
765 which will set the usrdata field of the member to the
766 lang_input_statement. */
767 if (member
->usrdata
!= NULL
)
769 walk_wild_section (s
, member
->usrdata
, callback
, data
);
772 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
778 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
780 const char *file_spec
= s
->filename
;
782 if (file_spec
== NULL
)
784 /* Perform the iteration over all files in the list. */
785 LANG_FOR_EACH_INPUT_STATEMENT (f
)
787 walk_wild_file (s
, f
, callback
, data
);
790 else if (wildcardp (file_spec
))
792 LANG_FOR_EACH_INPUT_STATEMENT (f
)
794 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
795 walk_wild_file (s
, f
, callback
, data
);
800 lang_input_statement_type
*f
;
802 /* Perform the iteration over a single file. */
803 f
= lookup_name (file_spec
);
805 walk_wild_file (s
, f
, callback
, data
);
809 /* lang_for_each_statement walks the parse tree and calls the provided
810 function for each node. */
813 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
814 lang_statement_union_type
*s
)
816 for (; s
!= NULL
; s
= s
->header
.next
)
820 switch (s
->header
.type
)
822 case lang_constructors_statement_enum
:
823 lang_for_each_statement_worker (func
, constructor_list
.head
);
825 case lang_output_section_statement_enum
:
826 lang_for_each_statement_worker
827 (func
, s
->output_section_statement
.children
.head
);
829 case lang_wild_statement_enum
:
830 lang_for_each_statement_worker (func
,
831 s
->wild_statement
.children
.head
);
833 case lang_group_statement_enum
:
834 lang_for_each_statement_worker (func
,
835 s
->group_statement
.children
.head
);
837 case lang_data_statement_enum
:
838 case lang_reloc_statement_enum
:
839 case lang_object_symbols_statement_enum
:
840 case lang_output_statement_enum
:
841 case lang_target_statement_enum
:
842 case lang_input_section_enum
:
843 case lang_input_statement_enum
:
844 case lang_assignment_statement_enum
:
845 case lang_padding_statement_enum
:
846 case lang_address_statement_enum
:
847 case lang_fill_statement_enum
:
848 case lang_insert_statement_enum
:
858 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
860 lang_for_each_statement_worker (func
, statement_list
.head
);
863 /*----------------------------------------------------------------------*/
866 lang_list_init (lang_statement_list_type
*list
)
869 list
->tail
= &list
->head
;
872 /* Build a new statement node for the parse tree. */
874 static lang_statement_union_type
*
875 new_statement (enum statement_enum type
,
877 lang_statement_list_type
*list
)
879 lang_statement_union_type
*new;
881 new = stat_alloc (size
);
882 new->header
.type
= type
;
883 new->header
.next
= NULL
;
884 lang_statement_append (list
, new, &new->header
.next
);
888 /* Build a new input file node for the language. There are several
889 ways in which we treat an input file, eg, we only look at symbols,
890 or prefix it with a -l etc.
892 We can be supplied with requests for input files more than once;
893 they may, for example be split over several lines like foo.o(.text)
894 foo.o(.data) etc, so when asked for a file we check that we haven't
895 got it already so we don't duplicate the bfd. */
897 static lang_input_statement_type
*
898 new_afile (const char *name
,
899 lang_input_file_enum_type file_type
,
901 bfd_boolean add_to_list
)
903 lang_input_statement_type
*p
;
906 p
= new_stat (lang_input_statement
, stat_ptr
);
909 p
= stat_alloc (sizeof (lang_input_statement_type
));
910 p
->header
.type
= lang_input_statement_enum
;
911 p
->header
.next
= NULL
;
914 lang_has_input_file
= TRUE
;
916 p
->sysrooted
= FALSE
;
918 if (file_type
== lang_input_file_is_l_enum
919 && name
[0] == ':' && name
[1] != '\0')
921 file_type
= lang_input_file_is_search_file_enum
;
927 case lang_input_file_is_symbols_only_enum
:
929 p
->is_archive
= FALSE
;
931 p
->local_sym_name
= name
;
932 p
->just_syms_flag
= TRUE
;
933 p
->search_dirs_flag
= FALSE
;
935 case lang_input_file_is_fake_enum
:
937 p
->is_archive
= FALSE
;
939 p
->local_sym_name
= name
;
940 p
->just_syms_flag
= FALSE
;
941 p
->search_dirs_flag
= FALSE
;
943 case lang_input_file_is_l_enum
:
944 p
->is_archive
= TRUE
;
947 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
948 p
->just_syms_flag
= FALSE
;
949 p
->search_dirs_flag
= TRUE
;
951 case lang_input_file_is_marker_enum
:
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_search_file_enum
:
960 p
->sysrooted
= ldlang_sysrooted_script
;
962 p
->is_archive
= FALSE
;
964 p
->local_sym_name
= name
;
965 p
->just_syms_flag
= FALSE
;
966 p
->search_dirs_flag
= TRUE
;
968 case lang_input_file_is_file_enum
:
970 p
->is_archive
= FALSE
;
972 p
->local_sym_name
= name
;
973 p
->just_syms_flag
= FALSE
;
974 p
->search_dirs_flag
= FALSE
;
981 p
->next_real_file
= NULL
;
984 p
->dynamic
= config
.dynamic_link
;
985 p
->add_needed
= add_needed
;
986 p
->as_needed
= as_needed
;
987 p
->whole_archive
= whole_archive
;
989 lang_statement_append (&input_file_chain
,
990 (lang_statement_union_type
*) p
,
995 lang_input_statement_type
*
996 lang_add_input_file (const char *name
,
997 lang_input_file_enum_type file_type
,
1000 return new_afile (name
, file_type
, target
, TRUE
);
1003 struct out_section_hash_entry
1005 struct bfd_hash_entry root
;
1006 lang_statement_union_type s
;
1009 /* The hash table. */
1011 static struct bfd_hash_table output_section_statement_table
;
1013 /* Support routines for the hash table used by lang_output_section_find,
1014 initialize the table, fill in an entry and remove the table. */
1016 static struct bfd_hash_entry
*
1017 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1018 struct bfd_hash_table
*table
,
1021 lang_output_section_statement_type
**nextp
;
1022 struct out_section_hash_entry
*ret
;
1026 entry
= bfd_hash_allocate (table
, sizeof (*ret
));
1031 entry
= bfd_hash_newfunc (entry
, table
, string
);
1035 ret
= (struct out_section_hash_entry
*) entry
;
1036 memset (&ret
->s
, 0, sizeof (ret
->s
));
1037 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1038 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1039 ret
->s
.output_section_statement
.section_alignment
= -1;
1040 ret
->s
.output_section_statement
.block_value
= 1;
1041 lang_list_init (&ret
->s
.output_section_statement
.children
);
1042 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1044 /* For every output section statement added to the list, except the
1045 first one, lang_output_section_statement.tail points to the "next"
1046 field of the last element of the list. */
1047 if (lang_output_section_statement
.head
!= NULL
)
1048 ret
->s
.output_section_statement
.prev
1049 = ((lang_output_section_statement_type
*)
1050 ((char *) lang_output_section_statement
.tail
1051 - offsetof (lang_output_section_statement_type
, next
)));
1053 /* GCC's strict aliasing rules prevent us from just casting the
1054 address, so we store the pointer in a variable and cast that
1056 nextp
= &ret
->s
.output_section_statement
.next
;
1057 lang_statement_append (&lang_output_section_statement
,
1059 (lang_statement_union_type
**) nextp
);
1064 output_section_statement_table_init (void)
1066 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1067 output_section_statement_newfunc
,
1068 sizeof (struct out_section_hash_entry
),
1070 einfo (_("%P%F: can not create hash table: %E\n"));
1074 output_section_statement_table_free (void)
1076 bfd_hash_table_free (&output_section_statement_table
);
1079 /* Build enough state so that the parser can build its tree. */
1084 obstack_begin (&stat_obstack
, 1000);
1086 stat_ptr
= &statement_list
;
1088 output_section_statement_table_init ();
1090 lang_list_init (stat_ptr
);
1092 lang_list_init (&input_file_chain
);
1093 lang_list_init (&lang_output_section_statement
);
1094 lang_list_init (&file_chain
);
1095 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1097 abs_output_section
=
1098 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
1100 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1102 /* The value "3" is ad-hoc, somewhat related to the expected number of
1103 DEFINED expressions in a linker script. For most default linker
1104 scripts, there are none. Why a hash table then? Well, it's somewhat
1105 simpler to re-use working machinery than using a linked list in terms
1106 of code-complexity here in ld, besides the initialization which just
1107 looks like other code here. */
1108 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1109 lang_definedness_newfunc
,
1110 sizeof (struct lang_definedness_hash_entry
),
1112 einfo (_("%P%F: can not create hash table: %E\n"));
1118 output_section_statement_table_free ();
1121 /*----------------------------------------------------------------------
1122 A region is an area of memory declared with the
1123 MEMORY { name:org=exp, len=exp ... }
1126 We maintain a list of all the regions here.
1128 If no regions are specified in the script, then the default is used
1129 which is created when looked up to be the entire data space.
1131 If create is true we are creating a region inside a MEMORY block.
1132 In this case it is probably an error to create a region that has
1133 already been created. If we are not inside a MEMORY block it is
1134 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1135 and so we issue a warning. */
1137 static lang_memory_region_type
*lang_memory_region_list
;
1138 static lang_memory_region_type
**lang_memory_region_list_tail
1139 = &lang_memory_region_list
;
1141 lang_memory_region_type
*
1142 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1144 lang_memory_region_type
*p
;
1145 lang_memory_region_type
*new;
1147 /* NAME is NULL for LMA memspecs if no region was specified. */
1151 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1152 if (strcmp (p
->name
, name
) == 0)
1155 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1160 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1161 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
1163 new = stat_alloc (sizeof (lang_memory_region_type
));
1165 new->name
= xstrdup (name
);
1168 new->length
= ~(bfd_size_type
) 0;
1170 new->last_os
= NULL
;
1173 new->had_full_message
= FALSE
;
1175 *lang_memory_region_list_tail
= new;
1176 lang_memory_region_list_tail
= &new->next
;
1181 static lang_memory_region_type
*
1182 lang_memory_default (asection
*section
)
1184 lang_memory_region_type
*p
;
1186 flagword sec_flags
= section
->flags
;
1188 /* Override SEC_DATA to mean a writable section. */
1189 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1190 sec_flags
|= SEC_DATA
;
1192 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1194 if ((p
->flags
& sec_flags
) != 0
1195 && (p
->not_flags
& sec_flags
) == 0)
1200 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1203 lang_output_section_statement_type
*
1204 lang_output_section_find (const char *const name
)
1206 struct out_section_hash_entry
*entry
;
1209 entry
= ((struct out_section_hash_entry
*)
1210 bfd_hash_lookup (&output_section_statement_table
, name
,
1215 hash
= entry
->root
.hash
;
1218 if (entry
->s
.output_section_statement
.constraint
!= -1)
1219 return &entry
->s
.output_section_statement
;
1220 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1222 while (entry
!= NULL
1223 && entry
->root
.hash
== hash
1224 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1229 static lang_output_section_statement_type
*
1230 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1232 struct out_section_hash_entry
*entry
;
1233 struct out_section_hash_entry
*last_ent
;
1236 entry
= ((struct out_section_hash_entry
*)
1237 bfd_hash_lookup (&output_section_statement_table
, name
,
1241 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1245 if (entry
->s
.output_section_statement
.name
!= NULL
)
1247 /* We have a section of this name, but it might not have the correct
1249 hash
= entry
->root
.hash
;
1252 if (entry
->s
.output_section_statement
.constraint
!= -1
1254 || (constraint
== entry
->s
.output_section_statement
.constraint
1255 && constraint
!= SPECIAL
)))
1256 return &entry
->s
.output_section_statement
;
1258 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1260 while (entry
!= NULL
1261 && entry
->root
.hash
== hash
1262 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1265 = ((struct out_section_hash_entry
*)
1266 output_section_statement_newfunc (NULL
,
1267 &output_section_statement_table
,
1271 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1274 entry
->root
= last_ent
->root
;
1275 last_ent
->root
.next
= &entry
->root
;
1278 entry
->s
.output_section_statement
.name
= name
;
1279 entry
->s
.output_section_statement
.constraint
= constraint
;
1280 return &entry
->s
.output_section_statement
;
1283 lang_output_section_statement_type
*
1284 lang_output_section_statement_lookup (const char *const name
)
1286 return lang_output_section_statement_lookup_1 (name
, 0);
1289 /* A variant of lang_output_section_find used by place_orphan.
1290 Returns the output statement that should precede a new output
1291 statement for SEC. If an exact match is found on certain flags,
1294 lang_output_section_statement_type
*
1295 lang_output_section_find_by_flags (const asection
*sec
,
1296 lang_output_section_statement_type
**exact
,
1297 lang_match_sec_type_func match_type
)
1299 lang_output_section_statement_type
*first
, *look
, *found
;
1302 /* We know the first statement on this list is *ABS*. May as well
1304 first
= &lang_output_section_statement
.head
->output_section_statement
;
1305 first
= first
->next
;
1307 /* First try for an exact match. */
1309 for (look
= first
; look
; look
= look
->next
)
1311 flags
= look
->flags
;
1312 if (look
->bfd_section
!= NULL
)
1314 flags
= look
->bfd_section
->flags
;
1315 if (match_type
&& !match_type (link_info
.output_bfd
,
1320 flags
^= sec
->flags
;
1321 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1322 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1332 if (sec
->flags
& SEC_CODE
)
1334 /* Try for a rw code section. */
1335 for (look
= first
; look
; look
= look
->next
)
1337 flags
= look
->flags
;
1338 if (look
->bfd_section
!= NULL
)
1340 flags
= look
->bfd_section
->flags
;
1341 if (match_type
&& !match_type (link_info
.output_bfd
,
1346 flags
^= sec
->flags
;
1347 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1348 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1352 else if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1354 /* .rodata can go after .text, .sdata2 after .rodata. */
1355 for (look
= first
; look
; look
= look
->next
)
1357 flags
= look
->flags
;
1358 if (look
->bfd_section
!= NULL
)
1360 flags
= look
->bfd_section
->flags
;
1361 if (match_type
&& !match_type (link_info
.output_bfd
,
1366 flags
^= sec
->flags
;
1367 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1369 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1373 else if (sec
->flags
& SEC_SMALL_DATA
)
1375 /* .sdata goes after .data, .sbss after .sdata. */
1376 for (look
= first
; look
; look
= look
->next
)
1378 flags
= look
->flags
;
1379 if (look
->bfd_section
!= NULL
)
1381 flags
= look
->bfd_section
->flags
;
1382 if (match_type
&& !match_type (link_info
.output_bfd
,
1387 flags
^= sec
->flags
;
1388 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1389 | SEC_THREAD_LOCAL
))
1390 || ((look
->flags
& SEC_SMALL_DATA
)
1391 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1395 else if (sec
->flags
& SEC_HAS_CONTENTS
)
1397 /* .data goes after .rodata. */
1398 for (look
= first
; look
; look
= look
->next
)
1400 flags
= look
->flags
;
1401 if (look
->bfd_section
!= NULL
)
1403 flags
= look
->bfd_section
->flags
;
1404 if (match_type
&& !match_type (link_info
.output_bfd
,
1409 flags
^= sec
->flags
;
1410 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1411 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1417 /* .bss goes last. */
1418 for (look
= first
; look
; look
= look
->next
)
1420 flags
= look
->flags
;
1421 if (look
->bfd_section
!= NULL
)
1423 flags
= look
->bfd_section
->flags
;
1424 if (match_type
&& !match_type (link_info
.output_bfd
,
1429 flags
^= sec
->flags
;
1430 if (!(flags
& SEC_ALLOC
))
1435 if (found
|| !match_type
)
1438 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1441 /* Find the last output section before given output statement.
1442 Used by place_orphan. */
1445 output_prev_sec_find (lang_output_section_statement_type
*os
)
1447 lang_output_section_statement_type
*lookup
;
1449 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1451 if (lookup
->constraint
== -1)
1454 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1455 return lookup
->bfd_section
;
1461 /* Look for a suitable place for a new output section statement. The
1462 idea is to skip over anything that might be inside a SECTIONS {}
1463 statement in a script, before we find another output section
1464 statement. Assignments to "dot" before an output section statement
1465 are assumed to belong to it. An exception to this rule is made for
1466 the first assignment to dot, otherwise we might put an orphan
1467 before . = . + SIZEOF_HEADERS or similar assignments that set the
1470 static lang_statement_union_type
**
1471 insert_os_after (lang_output_section_statement_type
*after
)
1473 lang_statement_union_type
**where
;
1474 lang_statement_union_type
**assign
= NULL
;
1475 bfd_boolean ignore_first
;
1478 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1480 for (where
= &after
->header
.next
;
1482 where
= &(*where
)->header
.next
)
1484 switch ((*where
)->header
.type
)
1486 case lang_assignment_statement_enum
:
1489 lang_assignment_statement_type
*ass
;
1491 ass
= &(*where
)->assignment_statement
;
1492 if (ass
->exp
->type
.node_class
!= etree_assert
1493 && ass
->exp
->assign
.dst
[0] == '.'
1494 && ass
->exp
->assign
.dst
[1] == 0
1498 ignore_first
= FALSE
;
1500 case lang_wild_statement_enum
:
1501 case lang_input_section_enum
:
1502 case lang_object_symbols_statement_enum
:
1503 case lang_fill_statement_enum
:
1504 case lang_data_statement_enum
:
1505 case lang_reloc_statement_enum
:
1506 case lang_padding_statement_enum
:
1507 case lang_constructors_statement_enum
:
1510 case lang_output_section_statement_enum
:
1514 case lang_input_statement_enum
:
1515 case lang_address_statement_enum
:
1516 case lang_target_statement_enum
:
1517 case lang_output_statement_enum
:
1518 case lang_group_statement_enum
:
1519 case lang_insert_statement_enum
:
1528 lang_output_section_statement_type
*
1529 lang_insert_orphan (asection
*s
,
1530 const char *secname
,
1531 lang_output_section_statement_type
*after
,
1532 struct orphan_save
*place
,
1533 etree_type
*address
,
1534 lang_statement_list_type
*add_child
)
1536 lang_statement_list_type
*old
;
1537 lang_statement_list_type add
;
1539 lang_output_section_statement_type
*os
;
1540 lang_output_section_statement_type
**os_tail
;
1542 /* Start building a list of statements for this section.
1543 First save the current statement pointer. */
1546 /* If we have found an appropriate place for the output section
1547 statements for this orphan, add them to our own private list,
1548 inserting them later into the global statement list. */
1552 lang_list_init (stat_ptr
);
1556 if (config
.build_constructors
)
1558 /* If the name of the section is representable in C, then create
1559 symbols to mark the start and the end of the section. */
1560 for (ps
= secname
; *ps
!= '\0'; ps
++)
1561 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1566 etree_type
*e_align
;
1568 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1569 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1570 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1571 e_align
= exp_unop (ALIGN_K
,
1572 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1573 lang_add_assignment (exp_assop ('=', ".", e_align
));
1574 lang_add_assignment (exp_provide (symname
,
1575 exp_nameop (NAME
, "."),
1580 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1581 address
= exp_intop (0);
1583 os_tail
= ((lang_output_section_statement_type
**)
1584 lang_output_section_statement
.tail
);
1585 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1588 if (add_child
== NULL
)
1589 add_child
= &os
->children
;
1590 lang_add_section (add_child
, s
, os
);
1592 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1594 if (config
.build_constructors
&& *ps
== '\0')
1598 /* lang_leave_ouput_section_statement resets stat_ptr.
1599 Put stat_ptr back where we want it. */
1603 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1604 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1605 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1606 lang_add_assignment (exp_provide (symname
,
1607 exp_nameop (NAME
, "."),
1611 /* Restore the global list pointer. */
1615 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1617 asection
*snew
, *as
;
1619 snew
= os
->bfd_section
;
1621 /* Shuffle the bfd section list to make the output file look
1622 neater. This is really only cosmetic. */
1623 if (place
->section
== NULL
1624 && after
!= (&lang_output_section_statement
.head
1625 ->output_section_statement
))
1627 asection
*bfd_section
= after
->bfd_section
;
1629 /* If the output statement hasn't been used to place any input
1630 sections (and thus doesn't have an output bfd_section),
1631 look for the closest prior output statement having an
1633 if (bfd_section
== NULL
)
1634 bfd_section
= output_prev_sec_find (after
);
1636 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1637 place
->section
= &bfd_section
->next
;
1640 if (place
->section
== NULL
)
1641 place
->section
= &link_info
.output_bfd
->sections
;
1643 as
= *place
->section
;
1647 /* Put the section at the end of the list. */
1649 /* Unlink the section. */
1650 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1652 /* Now tack it back on in the right place. */
1653 bfd_section_list_append (link_info
.output_bfd
, snew
);
1655 else if (as
!= snew
&& as
->prev
!= snew
)
1657 /* Unlink the section. */
1658 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1660 /* Now tack it back on in the right place. */
1661 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1664 /* Save the end of this list. Further ophans of this type will
1665 follow the one we've just added. */
1666 place
->section
= &snew
->next
;
1668 /* The following is non-cosmetic. We try to put the output
1669 statements in some sort of reasonable order here, because they
1670 determine the final load addresses of the orphan sections.
1671 In addition, placing output statements in the wrong order may
1672 require extra segments. For instance, given a typical
1673 situation of all read-only sections placed in one segment and
1674 following that a segment containing all the read-write
1675 sections, we wouldn't want to place an orphan read/write
1676 section before or amongst the read-only ones. */
1677 if (add
.head
!= NULL
)
1679 lang_output_section_statement_type
*newly_added_os
;
1681 if (place
->stmt
== NULL
)
1683 lang_statement_union_type
**where
= insert_os_after (after
);
1688 place
->os_tail
= &after
->next
;
1692 /* Put it after the last orphan statement we added. */
1693 *add
.tail
= *place
->stmt
;
1694 *place
->stmt
= add
.head
;
1697 /* Fix the global list pointer if we happened to tack our
1698 new list at the tail. */
1699 if (*old
->tail
== add
.head
)
1700 old
->tail
= add
.tail
;
1702 /* Save the end of this list. */
1703 place
->stmt
= add
.tail
;
1705 /* Do the same for the list of output section statements. */
1706 newly_added_os
= *os_tail
;
1708 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1709 ((char *) place
->os_tail
1710 - offsetof (lang_output_section_statement_type
, next
));
1711 newly_added_os
->next
= *place
->os_tail
;
1712 if (newly_added_os
->next
!= NULL
)
1713 newly_added_os
->next
->prev
= newly_added_os
;
1714 *place
->os_tail
= newly_added_os
;
1715 place
->os_tail
= &newly_added_os
->next
;
1717 /* Fixing the global list pointer here is a little different.
1718 We added to the list in lang_enter_output_section_statement,
1719 trimmed off the new output_section_statment above when
1720 assigning *os_tail = NULL, but possibly added it back in
1721 the same place when assigning *place->os_tail. */
1722 if (*os_tail
== NULL
)
1723 lang_output_section_statement
.tail
1724 = (lang_statement_union_type
**) os_tail
;
1731 lang_map_flags (flagword flag
)
1733 if (flag
& SEC_ALLOC
)
1736 if (flag
& SEC_CODE
)
1739 if (flag
& SEC_READONLY
)
1742 if (flag
& SEC_DATA
)
1745 if (flag
& SEC_LOAD
)
1752 lang_memory_region_type
*m
;
1753 bfd_boolean dis_header_printed
= FALSE
;
1756 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1760 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1761 || file
->just_syms_flag
)
1764 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1765 if ((s
->output_section
== NULL
1766 || s
->output_section
->owner
!= link_info
.output_bfd
)
1767 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1769 if (! dis_header_printed
)
1771 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1772 dis_header_printed
= TRUE
;
1775 print_input_section (s
);
1779 minfo (_("\nMemory Configuration\n\n"));
1780 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1781 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1783 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1788 fprintf (config
.map_file
, "%-16s ", m
->name
);
1790 sprintf_vma (buf
, m
->origin
);
1791 minfo ("0x%s ", buf
);
1799 minfo ("0x%V", m
->length
);
1800 if (m
->flags
|| m
->not_flags
)
1808 lang_map_flags (m
->flags
);
1814 lang_map_flags (m
->not_flags
);
1821 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1823 if (! link_info
.reduce_memory_overheads
)
1825 obstack_begin (&map_obstack
, 1000);
1826 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1827 bfd_map_over_sections (p
, init_map_userdata
, 0);
1828 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1830 lang_statement_iteration
++;
1831 print_statements ();
1835 init_map_userdata (abfd
, sec
, data
)
1836 bfd
*abfd ATTRIBUTE_UNUSED
;
1838 void *data ATTRIBUTE_UNUSED
;
1840 fat_section_userdata_type
*new_data
1841 = ((fat_section_userdata_type
*) (stat_alloc
1842 (sizeof (fat_section_userdata_type
))));
1844 ASSERT (get_userdata (sec
) == NULL
);
1845 get_userdata (sec
) = new_data
;
1846 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1850 sort_def_symbol (hash_entry
, info
)
1851 struct bfd_link_hash_entry
*hash_entry
;
1852 void *info ATTRIBUTE_UNUSED
;
1854 if (hash_entry
->type
== bfd_link_hash_defined
1855 || hash_entry
->type
== bfd_link_hash_defweak
)
1857 struct fat_user_section_struct
*ud
;
1858 struct map_symbol_def
*def
;
1860 ud
= get_userdata (hash_entry
->u
.def
.section
);
1863 /* ??? What do we have to do to initialize this beforehand? */
1864 /* The first time we get here is bfd_abs_section... */
1865 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1866 ud
= get_userdata (hash_entry
->u
.def
.section
);
1868 else if (!ud
->map_symbol_def_tail
)
1869 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1871 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1872 def
->entry
= hash_entry
;
1873 *(ud
->map_symbol_def_tail
) = def
;
1874 ud
->map_symbol_def_tail
= &def
->next
;
1879 /* Initialize an output section. */
1882 init_os (lang_output_section_statement_type
*s
, asection
*isec
,
1885 if (s
->bfd_section
!= NULL
)
1888 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1889 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1891 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
1892 if (s
->bfd_section
== NULL
)
1893 s
->bfd_section
= bfd_make_section_with_flags (link_info
.output_bfd
,
1895 if (s
->bfd_section
== NULL
)
1897 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1898 link_info
.output_bfd
->xvec
->name
, s
->name
);
1900 s
->bfd_section
->output_section
= s
->bfd_section
;
1901 s
->bfd_section
->output_offset
= 0;
1903 if (!link_info
.reduce_memory_overheads
)
1905 fat_section_userdata_type
*new
1906 = stat_alloc (sizeof (fat_section_userdata_type
));
1907 memset (new, 0, sizeof (fat_section_userdata_type
));
1908 get_userdata (s
->bfd_section
) = new;
1911 /* If there is a base address, make sure that any sections it might
1912 mention are initialized. */
1913 if (s
->addr_tree
!= NULL
)
1914 exp_init_os (s
->addr_tree
);
1916 if (s
->load_base
!= NULL
)
1917 exp_init_os (s
->load_base
);
1919 /* If supplied an alignment, set it. */
1920 if (s
->section_alignment
!= -1)
1921 s
->bfd_section
->alignment_power
= s
->section_alignment
;
1924 bfd_init_private_section_data (isec
->owner
, isec
,
1925 link_info
.output_bfd
, s
->bfd_section
,
1929 /* Make sure that all output sections mentioned in an expression are
1933 exp_init_os (etree_type
*exp
)
1935 switch (exp
->type
.node_class
)
1939 exp_init_os (exp
->assign
.src
);
1943 exp_init_os (exp
->binary
.lhs
);
1944 exp_init_os (exp
->binary
.rhs
);
1948 exp_init_os (exp
->trinary
.cond
);
1949 exp_init_os (exp
->trinary
.lhs
);
1950 exp_init_os (exp
->trinary
.rhs
);
1954 exp_init_os (exp
->assert_s
.child
);
1958 exp_init_os (exp
->unary
.child
);
1962 switch (exp
->type
.node_code
)
1968 lang_output_section_statement_type
*os
;
1970 os
= lang_output_section_find (exp
->name
.name
);
1971 if (os
!= NULL
&& os
->bfd_section
== NULL
)
1972 init_os (os
, NULL
, 0);
1983 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
1985 lang_input_statement_type
*entry
= data
;
1987 /* If we are only reading symbols from this object, then we want to
1988 discard all sections. */
1989 if (entry
->just_syms_flag
)
1991 bfd_link_just_syms (abfd
, sec
, &link_info
);
1995 if (!(abfd
->flags
& DYNAMIC
))
1996 bfd_section_already_linked (abfd
, sec
, &link_info
);
1999 /* The wild routines.
2001 These expand statements like *(.text) and foo.o to a list of
2002 explicit actions, like foo.o(.text), bar.o(.text) and
2003 foo.o(.text, .data). */
2005 /* Add SECTION to the output section OUTPUT. Do this by creating a
2006 lang_input_section statement which is placed at PTR. FILE is the
2007 input file which holds SECTION. */
2010 lang_add_section (lang_statement_list_type
*ptr
,
2012 lang_output_section_statement_type
*output
)
2014 flagword flags
= section
->flags
;
2015 bfd_boolean discard
;
2017 /* Discard sections marked with SEC_EXCLUDE. */
2018 discard
= (flags
& SEC_EXCLUDE
) != 0;
2020 /* Discard input sections which are assigned to a section named
2021 DISCARD_SECTION_NAME. */
2022 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2025 /* Discard debugging sections if we are stripping debugging
2027 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2028 && (flags
& SEC_DEBUGGING
) != 0)
2033 if (section
->output_section
== NULL
)
2035 /* This prevents future calls from assigning this section. */
2036 section
->output_section
= bfd_abs_section_ptr
;
2041 if (section
->output_section
== NULL
)
2044 lang_input_section_type
*new;
2047 flags
= section
->flags
;
2049 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2050 to an output section, because we want to be able to include a
2051 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2052 section (I don't know why we want to do this, but we do).
2053 build_link_order in ldwrite.c handles this case by turning
2054 the embedded SEC_NEVER_LOAD section into a fill. */
2056 flags
&= ~ SEC_NEVER_LOAD
;
2058 switch (output
->sectype
)
2060 case normal_section
:
2061 case overlay_section
:
2063 case noalloc_section
:
2064 flags
&= ~SEC_ALLOC
;
2066 case noload_section
:
2068 flags
|= SEC_NEVER_LOAD
;
2072 if (output
->bfd_section
== NULL
)
2073 init_os (output
, section
, flags
);
2075 first
= ! output
->bfd_section
->linker_has_input
;
2076 output
->bfd_section
->linker_has_input
= 1;
2078 if (!link_info
.relocatable
2079 && !stripped_excluded_sections
)
2081 asection
*s
= output
->bfd_section
->map_tail
.s
;
2082 output
->bfd_section
->map_tail
.s
= section
;
2083 section
->map_head
.s
= NULL
;
2084 section
->map_tail
.s
= s
;
2086 s
->map_head
.s
= section
;
2088 output
->bfd_section
->map_head
.s
= section
;
2091 /* Add a section reference to the list. */
2092 new = new_stat (lang_input_section
, ptr
);
2094 new->section
= section
;
2095 section
->output_section
= output
->bfd_section
;
2097 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2098 already been processed. One reason to do this is that on pe
2099 format targets, .text$foo sections go into .text and it's odd
2100 to see .text with SEC_LINK_ONCE set. */
2102 if (! link_info
.relocatable
)
2103 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
2105 /* If this is not the first input section, and the SEC_READONLY
2106 flag is not currently set, then don't set it just because the
2107 input section has it set. */
2109 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
2110 flags
&= ~ SEC_READONLY
;
2112 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2114 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2115 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2116 || ((flags
& SEC_MERGE
)
2117 && output
->bfd_section
->entsize
!= section
->entsize
)))
2119 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2120 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2123 output
->bfd_section
->flags
|= flags
;
2125 if (flags
& SEC_MERGE
)
2126 output
->bfd_section
->entsize
= section
->entsize
;
2128 /* If SEC_READONLY is not set in the input section, then clear
2129 it from the output section. */
2130 if ((section
->flags
& SEC_READONLY
) == 0)
2131 output
->bfd_section
->flags
&= ~SEC_READONLY
;
2133 /* Copy over SEC_SMALL_DATA. */
2134 if (section
->flags
& SEC_SMALL_DATA
)
2135 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
2137 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2138 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2140 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
2141 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
2143 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
2144 /* FIXME: This value should really be obtained from the bfd... */
2145 output
->block_value
= 128;
2150 /* Handle wildcard sorting. This returns the lang_input_section which
2151 should follow the one we are going to create for SECTION and FILE,
2152 based on the sorting requirements of WILD. It returns NULL if the
2153 new section should just go at the end of the current list. */
2155 static lang_statement_union_type
*
2156 wild_sort (lang_wild_statement_type
*wild
,
2157 struct wildcard_list
*sec
,
2158 lang_input_statement_type
*file
,
2161 const char *section_name
;
2162 lang_statement_union_type
*l
;
2164 if (!wild
->filenames_sorted
2165 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2168 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2169 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2171 lang_input_section_type
*ls
;
2173 if (l
->header
.type
!= lang_input_section_enum
)
2175 ls
= &l
->input_section
;
2177 /* Sorting by filename takes precedence over sorting by section
2180 if (wild
->filenames_sorted
)
2182 const char *fn
, *ln
;
2186 /* The PE support for the .idata section as generated by
2187 dlltool assumes that files will be sorted by the name of
2188 the archive and then the name of the file within the
2191 if (file
->the_bfd
!= NULL
2192 && bfd_my_archive (file
->the_bfd
) != NULL
)
2194 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2199 fn
= file
->filename
;
2203 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2205 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2210 ln
= ls
->section
->owner
->filename
;
2214 i
= strcmp (fn
, ln
);
2223 fn
= file
->filename
;
2225 ln
= ls
->section
->owner
->filename
;
2227 i
= strcmp (fn
, ln
);
2235 /* Here either the files are not sorted by name, or we are
2236 looking at the sections for this file. */
2238 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2239 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2246 /* Expand a wild statement for a particular FILE. SECTION may be
2247 NULL, in which case it is a wild card. */
2250 output_section_callback (lang_wild_statement_type
*ptr
,
2251 struct wildcard_list
*sec
,
2253 lang_input_statement_type
*file
,
2256 lang_statement_union_type
*before
;
2258 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2259 if (unique_section_p (section
))
2262 before
= wild_sort (ptr
, sec
, file
, section
);
2264 /* Here BEFORE points to the lang_input_section which
2265 should follow the one we are about to add. If BEFORE
2266 is NULL, then the section should just go at the end
2267 of the current list. */
2270 lang_add_section (&ptr
->children
, section
,
2271 (lang_output_section_statement_type
*) output
);
2274 lang_statement_list_type list
;
2275 lang_statement_union_type
**pp
;
2277 lang_list_init (&list
);
2278 lang_add_section (&list
, section
,
2279 (lang_output_section_statement_type
*) output
);
2281 /* If we are discarding the section, LIST.HEAD will
2283 if (list
.head
!= NULL
)
2285 ASSERT (list
.head
->header
.next
== NULL
);
2287 for (pp
= &ptr
->children
.head
;
2289 pp
= &(*pp
)->header
.next
)
2290 ASSERT (*pp
!= NULL
);
2292 list
.head
->header
.next
= *pp
;
2298 /* Check if all sections in a wild statement for a particular FILE
2302 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2303 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2305 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2308 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2309 if (unique_section_p (section
))
2312 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2313 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2316 /* This is passed a file name which must have been seen already and
2317 added to the statement tree. We will see if it has been opened
2318 already and had its symbols read. If not then we'll read it. */
2320 static lang_input_statement_type
*
2321 lookup_name (const char *name
)
2323 lang_input_statement_type
*search
;
2325 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2327 search
= (lang_input_statement_type
*) search
->next_real_file
)
2329 /* Use the local_sym_name as the name of the file that has
2330 already been loaded as filename might have been transformed
2331 via the search directory lookup mechanism. */
2332 const char *filename
= search
->local_sym_name
;
2334 if (filename
!= NULL
2335 && strcmp (filename
, name
) == 0)
2340 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2341 default_target
, FALSE
);
2343 /* If we have already added this file, or this file is not real
2344 don't add this file. */
2345 if (search
->loaded
|| !search
->real
)
2348 if (! load_symbols (search
, NULL
))
2354 /* Save LIST as a list of libraries whose symbols should not be exported. */
2359 struct excluded_lib
*next
;
2361 static struct excluded_lib
*excluded_libs
;
2364 add_excluded_libs (const char *list
)
2366 const char *p
= list
, *end
;
2370 struct excluded_lib
*entry
;
2371 end
= strpbrk (p
, ",:");
2373 end
= p
+ strlen (p
);
2374 entry
= xmalloc (sizeof (*entry
));
2375 entry
->next
= excluded_libs
;
2376 entry
->name
= xmalloc (end
- p
+ 1);
2377 memcpy (entry
->name
, p
, end
- p
);
2378 entry
->name
[end
- p
] = '\0';
2379 excluded_libs
= entry
;
2387 check_excluded_libs (bfd
*abfd
)
2389 struct excluded_lib
*lib
= excluded_libs
;
2393 int len
= strlen (lib
->name
);
2394 const char *filename
= lbasename (abfd
->filename
);
2396 if (strcmp (lib
->name
, "ALL") == 0)
2398 abfd
->no_export
= TRUE
;
2402 if (strncmp (lib
->name
, filename
, len
) == 0
2403 && (filename
[len
] == '\0'
2404 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2405 && filename
[len
+ 2] == '\0')))
2407 abfd
->no_export
= TRUE
;
2415 /* Get the symbols for an input file. */
2418 load_symbols (lang_input_statement_type
*entry
,
2419 lang_statement_list_type
*place
)
2426 ldfile_open_file (entry
);
2428 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2429 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2432 lang_statement_list_type
*hold
;
2433 bfd_boolean bad_load
= TRUE
;
2434 bfd_boolean save_ldlang_sysrooted_script
;
2435 bfd_boolean save_as_needed
, save_add_needed
;
2437 err
= bfd_get_error ();
2439 /* See if the emulation has some special knowledge. */
2440 if (ldemul_unrecognized_file (entry
))
2443 if (err
== bfd_error_file_ambiguously_recognized
)
2447 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2448 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2449 for (p
= matching
; *p
!= NULL
; p
++)
2453 else if (err
!= bfd_error_file_not_recognized
2455 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2459 bfd_close (entry
->the_bfd
);
2460 entry
->the_bfd
= NULL
;
2462 /* Try to interpret the file as a linker script. */
2463 ldfile_open_command_file (entry
->filename
);
2467 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2468 ldlang_sysrooted_script
= entry
->sysrooted
;
2469 save_as_needed
= as_needed
;
2470 as_needed
= entry
->as_needed
;
2471 save_add_needed
= add_needed
;
2472 add_needed
= entry
->add_needed
;
2474 ldfile_assumed_script
= TRUE
;
2475 parser_input
= input_script
;
2476 /* We want to use the same -Bdynamic/-Bstatic as the one for
2478 config
.dynamic_link
= entry
->dynamic
;
2480 ldfile_assumed_script
= FALSE
;
2482 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2483 as_needed
= save_as_needed
;
2484 add_needed
= save_add_needed
;
2490 if (ldemul_recognized_file (entry
))
2493 /* We don't call ldlang_add_file for an archive. Instead, the
2494 add_symbols entry point will call ldlang_add_file, via the
2495 add_archive_element callback, for each element of the archive
2497 switch (bfd_get_format (entry
->the_bfd
))
2503 ldlang_add_file (entry
);
2504 if (trace_files
|| trace_file_tries
)
2505 info_msg ("%I\n", entry
);
2509 check_excluded_libs (entry
->the_bfd
);
2511 if (entry
->whole_archive
)
2514 bfd_boolean loaded
= TRUE
;
2518 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2523 if (! bfd_check_format (member
, bfd_object
))
2525 einfo (_("%F%B: member %B in archive is not an object\n"),
2526 entry
->the_bfd
, member
);
2530 if (! ((*link_info
.callbacks
->add_archive_element
)
2531 (&link_info
, member
, "--whole-archive")))
2534 if (! bfd_link_add_symbols (member
, &link_info
))
2536 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2541 entry
->loaded
= loaded
;
2547 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2548 entry
->loaded
= TRUE
;
2550 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2552 return entry
->loaded
;
2555 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2556 may be NULL, indicating that it is a wildcard. Separate
2557 lang_input_section statements are created for each part of the
2558 expansion; they are added after the wild statement S. OUTPUT is
2559 the output section. */
2562 wild (lang_wild_statement_type
*s
,
2563 const char *target ATTRIBUTE_UNUSED
,
2564 lang_output_section_statement_type
*output
)
2566 struct wildcard_list
*sec
;
2568 if (s
->handler_data
[0]
2569 && s
->handler_data
[0]->spec
.sorted
== by_name
2570 && !s
->filenames_sorted
)
2572 lang_section_bst_type
*tree
;
2574 walk_wild (s
, output_section_callback_fast
, output
);
2579 output_section_callback_tree_to_list (s
, tree
, output
);
2584 walk_wild (s
, output_section_callback
, output
);
2586 if (default_common_section
== NULL
)
2587 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2588 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2590 /* Remember the section that common is going to in case we
2591 later get something which doesn't know where to put it. */
2592 default_common_section
= output
;
2597 /* Return TRUE iff target is the sought target. */
2600 get_target (const bfd_target
*target
, void *data
)
2602 const char *sought
= data
;
2604 return strcmp (target
->name
, sought
) == 0;
2607 /* Like strcpy() but convert to lower case as well. */
2610 stricpy (char *dest
, char *src
)
2614 while ((c
= *src
++) != 0)
2615 *dest
++ = TOLOWER (c
);
2620 /* Remove the first occurrence of needle (if any) in haystack
2624 strcut (char *haystack
, char *needle
)
2626 haystack
= strstr (haystack
, needle
);
2632 for (src
= haystack
+ strlen (needle
); *src
;)
2633 *haystack
++ = *src
++;
2639 /* Compare two target format name strings.
2640 Return a value indicating how "similar" they are. */
2643 name_compare (char *first
, char *second
)
2649 copy1
= xmalloc (strlen (first
) + 1);
2650 copy2
= xmalloc (strlen (second
) + 1);
2652 /* Convert the names to lower case. */
2653 stricpy (copy1
, first
);
2654 stricpy (copy2
, second
);
2656 /* Remove size and endian strings from the name. */
2657 strcut (copy1
, "big");
2658 strcut (copy1
, "little");
2659 strcut (copy2
, "big");
2660 strcut (copy2
, "little");
2662 /* Return a value based on how many characters match,
2663 starting from the beginning. If both strings are
2664 the same then return 10 * their length. */
2665 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2666 if (copy1
[result
] == 0)
2678 /* Set by closest_target_match() below. */
2679 static const bfd_target
*winner
;
2681 /* Scan all the valid bfd targets looking for one that has the endianness
2682 requirement that was specified on the command line, and is the nearest
2683 match to the original output target. */
2686 closest_target_match (const bfd_target
*target
, void *data
)
2688 const bfd_target
*original
= data
;
2690 if (command_line
.endian
== ENDIAN_BIG
2691 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2694 if (command_line
.endian
== ENDIAN_LITTLE
2695 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2698 /* Must be the same flavour. */
2699 if (target
->flavour
!= original
->flavour
)
2702 /* If we have not found a potential winner yet, then record this one. */
2709 /* Oh dear, we now have two potential candidates for a successful match.
2710 Compare their names and choose the better one. */
2711 if (name_compare (target
->name
, original
->name
)
2712 > name_compare (winner
->name
, original
->name
))
2715 /* Keep on searching until wqe have checked them all. */
2719 /* Return the BFD target format of the first input file. */
2722 get_first_input_target (void)
2724 char *target
= NULL
;
2726 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2728 if (s
->header
.type
== lang_input_statement_enum
2731 ldfile_open_file (s
);
2733 if (s
->the_bfd
!= NULL
2734 && bfd_check_format (s
->the_bfd
, bfd_object
))
2736 target
= bfd_get_target (s
->the_bfd
);
2748 lang_get_output_target (void)
2752 /* Has the user told us which output format to use? */
2753 if (output_target
!= NULL
)
2754 return output_target
;
2756 /* No - has the current target been set to something other than
2758 if (current_target
!= default_target
)
2759 return current_target
;
2761 /* No - can we determine the format of the first input file? */
2762 target
= get_first_input_target ();
2766 /* Failed - use the default output target. */
2767 return default_target
;
2770 /* Open the output file. */
2773 open_output (const char *name
)
2775 output_target
= lang_get_output_target ();
2777 /* Has the user requested a particular endianness on the command
2779 if (command_line
.endian
!= ENDIAN_UNSET
)
2781 const bfd_target
*target
;
2782 enum bfd_endian desired_endian
;
2784 /* Get the chosen target. */
2785 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2787 /* If the target is not supported, we cannot do anything. */
2790 if (command_line
.endian
== ENDIAN_BIG
)
2791 desired_endian
= BFD_ENDIAN_BIG
;
2793 desired_endian
= BFD_ENDIAN_LITTLE
;
2795 /* See if the target has the wrong endianness. This should
2796 not happen if the linker script has provided big and
2797 little endian alternatives, but some scrips don't do
2799 if (target
->byteorder
!= desired_endian
)
2801 /* If it does, then see if the target provides
2802 an alternative with the correct endianness. */
2803 if (target
->alternative_target
!= NULL
2804 && (target
->alternative_target
->byteorder
== desired_endian
))
2805 output_target
= target
->alternative_target
->name
;
2808 /* Try to find a target as similar as possible to
2809 the default target, but which has the desired
2810 endian characteristic. */
2811 bfd_search_for_target (closest_target_match
,
2814 /* Oh dear - we could not find any targets that
2815 satisfy our requirements. */
2817 einfo (_("%P: warning: could not find any targets"
2818 " that match endianness requirement\n"));
2820 output_target
= winner
->name
;
2826 link_info
.output_bfd
= bfd_openw (name
, output_target
);
2828 if (link_info
.output_bfd
== NULL
)
2830 if (bfd_get_error () == bfd_error_invalid_target
)
2831 einfo (_("%P%F: target %s not found\n"), output_target
);
2833 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2836 delete_output_file_on_failure
= TRUE
;
2838 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
2839 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2840 if (! bfd_set_arch_mach (link_info
.output_bfd
,
2841 ldfile_output_architecture
,
2842 ldfile_output_machine
))
2843 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2845 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
2846 if (link_info
.hash
== NULL
)
2847 einfo (_("%P%F: can not create hash table: %E\n"));
2849 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
2853 ldlang_open_output (lang_statement_union_type
*statement
)
2855 switch (statement
->header
.type
)
2857 case lang_output_statement_enum
:
2858 ASSERT (link_info
.output_bfd
== NULL
);
2859 open_output (statement
->output_statement
.name
);
2860 ldemul_set_output_arch ();
2861 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2862 link_info
.output_bfd
->flags
|= D_PAGED
;
2864 link_info
.output_bfd
->flags
&= ~D_PAGED
;
2865 if (config
.text_read_only
)
2866 link_info
.output_bfd
->flags
|= WP_TEXT
;
2868 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
2869 if (link_info
.traditional_format
)
2870 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2872 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2875 case lang_target_statement_enum
:
2876 current_target
= statement
->target_statement
.target
;
2883 /* Convert between addresses in bytes and sizes in octets.
2884 For currently supported targets, octets_per_byte is always a power
2885 of two, so we can use shifts. */
2886 #define TO_ADDR(X) ((X) >> opb_shift)
2887 #define TO_SIZE(X) ((X) << opb_shift)
2889 /* Support the above. */
2890 static unsigned int opb_shift
= 0;
2895 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2896 ldfile_output_machine
);
2899 while ((x
& 1) == 0)
2907 /* Open all the input files. */
2910 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2912 for (; s
!= NULL
; s
= s
->header
.next
)
2914 switch (s
->header
.type
)
2916 case lang_constructors_statement_enum
:
2917 open_input_bfds (constructor_list
.head
, force
);
2919 case lang_output_section_statement_enum
:
2920 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2922 case lang_wild_statement_enum
:
2923 /* Maybe we should load the file's symbols. */
2924 if (s
->wild_statement
.filename
2925 && ! wildcardp (s
->wild_statement
.filename
))
2926 lookup_name (s
->wild_statement
.filename
);
2927 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2929 case lang_group_statement_enum
:
2931 struct bfd_link_hash_entry
*undefs
;
2933 /* We must continually search the entries in the group
2934 until no new symbols are added to the list of undefined
2939 undefs
= link_info
.hash
->undefs_tail
;
2940 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2942 while (undefs
!= link_info
.hash
->undefs_tail
);
2945 case lang_target_statement_enum
:
2946 current_target
= s
->target_statement
.target
;
2948 case lang_input_statement_enum
:
2949 if (s
->input_statement
.real
)
2951 lang_statement_list_type add
;
2953 s
->input_statement
.target
= current_target
;
2955 /* If we are being called from within a group, and this
2956 is an archive which has already been searched, then
2957 force it to be researched unless the whole archive
2958 has been loaded already. */
2960 && !s
->input_statement
.whole_archive
2961 && s
->input_statement
.loaded
2962 && bfd_check_format (s
->input_statement
.the_bfd
,
2964 s
->input_statement
.loaded
= FALSE
;
2966 lang_list_init (&add
);
2968 if (! load_symbols (&s
->input_statement
, &add
))
2969 config
.make_executable
= FALSE
;
2971 if (add
.head
!= NULL
)
2973 *add
.tail
= s
->header
.next
;
2974 s
->header
.next
= add
.head
;
2984 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2987 lang_track_definedness (const char *name
)
2989 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2990 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2993 /* New-function for the definedness hash table. */
2995 static struct bfd_hash_entry
*
2996 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2997 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2998 const char *name ATTRIBUTE_UNUSED
)
3000 struct lang_definedness_hash_entry
*ret
3001 = (struct lang_definedness_hash_entry
*) entry
;
3004 ret
= (struct lang_definedness_hash_entry
*)
3005 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3008 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3010 ret
->iteration
= -1;
3014 /* Return the iteration when the definition of NAME was last updated. A
3015 value of -1 means that the symbol is not defined in the linker script
3016 or the command line, but may be defined in the linker symbol table. */
3019 lang_symbol_definition_iteration (const char *name
)
3021 struct lang_definedness_hash_entry
*defentry
3022 = (struct lang_definedness_hash_entry
*)
3023 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3025 /* We've already created this one on the presence of DEFINED in the
3026 script, so it can't be NULL unless something is borked elsewhere in
3028 if (defentry
== NULL
)
3031 return defentry
->iteration
;
3034 /* Update the definedness state of NAME. */
3037 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3039 struct lang_definedness_hash_entry
*defentry
3040 = (struct lang_definedness_hash_entry
*)
3041 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3043 /* We don't keep track of symbols not tested with DEFINED. */
3044 if (defentry
== NULL
)
3047 /* If the symbol was already defined, and not from an earlier statement
3048 iteration, don't update the definedness iteration, because that'd
3049 make the symbol seem defined in the linker script at this point, and
3050 it wasn't; it was defined in some object. If we do anyway, DEFINED
3051 would start to yield false before this point and the construct "sym =
3052 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3054 if (h
->type
!= bfd_link_hash_undefined
3055 && h
->type
!= bfd_link_hash_common
3056 && h
->type
!= bfd_link_hash_new
3057 && defentry
->iteration
== -1)
3060 defentry
->iteration
= lang_statement_iteration
;
3063 /* Add the supplied name to the symbol table as an undefined reference.
3064 This is a two step process as the symbol table doesn't even exist at
3065 the time the ld command line is processed. First we put the name
3066 on a list, then, once the output file has been opened, transfer the
3067 name to the symbol table. */
3069 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3071 #define ldlang_undef_chain_list_head entry_symbol.next
3074 ldlang_add_undef (const char *const name
)
3076 ldlang_undef_chain_list_type
*new =
3077 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
3079 new->next
= ldlang_undef_chain_list_head
;
3080 ldlang_undef_chain_list_head
= new;
3082 new->name
= xstrdup (name
);
3084 if (link_info
.output_bfd
!= NULL
)
3085 insert_undefined (new->name
);
3088 /* Insert NAME as undefined in the symbol table. */
3091 insert_undefined (const char *name
)
3093 struct bfd_link_hash_entry
*h
;
3095 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3097 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3098 if (h
->type
== bfd_link_hash_new
)
3100 h
->type
= bfd_link_hash_undefined
;
3101 h
->u
.undef
.abfd
= NULL
;
3102 bfd_link_add_undef (link_info
.hash
, h
);
3106 /* Run through the list of undefineds created above and place them
3107 into the linker hash table as undefined symbols belonging to the
3111 lang_place_undefineds (void)
3113 ldlang_undef_chain_list_type
*ptr
;
3115 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3116 insert_undefined (ptr
->name
);
3119 /* Check for all readonly or some readwrite sections. */
3122 check_input_sections
3123 (lang_statement_union_type
*s
,
3124 lang_output_section_statement_type
*output_section_statement
)
3126 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3128 switch (s
->header
.type
)
3130 case lang_wild_statement_enum
:
3131 walk_wild (&s
->wild_statement
, check_section_callback
,
3132 output_section_statement
);
3133 if (! output_section_statement
->all_input_readonly
)
3136 case lang_constructors_statement_enum
:
3137 check_input_sections (constructor_list
.head
,
3138 output_section_statement
);
3139 if (! output_section_statement
->all_input_readonly
)
3142 case lang_group_statement_enum
:
3143 check_input_sections (s
->group_statement
.children
.head
,
3144 output_section_statement
);
3145 if (! output_section_statement
->all_input_readonly
)
3154 /* Update wildcard statements if needed. */
3157 update_wild_statements (lang_statement_union_type
*s
)
3159 struct wildcard_list
*sec
;
3161 switch (sort_section
)
3171 for (; s
!= NULL
; s
= s
->header
.next
)
3173 switch (s
->header
.type
)
3178 case lang_wild_statement_enum
:
3179 sec
= s
->wild_statement
.section_list
;
3180 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3183 switch (sec
->spec
.sorted
)
3186 sec
->spec
.sorted
= sort_section
;
3189 if (sort_section
== by_alignment
)
3190 sec
->spec
.sorted
= by_name_alignment
;
3193 if (sort_section
== by_name
)
3194 sec
->spec
.sorted
= by_alignment_name
;
3202 case lang_constructors_statement_enum
:
3203 update_wild_statements (constructor_list
.head
);
3206 case lang_output_section_statement_enum
:
3207 update_wild_statements
3208 (s
->output_section_statement
.children
.head
);
3211 case lang_group_statement_enum
:
3212 update_wild_statements (s
->group_statement
.children
.head
);
3220 /* Open input files and attach to output sections. */
3223 map_input_to_output_sections
3224 (lang_statement_union_type
*s
, const char *target
,
3225 lang_output_section_statement_type
*os
)
3229 for (; s
!= NULL
; s
= s
->header
.next
)
3231 switch (s
->header
.type
)
3233 case lang_wild_statement_enum
:
3234 wild (&s
->wild_statement
, target
, os
);
3236 case lang_constructors_statement_enum
:
3237 map_input_to_output_sections (constructor_list
.head
,
3241 case lang_output_section_statement_enum
:
3242 if (s
->output_section_statement
.constraint
)
3244 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3245 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3247 s
->output_section_statement
.all_input_readonly
= TRUE
;
3248 check_input_sections (s
->output_section_statement
.children
.head
,
3249 &s
->output_section_statement
);
3250 if ((s
->output_section_statement
.all_input_readonly
3251 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3252 || (!s
->output_section_statement
.all_input_readonly
3253 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3255 s
->output_section_statement
.constraint
= -1;
3260 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3262 &s
->output_section_statement
);
3264 case lang_output_statement_enum
:
3266 case lang_target_statement_enum
:
3267 target
= s
->target_statement
.target
;
3269 case lang_group_statement_enum
:
3270 map_input_to_output_sections (s
->group_statement
.children
.head
,
3274 case lang_data_statement_enum
:
3275 /* Make sure that any sections mentioned in the expression
3277 exp_init_os (s
->data_statement
.exp
);
3278 flags
= SEC_HAS_CONTENTS
;
3279 /* The output section gets contents, and then we inspect for
3280 any flags set in the input script which override any ALLOC. */
3281 if (!(os
->flags
& SEC_NEVER_LOAD
))
3282 flags
|= SEC_ALLOC
| SEC_LOAD
;
3283 if (os
->bfd_section
== NULL
)
3284 init_os (os
, NULL
, flags
);
3286 os
->bfd_section
->flags
|= flags
;
3288 case lang_input_section_enum
:
3290 case lang_fill_statement_enum
:
3291 case lang_object_symbols_statement_enum
:
3292 case lang_reloc_statement_enum
:
3293 case lang_padding_statement_enum
:
3294 case lang_input_statement_enum
:
3295 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3296 init_os (os
, NULL
, 0);
3298 case lang_assignment_statement_enum
:
3299 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3300 init_os (os
, NULL
, 0);
3302 /* Make sure that any sections mentioned in the assignment
3304 exp_init_os (s
->assignment_statement
.exp
);
3306 case lang_address_statement_enum
:
3307 /* Mark the specified section with the supplied address.
3309 If this section was actually a segment marker, then the
3310 directive is ignored if the linker script explicitly
3311 processed the segment marker. Originally, the linker
3312 treated segment directives (like -Ttext on the
3313 command-line) as section directives. We honor the
3314 section directive semantics for backwards compatibilty;
3315 linker scripts that do not specifically check for
3316 SEGMENT_START automatically get the old semantics. */
3317 if (!s
->address_statement
.segment
3318 || !s
->address_statement
.segment
->used
)
3320 lang_output_section_statement_type
*aos
3321 = (lang_output_section_statement_lookup
3322 (s
->address_statement
.section_name
));
3324 if (aos
->bfd_section
== NULL
)
3325 init_os (aos
, NULL
, 0);
3326 aos
->addr_tree
= s
->address_statement
.address
;
3329 case lang_insert_statement_enum
:
3335 /* An insert statement snips out all the linker statements from the
3336 start of the list and places them after the output section
3337 statement specified by the insert. This operation is complicated
3338 by the fact that we keep a doubly linked list of output section
3339 statements as well as the singly linked list of all statements. */
3342 process_insert_statements (void)
3344 lang_statement_union_type
**s
;
3345 lang_output_section_statement_type
*first_os
= NULL
;
3346 lang_output_section_statement_type
*last_os
= NULL
;
3348 /* "start of list" is actually the statement immediately after
3349 the special abs_section output statement, so that it isn't
3351 s
= &lang_output_section_statement
.head
;
3352 while (*(s
= &(*s
)->header
.next
) != NULL
)
3354 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3356 /* Keep pointers to the first and last output section
3357 statement in the sequence we may be about to move. */
3358 last_os
= &(*s
)->output_section_statement
;
3359 if (first_os
== NULL
)
3362 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3364 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3365 lang_output_section_statement_type
*where
;
3366 lang_output_section_statement_type
*os
;
3367 lang_statement_union_type
**ptr
;
3368 lang_statement_union_type
*first
;
3370 where
= lang_output_section_find (i
->where
);
3371 if (where
!= NULL
&& i
->is_before
)
3374 where
= where
->prev
;
3375 while (where
!= NULL
&& where
->constraint
== -1);
3379 einfo (_("%X%P: %s not found for insert\n"), i
->where
);
3382 /* You can't insert into the list you are moving. */
3383 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3384 if (os
== where
|| os
== last_os
)
3388 einfo (_("%X%P: %s not found for insert\n"), i
->where
);
3392 /* Deal with reordering the output section statement list. */
3393 if (last_os
!= NULL
)
3395 asection
*first_sec
, *last_sec
;
3396 struct lang_output_section_statement_struct
**next
;
3398 /* Snip out the output sections we are moving. */
3399 first_os
->prev
->next
= last_os
->next
;
3400 if (last_os
->next
== NULL
)
3402 next
= &first_os
->prev
->next
;
3403 lang_output_section_statement
.tail
3404 = (lang_statement_union_type
**) next
;
3407 last_os
->next
->prev
= first_os
->prev
;
3408 /* Add them in at the new position. */
3409 last_os
->next
= where
->next
;
3410 if (where
->next
== NULL
)
3412 next
= &last_os
->next
;
3413 lang_output_section_statement
.tail
3414 = (lang_statement_union_type
**) next
;
3417 where
->next
->prev
= last_os
;
3418 first_os
->prev
= where
;
3419 where
->next
= first_os
;
3421 /* Move the bfd sections in the same way. */
3424 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3426 if (os
->bfd_section
!= NULL
3427 && os
->bfd_section
->owner
!= NULL
)
3429 last_sec
= os
->bfd_section
;
3430 if (first_sec
== NULL
)
3431 first_sec
= last_sec
;
3436 if (last_sec
!= NULL
)
3438 asection
*sec
= where
->bfd_section
;
3440 sec
= output_prev_sec_find (where
);
3442 /* The place we want to insert must come after the
3443 sections we are moving. So if we find no
3444 section or if the section is the same as our
3445 last section, then no move is needed. */
3446 if (sec
!= NULL
&& sec
!= last_sec
)
3448 /* Trim them off. */
3449 if (first_sec
->prev
!= NULL
)
3450 first_sec
->prev
->next
= last_sec
->next
;
3452 link_info
.output_bfd
->sections
= last_sec
->next
;
3453 if (last_sec
->next
!= NULL
)
3454 last_sec
->next
->prev
= first_sec
->prev
;
3456 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3458 last_sec
->next
= sec
->next
;
3459 if (sec
->next
!= NULL
)
3460 sec
->next
->prev
= last_sec
;
3462 link_info
.output_bfd
->section_last
= last_sec
;
3463 first_sec
->prev
= sec
;
3464 sec
->next
= first_sec
;
3472 ptr
= insert_os_after (where
);
3473 /* Snip everything after the abs_section output statement we
3474 know is at the start of the list, up to and including
3475 the insert statement we are currently processing. */
3476 first
= lang_output_section_statement
.head
->header
.next
;
3477 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3478 /* Add them back where they belong. */
3481 statement_list
.tail
= s
;
3483 s
= &lang_output_section_statement
.head
;
3488 /* An output section might have been removed after its statement was
3489 added. For example, ldemul_before_allocation can remove dynamic
3490 sections if they turn out to be not needed. Clean them up here. */
3493 strip_excluded_output_sections (void)
3495 lang_output_section_statement_type
*os
;
3497 /* Run lang_size_sections (if not already done). */
3498 if (expld
.phase
!= lang_mark_phase_enum
)
3500 expld
.phase
= lang_mark_phase_enum
;
3501 expld
.dataseg
.phase
= exp_dataseg_none
;
3502 one_lang_size_sections_pass (NULL
, FALSE
);
3503 lang_reset_memory_regions ();
3506 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3510 asection
*output_section
;
3511 bfd_boolean exclude
;
3513 if (os
->constraint
== -1)
3516 output_section
= os
->bfd_section
;
3517 if (output_section
== NULL
)
3520 exclude
= (output_section
->rawsize
== 0
3521 && (output_section
->flags
& SEC_KEEP
) == 0
3522 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3525 /* Some sections have not yet been sized, notably .gnu.version,
3526 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3527 input sections, so don't drop output sections that have such
3528 input sections unless they are also marked SEC_EXCLUDE. */
3529 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3533 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3534 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3535 && (s
->flags
& SEC_EXCLUDE
) == 0)
3542 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3543 output_section
->map_head
.link_order
= NULL
;
3544 output_section
->map_tail
.link_order
= NULL
;
3548 /* We don't set bfd_section to NULL since bfd_section of the
3549 removed output section statement may still be used. */
3550 if (!os
->section_relative_symbol
3551 && !os
->update_dot_tree
)
3553 output_section
->flags
|= SEC_EXCLUDE
;
3554 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3555 link_info
.output_bfd
->section_count
--;
3559 /* Stop future calls to lang_add_section from messing with map_head
3560 and map_tail link_order fields. */
3561 stripped_excluded_sections
= TRUE
;
3565 print_output_section_statement
3566 (lang_output_section_statement_type
*output_section_statement
)
3568 asection
*section
= output_section_statement
->bfd_section
;
3571 if (output_section_statement
!= abs_output_section
)
3573 minfo ("\n%s", output_section_statement
->name
);
3575 if (section
!= NULL
)
3577 print_dot
= section
->vma
;
3579 len
= strlen (output_section_statement
->name
);
3580 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3585 while (len
< SECTION_NAME_MAP_LENGTH
)
3591 minfo ("0x%V %W", section
->vma
, section
->size
);
3593 if (section
->vma
!= section
->lma
)
3594 minfo (_(" load address 0x%V"), section
->lma
);
3600 print_statement_list (output_section_statement
->children
.head
,
3601 output_section_statement
);
3604 /* Scan for the use of the destination in the right hand side
3605 of an expression. In such cases we will not compute the
3606 correct expression, since the value of DST that is used on
3607 the right hand side will be its final value, not its value
3608 just before this expression is evaluated. */
3611 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3613 if (rhs
== NULL
|| dst
== NULL
)
3616 switch (rhs
->type
.node_class
)
3619 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3620 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3623 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3624 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3627 case etree_provided
:
3629 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3631 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3634 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3638 return strcmp (dst
, rhs
->value
.str
) == 0;
3643 return strcmp (dst
, rhs
->name
.name
) == 0;
3655 print_assignment (lang_assignment_statement_type
*assignment
,
3656 lang_output_section_statement_type
*output_section
)
3660 bfd_boolean computation_is_valid
= TRUE
;
3663 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3666 if (assignment
->exp
->type
.node_class
== etree_assert
)
3669 tree
= assignment
->exp
->assert_s
.child
;
3670 computation_is_valid
= TRUE
;
3674 const char *dst
= assignment
->exp
->assign
.dst
;
3676 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3677 tree
= assignment
->exp
->assign
.src
;
3678 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3681 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3682 if (expld
.result
.valid_p
)
3686 if (computation_is_valid
)
3688 value
= expld
.result
.value
;
3690 if (expld
.result
.section
)
3691 value
+= expld
.result
.section
->vma
;
3693 minfo ("0x%V", value
);
3699 struct bfd_link_hash_entry
*h
;
3701 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3702 FALSE
, FALSE
, TRUE
);
3705 value
= h
->u
.def
.value
;
3707 if (expld
.result
.section
)
3708 value
+= expld
.result
.section
->vma
;
3710 minfo ("[0x%V]", value
);
3713 minfo ("[unresolved]");
3725 exp_print_tree (assignment
->exp
);
3730 print_input_statement (lang_input_statement_type
*statm
)
3732 if ((statm
->filename
!= NULL
)
3733 && ((statm
->the_bfd
== NULL
)
3735 ((statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0)))
3736 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3739 /* Print all symbols defined in a particular section. This is called
3740 via bfd_link_hash_traverse, or by print_all_symbols. */
3743 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3745 asection
*sec
= ptr
;
3747 if ((hash_entry
->type
== bfd_link_hash_defined
3748 || hash_entry
->type
== bfd_link_hash_defweak
)
3749 && sec
== hash_entry
->u
.def
.section
)
3753 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3756 (hash_entry
->u
.def
.value
3757 + hash_entry
->u
.def
.section
->output_offset
3758 + hash_entry
->u
.def
.section
->output_section
->vma
));
3760 minfo (" %T\n", hash_entry
->root
.string
);
3767 print_all_symbols (asection
*sec
)
3769 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3770 struct map_symbol_def
*def
;
3775 *ud
->map_symbol_def_tail
= 0;
3776 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3777 print_one_symbol (def
->entry
, sec
);
3780 /* Print information about an input section to the map file. */
3783 print_input_section (asection
*i
)
3785 bfd_size_type size
= i
->size
;
3792 minfo ("%s", i
->name
);
3794 len
= 1 + strlen (i
->name
);
3795 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3800 while (len
< SECTION_NAME_MAP_LENGTH
)
3806 if (i
->output_section
!= NULL
3807 && i
->output_section
->owner
== link_info
.output_bfd
)
3808 addr
= i
->output_section
->vma
+ i
->output_offset
;
3815 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3817 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3819 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3831 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3834 if (i
->output_section
!= NULL
3835 && i
->output_section
->owner
== link_info
.output_bfd
)
3837 if (link_info
.reduce_memory_overheads
)
3838 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3840 print_all_symbols (i
);
3842 print_dot
= addr
+ TO_ADDR (size
);
3847 print_fill_statement (lang_fill_statement_type
*fill
)
3851 fputs (" FILL mask 0x", config
.map_file
);
3852 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3853 fprintf (config
.map_file
, "%02x", *p
);
3854 fputs ("\n", config
.map_file
);
3858 print_data_statement (lang_data_statement_type
*data
)
3866 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3869 addr
= data
->output_offset
;
3870 if (data
->output_section
!= NULL
)
3871 addr
+= data
->output_section
->vma
;
3899 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3901 if (data
->exp
->type
.node_class
!= etree_value
)
3904 exp_print_tree (data
->exp
);
3909 print_dot
= addr
+ TO_ADDR (size
);
3912 /* Print an address statement. These are generated by options like
3916 print_address_statement (lang_address_statement_type
*address
)
3918 minfo (_("Address of section %s set to "), address
->section_name
);
3919 exp_print_tree (address
->address
);
3923 /* Print a reloc statement. */
3926 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3933 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3936 addr
= reloc
->output_offset
;
3937 if (reloc
->output_section
!= NULL
)
3938 addr
+= reloc
->output_section
->vma
;
3940 size
= bfd_get_reloc_size (reloc
->howto
);
3942 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3944 if (reloc
->name
!= NULL
)
3945 minfo ("%s+", reloc
->name
);
3947 minfo ("%s+", reloc
->section
->name
);
3949 exp_print_tree (reloc
->addend_exp
);
3953 print_dot
= addr
+ TO_ADDR (size
);
3957 print_padding_statement (lang_padding_statement_type
*s
)
3965 len
= sizeof " *fill*" - 1;
3966 while (len
< SECTION_NAME_MAP_LENGTH
)
3972 addr
= s
->output_offset
;
3973 if (s
->output_section
!= NULL
)
3974 addr
+= s
->output_section
->vma
;
3975 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3977 if (s
->fill
->size
!= 0)
3981 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3982 fprintf (config
.map_file
, "%02x", *p
);
3987 print_dot
= addr
+ TO_ADDR (s
->size
);
3991 print_wild_statement (lang_wild_statement_type
*w
,
3992 lang_output_section_statement_type
*os
)
3994 struct wildcard_list
*sec
;
3998 if (w
->filenames_sorted
)
4000 if (w
->filename
!= NULL
)
4001 minfo ("%s", w
->filename
);
4004 if (w
->filenames_sorted
)
4008 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4010 if (sec
->spec
.sorted
)
4012 if (sec
->spec
.exclude_name_list
!= NULL
)
4015 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4016 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4017 minfo (" %s", tmp
->name
);
4020 if (sec
->spec
.name
!= NULL
)
4021 minfo ("%s", sec
->spec
.name
);
4024 if (sec
->spec
.sorted
)
4033 print_statement_list (w
->children
.head
, os
);
4036 /* Print a group statement. */
4039 print_group (lang_group_statement_type
*s
,
4040 lang_output_section_statement_type
*os
)
4042 fprintf (config
.map_file
, "START GROUP\n");
4043 print_statement_list (s
->children
.head
, os
);
4044 fprintf (config
.map_file
, "END GROUP\n");
4047 /* Print the list of statements in S.
4048 This can be called for any statement type. */
4051 print_statement_list (lang_statement_union_type
*s
,
4052 lang_output_section_statement_type
*os
)
4056 print_statement (s
, os
);
4061 /* Print the first statement in statement list S.
4062 This can be called for any statement type. */
4065 print_statement (lang_statement_union_type
*s
,
4066 lang_output_section_statement_type
*os
)
4068 switch (s
->header
.type
)
4071 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4074 case lang_constructors_statement_enum
:
4075 if (constructor_list
.head
!= NULL
)
4077 if (constructors_sorted
)
4078 minfo (" SORT (CONSTRUCTORS)\n");
4080 minfo (" CONSTRUCTORS\n");
4081 print_statement_list (constructor_list
.head
, os
);
4084 case lang_wild_statement_enum
:
4085 print_wild_statement (&s
->wild_statement
, os
);
4087 case lang_address_statement_enum
:
4088 print_address_statement (&s
->address_statement
);
4090 case lang_object_symbols_statement_enum
:
4091 minfo (" CREATE_OBJECT_SYMBOLS\n");
4093 case lang_fill_statement_enum
:
4094 print_fill_statement (&s
->fill_statement
);
4096 case lang_data_statement_enum
:
4097 print_data_statement (&s
->data_statement
);
4099 case lang_reloc_statement_enum
:
4100 print_reloc_statement (&s
->reloc_statement
);
4102 case lang_input_section_enum
:
4103 print_input_section (s
->input_section
.section
);
4105 case lang_padding_statement_enum
:
4106 print_padding_statement (&s
->padding_statement
);
4108 case lang_output_section_statement_enum
:
4109 print_output_section_statement (&s
->output_section_statement
);
4111 case lang_assignment_statement_enum
:
4112 print_assignment (&s
->assignment_statement
, os
);
4114 case lang_target_statement_enum
:
4115 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4117 case lang_output_statement_enum
:
4118 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4119 if (output_target
!= NULL
)
4120 minfo (" %s", output_target
);
4123 case lang_input_statement_enum
:
4124 print_input_statement (&s
->input_statement
);
4126 case lang_group_statement_enum
:
4127 print_group (&s
->group_statement
, os
);
4129 case lang_insert_statement_enum
:
4130 minfo ("INSERT %s %s\n",
4131 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4132 s
->insert_statement
.where
);
4138 print_statements (void)
4140 print_statement_list (statement_list
.head
, abs_output_section
);
4143 /* Print the first N statements in statement list S to STDERR.
4144 If N == 0, nothing is printed.
4145 If N < 0, the entire list is printed.
4146 Intended to be called from GDB. */
4149 dprint_statement (lang_statement_union_type
*s
, int n
)
4151 FILE *map_save
= config
.map_file
;
4153 config
.map_file
= stderr
;
4156 print_statement_list (s
, abs_output_section
);
4159 while (s
&& --n
>= 0)
4161 print_statement (s
, abs_output_section
);
4166 config
.map_file
= map_save
;
4170 insert_pad (lang_statement_union_type
**ptr
,
4172 unsigned int alignment_needed
,
4173 asection
*output_section
,
4176 static fill_type zero_fill
= { 1, { 0 } };
4177 lang_statement_union_type
*pad
= NULL
;
4179 if (ptr
!= &statement_list
.head
)
4180 pad
= ((lang_statement_union_type
*)
4181 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4183 && pad
->header
.type
== lang_padding_statement_enum
4184 && pad
->padding_statement
.output_section
== output_section
)
4186 /* Use the existing pad statement. */
4188 else if ((pad
= *ptr
) != NULL
4189 && pad
->header
.type
== lang_padding_statement_enum
4190 && pad
->padding_statement
.output_section
== output_section
)
4192 /* Use the existing pad statement. */
4196 /* Make a new padding statement, linked into existing chain. */
4197 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
4198 pad
->header
.next
= *ptr
;
4200 pad
->header
.type
= lang_padding_statement_enum
;
4201 pad
->padding_statement
.output_section
= output_section
;
4204 pad
->padding_statement
.fill
= fill
;
4206 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4207 pad
->padding_statement
.size
= alignment_needed
;
4208 output_section
->size
+= alignment_needed
;
4211 /* Work out how much this section will move the dot point. */
4215 (lang_statement_union_type
**this_ptr
,
4216 lang_output_section_statement_type
*output_section_statement
,
4220 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4221 asection
*i
= is
->section
;
4223 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4224 && (i
->flags
& SEC_EXCLUDE
) == 0)
4226 unsigned int alignment_needed
;
4229 /* Align this section first to the input sections requirement,
4230 then to the output section's requirement. If this alignment
4231 is greater than any seen before, then record it too. Perform
4232 the alignment by inserting a magic 'padding' statement. */
4234 if (output_section_statement
->subsection_alignment
!= -1)
4235 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4237 o
= output_section_statement
->bfd_section
;
4238 if (o
->alignment_power
< i
->alignment_power
)
4239 o
->alignment_power
= i
->alignment_power
;
4241 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4243 if (alignment_needed
!= 0)
4245 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4246 dot
+= alignment_needed
;
4249 /* Remember where in the output section this input section goes. */
4251 i
->output_offset
= dot
- o
->vma
;
4253 /* Mark how big the output section must be to contain this now. */
4254 dot
+= TO_ADDR (i
->size
);
4255 o
->size
= TO_SIZE (dot
- o
->vma
);
4259 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4266 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4268 const asection
*sec1
= *(const asection
**) arg1
;
4269 const asection
*sec2
= *(const asection
**) arg2
;
4271 if (bfd_section_lma (sec1
->owner
, sec1
)
4272 < bfd_section_lma (sec2
->owner
, sec2
))
4274 else if (bfd_section_lma (sec1
->owner
, sec1
)
4275 > bfd_section_lma (sec2
->owner
, sec2
))
4277 else if (sec1
->id
< sec2
->id
)
4279 else if (sec1
->id
> sec2
->id
)
4285 #define IGNORE_SECTION(s) \
4286 ((s->flags & SEC_NEVER_LOAD) != 0 \
4287 || (s->flags & SEC_ALLOC) == 0 \
4288 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4289 && (s->flags & SEC_LOAD) == 0))
4291 /* Check to see if any allocated sections overlap with other allocated
4292 sections. This can happen if a linker script specifies the output
4293 section addresses of the two sections. Also check whether any memory
4294 region has overflowed. */
4297 lang_check_section_addresses (void)
4300 asection
**sections
, **spp
;
4307 lang_memory_region_type
*m
;
4309 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4312 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4313 sections
= xmalloc (amt
);
4315 /* Scan all sections in the output list. */
4317 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4319 /* Only consider loadable sections with real contents. */
4320 if (IGNORE_SECTION (s
) || s
->size
== 0)
4323 sections
[count
] = s
;
4330 qsort (sections
, (size_t) count
, sizeof (asection
*),
4331 sort_sections_by_lma
);
4335 s_start
= bfd_section_lma (link_info
.output_bfd
, s
);
4336 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4337 for (count
--; count
; count
--)
4339 /* We must check the sections' LMA addresses not their VMA
4340 addresses because overlay sections can have overlapping VMAs
4341 but they must have distinct LMAs. */
4346 s_start
= bfd_section_lma (link_info
.output_bfd
, s
);
4347 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4349 /* Look for an overlap. */
4350 if (s_end
>= os_start
&& s_start
<= os_end
)
4351 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4352 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4357 /* If any memory region has overflowed, report by how much.
4358 We do not issue this diagnostic for regions that had sections
4359 explicitly placed outside their bounds; os_region_check's
4360 diagnostics are adequate for that case.
4362 FIXME: It is conceivable that m->current - (m->origin + m->length)
4363 might overflow a 32-bit integer. There is, alas, no way to print
4364 a bfd_vma quantity in decimal. */
4365 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4366 if (m
->had_full_message
)
4367 einfo (_("%X%P: region %s overflowed by %ld bytes\n"),
4368 m
->name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4372 /* Make sure the new address is within the region. We explicitly permit the
4373 current address to be at the exact end of the region when the address is
4374 non-zero, in case the region is at the end of addressable memory and the
4375 calculation wraps around. */
4378 os_region_check (lang_output_section_statement_type
*os
,
4379 lang_memory_region_type
*region
,
4383 if ((region
->current
< region
->origin
4384 || (region
->current
- region
->origin
> region
->length
))
4385 && ((region
->current
!= region
->origin
+ region
->length
)
4390 einfo (_("%X%P: address 0x%v of %B section %s"
4391 " is not within region %s\n"),
4393 os
->bfd_section
->owner
,
4394 os
->bfd_section
->name
,
4397 else if (!region
->had_full_message
)
4399 region
->had_full_message
= TRUE
;
4401 einfo (_("%X%P: %B section %s will not fit in region %s\n"),
4402 os
->bfd_section
->owner
,
4403 os
->bfd_section
->name
,
4409 /* Set the sizes for all the output sections. */
4412 lang_size_sections_1
4413 (lang_statement_union_type
*s
,
4414 lang_output_section_statement_type
*output_section_statement
,
4415 lang_statement_union_type
**prev
,
4419 bfd_boolean check_regions
)
4421 /* Size up the sections from their constituent parts. */
4422 for (; s
!= NULL
; s
= s
->header
.next
)
4424 switch (s
->header
.type
)
4426 case lang_output_section_statement_enum
:
4428 bfd_vma newdot
, after
;
4429 lang_output_section_statement_type
*os
;
4430 lang_memory_region_type
*r
;
4432 os
= &s
->output_section_statement
;
4433 if (os
->addr_tree
!= NULL
)
4435 os
->processed_vma
= FALSE
;
4436 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4438 if (expld
.result
.valid_p
)
4439 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4440 else if (expld
.phase
!= lang_mark_phase_enum
)
4441 einfo (_("%F%S: non constant or forward reference"
4442 " address expression for section %s\n"),
4446 if (os
->bfd_section
== NULL
)
4447 /* This section was removed or never actually created. */
4450 /* If this is a COFF shared library section, use the size and
4451 address from the input section. FIXME: This is COFF
4452 specific; it would be cleaner if there were some other way
4453 to do this, but nothing simple comes to mind. */
4454 if (((bfd_get_flavour (link_info
.output_bfd
)
4455 == bfd_target_ecoff_flavour
)
4456 || (bfd_get_flavour (link_info
.output_bfd
)
4457 == bfd_target_coff_flavour
))
4458 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4462 if (os
->children
.head
== NULL
4463 || os
->children
.head
->header
.next
!= NULL
4464 || (os
->children
.head
->header
.type
4465 != lang_input_section_enum
))
4466 einfo (_("%P%X: Internal error on COFF shared library"
4467 " section %s\n"), os
->name
);
4469 input
= os
->children
.head
->input_section
.section
;
4470 bfd_set_section_vma (os
->bfd_section
->owner
,
4472 bfd_section_vma (input
->owner
, input
));
4473 os
->bfd_section
->size
= input
->size
;
4478 if (bfd_is_abs_section (os
->bfd_section
))
4480 /* No matter what happens, an abs section starts at zero. */
4481 ASSERT (os
->bfd_section
->vma
== 0);
4487 if (os
->addr_tree
== NULL
)
4489 /* No address specified for this section, get one
4490 from the region specification. */
4491 if (os
->region
== NULL
4492 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4493 && os
->region
->name
[0] == '*'
4494 && strcmp (os
->region
->name
,
4495 DEFAULT_MEMORY_REGION
) == 0))
4497 os
->region
= lang_memory_default (os
->bfd_section
);
4500 /* If a loadable section is using the default memory
4501 region, and some non default memory regions were
4502 defined, issue an error message. */
4504 && !IGNORE_SECTION (os
->bfd_section
)
4505 && ! link_info
.relocatable
4507 && strcmp (os
->region
->name
,
4508 DEFAULT_MEMORY_REGION
) == 0
4509 && lang_memory_region_list
!= NULL
4510 && (strcmp (lang_memory_region_list
->name
,
4511 DEFAULT_MEMORY_REGION
) != 0
4512 || lang_memory_region_list
->next
!= NULL
)
4513 && expld
.phase
!= lang_mark_phase_enum
)
4515 /* By default this is an error rather than just a
4516 warning because if we allocate the section to the
4517 default memory region we can end up creating an
4518 excessively large binary, or even seg faulting when
4519 attempting to perform a negative seek. See
4520 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4521 for an example of this. This behaviour can be
4522 overridden by the using the --no-check-sections
4524 if (command_line
.check_section_addresses
)
4525 einfo (_("%P%F: error: no memory region specified"
4526 " for loadable section `%s'\n"),
4527 bfd_get_section_name (link_info
.output_bfd
,
4530 einfo (_("%P: warning: no memory region specified"
4531 " for loadable section `%s'\n"),
4532 bfd_get_section_name (link_info
.output_bfd
,
4536 newdot
= os
->region
->current
;
4537 align
= os
->bfd_section
->alignment_power
;
4540 align
= os
->section_alignment
;
4542 /* Align to what the section needs. */
4545 bfd_vma savedot
= newdot
;
4546 newdot
= align_power (newdot
, align
);
4548 if (newdot
!= savedot
4549 && (config
.warn_section_align
4550 || os
->addr_tree
!= NULL
)
4551 && expld
.phase
!= lang_mark_phase_enum
)
4552 einfo (_("%P: warning: changing start of section"
4553 " %s by %lu bytes\n"),
4554 os
->name
, (unsigned long) (newdot
- savedot
));
4557 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4559 os
->bfd_section
->output_offset
= 0;
4562 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4563 os
->fill
, newdot
, relax
, check_regions
);
4565 os
->processed_vma
= TRUE
;
4567 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4568 /* Except for some special linker created sections,
4569 no output section should change from zero size
4570 after strip_excluded_output_sections. A non-zero
4571 size on an ignored section indicates that some
4572 input section was not sized early enough. */
4573 ASSERT (os
->bfd_section
->size
== 0);
4576 dot
= os
->bfd_section
->vma
;
4578 /* Put the section within the requested block size, or
4579 align at the block boundary. */
4581 + TO_ADDR (os
->bfd_section
->size
)
4582 + os
->block_value
- 1)
4583 & - (bfd_vma
) os
->block_value
);
4585 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4588 /* Set section lma. */
4591 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4595 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4596 os
->bfd_section
->lma
= lma
;
4598 else if (os
->lma_region
!= NULL
)
4600 bfd_vma lma
= os
->lma_region
->current
;
4602 if (os
->section_alignment
!= -1)
4603 lma
= align_power (lma
, os
->section_alignment
);
4604 os
->bfd_section
->lma
= lma
;
4606 else if (r
->last_os
!= NULL
4607 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4612 last
= r
->last_os
->output_section_statement
.bfd_section
;
4614 /* A backwards move of dot should be accompanied by
4615 an explicit assignment to the section LMA (ie.
4616 os->load_base set) because backwards moves can
4617 create overlapping LMAs. */
4619 && os
->bfd_section
->size
!= 0
4620 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4622 /* If dot moved backwards then leave lma equal to
4623 vma. This is the old default lma, which might
4624 just happen to work when the backwards move is
4625 sufficiently large. Nag if this changes anything,
4626 so people can fix their linker scripts. */
4628 if (last
->vma
!= last
->lma
)
4629 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4634 /* If this is an overlay, set the current lma to that
4635 at the end of the previous section. */
4636 if (os
->sectype
== overlay_section
)
4637 lma
= last
->lma
+ last
->size
;
4639 /* Otherwise, keep the same lma to vma relationship
4640 as the previous section. */
4642 lma
= dot
+ last
->lma
- last
->vma
;
4644 if (os
->section_alignment
!= -1)
4645 lma
= align_power (lma
, os
->section_alignment
);
4646 os
->bfd_section
->lma
= lma
;
4649 os
->processed_lma
= TRUE
;
4651 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4654 /* Keep track of normal sections using the default
4655 lma region. We use this to set the lma for
4656 following sections. Overlays or other linker
4657 script assignment to lma might mean that the
4658 default lma == vma is incorrect.
4659 To avoid warnings about dot moving backwards when using
4660 -Ttext, don't start tracking sections until we find one
4661 of non-zero size or with lma set differently to vma. */
4662 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4663 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
4664 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
4665 && (os
->bfd_section
->size
!= 0
4666 || (r
->last_os
== NULL
4667 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
4668 || (r
->last_os
!= NULL
4669 && dot
>= (r
->last_os
->output_section_statement
4670 .bfd_section
->vma
)))
4671 && os
->lma_region
== NULL
4672 && !link_info
.relocatable
)
4675 /* .tbss sections effectively have zero size. */
4676 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4677 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4678 || link_info
.relocatable
)
4679 dot
+= TO_ADDR (os
->bfd_section
->size
);
4681 if (os
->update_dot_tree
!= 0)
4682 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4684 /* Update dot in the region ?
4685 We only do this if the section is going to be allocated,
4686 since unallocated sections do not contribute to the region's
4687 overall size in memory.
4689 If the SEC_NEVER_LOAD bit is not set, it will affect the
4690 addresses of sections after it. We have to update
4692 if (os
->region
!= NULL
4693 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4694 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4696 os
->region
->current
= dot
;
4699 /* Make sure the new address is within the region. */
4700 os_region_check (os
, os
->region
, os
->addr_tree
,
4701 os
->bfd_section
->vma
);
4703 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
4704 && (os
->bfd_section
->flags
& SEC_LOAD
))
4706 os
->lma_region
->current
4707 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
4710 os_region_check (os
, os
->lma_region
, NULL
,
4711 os
->bfd_section
->lma
);
4717 case lang_constructors_statement_enum
:
4718 dot
= lang_size_sections_1 (constructor_list
.head
,
4719 output_section_statement
,
4720 &s
->wild_statement
.children
.head
,
4721 fill
, dot
, relax
, check_regions
);
4724 case lang_data_statement_enum
:
4726 unsigned int size
= 0;
4728 s
->data_statement
.output_offset
=
4729 dot
- output_section_statement
->bfd_section
->vma
;
4730 s
->data_statement
.output_section
=
4731 output_section_statement
->bfd_section
;
4733 /* We might refer to provided symbols in the expression, and
4734 need to mark them as needed. */
4735 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4737 switch (s
->data_statement
.type
)
4755 if (size
< TO_SIZE ((unsigned) 1))
4756 size
= TO_SIZE ((unsigned) 1);
4757 dot
+= TO_ADDR (size
);
4758 output_section_statement
->bfd_section
->size
+= size
;
4762 case lang_reloc_statement_enum
:
4766 s
->reloc_statement
.output_offset
=
4767 dot
- output_section_statement
->bfd_section
->vma
;
4768 s
->reloc_statement
.output_section
=
4769 output_section_statement
->bfd_section
;
4770 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4771 dot
+= TO_ADDR (size
);
4772 output_section_statement
->bfd_section
->size
+= size
;
4776 case lang_wild_statement_enum
:
4777 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4778 output_section_statement
,
4779 &s
->wild_statement
.children
.head
,
4780 fill
, dot
, relax
, check_regions
);
4783 case lang_object_symbols_statement_enum
:
4784 link_info
.create_object_symbols_section
=
4785 output_section_statement
->bfd_section
;
4788 case lang_output_statement_enum
:
4789 case lang_target_statement_enum
:
4792 case lang_input_section_enum
:
4796 i
= (*prev
)->input_section
.section
;
4801 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4802 einfo (_("%P%F: can't relax section: %E\n"));
4806 dot
= size_input_section (prev
, output_section_statement
,
4807 output_section_statement
->fill
, dot
);
4811 case lang_input_statement_enum
:
4814 case lang_fill_statement_enum
:
4815 s
->fill_statement
.output_section
=
4816 output_section_statement
->bfd_section
;
4818 fill
= s
->fill_statement
.fill
;
4821 case lang_assignment_statement_enum
:
4823 bfd_vma newdot
= dot
;
4824 etree_type
*tree
= s
->assignment_statement
.exp
;
4826 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
4828 exp_fold_tree (tree
,
4829 output_section_statement
->bfd_section
,
4832 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
4834 if (!expld
.dataseg
.relro_start_stat
)
4835 expld
.dataseg
.relro_start_stat
= s
;
4838 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
4841 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
4843 if (!expld
.dataseg
.relro_end_stat
)
4844 expld
.dataseg
.relro_end_stat
= s
;
4847 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
4850 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
4852 /* This symbol is relative to this section. */
4853 if ((tree
->type
.node_class
== etree_provided
4854 || tree
->type
.node_class
== etree_assign
)
4855 && (tree
->assign
.dst
[0] != '.'
4856 || tree
->assign
.dst
[1] != '\0'))
4857 output_section_statement
->section_relative_symbol
= 1;
4859 if (!output_section_statement
->ignored
)
4861 if (output_section_statement
== abs_output_section
)
4863 /* If we don't have an output section, then just adjust
4864 the default memory address. */
4865 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4866 FALSE
)->current
= newdot
;
4868 else if (newdot
!= dot
)
4870 /* Insert a pad after this statement. We can't
4871 put the pad before when relaxing, in case the
4872 assignment references dot. */
4873 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4874 output_section_statement
->bfd_section
, dot
);
4876 /* Don't neuter the pad below when relaxing. */
4879 /* If dot is advanced, this implies that the section
4880 should have space allocated to it, unless the
4881 user has explicitly stated that the section
4882 should never be loaded. */
4883 if (!(output_section_statement
->flags
& SEC_NEVER_LOAD
))
4884 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4891 case lang_padding_statement_enum
:
4892 /* If this is the first time lang_size_sections is called,
4893 we won't have any padding statements. If this is the
4894 second or later passes when relaxing, we should allow
4895 padding to shrink. If padding is needed on this pass, it
4896 will be added back in. */
4897 s
->padding_statement
.size
= 0;
4899 /* Make sure output_offset is valid. If relaxation shrinks
4900 the section and this pad isn't needed, it's possible to
4901 have output_offset larger than the final size of the
4902 section. bfd_set_section_contents will complain even for
4903 a pad size of zero. */
4904 s
->padding_statement
.output_offset
4905 = dot
- output_section_statement
->bfd_section
->vma
;
4908 case lang_group_statement_enum
:
4909 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4910 output_section_statement
,
4911 &s
->group_statement
.children
.head
,
4912 fill
, dot
, relax
, check_regions
);
4915 case lang_insert_statement_enum
:
4918 /* We can only get here when relaxing is turned on. */
4919 case lang_address_statement_enum
:
4926 prev
= &s
->header
.next
;
4931 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
4932 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
4933 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
4934 segments. We are allowed an opportunity to override this decision. */
4937 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
4938 bfd
* abfd ATTRIBUTE_UNUSED
,
4939 asection
* current_section
,
4940 asection
* previous_section
,
4941 bfd_boolean new_segment
)
4943 lang_output_section_statement_type
* cur
;
4944 lang_output_section_statement_type
* prev
;
4946 /* The checks below are only necessary when the BFD library has decided
4947 that the two sections ought to be placed into the same segment. */
4951 /* Paranoia checks. */
4952 if (current_section
== NULL
|| previous_section
== NULL
)
4955 /* Find the memory regions associated with the two sections.
4956 We call lang_output_section_find() here rather than scanning the list
4957 of output sections looking for a matching section pointer because if
4958 we have a large number of sections then a hash lookup is faster. */
4959 cur
= lang_output_section_find (current_section
->name
);
4960 prev
= lang_output_section_find (previous_section
->name
);
4962 /* More paranoia. */
4963 if (cur
== NULL
|| prev
== NULL
)
4966 /* If the regions are different then force the sections to live in
4967 different segments. See the email thread starting at the following
4968 URL for the reasons why this is necessary:
4969 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
4970 return cur
->region
!= prev
->region
;
4974 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
4976 lang_statement_iteration
++;
4977 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
4978 &statement_list
.head
, 0, 0, relax
, check_regions
);
4982 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
4984 expld
.phase
= lang_allocating_phase_enum
;
4985 expld
.dataseg
.phase
= exp_dataseg_none
;
4987 one_lang_size_sections_pass (relax
, check_regions
);
4988 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
4989 && link_info
.relro
&& expld
.dataseg
.relro_end
)
4991 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4992 to put expld.dataseg.relro on a (common) page boundary. */
4993 bfd_vma old_min_base
, relro_end
, maxpage
;
4995 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
4996 old_min_base
= expld
.dataseg
.min_base
;
4997 maxpage
= expld
.dataseg
.maxpagesize
;
4998 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
4999 & (expld
.dataseg
.pagesize
- 1));
5000 /* Compute the expected PT_GNU_RELRO segment end. */
5001 relro_end
= (expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5002 & ~(expld
.dataseg
.pagesize
- 1);
5003 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
5005 expld
.dataseg
.base
-= maxpage
;
5006 relro_end
-= maxpage
;
5008 lang_reset_memory_regions ();
5009 one_lang_size_sections_pass (relax
, check_regions
);
5010 if (expld
.dataseg
.relro_end
> relro_end
)
5012 /* The alignment of sections between DATA_SEGMENT_ALIGN
5013 and DATA_SEGMENT_RELRO_END caused huge padding to be
5014 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
5016 unsigned int max_alignment_power
= 0;
5018 /* Find maximum alignment power of sections between
5019 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5020 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5021 if (sec
->vma
>= expld
.dataseg
.base
5022 && sec
->vma
< expld
.dataseg
.relro_end
5023 && sec
->alignment_power
> max_alignment_power
)
5024 max_alignment_power
= sec
->alignment_power
;
5026 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5028 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
5030 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5031 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5032 lang_reset_memory_regions ();
5033 one_lang_size_sections_pass (relax
, check_regions
);
5036 link_info
.relro_start
= expld
.dataseg
.base
;
5037 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5039 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5041 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5042 a page could be saved in the data segment. */
5043 bfd_vma first
, last
;
5045 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5046 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5048 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5049 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5050 && first
+ last
<= expld
.dataseg
.pagesize
)
5052 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5053 lang_reset_memory_regions ();
5054 one_lang_size_sections_pass (relax
, check_regions
);
5058 expld
.phase
= lang_final_phase_enum
;
5061 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5064 lang_do_assignments_1 (lang_statement_union_type
*s
,
5065 lang_output_section_statement_type
*current_os
,
5069 for (; s
!= NULL
; s
= s
->header
.next
)
5071 switch (s
->header
.type
)
5073 case lang_constructors_statement_enum
:
5074 dot
= lang_do_assignments_1 (constructor_list
.head
,
5075 current_os
, fill
, dot
);
5078 case lang_output_section_statement_enum
:
5080 lang_output_section_statement_type
*os
;
5082 os
= &(s
->output_section_statement
);
5083 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5085 dot
= os
->bfd_section
->vma
;
5087 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5089 /* .tbss sections effectively have zero size. */
5090 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5091 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5092 || link_info
.relocatable
)
5093 dot
+= TO_ADDR (os
->bfd_section
->size
);
5098 case lang_wild_statement_enum
:
5100 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5101 current_os
, fill
, dot
);
5104 case lang_object_symbols_statement_enum
:
5105 case lang_output_statement_enum
:
5106 case lang_target_statement_enum
:
5109 case lang_data_statement_enum
:
5110 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5111 if (expld
.result
.valid_p
)
5112 s
->data_statement
.value
= (expld
.result
.value
5113 + expld
.result
.section
->vma
);
5115 einfo (_("%F%P: invalid data statement\n"));
5118 switch (s
->data_statement
.type
)
5136 if (size
< TO_SIZE ((unsigned) 1))
5137 size
= TO_SIZE ((unsigned) 1);
5138 dot
+= TO_ADDR (size
);
5142 case lang_reloc_statement_enum
:
5143 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5144 bfd_abs_section_ptr
, &dot
);
5145 if (expld
.result
.valid_p
)
5146 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5148 einfo (_("%F%P: invalid reloc statement\n"));
5149 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5152 case lang_input_section_enum
:
5154 asection
*in
= s
->input_section
.section
;
5156 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5157 dot
+= TO_ADDR (in
->size
);
5161 case lang_input_statement_enum
:
5164 case lang_fill_statement_enum
:
5165 fill
= s
->fill_statement
.fill
;
5168 case lang_assignment_statement_enum
:
5169 exp_fold_tree (s
->assignment_statement
.exp
,
5170 current_os
->bfd_section
,
5174 case lang_padding_statement_enum
:
5175 dot
+= TO_ADDR (s
->padding_statement
.size
);
5178 case lang_group_statement_enum
:
5179 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5180 current_os
, fill
, dot
);
5183 case lang_insert_statement_enum
:
5186 case lang_address_statement_enum
:
5198 lang_do_assignments (void)
5200 lang_statement_iteration
++;
5201 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5204 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5205 operator .startof. (section_name), it produces an undefined symbol
5206 .startof.section_name. Similarly, when it sees
5207 .sizeof. (section_name), it produces an undefined symbol
5208 .sizeof.section_name. For all the output sections, we look for
5209 such symbols, and set them to the correct value. */
5212 lang_set_startof (void)
5216 if (link_info
.relocatable
)
5219 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5221 const char *secname
;
5223 struct bfd_link_hash_entry
*h
;
5225 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5226 buf
= xmalloc (10 + strlen (secname
));
5228 sprintf (buf
, ".startof.%s", secname
);
5229 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5230 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5232 h
->type
= bfd_link_hash_defined
;
5233 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5234 h
->u
.def
.section
= bfd_abs_section_ptr
;
5237 sprintf (buf
, ".sizeof.%s", secname
);
5238 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5239 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5241 h
->type
= bfd_link_hash_defined
;
5242 h
->u
.def
.value
= TO_ADDR (s
->size
);
5243 h
->u
.def
.section
= bfd_abs_section_ptr
;
5253 struct bfd_link_hash_entry
*h
;
5256 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5257 || link_info
.shared
)
5258 warn
= entry_from_cmdline
;
5262 /* Force the user to specify a root when generating a relocatable with
5264 if (link_info
.gc_sections
&& link_info
.relocatable
5265 && (entry_symbol
.name
== NULL
5266 && ldlang_undef_chain_list_head
== NULL
))
5267 einfo (_("%P%F: gc-sections requires either an entry or "
5268 "an undefined symbol\n"));
5270 if (entry_symbol
.name
== NULL
)
5272 /* No entry has been specified. Look for the default entry, but
5273 don't warn if we don't find it. */
5274 entry_symbol
.name
= entry_symbol_default
;
5278 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5279 FALSE
, FALSE
, TRUE
);
5281 && (h
->type
== bfd_link_hash_defined
5282 || h
->type
== bfd_link_hash_defweak
)
5283 && h
->u
.def
.section
->output_section
!= NULL
)
5287 val
= (h
->u
.def
.value
5288 + bfd_get_section_vma (link_info
.output_bfd
,
5289 h
->u
.def
.section
->output_section
)
5290 + h
->u
.def
.section
->output_offset
);
5291 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5292 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5299 /* We couldn't find the entry symbol. Try parsing it as a
5301 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5304 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5305 einfo (_("%P%F: can't set start address\n"));
5311 /* Can't find the entry symbol, and it's not a number. Use
5312 the first address in the text section. */
5313 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5317 einfo (_("%P: warning: cannot find entry symbol %s;"
5318 " defaulting to %V\n"),
5320 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5321 if (!(bfd_set_start_address
5322 (link_info
.output_bfd
,
5323 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5324 einfo (_("%P%F: can't set start address\n"));
5329 einfo (_("%P: warning: cannot find entry symbol %s;"
5330 " not setting start address\n"),
5336 /* Don't bfd_hash_table_free (&lang_definedness_table);
5337 map file output may result in a call of lang_track_definedness. */
5340 /* This is a small function used when we want to ignore errors from
5344 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5346 /* Don't do anything. */
5349 /* Check that the architecture of all the input files is compatible
5350 with the output file. Also call the backend to let it do any
5351 other checking that is needed. */
5356 lang_statement_union_type
*file
;
5358 const bfd_arch_info_type
*compatible
;
5360 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5362 input_bfd
= file
->input_statement
.the_bfd
;
5364 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5365 command_line
.accept_unknown_input_arch
);
5367 /* In general it is not possible to perform a relocatable
5368 link between differing object formats when the input
5369 file has relocations, because the relocations in the
5370 input format may not have equivalent representations in
5371 the output format (and besides BFD does not translate
5372 relocs for other link purposes than a final link). */
5373 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5374 && (compatible
== NULL
5375 || (bfd_get_flavour (input_bfd
)
5376 != bfd_get_flavour (link_info
.output_bfd
)))
5377 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5379 einfo (_("%P%F: Relocatable linking with relocations from"
5380 " format %s (%B) to format %s (%B) is not supported\n"),
5381 bfd_get_target (input_bfd
), input_bfd
,
5382 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5383 /* einfo with %F exits. */
5386 if (compatible
== NULL
)
5388 if (command_line
.warn_mismatch
)
5389 einfo (_("%P%X: %s architecture of input file `%B'"
5390 " is incompatible with %s output\n"),
5391 bfd_printable_name (input_bfd
), input_bfd
,
5392 bfd_printable_name (link_info
.output_bfd
));
5394 else if (bfd_count_sections (input_bfd
))
5396 /* If the input bfd has no contents, it shouldn't set the
5397 private data of the output bfd. */
5399 bfd_error_handler_type pfn
= NULL
;
5401 /* If we aren't supposed to warn about mismatched input
5402 files, temporarily set the BFD error handler to a
5403 function which will do nothing. We still want to call
5404 bfd_merge_private_bfd_data, since it may set up
5405 information which is needed in the output file. */
5406 if (! command_line
.warn_mismatch
)
5407 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5408 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5410 if (command_line
.warn_mismatch
)
5411 einfo (_("%P%X: failed to merge target specific data"
5412 " of file %B\n"), input_bfd
);
5414 if (! command_line
.warn_mismatch
)
5415 bfd_set_error_handler (pfn
);
5420 /* Look through all the global common symbols and attach them to the
5421 correct section. The -sort-common command line switch may be used
5422 to roughly sort the entries by size. */
5427 if (command_line
.inhibit_common_definition
)
5429 if (link_info
.relocatable
5430 && ! command_line
.force_common_definition
)
5433 if (! config
.sort_common
)
5434 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5439 for (power
= 4; power
>= 0; power
--)
5440 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5444 /* Place one common symbol in the correct section. */
5447 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5449 unsigned int power_of_two
;
5453 if (h
->type
!= bfd_link_hash_common
)
5457 power_of_two
= h
->u
.c
.p
->alignment_power
;
5459 if (config
.sort_common
5460 && power_of_two
< (unsigned int) *(int *) info
)
5463 section
= h
->u
.c
.p
->section
;
5465 /* Increase the size of the section to align the common sym. */
5466 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
5467 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
5469 /* Adjust the alignment if necessary. */
5470 if (power_of_two
> section
->alignment_power
)
5471 section
->alignment_power
= power_of_two
;
5473 /* Change the symbol from common to defined. */
5474 h
->type
= bfd_link_hash_defined
;
5475 h
->u
.def
.section
= section
;
5476 h
->u
.def
.value
= section
->size
;
5478 /* Increase the size of the section. */
5479 section
->size
+= size
;
5481 /* Make sure the section is allocated in memory, and make sure that
5482 it is no longer a common section. */
5483 section
->flags
|= SEC_ALLOC
;
5484 section
->flags
&= ~SEC_IS_COMMON
;
5486 if (config
.map_file
!= NULL
)
5488 static bfd_boolean header_printed
;
5493 if (! header_printed
)
5495 minfo (_("\nAllocating common symbols\n"));
5496 minfo (_("Common symbol size file\n\n"));
5497 header_printed
= TRUE
;
5500 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5501 DMGL_ANSI
| DMGL_PARAMS
);
5504 minfo ("%s", h
->root
.string
);
5505 len
= strlen (h
->root
.string
);
5510 len
= strlen (name
);
5526 if (size
<= 0xffffffff)
5527 sprintf (buf
, "%lx", (unsigned long) size
);
5529 sprintf_vma (buf
, size
);
5539 minfo ("%B\n", section
->owner
);
5545 /* Run through the input files and ensure that every input section has
5546 somewhere to go. If one is found without a destination then create
5547 an input request and place it into the statement tree. */
5550 lang_place_orphans (void)
5552 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5556 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5558 if (s
->output_section
== NULL
)
5560 /* This section of the file is not attached, root
5561 around for a sensible place for it to go. */
5563 if (file
->just_syms_flag
)
5564 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5565 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5566 s
->output_section
= bfd_abs_section_ptr
;
5567 else if (strcmp (s
->name
, "COMMON") == 0)
5569 /* This is a lonely common section which must have
5570 come from an archive. We attach to the section
5571 with the wildcard. */
5572 if (! link_info
.relocatable
5573 || command_line
.force_common_definition
)
5575 if (default_common_section
== NULL
)
5577 default_common_section
=
5578 lang_output_section_statement_lookup (".bss");
5581 lang_add_section (&default_common_section
->children
, s
,
5582 default_common_section
);
5585 else if (ldemul_place_orphan (s
))
5589 lang_output_section_statement_type
*os
;
5591 os
= lang_output_section_statement_lookup (s
->name
);
5592 lang_add_section (&os
->children
, s
, os
);
5600 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5602 flagword
*ptr_flags
;
5604 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5610 *ptr_flags
|= SEC_ALLOC
;
5614 *ptr_flags
|= SEC_READONLY
;
5618 *ptr_flags
|= SEC_DATA
;
5622 *ptr_flags
|= SEC_CODE
;
5627 *ptr_flags
|= SEC_LOAD
;
5631 einfo (_("%P%F: invalid syntax in flags\n"));
5638 /* Call a function on each input file. This function will be called
5639 on an archive, but not on the elements. */
5642 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5644 lang_input_statement_type
*f
;
5646 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5648 f
= (lang_input_statement_type
*) f
->next_real_file
)
5652 /* Call a function on each file. The function will be called on all
5653 the elements of an archive which are included in the link, but will
5654 not be called on the archive file itself. */
5657 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5659 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5666 ldlang_add_file (lang_input_statement_type
*entry
)
5668 lang_statement_append (&file_chain
,
5669 (lang_statement_union_type
*) entry
,
5672 /* The BFD linker needs to have a list of all input BFDs involved in
5674 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5675 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
5677 *link_info
.input_bfds_tail
= entry
->the_bfd
;
5678 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
5679 entry
->the_bfd
->usrdata
= entry
;
5680 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5682 /* Look through the sections and check for any which should not be
5683 included in the link. We need to do this now, so that we can
5684 notice when the backend linker tries to report multiple
5685 definition errors for symbols which are in sections we aren't
5686 going to link. FIXME: It might be better to entirely ignore
5687 symbols which are defined in sections which are going to be
5688 discarded. This would require modifying the backend linker for
5689 each backend which might set the SEC_LINK_ONCE flag. If we do
5690 this, we should probably handle SEC_EXCLUDE in the same way. */
5692 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5696 lang_add_output (const char *name
, int from_script
)
5698 /* Make -o on command line override OUTPUT in script. */
5699 if (!had_output_filename
|| !from_script
)
5701 output_filename
= name
;
5702 had_output_filename
= TRUE
;
5706 static lang_output_section_statement_type
*current_section
;
5717 for (l
= 0; l
< 32; l
++)
5719 if (i
>= (unsigned int) x
)
5727 lang_output_section_statement_type
*
5728 lang_enter_output_section_statement (const char *output_section_statement_name
,
5729 etree_type
*address_exp
,
5730 enum section_type sectype
,
5732 etree_type
*subalign
,
5736 lang_output_section_statement_type
*os
;
5738 os
= lang_output_section_statement_lookup_1 (output_section_statement_name
,
5740 current_section
= os
;
5742 /* Make next things chain into subchain of this. */
5744 if (os
->addr_tree
== NULL
)
5746 os
->addr_tree
= address_exp
;
5748 os
->sectype
= sectype
;
5749 if (sectype
!= noload_section
)
5750 os
->flags
= SEC_NO_FLAGS
;
5752 os
->flags
= SEC_NEVER_LOAD
;
5753 os
->block_value
= 1;
5754 stat_ptr
= &os
->children
;
5756 os
->subsection_alignment
=
5757 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5758 os
->section_alignment
=
5759 topower (exp_get_value_int (align
, -1, "section alignment"));
5761 os
->load_base
= ebase
;
5768 lang_output_statement_type
*new;
5770 new = new_stat (lang_output_statement
, stat_ptr
);
5771 new->name
= output_filename
;
5774 /* Reset the current counters in the regions. */
5777 lang_reset_memory_regions (void)
5779 lang_memory_region_type
*p
= lang_memory_region_list
;
5781 lang_output_section_statement_type
*os
;
5783 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5785 p
->current
= p
->origin
;
5789 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5793 os
->processed_vma
= FALSE
;
5794 os
->processed_lma
= FALSE
;
5797 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5799 /* Save the last size for possible use by bfd_relax_section. */
5800 o
->rawsize
= o
->size
;
5805 /* Worker for lang_gc_sections_1. */
5808 gc_section_callback (lang_wild_statement_type
*ptr
,
5809 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5811 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5812 void *data ATTRIBUTE_UNUSED
)
5814 /* If the wild pattern was marked KEEP, the member sections
5815 should be as well. */
5816 if (ptr
->keep_sections
)
5817 section
->flags
|= SEC_KEEP
;
5820 /* Iterate over sections marking them against GC. */
5823 lang_gc_sections_1 (lang_statement_union_type
*s
)
5825 for (; s
!= NULL
; s
= s
->header
.next
)
5827 switch (s
->header
.type
)
5829 case lang_wild_statement_enum
:
5830 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5832 case lang_constructors_statement_enum
:
5833 lang_gc_sections_1 (constructor_list
.head
);
5835 case lang_output_section_statement_enum
:
5836 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5838 case lang_group_statement_enum
:
5839 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5848 lang_gc_sections (void)
5850 /* Keep all sections so marked in the link script. */
5852 lang_gc_sections_1 (statement_list
.head
);
5854 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5855 the special case of debug info. (See bfd/stabs.c)
5856 Twiddle the flag here, to simplify later linker code. */
5857 if (link_info
.relocatable
)
5859 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5862 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5863 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5864 sec
->flags
&= ~SEC_EXCLUDE
;
5868 if (link_info
.gc_sections
)
5869 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
5872 /* Worker for lang_find_relro_sections_1. */
5875 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
5876 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5878 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5881 /* Discarded, excluded and ignored sections effectively have zero
5883 if (section
->output_section
!= NULL
5884 && section
->output_section
->owner
== link_info
.output_bfd
5885 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
5886 && !IGNORE_SECTION (section
)
5887 && section
->size
!= 0)
5889 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
5890 *has_relro_section
= TRUE
;
5894 /* Iterate over sections for relro sections. */
5897 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
5898 bfd_boolean
*has_relro_section
)
5900 if (*has_relro_section
)
5903 for (; s
!= NULL
; s
= s
->header
.next
)
5905 if (s
== expld
.dataseg
.relro_end_stat
)
5908 switch (s
->header
.type
)
5910 case lang_wild_statement_enum
:
5911 walk_wild (&s
->wild_statement
,
5912 find_relro_section_callback
,
5915 case lang_constructors_statement_enum
:
5916 lang_find_relro_sections_1 (constructor_list
.head
,
5919 case lang_output_section_statement_enum
:
5920 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
5923 case lang_group_statement_enum
:
5924 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
5934 lang_find_relro_sections (void)
5936 bfd_boolean has_relro_section
= FALSE
;
5938 /* Check all sections in the link script. */
5940 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
5941 &has_relro_section
);
5943 if (!has_relro_section
)
5944 link_info
.relro
= FALSE
;
5947 /* Relax all sections until bfd_relax_section gives up. */
5950 relax_sections (void)
5952 /* Keep relaxing until bfd_relax_section gives up. */
5953 bfd_boolean relax_again
;
5955 link_info
.relax_trip
= -1;
5958 relax_again
= FALSE
;
5959 link_info
.relax_trip
++;
5961 /* Note: pe-dll.c does something like this also. If you find
5962 you need to change this code, you probably need to change
5963 pe-dll.c also. DJ */
5965 /* Do all the assignments with our current guesses as to
5967 lang_do_assignments ();
5969 /* We must do this after lang_do_assignments, because it uses
5971 lang_reset_memory_regions ();
5973 /* Perform another relax pass - this time we know where the
5974 globals are, so can make a better guess. */
5975 lang_size_sections (&relax_again
, FALSE
);
5977 while (relax_again
);
5983 /* Finalize dynamic list. */
5984 if (link_info
.dynamic_list
)
5985 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
5987 current_target
= default_target
;
5989 /* Open the output file. */
5990 lang_for_each_statement (ldlang_open_output
);
5993 ldemul_create_output_section_statements ();
5995 /* Add to the hash table all undefineds on the command line. */
5996 lang_place_undefineds ();
5998 if (!bfd_section_already_linked_table_init ())
5999 einfo (_("%P%F: Failed to create hash table\n"));
6001 /* Create a bfd for each input file. */
6002 current_target
= default_target
;
6003 open_input_bfds (statement_list
.head
, FALSE
);
6005 link_info
.gc_sym_list
= &entry_symbol
;
6006 if (entry_symbol
.name
== NULL
)
6007 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6009 ldemul_after_open ();
6011 bfd_section_already_linked_table_free ();
6013 /* Make sure that we're not mixing architectures. We call this
6014 after all the input files have been opened, but before we do any
6015 other processing, so that any operations merge_private_bfd_data
6016 does on the output file will be known during the rest of the
6020 /* Handle .exports instead of a version script if we're told to do so. */
6021 if (command_line
.version_exports_section
)
6022 lang_do_version_exports_section ();
6024 /* Build all sets based on the information gathered from the input
6026 ldctor_build_sets ();
6028 /* Remove unreferenced sections if asked to. */
6029 lang_gc_sections ();
6031 /* Size up the common data. */
6034 /* Update wild statements. */
6035 update_wild_statements (statement_list
.head
);
6037 /* Run through the contours of the script and attach input sections
6038 to the correct output sections. */
6039 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6041 process_insert_statements ();
6043 /* Find any sections not attached explicitly and handle them. */
6044 lang_place_orphans ();
6046 if (! link_info
.relocatable
)
6050 /* Merge SEC_MERGE sections. This has to be done after GC of
6051 sections, so that GCed sections are not merged, but before
6052 assigning dynamic symbols, since removing whole input sections
6054 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6056 /* Look for a text section and set the readonly attribute in it. */
6057 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6061 if (config
.text_read_only
)
6062 found
->flags
|= SEC_READONLY
;
6064 found
->flags
&= ~SEC_READONLY
;
6068 /* Do anything special before sizing sections. This is where ELF
6069 and other back-ends size dynamic sections. */
6070 ldemul_before_allocation ();
6072 /* We must record the program headers before we try to fix the
6073 section positions, since they will affect SIZEOF_HEADERS. */
6074 lang_record_phdrs ();
6076 /* Check relro sections. */
6077 if (link_info
.relro
&& ! link_info
.relocatable
)
6078 lang_find_relro_sections ();
6080 /* Size up the sections. */
6081 lang_size_sections (NULL
, !command_line
.relax
);
6083 /* Now run around and relax if we can. */
6084 if (command_line
.relax
)
6086 /* We may need more than one relaxation pass. */
6087 int i
= link_info
.relax_pass
;
6089 /* The backend can use it to determine the current pass. */
6090 link_info
.relax_pass
= 0;
6095 link_info
.relax_pass
++;
6098 /* Final extra sizing to report errors. */
6099 lang_do_assignments ();
6100 lang_reset_memory_regions ();
6101 lang_size_sections (NULL
, TRUE
);
6104 /* See if anything special should be done now we know how big
6106 ldemul_after_allocation ();
6108 /* Fix any .startof. or .sizeof. symbols. */
6109 lang_set_startof ();
6111 /* Do all the assignments, now that we know the final resting places
6112 of all the symbols. */
6114 lang_do_assignments ();
6118 /* Make sure that the section addresses make sense. */
6119 if (! link_info
.relocatable
6120 && command_line
.check_section_addresses
)
6121 lang_check_section_addresses ();
6126 /* EXPORTED TO YACC */
6129 lang_add_wild (struct wildcard_spec
*filespec
,
6130 struct wildcard_list
*section_list
,
6131 bfd_boolean keep_sections
)
6133 struct wildcard_list
*curr
, *next
;
6134 lang_wild_statement_type
*new;
6136 /* Reverse the list as the parser puts it back to front. */
6137 for (curr
= section_list
, section_list
= NULL
;
6139 section_list
= curr
, curr
= next
)
6141 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6142 placed_commons
= TRUE
;
6145 curr
->next
= section_list
;
6148 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6150 if (strcmp (filespec
->name
, "*") == 0)
6151 filespec
->name
= NULL
;
6152 else if (! wildcardp (filespec
->name
))
6153 lang_has_input_file
= TRUE
;
6156 new = new_stat (lang_wild_statement
, stat_ptr
);
6157 new->filename
= NULL
;
6158 new->filenames_sorted
= FALSE
;
6159 if (filespec
!= NULL
)
6161 new->filename
= filespec
->name
;
6162 new->filenames_sorted
= filespec
->sorted
== by_name
;
6164 new->section_list
= section_list
;
6165 new->keep_sections
= keep_sections
;
6166 lang_list_init (&new->children
);
6167 analyze_walk_wild_section_handler (new);
6171 lang_section_start (const char *name
, etree_type
*address
,
6172 const segment_type
*segment
)
6174 lang_address_statement_type
*ad
;
6176 ad
= new_stat (lang_address_statement
, stat_ptr
);
6177 ad
->section_name
= name
;
6178 ad
->address
= address
;
6179 ad
->segment
= segment
;
6182 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6183 because of a -e argument on the command line, or zero if this is
6184 called by ENTRY in a linker script. Command line arguments take
6188 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6190 if (entry_symbol
.name
== NULL
6192 || ! entry_from_cmdline
)
6194 entry_symbol
.name
= name
;
6195 entry_from_cmdline
= cmdline
;
6199 /* Set the default start symbol to NAME. .em files should use this,
6200 not lang_add_entry, to override the use of "start" if neither the
6201 linker script nor the command line specifies an entry point. NAME
6202 must be permanently allocated. */
6204 lang_default_entry (const char *name
)
6206 entry_symbol_default
= name
;
6210 lang_add_target (const char *name
)
6212 lang_target_statement_type
*new;
6214 new = new_stat (lang_target_statement
, stat_ptr
);
6219 lang_add_map (const char *name
)
6226 map_option_f
= TRUE
;
6234 lang_add_fill (fill_type
*fill
)
6236 lang_fill_statement_type
*new;
6238 new = new_stat (lang_fill_statement
, stat_ptr
);
6243 lang_add_data (int type
, union etree_union
*exp
)
6245 lang_data_statement_type
*new;
6247 new = new_stat (lang_data_statement
, stat_ptr
);
6252 /* Create a new reloc statement. RELOC is the BFD relocation type to
6253 generate. HOWTO is the corresponding howto structure (we could
6254 look this up, but the caller has already done so). SECTION is the
6255 section to generate a reloc against, or NAME is the name of the
6256 symbol to generate a reloc against. Exactly one of SECTION and
6257 NAME must be NULL. ADDEND is an expression for the addend. */
6260 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6261 reloc_howto_type
*howto
,
6264 union etree_union
*addend
)
6266 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6270 p
->section
= section
;
6272 p
->addend_exp
= addend
;
6274 p
->addend_value
= 0;
6275 p
->output_section
= NULL
;
6276 p
->output_offset
= 0;
6279 lang_assignment_statement_type
*
6280 lang_add_assignment (etree_type
*exp
)
6282 lang_assignment_statement_type
*new;
6284 new = new_stat (lang_assignment_statement
, stat_ptr
);
6290 lang_add_attribute (enum statement_enum attribute
)
6292 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6296 lang_startup (const char *name
)
6298 if (startup_file
!= NULL
)
6300 einfo (_("%P%F: multiple STARTUP files\n"));
6302 first_file
->filename
= name
;
6303 first_file
->local_sym_name
= name
;
6304 first_file
->real
= TRUE
;
6306 startup_file
= name
;
6310 lang_float (bfd_boolean maybe
)
6312 lang_float_flag
= maybe
;
6316 /* Work out the load- and run-time regions from a script statement, and
6317 store them in *LMA_REGION and *REGION respectively.
6319 MEMSPEC is the name of the run-time region, or the value of
6320 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6321 LMA_MEMSPEC is the name of the load-time region, or null if the
6322 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6323 had an explicit load address.
6325 It is an error to specify both a load region and a load address. */
6328 lang_get_regions (lang_memory_region_type
**region
,
6329 lang_memory_region_type
**lma_region
,
6330 const char *memspec
,
6331 const char *lma_memspec
,
6332 bfd_boolean have_lma
,
6333 bfd_boolean have_vma
)
6335 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6337 /* If no runtime region or VMA has been specified, but the load region
6338 has been specified, then use the load region for the runtime region
6340 if (lma_memspec
!= NULL
6342 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6343 *region
= *lma_region
;
6345 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6347 if (have_lma
&& lma_memspec
!= 0)
6348 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6352 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6353 lang_output_section_phdr_list
*phdrs
,
6354 const char *lma_memspec
)
6356 lang_get_regions (¤t_section
->region
,
6357 ¤t_section
->lma_region
,
6358 memspec
, lma_memspec
,
6359 current_section
->load_base
!= NULL
,
6360 current_section
->addr_tree
!= NULL
);
6361 current_section
->fill
= fill
;
6362 current_section
->phdrs
= phdrs
;
6363 stat_ptr
= &statement_list
;
6366 /* Create an absolute symbol with the given name with the value of the
6367 address of first byte of the section named.
6369 If the symbol already exists, then do nothing. */
6372 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6374 struct bfd_link_hash_entry
*h
;
6376 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6378 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6380 if (h
->type
== bfd_link_hash_new
6381 || h
->type
== bfd_link_hash_undefined
)
6385 h
->type
= bfd_link_hash_defined
;
6387 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6391 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6393 h
->u
.def
.section
= bfd_abs_section_ptr
;
6397 /* Create an absolute symbol with the given name with the value of the
6398 address of the first byte after the end of the section named.
6400 If the symbol already exists, then do nothing. */
6403 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6405 struct bfd_link_hash_entry
*h
;
6407 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6409 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6411 if (h
->type
== bfd_link_hash_new
6412 || h
->type
== bfd_link_hash_undefined
)
6416 h
->type
= bfd_link_hash_defined
;
6418 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6422 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
6423 + TO_ADDR (sec
->size
));
6425 h
->u
.def
.section
= bfd_abs_section_ptr
;
6430 lang_statement_append (lang_statement_list_type
*list
,
6431 lang_statement_union_type
*element
,
6432 lang_statement_union_type
**field
)
6434 *(list
->tail
) = element
;
6438 /* Set the output format type. -oformat overrides scripts. */
6441 lang_add_output_format (const char *format
,
6446 if (output_target
== NULL
|| !from_script
)
6448 if (command_line
.endian
== ENDIAN_BIG
6451 else if (command_line
.endian
== ENDIAN_LITTLE
6455 output_target
= format
;
6460 lang_add_insert (const char *where
, int is_before
)
6462 lang_insert_statement_type
*new;
6464 new = new_stat (lang_insert_statement
, stat_ptr
);
6466 new->is_before
= is_before
;
6467 saved_script_handle
= previous_script_handle
;
6470 /* Enter a group. This creates a new lang_group_statement, and sets
6471 stat_ptr to build new statements within the group. */
6474 lang_enter_group (void)
6476 lang_group_statement_type
*g
;
6478 g
= new_stat (lang_group_statement
, stat_ptr
);
6479 lang_list_init (&g
->children
);
6480 stat_ptr
= &g
->children
;
6483 /* Leave a group. This just resets stat_ptr to start writing to the
6484 regular list of statements again. Note that this will not work if
6485 groups can occur inside anything else which can adjust stat_ptr,
6486 but currently they can't. */
6489 lang_leave_group (void)
6491 stat_ptr
= &statement_list
;
6494 /* Add a new program header. This is called for each entry in a PHDRS
6495 command in a linker script. */
6498 lang_new_phdr (const char *name
,
6500 bfd_boolean filehdr
,
6505 struct lang_phdr
*n
, **pp
;
6507 n
= stat_alloc (sizeof (struct lang_phdr
));
6510 n
->type
= exp_get_value_int (type
, 0, "program header type");
6511 n
->filehdr
= filehdr
;
6516 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6521 /* Record the program header information in the output BFD. FIXME: We
6522 should not be calling an ELF specific function here. */
6525 lang_record_phdrs (void)
6529 lang_output_section_phdr_list
*last
;
6530 struct lang_phdr
*l
;
6531 lang_output_section_statement_type
*os
;
6534 secs
= xmalloc (alc
* sizeof (asection
*));
6537 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
6544 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6548 lang_output_section_phdr_list
*pl
;
6550 if (os
->constraint
== -1)
6558 if (os
->sectype
== noload_section
6559 || os
->bfd_section
== NULL
6560 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6565 lang_output_section_statement_type
* tmp_os
;
6567 /* If we have not run across a section with a program
6568 header assigned to it yet, then scan forwards to find
6569 one. This prevents inconsistencies in the linker's
6570 behaviour when a script has specified just a single
6571 header and there are sections in that script which are
6572 not assigned to it, and which occur before the first
6573 use of that header. See here for more details:
6574 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6575 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
6578 last
= tmp_os
->phdrs
;
6582 einfo (_("%F%P: no sections assigned to phdrs\n"));
6587 if (os
->bfd_section
== NULL
)
6590 for (; pl
!= NULL
; pl
= pl
->next
)
6592 if (strcmp (pl
->name
, l
->name
) == 0)
6597 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
6599 secs
[c
] = os
->bfd_section
;
6606 if (l
->flags
== NULL
)
6609 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6614 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6616 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
6617 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6618 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6619 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6624 /* Make sure all the phdr assignments succeeded. */
6625 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6629 lang_output_section_phdr_list
*pl
;
6631 if (os
->constraint
== -1
6632 || os
->bfd_section
== NULL
)
6635 for (pl
= os
->phdrs
;
6638 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6639 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6640 os
->name
, pl
->name
);
6644 /* Record a list of sections which may not be cross referenced. */
6647 lang_add_nocrossref (lang_nocrossref_type
*l
)
6649 struct lang_nocrossrefs
*n
;
6651 n
= xmalloc (sizeof *n
);
6652 n
->next
= nocrossref_list
;
6654 nocrossref_list
= n
;
6656 /* Set notice_all so that we get informed about all symbols. */
6657 link_info
.notice_all
= TRUE
;
6660 /* Overlay handling. We handle overlays with some static variables. */
6662 /* The overlay virtual address. */
6663 static etree_type
*overlay_vma
;
6664 /* And subsection alignment. */
6665 static etree_type
*overlay_subalign
;
6667 /* An expression for the maximum section size seen so far. */
6668 static etree_type
*overlay_max
;
6670 /* A list of all the sections in this overlay. */
6672 struct overlay_list
{
6673 struct overlay_list
*next
;
6674 lang_output_section_statement_type
*os
;
6677 static struct overlay_list
*overlay_list
;
6679 /* Start handling an overlay. */
6682 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6684 /* The grammar should prevent nested overlays from occurring. */
6685 ASSERT (overlay_vma
== NULL
6686 && overlay_subalign
== NULL
6687 && overlay_max
== NULL
);
6689 overlay_vma
= vma_expr
;
6690 overlay_subalign
= subalign
;
6693 /* Start a section in an overlay. We handle this by calling
6694 lang_enter_output_section_statement with the correct VMA.
6695 lang_leave_overlay sets up the LMA and memory regions. */
6698 lang_enter_overlay_section (const char *name
)
6700 struct overlay_list
*n
;
6703 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
6704 0, overlay_subalign
, 0, 0);
6706 /* If this is the first section, then base the VMA of future
6707 sections on this one. This will work correctly even if `.' is
6708 used in the addresses. */
6709 if (overlay_list
== NULL
)
6710 overlay_vma
= exp_nameop (ADDR
, name
);
6712 /* Remember the section. */
6713 n
= xmalloc (sizeof *n
);
6714 n
->os
= current_section
;
6715 n
->next
= overlay_list
;
6718 size
= exp_nameop (SIZEOF
, name
);
6720 /* Arrange to work out the maximum section end address. */
6721 if (overlay_max
== NULL
)
6724 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6727 /* Finish a section in an overlay. There isn't any special to do
6731 lang_leave_overlay_section (fill_type
*fill
,
6732 lang_output_section_phdr_list
*phdrs
)
6739 name
= current_section
->name
;
6741 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6742 region and that no load-time region has been specified. It doesn't
6743 really matter what we say here, since lang_leave_overlay will
6745 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6747 /* Define the magic symbols. */
6749 clean
= xmalloc (strlen (name
) + 1);
6751 for (s1
= name
; *s1
!= '\0'; s1
++)
6752 if (ISALNUM (*s1
) || *s1
== '_')
6756 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6757 sprintf (buf
, "__load_start_%s", clean
);
6758 lang_add_assignment (exp_provide (buf
,
6759 exp_nameop (LOADADDR
, name
),
6762 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6763 sprintf (buf
, "__load_stop_%s", clean
);
6764 lang_add_assignment (exp_provide (buf
,
6766 exp_nameop (LOADADDR
, name
),
6767 exp_nameop (SIZEOF
, name
)),
6773 /* Finish an overlay. If there are any overlay wide settings, this
6774 looks through all the sections in the overlay and sets them. */
6777 lang_leave_overlay (etree_type
*lma_expr
,
6780 const char *memspec
,
6781 lang_output_section_phdr_list
*phdrs
,
6782 const char *lma_memspec
)
6784 lang_memory_region_type
*region
;
6785 lang_memory_region_type
*lma_region
;
6786 struct overlay_list
*l
;
6787 lang_nocrossref_type
*nocrossref
;
6789 lang_get_regions (®ion
, &lma_region
,
6790 memspec
, lma_memspec
,
6791 lma_expr
!= NULL
, FALSE
);
6795 /* After setting the size of the last section, set '.' to end of the
6797 if (overlay_list
!= NULL
)
6798 overlay_list
->os
->update_dot_tree
6799 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6804 struct overlay_list
*next
;
6806 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6809 l
->os
->region
= region
;
6810 l
->os
->lma_region
= lma_region
;
6812 /* The first section has the load address specified in the
6813 OVERLAY statement. The rest are worked out from that.
6814 The base address is not needed (and should be null) if
6815 an LMA region was specified. */
6818 l
->os
->load_base
= lma_expr
;
6819 l
->os
->sectype
= normal_section
;
6821 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6822 l
->os
->phdrs
= phdrs
;
6826 lang_nocrossref_type
*nc
;
6828 nc
= xmalloc (sizeof *nc
);
6829 nc
->name
= l
->os
->name
;
6830 nc
->next
= nocrossref
;
6839 if (nocrossref
!= NULL
)
6840 lang_add_nocrossref (nocrossref
);
6843 overlay_list
= NULL
;
6847 /* Version handling. This is only useful for ELF. */
6849 /* This global variable holds the version tree that we build. */
6851 struct bfd_elf_version_tree
*lang_elf_version_info
;
6853 /* If PREV is NULL, return first version pattern matching particular symbol.
6854 If PREV is non-NULL, return first version pattern matching particular
6855 symbol after PREV (previously returned by lang_vers_match). */
6857 static struct bfd_elf_version_expr
*
6858 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6859 struct bfd_elf_version_expr
*prev
,
6862 const char *cxx_sym
= sym
;
6863 const char *java_sym
= sym
;
6864 struct bfd_elf_version_expr
*expr
= NULL
;
6866 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6868 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6872 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6874 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6879 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6881 struct bfd_elf_version_expr e
;
6883 switch (prev
? prev
->mask
: 0)
6886 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6889 expr
= htab_find (head
->htab
, &e
);
6890 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6891 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6897 case BFD_ELF_VERSION_C_TYPE
:
6898 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6901 expr
= htab_find (head
->htab
, &e
);
6902 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6903 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6909 case BFD_ELF_VERSION_CXX_TYPE
:
6910 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6912 e
.symbol
= java_sym
;
6913 expr
= htab_find (head
->htab
, &e
);
6914 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6915 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6926 /* Finally, try the wildcards. */
6927 if (prev
== NULL
|| prev
->symbol
)
6928 expr
= head
->remaining
;
6931 for (; expr
; expr
= expr
->next
)
6938 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6941 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6943 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6947 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6953 free ((char *) cxx_sym
);
6954 if (java_sym
!= sym
)
6955 free ((char *) java_sym
);
6959 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6960 return a string pointing to the symbol name. */
6963 realsymbol (const char *pattern
)
6966 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6967 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6969 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6971 /* It is a glob pattern only if there is no preceding
6973 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6981 /* Remove the preceding backslash. */
6988 backslash
= *p
== '\\';
7003 /* This is called for each variable name or match expression. NEW is
7004 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7005 pattern to be matched against symbol names. */
7007 struct bfd_elf_version_expr
*
7008 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7011 bfd_boolean literal_p
)
7013 struct bfd_elf_version_expr
*ret
;
7015 ret
= xmalloc (sizeof *ret
);
7017 ret
->pattern
= literal_p
? NULL
: new;
7020 ret
->symbol
= literal_p
? new : realsymbol (new);
7022 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7023 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7024 else if (strcasecmp (lang
, "C++") == 0)
7025 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7026 else if (strcasecmp (lang
, "Java") == 0)
7027 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7030 einfo (_("%X%P: unknown language `%s' in version information\n"),
7032 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7035 return ldemul_new_vers_pattern (ret
);
7038 /* This is called for each set of variable names and match
7041 struct bfd_elf_version_tree
*
7042 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7043 struct bfd_elf_version_expr
*locals
)
7045 struct bfd_elf_version_tree
*ret
;
7047 ret
= xcalloc (1, sizeof *ret
);
7048 ret
->globals
.list
= globals
;
7049 ret
->locals
.list
= locals
;
7050 ret
->match
= lang_vers_match
;
7051 ret
->name_indx
= (unsigned int) -1;
7055 /* This static variable keeps track of version indices. */
7057 static int version_index
;
7060 version_expr_head_hash (const void *p
)
7062 const struct bfd_elf_version_expr
*e
= p
;
7064 return htab_hash_string (e
->symbol
);
7068 version_expr_head_eq (const void *p1
, const void *p2
)
7070 const struct bfd_elf_version_expr
*e1
= p1
;
7071 const struct bfd_elf_version_expr
*e2
= p2
;
7073 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
7077 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7080 struct bfd_elf_version_expr
*e
, *next
;
7081 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7083 for (e
= head
->list
; e
; e
= e
->next
)
7087 head
->mask
|= e
->mask
;
7092 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7093 version_expr_head_eq
, NULL
);
7094 list_loc
= &head
->list
;
7095 remaining_loc
= &head
->remaining
;
7096 for (e
= head
->list
; e
; e
= next
)
7102 remaining_loc
= &e
->next
;
7106 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
7110 struct bfd_elf_version_expr
*e1
, *last
;
7116 if (e1
->mask
== e
->mask
)
7124 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
7128 /* This is a duplicate. */
7129 /* FIXME: Memory leak. Sometimes pattern is not
7130 xmalloced alone, but in larger chunk of memory. */
7131 /* free (e->symbol); */
7136 e
->next
= last
->next
;
7144 list_loc
= &e
->next
;
7148 *remaining_loc
= NULL
;
7149 *list_loc
= head
->remaining
;
7152 head
->remaining
= head
->list
;
7155 /* This is called when we know the name and dependencies of the
7159 lang_register_vers_node (const char *name
,
7160 struct bfd_elf_version_tree
*version
,
7161 struct bfd_elf_version_deps
*deps
)
7163 struct bfd_elf_version_tree
*t
, **pp
;
7164 struct bfd_elf_version_expr
*e1
;
7169 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
7170 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
7172 einfo (_("%X%P: anonymous version tag cannot be combined"
7173 " with other version tags\n"));
7178 /* Make sure this node has a unique name. */
7179 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7180 if (strcmp (t
->name
, name
) == 0)
7181 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7183 lang_finalize_version_expr_head (&version
->globals
);
7184 lang_finalize_version_expr_head (&version
->locals
);
7186 /* Check the global and local match names, and make sure there
7187 aren't any duplicates. */
7189 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7191 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7193 struct bfd_elf_version_expr
*e2
;
7195 if (t
->locals
.htab
&& e1
->symbol
)
7197 e2
= htab_find (t
->locals
.htab
, e1
);
7198 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
7200 if (e1
->mask
== e2
->mask
)
7201 einfo (_("%X%P: duplicate expression `%s'"
7202 " in version information\n"), e1
->symbol
);
7206 else if (!e1
->symbol
)
7207 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7208 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7209 && e1
->mask
== e2
->mask
)
7210 einfo (_("%X%P: duplicate expression `%s'"
7211 " in version information\n"), e1
->pattern
);
7215 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7217 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7219 struct bfd_elf_version_expr
*e2
;
7221 if (t
->globals
.htab
&& e1
->symbol
)
7223 e2
= htab_find (t
->globals
.htab
, e1
);
7224 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
7226 if (e1
->mask
== e2
->mask
)
7227 einfo (_("%X%P: duplicate expression `%s'"
7228 " in version information\n"),
7233 else if (!e1
->symbol
)
7234 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7235 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7236 && e1
->mask
== e2
->mask
)
7237 einfo (_("%X%P: duplicate expression `%s'"
7238 " in version information\n"), e1
->pattern
);
7242 version
->deps
= deps
;
7243 version
->name
= name
;
7244 if (name
[0] != '\0')
7247 version
->vernum
= version_index
;
7250 version
->vernum
= 0;
7252 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7257 /* This is called when we see a version dependency. */
7259 struct bfd_elf_version_deps
*
7260 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7262 struct bfd_elf_version_deps
*ret
;
7263 struct bfd_elf_version_tree
*t
;
7265 ret
= xmalloc (sizeof *ret
);
7268 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7270 if (strcmp (t
->name
, name
) == 0)
7272 ret
->version_needed
= t
;
7277 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7283 lang_do_version_exports_section (void)
7285 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7287 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7289 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7297 contents
= xmalloc (len
);
7298 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7299 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7302 while (p
< contents
+ len
)
7304 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7305 p
= strchr (p
, '\0') + 1;
7308 /* Do not free the contents, as we used them creating the regex. */
7310 /* Do not include this section in the link. */
7311 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7314 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7315 lang_register_vers_node (command_line
.version_exports_section
,
7316 lang_new_vers_node (greg
, lreg
), NULL
);
7320 lang_add_unique (const char *name
)
7322 struct unique_sections
*ent
;
7324 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7325 if (strcmp (ent
->name
, name
) == 0)
7328 ent
= xmalloc (sizeof *ent
);
7329 ent
->name
= xstrdup (name
);
7330 ent
->next
= unique_section_list
;
7331 unique_section_list
= ent
;
7334 /* Append the list of dynamic symbols to the existing one. */
7337 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7339 if (link_info
.dynamic_list
)
7341 struct bfd_elf_version_expr
*tail
;
7342 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7344 tail
->next
= link_info
.dynamic_list
->head
.list
;
7345 link_info
.dynamic_list
->head
.list
= dynamic
;
7349 struct bfd_elf_dynamic_list
*d
;
7351 d
= xcalloc (1, sizeof *d
);
7352 d
->head
.list
= dynamic
;
7353 d
->match
= lang_vers_match
;
7354 link_info
.dynamic_list
= d
;
7358 /* Append the list of C++ typeinfo dynamic symbols to the existing
7362 lang_append_dynamic_list_cpp_typeinfo (void)
7364 const char * symbols
[] =
7366 "typeinfo name for*",
7369 struct bfd_elf_version_expr
*dynamic
= NULL
;
7372 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7373 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7376 lang_append_dynamic_list (dynamic
);
7379 /* Append the list of C++ operator new and delete dynamic symbols to the
7383 lang_append_dynamic_list_cpp_new (void)
7385 const char * symbols
[] =
7390 struct bfd_elf_version_expr
*dynamic
= NULL
;
7393 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7394 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7397 lang_append_dynamic_list (dynamic
);