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. */
27 #include "libiberty.h"
28 #include "safe-ctype.h"
47 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
50 /* Locals variables. */
51 static struct obstack stat_obstack
;
52 static struct obstack map_obstack
;
54 #define obstack_chunk_alloc xmalloc
55 #define obstack_chunk_free free
56 static const char *startup_file
;
57 static bfd_boolean placed_commons
= FALSE
;
58 static bfd_boolean stripped_excluded_sections
= FALSE
;
59 static lang_output_section_statement_type
*default_common_section
;
60 static bfd_boolean map_option_f
;
61 static bfd_vma print_dot
;
62 static lang_input_statement_type
*first_file
;
63 static const char *current_target
;
64 static const char *output_target
;
65 static lang_statement_list_type statement_list
;
66 static struct bfd_hash_table lang_definedness_table
;
68 /* Forward declarations. */
69 static void exp_init_os (etree_type
*);
70 static void init_map_userdata (bfd
*, asection
*, void *);
71 static lang_input_statement_type
*lookup_name (const char *);
72 static struct bfd_hash_entry
*lang_definedness_newfunc
73 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
74 static void insert_undefined (const char *);
75 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
76 static void print_statement (lang_statement_union_type
*,
77 lang_output_section_statement_type
*);
78 static void print_statement_list (lang_statement_union_type
*,
79 lang_output_section_statement_type
*);
80 static void print_statements (void);
81 static void print_input_section (asection
*);
82 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
83 static void lang_record_phdrs (void);
84 static void lang_do_version_exports_section (void);
85 static void lang_finalize_version_expr_head
86 (struct bfd_elf_version_expr_head
*);
88 /* Exported variables. */
89 lang_output_section_statement_type
*abs_output_section
;
90 lang_statement_list_type lang_output_section_statement
;
91 lang_statement_list_type
*stat_ptr
= &statement_list
;
92 lang_statement_list_type file_chain
= { NULL
, NULL
};
93 lang_statement_list_type input_file_chain
;
94 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
95 static const char *entry_symbol_default
= "start";
96 const char *entry_section
= ".text";
97 bfd_boolean entry_from_cmdline
;
98 bfd_boolean lang_has_input_file
= FALSE
;
99 bfd_boolean had_output_filename
= FALSE
;
100 bfd_boolean lang_float_flag
= FALSE
;
101 bfd_boolean delete_output_file_on_failure
= FALSE
;
102 struct lang_phdr
*lang_phdr_list
;
103 struct lang_nocrossrefs
*nocrossref_list
;
104 static struct unique_sections
*unique_section_list
;
105 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
107 /* Functions that traverse the linker script and might evaluate
108 DEFINED() need to increment this. */
109 int lang_statement_iteration
= 0;
111 etree_type
*base
; /* Relocation base - or null */
113 /* Return TRUE if the PATTERN argument is a wildcard pattern.
114 Although backslashes are treated specially if a pattern contains
115 wildcards, we do not consider the mere presence of a backslash to
116 be enough to cause the pattern to be treated as a wildcard.
117 That lets us handle DOS filenames more naturally. */
118 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
120 #define new_stat(x, y) \
121 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
123 #define outside_section_address(q) \
124 ((q)->output_offset + (q)->output_section->vma)
126 #define outside_symbol_address(q) \
127 ((q)->value + outside_section_address (q->section))
129 #define SECTION_NAME_MAP_LENGTH (16)
132 stat_alloc (size_t size
)
134 return obstack_alloc (&stat_obstack
, size
);
138 name_match (const char *pattern
, const char *name
)
140 if (wildcardp (pattern
))
141 return fnmatch (pattern
, name
, 0);
142 return strcmp (pattern
, name
);
145 /* If PATTERN is of the form archive:file, return a pointer to the
146 separator. If not, return NULL. */
149 archive_path (const char *pattern
)
153 if (link_info
.path_separator
== 0)
156 p
= strchr (pattern
, link_info
.path_separator
);
157 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
158 if (p
== NULL
|| link_info
.path_separator
!= ':')
161 /* Assume a match on the second char is part of drive specifier,
162 as in "c:\silly.dos". */
163 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
164 p
= strchr (p
+ 1, link_info
.path_separator
);
169 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
170 return whether F matches FILE_SPEC. */
173 input_statement_is_archive_path (const char *file_spec
, char *sep
,
174 lang_input_statement_type
*f
)
176 bfd_boolean match
= FALSE
;
179 || name_match (sep
+ 1, f
->filename
) == 0)
180 && ((sep
!= file_spec
)
181 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
185 if (sep
!= file_spec
)
187 const char *aname
= f
->the_bfd
->my_archive
->filename
;
189 match
= name_match (file_spec
, aname
) == 0;
190 *sep
= link_info
.path_separator
;
197 unique_section_p (const asection
*sec
)
199 struct unique_sections
*unam
;
202 if (link_info
.relocatable
203 && sec
->owner
!= NULL
204 && bfd_is_group_section (sec
->owner
, sec
))
208 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
209 if (name_match (unam
->name
, secnam
) == 0)
215 /* Generic traversal routines for finding matching sections. */
217 /* Try processing a section against a wildcard. This just calls
218 the callback unless the filename exclusion list is present
219 and excludes the file. It's hardly ever present so this
220 function is very fast. */
223 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
224 lang_input_statement_type
*file
,
226 struct wildcard_list
*sec
,
230 struct name_list
*list_tmp
;
232 /* Don't process sections from files which were excluded. */
233 for (list_tmp
= sec
->spec
.exclude_name_list
;
235 list_tmp
= list_tmp
->next
)
237 char *p
= archive_path (list_tmp
->name
);
241 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
245 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
248 /* FIXME: Perhaps remove the following at some stage? Matching
249 unadorned archives like this was never documented and has
250 been superceded by the archive:path syntax. */
251 else if (file
->the_bfd
!= NULL
252 && file
->the_bfd
->my_archive
!= NULL
253 && name_match (list_tmp
->name
,
254 file
->the_bfd
->my_archive
->filename
) == 0)
258 (*callback
) (ptr
, sec
, s
, file
, data
);
261 /* Lowest common denominator routine that can handle everything correctly,
265 walk_wild_section_general (lang_wild_statement_type
*ptr
,
266 lang_input_statement_type
*file
,
271 struct wildcard_list
*sec
;
273 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
275 sec
= ptr
->section_list
;
277 (*callback
) (ptr
, sec
, s
, file
, data
);
281 bfd_boolean skip
= FALSE
;
283 if (sec
->spec
.name
!= NULL
)
285 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
287 skip
= name_match (sec
->spec
.name
, sname
) != 0;
291 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
298 /* Routines to find a single section given its name. If there's more
299 than one section with that name, we report that. */
303 asection
*found_section
;
304 bfd_boolean multiple_sections_found
;
305 } section_iterator_callback_data
;
308 section_iterator_callback (bfd
*bfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
310 section_iterator_callback_data
*d
= data
;
312 if (d
->found_section
!= NULL
)
314 d
->multiple_sections_found
= TRUE
;
318 d
->found_section
= s
;
323 find_section (lang_input_statement_type
*file
,
324 struct wildcard_list
*sec
,
325 bfd_boolean
*multiple_sections_found
)
327 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
329 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
330 section_iterator_callback
, &cb_data
);
331 *multiple_sections_found
= cb_data
.multiple_sections_found
;
332 return cb_data
.found_section
;
335 /* Code for handling simple wildcards without going through fnmatch,
336 which can be expensive because of charset translations etc. */
338 /* A simple wild is a literal string followed by a single '*',
339 where the literal part is at least 4 characters long. */
342 is_simple_wild (const char *name
)
344 size_t len
= strcspn (name
, "*?[");
345 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
349 match_simple_wild (const char *pattern
, const char *name
)
351 /* The first four characters of the pattern are guaranteed valid
352 non-wildcard characters. So we can go faster. */
353 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
354 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
359 while (*pattern
!= '*')
360 if (*name
++ != *pattern
++)
366 /* Compare sections ASEC and BSEC according to SORT. */
369 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
378 case by_alignment_name
:
379 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
380 - bfd_section_alignment (asec
->owner
, asec
));
386 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
387 bfd_get_section_name (bsec
->owner
, bsec
));
390 case by_name_alignment
:
391 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
392 bfd_get_section_name (bsec
->owner
, bsec
));
398 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
399 - bfd_section_alignment (asec
->owner
, asec
));
406 /* Build a Binary Search Tree to sort sections, unlike insertion sort
407 used in wild_sort(). BST is considerably faster if the number of
408 of sections are large. */
410 static lang_section_bst_type
**
411 wild_sort_fast (lang_wild_statement_type
*wild
,
412 struct wildcard_list
*sec
,
413 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
416 lang_section_bst_type
**tree
;
419 if (!wild
->filenames_sorted
420 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
422 /* Append at the right end of tree. */
424 tree
= &((*tree
)->right
);
430 /* Find the correct node to append this section. */
431 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
432 tree
= &((*tree
)->left
);
434 tree
= &((*tree
)->right
);
440 /* Use wild_sort_fast to build a BST to sort sections. */
443 output_section_callback_fast (lang_wild_statement_type
*ptr
,
444 struct wildcard_list
*sec
,
446 lang_input_statement_type
*file
,
447 void *output ATTRIBUTE_UNUSED
)
449 lang_section_bst_type
*node
;
450 lang_section_bst_type
**tree
;
452 if (unique_section_p (section
))
455 node
= xmalloc (sizeof (lang_section_bst_type
));
458 node
->section
= section
;
460 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
465 /* Convert a sorted sections' BST back to list form. */
468 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
469 lang_section_bst_type
*tree
,
473 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
475 lang_add_section (&ptr
->children
, tree
->section
,
476 (lang_output_section_statement_type
*) output
);
479 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
484 /* Specialized, optimized routines for handling different kinds of
488 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
489 lang_input_statement_type
*file
,
493 /* We can just do a hash lookup for the section with the right name.
494 But if that lookup discovers more than one section with the name
495 (should be rare), we fall back to the general algorithm because
496 we would otherwise have to sort the sections to make sure they
497 get processed in the bfd's order. */
498 bfd_boolean multiple_sections_found
;
499 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
500 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
502 if (multiple_sections_found
)
503 walk_wild_section_general (ptr
, file
, callback
, data
);
505 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
509 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
510 lang_input_statement_type
*file
,
515 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
517 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
519 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
520 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
523 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
528 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
529 lang_input_statement_type
*file
,
534 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
535 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
536 bfd_boolean multiple_sections_found
;
537 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
539 if (multiple_sections_found
)
541 walk_wild_section_general (ptr
, file
, callback
, data
);
545 /* Note that if the section was not found, s0 is NULL and
546 we'll simply never succeed the s == s0 test below. */
547 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
549 /* Recall that in this code path, a section cannot satisfy more
550 than one spec, so if s == s0 then it cannot match
553 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
556 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
557 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
560 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
567 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
568 lang_input_statement_type
*file
,
573 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
574 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
575 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
576 bfd_boolean multiple_sections_found
;
577 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
579 if (multiple_sections_found
)
581 walk_wild_section_general (ptr
, file
, callback
, data
);
585 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
588 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
591 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
592 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
595 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
598 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
600 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
608 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
609 lang_input_statement_type
*file
,
614 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
615 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
616 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
617 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
618 bfd_boolean multiple_sections_found
;
619 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
621 if (multiple_sections_found
)
623 walk_wild_section_general (ptr
, file
, callback
, data
);
627 s1
= find_section (file
, sec1
, &multiple_sections_found
);
628 if (multiple_sections_found
)
630 walk_wild_section_general (ptr
, file
, callback
, data
);
634 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
637 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
640 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
643 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
644 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
648 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
652 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
654 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
662 walk_wild_section (lang_wild_statement_type
*ptr
,
663 lang_input_statement_type
*file
,
667 if (file
->just_syms_flag
)
670 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
673 /* Returns TRUE when name1 is a wildcard spec that might match
674 something name2 can match. We're conservative: we return FALSE
675 only if the prefixes of name1 and name2 are different up to the
676 first wildcard character. */
679 wild_spec_can_overlap (const char *name1
, const char *name2
)
681 size_t prefix1_len
= strcspn (name1
, "?*[");
682 size_t prefix2_len
= strcspn (name2
, "?*[");
683 size_t min_prefix_len
;
685 /* Note that if there is no wildcard character, then we treat the
686 terminating 0 as part of the prefix. Thus ".text" won't match
687 ".text." or ".text.*", for example. */
688 if (name1
[prefix1_len
] == '\0')
690 if (name2
[prefix2_len
] == '\0')
693 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
695 return memcmp (name1
, name2
, min_prefix_len
) == 0;
698 /* Select specialized code to handle various kinds of wildcard
702 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
705 int wild_name_count
= 0;
706 struct wildcard_list
*sec
;
710 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
711 ptr
->handler_data
[0] = NULL
;
712 ptr
->handler_data
[1] = NULL
;
713 ptr
->handler_data
[2] = NULL
;
714 ptr
->handler_data
[3] = NULL
;
717 /* Count how many wildcard_specs there are, and how many of those
718 actually use wildcards in the name. Also, bail out if any of the
719 wildcard names are NULL. (Can this actually happen?
720 walk_wild_section used to test for it.) And bail out if any
721 of the wildcards are more complex than a simple string
722 ending in a single '*'. */
723 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
726 if (sec
->spec
.name
== NULL
)
728 if (wildcardp (sec
->spec
.name
))
731 if (!is_simple_wild (sec
->spec
.name
))
736 /* The zero-spec case would be easy to optimize but it doesn't
737 happen in practice. Likewise, more than 4 specs doesn't
738 happen in practice. */
739 if (sec_count
== 0 || sec_count
> 4)
742 /* Check that no two specs can match the same section. */
743 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
745 struct wildcard_list
*sec2
;
746 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
748 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
753 signature
= (sec_count
<< 8) + wild_name_count
;
757 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
760 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
763 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
766 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
769 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
775 /* Now fill the data array with pointers to the specs, first the
776 specs with non-wildcard names, then the specs with wildcard
777 names. It's OK to process the specs in different order from the
778 given order, because we've already determined that no section
779 will match more than one spec. */
781 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
782 if (!wildcardp (sec
->spec
.name
))
783 ptr
->handler_data
[data_counter
++] = sec
;
784 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
785 if (wildcardp (sec
->spec
.name
))
786 ptr
->handler_data
[data_counter
++] = sec
;
789 /* Handle a wild statement for a single file F. */
792 walk_wild_file (lang_wild_statement_type
*s
,
793 lang_input_statement_type
*f
,
797 if (f
->the_bfd
== NULL
798 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
799 walk_wild_section (s
, f
, callback
, data
);
804 /* This is an archive file. We must map each member of the
805 archive separately. */
806 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
807 while (member
!= NULL
)
809 /* When lookup_name is called, it will call the add_symbols
810 entry point for the archive. For each element of the
811 archive which is included, BFD will call ldlang_add_file,
812 which will set the usrdata field of the member to the
813 lang_input_statement. */
814 if (member
->usrdata
!= NULL
)
816 walk_wild_section (s
, member
->usrdata
, callback
, data
);
819 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
825 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
827 const char *file_spec
= s
->filename
;
830 if (file_spec
== NULL
)
832 /* Perform the iteration over all files in the list. */
833 LANG_FOR_EACH_INPUT_STATEMENT (f
)
835 walk_wild_file (s
, f
, callback
, data
);
838 else if ((p
= archive_path (file_spec
)) != NULL
)
840 LANG_FOR_EACH_INPUT_STATEMENT (f
)
842 if (input_statement_is_archive_path (file_spec
, p
, f
))
843 walk_wild_file (s
, f
, callback
, data
);
846 else if (wildcardp (file_spec
))
848 LANG_FOR_EACH_INPUT_STATEMENT (f
)
850 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
851 walk_wild_file (s
, f
, callback
, data
);
856 lang_input_statement_type
*f
;
858 /* Perform the iteration over a single file. */
859 f
= lookup_name (file_spec
);
861 walk_wild_file (s
, f
, callback
, data
);
865 /* lang_for_each_statement walks the parse tree and calls the provided
866 function for each node. */
869 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
870 lang_statement_union_type
*s
)
872 for (; s
!= NULL
; s
= s
->header
.next
)
876 switch (s
->header
.type
)
878 case lang_constructors_statement_enum
:
879 lang_for_each_statement_worker (func
, constructor_list
.head
);
881 case lang_output_section_statement_enum
:
882 lang_for_each_statement_worker
883 (func
, s
->output_section_statement
.children
.head
);
885 case lang_wild_statement_enum
:
886 lang_for_each_statement_worker (func
,
887 s
->wild_statement
.children
.head
);
889 case lang_group_statement_enum
:
890 lang_for_each_statement_worker (func
,
891 s
->group_statement
.children
.head
);
893 case lang_data_statement_enum
:
894 case lang_reloc_statement_enum
:
895 case lang_object_symbols_statement_enum
:
896 case lang_output_statement_enum
:
897 case lang_target_statement_enum
:
898 case lang_input_section_enum
:
899 case lang_input_statement_enum
:
900 case lang_assignment_statement_enum
:
901 case lang_padding_statement_enum
:
902 case lang_address_statement_enum
:
903 case lang_fill_statement_enum
:
904 case lang_insert_statement_enum
:
914 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
916 lang_for_each_statement_worker (func
, statement_list
.head
);
919 /*----------------------------------------------------------------------*/
922 lang_list_init (lang_statement_list_type
*list
)
925 list
->tail
= &list
->head
;
928 /* Build a new statement node for the parse tree. */
930 static lang_statement_union_type
*
931 new_statement (enum statement_enum type
,
933 lang_statement_list_type
*list
)
935 lang_statement_union_type
*new;
937 new = stat_alloc (size
);
938 new->header
.type
= type
;
939 new->header
.next
= NULL
;
940 lang_statement_append (list
, new, &new->header
.next
);
944 /* Build a new input file node for the language. There are several
945 ways in which we treat an input file, eg, we only look at symbols,
946 or prefix it with a -l etc.
948 We can be supplied with requests for input files more than once;
949 they may, for example be split over several lines like foo.o(.text)
950 foo.o(.data) etc, so when asked for a file we check that we haven't
951 got it already so we don't duplicate the bfd. */
953 static lang_input_statement_type
*
954 new_afile (const char *name
,
955 lang_input_file_enum_type file_type
,
957 bfd_boolean add_to_list
)
959 lang_input_statement_type
*p
;
962 p
= new_stat (lang_input_statement
, stat_ptr
);
965 p
= stat_alloc (sizeof (lang_input_statement_type
));
966 p
->header
.type
= lang_input_statement_enum
;
967 p
->header
.next
= NULL
;
970 lang_has_input_file
= TRUE
;
972 p
->sysrooted
= FALSE
;
974 if (file_type
== lang_input_file_is_l_enum
975 && name
[0] == ':' && name
[1] != '\0')
977 file_type
= lang_input_file_is_search_file_enum
;
983 case lang_input_file_is_symbols_only_enum
:
985 p
->is_archive
= FALSE
;
987 p
->local_sym_name
= name
;
988 p
->just_syms_flag
= TRUE
;
989 p
->search_dirs_flag
= FALSE
;
991 case lang_input_file_is_fake_enum
:
993 p
->is_archive
= FALSE
;
995 p
->local_sym_name
= name
;
996 p
->just_syms_flag
= FALSE
;
997 p
->search_dirs_flag
= FALSE
;
999 case lang_input_file_is_l_enum
:
1000 p
->is_archive
= TRUE
;
1003 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1004 p
->just_syms_flag
= FALSE
;
1005 p
->search_dirs_flag
= TRUE
;
1007 case lang_input_file_is_marker_enum
:
1009 p
->is_archive
= FALSE
;
1011 p
->local_sym_name
= name
;
1012 p
->just_syms_flag
= FALSE
;
1013 p
->search_dirs_flag
= TRUE
;
1015 case lang_input_file_is_search_file_enum
:
1016 p
->sysrooted
= ldlang_sysrooted_script
;
1018 p
->is_archive
= FALSE
;
1020 p
->local_sym_name
= name
;
1021 p
->just_syms_flag
= FALSE
;
1022 p
->search_dirs_flag
= TRUE
;
1024 case lang_input_file_is_file_enum
:
1026 p
->is_archive
= FALSE
;
1028 p
->local_sym_name
= name
;
1029 p
->just_syms_flag
= FALSE
;
1030 p
->search_dirs_flag
= FALSE
;
1037 p
->next_real_file
= NULL
;
1039 p
->symbol_count
= 0;
1040 p
->dynamic
= config
.dynamic_link
;
1041 p
->add_needed
= add_needed
;
1042 p
->as_needed
= as_needed
;
1043 p
->whole_archive
= whole_archive
;
1045 lang_statement_append (&input_file_chain
,
1046 (lang_statement_union_type
*) p
,
1047 &p
->next_real_file
);
1051 lang_input_statement_type
*
1052 lang_add_input_file (const char *name
,
1053 lang_input_file_enum_type file_type
,
1056 return new_afile (name
, file_type
, target
, TRUE
);
1059 struct out_section_hash_entry
1061 struct bfd_hash_entry root
;
1062 lang_statement_union_type s
;
1065 /* The hash table. */
1067 static struct bfd_hash_table output_section_statement_table
;
1069 /* Support routines for the hash table used by lang_output_section_find,
1070 initialize the table, fill in an entry and remove the table. */
1072 static struct bfd_hash_entry
*
1073 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1074 struct bfd_hash_table
*table
,
1077 lang_output_section_statement_type
**nextp
;
1078 struct out_section_hash_entry
*ret
;
1082 entry
= bfd_hash_allocate (table
, sizeof (*ret
));
1087 entry
= bfd_hash_newfunc (entry
, table
, string
);
1091 ret
= (struct out_section_hash_entry
*) entry
;
1092 memset (&ret
->s
, 0, sizeof (ret
->s
));
1093 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1094 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1095 ret
->s
.output_section_statement
.section_alignment
= -1;
1096 ret
->s
.output_section_statement
.block_value
= 1;
1097 lang_list_init (&ret
->s
.output_section_statement
.children
);
1098 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1100 /* For every output section statement added to the list, except the
1101 first one, lang_output_section_statement.tail points to the "next"
1102 field of the last element of the list. */
1103 if (lang_output_section_statement
.head
!= NULL
)
1104 ret
->s
.output_section_statement
.prev
1105 = ((lang_output_section_statement_type
*)
1106 ((char *) lang_output_section_statement
.tail
1107 - offsetof (lang_output_section_statement_type
, next
)));
1109 /* GCC's strict aliasing rules prevent us from just casting the
1110 address, so we store the pointer in a variable and cast that
1112 nextp
= &ret
->s
.output_section_statement
.next
;
1113 lang_statement_append (&lang_output_section_statement
,
1115 (lang_statement_union_type
**) nextp
);
1120 output_section_statement_table_init (void)
1122 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1123 output_section_statement_newfunc
,
1124 sizeof (struct out_section_hash_entry
),
1126 einfo (_("%P%F: can not create hash table: %E\n"));
1130 output_section_statement_table_free (void)
1132 bfd_hash_table_free (&output_section_statement_table
);
1135 /* Build enough state so that the parser can build its tree. */
1140 obstack_begin (&stat_obstack
, 1000);
1142 stat_ptr
= &statement_list
;
1144 output_section_statement_table_init ();
1146 lang_list_init (stat_ptr
);
1148 lang_list_init (&input_file_chain
);
1149 lang_list_init (&lang_output_section_statement
);
1150 lang_list_init (&file_chain
);
1151 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1153 abs_output_section
=
1154 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
1156 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1158 /* The value "3" is ad-hoc, somewhat related to the expected number of
1159 DEFINED expressions in a linker script. For most default linker
1160 scripts, there are none. Why a hash table then? Well, it's somewhat
1161 simpler to re-use working machinery than using a linked list in terms
1162 of code-complexity here in ld, besides the initialization which just
1163 looks like other code here. */
1164 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1165 lang_definedness_newfunc
,
1166 sizeof (struct lang_definedness_hash_entry
),
1168 einfo (_("%P%F: can not create hash table: %E\n"));
1174 output_section_statement_table_free ();
1177 /*----------------------------------------------------------------------
1178 A region is an area of memory declared with the
1179 MEMORY { name:org=exp, len=exp ... }
1182 We maintain a list of all the regions here.
1184 If no regions are specified in the script, then the default is used
1185 which is created when looked up to be the entire data space.
1187 If create is true we are creating a region inside a MEMORY block.
1188 In this case it is probably an error to create a region that has
1189 already been created. If we are not inside a MEMORY block it is
1190 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1191 and so we issue a warning. */
1193 static lang_memory_region_type
*lang_memory_region_list
;
1194 static lang_memory_region_type
**lang_memory_region_list_tail
1195 = &lang_memory_region_list
;
1197 lang_memory_region_type
*
1198 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1200 lang_memory_region_type
*p
;
1201 lang_memory_region_type
*new;
1203 /* NAME is NULL for LMA memspecs if no region was specified. */
1207 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1208 if (strcmp (p
->name
, name
) == 0)
1211 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1216 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1217 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
1219 new = stat_alloc (sizeof (lang_memory_region_type
));
1221 new->name
= xstrdup (name
);
1224 new->length
= ~(bfd_size_type
) 0;
1226 new->last_os
= NULL
;
1229 new->had_full_message
= FALSE
;
1231 *lang_memory_region_list_tail
= new;
1232 lang_memory_region_list_tail
= &new->next
;
1237 static lang_memory_region_type
*
1238 lang_memory_default (asection
*section
)
1240 lang_memory_region_type
*p
;
1242 flagword sec_flags
= section
->flags
;
1244 /* Override SEC_DATA to mean a writable section. */
1245 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1246 sec_flags
|= SEC_DATA
;
1248 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1250 if ((p
->flags
& sec_flags
) != 0
1251 && (p
->not_flags
& sec_flags
) == 0)
1256 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1259 lang_output_section_statement_type
*
1260 lang_output_section_find (const char *const name
)
1262 struct out_section_hash_entry
*entry
;
1265 entry
= ((struct out_section_hash_entry
*)
1266 bfd_hash_lookup (&output_section_statement_table
, name
,
1271 hash
= entry
->root
.hash
;
1274 if (entry
->s
.output_section_statement
.constraint
!= -1)
1275 return &entry
->s
.output_section_statement
;
1276 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1278 while (entry
!= NULL
1279 && entry
->root
.hash
== hash
1280 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1285 static lang_output_section_statement_type
*
1286 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1288 struct out_section_hash_entry
*entry
;
1289 struct out_section_hash_entry
*last_ent
;
1292 entry
= ((struct out_section_hash_entry
*)
1293 bfd_hash_lookup (&output_section_statement_table
, name
,
1297 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1301 if (entry
->s
.output_section_statement
.name
!= NULL
)
1303 /* We have a section of this name, but it might not have the correct
1305 hash
= entry
->root
.hash
;
1308 if (entry
->s
.output_section_statement
.constraint
!= -1
1310 || (constraint
== entry
->s
.output_section_statement
.constraint
1311 && constraint
!= SPECIAL
)))
1312 return &entry
->s
.output_section_statement
;
1314 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1316 while (entry
!= NULL
1317 && entry
->root
.hash
== hash
1318 && strcmp (name
, entry
->s
.output_section_statement
.name
) == 0);
1321 = ((struct out_section_hash_entry
*)
1322 output_section_statement_newfunc (NULL
,
1323 &output_section_statement_table
,
1327 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1330 entry
->root
= last_ent
->root
;
1331 last_ent
->root
.next
= &entry
->root
;
1334 entry
->s
.output_section_statement
.name
= name
;
1335 entry
->s
.output_section_statement
.constraint
= constraint
;
1336 return &entry
->s
.output_section_statement
;
1339 lang_output_section_statement_type
*
1340 lang_output_section_statement_lookup (const char *const name
)
1342 return lang_output_section_statement_lookup_1 (name
, 0);
1345 /* A variant of lang_output_section_find used by place_orphan.
1346 Returns the output statement that should precede a new output
1347 statement for SEC. If an exact match is found on certain flags,
1350 lang_output_section_statement_type
*
1351 lang_output_section_find_by_flags (const asection
*sec
,
1352 lang_output_section_statement_type
**exact
,
1353 lang_match_sec_type_func match_type
)
1355 lang_output_section_statement_type
*first
, *look
, *found
;
1358 /* We know the first statement on this list is *ABS*. May as well
1360 first
= &lang_output_section_statement
.head
->output_section_statement
;
1361 first
= first
->next
;
1363 /* First try for an exact match. */
1365 for (look
= first
; look
; look
= look
->next
)
1367 flags
= look
->flags
;
1368 if (look
->bfd_section
!= NULL
)
1370 flags
= look
->bfd_section
->flags
;
1371 if (match_type
&& !match_type (link_info
.output_bfd
,
1376 flags
^= sec
->flags
;
1377 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1378 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1388 if (sec
->flags
& SEC_CODE
)
1390 /* Try for a rw code section. */
1391 for (look
= first
; look
; look
= look
->next
)
1393 flags
= look
->flags
;
1394 if (look
->bfd_section
!= NULL
)
1396 flags
= look
->bfd_section
->flags
;
1397 if (match_type
&& !match_type (link_info
.output_bfd
,
1402 flags
^= sec
->flags
;
1403 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1404 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1408 else if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1410 /* .rodata can go after .text, .sdata2 after .rodata. */
1411 for (look
= first
; look
; look
= look
->next
)
1413 flags
= look
->flags
;
1414 if (look
->bfd_section
!= NULL
)
1416 flags
= look
->bfd_section
->flags
;
1417 if (match_type
&& !match_type (link_info
.output_bfd
,
1422 flags
^= sec
->flags
;
1423 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1425 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1429 else if (sec
->flags
& SEC_SMALL_DATA
)
1431 /* .sdata goes after .data, .sbss after .sdata. */
1432 for (look
= first
; look
; look
= look
->next
)
1434 flags
= look
->flags
;
1435 if (look
->bfd_section
!= NULL
)
1437 flags
= look
->bfd_section
->flags
;
1438 if (match_type
&& !match_type (link_info
.output_bfd
,
1443 flags
^= sec
->flags
;
1444 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1445 | SEC_THREAD_LOCAL
))
1446 || ((look
->flags
& SEC_SMALL_DATA
)
1447 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1451 else if (sec
->flags
& SEC_HAS_CONTENTS
)
1453 /* .data goes after .rodata. */
1454 for (look
= first
; look
; look
= look
->next
)
1456 flags
= look
->flags
;
1457 if (look
->bfd_section
!= NULL
)
1459 flags
= look
->bfd_section
->flags
;
1460 if (match_type
&& !match_type (link_info
.output_bfd
,
1465 flags
^= sec
->flags
;
1466 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1467 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1473 /* .bss goes last. */
1474 for (look
= first
; look
; look
= look
->next
)
1476 flags
= look
->flags
;
1477 if (look
->bfd_section
!= NULL
)
1479 flags
= look
->bfd_section
->flags
;
1480 if (match_type
&& !match_type (link_info
.output_bfd
,
1485 flags
^= sec
->flags
;
1486 if (!(flags
& SEC_ALLOC
))
1491 if (found
|| !match_type
)
1494 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1497 /* Find the last output section before given output statement.
1498 Used by place_orphan. */
1501 output_prev_sec_find (lang_output_section_statement_type
*os
)
1503 lang_output_section_statement_type
*lookup
;
1505 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1507 if (lookup
->constraint
== -1)
1510 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1511 return lookup
->bfd_section
;
1517 /* Look for a suitable place for a new output section statement. The
1518 idea is to skip over anything that might be inside a SECTIONS {}
1519 statement in a script, before we find another output section
1520 statement. Assignments to "dot" before an output section statement
1521 are assumed to belong to it. An exception to this rule is made for
1522 the first assignment to dot, otherwise we might put an orphan
1523 before . = . + SIZEOF_HEADERS or similar assignments that set the
1526 static lang_statement_union_type
**
1527 insert_os_after (lang_output_section_statement_type
*after
)
1529 lang_statement_union_type
**where
;
1530 lang_statement_union_type
**assign
= NULL
;
1531 bfd_boolean ignore_first
;
1534 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1536 for (where
= &after
->header
.next
;
1538 where
= &(*where
)->header
.next
)
1540 switch ((*where
)->header
.type
)
1542 case lang_assignment_statement_enum
:
1545 lang_assignment_statement_type
*ass
;
1547 ass
= &(*where
)->assignment_statement
;
1548 if (ass
->exp
->type
.node_class
!= etree_assert
1549 && ass
->exp
->assign
.dst
[0] == '.'
1550 && ass
->exp
->assign
.dst
[1] == 0
1554 ignore_first
= FALSE
;
1556 case lang_wild_statement_enum
:
1557 case lang_input_section_enum
:
1558 case lang_object_symbols_statement_enum
:
1559 case lang_fill_statement_enum
:
1560 case lang_data_statement_enum
:
1561 case lang_reloc_statement_enum
:
1562 case lang_padding_statement_enum
:
1563 case lang_constructors_statement_enum
:
1566 case lang_output_section_statement_enum
:
1570 case lang_input_statement_enum
:
1571 case lang_address_statement_enum
:
1572 case lang_target_statement_enum
:
1573 case lang_output_statement_enum
:
1574 case lang_group_statement_enum
:
1575 case lang_insert_statement_enum
:
1584 lang_output_section_statement_type
*
1585 lang_insert_orphan (asection
*s
,
1586 const char *secname
,
1587 lang_output_section_statement_type
*after
,
1588 struct orphan_save
*place
,
1589 etree_type
*address
,
1590 lang_statement_list_type
*add_child
)
1592 lang_statement_list_type
*old
;
1593 lang_statement_list_type add
;
1595 lang_output_section_statement_type
*os
;
1596 lang_output_section_statement_type
**os_tail
;
1598 /* Start building a list of statements for this section.
1599 First save the current statement pointer. */
1602 /* If we have found an appropriate place for the output section
1603 statements for this orphan, add them to our own private list,
1604 inserting them later into the global statement list. */
1608 lang_list_init (stat_ptr
);
1612 if (config
.build_constructors
)
1614 /* If the name of the section is representable in C, then create
1615 symbols to mark the start and the end of the section. */
1616 for (ps
= secname
; *ps
!= '\0'; ps
++)
1617 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1622 etree_type
*e_align
;
1624 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1625 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1626 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1627 e_align
= exp_unop (ALIGN_K
,
1628 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1629 lang_add_assignment (exp_assop ('=', ".", e_align
));
1630 lang_add_assignment (exp_provide (symname
,
1631 exp_nameop (NAME
, "."),
1636 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1637 address
= exp_intop (0);
1639 os_tail
= ((lang_output_section_statement_type
**)
1640 lang_output_section_statement
.tail
);
1641 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1644 if (add_child
== NULL
)
1645 add_child
= &os
->children
;
1646 lang_add_section (add_child
, s
, os
);
1648 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1650 if (config
.build_constructors
&& *ps
== '\0')
1654 /* lang_leave_ouput_section_statement resets stat_ptr.
1655 Put stat_ptr back where we want it. */
1659 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1660 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1661 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1662 lang_add_assignment (exp_provide (symname
,
1663 exp_nameop (NAME
, "."),
1667 /* Restore the global list pointer. */
1671 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1673 asection
*snew
, *as
;
1675 snew
= os
->bfd_section
;
1677 /* Shuffle the bfd section list to make the output file look
1678 neater. This is really only cosmetic. */
1679 if (place
->section
== NULL
1680 && after
!= (&lang_output_section_statement
.head
1681 ->output_section_statement
))
1683 asection
*bfd_section
= after
->bfd_section
;
1685 /* If the output statement hasn't been used to place any input
1686 sections (and thus doesn't have an output bfd_section),
1687 look for the closest prior output statement having an
1689 if (bfd_section
== NULL
)
1690 bfd_section
= output_prev_sec_find (after
);
1692 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1693 place
->section
= &bfd_section
->next
;
1696 if (place
->section
== NULL
)
1697 place
->section
= &link_info
.output_bfd
->sections
;
1699 as
= *place
->section
;
1703 /* Put the section at the end of the list. */
1705 /* Unlink the section. */
1706 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1708 /* Now tack it back on in the right place. */
1709 bfd_section_list_append (link_info
.output_bfd
, snew
);
1711 else if (as
!= snew
&& as
->prev
!= snew
)
1713 /* Unlink the section. */
1714 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1716 /* Now tack it back on in the right place. */
1717 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1720 /* Save the end of this list. Further ophans of this type will
1721 follow the one we've just added. */
1722 place
->section
= &snew
->next
;
1724 /* The following is non-cosmetic. We try to put the output
1725 statements in some sort of reasonable order here, because they
1726 determine the final load addresses of the orphan sections.
1727 In addition, placing output statements in the wrong order may
1728 require extra segments. For instance, given a typical
1729 situation of all read-only sections placed in one segment and
1730 following that a segment containing all the read-write
1731 sections, we wouldn't want to place an orphan read/write
1732 section before or amongst the read-only ones. */
1733 if (add
.head
!= NULL
)
1735 lang_output_section_statement_type
*newly_added_os
;
1737 if (place
->stmt
== NULL
)
1739 lang_statement_union_type
**where
= insert_os_after (after
);
1744 place
->os_tail
= &after
->next
;
1748 /* Put it after the last orphan statement we added. */
1749 *add
.tail
= *place
->stmt
;
1750 *place
->stmt
= add
.head
;
1753 /* Fix the global list pointer if we happened to tack our
1754 new list at the tail. */
1755 if (*old
->tail
== add
.head
)
1756 old
->tail
= add
.tail
;
1758 /* Save the end of this list. */
1759 place
->stmt
= add
.tail
;
1761 /* Do the same for the list of output section statements. */
1762 newly_added_os
= *os_tail
;
1764 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1765 ((char *) place
->os_tail
1766 - offsetof (lang_output_section_statement_type
, next
));
1767 newly_added_os
->next
= *place
->os_tail
;
1768 if (newly_added_os
->next
!= NULL
)
1769 newly_added_os
->next
->prev
= newly_added_os
;
1770 *place
->os_tail
= newly_added_os
;
1771 place
->os_tail
= &newly_added_os
->next
;
1773 /* Fixing the global list pointer here is a little different.
1774 We added to the list in lang_enter_output_section_statement,
1775 trimmed off the new output_section_statment above when
1776 assigning *os_tail = NULL, but possibly added it back in
1777 the same place when assigning *place->os_tail. */
1778 if (*os_tail
== NULL
)
1779 lang_output_section_statement
.tail
1780 = (lang_statement_union_type
**) os_tail
;
1787 lang_map_flags (flagword flag
)
1789 if (flag
& SEC_ALLOC
)
1792 if (flag
& SEC_CODE
)
1795 if (flag
& SEC_READONLY
)
1798 if (flag
& SEC_DATA
)
1801 if (flag
& SEC_LOAD
)
1808 lang_memory_region_type
*m
;
1809 bfd_boolean dis_header_printed
= FALSE
;
1812 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1816 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1817 || file
->just_syms_flag
)
1820 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1821 if ((s
->output_section
== NULL
1822 || s
->output_section
->owner
!= link_info
.output_bfd
)
1823 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1825 if (! dis_header_printed
)
1827 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1828 dis_header_printed
= TRUE
;
1831 print_input_section (s
);
1835 minfo (_("\nMemory Configuration\n\n"));
1836 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1837 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1839 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1844 fprintf (config
.map_file
, "%-16s ", m
->name
);
1846 sprintf_vma (buf
, m
->origin
);
1847 minfo ("0x%s ", buf
);
1855 minfo ("0x%V", m
->length
);
1856 if (m
->flags
|| m
->not_flags
)
1864 lang_map_flags (m
->flags
);
1870 lang_map_flags (m
->not_flags
);
1877 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1879 if (! link_info
.reduce_memory_overheads
)
1881 obstack_begin (&map_obstack
, 1000);
1882 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1883 bfd_map_over_sections (p
, init_map_userdata
, 0);
1884 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1886 lang_statement_iteration
++;
1887 print_statements ();
1891 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
1893 void *data ATTRIBUTE_UNUSED
)
1895 fat_section_userdata_type
*new_data
1896 = ((fat_section_userdata_type
*) (stat_alloc
1897 (sizeof (fat_section_userdata_type
))));
1899 ASSERT (get_userdata (sec
) == NULL
);
1900 get_userdata (sec
) = new_data
;
1901 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1905 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
1906 void *info ATTRIBUTE_UNUSED
)
1908 if (hash_entry
->type
== bfd_link_hash_defined
1909 || hash_entry
->type
== bfd_link_hash_defweak
)
1911 struct fat_user_section_struct
*ud
;
1912 struct map_symbol_def
*def
;
1914 ud
= get_userdata (hash_entry
->u
.def
.section
);
1917 /* ??? What do we have to do to initialize this beforehand? */
1918 /* The first time we get here is bfd_abs_section... */
1919 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1920 ud
= get_userdata (hash_entry
->u
.def
.section
);
1922 else if (!ud
->map_symbol_def_tail
)
1923 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1925 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1926 def
->entry
= hash_entry
;
1927 *(ud
->map_symbol_def_tail
) = def
;
1928 ud
->map_symbol_def_tail
= &def
->next
;
1933 /* Initialize an output section. */
1936 init_os (lang_output_section_statement_type
*s
, asection
*isec
,
1939 if (s
->bfd_section
!= NULL
)
1942 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1943 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1945 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
1946 if (s
->bfd_section
== NULL
)
1947 s
->bfd_section
= bfd_make_section_with_flags (link_info
.output_bfd
,
1949 if (s
->bfd_section
== NULL
)
1951 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1952 link_info
.output_bfd
->xvec
->name
, s
->name
);
1954 s
->bfd_section
->output_section
= s
->bfd_section
;
1955 s
->bfd_section
->output_offset
= 0;
1957 if (!link_info
.reduce_memory_overheads
)
1959 fat_section_userdata_type
*new
1960 = stat_alloc (sizeof (fat_section_userdata_type
));
1961 memset (new, 0, sizeof (fat_section_userdata_type
));
1962 get_userdata (s
->bfd_section
) = new;
1965 /* If there is a base address, make sure that any sections it might
1966 mention are initialized. */
1967 if (s
->addr_tree
!= NULL
)
1968 exp_init_os (s
->addr_tree
);
1970 if (s
->load_base
!= NULL
)
1971 exp_init_os (s
->load_base
);
1973 /* If supplied an alignment, set it. */
1974 if (s
->section_alignment
!= -1)
1975 s
->bfd_section
->alignment_power
= s
->section_alignment
;
1978 bfd_init_private_section_data (isec
->owner
, isec
,
1979 link_info
.output_bfd
, s
->bfd_section
,
1983 /* Make sure that all output sections mentioned in an expression are
1987 exp_init_os (etree_type
*exp
)
1989 switch (exp
->type
.node_class
)
1993 exp_init_os (exp
->assign
.src
);
1997 exp_init_os (exp
->binary
.lhs
);
1998 exp_init_os (exp
->binary
.rhs
);
2002 exp_init_os (exp
->trinary
.cond
);
2003 exp_init_os (exp
->trinary
.lhs
);
2004 exp_init_os (exp
->trinary
.rhs
);
2008 exp_init_os (exp
->assert_s
.child
);
2012 exp_init_os (exp
->unary
.child
);
2016 switch (exp
->type
.node_code
)
2022 lang_output_section_statement_type
*os
;
2024 os
= lang_output_section_find (exp
->name
.name
);
2025 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2026 init_os (os
, NULL
, 0);
2037 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2039 lang_input_statement_type
*entry
= data
;
2041 /* If we are only reading symbols from this object, then we want to
2042 discard all sections. */
2043 if (entry
->just_syms_flag
)
2045 bfd_link_just_syms (abfd
, sec
, &link_info
);
2049 if (!(abfd
->flags
& DYNAMIC
))
2050 bfd_section_already_linked (abfd
, sec
, &link_info
);
2053 /* The wild routines.
2055 These expand statements like *(.text) and foo.o to a list of
2056 explicit actions, like foo.o(.text), bar.o(.text) and
2057 foo.o(.text, .data). */
2059 /* Add SECTION to the output section OUTPUT. Do this by creating a
2060 lang_input_section statement which is placed at PTR. FILE is the
2061 input file which holds SECTION. */
2064 lang_add_section (lang_statement_list_type
*ptr
,
2066 lang_output_section_statement_type
*output
)
2068 flagword flags
= section
->flags
;
2069 bfd_boolean discard
;
2071 /* Discard sections marked with SEC_EXCLUDE. */
2072 discard
= (flags
& SEC_EXCLUDE
) != 0;
2074 /* Discard input sections which are assigned to a section named
2075 DISCARD_SECTION_NAME. */
2076 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2079 /* Discard debugging sections if we are stripping debugging
2081 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2082 && (flags
& SEC_DEBUGGING
) != 0)
2087 if (section
->output_section
== NULL
)
2089 /* This prevents future calls from assigning this section. */
2090 section
->output_section
= bfd_abs_section_ptr
;
2095 if (section
->output_section
== NULL
)
2098 lang_input_section_type
*new;
2101 flags
= section
->flags
;
2103 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2104 to an output section, because we want to be able to include a
2105 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2106 section (I don't know why we want to do this, but we do).
2107 build_link_order in ldwrite.c handles this case by turning
2108 the embedded SEC_NEVER_LOAD section into a fill. */
2110 flags
&= ~ SEC_NEVER_LOAD
;
2112 switch (output
->sectype
)
2114 case normal_section
:
2115 case overlay_section
:
2117 case noalloc_section
:
2118 flags
&= ~SEC_ALLOC
;
2120 case noload_section
:
2122 flags
|= SEC_NEVER_LOAD
;
2126 if (output
->bfd_section
== NULL
)
2127 init_os (output
, section
, flags
);
2129 first
= ! output
->bfd_section
->linker_has_input
;
2130 output
->bfd_section
->linker_has_input
= 1;
2132 if (!link_info
.relocatable
2133 && !stripped_excluded_sections
)
2135 asection
*s
= output
->bfd_section
->map_tail
.s
;
2136 output
->bfd_section
->map_tail
.s
= section
;
2137 section
->map_head
.s
= NULL
;
2138 section
->map_tail
.s
= s
;
2140 s
->map_head
.s
= section
;
2142 output
->bfd_section
->map_head
.s
= section
;
2145 /* Add a section reference to the list. */
2146 new = new_stat (lang_input_section
, ptr
);
2148 new->section
= section
;
2149 section
->output_section
= output
->bfd_section
;
2151 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2152 already been processed. One reason to do this is that on pe
2153 format targets, .text$foo sections go into .text and it's odd
2154 to see .text with SEC_LINK_ONCE set. */
2156 if (! link_info
.relocatable
)
2157 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
2159 /* If this is not the first input section, and the SEC_READONLY
2160 flag is not currently set, then don't set it just because the
2161 input section has it set. */
2163 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
2164 flags
&= ~ SEC_READONLY
;
2166 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2168 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2169 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2170 || ((flags
& SEC_MERGE
)
2171 && output
->bfd_section
->entsize
!= section
->entsize
)))
2173 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2174 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2177 output
->bfd_section
->flags
|= flags
;
2179 if (flags
& SEC_MERGE
)
2180 output
->bfd_section
->entsize
= section
->entsize
;
2182 /* If SEC_READONLY is not set in the input section, then clear
2183 it from the output section. */
2184 if ((section
->flags
& SEC_READONLY
) == 0)
2185 output
->bfd_section
->flags
&= ~SEC_READONLY
;
2187 /* Copy over SEC_SMALL_DATA. */
2188 if (section
->flags
& SEC_SMALL_DATA
)
2189 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
2191 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2192 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2194 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
2195 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
2197 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
2198 /* FIXME: This value should really be obtained from the bfd... */
2199 output
->block_value
= 128;
2204 /* Handle wildcard sorting. This returns the lang_input_section which
2205 should follow the one we are going to create for SECTION and FILE,
2206 based on the sorting requirements of WILD. It returns NULL if the
2207 new section should just go at the end of the current list. */
2209 static lang_statement_union_type
*
2210 wild_sort (lang_wild_statement_type
*wild
,
2211 struct wildcard_list
*sec
,
2212 lang_input_statement_type
*file
,
2215 const char *section_name
;
2216 lang_statement_union_type
*l
;
2218 if (!wild
->filenames_sorted
2219 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2222 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2223 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2225 lang_input_section_type
*ls
;
2227 if (l
->header
.type
!= lang_input_section_enum
)
2229 ls
= &l
->input_section
;
2231 /* Sorting by filename takes precedence over sorting by section
2234 if (wild
->filenames_sorted
)
2236 const char *fn
, *ln
;
2240 /* The PE support for the .idata section as generated by
2241 dlltool assumes that files will be sorted by the name of
2242 the archive and then the name of the file within the
2245 if (file
->the_bfd
!= NULL
2246 && bfd_my_archive (file
->the_bfd
) != NULL
)
2248 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2253 fn
= file
->filename
;
2257 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2259 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2264 ln
= ls
->section
->owner
->filename
;
2268 i
= strcmp (fn
, ln
);
2277 fn
= file
->filename
;
2279 ln
= ls
->section
->owner
->filename
;
2281 i
= strcmp (fn
, ln
);
2289 /* Here either the files are not sorted by name, or we are
2290 looking at the sections for this file. */
2292 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2293 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2300 /* Expand a wild statement for a particular FILE. SECTION may be
2301 NULL, in which case it is a wild card. */
2304 output_section_callback (lang_wild_statement_type
*ptr
,
2305 struct wildcard_list
*sec
,
2307 lang_input_statement_type
*file
,
2310 lang_statement_union_type
*before
;
2312 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2313 if (unique_section_p (section
))
2316 before
= wild_sort (ptr
, sec
, file
, section
);
2318 /* Here BEFORE points to the lang_input_section which
2319 should follow the one we are about to add. If BEFORE
2320 is NULL, then the section should just go at the end
2321 of the current list. */
2324 lang_add_section (&ptr
->children
, section
,
2325 (lang_output_section_statement_type
*) output
);
2328 lang_statement_list_type list
;
2329 lang_statement_union_type
**pp
;
2331 lang_list_init (&list
);
2332 lang_add_section (&list
, section
,
2333 (lang_output_section_statement_type
*) output
);
2335 /* If we are discarding the section, LIST.HEAD will
2337 if (list
.head
!= NULL
)
2339 ASSERT (list
.head
->header
.next
== NULL
);
2341 for (pp
= &ptr
->children
.head
;
2343 pp
= &(*pp
)->header
.next
)
2344 ASSERT (*pp
!= NULL
);
2346 list
.head
->header
.next
= *pp
;
2352 /* Check if all sections in a wild statement for a particular FILE
2356 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2357 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2359 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2362 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2363 if (unique_section_p (section
))
2366 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2367 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2370 /* This is passed a file name which must have been seen already and
2371 added to the statement tree. We will see if it has been opened
2372 already and had its symbols read. If not then we'll read it. */
2374 static lang_input_statement_type
*
2375 lookup_name (const char *name
)
2377 lang_input_statement_type
*search
;
2379 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2381 search
= (lang_input_statement_type
*) search
->next_real_file
)
2383 /* Use the local_sym_name as the name of the file that has
2384 already been loaded as filename might have been transformed
2385 via the search directory lookup mechanism. */
2386 const char *filename
= search
->local_sym_name
;
2388 if (filename
!= NULL
2389 && strcmp (filename
, name
) == 0)
2394 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2395 default_target
, FALSE
);
2397 /* If we have already added this file, or this file is not real
2398 don't add this file. */
2399 if (search
->loaded
|| !search
->real
)
2402 if (! load_symbols (search
, NULL
))
2408 /* Save LIST as a list of libraries whose symbols should not be exported. */
2413 struct excluded_lib
*next
;
2415 static struct excluded_lib
*excluded_libs
;
2418 add_excluded_libs (const char *list
)
2420 const char *p
= list
, *end
;
2424 struct excluded_lib
*entry
;
2425 end
= strpbrk (p
, ",:");
2427 end
= p
+ strlen (p
);
2428 entry
= xmalloc (sizeof (*entry
));
2429 entry
->next
= excluded_libs
;
2430 entry
->name
= xmalloc (end
- p
+ 1);
2431 memcpy (entry
->name
, p
, end
- p
);
2432 entry
->name
[end
- p
] = '\0';
2433 excluded_libs
= entry
;
2441 check_excluded_libs (bfd
*abfd
)
2443 struct excluded_lib
*lib
= excluded_libs
;
2447 int len
= strlen (lib
->name
);
2448 const char *filename
= lbasename (abfd
->filename
);
2450 if (strcmp (lib
->name
, "ALL") == 0)
2452 abfd
->no_export
= TRUE
;
2456 if (strncmp (lib
->name
, filename
, len
) == 0
2457 && (filename
[len
] == '\0'
2458 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2459 && filename
[len
+ 2] == '\0')))
2461 abfd
->no_export
= TRUE
;
2469 /* Get the symbols for an input file. */
2472 load_symbols (lang_input_statement_type
*entry
,
2473 lang_statement_list_type
*place
)
2480 ldfile_open_file (entry
);
2482 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2483 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2486 lang_statement_list_type
*hold
;
2487 bfd_boolean bad_load
= TRUE
;
2488 bfd_boolean save_ldlang_sysrooted_script
;
2489 bfd_boolean save_as_needed
, save_add_needed
;
2491 err
= bfd_get_error ();
2493 /* See if the emulation has some special knowledge. */
2494 if (ldemul_unrecognized_file (entry
))
2497 if (err
== bfd_error_file_ambiguously_recognized
)
2501 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2502 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2503 for (p
= matching
; *p
!= NULL
; p
++)
2507 else if (err
!= bfd_error_file_not_recognized
2509 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2513 bfd_close (entry
->the_bfd
);
2514 entry
->the_bfd
= NULL
;
2516 /* Try to interpret the file as a linker script. */
2517 ldfile_open_command_file (entry
->filename
);
2521 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2522 ldlang_sysrooted_script
= entry
->sysrooted
;
2523 save_as_needed
= as_needed
;
2524 as_needed
= entry
->as_needed
;
2525 save_add_needed
= add_needed
;
2526 add_needed
= entry
->add_needed
;
2528 ldfile_assumed_script
= TRUE
;
2529 parser_input
= input_script
;
2530 /* We want to use the same -Bdynamic/-Bstatic as the one for
2532 config
.dynamic_link
= entry
->dynamic
;
2534 ldfile_assumed_script
= FALSE
;
2536 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2537 as_needed
= save_as_needed
;
2538 add_needed
= save_add_needed
;
2544 if (ldemul_recognized_file (entry
))
2547 /* We don't call ldlang_add_file for an archive. Instead, the
2548 add_symbols entry point will call ldlang_add_file, via the
2549 add_archive_element callback, for each element of the archive
2551 switch (bfd_get_format (entry
->the_bfd
))
2557 ldlang_add_file (entry
);
2558 if (trace_files
|| trace_file_tries
)
2559 info_msg ("%I\n", entry
);
2563 check_excluded_libs (entry
->the_bfd
);
2565 if (entry
->whole_archive
)
2568 bfd_boolean loaded
= TRUE
;
2572 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2577 if (! bfd_check_format (member
, bfd_object
))
2579 einfo (_("%F%B: member %B in archive is not an object\n"),
2580 entry
->the_bfd
, member
);
2584 if (! ((*link_info
.callbacks
->add_archive_element
)
2585 (&link_info
, member
, "--whole-archive")))
2588 if (! bfd_link_add_symbols (member
, &link_info
))
2590 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2595 entry
->loaded
= loaded
;
2601 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2602 entry
->loaded
= TRUE
;
2604 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2606 return entry
->loaded
;
2609 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2610 may be NULL, indicating that it is a wildcard. Separate
2611 lang_input_section statements are created for each part of the
2612 expansion; they are added after the wild statement S. OUTPUT is
2613 the output section. */
2616 wild (lang_wild_statement_type
*s
,
2617 const char *target ATTRIBUTE_UNUSED
,
2618 lang_output_section_statement_type
*output
)
2620 struct wildcard_list
*sec
;
2622 if (s
->handler_data
[0]
2623 && s
->handler_data
[0]->spec
.sorted
== by_name
2624 && !s
->filenames_sorted
)
2626 lang_section_bst_type
*tree
;
2628 walk_wild (s
, output_section_callback_fast
, output
);
2633 output_section_callback_tree_to_list (s
, tree
, output
);
2638 walk_wild (s
, output_section_callback
, output
);
2640 if (default_common_section
== NULL
)
2641 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2642 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2644 /* Remember the section that common is going to in case we
2645 later get something which doesn't know where to put it. */
2646 default_common_section
= output
;
2651 /* Return TRUE iff target is the sought target. */
2654 get_target (const bfd_target
*target
, void *data
)
2656 const char *sought
= data
;
2658 return strcmp (target
->name
, sought
) == 0;
2661 /* Like strcpy() but convert to lower case as well. */
2664 stricpy (char *dest
, char *src
)
2668 while ((c
= *src
++) != 0)
2669 *dest
++ = TOLOWER (c
);
2674 /* Remove the first occurrence of needle (if any) in haystack
2678 strcut (char *haystack
, char *needle
)
2680 haystack
= strstr (haystack
, needle
);
2686 for (src
= haystack
+ strlen (needle
); *src
;)
2687 *haystack
++ = *src
++;
2693 /* Compare two target format name strings.
2694 Return a value indicating how "similar" they are. */
2697 name_compare (char *first
, char *second
)
2703 copy1
= xmalloc (strlen (first
) + 1);
2704 copy2
= xmalloc (strlen (second
) + 1);
2706 /* Convert the names to lower case. */
2707 stricpy (copy1
, first
);
2708 stricpy (copy2
, second
);
2710 /* Remove size and endian strings from the name. */
2711 strcut (copy1
, "big");
2712 strcut (copy1
, "little");
2713 strcut (copy2
, "big");
2714 strcut (copy2
, "little");
2716 /* Return a value based on how many characters match,
2717 starting from the beginning. If both strings are
2718 the same then return 10 * their length. */
2719 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2720 if (copy1
[result
] == 0)
2732 /* Set by closest_target_match() below. */
2733 static const bfd_target
*winner
;
2735 /* Scan all the valid bfd targets looking for one that has the endianness
2736 requirement that was specified on the command line, and is the nearest
2737 match to the original output target. */
2740 closest_target_match (const bfd_target
*target
, void *data
)
2742 const bfd_target
*original
= data
;
2744 if (command_line
.endian
== ENDIAN_BIG
2745 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2748 if (command_line
.endian
== ENDIAN_LITTLE
2749 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2752 /* Must be the same flavour. */
2753 if (target
->flavour
!= original
->flavour
)
2756 /* Ignore generic big and little endian elf vectors. */
2757 if (strcmp (target
->name
, "elf32-big") == 0
2758 || strcmp (target
->name
, "elf64-big") == 0
2759 || strcmp (target
->name
, "elf32-little") == 0
2760 || strcmp (target
->name
, "elf64-little") == 0)
2763 /* If we have not found a potential winner yet, then record this one. */
2770 /* Oh dear, we now have two potential candidates for a successful match.
2771 Compare their names and choose the better one. */
2772 if (name_compare (target
->name
, original
->name
)
2773 > name_compare (winner
->name
, original
->name
))
2776 /* Keep on searching until wqe have checked them all. */
2780 /* Return the BFD target format of the first input file. */
2783 get_first_input_target (void)
2785 char *target
= NULL
;
2787 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2789 if (s
->header
.type
== lang_input_statement_enum
2792 ldfile_open_file (s
);
2794 if (s
->the_bfd
!= NULL
2795 && bfd_check_format (s
->the_bfd
, bfd_object
))
2797 target
= bfd_get_target (s
->the_bfd
);
2809 lang_get_output_target (void)
2813 /* Has the user told us which output format to use? */
2814 if (output_target
!= NULL
)
2815 return output_target
;
2817 /* No - has the current target been set to something other than
2819 if (current_target
!= default_target
)
2820 return current_target
;
2822 /* No - can we determine the format of the first input file? */
2823 target
= get_first_input_target ();
2827 /* Failed - use the default output target. */
2828 return default_target
;
2831 /* Open the output file. */
2834 open_output (const char *name
)
2836 output_target
= lang_get_output_target ();
2838 /* Has the user requested a particular endianness on the command
2840 if (command_line
.endian
!= ENDIAN_UNSET
)
2842 const bfd_target
*target
;
2843 enum bfd_endian desired_endian
;
2845 /* Get the chosen target. */
2846 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2848 /* If the target is not supported, we cannot do anything. */
2851 if (command_line
.endian
== ENDIAN_BIG
)
2852 desired_endian
= BFD_ENDIAN_BIG
;
2854 desired_endian
= BFD_ENDIAN_LITTLE
;
2856 /* See if the target has the wrong endianness. This should
2857 not happen if the linker script has provided big and
2858 little endian alternatives, but some scrips don't do
2860 if (target
->byteorder
!= desired_endian
)
2862 /* If it does, then see if the target provides
2863 an alternative with the correct endianness. */
2864 if (target
->alternative_target
!= NULL
2865 && (target
->alternative_target
->byteorder
== desired_endian
))
2866 output_target
= target
->alternative_target
->name
;
2869 /* Try to find a target as similar as possible to
2870 the default target, but which has the desired
2871 endian characteristic. */
2872 bfd_search_for_target (closest_target_match
,
2875 /* Oh dear - we could not find any targets that
2876 satisfy our requirements. */
2878 einfo (_("%P: warning: could not find any targets"
2879 " that match endianness requirement\n"));
2881 output_target
= winner
->name
;
2887 link_info
.output_bfd
= bfd_openw (name
, output_target
);
2889 if (link_info
.output_bfd
== NULL
)
2891 if (bfd_get_error () == bfd_error_invalid_target
)
2892 einfo (_("%P%F: target %s not found\n"), output_target
);
2894 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2897 delete_output_file_on_failure
= TRUE
;
2899 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
2900 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2901 if (! bfd_set_arch_mach (link_info
.output_bfd
,
2902 ldfile_output_architecture
,
2903 ldfile_output_machine
))
2904 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2906 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
2907 if (link_info
.hash
== NULL
)
2908 einfo (_("%P%F: can not create hash table: %E\n"));
2910 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
2914 ldlang_open_output (lang_statement_union_type
*statement
)
2916 switch (statement
->header
.type
)
2918 case lang_output_statement_enum
:
2919 ASSERT (link_info
.output_bfd
== NULL
);
2920 open_output (statement
->output_statement
.name
);
2921 ldemul_set_output_arch ();
2922 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2923 link_info
.output_bfd
->flags
|= D_PAGED
;
2925 link_info
.output_bfd
->flags
&= ~D_PAGED
;
2926 if (config
.text_read_only
)
2927 link_info
.output_bfd
->flags
|= WP_TEXT
;
2929 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
2930 if (link_info
.traditional_format
)
2931 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2933 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2936 case lang_target_statement_enum
:
2937 current_target
= statement
->target_statement
.target
;
2944 /* Convert between addresses in bytes and sizes in octets.
2945 For currently supported targets, octets_per_byte is always a power
2946 of two, so we can use shifts. */
2947 #define TO_ADDR(X) ((X) >> opb_shift)
2948 #define TO_SIZE(X) ((X) << opb_shift)
2950 /* Support the above. */
2951 static unsigned int opb_shift
= 0;
2956 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2957 ldfile_output_machine
);
2960 while ((x
& 1) == 0)
2968 /* Open all the input files. */
2971 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2973 for (; s
!= NULL
; s
= s
->header
.next
)
2975 switch (s
->header
.type
)
2977 case lang_constructors_statement_enum
:
2978 open_input_bfds (constructor_list
.head
, force
);
2980 case lang_output_section_statement_enum
:
2981 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2983 case lang_wild_statement_enum
:
2984 /* Maybe we should load the file's symbols. */
2985 if (s
->wild_statement
.filename
2986 && !wildcardp (s
->wild_statement
.filename
)
2987 && !archive_path (s
->wild_statement
.filename
))
2988 lookup_name (s
->wild_statement
.filename
);
2989 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2991 case lang_group_statement_enum
:
2993 struct bfd_link_hash_entry
*undefs
;
2995 /* We must continually search the entries in the group
2996 until no new symbols are added to the list of undefined
3001 undefs
= link_info
.hash
->undefs_tail
;
3002 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
3004 while (undefs
!= link_info
.hash
->undefs_tail
);
3007 case lang_target_statement_enum
:
3008 current_target
= s
->target_statement
.target
;
3010 case lang_input_statement_enum
:
3011 if (s
->input_statement
.real
)
3013 lang_statement_list_type add
;
3015 s
->input_statement
.target
= current_target
;
3017 /* If we are being called from within a group, and this
3018 is an archive which has already been searched, then
3019 force it to be researched unless the whole archive
3020 has been loaded already. */
3022 && !s
->input_statement
.whole_archive
3023 && s
->input_statement
.loaded
3024 && bfd_check_format (s
->input_statement
.the_bfd
,
3026 s
->input_statement
.loaded
= FALSE
;
3028 lang_list_init (&add
);
3030 if (! load_symbols (&s
->input_statement
, &add
))
3031 config
.make_executable
= FALSE
;
3033 if (add
.head
!= NULL
)
3035 *add
.tail
= s
->header
.next
;
3036 s
->header
.next
= add
.head
;
3046 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3049 lang_track_definedness (const char *name
)
3051 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3052 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3055 /* New-function for the definedness hash table. */
3057 static struct bfd_hash_entry
*
3058 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3059 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3060 const char *name ATTRIBUTE_UNUSED
)
3062 struct lang_definedness_hash_entry
*ret
3063 = (struct lang_definedness_hash_entry
*) entry
;
3066 ret
= (struct lang_definedness_hash_entry
*)
3067 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3070 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3072 ret
->iteration
= -1;
3076 /* Return the iteration when the definition of NAME was last updated. A
3077 value of -1 means that the symbol is not defined in the linker script
3078 or the command line, but may be defined in the linker symbol table. */
3081 lang_symbol_definition_iteration (const char *name
)
3083 struct lang_definedness_hash_entry
*defentry
3084 = (struct lang_definedness_hash_entry
*)
3085 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3087 /* We've already created this one on the presence of DEFINED in the
3088 script, so it can't be NULL unless something is borked elsewhere in
3090 if (defentry
== NULL
)
3093 return defentry
->iteration
;
3096 /* Update the definedness state of NAME. */
3099 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3101 struct lang_definedness_hash_entry
*defentry
3102 = (struct lang_definedness_hash_entry
*)
3103 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3105 /* We don't keep track of symbols not tested with DEFINED. */
3106 if (defentry
== NULL
)
3109 /* If the symbol was already defined, and not from an earlier statement
3110 iteration, don't update the definedness iteration, because that'd
3111 make the symbol seem defined in the linker script at this point, and
3112 it wasn't; it was defined in some object. If we do anyway, DEFINED
3113 would start to yield false before this point and the construct "sym =
3114 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3116 if (h
->type
!= bfd_link_hash_undefined
3117 && h
->type
!= bfd_link_hash_common
3118 && h
->type
!= bfd_link_hash_new
3119 && defentry
->iteration
== -1)
3122 defentry
->iteration
= lang_statement_iteration
;
3125 /* Add the supplied name to the symbol table as an undefined reference.
3126 This is a two step process as the symbol table doesn't even exist at
3127 the time the ld command line is processed. First we put the name
3128 on a list, then, once the output file has been opened, transfer the
3129 name to the symbol table. */
3131 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3133 #define ldlang_undef_chain_list_head entry_symbol.next
3136 ldlang_add_undef (const char *const name
)
3138 ldlang_undef_chain_list_type
*new =
3139 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
3141 new->next
= ldlang_undef_chain_list_head
;
3142 ldlang_undef_chain_list_head
= new;
3144 new->name
= xstrdup (name
);
3146 if (link_info
.output_bfd
!= NULL
)
3147 insert_undefined (new->name
);
3150 /* Insert NAME as undefined in the symbol table. */
3153 insert_undefined (const char *name
)
3155 struct bfd_link_hash_entry
*h
;
3157 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3159 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3160 if (h
->type
== bfd_link_hash_new
)
3162 h
->type
= bfd_link_hash_undefined
;
3163 h
->u
.undef
.abfd
= NULL
;
3164 bfd_link_add_undef (link_info
.hash
, h
);
3168 /* Run through the list of undefineds created above and place them
3169 into the linker hash table as undefined symbols belonging to the
3173 lang_place_undefineds (void)
3175 ldlang_undef_chain_list_type
*ptr
;
3177 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3178 insert_undefined (ptr
->name
);
3181 /* Check for all readonly or some readwrite sections. */
3184 check_input_sections
3185 (lang_statement_union_type
*s
,
3186 lang_output_section_statement_type
*output_section_statement
)
3188 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3190 switch (s
->header
.type
)
3192 case lang_wild_statement_enum
:
3193 walk_wild (&s
->wild_statement
, check_section_callback
,
3194 output_section_statement
);
3195 if (! output_section_statement
->all_input_readonly
)
3198 case lang_constructors_statement_enum
:
3199 check_input_sections (constructor_list
.head
,
3200 output_section_statement
);
3201 if (! output_section_statement
->all_input_readonly
)
3204 case lang_group_statement_enum
:
3205 check_input_sections (s
->group_statement
.children
.head
,
3206 output_section_statement
);
3207 if (! output_section_statement
->all_input_readonly
)
3216 /* Update wildcard statements if needed. */
3219 update_wild_statements (lang_statement_union_type
*s
)
3221 struct wildcard_list
*sec
;
3223 switch (sort_section
)
3233 for (; s
!= NULL
; s
= s
->header
.next
)
3235 switch (s
->header
.type
)
3240 case lang_wild_statement_enum
:
3241 sec
= s
->wild_statement
.section_list
;
3242 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3245 switch (sec
->spec
.sorted
)
3248 sec
->spec
.sorted
= sort_section
;
3251 if (sort_section
== by_alignment
)
3252 sec
->spec
.sorted
= by_name_alignment
;
3255 if (sort_section
== by_name
)
3256 sec
->spec
.sorted
= by_alignment_name
;
3264 case lang_constructors_statement_enum
:
3265 update_wild_statements (constructor_list
.head
);
3268 case lang_output_section_statement_enum
:
3269 update_wild_statements
3270 (s
->output_section_statement
.children
.head
);
3273 case lang_group_statement_enum
:
3274 update_wild_statements (s
->group_statement
.children
.head
);
3282 /* Open input files and attach to output sections. */
3285 map_input_to_output_sections
3286 (lang_statement_union_type
*s
, const char *target
,
3287 lang_output_section_statement_type
*os
)
3291 for (; s
!= NULL
; s
= s
->header
.next
)
3293 switch (s
->header
.type
)
3295 case lang_wild_statement_enum
:
3296 wild (&s
->wild_statement
, target
, os
);
3298 case lang_constructors_statement_enum
:
3299 map_input_to_output_sections (constructor_list
.head
,
3303 case lang_output_section_statement_enum
:
3304 if (s
->output_section_statement
.constraint
)
3306 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3307 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3309 s
->output_section_statement
.all_input_readonly
= TRUE
;
3310 check_input_sections (s
->output_section_statement
.children
.head
,
3311 &s
->output_section_statement
);
3312 if ((s
->output_section_statement
.all_input_readonly
3313 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3314 || (!s
->output_section_statement
.all_input_readonly
3315 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3317 s
->output_section_statement
.constraint
= -1;
3322 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3324 &s
->output_section_statement
);
3326 case lang_output_statement_enum
:
3328 case lang_target_statement_enum
:
3329 target
= s
->target_statement
.target
;
3331 case lang_group_statement_enum
:
3332 map_input_to_output_sections (s
->group_statement
.children
.head
,
3336 case lang_data_statement_enum
:
3337 /* Make sure that any sections mentioned in the expression
3339 exp_init_os (s
->data_statement
.exp
);
3340 flags
= SEC_HAS_CONTENTS
;
3341 /* The output section gets contents, and then we inspect for
3342 any flags set in the input script which override any ALLOC. */
3343 if (!(os
->flags
& SEC_NEVER_LOAD
))
3344 flags
|= SEC_ALLOC
| SEC_LOAD
;
3345 if (os
->bfd_section
== NULL
)
3346 init_os (os
, NULL
, flags
);
3348 os
->bfd_section
->flags
|= flags
;
3350 case lang_input_section_enum
:
3352 case lang_fill_statement_enum
:
3353 case lang_object_symbols_statement_enum
:
3354 case lang_reloc_statement_enum
:
3355 case lang_padding_statement_enum
:
3356 case lang_input_statement_enum
:
3357 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3358 init_os (os
, NULL
, 0);
3360 case lang_assignment_statement_enum
:
3361 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3362 init_os (os
, NULL
, 0);
3364 /* Make sure that any sections mentioned in the assignment
3366 exp_init_os (s
->assignment_statement
.exp
);
3368 case lang_address_statement_enum
:
3369 /* Mark the specified section with the supplied address.
3370 If this section was actually a segment marker, then the
3371 directive is ignored if the linker script explicitly
3372 processed the segment marker. Originally, the linker
3373 treated segment directives (like -Ttext on the
3374 command-line) as section directives. We honor the
3375 section directive semantics for backwards compatibilty;
3376 linker scripts that do not specifically check for
3377 SEGMENT_START automatically get the old semantics. */
3378 if (!s
->address_statement
.segment
3379 || !s
->address_statement
.segment
->used
)
3381 lang_output_section_statement_type
*aos
3382 = (lang_output_section_statement_lookup
3383 (s
->address_statement
.section_name
));
3385 if (aos
->bfd_section
== NULL
)
3386 init_os (aos
, NULL
, 0);
3387 aos
->addr_tree
= s
->address_statement
.address
;
3390 case lang_insert_statement_enum
:
3396 /* An insert statement snips out all the linker statements from the
3397 start of the list and places them after the output section
3398 statement specified by the insert. This operation is complicated
3399 by the fact that we keep a doubly linked list of output section
3400 statements as well as the singly linked list of all statements. */
3403 process_insert_statements (void)
3405 lang_statement_union_type
**s
;
3406 lang_output_section_statement_type
*first_os
= NULL
;
3407 lang_output_section_statement_type
*last_os
= NULL
;
3409 /* "start of list" is actually the statement immediately after
3410 the special abs_section output statement, so that it isn't
3412 s
= &lang_output_section_statement
.head
;
3413 while (*(s
= &(*s
)->header
.next
) != NULL
)
3415 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3417 /* Keep pointers to the first and last output section
3418 statement in the sequence we may be about to move. */
3419 last_os
= &(*s
)->output_section_statement
;
3420 if (first_os
== NULL
)
3423 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3425 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3426 lang_output_section_statement_type
*where
;
3427 lang_output_section_statement_type
*os
;
3428 lang_statement_union_type
**ptr
;
3429 lang_statement_union_type
*first
;
3431 where
= lang_output_section_find (i
->where
);
3432 if (where
!= NULL
&& i
->is_before
)
3435 where
= where
->prev
;
3436 while (where
!= NULL
&& where
->constraint
== -1);
3440 einfo (_("%X%P: %s not found for insert\n"), i
->where
);
3443 /* You can't insert into the list you are moving. */
3444 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3445 if (os
== where
|| os
== last_os
)
3449 einfo (_("%X%P: %s not found for insert\n"), i
->where
);
3453 /* Deal with reordering the output section statement list. */
3454 if (last_os
!= NULL
)
3456 asection
*first_sec
, *last_sec
;
3457 struct lang_output_section_statement_struct
**next
;
3459 /* Snip out the output sections we are moving. */
3460 first_os
->prev
->next
= last_os
->next
;
3461 if (last_os
->next
== NULL
)
3463 next
= &first_os
->prev
->next
;
3464 lang_output_section_statement
.tail
3465 = (lang_statement_union_type
**) next
;
3468 last_os
->next
->prev
= first_os
->prev
;
3469 /* Add them in at the new position. */
3470 last_os
->next
= where
->next
;
3471 if (where
->next
== NULL
)
3473 next
= &last_os
->next
;
3474 lang_output_section_statement
.tail
3475 = (lang_statement_union_type
**) next
;
3478 where
->next
->prev
= last_os
;
3479 first_os
->prev
= where
;
3480 where
->next
= first_os
;
3482 /* Move the bfd sections in the same way. */
3485 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3487 if (os
->bfd_section
!= NULL
3488 && os
->bfd_section
->owner
!= NULL
)
3490 last_sec
= os
->bfd_section
;
3491 if (first_sec
== NULL
)
3492 first_sec
= last_sec
;
3497 if (last_sec
!= NULL
)
3499 asection
*sec
= where
->bfd_section
;
3501 sec
= output_prev_sec_find (where
);
3503 /* The place we want to insert must come after the
3504 sections we are moving. So if we find no
3505 section or if the section is the same as our
3506 last section, then no move is needed. */
3507 if (sec
!= NULL
&& sec
!= last_sec
)
3509 /* Trim them off. */
3510 if (first_sec
->prev
!= NULL
)
3511 first_sec
->prev
->next
= last_sec
->next
;
3513 link_info
.output_bfd
->sections
= last_sec
->next
;
3514 if (last_sec
->next
!= NULL
)
3515 last_sec
->next
->prev
= first_sec
->prev
;
3517 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3519 last_sec
->next
= sec
->next
;
3520 if (sec
->next
!= NULL
)
3521 sec
->next
->prev
= last_sec
;
3523 link_info
.output_bfd
->section_last
= last_sec
;
3524 first_sec
->prev
= sec
;
3525 sec
->next
= first_sec
;
3533 ptr
= insert_os_after (where
);
3534 /* Snip everything after the abs_section output statement we
3535 know is at the start of the list, up to and including
3536 the insert statement we are currently processing. */
3537 first
= lang_output_section_statement
.head
->header
.next
;
3538 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3539 /* Add them back where they belong. */
3542 statement_list
.tail
= s
;
3544 s
= &lang_output_section_statement
.head
;
3549 /* An output section might have been removed after its statement was
3550 added. For example, ldemul_before_allocation can remove dynamic
3551 sections if they turn out to be not needed. Clean them up here. */
3554 strip_excluded_output_sections (void)
3556 lang_output_section_statement_type
*os
;
3558 /* Run lang_size_sections (if not already done). */
3559 if (expld
.phase
!= lang_mark_phase_enum
)
3561 expld
.phase
= lang_mark_phase_enum
;
3562 expld
.dataseg
.phase
= exp_dataseg_none
;
3563 one_lang_size_sections_pass (NULL
, FALSE
);
3564 lang_reset_memory_regions ();
3567 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3571 asection
*output_section
;
3572 bfd_boolean exclude
;
3574 if (os
->constraint
== -1)
3577 output_section
= os
->bfd_section
;
3578 if (output_section
== NULL
)
3581 exclude
= (output_section
->rawsize
== 0
3582 && (output_section
->flags
& SEC_KEEP
) == 0
3583 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3586 /* Some sections have not yet been sized, notably .gnu.version,
3587 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3588 input sections, so don't drop output sections that have such
3589 input sections unless they are also marked SEC_EXCLUDE. */
3590 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3594 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3595 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3596 && (s
->flags
& SEC_EXCLUDE
) == 0)
3603 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3604 output_section
->map_head
.link_order
= NULL
;
3605 output_section
->map_tail
.link_order
= NULL
;
3609 /* We don't set bfd_section to NULL since bfd_section of the
3610 removed output section statement may still be used. */
3611 if (!os
->section_relative_symbol
3612 && !os
->update_dot_tree
)
3614 output_section
->flags
|= SEC_EXCLUDE
;
3615 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3616 link_info
.output_bfd
->section_count
--;
3620 /* Stop future calls to lang_add_section from messing with map_head
3621 and map_tail link_order fields. */
3622 stripped_excluded_sections
= TRUE
;
3626 print_output_section_statement
3627 (lang_output_section_statement_type
*output_section_statement
)
3629 asection
*section
= output_section_statement
->bfd_section
;
3632 if (output_section_statement
!= abs_output_section
)
3634 minfo ("\n%s", output_section_statement
->name
);
3636 if (section
!= NULL
)
3638 print_dot
= section
->vma
;
3640 len
= strlen (output_section_statement
->name
);
3641 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3646 while (len
< SECTION_NAME_MAP_LENGTH
)
3652 minfo ("0x%V %W", section
->vma
, section
->size
);
3654 if (section
->vma
!= section
->lma
)
3655 minfo (_(" load address 0x%V"), section
->lma
);
3657 if (output_section_statement
->update_dot_tree
!= NULL
)
3658 exp_fold_tree (output_section_statement
->update_dot_tree
,
3659 bfd_abs_section_ptr
, &print_dot
);
3665 print_statement_list (output_section_statement
->children
.head
,
3666 output_section_statement
);
3669 /* Scan for the use of the destination in the right hand side
3670 of an expression. In such cases we will not compute the
3671 correct expression, since the value of DST that is used on
3672 the right hand side will be its final value, not its value
3673 just before this expression is evaluated. */
3676 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3678 if (rhs
== NULL
|| dst
== NULL
)
3681 switch (rhs
->type
.node_class
)
3684 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3685 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3688 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3689 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3692 case etree_provided
:
3694 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3696 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3699 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3703 return strcmp (dst
, rhs
->value
.str
) == 0;
3708 return strcmp (dst
, rhs
->name
.name
) == 0;
3720 print_assignment (lang_assignment_statement_type
*assignment
,
3721 lang_output_section_statement_type
*output_section
)
3725 bfd_boolean computation_is_valid
= TRUE
;
3728 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3731 if (assignment
->exp
->type
.node_class
== etree_assert
)
3734 tree
= assignment
->exp
->assert_s
.child
;
3735 computation_is_valid
= TRUE
;
3739 const char *dst
= assignment
->exp
->assign
.dst
;
3741 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3742 tree
= assignment
->exp
->assign
.src
;
3743 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3746 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3747 if (expld
.result
.valid_p
)
3751 if (computation_is_valid
)
3753 value
= expld
.result
.value
;
3755 if (expld
.result
.section
)
3756 value
+= expld
.result
.section
->vma
;
3758 minfo ("0x%V", value
);
3764 struct bfd_link_hash_entry
*h
;
3766 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3767 FALSE
, FALSE
, TRUE
);
3770 value
= h
->u
.def
.value
;
3772 if (expld
.result
.section
)
3773 value
+= expld
.result
.section
->vma
;
3775 minfo ("[0x%V]", value
);
3778 minfo ("[unresolved]");
3790 exp_print_tree (assignment
->exp
);
3795 print_input_statement (lang_input_statement_type
*statm
)
3797 if (statm
->filename
!= NULL
3798 && (statm
->the_bfd
== NULL
3799 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
3800 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3803 /* Print all symbols defined in a particular section. This is called
3804 via bfd_link_hash_traverse, or by print_all_symbols. */
3807 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3809 asection
*sec
= ptr
;
3811 if ((hash_entry
->type
== bfd_link_hash_defined
3812 || hash_entry
->type
== bfd_link_hash_defweak
)
3813 && sec
== hash_entry
->u
.def
.section
)
3817 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3820 (hash_entry
->u
.def
.value
3821 + hash_entry
->u
.def
.section
->output_offset
3822 + hash_entry
->u
.def
.section
->output_section
->vma
));
3824 minfo (" %T\n", hash_entry
->root
.string
);
3831 print_all_symbols (asection
*sec
)
3833 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3834 struct map_symbol_def
*def
;
3839 *ud
->map_symbol_def_tail
= 0;
3840 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3841 print_one_symbol (def
->entry
, sec
);
3844 /* Print information about an input section to the map file. */
3847 print_input_section (asection
*i
)
3849 bfd_size_type size
= i
->size
;
3856 minfo ("%s", i
->name
);
3858 len
= 1 + strlen (i
->name
);
3859 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3864 while (len
< SECTION_NAME_MAP_LENGTH
)
3870 if (i
->output_section
!= NULL
3871 && i
->output_section
->owner
== link_info
.output_bfd
)
3872 addr
= i
->output_section
->vma
+ i
->output_offset
;
3879 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3881 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3883 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3895 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3898 if (i
->output_section
!= NULL
3899 && i
->output_section
->owner
== link_info
.output_bfd
)
3901 if (link_info
.reduce_memory_overheads
)
3902 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3904 print_all_symbols (i
);
3906 /* Update print_dot, but make sure that we do not move it
3907 backwards - this could happen if we have overlays and a
3908 later overlay is shorter than an earier one. */
3909 if (addr
+ TO_ADDR (size
) > print_dot
)
3910 print_dot
= addr
+ TO_ADDR (size
);
3915 print_fill_statement (lang_fill_statement_type
*fill
)
3919 fputs (" FILL mask 0x", config
.map_file
);
3920 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3921 fprintf (config
.map_file
, "%02x", *p
);
3922 fputs ("\n", config
.map_file
);
3926 print_data_statement (lang_data_statement_type
*data
)
3934 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3937 addr
= data
->output_offset
;
3938 if (data
->output_section
!= NULL
)
3939 addr
+= data
->output_section
->vma
;
3967 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3969 if (data
->exp
->type
.node_class
!= etree_value
)
3972 exp_print_tree (data
->exp
);
3977 print_dot
= addr
+ TO_ADDR (size
);
3980 /* Print an address statement. These are generated by options like
3984 print_address_statement (lang_address_statement_type
*address
)
3986 minfo (_("Address of section %s set to "), address
->section_name
);
3987 exp_print_tree (address
->address
);
3991 /* Print a reloc statement. */
3994 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4001 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4004 addr
= reloc
->output_offset
;
4005 if (reloc
->output_section
!= NULL
)
4006 addr
+= reloc
->output_section
->vma
;
4008 size
= bfd_get_reloc_size (reloc
->howto
);
4010 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4012 if (reloc
->name
!= NULL
)
4013 minfo ("%s+", reloc
->name
);
4015 minfo ("%s+", reloc
->section
->name
);
4017 exp_print_tree (reloc
->addend_exp
);
4021 print_dot
= addr
+ TO_ADDR (size
);
4025 print_padding_statement (lang_padding_statement_type
*s
)
4033 len
= sizeof " *fill*" - 1;
4034 while (len
< SECTION_NAME_MAP_LENGTH
)
4040 addr
= s
->output_offset
;
4041 if (s
->output_section
!= NULL
)
4042 addr
+= s
->output_section
->vma
;
4043 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4045 if (s
->fill
->size
!= 0)
4049 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4050 fprintf (config
.map_file
, "%02x", *p
);
4055 print_dot
= addr
+ TO_ADDR (s
->size
);
4059 print_wild_statement (lang_wild_statement_type
*w
,
4060 lang_output_section_statement_type
*os
)
4062 struct wildcard_list
*sec
;
4066 if (w
->filenames_sorted
)
4068 if (w
->filename
!= NULL
)
4069 minfo ("%s", w
->filename
);
4072 if (w
->filenames_sorted
)
4076 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4078 if (sec
->spec
.sorted
)
4080 if (sec
->spec
.exclude_name_list
!= NULL
)
4083 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4084 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4085 minfo (" %s", tmp
->name
);
4088 if (sec
->spec
.name
!= NULL
)
4089 minfo ("%s", sec
->spec
.name
);
4092 if (sec
->spec
.sorted
)
4101 print_statement_list (w
->children
.head
, os
);
4104 /* Print a group statement. */
4107 print_group (lang_group_statement_type
*s
,
4108 lang_output_section_statement_type
*os
)
4110 fprintf (config
.map_file
, "START GROUP\n");
4111 print_statement_list (s
->children
.head
, os
);
4112 fprintf (config
.map_file
, "END GROUP\n");
4115 /* Print the list of statements in S.
4116 This can be called for any statement type. */
4119 print_statement_list (lang_statement_union_type
*s
,
4120 lang_output_section_statement_type
*os
)
4124 print_statement (s
, os
);
4129 /* Print the first statement in statement list S.
4130 This can be called for any statement type. */
4133 print_statement (lang_statement_union_type
*s
,
4134 lang_output_section_statement_type
*os
)
4136 switch (s
->header
.type
)
4139 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4142 case lang_constructors_statement_enum
:
4143 if (constructor_list
.head
!= NULL
)
4145 if (constructors_sorted
)
4146 minfo (" SORT (CONSTRUCTORS)\n");
4148 minfo (" CONSTRUCTORS\n");
4149 print_statement_list (constructor_list
.head
, os
);
4152 case lang_wild_statement_enum
:
4153 print_wild_statement (&s
->wild_statement
, os
);
4155 case lang_address_statement_enum
:
4156 print_address_statement (&s
->address_statement
);
4158 case lang_object_symbols_statement_enum
:
4159 minfo (" CREATE_OBJECT_SYMBOLS\n");
4161 case lang_fill_statement_enum
:
4162 print_fill_statement (&s
->fill_statement
);
4164 case lang_data_statement_enum
:
4165 print_data_statement (&s
->data_statement
);
4167 case lang_reloc_statement_enum
:
4168 print_reloc_statement (&s
->reloc_statement
);
4170 case lang_input_section_enum
:
4171 print_input_section (s
->input_section
.section
);
4173 case lang_padding_statement_enum
:
4174 print_padding_statement (&s
->padding_statement
);
4176 case lang_output_section_statement_enum
:
4177 print_output_section_statement (&s
->output_section_statement
);
4179 case lang_assignment_statement_enum
:
4180 print_assignment (&s
->assignment_statement
, os
);
4182 case lang_target_statement_enum
:
4183 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4185 case lang_output_statement_enum
:
4186 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4187 if (output_target
!= NULL
)
4188 minfo (" %s", output_target
);
4191 case lang_input_statement_enum
:
4192 print_input_statement (&s
->input_statement
);
4194 case lang_group_statement_enum
:
4195 print_group (&s
->group_statement
, os
);
4197 case lang_insert_statement_enum
:
4198 minfo ("INSERT %s %s\n",
4199 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4200 s
->insert_statement
.where
);
4206 print_statements (void)
4208 print_statement_list (statement_list
.head
, abs_output_section
);
4211 /* Print the first N statements in statement list S to STDERR.
4212 If N == 0, nothing is printed.
4213 If N < 0, the entire list is printed.
4214 Intended to be called from GDB. */
4217 dprint_statement (lang_statement_union_type
*s
, int n
)
4219 FILE *map_save
= config
.map_file
;
4221 config
.map_file
= stderr
;
4224 print_statement_list (s
, abs_output_section
);
4227 while (s
&& --n
>= 0)
4229 print_statement (s
, abs_output_section
);
4234 config
.map_file
= map_save
;
4238 insert_pad (lang_statement_union_type
**ptr
,
4240 unsigned int alignment_needed
,
4241 asection
*output_section
,
4244 static fill_type zero_fill
= { 1, { 0 } };
4245 lang_statement_union_type
*pad
= NULL
;
4247 if (ptr
!= &statement_list
.head
)
4248 pad
= ((lang_statement_union_type
*)
4249 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4251 && pad
->header
.type
== lang_padding_statement_enum
4252 && pad
->padding_statement
.output_section
== output_section
)
4254 /* Use the existing pad statement. */
4256 else if ((pad
= *ptr
) != NULL
4257 && pad
->header
.type
== lang_padding_statement_enum
4258 && pad
->padding_statement
.output_section
== output_section
)
4260 /* Use the existing pad statement. */
4264 /* Make a new padding statement, linked into existing chain. */
4265 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
4266 pad
->header
.next
= *ptr
;
4268 pad
->header
.type
= lang_padding_statement_enum
;
4269 pad
->padding_statement
.output_section
= output_section
;
4272 pad
->padding_statement
.fill
= fill
;
4274 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4275 pad
->padding_statement
.size
= alignment_needed
;
4276 output_section
->size
+= alignment_needed
;
4279 /* Work out how much this section will move the dot point. */
4283 (lang_statement_union_type
**this_ptr
,
4284 lang_output_section_statement_type
*output_section_statement
,
4288 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4289 asection
*i
= is
->section
;
4291 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4292 && (i
->flags
& SEC_EXCLUDE
) == 0)
4294 unsigned int alignment_needed
;
4297 /* Align this section first to the input sections requirement,
4298 then to the output section's requirement. If this alignment
4299 is greater than any seen before, then record it too. Perform
4300 the alignment by inserting a magic 'padding' statement. */
4302 if (output_section_statement
->subsection_alignment
!= -1)
4303 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4305 o
= output_section_statement
->bfd_section
;
4306 if (o
->alignment_power
< i
->alignment_power
)
4307 o
->alignment_power
= i
->alignment_power
;
4309 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4311 if (alignment_needed
!= 0)
4313 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4314 dot
+= alignment_needed
;
4317 /* Remember where in the output section this input section goes. */
4319 i
->output_offset
= dot
- o
->vma
;
4321 /* Mark how big the output section must be to contain this now. */
4322 dot
+= TO_ADDR (i
->size
);
4323 o
->size
= TO_SIZE (dot
- o
->vma
);
4327 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4334 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4336 const asection
*sec1
= *(const asection
**) arg1
;
4337 const asection
*sec2
= *(const asection
**) arg2
;
4339 if (bfd_section_lma (sec1
->owner
, sec1
)
4340 < bfd_section_lma (sec2
->owner
, sec2
))
4342 else if (bfd_section_lma (sec1
->owner
, sec1
)
4343 > bfd_section_lma (sec2
->owner
, sec2
))
4345 else if (sec1
->id
< sec2
->id
)
4347 else if (sec1
->id
> sec2
->id
)
4353 #define IGNORE_SECTION(s) \
4354 ((s->flags & SEC_NEVER_LOAD) != 0 \
4355 || (s->flags & SEC_ALLOC) == 0 \
4356 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4357 && (s->flags & SEC_LOAD) == 0))
4359 /* Check to see if any allocated sections overlap with other allocated
4360 sections. This can happen if a linker script specifies the output
4361 section addresses of the two sections. Also check whether any memory
4362 region has overflowed. */
4365 lang_check_section_addresses (void)
4368 asection
**sections
, **spp
;
4375 lang_memory_region_type
*m
;
4377 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4380 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4381 sections
= xmalloc (amt
);
4383 /* Scan all sections in the output list. */
4385 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4387 /* Only consider loadable sections with real contents. */
4388 if (IGNORE_SECTION (s
) || s
->size
== 0)
4391 sections
[count
] = s
;
4398 qsort (sections
, (size_t) count
, sizeof (asection
*),
4399 sort_sections_by_lma
);
4403 s_start
= bfd_section_lma (link_info
.output_bfd
, s
);
4404 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4405 for (count
--; count
; count
--)
4407 /* We must check the sections' LMA addresses not their VMA
4408 addresses because overlay sections can have overlapping VMAs
4409 but they must have distinct LMAs. */
4414 s_start
= bfd_section_lma (link_info
.output_bfd
, s
);
4415 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4417 /* Look for an overlap. */
4418 if (s_end
>= os_start
&& s_start
<= os_end
)
4419 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4420 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4425 /* If any memory region has overflowed, report by how much.
4426 We do not issue this diagnostic for regions that had sections
4427 explicitly placed outside their bounds; os_region_check's
4428 diagnostics are adequate for that case.
4430 FIXME: It is conceivable that m->current - (m->origin + m->length)
4431 might overflow a 32-bit integer. There is, alas, no way to print
4432 a bfd_vma quantity in decimal. */
4433 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4434 if (m
->had_full_message
)
4435 einfo (_("%X%P: region %s overflowed by %ld bytes\n"),
4436 m
->name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4440 /* Make sure the new address is within the region. We explicitly permit the
4441 current address to be at the exact end of the region when the address is
4442 non-zero, in case the region is at the end of addressable memory and the
4443 calculation wraps around. */
4446 os_region_check (lang_output_section_statement_type
*os
,
4447 lang_memory_region_type
*region
,
4451 if ((region
->current
< region
->origin
4452 || (region
->current
- region
->origin
> region
->length
))
4453 && ((region
->current
!= region
->origin
+ region
->length
)
4458 einfo (_("%X%P: address 0x%v of %B section %s"
4459 " is not within region %s\n"),
4461 os
->bfd_section
->owner
,
4462 os
->bfd_section
->name
,
4465 else if (!region
->had_full_message
)
4467 region
->had_full_message
= TRUE
;
4469 einfo (_("%X%P: %B section %s will not fit in region %s\n"),
4470 os
->bfd_section
->owner
,
4471 os
->bfd_section
->name
,
4477 /* Set the sizes for all the output sections. */
4480 lang_size_sections_1
4481 (lang_statement_union_type
*s
,
4482 lang_output_section_statement_type
*output_section_statement
,
4483 lang_statement_union_type
**prev
,
4487 bfd_boolean check_regions
)
4489 /* Size up the sections from their constituent parts. */
4490 for (; s
!= NULL
; s
= s
->header
.next
)
4492 switch (s
->header
.type
)
4494 case lang_output_section_statement_enum
:
4496 bfd_vma newdot
, after
;
4497 lang_output_section_statement_type
*os
;
4498 lang_memory_region_type
*r
;
4500 os
= &s
->output_section_statement
;
4501 if (os
->addr_tree
!= NULL
)
4503 os
->processed_vma
= FALSE
;
4504 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4506 if (expld
.result
.valid_p
)
4507 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4508 else if (expld
.phase
!= lang_mark_phase_enum
)
4509 einfo (_("%F%S: non constant or forward reference"
4510 " address expression for section %s\n"),
4514 if (os
->bfd_section
== NULL
)
4515 /* This section was removed or never actually created. */
4518 /* If this is a COFF shared library section, use the size and
4519 address from the input section. FIXME: This is COFF
4520 specific; it would be cleaner if there were some other way
4521 to do this, but nothing simple comes to mind. */
4522 if (((bfd_get_flavour (link_info
.output_bfd
)
4523 == bfd_target_ecoff_flavour
)
4524 || (bfd_get_flavour (link_info
.output_bfd
)
4525 == bfd_target_coff_flavour
))
4526 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4530 if (os
->children
.head
== NULL
4531 || os
->children
.head
->header
.next
!= NULL
4532 || (os
->children
.head
->header
.type
4533 != lang_input_section_enum
))
4534 einfo (_("%P%X: Internal error on COFF shared library"
4535 " section %s\n"), os
->name
);
4537 input
= os
->children
.head
->input_section
.section
;
4538 bfd_set_section_vma (os
->bfd_section
->owner
,
4540 bfd_section_vma (input
->owner
, input
));
4541 os
->bfd_section
->size
= input
->size
;
4546 if (bfd_is_abs_section (os
->bfd_section
))
4548 /* No matter what happens, an abs section starts at zero. */
4549 ASSERT (os
->bfd_section
->vma
== 0);
4555 if (os
->addr_tree
== NULL
)
4557 /* No address specified for this section, get one
4558 from the region specification. */
4559 if (os
->region
== NULL
4560 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4561 && os
->region
->name
[0] == '*'
4562 && strcmp (os
->region
->name
,
4563 DEFAULT_MEMORY_REGION
) == 0))
4565 os
->region
= lang_memory_default (os
->bfd_section
);
4568 /* If a loadable section is using the default memory
4569 region, and some non default memory regions were
4570 defined, issue an error message. */
4572 && !IGNORE_SECTION (os
->bfd_section
)
4573 && ! link_info
.relocatable
4575 && strcmp (os
->region
->name
,
4576 DEFAULT_MEMORY_REGION
) == 0
4577 && lang_memory_region_list
!= NULL
4578 && (strcmp (lang_memory_region_list
->name
,
4579 DEFAULT_MEMORY_REGION
) != 0
4580 || lang_memory_region_list
->next
!= NULL
)
4581 && expld
.phase
!= lang_mark_phase_enum
)
4583 /* By default this is an error rather than just a
4584 warning because if we allocate the section to the
4585 default memory region we can end up creating an
4586 excessively large binary, or even seg faulting when
4587 attempting to perform a negative seek. See
4588 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4589 for an example of this. This behaviour can be
4590 overridden by the using the --no-check-sections
4592 if (command_line
.check_section_addresses
)
4593 einfo (_("%P%F: error: no memory region specified"
4594 " for loadable section `%s'\n"),
4595 bfd_get_section_name (link_info
.output_bfd
,
4598 einfo (_("%P: warning: no memory region specified"
4599 " for loadable section `%s'\n"),
4600 bfd_get_section_name (link_info
.output_bfd
,
4604 newdot
= os
->region
->current
;
4605 align
= os
->bfd_section
->alignment_power
;
4608 align
= os
->section_alignment
;
4610 /* Align to what the section needs. */
4613 bfd_vma savedot
= newdot
;
4614 newdot
= align_power (newdot
, align
);
4616 if (newdot
!= savedot
4617 && (config
.warn_section_align
4618 || os
->addr_tree
!= NULL
)
4619 && expld
.phase
!= lang_mark_phase_enum
)
4620 einfo (_("%P: warning: changing start of section"
4621 " %s by %lu bytes\n"),
4622 os
->name
, (unsigned long) (newdot
- savedot
));
4625 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4627 os
->bfd_section
->output_offset
= 0;
4630 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4631 os
->fill
, newdot
, relax
, check_regions
);
4633 os
->processed_vma
= TRUE
;
4635 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4636 /* Except for some special linker created sections,
4637 no output section should change from zero size
4638 after strip_excluded_output_sections. A non-zero
4639 size on an ignored section indicates that some
4640 input section was not sized early enough. */
4641 ASSERT (os
->bfd_section
->size
== 0);
4644 dot
= os
->bfd_section
->vma
;
4646 /* Put the section within the requested block size, or
4647 align at the block boundary. */
4649 + TO_ADDR (os
->bfd_section
->size
)
4650 + os
->block_value
- 1)
4651 & - (bfd_vma
) os
->block_value
);
4653 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4656 /* Set section lma. */
4659 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4663 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4664 os
->bfd_section
->lma
= lma
;
4666 else if (os
->lma_region
!= NULL
)
4668 bfd_vma lma
= os
->lma_region
->current
;
4670 if (os
->section_alignment
!= -1)
4671 lma
= align_power (lma
, os
->section_alignment
);
4672 os
->bfd_section
->lma
= lma
;
4674 else if (r
->last_os
!= NULL
4675 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4680 last
= r
->last_os
->output_section_statement
.bfd_section
;
4682 /* A backwards move of dot should be accompanied by
4683 an explicit assignment to the section LMA (ie.
4684 os->load_base set) because backwards moves can
4685 create overlapping LMAs. */
4687 && os
->bfd_section
->size
!= 0
4688 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4690 /* If dot moved backwards then leave lma equal to
4691 vma. This is the old default lma, which might
4692 just happen to work when the backwards move is
4693 sufficiently large. Nag if this changes anything,
4694 so people can fix their linker scripts. */
4696 if (last
->vma
!= last
->lma
)
4697 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4702 /* If this is an overlay, set the current lma to that
4703 at the end of the previous section. */
4704 if (os
->sectype
== overlay_section
)
4705 lma
= last
->lma
+ last
->size
;
4707 /* Otherwise, keep the same lma to vma relationship
4708 as the previous section. */
4710 lma
= dot
+ last
->lma
- last
->vma
;
4712 if (os
->section_alignment
!= -1)
4713 lma
= align_power (lma
, os
->section_alignment
);
4714 os
->bfd_section
->lma
= lma
;
4717 os
->processed_lma
= TRUE
;
4719 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4722 /* Keep track of normal sections using the default
4723 lma region. We use this to set the lma for
4724 following sections. Overlays or other linker
4725 script assignment to lma might mean that the
4726 default lma == vma is incorrect.
4727 To avoid warnings about dot moving backwards when using
4728 -Ttext, don't start tracking sections until we find one
4729 of non-zero size or with lma set differently to vma. */
4730 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4731 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
4732 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
4733 && (os
->bfd_section
->size
!= 0
4734 || (r
->last_os
== NULL
4735 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
4736 || (r
->last_os
!= NULL
4737 && dot
>= (r
->last_os
->output_section_statement
4738 .bfd_section
->vma
)))
4739 && os
->lma_region
== NULL
4740 && !link_info
.relocatable
)
4743 /* .tbss sections effectively have zero size. */
4744 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4745 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4746 || link_info
.relocatable
)
4747 dot
+= TO_ADDR (os
->bfd_section
->size
);
4749 if (os
->update_dot_tree
!= 0)
4750 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4752 /* Update dot in the region ?
4753 We only do this if the section is going to be allocated,
4754 since unallocated sections do not contribute to the region's
4755 overall size in memory.
4757 If the SEC_NEVER_LOAD bit is not set, it will affect the
4758 addresses of sections after it. We have to update
4760 if (os
->region
!= NULL
4761 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4762 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4764 os
->region
->current
= dot
;
4767 /* Make sure the new address is within the region. */
4768 os_region_check (os
, os
->region
, os
->addr_tree
,
4769 os
->bfd_section
->vma
);
4771 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
4772 && (os
->bfd_section
->flags
& SEC_LOAD
))
4774 os
->lma_region
->current
4775 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
4778 os_region_check (os
, os
->lma_region
, NULL
,
4779 os
->bfd_section
->lma
);
4785 case lang_constructors_statement_enum
:
4786 dot
= lang_size_sections_1 (constructor_list
.head
,
4787 output_section_statement
,
4788 &s
->wild_statement
.children
.head
,
4789 fill
, dot
, relax
, check_regions
);
4792 case lang_data_statement_enum
:
4794 unsigned int size
= 0;
4796 s
->data_statement
.output_offset
=
4797 dot
- output_section_statement
->bfd_section
->vma
;
4798 s
->data_statement
.output_section
=
4799 output_section_statement
->bfd_section
;
4801 /* We might refer to provided symbols in the expression, and
4802 need to mark them as needed. */
4803 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4805 switch (s
->data_statement
.type
)
4823 if (size
< TO_SIZE ((unsigned) 1))
4824 size
= TO_SIZE ((unsigned) 1);
4825 dot
+= TO_ADDR (size
);
4826 output_section_statement
->bfd_section
->size
+= size
;
4830 case lang_reloc_statement_enum
:
4834 s
->reloc_statement
.output_offset
=
4835 dot
- output_section_statement
->bfd_section
->vma
;
4836 s
->reloc_statement
.output_section
=
4837 output_section_statement
->bfd_section
;
4838 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4839 dot
+= TO_ADDR (size
);
4840 output_section_statement
->bfd_section
->size
+= size
;
4844 case lang_wild_statement_enum
:
4845 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4846 output_section_statement
,
4847 &s
->wild_statement
.children
.head
,
4848 fill
, dot
, relax
, check_regions
);
4851 case lang_object_symbols_statement_enum
:
4852 link_info
.create_object_symbols_section
=
4853 output_section_statement
->bfd_section
;
4856 case lang_output_statement_enum
:
4857 case lang_target_statement_enum
:
4860 case lang_input_section_enum
:
4864 i
= (*prev
)->input_section
.section
;
4869 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4870 einfo (_("%P%F: can't relax section: %E\n"));
4874 dot
= size_input_section (prev
, output_section_statement
,
4875 output_section_statement
->fill
, dot
);
4879 case lang_input_statement_enum
:
4882 case lang_fill_statement_enum
:
4883 s
->fill_statement
.output_section
=
4884 output_section_statement
->bfd_section
;
4886 fill
= s
->fill_statement
.fill
;
4889 case lang_assignment_statement_enum
:
4891 bfd_vma newdot
= dot
;
4892 etree_type
*tree
= s
->assignment_statement
.exp
;
4894 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
4896 exp_fold_tree (tree
,
4897 output_section_statement
->bfd_section
,
4900 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
4902 if (!expld
.dataseg
.relro_start_stat
)
4903 expld
.dataseg
.relro_start_stat
= s
;
4906 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
4909 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
4911 if (!expld
.dataseg
.relro_end_stat
)
4912 expld
.dataseg
.relro_end_stat
= s
;
4915 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
4918 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
4920 /* This symbol is relative to this section. */
4921 if ((tree
->type
.node_class
== etree_provided
4922 || tree
->type
.node_class
== etree_assign
)
4923 && (tree
->assign
.dst
[0] != '.'
4924 || tree
->assign
.dst
[1] != '\0'))
4925 output_section_statement
->section_relative_symbol
= 1;
4927 if (!output_section_statement
->ignored
)
4929 if (output_section_statement
== abs_output_section
)
4931 /* If we don't have an output section, then just adjust
4932 the default memory address. */
4933 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4934 FALSE
)->current
= newdot
;
4936 else if (newdot
!= dot
)
4938 /* Insert a pad after this statement. We can't
4939 put the pad before when relaxing, in case the
4940 assignment references dot. */
4941 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4942 output_section_statement
->bfd_section
, dot
);
4944 /* Don't neuter the pad below when relaxing. */
4947 /* If dot is advanced, this implies that the section
4948 should have space allocated to it, unless the
4949 user has explicitly stated that the section
4950 should never be loaded. */
4951 if (!(output_section_statement
->flags
& SEC_NEVER_LOAD
))
4952 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4959 case lang_padding_statement_enum
:
4960 /* If this is the first time lang_size_sections is called,
4961 we won't have any padding statements. If this is the
4962 second or later passes when relaxing, we should allow
4963 padding to shrink. If padding is needed on this pass, it
4964 will be added back in. */
4965 s
->padding_statement
.size
= 0;
4967 /* Make sure output_offset is valid. If relaxation shrinks
4968 the section and this pad isn't needed, it's possible to
4969 have output_offset larger than the final size of the
4970 section. bfd_set_section_contents will complain even for
4971 a pad size of zero. */
4972 s
->padding_statement
.output_offset
4973 = dot
- output_section_statement
->bfd_section
->vma
;
4976 case lang_group_statement_enum
:
4977 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4978 output_section_statement
,
4979 &s
->group_statement
.children
.head
,
4980 fill
, dot
, relax
, check_regions
);
4983 case lang_insert_statement_enum
:
4986 /* We can only get here when relaxing is turned on. */
4987 case lang_address_statement_enum
:
4994 prev
= &s
->header
.next
;
4999 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5000 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5001 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5002 segments. We are allowed an opportunity to override this decision. */
5005 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5006 bfd
* abfd ATTRIBUTE_UNUSED
,
5007 asection
* current_section
,
5008 asection
* previous_section
,
5009 bfd_boolean new_segment
)
5011 lang_output_section_statement_type
* cur
;
5012 lang_output_section_statement_type
* prev
;
5014 /* The checks below are only necessary when the BFD library has decided
5015 that the two sections ought to be placed into the same segment. */
5019 /* Paranoia checks. */
5020 if (current_section
== NULL
|| previous_section
== NULL
)
5023 /* Find the memory regions associated with the two sections.
5024 We call lang_output_section_find() here rather than scanning the list
5025 of output sections looking for a matching section pointer because if
5026 we have a large number of sections then a hash lookup is faster. */
5027 cur
= lang_output_section_find (current_section
->name
);
5028 prev
= lang_output_section_find (previous_section
->name
);
5030 /* More paranoia. */
5031 if (cur
== NULL
|| prev
== NULL
)
5034 /* If the regions are different then force the sections to live in
5035 different segments. See the email thread starting at the following
5036 URL for the reasons why this is necessary:
5037 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5038 return cur
->region
!= prev
->region
;
5042 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5044 lang_statement_iteration
++;
5045 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
5046 &statement_list
.head
, 0, 0, relax
, check_regions
);
5050 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5052 expld
.phase
= lang_allocating_phase_enum
;
5053 expld
.dataseg
.phase
= exp_dataseg_none
;
5055 one_lang_size_sections_pass (relax
, check_regions
);
5056 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5057 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5059 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5060 to put expld.dataseg.relro on a (common) page boundary. */
5061 bfd_vma old_min_base
, relro_end
, maxpage
;
5063 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5064 old_min_base
= expld
.dataseg
.min_base
;
5065 maxpage
= expld
.dataseg
.maxpagesize
;
5066 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5067 & (expld
.dataseg
.pagesize
- 1));
5068 /* Compute the expected PT_GNU_RELRO segment end. */
5069 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5070 & ~(expld
.dataseg
.pagesize
- 1));
5071 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
5073 expld
.dataseg
.base
-= maxpage
;
5074 relro_end
-= maxpage
;
5076 lang_reset_memory_regions ();
5077 one_lang_size_sections_pass (relax
, check_regions
);
5078 if (expld
.dataseg
.relro_end
> relro_end
)
5080 /* The alignment of sections between DATA_SEGMENT_ALIGN
5081 and DATA_SEGMENT_RELRO_END caused huge padding to be
5082 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
5084 unsigned int max_alignment_power
= 0;
5086 /* Find maximum alignment power of sections between
5087 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5088 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5089 if (sec
->vma
>= expld
.dataseg
.base
5090 && sec
->vma
< expld
.dataseg
.relro_end
5091 && sec
->alignment_power
> max_alignment_power
)
5092 max_alignment_power
= sec
->alignment_power
;
5094 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5096 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
5098 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5099 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5100 lang_reset_memory_regions ();
5101 one_lang_size_sections_pass (relax
, check_regions
);
5104 link_info
.relro_start
= expld
.dataseg
.base
;
5105 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5107 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5109 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5110 a page could be saved in the data segment. */
5111 bfd_vma first
, last
;
5113 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5114 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5116 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5117 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5118 && first
+ last
<= expld
.dataseg
.pagesize
)
5120 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5121 lang_reset_memory_regions ();
5122 one_lang_size_sections_pass (relax
, check_regions
);
5126 expld
.phase
= lang_final_phase_enum
;
5129 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5132 lang_do_assignments_1 (lang_statement_union_type
*s
,
5133 lang_output_section_statement_type
*current_os
,
5137 for (; s
!= NULL
; s
= s
->header
.next
)
5139 switch (s
->header
.type
)
5141 case lang_constructors_statement_enum
:
5142 dot
= lang_do_assignments_1 (constructor_list
.head
,
5143 current_os
, fill
, dot
);
5146 case lang_output_section_statement_enum
:
5148 lang_output_section_statement_type
*os
;
5150 os
= &(s
->output_section_statement
);
5151 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5153 dot
= os
->bfd_section
->vma
;
5155 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5157 /* .tbss sections effectively have zero size. */
5158 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5159 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5160 || link_info
.relocatable
)
5161 dot
+= TO_ADDR (os
->bfd_section
->size
);
5163 if (os
->update_dot_tree
!= NULL
)
5164 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5169 case lang_wild_statement_enum
:
5171 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5172 current_os
, fill
, dot
);
5175 case lang_object_symbols_statement_enum
:
5176 case lang_output_statement_enum
:
5177 case lang_target_statement_enum
:
5180 case lang_data_statement_enum
:
5181 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5182 if (expld
.result
.valid_p
)
5183 s
->data_statement
.value
= (expld
.result
.value
5184 + expld
.result
.section
->vma
);
5186 einfo (_("%F%P: invalid data statement\n"));
5189 switch (s
->data_statement
.type
)
5207 if (size
< TO_SIZE ((unsigned) 1))
5208 size
= TO_SIZE ((unsigned) 1);
5209 dot
+= TO_ADDR (size
);
5213 case lang_reloc_statement_enum
:
5214 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5215 bfd_abs_section_ptr
, &dot
);
5216 if (expld
.result
.valid_p
)
5217 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5219 einfo (_("%F%P: invalid reloc statement\n"));
5220 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5223 case lang_input_section_enum
:
5225 asection
*in
= s
->input_section
.section
;
5227 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5228 dot
+= TO_ADDR (in
->size
);
5232 case lang_input_statement_enum
:
5235 case lang_fill_statement_enum
:
5236 fill
= s
->fill_statement
.fill
;
5239 case lang_assignment_statement_enum
:
5240 exp_fold_tree (s
->assignment_statement
.exp
,
5241 current_os
->bfd_section
,
5245 case lang_padding_statement_enum
:
5246 dot
+= TO_ADDR (s
->padding_statement
.size
);
5249 case lang_group_statement_enum
:
5250 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5251 current_os
, fill
, dot
);
5254 case lang_insert_statement_enum
:
5257 case lang_address_statement_enum
:
5269 lang_do_assignments (void)
5271 lang_statement_iteration
++;
5272 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5275 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5276 operator .startof. (section_name), it produces an undefined symbol
5277 .startof.section_name. Similarly, when it sees
5278 .sizeof. (section_name), it produces an undefined symbol
5279 .sizeof.section_name. For all the output sections, we look for
5280 such symbols, and set them to the correct value. */
5283 lang_set_startof (void)
5287 if (link_info
.relocatable
)
5290 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5292 const char *secname
;
5294 struct bfd_link_hash_entry
*h
;
5296 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5297 buf
= xmalloc (10 + strlen (secname
));
5299 sprintf (buf
, ".startof.%s", secname
);
5300 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5301 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5303 h
->type
= bfd_link_hash_defined
;
5304 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5305 h
->u
.def
.section
= bfd_abs_section_ptr
;
5308 sprintf (buf
, ".sizeof.%s", secname
);
5309 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5310 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5312 h
->type
= bfd_link_hash_defined
;
5313 h
->u
.def
.value
= TO_ADDR (s
->size
);
5314 h
->u
.def
.section
= bfd_abs_section_ptr
;
5324 struct bfd_link_hash_entry
*h
;
5327 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5328 || link_info
.shared
)
5329 warn
= entry_from_cmdline
;
5333 /* Force the user to specify a root when generating a relocatable with
5335 if (link_info
.gc_sections
&& link_info
.relocatable
5336 && (entry_symbol
.name
== NULL
5337 && ldlang_undef_chain_list_head
== NULL
))
5338 einfo (_("%P%F: gc-sections requires either an entry or "
5339 "an undefined symbol\n"));
5341 if (entry_symbol
.name
== NULL
)
5343 /* No entry has been specified. Look for the default entry, but
5344 don't warn if we don't find it. */
5345 entry_symbol
.name
= entry_symbol_default
;
5349 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5350 FALSE
, FALSE
, TRUE
);
5352 && (h
->type
== bfd_link_hash_defined
5353 || h
->type
== bfd_link_hash_defweak
)
5354 && h
->u
.def
.section
->output_section
!= NULL
)
5358 val
= (h
->u
.def
.value
5359 + bfd_get_section_vma (link_info
.output_bfd
,
5360 h
->u
.def
.section
->output_section
)
5361 + h
->u
.def
.section
->output_offset
);
5362 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5363 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5370 /* We couldn't find the entry symbol. Try parsing it as a
5372 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5375 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5376 einfo (_("%P%F: can't set start address\n"));
5382 /* Can't find the entry symbol, and it's not a number. Use
5383 the first address in the text section. */
5384 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5388 einfo (_("%P: warning: cannot find entry symbol %s;"
5389 " defaulting to %V\n"),
5391 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5392 if (!(bfd_set_start_address
5393 (link_info
.output_bfd
,
5394 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5395 einfo (_("%P%F: can't set start address\n"));
5400 einfo (_("%P: warning: cannot find entry symbol %s;"
5401 " not setting start address\n"),
5407 /* Don't bfd_hash_table_free (&lang_definedness_table);
5408 map file output may result in a call of lang_track_definedness. */
5411 /* This is a small function used when we want to ignore errors from
5415 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5417 /* Don't do anything. */
5420 /* Check that the architecture of all the input files is compatible
5421 with the output file. Also call the backend to let it do any
5422 other checking that is needed. */
5427 lang_statement_union_type
*file
;
5429 const bfd_arch_info_type
*compatible
;
5431 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5433 input_bfd
= file
->input_statement
.the_bfd
;
5435 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5436 command_line
.accept_unknown_input_arch
);
5438 /* In general it is not possible to perform a relocatable
5439 link between differing object formats when the input
5440 file has relocations, because the relocations in the
5441 input format may not have equivalent representations in
5442 the output format (and besides BFD does not translate
5443 relocs for other link purposes than a final link). */
5444 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5445 && (compatible
== NULL
5446 || (bfd_get_flavour (input_bfd
)
5447 != bfd_get_flavour (link_info
.output_bfd
)))
5448 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5450 einfo (_("%P%F: Relocatable linking with relocations from"
5451 " format %s (%B) to format %s (%B) is not supported\n"),
5452 bfd_get_target (input_bfd
), input_bfd
,
5453 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5454 /* einfo with %F exits. */
5457 if (compatible
== NULL
)
5459 if (command_line
.warn_mismatch
)
5460 einfo (_("%P%X: %s architecture of input file `%B'"
5461 " is incompatible with %s output\n"),
5462 bfd_printable_name (input_bfd
), input_bfd
,
5463 bfd_printable_name (link_info
.output_bfd
));
5465 else if (bfd_count_sections (input_bfd
))
5467 /* If the input bfd has no contents, it shouldn't set the
5468 private data of the output bfd. */
5470 bfd_error_handler_type pfn
= NULL
;
5472 /* If we aren't supposed to warn about mismatched input
5473 files, temporarily set the BFD error handler to a
5474 function which will do nothing. We still want to call
5475 bfd_merge_private_bfd_data, since it may set up
5476 information which is needed in the output file. */
5477 if (! command_line
.warn_mismatch
)
5478 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5479 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5481 if (command_line
.warn_mismatch
)
5482 einfo (_("%P%X: failed to merge target specific data"
5483 " of file %B\n"), input_bfd
);
5485 if (! command_line
.warn_mismatch
)
5486 bfd_set_error_handler (pfn
);
5491 /* Look through all the global common symbols and attach them to the
5492 correct section. The -sort-common command line switch may be used
5493 to roughly sort the entries by alignment. */
5498 if (command_line
.inhibit_common_definition
)
5500 if (link_info
.relocatable
5501 && ! command_line
.force_common_definition
)
5504 if (! config
.sort_common
)
5505 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5510 if (config
.sort_common
== sort_descending
)
5512 for (power
= 4; power
> 0; power
--)
5513 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5516 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5520 for (power
= 0; power
<= 4; power
++)
5521 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5524 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5529 /* Place one common symbol in the correct section. */
5532 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5534 unsigned int power_of_two
;
5538 if (h
->type
!= bfd_link_hash_common
)
5542 power_of_two
= h
->u
.c
.p
->alignment_power
;
5544 if (config
.sort_common
== sort_descending
5545 && power_of_two
< *(unsigned int *) info
)
5547 else if (config
.sort_common
== sort_ascending
5548 && power_of_two
> *(unsigned int *) info
)
5551 section
= h
->u
.c
.p
->section
;
5553 /* Increase the size of the section to align the common sym. */
5554 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
5555 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
5557 /* Adjust the alignment if necessary. */
5558 if (power_of_two
> section
->alignment_power
)
5559 section
->alignment_power
= power_of_two
;
5561 /* Change the symbol from common to defined. */
5562 h
->type
= bfd_link_hash_defined
;
5563 h
->u
.def
.section
= section
;
5564 h
->u
.def
.value
= section
->size
;
5566 /* Increase the size of the section. */
5567 section
->size
+= size
;
5569 /* Make sure the section is allocated in memory, and make sure that
5570 it is no longer a common section. */
5571 section
->flags
|= SEC_ALLOC
;
5572 section
->flags
&= ~SEC_IS_COMMON
;
5574 if (config
.map_file
!= NULL
)
5576 static bfd_boolean header_printed
;
5581 if (! header_printed
)
5583 minfo (_("\nAllocating common symbols\n"));
5584 minfo (_("Common symbol size file\n\n"));
5585 header_printed
= TRUE
;
5588 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5589 DMGL_ANSI
| DMGL_PARAMS
);
5592 minfo ("%s", h
->root
.string
);
5593 len
= strlen (h
->root
.string
);
5598 len
= strlen (name
);
5614 if (size
<= 0xffffffff)
5615 sprintf (buf
, "%lx", (unsigned long) size
);
5617 sprintf_vma (buf
, size
);
5627 minfo ("%B\n", section
->owner
);
5633 /* Run through the input files and ensure that every input section has
5634 somewhere to go. If one is found without a destination then create
5635 an input request and place it into the statement tree. */
5638 lang_place_orphans (void)
5640 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5644 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5646 if (s
->output_section
== NULL
)
5648 /* This section of the file is not attached, root
5649 around for a sensible place for it to go. */
5651 if (file
->just_syms_flag
)
5652 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5653 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5654 s
->output_section
= bfd_abs_section_ptr
;
5655 else if (strcmp (s
->name
, "COMMON") == 0)
5657 /* This is a lonely common section which must have
5658 come from an archive. We attach to the section
5659 with the wildcard. */
5660 if (! link_info
.relocatable
5661 || command_line
.force_common_definition
)
5663 if (default_common_section
== NULL
)
5665 default_common_section
=
5666 lang_output_section_statement_lookup (".bss");
5669 lang_add_section (&default_common_section
->children
, s
,
5670 default_common_section
);
5673 else if (ldemul_place_orphan (s
))
5677 lang_output_section_statement_type
*os
;
5679 os
= lang_output_section_statement_lookup (s
->name
);
5680 lang_add_section (&os
->children
, s
, os
);
5688 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5690 flagword
*ptr_flags
;
5692 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5698 *ptr_flags
|= SEC_ALLOC
;
5702 *ptr_flags
|= SEC_READONLY
;
5706 *ptr_flags
|= SEC_DATA
;
5710 *ptr_flags
|= SEC_CODE
;
5715 *ptr_flags
|= SEC_LOAD
;
5719 einfo (_("%P%F: invalid syntax in flags\n"));
5726 /* Call a function on each input file. This function will be called
5727 on an archive, but not on the elements. */
5730 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5732 lang_input_statement_type
*f
;
5734 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5736 f
= (lang_input_statement_type
*) f
->next_real_file
)
5740 /* Call a function on each file. The function will be called on all
5741 the elements of an archive which are included in the link, but will
5742 not be called on the archive file itself. */
5745 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5747 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5754 ldlang_add_file (lang_input_statement_type
*entry
)
5756 lang_statement_append (&file_chain
,
5757 (lang_statement_union_type
*) entry
,
5760 /* The BFD linker needs to have a list of all input BFDs involved in
5762 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5763 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
5765 *link_info
.input_bfds_tail
= entry
->the_bfd
;
5766 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
5767 entry
->the_bfd
->usrdata
= entry
;
5768 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5770 /* Look through the sections and check for any which should not be
5771 included in the link. We need to do this now, so that we can
5772 notice when the backend linker tries to report multiple
5773 definition errors for symbols which are in sections we aren't
5774 going to link. FIXME: It might be better to entirely ignore
5775 symbols which are defined in sections which are going to be
5776 discarded. This would require modifying the backend linker for
5777 each backend which might set the SEC_LINK_ONCE flag. If we do
5778 this, we should probably handle SEC_EXCLUDE in the same way. */
5780 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5784 lang_add_output (const char *name
, int from_script
)
5786 /* Make -o on command line override OUTPUT in script. */
5787 if (!had_output_filename
|| !from_script
)
5789 output_filename
= name
;
5790 had_output_filename
= TRUE
;
5794 static lang_output_section_statement_type
*current_section
;
5805 for (l
= 0; l
< 32; l
++)
5807 if (i
>= (unsigned int) x
)
5815 lang_output_section_statement_type
*
5816 lang_enter_output_section_statement (const char *output_section_statement_name
,
5817 etree_type
*address_exp
,
5818 enum section_type sectype
,
5820 etree_type
*subalign
,
5824 lang_output_section_statement_type
*os
;
5826 os
= lang_output_section_statement_lookup_1 (output_section_statement_name
,
5828 current_section
= os
;
5830 /* Make next things chain into subchain of this. */
5832 if (os
->addr_tree
== NULL
)
5834 os
->addr_tree
= address_exp
;
5836 os
->sectype
= sectype
;
5837 if (sectype
!= noload_section
)
5838 os
->flags
= SEC_NO_FLAGS
;
5840 os
->flags
= SEC_NEVER_LOAD
;
5841 os
->block_value
= 1;
5842 stat_ptr
= &os
->children
;
5844 os
->subsection_alignment
=
5845 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5846 os
->section_alignment
=
5847 topower (exp_get_value_int (align
, -1, "section alignment"));
5849 os
->load_base
= ebase
;
5856 lang_output_statement_type
*new;
5858 new = new_stat (lang_output_statement
, stat_ptr
);
5859 new->name
= output_filename
;
5862 /* Reset the current counters in the regions. */
5865 lang_reset_memory_regions (void)
5867 lang_memory_region_type
*p
= lang_memory_region_list
;
5869 lang_output_section_statement_type
*os
;
5871 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5873 p
->current
= p
->origin
;
5877 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5881 os
->processed_vma
= FALSE
;
5882 os
->processed_lma
= FALSE
;
5885 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5887 /* Save the last size for possible use by bfd_relax_section. */
5888 o
->rawsize
= o
->size
;
5893 /* Worker for lang_gc_sections_1. */
5896 gc_section_callback (lang_wild_statement_type
*ptr
,
5897 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5899 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5900 void *data ATTRIBUTE_UNUSED
)
5902 /* If the wild pattern was marked KEEP, the member sections
5903 should be as well. */
5904 if (ptr
->keep_sections
)
5905 section
->flags
|= SEC_KEEP
;
5908 /* Iterate over sections marking them against GC. */
5911 lang_gc_sections_1 (lang_statement_union_type
*s
)
5913 for (; s
!= NULL
; s
= s
->header
.next
)
5915 switch (s
->header
.type
)
5917 case lang_wild_statement_enum
:
5918 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5920 case lang_constructors_statement_enum
:
5921 lang_gc_sections_1 (constructor_list
.head
);
5923 case lang_output_section_statement_enum
:
5924 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5926 case lang_group_statement_enum
:
5927 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5936 lang_gc_sections (void)
5938 /* Keep all sections so marked in the link script. */
5940 lang_gc_sections_1 (statement_list
.head
);
5942 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5943 the special case of debug info. (See bfd/stabs.c)
5944 Twiddle the flag here, to simplify later linker code. */
5945 if (link_info
.relocatable
)
5947 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5950 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5951 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5952 sec
->flags
&= ~SEC_EXCLUDE
;
5956 if (link_info
.gc_sections
)
5957 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
5960 /* Worker for lang_find_relro_sections_1. */
5963 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
5964 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5966 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5969 /* Discarded, excluded and ignored sections effectively have zero
5971 if (section
->output_section
!= NULL
5972 && section
->output_section
->owner
== link_info
.output_bfd
5973 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
5974 && !IGNORE_SECTION (section
)
5975 && section
->size
!= 0)
5977 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
5978 *has_relro_section
= TRUE
;
5982 /* Iterate over sections for relro sections. */
5985 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
5986 bfd_boolean
*has_relro_section
)
5988 if (*has_relro_section
)
5991 for (; s
!= NULL
; s
= s
->header
.next
)
5993 if (s
== expld
.dataseg
.relro_end_stat
)
5996 switch (s
->header
.type
)
5998 case lang_wild_statement_enum
:
5999 walk_wild (&s
->wild_statement
,
6000 find_relro_section_callback
,
6003 case lang_constructors_statement_enum
:
6004 lang_find_relro_sections_1 (constructor_list
.head
,
6007 case lang_output_section_statement_enum
:
6008 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6011 case lang_group_statement_enum
:
6012 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6022 lang_find_relro_sections (void)
6024 bfd_boolean has_relro_section
= FALSE
;
6026 /* Check all sections in the link script. */
6028 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6029 &has_relro_section
);
6031 if (!has_relro_section
)
6032 link_info
.relro
= FALSE
;
6035 /* Relax all sections until bfd_relax_section gives up. */
6038 relax_sections (void)
6040 /* Keep relaxing until bfd_relax_section gives up. */
6041 bfd_boolean relax_again
;
6043 link_info
.relax_trip
= -1;
6046 relax_again
= FALSE
;
6047 link_info
.relax_trip
++;
6049 /* Note: pe-dll.c does something like this also. If you find
6050 you need to change this code, you probably need to change
6051 pe-dll.c also. DJ */
6053 /* Do all the assignments with our current guesses as to
6055 lang_do_assignments ();
6057 /* We must do this after lang_do_assignments, because it uses
6059 lang_reset_memory_regions ();
6061 /* Perform another relax pass - this time we know where the
6062 globals are, so can make a better guess. */
6063 lang_size_sections (&relax_again
, FALSE
);
6065 while (relax_again
);
6071 /* Finalize dynamic list. */
6072 if (link_info
.dynamic_list
)
6073 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6075 current_target
= default_target
;
6077 /* Open the output file. */
6078 lang_for_each_statement (ldlang_open_output
);
6081 ldemul_create_output_section_statements ();
6083 /* Add to the hash table all undefineds on the command line. */
6084 lang_place_undefineds ();
6086 if (!bfd_section_already_linked_table_init ())
6087 einfo (_("%P%F: Failed to create hash table\n"));
6089 /* Create a bfd for each input file. */
6090 current_target
= default_target
;
6091 open_input_bfds (statement_list
.head
, FALSE
);
6093 link_info
.gc_sym_list
= &entry_symbol
;
6094 if (entry_symbol
.name
== NULL
)
6095 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6097 ldemul_after_open ();
6099 bfd_section_already_linked_table_free ();
6101 /* Make sure that we're not mixing architectures. We call this
6102 after all the input files have been opened, but before we do any
6103 other processing, so that any operations merge_private_bfd_data
6104 does on the output file will be known during the rest of the
6108 /* Handle .exports instead of a version script if we're told to do so. */
6109 if (command_line
.version_exports_section
)
6110 lang_do_version_exports_section ();
6112 /* Build all sets based on the information gathered from the input
6114 ldctor_build_sets ();
6116 /* Remove unreferenced sections if asked to. */
6117 lang_gc_sections ();
6119 /* Size up the common data. */
6122 /* Update wild statements. */
6123 update_wild_statements (statement_list
.head
);
6125 /* Run through the contours of the script and attach input sections
6126 to the correct output sections. */
6127 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6129 process_insert_statements ();
6131 /* Find any sections not attached explicitly and handle them. */
6132 lang_place_orphans ();
6134 if (! link_info
.relocatable
)
6138 /* Merge SEC_MERGE sections. This has to be done after GC of
6139 sections, so that GCed sections are not merged, but before
6140 assigning dynamic symbols, since removing whole input sections
6142 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6144 /* Look for a text section and set the readonly attribute in it. */
6145 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6149 if (config
.text_read_only
)
6150 found
->flags
|= SEC_READONLY
;
6152 found
->flags
&= ~SEC_READONLY
;
6156 /* Do anything special before sizing sections. This is where ELF
6157 and other back-ends size dynamic sections. */
6158 ldemul_before_allocation ();
6160 /* We must record the program headers before we try to fix the
6161 section positions, since they will affect SIZEOF_HEADERS. */
6162 lang_record_phdrs ();
6164 /* Check relro sections. */
6165 if (link_info
.relro
&& ! link_info
.relocatable
)
6166 lang_find_relro_sections ();
6168 /* Size up the sections. */
6169 lang_size_sections (NULL
, !command_line
.relax
);
6171 /* Now run around and relax if we can. */
6172 if (command_line
.relax
)
6174 /* We may need more than one relaxation pass. */
6175 int i
= link_info
.relax_pass
;
6177 /* The backend can use it to determine the current pass. */
6178 link_info
.relax_pass
= 0;
6183 link_info
.relax_pass
++;
6186 /* Final extra sizing to report errors. */
6187 lang_do_assignments ();
6188 lang_reset_memory_regions ();
6189 lang_size_sections (NULL
, TRUE
);
6192 /* See if anything special should be done now we know how big
6194 ldemul_after_allocation ();
6196 /* Fix any .startof. or .sizeof. symbols. */
6197 lang_set_startof ();
6199 /* Do all the assignments, now that we know the final resting places
6200 of all the symbols. */
6202 lang_do_assignments ();
6206 /* Make sure that the section addresses make sense. */
6207 if (! link_info
.relocatable
6208 && command_line
.check_section_addresses
)
6209 lang_check_section_addresses ();
6214 /* EXPORTED TO YACC */
6217 lang_add_wild (struct wildcard_spec
*filespec
,
6218 struct wildcard_list
*section_list
,
6219 bfd_boolean keep_sections
)
6221 struct wildcard_list
*curr
, *next
;
6222 lang_wild_statement_type
*new;
6224 /* Reverse the list as the parser puts it back to front. */
6225 for (curr
= section_list
, section_list
= NULL
;
6227 section_list
= curr
, curr
= next
)
6229 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6230 placed_commons
= TRUE
;
6233 curr
->next
= section_list
;
6236 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6238 if (strcmp (filespec
->name
, "*") == 0)
6239 filespec
->name
= NULL
;
6240 else if (! wildcardp (filespec
->name
))
6241 lang_has_input_file
= TRUE
;
6244 new = new_stat (lang_wild_statement
, stat_ptr
);
6245 new->filename
= NULL
;
6246 new->filenames_sorted
= FALSE
;
6247 if (filespec
!= NULL
)
6249 new->filename
= filespec
->name
;
6250 new->filenames_sorted
= filespec
->sorted
== by_name
;
6252 new->section_list
= section_list
;
6253 new->keep_sections
= keep_sections
;
6254 lang_list_init (&new->children
);
6255 analyze_walk_wild_section_handler (new);
6259 lang_section_start (const char *name
, etree_type
*address
,
6260 const segment_type
*segment
)
6262 lang_address_statement_type
*ad
;
6264 ad
= new_stat (lang_address_statement
, stat_ptr
);
6265 ad
->section_name
= name
;
6266 ad
->address
= address
;
6267 ad
->segment
= segment
;
6270 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6271 because of a -e argument on the command line, or zero if this is
6272 called by ENTRY in a linker script. Command line arguments take
6276 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6278 if (entry_symbol
.name
== NULL
6280 || ! entry_from_cmdline
)
6282 entry_symbol
.name
= name
;
6283 entry_from_cmdline
= cmdline
;
6287 /* Set the default start symbol to NAME. .em files should use this,
6288 not lang_add_entry, to override the use of "start" if neither the
6289 linker script nor the command line specifies an entry point. NAME
6290 must be permanently allocated. */
6292 lang_default_entry (const char *name
)
6294 entry_symbol_default
= name
;
6298 lang_add_target (const char *name
)
6300 lang_target_statement_type
*new;
6302 new = new_stat (lang_target_statement
, stat_ptr
);
6307 lang_add_map (const char *name
)
6314 map_option_f
= TRUE
;
6322 lang_add_fill (fill_type
*fill
)
6324 lang_fill_statement_type
*new;
6326 new = new_stat (lang_fill_statement
, stat_ptr
);
6331 lang_add_data (int type
, union etree_union
*exp
)
6333 lang_data_statement_type
*new;
6335 new = new_stat (lang_data_statement
, stat_ptr
);
6340 /* Create a new reloc statement. RELOC is the BFD relocation type to
6341 generate. HOWTO is the corresponding howto structure (we could
6342 look this up, but the caller has already done so). SECTION is the
6343 section to generate a reloc against, or NAME is the name of the
6344 symbol to generate a reloc against. Exactly one of SECTION and
6345 NAME must be NULL. ADDEND is an expression for the addend. */
6348 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6349 reloc_howto_type
*howto
,
6352 union etree_union
*addend
)
6354 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6358 p
->section
= section
;
6360 p
->addend_exp
= addend
;
6362 p
->addend_value
= 0;
6363 p
->output_section
= NULL
;
6364 p
->output_offset
= 0;
6367 lang_assignment_statement_type
*
6368 lang_add_assignment (etree_type
*exp
)
6370 lang_assignment_statement_type
*new;
6372 new = new_stat (lang_assignment_statement
, stat_ptr
);
6378 lang_add_attribute (enum statement_enum attribute
)
6380 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6384 lang_startup (const char *name
)
6386 if (startup_file
!= NULL
)
6388 einfo (_("%P%F: multiple STARTUP files\n"));
6390 first_file
->filename
= name
;
6391 first_file
->local_sym_name
= name
;
6392 first_file
->real
= TRUE
;
6394 startup_file
= name
;
6398 lang_float (bfd_boolean maybe
)
6400 lang_float_flag
= maybe
;
6404 /* Work out the load- and run-time regions from a script statement, and
6405 store them in *LMA_REGION and *REGION respectively.
6407 MEMSPEC is the name of the run-time region, or the value of
6408 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6409 LMA_MEMSPEC is the name of the load-time region, or null if the
6410 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6411 had an explicit load address.
6413 It is an error to specify both a load region and a load address. */
6416 lang_get_regions (lang_memory_region_type
**region
,
6417 lang_memory_region_type
**lma_region
,
6418 const char *memspec
,
6419 const char *lma_memspec
,
6420 bfd_boolean have_lma
,
6421 bfd_boolean have_vma
)
6423 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6425 /* If no runtime region or VMA has been specified, but the load region
6426 has been specified, then use the load region for the runtime region
6428 if (lma_memspec
!= NULL
6430 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6431 *region
= *lma_region
;
6433 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6435 if (have_lma
&& lma_memspec
!= 0)
6436 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6440 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6441 lang_output_section_phdr_list
*phdrs
,
6442 const char *lma_memspec
)
6444 lang_get_regions (¤t_section
->region
,
6445 ¤t_section
->lma_region
,
6446 memspec
, lma_memspec
,
6447 current_section
->load_base
!= NULL
,
6448 current_section
->addr_tree
!= NULL
);
6449 current_section
->fill
= fill
;
6450 current_section
->phdrs
= phdrs
;
6451 stat_ptr
= &statement_list
;
6454 /* Create an absolute symbol with the given name with the value of the
6455 address of first byte of the section named.
6457 If the symbol already exists, then do nothing. */
6460 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6462 struct bfd_link_hash_entry
*h
;
6464 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6466 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6468 if (h
->type
== bfd_link_hash_new
6469 || h
->type
== bfd_link_hash_undefined
)
6473 h
->type
= bfd_link_hash_defined
;
6475 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6479 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6481 h
->u
.def
.section
= bfd_abs_section_ptr
;
6485 /* Create an absolute symbol with the given name with the value of the
6486 address of the first byte after the end of the section named.
6488 If the symbol already exists, then do nothing. */
6491 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6493 struct bfd_link_hash_entry
*h
;
6495 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6497 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6499 if (h
->type
== bfd_link_hash_new
6500 || h
->type
== bfd_link_hash_undefined
)
6504 h
->type
= bfd_link_hash_defined
;
6506 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6510 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
6511 + TO_ADDR (sec
->size
));
6513 h
->u
.def
.section
= bfd_abs_section_ptr
;
6518 lang_statement_append (lang_statement_list_type
*list
,
6519 lang_statement_union_type
*element
,
6520 lang_statement_union_type
**field
)
6522 *(list
->tail
) = element
;
6526 /* Set the output format type. -oformat overrides scripts. */
6529 lang_add_output_format (const char *format
,
6534 if (output_target
== NULL
|| !from_script
)
6536 if (command_line
.endian
== ENDIAN_BIG
6539 else if (command_line
.endian
== ENDIAN_LITTLE
6543 output_target
= format
;
6548 lang_add_insert (const char *where
, int is_before
)
6550 lang_insert_statement_type
*new;
6552 new = new_stat (lang_insert_statement
, stat_ptr
);
6554 new->is_before
= is_before
;
6555 saved_script_handle
= previous_script_handle
;
6558 /* Enter a group. This creates a new lang_group_statement, and sets
6559 stat_ptr to build new statements within the group. */
6562 lang_enter_group (void)
6564 lang_group_statement_type
*g
;
6566 g
= new_stat (lang_group_statement
, stat_ptr
);
6567 lang_list_init (&g
->children
);
6568 stat_ptr
= &g
->children
;
6571 /* Leave a group. This just resets stat_ptr to start writing to the
6572 regular list of statements again. Note that this will not work if
6573 groups can occur inside anything else which can adjust stat_ptr,
6574 but currently they can't. */
6577 lang_leave_group (void)
6579 stat_ptr
= &statement_list
;
6582 /* Add a new program header. This is called for each entry in a PHDRS
6583 command in a linker script. */
6586 lang_new_phdr (const char *name
,
6588 bfd_boolean filehdr
,
6593 struct lang_phdr
*n
, **pp
;
6595 n
= stat_alloc (sizeof (struct lang_phdr
));
6598 n
->type
= exp_get_value_int (type
, 0, "program header type");
6599 n
->filehdr
= filehdr
;
6604 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6609 /* Record the program header information in the output BFD. FIXME: We
6610 should not be calling an ELF specific function here. */
6613 lang_record_phdrs (void)
6617 lang_output_section_phdr_list
*last
;
6618 struct lang_phdr
*l
;
6619 lang_output_section_statement_type
*os
;
6622 secs
= xmalloc (alc
* sizeof (asection
*));
6625 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
6632 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6636 lang_output_section_phdr_list
*pl
;
6638 if (os
->constraint
== -1)
6646 if (os
->sectype
== noload_section
6647 || os
->bfd_section
== NULL
6648 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6653 lang_output_section_statement_type
* tmp_os
;
6655 /* If we have not run across a section with a program
6656 header assigned to it yet, then scan forwards to find
6657 one. This prevents inconsistencies in the linker's
6658 behaviour when a script has specified just a single
6659 header and there are sections in that script which are
6660 not assigned to it, and which occur before the first
6661 use of that header. See here for more details:
6662 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6663 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
6666 last
= tmp_os
->phdrs
;
6670 einfo (_("%F%P: no sections assigned to phdrs\n"));
6675 if (os
->bfd_section
== NULL
)
6678 for (; pl
!= NULL
; pl
= pl
->next
)
6680 if (strcmp (pl
->name
, l
->name
) == 0)
6685 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
6687 secs
[c
] = os
->bfd_section
;
6694 if (l
->flags
== NULL
)
6697 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6702 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6704 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
6705 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6706 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6707 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6712 /* Make sure all the phdr assignments succeeded. */
6713 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6717 lang_output_section_phdr_list
*pl
;
6719 if (os
->constraint
== -1
6720 || os
->bfd_section
== NULL
)
6723 for (pl
= os
->phdrs
;
6726 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6727 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6728 os
->name
, pl
->name
);
6732 /* Record a list of sections which may not be cross referenced. */
6735 lang_add_nocrossref (lang_nocrossref_type
*l
)
6737 struct lang_nocrossrefs
*n
;
6739 n
= xmalloc (sizeof *n
);
6740 n
->next
= nocrossref_list
;
6742 nocrossref_list
= n
;
6744 /* Set notice_all so that we get informed about all symbols. */
6745 link_info
.notice_all
= TRUE
;
6748 /* Overlay handling. We handle overlays with some static variables. */
6750 /* The overlay virtual address. */
6751 static etree_type
*overlay_vma
;
6752 /* And subsection alignment. */
6753 static etree_type
*overlay_subalign
;
6755 /* An expression for the maximum section size seen so far. */
6756 static etree_type
*overlay_max
;
6758 /* A list of all the sections in this overlay. */
6760 struct overlay_list
{
6761 struct overlay_list
*next
;
6762 lang_output_section_statement_type
*os
;
6765 static struct overlay_list
*overlay_list
;
6767 /* Start handling an overlay. */
6770 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6772 /* The grammar should prevent nested overlays from occurring. */
6773 ASSERT (overlay_vma
== NULL
6774 && overlay_subalign
== NULL
6775 && overlay_max
== NULL
);
6777 overlay_vma
= vma_expr
;
6778 overlay_subalign
= subalign
;
6781 /* Start a section in an overlay. We handle this by calling
6782 lang_enter_output_section_statement with the correct VMA.
6783 lang_leave_overlay sets up the LMA and memory regions. */
6786 lang_enter_overlay_section (const char *name
)
6788 struct overlay_list
*n
;
6791 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
6792 0, overlay_subalign
, 0, 0);
6794 /* If this is the first section, then base the VMA of future
6795 sections on this one. This will work correctly even if `.' is
6796 used in the addresses. */
6797 if (overlay_list
== NULL
)
6798 overlay_vma
= exp_nameop (ADDR
, name
);
6800 /* Remember the section. */
6801 n
= xmalloc (sizeof *n
);
6802 n
->os
= current_section
;
6803 n
->next
= overlay_list
;
6806 size
= exp_nameop (SIZEOF
, name
);
6808 /* Arrange to work out the maximum section end address. */
6809 if (overlay_max
== NULL
)
6812 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6815 /* Finish a section in an overlay. There isn't any special to do
6819 lang_leave_overlay_section (fill_type
*fill
,
6820 lang_output_section_phdr_list
*phdrs
)
6827 name
= current_section
->name
;
6829 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6830 region and that no load-time region has been specified. It doesn't
6831 really matter what we say here, since lang_leave_overlay will
6833 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6835 /* Define the magic symbols. */
6837 clean
= xmalloc (strlen (name
) + 1);
6839 for (s1
= name
; *s1
!= '\0'; s1
++)
6840 if (ISALNUM (*s1
) || *s1
== '_')
6844 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6845 sprintf (buf
, "__load_start_%s", clean
);
6846 lang_add_assignment (exp_provide (buf
,
6847 exp_nameop (LOADADDR
, name
),
6850 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6851 sprintf (buf
, "__load_stop_%s", clean
);
6852 lang_add_assignment (exp_provide (buf
,
6854 exp_nameop (LOADADDR
, name
),
6855 exp_nameop (SIZEOF
, name
)),
6861 /* Finish an overlay. If there are any overlay wide settings, this
6862 looks through all the sections in the overlay and sets them. */
6865 lang_leave_overlay (etree_type
*lma_expr
,
6868 const char *memspec
,
6869 lang_output_section_phdr_list
*phdrs
,
6870 const char *lma_memspec
)
6872 lang_memory_region_type
*region
;
6873 lang_memory_region_type
*lma_region
;
6874 struct overlay_list
*l
;
6875 lang_nocrossref_type
*nocrossref
;
6877 lang_get_regions (®ion
, &lma_region
,
6878 memspec
, lma_memspec
,
6879 lma_expr
!= NULL
, FALSE
);
6883 /* After setting the size of the last section, set '.' to end of the
6885 if (overlay_list
!= NULL
)
6886 overlay_list
->os
->update_dot_tree
6887 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6892 struct overlay_list
*next
;
6894 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6897 l
->os
->region
= region
;
6898 l
->os
->lma_region
= lma_region
;
6900 /* The first section has the load address specified in the
6901 OVERLAY statement. The rest are worked out from that.
6902 The base address is not needed (and should be null) if
6903 an LMA region was specified. */
6906 l
->os
->load_base
= lma_expr
;
6907 l
->os
->sectype
= normal_section
;
6909 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6910 l
->os
->phdrs
= phdrs
;
6914 lang_nocrossref_type
*nc
;
6916 nc
= xmalloc (sizeof *nc
);
6917 nc
->name
= l
->os
->name
;
6918 nc
->next
= nocrossref
;
6927 if (nocrossref
!= NULL
)
6928 lang_add_nocrossref (nocrossref
);
6931 overlay_list
= NULL
;
6935 /* Version handling. This is only useful for ELF. */
6937 /* This global variable holds the version tree that we build. */
6939 struct bfd_elf_version_tree
*lang_elf_version_info
;
6941 /* If PREV is NULL, return first version pattern matching particular symbol.
6942 If PREV is non-NULL, return first version pattern matching particular
6943 symbol after PREV (previously returned by lang_vers_match). */
6945 static struct bfd_elf_version_expr
*
6946 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6947 struct bfd_elf_version_expr
*prev
,
6950 const char *cxx_sym
= sym
;
6951 const char *java_sym
= sym
;
6952 struct bfd_elf_version_expr
*expr
= NULL
;
6954 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6956 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6960 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6962 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6967 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6969 struct bfd_elf_version_expr e
;
6971 switch (prev
? prev
->mask
: 0)
6974 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6977 expr
= htab_find (head
->htab
, &e
);
6978 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6979 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6985 case BFD_ELF_VERSION_C_TYPE
:
6986 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6989 expr
= htab_find (head
->htab
, &e
);
6990 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6991 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6997 case BFD_ELF_VERSION_CXX_TYPE
:
6998 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7000 e
.symbol
= java_sym
;
7001 expr
= htab_find (head
->htab
, &e
);
7002 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
7003 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7014 /* Finally, try the wildcards. */
7015 if (prev
== NULL
|| prev
->symbol
)
7016 expr
= head
->remaining
;
7019 for (; expr
; expr
= expr
->next
)
7026 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7029 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7031 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7035 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7041 free ((char *) cxx_sym
);
7042 if (java_sym
!= sym
)
7043 free ((char *) java_sym
);
7047 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7048 return a string pointing to the symbol name. */
7051 realsymbol (const char *pattern
)
7054 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7055 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
7057 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7059 /* It is a glob pattern only if there is no preceding
7061 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
7069 /* Remove the preceding backslash. */
7076 backslash
= *p
== '\\';
7091 /* This is called for each variable name or match expression. NEW is
7092 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7093 pattern to be matched against symbol names. */
7095 struct bfd_elf_version_expr
*
7096 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7099 bfd_boolean literal_p
)
7101 struct bfd_elf_version_expr
*ret
;
7103 ret
= xmalloc (sizeof *ret
);
7105 ret
->pattern
= literal_p
? NULL
: new;
7108 ret
->symbol
= literal_p
? new : realsymbol (new);
7110 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7111 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7112 else if (strcasecmp (lang
, "C++") == 0)
7113 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7114 else if (strcasecmp (lang
, "Java") == 0)
7115 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7118 einfo (_("%X%P: unknown language `%s' in version information\n"),
7120 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7123 return ldemul_new_vers_pattern (ret
);
7126 /* This is called for each set of variable names and match
7129 struct bfd_elf_version_tree
*
7130 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7131 struct bfd_elf_version_expr
*locals
)
7133 struct bfd_elf_version_tree
*ret
;
7135 ret
= xcalloc (1, sizeof *ret
);
7136 ret
->globals
.list
= globals
;
7137 ret
->locals
.list
= locals
;
7138 ret
->match
= lang_vers_match
;
7139 ret
->name_indx
= (unsigned int) -1;
7143 /* This static variable keeps track of version indices. */
7145 static int version_index
;
7148 version_expr_head_hash (const void *p
)
7150 const struct bfd_elf_version_expr
*e
= p
;
7152 return htab_hash_string (e
->symbol
);
7156 version_expr_head_eq (const void *p1
, const void *p2
)
7158 const struct bfd_elf_version_expr
*e1
= p1
;
7159 const struct bfd_elf_version_expr
*e2
= p2
;
7161 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
7165 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7168 struct bfd_elf_version_expr
*e
, *next
;
7169 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7171 for (e
= head
->list
; e
; e
= e
->next
)
7175 head
->mask
|= e
->mask
;
7180 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7181 version_expr_head_eq
, NULL
);
7182 list_loc
= &head
->list
;
7183 remaining_loc
= &head
->remaining
;
7184 for (e
= head
->list
; e
; e
= next
)
7190 remaining_loc
= &e
->next
;
7194 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
7198 struct bfd_elf_version_expr
*e1
, *last
;
7204 if (e1
->mask
== e
->mask
)
7212 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
7216 /* This is a duplicate. */
7217 /* FIXME: Memory leak. Sometimes pattern is not
7218 xmalloced alone, but in larger chunk of memory. */
7219 /* free (e->symbol); */
7224 e
->next
= last
->next
;
7232 list_loc
= &e
->next
;
7236 *remaining_loc
= NULL
;
7237 *list_loc
= head
->remaining
;
7240 head
->remaining
= head
->list
;
7243 /* This is called when we know the name and dependencies of the
7247 lang_register_vers_node (const char *name
,
7248 struct bfd_elf_version_tree
*version
,
7249 struct bfd_elf_version_deps
*deps
)
7251 struct bfd_elf_version_tree
*t
, **pp
;
7252 struct bfd_elf_version_expr
*e1
;
7257 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
7258 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
7260 einfo (_("%X%P: anonymous version tag cannot be combined"
7261 " with other version tags\n"));
7266 /* Make sure this node has a unique name. */
7267 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7268 if (strcmp (t
->name
, name
) == 0)
7269 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7271 lang_finalize_version_expr_head (&version
->globals
);
7272 lang_finalize_version_expr_head (&version
->locals
);
7274 /* Check the global and local match names, and make sure there
7275 aren't any duplicates. */
7277 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7279 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7281 struct bfd_elf_version_expr
*e2
;
7283 if (t
->locals
.htab
&& e1
->symbol
)
7285 e2
= htab_find (t
->locals
.htab
, e1
);
7286 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
7288 if (e1
->mask
== e2
->mask
)
7289 einfo (_("%X%P: duplicate expression `%s'"
7290 " in version information\n"), e1
->symbol
);
7294 else if (!e1
->symbol
)
7295 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7296 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7297 && e1
->mask
== e2
->mask
)
7298 einfo (_("%X%P: duplicate expression `%s'"
7299 " in version information\n"), e1
->pattern
);
7303 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7305 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7307 struct bfd_elf_version_expr
*e2
;
7309 if (t
->globals
.htab
&& e1
->symbol
)
7311 e2
= htab_find (t
->globals
.htab
, e1
);
7312 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
7314 if (e1
->mask
== e2
->mask
)
7315 einfo (_("%X%P: duplicate expression `%s'"
7316 " in version information\n"),
7321 else if (!e1
->symbol
)
7322 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7323 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7324 && e1
->mask
== e2
->mask
)
7325 einfo (_("%X%P: duplicate expression `%s'"
7326 " in version information\n"), e1
->pattern
);
7330 version
->deps
= deps
;
7331 version
->name
= name
;
7332 if (name
[0] != '\0')
7335 version
->vernum
= version_index
;
7338 version
->vernum
= 0;
7340 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7345 /* This is called when we see a version dependency. */
7347 struct bfd_elf_version_deps
*
7348 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7350 struct bfd_elf_version_deps
*ret
;
7351 struct bfd_elf_version_tree
*t
;
7353 ret
= xmalloc (sizeof *ret
);
7356 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7358 if (strcmp (t
->name
, name
) == 0)
7360 ret
->version_needed
= t
;
7365 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7371 lang_do_version_exports_section (void)
7373 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7375 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7377 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7385 contents
= xmalloc (len
);
7386 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7387 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7390 while (p
< contents
+ len
)
7392 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7393 p
= strchr (p
, '\0') + 1;
7396 /* Do not free the contents, as we used them creating the regex. */
7398 /* Do not include this section in the link. */
7399 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7402 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7403 lang_register_vers_node (command_line
.version_exports_section
,
7404 lang_new_vers_node (greg
, lreg
), NULL
);
7408 lang_add_unique (const char *name
)
7410 struct unique_sections
*ent
;
7412 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7413 if (strcmp (ent
->name
, name
) == 0)
7416 ent
= xmalloc (sizeof *ent
);
7417 ent
->name
= xstrdup (name
);
7418 ent
->next
= unique_section_list
;
7419 unique_section_list
= ent
;
7422 /* Append the list of dynamic symbols to the existing one. */
7425 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7427 if (link_info
.dynamic_list
)
7429 struct bfd_elf_version_expr
*tail
;
7430 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7432 tail
->next
= link_info
.dynamic_list
->head
.list
;
7433 link_info
.dynamic_list
->head
.list
= dynamic
;
7437 struct bfd_elf_dynamic_list
*d
;
7439 d
= xcalloc (1, sizeof *d
);
7440 d
->head
.list
= dynamic
;
7441 d
->match
= lang_vers_match
;
7442 link_info
.dynamic_list
= d
;
7446 /* Append the list of C++ typeinfo dynamic symbols to the existing
7450 lang_append_dynamic_list_cpp_typeinfo (void)
7452 const char * symbols
[] =
7454 "typeinfo name for*",
7457 struct bfd_elf_version_expr
*dynamic
= NULL
;
7460 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7461 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7464 lang_append_dynamic_list (dynamic
);
7467 /* Append the list of C++ operator new and delete dynamic symbols to the
7471 lang_append_dynamic_list_cpp_new (void)
7473 const char * symbols
[] =
7478 struct bfd_elf_version_expr
*dynamic
= NULL
;
7481 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7482 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7485 lang_append_dynamic_list (dynamic
);