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, 2011, 2012
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 "filenames.h"
27 #include "safe-ctype.h"
47 #endif /* ENABLE_PLUGINS */
50 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
53 /* Locals variables. */
54 static struct obstack stat_obstack
;
55 static struct obstack map_obstack
;
57 #define obstack_chunk_alloc xmalloc
58 #define obstack_chunk_free free
59 static const char *entry_symbol_default
= "start";
60 static bfd_boolean placed_commons
= FALSE
;
61 static bfd_boolean stripped_excluded_sections
= FALSE
;
62 static lang_output_section_statement_type
*default_common_section
;
63 static bfd_boolean map_option_f
;
64 static bfd_vma print_dot
;
65 static lang_input_statement_type
*first_file
;
66 static const char *current_target
;
67 static lang_statement_list_type statement_list
;
68 static struct bfd_hash_table lang_definedness_table
;
69 static lang_statement_list_type
*stat_save
[10];
70 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
71 static struct unique_sections
*unique_section_list
;
73 /* Forward declarations. */
74 static void exp_init_os (etree_type
*);
75 static void init_map_userdata (bfd
*, asection
*, void *);
76 static lang_input_statement_type
*lookup_name (const char *);
77 static struct bfd_hash_entry
*lang_definedness_newfunc
78 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
79 static void insert_undefined (const char *);
80 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
81 static void print_statement (lang_statement_union_type
*,
82 lang_output_section_statement_type
*);
83 static void print_statement_list (lang_statement_union_type
*,
84 lang_output_section_statement_type
*);
85 static void print_statements (void);
86 static void print_input_section (asection
*, bfd_boolean
);
87 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
88 static void lang_record_phdrs (void);
89 static void lang_do_version_exports_section (void);
90 static void lang_finalize_version_expr_head
91 (struct bfd_elf_version_expr_head
*);
93 /* Exported variables. */
94 const char *output_target
;
95 lang_output_section_statement_type
*abs_output_section
;
96 lang_statement_list_type lang_output_section_statement
;
97 lang_statement_list_type
*stat_ptr
= &statement_list
;
98 lang_statement_list_type file_chain
= { NULL
, NULL
};
99 lang_statement_list_type input_file_chain
;
100 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
101 const char *entry_section
= ".text";
102 struct lang_input_statement_flags input_flags
;
103 bfd_boolean entry_from_cmdline
;
104 bfd_boolean undef_from_cmdline
;
105 bfd_boolean lang_has_input_file
= FALSE
;
106 bfd_boolean had_output_filename
= FALSE
;
107 bfd_boolean lang_float_flag
= FALSE
;
108 bfd_boolean delete_output_file_on_failure
= FALSE
;
109 struct lang_phdr
*lang_phdr_list
;
110 struct lang_nocrossrefs
*nocrossref_list
;
112 /* Functions that traverse the linker script and might evaluate
113 DEFINED() need to increment this. */
114 int lang_statement_iteration
= 0;
116 etree_type
*base
; /* Relocation base - or null */
118 /* Return TRUE if the PATTERN argument is a wildcard pattern.
119 Although backslashes are treated specially if a pattern contains
120 wildcards, we do not consider the mere presence of a backslash to
121 be enough to cause the pattern to be treated as a wildcard.
122 That lets us handle DOS filenames more naturally. */
123 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
125 #define new_stat(x, y) \
126 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
128 #define outside_section_address(q) \
129 ((q)->output_offset + (q)->output_section->vma)
131 #define outside_symbol_address(q) \
132 ((q)->value + outside_section_address (q->section))
134 #define SECTION_NAME_MAP_LENGTH (16)
137 stat_alloc (size_t size
)
139 return obstack_alloc (&stat_obstack
, size
);
143 name_match (const char *pattern
, const char *name
)
145 if (wildcardp (pattern
))
146 return fnmatch (pattern
, name
, 0);
147 return strcmp (pattern
, name
);
150 /* If PATTERN is of the form archive:file, return a pointer to the
151 separator. If not, return NULL. */
154 archive_path (const char *pattern
)
158 if (link_info
.path_separator
== 0)
161 p
= strchr (pattern
, link_info
.path_separator
);
162 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
163 if (p
== NULL
|| link_info
.path_separator
!= ':')
166 /* Assume a match on the second char is part of drive specifier,
167 as in "c:\silly.dos". */
168 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
169 p
= strchr (p
+ 1, link_info
.path_separator
);
174 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
175 return whether F matches FILE_SPEC. */
178 input_statement_is_archive_path (const char *file_spec
, char *sep
,
179 lang_input_statement_type
*f
)
181 bfd_boolean match
= FALSE
;
184 || name_match (sep
+ 1, f
->filename
) == 0)
185 && ((sep
!= file_spec
)
186 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
190 if (sep
!= file_spec
)
192 const char *aname
= f
->the_bfd
->my_archive
->filename
;
194 match
= name_match (file_spec
, aname
) == 0;
195 *sep
= link_info
.path_separator
;
202 unique_section_p (const asection
*sec
,
203 const lang_output_section_statement_type
*os
)
205 struct unique_sections
*unam
;
208 if (link_info
.relocatable
209 && sec
->owner
!= NULL
210 && bfd_is_group_section (sec
->owner
, sec
))
212 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
215 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
216 if (name_match (unam
->name
, secnam
) == 0)
222 /* Generic traversal routines for finding matching sections. */
224 /* Try processing a section against a wildcard. This just calls
225 the callback unless the filename exclusion list is present
226 and excludes the file. It's hardly ever present so this
227 function is very fast. */
230 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
231 lang_input_statement_type
*file
,
233 struct wildcard_list
*sec
,
237 struct name_list
*list_tmp
;
239 /* Don't process sections from files which were excluded. */
240 for (list_tmp
= sec
->spec
.exclude_name_list
;
242 list_tmp
= list_tmp
->next
)
244 char *p
= archive_path (list_tmp
->name
);
248 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
252 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
255 /* FIXME: Perhaps remove the following at some stage? Matching
256 unadorned archives like this was never documented and has
257 been superceded by the archive:path syntax. */
258 else if (file
->the_bfd
!= NULL
259 && file
->the_bfd
->my_archive
!= NULL
260 && name_match (list_tmp
->name
,
261 file
->the_bfd
->my_archive
->filename
) == 0)
265 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
268 /* Lowest common denominator routine that can handle everything correctly,
272 walk_wild_section_general (lang_wild_statement_type
*ptr
,
273 lang_input_statement_type
*file
,
278 struct wildcard_list
*sec
;
280 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
282 sec
= ptr
->section_list
;
284 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
288 bfd_boolean skip
= FALSE
;
290 if (sec
->spec
.name
!= NULL
)
292 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
294 skip
= name_match (sec
->spec
.name
, sname
) != 0;
298 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
305 /* Routines to find a single section given its name. If there's more
306 than one section with that name, we report that. */
310 asection
*found_section
;
311 bfd_boolean multiple_sections_found
;
312 } section_iterator_callback_data
;
315 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
317 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
319 if (d
->found_section
!= NULL
)
321 d
->multiple_sections_found
= TRUE
;
325 d
->found_section
= s
;
330 find_section (lang_input_statement_type
*file
,
331 struct wildcard_list
*sec
,
332 bfd_boolean
*multiple_sections_found
)
334 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
336 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
337 section_iterator_callback
, &cb_data
);
338 *multiple_sections_found
= cb_data
.multiple_sections_found
;
339 return cb_data
.found_section
;
342 /* Code for handling simple wildcards without going through fnmatch,
343 which can be expensive because of charset translations etc. */
345 /* A simple wild is a literal string followed by a single '*',
346 where the literal part is at least 4 characters long. */
349 is_simple_wild (const char *name
)
351 size_t len
= strcspn (name
, "*?[");
352 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
356 match_simple_wild (const char *pattern
, const char *name
)
358 /* The first four characters of the pattern are guaranteed valid
359 non-wildcard characters. So we can go faster. */
360 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
361 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
366 while (*pattern
!= '*')
367 if (*name
++ != *pattern
++)
373 /* Return the numerical value of the init_priority attribute from
374 section name NAME. */
377 get_init_priority (const char *name
)
380 unsigned long init_priority
;
382 /* GCC uses the following section names for the init_priority
383 attribute with numerical values 101 and 65535 inclusive. A
384 lower value means a higher priority.
386 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
387 decimal numerical value of the init_priority attribute.
388 The order of execution in .init_array is forward and
389 .fini_array is backward.
390 2: .ctors.NNNN/.ctors.NNNN: Where NNNN is 65535 minus the
391 decimal numerical value of the init_priority attribute.
392 The order of execution in .ctors is backward and .dtors
395 if (strncmp (name
, ".init_array.", 12) == 0
396 || strncmp (name
, ".fini_array.", 12) == 0)
398 init_priority
= strtoul (name
+ 12, &end
, 10);
399 return *end
? 0 : init_priority
;
401 else if (strncmp (name
, ".ctors.", 7) == 0
402 || strncmp (name
, ".dtors.", 7) == 0)
404 init_priority
= strtoul (name
+ 7, &end
, 10);
405 return *end
? 0 : 65535 - init_priority
;
411 /* Compare sections ASEC and BSEC according to SORT. */
414 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
417 unsigned long ainit_priority
, binit_priority
;
424 case by_init_priority
:
426 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
428 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
429 if (ainit_priority
== 0 || binit_priority
== 0)
431 ret
= ainit_priority
- binit_priority
;
437 case by_alignment_name
:
438 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
439 - bfd_section_alignment (asec
->owner
, asec
));
446 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
447 bfd_get_section_name (bsec
->owner
, bsec
));
450 case by_name_alignment
:
451 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
452 bfd_get_section_name (bsec
->owner
, bsec
));
458 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
459 - bfd_section_alignment (asec
->owner
, asec
));
466 /* Build a Binary Search Tree to sort sections, unlike insertion sort
467 used in wild_sort(). BST is considerably faster if the number of
468 of sections are large. */
470 static lang_section_bst_type
**
471 wild_sort_fast (lang_wild_statement_type
*wild
,
472 struct wildcard_list
*sec
,
473 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
476 lang_section_bst_type
**tree
;
479 if (!wild
->filenames_sorted
480 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
482 /* Append at the right end of tree. */
484 tree
= &((*tree
)->right
);
490 /* Find the correct node to append this section. */
491 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
492 tree
= &((*tree
)->left
);
494 tree
= &((*tree
)->right
);
500 /* Use wild_sort_fast to build a BST to sort sections. */
503 output_section_callback_fast (lang_wild_statement_type
*ptr
,
504 struct wildcard_list
*sec
,
506 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
507 lang_input_statement_type
*file
,
510 lang_section_bst_type
*node
;
511 lang_section_bst_type
**tree
;
512 lang_output_section_statement_type
*os
;
514 os
= (lang_output_section_statement_type
*) output
;
516 if (unique_section_p (section
, os
))
519 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
522 node
->section
= section
;
524 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
529 /* Convert a sorted sections' BST back to list form. */
532 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
533 lang_section_bst_type
*tree
,
537 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
539 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
540 (lang_output_section_statement_type
*) output
);
543 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
548 /* Specialized, optimized routines for handling different kinds of
552 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
553 lang_input_statement_type
*file
,
557 /* We can just do a hash lookup for the section with the right name.
558 But if that lookup discovers more than one section with the name
559 (should be rare), we fall back to the general algorithm because
560 we would otherwise have to sort the sections to make sure they
561 get processed in the bfd's order. */
562 bfd_boolean multiple_sections_found
;
563 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
564 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
566 if (multiple_sections_found
)
567 walk_wild_section_general (ptr
, file
, callback
, data
);
569 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
573 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
574 lang_input_statement_type
*file
,
579 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
581 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
583 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
584 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
587 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
592 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
593 lang_input_statement_type
*file
,
598 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
599 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
600 bfd_boolean multiple_sections_found
;
601 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
603 if (multiple_sections_found
)
605 walk_wild_section_general (ptr
, file
, callback
, data
);
609 /* Note that if the section was not found, s0 is NULL and
610 we'll simply never succeed the s == s0 test below. */
611 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
613 /* Recall that in this code path, a section cannot satisfy more
614 than one spec, so if s == s0 then it cannot match
617 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
620 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
621 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
624 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
631 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
632 lang_input_statement_type
*file
,
637 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
638 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
639 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
640 bfd_boolean multiple_sections_found
;
641 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
643 if (multiple_sections_found
)
645 walk_wild_section_general (ptr
, file
, callback
, data
);
649 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
652 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
655 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
656 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
659 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
662 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
664 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
672 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
673 lang_input_statement_type
*file
,
678 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
679 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
680 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
681 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
682 bfd_boolean multiple_sections_found
;
683 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
685 if (multiple_sections_found
)
687 walk_wild_section_general (ptr
, file
, callback
, data
);
691 s1
= find_section (file
, sec1
, &multiple_sections_found
);
692 if (multiple_sections_found
)
694 walk_wild_section_general (ptr
, file
, callback
, data
);
698 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
701 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
704 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
707 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
708 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
712 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
716 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
718 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
726 walk_wild_section (lang_wild_statement_type
*ptr
,
727 lang_input_statement_type
*file
,
731 if (file
->flags
.just_syms
)
734 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
737 /* Returns TRUE when name1 is a wildcard spec that might match
738 something name2 can match. We're conservative: we return FALSE
739 only if the prefixes of name1 and name2 are different up to the
740 first wildcard character. */
743 wild_spec_can_overlap (const char *name1
, const char *name2
)
745 size_t prefix1_len
= strcspn (name1
, "?*[");
746 size_t prefix2_len
= strcspn (name2
, "?*[");
747 size_t min_prefix_len
;
749 /* Note that if there is no wildcard character, then we treat the
750 terminating 0 as part of the prefix. Thus ".text" won't match
751 ".text." or ".text.*", for example. */
752 if (name1
[prefix1_len
] == '\0')
754 if (name2
[prefix2_len
] == '\0')
757 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
759 return memcmp (name1
, name2
, min_prefix_len
) == 0;
762 /* Select specialized code to handle various kinds of wildcard
766 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
769 int wild_name_count
= 0;
770 struct wildcard_list
*sec
;
774 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
775 ptr
->handler_data
[0] = NULL
;
776 ptr
->handler_data
[1] = NULL
;
777 ptr
->handler_data
[2] = NULL
;
778 ptr
->handler_data
[3] = NULL
;
781 /* Count how many wildcard_specs there are, and how many of those
782 actually use wildcards in the name. Also, bail out if any of the
783 wildcard names are NULL. (Can this actually happen?
784 walk_wild_section used to test for it.) And bail out if any
785 of the wildcards are more complex than a simple string
786 ending in a single '*'. */
787 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
790 if (sec
->spec
.name
== NULL
)
792 if (wildcardp (sec
->spec
.name
))
795 if (!is_simple_wild (sec
->spec
.name
))
800 /* The zero-spec case would be easy to optimize but it doesn't
801 happen in practice. Likewise, more than 4 specs doesn't
802 happen in practice. */
803 if (sec_count
== 0 || sec_count
> 4)
806 /* Check that no two specs can match the same section. */
807 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
809 struct wildcard_list
*sec2
;
810 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
812 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
817 signature
= (sec_count
<< 8) + wild_name_count
;
821 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
824 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
827 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
830 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
833 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
839 /* Now fill the data array with pointers to the specs, first the
840 specs with non-wildcard names, then the specs with wildcard
841 names. It's OK to process the specs in different order from the
842 given order, because we've already determined that no section
843 will match more than one spec. */
845 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
846 if (!wildcardp (sec
->spec
.name
))
847 ptr
->handler_data
[data_counter
++] = sec
;
848 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
849 if (wildcardp (sec
->spec
.name
))
850 ptr
->handler_data
[data_counter
++] = sec
;
853 /* Handle a wild statement for a single file F. */
856 walk_wild_file (lang_wild_statement_type
*s
,
857 lang_input_statement_type
*f
,
861 if (f
->the_bfd
== NULL
862 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
863 walk_wild_section (s
, f
, callback
, data
);
868 /* This is an archive file. We must map each member of the
869 archive separately. */
870 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
871 while (member
!= NULL
)
873 /* When lookup_name is called, it will call the add_symbols
874 entry point for the archive. For each element of the
875 archive which is included, BFD will call ldlang_add_file,
876 which will set the usrdata field of the member to the
877 lang_input_statement. */
878 if (member
->usrdata
!= NULL
)
880 walk_wild_section (s
,
881 (lang_input_statement_type
*) member
->usrdata
,
885 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
891 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
893 const char *file_spec
= s
->filename
;
896 if (file_spec
== NULL
)
898 /* Perform the iteration over all files in the list. */
899 LANG_FOR_EACH_INPUT_STATEMENT (f
)
901 walk_wild_file (s
, f
, callback
, data
);
904 else if ((p
= archive_path (file_spec
)) != NULL
)
906 LANG_FOR_EACH_INPUT_STATEMENT (f
)
908 if (input_statement_is_archive_path (file_spec
, p
, f
))
909 walk_wild_file (s
, f
, callback
, data
);
912 else if (wildcardp (file_spec
))
914 LANG_FOR_EACH_INPUT_STATEMENT (f
)
916 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
917 walk_wild_file (s
, f
, callback
, data
);
922 lang_input_statement_type
*f
;
924 /* Perform the iteration over a single file. */
925 f
= lookup_name (file_spec
);
927 walk_wild_file (s
, f
, callback
, data
);
931 /* lang_for_each_statement walks the parse tree and calls the provided
932 function for each node, except those inside output section statements
933 with constraint set to -1. */
936 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
937 lang_statement_union_type
*s
)
939 for (; s
!= NULL
; s
= s
->header
.next
)
943 switch (s
->header
.type
)
945 case lang_constructors_statement_enum
:
946 lang_for_each_statement_worker (func
, constructor_list
.head
);
948 case lang_output_section_statement_enum
:
949 if (s
->output_section_statement
.constraint
!= -1)
950 lang_for_each_statement_worker
951 (func
, s
->output_section_statement
.children
.head
);
953 case lang_wild_statement_enum
:
954 lang_for_each_statement_worker (func
,
955 s
->wild_statement
.children
.head
);
957 case lang_group_statement_enum
:
958 lang_for_each_statement_worker (func
,
959 s
->group_statement
.children
.head
);
961 case lang_data_statement_enum
:
962 case lang_reloc_statement_enum
:
963 case lang_object_symbols_statement_enum
:
964 case lang_output_statement_enum
:
965 case lang_target_statement_enum
:
966 case lang_input_section_enum
:
967 case lang_input_statement_enum
:
968 case lang_assignment_statement_enum
:
969 case lang_padding_statement_enum
:
970 case lang_address_statement_enum
:
971 case lang_fill_statement_enum
:
972 case lang_insert_statement_enum
:
982 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
984 lang_for_each_statement_worker (func
, statement_list
.head
);
987 /*----------------------------------------------------------------------*/
990 lang_list_init (lang_statement_list_type
*list
)
993 list
->tail
= &list
->head
;
997 push_stat_ptr (lang_statement_list_type
*new_ptr
)
999 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1001 *stat_save_ptr
++ = stat_ptr
;
1008 if (stat_save_ptr
<= stat_save
)
1010 stat_ptr
= *--stat_save_ptr
;
1013 /* Build a new statement node for the parse tree. */
1015 static lang_statement_union_type
*
1016 new_statement (enum statement_enum type
,
1018 lang_statement_list_type
*list
)
1020 lang_statement_union_type
*new_stmt
;
1022 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1023 new_stmt
->header
.type
= type
;
1024 new_stmt
->header
.next
= NULL
;
1025 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1029 /* Build a new input file node for the language. There are several
1030 ways in which we treat an input file, eg, we only look at symbols,
1031 or prefix it with a -l etc.
1033 We can be supplied with requests for input files more than once;
1034 they may, for example be split over several lines like foo.o(.text)
1035 foo.o(.data) etc, so when asked for a file we check that we haven't
1036 got it already so we don't duplicate the bfd. */
1038 static lang_input_statement_type
*
1039 new_afile (const char *name
,
1040 lang_input_file_enum_type file_type
,
1042 bfd_boolean add_to_list
)
1044 lang_input_statement_type
*p
;
1046 lang_has_input_file
= TRUE
;
1049 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1052 p
= (lang_input_statement_type
*)
1053 stat_alloc (sizeof (lang_input_statement_type
));
1054 p
->header
.type
= lang_input_statement_enum
;
1055 p
->header
.next
= NULL
;
1058 memset (&p
->the_bfd
, 0,
1059 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1061 p
->flags
.dynamic
= input_flags
.dynamic
;
1062 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1063 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1064 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1065 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1067 if (file_type
== lang_input_file_is_l_enum
1068 && name
[0] == ':' && name
[1] != '\0')
1070 file_type
= lang_input_file_is_search_file_enum
;
1076 case lang_input_file_is_symbols_only_enum
:
1078 p
->local_sym_name
= name
;
1079 p
->flags
.real
= TRUE
;
1080 p
->flags
.just_syms
= TRUE
;
1082 case lang_input_file_is_fake_enum
:
1084 p
->local_sym_name
= name
;
1086 case lang_input_file_is_l_enum
:
1088 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1089 p
->flags
.maybe_archive
= TRUE
;
1090 p
->flags
.real
= TRUE
;
1091 p
->flags
.search_dirs
= TRUE
;
1093 case lang_input_file_is_marker_enum
:
1095 p
->local_sym_name
= name
;
1096 p
->flags
.search_dirs
= TRUE
;
1098 case lang_input_file_is_search_file_enum
:
1100 p
->local_sym_name
= name
;
1101 p
->flags
.real
= TRUE
;
1102 p
->flags
.search_dirs
= TRUE
;
1104 case lang_input_file_is_file_enum
:
1106 p
->local_sym_name
= name
;
1107 p
->flags
.real
= TRUE
;
1113 lang_statement_append (&input_file_chain
,
1114 (lang_statement_union_type
*) p
,
1115 &p
->next_real_file
);
1119 lang_input_statement_type
*
1120 lang_add_input_file (const char *name
,
1121 lang_input_file_enum_type file_type
,
1124 return new_afile (name
, file_type
, target
, TRUE
);
1127 struct out_section_hash_entry
1129 struct bfd_hash_entry root
;
1130 lang_statement_union_type s
;
1133 /* The hash table. */
1135 static struct bfd_hash_table output_section_statement_table
;
1137 /* Support routines for the hash table used by lang_output_section_find,
1138 initialize the table, fill in an entry and remove the table. */
1140 static struct bfd_hash_entry
*
1141 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1142 struct bfd_hash_table
*table
,
1145 lang_output_section_statement_type
**nextp
;
1146 struct out_section_hash_entry
*ret
;
1150 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1156 entry
= bfd_hash_newfunc (entry
, table
, string
);
1160 ret
= (struct out_section_hash_entry
*) entry
;
1161 memset (&ret
->s
, 0, sizeof (ret
->s
));
1162 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1163 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1164 ret
->s
.output_section_statement
.section_alignment
= -1;
1165 ret
->s
.output_section_statement
.block_value
= 1;
1166 lang_list_init (&ret
->s
.output_section_statement
.children
);
1167 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1169 /* For every output section statement added to the list, except the
1170 first one, lang_output_section_statement.tail points to the "next"
1171 field of the last element of the list. */
1172 if (lang_output_section_statement
.head
!= NULL
)
1173 ret
->s
.output_section_statement
.prev
1174 = ((lang_output_section_statement_type
*)
1175 ((char *) lang_output_section_statement
.tail
1176 - offsetof (lang_output_section_statement_type
, next
)));
1178 /* GCC's strict aliasing rules prevent us from just casting the
1179 address, so we store the pointer in a variable and cast that
1181 nextp
= &ret
->s
.output_section_statement
.next
;
1182 lang_statement_append (&lang_output_section_statement
,
1184 (lang_statement_union_type
**) nextp
);
1189 output_section_statement_table_init (void)
1191 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1192 output_section_statement_newfunc
,
1193 sizeof (struct out_section_hash_entry
),
1195 einfo (_("%P%F: can not create hash table: %E\n"));
1199 output_section_statement_table_free (void)
1201 bfd_hash_table_free (&output_section_statement_table
);
1204 /* Build enough state so that the parser can build its tree. */
1209 obstack_begin (&stat_obstack
, 1000);
1211 stat_ptr
= &statement_list
;
1213 output_section_statement_table_init ();
1215 lang_list_init (stat_ptr
);
1217 lang_list_init (&input_file_chain
);
1218 lang_list_init (&lang_output_section_statement
);
1219 lang_list_init (&file_chain
);
1220 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1222 abs_output_section
=
1223 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1225 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1227 /* The value "3" is ad-hoc, somewhat related to the expected number of
1228 DEFINED expressions in a linker script. For most default linker
1229 scripts, there are none. Why a hash table then? Well, it's somewhat
1230 simpler to re-use working machinery than using a linked list in terms
1231 of code-complexity here in ld, besides the initialization which just
1232 looks like other code here. */
1233 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1234 lang_definedness_newfunc
,
1235 sizeof (struct lang_definedness_hash_entry
),
1237 einfo (_("%P%F: can not create hash table: %E\n"));
1243 output_section_statement_table_free ();
1246 /*----------------------------------------------------------------------
1247 A region is an area of memory declared with the
1248 MEMORY { name:org=exp, len=exp ... }
1251 We maintain a list of all the regions here.
1253 If no regions are specified in the script, then the default is used
1254 which is created when looked up to be the entire data space.
1256 If create is true we are creating a region inside a MEMORY block.
1257 In this case it is probably an error to create a region that has
1258 already been created. If we are not inside a MEMORY block it is
1259 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1260 and so we issue a warning.
1262 Each region has at least one name. The first name is either
1263 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1264 alias names to an existing region within a script with
1265 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1268 static lang_memory_region_type
*lang_memory_region_list
;
1269 static lang_memory_region_type
**lang_memory_region_list_tail
1270 = &lang_memory_region_list
;
1272 lang_memory_region_type
*
1273 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1275 lang_memory_region_name
*n
;
1276 lang_memory_region_type
*r
;
1277 lang_memory_region_type
*new_region
;
1279 /* NAME is NULL for LMA memspecs if no region was specified. */
1283 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1284 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1285 if (strcmp (n
->name
, name
) == 0)
1288 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1293 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1294 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1297 new_region
= (lang_memory_region_type
*)
1298 stat_alloc (sizeof (lang_memory_region_type
));
1300 new_region
->name_list
.name
= xstrdup (name
);
1301 new_region
->name_list
.next
= NULL
;
1302 new_region
->next
= NULL
;
1303 new_region
->origin
= 0;
1304 new_region
->length
= ~(bfd_size_type
) 0;
1305 new_region
->current
= 0;
1306 new_region
->last_os
= NULL
;
1307 new_region
->flags
= 0;
1308 new_region
->not_flags
= 0;
1309 new_region
->had_full_message
= FALSE
;
1311 *lang_memory_region_list_tail
= new_region
;
1312 lang_memory_region_list_tail
= &new_region
->next
;
1318 lang_memory_region_alias (const char * alias
, const char * region_name
)
1320 lang_memory_region_name
* n
;
1321 lang_memory_region_type
* r
;
1322 lang_memory_region_type
* region
;
1324 /* The default region must be unique. This ensures that it is not necessary
1325 to iterate through the name list if someone wants the check if a region is
1326 the default memory region. */
1327 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1328 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1329 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL
);
1331 /* Look for the target region and check if the alias is not already
1334 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1335 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1337 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1339 if (strcmp (n
->name
, alias
) == 0)
1340 einfo (_("%F%P:%S: error: redefinition of memory region "
1345 /* Check if the target region exists. */
1347 einfo (_("%F%P:%S: error: memory region `%s' "
1348 "for alias `%s' does not exist\n"),
1349 NULL
, region_name
, alias
);
1351 /* Add alias to region name list. */
1352 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1353 n
->name
= xstrdup (alias
);
1354 n
->next
= region
->name_list
.next
;
1355 region
->name_list
.next
= n
;
1358 static lang_memory_region_type
*
1359 lang_memory_default (asection
* section
)
1361 lang_memory_region_type
*p
;
1363 flagword sec_flags
= section
->flags
;
1365 /* Override SEC_DATA to mean a writable section. */
1366 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1367 sec_flags
|= SEC_DATA
;
1369 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1371 if ((p
->flags
& sec_flags
) != 0
1372 && (p
->not_flags
& sec_flags
) == 0)
1377 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1380 /* Find or create an output_section_statement with the given NAME.
1381 If CONSTRAINT is non-zero match one with that constraint, otherwise
1382 match any non-negative constraint. If CREATE, always make a
1383 new output_section_statement for SPECIAL CONSTRAINT. */
1385 lang_output_section_statement_type
*
1386 lang_output_section_statement_lookup (const char *name
,
1390 struct out_section_hash_entry
*entry
;
1392 entry
= ((struct out_section_hash_entry
*)
1393 bfd_hash_lookup (&output_section_statement_table
, name
,
1398 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1402 if (entry
->s
.output_section_statement
.name
!= NULL
)
1404 /* We have a section of this name, but it might not have the correct
1406 struct out_section_hash_entry
*last_ent
;
1408 name
= entry
->s
.output_section_statement
.name
;
1409 if (create
&& constraint
== SPECIAL
)
1410 /* Not traversing to the end reverses the order of the second
1411 and subsequent SPECIAL sections in the hash table chain,
1412 but that shouldn't matter. */
1417 if (constraint
== entry
->s
.output_section_statement
.constraint
1419 && entry
->s
.output_section_statement
.constraint
>= 0))
1420 return &entry
->s
.output_section_statement
;
1422 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1424 while (entry
!= NULL
1425 && name
== entry
->s
.output_section_statement
.name
);
1431 = ((struct out_section_hash_entry
*)
1432 output_section_statement_newfunc (NULL
,
1433 &output_section_statement_table
,
1437 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1440 entry
->root
= last_ent
->root
;
1441 last_ent
->root
.next
= &entry
->root
;
1444 entry
->s
.output_section_statement
.name
= name
;
1445 entry
->s
.output_section_statement
.constraint
= constraint
;
1446 return &entry
->s
.output_section_statement
;
1449 /* Find the next output_section_statement with the same name as OS.
1450 If CONSTRAINT is non-zero, find one with that constraint otherwise
1451 match any non-negative constraint. */
1453 lang_output_section_statement_type
*
1454 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1457 /* All output_section_statements are actually part of a
1458 struct out_section_hash_entry. */
1459 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1461 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1462 const char *name
= os
->name
;
1464 ASSERT (name
== entry
->root
.string
);
1467 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1469 || name
!= entry
->s
.output_section_statement
.name
)
1472 while (constraint
!= entry
->s
.output_section_statement
.constraint
1474 || entry
->s
.output_section_statement
.constraint
< 0));
1476 return &entry
->s
.output_section_statement
;
1479 /* A variant of lang_output_section_find used by place_orphan.
1480 Returns the output statement that should precede a new output
1481 statement for SEC. If an exact match is found on certain flags,
1484 lang_output_section_statement_type
*
1485 lang_output_section_find_by_flags (const asection
*sec
,
1486 lang_output_section_statement_type
**exact
,
1487 lang_match_sec_type_func match_type
)
1489 lang_output_section_statement_type
*first
, *look
, *found
;
1492 /* We know the first statement on this list is *ABS*. May as well
1494 first
= &lang_output_section_statement
.head
->output_section_statement
;
1495 first
= first
->next
;
1497 /* First try for an exact match. */
1499 for (look
= first
; look
; look
= look
->next
)
1501 flags
= look
->flags
;
1502 if (look
->bfd_section
!= NULL
)
1504 flags
= look
->bfd_section
->flags
;
1505 if (match_type
&& !match_type (link_info
.output_bfd
,
1510 flags
^= sec
->flags
;
1511 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1512 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1522 if ((sec
->flags
& SEC_CODE
) != 0
1523 && (sec
->flags
& SEC_ALLOC
) != 0)
1525 /* Try for a rw code section. */
1526 for (look
= first
; look
; look
= look
->next
)
1528 flags
= look
->flags
;
1529 if (look
->bfd_section
!= NULL
)
1531 flags
= look
->bfd_section
->flags
;
1532 if (match_type
&& !match_type (link_info
.output_bfd
,
1537 flags
^= sec
->flags
;
1538 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1539 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1543 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1544 && (sec
->flags
& SEC_ALLOC
) != 0)
1546 /* .rodata can go after .text, .sdata2 after .rodata. */
1547 for (look
= first
; look
; look
= look
->next
)
1549 flags
= look
->flags
;
1550 if (look
->bfd_section
!= NULL
)
1552 flags
= look
->bfd_section
->flags
;
1553 if (match_type
&& !match_type (link_info
.output_bfd
,
1558 flags
^= sec
->flags
;
1559 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1560 | SEC_READONLY
| SEC_SMALL_DATA
))
1561 || (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1563 && !(look
->flags
& SEC_SMALL_DATA
))
1564 || (!(flags
& (SEC_THREAD_LOCAL
| SEC_ALLOC
))
1565 && (look
->flags
& SEC_THREAD_LOCAL
)
1566 && (!(flags
& SEC_LOAD
)
1567 || (look
->flags
& SEC_LOAD
))))
1571 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1572 && (sec
->flags
& SEC_ALLOC
) != 0)
1574 /* .sdata goes after .data, .sbss after .sdata. */
1575 for (look
= first
; look
; look
= look
->next
)
1577 flags
= look
->flags
;
1578 if (look
->bfd_section
!= NULL
)
1580 flags
= look
->bfd_section
->flags
;
1581 if (match_type
&& !match_type (link_info
.output_bfd
,
1586 flags
^= sec
->flags
;
1587 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1588 | SEC_THREAD_LOCAL
))
1589 || ((look
->flags
& SEC_SMALL_DATA
)
1590 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1594 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1595 && (sec
->flags
& SEC_ALLOC
) != 0)
1597 /* .data goes after .rodata. */
1598 for (look
= first
; look
; look
= look
->next
)
1600 flags
= look
->flags
;
1601 if (look
->bfd_section
!= NULL
)
1603 flags
= look
->bfd_section
->flags
;
1604 if (match_type
&& !match_type (link_info
.output_bfd
,
1609 flags
^= sec
->flags
;
1610 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1611 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1615 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1617 /* .bss goes after any other alloc section. */
1618 for (look
= first
; look
; look
= look
->next
)
1620 flags
= look
->flags
;
1621 if (look
->bfd_section
!= NULL
)
1623 flags
= look
->bfd_section
->flags
;
1624 if (match_type
&& !match_type (link_info
.output_bfd
,
1629 flags
^= sec
->flags
;
1630 if (!(flags
& SEC_ALLOC
))
1636 /* non-alloc go last. */
1637 for (look
= first
; look
; look
= look
->next
)
1639 flags
= look
->flags
;
1640 if (look
->bfd_section
!= NULL
)
1641 flags
= look
->bfd_section
->flags
;
1642 flags
^= sec
->flags
;
1643 if (!(flags
& SEC_DEBUGGING
))
1649 if (found
|| !match_type
)
1652 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1655 /* Find the last output section before given output statement.
1656 Used by place_orphan. */
1659 output_prev_sec_find (lang_output_section_statement_type
*os
)
1661 lang_output_section_statement_type
*lookup
;
1663 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1665 if (lookup
->constraint
< 0)
1668 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1669 return lookup
->bfd_section
;
1675 /* Look for a suitable place for a new output section statement. The
1676 idea is to skip over anything that might be inside a SECTIONS {}
1677 statement in a script, before we find another output section
1678 statement. Assignments to "dot" before an output section statement
1679 are assumed to belong to it, except in two cases; The first
1680 assignment to dot, and assignments before non-alloc sections.
1681 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1682 similar assignments that set the initial address, or we might
1683 insert non-alloc note sections among assignments setting end of
1686 static lang_statement_union_type
**
1687 insert_os_after (lang_output_section_statement_type
*after
)
1689 lang_statement_union_type
**where
;
1690 lang_statement_union_type
**assign
= NULL
;
1691 bfd_boolean ignore_first
;
1694 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1696 for (where
= &after
->header
.next
;
1698 where
= &(*where
)->header
.next
)
1700 switch ((*where
)->header
.type
)
1702 case lang_assignment_statement_enum
:
1705 lang_assignment_statement_type
*ass
;
1707 ass
= &(*where
)->assignment_statement
;
1708 if (ass
->exp
->type
.node_class
!= etree_assert
1709 && ass
->exp
->assign
.dst
[0] == '.'
1710 && ass
->exp
->assign
.dst
[1] == 0
1714 ignore_first
= FALSE
;
1716 case lang_wild_statement_enum
:
1717 case lang_input_section_enum
:
1718 case lang_object_symbols_statement_enum
:
1719 case lang_fill_statement_enum
:
1720 case lang_data_statement_enum
:
1721 case lang_reloc_statement_enum
:
1722 case lang_padding_statement_enum
:
1723 case lang_constructors_statement_enum
:
1726 case lang_output_section_statement_enum
:
1729 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1732 || s
->map_head
.s
== NULL
1733 || (s
->flags
& SEC_ALLOC
) != 0)
1737 case lang_input_statement_enum
:
1738 case lang_address_statement_enum
:
1739 case lang_target_statement_enum
:
1740 case lang_output_statement_enum
:
1741 case lang_group_statement_enum
:
1742 case lang_insert_statement_enum
:
1751 lang_output_section_statement_type
*
1752 lang_insert_orphan (asection
*s
,
1753 const char *secname
,
1755 lang_output_section_statement_type
*after
,
1756 struct orphan_save
*place
,
1757 etree_type
*address
,
1758 lang_statement_list_type
*add_child
)
1760 lang_statement_list_type add
;
1762 lang_output_section_statement_type
*os
;
1763 lang_output_section_statement_type
**os_tail
;
1765 /* If we have found an appropriate place for the output section
1766 statements for this orphan, add them to our own private list,
1767 inserting them later into the global statement list. */
1770 lang_list_init (&add
);
1771 push_stat_ptr (&add
);
1774 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1775 address
= exp_intop (0);
1777 os_tail
= ((lang_output_section_statement_type
**)
1778 lang_output_section_statement
.tail
);
1779 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1780 NULL
, NULL
, NULL
, constraint
);
1783 if (config
.build_constructors
&& *os_tail
== os
)
1785 /* If the name of the section is representable in C, then create
1786 symbols to mark the start and the end of the section. */
1787 for (ps
= secname
; *ps
!= '\0'; ps
++)
1788 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1794 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1795 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1796 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1797 lang_add_assignment (exp_provide (symname
,
1798 exp_nameop (NAME
, "."),
1803 if (add_child
== NULL
)
1804 add_child
= &os
->children
;
1805 lang_add_section (add_child
, s
, NULL
, os
);
1807 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1809 const char *region
= (after
->region
1810 ? after
->region
->name_list
.name
1811 : DEFAULT_MEMORY_REGION
);
1812 const char *lma_region
= (after
->lma_region
1813 ? after
->lma_region
->name_list
.name
1815 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1819 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1822 if (ps
!= NULL
&& *ps
== '\0')
1826 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1827 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1828 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1829 lang_add_assignment (exp_provide (symname
,
1830 exp_nameop (NAME
, "."),
1834 /* Restore the global list pointer. */
1838 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1840 asection
*snew
, *as
;
1842 snew
= os
->bfd_section
;
1844 /* Shuffle the bfd section list to make the output file look
1845 neater. This is really only cosmetic. */
1846 if (place
->section
== NULL
1847 && after
!= (&lang_output_section_statement
.head
1848 ->output_section_statement
))
1850 asection
*bfd_section
= after
->bfd_section
;
1852 /* If the output statement hasn't been used to place any input
1853 sections (and thus doesn't have an output bfd_section),
1854 look for the closest prior output statement having an
1856 if (bfd_section
== NULL
)
1857 bfd_section
= output_prev_sec_find (after
);
1859 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1860 place
->section
= &bfd_section
->next
;
1863 if (place
->section
== NULL
)
1864 place
->section
= &link_info
.output_bfd
->sections
;
1866 as
= *place
->section
;
1870 /* Put the section at the end of the list. */
1872 /* Unlink the section. */
1873 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1875 /* Now tack it back on in the right place. */
1876 bfd_section_list_append (link_info
.output_bfd
, snew
);
1878 else if (as
!= snew
&& as
->prev
!= snew
)
1880 /* Unlink the section. */
1881 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1883 /* Now tack it back on in the right place. */
1884 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1887 /* Save the end of this list. Further ophans of this type will
1888 follow the one we've just added. */
1889 place
->section
= &snew
->next
;
1891 /* The following is non-cosmetic. We try to put the output
1892 statements in some sort of reasonable order here, because they
1893 determine the final load addresses of the orphan sections.
1894 In addition, placing output statements in the wrong order may
1895 require extra segments. For instance, given a typical
1896 situation of all read-only sections placed in one segment and
1897 following that a segment containing all the read-write
1898 sections, we wouldn't want to place an orphan read/write
1899 section before or amongst the read-only ones. */
1900 if (add
.head
!= NULL
)
1902 lang_output_section_statement_type
*newly_added_os
;
1904 if (place
->stmt
== NULL
)
1906 lang_statement_union_type
**where
= insert_os_after (after
);
1911 place
->os_tail
= &after
->next
;
1915 /* Put it after the last orphan statement we added. */
1916 *add
.tail
= *place
->stmt
;
1917 *place
->stmt
= add
.head
;
1920 /* Fix the global list pointer if we happened to tack our
1921 new list at the tail. */
1922 if (*stat_ptr
->tail
== add
.head
)
1923 stat_ptr
->tail
= add
.tail
;
1925 /* Save the end of this list. */
1926 place
->stmt
= add
.tail
;
1928 /* Do the same for the list of output section statements. */
1929 newly_added_os
= *os_tail
;
1931 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1932 ((char *) place
->os_tail
1933 - offsetof (lang_output_section_statement_type
, next
));
1934 newly_added_os
->next
= *place
->os_tail
;
1935 if (newly_added_os
->next
!= NULL
)
1936 newly_added_os
->next
->prev
= newly_added_os
;
1937 *place
->os_tail
= newly_added_os
;
1938 place
->os_tail
= &newly_added_os
->next
;
1940 /* Fixing the global list pointer here is a little different.
1941 We added to the list in lang_enter_output_section_statement,
1942 trimmed off the new output_section_statment above when
1943 assigning *os_tail = NULL, but possibly added it back in
1944 the same place when assigning *place->os_tail. */
1945 if (*os_tail
== NULL
)
1946 lang_output_section_statement
.tail
1947 = (lang_statement_union_type
**) os_tail
;
1954 lang_map_flags (flagword flag
)
1956 if (flag
& SEC_ALLOC
)
1959 if (flag
& SEC_CODE
)
1962 if (flag
& SEC_READONLY
)
1965 if (flag
& SEC_DATA
)
1968 if (flag
& SEC_LOAD
)
1975 lang_memory_region_type
*m
;
1976 bfd_boolean dis_header_printed
= FALSE
;
1979 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1983 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1984 || file
->flags
.just_syms
)
1987 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1988 if ((s
->output_section
== NULL
1989 || s
->output_section
->owner
!= link_info
.output_bfd
)
1990 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1992 if (! dis_header_printed
)
1994 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1995 dis_header_printed
= TRUE
;
1998 print_input_section (s
, TRUE
);
2002 minfo (_("\nMemory Configuration\n\n"));
2003 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2004 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2006 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2011 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2013 sprintf_vma (buf
, m
->origin
);
2014 minfo ("0x%s ", buf
);
2022 minfo ("0x%V", m
->length
);
2023 if (m
->flags
|| m
->not_flags
)
2031 lang_map_flags (m
->flags
);
2037 lang_map_flags (m
->not_flags
);
2044 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2046 if (! link_info
.reduce_memory_overheads
)
2048 obstack_begin (&map_obstack
, 1000);
2049 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
2050 bfd_map_over_sections (p
, init_map_userdata
, 0);
2051 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2053 lang_statement_iteration
++;
2054 print_statements ();
2058 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
2060 void *data ATTRIBUTE_UNUSED
)
2062 fat_section_userdata_type
*new_data
2063 = ((fat_section_userdata_type
*) (stat_alloc
2064 (sizeof (fat_section_userdata_type
))));
2066 ASSERT (get_userdata (sec
) == NULL
);
2067 get_userdata (sec
) = new_data
;
2068 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
2069 new_data
->map_symbol_def_count
= 0;
2073 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2074 void *info ATTRIBUTE_UNUSED
)
2076 if (hash_entry
->type
== bfd_link_hash_defined
2077 || hash_entry
->type
== bfd_link_hash_defweak
)
2079 struct fat_user_section_struct
*ud
;
2080 struct map_symbol_def
*def
;
2082 ud
= (struct fat_user_section_struct
*)
2083 get_userdata (hash_entry
->u
.def
.section
);
2086 /* ??? What do we have to do to initialize this beforehand? */
2087 /* The first time we get here is bfd_abs_section... */
2088 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
2089 ud
= (struct fat_user_section_struct
*)
2090 get_userdata (hash_entry
->u
.def
.section
);
2092 else if (!ud
->map_symbol_def_tail
)
2093 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2095 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2096 def
->entry
= hash_entry
;
2097 *(ud
->map_symbol_def_tail
) = def
;
2098 ud
->map_symbol_def_tail
= &def
->next
;
2099 ud
->map_symbol_def_count
++;
2104 /* Initialize an output section. */
2107 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2109 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2110 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2112 if (s
->constraint
!= SPECIAL
)
2113 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2114 if (s
->bfd_section
== NULL
)
2115 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2117 if (s
->bfd_section
== NULL
)
2119 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2120 link_info
.output_bfd
->xvec
->name
, s
->name
);
2122 s
->bfd_section
->output_section
= s
->bfd_section
;
2123 s
->bfd_section
->output_offset
= 0;
2125 if (!link_info
.reduce_memory_overheads
)
2127 fat_section_userdata_type
*new_userdata
= (fat_section_userdata_type
*)
2128 stat_alloc (sizeof (fat_section_userdata_type
));
2129 memset (new_userdata
, 0, sizeof (fat_section_userdata_type
));
2130 get_userdata (s
->bfd_section
) = new_userdata
;
2133 /* If there is a base address, make sure that any sections it might
2134 mention are initialized. */
2135 if (s
->addr_tree
!= NULL
)
2136 exp_init_os (s
->addr_tree
);
2138 if (s
->load_base
!= NULL
)
2139 exp_init_os (s
->load_base
);
2141 /* If supplied an alignment, set it. */
2142 if (s
->section_alignment
!= -1)
2143 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2146 /* Make sure that all output sections mentioned in an expression are
2150 exp_init_os (etree_type
*exp
)
2152 switch (exp
->type
.node_class
)
2156 exp_init_os (exp
->assign
.src
);
2160 exp_init_os (exp
->binary
.lhs
);
2161 exp_init_os (exp
->binary
.rhs
);
2165 exp_init_os (exp
->trinary
.cond
);
2166 exp_init_os (exp
->trinary
.lhs
);
2167 exp_init_os (exp
->trinary
.rhs
);
2171 exp_init_os (exp
->assert_s
.child
);
2175 exp_init_os (exp
->unary
.child
);
2179 switch (exp
->type
.node_code
)
2185 lang_output_section_statement_type
*os
;
2187 os
= lang_output_section_find (exp
->name
.name
);
2188 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2200 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2202 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2204 /* If we are only reading symbols from this object, then we want to
2205 discard all sections. */
2206 if (entry
->flags
.just_syms
)
2208 bfd_link_just_syms (abfd
, sec
, &link_info
);
2212 if (!(abfd
->flags
& DYNAMIC
))
2213 bfd_section_already_linked (abfd
, sec
, &link_info
);
2216 /* The wild routines.
2218 These expand statements like *(.text) and foo.o to a list of
2219 explicit actions, like foo.o(.text), bar.o(.text) and
2220 foo.o(.text, .data). */
2222 /* Add SECTION to the output section OUTPUT. Do this by creating a
2223 lang_input_section statement which is placed at PTR. */
2226 lang_add_section (lang_statement_list_type
*ptr
,
2228 struct flag_info
*sflag_info
,
2229 lang_output_section_statement_type
*output
)
2231 flagword flags
= section
->flags
;
2233 bfd_boolean discard
;
2234 lang_input_section_type
*new_section
;
2235 bfd
*abfd
= link_info
.output_bfd
;
2237 /* Discard sections marked with SEC_EXCLUDE. */
2238 discard
= (flags
& SEC_EXCLUDE
) != 0;
2240 /* Discard input sections which are assigned to a section named
2241 DISCARD_SECTION_NAME. */
2242 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2245 /* Discard debugging sections if we are stripping debugging
2247 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2248 && (flags
& SEC_DEBUGGING
) != 0)
2253 if (section
->output_section
== NULL
)
2255 /* This prevents future calls from assigning this section. */
2256 section
->output_section
= bfd_abs_section_ptr
;
2265 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2270 if (section
->output_section
!= NULL
)
2273 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2274 to an output section, because we want to be able to include a
2275 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2276 section (I don't know why we want to do this, but we do).
2277 build_link_order in ldwrite.c handles this case by turning
2278 the embedded SEC_NEVER_LOAD section into a fill. */
2279 flags
&= ~ SEC_NEVER_LOAD
;
2281 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2282 already been processed. One reason to do this is that on pe
2283 format targets, .text$foo sections go into .text and it's odd
2284 to see .text with SEC_LINK_ONCE set. */
2286 if (!link_info
.relocatable
)
2287 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2289 switch (output
->sectype
)
2291 case normal_section
:
2292 case overlay_section
:
2294 case noalloc_section
:
2295 flags
&= ~SEC_ALLOC
;
2297 case noload_section
:
2299 flags
|= SEC_NEVER_LOAD
;
2300 /* Unfortunately GNU ld has managed to evolve two different
2301 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2302 alloc, no contents section. All others get a noload, noalloc
2304 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2305 flags
&= ~SEC_HAS_CONTENTS
;
2307 flags
&= ~SEC_ALLOC
;
2311 if (output
->bfd_section
== NULL
)
2312 init_os (output
, flags
);
2314 /* If SEC_READONLY is not set in the input section, then clear
2315 it from the output section. */
2316 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2318 if (output
->bfd_section
->linker_has_input
)
2320 /* Only set SEC_READONLY flag on the first input section. */
2321 flags
&= ~ SEC_READONLY
;
2323 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2324 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2325 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2326 || ((flags
& SEC_MERGE
) != 0
2327 && output
->bfd_section
->entsize
!= section
->entsize
))
2329 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2330 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2333 output
->bfd_section
->flags
|= flags
;
2335 if (!output
->bfd_section
->linker_has_input
)
2337 output
->bfd_section
->linker_has_input
= 1;
2338 /* This must happen after flags have been updated. The output
2339 section may have been created before we saw its first input
2340 section, eg. for a data statement. */
2341 bfd_init_private_section_data (section
->owner
, section
,
2342 link_info
.output_bfd
,
2343 output
->bfd_section
,
2345 if ((flags
& SEC_MERGE
) != 0)
2346 output
->bfd_section
->entsize
= section
->entsize
;
2349 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2350 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2352 /* FIXME: This value should really be obtained from the bfd... */
2353 output
->block_value
= 128;
2356 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2357 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2359 section
->output_section
= output
->bfd_section
;
2361 if (!link_info
.relocatable
2362 && !stripped_excluded_sections
)
2364 asection
*s
= output
->bfd_section
->map_tail
.s
;
2365 output
->bfd_section
->map_tail
.s
= section
;
2366 section
->map_head
.s
= NULL
;
2367 section
->map_tail
.s
= s
;
2369 s
->map_head
.s
= section
;
2371 output
->bfd_section
->map_head
.s
= section
;
2374 /* Add a section reference to the list. */
2375 new_section
= new_stat (lang_input_section
, ptr
);
2376 new_section
->section
= section
;
2379 /* Handle wildcard sorting. This returns the lang_input_section which
2380 should follow the one we are going to create for SECTION and FILE,
2381 based on the sorting requirements of WILD. It returns NULL if the
2382 new section should just go at the end of the current list. */
2384 static lang_statement_union_type
*
2385 wild_sort (lang_wild_statement_type
*wild
,
2386 struct wildcard_list
*sec
,
2387 lang_input_statement_type
*file
,
2390 lang_statement_union_type
*l
;
2392 if (!wild
->filenames_sorted
2393 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2396 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2398 lang_input_section_type
*ls
;
2400 if (l
->header
.type
!= lang_input_section_enum
)
2402 ls
= &l
->input_section
;
2404 /* Sorting by filename takes precedence over sorting by section
2407 if (wild
->filenames_sorted
)
2409 const char *fn
, *ln
;
2413 /* The PE support for the .idata section as generated by
2414 dlltool assumes that files will be sorted by the name of
2415 the archive and then the name of the file within the
2418 if (file
->the_bfd
!= NULL
2419 && bfd_my_archive (file
->the_bfd
) != NULL
)
2421 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2426 fn
= file
->filename
;
2430 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2432 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2437 ln
= ls
->section
->owner
->filename
;
2441 i
= filename_cmp (fn
, ln
);
2450 fn
= file
->filename
;
2452 ln
= ls
->section
->owner
->filename
;
2454 i
= filename_cmp (fn
, ln
);
2462 /* Here either the files are not sorted by name, or we are
2463 looking at the sections for this file. */
2465 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2466 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2473 /* Expand a wild statement for a particular FILE. SECTION may be
2474 NULL, in which case it is a wild card. */
2477 output_section_callback (lang_wild_statement_type
*ptr
,
2478 struct wildcard_list
*sec
,
2480 struct flag_info
*sflag_info
,
2481 lang_input_statement_type
*file
,
2484 lang_statement_union_type
*before
;
2485 lang_output_section_statement_type
*os
;
2487 os
= (lang_output_section_statement_type
*) output
;
2489 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2490 if (unique_section_p (section
, os
))
2493 before
= wild_sort (ptr
, sec
, file
, section
);
2495 /* Here BEFORE points to the lang_input_section which
2496 should follow the one we are about to add. If BEFORE
2497 is NULL, then the section should just go at the end
2498 of the current list. */
2501 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2504 lang_statement_list_type list
;
2505 lang_statement_union_type
**pp
;
2507 lang_list_init (&list
);
2508 lang_add_section (&list
, section
, sflag_info
, os
);
2510 /* If we are discarding the section, LIST.HEAD will
2512 if (list
.head
!= NULL
)
2514 ASSERT (list
.head
->header
.next
== NULL
);
2516 for (pp
= &ptr
->children
.head
;
2518 pp
= &(*pp
)->header
.next
)
2519 ASSERT (*pp
!= NULL
);
2521 list
.head
->header
.next
= *pp
;
2527 /* Check if all sections in a wild statement for a particular FILE
2531 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2532 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2534 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2535 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2538 lang_output_section_statement_type
*os
;
2540 os
= (lang_output_section_statement_type
*) output
;
2542 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2543 if (unique_section_p (section
, os
))
2546 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2547 os
->all_input_readonly
= FALSE
;
2550 /* This is passed a file name which must have been seen already and
2551 added to the statement tree. We will see if it has been opened
2552 already and had its symbols read. If not then we'll read it. */
2554 static lang_input_statement_type
*
2555 lookup_name (const char *name
)
2557 lang_input_statement_type
*search
;
2559 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2561 search
= (lang_input_statement_type
*) search
->next_real_file
)
2563 /* Use the local_sym_name as the name of the file that has
2564 already been loaded as filename might have been transformed
2565 via the search directory lookup mechanism. */
2566 const char *filename
= search
->local_sym_name
;
2568 if (filename
!= NULL
2569 && filename_cmp (filename
, name
) == 0)
2574 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2575 default_target
, FALSE
);
2577 /* If we have already added this file, or this file is not real
2578 don't add this file. */
2579 if (search
->flags
.loaded
|| !search
->flags
.real
)
2582 if (! load_symbols (search
, NULL
))
2588 /* Save LIST as a list of libraries whose symbols should not be exported. */
2593 struct excluded_lib
*next
;
2595 static struct excluded_lib
*excluded_libs
;
2598 add_excluded_libs (const char *list
)
2600 const char *p
= list
, *end
;
2604 struct excluded_lib
*entry
;
2605 end
= strpbrk (p
, ",:");
2607 end
= p
+ strlen (p
);
2608 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2609 entry
->next
= excluded_libs
;
2610 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2611 memcpy (entry
->name
, p
, end
- p
);
2612 entry
->name
[end
- p
] = '\0';
2613 excluded_libs
= entry
;
2621 check_excluded_libs (bfd
*abfd
)
2623 struct excluded_lib
*lib
= excluded_libs
;
2627 int len
= strlen (lib
->name
);
2628 const char *filename
= lbasename (abfd
->filename
);
2630 if (strcmp (lib
->name
, "ALL") == 0)
2632 abfd
->no_export
= TRUE
;
2636 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2637 && (filename
[len
] == '\0'
2638 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2639 && filename
[len
+ 2] == '\0')))
2641 abfd
->no_export
= TRUE
;
2649 /* Get the symbols for an input file. */
2652 load_symbols (lang_input_statement_type
*entry
,
2653 lang_statement_list_type
*place
)
2657 if (entry
->flags
.loaded
)
2660 ldfile_open_file (entry
);
2662 /* Do not process further if the file was missing. */
2663 if (entry
->flags
.missing_file
)
2666 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2667 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2670 struct lang_input_statement_flags save_flags
;
2672 err
= bfd_get_error ();
2674 /* See if the emulation has some special knowledge. */
2675 if (ldemul_unrecognized_file (entry
))
2678 if (err
== bfd_error_file_ambiguously_recognized
)
2682 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2683 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2684 for (p
= matching
; *p
!= NULL
; p
++)
2688 else if (err
!= bfd_error_file_not_recognized
2690 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2692 bfd_close (entry
->the_bfd
);
2693 entry
->the_bfd
= NULL
;
2695 /* Try to interpret the file as a linker script. */
2696 save_flags
= input_flags
;
2697 ldfile_open_command_file (entry
->filename
);
2699 push_stat_ptr (place
);
2700 input_flags
.add_DT_NEEDED_for_regular
2701 = entry
->flags
.add_DT_NEEDED_for_regular
;
2702 input_flags
.add_DT_NEEDED_for_dynamic
2703 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2704 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2705 input_flags
.dynamic
= entry
->flags
.dynamic
;
2707 ldfile_assumed_script
= TRUE
;
2708 parser_input
= input_script
;
2710 ldfile_assumed_script
= FALSE
;
2712 /* missing_file is sticky. sysrooted will already have been
2713 restored when seeing EOF in yyparse, but no harm to restore
2715 save_flags
.missing_file
|= input_flags
.missing_file
;
2716 input_flags
= save_flags
;
2722 if (ldemul_recognized_file (entry
))
2725 /* We don't call ldlang_add_file for an archive. Instead, the
2726 add_symbols entry point will call ldlang_add_file, via the
2727 add_archive_element callback, for each element of the archive
2729 switch (bfd_get_format (entry
->the_bfd
))
2735 #ifdef ENABLE_PLUGINS
2736 if (!entry
->flags
.reload
)
2738 ldlang_add_file (entry
);
2739 if (trace_files
|| trace_file_tries
)
2740 info_msg ("%I\n", entry
);
2744 check_excluded_libs (entry
->the_bfd
);
2746 if (entry
->flags
.whole_archive
)
2749 bfd_boolean loaded
= TRUE
;
2754 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2759 if (! bfd_check_format (member
, bfd_object
))
2761 einfo (_("%F%B: member %B in archive is not an object\n"),
2762 entry
->the_bfd
, member
);
2767 if (!(*link_info
.callbacks
2768 ->add_archive_element
) (&link_info
, member
,
2769 "--whole-archive", &subsbfd
))
2772 /* Potentially, the add_archive_element hook may have set a
2773 substitute BFD for us. */
2774 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2776 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2781 entry
->flags
.loaded
= loaded
;
2787 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2788 entry
->flags
.loaded
= TRUE
;
2790 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2792 return entry
->flags
.loaded
;
2795 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2796 may be NULL, indicating that it is a wildcard. Separate
2797 lang_input_section statements are created for each part of the
2798 expansion; they are added after the wild statement S. OUTPUT is
2799 the output section. */
2802 wild (lang_wild_statement_type
*s
,
2803 const char *target ATTRIBUTE_UNUSED
,
2804 lang_output_section_statement_type
*output
)
2806 struct wildcard_list
*sec
;
2808 if (s
->handler_data
[0]
2809 && s
->handler_data
[0]->spec
.sorted
== by_name
2810 && !s
->filenames_sorted
)
2812 lang_section_bst_type
*tree
;
2814 walk_wild (s
, output_section_callback_fast
, output
);
2819 output_section_callback_tree_to_list (s
, tree
, output
);
2824 walk_wild (s
, output_section_callback
, output
);
2826 if (default_common_section
== NULL
)
2827 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2828 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2830 /* Remember the section that common is going to in case we
2831 later get something which doesn't know where to put it. */
2832 default_common_section
= output
;
2837 /* Return TRUE iff target is the sought target. */
2840 get_target (const bfd_target
*target
, void *data
)
2842 const char *sought
= (const char *) data
;
2844 return strcmp (target
->name
, sought
) == 0;
2847 /* Like strcpy() but convert to lower case as well. */
2850 stricpy (char *dest
, char *src
)
2854 while ((c
= *src
++) != 0)
2855 *dest
++ = TOLOWER (c
);
2860 /* Remove the first occurrence of needle (if any) in haystack
2864 strcut (char *haystack
, char *needle
)
2866 haystack
= strstr (haystack
, needle
);
2872 for (src
= haystack
+ strlen (needle
); *src
;)
2873 *haystack
++ = *src
++;
2879 /* Compare two target format name strings.
2880 Return a value indicating how "similar" they are. */
2883 name_compare (char *first
, char *second
)
2889 copy1
= (char *) xmalloc (strlen (first
) + 1);
2890 copy2
= (char *) xmalloc (strlen (second
) + 1);
2892 /* Convert the names to lower case. */
2893 stricpy (copy1
, first
);
2894 stricpy (copy2
, second
);
2896 /* Remove size and endian strings from the name. */
2897 strcut (copy1
, "big");
2898 strcut (copy1
, "little");
2899 strcut (copy2
, "big");
2900 strcut (copy2
, "little");
2902 /* Return a value based on how many characters match,
2903 starting from the beginning. If both strings are
2904 the same then return 10 * their length. */
2905 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2906 if (copy1
[result
] == 0)
2918 /* Set by closest_target_match() below. */
2919 static const bfd_target
*winner
;
2921 /* Scan all the valid bfd targets looking for one that has the endianness
2922 requirement that was specified on the command line, and is the nearest
2923 match to the original output target. */
2926 closest_target_match (const bfd_target
*target
, void *data
)
2928 const bfd_target
*original
= (const bfd_target
*) data
;
2930 if (command_line
.endian
== ENDIAN_BIG
2931 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2934 if (command_line
.endian
== ENDIAN_LITTLE
2935 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2938 /* Must be the same flavour. */
2939 if (target
->flavour
!= original
->flavour
)
2942 /* Ignore generic big and little endian elf vectors. */
2943 if (strcmp (target
->name
, "elf32-big") == 0
2944 || strcmp (target
->name
, "elf64-big") == 0
2945 || strcmp (target
->name
, "elf32-little") == 0
2946 || strcmp (target
->name
, "elf64-little") == 0)
2949 /* If we have not found a potential winner yet, then record this one. */
2956 /* Oh dear, we now have two potential candidates for a successful match.
2957 Compare their names and choose the better one. */
2958 if (name_compare (target
->name
, original
->name
)
2959 > name_compare (winner
->name
, original
->name
))
2962 /* Keep on searching until wqe have checked them all. */
2966 /* Return the BFD target format of the first input file. */
2969 get_first_input_target (void)
2971 char *target
= NULL
;
2973 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2975 if (s
->header
.type
== lang_input_statement_enum
2978 ldfile_open_file (s
);
2980 if (s
->the_bfd
!= NULL
2981 && bfd_check_format (s
->the_bfd
, bfd_object
))
2983 target
= bfd_get_target (s
->the_bfd
);
2995 lang_get_output_target (void)
2999 /* Has the user told us which output format to use? */
3000 if (output_target
!= NULL
)
3001 return output_target
;
3003 /* No - has the current target been set to something other than
3005 if (current_target
!= default_target
&& current_target
!= NULL
)
3006 return current_target
;
3008 /* No - can we determine the format of the first input file? */
3009 target
= get_first_input_target ();
3013 /* Failed - use the default output target. */
3014 return default_target
;
3017 /* Open the output file. */
3020 open_output (const char *name
)
3022 output_target
= lang_get_output_target ();
3024 /* Has the user requested a particular endianness on the command
3026 if (command_line
.endian
!= ENDIAN_UNSET
)
3028 const bfd_target
*target
;
3029 enum bfd_endian desired_endian
;
3031 /* Get the chosen target. */
3032 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3034 /* If the target is not supported, we cannot do anything. */
3037 if (command_line
.endian
== ENDIAN_BIG
)
3038 desired_endian
= BFD_ENDIAN_BIG
;
3040 desired_endian
= BFD_ENDIAN_LITTLE
;
3042 /* See if the target has the wrong endianness. This should
3043 not happen if the linker script has provided big and
3044 little endian alternatives, but some scrips don't do
3046 if (target
->byteorder
!= desired_endian
)
3048 /* If it does, then see if the target provides
3049 an alternative with the correct endianness. */
3050 if (target
->alternative_target
!= NULL
3051 && (target
->alternative_target
->byteorder
== desired_endian
))
3052 output_target
= target
->alternative_target
->name
;
3055 /* Try to find a target as similar as possible to
3056 the default target, but which has the desired
3057 endian characteristic. */
3058 bfd_search_for_target (closest_target_match
,
3061 /* Oh dear - we could not find any targets that
3062 satisfy our requirements. */
3064 einfo (_("%P: warning: could not find any targets"
3065 " that match endianness requirement\n"));
3067 output_target
= winner
->name
;
3073 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3075 if (link_info
.output_bfd
== NULL
)
3077 if (bfd_get_error () == bfd_error_invalid_target
)
3078 einfo (_("%P%F: target %s not found\n"), output_target
);
3080 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3083 delete_output_file_on_failure
= TRUE
;
3085 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3086 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3087 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3088 ldfile_output_architecture
,
3089 ldfile_output_machine
))
3090 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3092 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3093 if (link_info
.hash
== NULL
)
3094 einfo (_("%P%F: can not create hash table: %E\n"));
3096 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3100 ldlang_open_output (lang_statement_union_type
*statement
)
3102 switch (statement
->header
.type
)
3104 case lang_output_statement_enum
:
3105 ASSERT (link_info
.output_bfd
== NULL
);
3106 open_output (statement
->output_statement
.name
);
3107 ldemul_set_output_arch ();
3108 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3109 link_info
.output_bfd
->flags
|= D_PAGED
;
3111 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3112 if (config
.text_read_only
)
3113 link_info
.output_bfd
->flags
|= WP_TEXT
;
3115 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3116 if (link_info
.traditional_format
)
3117 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3119 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3122 case lang_target_statement_enum
:
3123 current_target
= statement
->target_statement
.target
;
3130 /* Convert between addresses in bytes and sizes in octets.
3131 For currently supported targets, octets_per_byte is always a power
3132 of two, so we can use shifts. */
3133 #define TO_ADDR(X) ((X) >> opb_shift)
3134 #define TO_SIZE(X) ((X) << opb_shift)
3136 /* Support the above. */
3137 static unsigned int opb_shift
= 0;
3142 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3143 ldfile_output_machine
);
3146 while ((x
& 1) == 0)
3154 /* Open all the input files. */
3158 OPEN_BFD_NORMAL
= 0,
3162 #ifdef ENABLE_PLUGINS
3163 static lang_input_statement_type
*plugin_insert
= NULL
;
3167 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3169 for (; s
!= NULL
; s
= s
->header
.next
)
3171 switch (s
->header
.type
)
3173 case lang_constructors_statement_enum
:
3174 open_input_bfds (constructor_list
.head
, mode
);
3176 case lang_output_section_statement_enum
:
3177 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3179 case lang_wild_statement_enum
:
3180 /* Maybe we should load the file's symbols. */
3181 if ((mode
& OPEN_BFD_RESCAN
) == 0
3182 && s
->wild_statement
.filename
3183 && !wildcardp (s
->wild_statement
.filename
)
3184 && !archive_path (s
->wild_statement
.filename
))
3185 lookup_name (s
->wild_statement
.filename
);
3186 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3188 case lang_group_statement_enum
:
3190 struct bfd_link_hash_entry
*undefs
;
3192 /* We must continually search the entries in the group
3193 until no new symbols are added to the list of undefined
3198 undefs
= link_info
.hash
->undefs_tail
;
3199 open_input_bfds (s
->group_statement
.children
.head
,
3200 mode
| OPEN_BFD_FORCE
);
3202 while (undefs
!= link_info
.hash
->undefs_tail
);
3205 case lang_target_statement_enum
:
3206 current_target
= s
->target_statement
.target
;
3208 case lang_input_statement_enum
:
3209 if (s
->input_statement
.flags
.real
)
3211 lang_statement_union_type
**os_tail
;
3212 lang_statement_list_type add
;
3214 s
->input_statement
.target
= current_target
;
3216 /* If we are being called from within a group, and this
3217 is an archive which has already been searched, then
3218 force it to be researched unless the whole archive
3219 has been loaded already. Do the same for a rescan. */
3220 if (mode
!= OPEN_BFD_NORMAL
3221 #ifdef ENABLE_PLUGINS
3222 && ((mode
& OPEN_BFD_RESCAN
) == 0
3223 || plugin_insert
== NULL
)
3225 && !s
->input_statement
.flags
.whole_archive
3226 && s
->input_statement
.flags
.loaded
3227 && bfd_check_format (s
->input_statement
.the_bfd
,
3229 s
->input_statement
.flags
.loaded
= FALSE
;
3230 #ifdef ENABLE_PLUGINS
3231 /* When rescanning, reload --as-needed shared libs. */
3232 else if ((mode
& OPEN_BFD_RESCAN
) != 0
3233 && plugin_insert
== NULL
3234 && s
->input_statement
.flags
.loaded
3235 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3236 && ((s
->input_statement
.the_bfd
->flags
) & DYNAMIC
) != 0
3237 && plugin_should_reload (s
->input_statement
.the_bfd
))
3239 s
->input_statement
.flags
.loaded
= FALSE
;
3240 s
->input_statement
.flags
.reload
= TRUE
;
3244 os_tail
= lang_output_section_statement
.tail
;
3245 lang_list_init (&add
);
3247 if (! load_symbols (&s
->input_statement
, &add
))
3248 config
.make_executable
= FALSE
;
3250 if (add
.head
!= NULL
)
3252 /* If this was a script with output sections then
3253 tack any added statements on to the end of the
3254 list. This avoids having to reorder the output
3255 section statement list. Very likely the user
3256 forgot -T, and whatever we do here will not meet
3257 naive user expectations. */
3258 if (os_tail
!= lang_output_section_statement
.tail
)
3260 einfo (_("%P: warning: %s contains output sections;"
3261 " did you forget -T?\n"),
3262 s
->input_statement
.filename
);
3263 *stat_ptr
->tail
= add
.head
;
3264 stat_ptr
->tail
= add
.tail
;
3268 *add
.tail
= s
->header
.next
;
3269 s
->header
.next
= add
.head
;
3273 #ifdef ENABLE_PLUGINS
3274 /* If we have found the point at which a plugin added new
3275 files, clear plugin_insert to enable archive rescan. */
3276 if (&s
->input_statement
== plugin_insert
)
3277 plugin_insert
= NULL
;
3280 case lang_assignment_statement_enum
:
3281 if (s
->assignment_statement
.exp
->assign
.hidden
)
3282 /* This is from a --defsym on the command line. */
3283 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3290 /* Exit if any of the files were missing. */
3291 if (input_flags
.missing_file
)
3295 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3298 lang_track_definedness (const char *name
)
3300 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3301 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3304 /* New-function for the definedness hash table. */
3306 static struct bfd_hash_entry
*
3307 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3308 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3309 const char *name ATTRIBUTE_UNUSED
)
3311 struct lang_definedness_hash_entry
*ret
3312 = (struct lang_definedness_hash_entry
*) entry
;
3315 ret
= (struct lang_definedness_hash_entry
*)
3316 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3319 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3321 ret
->iteration
= -1;
3325 /* Return the iteration when the definition of NAME was last updated. A
3326 value of -1 means that the symbol is not defined in the linker script
3327 or the command line, but may be defined in the linker symbol table. */
3330 lang_symbol_definition_iteration (const char *name
)
3332 struct lang_definedness_hash_entry
*defentry
3333 = (struct lang_definedness_hash_entry
*)
3334 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3336 /* We've already created this one on the presence of DEFINED in the
3337 script, so it can't be NULL unless something is borked elsewhere in
3339 if (defentry
== NULL
)
3342 return defentry
->iteration
;
3345 /* Update the definedness state of NAME. */
3348 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3350 struct lang_definedness_hash_entry
*defentry
3351 = (struct lang_definedness_hash_entry
*)
3352 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3354 /* We don't keep track of symbols not tested with DEFINED. */
3355 if (defentry
== NULL
)
3358 /* If the symbol was already defined, and not from an earlier statement
3359 iteration, don't update the definedness iteration, because that'd
3360 make the symbol seem defined in the linker script at this point, and
3361 it wasn't; it was defined in some object. If we do anyway, DEFINED
3362 would start to yield false before this point and the construct "sym =
3363 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3365 if (h
->type
!= bfd_link_hash_undefined
3366 && h
->type
!= bfd_link_hash_common
3367 && h
->type
!= bfd_link_hash_new
3368 && defentry
->iteration
== -1)
3371 defentry
->iteration
= lang_statement_iteration
;
3374 /* Add the supplied name to the symbol table as an undefined reference.
3375 This is a two step process as the symbol table doesn't even exist at
3376 the time the ld command line is processed. First we put the name
3377 on a list, then, once the output file has been opened, transfer the
3378 name to the symbol table. */
3380 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3382 #define ldlang_undef_chain_list_head entry_symbol.next
3385 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3387 ldlang_undef_chain_list_type
*new_undef
;
3389 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3390 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3391 new_undef
->next
= ldlang_undef_chain_list_head
;
3392 ldlang_undef_chain_list_head
= new_undef
;
3394 new_undef
->name
= xstrdup (name
);
3396 if (link_info
.output_bfd
!= NULL
)
3397 insert_undefined (new_undef
->name
);
3400 /* Insert NAME as undefined in the symbol table. */
3403 insert_undefined (const char *name
)
3405 struct bfd_link_hash_entry
*h
;
3407 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3409 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3410 if (h
->type
== bfd_link_hash_new
)
3412 h
->type
= bfd_link_hash_undefined
;
3413 h
->u
.undef
.abfd
= NULL
;
3414 bfd_link_add_undef (link_info
.hash
, h
);
3418 /* Run through the list of undefineds created above and place them
3419 into the linker hash table as undefined symbols belonging to the
3423 lang_place_undefineds (void)
3425 ldlang_undef_chain_list_type
*ptr
;
3427 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3428 insert_undefined (ptr
->name
);
3431 /* Check for all readonly or some readwrite sections. */
3434 check_input_sections
3435 (lang_statement_union_type
*s
,
3436 lang_output_section_statement_type
*output_section_statement
)
3438 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3440 switch (s
->header
.type
)
3442 case lang_wild_statement_enum
:
3443 walk_wild (&s
->wild_statement
, check_section_callback
,
3444 output_section_statement
);
3445 if (! output_section_statement
->all_input_readonly
)
3448 case lang_constructors_statement_enum
:
3449 check_input_sections (constructor_list
.head
,
3450 output_section_statement
);
3451 if (! output_section_statement
->all_input_readonly
)
3454 case lang_group_statement_enum
:
3455 check_input_sections (s
->group_statement
.children
.head
,
3456 output_section_statement
);
3457 if (! output_section_statement
->all_input_readonly
)
3466 /* Update wildcard statements if needed. */
3469 update_wild_statements (lang_statement_union_type
*s
)
3471 struct wildcard_list
*sec
;
3473 switch (sort_section
)
3483 for (; s
!= NULL
; s
= s
->header
.next
)
3485 switch (s
->header
.type
)
3490 case lang_wild_statement_enum
:
3491 sec
= s
->wild_statement
.section_list
;
3492 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3495 switch (sec
->spec
.sorted
)
3498 sec
->spec
.sorted
= sort_section
;
3501 if (sort_section
== by_alignment
)
3502 sec
->spec
.sorted
= by_name_alignment
;
3505 if (sort_section
== by_name
)
3506 sec
->spec
.sorted
= by_alignment_name
;
3514 case lang_constructors_statement_enum
:
3515 update_wild_statements (constructor_list
.head
);
3518 case lang_output_section_statement_enum
:
3519 update_wild_statements
3520 (s
->output_section_statement
.children
.head
);
3523 case lang_group_statement_enum
:
3524 update_wild_statements (s
->group_statement
.children
.head
);
3532 /* Open input files and attach to output sections. */
3535 map_input_to_output_sections
3536 (lang_statement_union_type
*s
, const char *target
,
3537 lang_output_section_statement_type
*os
)
3539 for (; s
!= NULL
; s
= s
->header
.next
)
3541 lang_output_section_statement_type
*tos
;
3544 switch (s
->header
.type
)
3546 case lang_wild_statement_enum
:
3547 wild (&s
->wild_statement
, target
, os
);
3549 case lang_constructors_statement_enum
:
3550 map_input_to_output_sections (constructor_list
.head
,
3554 case lang_output_section_statement_enum
:
3555 tos
= &s
->output_section_statement
;
3556 if (tos
->constraint
!= 0)
3558 if (tos
->constraint
!= ONLY_IF_RW
3559 && tos
->constraint
!= ONLY_IF_RO
)
3561 tos
->all_input_readonly
= TRUE
;
3562 check_input_sections (tos
->children
.head
, tos
);
3563 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3565 tos
->constraint
= -1;
3569 map_input_to_output_sections (tos
->children
.head
,
3573 case lang_output_statement_enum
:
3575 case lang_target_statement_enum
:
3576 target
= s
->target_statement
.target
;
3578 case lang_group_statement_enum
:
3579 map_input_to_output_sections (s
->group_statement
.children
.head
,
3583 case lang_data_statement_enum
:
3584 /* Make sure that any sections mentioned in the expression
3586 exp_init_os (s
->data_statement
.exp
);
3587 /* The output section gets CONTENTS, ALLOC and LOAD, but
3588 these may be overridden by the script. */
3589 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3590 switch (os
->sectype
)
3592 case normal_section
:
3593 case overlay_section
:
3595 case noalloc_section
:
3596 flags
= SEC_HAS_CONTENTS
;
3598 case noload_section
:
3599 if (bfd_get_flavour (link_info
.output_bfd
)
3600 == bfd_target_elf_flavour
)
3601 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3603 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3606 if (os
->bfd_section
== NULL
)
3607 init_os (os
, flags
);
3609 os
->bfd_section
->flags
|= flags
;
3611 case lang_input_section_enum
:
3613 case lang_fill_statement_enum
:
3614 case lang_object_symbols_statement_enum
:
3615 case lang_reloc_statement_enum
:
3616 case lang_padding_statement_enum
:
3617 case lang_input_statement_enum
:
3618 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3621 case lang_assignment_statement_enum
:
3622 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3625 /* Make sure that any sections mentioned in the assignment
3627 exp_init_os (s
->assignment_statement
.exp
);
3629 case lang_address_statement_enum
:
3630 /* Mark the specified section with the supplied address.
3631 If this section was actually a segment marker, then the
3632 directive is ignored if the linker script explicitly
3633 processed the segment marker. Originally, the linker
3634 treated segment directives (like -Ttext on the
3635 command-line) as section directives. We honor the
3636 section directive semantics for backwards compatibilty;
3637 linker scripts that do not specifically check for
3638 SEGMENT_START automatically get the old semantics. */
3639 if (!s
->address_statement
.segment
3640 || !s
->address_statement
.segment
->used
)
3642 const char *name
= s
->address_statement
.section_name
;
3644 /* Create the output section statement here so that
3645 orphans with a set address will be placed after other
3646 script sections. If we let the orphan placement code
3647 place them in amongst other sections then the address
3648 will affect following script sections, which is
3649 likely to surprise naive users. */
3650 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3651 tos
->addr_tree
= s
->address_statement
.address
;
3652 if (tos
->bfd_section
== NULL
)
3656 case lang_insert_statement_enum
:
3662 /* An insert statement snips out all the linker statements from the
3663 start of the list and places them after the output section
3664 statement specified by the insert. This operation is complicated
3665 by the fact that we keep a doubly linked list of output section
3666 statements as well as the singly linked list of all statements. */
3669 process_insert_statements (void)
3671 lang_statement_union_type
**s
;
3672 lang_output_section_statement_type
*first_os
= NULL
;
3673 lang_output_section_statement_type
*last_os
= NULL
;
3674 lang_output_section_statement_type
*os
;
3676 /* "start of list" is actually the statement immediately after
3677 the special abs_section output statement, so that it isn't
3679 s
= &lang_output_section_statement
.head
;
3680 while (*(s
= &(*s
)->header
.next
) != NULL
)
3682 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3684 /* Keep pointers to the first and last output section
3685 statement in the sequence we may be about to move. */
3686 os
= &(*s
)->output_section_statement
;
3688 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3691 /* Set constraint negative so that lang_output_section_find
3692 won't match this output section statement. At this
3693 stage in linking constraint has values in the range
3694 [-1, ONLY_IN_RW]. */
3695 last_os
->constraint
= -2 - last_os
->constraint
;
3696 if (first_os
== NULL
)
3699 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3701 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3702 lang_output_section_statement_type
*where
;
3703 lang_statement_union_type
**ptr
;
3704 lang_statement_union_type
*first
;
3706 where
= lang_output_section_find (i
->where
);
3707 if (where
!= NULL
&& i
->is_before
)
3710 where
= where
->prev
;
3711 while (where
!= NULL
&& where
->constraint
< 0);
3715 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3719 /* Deal with reordering the output section statement list. */
3720 if (last_os
!= NULL
)
3722 asection
*first_sec
, *last_sec
;
3723 struct lang_output_section_statement_struct
**next
;
3725 /* Snip out the output sections we are moving. */
3726 first_os
->prev
->next
= last_os
->next
;
3727 if (last_os
->next
== NULL
)
3729 next
= &first_os
->prev
->next
;
3730 lang_output_section_statement
.tail
3731 = (lang_statement_union_type
**) next
;
3734 last_os
->next
->prev
= first_os
->prev
;
3735 /* Add them in at the new position. */
3736 last_os
->next
= where
->next
;
3737 if (where
->next
== NULL
)
3739 next
= &last_os
->next
;
3740 lang_output_section_statement
.tail
3741 = (lang_statement_union_type
**) next
;
3744 where
->next
->prev
= last_os
;
3745 first_os
->prev
= where
;
3746 where
->next
= first_os
;
3748 /* Move the bfd sections in the same way. */
3751 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3753 os
->constraint
= -2 - os
->constraint
;
3754 if (os
->bfd_section
!= NULL
3755 && os
->bfd_section
->owner
!= NULL
)
3757 last_sec
= os
->bfd_section
;
3758 if (first_sec
== NULL
)
3759 first_sec
= last_sec
;
3764 if (last_sec
!= NULL
)
3766 asection
*sec
= where
->bfd_section
;
3768 sec
= output_prev_sec_find (where
);
3770 /* The place we want to insert must come after the
3771 sections we are moving. So if we find no
3772 section or if the section is the same as our
3773 last section, then no move is needed. */
3774 if (sec
!= NULL
&& sec
!= last_sec
)
3776 /* Trim them off. */
3777 if (first_sec
->prev
!= NULL
)
3778 first_sec
->prev
->next
= last_sec
->next
;
3780 link_info
.output_bfd
->sections
= last_sec
->next
;
3781 if (last_sec
->next
!= NULL
)
3782 last_sec
->next
->prev
= first_sec
->prev
;
3784 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3786 last_sec
->next
= sec
->next
;
3787 if (sec
->next
!= NULL
)
3788 sec
->next
->prev
= last_sec
;
3790 link_info
.output_bfd
->section_last
= last_sec
;
3791 first_sec
->prev
= sec
;
3792 sec
->next
= first_sec
;
3800 ptr
= insert_os_after (where
);
3801 /* Snip everything after the abs_section output statement we
3802 know is at the start of the list, up to and including
3803 the insert statement we are currently processing. */
3804 first
= lang_output_section_statement
.head
->header
.next
;
3805 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3806 /* Add them back where they belong. */
3809 statement_list
.tail
= s
;
3811 s
= &lang_output_section_statement
.head
;
3815 /* Undo constraint twiddling. */
3816 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3818 os
->constraint
= -2 - os
->constraint
;
3824 /* An output section might have been removed after its statement was
3825 added. For example, ldemul_before_allocation can remove dynamic
3826 sections if they turn out to be not needed. Clean them up here. */
3829 strip_excluded_output_sections (void)
3831 lang_output_section_statement_type
*os
;
3833 /* Run lang_size_sections (if not already done). */
3834 if (expld
.phase
!= lang_mark_phase_enum
)
3836 expld
.phase
= lang_mark_phase_enum
;
3837 expld
.dataseg
.phase
= exp_dataseg_none
;
3838 one_lang_size_sections_pass (NULL
, FALSE
);
3839 lang_reset_memory_regions ();
3842 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3846 asection
*output_section
;
3847 bfd_boolean exclude
;
3849 if (os
->constraint
< 0)
3852 output_section
= os
->bfd_section
;
3853 if (output_section
== NULL
)
3856 exclude
= (output_section
->rawsize
== 0
3857 && (output_section
->flags
& SEC_KEEP
) == 0
3858 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3861 /* Some sections have not yet been sized, notably .gnu.version,
3862 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3863 input sections, so don't drop output sections that have such
3864 input sections unless they are also marked SEC_EXCLUDE. */
3865 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3869 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3870 if ((s
->flags
& SEC_EXCLUDE
) == 0
3871 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3872 || link_info
.emitrelocations
))
3879 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3880 output_section
->map_head
.link_order
= NULL
;
3881 output_section
->map_tail
.link_order
= NULL
;
3885 /* We don't set bfd_section to NULL since bfd_section of the
3886 removed output section statement may still be used. */
3887 if (!os
->update_dot
)
3889 output_section
->flags
|= SEC_EXCLUDE
;
3890 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3891 link_info
.output_bfd
->section_count
--;
3895 /* Stop future calls to lang_add_section from messing with map_head
3896 and map_tail link_order fields. */
3897 stripped_excluded_sections
= TRUE
;
3901 print_output_section_statement
3902 (lang_output_section_statement_type
*output_section_statement
)
3904 asection
*section
= output_section_statement
->bfd_section
;
3907 if (output_section_statement
!= abs_output_section
)
3909 minfo ("\n%s", output_section_statement
->name
);
3911 if (section
!= NULL
)
3913 print_dot
= section
->vma
;
3915 len
= strlen (output_section_statement
->name
);
3916 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3921 while (len
< SECTION_NAME_MAP_LENGTH
)
3927 minfo ("0x%V %W", section
->vma
, section
->size
);
3929 if (section
->vma
!= section
->lma
)
3930 minfo (_(" load address 0x%V"), section
->lma
);
3932 if (output_section_statement
->update_dot_tree
!= NULL
)
3933 exp_fold_tree (output_section_statement
->update_dot_tree
,
3934 bfd_abs_section_ptr
, &print_dot
);
3940 print_statement_list (output_section_statement
->children
.head
,
3941 output_section_statement
);
3944 /* Scan for the use of the destination in the right hand side
3945 of an expression. In such cases we will not compute the
3946 correct expression, since the value of DST that is used on
3947 the right hand side will be its final value, not its value
3948 just before this expression is evaluated. */
3951 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3953 if (rhs
== NULL
|| dst
== NULL
)
3956 switch (rhs
->type
.node_class
)
3959 return (scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3960 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
));
3963 return (scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3964 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
));
3967 case etree_provided
:
3969 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3971 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3974 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3978 return strcmp (dst
, rhs
->value
.str
) == 0;
3983 return strcmp (dst
, rhs
->name
.name
) == 0;
3995 print_assignment (lang_assignment_statement_type
*assignment
,
3996 lang_output_section_statement_type
*output_section
)
4000 bfd_boolean computation_is_valid
= TRUE
;
4004 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4007 if (assignment
->exp
->type
.node_class
== etree_assert
)
4010 tree
= assignment
->exp
->assert_s
.child
;
4011 computation_is_valid
= TRUE
;
4015 const char *dst
= assignment
->exp
->assign
.dst
;
4017 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4018 tree
= assignment
->exp
->assign
.src
;
4019 computation_is_valid
= is_dot
|| !scan_for_self_assignment (dst
, tree
);
4022 osec
= output_section
->bfd_section
;
4024 osec
= bfd_abs_section_ptr
;
4025 exp_fold_tree (tree
, osec
, &print_dot
);
4026 if (expld
.result
.valid_p
)
4030 if (computation_is_valid
)
4032 value
= expld
.result
.value
;
4034 if (expld
.result
.section
!= NULL
)
4035 value
+= expld
.result
.section
->vma
;
4037 minfo ("0x%V", value
);
4043 struct bfd_link_hash_entry
*h
;
4045 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4046 FALSE
, FALSE
, TRUE
);
4049 value
= h
->u
.def
.value
;
4050 value
+= h
->u
.def
.section
->output_section
->vma
;
4051 value
+= h
->u
.def
.section
->output_offset
;
4053 minfo ("[0x%V]", value
);
4056 minfo ("[unresolved]");
4068 exp_print_tree (assignment
->exp
);
4073 print_input_statement (lang_input_statement_type
*statm
)
4075 if (statm
->filename
!= NULL
4076 && (statm
->the_bfd
== NULL
4077 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4078 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4081 /* Print all symbols defined in a particular section. This is called
4082 via bfd_link_hash_traverse, or by print_all_symbols. */
4085 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4087 asection
*sec
= (asection
*) ptr
;
4089 if ((hash_entry
->type
== bfd_link_hash_defined
4090 || hash_entry
->type
== bfd_link_hash_defweak
)
4091 && sec
== hash_entry
->u
.def
.section
)
4095 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4098 (hash_entry
->u
.def
.value
4099 + hash_entry
->u
.def
.section
->output_offset
4100 + hash_entry
->u
.def
.section
->output_section
->vma
));
4102 minfo (" %T\n", hash_entry
->root
.string
);
4109 hash_entry_addr_cmp (const void *a
, const void *b
)
4111 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4112 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4114 if (l
->u
.def
.value
< r
->u
.def
.value
)
4116 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4123 print_all_symbols (asection
*sec
)
4125 struct fat_user_section_struct
*ud
=
4126 (struct fat_user_section_struct
*) get_userdata (sec
);
4127 struct map_symbol_def
*def
;
4128 struct bfd_link_hash_entry
**entries
;
4134 *ud
->map_symbol_def_tail
= 0;
4136 /* Sort the symbols by address. */
4137 entries
= (struct bfd_link_hash_entry
**)
4138 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4140 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4141 entries
[i
] = def
->entry
;
4143 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4144 hash_entry_addr_cmp
);
4146 /* Print the symbols. */
4147 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4148 print_one_symbol (entries
[i
], sec
);
4150 obstack_free (&map_obstack
, entries
);
4153 /* Print information about an input section to the map file. */
4156 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4158 bfd_size_type size
= i
->size
;
4165 minfo ("%s", i
->name
);
4167 len
= 1 + strlen (i
->name
);
4168 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4173 while (len
< SECTION_NAME_MAP_LENGTH
)
4179 if (i
->output_section
!= NULL
4180 && i
->output_section
->owner
== link_info
.output_bfd
)
4181 addr
= i
->output_section
->vma
+ i
->output_offset
;
4189 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4191 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4193 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4205 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4208 if (i
->output_section
!= NULL
4209 && i
->output_section
->owner
== link_info
.output_bfd
)
4211 if (link_info
.reduce_memory_overheads
)
4212 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4214 print_all_symbols (i
);
4216 /* Update print_dot, but make sure that we do not move it
4217 backwards - this could happen if we have overlays and a
4218 later overlay is shorter than an earier one. */
4219 if (addr
+ TO_ADDR (size
) > print_dot
)
4220 print_dot
= addr
+ TO_ADDR (size
);
4225 print_fill_statement (lang_fill_statement_type
*fill
)
4229 fputs (" FILL mask 0x", config
.map_file
);
4230 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4231 fprintf (config
.map_file
, "%02x", *p
);
4232 fputs ("\n", config
.map_file
);
4236 print_data_statement (lang_data_statement_type
*data
)
4244 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4247 addr
= data
->output_offset
;
4248 if (data
->output_section
!= NULL
)
4249 addr
+= data
->output_section
->vma
;
4277 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4279 if (data
->exp
->type
.node_class
!= etree_value
)
4282 exp_print_tree (data
->exp
);
4287 print_dot
= addr
+ TO_ADDR (size
);
4290 /* Print an address statement. These are generated by options like
4294 print_address_statement (lang_address_statement_type
*address
)
4296 minfo (_("Address of section %s set to "), address
->section_name
);
4297 exp_print_tree (address
->address
);
4301 /* Print a reloc statement. */
4304 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4311 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4314 addr
= reloc
->output_offset
;
4315 if (reloc
->output_section
!= NULL
)
4316 addr
+= reloc
->output_section
->vma
;
4318 size
= bfd_get_reloc_size (reloc
->howto
);
4320 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4322 if (reloc
->name
!= NULL
)
4323 minfo ("%s+", reloc
->name
);
4325 minfo ("%s+", reloc
->section
->name
);
4327 exp_print_tree (reloc
->addend_exp
);
4331 print_dot
= addr
+ TO_ADDR (size
);
4335 print_padding_statement (lang_padding_statement_type
*s
)
4343 len
= sizeof " *fill*" - 1;
4344 while (len
< SECTION_NAME_MAP_LENGTH
)
4350 addr
= s
->output_offset
;
4351 if (s
->output_section
!= NULL
)
4352 addr
+= s
->output_section
->vma
;
4353 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4355 if (s
->fill
->size
!= 0)
4359 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4360 fprintf (config
.map_file
, "%02x", *p
);
4365 print_dot
= addr
+ TO_ADDR (s
->size
);
4369 print_wild_statement (lang_wild_statement_type
*w
,
4370 lang_output_section_statement_type
*os
)
4372 struct wildcard_list
*sec
;
4376 if (w
->filenames_sorted
)
4378 if (w
->filename
!= NULL
)
4379 minfo ("%s", w
->filename
);
4382 if (w
->filenames_sorted
)
4386 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4388 if (sec
->spec
.sorted
)
4390 if (sec
->spec
.exclude_name_list
!= NULL
)
4393 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4394 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4395 minfo (" %s", tmp
->name
);
4398 if (sec
->spec
.name
!= NULL
)
4399 minfo ("%s", sec
->spec
.name
);
4402 if (sec
->spec
.sorted
)
4411 print_statement_list (w
->children
.head
, os
);
4414 /* Print a group statement. */
4417 print_group (lang_group_statement_type
*s
,
4418 lang_output_section_statement_type
*os
)
4420 fprintf (config
.map_file
, "START GROUP\n");
4421 print_statement_list (s
->children
.head
, os
);
4422 fprintf (config
.map_file
, "END GROUP\n");
4425 /* Print the list of statements in S.
4426 This can be called for any statement type. */
4429 print_statement_list (lang_statement_union_type
*s
,
4430 lang_output_section_statement_type
*os
)
4434 print_statement (s
, os
);
4439 /* Print the first statement in statement list S.
4440 This can be called for any statement type. */
4443 print_statement (lang_statement_union_type
*s
,
4444 lang_output_section_statement_type
*os
)
4446 switch (s
->header
.type
)
4449 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4452 case lang_constructors_statement_enum
:
4453 if (constructor_list
.head
!= NULL
)
4455 if (constructors_sorted
)
4456 minfo (" SORT (CONSTRUCTORS)\n");
4458 minfo (" CONSTRUCTORS\n");
4459 print_statement_list (constructor_list
.head
, os
);
4462 case lang_wild_statement_enum
:
4463 print_wild_statement (&s
->wild_statement
, os
);
4465 case lang_address_statement_enum
:
4466 print_address_statement (&s
->address_statement
);
4468 case lang_object_symbols_statement_enum
:
4469 minfo (" CREATE_OBJECT_SYMBOLS\n");
4471 case lang_fill_statement_enum
:
4472 print_fill_statement (&s
->fill_statement
);
4474 case lang_data_statement_enum
:
4475 print_data_statement (&s
->data_statement
);
4477 case lang_reloc_statement_enum
:
4478 print_reloc_statement (&s
->reloc_statement
);
4480 case lang_input_section_enum
:
4481 print_input_section (s
->input_section
.section
, FALSE
);
4483 case lang_padding_statement_enum
:
4484 print_padding_statement (&s
->padding_statement
);
4486 case lang_output_section_statement_enum
:
4487 print_output_section_statement (&s
->output_section_statement
);
4489 case lang_assignment_statement_enum
:
4490 print_assignment (&s
->assignment_statement
, os
);
4492 case lang_target_statement_enum
:
4493 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4495 case lang_output_statement_enum
:
4496 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4497 if (output_target
!= NULL
)
4498 minfo (" %s", output_target
);
4501 case lang_input_statement_enum
:
4502 print_input_statement (&s
->input_statement
);
4504 case lang_group_statement_enum
:
4505 print_group (&s
->group_statement
, os
);
4507 case lang_insert_statement_enum
:
4508 minfo ("INSERT %s %s\n",
4509 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4510 s
->insert_statement
.where
);
4516 print_statements (void)
4518 print_statement_list (statement_list
.head
, abs_output_section
);
4521 /* Print the first N statements in statement list S to STDERR.
4522 If N == 0, nothing is printed.
4523 If N < 0, the entire list is printed.
4524 Intended to be called from GDB. */
4527 dprint_statement (lang_statement_union_type
*s
, int n
)
4529 FILE *map_save
= config
.map_file
;
4531 config
.map_file
= stderr
;
4534 print_statement_list (s
, abs_output_section
);
4537 while (s
&& --n
>= 0)
4539 print_statement (s
, abs_output_section
);
4544 config
.map_file
= map_save
;
4548 insert_pad (lang_statement_union_type
**ptr
,
4550 bfd_size_type alignment_needed
,
4551 asection
*output_section
,
4554 static fill_type zero_fill
;
4555 lang_statement_union_type
*pad
= NULL
;
4557 if (ptr
!= &statement_list
.head
)
4558 pad
= ((lang_statement_union_type
*)
4559 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4561 && pad
->header
.type
== lang_padding_statement_enum
4562 && pad
->padding_statement
.output_section
== output_section
)
4564 /* Use the existing pad statement. */
4566 else if ((pad
= *ptr
) != NULL
4567 && pad
->header
.type
== lang_padding_statement_enum
4568 && pad
->padding_statement
.output_section
== output_section
)
4570 /* Use the existing pad statement. */
4574 /* Make a new padding statement, linked into existing chain. */
4575 pad
= (lang_statement_union_type
*)
4576 stat_alloc (sizeof (lang_padding_statement_type
));
4577 pad
->header
.next
= *ptr
;
4579 pad
->header
.type
= lang_padding_statement_enum
;
4580 pad
->padding_statement
.output_section
= output_section
;
4583 pad
->padding_statement
.fill
= fill
;
4585 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4586 pad
->padding_statement
.size
= alignment_needed
;
4587 output_section
->size
+= alignment_needed
;
4590 /* Work out how much this section will move the dot point. */
4594 (lang_statement_union_type
**this_ptr
,
4595 lang_output_section_statement_type
*output_section_statement
,
4599 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4600 asection
*i
= is
->section
;
4602 if (i
->sec_info_type
!= SEC_INFO_TYPE_JUST_SYMS
4603 && (i
->flags
& SEC_EXCLUDE
) == 0)
4605 bfd_size_type alignment_needed
;
4608 /* Align this section first to the input sections requirement,
4609 then to the output section's requirement. If this alignment
4610 is greater than any seen before, then record it too. Perform
4611 the alignment by inserting a magic 'padding' statement. */
4613 if (output_section_statement
->subsection_alignment
!= -1)
4614 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4616 o
= output_section_statement
->bfd_section
;
4617 if (o
->alignment_power
< i
->alignment_power
)
4618 o
->alignment_power
= i
->alignment_power
;
4620 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4622 if (alignment_needed
!= 0)
4624 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4625 dot
+= alignment_needed
;
4628 /* Remember where in the output section this input section goes. */
4630 i
->output_offset
= dot
- o
->vma
;
4632 /* Mark how big the output section must be to contain this now. */
4633 dot
+= TO_ADDR (i
->size
);
4634 o
->size
= TO_SIZE (dot
- o
->vma
);
4638 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4645 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4647 const asection
*sec1
= *(const asection
**) arg1
;
4648 const asection
*sec2
= *(const asection
**) arg2
;
4650 if (bfd_section_lma (sec1
->owner
, sec1
)
4651 < bfd_section_lma (sec2
->owner
, sec2
))
4653 else if (bfd_section_lma (sec1
->owner
, sec1
)
4654 > bfd_section_lma (sec2
->owner
, sec2
))
4656 else if (sec1
->id
< sec2
->id
)
4658 else if (sec1
->id
> sec2
->id
)
4664 #define IGNORE_SECTION(s) \
4665 ((s->flags & SEC_ALLOC) == 0 \
4666 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4667 && (s->flags & SEC_LOAD) == 0))
4669 /* Check to see if any allocated sections overlap with other allocated
4670 sections. This can happen if a linker script specifies the output
4671 section addresses of the two sections. Also check whether any memory
4672 region has overflowed. */
4675 lang_check_section_addresses (void)
4678 asection
**sections
, **spp
;
4685 lang_memory_region_type
*m
;
4687 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4690 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4691 sections
= (asection
**) xmalloc (amt
);
4693 /* Scan all sections in the output list. */
4695 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4697 /* Only consider loadable sections with real contents. */
4698 if (!(s
->flags
& SEC_LOAD
)
4699 || !(s
->flags
& SEC_ALLOC
)
4703 sections
[count
] = s
;
4710 qsort (sections
, (size_t) count
, sizeof (asection
*),
4711 sort_sections_by_lma
);
4716 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4717 for (count
--; count
; count
--)
4719 /* We must check the sections' LMA addresses not their VMA
4720 addresses because overlay sections can have overlapping VMAs
4721 but they must have distinct LMAs. */
4727 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4729 /* Look for an overlap. We have sorted sections by lma, so we
4730 know that s_start >= p_start. Besides the obvious case of
4731 overlap when the current section starts before the previous
4732 one ends, we also must have overlap if the previous section
4733 wraps around the address space. */
4734 if (s_start
<= p_end
4736 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4737 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4742 /* If any memory region has overflowed, report by how much.
4743 We do not issue this diagnostic for regions that had sections
4744 explicitly placed outside their bounds; os_region_check's
4745 diagnostics are adequate for that case.
4747 FIXME: It is conceivable that m->current - (m->origin + m->length)
4748 might overflow a 32-bit integer. There is, alas, no way to print
4749 a bfd_vma quantity in decimal. */
4750 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4751 if (m
->had_full_message
)
4752 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4753 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4757 /* Make sure the new address is within the region. We explicitly permit the
4758 current address to be at the exact end of the region when the address is
4759 non-zero, in case the region is at the end of addressable memory and the
4760 calculation wraps around. */
4763 os_region_check (lang_output_section_statement_type
*os
,
4764 lang_memory_region_type
*region
,
4768 if ((region
->current
< region
->origin
4769 || (region
->current
- region
->origin
> region
->length
))
4770 && ((region
->current
!= region
->origin
+ region
->length
)
4775 einfo (_("%X%P: address 0x%v of %B section `%s'"
4776 " is not within region `%s'\n"),
4778 os
->bfd_section
->owner
,
4779 os
->bfd_section
->name
,
4780 region
->name_list
.name
);
4782 else if (!region
->had_full_message
)
4784 region
->had_full_message
= TRUE
;
4786 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4787 os
->bfd_section
->owner
,
4788 os
->bfd_section
->name
,
4789 region
->name_list
.name
);
4794 /* Set the sizes for all the output sections. */
4797 lang_size_sections_1
4798 (lang_statement_union_type
**prev
,
4799 lang_output_section_statement_type
*output_section_statement
,
4803 bfd_boolean check_regions
)
4805 lang_statement_union_type
*s
;
4807 /* Size up the sections from their constituent parts. */
4808 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4810 switch (s
->header
.type
)
4812 case lang_output_section_statement_enum
:
4814 bfd_vma newdot
, after
;
4815 lang_output_section_statement_type
*os
;
4816 lang_memory_region_type
*r
;
4817 int section_alignment
= 0;
4819 os
= &s
->output_section_statement
;
4820 if (os
->constraint
== -1)
4823 /* FIXME: We shouldn't need to zero section vmas for ld -r
4824 here, in lang_insert_orphan, or in the default linker scripts.
4825 This is covering for coff backend linker bugs. See PR6945. */
4826 if (os
->addr_tree
== NULL
4827 && link_info
.relocatable
4828 && (bfd_get_flavour (link_info
.output_bfd
)
4829 == bfd_target_coff_flavour
))
4830 os
->addr_tree
= exp_intop (0);
4831 if (os
->addr_tree
!= NULL
)
4833 os
->processed_vma
= FALSE
;
4834 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4836 if (expld
.result
.valid_p
)
4838 dot
= expld
.result
.value
;
4839 if (expld
.result
.section
!= NULL
)
4840 dot
+= expld
.result
.section
->vma
;
4842 else if (expld
.phase
!= lang_mark_phase_enum
)
4843 einfo (_("%F%S: non constant or forward reference"
4844 " address expression for section %s\n"),
4845 os
->addr_tree
, os
->name
);
4848 if (os
->bfd_section
== NULL
)
4849 /* This section was removed or never actually created. */
4852 /* If this is a COFF shared library section, use the size and
4853 address from the input section. FIXME: This is COFF
4854 specific; it would be cleaner if there were some other way
4855 to do this, but nothing simple comes to mind. */
4856 if (((bfd_get_flavour (link_info
.output_bfd
)
4857 == bfd_target_ecoff_flavour
)
4858 || (bfd_get_flavour (link_info
.output_bfd
)
4859 == bfd_target_coff_flavour
))
4860 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4864 if (os
->children
.head
== NULL
4865 || os
->children
.head
->header
.next
!= NULL
4866 || (os
->children
.head
->header
.type
4867 != lang_input_section_enum
))
4868 einfo (_("%P%X: Internal error on COFF shared library"
4869 " section %s\n"), os
->name
);
4871 input
= os
->children
.head
->input_section
.section
;
4872 bfd_set_section_vma (os
->bfd_section
->owner
,
4874 bfd_section_vma (input
->owner
, input
));
4875 os
->bfd_section
->size
= input
->size
;
4880 if (bfd_is_abs_section (os
->bfd_section
))
4882 /* No matter what happens, an abs section starts at zero. */
4883 ASSERT (os
->bfd_section
->vma
== 0);
4887 if (os
->addr_tree
== NULL
)
4889 /* No address specified for this section, get one
4890 from the region specification. */
4891 if (os
->region
== NULL
4892 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4893 && os
->region
->name_list
.name
[0] == '*'
4894 && strcmp (os
->region
->name_list
.name
,
4895 DEFAULT_MEMORY_REGION
) == 0))
4897 os
->region
= lang_memory_default (os
->bfd_section
);
4900 /* If a loadable section is using the default memory
4901 region, and some non default memory regions were
4902 defined, issue an error message. */
4904 && !IGNORE_SECTION (os
->bfd_section
)
4905 && ! link_info
.relocatable
4907 && strcmp (os
->region
->name_list
.name
,
4908 DEFAULT_MEMORY_REGION
) == 0
4909 && lang_memory_region_list
!= NULL
4910 && (strcmp (lang_memory_region_list
->name_list
.name
,
4911 DEFAULT_MEMORY_REGION
) != 0
4912 || lang_memory_region_list
->next
!= NULL
)
4913 && expld
.phase
!= lang_mark_phase_enum
)
4915 /* By default this is an error rather than just a
4916 warning because if we allocate the section to the
4917 default memory region we can end up creating an
4918 excessively large binary, or even seg faulting when
4919 attempting to perform a negative seek. See
4920 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4921 for an example of this. This behaviour can be
4922 overridden by the using the --no-check-sections
4924 if (command_line
.check_section_addresses
)
4925 einfo (_("%P%F: error: no memory region specified"
4926 " for loadable section `%s'\n"),
4927 bfd_get_section_name (link_info
.output_bfd
,
4930 einfo (_("%P: warning: no memory region specified"
4931 " for loadable section `%s'\n"),
4932 bfd_get_section_name (link_info
.output_bfd
,
4936 newdot
= os
->region
->current
;
4937 section_alignment
= os
->bfd_section
->alignment_power
;
4940 section_alignment
= os
->section_alignment
;
4942 /* Align to what the section needs. */
4943 if (section_alignment
> 0)
4945 bfd_vma savedot
= newdot
;
4946 newdot
= align_power (newdot
, section_alignment
);
4948 if (newdot
!= savedot
4949 && (config
.warn_section_align
4950 || os
->addr_tree
!= NULL
)
4951 && expld
.phase
!= lang_mark_phase_enum
)
4952 einfo (_("%P: warning: changing start of section"
4953 " %s by %lu bytes\n"),
4954 os
->name
, (unsigned long) (newdot
- savedot
));
4957 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4959 os
->bfd_section
->output_offset
= 0;
4962 lang_size_sections_1 (&os
->children
.head
, os
,
4963 os
->fill
, newdot
, relax
, check_regions
);
4965 os
->processed_vma
= TRUE
;
4967 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4968 /* Except for some special linker created sections,
4969 no output section should change from zero size
4970 after strip_excluded_output_sections. A non-zero
4971 size on an ignored section indicates that some
4972 input section was not sized early enough. */
4973 ASSERT (os
->bfd_section
->size
== 0);
4976 dot
= os
->bfd_section
->vma
;
4978 /* Put the section within the requested block size, or
4979 align at the block boundary. */
4981 + TO_ADDR (os
->bfd_section
->size
)
4982 + os
->block_value
- 1)
4983 & - (bfd_vma
) os
->block_value
);
4985 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4988 /* Set section lma. */
4991 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4995 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4996 os
->bfd_section
->lma
= lma
;
4998 else if (os
->lma_region
!= NULL
)
5000 bfd_vma lma
= os
->lma_region
->current
;
5002 if (section_alignment
> 0)
5003 lma
= align_power (lma
, section_alignment
);
5004 os
->bfd_section
->lma
= lma
;
5006 else if (r
->last_os
!= NULL
5007 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5012 last
= r
->last_os
->output_section_statement
.bfd_section
;
5014 /* A backwards move of dot should be accompanied by
5015 an explicit assignment to the section LMA (ie.
5016 os->load_base set) because backwards moves can
5017 create overlapping LMAs. */
5019 && os
->bfd_section
->size
!= 0
5020 && dot
+ os
->bfd_section
->size
<= last
->vma
)
5022 /* If dot moved backwards then leave lma equal to
5023 vma. This is the old default lma, which might
5024 just happen to work when the backwards move is
5025 sufficiently large. Nag if this changes anything,
5026 so people can fix their linker scripts. */
5028 if (last
->vma
!= last
->lma
)
5029 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5034 /* If this is an overlay, set the current lma to that
5035 at the end of the previous section. */
5036 if (os
->sectype
== overlay_section
)
5037 lma
= last
->lma
+ last
->size
;
5039 /* Otherwise, keep the same lma to vma relationship
5040 as the previous section. */
5042 lma
= dot
+ last
->lma
- last
->vma
;
5044 if (section_alignment
> 0)
5045 lma
= align_power (lma
, section_alignment
);
5046 os
->bfd_section
->lma
= lma
;
5049 os
->processed_lma
= TRUE
;
5051 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5054 /* Keep track of normal sections using the default
5055 lma region. We use this to set the lma for
5056 following sections. Overlays or other linker
5057 script assignment to lma might mean that the
5058 default lma == vma is incorrect.
5059 To avoid warnings about dot moving backwards when using
5060 -Ttext, don't start tracking sections until we find one
5061 of non-zero size or with lma set differently to vma. */
5062 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5063 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5064 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5065 && (os
->bfd_section
->size
!= 0
5066 || (r
->last_os
== NULL
5067 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5068 || (r
->last_os
!= NULL
5069 && dot
>= (r
->last_os
->output_section_statement
5070 .bfd_section
->vma
)))
5071 && os
->lma_region
== NULL
5072 && !link_info
.relocatable
)
5075 /* .tbss sections effectively have zero size. */
5076 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5077 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5078 || link_info
.relocatable
)
5079 dot
+= TO_ADDR (os
->bfd_section
->size
);
5081 if (os
->update_dot_tree
!= 0)
5082 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5084 /* Update dot in the region ?
5085 We only do this if the section is going to be allocated,
5086 since unallocated sections do not contribute to the region's
5087 overall size in memory. */
5088 if (os
->region
!= NULL
5089 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5091 os
->region
->current
= dot
;
5094 /* Make sure the new address is within the region. */
5095 os_region_check (os
, os
->region
, os
->addr_tree
,
5096 os
->bfd_section
->vma
);
5098 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5099 && (os
->bfd_section
->flags
& SEC_LOAD
))
5101 os
->lma_region
->current
5102 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5105 os_region_check (os
, os
->lma_region
, NULL
,
5106 os
->bfd_section
->lma
);
5112 case lang_constructors_statement_enum
:
5113 dot
= lang_size_sections_1 (&constructor_list
.head
,
5114 output_section_statement
,
5115 fill
, dot
, relax
, check_regions
);
5118 case lang_data_statement_enum
:
5120 unsigned int size
= 0;
5122 s
->data_statement
.output_offset
=
5123 dot
- output_section_statement
->bfd_section
->vma
;
5124 s
->data_statement
.output_section
=
5125 output_section_statement
->bfd_section
;
5127 /* We might refer to provided symbols in the expression, and
5128 need to mark them as needed. */
5129 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5131 switch (s
->data_statement
.type
)
5149 if (size
< TO_SIZE ((unsigned) 1))
5150 size
= TO_SIZE ((unsigned) 1);
5151 dot
+= TO_ADDR (size
);
5152 output_section_statement
->bfd_section
->size
+= size
;
5156 case lang_reloc_statement_enum
:
5160 s
->reloc_statement
.output_offset
=
5161 dot
- output_section_statement
->bfd_section
->vma
;
5162 s
->reloc_statement
.output_section
=
5163 output_section_statement
->bfd_section
;
5164 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5165 dot
+= TO_ADDR (size
);
5166 output_section_statement
->bfd_section
->size
+= size
;
5170 case lang_wild_statement_enum
:
5171 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5172 output_section_statement
,
5173 fill
, dot
, relax
, check_regions
);
5176 case lang_object_symbols_statement_enum
:
5177 link_info
.create_object_symbols_section
=
5178 output_section_statement
->bfd_section
;
5181 case lang_output_statement_enum
:
5182 case lang_target_statement_enum
:
5185 case lang_input_section_enum
:
5189 i
= s
->input_section
.section
;
5194 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5195 einfo (_("%P%F: can't relax section: %E\n"));
5199 dot
= size_input_section (prev
, output_section_statement
,
5200 output_section_statement
->fill
, dot
);
5204 case lang_input_statement_enum
:
5207 case lang_fill_statement_enum
:
5208 s
->fill_statement
.output_section
=
5209 output_section_statement
->bfd_section
;
5211 fill
= s
->fill_statement
.fill
;
5214 case lang_assignment_statement_enum
:
5216 bfd_vma newdot
= dot
;
5217 etree_type
*tree
= s
->assignment_statement
.exp
;
5219 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5221 exp_fold_tree (tree
,
5222 output_section_statement
->bfd_section
,
5225 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5227 if (!expld
.dataseg
.relro_start_stat
)
5228 expld
.dataseg
.relro_start_stat
= s
;
5231 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5234 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5236 if (!expld
.dataseg
.relro_end_stat
)
5237 expld
.dataseg
.relro_end_stat
= s
;
5240 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5243 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5245 /* This symbol may be relative to this section. */
5246 if ((tree
->type
.node_class
== etree_provided
5247 || tree
->type
.node_class
== etree_assign
)
5248 && (tree
->assign
.dst
[0] != '.'
5249 || tree
->assign
.dst
[1] != '\0'))
5250 output_section_statement
->update_dot
= 1;
5252 if (!output_section_statement
->ignored
)
5254 if (output_section_statement
== abs_output_section
)
5256 /* If we don't have an output section, then just adjust
5257 the default memory address. */
5258 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5259 FALSE
)->current
= newdot
;
5261 else if (newdot
!= dot
)
5263 /* Insert a pad after this statement. We can't
5264 put the pad before when relaxing, in case the
5265 assignment references dot. */
5266 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5267 output_section_statement
->bfd_section
, dot
);
5269 /* Don't neuter the pad below when relaxing. */
5272 /* If dot is advanced, this implies that the section
5273 should have space allocated to it, unless the
5274 user has explicitly stated that the section
5275 should not be allocated. */
5276 if (output_section_statement
->sectype
!= noalloc_section
5277 && (output_section_statement
->sectype
!= noload_section
5278 || (bfd_get_flavour (link_info
.output_bfd
)
5279 == bfd_target_elf_flavour
)))
5280 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5287 case lang_padding_statement_enum
:
5288 /* If this is the first time lang_size_sections is called,
5289 we won't have any padding statements. If this is the
5290 second or later passes when relaxing, we should allow
5291 padding to shrink. If padding is needed on this pass, it
5292 will be added back in. */
5293 s
->padding_statement
.size
= 0;
5295 /* Make sure output_offset is valid. If relaxation shrinks
5296 the section and this pad isn't needed, it's possible to
5297 have output_offset larger than the final size of the
5298 section. bfd_set_section_contents will complain even for
5299 a pad size of zero. */
5300 s
->padding_statement
.output_offset
5301 = dot
- output_section_statement
->bfd_section
->vma
;
5304 case lang_group_statement_enum
:
5305 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5306 output_section_statement
,
5307 fill
, dot
, relax
, check_regions
);
5310 case lang_insert_statement_enum
:
5313 /* We can only get here when relaxing is turned on. */
5314 case lang_address_statement_enum
:
5321 prev
= &s
->header
.next
;
5326 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5327 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5328 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5329 segments. We are allowed an opportunity to override this decision. */
5332 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5333 bfd
* abfd ATTRIBUTE_UNUSED
,
5334 asection
* current_section
,
5335 asection
* previous_section
,
5336 bfd_boolean new_segment
)
5338 lang_output_section_statement_type
* cur
;
5339 lang_output_section_statement_type
* prev
;
5341 /* The checks below are only necessary when the BFD library has decided
5342 that the two sections ought to be placed into the same segment. */
5346 /* Paranoia checks. */
5347 if (current_section
== NULL
|| previous_section
== NULL
)
5350 /* Find the memory regions associated with the two sections.
5351 We call lang_output_section_find() here rather than scanning the list
5352 of output sections looking for a matching section pointer because if
5353 we have a large number of sections then a hash lookup is faster. */
5354 cur
= lang_output_section_find (current_section
->name
);
5355 prev
= lang_output_section_find (previous_section
->name
);
5357 /* More paranoia. */
5358 if (cur
== NULL
|| prev
== NULL
)
5361 /* If the regions are different then force the sections to live in
5362 different segments. See the email thread starting at the following
5363 URL for the reasons why this is necessary:
5364 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5365 return cur
->region
!= prev
->region
;
5369 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5371 lang_statement_iteration
++;
5372 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5373 0, 0, relax
, check_regions
);
5377 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5379 expld
.phase
= lang_allocating_phase_enum
;
5380 expld
.dataseg
.phase
= exp_dataseg_none
;
5382 one_lang_size_sections_pass (relax
, check_regions
);
5383 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5384 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5386 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5387 to put expld.dataseg.relro on a (common) page boundary. */
5388 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5390 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5391 maxpage
= expld
.dataseg
.maxpagesize
;
5392 /* MIN_BASE is the absolute minimum address we are allowed to start the
5393 read-write segment (byte before will be mapped read-only). */
5394 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5395 /* OLD_BASE is the address for a feasible minimum address which will
5396 still not cause a data overlap inside MAXPAGE causing file offset skip
5398 old_base
= expld
.dataseg
.base
;
5399 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5400 & (expld
.dataseg
.pagesize
- 1));
5401 /* Compute the expected PT_GNU_RELRO segment end. */
5402 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5403 & ~(expld
.dataseg
.pagesize
- 1));
5404 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5406 expld
.dataseg
.base
-= maxpage
;
5407 relro_end
-= maxpage
;
5409 lang_reset_memory_regions ();
5410 one_lang_size_sections_pass (relax
, check_regions
);
5411 if (expld
.dataseg
.relro_end
> relro_end
)
5413 /* The alignment of sections between DATA_SEGMENT_ALIGN
5414 and DATA_SEGMENT_RELRO_END caused huge padding to be
5415 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5416 that the section alignments will fit in. */
5418 unsigned int max_alignment_power
= 0;
5420 /* Find maximum alignment power of sections between
5421 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5422 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5423 if (sec
->vma
>= expld
.dataseg
.base
5424 && sec
->vma
< expld
.dataseg
.relro_end
5425 && sec
->alignment_power
> max_alignment_power
)
5426 max_alignment_power
= sec
->alignment_power
;
5428 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5430 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5431 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5432 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5433 lang_reset_memory_regions ();
5434 one_lang_size_sections_pass (relax
, check_regions
);
5437 link_info
.relro_start
= expld
.dataseg
.base
;
5438 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5440 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5442 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5443 a page could be saved in the data segment. */
5444 bfd_vma first
, last
;
5446 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5447 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5449 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5450 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5451 && first
+ last
<= expld
.dataseg
.pagesize
)
5453 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5454 lang_reset_memory_regions ();
5455 one_lang_size_sections_pass (relax
, check_regions
);
5458 expld
.dataseg
.phase
= exp_dataseg_done
;
5461 expld
.dataseg
.phase
= exp_dataseg_done
;
5464 static lang_output_section_statement_type
*current_section
;
5465 static lang_assignment_statement_type
*current_assign
;
5466 static bfd_boolean prefer_next_section
;
5468 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5471 lang_do_assignments_1 (lang_statement_union_type
*s
,
5472 lang_output_section_statement_type
*current_os
,
5475 bfd_boolean
*found_end
)
5477 for (; s
!= NULL
; s
= s
->header
.next
)
5479 switch (s
->header
.type
)
5481 case lang_constructors_statement_enum
:
5482 dot
= lang_do_assignments_1 (constructor_list
.head
,
5483 current_os
, fill
, dot
, found_end
);
5486 case lang_output_section_statement_enum
:
5488 lang_output_section_statement_type
*os
;
5490 os
= &(s
->output_section_statement
);
5491 os
->after_end
= *found_end
;
5492 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5494 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5496 current_section
= os
;
5497 prefer_next_section
= FALSE
;
5499 dot
= os
->bfd_section
->vma
;
5501 lang_do_assignments_1 (os
->children
.head
,
5502 os
, os
->fill
, dot
, found_end
);
5504 /* .tbss sections effectively have zero size. */
5505 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5506 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5507 || link_info
.relocatable
)
5508 dot
+= TO_ADDR (os
->bfd_section
->size
);
5510 if (os
->update_dot_tree
!= NULL
)
5511 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5516 case lang_wild_statement_enum
:
5518 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5519 current_os
, fill
, dot
, found_end
);
5522 case lang_object_symbols_statement_enum
:
5523 case lang_output_statement_enum
:
5524 case lang_target_statement_enum
:
5527 case lang_data_statement_enum
:
5528 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5529 if (expld
.result
.valid_p
)
5531 s
->data_statement
.value
= expld
.result
.value
;
5532 if (expld
.result
.section
!= NULL
)
5533 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5536 einfo (_("%F%P: invalid data statement\n"));
5539 switch (s
->data_statement
.type
)
5557 if (size
< TO_SIZE ((unsigned) 1))
5558 size
= TO_SIZE ((unsigned) 1);
5559 dot
+= TO_ADDR (size
);
5563 case lang_reloc_statement_enum
:
5564 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5565 bfd_abs_section_ptr
, &dot
);
5566 if (expld
.result
.valid_p
)
5567 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5569 einfo (_("%F%P: invalid reloc statement\n"));
5570 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5573 case lang_input_section_enum
:
5575 asection
*in
= s
->input_section
.section
;
5577 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5578 dot
+= TO_ADDR (in
->size
);
5582 case lang_input_statement_enum
:
5585 case lang_fill_statement_enum
:
5586 fill
= s
->fill_statement
.fill
;
5589 case lang_assignment_statement_enum
:
5590 current_assign
= &s
->assignment_statement
;
5591 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5593 const char *p
= current_assign
->exp
->assign
.dst
;
5595 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5596 prefer_next_section
= TRUE
;
5600 if (strcmp (p
, "end") == 0)
5603 exp_fold_tree (s
->assignment_statement
.exp
,
5604 current_os
->bfd_section
,
5608 case lang_padding_statement_enum
:
5609 dot
+= TO_ADDR (s
->padding_statement
.size
);
5612 case lang_group_statement_enum
:
5613 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5614 current_os
, fill
, dot
, found_end
);
5617 case lang_insert_statement_enum
:
5620 case lang_address_statement_enum
:
5632 lang_do_assignments (lang_phase_type phase
)
5634 bfd_boolean found_end
= FALSE
;
5636 current_section
= NULL
;
5637 prefer_next_section
= FALSE
;
5638 expld
.phase
= phase
;
5639 lang_statement_iteration
++;
5640 lang_do_assignments_1 (statement_list
.head
,
5641 abs_output_section
, NULL
, 0, &found_end
);
5644 /* For an assignment statement outside of an output section statement,
5645 choose the best of neighbouring output sections to use for values
5649 section_for_dot (void)
5653 /* Assignments belong to the previous output section, unless there
5654 has been an assignment to "dot", in which case following
5655 assignments belong to the next output section. (The assumption
5656 is that an assignment to "dot" is setting up the address for the
5657 next output section.) Except that past the assignment to "_end"
5658 we always associate with the previous section. This exception is
5659 for targets like SH that define an alloc .stack or other
5660 weirdness after non-alloc sections. */
5661 if (current_section
== NULL
|| prefer_next_section
)
5663 lang_statement_union_type
*stmt
;
5664 lang_output_section_statement_type
*os
;
5666 for (stmt
= (lang_statement_union_type
*) current_assign
;
5668 stmt
= stmt
->header
.next
)
5669 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5672 os
= &stmt
->output_section_statement
;
5675 && (os
->bfd_section
== NULL
5676 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5677 || bfd_section_removed_from_list (link_info
.output_bfd
,
5681 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5684 s
= os
->bfd_section
;
5686 s
= link_info
.output_bfd
->section_last
;
5688 && ((s
->flags
& SEC_ALLOC
) == 0
5689 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5694 return bfd_abs_section_ptr
;
5698 s
= current_section
->bfd_section
;
5700 /* The section may have been stripped. */
5702 && ((s
->flags
& SEC_EXCLUDE
) != 0
5703 || (s
->flags
& SEC_ALLOC
) == 0
5704 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5705 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5708 s
= link_info
.output_bfd
->sections
;
5710 && ((s
->flags
& SEC_ALLOC
) == 0
5711 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5716 return bfd_abs_section_ptr
;
5719 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5720 operator .startof. (section_name), it produces an undefined symbol
5721 .startof.section_name. Similarly, when it sees
5722 .sizeof. (section_name), it produces an undefined symbol
5723 .sizeof.section_name. For all the output sections, we look for
5724 such symbols, and set them to the correct value. */
5727 lang_set_startof (void)
5731 if (link_info
.relocatable
)
5734 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5736 const char *secname
;
5738 struct bfd_link_hash_entry
*h
;
5740 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5741 buf
= (char *) xmalloc (10 + strlen (secname
));
5743 sprintf (buf
, ".startof.%s", secname
);
5744 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5745 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5747 h
->type
= bfd_link_hash_defined
;
5749 h
->u
.def
.section
= s
;
5752 sprintf (buf
, ".sizeof.%s", secname
);
5753 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5754 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5756 h
->type
= bfd_link_hash_defined
;
5757 h
->u
.def
.value
= TO_ADDR (s
->size
);
5758 h
->u
.def
.section
= bfd_abs_section_ptr
;
5768 struct bfd_link_hash_entry
*h
;
5771 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5772 || (link_info
.shared
&& !link_info
.executable
))
5773 warn
= entry_from_cmdline
;
5777 /* Force the user to specify a root when generating a relocatable with
5779 if (link_info
.gc_sections
&& link_info
.relocatable
5780 && !(entry_from_cmdline
|| undef_from_cmdline
))
5781 einfo (_("%P%F: gc-sections requires either an entry or "
5782 "an undefined symbol\n"));
5784 if (entry_symbol
.name
== NULL
)
5786 /* No entry has been specified. Look for the default entry, but
5787 don't warn if we don't find it. */
5788 entry_symbol
.name
= entry_symbol_default
;
5792 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5793 FALSE
, FALSE
, TRUE
);
5795 && (h
->type
== bfd_link_hash_defined
5796 || h
->type
== bfd_link_hash_defweak
)
5797 && h
->u
.def
.section
->output_section
!= NULL
)
5801 val
= (h
->u
.def
.value
5802 + bfd_get_section_vma (link_info
.output_bfd
,
5803 h
->u
.def
.section
->output_section
)
5804 + h
->u
.def
.section
->output_offset
);
5805 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5806 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5813 /* We couldn't find the entry symbol. Try parsing it as a
5815 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5818 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5819 einfo (_("%P%F: can't set start address\n"));
5825 /* Can't find the entry symbol, and it's not a number. Use
5826 the first address in the text section. */
5827 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5831 einfo (_("%P: warning: cannot find entry symbol %s;"
5832 " defaulting to %V\n"),
5834 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5835 if (!(bfd_set_start_address
5836 (link_info
.output_bfd
,
5837 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5838 einfo (_("%P%F: can't set start address\n"));
5843 einfo (_("%P: warning: cannot find entry symbol %s;"
5844 " not setting start address\n"),
5850 /* Don't bfd_hash_table_free (&lang_definedness_table);
5851 map file output may result in a call of lang_track_definedness. */
5854 /* This is a small function used when we want to ignore errors from
5858 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5860 /* Don't do anything. */
5863 /* Check that the architecture of all the input files is compatible
5864 with the output file. Also call the backend to let it do any
5865 other checking that is needed. */
5870 lang_statement_union_type
*file
;
5872 const bfd_arch_info_type
*compatible
;
5874 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5876 #ifdef ENABLE_PLUGINS
5877 /* Don't check format of files claimed by plugin. */
5878 if (file
->input_statement
.flags
.claimed
)
5880 #endif /* ENABLE_PLUGINS */
5881 input_bfd
= file
->input_statement
.the_bfd
;
5883 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5884 command_line
.accept_unknown_input_arch
);
5886 /* In general it is not possible to perform a relocatable
5887 link between differing object formats when the input
5888 file has relocations, because the relocations in the
5889 input format may not have equivalent representations in
5890 the output format (and besides BFD does not translate
5891 relocs for other link purposes than a final link). */
5892 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5893 && (compatible
== NULL
5894 || (bfd_get_flavour (input_bfd
)
5895 != bfd_get_flavour (link_info
.output_bfd
)))
5896 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5898 einfo (_("%P%F: Relocatable linking with relocations from"
5899 " format %s (%B) to format %s (%B) is not supported\n"),
5900 bfd_get_target (input_bfd
), input_bfd
,
5901 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5902 /* einfo with %F exits. */
5905 if (compatible
== NULL
)
5907 if (command_line
.warn_mismatch
)
5908 einfo (_("%P%X: %s architecture of input file `%B'"
5909 " is incompatible with %s output\n"),
5910 bfd_printable_name (input_bfd
), input_bfd
,
5911 bfd_printable_name (link_info
.output_bfd
));
5913 else if (bfd_count_sections (input_bfd
))
5915 /* If the input bfd has no contents, it shouldn't set the
5916 private data of the output bfd. */
5918 bfd_error_handler_type pfn
= NULL
;
5920 /* If we aren't supposed to warn about mismatched input
5921 files, temporarily set the BFD error handler to a
5922 function which will do nothing. We still want to call
5923 bfd_merge_private_bfd_data, since it may set up
5924 information which is needed in the output file. */
5925 if (! command_line
.warn_mismatch
)
5926 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5927 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5929 if (command_line
.warn_mismatch
)
5930 einfo (_("%P%X: failed to merge target specific data"
5931 " of file %B\n"), input_bfd
);
5933 if (! command_line
.warn_mismatch
)
5934 bfd_set_error_handler (pfn
);
5939 /* Look through all the global common symbols and attach them to the
5940 correct section. The -sort-common command line switch may be used
5941 to roughly sort the entries by alignment. */
5946 if (command_line
.inhibit_common_definition
)
5948 if (link_info
.relocatable
5949 && ! command_line
.force_common_definition
)
5952 if (! config
.sort_common
)
5953 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5958 if (config
.sort_common
== sort_descending
)
5960 for (power
= 4; power
> 0; power
--)
5961 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5964 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5968 for (power
= 0; power
<= 4; power
++)
5969 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5972 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5977 /* Place one common symbol in the correct section. */
5980 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5982 unsigned int power_of_two
;
5986 if (h
->type
!= bfd_link_hash_common
)
5990 power_of_two
= h
->u
.c
.p
->alignment_power
;
5992 if (config
.sort_common
== sort_descending
5993 && power_of_two
< *(unsigned int *) info
)
5995 else if (config
.sort_common
== sort_ascending
5996 && power_of_two
> *(unsigned int *) info
)
5999 section
= h
->u
.c
.p
->section
;
6000 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6001 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6004 if (config
.map_file
!= NULL
)
6006 static bfd_boolean header_printed
;
6011 if (! header_printed
)
6013 minfo (_("\nAllocating common symbols\n"));
6014 minfo (_("Common symbol size file\n\n"));
6015 header_printed
= TRUE
;
6018 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6019 DMGL_ANSI
| DMGL_PARAMS
);
6022 minfo ("%s", h
->root
.string
);
6023 len
= strlen (h
->root
.string
);
6028 len
= strlen (name
);
6044 if (size
<= 0xffffffff)
6045 sprintf (buf
, "%lx", (unsigned long) size
);
6047 sprintf_vma (buf
, size
);
6057 minfo ("%B\n", section
->owner
);
6063 /* Run through the input files and ensure that every input section has
6064 somewhere to go. If one is found without a destination then create
6065 an input request and place it into the statement tree. */
6068 lang_place_orphans (void)
6070 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6074 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6076 if (s
->output_section
== NULL
)
6078 /* This section of the file is not attached, root
6079 around for a sensible place for it to go. */
6081 if (file
->flags
.just_syms
)
6082 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6083 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
6084 s
->output_section
= bfd_abs_section_ptr
;
6085 else if (strcmp (s
->name
, "COMMON") == 0)
6087 /* This is a lonely common section which must have
6088 come from an archive. We attach to the section
6089 with the wildcard. */
6090 if (! link_info
.relocatable
6091 || command_line
.force_common_definition
)
6093 if (default_common_section
== NULL
)
6094 default_common_section
6095 = lang_output_section_statement_lookup (".bss", 0,
6097 lang_add_section (&default_common_section
->children
, s
,
6098 NULL
, default_common_section
);
6103 const char *name
= s
->name
;
6106 if (config
.unique_orphan_sections
6107 || unique_section_p (s
, NULL
))
6108 constraint
= SPECIAL
;
6110 if (!ldemul_place_orphan (s
, name
, constraint
))
6112 lang_output_section_statement_type
*os
;
6113 os
= lang_output_section_statement_lookup (name
,
6116 if (os
->addr_tree
== NULL
6117 && (link_info
.relocatable
6118 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6119 os
->addr_tree
= exp_intop (0);
6120 lang_add_section (&os
->children
, s
, NULL
, os
);
6129 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6131 flagword
*ptr_flags
;
6133 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6139 *ptr_flags
|= SEC_ALLOC
;
6143 *ptr_flags
|= SEC_READONLY
;
6147 *ptr_flags
|= SEC_DATA
;
6151 *ptr_flags
|= SEC_CODE
;
6156 *ptr_flags
|= SEC_LOAD
;
6160 einfo (_("%P%F: invalid syntax in flags\n"));
6167 /* Call a function on each input file. This function will be called
6168 on an archive, but not on the elements. */
6171 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6173 lang_input_statement_type
*f
;
6175 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6177 f
= (lang_input_statement_type
*) f
->next_real_file
)
6181 /* Call a function on each file. The function will be called on all
6182 the elements of an archive which are included in the link, but will
6183 not be called on the archive file itself. */
6186 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6188 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6195 ldlang_add_file (lang_input_statement_type
*entry
)
6197 lang_statement_append (&file_chain
,
6198 (lang_statement_union_type
*) entry
,
6201 /* The BFD linker needs to have a list of all input BFDs involved in
6203 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6204 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6206 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6207 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6208 entry
->the_bfd
->usrdata
= entry
;
6209 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6211 /* Look through the sections and check for any which should not be
6212 included in the link. We need to do this now, so that we can
6213 notice when the backend linker tries to report multiple
6214 definition errors for symbols which are in sections we aren't
6215 going to link. FIXME: It might be better to entirely ignore
6216 symbols which are defined in sections which are going to be
6217 discarded. This would require modifying the backend linker for
6218 each backend which might set the SEC_LINK_ONCE flag. If we do
6219 this, we should probably handle SEC_EXCLUDE in the same way. */
6221 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6225 lang_add_output (const char *name
, int from_script
)
6227 /* Make -o on command line override OUTPUT in script. */
6228 if (!had_output_filename
|| !from_script
)
6230 output_filename
= name
;
6231 had_output_filename
= TRUE
;
6244 for (l
= 0; l
< 32; l
++)
6246 if (i
>= (unsigned int) x
)
6254 lang_output_section_statement_type
*
6255 lang_enter_output_section_statement (const char *output_section_statement_name
,
6256 etree_type
*address_exp
,
6257 enum section_type sectype
,
6259 etree_type
*subalign
,
6263 lang_output_section_statement_type
*os
;
6265 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6267 current_section
= os
;
6269 if (os
->addr_tree
== NULL
)
6271 os
->addr_tree
= address_exp
;
6273 os
->sectype
= sectype
;
6274 if (sectype
!= noload_section
)
6275 os
->flags
= SEC_NO_FLAGS
;
6277 os
->flags
= SEC_NEVER_LOAD
;
6278 os
->block_value
= 1;
6280 /* Make next things chain into subchain of this. */
6281 push_stat_ptr (&os
->children
);
6283 os
->subsection_alignment
=
6284 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6285 os
->section_alignment
=
6286 topower (exp_get_value_int (align
, -1, "section alignment"));
6288 os
->load_base
= ebase
;
6295 lang_output_statement_type
*new_stmt
;
6297 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6298 new_stmt
->name
= output_filename
;
6302 /* Reset the current counters in the regions. */
6305 lang_reset_memory_regions (void)
6307 lang_memory_region_type
*p
= lang_memory_region_list
;
6309 lang_output_section_statement_type
*os
;
6311 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6313 p
->current
= p
->origin
;
6317 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6321 os
->processed_vma
= FALSE
;
6322 os
->processed_lma
= FALSE
;
6325 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6327 /* Save the last size for possible use by bfd_relax_section. */
6328 o
->rawsize
= o
->size
;
6333 /* Worker for lang_gc_sections_1. */
6336 gc_section_callback (lang_wild_statement_type
*ptr
,
6337 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6339 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6340 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6341 void *data ATTRIBUTE_UNUSED
)
6343 /* If the wild pattern was marked KEEP, the member sections
6344 should be as well. */
6345 if (ptr
->keep_sections
)
6346 section
->flags
|= SEC_KEEP
;
6349 /* Iterate over sections marking them against GC. */
6352 lang_gc_sections_1 (lang_statement_union_type
*s
)
6354 for (; s
!= NULL
; s
= s
->header
.next
)
6356 switch (s
->header
.type
)
6358 case lang_wild_statement_enum
:
6359 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6361 case lang_constructors_statement_enum
:
6362 lang_gc_sections_1 (constructor_list
.head
);
6364 case lang_output_section_statement_enum
:
6365 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6367 case lang_group_statement_enum
:
6368 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6377 lang_gc_sections (void)
6379 /* Keep all sections so marked in the link script. */
6381 lang_gc_sections_1 (statement_list
.head
);
6383 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6384 the special case of debug info. (See bfd/stabs.c)
6385 Twiddle the flag here, to simplify later linker code. */
6386 if (link_info
.relocatable
)
6388 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6391 #ifdef ENABLE_PLUGINS
6392 if (f
->flags
.claimed
)
6395 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6396 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6397 sec
->flags
&= ~SEC_EXCLUDE
;
6401 if (link_info
.gc_sections
)
6402 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6405 /* Worker for lang_find_relro_sections_1. */
6408 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6409 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6411 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6412 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6415 /* Discarded, excluded and ignored sections effectively have zero
6417 if (section
->output_section
!= NULL
6418 && section
->output_section
->owner
== link_info
.output_bfd
6419 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6420 && !IGNORE_SECTION (section
)
6421 && section
->size
!= 0)
6423 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6424 *has_relro_section
= TRUE
;
6428 /* Iterate over sections for relro sections. */
6431 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6432 bfd_boolean
*has_relro_section
)
6434 if (*has_relro_section
)
6437 for (; s
!= NULL
; s
= s
->header
.next
)
6439 if (s
== expld
.dataseg
.relro_end_stat
)
6442 switch (s
->header
.type
)
6444 case lang_wild_statement_enum
:
6445 walk_wild (&s
->wild_statement
,
6446 find_relro_section_callback
,
6449 case lang_constructors_statement_enum
:
6450 lang_find_relro_sections_1 (constructor_list
.head
,
6453 case lang_output_section_statement_enum
:
6454 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6457 case lang_group_statement_enum
:
6458 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6468 lang_find_relro_sections (void)
6470 bfd_boolean has_relro_section
= FALSE
;
6472 /* Check all sections in the link script. */
6474 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6475 &has_relro_section
);
6477 if (!has_relro_section
)
6478 link_info
.relro
= FALSE
;
6481 /* Relax all sections until bfd_relax_section gives up. */
6484 lang_relax_sections (bfd_boolean need_layout
)
6486 if (RELAXATION_ENABLED
)
6488 /* We may need more than one relaxation pass. */
6489 int i
= link_info
.relax_pass
;
6491 /* The backend can use it to determine the current pass. */
6492 link_info
.relax_pass
= 0;
6496 /* Keep relaxing until bfd_relax_section gives up. */
6497 bfd_boolean relax_again
;
6499 link_info
.relax_trip
= -1;
6502 link_info
.relax_trip
++;
6504 /* Note: pe-dll.c does something like this also. If you find
6505 you need to change this code, you probably need to change
6506 pe-dll.c also. DJ */
6508 /* Do all the assignments with our current guesses as to
6510 lang_do_assignments (lang_assigning_phase_enum
);
6512 /* We must do this after lang_do_assignments, because it uses
6514 lang_reset_memory_regions ();
6516 /* Perform another relax pass - this time we know where the
6517 globals are, so can make a better guess. */
6518 relax_again
= FALSE
;
6519 lang_size_sections (&relax_again
, FALSE
);
6521 while (relax_again
);
6523 link_info
.relax_pass
++;
6530 /* Final extra sizing to report errors. */
6531 lang_do_assignments (lang_assigning_phase_enum
);
6532 lang_reset_memory_regions ();
6533 lang_size_sections (NULL
, TRUE
);
6537 #ifdef ENABLE_PLUGINS
6538 /* Find the insert point for the plugin's replacement files. We
6539 place them after the first claimed real object file, or if the
6540 first claimed object is an archive member, after the last real
6541 object file immediately preceding the archive. In the event
6542 no objects have been claimed at all, we return the first dummy
6543 object file on the list as the insert point; that works, but
6544 the callee must be careful when relinking the file_chain as it
6545 is not actually on that chain, only the statement_list and the
6546 input_file list; in that case, the replacement files must be
6547 inserted at the head of the file_chain. */
6549 static lang_input_statement_type
*
6550 find_replacements_insert_point (void)
6552 lang_input_statement_type
*claim1
, *lastobject
;
6553 lastobject
= &input_file_chain
.head
->input_statement
;
6554 for (claim1
= &file_chain
.head
->input_statement
;
6556 claim1
= &claim1
->next
->input_statement
)
6558 if (claim1
->flags
.claimed
)
6559 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6560 /* Update lastobject if this is a real object file. */
6561 if (claim1
->the_bfd
&& (claim1
->the_bfd
->my_archive
== NULL
))
6562 lastobject
= claim1
;
6564 /* No files were claimed by the plugin. Choose the last object
6565 file found on the list (maybe the first, dummy entry) as the
6570 /* Insert SRCLIST into DESTLIST after given element by chaining
6571 on FIELD as the next-pointer. (Counterintuitively does not need
6572 a pointer to the actual after-node itself, just its chain field.) */
6575 lang_list_insert_after (lang_statement_list_type
*destlist
,
6576 lang_statement_list_type
*srclist
,
6577 lang_statement_union_type
**field
)
6579 *(srclist
->tail
) = *field
;
6580 *field
= srclist
->head
;
6581 if (destlist
->tail
== field
)
6582 destlist
->tail
= srclist
->tail
;
6585 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6586 was taken as a copy of it and leave them in ORIGLIST. */
6589 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6590 lang_statement_list_type
*origlist
)
6592 union lang_statement_union
**savetail
;
6593 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6594 ASSERT (origlist
->head
== destlist
->head
);
6595 savetail
= origlist
->tail
;
6596 origlist
->head
= *(savetail
);
6597 origlist
->tail
= destlist
->tail
;
6598 destlist
->tail
= savetail
;
6601 #endif /* ENABLE_PLUGINS */
6606 /* Finalize dynamic list. */
6607 if (link_info
.dynamic_list
)
6608 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6610 current_target
= default_target
;
6612 /* Open the output file. */
6613 lang_for_each_statement (ldlang_open_output
);
6616 ldemul_create_output_section_statements ();
6618 /* Add to the hash table all undefineds on the command line. */
6619 lang_place_undefineds ();
6621 if (!bfd_section_already_linked_table_init ())
6622 einfo (_("%P%F: Failed to create hash table\n"));
6624 /* Create a bfd for each input file. */
6625 current_target
= default_target
;
6626 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6628 #ifdef ENABLE_PLUGINS
6629 if (plugin_active_plugins_p ())
6631 lang_statement_list_type added
;
6632 lang_statement_list_type files
, inputfiles
;
6634 /* Now all files are read, let the plugin(s) decide if there
6635 are any more to be added to the link before we call the
6636 emulation's after_open hook. We create a private list of
6637 input statements for this purpose, which we will eventually
6638 insert into the global statment list after the first claimed
6641 /* We need to manipulate all three chains in synchrony. */
6643 inputfiles
= input_file_chain
;
6644 if (plugin_call_all_symbols_read ())
6645 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6646 plugin_error_plugin ());
6647 /* Open any newly added files, updating the file chains. */
6648 link_info
.loading_lto_outputs
= TRUE
;
6649 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6650 /* Restore the global list pointer now they have all been added. */
6651 lang_list_remove_tail (stat_ptr
, &added
);
6652 /* And detach the fresh ends of the file lists. */
6653 lang_list_remove_tail (&file_chain
, &files
);
6654 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6655 /* Were any new files added? */
6656 if (added
.head
!= NULL
)
6658 /* If so, we will insert them into the statement list immediately
6659 after the first input file that was claimed by the plugin. */
6660 plugin_insert
= find_replacements_insert_point ();
6661 /* If a plugin adds input files without having claimed any, we
6662 don't really have a good idea where to place them. Just putting
6663 them at the start or end of the list is liable to leave them
6664 outside the crtbegin...crtend range. */
6665 ASSERT (plugin_insert
!= NULL
);
6666 /* Splice the new statement list into the old one. */
6667 lang_list_insert_after (stat_ptr
, &added
,
6668 &plugin_insert
->header
.next
);
6669 /* Likewise for the file chains. */
6670 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6671 &plugin_insert
->next_real_file
);
6672 /* We must be careful when relinking file_chain; we may need to
6673 insert the new files at the head of the list if the insert
6674 point chosen is the dummy first input file. */
6675 if (plugin_insert
->filename
)
6676 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6678 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6680 /* Rescan archives in case new undefined symbols have appeared. */
6681 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6684 #endif /* ENABLE_PLUGINS */
6686 link_info
.gc_sym_list
= &entry_symbol
;
6687 if (entry_symbol
.name
== NULL
)
6688 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6690 ldemul_after_open ();
6692 bfd_section_already_linked_table_free ();
6694 /* Make sure that we're not mixing architectures. We call this
6695 after all the input files have been opened, but before we do any
6696 other processing, so that any operations merge_private_bfd_data
6697 does on the output file will be known during the rest of the
6701 /* Handle .exports instead of a version script if we're told to do so. */
6702 if (command_line
.version_exports_section
)
6703 lang_do_version_exports_section ();
6705 /* Build all sets based on the information gathered from the input
6707 ldctor_build_sets ();
6709 /* PR 13683: We must rerun the assignments prior to running garbage
6710 collection in order to make sure that all symbol aliases are resolved. */
6711 lang_do_assignments (lang_mark_phase_enum
);
6712 expld
.phase
= lang_first_phase_enum
;
6714 /* Remove unreferenced sections if asked to. */
6715 lang_gc_sections ();
6717 /* Size up the common data. */
6720 /* Update wild statements. */
6721 update_wild_statements (statement_list
.head
);
6723 /* Run through the contours of the script and attach input sections
6724 to the correct output sections. */
6725 lang_statement_iteration
++;
6726 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6728 process_insert_statements ();
6730 /* Find any sections not attached explicitly and handle them. */
6731 lang_place_orphans ();
6733 if (! link_info
.relocatable
)
6737 /* Merge SEC_MERGE sections. This has to be done after GC of
6738 sections, so that GCed sections are not merged, but before
6739 assigning dynamic symbols, since removing whole input sections
6741 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6743 /* Look for a text section and set the readonly attribute in it. */
6744 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6748 if (config
.text_read_only
)
6749 found
->flags
|= SEC_READONLY
;
6751 found
->flags
&= ~SEC_READONLY
;
6755 /* Do anything special before sizing sections. This is where ELF
6756 and other back-ends size dynamic sections. */
6757 ldemul_before_allocation ();
6759 /* We must record the program headers before we try to fix the
6760 section positions, since they will affect SIZEOF_HEADERS. */
6761 lang_record_phdrs ();
6763 /* Check relro sections. */
6764 if (link_info
.relro
&& ! link_info
.relocatable
)
6765 lang_find_relro_sections ();
6767 /* Size up the sections. */
6768 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6770 /* See if anything special should be done now we know how big
6771 everything is. This is where relaxation is done. */
6772 ldemul_after_allocation ();
6774 /* Fix any .startof. or .sizeof. symbols. */
6775 lang_set_startof ();
6777 /* Do all the assignments, now that we know the final resting places
6778 of all the symbols. */
6779 lang_do_assignments (lang_final_phase_enum
);
6783 /* Make sure that the section addresses make sense. */
6784 if (command_line
.check_section_addresses
)
6785 lang_check_section_addresses ();
6790 /* EXPORTED TO YACC */
6793 lang_add_wild (struct wildcard_spec
*filespec
,
6794 struct wildcard_list
*section_list
,
6795 bfd_boolean keep_sections
)
6797 struct wildcard_list
*curr
, *next
;
6798 lang_wild_statement_type
*new_stmt
;
6800 /* Reverse the list as the parser puts it back to front. */
6801 for (curr
= section_list
, section_list
= NULL
;
6803 section_list
= curr
, curr
= next
)
6805 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6806 placed_commons
= TRUE
;
6809 curr
->next
= section_list
;
6812 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6814 if (strcmp (filespec
->name
, "*") == 0)
6815 filespec
->name
= NULL
;
6816 else if (! wildcardp (filespec
->name
))
6817 lang_has_input_file
= TRUE
;
6820 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6821 new_stmt
->filename
= NULL
;
6822 new_stmt
->filenames_sorted
= FALSE
;
6823 new_stmt
->section_flag_list
= NULL
;
6824 if (filespec
!= NULL
)
6826 new_stmt
->filename
= filespec
->name
;
6827 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6828 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
6830 new_stmt
->section_list
= section_list
;
6831 new_stmt
->keep_sections
= keep_sections
;
6832 lang_list_init (&new_stmt
->children
);
6833 analyze_walk_wild_section_handler (new_stmt
);
6837 lang_section_start (const char *name
, etree_type
*address
,
6838 const segment_type
*segment
)
6840 lang_address_statement_type
*ad
;
6842 ad
= new_stat (lang_address_statement
, stat_ptr
);
6843 ad
->section_name
= name
;
6844 ad
->address
= address
;
6845 ad
->segment
= segment
;
6848 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6849 because of a -e argument on the command line, or zero if this is
6850 called by ENTRY in a linker script. Command line arguments take
6854 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6856 if (entry_symbol
.name
== NULL
6858 || ! entry_from_cmdline
)
6860 entry_symbol
.name
= name
;
6861 entry_from_cmdline
= cmdline
;
6865 /* Set the default start symbol to NAME. .em files should use this,
6866 not lang_add_entry, to override the use of "start" if neither the
6867 linker script nor the command line specifies an entry point. NAME
6868 must be permanently allocated. */
6870 lang_default_entry (const char *name
)
6872 entry_symbol_default
= name
;
6876 lang_add_target (const char *name
)
6878 lang_target_statement_type
*new_stmt
;
6880 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6881 new_stmt
->target
= name
;
6885 lang_add_map (const char *name
)
6892 map_option_f
= TRUE
;
6900 lang_add_fill (fill_type
*fill
)
6902 lang_fill_statement_type
*new_stmt
;
6904 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6905 new_stmt
->fill
= fill
;
6909 lang_add_data (int type
, union etree_union
*exp
)
6911 lang_data_statement_type
*new_stmt
;
6913 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6914 new_stmt
->exp
= exp
;
6915 new_stmt
->type
= type
;
6918 /* Create a new reloc statement. RELOC is the BFD relocation type to
6919 generate. HOWTO is the corresponding howto structure (we could
6920 look this up, but the caller has already done so). SECTION is the
6921 section to generate a reloc against, or NAME is the name of the
6922 symbol to generate a reloc against. Exactly one of SECTION and
6923 NAME must be NULL. ADDEND is an expression for the addend. */
6926 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6927 reloc_howto_type
*howto
,
6930 union etree_union
*addend
)
6932 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6936 p
->section
= section
;
6938 p
->addend_exp
= addend
;
6940 p
->addend_value
= 0;
6941 p
->output_section
= NULL
;
6942 p
->output_offset
= 0;
6945 lang_assignment_statement_type
*
6946 lang_add_assignment (etree_type
*exp
)
6948 lang_assignment_statement_type
*new_stmt
;
6950 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6951 new_stmt
->exp
= exp
;
6956 lang_add_attribute (enum statement_enum attribute
)
6958 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6962 lang_startup (const char *name
)
6964 if (first_file
->filename
!= NULL
)
6966 einfo (_("%P%F: multiple STARTUP files\n"));
6968 first_file
->filename
= name
;
6969 first_file
->local_sym_name
= name
;
6970 first_file
->flags
.real
= TRUE
;
6974 lang_float (bfd_boolean maybe
)
6976 lang_float_flag
= maybe
;
6980 /* Work out the load- and run-time regions from a script statement, and
6981 store them in *LMA_REGION and *REGION respectively.
6983 MEMSPEC is the name of the run-time region, or the value of
6984 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6985 LMA_MEMSPEC is the name of the load-time region, or null if the
6986 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6987 had an explicit load address.
6989 It is an error to specify both a load region and a load address. */
6992 lang_get_regions (lang_memory_region_type
**region
,
6993 lang_memory_region_type
**lma_region
,
6994 const char *memspec
,
6995 const char *lma_memspec
,
6996 bfd_boolean have_lma
,
6997 bfd_boolean have_vma
)
6999 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7001 /* If no runtime region or VMA has been specified, but the load region
7002 has been specified, then use the load region for the runtime region
7004 if (lma_memspec
!= NULL
7006 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7007 *region
= *lma_region
;
7009 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7011 if (have_lma
&& lma_memspec
!= 0)
7012 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7017 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7018 lang_output_section_phdr_list
*phdrs
,
7019 const char *lma_memspec
)
7021 lang_get_regions (¤t_section
->region
,
7022 ¤t_section
->lma_region
,
7023 memspec
, lma_memspec
,
7024 current_section
->load_base
!= NULL
,
7025 current_section
->addr_tree
!= NULL
);
7027 /* If this section has no load region or base, but uses the same
7028 region as the previous section, then propagate the previous
7029 section's load region. */
7031 if (current_section
->lma_region
== NULL
7032 && current_section
->load_base
== NULL
7033 && current_section
->addr_tree
== NULL
7034 && current_section
->region
== current_section
->prev
->region
)
7035 current_section
->lma_region
= current_section
->prev
->lma_region
;
7037 current_section
->fill
= fill
;
7038 current_section
->phdrs
= phdrs
;
7043 lang_statement_append (lang_statement_list_type
*list
,
7044 lang_statement_union_type
*element
,
7045 lang_statement_union_type
**field
)
7047 *(list
->tail
) = element
;
7051 /* Set the output format type. -oformat overrides scripts. */
7054 lang_add_output_format (const char *format
,
7059 if (output_target
== NULL
|| !from_script
)
7061 if (command_line
.endian
== ENDIAN_BIG
7064 else if (command_line
.endian
== ENDIAN_LITTLE
7068 output_target
= format
;
7073 lang_add_insert (const char *where
, int is_before
)
7075 lang_insert_statement_type
*new_stmt
;
7077 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7078 new_stmt
->where
= where
;
7079 new_stmt
->is_before
= is_before
;
7080 saved_script_handle
= previous_script_handle
;
7083 /* Enter a group. This creates a new lang_group_statement, and sets
7084 stat_ptr to build new statements within the group. */
7087 lang_enter_group (void)
7089 lang_group_statement_type
*g
;
7091 g
= new_stat (lang_group_statement
, stat_ptr
);
7092 lang_list_init (&g
->children
);
7093 push_stat_ptr (&g
->children
);
7096 /* Leave a group. This just resets stat_ptr to start writing to the
7097 regular list of statements again. Note that this will not work if
7098 groups can occur inside anything else which can adjust stat_ptr,
7099 but currently they can't. */
7102 lang_leave_group (void)
7107 /* Add a new program header. This is called for each entry in a PHDRS
7108 command in a linker script. */
7111 lang_new_phdr (const char *name
,
7113 bfd_boolean filehdr
,
7118 struct lang_phdr
*n
, **pp
;
7121 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7124 n
->type
= exp_get_value_int (type
, 0, "program header type");
7125 n
->filehdr
= filehdr
;
7130 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7132 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7135 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7137 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7138 " when prior PT_LOAD headers lack them\n"), NULL
);
7145 /* Record the program header information in the output BFD. FIXME: We
7146 should not be calling an ELF specific function here. */
7149 lang_record_phdrs (void)
7153 lang_output_section_phdr_list
*last
;
7154 struct lang_phdr
*l
;
7155 lang_output_section_statement_type
*os
;
7158 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7161 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7168 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7172 lang_output_section_phdr_list
*pl
;
7174 if (os
->constraint
< 0)
7182 if (os
->sectype
== noload_section
7183 || os
->bfd_section
== NULL
7184 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7187 /* Don't add orphans to PT_INTERP header. */
7193 lang_output_section_statement_type
* tmp_os
;
7195 /* If we have not run across a section with a program
7196 header assigned to it yet, then scan forwards to find
7197 one. This prevents inconsistencies in the linker's
7198 behaviour when a script has specified just a single
7199 header and there are sections in that script which are
7200 not assigned to it, and which occur before the first
7201 use of that header. See here for more details:
7202 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7203 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7206 last
= tmp_os
->phdrs
;
7210 einfo (_("%F%P: no sections assigned to phdrs\n"));
7215 if (os
->bfd_section
== NULL
)
7218 for (; pl
!= NULL
; pl
= pl
->next
)
7220 if (strcmp (pl
->name
, l
->name
) == 0)
7225 secs
= (asection
**) xrealloc (secs
,
7226 alc
* sizeof (asection
*));
7228 secs
[c
] = os
->bfd_section
;
7235 if (l
->flags
== NULL
)
7238 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7243 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7245 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7246 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7247 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7248 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7253 /* Make sure all the phdr assignments succeeded. */
7254 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7258 lang_output_section_phdr_list
*pl
;
7260 if (os
->constraint
< 0
7261 || os
->bfd_section
== NULL
)
7264 for (pl
= os
->phdrs
;
7267 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7268 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7269 os
->name
, pl
->name
);
7273 /* Record a list of sections which may not be cross referenced. */
7276 lang_add_nocrossref (lang_nocrossref_type
*l
)
7278 struct lang_nocrossrefs
*n
;
7280 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7281 n
->next
= nocrossref_list
;
7283 nocrossref_list
= n
;
7285 /* Set notice_all so that we get informed about all symbols. */
7286 link_info
.notice_all
= TRUE
;
7289 /* Overlay handling. We handle overlays with some static variables. */
7291 /* The overlay virtual address. */
7292 static etree_type
*overlay_vma
;
7293 /* And subsection alignment. */
7294 static etree_type
*overlay_subalign
;
7296 /* An expression for the maximum section size seen so far. */
7297 static etree_type
*overlay_max
;
7299 /* A list of all the sections in this overlay. */
7301 struct overlay_list
{
7302 struct overlay_list
*next
;
7303 lang_output_section_statement_type
*os
;
7306 static struct overlay_list
*overlay_list
;
7308 /* Start handling an overlay. */
7311 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7313 /* The grammar should prevent nested overlays from occurring. */
7314 ASSERT (overlay_vma
== NULL
7315 && overlay_subalign
== NULL
7316 && overlay_max
== NULL
);
7318 overlay_vma
= vma_expr
;
7319 overlay_subalign
= subalign
;
7322 /* Start a section in an overlay. We handle this by calling
7323 lang_enter_output_section_statement with the correct VMA.
7324 lang_leave_overlay sets up the LMA and memory regions. */
7327 lang_enter_overlay_section (const char *name
)
7329 struct overlay_list
*n
;
7332 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7333 0, overlay_subalign
, 0, 0);
7335 /* If this is the first section, then base the VMA of future
7336 sections on this one. This will work correctly even if `.' is
7337 used in the addresses. */
7338 if (overlay_list
== NULL
)
7339 overlay_vma
= exp_nameop (ADDR
, name
);
7341 /* Remember the section. */
7342 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7343 n
->os
= current_section
;
7344 n
->next
= overlay_list
;
7347 size
= exp_nameop (SIZEOF
, name
);
7349 /* Arrange to work out the maximum section end address. */
7350 if (overlay_max
== NULL
)
7353 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7356 /* Finish a section in an overlay. There isn't any special to do
7360 lang_leave_overlay_section (fill_type
*fill
,
7361 lang_output_section_phdr_list
*phdrs
)
7368 name
= current_section
->name
;
7370 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7371 region and that no load-time region has been specified. It doesn't
7372 really matter what we say here, since lang_leave_overlay will
7374 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7376 /* Define the magic symbols. */
7378 clean
= (char *) xmalloc (strlen (name
) + 1);
7380 for (s1
= name
; *s1
!= '\0'; s1
++)
7381 if (ISALNUM (*s1
) || *s1
== '_')
7385 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7386 sprintf (buf
, "__load_start_%s", clean
);
7387 lang_add_assignment (exp_provide (buf
,
7388 exp_nameop (LOADADDR
, name
),
7391 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7392 sprintf (buf
, "__load_stop_%s", clean
);
7393 lang_add_assignment (exp_provide (buf
,
7395 exp_nameop (LOADADDR
, name
),
7396 exp_nameop (SIZEOF
, name
)),
7402 /* Finish an overlay. If there are any overlay wide settings, this
7403 looks through all the sections in the overlay and sets them. */
7406 lang_leave_overlay (etree_type
*lma_expr
,
7409 const char *memspec
,
7410 lang_output_section_phdr_list
*phdrs
,
7411 const char *lma_memspec
)
7413 lang_memory_region_type
*region
;
7414 lang_memory_region_type
*lma_region
;
7415 struct overlay_list
*l
;
7416 lang_nocrossref_type
*nocrossref
;
7418 lang_get_regions (®ion
, &lma_region
,
7419 memspec
, lma_memspec
,
7420 lma_expr
!= NULL
, FALSE
);
7424 /* After setting the size of the last section, set '.' to end of the
7426 if (overlay_list
!= NULL
)
7428 overlay_list
->os
->update_dot
= 1;
7429 overlay_list
->os
->update_dot_tree
7430 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
));
7436 struct overlay_list
*next
;
7438 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7441 l
->os
->region
= region
;
7442 l
->os
->lma_region
= lma_region
;
7444 /* The first section has the load address specified in the
7445 OVERLAY statement. The rest are worked out from that.
7446 The base address is not needed (and should be null) if
7447 an LMA region was specified. */
7450 l
->os
->load_base
= lma_expr
;
7451 l
->os
->sectype
= normal_section
;
7453 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7454 l
->os
->phdrs
= phdrs
;
7458 lang_nocrossref_type
*nc
;
7460 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7461 nc
->name
= l
->os
->name
;
7462 nc
->next
= nocrossref
;
7471 if (nocrossref
!= NULL
)
7472 lang_add_nocrossref (nocrossref
);
7475 overlay_list
= NULL
;
7479 /* Version handling. This is only useful for ELF. */
7481 /* If PREV is NULL, return first version pattern matching particular symbol.
7482 If PREV is non-NULL, return first version pattern matching particular
7483 symbol after PREV (previously returned by lang_vers_match). */
7485 static struct bfd_elf_version_expr
*
7486 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7487 struct bfd_elf_version_expr
*prev
,
7491 const char *cxx_sym
= sym
;
7492 const char *java_sym
= sym
;
7493 struct bfd_elf_version_expr
*expr
= NULL
;
7494 enum demangling_styles curr_style
;
7496 curr_style
= CURRENT_DEMANGLING_STYLE
;
7497 cplus_demangle_set_style (no_demangling
);
7498 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7501 cplus_demangle_set_style (curr_style
);
7503 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7505 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7506 DMGL_PARAMS
| DMGL_ANSI
);
7510 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7512 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7517 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7519 struct bfd_elf_version_expr e
;
7521 switch (prev
? prev
->mask
: 0)
7524 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7527 expr
= (struct bfd_elf_version_expr
*)
7528 htab_find ((htab_t
) head
->htab
, &e
);
7529 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7530 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7536 case BFD_ELF_VERSION_C_TYPE
:
7537 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7539 e
.pattern
= cxx_sym
;
7540 expr
= (struct bfd_elf_version_expr
*)
7541 htab_find ((htab_t
) head
->htab
, &e
);
7542 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7543 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7549 case BFD_ELF_VERSION_CXX_TYPE
:
7550 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7552 e
.pattern
= java_sym
;
7553 expr
= (struct bfd_elf_version_expr
*)
7554 htab_find ((htab_t
) head
->htab
, &e
);
7555 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7556 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7567 /* Finally, try the wildcards. */
7568 if (prev
== NULL
|| prev
->literal
)
7569 expr
= head
->remaining
;
7572 for (; expr
; expr
= expr
->next
)
7579 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7582 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7584 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7588 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7594 free ((char *) c_sym
);
7596 free ((char *) cxx_sym
);
7597 if (java_sym
!= sym
)
7598 free ((char *) java_sym
);
7602 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7603 return a pointer to the symbol name with any backslash quotes removed. */
7606 realsymbol (const char *pattern
)
7609 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7610 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7612 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7614 /* It is a glob pattern only if there is no preceding
7618 /* Remove the preceding backslash. */
7625 if (*p
== '?' || *p
== '*' || *p
== '[')
7632 backslash
= *p
== '\\';
7648 /* This is called for each variable name or match expression. NEW_NAME is
7649 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7650 pattern to be matched against symbol names. */
7652 struct bfd_elf_version_expr
*
7653 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7654 const char *new_name
,
7656 bfd_boolean literal_p
)
7658 struct bfd_elf_version_expr
*ret
;
7660 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7664 ret
->literal
= TRUE
;
7665 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7666 if (ret
->pattern
== NULL
)
7668 ret
->pattern
= new_name
;
7669 ret
->literal
= FALSE
;
7672 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7673 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7674 else if (strcasecmp (lang
, "C++") == 0)
7675 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7676 else if (strcasecmp (lang
, "Java") == 0)
7677 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7680 einfo (_("%X%P: unknown language `%s' in version information\n"),
7682 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7685 return ldemul_new_vers_pattern (ret
);
7688 /* This is called for each set of variable names and match
7691 struct bfd_elf_version_tree
*
7692 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7693 struct bfd_elf_version_expr
*locals
)
7695 struct bfd_elf_version_tree
*ret
;
7697 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7698 ret
->globals
.list
= globals
;
7699 ret
->locals
.list
= locals
;
7700 ret
->match
= lang_vers_match
;
7701 ret
->name_indx
= (unsigned int) -1;
7705 /* This static variable keeps track of version indices. */
7707 static int version_index
;
7710 version_expr_head_hash (const void *p
)
7712 const struct bfd_elf_version_expr
*e
=
7713 (const struct bfd_elf_version_expr
*) p
;
7715 return htab_hash_string (e
->pattern
);
7719 version_expr_head_eq (const void *p1
, const void *p2
)
7721 const struct bfd_elf_version_expr
*e1
=
7722 (const struct bfd_elf_version_expr
*) p1
;
7723 const struct bfd_elf_version_expr
*e2
=
7724 (const struct bfd_elf_version_expr
*) p2
;
7726 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7730 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7733 struct bfd_elf_version_expr
*e
, *next
;
7734 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7736 for (e
= head
->list
; e
; e
= e
->next
)
7740 head
->mask
|= e
->mask
;
7745 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7746 version_expr_head_eq
, NULL
);
7747 list_loc
= &head
->list
;
7748 remaining_loc
= &head
->remaining
;
7749 for (e
= head
->list
; e
; e
= next
)
7755 remaining_loc
= &e
->next
;
7759 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7763 struct bfd_elf_version_expr
*e1
, *last
;
7765 e1
= (struct bfd_elf_version_expr
*) *loc
;
7769 if (e1
->mask
== e
->mask
)
7777 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7781 /* This is a duplicate. */
7782 /* FIXME: Memory leak. Sometimes pattern is not
7783 xmalloced alone, but in larger chunk of memory. */
7784 /* free (e->pattern); */
7789 e
->next
= last
->next
;
7797 list_loc
= &e
->next
;
7801 *remaining_loc
= NULL
;
7802 *list_loc
= head
->remaining
;
7805 head
->remaining
= head
->list
;
7808 /* This is called when we know the name and dependencies of the
7812 lang_register_vers_node (const char *name
,
7813 struct bfd_elf_version_tree
*version
,
7814 struct bfd_elf_version_deps
*deps
)
7816 struct bfd_elf_version_tree
*t
, **pp
;
7817 struct bfd_elf_version_expr
*e1
;
7822 if (link_info
.version_info
!= NULL
7823 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
7825 einfo (_("%X%P: anonymous version tag cannot be combined"
7826 " with other version tags\n"));
7831 /* Make sure this node has a unique name. */
7832 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7833 if (strcmp (t
->name
, name
) == 0)
7834 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7836 lang_finalize_version_expr_head (&version
->globals
);
7837 lang_finalize_version_expr_head (&version
->locals
);
7839 /* Check the global and local match names, and make sure there
7840 aren't any duplicates. */
7842 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7844 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7846 struct bfd_elf_version_expr
*e2
;
7848 if (t
->locals
.htab
&& e1
->literal
)
7850 e2
= (struct bfd_elf_version_expr
*)
7851 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7852 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7854 if (e1
->mask
== e2
->mask
)
7855 einfo (_("%X%P: duplicate expression `%s'"
7856 " in version information\n"), e1
->pattern
);
7860 else if (!e1
->literal
)
7861 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7862 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7863 && e1
->mask
== e2
->mask
)
7864 einfo (_("%X%P: duplicate expression `%s'"
7865 " in version information\n"), e1
->pattern
);
7869 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7871 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7873 struct bfd_elf_version_expr
*e2
;
7875 if (t
->globals
.htab
&& e1
->literal
)
7877 e2
= (struct bfd_elf_version_expr
*)
7878 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7879 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7881 if (e1
->mask
== e2
->mask
)
7882 einfo (_("%X%P: duplicate expression `%s'"
7883 " in version information\n"),
7888 else if (!e1
->literal
)
7889 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7890 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7891 && e1
->mask
== e2
->mask
)
7892 einfo (_("%X%P: duplicate expression `%s'"
7893 " in version information\n"), e1
->pattern
);
7897 version
->deps
= deps
;
7898 version
->name
= name
;
7899 if (name
[0] != '\0')
7902 version
->vernum
= version_index
;
7905 version
->vernum
= 0;
7907 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7912 /* This is called when we see a version dependency. */
7914 struct bfd_elf_version_deps
*
7915 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7917 struct bfd_elf_version_deps
*ret
;
7918 struct bfd_elf_version_tree
*t
;
7920 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7923 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7925 if (strcmp (t
->name
, name
) == 0)
7927 ret
->version_needed
= t
;
7932 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7934 ret
->version_needed
= NULL
;
7939 lang_do_version_exports_section (void)
7941 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7943 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7945 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7953 contents
= (char *) xmalloc (len
);
7954 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7955 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7958 while (p
< contents
+ len
)
7960 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7961 p
= strchr (p
, '\0') + 1;
7964 /* Do not free the contents, as we used them creating the regex. */
7966 /* Do not include this section in the link. */
7967 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7970 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7971 lang_register_vers_node (command_line
.version_exports_section
,
7972 lang_new_vers_node (greg
, lreg
), NULL
);
7976 lang_add_unique (const char *name
)
7978 struct unique_sections
*ent
;
7980 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7981 if (strcmp (ent
->name
, name
) == 0)
7984 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7985 ent
->name
= xstrdup (name
);
7986 ent
->next
= unique_section_list
;
7987 unique_section_list
= ent
;
7990 /* Append the list of dynamic symbols to the existing one. */
7993 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7995 if (link_info
.dynamic_list
)
7997 struct bfd_elf_version_expr
*tail
;
7998 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8000 tail
->next
= link_info
.dynamic_list
->head
.list
;
8001 link_info
.dynamic_list
->head
.list
= dynamic
;
8005 struct bfd_elf_dynamic_list
*d
;
8007 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8008 d
->head
.list
= dynamic
;
8009 d
->match
= lang_vers_match
;
8010 link_info
.dynamic_list
= d
;
8014 /* Append the list of C++ typeinfo dynamic symbols to the existing
8018 lang_append_dynamic_list_cpp_typeinfo (void)
8020 const char * symbols
[] =
8022 "typeinfo name for*",
8025 struct bfd_elf_version_expr
*dynamic
= NULL
;
8028 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8029 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8032 lang_append_dynamic_list (dynamic
);
8035 /* Append the list of C++ operator new and delete dynamic symbols to the
8039 lang_append_dynamic_list_cpp_new (void)
8041 const char * symbols
[] =
8046 struct bfd_elf_version_expr
*dynamic
= NULL
;
8049 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8050 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8053 lang_append_dynamic_list (dynamic
);
8056 /* Scan a space and/or comma separated string of features. */
8059 lang_ld_feature (char *str
)
8067 while (*p
== ',' || ISSPACE (*p
))
8072 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8076 if (strcasecmp (p
, "SANE_EXPR") == 0)
8077 config
.sane_expr
= TRUE
;
8079 einfo (_("%X%P: unknown feature `%s'\n"), p
);