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/.dtors.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 bfd_link_hash_table_free (link_info
.output_bfd
, link_info
.hash
);
1244 bfd_hash_table_free (&lang_definedness_table
);
1245 output_section_statement_table_free ();
1248 /*----------------------------------------------------------------------
1249 A region is an area of memory declared with the
1250 MEMORY { name:org=exp, len=exp ... }
1253 We maintain a list of all the regions here.
1255 If no regions are specified in the script, then the default is used
1256 which is created when looked up to be the entire data space.
1258 If create is true we are creating a region inside a MEMORY block.
1259 In this case it is probably an error to create a region that has
1260 already been created. If we are not inside a MEMORY block it is
1261 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1262 and so we issue a warning.
1264 Each region has at least one name. The first name is either
1265 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1266 alias names to an existing region within a script with
1267 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1270 static lang_memory_region_type
*lang_memory_region_list
;
1271 static lang_memory_region_type
**lang_memory_region_list_tail
1272 = &lang_memory_region_list
;
1274 lang_memory_region_type
*
1275 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1277 lang_memory_region_name
*n
;
1278 lang_memory_region_type
*r
;
1279 lang_memory_region_type
*new_region
;
1281 /* NAME is NULL for LMA memspecs if no region was specified. */
1285 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1286 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1287 if (strcmp (n
->name
, name
) == 0)
1290 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1295 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1296 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1299 new_region
= (lang_memory_region_type
*)
1300 stat_alloc (sizeof (lang_memory_region_type
));
1302 new_region
->name_list
.name
= xstrdup (name
);
1303 new_region
->name_list
.next
= NULL
;
1304 new_region
->next
= NULL
;
1305 new_region
->origin
= 0;
1306 new_region
->length
= ~(bfd_size_type
) 0;
1307 new_region
->current
= 0;
1308 new_region
->last_os
= NULL
;
1309 new_region
->flags
= 0;
1310 new_region
->not_flags
= 0;
1311 new_region
->had_full_message
= FALSE
;
1313 *lang_memory_region_list_tail
= new_region
;
1314 lang_memory_region_list_tail
= &new_region
->next
;
1320 lang_memory_region_alias (const char * alias
, const char * region_name
)
1322 lang_memory_region_name
* n
;
1323 lang_memory_region_type
* r
;
1324 lang_memory_region_type
* region
;
1326 /* The default region must be unique. This ensures that it is not necessary
1327 to iterate through the name list if someone wants the check if a region is
1328 the default memory region. */
1329 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1330 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1331 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL
);
1333 /* Look for the target region and check if the alias is not already
1336 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1337 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1339 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1341 if (strcmp (n
->name
, alias
) == 0)
1342 einfo (_("%F%P:%S: error: redefinition of memory region "
1347 /* Check if the target region exists. */
1349 einfo (_("%F%P:%S: error: memory region `%s' "
1350 "for alias `%s' does not exist\n"),
1351 NULL
, region_name
, alias
);
1353 /* Add alias to region name list. */
1354 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1355 n
->name
= xstrdup (alias
);
1356 n
->next
= region
->name_list
.next
;
1357 region
->name_list
.next
= n
;
1360 static lang_memory_region_type
*
1361 lang_memory_default (asection
* section
)
1363 lang_memory_region_type
*p
;
1365 flagword sec_flags
= section
->flags
;
1367 /* Override SEC_DATA to mean a writable section. */
1368 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1369 sec_flags
|= SEC_DATA
;
1371 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1373 if ((p
->flags
& sec_flags
) != 0
1374 && (p
->not_flags
& sec_flags
) == 0)
1379 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1382 /* Find or create an output_section_statement with the given NAME.
1383 If CONSTRAINT is non-zero match one with that constraint, otherwise
1384 match any non-negative constraint. If CREATE, always make a
1385 new output_section_statement for SPECIAL CONSTRAINT. */
1387 lang_output_section_statement_type
*
1388 lang_output_section_statement_lookup (const char *name
,
1392 struct out_section_hash_entry
*entry
;
1394 entry
= ((struct out_section_hash_entry
*)
1395 bfd_hash_lookup (&output_section_statement_table
, name
,
1400 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1404 if (entry
->s
.output_section_statement
.name
!= NULL
)
1406 /* We have a section of this name, but it might not have the correct
1408 struct out_section_hash_entry
*last_ent
;
1410 name
= entry
->s
.output_section_statement
.name
;
1411 if (create
&& constraint
== SPECIAL
)
1412 /* Not traversing to the end reverses the order of the second
1413 and subsequent SPECIAL sections in the hash table chain,
1414 but that shouldn't matter. */
1419 if (constraint
== entry
->s
.output_section_statement
.constraint
1421 && entry
->s
.output_section_statement
.constraint
>= 0))
1422 return &entry
->s
.output_section_statement
;
1424 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1426 while (entry
!= NULL
1427 && name
== entry
->s
.output_section_statement
.name
);
1433 = ((struct out_section_hash_entry
*)
1434 output_section_statement_newfunc (NULL
,
1435 &output_section_statement_table
,
1439 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1442 entry
->root
= last_ent
->root
;
1443 last_ent
->root
.next
= &entry
->root
;
1446 entry
->s
.output_section_statement
.name
= name
;
1447 entry
->s
.output_section_statement
.constraint
= constraint
;
1448 return &entry
->s
.output_section_statement
;
1451 /* Find the next output_section_statement with the same name as OS.
1452 If CONSTRAINT is non-zero, find one with that constraint otherwise
1453 match any non-negative constraint. */
1455 lang_output_section_statement_type
*
1456 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1459 /* All output_section_statements are actually part of a
1460 struct out_section_hash_entry. */
1461 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1463 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1464 const char *name
= os
->name
;
1466 ASSERT (name
== entry
->root
.string
);
1469 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1471 || name
!= entry
->s
.output_section_statement
.name
)
1474 while (constraint
!= entry
->s
.output_section_statement
.constraint
1476 || entry
->s
.output_section_statement
.constraint
< 0));
1478 return &entry
->s
.output_section_statement
;
1481 /* A variant of lang_output_section_find used by place_orphan.
1482 Returns the output statement that should precede a new output
1483 statement for SEC. If an exact match is found on certain flags,
1486 lang_output_section_statement_type
*
1487 lang_output_section_find_by_flags (const asection
*sec
,
1488 lang_output_section_statement_type
**exact
,
1489 lang_match_sec_type_func match_type
)
1491 lang_output_section_statement_type
*first
, *look
, *found
;
1494 /* We know the first statement on this list is *ABS*. May as well
1496 first
= &lang_output_section_statement
.head
->output_section_statement
;
1497 first
= first
->next
;
1499 /* First try for an exact match. */
1501 for (look
= first
; look
; look
= look
->next
)
1503 flags
= look
->flags
;
1504 if (look
->bfd_section
!= NULL
)
1506 flags
= look
->bfd_section
->flags
;
1507 if (match_type
&& !match_type (link_info
.output_bfd
,
1512 flags
^= sec
->flags
;
1513 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1514 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1524 if ((sec
->flags
& SEC_CODE
) != 0
1525 && (sec
->flags
& SEC_ALLOC
) != 0)
1527 /* Try for a rw code section. */
1528 for (look
= first
; look
; look
= look
->next
)
1530 flags
= look
->flags
;
1531 if (look
->bfd_section
!= NULL
)
1533 flags
= look
->bfd_section
->flags
;
1534 if (match_type
&& !match_type (link_info
.output_bfd
,
1539 flags
^= sec
->flags
;
1540 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1541 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1545 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1546 && (sec
->flags
& SEC_ALLOC
) != 0)
1548 /* .rodata can go after .text, .sdata2 after .rodata. */
1549 for (look
= first
; look
; look
= look
->next
)
1551 flags
= look
->flags
;
1552 if (look
->bfd_section
!= NULL
)
1554 flags
= look
->bfd_section
->flags
;
1555 if (match_type
&& !match_type (link_info
.output_bfd
,
1560 flags
^= sec
->flags
;
1561 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1562 | SEC_READONLY
| SEC_SMALL_DATA
))
1563 || (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1565 && !(look
->flags
& SEC_SMALL_DATA
))
1566 || (!(flags
& (SEC_THREAD_LOCAL
| SEC_ALLOC
))
1567 && (look
->flags
& SEC_THREAD_LOCAL
)
1568 && (!(flags
& SEC_LOAD
)
1569 || (look
->flags
& SEC_LOAD
))))
1573 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1574 && (sec
->flags
& SEC_ALLOC
) != 0)
1576 /* .sdata goes after .data, .sbss after .sdata. */
1577 for (look
= first
; look
; look
= look
->next
)
1579 flags
= look
->flags
;
1580 if (look
->bfd_section
!= NULL
)
1582 flags
= look
->bfd_section
->flags
;
1583 if (match_type
&& !match_type (link_info
.output_bfd
,
1588 flags
^= sec
->flags
;
1589 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1590 | SEC_THREAD_LOCAL
))
1591 || ((look
->flags
& SEC_SMALL_DATA
)
1592 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1596 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1597 && (sec
->flags
& SEC_ALLOC
) != 0)
1599 /* .data goes after .rodata. */
1600 for (look
= first
; look
; look
= look
->next
)
1602 flags
= look
->flags
;
1603 if (look
->bfd_section
!= NULL
)
1605 flags
= look
->bfd_section
->flags
;
1606 if (match_type
&& !match_type (link_info
.output_bfd
,
1611 flags
^= sec
->flags
;
1612 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1613 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1617 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1619 /* .bss goes after any other alloc section. */
1620 for (look
= first
; look
; look
= look
->next
)
1622 flags
= look
->flags
;
1623 if (look
->bfd_section
!= NULL
)
1625 flags
= look
->bfd_section
->flags
;
1626 if (match_type
&& !match_type (link_info
.output_bfd
,
1631 flags
^= sec
->flags
;
1632 if (!(flags
& SEC_ALLOC
))
1638 /* non-alloc go last. */
1639 for (look
= first
; look
; look
= look
->next
)
1641 flags
= look
->flags
;
1642 if (look
->bfd_section
!= NULL
)
1643 flags
= look
->bfd_section
->flags
;
1644 flags
^= sec
->flags
;
1645 if (!(flags
& SEC_DEBUGGING
))
1651 if (found
|| !match_type
)
1654 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1657 /* Find the last output section before given output statement.
1658 Used by place_orphan. */
1661 output_prev_sec_find (lang_output_section_statement_type
*os
)
1663 lang_output_section_statement_type
*lookup
;
1665 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1667 if (lookup
->constraint
< 0)
1670 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1671 return lookup
->bfd_section
;
1677 /* Look for a suitable place for a new output section statement. The
1678 idea is to skip over anything that might be inside a SECTIONS {}
1679 statement in a script, before we find another output section
1680 statement. Assignments to "dot" before an output section statement
1681 are assumed to belong to it, except in two cases; The first
1682 assignment to dot, and assignments before non-alloc sections.
1683 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1684 similar assignments that set the initial address, or we might
1685 insert non-alloc note sections among assignments setting end of
1688 static lang_statement_union_type
**
1689 insert_os_after (lang_output_section_statement_type
*after
)
1691 lang_statement_union_type
**where
;
1692 lang_statement_union_type
**assign
= NULL
;
1693 bfd_boolean ignore_first
;
1696 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1698 for (where
= &after
->header
.next
;
1700 where
= &(*where
)->header
.next
)
1702 switch ((*where
)->header
.type
)
1704 case lang_assignment_statement_enum
:
1707 lang_assignment_statement_type
*ass
;
1709 ass
= &(*where
)->assignment_statement
;
1710 if (ass
->exp
->type
.node_class
!= etree_assert
1711 && ass
->exp
->assign
.dst
[0] == '.'
1712 && ass
->exp
->assign
.dst
[1] == 0
1716 ignore_first
= FALSE
;
1718 case lang_wild_statement_enum
:
1719 case lang_input_section_enum
:
1720 case lang_object_symbols_statement_enum
:
1721 case lang_fill_statement_enum
:
1722 case lang_data_statement_enum
:
1723 case lang_reloc_statement_enum
:
1724 case lang_padding_statement_enum
:
1725 case lang_constructors_statement_enum
:
1728 case lang_output_section_statement_enum
:
1731 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1734 || s
->map_head
.s
== NULL
1735 || (s
->flags
& SEC_ALLOC
) != 0)
1739 case lang_input_statement_enum
:
1740 case lang_address_statement_enum
:
1741 case lang_target_statement_enum
:
1742 case lang_output_statement_enum
:
1743 case lang_group_statement_enum
:
1744 case lang_insert_statement_enum
:
1753 lang_output_section_statement_type
*
1754 lang_insert_orphan (asection
*s
,
1755 const char *secname
,
1757 lang_output_section_statement_type
*after
,
1758 struct orphan_save
*place
,
1759 etree_type
*address
,
1760 lang_statement_list_type
*add_child
)
1762 lang_statement_list_type add
;
1764 lang_output_section_statement_type
*os
;
1765 lang_output_section_statement_type
**os_tail
;
1767 /* If we have found an appropriate place for the output section
1768 statements for this orphan, add them to our own private list,
1769 inserting them later into the global statement list. */
1772 lang_list_init (&add
);
1773 push_stat_ptr (&add
);
1776 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1777 address
= exp_intop (0);
1779 os_tail
= ((lang_output_section_statement_type
**)
1780 lang_output_section_statement
.tail
);
1781 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1782 NULL
, NULL
, NULL
, constraint
);
1785 if (config
.build_constructors
&& *os_tail
== os
)
1787 /* If the name of the section is representable in C, then create
1788 symbols to mark the start and the end of the section. */
1789 for (ps
= secname
; *ps
!= '\0'; ps
++)
1790 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1796 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1797 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1798 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1799 lang_add_assignment (exp_provide (symname
,
1800 exp_nameop (NAME
, "."),
1805 if (add_child
== NULL
)
1806 add_child
= &os
->children
;
1807 lang_add_section (add_child
, s
, NULL
, os
);
1809 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1811 const char *region
= (after
->region
1812 ? after
->region
->name_list
.name
1813 : DEFAULT_MEMORY_REGION
);
1814 const char *lma_region
= (after
->lma_region
1815 ? after
->lma_region
->name_list
.name
1817 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1821 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1824 if (ps
!= NULL
&& *ps
== '\0')
1828 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1829 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1830 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1831 lang_add_assignment (exp_provide (symname
,
1832 exp_nameop (NAME
, "."),
1836 /* Restore the global list pointer. */
1840 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1842 asection
*snew
, *as
;
1844 snew
= os
->bfd_section
;
1846 /* Shuffle the bfd section list to make the output file look
1847 neater. This is really only cosmetic. */
1848 if (place
->section
== NULL
1849 && after
!= (&lang_output_section_statement
.head
1850 ->output_section_statement
))
1852 asection
*bfd_section
= after
->bfd_section
;
1854 /* If the output statement hasn't been used to place any input
1855 sections (and thus doesn't have an output bfd_section),
1856 look for the closest prior output statement having an
1858 if (bfd_section
== NULL
)
1859 bfd_section
= output_prev_sec_find (after
);
1861 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1862 place
->section
= &bfd_section
->next
;
1865 if (place
->section
== NULL
)
1866 place
->section
= &link_info
.output_bfd
->sections
;
1868 as
= *place
->section
;
1872 /* Put the section at the end of the list. */
1874 /* Unlink the section. */
1875 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1877 /* Now tack it back on in the right place. */
1878 bfd_section_list_append (link_info
.output_bfd
, snew
);
1880 else if (as
!= snew
&& as
->prev
!= snew
)
1882 /* Unlink the section. */
1883 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1885 /* Now tack it back on in the right place. */
1886 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1889 /* Save the end of this list. Further ophans of this type will
1890 follow the one we've just added. */
1891 place
->section
= &snew
->next
;
1893 /* The following is non-cosmetic. We try to put the output
1894 statements in some sort of reasonable order here, because they
1895 determine the final load addresses of the orphan sections.
1896 In addition, placing output statements in the wrong order may
1897 require extra segments. For instance, given a typical
1898 situation of all read-only sections placed in one segment and
1899 following that a segment containing all the read-write
1900 sections, we wouldn't want to place an orphan read/write
1901 section before or amongst the read-only ones. */
1902 if (add
.head
!= NULL
)
1904 lang_output_section_statement_type
*newly_added_os
;
1906 if (place
->stmt
== NULL
)
1908 lang_statement_union_type
**where
= insert_os_after (after
);
1913 place
->os_tail
= &after
->next
;
1917 /* Put it after the last orphan statement we added. */
1918 *add
.tail
= *place
->stmt
;
1919 *place
->stmt
= add
.head
;
1922 /* Fix the global list pointer if we happened to tack our
1923 new list at the tail. */
1924 if (*stat_ptr
->tail
== add
.head
)
1925 stat_ptr
->tail
= add
.tail
;
1927 /* Save the end of this list. */
1928 place
->stmt
= add
.tail
;
1930 /* Do the same for the list of output section statements. */
1931 newly_added_os
= *os_tail
;
1933 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1934 ((char *) place
->os_tail
1935 - offsetof (lang_output_section_statement_type
, next
));
1936 newly_added_os
->next
= *place
->os_tail
;
1937 if (newly_added_os
->next
!= NULL
)
1938 newly_added_os
->next
->prev
= newly_added_os
;
1939 *place
->os_tail
= newly_added_os
;
1940 place
->os_tail
= &newly_added_os
->next
;
1942 /* Fixing the global list pointer here is a little different.
1943 We added to the list in lang_enter_output_section_statement,
1944 trimmed off the new output_section_statment above when
1945 assigning *os_tail = NULL, but possibly added it back in
1946 the same place when assigning *place->os_tail. */
1947 if (*os_tail
== NULL
)
1948 lang_output_section_statement
.tail
1949 = (lang_statement_union_type
**) os_tail
;
1956 lang_map_flags (flagword flag
)
1958 if (flag
& SEC_ALLOC
)
1961 if (flag
& SEC_CODE
)
1964 if (flag
& SEC_READONLY
)
1967 if (flag
& SEC_DATA
)
1970 if (flag
& SEC_LOAD
)
1977 lang_memory_region_type
*m
;
1978 bfd_boolean dis_header_printed
= FALSE
;
1981 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1985 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1986 || file
->flags
.just_syms
)
1989 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1990 if ((s
->output_section
== NULL
1991 || s
->output_section
->owner
!= link_info
.output_bfd
)
1992 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1994 if (! dis_header_printed
)
1996 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1997 dis_header_printed
= TRUE
;
2000 print_input_section (s
, TRUE
);
2004 minfo (_("\nMemory Configuration\n\n"));
2005 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2006 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2008 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2013 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2015 sprintf_vma (buf
, m
->origin
);
2016 minfo ("0x%s ", buf
);
2024 minfo ("0x%V", m
->length
);
2025 if (m
->flags
|| m
->not_flags
)
2033 lang_map_flags (m
->flags
);
2039 lang_map_flags (m
->not_flags
);
2046 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2048 if (! link_info
.reduce_memory_overheads
)
2050 obstack_begin (&map_obstack
, 1000);
2051 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
2052 bfd_map_over_sections (p
, init_map_userdata
, 0);
2053 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2055 lang_statement_iteration
++;
2056 print_statements ();
2060 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
2062 void *data ATTRIBUTE_UNUSED
)
2064 fat_section_userdata_type
*new_data
2065 = ((fat_section_userdata_type
*) (stat_alloc
2066 (sizeof (fat_section_userdata_type
))));
2068 ASSERT (get_userdata (sec
) == NULL
);
2069 get_userdata (sec
) = new_data
;
2070 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
2071 new_data
->map_symbol_def_count
= 0;
2075 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2076 void *info ATTRIBUTE_UNUSED
)
2078 if (hash_entry
->type
== bfd_link_hash_defined
2079 || hash_entry
->type
== bfd_link_hash_defweak
)
2081 struct fat_user_section_struct
*ud
;
2082 struct map_symbol_def
*def
;
2084 ud
= (struct fat_user_section_struct
*)
2085 get_userdata (hash_entry
->u
.def
.section
);
2088 /* ??? What do we have to do to initialize this beforehand? */
2089 /* The first time we get here is bfd_abs_section... */
2090 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
2091 ud
= (struct fat_user_section_struct
*)
2092 get_userdata (hash_entry
->u
.def
.section
);
2094 else if (!ud
->map_symbol_def_tail
)
2095 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2097 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2098 def
->entry
= hash_entry
;
2099 *(ud
->map_symbol_def_tail
) = def
;
2100 ud
->map_symbol_def_tail
= &def
->next
;
2101 ud
->map_symbol_def_count
++;
2106 /* Initialize an output section. */
2109 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2111 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2112 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2114 if (s
->constraint
!= SPECIAL
)
2115 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2116 if (s
->bfd_section
== NULL
)
2117 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2119 if (s
->bfd_section
== NULL
)
2121 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2122 link_info
.output_bfd
->xvec
->name
, s
->name
);
2124 s
->bfd_section
->output_section
= s
->bfd_section
;
2125 s
->bfd_section
->output_offset
= 0;
2127 if (!link_info
.reduce_memory_overheads
)
2129 fat_section_userdata_type
*new_userdata
= (fat_section_userdata_type
*)
2130 stat_alloc (sizeof (fat_section_userdata_type
));
2131 memset (new_userdata
, 0, sizeof (fat_section_userdata_type
));
2132 get_userdata (s
->bfd_section
) = new_userdata
;
2135 /* If there is a base address, make sure that any sections it might
2136 mention are initialized. */
2137 if (s
->addr_tree
!= NULL
)
2138 exp_init_os (s
->addr_tree
);
2140 if (s
->load_base
!= NULL
)
2141 exp_init_os (s
->load_base
);
2143 /* If supplied an alignment, set it. */
2144 if (s
->section_alignment
!= -1)
2145 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2148 /* Make sure that all output sections mentioned in an expression are
2152 exp_init_os (etree_type
*exp
)
2154 switch (exp
->type
.node_class
)
2158 exp_init_os (exp
->assign
.src
);
2162 exp_init_os (exp
->binary
.lhs
);
2163 exp_init_os (exp
->binary
.rhs
);
2167 exp_init_os (exp
->trinary
.cond
);
2168 exp_init_os (exp
->trinary
.lhs
);
2169 exp_init_os (exp
->trinary
.rhs
);
2173 exp_init_os (exp
->assert_s
.child
);
2177 exp_init_os (exp
->unary
.child
);
2181 switch (exp
->type
.node_code
)
2187 lang_output_section_statement_type
*os
;
2189 os
= lang_output_section_find (exp
->name
.name
);
2190 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2202 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2204 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2206 /* If we are only reading symbols from this object, then we want to
2207 discard all sections. */
2208 if (entry
->flags
.just_syms
)
2210 bfd_link_just_syms (abfd
, sec
, &link_info
);
2214 if (!(abfd
->flags
& DYNAMIC
))
2215 bfd_section_already_linked (abfd
, sec
, &link_info
);
2218 /* The wild routines.
2220 These expand statements like *(.text) and foo.o to a list of
2221 explicit actions, like foo.o(.text), bar.o(.text) and
2222 foo.o(.text, .data). */
2224 /* Add SECTION to the output section OUTPUT. Do this by creating a
2225 lang_input_section statement which is placed at PTR. */
2228 lang_add_section (lang_statement_list_type
*ptr
,
2230 struct flag_info
*sflag_info
,
2231 lang_output_section_statement_type
*output
)
2233 flagword flags
= section
->flags
;
2235 bfd_boolean discard
;
2236 lang_input_section_type
*new_section
;
2237 bfd
*abfd
= link_info
.output_bfd
;
2239 /* Discard sections marked with SEC_EXCLUDE. */
2240 discard
= (flags
& SEC_EXCLUDE
) != 0;
2242 /* Discard input sections which are assigned to a section named
2243 DISCARD_SECTION_NAME. */
2244 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2247 /* Discard debugging sections if we are stripping debugging
2249 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2250 && (flags
& SEC_DEBUGGING
) != 0)
2255 if (section
->output_section
== NULL
)
2257 /* This prevents future calls from assigning this section. */
2258 section
->output_section
= bfd_abs_section_ptr
;
2267 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2272 if (section
->output_section
!= NULL
)
2275 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2276 to an output section, because we want to be able to include a
2277 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2278 section (I don't know why we want to do this, but we do).
2279 build_link_order in ldwrite.c handles this case by turning
2280 the embedded SEC_NEVER_LOAD section into a fill. */
2281 flags
&= ~ SEC_NEVER_LOAD
;
2283 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2284 already been processed. One reason to do this is that on pe
2285 format targets, .text$foo sections go into .text and it's odd
2286 to see .text with SEC_LINK_ONCE set. */
2288 if (!link_info
.relocatable
)
2289 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2291 switch (output
->sectype
)
2293 case normal_section
:
2294 case overlay_section
:
2296 case noalloc_section
:
2297 flags
&= ~SEC_ALLOC
;
2299 case noload_section
:
2301 flags
|= SEC_NEVER_LOAD
;
2302 /* Unfortunately GNU ld has managed to evolve two different
2303 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2304 alloc, no contents section. All others get a noload, noalloc
2306 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2307 flags
&= ~SEC_HAS_CONTENTS
;
2309 flags
&= ~SEC_ALLOC
;
2313 if (output
->bfd_section
== NULL
)
2314 init_os (output
, flags
);
2316 /* If SEC_READONLY is not set in the input section, then clear
2317 it from the output section. */
2318 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2320 if (output
->bfd_section
->linker_has_input
)
2322 /* Only set SEC_READONLY flag on the first input section. */
2323 flags
&= ~ SEC_READONLY
;
2325 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2326 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2327 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2328 || ((flags
& SEC_MERGE
) != 0
2329 && output
->bfd_section
->entsize
!= section
->entsize
))
2331 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2332 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2335 output
->bfd_section
->flags
|= flags
;
2337 if (!output
->bfd_section
->linker_has_input
)
2339 output
->bfd_section
->linker_has_input
= 1;
2340 /* This must happen after flags have been updated. The output
2341 section may have been created before we saw its first input
2342 section, eg. for a data statement. */
2343 bfd_init_private_section_data (section
->owner
, section
,
2344 link_info
.output_bfd
,
2345 output
->bfd_section
,
2347 if ((flags
& SEC_MERGE
) != 0)
2348 output
->bfd_section
->entsize
= section
->entsize
;
2351 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2352 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2354 /* FIXME: This value should really be obtained from the bfd... */
2355 output
->block_value
= 128;
2358 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2359 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2361 section
->output_section
= output
->bfd_section
;
2363 if (!link_info
.relocatable
2364 && !stripped_excluded_sections
)
2366 asection
*s
= output
->bfd_section
->map_tail
.s
;
2367 output
->bfd_section
->map_tail
.s
= section
;
2368 section
->map_head
.s
= NULL
;
2369 section
->map_tail
.s
= s
;
2371 s
->map_head
.s
= section
;
2373 output
->bfd_section
->map_head
.s
= section
;
2376 /* Add a section reference to the list. */
2377 new_section
= new_stat (lang_input_section
, ptr
);
2378 new_section
->section
= section
;
2381 /* Handle wildcard sorting. This returns the lang_input_section which
2382 should follow the one we are going to create for SECTION and FILE,
2383 based on the sorting requirements of WILD. It returns NULL if the
2384 new section should just go at the end of the current list. */
2386 static lang_statement_union_type
*
2387 wild_sort (lang_wild_statement_type
*wild
,
2388 struct wildcard_list
*sec
,
2389 lang_input_statement_type
*file
,
2392 lang_statement_union_type
*l
;
2394 if (!wild
->filenames_sorted
2395 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2398 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2400 lang_input_section_type
*ls
;
2402 if (l
->header
.type
!= lang_input_section_enum
)
2404 ls
= &l
->input_section
;
2406 /* Sorting by filename takes precedence over sorting by section
2409 if (wild
->filenames_sorted
)
2411 const char *fn
, *ln
;
2415 /* The PE support for the .idata section as generated by
2416 dlltool assumes that files will be sorted by the name of
2417 the archive and then the name of the file within the
2420 if (file
->the_bfd
!= NULL
2421 && bfd_my_archive (file
->the_bfd
) != NULL
)
2423 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2428 fn
= file
->filename
;
2432 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2434 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2439 ln
= ls
->section
->owner
->filename
;
2443 i
= filename_cmp (fn
, ln
);
2452 fn
= file
->filename
;
2454 ln
= ls
->section
->owner
->filename
;
2456 i
= filename_cmp (fn
, ln
);
2464 /* Here either the files are not sorted by name, or we are
2465 looking at the sections for this file. */
2468 && sec
->spec
.sorted
!= none
2469 && sec
->spec
.sorted
!= by_none
)
2470 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2477 /* Expand a wild statement for a particular FILE. SECTION may be
2478 NULL, in which case it is a wild card. */
2481 output_section_callback (lang_wild_statement_type
*ptr
,
2482 struct wildcard_list
*sec
,
2484 struct flag_info
*sflag_info
,
2485 lang_input_statement_type
*file
,
2488 lang_statement_union_type
*before
;
2489 lang_output_section_statement_type
*os
;
2491 os
= (lang_output_section_statement_type
*) output
;
2493 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2494 if (unique_section_p (section
, os
))
2497 before
= wild_sort (ptr
, sec
, file
, section
);
2499 /* Here BEFORE points to the lang_input_section which
2500 should follow the one we are about to add. If BEFORE
2501 is NULL, then the section should just go at the end
2502 of the current list. */
2505 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2508 lang_statement_list_type list
;
2509 lang_statement_union_type
**pp
;
2511 lang_list_init (&list
);
2512 lang_add_section (&list
, section
, sflag_info
, os
);
2514 /* If we are discarding the section, LIST.HEAD will
2516 if (list
.head
!= NULL
)
2518 ASSERT (list
.head
->header
.next
== NULL
);
2520 for (pp
= &ptr
->children
.head
;
2522 pp
= &(*pp
)->header
.next
)
2523 ASSERT (*pp
!= NULL
);
2525 list
.head
->header
.next
= *pp
;
2531 /* Check if all sections in a wild statement for a particular FILE
2535 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2536 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2538 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2539 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2542 lang_output_section_statement_type
*os
;
2544 os
= (lang_output_section_statement_type
*) output
;
2546 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2547 if (unique_section_p (section
, os
))
2550 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2551 os
->all_input_readonly
= FALSE
;
2554 /* This is passed a file name which must have been seen already and
2555 added to the statement tree. We will see if it has been opened
2556 already and had its symbols read. If not then we'll read it. */
2558 static lang_input_statement_type
*
2559 lookup_name (const char *name
)
2561 lang_input_statement_type
*search
;
2563 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2565 search
= (lang_input_statement_type
*) search
->next_real_file
)
2567 /* Use the local_sym_name as the name of the file that has
2568 already been loaded as filename might have been transformed
2569 via the search directory lookup mechanism. */
2570 const char *filename
= search
->local_sym_name
;
2572 if (filename
!= NULL
2573 && filename_cmp (filename
, name
) == 0)
2578 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2579 default_target
, FALSE
);
2581 /* If we have already added this file, or this file is not real
2582 don't add this file. */
2583 if (search
->flags
.loaded
|| !search
->flags
.real
)
2586 if (! load_symbols (search
, NULL
))
2592 /* Save LIST as a list of libraries whose symbols should not be exported. */
2597 struct excluded_lib
*next
;
2599 static struct excluded_lib
*excluded_libs
;
2602 add_excluded_libs (const char *list
)
2604 const char *p
= list
, *end
;
2608 struct excluded_lib
*entry
;
2609 end
= strpbrk (p
, ",:");
2611 end
= p
+ strlen (p
);
2612 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2613 entry
->next
= excluded_libs
;
2614 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2615 memcpy (entry
->name
, p
, end
- p
);
2616 entry
->name
[end
- p
] = '\0';
2617 excluded_libs
= entry
;
2625 check_excluded_libs (bfd
*abfd
)
2627 struct excluded_lib
*lib
= excluded_libs
;
2631 int len
= strlen (lib
->name
);
2632 const char *filename
= lbasename (abfd
->filename
);
2634 if (strcmp (lib
->name
, "ALL") == 0)
2636 abfd
->no_export
= TRUE
;
2640 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2641 && (filename
[len
] == '\0'
2642 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2643 && filename
[len
+ 2] == '\0')))
2645 abfd
->no_export
= TRUE
;
2653 /* Get the symbols for an input file. */
2656 load_symbols (lang_input_statement_type
*entry
,
2657 lang_statement_list_type
*place
)
2661 if (entry
->flags
.loaded
)
2664 ldfile_open_file (entry
);
2666 /* Do not process further if the file was missing. */
2667 if (entry
->flags
.missing_file
)
2670 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2671 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2674 struct lang_input_statement_flags save_flags
;
2677 err
= bfd_get_error ();
2679 /* See if the emulation has some special knowledge. */
2680 if (ldemul_unrecognized_file (entry
))
2683 if (err
== bfd_error_file_ambiguously_recognized
)
2687 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2688 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2689 for (p
= matching
; *p
!= NULL
; p
++)
2693 else if (err
!= bfd_error_file_not_recognized
2695 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2697 bfd_close (entry
->the_bfd
);
2698 entry
->the_bfd
= NULL
;
2700 /* Try to interpret the file as a linker script. */
2701 save_flags
= input_flags
;
2702 ldfile_open_command_file (entry
->filename
);
2704 push_stat_ptr (place
);
2705 input_flags
.add_DT_NEEDED_for_regular
2706 = entry
->flags
.add_DT_NEEDED_for_regular
;
2707 input_flags
.add_DT_NEEDED_for_dynamic
2708 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2709 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2710 input_flags
.dynamic
= entry
->flags
.dynamic
;
2712 ldfile_assumed_script
= TRUE
;
2713 parser_input
= input_script
;
2715 ldfile_assumed_script
= FALSE
;
2717 /* missing_file is sticky. sysrooted will already have been
2718 restored when seeing EOF in yyparse, but no harm to restore
2720 save_flags
.missing_file
|= input_flags
.missing_file
;
2721 input_flags
= save_flags
;
2725 entry
->flags
.loaded
= TRUE
;
2730 if (ldemul_recognized_file (entry
))
2733 /* We don't call ldlang_add_file for an archive. Instead, the
2734 add_symbols entry point will call ldlang_add_file, via the
2735 add_archive_element callback, for each element of the archive
2737 switch (bfd_get_format (entry
->the_bfd
))
2743 #ifdef ENABLE_PLUGINS
2744 if (!entry
->flags
.reload
)
2746 ldlang_add_file (entry
);
2747 if (trace_files
|| verbose
)
2748 info_msg ("%I\n", entry
);
2752 check_excluded_libs (entry
->the_bfd
);
2754 if (entry
->flags
.whole_archive
)
2757 bfd_boolean loaded
= TRUE
;
2762 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2767 if (! bfd_check_format (member
, bfd_object
))
2769 einfo (_("%F%B: member %B in archive is not an object\n"),
2770 entry
->the_bfd
, member
);
2775 if (!(*link_info
.callbacks
2776 ->add_archive_element
) (&link_info
, member
,
2777 "--whole-archive", &subsbfd
))
2780 /* Potentially, the add_archive_element hook may have set a
2781 substitute BFD for us. */
2782 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2784 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2789 entry
->flags
.loaded
= loaded
;
2795 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2796 entry
->flags
.loaded
= TRUE
;
2798 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2800 return entry
->flags
.loaded
;
2803 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2804 may be NULL, indicating that it is a wildcard. Separate
2805 lang_input_section statements are created for each part of the
2806 expansion; they are added after the wild statement S. OUTPUT is
2807 the output section. */
2810 wild (lang_wild_statement_type
*s
,
2811 const char *target ATTRIBUTE_UNUSED
,
2812 lang_output_section_statement_type
*output
)
2814 struct wildcard_list
*sec
;
2816 if (s
->handler_data
[0]
2817 && s
->handler_data
[0]->spec
.sorted
== by_name
2818 && !s
->filenames_sorted
)
2820 lang_section_bst_type
*tree
;
2822 walk_wild (s
, output_section_callback_fast
, output
);
2827 output_section_callback_tree_to_list (s
, tree
, output
);
2832 walk_wild (s
, output_section_callback
, output
);
2834 if (default_common_section
== NULL
)
2835 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2836 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2838 /* Remember the section that common is going to in case we
2839 later get something which doesn't know where to put it. */
2840 default_common_section
= output
;
2845 /* Return TRUE iff target is the sought target. */
2848 get_target (const bfd_target
*target
, void *data
)
2850 const char *sought
= (const char *) data
;
2852 return strcmp (target
->name
, sought
) == 0;
2855 /* Like strcpy() but convert to lower case as well. */
2858 stricpy (char *dest
, char *src
)
2862 while ((c
= *src
++) != 0)
2863 *dest
++ = TOLOWER (c
);
2868 /* Remove the first occurrence of needle (if any) in haystack
2872 strcut (char *haystack
, char *needle
)
2874 haystack
= strstr (haystack
, needle
);
2880 for (src
= haystack
+ strlen (needle
); *src
;)
2881 *haystack
++ = *src
++;
2887 /* Compare two target format name strings.
2888 Return a value indicating how "similar" they are. */
2891 name_compare (char *first
, char *second
)
2897 copy1
= (char *) xmalloc (strlen (first
) + 1);
2898 copy2
= (char *) xmalloc (strlen (second
) + 1);
2900 /* Convert the names to lower case. */
2901 stricpy (copy1
, first
);
2902 stricpy (copy2
, second
);
2904 /* Remove size and endian strings from the name. */
2905 strcut (copy1
, "big");
2906 strcut (copy1
, "little");
2907 strcut (copy2
, "big");
2908 strcut (copy2
, "little");
2910 /* Return a value based on how many characters match,
2911 starting from the beginning. If both strings are
2912 the same then return 10 * their length. */
2913 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2914 if (copy1
[result
] == 0)
2926 /* Set by closest_target_match() below. */
2927 static const bfd_target
*winner
;
2929 /* Scan all the valid bfd targets looking for one that has the endianness
2930 requirement that was specified on the command line, and is the nearest
2931 match to the original output target. */
2934 closest_target_match (const bfd_target
*target
, void *data
)
2936 const bfd_target
*original
= (const bfd_target
*) data
;
2938 if (command_line
.endian
== ENDIAN_BIG
2939 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2942 if (command_line
.endian
== ENDIAN_LITTLE
2943 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2946 /* Must be the same flavour. */
2947 if (target
->flavour
!= original
->flavour
)
2950 /* Ignore generic big and little endian elf vectors. */
2951 if (strcmp (target
->name
, "elf32-big") == 0
2952 || strcmp (target
->name
, "elf64-big") == 0
2953 || strcmp (target
->name
, "elf32-little") == 0
2954 || strcmp (target
->name
, "elf64-little") == 0)
2957 /* If we have not found a potential winner yet, then record this one. */
2964 /* Oh dear, we now have two potential candidates for a successful match.
2965 Compare their names and choose the better one. */
2966 if (name_compare (target
->name
, original
->name
)
2967 > name_compare (winner
->name
, original
->name
))
2970 /* Keep on searching until wqe have checked them all. */
2974 /* Return the BFD target format of the first input file. */
2977 get_first_input_target (void)
2979 char *target
= NULL
;
2981 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2983 if (s
->header
.type
== lang_input_statement_enum
2986 ldfile_open_file (s
);
2988 if (s
->the_bfd
!= NULL
2989 && bfd_check_format (s
->the_bfd
, bfd_object
))
2991 target
= bfd_get_target (s
->the_bfd
);
3003 lang_get_output_target (void)
3007 /* Has the user told us which output format to use? */
3008 if (output_target
!= NULL
)
3009 return output_target
;
3011 /* No - has the current target been set to something other than
3013 if (current_target
!= default_target
&& current_target
!= NULL
)
3014 return current_target
;
3016 /* No - can we determine the format of the first input file? */
3017 target
= get_first_input_target ();
3021 /* Failed - use the default output target. */
3022 return default_target
;
3025 /* Open the output file. */
3028 open_output (const char *name
)
3030 output_target
= lang_get_output_target ();
3032 /* Has the user requested a particular endianness on the command
3034 if (command_line
.endian
!= ENDIAN_UNSET
)
3036 const bfd_target
*target
;
3037 enum bfd_endian desired_endian
;
3039 /* Get the chosen target. */
3040 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3042 /* If the target is not supported, we cannot do anything. */
3045 if (command_line
.endian
== ENDIAN_BIG
)
3046 desired_endian
= BFD_ENDIAN_BIG
;
3048 desired_endian
= BFD_ENDIAN_LITTLE
;
3050 /* See if the target has the wrong endianness. This should
3051 not happen if the linker script has provided big and
3052 little endian alternatives, but some scrips don't do
3054 if (target
->byteorder
!= desired_endian
)
3056 /* If it does, then see if the target provides
3057 an alternative with the correct endianness. */
3058 if (target
->alternative_target
!= NULL
3059 && (target
->alternative_target
->byteorder
== desired_endian
))
3060 output_target
= target
->alternative_target
->name
;
3063 /* Try to find a target as similar as possible to
3064 the default target, but which has the desired
3065 endian characteristic. */
3066 bfd_search_for_target (closest_target_match
,
3069 /* Oh dear - we could not find any targets that
3070 satisfy our requirements. */
3072 einfo (_("%P: warning: could not find any targets"
3073 " that match endianness requirement\n"));
3075 output_target
= winner
->name
;
3081 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3083 if (link_info
.output_bfd
== NULL
)
3085 if (bfd_get_error () == bfd_error_invalid_target
)
3086 einfo (_("%P%F: target %s not found\n"), output_target
);
3088 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3091 delete_output_file_on_failure
= TRUE
;
3093 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3094 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3095 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3096 ldfile_output_architecture
,
3097 ldfile_output_machine
))
3098 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3100 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3101 if (link_info
.hash
== NULL
)
3102 einfo (_("%P%F: can not create hash table: %E\n"));
3104 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3108 ldlang_open_output (lang_statement_union_type
*statement
)
3110 switch (statement
->header
.type
)
3112 case lang_output_statement_enum
:
3113 ASSERT (link_info
.output_bfd
== NULL
);
3114 open_output (statement
->output_statement
.name
);
3115 ldemul_set_output_arch ();
3116 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3117 link_info
.output_bfd
->flags
|= D_PAGED
;
3119 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3120 if (config
.text_read_only
)
3121 link_info
.output_bfd
->flags
|= WP_TEXT
;
3123 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3124 if (link_info
.traditional_format
)
3125 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3127 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3130 case lang_target_statement_enum
:
3131 current_target
= statement
->target_statement
.target
;
3138 /* Convert between addresses in bytes and sizes in octets.
3139 For currently supported targets, octets_per_byte is always a power
3140 of two, so we can use shifts. */
3141 #define TO_ADDR(X) ((X) >> opb_shift)
3142 #define TO_SIZE(X) ((X) << opb_shift)
3144 /* Support the above. */
3145 static unsigned int opb_shift
= 0;
3150 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3151 ldfile_output_machine
);
3154 while ((x
& 1) == 0)
3162 /* Open all the input files. */
3166 OPEN_BFD_NORMAL
= 0,
3170 #ifdef ENABLE_PLUGINS
3171 static lang_input_statement_type
*plugin_insert
= NULL
;
3175 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3177 for (; s
!= NULL
; s
= s
->header
.next
)
3179 switch (s
->header
.type
)
3181 case lang_constructors_statement_enum
:
3182 open_input_bfds (constructor_list
.head
, mode
);
3184 case lang_output_section_statement_enum
:
3185 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3187 case lang_wild_statement_enum
:
3188 /* Maybe we should load the file's symbols. */
3189 if ((mode
& OPEN_BFD_RESCAN
) == 0
3190 && s
->wild_statement
.filename
3191 && !wildcardp (s
->wild_statement
.filename
)
3192 && !archive_path (s
->wild_statement
.filename
))
3193 lookup_name (s
->wild_statement
.filename
);
3194 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3196 case lang_group_statement_enum
:
3198 struct bfd_link_hash_entry
*undefs
;
3200 /* We must continually search the entries in the group
3201 until no new symbols are added to the list of undefined
3206 undefs
= link_info
.hash
->undefs_tail
;
3207 open_input_bfds (s
->group_statement
.children
.head
,
3208 mode
| OPEN_BFD_FORCE
);
3210 while (undefs
!= link_info
.hash
->undefs_tail
);
3213 case lang_target_statement_enum
:
3214 current_target
= s
->target_statement
.target
;
3216 case lang_input_statement_enum
:
3217 if (s
->input_statement
.flags
.real
)
3219 lang_statement_union_type
**os_tail
;
3220 lang_statement_list_type add
;
3222 s
->input_statement
.target
= current_target
;
3224 /* If we are being called from within a group, and this
3225 is an archive which has already been searched, then
3226 force it to be researched unless the whole archive
3227 has been loaded already. Do the same for a rescan. */
3228 if (mode
!= OPEN_BFD_NORMAL
3229 #ifdef ENABLE_PLUGINS
3230 && ((mode
& OPEN_BFD_RESCAN
) == 0
3231 || plugin_insert
== NULL
)
3233 && !s
->input_statement
.flags
.whole_archive
3234 && s
->input_statement
.flags
.loaded
3235 && s
->input_statement
.the_bfd
!= NULL
3236 && bfd_check_format (s
->input_statement
.the_bfd
,
3238 s
->input_statement
.flags
.loaded
= FALSE
;
3239 #ifdef ENABLE_PLUGINS
3240 /* When rescanning, reload --as-needed shared libs. */
3241 else if ((mode
& OPEN_BFD_RESCAN
) != 0
3242 && plugin_insert
== NULL
3243 && s
->input_statement
.flags
.loaded
3244 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3245 && s
->input_statement
.the_bfd
!= NULL
3246 && ((s
->input_statement
.the_bfd
->flags
) & DYNAMIC
) != 0
3247 && plugin_should_reload (s
->input_statement
.the_bfd
))
3249 s
->input_statement
.flags
.loaded
= FALSE
;
3250 s
->input_statement
.flags
.reload
= TRUE
;
3254 os_tail
= lang_output_section_statement
.tail
;
3255 lang_list_init (&add
);
3257 if (! load_symbols (&s
->input_statement
, &add
))
3258 config
.make_executable
= FALSE
;
3260 if (add
.head
!= NULL
)
3262 /* If this was a script with output sections then
3263 tack any added statements on to the end of the
3264 list. This avoids having to reorder the output
3265 section statement list. Very likely the user
3266 forgot -T, and whatever we do here will not meet
3267 naive user expectations. */
3268 if (os_tail
!= lang_output_section_statement
.tail
)
3270 einfo (_("%P: warning: %s contains output sections;"
3271 " did you forget -T?\n"),
3272 s
->input_statement
.filename
);
3273 *stat_ptr
->tail
= add
.head
;
3274 stat_ptr
->tail
= add
.tail
;
3278 *add
.tail
= s
->header
.next
;
3279 s
->header
.next
= add
.head
;
3283 #ifdef ENABLE_PLUGINS
3284 /* If we have found the point at which a plugin added new
3285 files, clear plugin_insert to enable archive rescan. */
3286 if (&s
->input_statement
== plugin_insert
)
3287 plugin_insert
= NULL
;
3290 case lang_assignment_statement_enum
:
3291 if (s
->assignment_statement
.exp
->assign
.defsym
)
3292 /* This is from a --defsym on the command line. */
3293 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3300 /* Exit if any of the files were missing. */
3301 if (input_flags
.missing_file
)
3305 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3308 lang_track_definedness (const char *name
)
3310 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3311 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3314 /* New-function for the definedness hash table. */
3316 static struct bfd_hash_entry
*
3317 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3318 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3319 const char *name ATTRIBUTE_UNUSED
)
3321 struct lang_definedness_hash_entry
*ret
3322 = (struct lang_definedness_hash_entry
*) entry
;
3325 ret
= (struct lang_definedness_hash_entry
*)
3326 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3329 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3331 ret
->iteration
= -1;
3335 /* Return the iteration when the definition of NAME was last updated. A
3336 value of -1 means that the symbol is not defined in the linker script
3337 or the command line, but may be defined in the linker symbol table. */
3340 lang_symbol_definition_iteration (const char *name
)
3342 struct lang_definedness_hash_entry
*defentry
3343 = (struct lang_definedness_hash_entry
*)
3344 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3346 /* We've already created this one on the presence of DEFINED in the
3347 script, so it can't be NULL unless something is borked elsewhere in
3349 if (defentry
== NULL
)
3352 return defentry
->iteration
;
3355 /* Update the definedness state of NAME. */
3358 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3360 struct lang_definedness_hash_entry
*defentry
3361 = (struct lang_definedness_hash_entry
*)
3362 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3364 /* We don't keep track of symbols not tested with DEFINED. */
3365 if (defentry
== NULL
)
3368 /* If the symbol was already defined, and not from an earlier statement
3369 iteration, don't update the definedness iteration, because that'd
3370 make the symbol seem defined in the linker script at this point, and
3371 it wasn't; it was defined in some object. If we do anyway, DEFINED
3372 would start to yield false before this point and the construct "sym =
3373 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3375 if (h
->type
!= bfd_link_hash_undefined
3376 && h
->type
!= bfd_link_hash_common
3377 && h
->type
!= bfd_link_hash_new
3378 && defentry
->iteration
== -1)
3381 defentry
->iteration
= lang_statement_iteration
;
3384 /* Add the supplied name to the symbol table as an undefined reference.
3385 This is a two step process as the symbol table doesn't even exist at
3386 the time the ld command line is processed. First we put the name
3387 on a list, then, once the output file has been opened, transfer the
3388 name to the symbol table. */
3390 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3392 #define ldlang_undef_chain_list_head entry_symbol.next
3395 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3397 ldlang_undef_chain_list_type
*new_undef
;
3399 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3400 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3401 new_undef
->next
= ldlang_undef_chain_list_head
;
3402 ldlang_undef_chain_list_head
= new_undef
;
3404 new_undef
->name
= xstrdup (name
);
3406 if (link_info
.output_bfd
!= NULL
)
3407 insert_undefined (new_undef
->name
);
3410 /* Insert NAME as undefined in the symbol table. */
3413 insert_undefined (const char *name
)
3415 struct bfd_link_hash_entry
*h
;
3417 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3419 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3420 if (h
->type
== bfd_link_hash_new
)
3422 h
->type
= bfd_link_hash_undefined
;
3423 h
->u
.undef
.abfd
= NULL
;
3424 bfd_link_add_undef (link_info
.hash
, h
);
3428 /* Run through the list of undefineds created above and place them
3429 into the linker hash table as undefined symbols belonging to the
3433 lang_place_undefineds (void)
3435 ldlang_undef_chain_list_type
*ptr
;
3437 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3438 insert_undefined (ptr
->name
);
3441 /* Check for all readonly or some readwrite sections. */
3444 check_input_sections
3445 (lang_statement_union_type
*s
,
3446 lang_output_section_statement_type
*output_section_statement
)
3448 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3450 switch (s
->header
.type
)
3452 case lang_wild_statement_enum
:
3453 walk_wild (&s
->wild_statement
, check_section_callback
,
3454 output_section_statement
);
3455 if (! output_section_statement
->all_input_readonly
)
3458 case lang_constructors_statement_enum
:
3459 check_input_sections (constructor_list
.head
,
3460 output_section_statement
);
3461 if (! output_section_statement
->all_input_readonly
)
3464 case lang_group_statement_enum
:
3465 check_input_sections (s
->group_statement
.children
.head
,
3466 output_section_statement
);
3467 if (! output_section_statement
->all_input_readonly
)
3476 /* Update wildcard statements if needed. */
3479 update_wild_statements (lang_statement_union_type
*s
)
3481 struct wildcard_list
*sec
;
3483 switch (sort_section
)
3493 for (; s
!= NULL
; s
= s
->header
.next
)
3495 switch (s
->header
.type
)
3500 case lang_wild_statement_enum
:
3501 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3504 switch (sec
->spec
.sorted
)
3507 sec
->spec
.sorted
= sort_section
;
3510 if (sort_section
== by_alignment
)
3511 sec
->spec
.sorted
= by_name_alignment
;
3514 if (sort_section
== by_name
)
3515 sec
->spec
.sorted
= by_alignment_name
;
3523 case lang_constructors_statement_enum
:
3524 update_wild_statements (constructor_list
.head
);
3527 case lang_output_section_statement_enum
:
3528 /* Don't sort .init/.fini sections. */
3529 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3530 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3531 update_wild_statements
3532 (s
->output_section_statement
.children
.head
);
3535 case lang_group_statement_enum
:
3536 update_wild_statements (s
->group_statement
.children
.head
);
3544 /* Open input files and attach to output sections. */
3547 map_input_to_output_sections
3548 (lang_statement_union_type
*s
, const char *target
,
3549 lang_output_section_statement_type
*os
)
3551 for (; s
!= NULL
; s
= s
->header
.next
)
3553 lang_output_section_statement_type
*tos
;
3556 switch (s
->header
.type
)
3558 case lang_wild_statement_enum
:
3559 wild (&s
->wild_statement
, target
, os
);
3561 case lang_constructors_statement_enum
:
3562 map_input_to_output_sections (constructor_list
.head
,
3566 case lang_output_section_statement_enum
:
3567 tos
= &s
->output_section_statement
;
3568 if (tos
->constraint
!= 0)
3570 if (tos
->constraint
!= ONLY_IF_RW
3571 && tos
->constraint
!= ONLY_IF_RO
)
3573 tos
->all_input_readonly
= TRUE
;
3574 check_input_sections (tos
->children
.head
, tos
);
3575 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3577 tos
->constraint
= -1;
3581 map_input_to_output_sections (tos
->children
.head
,
3585 case lang_output_statement_enum
:
3587 case lang_target_statement_enum
:
3588 target
= s
->target_statement
.target
;
3590 case lang_group_statement_enum
:
3591 map_input_to_output_sections (s
->group_statement
.children
.head
,
3595 case lang_data_statement_enum
:
3596 /* Make sure that any sections mentioned in the expression
3598 exp_init_os (s
->data_statement
.exp
);
3599 /* The output section gets CONTENTS, ALLOC and LOAD, but
3600 these may be overridden by the script. */
3601 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3602 switch (os
->sectype
)
3604 case normal_section
:
3605 case overlay_section
:
3607 case noalloc_section
:
3608 flags
= SEC_HAS_CONTENTS
;
3610 case noload_section
:
3611 if (bfd_get_flavour (link_info
.output_bfd
)
3612 == bfd_target_elf_flavour
)
3613 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3615 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3618 if (os
->bfd_section
== NULL
)
3619 init_os (os
, flags
);
3621 os
->bfd_section
->flags
|= flags
;
3623 case lang_input_section_enum
:
3625 case lang_fill_statement_enum
:
3626 case lang_object_symbols_statement_enum
:
3627 case lang_reloc_statement_enum
:
3628 case lang_padding_statement_enum
:
3629 case lang_input_statement_enum
:
3630 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3633 case lang_assignment_statement_enum
:
3634 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3637 /* Make sure that any sections mentioned in the assignment
3639 exp_init_os (s
->assignment_statement
.exp
);
3641 case lang_address_statement_enum
:
3642 /* Mark the specified section with the supplied address.
3643 If this section was actually a segment marker, then the
3644 directive is ignored if the linker script explicitly
3645 processed the segment marker. Originally, the linker
3646 treated segment directives (like -Ttext on the
3647 command-line) as section directives. We honor the
3648 section directive semantics for backwards compatibilty;
3649 linker scripts that do not specifically check for
3650 SEGMENT_START automatically get the old semantics. */
3651 if (!s
->address_statement
.segment
3652 || !s
->address_statement
.segment
->used
)
3654 const char *name
= s
->address_statement
.section_name
;
3656 /* Create the output section statement here so that
3657 orphans with a set address will be placed after other
3658 script sections. If we let the orphan placement code
3659 place them in amongst other sections then the address
3660 will affect following script sections, which is
3661 likely to surprise naive users. */
3662 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3663 tos
->addr_tree
= s
->address_statement
.address
;
3664 if (tos
->bfd_section
== NULL
)
3668 case lang_insert_statement_enum
:
3674 /* An insert statement snips out all the linker statements from the
3675 start of the list and places them after the output section
3676 statement specified by the insert. This operation is complicated
3677 by the fact that we keep a doubly linked list of output section
3678 statements as well as the singly linked list of all statements. */
3681 process_insert_statements (void)
3683 lang_statement_union_type
**s
;
3684 lang_output_section_statement_type
*first_os
= NULL
;
3685 lang_output_section_statement_type
*last_os
= NULL
;
3686 lang_output_section_statement_type
*os
;
3688 /* "start of list" is actually the statement immediately after
3689 the special abs_section output statement, so that it isn't
3691 s
= &lang_output_section_statement
.head
;
3692 while (*(s
= &(*s
)->header
.next
) != NULL
)
3694 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3696 /* Keep pointers to the first and last output section
3697 statement in the sequence we may be about to move. */
3698 os
= &(*s
)->output_section_statement
;
3700 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3703 /* Set constraint negative so that lang_output_section_find
3704 won't match this output section statement. At this
3705 stage in linking constraint has values in the range
3706 [-1, ONLY_IN_RW]. */
3707 last_os
->constraint
= -2 - last_os
->constraint
;
3708 if (first_os
== NULL
)
3711 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3713 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3714 lang_output_section_statement_type
*where
;
3715 lang_statement_union_type
**ptr
;
3716 lang_statement_union_type
*first
;
3718 where
= lang_output_section_find (i
->where
);
3719 if (where
!= NULL
&& i
->is_before
)
3722 where
= where
->prev
;
3723 while (where
!= NULL
&& where
->constraint
< 0);
3727 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3731 /* Deal with reordering the output section statement list. */
3732 if (last_os
!= NULL
)
3734 asection
*first_sec
, *last_sec
;
3735 struct lang_output_section_statement_struct
**next
;
3737 /* Snip out the output sections we are moving. */
3738 first_os
->prev
->next
= last_os
->next
;
3739 if (last_os
->next
== NULL
)
3741 next
= &first_os
->prev
->next
;
3742 lang_output_section_statement
.tail
3743 = (lang_statement_union_type
**) next
;
3746 last_os
->next
->prev
= first_os
->prev
;
3747 /* Add them in at the new position. */
3748 last_os
->next
= where
->next
;
3749 if (where
->next
== NULL
)
3751 next
= &last_os
->next
;
3752 lang_output_section_statement
.tail
3753 = (lang_statement_union_type
**) next
;
3756 where
->next
->prev
= last_os
;
3757 first_os
->prev
= where
;
3758 where
->next
= first_os
;
3760 /* Move the bfd sections in the same way. */
3763 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3765 os
->constraint
= -2 - os
->constraint
;
3766 if (os
->bfd_section
!= NULL
3767 && os
->bfd_section
->owner
!= NULL
)
3769 last_sec
= os
->bfd_section
;
3770 if (first_sec
== NULL
)
3771 first_sec
= last_sec
;
3776 if (last_sec
!= NULL
)
3778 asection
*sec
= where
->bfd_section
;
3780 sec
= output_prev_sec_find (where
);
3782 /* The place we want to insert must come after the
3783 sections we are moving. So if we find no
3784 section or if the section is the same as our
3785 last section, then no move is needed. */
3786 if (sec
!= NULL
&& sec
!= last_sec
)
3788 /* Trim them off. */
3789 if (first_sec
->prev
!= NULL
)
3790 first_sec
->prev
->next
= last_sec
->next
;
3792 link_info
.output_bfd
->sections
= last_sec
->next
;
3793 if (last_sec
->next
!= NULL
)
3794 last_sec
->next
->prev
= first_sec
->prev
;
3796 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3798 last_sec
->next
= sec
->next
;
3799 if (sec
->next
!= NULL
)
3800 sec
->next
->prev
= last_sec
;
3802 link_info
.output_bfd
->section_last
= last_sec
;
3803 first_sec
->prev
= sec
;
3804 sec
->next
= first_sec
;
3812 ptr
= insert_os_after (where
);
3813 /* Snip everything after the abs_section output statement we
3814 know is at the start of the list, up to and including
3815 the insert statement we are currently processing. */
3816 first
= lang_output_section_statement
.head
->header
.next
;
3817 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3818 /* Add them back where they belong. */
3821 statement_list
.tail
= s
;
3823 s
= &lang_output_section_statement
.head
;
3827 /* Undo constraint twiddling. */
3828 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3830 os
->constraint
= -2 - os
->constraint
;
3836 /* An output section might have been removed after its statement was
3837 added. For example, ldemul_before_allocation can remove dynamic
3838 sections if they turn out to be not needed. Clean them up here. */
3841 strip_excluded_output_sections (void)
3843 lang_output_section_statement_type
*os
;
3845 /* Run lang_size_sections (if not already done). */
3846 if (expld
.phase
!= lang_mark_phase_enum
)
3848 expld
.phase
= lang_mark_phase_enum
;
3849 expld
.dataseg
.phase
= exp_dataseg_none
;
3850 one_lang_size_sections_pass (NULL
, FALSE
);
3851 lang_reset_memory_regions ();
3854 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3858 asection
*output_section
;
3859 bfd_boolean exclude
;
3861 if (os
->constraint
< 0)
3864 output_section
= os
->bfd_section
;
3865 if (output_section
== NULL
)
3868 exclude
= (output_section
->rawsize
== 0
3869 && (output_section
->flags
& SEC_KEEP
) == 0
3870 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3873 /* Some sections have not yet been sized, notably .gnu.version,
3874 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3875 input sections, so don't drop output sections that have such
3876 input sections unless they are also marked SEC_EXCLUDE. */
3877 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3881 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3882 if ((s
->flags
& SEC_EXCLUDE
) == 0
3883 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3884 || link_info
.emitrelocations
))
3891 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3892 output_section
->map_head
.link_order
= NULL
;
3893 output_section
->map_tail
.link_order
= NULL
;
3897 /* We don't set bfd_section to NULL since bfd_section of the
3898 removed output section statement may still be used. */
3899 if (!os
->update_dot
)
3901 output_section
->flags
|= SEC_EXCLUDE
;
3902 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3903 link_info
.output_bfd
->section_count
--;
3907 /* Stop future calls to lang_add_section from messing with map_head
3908 and map_tail link_order fields. */
3909 stripped_excluded_sections
= TRUE
;
3913 print_output_section_statement
3914 (lang_output_section_statement_type
*output_section_statement
)
3916 asection
*section
= output_section_statement
->bfd_section
;
3919 if (output_section_statement
!= abs_output_section
)
3921 minfo ("\n%s", output_section_statement
->name
);
3923 if (section
!= NULL
)
3925 print_dot
= section
->vma
;
3927 len
= strlen (output_section_statement
->name
);
3928 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3933 while (len
< SECTION_NAME_MAP_LENGTH
)
3939 minfo ("0x%V %W", section
->vma
, section
->size
);
3941 if (section
->vma
!= section
->lma
)
3942 minfo (_(" load address 0x%V"), section
->lma
);
3944 if (output_section_statement
->update_dot_tree
!= NULL
)
3945 exp_fold_tree (output_section_statement
->update_dot_tree
,
3946 bfd_abs_section_ptr
, &print_dot
);
3952 print_statement_list (output_section_statement
->children
.head
,
3953 output_section_statement
);
3957 print_assignment (lang_assignment_statement_type
*assignment
,
3958 lang_output_section_statement_type
*output_section
)
3965 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3968 if (assignment
->exp
->type
.node_class
== etree_assert
)
3971 tree
= assignment
->exp
->assert_s
.child
;
3975 const char *dst
= assignment
->exp
->assign
.dst
;
3977 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3978 expld
.assign_name
= dst
;
3979 tree
= assignment
->exp
->assign
.src
;
3982 osec
= output_section
->bfd_section
;
3984 osec
= bfd_abs_section_ptr
;
3985 exp_fold_tree (tree
, osec
, &print_dot
);
3986 if (expld
.result
.valid_p
)
3990 if (assignment
->exp
->type
.node_class
== etree_assert
3992 || expld
.assign_name
!= NULL
)
3994 value
= expld
.result
.value
;
3996 if (expld
.result
.section
!= NULL
)
3997 value
+= expld
.result
.section
->vma
;
3999 minfo ("0x%V", value
);
4005 struct bfd_link_hash_entry
*h
;
4007 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4008 FALSE
, FALSE
, TRUE
);
4011 value
= h
->u
.def
.value
;
4012 value
+= h
->u
.def
.section
->output_section
->vma
;
4013 value
+= h
->u
.def
.section
->output_offset
;
4015 minfo ("[0x%V]", value
);
4018 minfo ("[unresolved]");
4028 expld
.assign_name
= NULL
;
4031 exp_print_tree (assignment
->exp
);
4036 print_input_statement (lang_input_statement_type
*statm
)
4038 if (statm
->filename
!= NULL
4039 && (statm
->the_bfd
== NULL
4040 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4041 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4044 /* Print all symbols defined in a particular section. This is called
4045 via bfd_link_hash_traverse, or by print_all_symbols. */
4048 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4050 asection
*sec
= (asection
*) ptr
;
4052 if ((hash_entry
->type
== bfd_link_hash_defined
4053 || hash_entry
->type
== bfd_link_hash_defweak
)
4054 && sec
== hash_entry
->u
.def
.section
)
4058 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4061 (hash_entry
->u
.def
.value
4062 + hash_entry
->u
.def
.section
->output_offset
4063 + hash_entry
->u
.def
.section
->output_section
->vma
));
4065 minfo (" %T\n", hash_entry
->root
.string
);
4072 hash_entry_addr_cmp (const void *a
, const void *b
)
4074 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4075 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4077 if (l
->u
.def
.value
< r
->u
.def
.value
)
4079 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4086 print_all_symbols (asection
*sec
)
4088 struct fat_user_section_struct
*ud
=
4089 (struct fat_user_section_struct
*) get_userdata (sec
);
4090 struct map_symbol_def
*def
;
4091 struct bfd_link_hash_entry
**entries
;
4097 *ud
->map_symbol_def_tail
= 0;
4099 /* Sort the symbols by address. */
4100 entries
= (struct bfd_link_hash_entry
**)
4101 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4103 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4104 entries
[i
] = def
->entry
;
4106 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4107 hash_entry_addr_cmp
);
4109 /* Print the symbols. */
4110 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4111 print_one_symbol (entries
[i
], sec
);
4113 obstack_free (&map_obstack
, entries
);
4116 /* Print information about an input section to the map file. */
4119 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4121 bfd_size_type size
= i
->size
;
4128 minfo ("%s", i
->name
);
4130 len
= 1 + strlen (i
->name
);
4131 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4136 while (len
< SECTION_NAME_MAP_LENGTH
)
4142 if (i
->output_section
!= NULL
4143 && i
->output_section
->owner
== link_info
.output_bfd
)
4144 addr
= i
->output_section
->vma
+ i
->output_offset
;
4152 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4154 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4156 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4168 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4171 if (i
->output_section
!= NULL
4172 && i
->output_section
->owner
== link_info
.output_bfd
)
4174 if (link_info
.reduce_memory_overheads
)
4175 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4177 print_all_symbols (i
);
4179 /* Update print_dot, but make sure that we do not move it
4180 backwards - this could happen if we have overlays and a
4181 later overlay is shorter than an earier one. */
4182 if (addr
+ TO_ADDR (size
) > print_dot
)
4183 print_dot
= addr
+ TO_ADDR (size
);
4188 print_fill_statement (lang_fill_statement_type
*fill
)
4192 fputs (" FILL mask 0x", config
.map_file
);
4193 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4194 fprintf (config
.map_file
, "%02x", *p
);
4195 fputs ("\n", config
.map_file
);
4199 print_data_statement (lang_data_statement_type
*data
)
4207 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4210 addr
= data
->output_offset
;
4211 if (data
->output_section
!= NULL
)
4212 addr
+= data
->output_section
->vma
;
4240 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4242 if (data
->exp
->type
.node_class
!= etree_value
)
4245 exp_print_tree (data
->exp
);
4250 print_dot
= addr
+ TO_ADDR (size
);
4253 /* Print an address statement. These are generated by options like
4257 print_address_statement (lang_address_statement_type
*address
)
4259 minfo (_("Address of section %s set to "), address
->section_name
);
4260 exp_print_tree (address
->address
);
4264 /* Print a reloc statement. */
4267 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4274 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4277 addr
= reloc
->output_offset
;
4278 if (reloc
->output_section
!= NULL
)
4279 addr
+= reloc
->output_section
->vma
;
4281 size
= bfd_get_reloc_size (reloc
->howto
);
4283 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4285 if (reloc
->name
!= NULL
)
4286 minfo ("%s+", reloc
->name
);
4288 minfo ("%s+", reloc
->section
->name
);
4290 exp_print_tree (reloc
->addend_exp
);
4294 print_dot
= addr
+ TO_ADDR (size
);
4298 print_padding_statement (lang_padding_statement_type
*s
)
4306 len
= sizeof " *fill*" - 1;
4307 while (len
< SECTION_NAME_MAP_LENGTH
)
4313 addr
= s
->output_offset
;
4314 if (s
->output_section
!= NULL
)
4315 addr
+= s
->output_section
->vma
;
4316 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4318 if (s
->fill
->size
!= 0)
4322 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4323 fprintf (config
.map_file
, "%02x", *p
);
4328 print_dot
= addr
+ TO_ADDR (s
->size
);
4332 print_wild_statement (lang_wild_statement_type
*w
,
4333 lang_output_section_statement_type
*os
)
4335 struct wildcard_list
*sec
;
4339 if (w
->filenames_sorted
)
4341 if (w
->filename
!= NULL
)
4342 minfo ("%s", w
->filename
);
4345 if (w
->filenames_sorted
)
4349 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4351 if (sec
->spec
.sorted
)
4353 if (sec
->spec
.exclude_name_list
!= NULL
)
4356 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4357 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4358 minfo (" %s", tmp
->name
);
4361 if (sec
->spec
.name
!= NULL
)
4362 minfo ("%s", sec
->spec
.name
);
4365 if (sec
->spec
.sorted
)
4374 print_statement_list (w
->children
.head
, os
);
4377 /* Print a group statement. */
4380 print_group (lang_group_statement_type
*s
,
4381 lang_output_section_statement_type
*os
)
4383 fprintf (config
.map_file
, "START GROUP\n");
4384 print_statement_list (s
->children
.head
, os
);
4385 fprintf (config
.map_file
, "END GROUP\n");
4388 /* Print the list of statements in S.
4389 This can be called for any statement type. */
4392 print_statement_list (lang_statement_union_type
*s
,
4393 lang_output_section_statement_type
*os
)
4397 print_statement (s
, os
);
4402 /* Print the first statement in statement list S.
4403 This can be called for any statement type. */
4406 print_statement (lang_statement_union_type
*s
,
4407 lang_output_section_statement_type
*os
)
4409 switch (s
->header
.type
)
4412 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4415 case lang_constructors_statement_enum
:
4416 if (constructor_list
.head
!= NULL
)
4418 if (constructors_sorted
)
4419 minfo (" SORT (CONSTRUCTORS)\n");
4421 minfo (" CONSTRUCTORS\n");
4422 print_statement_list (constructor_list
.head
, os
);
4425 case lang_wild_statement_enum
:
4426 print_wild_statement (&s
->wild_statement
, os
);
4428 case lang_address_statement_enum
:
4429 print_address_statement (&s
->address_statement
);
4431 case lang_object_symbols_statement_enum
:
4432 minfo (" CREATE_OBJECT_SYMBOLS\n");
4434 case lang_fill_statement_enum
:
4435 print_fill_statement (&s
->fill_statement
);
4437 case lang_data_statement_enum
:
4438 print_data_statement (&s
->data_statement
);
4440 case lang_reloc_statement_enum
:
4441 print_reloc_statement (&s
->reloc_statement
);
4443 case lang_input_section_enum
:
4444 print_input_section (s
->input_section
.section
, FALSE
);
4446 case lang_padding_statement_enum
:
4447 print_padding_statement (&s
->padding_statement
);
4449 case lang_output_section_statement_enum
:
4450 print_output_section_statement (&s
->output_section_statement
);
4452 case lang_assignment_statement_enum
:
4453 print_assignment (&s
->assignment_statement
, os
);
4455 case lang_target_statement_enum
:
4456 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4458 case lang_output_statement_enum
:
4459 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4460 if (output_target
!= NULL
)
4461 minfo (" %s", output_target
);
4464 case lang_input_statement_enum
:
4465 print_input_statement (&s
->input_statement
);
4467 case lang_group_statement_enum
:
4468 print_group (&s
->group_statement
, os
);
4470 case lang_insert_statement_enum
:
4471 minfo ("INSERT %s %s\n",
4472 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4473 s
->insert_statement
.where
);
4479 print_statements (void)
4481 print_statement_list (statement_list
.head
, abs_output_section
);
4484 /* Print the first N statements in statement list S to STDERR.
4485 If N == 0, nothing is printed.
4486 If N < 0, the entire list is printed.
4487 Intended to be called from GDB. */
4490 dprint_statement (lang_statement_union_type
*s
, int n
)
4492 FILE *map_save
= config
.map_file
;
4494 config
.map_file
= stderr
;
4497 print_statement_list (s
, abs_output_section
);
4500 while (s
&& --n
>= 0)
4502 print_statement (s
, abs_output_section
);
4507 config
.map_file
= map_save
;
4511 insert_pad (lang_statement_union_type
**ptr
,
4513 bfd_size_type alignment_needed
,
4514 asection
*output_section
,
4517 static fill_type zero_fill
;
4518 lang_statement_union_type
*pad
= NULL
;
4520 if (ptr
!= &statement_list
.head
)
4521 pad
= ((lang_statement_union_type
*)
4522 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4524 && pad
->header
.type
== lang_padding_statement_enum
4525 && pad
->padding_statement
.output_section
== output_section
)
4527 /* Use the existing pad statement. */
4529 else if ((pad
= *ptr
) != NULL
4530 && pad
->header
.type
== lang_padding_statement_enum
4531 && pad
->padding_statement
.output_section
== output_section
)
4533 /* Use the existing pad statement. */
4537 /* Make a new padding statement, linked into existing chain. */
4538 pad
= (lang_statement_union_type
*)
4539 stat_alloc (sizeof (lang_padding_statement_type
));
4540 pad
->header
.next
= *ptr
;
4542 pad
->header
.type
= lang_padding_statement_enum
;
4543 pad
->padding_statement
.output_section
= output_section
;
4546 pad
->padding_statement
.fill
= fill
;
4548 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4549 pad
->padding_statement
.size
= alignment_needed
;
4550 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4551 - output_section
->vma
);
4554 /* Work out how much this section will move the dot point. */
4558 (lang_statement_union_type
**this_ptr
,
4559 lang_output_section_statement_type
*output_section_statement
,
4563 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4564 asection
*i
= is
->section
;
4566 if (i
->sec_info_type
!= SEC_INFO_TYPE_JUST_SYMS
4567 && (i
->flags
& SEC_EXCLUDE
) == 0)
4569 bfd_size_type alignment_needed
;
4572 /* Align this section first to the input sections requirement,
4573 then to the output section's requirement. If this alignment
4574 is greater than any seen before, then record it too. Perform
4575 the alignment by inserting a magic 'padding' statement. */
4577 if (output_section_statement
->subsection_alignment
!= -1)
4578 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4580 o
= output_section_statement
->bfd_section
;
4581 if (o
->alignment_power
< i
->alignment_power
)
4582 o
->alignment_power
= i
->alignment_power
;
4584 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4586 if (alignment_needed
!= 0)
4588 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4589 dot
+= alignment_needed
;
4592 /* Remember where in the output section this input section goes. */
4594 i
->output_offset
= dot
- o
->vma
;
4596 /* Mark how big the output section must be to contain this now. */
4597 dot
+= TO_ADDR (i
->size
);
4598 o
->size
= TO_SIZE (dot
- o
->vma
);
4602 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4609 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4611 const asection
*sec1
= *(const asection
**) arg1
;
4612 const asection
*sec2
= *(const asection
**) arg2
;
4614 if (bfd_section_lma (sec1
->owner
, sec1
)
4615 < bfd_section_lma (sec2
->owner
, sec2
))
4617 else if (bfd_section_lma (sec1
->owner
, sec1
)
4618 > bfd_section_lma (sec2
->owner
, sec2
))
4620 else if (sec1
->id
< sec2
->id
)
4622 else if (sec1
->id
> sec2
->id
)
4628 #define IGNORE_SECTION(s) \
4629 ((s->flags & SEC_ALLOC) == 0 \
4630 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4631 && (s->flags & SEC_LOAD) == 0))
4633 /* Check to see if any allocated sections overlap with other allocated
4634 sections. This can happen if a linker script specifies the output
4635 section addresses of the two sections. Also check whether any memory
4636 region has overflowed. */
4639 lang_check_section_addresses (void)
4642 asection
**sections
, **spp
;
4649 lang_memory_region_type
*m
;
4651 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4654 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4655 sections
= (asection
**) xmalloc (amt
);
4657 /* Scan all sections in the output list. */
4659 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4661 /* Only consider loadable sections with real contents. */
4662 if (!(s
->flags
& SEC_LOAD
)
4663 || !(s
->flags
& SEC_ALLOC
)
4667 sections
[count
] = s
;
4674 qsort (sections
, (size_t) count
, sizeof (asection
*),
4675 sort_sections_by_lma
);
4680 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4681 for (count
--; count
; count
--)
4683 /* We must check the sections' LMA addresses not their VMA
4684 addresses because overlay sections can have overlapping VMAs
4685 but they must have distinct LMAs. */
4691 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4693 /* Look for an overlap. We have sorted sections by lma, so we
4694 know that s_start >= p_start. Besides the obvious case of
4695 overlap when the current section starts before the previous
4696 one ends, we also must have overlap if the previous section
4697 wraps around the address space. */
4698 if (s_start
<= p_end
4700 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4701 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4706 /* If any memory region has overflowed, report by how much.
4707 We do not issue this diagnostic for regions that had sections
4708 explicitly placed outside their bounds; os_region_check's
4709 diagnostics are adequate for that case.
4711 FIXME: It is conceivable that m->current - (m->origin + m->length)
4712 might overflow a 32-bit integer. There is, alas, no way to print
4713 a bfd_vma quantity in decimal. */
4714 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4715 if (m
->had_full_message
)
4716 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4717 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4721 /* Make sure the new address is within the region. We explicitly permit the
4722 current address to be at the exact end of the region when the address is
4723 non-zero, in case the region is at the end of addressable memory and the
4724 calculation wraps around. */
4727 os_region_check (lang_output_section_statement_type
*os
,
4728 lang_memory_region_type
*region
,
4732 if ((region
->current
< region
->origin
4733 || (region
->current
- region
->origin
> region
->length
))
4734 && ((region
->current
!= region
->origin
+ region
->length
)
4739 einfo (_("%X%P: address 0x%v of %B section `%s'"
4740 " is not within region `%s'\n"),
4742 os
->bfd_section
->owner
,
4743 os
->bfd_section
->name
,
4744 region
->name_list
.name
);
4746 else if (!region
->had_full_message
)
4748 region
->had_full_message
= TRUE
;
4750 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4751 os
->bfd_section
->owner
,
4752 os
->bfd_section
->name
,
4753 region
->name_list
.name
);
4758 /* Set the sizes for all the output sections. */
4761 lang_size_sections_1
4762 (lang_statement_union_type
**prev
,
4763 lang_output_section_statement_type
*output_section_statement
,
4767 bfd_boolean check_regions
)
4769 lang_statement_union_type
*s
;
4771 /* Size up the sections from their constituent parts. */
4772 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4774 switch (s
->header
.type
)
4776 case lang_output_section_statement_enum
:
4778 bfd_vma newdot
, after
;
4779 lang_output_section_statement_type
*os
;
4780 lang_memory_region_type
*r
;
4781 int section_alignment
= 0;
4783 os
= &s
->output_section_statement
;
4784 if (os
->constraint
== -1)
4787 /* FIXME: We shouldn't need to zero section vmas for ld -r
4788 here, in lang_insert_orphan, or in the default linker scripts.
4789 This is covering for coff backend linker bugs. See PR6945. */
4790 if (os
->addr_tree
== NULL
4791 && link_info
.relocatable
4792 && (bfd_get_flavour (link_info
.output_bfd
)
4793 == bfd_target_coff_flavour
))
4794 os
->addr_tree
= exp_intop (0);
4795 if (os
->addr_tree
!= NULL
)
4797 os
->processed_vma
= FALSE
;
4798 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4800 if (expld
.result
.valid_p
)
4802 dot
= expld
.result
.value
;
4803 if (expld
.result
.section
!= NULL
)
4804 dot
+= expld
.result
.section
->vma
;
4806 else if (expld
.phase
!= lang_mark_phase_enum
)
4807 einfo (_("%F%S: non constant or forward reference"
4808 " address expression for section %s\n"),
4809 os
->addr_tree
, os
->name
);
4812 if (os
->bfd_section
== NULL
)
4813 /* This section was removed or never actually created. */
4816 /* If this is a COFF shared library section, use the size and
4817 address from the input section. FIXME: This is COFF
4818 specific; it would be cleaner if there were some other way
4819 to do this, but nothing simple comes to mind. */
4820 if (((bfd_get_flavour (link_info
.output_bfd
)
4821 == bfd_target_ecoff_flavour
)
4822 || (bfd_get_flavour (link_info
.output_bfd
)
4823 == bfd_target_coff_flavour
))
4824 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4828 if (os
->children
.head
== NULL
4829 || os
->children
.head
->header
.next
!= NULL
4830 || (os
->children
.head
->header
.type
4831 != lang_input_section_enum
))
4832 einfo (_("%P%X: Internal error on COFF shared library"
4833 " section %s\n"), os
->name
);
4835 input
= os
->children
.head
->input_section
.section
;
4836 bfd_set_section_vma (os
->bfd_section
->owner
,
4838 bfd_section_vma (input
->owner
, input
));
4839 os
->bfd_section
->size
= input
->size
;
4844 if (bfd_is_abs_section (os
->bfd_section
))
4846 /* No matter what happens, an abs section starts at zero. */
4847 ASSERT (os
->bfd_section
->vma
== 0);
4851 if (os
->addr_tree
== NULL
)
4853 /* No address specified for this section, get one
4854 from the region specification. */
4855 if (os
->region
== NULL
4856 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4857 && os
->region
->name_list
.name
[0] == '*'
4858 && strcmp (os
->region
->name_list
.name
,
4859 DEFAULT_MEMORY_REGION
) == 0))
4861 os
->region
= lang_memory_default (os
->bfd_section
);
4864 /* If a loadable section is using the default memory
4865 region, and some non default memory regions were
4866 defined, issue an error message. */
4868 && !IGNORE_SECTION (os
->bfd_section
)
4869 && ! link_info
.relocatable
4871 && strcmp (os
->region
->name_list
.name
,
4872 DEFAULT_MEMORY_REGION
) == 0
4873 && lang_memory_region_list
!= NULL
4874 && (strcmp (lang_memory_region_list
->name_list
.name
,
4875 DEFAULT_MEMORY_REGION
) != 0
4876 || lang_memory_region_list
->next
!= NULL
)
4877 && expld
.phase
!= lang_mark_phase_enum
)
4879 /* By default this is an error rather than just a
4880 warning because if we allocate the section to the
4881 default memory region we can end up creating an
4882 excessively large binary, or even seg faulting when
4883 attempting to perform a negative seek. See
4884 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4885 for an example of this. This behaviour can be
4886 overridden by the using the --no-check-sections
4888 if (command_line
.check_section_addresses
)
4889 einfo (_("%P%F: error: no memory region specified"
4890 " for loadable section `%s'\n"),
4891 bfd_get_section_name (link_info
.output_bfd
,
4894 einfo (_("%P: warning: no memory region specified"
4895 " for loadable section `%s'\n"),
4896 bfd_get_section_name (link_info
.output_bfd
,
4900 newdot
= os
->region
->current
;
4901 section_alignment
= os
->bfd_section
->alignment_power
;
4904 section_alignment
= os
->section_alignment
;
4906 /* Align to what the section needs. */
4907 if (section_alignment
> 0)
4909 bfd_vma savedot
= newdot
;
4910 newdot
= align_power (newdot
, section_alignment
);
4912 if (newdot
!= savedot
4913 && (config
.warn_section_align
4914 || os
->addr_tree
!= NULL
)
4915 && expld
.phase
!= lang_mark_phase_enum
)
4916 einfo (_("%P: warning: changing start of section"
4917 " %s by %lu bytes\n"),
4918 os
->name
, (unsigned long) (newdot
- savedot
));
4921 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4923 os
->bfd_section
->output_offset
= 0;
4926 lang_size_sections_1 (&os
->children
.head
, os
,
4927 os
->fill
, newdot
, relax
, check_regions
);
4929 os
->processed_vma
= TRUE
;
4931 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4932 /* Except for some special linker created sections,
4933 no output section should change from zero size
4934 after strip_excluded_output_sections. A non-zero
4935 size on an ignored section indicates that some
4936 input section was not sized early enough. */
4937 ASSERT (os
->bfd_section
->size
== 0);
4940 dot
= os
->bfd_section
->vma
;
4942 /* Put the section within the requested block size, or
4943 align at the block boundary. */
4945 + TO_ADDR (os
->bfd_section
->size
)
4946 + os
->block_value
- 1)
4947 & - (bfd_vma
) os
->block_value
);
4949 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4952 /* Set section lma. */
4955 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4959 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4960 os
->bfd_section
->lma
= lma
;
4962 else if (os
->lma_region
!= NULL
)
4964 bfd_vma lma
= os
->lma_region
->current
;
4966 if (section_alignment
> 0)
4967 lma
= align_power (lma
, section_alignment
);
4968 os
->bfd_section
->lma
= lma
;
4970 else if (r
->last_os
!= NULL
4971 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4976 last
= r
->last_os
->output_section_statement
.bfd_section
;
4978 /* A backwards move of dot should be accompanied by
4979 an explicit assignment to the section LMA (ie.
4980 os->load_base set) because backwards moves can
4981 create overlapping LMAs. */
4983 && os
->bfd_section
->size
!= 0
4984 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4986 /* If dot moved backwards then leave lma equal to
4987 vma. This is the old default lma, which might
4988 just happen to work when the backwards move is
4989 sufficiently large. Nag if this changes anything,
4990 so people can fix their linker scripts. */
4992 if (last
->vma
!= last
->lma
)
4993 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
4998 /* If this is an overlay, set the current lma to that
4999 at the end of the previous section. */
5000 if (os
->sectype
== overlay_section
)
5001 lma
= last
->lma
+ last
->size
;
5003 /* Otherwise, keep the same lma to vma relationship
5004 as the previous section. */
5006 lma
= dot
+ last
->lma
- last
->vma
;
5008 if (section_alignment
> 0)
5009 lma
= align_power (lma
, section_alignment
);
5010 os
->bfd_section
->lma
= lma
;
5013 os
->processed_lma
= TRUE
;
5015 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5018 /* Keep track of normal sections using the default
5019 lma region. We use this to set the lma for
5020 following sections. Overlays or other linker
5021 script assignment to lma might mean that the
5022 default lma == vma is incorrect.
5023 To avoid warnings about dot moving backwards when using
5024 -Ttext, don't start tracking sections until we find one
5025 of non-zero size or with lma set differently to vma. */
5026 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5027 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5028 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5029 && (os
->bfd_section
->size
!= 0
5030 || (r
->last_os
== NULL
5031 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5032 || (r
->last_os
!= NULL
5033 && dot
>= (r
->last_os
->output_section_statement
5034 .bfd_section
->vma
)))
5035 && os
->lma_region
== NULL
5036 && !link_info
.relocatable
)
5039 /* .tbss sections effectively have zero size. */
5040 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5041 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5042 || link_info
.relocatable
)
5043 dot
+= TO_ADDR (os
->bfd_section
->size
);
5045 if (os
->update_dot_tree
!= 0)
5046 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5048 /* Update dot in the region ?
5049 We only do this if the section is going to be allocated,
5050 since unallocated sections do not contribute to the region's
5051 overall size in memory. */
5052 if (os
->region
!= NULL
5053 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5055 os
->region
->current
= dot
;
5058 /* Make sure the new address is within the region. */
5059 os_region_check (os
, os
->region
, os
->addr_tree
,
5060 os
->bfd_section
->vma
);
5062 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5063 && (os
->bfd_section
->flags
& SEC_LOAD
))
5065 os
->lma_region
->current
5066 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5069 os_region_check (os
, os
->lma_region
, NULL
,
5070 os
->bfd_section
->lma
);
5076 case lang_constructors_statement_enum
:
5077 dot
= lang_size_sections_1 (&constructor_list
.head
,
5078 output_section_statement
,
5079 fill
, dot
, relax
, check_regions
);
5082 case lang_data_statement_enum
:
5084 unsigned int size
= 0;
5086 s
->data_statement
.output_offset
=
5087 dot
- output_section_statement
->bfd_section
->vma
;
5088 s
->data_statement
.output_section
=
5089 output_section_statement
->bfd_section
;
5091 /* We might refer to provided symbols in the expression, and
5092 need to mark them as needed. */
5093 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5095 switch (s
->data_statement
.type
)
5113 if (size
< TO_SIZE ((unsigned) 1))
5114 size
= TO_SIZE ((unsigned) 1);
5115 dot
+= TO_ADDR (size
);
5116 output_section_statement
->bfd_section
->size
5117 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5122 case lang_reloc_statement_enum
:
5126 s
->reloc_statement
.output_offset
=
5127 dot
- output_section_statement
->bfd_section
->vma
;
5128 s
->reloc_statement
.output_section
=
5129 output_section_statement
->bfd_section
;
5130 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5131 dot
+= TO_ADDR (size
);
5132 output_section_statement
->bfd_section
->size
5133 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5137 case lang_wild_statement_enum
:
5138 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5139 output_section_statement
,
5140 fill
, dot
, relax
, check_regions
);
5143 case lang_object_symbols_statement_enum
:
5144 link_info
.create_object_symbols_section
=
5145 output_section_statement
->bfd_section
;
5148 case lang_output_statement_enum
:
5149 case lang_target_statement_enum
:
5152 case lang_input_section_enum
:
5156 i
= s
->input_section
.section
;
5161 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5162 einfo (_("%P%F: can't relax section: %E\n"));
5166 dot
= size_input_section (prev
, output_section_statement
,
5167 output_section_statement
->fill
, dot
);
5171 case lang_input_statement_enum
:
5174 case lang_fill_statement_enum
:
5175 s
->fill_statement
.output_section
=
5176 output_section_statement
->bfd_section
;
5178 fill
= s
->fill_statement
.fill
;
5181 case lang_assignment_statement_enum
:
5183 bfd_vma newdot
= dot
;
5184 etree_type
*tree
= s
->assignment_statement
.exp
;
5186 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5188 exp_fold_tree (tree
,
5189 output_section_statement
->bfd_section
,
5192 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5194 if (!expld
.dataseg
.relro_start_stat
)
5195 expld
.dataseg
.relro_start_stat
= s
;
5198 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5201 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5203 if (!expld
.dataseg
.relro_end_stat
)
5204 expld
.dataseg
.relro_end_stat
= s
;
5207 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5210 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5212 /* This symbol may be relative to this section. */
5213 if ((tree
->type
.node_class
== etree_provided
5214 || tree
->type
.node_class
== etree_assign
)
5215 && (tree
->assign
.dst
[0] != '.'
5216 || tree
->assign
.dst
[1] != '\0'))
5217 output_section_statement
->update_dot
= 1;
5219 if (!output_section_statement
->ignored
)
5221 if (output_section_statement
== abs_output_section
)
5223 /* If we don't have an output section, then just adjust
5224 the default memory address. */
5225 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5226 FALSE
)->current
= newdot
;
5228 else if (newdot
!= dot
)
5230 /* Insert a pad after this statement. We can't
5231 put the pad before when relaxing, in case the
5232 assignment references dot. */
5233 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5234 output_section_statement
->bfd_section
, dot
);
5236 /* Don't neuter the pad below when relaxing. */
5239 /* If dot is advanced, this implies that the section
5240 should have space allocated to it, unless the
5241 user has explicitly stated that the section
5242 should not be allocated. */
5243 if (output_section_statement
->sectype
!= noalloc_section
5244 && (output_section_statement
->sectype
!= noload_section
5245 || (bfd_get_flavour (link_info
.output_bfd
)
5246 == bfd_target_elf_flavour
)))
5247 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5254 case lang_padding_statement_enum
:
5255 /* If this is the first time lang_size_sections is called,
5256 we won't have any padding statements. If this is the
5257 second or later passes when relaxing, we should allow
5258 padding to shrink. If padding is needed on this pass, it
5259 will be added back in. */
5260 s
->padding_statement
.size
= 0;
5262 /* Make sure output_offset is valid. If relaxation shrinks
5263 the section and this pad isn't needed, it's possible to
5264 have output_offset larger than the final size of the
5265 section. bfd_set_section_contents will complain even for
5266 a pad size of zero. */
5267 s
->padding_statement
.output_offset
5268 = dot
- output_section_statement
->bfd_section
->vma
;
5271 case lang_group_statement_enum
:
5272 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5273 output_section_statement
,
5274 fill
, dot
, relax
, check_regions
);
5277 case lang_insert_statement_enum
:
5280 /* We can only get here when relaxing is turned on. */
5281 case lang_address_statement_enum
:
5288 prev
= &s
->header
.next
;
5293 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5294 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5295 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5296 segments. We are allowed an opportunity to override this decision. */
5299 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5300 bfd
* abfd ATTRIBUTE_UNUSED
,
5301 asection
* current_section
,
5302 asection
* previous_section
,
5303 bfd_boolean new_segment
)
5305 lang_output_section_statement_type
* cur
;
5306 lang_output_section_statement_type
* prev
;
5308 /* The checks below are only necessary when the BFD library has decided
5309 that the two sections ought to be placed into the same segment. */
5313 /* Paranoia checks. */
5314 if (current_section
== NULL
|| previous_section
== NULL
)
5317 /* If this flag is set, the target never wants code and non-code
5318 sections comingled in the same segment. */
5319 if (config
.separate_code
5320 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5323 /* Find the memory regions associated with the two sections.
5324 We call lang_output_section_find() here rather than scanning the list
5325 of output sections looking for a matching section pointer because if
5326 we have a large number of sections then a hash lookup is faster. */
5327 cur
= lang_output_section_find (current_section
->name
);
5328 prev
= lang_output_section_find (previous_section
->name
);
5330 /* More paranoia. */
5331 if (cur
== NULL
|| prev
== NULL
)
5334 /* If the regions are different then force the sections to live in
5335 different segments. See the email thread starting at the following
5336 URL for the reasons why this is necessary:
5337 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5338 return cur
->region
!= prev
->region
;
5342 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5344 lang_statement_iteration
++;
5345 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5346 0, 0, relax
, check_regions
);
5350 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5352 expld
.phase
= lang_allocating_phase_enum
;
5353 expld
.dataseg
.phase
= exp_dataseg_none
;
5355 one_lang_size_sections_pass (relax
, check_regions
);
5356 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5357 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5359 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5360 to put expld.dataseg.relro on a (common) page boundary. */
5361 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5363 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5364 maxpage
= expld
.dataseg
.maxpagesize
;
5365 /* MIN_BASE is the absolute minimum address we are allowed to start the
5366 read-write segment (byte before will be mapped read-only). */
5367 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5368 /* OLD_BASE is the address for a feasible minimum address which will
5369 still not cause a data overlap inside MAXPAGE causing file offset skip
5371 old_base
= expld
.dataseg
.base
;
5372 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5373 & (expld
.dataseg
.pagesize
- 1));
5374 /* Compute the expected PT_GNU_RELRO segment end. */
5375 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5376 & ~(expld
.dataseg
.pagesize
- 1));
5377 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5379 expld
.dataseg
.base
-= maxpage
;
5380 relro_end
-= maxpage
;
5382 lang_reset_memory_regions ();
5383 one_lang_size_sections_pass (relax
, check_regions
);
5384 if (expld
.dataseg
.relro_end
> relro_end
)
5386 /* The alignment of sections between DATA_SEGMENT_ALIGN
5387 and DATA_SEGMENT_RELRO_END caused huge padding to be
5388 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5389 that the section alignments will fit in. */
5391 unsigned int max_alignment_power
= 0;
5393 /* Find maximum alignment power of sections between
5394 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5395 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5396 if (sec
->vma
>= expld
.dataseg
.base
5397 && sec
->vma
< expld
.dataseg
.relro_end
5398 && sec
->alignment_power
> max_alignment_power
)
5399 max_alignment_power
= sec
->alignment_power
;
5401 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5403 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5404 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5405 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5406 lang_reset_memory_regions ();
5407 one_lang_size_sections_pass (relax
, check_regions
);
5410 link_info
.relro_start
= expld
.dataseg
.base
;
5411 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5413 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5415 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5416 a page could be saved in the data segment. */
5417 bfd_vma first
, last
;
5419 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5420 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5422 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5423 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5424 && first
+ last
<= expld
.dataseg
.pagesize
)
5426 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5427 lang_reset_memory_regions ();
5428 one_lang_size_sections_pass (relax
, check_regions
);
5431 expld
.dataseg
.phase
= exp_dataseg_done
;
5434 expld
.dataseg
.phase
= exp_dataseg_done
;
5437 static lang_output_section_statement_type
*current_section
;
5438 static lang_assignment_statement_type
*current_assign
;
5439 static bfd_boolean prefer_next_section
;
5441 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5444 lang_do_assignments_1 (lang_statement_union_type
*s
,
5445 lang_output_section_statement_type
*current_os
,
5448 bfd_boolean
*found_end
)
5450 for (; s
!= NULL
; s
= s
->header
.next
)
5452 switch (s
->header
.type
)
5454 case lang_constructors_statement_enum
:
5455 dot
= lang_do_assignments_1 (constructor_list
.head
,
5456 current_os
, fill
, dot
, found_end
);
5459 case lang_output_section_statement_enum
:
5461 lang_output_section_statement_type
*os
;
5463 os
= &(s
->output_section_statement
);
5464 os
->after_end
= *found_end
;
5465 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5467 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5469 current_section
= os
;
5470 prefer_next_section
= FALSE
;
5472 dot
= os
->bfd_section
->vma
;
5474 lang_do_assignments_1 (os
->children
.head
,
5475 os
, os
->fill
, dot
, found_end
);
5477 /* .tbss sections effectively have zero size. */
5478 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5479 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5480 || link_info
.relocatable
)
5481 dot
+= TO_ADDR (os
->bfd_section
->size
);
5483 if (os
->update_dot_tree
!= NULL
)
5484 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5489 case lang_wild_statement_enum
:
5491 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5492 current_os
, fill
, dot
, found_end
);
5495 case lang_object_symbols_statement_enum
:
5496 case lang_output_statement_enum
:
5497 case lang_target_statement_enum
:
5500 case lang_data_statement_enum
:
5501 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5502 if (expld
.result
.valid_p
)
5504 s
->data_statement
.value
= expld
.result
.value
;
5505 if (expld
.result
.section
!= NULL
)
5506 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5509 einfo (_("%F%P: invalid data statement\n"));
5512 switch (s
->data_statement
.type
)
5530 if (size
< TO_SIZE ((unsigned) 1))
5531 size
= TO_SIZE ((unsigned) 1);
5532 dot
+= TO_ADDR (size
);
5536 case lang_reloc_statement_enum
:
5537 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5538 bfd_abs_section_ptr
, &dot
);
5539 if (expld
.result
.valid_p
)
5540 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5542 einfo (_("%F%P: invalid reloc statement\n"));
5543 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5546 case lang_input_section_enum
:
5548 asection
*in
= s
->input_section
.section
;
5550 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5551 dot
+= TO_ADDR (in
->size
);
5555 case lang_input_statement_enum
:
5558 case lang_fill_statement_enum
:
5559 fill
= s
->fill_statement
.fill
;
5562 case lang_assignment_statement_enum
:
5563 current_assign
= &s
->assignment_statement
;
5564 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5566 const char *p
= current_assign
->exp
->assign
.dst
;
5568 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5569 prefer_next_section
= TRUE
;
5573 if (strcmp (p
, "end") == 0)
5576 exp_fold_tree (s
->assignment_statement
.exp
,
5577 current_os
->bfd_section
,
5581 case lang_padding_statement_enum
:
5582 dot
+= TO_ADDR (s
->padding_statement
.size
);
5585 case lang_group_statement_enum
:
5586 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5587 current_os
, fill
, dot
, found_end
);
5590 case lang_insert_statement_enum
:
5593 case lang_address_statement_enum
:
5605 lang_do_assignments (lang_phase_type phase
)
5607 bfd_boolean found_end
= FALSE
;
5609 current_section
= NULL
;
5610 prefer_next_section
= FALSE
;
5611 expld
.phase
= phase
;
5612 lang_statement_iteration
++;
5613 lang_do_assignments_1 (statement_list
.head
,
5614 abs_output_section
, NULL
, 0, &found_end
);
5617 /* For an assignment statement outside of an output section statement,
5618 choose the best of neighbouring output sections to use for values
5622 section_for_dot (void)
5626 /* Assignments belong to the previous output section, unless there
5627 has been an assignment to "dot", in which case following
5628 assignments belong to the next output section. (The assumption
5629 is that an assignment to "dot" is setting up the address for the
5630 next output section.) Except that past the assignment to "_end"
5631 we always associate with the previous section. This exception is
5632 for targets like SH that define an alloc .stack or other
5633 weirdness after non-alloc sections. */
5634 if (current_section
== NULL
|| prefer_next_section
)
5636 lang_statement_union_type
*stmt
;
5637 lang_output_section_statement_type
*os
;
5639 for (stmt
= (lang_statement_union_type
*) current_assign
;
5641 stmt
= stmt
->header
.next
)
5642 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5645 os
= &stmt
->output_section_statement
;
5648 && (os
->bfd_section
== NULL
5649 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5650 || bfd_section_removed_from_list (link_info
.output_bfd
,
5654 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5657 s
= os
->bfd_section
;
5659 s
= link_info
.output_bfd
->section_last
;
5661 && ((s
->flags
& SEC_ALLOC
) == 0
5662 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5667 return bfd_abs_section_ptr
;
5671 s
= current_section
->bfd_section
;
5673 /* The section may have been stripped. */
5675 && ((s
->flags
& SEC_EXCLUDE
) != 0
5676 || (s
->flags
& SEC_ALLOC
) == 0
5677 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5678 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5681 s
= link_info
.output_bfd
->sections
;
5683 && ((s
->flags
& SEC_ALLOC
) == 0
5684 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5689 return bfd_abs_section_ptr
;
5692 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5693 operator .startof. (section_name), it produces an undefined symbol
5694 .startof.section_name. Similarly, when it sees
5695 .sizeof. (section_name), it produces an undefined symbol
5696 .sizeof.section_name. For all the output sections, we look for
5697 such symbols, and set them to the correct value. */
5700 lang_set_startof (void)
5704 if (link_info
.relocatable
)
5707 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5709 const char *secname
;
5711 struct bfd_link_hash_entry
*h
;
5713 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5714 buf
= (char *) xmalloc (10 + strlen (secname
));
5716 sprintf (buf
, ".startof.%s", secname
);
5717 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5718 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5720 h
->type
= bfd_link_hash_defined
;
5722 h
->u
.def
.section
= s
;
5725 sprintf (buf
, ".sizeof.%s", secname
);
5726 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5727 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5729 h
->type
= bfd_link_hash_defined
;
5730 h
->u
.def
.value
= TO_ADDR (s
->size
);
5731 h
->u
.def
.section
= bfd_abs_section_ptr
;
5741 struct bfd_link_hash_entry
*h
;
5744 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5745 || (link_info
.shared
&& !link_info
.executable
))
5746 warn
= entry_from_cmdline
;
5750 /* Force the user to specify a root when generating a relocatable with
5752 if (link_info
.gc_sections
&& link_info
.relocatable
5753 && !(entry_from_cmdline
|| undef_from_cmdline
))
5754 einfo (_("%P%F: gc-sections requires either an entry or "
5755 "an undefined symbol\n"));
5757 if (entry_symbol
.name
== NULL
)
5759 /* No entry has been specified. Look for the default entry, but
5760 don't warn if we don't find it. */
5761 entry_symbol
.name
= entry_symbol_default
;
5765 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5766 FALSE
, FALSE
, TRUE
);
5768 && (h
->type
== bfd_link_hash_defined
5769 || h
->type
== bfd_link_hash_defweak
)
5770 && h
->u
.def
.section
->output_section
!= NULL
)
5774 val
= (h
->u
.def
.value
5775 + bfd_get_section_vma (link_info
.output_bfd
,
5776 h
->u
.def
.section
->output_section
)
5777 + h
->u
.def
.section
->output_offset
);
5778 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5779 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5786 /* We couldn't find the entry symbol. Try parsing it as a
5788 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5791 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5792 einfo (_("%P%F: can't set start address\n"));
5798 /* Can't find the entry symbol, and it's not a number. Use
5799 the first address in the text section. */
5800 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5804 einfo (_("%P: warning: cannot find entry symbol %s;"
5805 " defaulting to %V\n"),
5807 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5808 if (!(bfd_set_start_address
5809 (link_info
.output_bfd
,
5810 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5811 einfo (_("%P%F: can't set start address\n"));
5816 einfo (_("%P: warning: cannot find entry symbol %s;"
5817 " not setting start address\n"),
5824 /* This is a small function used when we want to ignore errors from
5828 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5830 /* Don't do anything. */
5833 /* Check that the architecture of all the input files is compatible
5834 with the output file. Also call the backend to let it do any
5835 other checking that is needed. */
5840 lang_statement_union_type
*file
;
5842 const bfd_arch_info_type
*compatible
;
5844 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5846 #ifdef ENABLE_PLUGINS
5847 /* Don't check format of files claimed by plugin. */
5848 if (file
->input_statement
.flags
.claimed
)
5850 #endif /* ENABLE_PLUGINS */
5851 input_bfd
= file
->input_statement
.the_bfd
;
5853 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5854 command_line
.accept_unknown_input_arch
);
5856 /* In general it is not possible to perform a relocatable
5857 link between differing object formats when the input
5858 file has relocations, because the relocations in the
5859 input format may not have equivalent representations in
5860 the output format (and besides BFD does not translate
5861 relocs for other link purposes than a final link). */
5862 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5863 && (compatible
== NULL
5864 || (bfd_get_flavour (input_bfd
)
5865 != bfd_get_flavour (link_info
.output_bfd
)))
5866 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5868 einfo (_("%P%F: Relocatable linking with relocations from"
5869 " format %s (%B) to format %s (%B) is not supported\n"),
5870 bfd_get_target (input_bfd
), input_bfd
,
5871 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5872 /* einfo with %F exits. */
5875 if (compatible
== NULL
)
5877 if (command_line
.warn_mismatch
)
5878 einfo (_("%P%X: %s architecture of input file `%B'"
5879 " is incompatible with %s output\n"),
5880 bfd_printable_name (input_bfd
), input_bfd
,
5881 bfd_printable_name (link_info
.output_bfd
));
5883 else if (bfd_count_sections (input_bfd
))
5885 /* If the input bfd has no contents, it shouldn't set the
5886 private data of the output bfd. */
5888 bfd_error_handler_type pfn
= NULL
;
5890 /* If we aren't supposed to warn about mismatched input
5891 files, temporarily set the BFD error handler to a
5892 function which will do nothing. We still want to call
5893 bfd_merge_private_bfd_data, since it may set up
5894 information which is needed in the output file. */
5895 if (! command_line
.warn_mismatch
)
5896 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5897 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5899 if (command_line
.warn_mismatch
)
5900 einfo (_("%P%X: failed to merge target specific data"
5901 " of file %B\n"), input_bfd
);
5903 if (! command_line
.warn_mismatch
)
5904 bfd_set_error_handler (pfn
);
5909 /* Look through all the global common symbols and attach them to the
5910 correct section. The -sort-common command line switch may be used
5911 to roughly sort the entries by alignment. */
5916 if (command_line
.inhibit_common_definition
)
5918 if (link_info
.relocatable
5919 && ! command_line
.force_common_definition
)
5922 if (! config
.sort_common
)
5923 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5928 if (config
.sort_common
== sort_descending
)
5930 for (power
= 4; power
> 0; power
--)
5931 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5934 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5938 for (power
= 0; power
<= 4; power
++)
5939 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5942 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5947 /* Place one common symbol in the correct section. */
5950 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5952 unsigned int power_of_two
;
5956 if (h
->type
!= bfd_link_hash_common
)
5960 power_of_two
= h
->u
.c
.p
->alignment_power
;
5962 if (config
.sort_common
== sort_descending
5963 && power_of_two
< *(unsigned int *) info
)
5965 else if (config
.sort_common
== sort_ascending
5966 && power_of_two
> *(unsigned int *) info
)
5969 section
= h
->u
.c
.p
->section
;
5970 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
5971 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5974 if (config
.map_file
!= NULL
)
5976 static bfd_boolean header_printed
;
5981 if (! header_printed
)
5983 minfo (_("\nAllocating common symbols\n"));
5984 minfo (_("Common symbol size file\n\n"));
5985 header_printed
= TRUE
;
5988 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5989 DMGL_ANSI
| DMGL_PARAMS
);
5992 minfo ("%s", h
->root
.string
);
5993 len
= strlen (h
->root
.string
);
5998 len
= strlen (name
);
6014 if (size
<= 0xffffffff)
6015 sprintf (buf
, "%lx", (unsigned long) size
);
6017 sprintf_vma (buf
, size
);
6027 minfo ("%B\n", section
->owner
);
6033 /* Run through the input files and ensure that every input section has
6034 somewhere to go. If one is found without a destination then create
6035 an input request and place it into the statement tree. */
6038 lang_place_orphans (void)
6040 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6044 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6046 if (s
->output_section
== NULL
)
6048 /* This section of the file is not attached, root
6049 around for a sensible place for it to go. */
6051 if (file
->flags
.just_syms
)
6052 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6053 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
6054 s
->output_section
= bfd_abs_section_ptr
;
6055 else if (strcmp (s
->name
, "COMMON") == 0)
6057 /* This is a lonely common section which must have
6058 come from an archive. We attach to the section
6059 with the wildcard. */
6060 if (! link_info
.relocatable
6061 || command_line
.force_common_definition
)
6063 if (default_common_section
== NULL
)
6064 default_common_section
6065 = lang_output_section_statement_lookup (".bss", 0,
6067 lang_add_section (&default_common_section
->children
, s
,
6068 NULL
, default_common_section
);
6073 const char *name
= s
->name
;
6076 if (config
.unique_orphan_sections
6077 || unique_section_p (s
, NULL
))
6078 constraint
= SPECIAL
;
6080 if (!ldemul_place_orphan (s
, name
, constraint
))
6082 lang_output_section_statement_type
*os
;
6083 os
= lang_output_section_statement_lookup (name
,
6086 if (os
->addr_tree
== NULL
6087 && (link_info
.relocatable
6088 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6089 os
->addr_tree
= exp_intop (0);
6090 lang_add_section (&os
->children
, s
, NULL
, os
);
6099 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6101 flagword
*ptr_flags
;
6103 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6109 *ptr_flags
|= SEC_ALLOC
;
6113 *ptr_flags
|= SEC_READONLY
;
6117 *ptr_flags
|= SEC_DATA
;
6121 *ptr_flags
|= SEC_CODE
;
6126 *ptr_flags
|= SEC_LOAD
;
6130 einfo (_("%P%F: invalid syntax in flags\n"));
6137 /* Call a function on each input file. This function will be called
6138 on an archive, but not on the elements. */
6141 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6143 lang_input_statement_type
*f
;
6145 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6147 f
= (lang_input_statement_type
*) f
->next_real_file
)
6151 /* Call a function on each file. The function will be called on all
6152 the elements of an archive which are included in the link, but will
6153 not be called on the archive file itself. */
6156 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6158 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6165 ldlang_add_file (lang_input_statement_type
*entry
)
6167 lang_statement_append (&file_chain
,
6168 (lang_statement_union_type
*) entry
,
6171 /* The BFD linker needs to have a list of all input BFDs involved in
6173 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6174 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6176 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6177 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6178 entry
->the_bfd
->usrdata
= entry
;
6179 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6181 /* Look through the sections and check for any which should not be
6182 included in the link. We need to do this now, so that we can
6183 notice when the backend linker tries to report multiple
6184 definition errors for symbols which are in sections we aren't
6185 going to link. FIXME: It might be better to entirely ignore
6186 symbols which are defined in sections which are going to be
6187 discarded. This would require modifying the backend linker for
6188 each backend which might set the SEC_LINK_ONCE flag. If we do
6189 this, we should probably handle SEC_EXCLUDE in the same way. */
6191 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6195 lang_add_output (const char *name
, int from_script
)
6197 /* Make -o on command line override OUTPUT in script. */
6198 if (!had_output_filename
|| !from_script
)
6200 output_filename
= name
;
6201 had_output_filename
= TRUE
;
6214 for (l
= 0; l
< 32; l
++)
6216 if (i
>= (unsigned int) x
)
6224 lang_output_section_statement_type
*
6225 lang_enter_output_section_statement (const char *output_section_statement_name
,
6226 etree_type
*address_exp
,
6227 enum section_type sectype
,
6229 etree_type
*subalign
,
6233 lang_output_section_statement_type
*os
;
6235 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6237 current_section
= os
;
6239 if (os
->addr_tree
== NULL
)
6241 os
->addr_tree
= address_exp
;
6243 os
->sectype
= sectype
;
6244 if (sectype
!= noload_section
)
6245 os
->flags
= SEC_NO_FLAGS
;
6247 os
->flags
= SEC_NEVER_LOAD
;
6248 os
->block_value
= 1;
6250 /* Make next things chain into subchain of this. */
6251 push_stat_ptr (&os
->children
);
6253 os
->subsection_alignment
=
6254 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6255 os
->section_alignment
=
6256 topower (exp_get_value_int (align
, -1, "section alignment"));
6258 os
->load_base
= ebase
;
6265 lang_output_statement_type
*new_stmt
;
6267 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6268 new_stmt
->name
= output_filename
;
6272 /* Reset the current counters in the regions. */
6275 lang_reset_memory_regions (void)
6277 lang_memory_region_type
*p
= lang_memory_region_list
;
6279 lang_output_section_statement_type
*os
;
6281 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6283 p
->current
= p
->origin
;
6287 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6291 os
->processed_vma
= FALSE
;
6292 os
->processed_lma
= FALSE
;
6295 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6297 /* Save the last size for possible use by bfd_relax_section. */
6298 o
->rawsize
= o
->size
;
6303 /* Worker for lang_gc_sections_1. */
6306 gc_section_callback (lang_wild_statement_type
*ptr
,
6307 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6309 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6310 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6311 void *data ATTRIBUTE_UNUSED
)
6313 /* If the wild pattern was marked KEEP, the member sections
6314 should be as well. */
6315 if (ptr
->keep_sections
)
6316 section
->flags
|= SEC_KEEP
;
6319 /* Iterate over sections marking them against GC. */
6322 lang_gc_sections_1 (lang_statement_union_type
*s
)
6324 for (; s
!= NULL
; s
= s
->header
.next
)
6326 switch (s
->header
.type
)
6328 case lang_wild_statement_enum
:
6329 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6331 case lang_constructors_statement_enum
:
6332 lang_gc_sections_1 (constructor_list
.head
);
6334 case lang_output_section_statement_enum
:
6335 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6337 case lang_group_statement_enum
:
6338 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6347 lang_gc_sections (void)
6349 /* Keep all sections so marked in the link script. */
6351 lang_gc_sections_1 (statement_list
.head
);
6353 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6354 the special case of debug info. (See bfd/stabs.c)
6355 Twiddle the flag here, to simplify later linker code. */
6356 if (link_info
.relocatable
)
6358 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6361 #ifdef ENABLE_PLUGINS
6362 if (f
->flags
.claimed
)
6365 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6366 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6367 sec
->flags
&= ~SEC_EXCLUDE
;
6371 if (link_info
.gc_sections
)
6372 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6375 /* Worker for lang_find_relro_sections_1. */
6378 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6379 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6381 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6382 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6385 /* Discarded, excluded and ignored sections effectively have zero
6387 if (section
->output_section
!= NULL
6388 && section
->output_section
->owner
== link_info
.output_bfd
6389 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6390 && !IGNORE_SECTION (section
)
6391 && section
->size
!= 0)
6393 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6394 *has_relro_section
= TRUE
;
6398 /* Iterate over sections for relro sections. */
6401 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6402 bfd_boolean
*has_relro_section
)
6404 if (*has_relro_section
)
6407 for (; s
!= NULL
; s
= s
->header
.next
)
6409 if (s
== expld
.dataseg
.relro_end_stat
)
6412 switch (s
->header
.type
)
6414 case lang_wild_statement_enum
:
6415 walk_wild (&s
->wild_statement
,
6416 find_relro_section_callback
,
6419 case lang_constructors_statement_enum
:
6420 lang_find_relro_sections_1 (constructor_list
.head
,
6423 case lang_output_section_statement_enum
:
6424 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6427 case lang_group_statement_enum
:
6428 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6438 lang_find_relro_sections (void)
6440 bfd_boolean has_relro_section
= FALSE
;
6442 /* Check all sections in the link script. */
6444 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6445 &has_relro_section
);
6447 if (!has_relro_section
)
6448 link_info
.relro
= FALSE
;
6451 /* Relax all sections until bfd_relax_section gives up. */
6454 lang_relax_sections (bfd_boolean need_layout
)
6456 if (RELAXATION_ENABLED
)
6458 /* We may need more than one relaxation pass. */
6459 int i
= link_info
.relax_pass
;
6461 /* The backend can use it to determine the current pass. */
6462 link_info
.relax_pass
= 0;
6466 /* Keep relaxing until bfd_relax_section gives up. */
6467 bfd_boolean relax_again
;
6469 link_info
.relax_trip
= -1;
6472 link_info
.relax_trip
++;
6474 /* Note: pe-dll.c does something like this also. If you find
6475 you need to change this code, you probably need to change
6476 pe-dll.c also. DJ */
6478 /* Do all the assignments with our current guesses as to
6480 lang_do_assignments (lang_assigning_phase_enum
);
6482 /* We must do this after lang_do_assignments, because it uses
6484 lang_reset_memory_regions ();
6486 /* Perform another relax pass - this time we know where the
6487 globals are, so can make a better guess. */
6488 relax_again
= FALSE
;
6489 lang_size_sections (&relax_again
, FALSE
);
6491 while (relax_again
);
6493 link_info
.relax_pass
++;
6500 /* Final extra sizing to report errors. */
6501 lang_do_assignments (lang_assigning_phase_enum
);
6502 lang_reset_memory_regions ();
6503 lang_size_sections (NULL
, TRUE
);
6507 #ifdef ENABLE_PLUGINS
6508 /* Find the insert point for the plugin's replacement files. We
6509 place them after the first claimed real object file, or if the
6510 first claimed object is an archive member, after the last real
6511 object file immediately preceding the archive. In the event
6512 no objects have been claimed at all, we return the first dummy
6513 object file on the list as the insert point; that works, but
6514 the callee must be careful when relinking the file_chain as it
6515 is not actually on that chain, only the statement_list and the
6516 input_file list; in that case, the replacement files must be
6517 inserted at the head of the file_chain. */
6519 static lang_input_statement_type
*
6520 find_replacements_insert_point (void)
6522 lang_input_statement_type
*claim1
, *lastobject
;
6523 lastobject
= &input_file_chain
.head
->input_statement
;
6524 for (claim1
= &file_chain
.head
->input_statement
;
6526 claim1
= &claim1
->next
->input_statement
)
6528 if (claim1
->flags
.claimed
)
6529 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6530 /* Update lastobject if this is a real object file. */
6531 if (claim1
->the_bfd
&& (claim1
->the_bfd
->my_archive
== NULL
))
6532 lastobject
= claim1
;
6534 /* No files were claimed by the plugin. Choose the last object
6535 file found on the list (maybe the first, dummy entry) as the
6540 /* Insert SRCLIST into DESTLIST after given element by chaining
6541 on FIELD as the next-pointer. (Counterintuitively does not need
6542 a pointer to the actual after-node itself, just its chain field.) */
6545 lang_list_insert_after (lang_statement_list_type
*destlist
,
6546 lang_statement_list_type
*srclist
,
6547 lang_statement_union_type
**field
)
6549 *(srclist
->tail
) = *field
;
6550 *field
= srclist
->head
;
6551 if (destlist
->tail
== field
)
6552 destlist
->tail
= srclist
->tail
;
6555 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6556 was taken as a copy of it and leave them in ORIGLIST. */
6559 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6560 lang_statement_list_type
*origlist
)
6562 union lang_statement_union
**savetail
;
6563 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6564 ASSERT (origlist
->head
== destlist
->head
);
6565 savetail
= origlist
->tail
;
6566 origlist
->head
= *(savetail
);
6567 origlist
->tail
= destlist
->tail
;
6568 destlist
->tail
= savetail
;
6571 #endif /* ENABLE_PLUGINS */
6576 /* Finalize dynamic list. */
6577 if (link_info
.dynamic_list
)
6578 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6580 current_target
= default_target
;
6582 /* Open the output file. */
6583 lang_for_each_statement (ldlang_open_output
);
6586 ldemul_create_output_section_statements ();
6588 /* Add to the hash table all undefineds on the command line. */
6589 lang_place_undefineds ();
6591 if (!bfd_section_already_linked_table_init ())
6592 einfo (_("%P%F: Failed to create hash table\n"));
6594 /* Create a bfd for each input file. */
6595 current_target
= default_target
;
6596 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6598 #ifdef ENABLE_PLUGINS
6599 if (plugin_active_plugins_p ())
6601 lang_statement_list_type added
;
6602 lang_statement_list_type files
, inputfiles
;
6604 /* Now all files are read, let the plugin(s) decide if there
6605 are any more to be added to the link before we call the
6606 emulation's after_open hook. We create a private list of
6607 input statements for this purpose, which we will eventually
6608 insert into the global statment list after the first claimed
6611 /* We need to manipulate all three chains in synchrony. */
6613 inputfiles
= input_file_chain
;
6614 if (plugin_call_all_symbols_read ())
6615 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6616 plugin_error_plugin ());
6617 /* Open any newly added files, updating the file chains. */
6618 link_info
.loading_lto_outputs
= TRUE
;
6619 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6620 /* Restore the global list pointer now they have all been added. */
6621 lang_list_remove_tail (stat_ptr
, &added
);
6622 /* And detach the fresh ends of the file lists. */
6623 lang_list_remove_tail (&file_chain
, &files
);
6624 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6625 /* Were any new files added? */
6626 if (added
.head
!= NULL
)
6628 /* If so, we will insert them into the statement list immediately
6629 after the first input file that was claimed by the plugin. */
6630 plugin_insert
= find_replacements_insert_point ();
6631 /* If a plugin adds input files without having claimed any, we
6632 don't really have a good idea where to place them. Just putting
6633 them at the start or end of the list is liable to leave them
6634 outside the crtbegin...crtend range. */
6635 ASSERT (plugin_insert
!= NULL
);
6636 /* Splice the new statement list into the old one. */
6637 lang_list_insert_after (stat_ptr
, &added
,
6638 &plugin_insert
->header
.next
);
6639 /* Likewise for the file chains. */
6640 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6641 &plugin_insert
->next_real_file
);
6642 /* We must be careful when relinking file_chain; we may need to
6643 insert the new files at the head of the list if the insert
6644 point chosen is the dummy first input file. */
6645 if (plugin_insert
->filename
)
6646 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6648 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6650 /* Rescan archives in case new undefined symbols have appeared. */
6651 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6654 #endif /* ENABLE_PLUGINS */
6656 link_info
.gc_sym_list
= &entry_symbol
;
6657 if (entry_symbol
.name
== NULL
)
6658 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6660 ldemul_after_open ();
6662 bfd_section_already_linked_table_free ();
6664 /* Make sure that we're not mixing architectures. We call this
6665 after all the input files have been opened, but before we do any
6666 other processing, so that any operations merge_private_bfd_data
6667 does on the output file will be known during the rest of the
6671 /* Handle .exports instead of a version script if we're told to do so. */
6672 if (command_line
.version_exports_section
)
6673 lang_do_version_exports_section ();
6675 /* Build all sets based on the information gathered from the input
6677 ldctor_build_sets ();
6679 /* PR 13683: We must rerun the assignments prior to running garbage
6680 collection in order to make sure that all symbol aliases are resolved. */
6681 lang_do_assignments (lang_mark_phase_enum
);
6682 expld
.phase
= lang_first_phase_enum
;
6684 /* Remove unreferenced sections if asked to. */
6685 lang_gc_sections ();
6687 /* Size up the common data. */
6690 /* Update wild statements. */
6691 update_wild_statements (statement_list
.head
);
6693 /* Run through the contours of the script and attach input sections
6694 to the correct output sections. */
6695 lang_statement_iteration
++;
6696 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6698 process_insert_statements ();
6700 /* Find any sections not attached explicitly and handle them. */
6701 lang_place_orphans ();
6703 if (! link_info
.relocatable
)
6707 /* Merge SEC_MERGE sections. This has to be done after GC of
6708 sections, so that GCed sections are not merged, but before
6709 assigning dynamic symbols, since removing whole input sections
6711 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6713 /* Look for a text section and set the readonly attribute in it. */
6714 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6718 if (config
.text_read_only
)
6719 found
->flags
|= SEC_READONLY
;
6721 found
->flags
&= ~SEC_READONLY
;
6725 /* Do anything special before sizing sections. This is where ELF
6726 and other back-ends size dynamic sections. */
6727 ldemul_before_allocation ();
6729 /* We must record the program headers before we try to fix the
6730 section positions, since they will affect SIZEOF_HEADERS. */
6731 lang_record_phdrs ();
6733 /* Check relro sections. */
6734 if (link_info
.relro
&& ! link_info
.relocatable
)
6735 lang_find_relro_sections ();
6737 /* Size up the sections. */
6738 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6740 /* See if anything special should be done now we know how big
6741 everything is. This is where relaxation is done. */
6742 ldemul_after_allocation ();
6744 /* Fix any .startof. or .sizeof. symbols. */
6745 lang_set_startof ();
6747 /* Do all the assignments, now that we know the final resting places
6748 of all the symbols. */
6749 lang_do_assignments (lang_final_phase_enum
);
6753 /* Make sure that the section addresses make sense. */
6754 if (command_line
.check_section_addresses
)
6755 lang_check_section_addresses ();
6760 /* EXPORTED TO YACC */
6763 lang_add_wild (struct wildcard_spec
*filespec
,
6764 struct wildcard_list
*section_list
,
6765 bfd_boolean keep_sections
)
6767 struct wildcard_list
*curr
, *next
;
6768 lang_wild_statement_type
*new_stmt
;
6770 /* Reverse the list as the parser puts it back to front. */
6771 for (curr
= section_list
, section_list
= NULL
;
6773 section_list
= curr
, curr
= next
)
6775 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6776 placed_commons
= TRUE
;
6779 curr
->next
= section_list
;
6782 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6784 if (strcmp (filespec
->name
, "*") == 0)
6785 filespec
->name
= NULL
;
6786 else if (! wildcardp (filespec
->name
))
6787 lang_has_input_file
= TRUE
;
6790 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6791 new_stmt
->filename
= NULL
;
6792 new_stmt
->filenames_sorted
= FALSE
;
6793 new_stmt
->section_flag_list
= NULL
;
6794 if (filespec
!= NULL
)
6796 new_stmt
->filename
= filespec
->name
;
6797 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6798 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
6800 new_stmt
->section_list
= section_list
;
6801 new_stmt
->keep_sections
= keep_sections
;
6802 lang_list_init (&new_stmt
->children
);
6803 analyze_walk_wild_section_handler (new_stmt
);
6807 lang_section_start (const char *name
, etree_type
*address
,
6808 const segment_type
*segment
)
6810 lang_address_statement_type
*ad
;
6812 ad
= new_stat (lang_address_statement
, stat_ptr
);
6813 ad
->section_name
= name
;
6814 ad
->address
= address
;
6815 ad
->segment
= segment
;
6818 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6819 because of a -e argument on the command line, or zero if this is
6820 called by ENTRY in a linker script. Command line arguments take
6824 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6826 if (entry_symbol
.name
== NULL
6828 || ! entry_from_cmdline
)
6830 entry_symbol
.name
= name
;
6831 entry_from_cmdline
= cmdline
;
6835 /* Set the default start symbol to NAME. .em files should use this,
6836 not lang_add_entry, to override the use of "start" if neither the
6837 linker script nor the command line specifies an entry point. NAME
6838 must be permanently allocated. */
6840 lang_default_entry (const char *name
)
6842 entry_symbol_default
= name
;
6846 lang_add_target (const char *name
)
6848 lang_target_statement_type
*new_stmt
;
6850 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6851 new_stmt
->target
= name
;
6855 lang_add_map (const char *name
)
6862 map_option_f
= TRUE
;
6870 lang_add_fill (fill_type
*fill
)
6872 lang_fill_statement_type
*new_stmt
;
6874 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6875 new_stmt
->fill
= fill
;
6879 lang_add_data (int type
, union etree_union
*exp
)
6881 lang_data_statement_type
*new_stmt
;
6883 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6884 new_stmt
->exp
= exp
;
6885 new_stmt
->type
= type
;
6888 /* Create a new reloc statement. RELOC is the BFD relocation type to
6889 generate. HOWTO is the corresponding howto structure (we could
6890 look this up, but the caller has already done so). SECTION is the
6891 section to generate a reloc against, or NAME is the name of the
6892 symbol to generate a reloc against. Exactly one of SECTION and
6893 NAME must be NULL. ADDEND is an expression for the addend. */
6896 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6897 reloc_howto_type
*howto
,
6900 union etree_union
*addend
)
6902 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6906 p
->section
= section
;
6908 p
->addend_exp
= addend
;
6910 p
->addend_value
= 0;
6911 p
->output_section
= NULL
;
6912 p
->output_offset
= 0;
6915 lang_assignment_statement_type
*
6916 lang_add_assignment (etree_type
*exp
)
6918 lang_assignment_statement_type
*new_stmt
;
6920 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6921 new_stmt
->exp
= exp
;
6926 lang_add_attribute (enum statement_enum attribute
)
6928 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6932 lang_startup (const char *name
)
6934 if (first_file
->filename
!= NULL
)
6936 einfo (_("%P%F: multiple STARTUP files\n"));
6938 first_file
->filename
= name
;
6939 first_file
->local_sym_name
= name
;
6940 first_file
->flags
.real
= TRUE
;
6944 lang_float (bfd_boolean maybe
)
6946 lang_float_flag
= maybe
;
6950 /* Work out the load- and run-time regions from a script statement, and
6951 store them in *LMA_REGION and *REGION respectively.
6953 MEMSPEC is the name of the run-time region, or the value of
6954 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6955 LMA_MEMSPEC is the name of the load-time region, or null if the
6956 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6957 had an explicit load address.
6959 It is an error to specify both a load region and a load address. */
6962 lang_get_regions (lang_memory_region_type
**region
,
6963 lang_memory_region_type
**lma_region
,
6964 const char *memspec
,
6965 const char *lma_memspec
,
6966 bfd_boolean have_lma
,
6967 bfd_boolean have_vma
)
6969 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6971 /* If no runtime region or VMA has been specified, but the load region
6972 has been specified, then use the load region for the runtime region
6974 if (lma_memspec
!= NULL
6976 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6977 *region
= *lma_region
;
6979 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6981 if (have_lma
&& lma_memspec
!= 0)
6982 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
6987 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6988 lang_output_section_phdr_list
*phdrs
,
6989 const char *lma_memspec
)
6991 lang_get_regions (¤t_section
->region
,
6992 ¤t_section
->lma_region
,
6993 memspec
, lma_memspec
,
6994 current_section
->load_base
!= NULL
,
6995 current_section
->addr_tree
!= NULL
);
6997 /* If this section has no load region or base, but uses the same
6998 region as the previous section, then propagate the previous
6999 section's load region. */
7001 if (current_section
->lma_region
== NULL
7002 && current_section
->load_base
== NULL
7003 && current_section
->addr_tree
== NULL
7004 && current_section
->region
== current_section
->prev
->region
)
7005 current_section
->lma_region
= current_section
->prev
->lma_region
;
7007 current_section
->fill
= fill
;
7008 current_section
->phdrs
= phdrs
;
7013 lang_statement_append (lang_statement_list_type
*list
,
7014 lang_statement_union_type
*element
,
7015 lang_statement_union_type
**field
)
7017 *(list
->tail
) = element
;
7021 /* Set the output format type. -oformat overrides scripts. */
7024 lang_add_output_format (const char *format
,
7029 if (output_target
== NULL
|| !from_script
)
7031 if (command_line
.endian
== ENDIAN_BIG
7034 else if (command_line
.endian
== ENDIAN_LITTLE
7038 output_target
= format
;
7043 lang_add_insert (const char *where
, int is_before
)
7045 lang_insert_statement_type
*new_stmt
;
7047 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7048 new_stmt
->where
= where
;
7049 new_stmt
->is_before
= is_before
;
7050 saved_script_handle
= previous_script_handle
;
7053 /* Enter a group. This creates a new lang_group_statement, and sets
7054 stat_ptr to build new statements within the group. */
7057 lang_enter_group (void)
7059 lang_group_statement_type
*g
;
7061 g
= new_stat (lang_group_statement
, stat_ptr
);
7062 lang_list_init (&g
->children
);
7063 push_stat_ptr (&g
->children
);
7066 /* Leave a group. This just resets stat_ptr to start writing to the
7067 regular list of statements again. Note that this will not work if
7068 groups can occur inside anything else which can adjust stat_ptr,
7069 but currently they can't. */
7072 lang_leave_group (void)
7077 /* Add a new program header. This is called for each entry in a PHDRS
7078 command in a linker script. */
7081 lang_new_phdr (const char *name
,
7083 bfd_boolean filehdr
,
7088 struct lang_phdr
*n
, **pp
;
7091 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7094 n
->type
= exp_get_value_int (type
, 0, "program header type");
7095 n
->filehdr
= filehdr
;
7100 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7102 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7105 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7107 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7108 " when prior PT_LOAD headers lack them\n"), NULL
);
7115 /* Record the program header information in the output BFD. FIXME: We
7116 should not be calling an ELF specific function here. */
7119 lang_record_phdrs (void)
7123 lang_output_section_phdr_list
*last
;
7124 struct lang_phdr
*l
;
7125 lang_output_section_statement_type
*os
;
7128 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7131 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7138 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7142 lang_output_section_phdr_list
*pl
;
7144 if (os
->constraint
< 0)
7152 if (os
->sectype
== noload_section
7153 || os
->bfd_section
== NULL
7154 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7157 /* Don't add orphans to PT_INTERP header. */
7163 lang_output_section_statement_type
* tmp_os
;
7165 /* If we have not run across a section with a program
7166 header assigned to it yet, then scan forwards to find
7167 one. This prevents inconsistencies in the linker's
7168 behaviour when a script has specified just a single
7169 header and there are sections in that script which are
7170 not assigned to it, and which occur before the first
7171 use of that header. See here for more details:
7172 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7173 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7176 last
= tmp_os
->phdrs
;
7180 einfo (_("%F%P: no sections assigned to phdrs\n"));
7185 if (os
->bfd_section
== NULL
)
7188 for (; pl
!= NULL
; pl
= pl
->next
)
7190 if (strcmp (pl
->name
, l
->name
) == 0)
7195 secs
= (asection
**) xrealloc (secs
,
7196 alc
* sizeof (asection
*));
7198 secs
[c
] = os
->bfd_section
;
7205 if (l
->flags
== NULL
)
7208 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7213 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7215 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7216 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7217 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7218 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7223 /* Make sure all the phdr assignments succeeded. */
7224 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7228 lang_output_section_phdr_list
*pl
;
7230 if (os
->constraint
< 0
7231 || os
->bfd_section
== NULL
)
7234 for (pl
= os
->phdrs
;
7237 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7238 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7239 os
->name
, pl
->name
);
7243 /* Record a list of sections which may not be cross referenced. */
7246 lang_add_nocrossref (lang_nocrossref_type
*l
)
7248 struct lang_nocrossrefs
*n
;
7250 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7251 n
->next
= nocrossref_list
;
7253 nocrossref_list
= n
;
7255 /* Set notice_all so that we get informed about all symbols. */
7256 link_info
.notice_all
= TRUE
;
7259 /* Overlay handling. We handle overlays with some static variables. */
7261 /* The overlay virtual address. */
7262 static etree_type
*overlay_vma
;
7263 /* And subsection alignment. */
7264 static etree_type
*overlay_subalign
;
7266 /* An expression for the maximum section size seen so far. */
7267 static etree_type
*overlay_max
;
7269 /* A list of all the sections in this overlay. */
7271 struct overlay_list
{
7272 struct overlay_list
*next
;
7273 lang_output_section_statement_type
*os
;
7276 static struct overlay_list
*overlay_list
;
7278 /* Start handling an overlay. */
7281 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7283 /* The grammar should prevent nested overlays from occurring. */
7284 ASSERT (overlay_vma
== NULL
7285 && overlay_subalign
== NULL
7286 && overlay_max
== NULL
);
7288 overlay_vma
= vma_expr
;
7289 overlay_subalign
= subalign
;
7292 /* Start a section in an overlay. We handle this by calling
7293 lang_enter_output_section_statement with the correct VMA.
7294 lang_leave_overlay sets up the LMA and memory regions. */
7297 lang_enter_overlay_section (const char *name
)
7299 struct overlay_list
*n
;
7302 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7303 0, overlay_subalign
, 0, 0);
7305 /* If this is the first section, then base the VMA of future
7306 sections on this one. This will work correctly even if `.' is
7307 used in the addresses. */
7308 if (overlay_list
== NULL
)
7309 overlay_vma
= exp_nameop (ADDR
, name
);
7311 /* Remember the section. */
7312 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7313 n
->os
= current_section
;
7314 n
->next
= overlay_list
;
7317 size
= exp_nameop (SIZEOF
, name
);
7319 /* Arrange to work out the maximum section end address. */
7320 if (overlay_max
== NULL
)
7323 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7326 /* Finish a section in an overlay. There isn't any special to do
7330 lang_leave_overlay_section (fill_type
*fill
,
7331 lang_output_section_phdr_list
*phdrs
)
7338 name
= current_section
->name
;
7340 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7341 region and that no load-time region has been specified. It doesn't
7342 really matter what we say here, since lang_leave_overlay will
7344 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7346 /* Define the magic symbols. */
7348 clean
= (char *) xmalloc (strlen (name
) + 1);
7350 for (s1
= name
; *s1
!= '\0'; s1
++)
7351 if (ISALNUM (*s1
) || *s1
== '_')
7355 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7356 sprintf (buf
, "__load_start_%s", clean
);
7357 lang_add_assignment (exp_provide (buf
,
7358 exp_nameop (LOADADDR
, name
),
7361 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7362 sprintf (buf
, "__load_stop_%s", clean
);
7363 lang_add_assignment (exp_provide (buf
,
7365 exp_nameop (LOADADDR
, name
),
7366 exp_nameop (SIZEOF
, name
)),
7372 /* Finish an overlay. If there are any overlay wide settings, this
7373 looks through all the sections in the overlay and sets them. */
7376 lang_leave_overlay (etree_type
*lma_expr
,
7379 const char *memspec
,
7380 lang_output_section_phdr_list
*phdrs
,
7381 const char *lma_memspec
)
7383 lang_memory_region_type
*region
;
7384 lang_memory_region_type
*lma_region
;
7385 struct overlay_list
*l
;
7386 lang_nocrossref_type
*nocrossref
;
7388 lang_get_regions (®ion
, &lma_region
,
7389 memspec
, lma_memspec
,
7390 lma_expr
!= NULL
, FALSE
);
7394 /* After setting the size of the last section, set '.' to end of the
7396 if (overlay_list
!= NULL
)
7398 overlay_list
->os
->update_dot
= 1;
7399 overlay_list
->os
->update_dot_tree
7400 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
7406 struct overlay_list
*next
;
7408 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7411 l
->os
->region
= region
;
7412 l
->os
->lma_region
= lma_region
;
7414 /* The first section has the load address specified in the
7415 OVERLAY statement. The rest are worked out from that.
7416 The base address is not needed (and should be null) if
7417 an LMA region was specified. */
7420 l
->os
->load_base
= lma_expr
;
7421 l
->os
->sectype
= normal_section
;
7423 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7424 l
->os
->phdrs
= phdrs
;
7428 lang_nocrossref_type
*nc
;
7430 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7431 nc
->name
= l
->os
->name
;
7432 nc
->next
= nocrossref
;
7441 if (nocrossref
!= NULL
)
7442 lang_add_nocrossref (nocrossref
);
7445 overlay_list
= NULL
;
7449 /* Version handling. This is only useful for ELF. */
7451 /* If PREV is NULL, return first version pattern matching particular symbol.
7452 If PREV is non-NULL, return first version pattern matching particular
7453 symbol after PREV (previously returned by lang_vers_match). */
7455 static struct bfd_elf_version_expr
*
7456 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7457 struct bfd_elf_version_expr
*prev
,
7461 const char *cxx_sym
= sym
;
7462 const char *java_sym
= sym
;
7463 struct bfd_elf_version_expr
*expr
= NULL
;
7464 enum demangling_styles curr_style
;
7466 curr_style
= CURRENT_DEMANGLING_STYLE
;
7467 cplus_demangle_set_style (no_demangling
);
7468 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7471 cplus_demangle_set_style (curr_style
);
7473 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7475 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7476 DMGL_PARAMS
| DMGL_ANSI
);
7480 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7482 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7487 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7489 struct bfd_elf_version_expr e
;
7491 switch (prev
? prev
->mask
: 0)
7494 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7497 expr
= (struct bfd_elf_version_expr
*)
7498 htab_find ((htab_t
) head
->htab
, &e
);
7499 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7500 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7506 case BFD_ELF_VERSION_C_TYPE
:
7507 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7509 e
.pattern
= cxx_sym
;
7510 expr
= (struct bfd_elf_version_expr
*)
7511 htab_find ((htab_t
) head
->htab
, &e
);
7512 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7513 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7519 case BFD_ELF_VERSION_CXX_TYPE
:
7520 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7522 e
.pattern
= java_sym
;
7523 expr
= (struct bfd_elf_version_expr
*)
7524 htab_find ((htab_t
) head
->htab
, &e
);
7525 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7526 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7537 /* Finally, try the wildcards. */
7538 if (prev
== NULL
|| prev
->literal
)
7539 expr
= head
->remaining
;
7542 for (; expr
; expr
= expr
->next
)
7549 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7552 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7554 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7558 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7564 free ((char *) c_sym
);
7566 free ((char *) cxx_sym
);
7567 if (java_sym
!= sym
)
7568 free ((char *) java_sym
);
7572 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7573 return a pointer to the symbol name with any backslash quotes removed. */
7576 realsymbol (const char *pattern
)
7579 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7580 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7582 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7584 /* It is a glob pattern only if there is no preceding
7588 /* Remove the preceding backslash. */
7595 if (*p
== '?' || *p
== '*' || *p
== '[')
7602 backslash
= *p
== '\\';
7618 /* This is called for each variable name or match expression. NEW_NAME is
7619 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7620 pattern to be matched against symbol names. */
7622 struct bfd_elf_version_expr
*
7623 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7624 const char *new_name
,
7626 bfd_boolean literal_p
)
7628 struct bfd_elf_version_expr
*ret
;
7630 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7634 ret
->literal
= TRUE
;
7635 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7636 if (ret
->pattern
== NULL
)
7638 ret
->pattern
= new_name
;
7639 ret
->literal
= FALSE
;
7642 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7643 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7644 else if (strcasecmp (lang
, "C++") == 0)
7645 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7646 else if (strcasecmp (lang
, "Java") == 0)
7647 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7650 einfo (_("%X%P: unknown language `%s' in version information\n"),
7652 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7655 return ldemul_new_vers_pattern (ret
);
7658 /* This is called for each set of variable names and match
7661 struct bfd_elf_version_tree
*
7662 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7663 struct bfd_elf_version_expr
*locals
)
7665 struct bfd_elf_version_tree
*ret
;
7667 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7668 ret
->globals
.list
= globals
;
7669 ret
->locals
.list
= locals
;
7670 ret
->match
= lang_vers_match
;
7671 ret
->name_indx
= (unsigned int) -1;
7675 /* This static variable keeps track of version indices. */
7677 static int version_index
;
7680 version_expr_head_hash (const void *p
)
7682 const struct bfd_elf_version_expr
*e
=
7683 (const struct bfd_elf_version_expr
*) p
;
7685 return htab_hash_string (e
->pattern
);
7689 version_expr_head_eq (const void *p1
, const void *p2
)
7691 const struct bfd_elf_version_expr
*e1
=
7692 (const struct bfd_elf_version_expr
*) p1
;
7693 const struct bfd_elf_version_expr
*e2
=
7694 (const struct bfd_elf_version_expr
*) p2
;
7696 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7700 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7703 struct bfd_elf_version_expr
*e
, *next
;
7704 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7706 for (e
= head
->list
; e
; e
= e
->next
)
7710 head
->mask
|= e
->mask
;
7715 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7716 version_expr_head_eq
, NULL
);
7717 list_loc
= &head
->list
;
7718 remaining_loc
= &head
->remaining
;
7719 for (e
= head
->list
; e
; e
= next
)
7725 remaining_loc
= &e
->next
;
7729 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7733 struct bfd_elf_version_expr
*e1
, *last
;
7735 e1
= (struct bfd_elf_version_expr
*) *loc
;
7739 if (e1
->mask
== e
->mask
)
7747 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7751 /* This is a duplicate. */
7752 /* FIXME: Memory leak. Sometimes pattern is not
7753 xmalloced alone, but in larger chunk of memory. */
7754 /* free (e->pattern); */
7759 e
->next
= last
->next
;
7767 list_loc
= &e
->next
;
7771 *remaining_loc
= NULL
;
7772 *list_loc
= head
->remaining
;
7775 head
->remaining
= head
->list
;
7778 /* This is called when we know the name and dependencies of the
7782 lang_register_vers_node (const char *name
,
7783 struct bfd_elf_version_tree
*version
,
7784 struct bfd_elf_version_deps
*deps
)
7786 struct bfd_elf_version_tree
*t
, **pp
;
7787 struct bfd_elf_version_expr
*e1
;
7792 if (link_info
.version_info
!= NULL
7793 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
7795 einfo (_("%X%P: anonymous version tag cannot be combined"
7796 " with other version tags\n"));
7801 /* Make sure this node has a unique name. */
7802 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7803 if (strcmp (t
->name
, name
) == 0)
7804 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7806 lang_finalize_version_expr_head (&version
->globals
);
7807 lang_finalize_version_expr_head (&version
->locals
);
7809 /* Check the global and local match names, and make sure there
7810 aren't any duplicates. */
7812 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7814 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7816 struct bfd_elf_version_expr
*e2
;
7818 if (t
->locals
.htab
&& e1
->literal
)
7820 e2
= (struct bfd_elf_version_expr
*)
7821 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7822 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7824 if (e1
->mask
== e2
->mask
)
7825 einfo (_("%X%P: duplicate expression `%s'"
7826 " in version information\n"), e1
->pattern
);
7830 else if (!e1
->literal
)
7831 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7832 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7833 && e1
->mask
== e2
->mask
)
7834 einfo (_("%X%P: duplicate expression `%s'"
7835 " in version information\n"), e1
->pattern
);
7839 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7841 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7843 struct bfd_elf_version_expr
*e2
;
7845 if (t
->globals
.htab
&& e1
->literal
)
7847 e2
= (struct bfd_elf_version_expr
*)
7848 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7849 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7851 if (e1
->mask
== e2
->mask
)
7852 einfo (_("%X%P: duplicate expression `%s'"
7853 " in version information\n"),
7858 else if (!e1
->literal
)
7859 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7860 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7861 && e1
->mask
== e2
->mask
)
7862 einfo (_("%X%P: duplicate expression `%s'"
7863 " in version information\n"), e1
->pattern
);
7867 version
->deps
= deps
;
7868 version
->name
= name
;
7869 if (name
[0] != '\0')
7872 version
->vernum
= version_index
;
7875 version
->vernum
= 0;
7877 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7882 /* This is called when we see a version dependency. */
7884 struct bfd_elf_version_deps
*
7885 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7887 struct bfd_elf_version_deps
*ret
;
7888 struct bfd_elf_version_tree
*t
;
7890 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7893 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7895 if (strcmp (t
->name
, name
) == 0)
7897 ret
->version_needed
= t
;
7902 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7904 ret
->version_needed
= NULL
;
7909 lang_do_version_exports_section (void)
7911 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7913 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7915 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7923 contents
= (char *) xmalloc (len
);
7924 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7925 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7928 while (p
< contents
+ len
)
7930 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7931 p
= strchr (p
, '\0') + 1;
7934 /* Do not free the contents, as we used them creating the regex. */
7936 /* Do not include this section in the link. */
7937 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7940 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7941 lang_register_vers_node (command_line
.version_exports_section
,
7942 lang_new_vers_node (greg
, lreg
), NULL
);
7946 lang_add_unique (const char *name
)
7948 struct unique_sections
*ent
;
7950 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7951 if (strcmp (ent
->name
, name
) == 0)
7954 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7955 ent
->name
= xstrdup (name
);
7956 ent
->next
= unique_section_list
;
7957 unique_section_list
= ent
;
7960 /* Append the list of dynamic symbols to the existing one. */
7963 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7965 if (link_info
.dynamic_list
)
7967 struct bfd_elf_version_expr
*tail
;
7968 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7970 tail
->next
= link_info
.dynamic_list
->head
.list
;
7971 link_info
.dynamic_list
->head
.list
= dynamic
;
7975 struct bfd_elf_dynamic_list
*d
;
7977 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
7978 d
->head
.list
= dynamic
;
7979 d
->match
= lang_vers_match
;
7980 link_info
.dynamic_list
= d
;
7984 /* Append the list of C++ typeinfo dynamic symbols to the existing
7988 lang_append_dynamic_list_cpp_typeinfo (void)
7990 const char * symbols
[] =
7992 "typeinfo name for*",
7995 struct bfd_elf_version_expr
*dynamic
= NULL
;
7998 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7999 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8002 lang_append_dynamic_list (dynamic
);
8005 /* Append the list of C++ operator new and delete dynamic symbols to the
8009 lang_append_dynamic_list_cpp_new (void)
8011 const char * symbols
[] =
8016 struct bfd_elf_version_expr
*dynamic
= NULL
;
8019 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8020 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8023 lang_append_dynamic_list (dynamic
);
8026 /* Scan a space and/or comma separated string of features. */
8029 lang_ld_feature (char *str
)
8037 while (*p
== ',' || ISSPACE (*p
))
8042 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8046 if (strcasecmp (p
, "SANE_EXPR") == 0)
8047 config
.sane_expr
= TRUE
;
8049 einfo (_("%X%P: unknown feature `%s'\n"), p
);