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, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of the GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
25 #include "libiberty.h"
26 #include "safe-ctype.h"
45 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
48 /* Locals variables. */
49 static struct obstack stat_obstack
;
50 static struct obstack map_obstack
;
52 #define obstack_chunk_alloc xmalloc
53 #define obstack_chunk_free free
54 static const char *startup_file
;
55 static const char *entry_symbol_default
= "start";
56 static bfd_boolean placed_commons
= FALSE
;
57 static bfd_boolean stripped_excluded_sections
= FALSE
;
58 static lang_output_section_statement_type
*default_common_section
;
59 static bfd_boolean map_option_f
;
60 static bfd_vma print_dot
;
61 static lang_input_statement_type
*first_file
;
62 static const char *current_target
;
63 static lang_statement_list_type statement_list
;
64 static struct bfd_hash_table lang_definedness_table
;
65 static lang_statement_list_type
*stat_save
[10];
66 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
67 static struct unique_sections
*unique_section_list
;
68 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
70 /* Forward declarations. */
71 static void exp_init_os (etree_type
*);
72 static void init_map_userdata (bfd
*, asection
*, void *);
73 static lang_input_statement_type
*lookup_name (const char *);
74 static struct bfd_hash_entry
*lang_definedness_newfunc
75 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
76 static void insert_undefined (const char *);
77 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
78 static void print_statement (lang_statement_union_type
*,
79 lang_output_section_statement_type
*);
80 static void print_statement_list (lang_statement_union_type
*,
81 lang_output_section_statement_type
*);
82 static void print_statements (void);
83 static void print_input_section (asection
*, bfd_boolean
);
84 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
85 static void lang_record_phdrs (void);
86 static void lang_do_version_exports_section (void);
87 static void lang_finalize_version_expr_head
88 (struct bfd_elf_version_expr_head
*);
90 /* Exported variables. */
91 const char *output_target
;
92 lang_output_section_statement_type
*abs_output_section
;
93 lang_statement_list_type lang_output_section_statement
;
94 lang_statement_list_type
*stat_ptr
= &statement_list
;
95 lang_statement_list_type file_chain
= { NULL
, NULL
};
96 lang_statement_list_type input_file_chain
;
97 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
98 const char *entry_section
= ".text";
99 bfd_boolean entry_from_cmdline
;
100 bfd_boolean lang_has_input_file
= FALSE
;
101 bfd_boolean had_output_filename
= FALSE
;
102 bfd_boolean lang_float_flag
= FALSE
;
103 bfd_boolean delete_output_file_on_failure
= FALSE
;
104 struct lang_phdr
*lang_phdr_list
;
105 struct lang_nocrossrefs
*nocrossref_list
;
106 bfd_boolean missing_file
= FALSE
;
108 /* Functions that traverse the linker script and might evaluate
109 DEFINED() need to increment this. */
110 int lang_statement_iteration
= 0;
112 etree_type
*base
; /* Relocation base - or null */
114 /* Return TRUE if the PATTERN argument is a wildcard pattern.
115 Although backslashes are treated specially if a pattern contains
116 wildcards, we do not consider the mere presence of a backslash to
117 be enough to cause the pattern to be treated as a wildcard.
118 That lets us handle DOS filenames more naturally. */
119 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
121 #define new_stat(x, y) \
122 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
124 #define outside_section_address(q) \
125 ((q)->output_offset + (q)->output_section->vma)
127 #define outside_symbol_address(q) \
128 ((q)->value + outside_section_address (q->section))
130 #define SECTION_NAME_MAP_LENGTH (16)
133 stat_alloc (size_t size
)
135 return obstack_alloc (&stat_obstack
, size
);
139 name_match (const char *pattern
, const char *name
)
141 if (wildcardp (pattern
))
142 return fnmatch (pattern
, name
, 0);
143 return strcmp (pattern
, name
);
146 /* If PATTERN is of the form archive:file, return a pointer to the
147 separator. If not, return NULL. */
150 archive_path (const char *pattern
)
154 if (link_info
.path_separator
== 0)
157 p
= strchr (pattern
, link_info
.path_separator
);
158 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
159 if (p
== NULL
|| link_info
.path_separator
!= ':')
162 /* Assume a match on the second char is part of drive specifier,
163 as in "c:\silly.dos". */
164 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
165 p
= strchr (p
+ 1, link_info
.path_separator
);
170 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
171 return whether F matches FILE_SPEC. */
174 input_statement_is_archive_path (const char *file_spec
, char *sep
,
175 lang_input_statement_type
*f
)
177 bfd_boolean match
= FALSE
;
180 || name_match (sep
+ 1, f
->filename
) == 0)
181 && ((sep
!= file_spec
)
182 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
186 if (sep
!= file_spec
)
188 const char *aname
= f
->the_bfd
->my_archive
->filename
;
190 match
= name_match (file_spec
, aname
) == 0;
191 *sep
= link_info
.path_separator
;
198 unique_section_p (const asection
*sec
,
199 const lang_output_section_statement_type
*os
)
201 struct unique_sections
*unam
;
204 if (link_info
.relocatable
205 && sec
->owner
!= NULL
206 && bfd_is_group_section (sec
->owner
, sec
))
208 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
211 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
212 if (name_match (unam
->name
, secnam
) == 0)
218 /* Generic traversal routines for finding matching sections. */
220 /* Try processing a section against a wildcard. This just calls
221 the callback unless the filename exclusion list is present
222 and excludes the file. It's hardly ever present so this
223 function is very fast. */
226 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
227 lang_input_statement_type
*file
,
229 struct wildcard_list
*sec
,
233 struct name_list
*list_tmp
;
235 /* Don't process sections from files which were excluded. */
236 for (list_tmp
= sec
->spec
.exclude_name_list
;
238 list_tmp
= list_tmp
->next
)
240 char *p
= archive_path (list_tmp
->name
);
244 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
248 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
251 /* FIXME: Perhaps remove the following at some stage? Matching
252 unadorned archives like this was never documented and has
253 been superceded by the archive:path syntax. */
254 else if (file
->the_bfd
!= NULL
255 && file
->the_bfd
->my_archive
!= NULL
256 && name_match (list_tmp
->name
,
257 file
->the_bfd
->my_archive
->filename
) == 0)
261 (*callback
) (ptr
, sec
, s
, file
, data
);
264 /* Lowest common denominator routine that can handle everything correctly,
268 walk_wild_section_general (lang_wild_statement_type
*ptr
,
269 lang_input_statement_type
*file
,
274 struct wildcard_list
*sec
;
276 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
278 sec
= ptr
->section_list
;
280 (*callback
) (ptr
, sec
, s
, file
, data
);
284 bfd_boolean skip
= FALSE
;
286 if (sec
->spec
.name
!= NULL
)
288 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
290 skip
= name_match (sec
->spec
.name
, sname
) != 0;
294 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
301 /* Routines to find a single section given its name. If there's more
302 than one section with that name, we report that. */
306 asection
*found_section
;
307 bfd_boolean multiple_sections_found
;
308 } section_iterator_callback_data
;
311 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
313 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
315 if (d
->found_section
!= NULL
)
317 d
->multiple_sections_found
= TRUE
;
321 d
->found_section
= s
;
326 find_section (lang_input_statement_type
*file
,
327 struct wildcard_list
*sec
,
328 bfd_boolean
*multiple_sections_found
)
330 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
332 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
333 section_iterator_callback
, &cb_data
);
334 *multiple_sections_found
= cb_data
.multiple_sections_found
;
335 return cb_data
.found_section
;
338 /* Code for handling simple wildcards without going through fnmatch,
339 which can be expensive because of charset translations etc. */
341 /* A simple wild is a literal string followed by a single '*',
342 where the literal part is at least 4 characters long. */
345 is_simple_wild (const char *name
)
347 size_t len
= strcspn (name
, "*?[");
348 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
352 match_simple_wild (const char *pattern
, const char *name
)
354 /* The first four characters of the pattern are guaranteed valid
355 non-wildcard characters. So we can go faster. */
356 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
357 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
362 while (*pattern
!= '*')
363 if (*name
++ != *pattern
++)
369 /* Compare sections ASEC and BSEC according to SORT. */
372 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
381 case by_alignment_name
:
382 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
383 - bfd_section_alignment (asec
->owner
, asec
));
389 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
390 bfd_get_section_name (bsec
->owner
, bsec
));
393 case by_name_alignment
:
394 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
395 bfd_get_section_name (bsec
->owner
, bsec
));
401 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
402 - bfd_section_alignment (asec
->owner
, asec
));
409 /* Build a Binary Search Tree to sort sections, unlike insertion sort
410 used in wild_sort(). BST is considerably faster if the number of
411 of sections are large. */
413 static lang_section_bst_type
**
414 wild_sort_fast (lang_wild_statement_type
*wild
,
415 struct wildcard_list
*sec
,
416 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
419 lang_section_bst_type
**tree
;
422 if (!wild
->filenames_sorted
423 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
425 /* Append at the right end of tree. */
427 tree
= &((*tree
)->right
);
433 /* Find the correct node to append this section. */
434 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
435 tree
= &((*tree
)->left
);
437 tree
= &((*tree
)->right
);
443 /* Use wild_sort_fast to build a BST to sort sections. */
446 output_section_callback_fast (lang_wild_statement_type
*ptr
,
447 struct wildcard_list
*sec
,
449 lang_input_statement_type
*file
,
452 lang_section_bst_type
*node
;
453 lang_section_bst_type
**tree
;
454 lang_output_section_statement_type
*os
;
456 os
= (lang_output_section_statement_type
*) output
;
458 if (unique_section_p (section
, os
))
461 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
464 node
->section
= section
;
466 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
471 /* Convert a sorted sections' BST back to list form. */
474 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
475 lang_section_bst_type
*tree
,
479 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
481 lang_add_section (&ptr
->children
, tree
->section
,
482 (lang_output_section_statement_type
*) output
);
485 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
490 /* Specialized, optimized routines for handling different kinds of
494 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
495 lang_input_statement_type
*file
,
499 /* We can just do a hash lookup for the section with the right name.
500 But if that lookup discovers more than one section with the name
501 (should be rare), we fall back to the general algorithm because
502 we would otherwise have to sort the sections to make sure they
503 get processed in the bfd's order. */
504 bfd_boolean multiple_sections_found
;
505 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
506 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
508 if (multiple_sections_found
)
509 walk_wild_section_general (ptr
, file
, callback
, data
);
511 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
515 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
516 lang_input_statement_type
*file
,
521 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
523 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
525 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
526 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
529 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
534 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
535 lang_input_statement_type
*file
,
540 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
541 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
542 bfd_boolean multiple_sections_found
;
543 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
545 if (multiple_sections_found
)
547 walk_wild_section_general (ptr
, file
, callback
, data
);
551 /* Note that if the section was not found, s0 is NULL and
552 we'll simply never succeed the s == s0 test below. */
553 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
555 /* Recall that in this code path, a section cannot satisfy more
556 than one spec, so if s == s0 then it cannot match
559 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
562 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
563 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
566 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
573 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
574 lang_input_statement_type
*file
,
579 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
580 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
581 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
582 bfd_boolean multiple_sections_found
;
583 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
585 if (multiple_sections_found
)
587 walk_wild_section_general (ptr
, file
, callback
, data
);
591 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
594 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
597 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
598 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
601 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
604 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
606 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
614 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
615 lang_input_statement_type
*file
,
620 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
621 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
622 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
623 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
624 bfd_boolean multiple_sections_found
;
625 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
627 if (multiple_sections_found
)
629 walk_wild_section_general (ptr
, file
, callback
, data
);
633 s1
= find_section (file
, sec1
, &multiple_sections_found
);
634 if (multiple_sections_found
)
636 walk_wild_section_general (ptr
, file
, callback
, data
);
640 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
643 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
646 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
649 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
650 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
654 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
658 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
660 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
668 walk_wild_section (lang_wild_statement_type
*ptr
,
669 lang_input_statement_type
*file
,
673 if (file
->just_syms_flag
)
676 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
679 /* Returns TRUE when name1 is a wildcard spec that might match
680 something name2 can match. We're conservative: we return FALSE
681 only if the prefixes of name1 and name2 are different up to the
682 first wildcard character. */
685 wild_spec_can_overlap (const char *name1
, const char *name2
)
687 size_t prefix1_len
= strcspn (name1
, "?*[");
688 size_t prefix2_len
= strcspn (name2
, "?*[");
689 size_t min_prefix_len
;
691 /* Note that if there is no wildcard character, then we treat the
692 terminating 0 as part of the prefix. Thus ".text" won't match
693 ".text." or ".text.*", for example. */
694 if (name1
[prefix1_len
] == '\0')
696 if (name2
[prefix2_len
] == '\0')
699 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
701 return memcmp (name1
, name2
, min_prefix_len
) == 0;
704 /* Select specialized code to handle various kinds of wildcard
708 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
711 int wild_name_count
= 0;
712 struct wildcard_list
*sec
;
716 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
717 ptr
->handler_data
[0] = NULL
;
718 ptr
->handler_data
[1] = NULL
;
719 ptr
->handler_data
[2] = NULL
;
720 ptr
->handler_data
[3] = NULL
;
723 /* Count how many wildcard_specs there are, and how many of those
724 actually use wildcards in the name. Also, bail out if any of the
725 wildcard names are NULL. (Can this actually happen?
726 walk_wild_section used to test for it.) And bail out if any
727 of the wildcards are more complex than a simple string
728 ending in a single '*'. */
729 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
732 if (sec
->spec
.name
== NULL
)
734 if (wildcardp (sec
->spec
.name
))
737 if (!is_simple_wild (sec
->spec
.name
))
742 /* The zero-spec case would be easy to optimize but it doesn't
743 happen in practice. Likewise, more than 4 specs doesn't
744 happen in practice. */
745 if (sec_count
== 0 || sec_count
> 4)
748 /* Check that no two specs can match the same section. */
749 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
751 struct wildcard_list
*sec2
;
752 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
754 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
759 signature
= (sec_count
<< 8) + wild_name_count
;
763 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
766 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
769 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
772 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
775 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
781 /* Now fill the data array with pointers to the specs, first the
782 specs with non-wildcard names, then the specs with wildcard
783 names. It's OK to process the specs in different order from the
784 given order, because we've already determined that no section
785 will match more than one spec. */
787 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
788 if (!wildcardp (sec
->spec
.name
))
789 ptr
->handler_data
[data_counter
++] = sec
;
790 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
791 if (wildcardp (sec
->spec
.name
))
792 ptr
->handler_data
[data_counter
++] = sec
;
795 /* Handle a wild statement for a single file F. */
798 walk_wild_file (lang_wild_statement_type
*s
,
799 lang_input_statement_type
*f
,
803 if (f
->the_bfd
== NULL
804 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
805 walk_wild_section (s
, f
, callback
, data
);
810 /* This is an archive file. We must map each member of the
811 archive separately. */
812 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
813 while (member
!= NULL
)
815 /* When lookup_name is called, it will call the add_symbols
816 entry point for the archive. For each element of the
817 archive which is included, BFD will call ldlang_add_file,
818 which will set the usrdata field of the member to the
819 lang_input_statement. */
820 if (member
->usrdata
!= NULL
)
822 walk_wild_section (s
,
823 (lang_input_statement_type
*) member
->usrdata
,
827 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
833 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
835 const char *file_spec
= s
->filename
;
838 if (file_spec
== NULL
)
840 /* Perform the iteration over all files in the list. */
841 LANG_FOR_EACH_INPUT_STATEMENT (f
)
843 walk_wild_file (s
, f
, callback
, data
);
846 else if ((p
= archive_path (file_spec
)) != NULL
)
848 LANG_FOR_EACH_INPUT_STATEMENT (f
)
850 if (input_statement_is_archive_path (file_spec
, p
, f
))
851 walk_wild_file (s
, f
, callback
, data
);
854 else if (wildcardp (file_spec
))
856 LANG_FOR_EACH_INPUT_STATEMENT (f
)
858 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
859 walk_wild_file (s
, f
, callback
, data
);
864 lang_input_statement_type
*f
;
866 /* Perform the iteration over a single file. */
867 f
= lookup_name (file_spec
);
869 walk_wild_file (s
, f
, callback
, data
);
873 /* lang_for_each_statement walks the parse tree and calls the provided
874 function for each node, except those inside output section statements
875 with constraint set to -1. */
878 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
879 lang_statement_union_type
*s
)
881 for (; s
!= NULL
; s
= s
->header
.next
)
885 switch (s
->header
.type
)
887 case lang_constructors_statement_enum
:
888 lang_for_each_statement_worker (func
, constructor_list
.head
);
890 case lang_output_section_statement_enum
:
891 if (s
->output_section_statement
.constraint
!= -1)
892 lang_for_each_statement_worker
893 (func
, s
->output_section_statement
.children
.head
);
895 case lang_wild_statement_enum
:
896 lang_for_each_statement_worker (func
,
897 s
->wild_statement
.children
.head
);
899 case lang_group_statement_enum
:
900 lang_for_each_statement_worker (func
,
901 s
->group_statement
.children
.head
);
903 case lang_data_statement_enum
:
904 case lang_reloc_statement_enum
:
905 case lang_object_symbols_statement_enum
:
906 case lang_output_statement_enum
:
907 case lang_target_statement_enum
:
908 case lang_input_section_enum
:
909 case lang_input_statement_enum
:
910 case lang_assignment_statement_enum
:
911 case lang_padding_statement_enum
:
912 case lang_address_statement_enum
:
913 case lang_fill_statement_enum
:
914 case lang_insert_statement_enum
:
924 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
926 lang_for_each_statement_worker (func
, statement_list
.head
);
929 /*----------------------------------------------------------------------*/
932 lang_list_init (lang_statement_list_type
*list
)
935 list
->tail
= &list
->head
;
939 push_stat_ptr (lang_statement_list_type
*new_ptr
)
941 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
943 *stat_save_ptr
++ = stat_ptr
;
950 if (stat_save_ptr
<= stat_save
)
952 stat_ptr
= *--stat_save_ptr
;
955 /* Build a new statement node for the parse tree. */
957 static lang_statement_union_type
*
958 new_statement (enum statement_enum type
,
960 lang_statement_list_type
*list
)
962 lang_statement_union_type
*new_stmt
;
964 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
965 new_stmt
->header
.type
= type
;
966 new_stmt
->header
.next
= NULL
;
967 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
971 /* Build a new input file node for the language. There are several
972 ways in which we treat an input file, eg, we only look at symbols,
973 or prefix it with a -l etc.
975 We can be supplied with requests for input files more than once;
976 they may, for example be split over several lines like foo.o(.text)
977 foo.o(.data) etc, so when asked for a file we check that we haven't
978 got it already so we don't duplicate the bfd. */
980 static lang_input_statement_type
*
981 new_afile (const char *name
,
982 lang_input_file_enum_type file_type
,
984 bfd_boolean add_to_list
)
986 lang_input_statement_type
*p
;
989 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
992 p
= (lang_input_statement_type
*)
993 stat_alloc (sizeof (lang_input_statement_type
));
994 p
->header
.type
= lang_input_statement_enum
;
995 p
->header
.next
= NULL
;
998 lang_has_input_file
= TRUE
;
1000 p
->sysrooted
= FALSE
;
1002 if (file_type
== lang_input_file_is_l_enum
1003 && name
[0] == ':' && name
[1] != '\0')
1005 file_type
= lang_input_file_is_search_file_enum
;
1011 case lang_input_file_is_symbols_only_enum
:
1013 p
->is_archive
= FALSE
;
1015 p
->local_sym_name
= name
;
1016 p
->just_syms_flag
= TRUE
;
1017 p
->search_dirs_flag
= FALSE
;
1019 case lang_input_file_is_fake_enum
:
1021 p
->is_archive
= FALSE
;
1023 p
->local_sym_name
= name
;
1024 p
->just_syms_flag
= FALSE
;
1025 p
->search_dirs_flag
= FALSE
;
1027 case lang_input_file_is_l_enum
:
1028 p
->is_archive
= TRUE
;
1031 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1032 p
->just_syms_flag
= FALSE
;
1033 p
->search_dirs_flag
= TRUE
;
1035 case lang_input_file_is_marker_enum
:
1037 p
->is_archive
= FALSE
;
1039 p
->local_sym_name
= name
;
1040 p
->just_syms_flag
= FALSE
;
1041 p
->search_dirs_flag
= TRUE
;
1043 case lang_input_file_is_search_file_enum
:
1044 p
->sysrooted
= ldlang_sysrooted_script
;
1046 p
->is_archive
= FALSE
;
1048 p
->local_sym_name
= name
;
1049 p
->just_syms_flag
= FALSE
;
1050 p
->search_dirs_flag
= TRUE
;
1052 case lang_input_file_is_file_enum
:
1054 p
->is_archive
= FALSE
;
1056 p
->local_sym_name
= name
;
1057 p
->just_syms_flag
= FALSE
;
1058 p
->search_dirs_flag
= FALSE
;
1064 p
->next_real_file
= NULL
;
1066 p
->dynamic
= config
.dynamic_link
;
1067 p
->add_DT_NEEDED_for_dynamic
= add_DT_NEEDED_for_dynamic
;
1068 p
->add_DT_NEEDED_for_regular
= add_DT_NEEDED_for_regular
;
1069 p
->whole_archive
= whole_archive
;
1071 p
->missing_file
= FALSE
;
1073 lang_statement_append (&input_file_chain
,
1074 (lang_statement_union_type
*) p
,
1075 &p
->next_real_file
);
1079 lang_input_statement_type
*
1080 lang_add_input_file (const char *name
,
1081 lang_input_file_enum_type file_type
,
1084 return new_afile (name
, file_type
, target
, TRUE
);
1087 struct out_section_hash_entry
1089 struct bfd_hash_entry root
;
1090 lang_statement_union_type s
;
1093 /* The hash table. */
1095 static struct bfd_hash_table output_section_statement_table
;
1097 /* Support routines for the hash table used by lang_output_section_find,
1098 initialize the table, fill in an entry and remove the table. */
1100 static struct bfd_hash_entry
*
1101 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1102 struct bfd_hash_table
*table
,
1105 lang_output_section_statement_type
**nextp
;
1106 struct out_section_hash_entry
*ret
;
1110 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1116 entry
= bfd_hash_newfunc (entry
, table
, string
);
1120 ret
= (struct out_section_hash_entry
*) entry
;
1121 memset (&ret
->s
, 0, sizeof (ret
->s
));
1122 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1123 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1124 ret
->s
.output_section_statement
.section_alignment
= -1;
1125 ret
->s
.output_section_statement
.block_value
= 1;
1126 lang_list_init (&ret
->s
.output_section_statement
.children
);
1127 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1129 /* For every output section statement added to the list, except the
1130 first one, lang_output_section_statement.tail points to the "next"
1131 field of the last element of the list. */
1132 if (lang_output_section_statement
.head
!= NULL
)
1133 ret
->s
.output_section_statement
.prev
1134 = ((lang_output_section_statement_type
*)
1135 ((char *) lang_output_section_statement
.tail
1136 - offsetof (lang_output_section_statement_type
, next
)));
1138 /* GCC's strict aliasing rules prevent us from just casting the
1139 address, so we store the pointer in a variable and cast that
1141 nextp
= &ret
->s
.output_section_statement
.next
;
1142 lang_statement_append (&lang_output_section_statement
,
1144 (lang_statement_union_type
**) nextp
);
1149 output_section_statement_table_init (void)
1151 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1152 output_section_statement_newfunc
,
1153 sizeof (struct out_section_hash_entry
),
1155 einfo (_("%P%F: can not create hash table: %E\n"));
1159 output_section_statement_table_free (void)
1161 bfd_hash_table_free (&output_section_statement_table
);
1164 /* Build enough state so that the parser can build its tree. */
1169 obstack_begin (&stat_obstack
, 1000);
1171 stat_ptr
= &statement_list
;
1173 output_section_statement_table_init ();
1175 lang_list_init (stat_ptr
);
1177 lang_list_init (&input_file_chain
);
1178 lang_list_init (&lang_output_section_statement
);
1179 lang_list_init (&file_chain
);
1180 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1182 abs_output_section
=
1183 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1185 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1187 /* The value "3" is ad-hoc, somewhat related to the expected number of
1188 DEFINED expressions in a linker script. For most default linker
1189 scripts, there are none. Why a hash table then? Well, it's somewhat
1190 simpler to re-use working machinery than using a linked list in terms
1191 of code-complexity here in ld, besides the initialization which just
1192 looks like other code here. */
1193 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1194 lang_definedness_newfunc
,
1195 sizeof (struct lang_definedness_hash_entry
),
1197 einfo (_("%P%F: can not create hash table: %E\n"));
1203 output_section_statement_table_free ();
1206 /*----------------------------------------------------------------------
1207 A region is an area of memory declared with the
1208 MEMORY { name:org=exp, len=exp ... }
1211 We maintain a list of all the regions here.
1213 If no regions are specified in the script, then the default is used
1214 which is created when looked up to be the entire data space.
1216 If create is true we are creating a region inside a MEMORY block.
1217 In this case it is probably an error to create a region that has
1218 already been created. If we are not inside a MEMORY block it is
1219 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1220 and so we issue a warning.
1222 Each region has at least one name. The first name is either
1223 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1224 alias names to an existing region within a script with
1225 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1228 static lang_memory_region_type
*lang_memory_region_list
;
1229 static lang_memory_region_type
**lang_memory_region_list_tail
1230 = &lang_memory_region_list
;
1232 lang_memory_region_type
*
1233 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1235 lang_memory_region_name
*n
;
1236 lang_memory_region_type
*r
;
1237 lang_memory_region_type
*new_region
;
1239 /* NAME is NULL for LMA memspecs if no region was specified. */
1243 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1244 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1245 if (strcmp (n
->name
, name
) == 0)
1248 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1253 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1254 einfo (_("%P:%S: warning: memory region `%s' not declared\n"), name
);
1256 new_region
= (lang_memory_region_type
*)
1257 stat_alloc (sizeof (lang_memory_region_type
));
1259 new_region
->name_list
.name
= xstrdup (name
);
1260 new_region
->name_list
.next
= NULL
;
1261 new_region
->next
= NULL
;
1262 new_region
->origin
= 0;
1263 new_region
->length
= ~(bfd_size_type
) 0;
1264 new_region
->current
= 0;
1265 new_region
->last_os
= NULL
;
1266 new_region
->flags
= 0;
1267 new_region
->not_flags
= 0;
1268 new_region
->had_full_message
= FALSE
;
1270 *lang_memory_region_list_tail
= new_region
;
1271 lang_memory_region_list_tail
= &new_region
->next
;
1277 lang_memory_region_alias (const char * alias
, const char * region_name
)
1279 lang_memory_region_name
* n
;
1280 lang_memory_region_type
* r
;
1281 lang_memory_region_type
* region
;
1283 /* The default region must be unique. This ensures that it is not necessary
1284 to iterate through the name list if someone wants the check if a region is
1285 the default memory region. */
1286 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1287 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1288 einfo (_("%F%P:%S: error: alias for default memory region\n"));
1290 /* Look for the target region and check if the alias is not already
1293 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1294 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1296 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1298 if (strcmp (n
->name
, alias
) == 0)
1299 einfo (_("%F%P:%S: error: redefinition of memory region "
1304 /* Check if the target region exists. */
1306 einfo (_("%F%P:%S: error: memory region `%s' "
1307 "for alias `%s' does not exist\n"),
1311 /* Add alias to region name list. */
1312 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1313 n
->name
= xstrdup (alias
);
1314 n
->next
= region
->name_list
.next
;
1315 region
->name_list
.next
= n
;
1318 static lang_memory_region_type
*
1319 lang_memory_default (asection
* section
)
1321 lang_memory_region_type
*p
;
1323 flagword sec_flags
= section
->flags
;
1325 /* Override SEC_DATA to mean a writable section. */
1326 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1327 sec_flags
|= SEC_DATA
;
1329 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1331 if ((p
->flags
& sec_flags
) != 0
1332 && (p
->not_flags
& sec_flags
) == 0)
1337 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1340 /* Find or create an output_section_statement with the given NAME.
1341 If CONSTRAINT is non-zero match one with that constraint, otherwise
1342 match any non-negative constraint. If CREATE, always make a
1343 new output_section_statement for SPECIAL CONSTRAINT. */
1345 lang_output_section_statement_type
*
1346 lang_output_section_statement_lookup (const char *name
,
1350 struct out_section_hash_entry
*entry
;
1352 entry
= ((struct out_section_hash_entry
*)
1353 bfd_hash_lookup (&output_section_statement_table
, name
,
1358 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1362 if (entry
->s
.output_section_statement
.name
!= NULL
)
1364 /* We have a section of this name, but it might not have the correct
1366 struct out_section_hash_entry
*last_ent
;
1368 name
= entry
->s
.output_section_statement
.name
;
1369 if (create
&& constraint
== SPECIAL
)
1370 /* Not traversing to the end reverses the order of the second
1371 and subsequent SPECIAL sections in the hash table chain,
1372 but that shouldn't matter. */
1377 if (constraint
== entry
->s
.output_section_statement
.constraint
1379 && entry
->s
.output_section_statement
.constraint
>= 0))
1380 return &entry
->s
.output_section_statement
;
1382 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1384 while (entry
!= NULL
1385 && name
== entry
->s
.output_section_statement
.name
);
1391 = ((struct out_section_hash_entry
*)
1392 output_section_statement_newfunc (NULL
,
1393 &output_section_statement_table
,
1397 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1400 entry
->root
= last_ent
->root
;
1401 last_ent
->root
.next
= &entry
->root
;
1404 entry
->s
.output_section_statement
.name
= name
;
1405 entry
->s
.output_section_statement
.constraint
= constraint
;
1406 return &entry
->s
.output_section_statement
;
1409 /* Find the next output_section_statement with the same name as OS.
1410 If CONSTRAINT is non-zero, find one with that constraint otherwise
1411 match any non-negative constraint. */
1413 lang_output_section_statement_type
*
1414 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1417 /* All output_section_statements are actually part of a
1418 struct out_section_hash_entry. */
1419 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1421 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1422 const char *name
= os
->name
;
1424 ASSERT (name
== entry
->root
.string
);
1427 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1429 || name
!= entry
->s
.output_section_statement
.name
)
1432 while (constraint
!= entry
->s
.output_section_statement
.constraint
1434 || entry
->s
.output_section_statement
.constraint
< 0));
1436 return &entry
->s
.output_section_statement
;
1439 /* A variant of lang_output_section_find used by place_orphan.
1440 Returns the output statement that should precede a new output
1441 statement for SEC. If an exact match is found on certain flags,
1444 lang_output_section_statement_type
*
1445 lang_output_section_find_by_flags (const asection
*sec
,
1446 lang_output_section_statement_type
**exact
,
1447 lang_match_sec_type_func match_type
)
1449 lang_output_section_statement_type
*first
, *look
, *found
;
1452 /* We know the first statement on this list is *ABS*. May as well
1454 first
= &lang_output_section_statement
.head
->output_section_statement
;
1455 first
= first
->next
;
1457 /* First try for an exact match. */
1459 for (look
= first
; look
; look
= look
->next
)
1461 flags
= look
->flags
;
1462 if (look
->bfd_section
!= NULL
)
1464 flags
= look
->bfd_section
->flags
;
1465 if (match_type
&& !match_type (link_info
.output_bfd
,
1470 flags
^= sec
->flags
;
1471 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1472 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1482 if ((sec
->flags
& SEC_CODE
) != 0
1483 && (sec
->flags
& SEC_ALLOC
) != 0)
1485 /* Try for a rw code section. */
1486 for (look
= first
; look
; look
= look
->next
)
1488 flags
= look
->flags
;
1489 if (look
->bfd_section
!= NULL
)
1491 flags
= look
->bfd_section
->flags
;
1492 if (match_type
&& !match_type (link_info
.output_bfd
,
1497 flags
^= sec
->flags
;
1498 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1499 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1503 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1504 && (sec
->flags
& SEC_ALLOC
) != 0)
1506 /* .rodata can go after .text, .sdata2 after .rodata. */
1507 for (look
= first
; look
; look
= look
->next
)
1509 flags
= look
->flags
;
1510 if (look
->bfd_section
!= NULL
)
1512 flags
= look
->bfd_section
->flags
;
1513 if (match_type
&& !match_type (link_info
.output_bfd
,
1518 flags
^= sec
->flags
;
1519 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1521 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1525 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1526 && (sec
->flags
& SEC_ALLOC
) != 0)
1528 /* .sdata goes after .data, .sbss after .sdata. */
1529 for (look
= first
; look
; look
= look
->next
)
1531 flags
= look
->flags
;
1532 if (look
->bfd_section
!= NULL
)
1534 flags
= look
->bfd_section
->flags
;
1535 if (match_type
&& !match_type (link_info
.output_bfd
,
1540 flags
^= sec
->flags
;
1541 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1542 | SEC_THREAD_LOCAL
))
1543 || ((look
->flags
& SEC_SMALL_DATA
)
1544 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1548 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1549 && (sec
->flags
& SEC_ALLOC
) != 0)
1551 /* .data goes after .rodata. */
1552 for (look
= first
; look
; look
= look
->next
)
1554 flags
= look
->flags
;
1555 if (look
->bfd_section
!= NULL
)
1557 flags
= look
->bfd_section
->flags
;
1558 if (match_type
&& !match_type (link_info
.output_bfd
,
1563 flags
^= sec
->flags
;
1564 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1565 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1569 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1571 /* .bss goes after any other alloc section. */
1572 for (look
= first
; look
; look
= look
->next
)
1574 flags
= look
->flags
;
1575 if (look
->bfd_section
!= NULL
)
1577 flags
= look
->bfd_section
->flags
;
1578 if (match_type
&& !match_type (link_info
.output_bfd
,
1583 flags
^= sec
->flags
;
1584 if (!(flags
& SEC_ALLOC
))
1590 /* non-alloc go last. */
1591 for (look
= first
; look
; look
= look
->next
)
1593 flags
= look
->flags
;
1594 if (look
->bfd_section
!= NULL
)
1595 flags
= look
->bfd_section
->flags
;
1596 flags
^= sec
->flags
;
1597 if (!(flags
& SEC_DEBUGGING
))
1603 if (found
|| !match_type
)
1606 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1609 /* Find the last output section before given output statement.
1610 Used by place_orphan. */
1613 output_prev_sec_find (lang_output_section_statement_type
*os
)
1615 lang_output_section_statement_type
*lookup
;
1617 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1619 if (lookup
->constraint
< 0)
1622 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1623 return lookup
->bfd_section
;
1629 /* Look for a suitable place for a new output section statement. The
1630 idea is to skip over anything that might be inside a SECTIONS {}
1631 statement in a script, before we find another output section
1632 statement. Assignments to "dot" before an output section statement
1633 are assumed to belong to it, except in two cases; The first
1634 assignment to dot, and assignments before non-alloc sections.
1635 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1636 similar assignments that set the initial address, or we might
1637 insert non-alloc note sections among assignments setting end of
1640 static lang_statement_union_type
**
1641 insert_os_after (lang_output_section_statement_type
*after
)
1643 lang_statement_union_type
**where
;
1644 lang_statement_union_type
**assign
= NULL
;
1645 bfd_boolean ignore_first
;
1648 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1650 for (where
= &after
->header
.next
;
1652 where
= &(*where
)->header
.next
)
1654 switch ((*where
)->header
.type
)
1656 case lang_assignment_statement_enum
:
1659 lang_assignment_statement_type
*ass
;
1661 ass
= &(*where
)->assignment_statement
;
1662 if (ass
->exp
->type
.node_class
!= etree_assert
1663 && ass
->exp
->assign
.dst
[0] == '.'
1664 && ass
->exp
->assign
.dst
[1] == 0
1668 ignore_first
= FALSE
;
1670 case lang_wild_statement_enum
:
1671 case lang_input_section_enum
:
1672 case lang_object_symbols_statement_enum
:
1673 case lang_fill_statement_enum
:
1674 case lang_data_statement_enum
:
1675 case lang_reloc_statement_enum
:
1676 case lang_padding_statement_enum
:
1677 case lang_constructors_statement_enum
:
1680 case lang_output_section_statement_enum
:
1683 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1686 || s
->map_head
.s
== NULL
1687 || (s
->flags
& SEC_ALLOC
) != 0)
1691 case lang_input_statement_enum
:
1692 case lang_address_statement_enum
:
1693 case lang_target_statement_enum
:
1694 case lang_output_statement_enum
:
1695 case lang_group_statement_enum
:
1696 case lang_insert_statement_enum
:
1705 lang_output_section_statement_type
*
1706 lang_insert_orphan (asection
*s
,
1707 const char *secname
,
1709 lang_output_section_statement_type
*after
,
1710 struct orphan_save
*place
,
1711 etree_type
*address
,
1712 lang_statement_list_type
*add_child
)
1714 lang_statement_list_type add
;
1716 lang_output_section_statement_type
*os
;
1717 lang_output_section_statement_type
**os_tail
;
1719 /* If we have found an appropriate place for the output section
1720 statements for this orphan, add them to our own private list,
1721 inserting them later into the global statement list. */
1724 lang_list_init (&add
);
1725 push_stat_ptr (&add
);
1728 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1729 address
= exp_intop (0);
1731 os_tail
= ((lang_output_section_statement_type
**)
1732 lang_output_section_statement
.tail
);
1733 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1734 NULL
, NULL
, NULL
, constraint
);
1737 if (config
.build_constructors
&& *os_tail
== os
)
1739 /* If the name of the section is representable in C, then create
1740 symbols to mark the start and the end of the section. */
1741 for (ps
= secname
; *ps
!= '\0'; ps
++)
1742 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1747 etree_type
*e_align
;
1749 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1750 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1751 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1752 e_align
= exp_unop (ALIGN_K
,
1753 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1754 lang_add_assignment (exp_assop ('=', ".", e_align
));
1755 lang_add_assignment (exp_provide (symname
,
1757 exp_nameop (NAME
, ".")),
1762 if (add_child
== NULL
)
1763 add_child
= &os
->children
;
1764 lang_add_section (add_child
, s
, os
);
1766 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1768 const char *region
= (after
->region
1769 ? after
->region
->name_list
.name
1770 : DEFAULT_MEMORY_REGION
);
1771 const char *lma_region
= (after
->lma_region
1772 ? after
->lma_region
->name_list
.name
1774 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1778 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1781 if (ps
!= NULL
&& *ps
== '\0')
1785 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1786 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1787 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1788 lang_add_assignment (exp_provide (symname
,
1789 exp_nameop (NAME
, "."),
1793 /* Restore the global list pointer. */
1797 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1799 asection
*snew
, *as
;
1801 snew
= os
->bfd_section
;
1803 /* Shuffle the bfd section list to make the output file look
1804 neater. This is really only cosmetic. */
1805 if (place
->section
== NULL
1806 && after
!= (&lang_output_section_statement
.head
1807 ->output_section_statement
))
1809 asection
*bfd_section
= after
->bfd_section
;
1811 /* If the output statement hasn't been used to place any input
1812 sections (and thus doesn't have an output bfd_section),
1813 look for the closest prior output statement having an
1815 if (bfd_section
== NULL
)
1816 bfd_section
= output_prev_sec_find (after
);
1818 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1819 place
->section
= &bfd_section
->next
;
1822 if (place
->section
== NULL
)
1823 place
->section
= &link_info
.output_bfd
->sections
;
1825 as
= *place
->section
;
1829 /* Put the section at the end of the list. */
1831 /* Unlink the section. */
1832 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1834 /* Now tack it back on in the right place. */
1835 bfd_section_list_append (link_info
.output_bfd
, snew
);
1837 else if (as
!= snew
&& as
->prev
!= snew
)
1839 /* Unlink the section. */
1840 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1842 /* Now tack it back on in the right place. */
1843 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1846 /* Save the end of this list. Further ophans of this type will
1847 follow the one we've just added. */
1848 place
->section
= &snew
->next
;
1850 /* The following is non-cosmetic. We try to put the output
1851 statements in some sort of reasonable order here, because they
1852 determine the final load addresses of the orphan sections.
1853 In addition, placing output statements in the wrong order may
1854 require extra segments. For instance, given a typical
1855 situation of all read-only sections placed in one segment and
1856 following that a segment containing all the read-write
1857 sections, we wouldn't want to place an orphan read/write
1858 section before or amongst the read-only ones. */
1859 if (add
.head
!= NULL
)
1861 lang_output_section_statement_type
*newly_added_os
;
1863 if (place
->stmt
== NULL
)
1865 lang_statement_union_type
**where
= insert_os_after (after
);
1870 place
->os_tail
= &after
->next
;
1874 /* Put it after the last orphan statement we added. */
1875 *add
.tail
= *place
->stmt
;
1876 *place
->stmt
= add
.head
;
1879 /* Fix the global list pointer if we happened to tack our
1880 new list at the tail. */
1881 if (*stat_ptr
->tail
== add
.head
)
1882 stat_ptr
->tail
= add
.tail
;
1884 /* Save the end of this list. */
1885 place
->stmt
= add
.tail
;
1887 /* Do the same for the list of output section statements. */
1888 newly_added_os
= *os_tail
;
1890 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1891 ((char *) place
->os_tail
1892 - offsetof (lang_output_section_statement_type
, next
));
1893 newly_added_os
->next
= *place
->os_tail
;
1894 if (newly_added_os
->next
!= NULL
)
1895 newly_added_os
->next
->prev
= newly_added_os
;
1896 *place
->os_tail
= newly_added_os
;
1897 place
->os_tail
= &newly_added_os
->next
;
1899 /* Fixing the global list pointer here is a little different.
1900 We added to the list in lang_enter_output_section_statement,
1901 trimmed off the new output_section_statment above when
1902 assigning *os_tail = NULL, but possibly added it back in
1903 the same place when assigning *place->os_tail. */
1904 if (*os_tail
== NULL
)
1905 lang_output_section_statement
.tail
1906 = (lang_statement_union_type
**) os_tail
;
1913 lang_map_flags (flagword flag
)
1915 if (flag
& SEC_ALLOC
)
1918 if (flag
& SEC_CODE
)
1921 if (flag
& SEC_READONLY
)
1924 if (flag
& SEC_DATA
)
1927 if (flag
& SEC_LOAD
)
1934 lang_memory_region_type
*m
;
1935 bfd_boolean dis_header_printed
= FALSE
;
1938 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1942 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1943 || file
->just_syms_flag
)
1946 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1947 if ((s
->output_section
== NULL
1948 || s
->output_section
->owner
!= link_info
.output_bfd
)
1949 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1951 if (! dis_header_printed
)
1953 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1954 dis_header_printed
= TRUE
;
1957 print_input_section (s
, TRUE
);
1961 minfo (_("\nMemory Configuration\n\n"));
1962 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1963 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1965 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1970 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
1972 sprintf_vma (buf
, m
->origin
);
1973 minfo ("0x%s ", buf
);
1981 minfo ("0x%V", m
->length
);
1982 if (m
->flags
|| m
->not_flags
)
1990 lang_map_flags (m
->flags
);
1996 lang_map_flags (m
->not_flags
);
2003 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2005 if (! link_info
.reduce_memory_overheads
)
2007 obstack_begin (&map_obstack
, 1000);
2008 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
2009 bfd_map_over_sections (p
, init_map_userdata
, 0);
2010 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2012 lang_statement_iteration
++;
2013 print_statements ();
2017 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
2019 void *data ATTRIBUTE_UNUSED
)
2021 fat_section_userdata_type
*new_data
2022 = ((fat_section_userdata_type
*) (stat_alloc
2023 (sizeof (fat_section_userdata_type
))));
2025 ASSERT (get_userdata (sec
) == NULL
);
2026 get_userdata (sec
) = new_data
;
2027 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
2028 new_data
->map_symbol_def_count
= 0;
2032 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2033 void *info ATTRIBUTE_UNUSED
)
2035 if (hash_entry
->type
== bfd_link_hash_defined
2036 || hash_entry
->type
== bfd_link_hash_defweak
)
2038 struct fat_user_section_struct
*ud
;
2039 struct map_symbol_def
*def
;
2041 ud
= (struct fat_user_section_struct
*)
2042 get_userdata (hash_entry
->u
.def
.section
);
2045 /* ??? What do we have to do to initialize this beforehand? */
2046 /* The first time we get here is bfd_abs_section... */
2047 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
2048 ud
= (struct fat_user_section_struct
*)
2049 get_userdata (hash_entry
->u
.def
.section
);
2051 else if (!ud
->map_symbol_def_tail
)
2052 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2054 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2055 def
->entry
= hash_entry
;
2056 *(ud
->map_symbol_def_tail
) = def
;
2057 ud
->map_symbol_def_tail
= &def
->next
;
2058 ud
->map_symbol_def_count
++;
2063 /* Initialize an output section. */
2066 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2068 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2069 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2071 if (s
->constraint
!= SPECIAL
)
2072 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2073 if (s
->bfd_section
== NULL
)
2074 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2076 if (s
->bfd_section
== NULL
)
2078 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2079 link_info
.output_bfd
->xvec
->name
, s
->name
);
2081 s
->bfd_section
->output_section
= s
->bfd_section
;
2082 s
->bfd_section
->output_offset
= 0;
2084 if (!link_info
.reduce_memory_overheads
)
2086 fat_section_userdata_type
*new_userdata
= (fat_section_userdata_type
*)
2087 stat_alloc (sizeof (fat_section_userdata_type
));
2088 memset (new_userdata
, 0, sizeof (fat_section_userdata_type
));
2089 get_userdata (s
->bfd_section
) = new_userdata
;
2092 /* If there is a base address, make sure that any sections it might
2093 mention are initialized. */
2094 if (s
->addr_tree
!= NULL
)
2095 exp_init_os (s
->addr_tree
);
2097 if (s
->load_base
!= NULL
)
2098 exp_init_os (s
->load_base
);
2100 /* If supplied an alignment, set it. */
2101 if (s
->section_alignment
!= -1)
2102 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2105 /* Make sure that all output sections mentioned in an expression are
2109 exp_init_os (etree_type
*exp
)
2111 switch (exp
->type
.node_class
)
2115 exp_init_os (exp
->assign
.src
);
2119 exp_init_os (exp
->binary
.lhs
);
2120 exp_init_os (exp
->binary
.rhs
);
2124 exp_init_os (exp
->trinary
.cond
);
2125 exp_init_os (exp
->trinary
.lhs
);
2126 exp_init_os (exp
->trinary
.rhs
);
2130 exp_init_os (exp
->assert_s
.child
);
2134 exp_init_os (exp
->unary
.child
);
2138 switch (exp
->type
.node_code
)
2144 lang_output_section_statement_type
*os
;
2146 os
= lang_output_section_find (exp
->name
.name
);
2147 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2159 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2161 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2163 /* If we are only reading symbols from this object, then we want to
2164 discard all sections. */
2165 if (entry
->just_syms_flag
)
2167 bfd_link_just_syms (abfd
, sec
, &link_info
);
2171 if (!(abfd
->flags
& DYNAMIC
))
2172 bfd_section_already_linked (abfd
, sec
, &link_info
);
2175 /* The wild routines.
2177 These expand statements like *(.text) and foo.o to a list of
2178 explicit actions, like foo.o(.text), bar.o(.text) and
2179 foo.o(.text, .data). */
2181 /* Add SECTION to the output section OUTPUT. Do this by creating a
2182 lang_input_section statement which is placed at PTR. FILE is the
2183 input file which holds SECTION. */
2186 lang_add_section (lang_statement_list_type
*ptr
,
2188 lang_output_section_statement_type
*output
)
2190 flagword flags
= section
->flags
;
2191 bfd_boolean discard
;
2192 lang_input_section_type
*new_section
;
2194 /* Discard sections marked with SEC_EXCLUDE. */
2195 discard
= (flags
& SEC_EXCLUDE
) != 0;
2197 /* Discard input sections which are assigned to a section named
2198 DISCARD_SECTION_NAME. */
2199 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2202 /* Discard debugging sections if we are stripping debugging
2204 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2205 && (flags
& SEC_DEBUGGING
) != 0)
2210 if (section
->output_section
== NULL
)
2212 /* This prevents future calls from assigning this section. */
2213 section
->output_section
= bfd_abs_section_ptr
;
2218 if (section
->output_section
!= NULL
)
2221 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2222 to an output section, because we want to be able to include a
2223 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2224 section (I don't know why we want to do this, but we do).
2225 build_link_order in ldwrite.c handles this case by turning
2226 the embedded SEC_NEVER_LOAD section into a fill. */
2227 flags
&= ~ SEC_NEVER_LOAD
;
2229 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2230 already been processed. One reason to do this is that on pe
2231 format targets, .text$foo sections go into .text and it's odd
2232 to see .text with SEC_LINK_ONCE set. */
2234 if (!link_info
.relocatable
)
2235 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
2237 switch (output
->sectype
)
2239 case normal_section
:
2240 case overlay_section
:
2242 case noalloc_section
:
2243 flags
&= ~SEC_ALLOC
;
2245 case noload_section
:
2247 flags
|= SEC_NEVER_LOAD
;
2248 if ((flags
& SEC_COFF_SHARED_LIBRARY
) == 0)
2249 flags
&= ~SEC_HAS_CONTENTS
;
2253 if (output
->bfd_section
== NULL
)
2254 init_os (output
, flags
);
2256 /* If SEC_READONLY is not set in the input section, then clear
2257 it from the output section. */
2258 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2260 if (output
->bfd_section
->linker_has_input
)
2262 /* Only set SEC_READONLY flag on the first input section. */
2263 flags
&= ~ SEC_READONLY
;
2265 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2266 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2267 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2268 || ((flags
& SEC_MERGE
) != 0
2269 && output
->bfd_section
->entsize
!= section
->entsize
))
2271 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2272 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2275 output
->bfd_section
->flags
|= flags
;
2277 if (!output
->bfd_section
->linker_has_input
)
2279 output
->bfd_section
->linker_has_input
= 1;
2280 /* This must happen after flags have been updated. The output
2281 section may have been created before we saw its first input
2282 section, eg. for a data statement. */
2283 bfd_init_private_section_data (section
->owner
, section
,
2284 link_info
.output_bfd
,
2285 output
->bfd_section
,
2287 if ((flags
& SEC_MERGE
) != 0)
2288 output
->bfd_section
->entsize
= section
->entsize
;
2291 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2292 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2294 /* FIXME: This value should really be obtained from the bfd... */
2295 output
->block_value
= 128;
2298 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2299 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2301 section
->output_section
= output
->bfd_section
;
2303 if (!link_info
.relocatable
2304 && !stripped_excluded_sections
)
2306 asection
*s
= output
->bfd_section
->map_tail
.s
;
2307 output
->bfd_section
->map_tail
.s
= section
;
2308 section
->map_head
.s
= NULL
;
2309 section
->map_tail
.s
= s
;
2311 s
->map_head
.s
= section
;
2313 output
->bfd_section
->map_head
.s
= section
;
2316 /* Add a section reference to the list. */
2317 new_section
= new_stat (lang_input_section
, ptr
);
2318 new_section
->section
= section
;
2321 /* Handle wildcard sorting. This returns the lang_input_section which
2322 should follow the one we are going to create for SECTION and FILE,
2323 based on the sorting requirements of WILD. It returns NULL if the
2324 new section should just go at the end of the current list. */
2326 static lang_statement_union_type
*
2327 wild_sort (lang_wild_statement_type
*wild
,
2328 struct wildcard_list
*sec
,
2329 lang_input_statement_type
*file
,
2332 lang_statement_union_type
*l
;
2334 if (!wild
->filenames_sorted
2335 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2338 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2340 lang_input_section_type
*ls
;
2342 if (l
->header
.type
!= lang_input_section_enum
)
2344 ls
= &l
->input_section
;
2346 /* Sorting by filename takes precedence over sorting by section
2349 if (wild
->filenames_sorted
)
2351 const char *fn
, *ln
;
2355 /* The PE support for the .idata section as generated by
2356 dlltool assumes that files will be sorted by the name of
2357 the archive and then the name of the file within the
2360 if (file
->the_bfd
!= NULL
2361 && bfd_my_archive (file
->the_bfd
) != NULL
)
2363 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2368 fn
= file
->filename
;
2372 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2374 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2379 ln
= ls
->section
->owner
->filename
;
2383 i
= strcmp (fn
, ln
);
2392 fn
= file
->filename
;
2394 ln
= ls
->section
->owner
->filename
;
2396 i
= strcmp (fn
, ln
);
2404 /* Here either the files are not sorted by name, or we are
2405 looking at the sections for this file. */
2407 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2408 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2415 /* Expand a wild statement for a particular FILE. SECTION may be
2416 NULL, in which case it is a wild card. */
2419 output_section_callback (lang_wild_statement_type
*ptr
,
2420 struct wildcard_list
*sec
,
2422 lang_input_statement_type
*file
,
2425 lang_statement_union_type
*before
;
2426 lang_output_section_statement_type
*os
;
2428 os
= (lang_output_section_statement_type
*) output
;
2430 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2431 if (unique_section_p (section
, os
))
2434 before
= wild_sort (ptr
, sec
, file
, section
);
2436 /* Here BEFORE points to the lang_input_section which
2437 should follow the one we are about to add. If BEFORE
2438 is NULL, then the section should just go at the end
2439 of the current list. */
2442 lang_add_section (&ptr
->children
, section
, os
);
2445 lang_statement_list_type list
;
2446 lang_statement_union_type
**pp
;
2448 lang_list_init (&list
);
2449 lang_add_section (&list
, section
, os
);
2451 /* If we are discarding the section, LIST.HEAD will
2453 if (list
.head
!= NULL
)
2455 ASSERT (list
.head
->header
.next
== NULL
);
2457 for (pp
= &ptr
->children
.head
;
2459 pp
= &(*pp
)->header
.next
)
2460 ASSERT (*pp
!= NULL
);
2462 list
.head
->header
.next
= *pp
;
2468 /* Check if all sections in a wild statement for a particular FILE
2472 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2473 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2475 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2478 lang_output_section_statement_type
*os
;
2480 os
= (lang_output_section_statement_type
*) output
;
2482 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2483 if (unique_section_p (section
, os
))
2486 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2487 os
->all_input_readonly
= FALSE
;
2490 /* This is passed a file name which must have been seen already and
2491 added to the statement tree. We will see if it has been opened
2492 already and had its symbols read. If not then we'll read it. */
2494 static lang_input_statement_type
*
2495 lookup_name (const char *name
)
2497 lang_input_statement_type
*search
;
2499 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2501 search
= (lang_input_statement_type
*) search
->next_real_file
)
2503 /* Use the local_sym_name as the name of the file that has
2504 already been loaded as filename might have been transformed
2505 via the search directory lookup mechanism. */
2506 const char *filename
= search
->local_sym_name
;
2508 if (filename
!= NULL
2509 && strcmp (filename
, name
) == 0)
2514 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2515 default_target
, FALSE
);
2517 /* If we have already added this file, or this file is not real
2518 don't add this file. */
2519 if (search
->loaded
|| !search
->real
)
2522 if (! load_symbols (search
, NULL
))
2528 /* Save LIST as a list of libraries whose symbols should not be exported. */
2533 struct excluded_lib
*next
;
2535 static struct excluded_lib
*excluded_libs
;
2538 add_excluded_libs (const char *list
)
2540 const char *p
= list
, *end
;
2544 struct excluded_lib
*entry
;
2545 end
= strpbrk (p
, ",:");
2547 end
= p
+ strlen (p
);
2548 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2549 entry
->next
= excluded_libs
;
2550 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2551 memcpy (entry
->name
, p
, end
- p
);
2552 entry
->name
[end
- p
] = '\0';
2553 excluded_libs
= entry
;
2561 check_excluded_libs (bfd
*abfd
)
2563 struct excluded_lib
*lib
= excluded_libs
;
2567 int len
= strlen (lib
->name
);
2568 const char *filename
= lbasename (abfd
->filename
);
2570 if (strcmp (lib
->name
, "ALL") == 0)
2572 abfd
->no_export
= TRUE
;
2576 if (strncmp (lib
->name
, filename
, len
) == 0
2577 && (filename
[len
] == '\0'
2578 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2579 && filename
[len
+ 2] == '\0')))
2581 abfd
->no_export
= TRUE
;
2589 /* Get the symbols for an input file. */
2592 load_symbols (lang_input_statement_type
*entry
,
2593 lang_statement_list_type
*place
)
2600 ldfile_open_file (entry
);
2602 /* Do not process further if the file was missing. */
2603 if (entry
->missing_file
)
2606 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2607 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2610 bfd_boolean save_ldlang_sysrooted_script
;
2611 bfd_boolean save_add_DT_NEEDED_for_regular
;
2612 bfd_boolean save_add_DT_NEEDED_for_dynamic
;
2613 bfd_boolean save_whole_archive
;
2615 err
= bfd_get_error ();
2617 /* See if the emulation has some special knowledge. */
2618 if (ldemul_unrecognized_file (entry
))
2621 if (err
== bfd_error_file_ambiguously_recognized
)
2625 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2626 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2627 for (p
= matching
; *p
!= NULL
; p
++)
2631 else if (err
!= bfd_error_file_not_recognized
2633 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2635 bfd_close (entry
->the_bfd
);
2636 entry
->the_bfd
= NULL
;
2638 /* Try to interpret the file as a linker script. */
2639 ldfile_open_command_file (entry
->filename
);
2641 push_stat_ptr (place
);
2642 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2643 ldlang_sysrooted_script
= entry
->sysrooted
;
2644 save_add_DT_NEEDED_for_regular
= add_DT_NEEDED_for_regular
;
2645 add_DT_NEEDED_for_regular
= entry
->add_DT_NEEDED_for_regular
;
2646 save_add_DT_NEEDED_for_dynamic
= add_DT_NEEDED_for_dynamic
;
2647 add_DT_NEEDED_for_dynamic
= entry
->add_DT_NEEDED_for_dynamic
;
2648 save_whole_archive
= whole_archive
;
2649 whole_archive
= entry
->whole_archive
;
2651 ldfile_assumed_script
= TRUE
;
2652 parser_input
= input_script
;
2653 /* We want to use the same -Bdynamic/-Bstatic as the one for
2655 config
.dynamic_link
= entry
->dynamic
;
2657 ldfile_assumed_script
= FALSE
;
2659 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2660 add_DT_NEEDED_for_regular
= save_add_DT_NEEDED_for_regular
;
2661 add_DT_NEEDED_for_dynamic
= save_add_DT_NEEDED_for_dynamic
;
2662 whole_archive
= save_whole_archive
;
2668 if (ldemul_recognized_file (entry
))
2671 /* We don't call ldlang_add_file for an archive. Instead, the
2672 add_symbols entry point will call ldlang_add_file, via the
2673 add_archive_element callback, for each element of the archive
2675 switch (bfd_get_format (entry
->the_bfd
))
2681 ldlang_add_file (entry
);
2682 if (trace_files
|| trace_file_tries
)
2683 info_msg ("%I\n", entry
);
2687 check_excluded_libs (entry
->the_bfd
);
2689 if (entry
->whole_archive
)
2692 bfd_boolean loaded
= TRUE
;
2696 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2701 if (! bfd_check_format (member
, bfd_object
))
2703 einfo (_("%F%B: member %B in archive is not an object\n"),
2704 entry
->the_bfd
, member
);
2708 if (! ((*link_info
.callbacks
->add_archive_element
)
2709 (&link_info
, member
, "--whole-archive")))
2712 if (! bfd_link_add_symbols (member
, &link_info
))
2714 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2719 entry
->loaded
= loaded
;
2725 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2726 entry
->loaded
= TRUE
;
2728 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2730 return entry
->loaded
;
2733 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2734 may be NULL, indicating that it is a wildcard. Separate
2735 lang_input_section statements are created for each part of the
2736 expansion; they are added after the wild statement S. OUTPUT is
2737 the output section. */
2740 wild (lang_wild_statement_type
*s
,
2741 const char *target ATTRIBUTE_UNUSED
,
2742 lang_output_section_statement_type
*output
)
2744 struct wildcard_list
*sec
;
2746 if (s
->handler_data
[0]
2747 && s
->handler_data
[0]->spec
.sorted
== by_name
2748 && !s
->filenames_sorted
)
2750 lang_section_bst_type
*tree
;
2752 walk_wild (s
, output_section_callback_fast
, output
);
2757 output_section_callback_tree_to_list (s
, tree
, output
);
2762 walk_wild (s
, output_section_callback
, output
);
2764 if (default_common_section
== NULL
)
2765 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2766 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2768 /* Remember the section that common is going to in case we
2769 later get something which doesn't know where to put it. */
2770 default_common_section
= output
;
2775 /* Return TRUE iff target is the sought target. */
2778 get_target (const bfd_target
*target
, void *data
)
2780 const char *sought
= (const char *) data
;
2782 return strcmp (target
->name
, sought
) == 0;
2785 /* Like strcpy() but convert to lower case as well. */
2788 stricpy (char *dest
, char *src
)
2792 while ((c
= *src
++) != 0)
2793 *dest
++ = TOLOWER (c
);
2798 /* Remove the first occurrence of needle (if any) in haystack
2802 strcut (char *haystack
, char *needle
)
2804 haystack
= strstr (haystack
, needle
);
2810 for (src
= haystack
+ strlen (needle
); *src
;)
2811 *haystack
++ = *src
++;
2817 /* Compare two target format name strings.
2818 Return a value indicating how "similar" they are. */
2821 name_compare (char *first
, char *second
)
2827 copy1
= (char *) xmalloc (strlen (first
) + 1);
2828 copy2
= (char *) xmalloc (strlen (second
) + 1);
2830 /* Convert the names to lower case. */
2831 stricpy (copy1
, first
);
2832 stricpy (copy2
, second
);
2834 /* Remove size and endian strings from the name. */
2835 strcut (copy1
, "big");
2836 strcut (copy1
, "little");
2837 strcut (copy2
, "big");
2838 strcut (copy2
, "little");
2840 /* Return a value based on how many characters match,
2841 starting from the beginning. If both strings are
2842 the same then return 10 * their length. */
2843 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2844 if (copy1
[result
] == 0)
2856 /* Set by closest_target_match() below. */
2857 static const bfd_target
*winner
;
2859 /* Scan all the valid bfd targets looking for one that has the endianness
2860 requirement that was specified on the command line, and is the nearest
2861 match to the original output target. */
2864 closest_target_match (const bfd_target
*target
, void *data
)
2866 const bfd_target
*original
= (const bfd_target
*) data
;
2868 if (command_line
.endian
== ENDIAN_BIG
2869 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2872 if (command_line
.endian
== ENDIAN_LITTLE
2873 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2876 /* Must be the same flavour. */
2877 if (target
->flavour
!= original
->flavour
)
2880 /* Ignore generic big and little endian elf vectors. */
2881 if (strcmp (target
->name
, "elf32-big") == 0
2882 || strcmp (target
->name
, "elf64-big") == 0
2883 || strcmp (target
->name
, "elf32-little") == 0
2884 || strcmp (target
->name
, "elf64-little") == 0)
2887 /* If we have not found a potential winner yet, then record this one. */
2894 /* Oh dear, we now have two potential candidates for a successful match.
2895 Compare their names and choose the better one. */
2896 if (name_compare (target
->name
, original
->name
)
2897 > name_compare (winner
->name
, original
->name
))
2900 /* Keep on searching until wqe have checked them all. */
2904 /* Return the BFD target format of the first input file. */
2907 get_first_input_target (void)
2909 char *target
= NULL
;
2911 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2913 if (s
->header
.type
== lang_input_statement_enum
2916 ldfile_open_file (s
);
2918 if (s
->the_bfd
!= NULL
2919 && bfd_check_format (s
->the_bfd
, bfd_object
))
2921 target
= bfd_get_target (s
->the_bfd
);
2933 lang_get_output_target (void)
2937 /* Has the user told us which output format to use? */
2938 if (output_target
!= NULL
)
2939 return output_target
;
2941 /* No - has the current target been set to something other than
2943 if (current_target
!= default_target
)
2944 return current_target
;
2946 /* No - can we determine the format of the first input file? */
2947 target
= get_first_input_target ();
2951 /* Failed - use the default output target. */
2952 return default_target
;
2955 /* Open the output file. */
2958 open_output (const char *name
)
2960 output_target
= lang_get_output_target ();
2962 /* Has the user requested a particular endianness on the command
2964 if (command_line
.endian
!= ENDIAN_UNSET
)
2966 const bfd_target
*target
;
2967 enum bfd_endian desired_endian
;
2969 /* Get the chosen target. */
2970 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2972 /* If the target is not supported, we cannot do anything. */
2975 if (command_line
.endian
== ENDIAN_BIG
)
2976 desired_endian
= BFD_ENDIAN_BIG
;
2978 desired_endian
= BFD_ENDIAN_LITTLE
;
2980 /* See if the target has the wrong endianness. This should
2981 not happen if the linker script has provided big and
2982 little endian alternatives, but some scrips don't do
2984 if (target
->byteorder
!= desired_endian
)
2986 /* If it does, then see if the target provides
2987 an alternative with the correct endianness. */
2988 if (target
->alternative_target
!= NULL
2989 && (target
->alternative_target
->byteorder
== desired_endian
))
2990 output_target
= target
->alternative_target
->name
;
2993 /* Try to find a target as similar as possible to
2994 the default target, but which has the desired
2995 endian characteristic. */
2996 bfd_search_for_target (closest_target_match
,
2999 /* Oh dear - we could not find any targets that
3000 satisfy our requirements. */
3002 einfo (_("%P: warning: could not find any targets"
3003 " that match endianness requirement\n"));
3005 output_target
= winner
->name
;
3011 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3013 if (link_info
.output_bfd
== NULL
)
3015 if (bfd_get_error () == bfd_error_invalid_target
)
3016 einfo (_("%P%F: target %s not found\n"), output_target
);
3018 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3021 delete_output_file_on_failure
= TRUE
;
3023 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3024 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3025 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3026 ldfile_output_architecture
,
3027 ldfile_output_machine
))
3028 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3030 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3031 if (link_info
.hash
== NULL
)
3032 einfo (_("%P%F: can not create hash table: %E\n"));
3034 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3038 ldlang_open_output (lang_statement_union_type
*statement
)
3040 switch (statement
->header
.type
)
3042 case lang_output_statement_enum
:
3043 ASSERT (link_info
.output_bfd
== NULL
);
3044 open_output (statement
->output_statement
.name
);
3045 ldemul_set_output_arch ();
3046 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3047 link_info
.output_bfd
->flags
|= D_PAGED
;
3049 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3050 if (config
.text_read_only
)
3051 link_info
.output_bfd
->flags
|= WP_TEXT
;
3053 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3054 if (link_info
.traditional_format
)
3055 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3057 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3060 case lang_target_statement_enum
:
3061 current_target
= statement
->target_statement
.target
;
3068 /* Convert between addresses in bytes and sizes in octets.
3069 For currently supported targets, octets_per_byte is always a power
3070 of two, so we can use shifts. */
3071 #define TO_ADDR(X) ((X) >> opb_shift)
3072 #define TO_SIZE(X) ((X) << opb_shift)
3074 /* Support the above. */
3075 static unsigned int opb_shift
= 0;
3080 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3081 ldfile_output_machine
);
3084 while ((x
& 1) == 0)
3092 /* Open all the input files. */
3095 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
3097 for (; s
!= NULL
; s
= s
->header
.next
)
3099 switch (s
->header
.type
)
3101 case lang_constructors_statement_enum
:
3102 open_input_bfds (constructor_list
.head
, force
);
3104 case lang_output_section_statement_enum
:
3105 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
3107 case lang_wild_statement_enum
:
3108 /* Maybe we should load the file's symbols. */
3109 if (s
->wild_statement
.filename
3110 && !wildcardp (s
->wild_statement
.filename
)
3111 && !archive_path (s
->wild_statement
.filename
))
3112 lookup_name (s
->wild_statement
.filename
);
3113 open_input_bfds (s
->wild_statement
.children
.head
, force
);
3115 case lang_group_statement_enum
:
3117 struct bfd_link_hash_entry
*undefs
;
3119 /* We must continually search the entries in the group
3120 until no new symbols are added to the list of undefined
3125 undefs
= link_info
.hash
->undefs_tail
;
3126 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
3128 while (undefs
!= link_info
.hash
->undefs_tail
);
3131 case lang_target_statement_enum
:
3132 current_target
= s
->target_statement
.target
;
3134 case lang_input_statement_enum
:
3135 if (s
->input_statement
.real
)
3137 lang_statement_union_type
**os_tail
;
3138 lang_statement_list_type add
;
3140 s
->input_statement
.target
= current_target
;
3142 /* If we are being called from within a group, and this
3143 is an archive which has already been searched, then
3144 force it to be researched unless the whole archive
3145 has been loaded already. */
3147 && !s
->input_statement
.whole_archive
3148 && s
->input_statement
.loaded
3149 && bfd_check_format (s
->input_statement
.the_bfd
,
3151 s
->input_statement
.loaded
= FALSE
;
3153 os_tail
= lang_output_section_statement
.tail
;
3154 lang_list_init (&add
);
3156 if (! load_symbols (&s
->input_statement
, &add
))
3157 config
.make_executable
= FALSE
;
3159 if (add
.head
!= NULL
)
3161 /* If this was a script with output sections then
3162 tack any added statements on to the end of the
3163 list. This avoids having to reorder the output
3164 section statement list. Very likely the user
3165 forgot -T, and whatever we do here will not meet
3166 naive user expectations. */
3167 if (os_tail
!= lang_output_section_statement
.tail
)
3169 einfo (_("%P: warning: %s contains output sections;"
3170 " did you forget -T?\n"),
3171 s
->input_statement
.filename
);
3172 *stat_ptr
->tail
= add
.head
;
3173 stat_ptr
->tail
= add
.tail
;
3177 *add
.tail
= s
->header
.next
;
3178 s
->header
.next
= add
.head
;
3188 /* Exit if any of the files were missing. */
3193 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3196 lang_track_definedness (const char *name
)
3198 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3199 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3202 /* New-function for the definedness hash table. */
3204 static struct bfd_hash_entry
*
3205 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3206 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3207 const char *name ATTRIBUTE_UNUSED
)
3209 struct lang_definedness_hash_entry
*ret
3210 = (struct lang_definedness_hash_entry
*) entry
;
3213 ret
= (struct lang_definedness_hash_entry
*)
3214 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3217 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3219 ret
->iteration
= -1;
3223 /* Return the iteration when the definition of NAME was last updated. A
3224 value of -1 means that the symbol is not defined in the linker script
3225 or the command line, but may be defined in the linker symbol table. */
3228 lang_symbol_definition_iteration (const char *name
)
3230 struct lang_definedness_hash_entry
*defentry
3231 = (struct lang_definedness_hash_entry
*)
3232 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3234 /* We've already created this one on the presence of DEFINED in the
3235 script, so it can't be NULL unless something is borked elsewhere in
3237 if (defentry
== NULL
)
3240 return defentry
->iteration
;
3243 /* Update the definedness state of NAME. */
3246 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3248 struct lang_definedness_hash_entry
*defentry
3249 = (struct lang_definedness_hash_entry
*)
3250 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3252 /* We don't keep track of symbols not tested with DEFINED. */
3253 if (defentry
== NULL
)
3256 /* If the symbol was already defined, and not from an earlier statement
3257 iteration, don't update the definedness iteration, because that'd
3258 make the symbol seem defined in the linker script at this point, and
3259 it wasn't; it was defined in some object. If we do anyway, DEFINED
3260 would start to yield false before this point and the construct "sym =
3261 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3263 if (h
->type
!= bfd_link_hash_undefined
3264 && h
->type
!= bfd_link_hash_common
3265 && h
->type
!= bfd_link_hash_new
3266 && defentry
->iteration
== -1)
3269 defentry
->iteration
= lang_statement_iteration
;
3272 /* Add the supplied name to the symbol table as an undefined reference.
3273 This is a two step process as the symbol table doesn't even exist at
3274 the time the ld command line is processed. First we put the name
3275 on a list, then, once the output file has been opened, transfer the
3276 name to the symbol table. */
3278 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3280 #define ldlang_undef_chain_list_head entry_symbol.next
3283 ldlang_add_undef (const char *const name
)
3285 ldlang_undef_chain_list_type
*new_undef
= (ldlang_undef_chain_list_type
*)
3286 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
3288 new_undef
->next
= ldlang_undef_chain_list_head
;
3289 ldlang_undef_chain_list_head
= new_undef
;
3291 new_undef
->name
= xstrdup (name
);
3293 if (link_info
.output_bfd
!= NULL
)
3294 insert_undefined (new_undef
->name
);
3297 /* Insert NAME as undefined in the symbol table. */
3300 insert_undefined (const char *name
)
3302 struct bfd_link_hash_entry
*h
;
3304 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3306 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3307 if (h
->type
== bfd_link_hash_new
)
3309 h
->type
= bfd_link_hash_undefined
;
3310 h
->u
.undef
.abfd
= NULL
;
3311 bfd_link_add_undef (link_info
.hash
, h
);
3315 /* Run through the list of undefineds created above and place them
3316 into the linker hash table as undefined symbols belonging to the
3320 lang_place_undefineds (void)
3322 ldlang_undef_chain_list_type
*ptr
;
3324 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3325 insert_undefined (ptr
->name
);
3328 /* Check for all readonly or some readwrite sections. */
3331 check_input_sections
3332 (lang_statement_union_type
*s
,
3333 lang_output_section_statement_type
*output_section_statement
)
3335 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3337 switch (s
->header
.type
)
3339 case lang_wild_statement_enum
:
3340 walk_wild (&s
->wild_statement
, check_section_callback
,
3341 output_section_statement
);
3342 if (! output_section_statement
->all_input_readonly
)
3345 case lang_constructors_statement_enum
:
3346 check_input_sections (constructor_list
.head
,
3347 output_section_statement
);
3348 if (! output_section_statement
->all_input_readonly
)
3351 case lang_group_statement_enum
:
3352 check_input_sections (s
->group_statement
.children
.head
,
3353 output_section_statement
);
3354 if (! output_section_statement
->all_input_readonly
)
3363 /* Update wildcard statements if needed. */
3366 update_wild_statements (lang_statement_union_type
*s
)
3368 struct wildcard_list
*sec
;
3370 switch (sort_section
)
3380 for (; s
!= NULL
; s
= s
->header
.next
)
3382 switch (s
->header
.type
)
3387 case lang_wild_statement_enum
:
3388 sec
= s
->wild_statement
.section_list
;
3389 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3392 switch (sec
->spec
.sorted
)
3395 sec
->spec
.sorted
= sort_section
;
3398 if (sort_section
== by_alignment
)
3399 sec
->spec
.sorted
= by_name_alignment
;
3402 if (sort_section
== by_name
)
3403 sec
->spec
.sorted
= by_alignment_name
;
3411 case lang_constructors_statement_enum
:
3412 update_wild_statements (constructor_list
.head
);
3415 case lang_output_section_statement_enum
:
3416 update_wild_statements
3417 (s
->output_section_statement
.children
.head
);
3420 case lang_group_statement_enum
:
3421 update_wild_statements (s
->group_statement
.children
.head
);
3429 /* Open input files and attach to output sections. */
3432 map_input_to_output_sections
3433 (lang_statement_union_type
*s
, const char *target
,
3434 lang_output_section_statement_type
*os
)
3436 for (; s
!= NULL
; s
= s
->header
.next
)
3438 lang_output_section_statement_type
*tos
;
3441 switch (s
->header
.type
)
3443 case lang_wild_statement_enum
:
3444 wild (&s
->wild_statement
, target
, os
);
3446 case lang_constructors_statement_enum
:
3447 map_input_to_output_sections (constructor_list
.head
,
3451 case lang_output_section_statement_enum
:
3452 tos
= &s
->output_section_statement
;
3453 if (tos
->constraint
!= 0)
3455 if (tos
->constraint
!= ONLY_IF_RW
3456 && tos
->constraint
!= ONLY_IF_RO
)
3458 tos
->all_input_readonly
= TRUE
;
3459 check_input_sections (tos
->children
.head
, tos
);
3460 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3462 tos
->constraint
= -1;
3466 map_input_to_output_sections (tos
->children
.head
,
3470 case lang_output_statement_enum
:
3472 case lang_target_statement_enum
:
3473 target
= s
->target_statement
.target
;
3475 case lang_group_statement_enum
:
3476 map_input_to_output_sections (s
->group_statement
.children
.head
,
3480 case lang_data_statement_enum
:
3481 /* Make sure that any sections mentioned in the expression
3483 exp_init_os (s
->data_statement
.exp
);
3484 /* The output section gets CONTENTS, ALLOC and LOAD, but
3485 these may be overridden by the script. */
3486 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3487 switch (os
->sectype
)
3489 case normal_section
:
3490 case overlay_section
:
3492 case noalloc_section
:
3493 flags
= SEC_HAS_CONTENTS
;
3495 case noload_section
:
3496 flags
= SEC_NEVER_LOAD
;
3499 if (os
->bfd_section
== NULL
)
3500 init_os (os
, flags
);
3502 os
->bfd_section
->flags
|= flags
;
3504 case lang_input_section_enum
:
3506 case lang_fill_statement_enum
:
3507 case lang_object_symbols_statement_enum
:
3508 case lang_reloc_statement_enum
:
3509 case lang_padding_statement_enum
:
3510 case lang_input_statement_enum
:
3511 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3514 case lang_assignment_statement_enum
:
3515 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3518 /* Make sure that any sections mentioned in the assignment
3520 exp_init_os (s
->assignment_statement
.exp
);
3522 case lang_address_statement_enum
:
3523 /* Mark the specified section with the supplied address.
3524 If this section was actually a segment marker, then the
3525 directive is ignored if the linker script explicitly
3526 processed the segment marker. Originally, the linker
3527 treated segment directives (like -Ttext on the
3528 command-line) as section directives. We honor the
3529 section directive semantics for backwards compatibilty;
3530 linker scripts that do not specifically check for
3531 SEGMENT_START automatically get the old semantics. */
3532 if (!s
->address_statement
.segment
3533 || !s
->address_statement
.segment
->used
)
3535 const char *name
= s
->address_statement
.section_name
;
3537 /* Create the output section statement here so that
3538 orphans with a set address will be placed after other
3539 script sections. If we let the orphan placement code
3540 place them in amongst other sections then the address
3541 will affect following script sections, which is
3542 likely to surprise naive users. */
3543 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3544 tos
->addr_tree
= s
->address_statement
.address
;
3545 if (tos
->bfd_section
== NULL
)
3549 case lang_insert_statement_enum
:
3555 /* An insert statement snips out all the linker statements from the
3556 start of the list and places them after the output section
3557 statement specified by the insert. This operation is complicated
3558 by the fact that we keep a doubly linked list of output section
3559 statements as well as the singly linked list of all statements. */
3562 process_insert_statements (void)
3564 lang_statement_union_type
**s
;
3565 lang_output_section_statement_type
*first_os
= NULL
;
3566 lang_output_section_statement_type
*last_os
= NULL
;
3567 lang_output_section_statement_type
*os
;
3569 /* "start of list" is actually the statement immediately after
3570 the special abs_section output statement, so that it isn't
3572 s
= &lang_output_section_statement
.head
;
3573 while (*(s
= &(*s
)->header
.next
) != NULL
)
3575 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3577 /* Keep pointers to the first and last output section
3578 statement in the sequence we may be about to move. */
3579 os
= &(*s
)->output_section_statement
;
3581 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3584 /* Set constraint negative so that lang_output_section_find
3585 won't match this output section statement. At this
3586 stage in linking constraint has values in the range
3587 [-1, ONLY_IN_RW]. */
3588 last_os
->constraint
= -2 - last_os
->constraint
;
3589 if (first_os
== NULL
)
3592 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3594 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3595 lang_output_section_statement_type
*where
;
3596 lang_statement_union_type
**ptr
;
3597 lang_statement_union_type
*first
;
3599 where
= lang_output_section_find (i
->where
);
3600 if (where
!= NULL
&& i
->is_before
)
3603 where
= where
->prev
;
3604 while (where
!= NULL
&& where
->constraint
< 0);
3608 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3612 /* Deal with reordering the output section statement list. */
3613 if (last_os
!= NULL
)
3615 asection
*first_sec
, *last_sec
;
3616 struct lang_output_section_statement_struct
**next
;
3618 /* Snip out the output sections we are moving. */
3619 first_os
->prev
->next
= last_os
->next
;
3620 if (last_os
->next
== NULL
)
3622 next
= &first_os
->prev
->next
;
3623 lang_output_section_statement
.tail
3624 = (lang_statement_union_type
**) next
;
3627 last_os
->next
->prev
= first_os
->prev
;
3628 /* Add them in at the new position. */
3629 last_os
->next
= where
->next
;
3630 if (where
->next
== NULL
)
3632 next
= &last_os
->next
;
3633 lang_output_section_statement
.tail
3634 = (lang_statement_union_type
**) next
;
3637 where
->next
->prev
= last_os
;
3638 first_os
->prev
= where
;
3639 where
->next
= first_os
;
3641 /* Move the bfd sections in the same way. */
3644 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3646 os
->constraint
= -2 - os
->constraint
;
3647 if (os
->bfd_section
!= NULL
3648 && os
->bfd_section
->owner
!= NULL
)
3650 last_sec
= os
->bfd_section
;
3651 if (first_sec
== NULL
)
3652 first_sec
= last_sec
;
3657 if (last_sec
!= NULL
)
3659 asection
*sec
= where
->bfd_section
;
3661 sec
= output_prev_sec_find (where
);
3663 /* The place we want to insert must come after the
3664 sections we are moving. So if we find no
3665 section or if the section is the same as our
3666 last section, then no move is needed. */
3667 if (sec
!= NULL
&& sec
!= last_sec
)
3669 /* Trim them off. */
3670 if (first_sec
->prev
!= NULL
)
3671 first_sec
->prev
->next
= last_sec
->next
;
3673 link_info
.output_bfd
->sections
= last_sec
->next
;
3674 if (last_sec
->next
!= NULL
)
3675 last_sec
->next
->prev
= first_sec
->prev
;
3677 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3679 last_sec
->next
= sec
->next
;
3680 if (sec
->next
!= NULL
)
3681 sec
->next
->prev
= last_sec
;
3683 link_info
.output_bfd
->section_last
= last_sec
;
3684 first_sec
->prev
= sec
;
3685 sec
->next
= first_sec
;
3693 ptr
= insert_os_after (where
);
3694 /* Snip everything after the abs_section output statement we
3695 know is at the start of the list, up to and including
3696 the insert statement we are currently processing. */
3697 first
= lang_output_section_statement
.head
->header
.next
;
3698 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3699 /* Add them back where they belong. */
3702 statement_list
.tail
= s
;
3704 s
= &lang_output_section_statement
.head
;
3708 /* Undo constraint twiddling. */
3709 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3711 os
->constraint
= -2 - os
->constraint
;
3717 /* An output section might have been removed after its statement was
3718 added. For example, ldemul_before_allocation can remove dynamic
3719 sections if they turn out to be not needed. Clean them up here. */
3722 strip_excluded_output_sections (void)
3724 lang_output_section_statement_type
*os
;
3726 /* Run lang_size_sections (if not already done). */
3727 if (expld
.phase
!= lang_mark_phase_enum
)
3729 expld
.phase
= lang_mark_phase_enum
;
3730 expld
.dataseg
.phase
= exp_dataseg_none
;
3731 one_lang_size_sections_pass (NULL
, FALSE
);
3732 lang_reset_memory_regions ();
3735 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3739 asection
*output_section
;
3740 bfd_boolean exclude
;
3742 if (os
->constraint
< 0)
3745 output_section
= os
->bfd_section
;
3746 if (output_section
== NULL
)
3749 exclude
= (output_section
->rawsize
== 0
3750 && (output_section
->flags
& SEC_KEEP
) == 0
3751 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3754 /* Some sections have not yet been sized, notably .gnu.version,
3755 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3756 input sections, so don't drop output sections that have such
3757 input sections unless they are also marked SEC_EXCLUDE. */
3758 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3762 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3763 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3764 && (s
->flags
& SEC_EXCLUDE
) == 0)
3771 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3772 output_section
->map_head
.link_order
= NULL
;
3773 output_section
->map_tail
.link_order
= NULL
;
3777 /* We don't set bfd_section to NULL since bfd_section of the
3778 removed output section statement may still be used. */
3779 if (!os
->section_relative_symbol
3780 && !os
->update_dot_tree
)
3782 output_section
->flags
|= SEC_EXCLUDE
;
3783 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3784 link_info
.output_bfd
->section_count
--;
3788 /* Stop future calls to lang_add_section from messing with map_head
3789 and map_tail link_order fields. */
3790 stripped_excluded_sections
= TRUE
;
3794 print_output_section_statement
3795 (lang_output_section_statement_type
*output_section_statement
)
3797 asection
*section
= output_section_statement
->bfd_section
;
3800 if (output_section_statement
!= abs_output_section
)
3802 minfo ("\n%s", output_section_statement
->name
);
3804 if (section
!= NULL
)
3806 print_dot
= section
->vma
;
3808 len
= strlen (output_section_statement
->name
);
3809 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3814 while (len
< SECTION_NAME_MAP_LENGTH
)
3820 minfo ("0x%V %W", section
->vma
, section
->size
);
3822 if (section
->vma
!= section
->lma
)
3823 minfo (_(" load address 0x%V"), section
->lma
);
3825 if (output_section_statement
->update_dot_tree
!= NULL
)
3826 exp_fold_tree (output_section_statement
->update_dot_tree
,
3827 bfd_abs_section_ptr
, &print_dot
);
3833 print_statement_list (output_section_statement
->children
.head
,
3834 output_section_statement
);
3837 /* Scan for the use of the destination in the right hand side
3838 of an expression. In such cases we will not compute the
3839 correct expression, since the value of DST that is used on
3840 the right hand side will be its final value, not its value
3841 just before this expression is evaluated. */
3844 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3846 if (rhs
== NULL
|| dst
== NULL
)
3849 switch (rhs
->type
.node_class
)
3852 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3853 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3856 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3857 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3860 case etree_provided
:
3862 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3864 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3867 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3871 return strcmp (dst
, rhs
->value
.str
) == 0;
3876 return strcmp (dst
, rhs
->name
.name
) == 0;
3888 print_assignment (lang_assignment_statement_type
*assignment
,
3889 lang_output_section_statement_type
*output_section
)
3893 bfd_boolean computation_is_valid
= TRUE
;
3897 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3900 if (assignment
->exp
->type
.node_class
== etree_assert
)
3903 tree
= assignment
->exp
->assert_s
.child
;
3904 computation_is_valid
= TRUE
;
3908 const char *dst
= assignment
->exp
->assign
.dst
;
3910 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3911 tree
= assignment
->exp
->assign
.src
;
3912 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3915 osec
= output_section
->bfd_section
;
3917 osec
= bfd_abs_section_ptr
;
3918 exp_fold_tree (tree
, osec
, &print_dot
);
3919 if (expld
.result
.valid_p
)
3923 if (computation_is_valid
)
3925 value
= expld
.result
.value
;
3927 if (expld
.result
.section
!= NULL
)
3928 value
+= expld
.result
.section
->vma
;
3930 minfo ("0x%V", value
);
3936 struct bfd_link_hash_entry
*h
;
3938 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3939 FALSE
, FALSE
, TRUE
);
3942 value
= h
->u
.def
.value
;
3944 if (expld
.result
.section
!= NULL
)
3945 value
+= expld
.result
.section
->vma
;
3947 minfo ("[0x%V]", value
);
3950 minfo ("[unresolved]");
3962 exp_print_tree (assignment
->exp
);
3967 print_input_statement (lang_input_statement_type
*statm
)
3969 if (statm
->filename
!= NULL
3970 && (statm
->the_bfd
== NULL
3971 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
3972 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3975 /* Print all symbols defined in a particular section. This is called
3976 via bfd_link_hash_traverse, or by print_all_symbols. */
3979 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3981 asection
*sec
= (asection
*) ptr
;
3983 if ((hash_entry
->type
== bfd_link_hash_defined
3984 || hash_entry
->type
== bfd_link_hash_defweak
)
3985 && sec
== hash_entry
->u
.def
.section
)
3989 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3992 (hash_entry
->u
.def
.value
3993 + hash_entry
->u
.def
.section
->output_offset
3994 + hash_entry
->u
.def
.section
->output_section
->vma
));
3996 minfo (" %T\n", hash_entry
->root
.string
);
4003 hash_entry_addr_cmp (const void *a
, const void *b
)
4005 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4006 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4008 if (l
->u
.def
.value
< r
->u
.def
.value
)
4010 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4017 print_all_symbols (asection
*sec
)
4019 struct fat_user_section_struct
*ud
=
4020 (struct fat_user_section_struct
*) get_userdata (sec
);
4021 struct map_symbol_def
*def
;
4022 struct bfd_link_hash_entry
**entries
;
4028 *ud
->map_symbol_def_tail
= 0;
4030 /* Sort the symbols by address. */
4031 entries
= (struct bfd_link_hash_entry
**)
4032 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4034 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4035 entries
[i
] = def
->entry
;
4037 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4038 hash_entry_addr_cmp
);
4040 /* Print the symbols. */
4041 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4042 print_one_symbol (entries
[i
], sec
);
4044 obstack_free (&map_obstack
, entries
);
4047 /* Print information about an input section to the map file. */
4050 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4052 bfd_size_type size
= i
->size
;
4059 minfo ("%s", i
->name
);
4061 len
= 1 + strlen (i
->name
);
4062 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4067 while (len
< SECTION_NAME_MAP_LENGTH
)
4073 if (i
->output_section
!= NULL
4074 && i
->output_section
->owner
== link_info
.output_bfd
)
4075 addr
= i
->output_section
->vma
+ i
->output_offset
;
4083 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4085 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4087 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4099 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4102 if (i
->output_section
!= NULL
4103 && i
->output_section
->owner
== link_info
.output_bfd
)
4105 if (link_info
.reduce_memory_overheads
)
4106 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4108 print_all_symbols (i
);
4110 /* Update print_dot, but make sure that we do not move it
4111 backwards - this could happen if we have overlays and a
4112 later overlay is shorter than an earier one. */
4113 if (addr
+ TO_ADDR (size
) > print_dot
)
4114 print_dot
= addr
+ TO_ADDR (size
);
4119 print_fill_statement (lang_fill_statement_type
*fill
)
4123 fputs (" FILL mask 0x", config
.map_file
);
4124 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4125 fprintf (config
.map_file
, "%02x", *p
);
4126 fputs ("\n", config
.map_file
);
4130 print_data_statement (lang_data_statement_type
*data
)
4138 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4141 addr
= data
->output_offset
;
4142 if (data
->output_section
!= NULL
)
4143 addr
+= data
->output_section
->vma
;
4171 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4173 if (data
->exp
->type
.node_class
!= etree_value
)
4176 exp_print_tree (data
->exp
);
4181 print_dot
= addr
+ TO_ADDR (size
);
4184 /* Print an address statement. These are generated by options like
4188 print_address_statement (lang_address_statement_type
*address
)
4190 minfo (_("Address of section %s set to "), address
->section_name
);
4191 exp_print_tree (address
->address
);
4195 /* Print a reloc statement. */
4198 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4205 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4208 addr
= reloc
->output_offset
;
4209 if (reloc
->output_section
!= NULL
)
4210 addr
+= reloc
->output_section
->vma
;
4212 size
= bfd_get_reloc_size (reloc
->howto
);
4214 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4216 if (reloc
->name
!= NULL
)
4217 minfo ("%s+", reloc
->name
);
4219 minfo ("%s+", reloc
->section
->name
);
4221 exp_print_tree (reloc
->addend_exp
);
4225 print_dot
= addr
+ TO_ADDR (size
);
4229 print_padding_statement (lang_padding_statement_type
*s
)
4237 len
= sizeof " *fill*" - 1;
4238 while (len
< SECTION_NAME_MAP_LENGTH
)
4244 addr
= s
->output_offset
;
4245 if (s
->output_section
!= NULL
)
4246 addr
+= s
->output_section
->vma
;
4247 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4249 if (s
->fill
->size
!= 0)
4253 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4254 fprintf (config
.map_file
, "%02x", *p
);
4259 print_dot
= addr
+ TO_ADDR (s
->size
);
4263 print_wild_statement (lang_wild_statement_type
*w
,
4264 lang_output_section_statement_type
*os
)
4266 struct wildcard_list
*sec
;
4270 if (w
->filenames_sorted
)
4272 if (w
->filename
!= NULL
)
4273 minfo ("%s", w
->filename
);
4276 if (w
->filenames_sorted
)
4280 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4282 if (sec
->spec
.sorted
)
4284 if (sec
->spec
.exclude_name_list
!= NULL
)
4287 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4288 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4289 minfo (" %s", tmp
->name
);
4292 if (sec
->spec
.name
!= NULL
)
4293 minfo ("%s", sec
->spec
.name
);
4296 if (sec
->spec
.sorted
)
4305 print_statement_list (w
->children
.head
, os
);
4308 /* Print a group statement. */
4311 print_group (lang_group_statement_type
*s
,
4312 lang_output_section_statement_type
*os
)
4314 fprintf (config
.map_file
, "START GROUP\n");
4315 print_statement_list (s
->children
.head
, os
);
4316 fprintf (config
.map_file
, "END GROUP\n");
4319 /* Print the list of statements in S.
4320 This can be called for any statement type. */
4323 print_statement_list (lang_statement_union_type
*s
,
4324 lang_output_section_statement_type
*os
)
4328 print_statement (s
, os
);
4333 /* Print the first statement in statement list S.
4334 This can be called for any statement type. */
4337 print_statement (lang_statement_union_type
*s
,
4338 lang_output_section_statement_type
*os
)
4340 switch (s
->header
.type
)
4343 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4346 case lang_constructors_statement_enum
:
4347 if (constructor_list
.head
!= NULL
)
4349 if (constructors_sorted
)
4350 minfo (" SORT (CONSTRUCTORS)\n");
4352 minfo (" CONSTRUCTORS\n");
4353 print_statement_list (constructor_list
.head
, os
);
4356 case lang_wild_statement_enum
:
4357 print_wild_statement (&s
->wild_statement
, os
);
4359 case lang_address_statement_enum
:
4360 print_address_statement (&s
->address_statement
);
4362 case lang_object_symbols_statement_enum
:
4363 minfo (" CREATE_OBJECT_SYMBOLS\n");
4365 case lang_fill_statement_enum
:
4366 print_fill_statement (&s
->fill_statement
);
4368 case lang_data_statement_enum
:
4369 print_data_statement (&s
->data_statement
);
4371 case lang_reloc_statement_enum
:
4372 print_reloc_statement (&s
->reloc_statement
);
4374 case lang_input_section_enum
:
4375 print_input_section (s
->input_section
.section
, FALSE
);
4377 case lang_padding_statement_enum
:
4378 print_padding_statement (&s
->padding_statement
);
4380 case lang_output_section_statement_enum
:
4381 print_output_section_statement (&s
->output_section_statement
);
4383 case lang_assignment_statement_enum
:
4384 print_assignment (&s
->assignment_statement
, os
);
4386 case lang_target_statement_enum
:
4387 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4389 case lang_output_statement_enum
:
4390 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4391 if (output_target
!= NULL
)
4392 minfo (" %s", output_target
);
4395 case lang_input_statement_enum
:
4396 print_input_statement (&s
->input_statement
);
4398 case lang_group_statement_enum
:
4399 print_group (&s
->group_statement
, os
);
4401 case lang_insert_statement_enum
:
4402 minfo ("INSERT %s %s\n",
4403 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4404 s
->insert_statement
.where
);
4410 print_statements (void)
4412 print_statement_list (statement_list
.head
, abs_output_section
);
4415 /* Print the first N statements in statement list S to STDERR.
4416 If N == 0, nothing is printed.
4417 If N < 0, the entire list is printed.
4418 Intended to be called from GDB. */
4421 dprint_statement (lang_statement_union_type
*s
, int n
)
4423 FILE *map_save
= config
.map_file
;
4425 config
.map_file
= stderr
;
4428 print_statement_list (s
, abs_output_section
);
4431 while (s
&& --n
>= 0)
4433 print_statement (s
, abs_output_section
);
4438 config
.map_file
= map_save
;
4442 insert_pad (lang_statement_union_type
**ptr
,
4444 unsigned int alignment_needed
,
4445 asection
*output_section
,
4448 static fill_type zero_fill
= { 1, { 0 } };
4449 lang_statement_union_type
*pad
= NULL
;
4451 if (ptr
!= &statement_list
.head
)
4452 pad
= ((lang_statement_union_type
*)
4453 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4455 && pad
->header
.type
== lang_padding_statement_enum
4456 && pad
->padding_statement
.output_section
== output_section
)
4458 /* Use the existing pad statement. */
4460 else if ((pad
= *ptr
) != NULL
4461 && pad
->header
.type
== lang_padding_statement_enum
4462 && pad
->padding_statement
.output_section
== output_section
)
4464 /* Use the existing pad statement. */
4468 /* Make a new padding statement, linked into existing chain. */
4469 pad
= (lang_statement_union_type
*)
4470 stat_alloc (sizeof (lang_padding_statement_type
));
4471 pad
->header
.next
= *ptr
;
4473 pad
->header
.type
= lang_padding_statement_enum
;
4474 pad
->padding_statement
.output_section
= output_section
;
4477 pad
->padding_statement
.fill
= fill
;
4479 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4480 pad
->padding_statement
.size
= alignment_needed
;
4481 output_section
->size
+= alignment_needed
;
4484 /* Work out how much this section will move the dot point. */
4488 (lang_statement_union_type
**this_ptr
,
4489 lang_output_section_statement_type
*output_section_statement
,
4493 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4494 asection
*i
= is
->section
;
4496 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4497 && (i
->flags
& SEC_EXCLUDE
) == 0)
4499 unsigned int alignment_needed
;
4502 /* Align this section first to the input sections requirement,
4503 then to the output section's requirement. If this alignment
4504 is greater than any seen before, then record it too. Perform
4505 the alignment by inserting a magic 'padding' statement. */
4507 if (output_section_statement
->subsection_alignment
!= -1)
4508 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4510 o
= output_section_statement
->bfd_section
;
4511 if (o
->alignment_power
< i
->alignment_power
)
4512 o
->alignment_power
= i
->alignment_power
;
4514 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4516 if (alignment_needed
!= 0)
4518 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4519 dot
+= alignment_needed
;
4522 /* Remember where in the output section this input section goes. */
4524 i
->output_offset
= dot
- o
->vma
;
4526 /* Mark how big the output section must be to contain this now. */
4527 dot
+= TO_ADDR (i
->size
);
4528 o
->size
= TO_SIZE (dot
- o
->vma
);
4532 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4539 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4541 const asection
*sec1
= *(const asection
**) arg1
;
4542 const asection
*sec2
= *(const asection
**) arg2
;
4544 if (bfd_section_lma (sec1
->owner
, sec1
)
4545 < bfd_section_lma (sec2
->owner
, sec2
))
4547 else if (bfd_section_lma (sec1
->owner
, sec1
)
4548 > bfd_section_lma (sec2
->owner
, sec2
))
4550 else if (sec1
->id
< sec2
->id
)
4552 else if (sec1
->id
> sec2
->id
)
4558 #define IGNORE_SECTION(s) \
4559 ((s->flags & SEC_NEVER_LOAD) != 0 \
4560 || (s->flags & SEC_ALLOC) == 0 \
4561 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4562 && (s->flags & SEC_LOAD) == 0))
4564 /* Check to see if any allocated sections overlap with other allocated
4565 sections. This can happen if a linker script specifies the output
4566 section addresses of the two sections. Also check whether any memory
4567 region has overflowed. */
4570 lang_check_section_addresses (void)
4573 asection
**sections
, **spp
;
4580 lang_memory_region_type
*m
;
4582 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4585 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4586 sections
= (asection
**) xmalloc (amt
);
4588 /* Scan all sections in the output list. */
4590 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4592 /* Only consider loadable sections with real contents. */
4593 if ((s
->flags
& SEC_NEVER_LOAD
)
4594 || !(s
->flags
& SEC_LOAD
)
4595 || !(s
->flags
& SEC_ALLOC
)
4599 sections
[count
] = s
;
4606 qsort (sections
, (size_t) count
, sizeof (asection
*),
4607 sort_sections_by_lma
);
4612 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4613 for (count
--; count
; count
--)
4615 /* We must check the sections' LMA addresses not their VMA
4616 addresses because overlay sections can have overlapping VMAs
4617 but they must have distinct LMAs. */
4623 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4625 /* Look for an overlap. We have sorted sections by lma, so we
4626 know that s_start >= p_start. Besides the obvious case of
4627 overlap when the current section starts before the previous
4628 one ends, we also must have overlap if the previous section
4629 wraps around the address space. */
4630 if (s_start
<= p_end
4632 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4633 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4638 /* If any memory region has overflowed, report by how much.
4639 We do not issue this diagnostic for regions that had sections
4640 explicitly placed outside their bounds; os_region_check's
4641 diagnostics are adequate for that case.
4643 FIXME: It is conceivable that m->current - (m->origin + m->length)
4644 might overflow a 32-bit integer. There is, alas, no way to print
4645 a bfd_vma quantity in decimal. */
4646 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4647 if (m
->had_full_message
)
4648 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4649 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4653 /* Make sure the new address is within the region. We explicitly permit the
4654 current address to be at the exact end of the region when the address is
4655 non-zero, in case the region is at the end of addressable memory and the
4656 calculation wraps around. */
4659 os_region_check (lang_output_section_statement_type
*os
,
4660 lang_memory_region_type
*region
,
4664 if ((region
->current
< region
->origin
4665 || (region
->current
- region
->origin
> region
->length
))
4666 && ((region
->current
!= region
->origin
+ region
->length
)
4671 einfo (_("%X%P: address 0x%v of %B section `%s'"
4672 " is not within region `%s'\n"),
4674 os
->bfd_section
->owner
,
4675 os
->bfd_section
->name
,
4676 region
->name_list
.name
);
4678 else if (!region
->had_full_message
)
4680 region
->had_full_message
= TRUE
;
4682 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4683 os
->bfd_section
->owner
,
4684 os
->bfd_section
->name
,
4685 region
->name_list
.name
);
4690 /* Set the sizes for all the output sections. */
4693 lang_size_sections_1
4694 (lang_statement_union_type
**prev
,
4695 lang_output_section_statement_type
*output_section_statement
,
4699 bfd_boolean check_regions
)
4701 lang_statement_union_type
*s
;
4703 /* Size up the sections from their constituent parts. */
4704 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4706 switch (s
->header
.type
)
4708 case lang_output_section_statement_enum
:
4710 bfd_vma newdot
, after
;
4711 lang_output_section_statement_type
*os
;
4712 lang_memory_region_type
*r
;
4714 os
= &s
->output_section_statement
;
4715 if (os
->constraint
== -1)
4718 /* FIXME: We shouldn't need to zero section vmas for ld -r
4719 here, in lang_insert_orphan, or in the default linker scripts.
4720 This is covering for coff backend linker bugs. See PR6945. */
4721 if (os
->addr_tree
== NULL
4722 && link_info
.relocatable
4723 && (bfd_get_flavour (link_info
.output_bfd
)
4724 == bfd_target_coff_flavour
))
4725 os
->addr_tree
= exp_intop (0);
4726 if (os
->addr_tree
!= NULL
)
4728 os
->processed_vma
= FALSE
;
4729 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4731 if (expld
.result
.valid_p
)
4733 dot
= expld
.result
.value
;
4734 if (expld
.result
.section
!= NULL
)
4735 dot
+= expld
.result
.section
->vma
;
4737 else if (expld
.phase
!= lang_mark_phase_enum
)
4738 einfo (_("%F%S: non constant or forward reference"
4739 " address expression for section %s\n"),
4743 if (os
->bfd_section
== NULL
)
4744 /* This section was removed or never actually created. */
4747 /* If this is a COFF shared library section, use the size and
4748 address from the input section. FIXME: This is COFF
4749 specific; it would be cleaner if there were some other way
4750 to do this, but nothing simple comes to mind. */
4751 if (((bfd_get_flavour (link_info
.output_bfd
)
4752 == bfd_target_ecoff_flavour
)
4753 || (bfd_get_flavour (link_info
.output_bfd
)
4754 == bfd_target_coff_flavour
))
4755 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4759 if (os
->children
.head
== NULL
4760 || os
->children
.head
->header
.next
!= NULL
4761 || (os
->children
.head
->header
.type
4762 != lang_input_section_enum
))
4763 einfo (_("%P%X: Internal error on COFF shared library"
4764 " section %s\n"), os
->name
);
4766 input
= os
->children
.head
->input_section
.section
;
4767 bfd_set_section_vma (os
->bfd_section
->owner
,
4769 bfd_section_vma (input
->owner
, input
));
4770 os
->bfd_section
->size
= input
->size
;
4775 if (bfd_is_abs_section (os
->bfd_section
))
4777 /* No matter what happens, an abs section starts at zero. */
4778 ASSERT (os
->bfd_section
->vma
== 0);
4784 if (os
->addr_tree
== NULL
)
4786 /* No address specified for this section, get one
4787 from the region specification. */
4788 if (os
->region
== NULL
4789 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4790 && os
->region
->name_list
.name
[0] == '*'
4791 && strcmp (os
->region
->name_list
.name
,
4792 DEFAULT_MEMORY_REGION
) == 0))
4794 os
->region
= lang_memory_default (os
->bfd_section
);
4797 /* If a loadable section is using the default memory
4798 region, and some non default memory regions were
4799 defined, issue an error message. */
4801 && !IGNORE_SECTION (os
->bfd_section
)
4802 && ! link_info
.relocatable
4804 && strcmp (os
->region
->name_list
.name
,
4805 DEFAULT_MEMORY_REGION
) == 0
4806 && lang_memory_region_list
!= NULL
4807 && (strcmp (lang_memory_region_list
->name_list
.name
,
4808 DEFAULT_MEMORY_REGION
) != 0
4809 || lang_memory_region_list
->next
!= NULL
)
4810 && expld
.phase
!= lang_mark_phase_enum
)
4812 /* By default this is an error rather than just a
4813 warning because if we allocate the section to the
4814 default memory region we can end up creating an
4815 excessively large binary, or even seg faulting when
4816 attempting to perform a negative seek. See
4817 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4818 for an example of this. This behaviour can be
4819 overridden by the using the --no-check-sections
4821 if (command_line
.check_section_addresses
)
4822 einfo (_("%P%F: error: no memory region specified"
4823 " for loadable section `%s'\n"),
4824 bfd_get_section_name (link_info
.output_bfd
,
4827 einfo (_("%P: warning: no memory region specified"
4828 " for loadable section `%s'\n"),
4829 bfd_get_section_name (link_info
.output_bfd
,
4833 newdot
= os
->region
->current
;
4834 align
= os
->bfd_section
->alignment_power
;
4837 align
= os
->section_alignment
;
4839 /* Align to what the section needs. */
4842 bfd_vma savedot
= newdot
;
4843 newdot
= align_power (newdot
, align
);
4845 if (newdot
!= savedot
4846 && (config
.warn_section_align
4847 || os
->addr_tree
!= NULL
)
4848 && expld
.phase
!= lang_mark_phase_enum
)
4849 einfo (_("%P: warning: changing start of section"
4850 " %s by %lu bytes\n"),
4851 os
->name
, (unsigned long) (newdot
- savedot
));
4854 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4856 os
->bfd_section
->output_offset
= 0;
4859 lang_size_sections_1 (&os
->children
.head
, os
,
4860 os
->fill
, newdot
, relax
, check_regions
);
4862 os
->processed_vma
= TRUE
;
4864 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4865 /* Except for some special linker created sections,
4866 no output section should change from zero size
4867 after strip_excluded_output_sections. A non-zero
4868 size on an ignored section indicates that some
4869 input section was not sized early enough. */
4870 ASSERT (os
->bfd_section
->size
== 0);
4873 dot
= os
->bfd_section
->vma
;
4875 /* Put the section within the requested block size, or
4876 align at the block boundary. */
4878 + TO_ADDR (os
->bfd_section
->size
)
4879 + os
->block_value
- 1)
4880 & - (bfd_vma
) os
->block_value
);
4882 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4885 /* Set section lma. */
4888 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4892 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4893 os
->bfd_section
->lma
= lma
;
4895 else if (os
->lma_region
!= NULL
)
4897 bfd_vma lma
= os
->lma_region
->current
;
4899 if (os
->section_alignment
!= -1)
4900 lma
= align_power (lma
, os
->section_alignment
);
4901 os
->bfd_section
->lma
= lma
;
4903 else if (r
->last_os
!= NULL
4904 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4909 last
= r
->last_os
->output_section_statement
.bfd_section
;
4911 /* A backwards move of dot should be accompanied by
4912 an explicit assignment to the section LMA (ie.
4913 os->load_base set) because backwards moves can
4914 create overlapping LMAs. */
4916 && os
->bfd_section
->size
!= 0
4917 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4919 /* If dot moved backwards then leave lma equal to
4920 vma. This is the old default lma, which might
4921 just happen to work when the backwards move is
4922 sufficiently large. Nag if this changes anything,
4923 so people can fix their linker scripts. */
4925 if (last
->vma
!= last
->lma
)
4926 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4931 /* If this is an overlay, set the current lma to that
4932 at the end of the previous section. */
4933 if (os
->sectype
== overlay_section
)
4934 lma
= last
->lma
+ last
->size
;
4936 /* Otherwise, keep the same lma to vma relationship
4937 as the previous section. */
4939 lma
= dot
+ last
->lma
- last
->vma
;
4941 if (os
->section_alignment
!= -1)
4942 lma
= align_power (lma
, os
->section_alignment
);
4943 os
->bfd_section
->lma
= lma
;
4946 os
->processed_lma
= TRUE
;
4948 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4951 /* Keep track of normal sections using the default
4952 lma region. We use this to set the lma for
4953 following sections. Overlays or other linker
4954 script assignment to lma might mean that the
4955 default lma == vma is incorrect.
4956 To avoid warnings about dot moving backwards when using
4957 -Ttext, don't start tracking sections until we find one
4958 of non-zero size or with lma set differently to vma. */
4959 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4960 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
4961 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
4962 && (os
->bfd_section
->size
!= 0
4963 || (r
->last_os
== NULL
4964 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
4965 || (r
->last_os
!= NULL
4966 && dot
>= (r
->last_os
->output_section_statement
4967 .bfd_section
->vma
)))
4968 && os
->lma_region
== NULL
4969 && !link_info
.relocatable
)
4972 /* .tbss sections effectively have zero size. */
4973 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4974 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4975 || link_info
.relocatable
)
4976 dot
+= TO_ADDR (os
->bfd_section
->size
);
4978 if (os
->update_dot_tree
!= 0)
4979 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4981 /* Update dot in the region ?
4982 We only do this if the section is going to be allocated,
4983 since unallocated sections do not contribute to the region's
4984 overall size in memory. */
4985 if (os
->region
!= NULL
4986 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
4988 os
->region
->current
= dot
;
4991 /* Make sure the new address is within the region. */
4992 os_region_check (os
, os
->region
, os
->addr_tree
,
4993 os
->bfd_section
->vma
);
4995 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
4996 && (os
->bfd_section
->flags
& SEC_LOAD
))
4998 os
->lma_region
->current
4999 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5002 os_region_check (os
, os
->lma_region
, NULL
,
5003 os
->bfd_section
->lma
);
5009 case lang_constructors_statement_enum
:
5010 dot
= lang_size_sections_1 (&constructor_list
.head
,
5011 output_section_statement
,
5012 fill
, dot
, relax
, check_regions
);
5015 case lang_data_statement_enum
:
5017 unsigned int size
= 0;
5019 s
->data_statement
.output_offset
=
5020 dot
- output_section_statement
->bfd_section
->vma
;
5021 s
->data_statement
.output_section
=
5022 output_section_statement
->bfd_section
;
5024 /* We might refer to provided symbols in the expression, and
5025 need to mark them as needed. */
5026 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5028 switch (s
->data_statement
.type
)
5046 if (size
< TO_SIZE ((unsigned) 1))
5047 size
= TO_SIZE ((unsigned) 1);
5048 dot
+= TO_ADDR (size
);
5049 output_section_statement
->bfd_section
->size
+= size
;
5053 case lang_reloc_statement_enum
:
5057 s
->reloc_statement
.output_offset
=
5058 dot
- output_section_statement
->bfd_section
->vma
;
5059 s
->reloc_statement
.output_section
=
5060 output_section_statement
->bfd_section
;
5061 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5062 dot
+= TO_ADDR (size
);
5063 output_section_statement
->bfd_section
->size
+= size
;
5067 case lang_wild_statement_enum
:
5068 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5069 output_section_statement
,
5070 fill
, dot
, relax
, check_regions
);
5073 case lang_object_symbols_statement_enum
:
5074 link_info
.create_object_symbols_section
=
5075 output_section_statement
->bfd_section
;
5078 case lang_output_statement_enum
:
5079 case lang_target_statement_enum
:
5082 case lang_input_section_enum
:
5086 i
= s
->input_section
.section
;
5091 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5092 einfo (_("%P%F: can't relax section: %E\n"));
5096 dot
= size_input_section (prev
, output_section_statement
,
5097 output_section_statement
->fill
, dot
);
5101 case lang_input_statement_enum
:
5104 case lang_fill_statement_enum
:
5105 s
->fill_statement
.output_section
=
5106 output_section_statement
->bfd_section
;
5108 fill
= s
->fill_statement
.fill
;
5111 case lang_assignment_statement_enum
:
5113 bfd_vma newdot
= dot
;
5114 etree_type
*tree
= s
->assignment_statement
.exp
;
5116 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5118 exp_fold_tree (tree
,
5119 output_section_statement
->bfd_section
,
5122 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5124 if (!expld
.dataseg
.relro_start_stat
)
5125 expld
.dataseg
.relro_start_stat
= s
;
5128 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5131 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5133 if (!expld
.dataseg
.relro_end_stat
)
5134 expld
.dataseg
.relro_end_stat
= s
;
5137 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5140 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5142 /* This symbol is relative to this section. */
5143 if ((tree
->type
.node_class
== etree_provided
5144 || tree
->type
.node_class
== etree_assign
)
5145 && (tree
->assign
.dst
[0] != '.'
5146 || tree
->assign
.dst
[1] != '\0'))
5147 output_section_statement
->section_relative_symbol
= 1;
5149 if (!output_section_statement
->ignored
)
5151 if (output_section_statement
== abs_output_section
)
5153 /* If we don't have an output section, then just adjust
5154 the default memory address. */
5155 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5156 FALSE
)->current
= newdot
;
5158 else if (newdot
!= dot
)
5160 /* Insert a pad after this statement. We can't
5161 put the pad before when relaxing, in case the
5162 assignment references dot. */
5163 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5164 output_section_statement
->bfd_section
, dot
);
5166 /* Don't neuter the pad below when relaxing. */
5169 /* If dot is advanced, this implies that the section
5170 should have space allocated to it, unless the
5171 user has explicitly stated that the section
5172 should not be allocated. */
5173 if (output_section_statement
->sectype
!= noalloc_section
)
5174 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5181 case lang_padding_statement_enum
:
5182 /* If this is the first time lang_size_sections is called,
5183 we won't have any padding statements. If this is the
5184 second or later passes when relaxing, we should allow
5185 padding to shrink. If padding is needed on this pass, it
5186 will be added back in. */
5187 s
->padding_statement
.size
= 0;
5189 /* Make sure output_offset is valid. If relaxation shrinks
5190 the section and this pad isn't needed, it's possible to
5191 have output_offset larger than the final size of the
5192 section. bfd_set_section_contents will complain even for
5193 a pad size of zero. */
5194 s
->padding_statement
.output_offset
5195 = dot
- output_section_statement
->bfd_section
->vma
;
5198 case lang_group_statement_enum
:
5199 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5200 output_section_statement
,
5201 fill
, dot
, relax
, check_regions
);
5204 case lang_insert_statement_enum
:
5207 /* We can only get here when relaxing is turned on. */
5208 case lang_address_statement_enum
:
5215 prev
= &s
->header
.next
;
5220 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5221 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5222 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5223 segments. We are allowed an opportunity to override this decision. */
5226 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5227 bfd
* abfd ATTRIBUTE_UNUSED
,
5228 asection
* current_section
,
5229 asection
* previous_section
,
5230 bfd_boolean new_segment
)
5232 lang_output_section_statement_type
* cur
;
5233 lang_output_section_statement_type
* prev
;
5235 /* The checks below are only necessary when the BFD library has decided
5236 that the two sections ought to be placed into the same segment. */
5240 /* Paranoia checks. */
5241 if (current_section
== NULL
|| previous_section
== NULL
)
5244 /* Find the memory regions associated with the two sections.
5245 We call lang_output_section_find() here rather than scanning the list
5246 of output sections looking for a matching section pointer because if
5247 we have a large number of sections then a hash lookup is faster. */
5248 cur
= lang_output_section_find (current_section
->name
);
5249 prev
= lang_output_section_find (previous_section
->name
);
5251 /* More paranoia. */
5252 if (cur
== NULL
|| prev
== NULL
)
5255 /* If the regions are different then force the sections to live in
5256 different segments. See the email thread starting at the following
5257 URL for the reasons why this is necessary:
5258 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5259 return cur
->region
!= prev
->region
;
5263 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5265 lang_statement_iteration
++;
5266 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5267 0, 0, relax
, check_regions
);
5271 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5273 expld
.phase
= lang_allocating_phase_enum
;
5274 expld
.dataseg
.phase
= exp_dataseg_none
;
5276 one_lang_size_sections_pass (relax
, check_regions
);
5277 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5278 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5280 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5281 to put expld.dataseg.relro on a (common) page boundary. */
5282 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5284 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5285 maxpage
= expld
.dataseg
.maxpagesize
;
5286 /* MIN_BASE is the absolute minimum address we are allowed to start the
5287 read-write segment (byte before will be mapped read-only). */
5288 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5289 /* OLD_BASE is the address for a feasible minimum address which will
5290 still not cause a data overlap inside MAXPAGE causing file offset skip
5292 old_base
= expld
.dataseg
.base
;
5293 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5294 & (expld
.dataseg
.pagesize
- 1));
5295 /* Compute the expected PT_GNU_RELRO segment end. */
5296 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5297 & ~(expld
.dataseg
.pagesize
- 1));
5298 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5300 expld
.dataseg
.base
-= maxpage
;
5301 relro_end
-= maxpage
;
5303 lang_reset_memory_regions ();
5304 one_lang_size_sections_pass (relax
, check_regions
);
5305 if (expld
.dataseg
.relro_end
> relro_end
)
5307 /* The alignment of sections between DATA_SEGMENT_ALIGN
5308 and DATA_SEGMENT_RELRO_END caused huge padding to be
5309 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5310 that the section alignments will fit in. */
5312 unsigned int max_alignment_power
= 0;
5314 /* Find maximum alignment power of sections between
5315 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5316 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5317 if (sec
->vma
>= expld
.dataseg
.base
5318 && sec
->vma
< expld
.dataseg
.relro_end
5319 && sec
->alignment_power
> max_alignment_power
)
5320 max_alignment_power
= sec
->alignment_power
;
5322 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5324 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5325 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5326 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5327 lang_reset_memory_regions ();
5328 one_lang_size_sections_pass (relax
, check_regions
);
5331 link_info
.relro_start
= expld
.dataseg
.base
;
5332 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5334 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5336 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5337 a page could be saved in the data segment. */
5338 bfd_vma first
, last
;
5340 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5341 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5343 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5344 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5345 && first
+ last
<= expld
.dataseg
.pagesize
)
5347 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5348 lang_reset_memory_regions ();
5349 one_lang_size_sections_pass (relax
, check_regions
);
5353 expld
.phase
= lang_final_phase_enum
;
5356 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5359 lang_do_assignments_1 (lang_statement_union_type
*s
,
5360 lang_output_section_statement_type
*current_os
,
5364 for (; s
!= NULL
; s
= s
->header
.next
)
5366 switch (s
->header
.type
)
5368 case lang_constructors_statement_enum
:
5369 dot
= lang_do_assignments_1 (constructor_list
.head
,
5370 current_os
, fill
, dot
);
5373 case lang_output_section_statement_enum
:
5375 lang_output_section_statement_type
*os
;
5377 os
= &(s
->output_section_statement
);
5378 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5380 dot
= os
->bfd_section
->vma
;
5382 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5384 /* .tbss sections effectively have zero size. */
5385 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5386 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5387 || link_info
.relocatable
)
5388 dot
+= TO_ADDR (os
->bfd_section
->size
);
5390 if (os
->update_dot_tree
!= NULL
)
5391 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5396 case lang_wild_statement_enum
:
5398 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5399 current_os
, fill
, dot
);
5402 case lang_object_symbols_statement_enum
:
5403 case lang_output_statement_enum
:
5404 case lang_target_statement_enum
:
5407 case lang_data_statement_enum
:
5408 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5409 if (expld
.result
.valid_p
)
5411 s
->data_statement
.value
= expld
.result
.value
;
5412 if (expld
.result
.section
!= NULL
)
5413 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5416 einfo (_("%F%P: invalid data statement\n"));
5419 switch (s
->data_statement
.type
)
5437 if (size
< TO_SIZE ((unsigned) 1))
5438 size
= TO_SIZE ((unsigned) 1);
5439 dot
+= TO_ADDR (size
);
5443 case lang_reloc_statement_enum
:
5444 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5445 bfd_abs_section_ptr
, &dot
);
5446 if (expld
.result
.valid_p
)
5447 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5449 einfo (_("%F%P: invalid reloc statement\n"));
5450 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5453 case lang_input_section_enum
:
5455 asection
*in
= s
->input_section
.section
;
5457 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5458 dot
+= TO_ADDR (in
->size
);
5462 case lang_input_statement_enum
:
5465 case lang_fill_statement_enum
:
5466 fill
= s
->fill_statement
.fill
;
5469 case lang_assignment_statement_enum
:
5470 exp_fold_tree (s
->assignment_statement
.exp
,
5471 current_os
->bfd_section
,
5475 case lang_padding_statement_enum
:
5476 dot
+= TO_ADDR (s
->padding_statement
.size
);
5479 case lang_group_statement_enum
:
5480 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5481 current_os
, fill
, dot
);
5484 case lang_insert_statement_enum
:
5487 case lang_address_statement_enum
:
5499 lang_do_assignments (void)
5501 lang_statement_iteration
++;
5502 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5505 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5506 operator .startof. (section_name), it produces an undefined symbol
5507 .startof.section_name. Similarly, when it sees
5508 .sizeof. (section_name), it produces an undefined symbol
5509 .sizeof.section_name. For all the output sections, we look for
5510 such symbols, and set them to the correct value. */
5513 lang_set_startof (void)
5517 if (link_info
.relocatable
)
5520 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5522 const char *secname
;
5524 struct bfd_link_hash_entry
*h
;
5526 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5527 buf
= (char *) xmalloc (10 + strlen (secname
));
5529 sprintf (buf
, ".startof.%s", secname
);
5530 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5531 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5533 h
->type
= bfd_link_hash_defined
;
5534 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5535 h
->u
.def
.section
= bfd_abs_section_ptr
;
5538 sprintf (buf
, ".sizeof.%s", secname
);
5539 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5540 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5542 h
->type
= bfd_link_hash_defined
;
5543 h
->u
.def
.value
= TO_ADDR (s
->size
);
5544 h
->u
.def
.section
= bfd_abs_section_ptr
;
5554 struct bfd_link_hash_entry
*h
;
5557 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5558 || (link_info
.shared
&& !link_info
.executable
))
5559 warn
= entry_from_cmdline
;
5563 /* Force the user to specify a root when generating a relocatable with
5565 if (link_info
.gc_sections
&& link_info
.relocatable
5566 && (entry_symbol
.name
== NULL
5567 && ldlang_undef_chain_list_head
== NULL
))
5568 einfo (_("%P%F: gc-sections requires either an entry or "
5569 "an undefined symbol\n"));
5571 if (entry_symbol
.name
== NULL
)
5573 /* No entry has been specified. Look for the default entry, but
5574 don't warn if we don't find it. */
5575 entry_symbol
.name
= entry_symbol_default
;
5579 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5580 FALSE
, FALSE
, TRUE
);
5582 && (h
->type
== bfd_link_hash_defined
5583 || h
->type
== bfd_link_hash_defweak
)
5584 && h
->u
.def
.section
->output_section
!= NULL
)
5588 val
= (h
->u
.def
.value
5589 + bfd_get_section_vma (link_info
.output_bfd
,
5590 h
->u
.def
.section
->output_section
)
5591 + h
->u
.def
.section
->output_offset
);
5592 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5593 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5600 /* We couldn't find the entry symbol. Try parsing it as a
5602 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5605 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5606 einfo (_("%P%F: can't set start address\n"));
5612 /* Can't find the entry symbol, and it's not a number. Use
5613 the first address in the text section. */
5614 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5618 einfo (_("%P: warning: cannot find entry symbol %s;"
5619 " defaulting to %V\n"),
5621 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5622 if (!(bfd_set_start_address
5623 (link_info
.output_bfd
,
5624 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5625 einfo (_("%P%F: can't set start address\n"));
5630 einfo (_("%P: warning: cannot find entry symbol %s;"
5631 " not setting start address\n"),
5637 /* Don't bfd_hash_table_free (&lang_definedness_table);
5638 map file output may result in a call of lang_track_definedness. */
5641 /* This is a small function used when we want to ignore errors from
5645 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5647 /* Don't do anything. */
5650 /* Check that the architecture of all the input files is compatible
5651 with the output file. Also call the backend to let it do any
5652 other checking that is needed. */
5657 lang_statement_union_type
*file
;
5659 const bfd_arch_info_type
*compatible
;
5661 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5663 input_bfd
= file
->input_statement
.the_bfd
;
5665 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5666 command_line
.accept_unknown_input_arch
);
5668 /* In general it is not possible to perform a relocatable
5669 link between differing object formats when the input
5670 file has relocations, because the relocations in the
5671 input format may not have equivalent representations in
5672 the output format (and besides BFD does not translate
5673 relocs for other link purposes than a final link). */
5674 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5675 && (compatible
== NULL
5676 || (bfd_get_flavour (input_bfd
)
5677 != bfd_get_flavour (link_info
.output_bfd
)))
5678 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5680 einfo (_("%P%F: Relocatable linking with relocations from"
5681 " format %s (%B) to format %s (%B) is not supported\n"),
5682 bfd_get_target (input_bfd
), input_bfd
,
5683 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5684 /* einfo with %F exits. */
5687 if (compatible
== NULL
)
5689 if (command_line
.warn_mismatch
)
5690 einfo (_("%P%X: %s architecture of input file `%B'"
5691 " is incompatible with %s output\n"),
5692 bfd_printable_name (input_bfd
), input_bfd
,
5693 bfd_printable_name (link_info
.output_bfd
));
5695 else if (bfd_count_sections (input_bfd
))
5697 /* If the input bfd has no contents, it shouldn't set the
5698 private data of the output bfd. */
5700 bfd_error_handler_type pfn
= NULL
;
5702 /* If we aren't supposed to warn about mismatched input
5703 files, temporarily set the BFD error handler to a
5704 function which will do nothing. We still want to call
5705 bfd_merge_private_bfd_data, since it may set up
5706 information which is needed in the output file. */
5707 if (! command_line
.warn_mismatch
)
5708 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5709 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5711 if (command_line
.warn_mismatch
)
5712 einfo (_("%P%X: failed to merge target specific data"
5713 " of file %B\n"), input_bfd
);
5715 if (! command_line
.warn_mismatch
)
5716 bfd_set_error_handler (pfn
);
5721 /* Look through all the global common symbols and attach them to the
5722 correct section. The -sort-common command line switch may be used
5723 to roughly sort the entries by alignment. */
5728 if (command_line
.inhibit_common_definition
)
5730 if (link_info
.relocatable
5731 && ! command_line
.force_common_definition
)
5734 if (! config
.sort_common
)
5735 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5740 if (config
.sort_common
== sort_descending
)
5742 for (power
= 4; power
> 0; power
--)
5743 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5746 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5750 for (power
= 0; power
<= 4; power
++)
5751 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5754 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5759 /* Place one common symbol in the correct section. */
5762 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5764 unsigned int power_of_two
;
5768 if (h
->type
!= bfd_link_hash_common
)
5772 power_of_two
= h
->u
.c
.p
->alignment_power
;
5774 if (config
.sort_common
== sort_descending
5775 && power_of_two
< *(unsigned int *) info
)
5777 else if (config
.sort_common
== sort_ascending
5778 && power_of_two
> *(unsigned int *) info
)
5781 section
= h
->u
.c
.p
->section
;
5782 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
5783 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5786 if (config
.map_file
!= NULL
)
5788 static bfd_boolean header_printed
;
5793 if (! header_printed
)
5795 minfo (_("\nAllocating common symbols\n"));
5796 minfo (_("Common symbol size file\n\n"));
5797 header_printed
= TRUE
;
5800 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5801 DMGL_ANSI
| DMGL_PARAMS
);
5804 minfo ("%s", h
->root
.string
);
5805 len
= strlen (h
->root
.string
);
5810 len
= strlen (name
);
5826 if (size
<= 0xffffffff)
5827 sprintf (buf
, "%lx", (unsigned long) size
);
5829 sprintf_vma (buf
, size
);
5839 minfo ("%B\n", section
->owner
);
5845 /* Run through the input files and ensure that every input section has
5846 somewhere to go. If one is found without a destination then create
5847 an input request and place it into the statement tree. */
5850 lang_place_orphans (void)
5852 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5856 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5858 if (s
->output_section
== NULL
)
5860 /* This section of the file is not attached, root
5861 around for a sensible place for it to go. */
5863 if (file
->just_syms_flag
)
5864 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5865 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5866 s
->output_section
= bfd_abs_section_ptr
;
5867 else if (strcmp (s
->name
, "COMMON") == 0)
5869 /* This is a lonely common section which must have
5870 come from an archive. We attach to the section
5871 with the wildcard. */
5872 if (! link_info
.relocatable
5873 || command_line
.force_common_definition
)
5875 if (default_common_section
== NULL
)
5876 default_common_section
5877 = lang_output_section_statement_lookup (".bss", 0,
5879 lang_add_section (&default_common_section
->children
, s
,
5880 default_common_section
);
5885 const char *name
= s
->name
;
5888 if (config
.unique_orphan_sections
5889 || unique_section_p (s
, NULL
))
5890 constraint
= SPECIAL
;
5892 if (!ldemul_place_orphan (s
, name
, constraint
))
5894 lang_output_section_statement_type
*os
;
5895 os
= lang_output_section_statement_lookup (name
,
5898 lang_add_section (&os
->children
, s
, os
);
5907 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5909 flagword
*ptr_flags
;
5911 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5917 *ptr_flags
|= SEC_ALLOC
;
5921 *ptr_flags
|= SEC_READONLY
;
5925 *ptr_flags
|= SEC_DATA
;
5929 *ptr_flags
|= SEC_CODE
;
5934 *ptr_flags
|= SEC_LOAD
;
5938 einfo (_("%P%F: invalid syntax in flags\n"));
5945 /* Call a function on each input file. This function will be called
5946 on an archive, but not on the elements. */
5949 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5951 lang_input_statement_type
*f
;
5953 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5955 f
= (lang_input_statement_type
*) f
->next_real_file
)
5959 /* Call a function on each file. The function will be called on all
5960 the elements of an archive which are included in the link, but will
5961 not be called on the archive file itself. */
5964 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5966 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5973 ldlang_add_file (lang_input_statement_type
*entry
)
5975 lang_statement_append (&file_chain
,
5976 (lang_statement_union_type
*) entry
,
5979 /* The BFD linker needs to have a list of all input BFDs involved in
5981 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5982 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
5984 *link_info
.input_bfds_tail
= entry
->the_bfd
;
5985 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
5986 entry
->the_bfd
->usrdata
= entry
;
5987 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5989 /* Look through the sections and check for any which should not be
5990 included in the link. We need to do this now, so that we can
5991 notice when the backend linker tries to report multiple
5992 definition errors for symbols which are in sections we aren't
5993 going to link. FIXME: It might be better to entirely ignore
5994 symbols which are defined in sections which are going to be
5995 discarded. This would require modifying the backend linker for
5996 each backend which might set the SEC_LINK_ONCE flag. If we do
5997 this, we should probably handle SEC_EXCLUDE in the same way. */
5999 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6003 lang_add_output (const char *name
, int from_script
)
6005 /* Make -o on command line override OUTPUT in script. */
6006 if (!had_output_filename
|| !from_script
)
6008 output_filename
= name
;
6009 had_output_filename
= TRUE
;
6013 static lang_output_section_statement_type
*current_section
;
6024 for (l
= 0; l
< 32; l
++)
6026 if (i
>= (unsigned int) x
)
6034 lang_output_section_statement_type
*
6035 lang_enter_output_section_statement (const char *output_section_statement_name
,
6036 etree_type
*address_exp
,
6037 enum section_type sectype
,
6039 etree_type
*subalign
,
6043 lang_output_section_statement_type
*os
;
6045 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6047 current_section
= os
;
6049 if (os
->addr_tree
== NULL
)
6051 os
->addr_tree
= address_exp
;
6053 os
->sectype
= sectype
;
6054 if (sectype
!= noload_section
)
6055 os
->flags
= SEC_NO_FLAGS
;
6057 os
->flags
= SEC_NEVER_LOAD
;
6058 os
->block_value
= 1;
6060 /* Make next things chain into subchain of this. */
6061 push_stat_ptr (&os
->children
);
6063 os
->subsection_alignment
=
6064 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6065 os
->section_alignment
=
6066 topower (exp_get_value_int (align
, -1, "section alignment"));
6068 os
->load_base
= ebase
;
6075 lang_output_statement_type
*new_stmt
;
6077 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6078 new_stmt
->name
= output_filename
;
6082 /* Reset the current counters in the regions. */
6085 lang_reset_memory_regions (void)
6087 lang_memory_region_type
*p
= lang_memory_region_list
;
6089 lang_output_section_statement_type
*os
;
6091 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6093 p
->current
= p
->origin
;
6097 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6101 os
->processed_vma
= FALSE
;
6102 os
->processed_lma
= FALSE
;
6105 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6107 /* Save the last size for possible use by bfd_relax_section. */
6108 o
->rawsize
= o
->size
;
6113 /* Worker for lang_gc_sections_1. */
6116 gc_section_callback (lang_wild_statement_type
*ptr
,
6117 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6119 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6120 void *data ATTRIBUTE_UNUSED
)
6122 /* If the wild pattern was marked KEEP, the member sections
6123 should be as well. */
6124 if (ptr
->keep_sections
)
6125 section
->flags
|= SEC_KEEP
;
6128 /* Iterate over sections marking them against GC. */
6131 lang_gc_sections_1 (lang_statement_union_type
*s
)
6133 for (; s
!= NULL
; s
= s
->header
.next
)
6135 switch (s
->header
.type
)
6137 case lang_wild_statement_enum
:
6138 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6140 case lang_constructors_statement_enum
:
6141 lang_gc_sections_1 (constructor_list
.head
);
6143 case lang_output_section_statement_enum
:
6144 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6146 case lang_group_statement_enum
:
6147 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6156 lang_gc_sections (void)
6158 /* Keep all sections so marked in the link script. */
6160 lang_gc_sections_1 (statement_list
.head
);
6162 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6163 the special case of debug info. (See bfd/stabs.c)
6164 Twiddle the flag here, to simplify later linker code. */
6165 if (link_info
.relocatable
)
6167 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6170 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6171 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6172 sec
->flags
&= ~SEC_EXCLUDE
;
6176 if (link_info
.gc_sections
)
6177 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6180 /* Worker for lang_find_relro_sections_1. */
6183 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6184 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6186 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6189 /* Discarded, excluded and ignored sections effectively have zero
6191 if (section
->output_section
!= NULL
6192 && section
->output_section
->owner
== link_info
.output_bfd
6193 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6194 && !IGNORE_SECTION (section
)
6195 && section
->size
!= 0)
6197 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6198 *has_relro_section
= TRUE
;
6202 /* Iterate over sections for relro sections. */
6205 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6206 bfd_boolean
*has_relro_section
)
6208 if (*has_relro_section
)
6211 for (; s
!= NULL
; s
= s
->header
.next
)
6213 if (s
== expld
.dataseg
.relro_end_stat
)
6216 switch (s
->header
.type
)
6218 case lang_wild_statement_enum
:
6219 walk_wild (&s
->wild_statement
,
6220 find_relro_section_callback
,
6223 case lang_constructors_statement_enum
:
6224 lang_find_relro_sections_1 (constructor_list
.head
,
6227 case lang_output_section_statement_enum
:
6228 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6231 case lang_group_statement_enum
:
6232 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6242 lang_find_relro_sections (void)
6244 bfd_boolean has_relro_section
= FALSE
;
6246 /* Check all sections in the link script. */
6248 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6249 &has_relro_section
);
6251 if (!has_relro_section
)
6252 link_info
.relro
= FALSE
;
6255 /* Relax all sections until bfd_relax_section gives up. */
6258 lang_relax_sections (bfd_boolean need_layout
)
6260 if (RELAXATION_ENABLED
)
6262 /* We may need more than one relaxation pass. */
6263 int i
= link_info
.relax_pass
;
6265 /* The backend can use it to determine the current pass. */
6266 link_info
.relax_pass
= 0;
6270 /* Keep relaxing until bfd_relax_section gives up. */
6271 bfd_boolean relax_again
;
6273 link_info
.relax_trip
= -1;
6276 link_info
.relax_trip
++;
6278 /* Note: pe-dll.c does something like this also. If you find
6279 you need to change this code, you probably need to change
6280 pe-dll.c also. DJ */
6282 /* Do all the assignments with our current guesses as to
6284 lang_do_assignments ();
6286 /* We must do this after lang_do_assignments, because it uses
6288 lang_reset_memory_regions ();
6290 /* Perform another relax pass - this time we know where the
6291 globals are, so can make a better guess. */
6292 relax_again
= FALSE
;
6293 lang_size_sections (&relax_again
, FALSE
);
6295 while (relax_again
);
6297 link_info
.relax_pass
++;
6304 /* Final extra sizing to report errors. */
6305 lang_do_assignments ();
6306 lang_reset_memory_regions ();
6307 lang_size_sections (NULL
, TRUE
);
6314 /* Finalize dynamic list. */
6315 if (link_info
.dynamic_list
)
6316 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6318 current_target
= default_target
;
6320 /* Open the output file. */
6321 lang_for_each_statement (ldlang_open_output
);
6324 ldemul_create_output_section_statements ();
6326 /* Add to the hash table all undefineds on the command line. */
6327 lang_place_undefineds ();
6329 if (!bfd_section_already_linked_table_init ())
6330 einfo (_("%P%F: Failed to create hash table\n"));
6332 /* Create a bfd for each input file. */
6333 current_target
= default_target
;
6334 open_input_bfds (statement_list
.head
, FALSE
);
6336 link_info
.gc_sym_list
= &entry_symbol
;
6337 if (entry_symbol
.name
== NULL
)
6338 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6340 ldemul_after_open ();
6342 bfd_section_already_linked_table_free ();
6344 /* Make sure that we're not mixing architectures. We call this
6345 after all the input files have been opened, but before we do any
6346 other processing, so that any operations merge_private_bfd_data
6347 does on the output file will be known during the rest of the
6351 /* Handle .exports instead of a version script if we're told to do so. */
6352 if (command_line
.version_exports_section
)
6353 lang_do_version_exports_section ();
6355 /* Build all sets based on the information gathered from the input
6357 ldctor_build_sets ();
6359 /* Remove unreferenced sections if asked to. */
6360 lang_gc_sections ();
6362 /* Size up the common data. */
6365 /* Update wild statements. */
6366 update_wild_statements (statement_list
.head
);
6368 /* Run through the contours of the script and attach input sections
6369 to the correct output sections. */
6370 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6372 process_insert_statements ();
6374 /* Find any sections not attached explicitly and handle them. */
6375 lang_place_orphans ();
6377 if (! link_info
.relocatable
)
6381 /* Merge SEC_MERGE sections. This has to be done after GC of
6382 sections, so that GCed sections are not merged, but before
6383 assigning dynamic symbols, since removing whole input sections
6385 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6387 /* Look for a text section and set the readonly attribute in it. */
6388 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6392 if (config
.text_read_only
)
6393 found
->flags
|= SEC_READONLY
;
6395 found
->flags
&= ~SEC_READONLY
;
6399 /* Do anything special before sizing sections. This is where ELF
6400 and other back-ends size dynamic sections. */
6401 ldemul_before_allocation ();
6403 /* We must record the program headers before we try to fix the
6404 section positions, since they will affect SIZEOF_HEADERS. */
6405 lang_record_phdrs ();
6407 /* Check relro sections. */
6408 if (link_info
.relro
&& ! link_info
.relocatable
)
6409 lang_find_relro_sections ();
6411 /* Size up the sections. */
6412 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6414 /* See if anything special should be done now we know how big
6415 everything is. This is where relaxation is done. */
6416 ldemul_after_allocation ();
6418 /* Fix any .startof. or .sizeof. symbols. */
6419 lang_set_startof ();
6421 /* Do all the assignments, now that we know the final resting places
6422 of all the symbols. */
6424 lang_do_assignments ();
6428 /* Make sure that the section addresses make sense. */
6429 if (command_line
.check_section_addresses
)
6430 lang_check_section_addresses ();
6435 /* EXPORTED TO YACC */
6438 lang_add_wild (struct wildcard_spec
*filespec
,
6439 struct wildcard_list
*section_list
,
6440 bfd_boolean keep_sections
)
6442 struct wildcard_list
*curr
, *next
;
6443 lang_wild_statement_type
*new_stmt
;
6445 /* Reverse the list as the parser puts it back to front. */
6446 for (curr
= section_list
, section_list
= NULL
;
6448 section_list
= curr
, curr
= next
)
6450 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6451 placed_commons
= TRUE
;
6454 curr
->next
= section_list
;
6457 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6459 if (strcmp (filespec
->name
, "*") == 0)
6460 filespec
->name
= NULL
;
6461 else if (! wildcardp (filespec
->name
))
6462 lang_has_input_file
= TRUE
;
6465 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6466 new_stmt
->filename
= NULL
;
6467 new_stmt
->filenames_sorted
= FALSE
;
6468 if (filespec
!= NULL
)
6470 new_stmt
->filename
= filespec
->name
;
6471 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6473 new_stmt
->section_list
= section_list
;
6474 new_stmt
->keep_sections
= keep_sections
;
6475 lang_list_init (&new_stmt
->children
);
6476 analyze_walk_wild_section_handler (new_stmt
);
6480 lang_section_start (const char *name
, etree_type
*address
,
6481 const segment_type
*segment
)
6483 lang_address_statement_type
*ad
;
6485 ad
= new_stat (lang_address_statement
, stat_ptr
);
6486 ad
->section_name
= name
;
6487 ad
->address
= address
;
6488 ad
->segment
= segment
;
6491 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6492 because of a -e argument on the command line, or zero if this is
6493 called by ENTRY in a linker script. Command line arguments take
6497 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6499 if (entry_symbol
.name
== NULL
6501 || ! entry_from_cmdline
)
6503 entry_symbol
.name
= name
;
6504 entry_from_cmdline
= cmdline
;
6508 /* Set the default start symbol to NAME. .em files should use this,
6509 not lang_add_entry, to override the use of "start" if neither the
6510 linker script nor the command line specifies an entry point. NAME
6511 must be permanently allocated. */
6513 lang_default_entry (const char *name
)
6515 entry_symbol_default
= name
;
6519 lang_add_target (const char *name
)
6521 lang_target_statement_type
*new_stmt
;
6523 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6524 new_stmt
->target
= name
;
6528 lang_add_map (const char *name
)
6535 map_option_f
= TRUE
;
6543 lang_add_fill (fill_type
*fill
)
6545 lang_fill_statement_type
*new_stmt
;
6547 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6548 new_stmt
->fill
= fill
;
6552 lang_add_data (int type
, union etree_union
*exp
)
6554 lang_data_statement_type
*new_stmt
;
6556 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6557 new_stmt
->exp
= exp
;
6558 new_stmt
->type
= type
;
6561 /* Create a new reloc statement. RELOC is the BFD relocation type to
6562 generate. HOWTO is the corresponding howto structure (we could
6563 look this up, but the caller has already done so). SECTION is the
6564 section to generate a reloc against, or NAME is the name of the
6565 symbol to generate a reloc against. Exactly one of SECTION and
6566 NAME must be NULL. ADDEND is an expression for the addend. */
6569 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6570 reloc_howto_type
*howto
,
6573 union etree_union
*addend
)
6575 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6579 p
->section
= section
;
6581 p
->addend_exp
= addend
;
6583 p
->addend_value
= 0;
6584 p
->output_section
= NULL
;
6585 p
->output_offset
= 0;
6588 lang_assignment_statement_type
*
6589 lang_add_assignment (etree_type
*exp
)
6591 lang_assignment_statement_type
*new_stmt
;
6593 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6594 new_stmt
->exp
= exp
;
6599 lang_add_attribute (enum statement_enum attribute
)
6601 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6605 lang_startup (const char *name
)
6607 if (startup_file
!= NULL
)
6609 einfo (_("%P%F: multiple STARTUP files\n"));
6611 first_file
->filename
= name
;
6612 first_file
->local_sym_name
= name
;
6613 first_file
->real
= TRUE
;
6615 startup_file
= name
;
6619 lang_float (bfd_boolean maybe
)
6621 lang_float_flag
= maybe
;
6625 /* Work out the load- and run-time regions from a script statement, and
6626 store them in *LMA_REGION and *REGION respectively.
6628 MEMSPEC is the name of the run-time region, or the value of
6629 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6630 LMA_MEMSPEC is the name of the load-time region, or null if the
6631 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6632 had an explicit load address.
6634 It is an error to specify both a load region and a load address. */
6637 lang_get_regions (lang_memory_region_type
**region
,
6638 lang_memory_region_type
**lma_region
,
6639 const char *memspec
,
6640 const char *lma_memspec
,
6641 bfd_boolean have_lma
,
6642 bfd_boolean have_vma
)
6644 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6646 /* If no runtime region or VMA has been specified, but the load region
6647 has been specified, then use the load region for the runtime region
6649 if (lma_memspec
!= NULL
6651 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6652 *region
= *lma_region
;
6654 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6656 if (have_lma
&& lma_memspec
!= 0)
6657 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6661 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6662 lang_output_section_phdr_list
*phdrs
,
6663 const char *lma_memspec
)
6665 lang_get_regions (¤t_section
->region
,
6666 ¤t_section
->lma_region
,
6667 memspec
, lma_memspec
,
6668 current_section
->load_base
!= NULL
,
6669 current_section
->addr_tree
!= NULL
);
6671 /* If this section has no load region or base, but has the same
6672 region as the previous section, then propagate the previous
6673 section's load region. */
6675 if (!current_section
->lma_region
&& !current_section
->load_base
6676 && current_section
->region
== current_section
->prev
->region
)
6677 current_section
->lma_region
= current_section
->prev
->lma_region
;
6679 current_section
->fill
= fill
;
6680 current_section
->phdrs
= phdrs
;
6684 /* Create an absolute symbol with the given name with the value of the
6685 address of first byte of the section named.
6687 If the symbol already exists, then do nothing. */
6690 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6692 struct bfd_link_hash_entry
*h
;
6694 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6696 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6698 if (h
->type
== bfd_link_hash_new
6699 || h
->type
== bfd_link_hash_undefined
)
6703 h
->type
= bfd_link_hash_defined
;
6705 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6709 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6711 h
->u
.def
.section
= bfd_abs_section_ptr
;
6715 /* Create an absolute symbol with the given name with the value of the
6716 address of the first byte after the end of the section named.
6718 If the symbol already exists, then do nothing. */
6721 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6723 struct bfd_link_hash_entry
*h
;
6725 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6727 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6729 if (h
->type
== bfd_link_hash_new
6730 || h
->type
== bfd_link_hash_undefined
)
6734 h
->type
= bfd_link_hash_defined
;
6736 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6740 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
6741 + TO_ADDR (sec
->size
));
6743 h
->u
.def
.section
= bfd_abs_section_ptr
;
6748 lang_statement_append (lang_statement_list_type
*list
,
6749 lang_statement_union_type
*element
,
6750 lang_statement_union_type
**field
)
6752 *(list
->tail
) = element
;
6756 /* Set the output format type. -oformat overrides scripts. */
6759 lang_add_output_format (const char *format
,
6764 if (output_target
== NULL
|| !from_script
)
6766 if (command_line
.endian
== ENDIAN_BIG
6769 else if (command_line
.endian
== ENDIAN_LITTLE
6773 output_target
= format
;
6778 lang_add_insert (const char *where
, int is_before
)
6780 lang_insert_statement_type
*new_stmt
;
6782 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
6783 new_stmt
->where
= where
;
6784 new_stmt
->is_before
= is_before
;
6785 saved_script_handle
= previous_script_handle
;
6788 /* Enter a group. This creates a new lang_group_statement, and sets
6789 stat_ptr to build new statements within the group. */
6792 lang_enter_group (void)
6794 lang_group_statement_type
*g
;
6796 g
= new_stat (lang_group_statement
, stat_ptr
);
6797 lang_list_init (&g
->children
);
6798 push_stat_ptr (&g
->children
);
6801 /* Leave a group. This just resets stat_ptr to start writing to the
6802 regular list of statements again. Note that this will not work if
6803 groups can occur inside anything else which can adjust stat_ptr,
6804 but currently they can't. */
6807 lang_leave_group (void)
6812 /* Add a new program header. This is called for each entry in a PHDRS
6813 command in a linker script. */
6816 lang_new_phdr (const char *name
,
6818 bfd_boolean filehdr
,
6823 struct lang_phdr
*n
, **pp
;
6826 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
6829 n
->type
= exp_get_value_int (type
, 0, "program header type");
6830 n
->filehdr
= filehdr
;
6835 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
6837 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6840 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
6842 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported when prior PT_LOAD headers lack them\n"));
6849 /* Record the program header information in the output BFD. FIXME: We
6850 should not be calling an ELF specific function here. */
6853 lang_record_phdrs (void)
6857 lang_output_section_phdr_list
*last
;
6858 struct lang_phdr
*l
;
6859 lang_output_section_statement_type
*os
;
6862 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
6865 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
6872 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6876 lang_output_section_phdr_list
*pl
;
6878 if (os
->constraint
< 0)
6886 if (os
->sectype
== noload_section
6887 || os
->bfd_section
== NULL
6888 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6891 /* Don't add orphans to PT_INTERP header. */
6897 lang_output_section_statement_type
* tmp_os
;
6899 /* If we have not run across a section with a program
6900 header assigned to it yet, then scan forwards to find
6901 one. This prevents inconsistencies in the linker's
6902 behaviour when a script has specified just a single
6903 header and there are sections in that script which are
6904 not assigned to it, and which occur before the first
6905 use of that header. See here for more details:
6906 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
6907 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
6910 last
= tmp_os
->phdrs
;
6914 einfo (_("%F%P: no sections assigned to phdrs\n"));
6919 if (os
->bfd_section
== NULL
)
6922 for (; pl
!= NULL
; pl
= pl
->next
)
6924 if (strcmp (pl
->name
, l
->name
) == 0)
6929 secs
= (asection
**) xrealloc (secs
,
6930 alc
* sizeof (asection
*));
6932 secs
[c
] = os
->bfd_section
;
6939 if (l
->flags
== NULL
)
6942 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6947 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6949 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
6950 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6951 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6952 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6957 /* Make sure all the phdr assignments succeeded. */
6958 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6962 lang_output_section_phdr_list
*pl
;
6964 if (os
->constraint
< 0
6965 || os
->bfd_section
== NULL
)
6968 for (pl
= os
->phdrs
;
6971 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6972 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6973 os
->name
, pl
->name
);
6977 /* Record a list of sections which may not be cross referenced. */
6980 lang_add_nocrossref (lang_nocrossref_type
*l
)
6982 struct lang_nocrossrefs
*n
;
6984 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
6985 n
->next
= nocrossref_list
;
6987 nocrossref_list
= n
;
6989 /* Set notice_all so that we get informed about all symbols. */
6990 link_info
.notice_all
= TRUE
;
6993 /* Overlay handling. We handle overlays with some static variables. */
6995 /* The overlay virtual address. */
6996 static etree_type
*overlay_vma
;
6997 /* And subsection alignment. */
6998 static etree_type
*overlay_subalign
;
7000 /* An expression for the maximum section size seen so far. */
7001 static etree_type
*overlay_max
;
7003 /* A list of all the sections in this overlay. */
7005 struct overlay_list
{
7006 struct overlay_list
*next
;
7007 lang_output_section_statement_type
*os
;
7010 static struct overlay_list
*overlay_list
;
7012 /* Start handling an overlay. */
7015 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7017 /* The grammar should prevent nested overlays from occurring. */
7018 ASSERT (overlay_vma
== NULL
7019 && overlay_subalign
== NULL
7020 && overlay_max
== NULL
);
7022 overlay_vma
= vma_expr
;
7023 overlay_subalign
= subalign
;
7026 /* Start a section in an overlay. We handle this by calling
7027 lang_enter_output_section_statement with the correct VMA.
7028 lang_leave_overlay sets up the LMA and memory regions. */
7031 lang_enter_overlay_section (const char *name
)
7033 struct overlay_list
*n
;
7036 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7037 0, overlay_subalign
, 0, 0);
7039 /* If this is the first section, then base the VMA of future
7040 sections on this one. This will work correctly even if `.' is
7041 used in the addresses. */
7042 if (overlay_list
== NULL
)
7043 overlay_vma
= exp_nameop (ADDR
, name
);
7045 /* Remember the section. */
7046 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7047 n
->os
= current_section
;
7048 n
->next
= overlay_list
;
7051 size
= exp_nameop (SIZEOF
, name
);
7053 /* Arrange to work out the maximum section end address. */
7054 if (overlay_max
== NULL
)
7057 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7060 /* Finish a section in an overlay. There isn't any special to do
7064 lang_leave_overlay_section (fill_type
*fill
,
7065 lang_output_section_phdr_list
*phdrs
)
7072 name
= current_section
->name
;
7074 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7075 region and that no load-time region has been specified. It doesn't
7076 really matter what we say here, since lang_leave_overlay will
7078 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7080 /* Define the magic symbols. */
7082 clean
= (char *) xmalloc (strlen (name
) + 1);
7084 for (s1
= name
; *s1
!= '\0'; s1
++)
7085 if (ISALNUM (*s1
) || *s1
== '_')
7089 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7090 sprintf (buf
, "__load_start_%s", clean
);
7091 lang_add_assignment (exp_provide (buf
,
7092 exp_nameop (LOADADDR
, name
),
7095 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7096 sprintf (buf
, "__load_stop_%s", clean
);
7097 lang_add_assignment (exp_provide (buf
,
7099 exp_nameop (LOADADDR
, name
),
7100 exp_nameop (SIZEOF
, name
)),
7106 /* Finish an overlay. If there are any overlay wide settings, this
7107 looks through all the sections in the overlay and sets them. */
7110 lang_leave_overlay (etree_type
*lma_expr
,
7113 const char *memspec
,
7114 lang_output_section_phdr_list
*phdrs
,
7115 const char *lma_memspec
)
7117 lang_memory_region_type
*region
;
7118 lang_memory_region_type
*lma_region
;
7119 struct overlay_list
*l
;
7120 lang_nocrossref_type
*nocrossref
;
7122 lang_get_regions (®ion
, &lma_region
,
7123 memspec
, lma_memspec
,
7124 lma_expr
!= NULL
, FALSE
);
7128 /* After setting the size of the last section, set '.' to end of the
7130 if (overlay_list
!= NULL
)
7131 overlay_list
->os
->update_dot_tree
7132 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
7137 struct overlay_list
*next
;
7139 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7142 l
->os
->region
= region
;
7143 l
->os
->lma_region
= lma_region
;
7145 /* The first section has the load address specified in the
7146 OVERLAY statement. The rest are worked out from that.
7147 The base address is not needed (and should be null) if
7148 an LMA region was specified. */
7151 l
->os
->load_base
= lma_expr
;
7152 l
->os
->sectype
= normal_section
;
7154 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7155 l
->os
->phdrs
= phdrs
;
7159 lang_nocrossref_type
*nc
;
7161 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7162 nc
->name
= l
->os
->name
;
7163 nc
->next
= nocrossref
;
7172 if (nocrossref
!= NULL
)
7173 lang_add_nocrossref (nocrossref
);
7176 overlay_list
= NULL
;
7180 /* Version handling. This is only useful for ELF. */
7182 /* This global variable holds the version tree that we build. */
7184 struct bfd_elf_version_tree
*lang_elf_version_info
;
7186 /* If PREV is NULL, return first version pattern matching particular symbol.
7187 If PREV is non-NULL, return first version pattern matching particular
7188 symbol after PREV (previously returned by lang_vers_match). */
7190 static struct bfd_elf_version_expr
*
7191 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7192 struct bfd_elf_version_expr
*prev
,
7195 const char *cxx_sym
= sym
;
7196 const char *java_sym
= sym
;
7197 struct bfd_elf_version_expr
*expr
= NULL
;
7199 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7201 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
7205 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7207 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
7212 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7214 struct bfd_elf_version_expr e
;
7216 switch (prev
? prev
->mask
: 0)
7219 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7222 expr
= (struct bfd_elf_version_expr
*)
7223 htab_find ((htab_t
) head
->htab
, &e
);
7224 while (expr
&& strcmp (expr
->pattern
, sym
) == 0)
7225 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7231 case BFD_ELF_VERSION_C_TYPE
:
7232 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7234 e
.pattern
= cxx_sym
;
7235 expr
= (struct bfd_elf_version_expr
*)
7236 htab_find ((htab_t
) head
->htab
, &e
);
7237 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7238 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7244 case BFD_ELF_VERSION_CXX_TYPE
:
7245 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7247 e
.pattern
= java_sym
;
7248 expr
= (struct bfd_elf_version_expr
*)
7249 htab_find ((htab_t
) head
->htab
, &e
);
7250 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7251 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7262 /* Finally, try the wildcards. */
7263 if (prev
== NULL
|| prev
->literal
)
7264 expr
= head
->remaining
;
7267 for (; expr
; expr
= expr
->next
)
7274 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7277 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7279 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7283 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7289 free ((char *) cxx_sym
);
7290 if (java_sym
!= sym
)
7291 free ((char *) java_sym
);
7295 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7296 return a pointer to the symbol name with any backslash quotes removed. */
7299 realsymbol (const char *pattern
)
7302 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7303 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7305 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7307 /* It is a glob pattern only if there is no preceding
7311 /* Remove the preceding backslash. */
7318 if (*p
== '?' || *p
== '*' || *p
== '[')
7325 backslash
= *p
== '\\';
7341 /* This is called for each variable name or match expression. NEW_NAME is
7342 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7343 pattern to be matched against symbol names. */
7345 struct bfd_elf_version_expr
*
7346 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7347 const char *new_name
,
7349 bfd_boolean literal_p
)
7351 struct bfd_elf_version_expr
*ret
;
7353 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7357 ret
->literal
= TRUE
;
7358 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7359 if (ret
->pattern
== NULL
)
7361 ret
->pattern
= new_name
;
7362 ret
->literal
= FALSE
;
7365 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7366 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7367 else if (strcasecmp (lang
, "C++") == 0)
7368 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7369 else if (strcasecmp (lang
, "Java") == 0)
7370 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7373 einfo (_("%X%P: unknown language `%s' in version information\n"),
7375 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7378 return ldemul_new_vers_pattern (ret
);
7381 /* This is called for each set of variable names and match
7384 struct bfd_elf_version_tree
*
7385 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7386 struct bfd_elf_version_expr
*locals
)
7388 struct bfd_elf_version_tree
*ret
;
7390 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7391 ret
->globals
.list
= globals
;
7392 ret
->locals
.list
= locals
;
7393 ret
->match
= lang_vers_match
;
7394 ret
->name_indx
= (unsigned int) -1;
7398 /* This static variable keeps track of version indices. */
7400 static int version_index
;
7403 version_expr_head_hash (const void *p
)
7405 const struct bfd_elf_version_expr
*e
=
7406 (const struct bfd_elf_version_expr
*) p
;
7408 return htab_hash_string (e
->pattern
);
7412 version_expr_head_eq (const void *p1
, const void *p2
)
7414 const struct bfd_elf_version_expr
*e1
=
7415 (const struct bfd_elf_version_expr
*) p1
;
7416 const struct bfd_elf_version_expr
*e2
=
7417 (const struct bfd_elf_version_expr
*) p2
;
7419 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7423 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7426 struct bfd_elf_version_expr
*e
, *next
;
7427 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7429 for (e
= head
->list
; e
; e
= e
->next
)
7433 head
->mask
|= e
->mask
;
7438 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7439 version_expr_head_eq
, NULL
);
7440 list_loc
= &head
->list
;
7441 remaining_loc
= &head
->remaining
;
7442 for (e
= head
->list
; e
; e
= next
)
7448 remaining_loc
= &e
->next
;
7452 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7456 struct bfd_elf_version_expr
*e1
, *last
;
7458 e1
= (struct bfd_elf_version_expr
*) *loc
;
7462 if (e1
->mask
== e
->mask
)
7470 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7474 /* This is a duplicate. */
7475 /* FIXME: Memory leak. Sometimes pattern is not
7476 xmalloced alone, but in larger chunk of memory. */
7477 /* free (e->pattern); */
7482 e
->next
= last
->next
;
7490 list_loc
= &e
->next
;
7494 *remaining_loc
= NULL
;
7495 *list_loc
= head
->remaining
;
7498 head
->remaining
= head
->list
;
7501 /* This is called when we know the name and dependencies of the
7505 lang_register_vers_node (const char *name
,
7506 struct bfd_elf_version_tree
*version
,
7507 struct bfd_elf_version_deps
*deps
)
7509 struct bfd_elf_version_tree
*t
, **pp
;
7510 struct bfd_elf_version_expr
*e1
;
7515 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
7516 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
7518 einfo (_("%X%P: anonymous version tag cannot be combined"
7519 " with other version tags\n"));
7524 /* Make sure this node has a unique name. */
7525 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7526 if (strcmp (t
->name
, name
) == 0)
7527 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7529 lang_finalize_version_expr_head (&version
->globals
);
7530 lang_finalize_version_expr_head (&version
->locals
);
7532 /* Check the global and local match names, and make sure there
7533 aren't any duplicates. */
7535 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7537 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7539 struct bfd_elf_version_expr
*e2
;
7541 if (t
->locals
.htab
&& e1
->literal
)
7543 e2
= (struct bfd_elf_version_expr
*)
7544 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7545 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7547 if (e1
->mask
== e2
->mask
)
7548 einfo (_("%X%P: duplicate expression `%s'"
7549 " in version information\n"), e1
->pattern
);
7553 else if (!e1
->literal
)
7554 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7555 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7556 && e1
->mask
== e2
->mask
)
7557 einfo (_("%X%P: duplicate expression `%s'"
7558 " in version information\n"), e1
->pattern
);
7562 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7564 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7566 struct bfd_elf_version_expr
*e2
;
7568 if (t
->globals
.htab
&& e1
->literal
)
7570 e2
= (struct bfd_elf_version_expr
*)
7571 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7572 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7574 if (e1
->mask
== e2
->mask
)
7575 einfo (_("%X%P: duplicate expression `%s'"
7576 " in version information\n"),
7581 else if (!e1
->literal
)
7582 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7583 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7584 && e1
->mask
== e2
->mask
)
7585 einfo (_("%X%P: duplicate expression `%s'"
7586 " in version information\n"), e1
->pattern
);
7590 version
->deps
= deps
;
7591 version
->name
= name
;
7592 if (name
[0] != '\0')
7595 version
->vernum
= version_index
;
7598 version
->vernum
= 0;
7600 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7605 /* This is called when we see a version dependency. */
7607 struct bfd_elf_version_deps
*
7608 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7610 struct bfd_elf_version_deps
*ret
;
7611 struct bfd_elf_version_tree
*t
;
7613 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7616 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7618 if (strcmp (t
->name
, name
) == 0)
7620 ret
->version_needed
= t
;
7625 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7627 ret
->version_needed
= NULL
;
7632 lang_do_version_exports_section (void)
7634 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7636 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7638 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7646 contents
= (char *) xmalloc (len
);
7647 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7648 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7651 while (p
< contents
+ len
)
7653 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7654 p
= strchr (p
, '\0') + 1;
7657 /* Do not free the contents, as we used them creating the regex. */
7659 /* Do not include this section in the link. */
7660 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7663 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7664 lang_register_vers_node (command_line
.version_exports_section
,
7665 lang_new_vers_node (greg
, lreg
), NULL
);
7669 lang_add_unique (const char *name
)
7671 struct unique_sections
*ent
;
7673 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7674 if (strcmp (ent
->name
, name
) == 0)
7677 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7678 ent
->name
= xstrdup (name
);
7679 ent
->next
= unique_section_list
;
7680 unique_section_list
= ent
;
7683 /* Append the list of dynamic symbols to the existing one. */
7686 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7688 if (link_info
.dynamic_list
)
7690 struct bfd_elf_version_expr
*tail
;
7691 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7693 tail
->next
= link_info
.dynamic_list
->head
.list
;
7694 link_info
.dynamic_list
->head
.list
= dynamic
;
7698 struct bfd_elf_dynamic_list
*d
;
7700 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
7701 d
->head
.list
= dynamic
;
7702 d
->match
= lang_vers_match
;
7703 link_info
.dynamic_list
= d
;
7707 /* Append the list of C++ typeinfo dynamic symbols to the existing
7711 lang_append_dynamic_list_cpp_typeinfo (void)
7713 const char * symbols
[] =
7715 "typeinfo name for*",
7718 struct bfd_elf_version_expr
*dynamic
= NULL
;
7721 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7722 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7725 lang_append_dynamic_list (dynamic
);
7728 /* Append the list of C++ operator new and delete dynamic symbols to the
7732 lang_append_dynamic_list_cpp_new (void)
7734 const char * symbols
[] =
7739 struct bfd_elf_version_expr
*dynamic
= NULL
;
7742 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7743 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7746 lang_append_dynamic_list (dynamic
);