1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
4 Free Software Foundation, Inc.
6 This file is part of the GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
25 #include "libiberty.h"
26 #include "filenames.h"
27 #include "safe-ctype.h"
47 #endif /* ENABLE_PLUGINS */
50 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
53 /* Locals variables. */
54 static struct obstack stat_obstack
;
55 static struct obstack map_obstack
;
57 #define obstack_chunk_alloc xmalloc
58 #define obstack_chunk_free free
59 static const char *entry_symbol_default
= "start";
60 static bfd_boolean placed_commons
= FALSE
;
61 static bfd_boolean stripped_excluded_sections
= FALSE
;
62 static lang_output_section_statement_type
*default_common_section
;
63 static bfd_boolean map_option_f
;
64 static bfd_vma print_dot
;
65 static lang_input_statement_type
*first_file
;
66 static const char *current_target
;
67 static lang_statement_list_type statement_list
;
68 static struct bfd_hash_table lang_definedness_table
;
69 static lang_statement_list_type
*stat_save
[10];
70 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
71 static struct unique_sections
*unique_section_list
;
73 /* Forward declarations. */
74 static void exp_init_os (etree_type
*);
75 static void init_map_userdata (bfd
*, asection
*, void *);
76 static lang_input_statement_type
*lookup_name (const char *);
77 static struct bfd_hash_entry
*lang_definedness_newfunc
78 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
79 static void insert_undefined (const char *);
80 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
81 static void print_statement (lang_statement_union_type
*,
82 lang_output_section_statement_type
*);
83 static void print_statement_list (lang_statement_union_type
*,
84 lang_output_section_statement_type
*);
85 static void print_statements (void);
86 static void print_input_section (asection
*, bfd_boolean
);
87 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
88 static void lang_record_phdrs (void);
89 static void lang_do_version_exports_section (void);
90 static void lang_finalize_version_expr_head
91 (struct bfd_elf_version_expr_head
*);
93 /* Exported variables. */
94 const char *output_target
;
95 lang_output_section_statement_type
*abs_output_section
;
96 lang_statement_list_type lang_output_section_statement
;
97 lang_statement_list_type
*stat_ptr
= &statement_list
;
98 lang_statement_list_type file_chain
= { NULL
, NULL
};
99 lang_statement_list_type input_file_chain
;
100 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
101 const char *entry_section
= ".text";
102 struct lang_input_statement_flags input_flags
;
103 bfd_boolean entry_from_cmdline
;
104 bfd_boolean undef_from_cmdline
;
105 bfd_boolean lang_has_input_file
= FALSE
;
106 bfd_boolean had_output_filename
= FALSE
;
107 bfd_boolean lang_float_flag
= FALSE
;
108 bfd_boolean delete_output_file_on_failure
= FALSE
;
109 struct lang_phdr
*lang_phdr_list
;
110 struct lang_nocrossrefs
*nocrossref_list
;
112 /* Functions that traverse the linker script and might evaluate
113 DEFINED() need to increment this. */
114 int lang_statement_iteration
= 0;
116 etree_type
*base
; /* Relocation base - or null */
118 /* Return TRUE if the PATTERN argument is a wildcard pattern.
119 Although backslashes are treated specially if a pattern contains
120 wildcards, we do not consider the mere presence of a backslash to
121 be enough to cause the pattern to be treated as a wildcard.
122 That lets us handle DOS filenames more naturally. */
123 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
125 #define new_stat(x, y) \
126 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
128 #define outside_section_address(q) \
129 ((q)->output_offset + (q)->output_section->vma)
131 #define outside_symbol_address(q) \
132 ((q)->value + outside_section_address (q->section))
134 #define SECTION_NAME_MAP_LENGTH (16)
137 stat_alloc (size_t size
)
139 return obstack_alloc (&stat_obstack
, size
);
143 name_match (const char *pattern
, const char *name
)
145 if (wildcardp (pattern
))
146 return fnmatch (pattern
, name
, 0);
147 return strcmp (pattern
, name
);
150 /* If PATTERN is of the form archive:file, return a pointer to the
151 separator. If not, return NULL. */
154 archive_path (const char *pattern
)
158 if (link_info
.path_separator
== 0)
161 p
= strchr (pattern
, link_info
.path_separator
);
162 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
163 if (p
== NULL
|| link_info
.path_separator
!= ':')
166 /* Assume a match on the second char is part of drive specifier,
167 as in "c:\silly.dos". */
168 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
169 p
= strchr (p
+ 1, link_info
.path_separator
);
174 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
175 return whether F matches FILE_SPEC. */
178 input_statement_is_archive_path (const char *file_spec
, char *sep
,
179 lang_input_statement_type
*f
)
181 bfd_boolean match
= FALSE
;
184 || name_match (sep
+ 1, f
->filename
) == 0)
185 && ((sep
!= file_spec
)
186 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
190 if (sep
!= file_spec
)
192 const char *aname
= f
->the_bfd
->my_archive
->filename
;
194 match
= name_match (file_spec
, aname
) == 0;
195 *sep
= link_info
.path_separator
;
202 unique_section_p (const asection
*sec
,
203 const lang_output_section_statement_type
*os
)
205 struct unique_sections
*unam
;
208 if (link_info
.relocatable
209 && sec
->owner
!= NULL
210 && bfd_is_group_section (sec
->owner
, sec
))
212 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
215 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
216 if (name_match (unam
->name
, secnam
) == 0)
222 /* Generic traversal routines for finding matching sections. */
224 /* Try processing a section against a wildcard. This just calls
225 the callback unless the filename exclusion list is present
226 and excludes the file. It's hardly ever present so this
227 function is very fast. */
230 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
231 lang_input_statement_type
*file
,
233 struct wildcard_list
*sec
,
237 struct name_list
*list_tmp
;
239 /* Don't process sections from files which were excluded. */
240 for (list_tmp
= sec
->spec
.exclude_name_list
;
242 list_tmp
= list_tmp
->next
)
244 char *p
= archive_path (list_tmp
->name
);
248 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
252 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
255 /* FIXME: Perhaps remove the following at some stage? Matching
256 unadorned archives like this was never documented and has
257 been superceded by the archive:path syntax. */
258 else if (file
->the_bfd
!= NULL
259 && file
->the_bfd
->my_archive
!= NULL
260 && name_match (list_tmp
->name
,
261 file
->the_bfd
->my_archive
->filename
) == 0)
265 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
268 /* Lowest common denominator routine that can handle everything correctly,
272 walk_wild_section_general (lang_wild_statement_type
*ptr
,
273 lang_input_statement_type
*file
,
278 struct wildcard_list
*sec
;
280 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
282 sec
= ptr
->section_list
;
284 (*callback
) (ptr
, sec
, s
, ptr
->section_flag_list
, file
, data
);
288 bfd_boolean skip
= FALSE
;
290 if (sec
->spec
.name
!= NULL
)
292 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
294 skip
= name_match (sec
->spec
.name
, sname
) != 0;
298 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
305 /* Routines to find a single section given its name. If there's more
306 than one section with that name, we report that. */
310 asection
*found_section
;
311 bfd_boolean multiple_sections_found
;
312 } section_iterator_callback_data
;
315 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
317 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
319 if (d
->found_section
!= NULL
)
321 d
->multiple_sections_found
= TRUE
;
325 d
->found_section
= s
;
330 find_section (lang_input_statement_type
*file
,
331 struct wildcard_list
*sec
,
332 bfd_boolean
*multiple_sections_found
)
334 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
336 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
337 section_iterator_callback
, &cb_data
);
338 *multiple_sections_found
= cb_data
.multiple_sections_found
;
339 return cb_data
.found_section
;
342 /* Code for handling simple wildcards without going through fnmatch,
343 which can be expensive because of charset translations etc. */
345 /* A simple wild is a literal string followed by a single '*',
346 where the literal part is at least 4 characters long. */
349 is_simple_wild (const char *name
)
351 size_t len
= strcspn (name
, "*?[");
352 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
356 match_simple_wild (const char *pattern
, const char *name
)
358 /* The first four characters of the pattern are guaranteed valid
359 non-wildcard characters. So we can go faster. */
360 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
361 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
366 while (*pattern
!= '*')
367 if (*name
++ != *pattern
++)
373 /* Return the numerical value of the init_priority attribute from
374 section name NAME. */
377 get_init_priority (const char *name
)
380 unsigned long init_priority
;
382 /* GCC uses the following section names for the init_priority
383 attribute with numerical values 101 and 65535 inclusive. A
384 lower value means a higher priority.
386 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
387 decimal numerical value of the init_priority attribute.
388 The order of execution in .init_array is forward and
389 .fini_array is backward.
390 2: .ctors.NNNN/.ctors.NNNN: Where NNNN is 65535 minus the
391 decimal numerical value of the init_priority attribute.
392 The order of execution in .ctors is backward and .dtors
395 if (strncmp (name
, ".init_array.", 12) == 0
396 || strncmp (name
, ".fini_array.", 12) == 0)
398 init_priority
= strtoul (name
+ 12, &end
, 10);
399 return *end
? 0 : init_priority
;
401 else if (strncmp (name
, ".ctors.", 7) == 0
402 || strncmp (name
, ".dtors.", 7) == 0)
404 init_priority
= strtoul (name
+ 7, &end
, 10);
405 return *end
? 0 : 65535 - init_priority
;
411 /* Compare sections ASEC and BSEC according to SORT. */
414 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
417 unsigned long ainit_priority
, binit_priority
;
424 case by_init_priority
:
426 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
428 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
429 if (ainit_priority
== 0 || binit_priority
== 0)
431 ret
= ainit_priority
- binit_priority
;
437 case by_alignment_name
:
438 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
439 - bfd_section_alignment (asec
->owner
, asec
));
446 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
447 bfd_get_section_name (bsec
->owner
, bsec
));
450 case by_name_alignment
:
451 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
452 bfd_get_section_name (bsec
->owner
, bsec
));
458 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
459 - bfd_section_alignment (asec
->owner
, asec
));
466 /* Build a Binary Search Tree to sort sections, unlike insertion sort
467 used in wild_sort(). BST is considerably faster if the number of
468 of sections are large. */
470 static lang_section_bst_type
**
471 wild_sort_fast (lang_wild_statement_type
*wild
,
472 struct wildcard_list
*sec
,
473 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
476 lang_section_bst_type
**tree
;
479 if (!wild
->filenames_sorted
480 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
482 /* Append at the right end of tree. */
484 tree
= &((*tree
)->right
);
490 /* Find the correct node to append this section. */
491 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
492 tree
= &((*tree
)->left
);
494 tree
= &((*tree
)->right
);
500 /* Use wild_sort_fast to build a BST to sort sections. */
503 output_section_callback_fast (lang_wild_statement_type
*ptr
,
504 struct wildcard_list
*sec
,
506 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
507 lang_input_statement_type
*file
,
510 lang_section_bst_type
*node
;
511 lang_section_bst_type
**tree
;
512 lang_output_section_statement_type
*os
;
514 os
= (lang_output_section_statement_type
*) output
;
516 if (unique_section_p (section
, os
))
519 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
522 node
->section
= section
;
524 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
529 /* Convert a sorted sections' BST back to list form. */
532 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
533 lang_section_bst_type
*tree
,
537 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
539 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
540 (lang_output_section_statement_type
*) output
);
543 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
548 /* Specialized, optimized routines for handling different kinds of
552 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
553 lang_input_statement_type
*file
,
557 /* We can just do a hash lookup for the section with the right name.
558 But if that lookup discovers more than one section with the name
559 (should be rare), we fall back to the general algorithm because
560 we would otherwise have to sort the sections to make sure they
561 get processed in the bfd's order. */
562 bfd_boolean multiple_sections_found
;
563 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
564 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
566 if (multiple_sections_found
)
567 walk_wild_section_general (ptr
, file
, callback
, data
);
569 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
573 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
574 lang_input_statement_type
*file
,
579 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
581 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
583 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
584 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
587 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
592 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
593 lang_input_statement_type
*file
,
598 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
599 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
600 bfd_boolean multiple_sections_found
;
601 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
603 if (multiple_sections_found
)
605 walk_wild_section_general (ptr
, file
, callback
, data
);
609 /* Note that if the section was not found, s0 is NULL and
610 we'll simply never succeed the s == s0 test below. */
611 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
613 /* Recall that in this code path, a section cannot satisfy more
614 than one spec, so if s == s0 then it cannot match
617 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
620 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
621 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
624 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
631 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
632 lang_input_statement_type
*file
,
637 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
638 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
639 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
640 bfd_boolean multiple_sections_found
;
641 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
643 if (multiple_sections_found
)
645 walk_wild_section_general (ptr
, file
, callback
, data
);
649 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
652 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
655 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
656 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
659 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
662 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
664 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
672 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
673 lang_input_statement_type
*file
,
678 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
679 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
680 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
681 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
682 bfd_boolean multiple_sections_found
;
683 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
685 if (multiple_sections_found
)
687 walk_wild_section_general (ptr
, file
, callback
, data
);
691 s1
= find_section (file
, sec1
, &multiple_sections_found
);
692 if (multiple_sections_found
)
694 walk_wild_section_general (ptr
, file
, callback
, data
);
698 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
701 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
704 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
707 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
708 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
712 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
716 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
718 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
726 walk_wild_section (lang_wild_statement_type
*ptr
,
727 lang_input_statement_type
*file
,
731 if (file
->flags
.just_syms
)
734 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
737 /* Returns TRUE when name1 is a wildcard spec that might match
738 something name2 can match. We're conservative: we return FALSE
739 only if the prefixes of name1 and name2 are different up to the
740 first wildcard character. */
743 wild_spec_can_overlap (const char *name1
, const char *name2
)
745 size_t prefix1_len
= strcspn (name1
, "?*[");
746 size_t prefix2_len
= strcspn (name2
, "?*[");
747 size_t min_prefix_len
;
749 /* Note that if there is no wildcard character, then we treat the
750 terminating 0 as part of the prefix. Thus ".text" won't match
751 ".text." or ".text.*", for example. */
752 if (name1
[prefix1_len
] == '\0')
754 if (name2
[prefix2_len
] == '\0')
757 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
759 return memcmp (name1
, name2
, min_prefix_len
) == 0;
762 /* Select specialized code to handle various kinds of wildcard
766 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
769 int wild_name_count
= 0;
770 struct wildcard_list
*sec
;
774 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
775 ptr
->handler_data
[0] = NULL
;
776 ptr
->handler_data
[1] = NULL
;
777 ptr
->handler_data
[2] = NULL
;
778 ptr
->handler_data
[3] = NULL
;
781 /* Count how many wildcard_specs there are, and how many of those
782 actually use wildcards in the name. Also, bail out if any of the
783 wildcard names are NULL. (Can this actually happen?
784 walk_wild_section used to test for it.) And bail out if any
785 of the wildcards are more complex than a simple string
786 ending in a single '*'. */
787 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
790 if (sec
->spec
.name
== NULL
)
792 if (wildcardp (sec
->spec
.name
))
795 if (!is_simple_wild (sec
->spec
.name
))
800 /* The zero-spec case would be easy to optimize but it doesn't
801 happen in practice. Likewise, more than 4 specs doesn't
802 happen in practice. */
803 if (sec_count
== 0 || sec_count
> 4)
806 /* Check that no two specs can match the same section. */
807 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
809 struct wildcard_list
*sec2
;
810 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
812 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
817 signature
= (sec_count
<< 8) + wild_name_count
;
821 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
824 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
827 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
830 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
833 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
839 /* Now fill the data array with pointers to the specs, first the
840 specs with non-wildcard names, then the specs with wildcard
841 names. It's OK to process the specs in different order from the
842 given order, because we've already determined that no section
843 will match more than one spec. */
845 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
846 if (!wildcardp (sec
->spec
.name
))
847 ptr
->handler_data
[data_counter
++] = sec
;
848 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
849 if (wildcardp (sec
->spec
.name
))
850 ptr
->handler_data
[data_counter
++] = sec
;
853 /* Handle a wild statement for a single file F. */
856 walk_wild_file (lang_wild_statement_type
*s
,
857 lang_input_statement_type
*f
,
861 if (f
->the_bfd
== NULL
862 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
863 walk_wild_section (s
, f
, callback
, data
);
868 /* This is an archive file. We must map each member of the
869 archive separately. */
870 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
871 while (member
!= NULL
)
873 /* When lookup_name is called, it will call the add_symbols
874 entry point for the archive. For each element of the
875 archive which is included, BFD will call ldlang_add_file,
876 which will set the usrdata field of the member to the
877 lang_input_statement. */
878 if (member
->usrdata
!= NULL
)
880 walk_wild_section (s
,
881 (lang_input_statement_type
*) member
->usrdata
,
885 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
891 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
893 const char *file_spec
= s
->filename
;
896 if (file_spec
== NULL
)
898 /* Perform the iteration over all files in the list. */
899 LANG_FOR_EACH_INPUT_STATEMENT (f
)
901 walk_wild_file (s
, f
, callback
, data
);
904 else if ((p
= archive_path (file_spec
)) != NULL
)
906 LANG_FOR_EACH_INPUT_STATEMENT (f
)
908 if (input_statement_is_archive_path (file_spec
, p
, f
))
909 walk_wild_file (s
, f
, callback
, data
);
912 else if (wildcardp (file_spec
))
914 LANG_FOR_EACH_INPUT_STATEMENT (f
)
916 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
917 walk_wild_file (s
, f
, callback
, data
);
922 lang_input_statement_type
*f
;
924 /* Perform the iteration over a single file. */
925 f
= lookup_name (file_spec
);
927 walk_wild_file (s
, f
, callback
, data
);
931 /* lang_for_each_statement walks the parse tree and calls the provided
932 function for each node, except those inside output section statements
933 with constraint set to -1. */
936 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
937 lang_statement_union_type
*s
)
939 for (; s
!= NULL
; s
= s
->header
.next
)
943 switch (s
->header
.type
)
945 case lang_constructors_statement_enum
:
946 lang_for_each_statement_worker (func
, constructor_list
.head
);
948 case lang_output_section_statement_enum
:
949 if (s
->output_section_statement
.constraint
!= -1)
950 lang_for_each_statement_worker
951 (func
, s
->output_section_statement
.children
.head
);
953 case lang_wild_statement_enum
:
954 lang_for_each_statement_worker (func
,
955 s
->wild_statement
.children
.head
);
957 case lang_group_statement_enum
:
958 lang_for_each_statement_worker (func
,
959 s
->group_statement
.children
.head
);
961 case lang_data_statement_enum
:
962 case lang_reloc_statement_enum
:
963 case lang_object_symbols_statement_enum
:
964 case lang_output_statement_enum
:
965 case lang_target_statement_enum
:
966 case lang_input_section_enum
:
967 case lang_input_statement_enum
:
968 case lang_assignment_statement_enum
:
969 case lang_padding_statement_enum
:
970 case lang_address_statement_enum
:
971 case lang_fill_statement_enum
:
972 case lang_insert_statement_enum
:
982 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
984 lang_for_each_statement_worker (func
, statement_list
.head
);
987 /*----------------------------------------------------------------------*/
990 lang_list_init (lang_statement_list_type
*list
)
993 list
->tail
= &list
->head
;
997 push_stat_ptr (lang_statement_list_type
*new_ptr
)
999 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1001 *stat_save_ptr
++ = stat_ptr
;
1008 if (stat_save_ptr
<= stat_save
)
1010 stat_ptr
= *--stat_save_ptr
;
1013 /* Build a new statement node for the parse tree. */
1015 static lang_statement_union_type
*
1016 new_statement (enum statement_enum type
,
1018 lang_statement_list_type
*list
)
1020 lang_statement_union_type
*new_stmt
;
1022 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1023 new_stmt
->header
.type
= type
;
1024 new_stmt
->header
.next
= NULL
;
1025 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1029 /* Build a new input file node for the language. There are several
1030 ways in which we treat an input file, eg, we only look at symbols,
1031 or prefix it with a -l etc.
1033 We can be supplied with requests for input files more than once;
1034 they may, for example be split over several lines like foo.o(.text)
1035 foo.o(.data) etc, so when asked for a file we check that we haven't
1036 got it already so we don't duplicate the bfd. */
1038 static lang_input_statement_type
*
1039 new_afile (const char *name
,
1040 lang_input_file_enum_type file_type
,
1042 bfd_boolean add_to_list
)
1044 lang_input_statement_type
*p
;
1046 lang_has_input_file
= TRUE
;
1049 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1052 p
= (lang_input_statement_type
*)
1053 stat_alloc (sizeof (lang_input_statement_type
));
1054 p
->header
.type
= lang_input_statement_enum
;
1055 p
->header
.next
= NULL
;
1058 memset (&p
->the_bfd
, 0,
1059 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1061 p
->flags
.dynamic
= input_flags
.dynamic
;
1062 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1063 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1064 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1065 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1067 if (file_type
== lang_input_file_is_l_enum
1068 && name
[0] == ':' && name
[1] != '\0')
1070 file_type
= lang_input_file_is_search_file_enum
;
1076 case lang_input_file_is_symbols_only_enum
:
1078 p
->local_sym_name
= name
;
1079 p
->flags
.real
= TRUE
;
1080 p
->flags
.just_syms
= TRUE
;
1082 case lang_input_file_is_fake_enum
:
1084 p
->local_sym_name
= name
;
1086 case lang_input_file_is_l_enum
:
1088 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1089 p
->flags
.maybe_archive
= TRUE
;
1090 p
->flags
.real
= TRUE
;
1091 p
->flags
.search_dirs
= TRUE
;
1093 case lang_input_file_is_marker_enum
:
1095 p
->local_sym_name
= name
;
1096 p
->flags
.search_dirs
= TRUE
;
1098 case lang_input_file_is_search_file_enum
:
1100 p
->local_sym_name
= name
;
1101 p
->flags
.real
= TRUE
;
1102 p
->flags
.search_dirs
= TRUE
;
1104 case lang_input_file_is_file_enum
:
1106 p
->local_sym_name
= name
;
1107 p
->flags
.real
= TRUE
;
1113 lang_statement_append (&input_file_chain
,
1114 (lang_statement_union_type
*) p
,
1115 &p
->next_real_file
);
1119 lang_input_statement_type
*
1120 lang_add_input_file (const char *name
,
1121 lang_input_file_enum_type file_type
,
1124 return new_afile (name
, file_type
, target
, TRUE
);
1127 struct out_section_hash_entry
1129 struct bfd_hash_entry root
;
1130 lang_statement_union_type s
;
1133 /* The hash table. */
1135 static struct bfd_hash_table output_section_statement_table
;
1137 /* Support routines for the hash table used by lang_output_section_find,
1138 initialize the table, fill in an entry and remove the table. */
1140 static struct bfd_hash_entry
*
1141 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1142 struct bfd_hash_table
*table
,
1145 lang_output_section_statement_type
**nextp
;
1146 struct out_section_hash_entry
*ret
;
1150 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1156 entry
= bfd_hash_newfunc (entry
, table
, string
);
1160 ret
= (struct out_section_hash_entry
*) entry
;
1161 memset (&ret
->s
, 0, sizeof (ret
->s
));
1162 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1163 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1164 ret
->s
.output_section_statement
.section_alignment
= -1;
1165 ret
->s
.output_section_statement
.block_value
= 1;
1166 lang_list_init (&ret
->s
.output_section_statement
.children
);
1167 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1169 /* For every output section statement added to the list, except the
1170 first one, lang_output_section_statement.tail points to the "next"
1171 field of the last element of the list. */
1172 if (lang_output_section_statement
.head
!= NULL
)
1173 ret
->s
.output_section_statement
.prev
1174 = ((lang_output_section_statement_type
*)
1175 ((char *) lang_output_section_statement
.tail
1176 - offsetof (lang_output_section_statement_type
, next
)));
1178 /* GCC's strict aliasing rules prevent us from just casting the
1179 address, so we store the pointer in a variable and cast that
1181 nextp
= &ret
->s
.output_section_statement
.next
;
1182 lang_statement_append (&lang_output_section_statement
,
1184 (lang_statement_union_type
**) nextp
);
1189 output_section_statement_table_init (void)
1191 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1192 output_section_statement_newfunc
,
1193 sizeof (struct out_section_hash_entry
),
1195 einfo (_("%P%F: can not create hash table: %E\n"));
1199 output_section_statement_table_free (void)
1201 bfd_hash_table_free (&output_section_statement_table
);
1204 /* Build enough state so that the parser can build its tree. */
1209 obstack_begin (&stat_obstack
, 1000);
1211 stat_ptr
= &statement_list
;
1213 output_section_statement_table_init ();
1215 lang_list_init (stat_ptr
);
1217 lang_list_init (&input_file_chain
);
1218 lang_list_init (&lang_output_section_statement
);
1219 lang_list_init (&file_chain
);
1220 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1222 abs_output_section
=
1223 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1225 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1227 /* The value "3" is ad-hoc, somewhat related to the expected number of
1228 DEFINED expressions in a linker script. For most default linker
1229 scripts, there are none. Why a hash table then? Well, it's somewhat
1230 simpler to re-use working machinery than using a linked list in terms
1231 of code-complexity here in ld, besides the initialization which just
1232 looks like other code here. */
1233 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1234 lang_definedness_newfunc
,
1235 sizeof (struct lang_definedness_hash_entry
),
1237 einfo (_("%P%F: can not create hash table: %E\n"));
1243 output_section_statement_table_free ();
1246 /*----------------------------------------------------------------------
1247 A region is an area of memory declared with the
1248 MEMORY { name:org=exp, len=exp ... }
1251 We maintain a list of all the regions here.
1253 If no regions are specified in the script, then the default is used
1254 which is created when looked up to be the entire data space.
1256 If create is true we are creating a region inside a MEMORY block.
1257 In this case it is probably an error to create a region that has
1258 already been created. If we are not inside a MEMORY block it is
1259 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1260 and so we issue a warning.
1262 Each region has at least one name. The first name is either
1263 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1264 alias names to an existing region within a script with
1265 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1268 static lang_memory_region_type
*lang_memory_region_list
;
1269 static lang_memory_region_type
**lang_memory_region_list_tail
1270 = &lang_memory_region_list
;
1272 lang_memory_region_type
*
1273 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1275 lang_memory_region_name
*n
;
1276 lang_memory_region_type
*r
;
1277 lang_memory_region_type
*new_region
;
1279 /* NAME is NULL for LMA memspecs if no region was specified. */
1283 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1284 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1285 if (strcmp (n
->name
, name
) == 0)
1288 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1293 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1294 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1297 new_region
= (lang_memory_region_type
*)
1298 stat_alloc (sizeof (lang_memory_region_type
));
1300 new_region
->name_list
.name
= xstrdup (name
);
1301 new_region
->name_list
.next
= NULL
;
1302 new_region
->next
= NULL
;
1303 new_region
->origin
= 0;
1304 new_region
->length
= ~(bfd_size_type
) 0;
1305 new_region
->current
= 0;
1306 new_region
->last_os
= NULL
;
1307 new_region
->flags
= 0;
1308 new_region
->not_flags
= 0;
1309 new_region
->had_full_message
= FALSE
;
1311 *lang_memory_region_list_tail
= new_region
;
1312 lang_memory_region_list_tail
= &new_region
->next
;
1318 lang_memory_region_alias (const char * alias
, const char * region_name
)
1320 lang_memory_region_name
* n
;
1321 lang_memory_region_type
* r
;
1322 lang_memory_region_type
* region
;
1324 /* The default region must be unique. This ensures that it is not necessary
1325 to iterate through the name list if someone wants the check if a region is
1326 the default memory region. */
1327 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1328 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1329 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL
);
1331 /* Look for the target region and check if the alias is not already
1334 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1335 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1337 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1339 if (strcmp (n
->name
, alias
) == 0)
1340 einfo (_("%F%P:%S: error: redefinition of memory region "
1345 /* Check if the target region exists. */
1347 einfo (_("%F%P:%S: error: memory region `%s' "
1348 "for alias `%s' does not exist\n"),
1349 NULL
, region_name
, alias
);
1351 /* Add alias to region name list. */
1352 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1353 n
->name
= xstrdup (alias
);
1354 n
->next
= region
->name_list
.next
;
1355 region
->name_list
.next
= n
;
1358 static lang_memory_region_type
*
1359 lang_memory_default (asection
* section
)
1361 lang_memory_region_type
*p
;
1363 flagword sec_flags
= section
->flags
;
1365 /* Override SEC_DATA to mean a writable section. */
1366 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1367 sec_flags
|= SEC_DATA
;
1369 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1371 if ((p
->flags
& sec_flags
) != 0
1372 && (p
->not_flags
& sec_flags
) == 0)
1377 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1380 /* Find or create an output_section_statement with the given NAME.
1381 If CONSTRAINT is non-zero match one with that constraint, otherwise
1382 match any non-negative constraint. If CREATE, always make a
1383 new output_section_statement for SPECIAL CONSTRAINT. */
1385 lang_output_section_statement_type
*
1386 lang_output_section_statement_lookup (const char *name
,
1390 struct out_section_hash_entry
*entry
;
1392 entry
= ((struct out_section_hash_entry
*)
1393 bfd_hash_lookup (&output_section_statement_table
, name
,
1398 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1402 if (entry
->s
.output_section_statement
.name
!= NULL
)
1404 /* We have a section of this name, but it might not have the correct
1406 struct out_section_hash_entry
*last_ent
;
1408 name
= entry
->s
.output_section_statement
.name
;
1409 if (create
&& constraint
== SPECIAL
)
1410 /* Not traversing to the end reverses the order of the second
1411 and subsequent SPECIAL sections in the hash table chain,
1412 but that shouldn't matter. */
1417 if (constraint
== entry
->s
.output_section_statement
.constraint
1419 && entry
->s
.output_section_statement
.constraint
>= 0))
1420 return &entry
->s
.output_section_statement
;
1422 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1424 while (entry
!= NULL
1425 && name
== entry
->s
.output_section_statement
.name
);
1431 = ((struct out_section_hash_entry
*)
1432 output_section_statement_newfunc (NULL
,
1433 &output_section_statement_table
,
1437 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1440 entry
->root
= last_ent
->root
;
1441 last_ent
->root
.next
= &entry
->root
;
1444 entry
->s
.output_section_statement
.name
= name
;
1445 entry
->s
.output_section_statement
.constraint
= constraint
;
1446 return &entry
->s
.output_section_statement
;
1449 /* Find the next output_section_statement with the same name as OS.
1450 If CONSTRAINT is non-zero, find one with that constraint otherwise
1451 match any non-negative constraint. */
1453 lang_output_section_statement_type
*
1454 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1457 /* All output_section_statements are actually part of a
1458 struct out_section_hash_entry. */
1459 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1461 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1462 const char *name
= os
->name
;
1464 ASSERT (name
== entry
->root
.string
);
1467 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1469 || name
!= entry
->s
.output_section_statement
.name
)
1472 while (constraint
!= entry
->s
.output_section_statement
.constraint
1474 || entry
->s
.output_section_statement
.constraint
< 0));
1476 return &entry
->s
.output_section_statement
;
1479 /* A variant of lang_output_section_find used by place_orphan.
1480 Returns the output statement that should precede a new output
1481 statement for SEC. If an exact match is found on certain flags,
1484 lang_output_section_statement_type
*
1485 lang_output_section_find_by_flags (const asection
*sec
,
1486 lang_output_section_statement_type
**exact
,
1487 lang_match_sec_type_func match_type
)
1489 lang_output_section_statement_type
*first
, *look
, *found
;
1492 /* We know the first statement on this list is *ABS*. May as well
1494 first
= &lang_output_section_statement
.head
->output_section_statement
;
1495 first
= first
->next
;
1497 /* First try for an exact match. */
1499 for (look
= first
; look
; look
= look
->next
)
1501 flags
= look
->flags
;
1502 if (look
->bfd_section
!= NULL
)
1504 flags
= look
->bfd_section
->flags
;
1505 if (match_type
&& !match_type (link_info
.output_bfd
,
1510 flags
^= sec
->flags
;
1511 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1512 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1522 if ((sec
->flags
& SEC_CODE
) != 0
1523 && (sec
->flags
& SEC_ALLOC
) != 0)
1525 /* Try for a rw code section. */
1526 for (look
= first
; look
; look
= look
->next
)
1528 flags
= look
->flags
;
1529 if (look
->bfd_section
!= NULL
)
1531 flags
= look
->bfd_section
->flags
;
1532 if (match_type
&& !match_type (link_info
.output_bfd
,
1537 flags
^= sec
->flags
;
1538 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1539 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1543 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1544 && (sec
->flags
& SEC_ALLOC
) != 0)
1546 /* .rodata can go after .text, .sdata2 after .rodata. */
1547 for (look
= first
; look
; look
= look
->next
)
1549 flags
= look
->flags
;
1550 if (look
->bfd_section
!= NULL
)
1552 flags
= look
->bfd_section
->flags
;
1553 if (match_type
&& !match_type (link_info
.output_bfd
,
1558 flags
^= sec
->flags
;
1559 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1560 | SEC_READONLY
| SEC_SMALL_DATA
))
1561 || (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1563 && !(look
->flags
& SEC_SMALL_DATA
))
1564 || (!(flags
& (SEC_THREAD_LOCAL
| SEC_ALLOC
))
1565 && (look
->flags
& SEC_THREAD_LOCAL
)
1566 && (!(flags
& SEC_LOAD
)
1567 || (look
->flags
& SEC_LOAD
))))
1571 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1572 && (sec
->flags
& SEC_ALLOC
) != 0)
1574 /* .sdata goes after .data, .sbss after .sdata. */
1575 for (look
= first
; look
; look
= look
->next
)
1577 flags
= look
->flags
;
1578 if (look
->bfd_section
!= NULL
)
1580 flags
= look
->bfd_section
->flags
;
1581 if (match_type
&& !match_type (link_info
.output_bfd
,
1586 flags
^= sec
->flags
;
1587 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1588 | SEC_THREAD_LOCAL
))
1589 || ((look
->flags
& SEC_SMALL_DATA
)
1590 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1594 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1595 && (sec
->flags
& SEC_ALLOC
) != 0)
1597 /* .data goes after .rodata. */
1598 for (look
= first
; look
; look
= look
->next
)
1600 flags
= look
->flags
;
1601 if (look
->bfd_section
!= NULL
)
1603 flags
= look
->bfd_section
->flags
;
1604 if (match_type
&& !match_type (link_info
.output_bfd
,
1609 flags
^= sec
->flags
;
1610 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1611 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1615 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1617 /* .bss goes after any other alloc section. */
1618 for (look
= first
; look
; look
= look
->next
)
1620 flags
= look
->flags
;
1621 if (look
->bfd_section
!= NULL
)
1623 flags
= look
->bfd_section
->flags
;
1624 if (match_type
&& !match_type (link_info
.output_bfd
,
1629 flags
^= sec
->flags
;
1630 if (!(flags
& SEC_ALLOC
))
1636 /* non-alloc go last. */
1637 for (look
= first
; look
; look
= look
->next
)
1639 flags
= look
->flags
;
1640 if (look
->bfd_section
!= NULL
)
1641 flags
= look
->bfd_section
->flags
;
1642 flags
^= sec
->flags
;
1643 if (!(flags
& SEC_DEBUGGING
))
1649 if (found
|| !match_type
)
1652 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1655 /* Find the last output section before given output statement.
1656 Used by place_orphan. */
1659 output_prev_sec_find (lang_output_section_statement_type
*os
)
1661 lang_output_section_statement_type
*lookup
;
1663 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1665 if (lookup
->constraint
< 0)
1668 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1669 return lookup
->bfd_section
;
1675 /* Look for a suitable place for a new output section statement. The
1676 idea is to skip over anything that might be inside a SECTIONS {}
1677 statement in a script, before we find another output section
1678 statement. Assignments to "dot" before an output section statement
1679 are assumed to belong to it, except in two cases; The first
1680 assignment to dot, and assignments before non-alloc sections.
1681 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1682 similar assignments that set the initial address, or we might
1683 insert non-alloc note sections among assignments setting end of
1686 static lang_statement_union_type
**
1687 insert_os_after (lang_output_section_statement_type
*after
)
1689 lang_statement_union_type
**where
;
1690 lang_statement_union_type
**assign
= NULL
;
1691 bfd_boolean ignore_first
;
1694 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1696 for (where
= &after
->header
.next
;
1698 where
= &(*where
)->header
.next
)
1700 switch ((*where
)->header
.type
)
1702 case lang_assignment_statement_enum
:
1705 lang_assignment_statement_type
*ass
;
1707 ass
= &(*where
)->assignment_statement
;
1708 if (ass
->exp
->type
.node_class
!= etree_assert
1709 && ass
->exp
->assign
.dst
[0] == '.'
1710 && ass
->exp
->assign
.dst
[1] == 0
1714 ignore_first
= FALSE
;
1716 case lang_wild_statement_enum
:
1717 case lang_input_section_enum
:
1718 case lang_object_symbols_statement_enum
:
1719 case lang_fill_statement_enum
:
1720 case lang_data_statement_enum
:
1721 case lang_reloc_statement_enum
:
1722 case lang_padding_statement_enum
:
1723 case lang_constructors_statement_enum
:
1726 case lang_output_section_statement_enum
:
1729 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1732 || s
->map_head
.s
== NULL
1733 || (s
->flags
& SEC_ALLOC
) != 0)
1737 case lang_input_statement_enum
:
1738 case lang_address_statement_enum
:
1739 case lang_target_statement_enum
:
1740 case lang_output_statement_enum
:
1741 case lang_group_statement_enum
:
1742 case lang_insert_statement_enum
:
1751 lang_output_section_statement_type
*
1752 lang_insert_orphan (asection
*s
,
1753 const char *secname
,
1755 lang_output_section_statement_type
*after
,
1756 struct orphan_save
*place
,
1757 etree_type
*address
,
1758 lang_statement_list_type
*add_child
)
1760 lang_statement_list_type add
;
1762 lang_output_section_statement_type
*os
;
1763 lang_output_section_statement_type
**os_tail
;
1765 /* If we have found an appropriate place for the output section
1766 statements for this orphan, add them to our own private list,
1767 inserting them later into the global statement list. */
1770 lang_list_init (&add
);
1771 push_stat_ptr (&add
);
1774 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1775 address
= exp_intop (0);
1777 os_tail
= ((lang_output_section_statement_type
**)
1778 lang_output_section_statement
.tail
);
1779 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1780 NULL
, NULL
, NULL
, constraint
);
1783 if (config
.build_constructors
&& *os_tail
== os
)
1785 /* If the name of the section is representable in C, then create
1786 symbols to mark the start and the end of the section. */
1787 for (ps
= secname
; *ps
!= '\0'; ps
++)
1788 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1794 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1795 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1796 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1797 lang_add_assignment (exp_provide (symname
,
1798 exp_nameop (NAME
, "."),
1803 if (add_child
== NULL
)
1804 add_child
= &os
->children
;
1805 lang_add_section (add_child
, s
, NULL
, os
);
1807 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1809 const char *region
= (after
->region
1810 ? after
->region
->name_list
.name
1811 : DEFAULT_MEMORY_REGION
);
1812 const char *lma_region
= (after
->lma_region
1813 ? after
->lma_region
->name_list
.name
1815 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1819 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1822 if (ps
!= NULL
&& *ps
== '\0')
1826 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1827 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1828 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1829 lang_add_assignment (exp_provide (symname
,
1830 exp_nameop (NAME
, "."),
1834 /* Restore the global list pointer. */
1838 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1840 asection
*snew
, *as
;
1842 snew
= os
->bfd_section
;
1844 /* Shuffle the bfd section list to make the output file look
1845 neater. This is really only cosmetic. */
1846 if (place
->section
== NULL
1847 && after
!= (&lang_output_section_statement
.head
1848 ->output_section_statement
))
1850 asection
*bfd_section
= after
->bfd_section
;
1852 /* If the output statement hasn't been used to place any input
1853 sections (and thus doesn't have an output bfd_section),
1854 look for the closest prior output statement having an
1856 if (bfd_section
== NULL
)
1857 bfd_section
= output_prev_sec_find (after
);
1859 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1860 place
->section
= &bfd_section
->next
;
1863 if (place
->section
== NULL
)
1864 place
->section
= &link_info
.output_bfd
->sections
;
1866 as
= *place
->section
;
1870 /* Put the section at the end of the list. */
1872 /* Unlink the section. */
1873 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1875 /* Now tack it back on in the right place. */
1876 bfd_section_list_append (link_info
.output_bfd
, snew
);
1878 else if (as
!= snew
&& as
->prev
!= snew
)
1880 /* Unlink the section. */
1881 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1883 /* Now tack it back on in the right place. */
1884 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1887 /* Save the end of this list. Further ophans of this type will
1888 follow the one we've just added. */
1889 place
->section
= &snew
->next
;
1891 /* The following is non-cosmetic. We try to put the output
1892 statements in some sort of reasonable order here, because they
1893 determine the final load addresses of the orphan sections.
1894 In addition, placing output statements in the wrong order may
1895 require extra segments. For instance, given a typical
1896 situation of all read-only sections placed in one segment and
1897 following that a segment containing all the read-write
1898 sections, we wouldn't want to place an orphan read/write
1899 section before or amongst the read-only ones. */
1900 if (add
.head
!= NULL
)
1902 lang_output_section_statement_type
*newly_added_os
;
1904 if (place
->stmt
== NULL
)
1906 lang_statement_union_type
**where
= insert_os_after (after
);
1911 place
->os_tail
= &after
->next
;
1915 /* Put it after the last orphan statement we added. */
1916 *add
.tail
= *place
->stmt
;
1917 *place
->stmt
= add
.head
;
1920 /* Fix the global list pointer if we happened to tack our
1921 new list at the tail. */
1922 if (*stat_ptr
->tail
== add
.head
)
1923 stat_ptr
->tail
= add
.tail
;
1925 /* Save the end of this list. */
1926 place
->stmt
= add
.tail
;
1928 /* Do the same for the list of output section statements. */
1929 newly_added_os
= *os_tail
;
1931 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1932 ((char *) place
->os_tail
1933 - offsetof (lang_output_section_statement_type
, next
));
1934 newly_added_os
->next
= *place
->os_tail
;
1935 if (newly_added_os
->next
!= NULL
)
1936 newly_added_os
->next
->prev
= newly_added_os
;
1937 *place
->os_tail
= newly_added_os
;
1938 place
->os_tail
= &newly_added_os
->next
;
1940 /* Fixing the global list pointer here is a little different.
1941 We added to the list in lang_enter_output_section_statement,
1942 trimmed off the new output_section_statment above when
1943 assigning *os_tail = NULL, but possibly added it back in
1944 the same place when assigning *place->os_tail. */
1945 if (*os_tail
== NULL
)
1946 lang_output_section_statement
.tail
1947 = (lang_statement_union_type
**) os_tail
;
1954 lang_map_flags (flagword flag
)
1956 if (flag
& SEC_ALLOC
)
1959 if (flag
& SEC_CODE
)
1962 if (flag
& SEC_READONLY
)
1965 if (flag
& SEC_DATA
)
1968 if (flag
& SEC_LOAD
)
1975 lang_memory_region_type
*m
;
1976 bfd_boolean dis_header_printed
= FALSE
;
1979 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1983 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1984 || file
->flags
.just_syms
)
1987 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1988 if ((s
->output_section
== NULL
1989 || s
->output_section
->owner
!= link_info
.output_bfd
)
1990 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1992 if (! dis_header_printed
)
1994 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1995 dis_header_printed
= TRUE
;
1998 print_input_section (s
, TRUE
);
2002 minfo (_("\nMemory Configuration\n\n"));
2003 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2004 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2006 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2011 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2013 sprintf_vma (buf
, m
->origin
);
2014 minfo ("0x%s ", buf
);
2022 minfo ("0x%V", m
->length
);
2023 if (m
->flags
|| m
->not_flags
)
2031 lang_map_flags (m
->flags
);
2037 lang_map_flags (m
->not_flags
);
2044 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2046 if (! link_info
.reduce_memory_overheads
)
2048 obstack_begin (&map_obstack
, 1000);
2049 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
2050 bfd_map_over_sections (p
, init_map_userdata
, 0);
2051 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2053 lang_statement_iteration
++;
2054 print_statements ();
2058 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
2060 void *data ATTRIBUTE_UNUSED
)
2062 fat_section_userdata_type
*new_data
2063 = ((fat_section_userdata_type
*) (stat_alloc
2064 (sizeof (fat_section_userdata_type
))));
2066 ASSERT (get_userdata (sec
) == NULL
);
2067 get_userdata (sec
) = new_data
;
2068 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
2069 new_data
->map_symbol_def_count
= 0;
2073 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2074 void *info ATTRIBUTE_UNUSED
)
2076 if (hash_entry
->type
== bfd_link_hash_defined
2077 || hash_entry
->type
== bfd_link_hash_defweak
)
2079 struct fat_user_section_struct
*ud
;
2080 struct map_symbol_def
*def
;
2082 ud
= (struct fat_user_section_struct
*)
2083 get_userdata (hash_entry
->u
.def
.section
);
2086 /* ??? What do we have to do to initialize this beforehand? */
2087 /* The first time we get here is bfd_abs_section... */
2088 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
2089 ud
= (struct fat_user_section_struct
*)
2090 get_userdata (hash_entry
->u
.def
.section
);
2092 else if (!ud
->map_symbol_def_tail
)
2093 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2095 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2096 def
->entry
= hash_entry
;
2097 *(ud
->map_symbol_def_tail
) = def
;
2098 ud
->map_symbol_def_tail
= &def
->next
;
2099 ud
->map_symbol_def_count
++;
2104 /* Initialize an output section. */
2107 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2109 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2110 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2112 if (s
->constraint
!= SPECIAL
)
2113 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2114 if (s
->bfd_section
== NULL
)
2115 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2117 if (s
->bfd_section
== NULL
)
2119 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2120 link_info
.output_bfd
->xvec
->name
, s
->name
);
2122 s
->bfd_section
->output_section
= s
->bfd_section
;
2123 s
->bfd_section
->output_offset
= 0;
2125 if (!link_info
.reduce_memory_overheads
)
2127 fat_section_userdata_type
*new_userdata
= (fat_section_userdata_type
*)
2128 stat_alloc (sizeof (fat_section_userdata_type
));
2129 memset (new_userdata
, 0, sizeof (fat_section_userdata_type
));
2130 get_userdata (s
->bfd_section
) = new_userdata
;
2133 /* If there is a base address, make sure that any sections it might
2134 mention are initialized. */
2135 if (s
->addr_tree
!= NULL
)
2136 exp_init_os (s
->addr_tree
);
2138 if (s
->load_base
!= NULL
)
2139 exp_init_os (s
->load_base
);
2141 /* If supplied an alignment, set it. */
2142 if (s
->section_alignment
!= -1)
2143 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2146 /* Make sure that all output sections mentioned in an expression are
2150 exp_init_os (etree_type
*exp
)
2152 switch (exp
->type
.node_class
)
2156 exp_init_os (exp
->assign
.src
);
2160 exp_init_os (exp
->binary
.lhs
);
2161 exp_init_os (exp
->binary
.rhs
);
2165 exp_init_os (exp
->trinary
.cond
);
2166 exp_init_os (exp
->trinary
.lhs
);
2167 exp_init_os (exp
->trinary
.rhs
);
2171 exp_init_os (exp
->assert_s
.child
);
2175 exp_init_os (exp
->unary
.child
);
2179 switch (exp
->type
.node_code
)
2185 lang_output_section_statement_type
*os
;
2187 os
= lang_output_section_find (exp
->name
.name
);
2188 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2200 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2202 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2204 /* If we are only reading symbols from this object, then we want to
2205 discard all sections. */
2206 if (entry
->flags
.just_syms
)
2208 bfd_link_just_syms (abfd
, sec
, &link_info
);
2212 if (!(abfd
->flags
& DYNAMIC
))
2213 bfd_section_already_linked (abfd
, sec
, &link_info
);
2216 /* The wild routines.
2218 These expand statements like *(.text) and foo.o to a list of
2219 explicit actions, like foo.o(.text), bar.o(.text) and
2220 foo.o(.text, .data). */
2222 /* Add SECTION to the output section OUTPUT. Do this by creating a
2223 lang_input_section statement which is placed at PTR. */
2226 lang_add_section (lang_statement_list_type
*ptr
,
2228 struct flag_info
*sflag_info
,
2229 lang_output_section_statement_type
*output
)
2231 flagword flags
= section
->flags
;
2233 bfd_boolean discard
;
2234 lang_input_section_type
*new_section
;
2235 bfd
*abfd
= link_info
.output_bfd
;
2237 /* Discard sections marked with SEC_EXCLUDE. */
2238 discard
= (flags
& SEC_EXCLUDE
) != 0;
2240 /* Discard input sections which are assigned to a section named
2241 DISCARD_SECTION_NAME. */
2242 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2245 /* Discard debugging sections if we are stripping debugging
2247 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2248 && (flags
& SEC_DEBUGGING
) != 0)
2253 if (section
->output_section
== NULL
)
2255 /* This prevents future calls from assigning this section. */
2256 section
->output_section
= bfd_abs_section_ptr
;
2265 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2270 if (section
->output_section
!= NULL
)
2273 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2274 to an output section, because we want to be able to include a
2275 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2276 section (I don't know why we want to do this, but we do).
2277 build_link_order in ldwrite.c handles this case by turning
2278 the embedded SEC_NEVER_LOAD section into a fill. */
2279 flags
&= ~ SEC_NEVER_LOAD
;
2281 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2282 already been processed. One reason to do this is that on pe
2283 format targets, .text$foo sections go into .text and it's odd
2284 to see .text with SEC_LINK_ONCE set. */
2286 if (!link_info
.relocatable
)
2287 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2289 switch (output
->sectype
)
2291 case normal_section
:
2292 case overlay_section
:
2294 case noalloc_section
:
2295 flags
&= ~SEC_ALLOC
;
2297 case noload_section
:
2299 flags
|= SEC_NEVER_LOAD
;
2300 /* Unfortunately GNU ld has managed to evolve two different
2301 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2302 alloc, no contents section. All others get a noload, noalloc
2304 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2305 flags
&= ~SEC_HAS_CONTENTS
;
2307 flags
&= ~SEC_ALLOC
;
2311 if (output
->bfd_section
== NULL
)
2312 init_os (output
, flags
);
2314 /* If SEC_READONLY is not set in the input section, then clear
2315 it from the output section. */
2316 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2318 if (output
->bfd_section
->linker_has_input
)
2320 /* Only set SEC_READONLY flag on the first input section. */
2321 flags
&= ~ SEC_READONLY
;
2323 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2324 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2325 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2326 || ((flags
& SEC_MERGE
) != 0
2327 && output
->bfd_section
->entsize
!= section
->entsize
))
2329 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2330 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2333 output
->bfd_section
->flags
|= flags
;
2335 if (!output
->bfd_section
->linker_has_input
)
2337 output
->bfd_section
->linker_has_input
= 1;
2338 /* This must happen after flags have been updated. The output
2339 section may have been created before we saw its first input
2340 section, eg. for a data statement. */
2341 bfd_init_private_section_data (section
->owner
, section
,
2342 link_info
.output_bfd
,
2343 output
->bfd_section
,
2345 if ((flags
& SEC_MERGE
) != 0)
2346 output
->bfd_section
->entsize
= section
->entsize
;
2349 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2350 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2352 /* FIXME: This value should really be obtained from the bfd... */
2353 output
->block_value
= 128;
2356 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2357 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2359 section
->output_section
= output
->bfd_section
;
2361 if (!link_info
.relocatable
2362 && !stripped_excluded_sections
)
2364 asection
*s
= output
->bfd_section
->map_tail
.s
;
2365 output
->bfd_section
->map_tail
.s
= section
;
2366 section
->map_head
.s
= NULL
;
2367 section
->map_tail
.s
= s
;
2369 s
->map_head
.s
= section
;
2371 output
->bfd_section
->map_head
.s
= section
;
2374 /* Add a section reference to the list. */
2375 new_section
= new_stat (lang_input_section
, ptr
);
2376 new_section
->section
= section
;
2379 /* Handle wildcard sorting. This returns the lang_input_section which
2380 should follow the one we are going to create for SECTION and FILE,
2381 based on the sorting requirements of WILD. It returns NULL if the
2382 new section should just go at the end of the current list. */
2384 static lang_statement_union_type
*
2385 wild_sort (lang_wild_statement_type
*wild
,
2386 struct wildcard_list
*sec
,
2387 lang_input_statement_type
*file
,
2390 lang_statement_union_type
*l
;
2392 if (!wild
->filenames_sorted
2393 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2396 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2398 lang_input_section_type
*ls
;
2400 if (l
->header
.type
!= lang_input_section_enum
)
2402 ls
= &l
->input_section
;
2404 /* Sorting by filename takes precedence over sorting by section
2407 if (wild
->filenames_sorted
)
2409 const char *fn
, *ln
;
2413 /* The PE support for the .idata section as generated by
2414 dlltool assumes that files will be sorted by the name of
2415 the archive and then the name of the file within the
2418 if (file
->the_bfd
!= NULL
2419 && bfd_my_archive (file
->the_bfd
) != NULL
)
2421 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2426 fn
= file
->filename
;
2430 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2432 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2437 ln
= ls
->section
->owner
->filename
;
2441 i
= filename_cmp (fn
, ln
);
2450 fn
= file
->filename
;
2452 ln
= ls
->section
->owner
->filename
;
2454 i
= filename_cmp (fn
, ln
);
2462 /* Here either the files are not sorted by name, or we are
2463 looking at the sections for this file. */
2465 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2466 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2473 /* Expand a wild statement for a particular FILE. SECTION may be
2474 NULL, in which case it is a wild card. */
2477 output_section_callback (lang_wild_statement_type
*ptr
,
2478 struct wildcard_list
*sec
,
2480 struct flag_info
*sflag_info
,
2481 lang_input_statement_type
*file
,
2484 lang_statement_union_type
*before
;
2485 lang_output_section_statement_type
*os
;
2487 os
= (lang_output_section_statement_type
*) output
;
2489 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2490 if (unique_section_p (section
, os
))
2493 before
= wild_sort (ptr
, sec
, file
, section
);
2495 /* Here BEFORE points to the lang_input_section which
2496 should follow the one we are about to add. If BEFORE
2497 is NULL, then the section should just go at the end
2498 of the current list. */
2501 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2504 lang_statement_list_type list
;
2505 lang_statement_union_type
**pp
;
2507 lang_list_init (&list
);
2508 lang_add_section (&list
, section
, sflag_info
, os
);
2510 /* If we are discarding the section, LIST.HEAD will
2512 if (list
.head
!= NULL
)
2514 ASSERT (list
.head
->header
.next
== NULL
);
2516 for (pp
= &ptr
->children
.head
;
2518 pp
= &(*pp
)->header
.next
)
2519 ASSERT (*pp
!= NULL
);
2521 list
.head
->header
.next
= *pp
;
2527 /* Check if all sections in a wild statement for a particular FILE
2531 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2532 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2534 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2535 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2538 lang_output_section_statement_type
*os
;
2540 os
= (lang_output_section_statement_type
*) output
;
2542 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2543 if (unique_section_p (section
, os
))
2546 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2547 os
->all_input_readonly
= FALSE
;
2550 /* This is passed a file name which must have been seen already and
2551 added to the statement tree. We will see if it has been opened
2552 already and had its symbols read. If not then we'll read it. */
2554 static lang_input_statement_type
*
2555 lookup_name (const char *name
)
2557 lang_input_statement_type
*search
;
2559 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2561 search
= (lang_input_statement_type
*) search
->next_real_file
)
2563 /* Use the local_sym_name as the name of the file that has
2564 already been loaded as filename might have been transformed
2565 via the search directory lookup mechanism. */
2566 const char *filename
= search
->local_sym_name
;
2568 if (filename
!= NULL
2569 && filename_cmp (filename
, name
) == 0)
2574 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2575 default_target
, FALSE
);
2577 /* If we have already added this file, or this file is not real
2578 don't add this file. */
2579 if (search
->flags
.loaded
|| !search
->flags
.real
)
2582 if (! load_symbols (search
, NULL
))
2588 /* Save LIST as a list of libraries whose symbols should not be exported. */
2593 struct excluded_lib
*next
;
2595 static struct excluded_lib
*excluded_libs
;
2598 add_excluded_libs (const char *list
)
2600 const char *p
= list
, *end
;
2604 struct excluded_lib
*entry
;
2605 end
= strpbrk (p
, ",:");
2607 end
= p
+ strlen (p
);
2608 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2609 entry
->next
= excluded_libs
;
2610 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2611 memcpy (entry
->name
, p
, end
- p
);
2612 entry
->name
[end
- p
] = '\0';
2613 excluded_libs
= entry
;
2621 check_excluded_libs (bfd
*abfd
)
2623 struct excluded_lib
*lib
= excluded_libs
;
2627 int len
= strlen (lib
->name
);
2628 const char *filename
= lbasename (abfd
->filename
);
2630 if (strcmp (lib
->name
, "ALL") == 0)
2632 abfd
->no_export
= TRUE
;
2636 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2637 && (filename
[len
] == '\0'
2638 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2639 && filename
[len
+ 2] == '\0')))
2641 abfd
->no_export
= TRUE
;
2649 /* Get the symbols for an input file. */
2652 load_symbols (lang_input_statement_type
*entry
,
2653 lang_statement_list_type
*place
)
2657 if (entry
->flags
.loaded
)
2660 ldfile_open_file (entry
);
2662 /* Do not process further if the file was missing. */
2663 if (entry
->flags
.missing_file
)
2666 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2667 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2670 struct lang_input_statement_flags save_flags
;
2673 err
= bfd_get_error ();
2675 /* See if the emulation has some special knowledge. */
2676 if (ldemul_unrecognized_file (entry
))
2679 if (err
== bfd_error_file_ambiguously_recognized
)
2683 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2684 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2685 for (p
= matching
; *p
!= NULL
; p
++)
2689 else if (err
!= bfd_error_file_not_recognized
2691 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2693 bfd_close (entry
->the_bfd
);
2694 entry
->the_bfd
= NULL
;
2696 /* Try to interpret the file as a linker script. */
2697 save_flags
= input_flags
;
2698 ldfile_open_command_file (entry
->filename
);
2700 push_stat_ptr (place
);
2701 input_flags
.add_DT_NEEDED_for_regular
2702 = entry
->flags
.add_DT_NEEDED_for_regular
;
2703 input_flags
.add_DT_NEEDED_for_dynamic
2704 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2705 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2706 input_flags
.dynamic
= entry
->flags
.dynamic
;
2708 ldfile_assumed_script
= TRUE
;
2709 parser_input
= input_script
;
2711 ldfile_assumed_script
= FALSE
;
2713 /* missing_file is sticky. sysrooted will already have been
2714 restored when seeing EOF in yyparse, but no harm to restore
2716 save_flags
.missing_file
|= input_flags
.missing_file
;
2717 input_flags
= save_flags
;
2721 entry
->flags
.loaded
= TRUE
;
2726 if (ldemul_recognized_file (entry
))
2729 /* We don't call ldlang_add_file for an archive. Instead, the
2730 add_symbols entry point will call ldlang_add_file, via the
2731 add_archive_element callback, for each element of the archive
2733 switch (bfd_get_format (entry
->the_bfd
))
2739 #ifdef ENABLE_PLUGINS
2740 if (!entry
->flags
.reload
)
2742 ldlang_add_file (entry
);
2743 if (trace_files
|| trace_file_tries
)
2744 info_msg ("%I\n", entry
);
2748 check_excluded_libs (entry
->the_bfd
);
2750 if (entry
->flags
.whole_archive
)
2753 bfd_boolean loaded
= TRUE
;
2758 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2763 if (! bfd_check_format (member
, bfd_object
))
2765 einfo (_("%F%B: member %B in archive is not an object\n"),
2766 entry
->the_bfd
, member
);
2771 if (!(*link_info
.callbacks
2772 ->add_archive_element
) (&link_info
, member
,
2773 "--whole-archive", &subsbfd
))
2776 /* Potentially, the add_archive_element hook may have set a
2777 substitute BFD for us. */
2778 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2780 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2785 entry
->flags
.loaded
= loaded
;
2791 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2792 entry
->flags
.loaded
= TRUE
;
2794 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2796 return entry
->flags
.loaded
;
2799 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2800 may be NULL, indicating that it is a wildcard. Separate
2801 lang_input_section statements are created for each part of the
2802 expansion; they are added after the wild statement S. OUTPUT is
2803 the output section. */
2806 wild (lang_wild_statement_type
*s
,
2807 const char *target ATTRIBUTE_UNUSED
,
2808 lang_output_section_statement_type
*output
)
2810 struct wildcard_list
*sec
;
2812 if (s
->handler_data
[0]
2813 && s
->handler_data
[0]->spec
.sorted
== by_name
2814 && !s
->filenames_sorted
)
2816 lang_section_bst_type
*tree
;
2818 walk_wild (s
, output_section_callback_fast
, output
);
2823 output_section_callback_tree_to_list (s
, tree
, output
);
2828 walk_wild (s
, output_section_callback
, output
);
2830 if (default_common_section
== NULL
)
2831 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2832 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2834 /* Remember the section that common is going to in case we
2835 later get something which doesn't know where to put it. */
2836 default_common_section
= output
;
2841 /* Return TRUE iff target is the sought target. */
2844 get_target (const bfd_target
*target
, void *data
)
2846 const char *sought
= (const char *) data
;
2848 return strcmp (target
->name
, sought
) == 0;
2851 /* Like strcpy() but convert to lower case as well. */
2854 stricpy (char *dest
, char *src
)
2858 while ((c
= *src
++) != 0)
2859 *dest
++ = TOLOWER (c
);
2864 /* Remove the first occurrence of needle (if any) in haystack
2868 strcut (char *haystack
, char *needle
)
2870 haystack
= strstr (haystack
, needle
);
2876 for (src
= haystack
+ strlen (needle
); *src
;)
2877 *haystack
++ = *src
++;
2883 /* Compare two target format name strings.
2884 Return a value indicating how "similar" they are. */
2887 name_compare (char *first
, char *second
)
2893 copy1
= (char *) xmalloc (strlen (first
) + 1);
2894 copy2
= (char *) xmalloc (strlen (second
) + 1);
2896 /* Convert the names to lower case. */
2897 stricpy (copy1
, first
);
2898 stricpy (copy2
, second
);
2900 /* Remove size and endian strings from the name. */
2901 strcut (copy1
, "big");
2902 strcut (copy1
, "little");
2903 strcut (copy2
, "big");
2904 strcut (copy2
, "little");
2906 /* Return a value based on how many characters match,
2907 starting from the beginning. If both strings are
2908 the same then return 10 * their length. */
2909 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2910 if (copy1
[result
] == 0)
2922 /* Set by closest_target_match() below. */
2923 static const bfd_target
*winner
;
2925 /* Scan all the valid bfd targets looking for one that has the endianness
2926 requirement that was specified on the command line, and is the nearest
2927 match to the original output target. */
2930 closest_target_match (const bfd_target
*target
, void *data
)
2932 const bfd_target
*original
= (const bfd_target
*) data
;
2934 if (command_line
.endian
== ENDIAN_BIG
2935 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2938 if (command_line
.endian
== ENDIAN_LITTLE
2939 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2942 /* Must be the same flavour. */
2943 if (target
->flavour
!= original
->flavour
)
2946 /* Ignore generic big and little endian elf vectors. */
2947 if (strcmp (target
->name
, "elf32-big") == 0
2948 || strcmp (target
->name
, "elf64-big") == 0
2949 || strcmp (target
->name
, "elf32-little") == 0
2950 || strcmp (target
->name
, "elf64-little") == 0)
2953 /* If we have not found a potential winner yet, then record this one. */
2960 /* Oh dear, we now have two potential candidates for a successful match.
2961 Compare their names and choose the better one. */
2962 if (name_compare (target
->name
, original
->name
)
2963 > name_compare (winner
->name
, original
->name
))
2966 /* Keep on searching until wqe have checked them all. */
2970 /* Return the BFD target format of the first input file. */
2973 get_first_input_target (void)
2975 char *target
= NULL
;
2977 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2979 if (s
->header
.type
== lang_input_statement_enum
2982 ldfile_open_file (s
);
2984 if (s
->the_bfd
!= NULL
2985 && bfd_check_format (s
->the_bfd
, bfd_object
))
2987 target
= bfd_get_target (s
->the_bfd
);
2999 lang_get_output_target (void)
3003 /* Has the user told us which output format to use? */
3004 if (output_target
!= NULL
)
3005 return output_target
;
3007 /* No - has the current target been set to something other than
3009 if (current_target
!= default_target
&& current_target
!= NULL
)
3010 return current_target
;
3012 /* No - can we determine the format of the first input file? */
3013 target
= get_first_input_target ();
3017 /* Failed - use the default output target. */
3018 return default_target
;
3021 /* Open the output file. */
3024 open_output (const char *name
)
3026 output_target
= lang_get_output_target ();
3028 /* Has the user requested a particular endianness on the command
3030 if (command_line
.endian
!= ENDIAN_UNSET
)
3032 const bfd_target
*target
;
3033 enum bfd_endian desired_endian
;
3035 /* Get the chosen target. */
3036 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3038 /* If the target is not supported, we cannot do anything. */
3041 if (command_line
.endian
== ENDIAN_BIG
)
3042 desired_endian
= BFD_ENDIAN_BIG
;
3044 desired_endian
= BFD_ENDIAN_LITTLE
;
3046 /* See if the target has the wrong endianness. This should
3047 not happen if the linker script has provided big and
3048 little endian alternatives, but some scrips don't do
3050 if (target
->byteorder
!= desired_endian
)
3052 /* If it does, then see if the target provides
3053 an alternative with the correct endianness. */
3054 if (target
->alternative_target
!= NULL
3055 && (target
->alternative_target
->byteorder
== desired_endian
))
3056 output_target
= target
->alternative_target
->name
;
3059 /* Try to find a target as similar as possible to
3060 the default target, but which has the desired
3061 endian characteristic. */
3062 bfd_search_for_target (closest_target_match
,
3065 /* Oh dear - we could not find any targets that
3066 satisfy our requirements. */
3068 einfo (_("%P: warning: could not find any targets"
3069 " that match endianness requirement\n"));
3071 output_target
= winner
->name
;
3077 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3079 if (link_info
.output_bfd
== NULL
)
3081 if (bfd_get_error () == bfd_error_invalid_target
)
3082 einfo (_("%P%F: target %s not found\n"), output_target
);
3084 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3087 delete_output_file_on_failure
= TRUE
;
3089 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3090 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3091 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3092 ldfile_output_architecture
,
3093 ldfile_output_machine
))
3094 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3096 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3097 if (link_info
.hash
== NULL
)
3098 einfo (_("%P%F: can not create hash table: %E\n"));
3100 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3104 ldlang_open_output (lang_statement_union_type
*statement
)
3106 switch (statement
->header
.type
)
3108 case lang_output_statement_enum
:
3109 ASSERT (link_info
.output_bfd
== NULL
);
3110 open_output (statement
->output_statement
.name
);
3111 ldemul_set_output_arch ();
3112 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3113 link_info
.output_bfd
->flags
|= D_PAGED
;
3115 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3116 if (config
.text_read_only
)
3117 link_info
.output_bfd
->flags
|= WP_TEXT
;
3119 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3120 if (link_info
.traditional_format
)
3121 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3123 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3126 case lang_target_statement_enum
:
3127 current_target
= statement
->target_statement
.target
;
3134 /* Convert between addresses in bytes and sizes in octets.
3135 For currently supported targets, octets_per_byte is always a power
3136 of two, so we can use shifts. */
3137 #define TO_ADDR(X) ((X) >> opb_shift)
3138 #define TO_SIZE(X) ((X) << opb_shift)
3140 /* Support the above. */
3141 static unsigned int opb_shift
= 0;
3146 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3147 ldfile_output_machine
);
3150 while ((x
& 1) == 0)
3158 /* Open all the input files. */
3162 OPEN_BFD_NORMAL
= 0,
3166 #ifdef ENABLE_PLUGINS
3167 static lang_input_statement_type
*plugin_insert
= NULL
;
3171 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3173 for (; s
!= NULL
; s
= s
->header
.next
)
3175 switch (s
->header
.type
)
3177 case lang_constructors_statement_enum
:
3178 open_input_bfds (constructor_list
.head
, mode
);
3180 case lang_output_section_statement_enum
:
3181 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3183 case lang_wild_statement_enum
:
3184 /* Maybe we should load the file's symbols. */
3185 if ((mode
& OPEN_BFD_RESCAN
) == 0
3186 && s
->wild_statement
.filename
3187 && !wildcardp (s
->wild_statement
.filename
)
3188 && !archive_path (s
->wild_statement
.filename
))
3189 lookup_name (s
->wild_statement
.filename
);
3190 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3192 case lang_group_statement_enum
:
3194 struct bfd_link_hash_entry
*undefs
;
3196 /* We must continually search the entries in the group
3197 until no new symbols are added to the list of undefined
3202 undefs
= link_info
.hash
->undefs_tail
;
3203 open_input_bfds (s
->group_statement
.children
.head
,
3204 mode
| OPEN_BFD_FORCE
);
3206 while (undefs
!= link_info
.hash
->undefs_tail
);
3209 case lang_target_statement_enum
:
3210 current_target
= s
->target_statement
.target
;
3212 case lang_input_statement_enum
:
3213 if (s
->input_statement
.flags
.real
)
3215 lang_statement_union_type
**os_tail
;
3216 lang_statement_list_type add
;
3218 s
->input_statement
.target
= current_target
;
3220 /* If we are being called from within a group, and this
3221 is an archive which has already been searched, then
3222 force it to be researched unless the whole archive
3223 has been loaded already. Do the same for a rescan. */
3224 if (mode
!= OPEN_BFD_NORMAL
3225 #ifdef ENABLE_PLUGINS
3226 && ((mode
& OPEN_BFD_RESCAN
) == 0
3227 || plugin_insert
== NULL
)
3229 && !s
->input_statement
.flags
.whole_archive
3230 && s
->input_statement
.flags
.loaded
3231 && s
->input_statement
.the_bfd
!= NULL
3232 && bfd_check_format (s
->input_statement
.the_bfd
,
3234 s
->input_statement
.flags
.loaded
= FALSE
;
3235 #ifdef ENABLE_PLUGINS
3236 /* When rescanning, reload --as-needed shared libs. */
3237 else if ((mode
& OPEN_BFD_RESCAN
) != 0
3238 && plugin_insert
== NULL
3239 && s
->input_statement
.flags
.loaded
3240 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3241 && s
->input_statement
.the_bfd
!= NULL
3242 && ((s
->input_statement
.the_bfd
->flags
) & DYNAMIC
) != 0
3243 && plugin_should_reload (s
->input_statement
.the_bfd
))
3245 s
->input_statement
.flags
.loaded
= FALSE
;
3246 s
->input_statement
.flags
.reload
= TRUE
;
3250 os_tail
= lang_output_section_statement
.tail
;
3251 lang_list_init (&add
);
3253 if (! load_symbols (&s
->input_statement
, &add
))
3254 config
.make_executable
= FALSE
;
3256 if (add
.head
!= NULL
)
3258 /* If this was a script with output sections then
3259 tack any added statements on to the end of the
3260 list. This avoids having to reorder the output
3261 section statement list. Very likely the user
3262 forgot -T, and whatever we do here will not meet
3263 naive user expectations. */
3264 if (os_tail
!= lang_output_section_statement
.tail
)
3266 einfo (_("%P: warning: %s contains output sections;"
3267 " did you forget -T?\n"),
3268 s
->input_statement
.filename
);
3269 *stat_ptr
->tail
= add
.head
;
3270 stat_ptr
->tail
= add
.tail
;
3274 *add
.tail
= s
->header
.next
;
3275 s
->header
.next
= add
.head
;
3279 #ifdef ENABLE_PLUGINS
3280 /* If we have found the point at which a plugin added new
3281 files, clear plugin_insert to enable archive rescan. */
3282 if (&s
->input_statement
== plugin_insert
)
3283 plugin_insert
= NULL
;
3286 case lang_assignment_statement_enum
:
3287 if (s
->assignment_statement
.exp
->assign
.hidden
)
3288 /* This is from a --defsym on the command line. */
3289 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3296 /* Exit if any of the files were missing. */
3297 if (input_flags
.missing_file
)
3301 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3304 lang_track_definedness (const char *name
)
3306 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3307 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3310 /* New-function for the definedness hash table. */
3312 static struct bfd_hash_entry
*
3313 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3314 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3315 const char *name ATTRIBUTE_UNUSED
)
3317 struct lang_definedness_hash_entry
*ret
3318 = (struct lang_definedness_hash_entry
*) entry
;
3321 ret
= (struct lang_definedness_hash_entry
*)
3322 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3325 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3327 ret
->iteration
= -1;
3331 /* Return the iteration when the definition of NAME was last updated. A
3332 value of -1 means that the symbol is not defined in the linker script
3333 or the command line, but may be defined in the linker symbol table. */
3336 lang_symbol_definition_iteration (const char *name
)
3338 struct lang_definedness_hash_entry
*defentry
3339 = (struct lang_definedness_hash_entry
*)
3340 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3342 /* We've already created this one on the presence of DEFINED in the
3343 script, so it can't be NULL unless something is borked elsewhere in
3345 if (defentry
== NULL
)
3348 return defentry
->iteration
;
3351 /* Update the definedness state of NAME. */
3354 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3356 struct lang_definedness_hash_entry
*defentry
3357 = (struct lang_definedness_hash_entry
*)
3358 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3360 /* We don't keep track of symbols not tested with DEFINED. */
3361 if (defentry
== NULL
)
3364 /* If the symbol was already defined, and not from an earlier statement
3365 iteration, don't update the definedness iteration, because that'd
3366 make the symbol seem defined in the linker script at this point, and
3367 it wasn't; it was defined in some object. If we do anyway, DEFINED
3368 would start to yield false before this point and the construct "sym =
3369 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3371 if (h
->type
!= bfd_link_hash_undefined
3372 && h
->type
!= bfd_link_hash_common
3373 && h
->type
!= bfd_link_hash_new
3374 && defentry
->iteration
== -1)
3377 defentry
->iteration
= lang_statement_iteration
;
3380 /* Add the supplied name to the symbol table as an undefined reference.
3381 This is a two step process as the symbol table doesn't even exist at
3382 the time the ld command line is processed. First we put the name
3383 on a list, then, once the output file has been opened, transfer the
3384 name to the symbol table. */
3386 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3388 #define ldlang_undef_chain_list_head entry_symbol.next
3391 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3393 ldlang_undef_chain_list_type
*new_undef
;
3395 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3396 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3397 new_undef
->next
= ldlang_undef_chain_list_head
;
3398 ldlang_undef_chain_list_head
= new_undef
;
3400 new_undef
->name
= xstrdup (name
);
3402 if (link_info
.output_bfd
!= NULL
)
3403 insert_undefined (new_undef
->name
);
3406 /* Insert NAME as undefined in the symbol table. */
3409 insert_undefined (const char *name
)
3411 struct bfd_link_hash_entry
*h
;
3413 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3415 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3416 if (h
->type
== bfd_link_hash_new
)
3418 h
->type
= bfd_link_hash_undefined
;
3419 h
->u
.undef
.abfd
= NULL
;
3420 bfd_link_add_undef (link_info
.hash
, h
);
3424 /* Run through the list of undefineds created above and place them
3425 into the linker hash table as undefined symbols belonging to the
3429 lang_place_undefineds (void)
3431 ldlang_undef_chain_list_type
*ptr
;
3433 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3434 insert_undefined (ptr
->name
);
3437 /* Check for all readonly or some readwrite sections. */
3440 check_input_sections
3441 (lang_statement_union_type
*s
,
3442 lang_output_section_statement_type
*output_section_statement
)
3444 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3446 switch (s
->header
.type
)
3448 case lang_wild_statement_enum
:
3449 walk_wild (&s
->wild_statement
, check_section_callback
,
3450 output_section_statement
);
3451 if (! output_section_statement
->all_input_readonly
)
3454 case lang_constructors_statement_enum
:
3455 check_input_sections (constructor_list
.head
,
3456 output_section_statement
);
3457 if (! output_section_statement
->all_input_readonly
)
3460 case lang_group_statement_enum
:
3461 check_input_sections (s
->group_statement
.children
.head
,
3462 output_section_statement
);
3463 if (! output_section_statement
->all_input_readonly
)
3472 /* Update wildcard statements if needed. */
3475 update_wild_statements (lang_statement_union_type
*s
)
3477 struct wildcard_list
*sec
;
3479 switch (sort_section
)
3489 for (; s
!= NULL
; s
= s
->header
.next
)
3491 switch (s
->header
.type
)
3496 case lang_wild_statement_enum
:
3497 sec
= s
->wild_statement
.section_list
;
3498 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3501 switch (sec
->spec
.sorted
)
3504 sec
->spec
.sorted
= sort_section
;
3507 if (sort_section
== by_alignment
)
3508 sec
->spec
.sorted
= by_name_alignment
;
3511 if (sort_section
== by_name
)
3512 sec
->spec
.sorted
= by_alignment_name
;
3520 case lang_constructors_statement_enum
:
3521 update_wild_statements (constructor_list
.head
);
3524 case lang_output_section_statement_enum
:
3525 update_wild_statements
3526 (s
->output_section_statement
.children
.head
);
3529 case lang_group_statement_enum
:
3530 update_wild_statements (s
->group_statement
.children
.head
);
3538 /* Open input files and attach to output sections. */
3541 map_input_to_output_sections
3542 (lang_statement_union_type
*s
, const char *target
,
3543 lang_output_section_statement_type
*os
)
3545 for (; s
!= NULL
; s
= s
->header
.next
)
3547 lang_output_section_statement_type
*tos
;
3550 switch (s
->header
.type
)
3552 case lang_wild_statement_enum
:
3553 wild (&s
->wild_statement
, target
, os
);
3555 case lang_constructors_statement_enum
:
3556 map_input_to_output_sections (constructor_list
.head
,
3560 case lang_output_section_statement_enum
:
3561 tos
= &s
->output_section_statement
;
3562 if (tos
->constraint
!= 0)
3564 if (tos
->constraint
!= ONLY_IF_RW
3565 && tos
->constraint
!= ONLY_IF_RO
)
3567 tos
->all_input_readonly
= TRUE
;
3568 check_input_sections (tos
->children
.head
, tos
);
3569 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3571 tos
->constraint
= -1;
3575 map_input_to_output_sections (tos
->children
.head
,
3579 case lang_output_statement_enum
:
3581 case lang_target_statement_enum
:
3582 target
= s
->target_statement
.target
;
3584 case lang_group_statement_enum
:
3585 map_input_to_output_sections (s
->group_statement
.children
.head
,
3589 case lang_data_statement_enum
:
3590 /* Make sure that any sections mentioned in the expression
3592 exp_init_os (s
->data_statement
.exp
);
3593 /* The output section gets CONTENTS, ALLOC and LOAD, but
3594 these may be overridden by the script. */
3595 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3596 switch (os
->sectype
)
3598 case normal_section
:
3599 case overlay_section
:
3601 case noalloc_section
:
3602 flags
= SEC_HAS_CONTENTS
;
3604 case noload_section
:
3605 if (bfd_get_flavour (link_info
.output_bfd
)
3606 == bfd_target_elf_flavour
)
3607 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3609 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3612 if (os
->bfd_section
== NULL
)
3613 init_os (os
, flags
);
3615 os
->bfd_section
->flags
|= flags
;
3617 case lang_input_section_enum
:
3619 case lang_fill_statement_enum
:
3620 case lang_object_symbols_statement_enum
:
3621 case lang_reloc_statement_enum
:
3622 case lang_padding_statement_enum
:
3623 case lang_input_statement_enum
:
3624 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3627 case lang_assignment_statement_enum
:
3628 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3631 /* Make sure that any sections mentioned in the assignment
3633 exp_init_os (s
->assignment_statement
.exp
);
3635 case lang_address_statement_enum
:
3636 /* Mark the specified section with the supplied address.
3637 If this section was actually a segment marker, then the
3638 directive is ignored if the linker script explicitly
3639 processed the segment marker. Originally, the linker
3640 treated segment directives (like -Ttext on the
3641 command-line) as section directives. We honor the
3642 section directive semantics for backwards compatibilty;
3643 linker scripts that do not specifically check for
3644 SEGMENT_START automatically get the old semantics. */
3645 if (!s
->address_statement
.segment
3646 || !s
->address_statement
.segment
->used
)
3648 const char *name
= s
->address_statement
.section_name
;
3650 /* Create the output section statement here so that
3651 orphans with a set address will be placed after other
3652 script sections. If we let the orphan placement code
3653 place them in amongst other sections then the address
3654 will affect following script sections, which is
3655 likely to surprise naive users. */
3656 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3657 tos
->addr_tree
= s
->address_statement
.address
;
3658 if (tos
->bfd_section
== NULL
)
3662 case lang_insert_statement_enum
:
3668 /* An insert statement snips out all the linker statements from the
3669 start of the list and places them after the output section
3670 statement specified by the insert. This operation is complicated
3671 by the fact that we keep a doubly linked list of output section
3672 statements as well as the singly linked list of all statements. */
3675 process_insert_statements (void)
3677 lang_statement_union_type
**s
;
3678 lang_output_section_statement_type
*first_os
= NULL
;
3679 lang_output_section_statement_type
*last_os
= NULL
;
3680 lang_output_section_statement_type
*os
;
3682 /* "start of list" is actually the statement immediately after
3683 the special abs_section output statement, so that it isn't
3685 s
= &lang_output_section_statement
.head
;
3686 while (*(s
= &(*s
)->header
.next
) != NULL
)
3688 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3690 /* Keep pointers to the first and last output section
3691 statement in the sequence we may be about to move. */
3692 os
= &(*s
)->output_section_statement
;
3694 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3697 /* Set constraint negative so that lang_output_section_find
3698 won't match this output section statement. At this
3699 stage in linking constraint has values in the range
3700 [-1, ONLY_IN_RW]. */
3701 last_os
->constraint
= -2 - last_os
->constraint
;
3702 if (first_os
== NULL
)
3705 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3707 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3708 lang_output_section_statement_type
*where
;
3709 lang_statement_union_type
**ptr
;
3710 lang_statement_union_type
*first
;
3712 where
= lang_output_section_find (i
->where
);
3713 if (where
!= NULL
&& i
->is_before
)
3716 where
= where
->prev
;
3717 while (where
!= NULL
&& where
->constraint
< 0);
3721 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3725 /* Deal with reordering the output section statement list. */
3726 if (last_os
!= NULL
)
3728 asection
*first_sec
, *last_sec
;
3729 struct lang_output_section_statement_struct
**next
;
3731 /* Snip out the output sections we are moving. */
3732 first_os
->prev
->next
= last_os
->next
;
3733 if (last_os
->next
== NULL
)
3735 next
= &first_os
->prev
->next
;
3736 lang_output_section_statement
.tail
3737 = (lang_statement_union_type
**) next
;
3740 last_os
->next
->prev
= first_os
->prev
;
3741 /* Add them in at the new position. */
3742 last_os
->next
= where
->next
;
3743 if (where
->next
== NULL
)
3745 next
= &last_os
->next
;
3746 lang_output_section_statement
.tail
3747 = (lang_statement_union_type
**) next
;
3750 where
->next
->prev
= last_os
;
3751 first_os
->prev
= where
;
3752 where
->next
= first_os
;
3754 /* Move the bfd sections in the same way. */
3757 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3759 os
->constraint
= -2 - os
->constraint
;
3760 if (os
->bfd_section
!= NULL
3761 && os
->bfd_section
->owner
!= NULL
)
3763 last_sec
= os
->bfd_section
;
3764 if (first_sec
== NULL
)
3765 first_sec
= last_sec
;
3770 if (last_sec
!= NULL
)
3772 asection
*sec
= where
->bfd_section
;
3774 sec
= output_prev_sec_find (where
);
3776 /* The place we want to insert must come after the
3777 sections we are moving. So if we find no
3778 section or if the section is the same as our
3779 last section, then no move is needed. */
3780 if (sec
!= NULL
&& sec
!= last_sec
)
3782 /* Trim them off. */
3783 if (first_sec
->prev
!= NULL
)
3784 first_sec
->prev
->next
= last_sec
->next
;
3786 link_info
.output_bfd
->sections
= last_sec
->next
;
3787 if (last_sec
->next
!= NULL
)
3788 last_sec
->next
->prev
= first_sec
->prev
;
3790 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3792 last_sec
->next
= sec
->next
;
3793 if (sec
->next
!= NULL
)
3794 sec
->next
->prev
= last_sec
;
3796 link_info
.output_bfd
->section_last
= last_sec
;
3797 first_sec
->prev
= sec
;
3798 sec
->next
= first_sec
;
3806 ptr
= insert_os_after (where
);
3807 /* Snip everything after the abs_section output statement we
3808 know is at the start of the list, up to and including
3809 the insert statement we are currently processing. */
3810 first
= lang_output_section_statement
.head
->header
.next
;
3811 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3812 /* Add them back where they belong. */
3815 statement_list
.tail
= s
;
3817 s
= &lang_output_section_statement
.head
;
3821 /* Undo constraint twiddling. */
3822 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3824 os
->constraint
= -2 - os
->constraint
;
3830 /* An output section might have been removed after its statement was
3831 added. For example, ldemul_before_allocation can remove dynamic
3832 sections if they turn out to be not needed. Clean them up here. */
3835 strip_excluded_output_sections (void)
3837 lang_output_section_statement_type
*os
;
3839 /* Run lang_size_sections (if not already done). */
3840 if (expld
.phase
!= lang_mark_phase_enum
)
3842 expld
.phase
= lang_mark_phase_enum
;
3843 expld
.dataseg
.phase
= exp_dataseg_none
;
3844 one_lang_size_sections_pass (NULL
, FALSE
);
3845 lang_reset_memory_regions ();
3848 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3852 asection
*output_section
;
3853 bfd_boolean exclude
;
3855 if (os
->constraint
< 0)
3858 output_section
= os
->bfd_section
;
3859 if (output_section
== NULL
)
3862 exclude
= (output_section
->rawsize
== 0
3863 && (output_section
->flags
& SEC_KEEP
) == 0
3864 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3867 /* Some sections have not yet been sized, notably .gnu.version,
3868 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3869 input sections, so don't drop output sections that have such
3870 input sections unless they are also marked SEC_EXCLUDE. */
3871 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3875 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3876 if ((s
->flags
& SEC_EXCLUDE
) == 0
3877 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3878 || link_info
.emitrelocations
))
3885 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3886 output_section
->map_head
.link_order
= NULL
;
3887 output_section
->map_tail
.link_order
= NULL
;
3891 /* We don't set bfd_section to NULL since bfd_section of the
3892 removed output section statement may still be used. */
3893 if (!os
->update_dot
)
3895 output_section
->flags
|= SEC_EXCLUDE
;
3896 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3897 link_info
.output_bfd
->section_count
--;
3901 /* Stop future calls to lang_add_section from messing with map_head
3902 and map_tail link_order fields. */
3903 stripped_excluded_sections
= TRUE
;
3907 print_output_section_statement
3908 (lang_output_section_statement_type
*output_section_statement
)
3910 asection
*section
= output_section_statement
->bfd_section
;
3913 if (output_section_statement
!= abs_output_section
)
3915 minfo ("\n%s", output_section_statement
->name
);
3917 if (section
!= NULL
)
3919 print_dot
= section
->vma
;
3921 len
= strlen (output_section_statement
->name
);
3922 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3927 while (len
< SECTION_NAME_MAP_LENGTH
)
3933 minfo ("0x%V %W", section
->vma
, section
->size
);
3935 if (section
->vma
!= section
->lma
)
3936 minfo (_(" load address 0x%V"), section
->lma
);
3938 if (output_section_statement
->update_dot_tree
!= NULL
)
3939 exp_fold_tree (output_section_statement
->update_dot_tree
,
3940 bfd_abs_section_ptr
, &print_dot
);
3946 print_statement_list (output_section_statement
->children
.head
,
3947 output_section_statement
);
3950 /* Scan for the use of the destination in the right hand side
3951 of an expression. In such cases we will not compute the
3952 correct expression, since the value of DST that is used on
3953 the right hand side will be its final value, not its value
3954 just before this expression is evaluated. */
3957 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3959 if (rhs
== NULL
|| dst
== NULL
)
3962 switch (rhs
->type
.node_class
)
3965 return (scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3966 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
));
3969 return (scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3970 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
));
3973 case etree_provided
:
3975 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3977 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3980 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3984 return strcmp (dst
, rhs
->value
.str
) == 0;
3989 return strcmp (dst
, rhs
->name
.name
) == 0;
4001 print_assignment (lang_assignment_statement_type
*assignment
,
4002 lang_output_section_statement_type
*output_section
)
4006 bfd_boolean computation_is_valid
= TRUE
;
4010 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4013 if (assignment
->exp
->type
.node_class
== etree_assert
)
4016 tree
= assignment
->exp
->assert_s
.child
;
4017 computation_is_valid
= TRUE
;
4021 const char *dst
= assignment
->exp
->assign
.dst
;
4023 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4024 tree
= assignment
->exp
->assign
.src
;
4025 computation_is_valid
= is_dot
|| !scan_for_self_assignment (dst
, tree
);
4028 osec
= output_section
->bfd_section
;
4030 osec
= bfd_abs_section_ptr
;
4031 exp_fold_tree (tree
, osec
, &print_dot
);
4032 if (expld
.result
.valid_p
)
4036 if (computation_is_valid
)
4038 value
= expld
.result
.value
;
4040 if (expld
.result
.section
!= NULL
)
4041 value
+= expld
.result
.section
->vma
;
4043 minfo ("0x%V", value
);
4049 struct bfd_link_hash_entry
*h
;
4051 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4052 FALSE
, FALSE
, TRUE
);
4055 value
= h
->u
.def
.value
;
4056 value
+= h
->u
.def
.section
->output_section
->vma
;
4057 value
+= h
->u
.def
.section
->output_offset
;
4059 minfo ("[0x%V]", value
);
4062 minfo ("[unresolved]");
4074 exp_print_tree (assignment
->exp
);
4079 print_input_statement (lang_input_statement_type
*statm
)
4081 if (statm
->filename
!= NULL
4082 && (statm
->the_bfd
== NULL
4083 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4084 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4087 /* Print all symbols defined in a particular section. This is called
4088 via bfd_link_hash_traverse, or by print_all_symbols. */
4091 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4093 asection
*sec
= (asection
*) ptr
;
4095 if ((hash_entry
->type
== bfd_link_hash_defined
4096 || hash_entry
->type
== bfd_link_hash_defweak
)
4097 && sec
== hash_entry
->u
.def
.section
)
4101 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4104 (hash_entry
->u
.def
.value
4105 + hash_entry
->u
.def
.section
->output_offset
4106 + hash_entry
->u
.def
.section
->output_section
->vma
));
4108 minfo (" %T\n", hash_entry
->root
.string
);
4115 hash_entry_addr_cmp (const void *a
, const void *b
)
4117 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4118 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4120 if (l
->u
.def
.value
< r
->u
.def
.value
)
4122 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4129 print_all_symbols (asection
*sec
)
4131 struct fat_user_section_struct
*ud
=
4132 (struct fat_user_section_struct
*) get_userdata (sec
);
4133 struct map_symbol_def
*def
;
4134 struct bfd_link_hash_entry
**entries
;
4140 *ud
->map_symbol_def_tail
= 0;
4142 /* Sort the symbols by address. */
4143 entries
= (struct bfd_link_hash_entry
**)
4144 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4146 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4147 entries
[i
] = def
->entry
;
4149 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4150 hash_entry_addr_cmp
);
4152 /* Print the symbols. */
4153 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4154 print_one_symbol (entries
[i
], sec
);
4156 obstack_free (&map_obstack
, entries
);
4159 /* Print information about an input section to the map file. */
4162 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4164 bfd_size_type size
= i
->size
;
4171 minfo ("%s", i
->name
);
4173 len
= 1 + strlen (i
->name
);
4174 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4179 while (len
< SECTION_NAME_MAP_LENGTH
)
4185 if (i
->output_section
!= NULL
4186 && i
->output_section
->owner
== link_info
.output_bfd
)
4187 addr
= i
->output_section
->vma
+ i
->output_offset
;
4195 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4197 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4199 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4211 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4214 if (i
->output_section
!= NULL
4215 && i
->output_section
->owner
== link_info
.output_bfd
)
4217 if (link_info
.reduce_memory_overheads
)
4218 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4220 print_all_symbols (i
);
4222 /* Update print_dot, but make sure that we do not move it
4223 backwards - this could happen if we have overlays and a
4224 later overlay is shorter than an earier one. */
4225 if (addr
+ TO_ADDR (size
) > print_dot
)
4226 print_dot
= addr
+ TO_ADDR (size
);
4231 print_fill_statement (lang_fill_statement_type
*fill
)
4235 fputs (" FILL mask 0x", config
.map_file
);
4236 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4237 fprintf (config
.map_file
, "%02x", *p
);
4238 fputs ("\n", config
.map_file
);
4242 print_data_statement (lang_data_statement_type
*data
)
4250 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4253 addr
= data
->output_offset
;
4254 if (data
->output_section
!= NULL
)
4255 addr
+= data
->output_section
->vma
;
4283 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4285 if (data
->exp
->type
.node_class
!= etree_value
)
4288 exp_print_tree (data
->exp
);
4293 print_dot
= addr
+ TO_ADDR (size
);
4296 /* Print an address statement. These are generated by options like
4300 print_address_statement (lang_address_statement_type
*address
)
4302 minfo (_("Address of section %s set to "), address
->section_name
);
4303 exp_print_tree (address
->address
);
4307 /* Print a reloc statement. */
4310 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4317 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4320 addr
= reloc
->output_offset
;
4321 if (reloc
->output_section
!= NULL
)
4322 addr
+= reloc
->output_section
->vma
;
4324 size
= bfd_get_reloc_size (reloc
->howto
);
4326 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4328 if (reloc
->name
!= NULL
)
4329 minfo ("%s+", reloc
->name
);
4331 minfo ("%s+", reloc
->section
->name
);
4333 exp_print_tree (reloc
->addend_exp
);
4337 print_dot
= addr
+ TO_ADDR (size
);
4341 print_padding_statement (lang_padding_statement_type
*s
)
4349 len
= sizeof " *fill*" - 1;
4350 while (len
< SECTION_NAME_MAP_LENGTH
)
4356 addr
= s
->output_offset
;
4357 if (s
->output_section
!= NULL
)
4358 addr
+= s
->output_section
->vma
;
4359 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4361 if (s
->fill
->size
!= 0)
4365 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4366 fprintf (config
.map_file
, "%02x", *p
);
4371 print_dot
= addr
+ TO_ADDR (s
->size
);
4375 print_wild_statement (lang_wild_statement_type
*w
,
4376 lang_output_section_statement_type
*os
)
4378 struct wildcard_list
*sec
;
4382 if (w
->filenames_sorted
)
4384 if (w
->filename
!= NULL
)
4385 minfo ("%s", w
->filename
);
4388 if (w
->filenames_sorted
)
4392 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4394 if (sec
->spec
.sorted
)
4396 if (sec
->spec
.exclude_name_list
!= NULL
)
4399 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4400 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4401 minfo (" %s", tmp
->name
);
4404 if (sec
->spec
.name
!= NULL
)
4405 minfo ("%s", sec
->spec
.name
);
4408 if (sec
->spec
.sorted
)
4417 print_statement_list (w
->children
.head
, os
);
4420 /* Print a group statement. */
4423 print_group (lang_group_statement_type
*s
,
4424 lang_output_section_statement_type
*os
)
4426 fprintf (config
.map_file
, "START GROUP\n");
4427 print_statement_list (s
->children
.head
, os
);
4428 fprintf (config
.map_file
, "END GROUP\n");
4431 /* Print the list of statements in S.
4432 This can be called for any statement type. */
4435 print_statement_list (lang_statement_union_type
*s
,
4436 lang_output_section_statement_type
*os
)
4440 print_statement (s
, os
);
4445 /* Print the first statement in statement list S.
4446 This can be called for any statement type. */
4449 print_statement (lang_statement_union_type
*s
,
4450 lang_output_section_statement_type
*os
)
4452 switch (s
->header
.type
)
4455 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4458 case lang_constructors_statement_enum
:
4459 if (constructor_list
.head
!= NULL
)
4461 if (constructors_sorted
)
4462 minfo (" SORT (CONSTRUCTORS)\n");
4464 minfo (" CONSTRUCTORS\n");
4465 print_statement_list (constructor_list
.head
, os
);
4468 case lang_wild_statement_enum
:
4469 print_wild_statement (&s
->wild_statement
, os
);
4471 case lang_address_statement_enum
:
4472 print_address_statement (&s
->address_statement
);
4474 case lang_object_symbols_statement_enum
:
4475 minfo (" CREATE_OBJECT_SYMBOLS\n");
4477 case lang_fill_statement_enum
:
4478 print_fill_statement (&s
->fill_statement
);
4480 case lang_data_statement_enum
:
4481 print_data_statement (&s
->data_statement
);
4483 case lang_reloc_statement_enum
:
4484 print_reloc_statement (&s
->reloc_statement
);
4486 case lang_input_section_enum
:
4487 print_input_section (s
->input_section
.section
, FALSE
);
4489 case lang_padding_statement_enum
:
4490 print_padding_statement (&s
->padding_statement
);
4492 case lang_output_section_statement_enum
:
4493 print_output_section_statement (&s
->output_section_statement
);
4495 case lang_assignment_statement_enum
:
4496 print_assignment (&s
->assignment_statement
, os
);
4498 case lang_target_statement_enum
:
4499 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4501 case lang_output_statement_enum
:
4502 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4503 if (output_target
!= NULL
)
4504 minfo (" %s", output_target
);
4507 case lang_input_statement_enum
:
4508 print_input_statement (&s
->input_statement
);
4510 case lang_group_statement_enum
:
4511 print_group (&s
->group_statement
, os
);
4513 case lang_insert_statement_enum
:
4514 minfo ("INSERT %s %s\n",
4515 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4516 s
->insert_statement
.where
);
4522 print_statements (void)
4524 print_statement_list (statement_list
.head
, abs_output_section
);
4527 /* Print the first N statements in statement list S to STDERR.
4528 If N == 0, nothing is printed.
4529 If N < 0, the entire list is printed.
4530 Intended to be called from GDB. */
4533 dprint_statement (lang_statement_union_type
*s
, int n
)
4535 FILE *map_save
= config
.map_file
;
4537 config
.map_file
= stderr
;
4540 print_statement_list (s
, abs_output_section
);
4543 while (s
&& --n
>= 0)
4545 print_statement (s
, abs_output_section
);
4550 config
.map_file
= map_save
;
4554 insert_pad (lang_statement_union_type
**ptr
,
4556 bfd_size_type alignment_needed
,
4557 asection
*output_section
,
4560 static fill_type zero_fill
;
4561 lang_statement_union_type
*pad
= NULL
;
4563 if (ptr
!= &statement_list
.head
)
4564 pad
= ((lang_statement_union_type
*)
4565 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4567 && pad
->header
.type
== lang_padding_statement_enum
4568 && pad
->padding_statement
.output_section
== output_section
)
4570 /* Use the existing pad statement. */
4572 else if ((pad
= *ptr
) != NULL
4573 && pad
->header
.type
== lang_padding_statement_enum
4574 && pad
->padding_statement
.output_section
== output_section
)
4576 /* Use the existing pad statement. */
4580 /* Make a new padding statement, linked into existing chain. */
4581 pad
= (lang_statement_union_type
*)
4582 stat_alloc (sizeof (lang_padding_statement_type
));
4583 pad
->header
.next
= *ptr
;
4585 pad
->header
.type
= lang_padding_statement_enum
;
4586 pad
->padding_statement
.output_section
= output_section
;
4589 pad
->padding_statement
.fill
= fill
;
4591 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4592 pad
->padding_statement
.size
= alignment_needed
;
4593 output_section
->size
+= alignment_needed
;
4596 /* Work out how much this section will move the dot point. */
4600 (lang_statement_union_type
**this_ptr
,
4601 lang_output_section_statement_type
*output_section_statement
,
4605 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4606 asection
*i
= is
->section
;
4608 if (i
->sec_info_type
!= SEC_INFO_TYPE_JUST_SYMS
4609 && (i
->flags
& SEC_EXCLUDE
) == 0)
4611 bfd_size_type alignment_needed
;
4614 /* Align this section first to the input sections requirement,
4615 then to the output section's requirement. If this alignment
4616 is greater than any seen before, then record it too. Perform
4617 the alignment by inserting a magic 'padding' statement. */
4619 if (output_section_statement
->subsection_alignment
!= -1)
4620 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4622 o
= output_section_statement
->bfd_section
;
4623 if (o
->alignment_power
< i
->alignment_power
)
4624 o
->alignment_power
= i
->alignment_power
;
4626 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4628 if (alignment_needed
!= 0)
4630 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4631 dot
+= alignment_needed
;
4634 /* Remember where in the output section this input section goes. */
4636 i
->output_offset
= dot
- o
->vma
;
4638 /* Mark how big the output section must be to contain this now. */
4639 dot
+= TO_ADDR (i
->size
);
4640 o
->size
= TO_SIZE (dot
- o
->vma
);
4644 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4651 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4653 const asection
*sec1
= *(const asection
**) arg1
;
4654 const asection
*sec2
= *(const asection
**) arg2
;
4656 if (bfd_section_lma (sec1
->owner
, sec1
)
4657 < bfd_section_lma (sec2
->owner
, sec2
))
4659 else if (bfd_section_lma (sec1
->owner
, sec1
)
4660 > bfd_section_lma (sec2
->owner
, sec2
))
4662 else if (sec1
->id
< sec2
->id
)
4664 else if (sec1
->id
> sec2
->id
)
4670 #define IGNORE_SECTION(s) \
4671 ((s->flags & SEC_ALLOC) == 0 \
4672 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4673 && (s->flags & SEC_LOAD) == 0))
4675 /* Check to see if any allocated sections overlap with other allocated
4676 sections. This can happen if a linker script specifies the output
4677 section addresses of the two sections. Also check whether any memory
4678 region has overflowed. */
4681 lang_check_section_addresses (void)
4684 asection
**sections
, **spp
;
4691 lang_memory_region_type
*m
;
4693 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4696 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4697 sections
= (asection
**) xmalloc (amt
);
4699 /* Scan all sections in the output list. */
4701 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4703 /* Only consider loadable sections with real contents. */
4704 if (!(s
->flags
& SEC_LOAD
)
4705 || !(s
->flags
& SEC_ALLOC
)
4709 sections
[count
] = s
;
4716 qsort (sections
, (size_t) count
, sizeof (asection
*),
4717 sort_sections_by_lma
);
4722 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4723 for (count
--; count
; count
--)
4725 /* We must check the sections' LMA addresses not their VMA
4726 addresses because overlay sections can have overlapping VMAs
4727 but they must have distinct LMAs. */
4733 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4735 /* Look for an overlap. We have sorted sections by lma, so we
4736 know that s_start >= p_start. Besides the obvious case of
4737 overlap when the current section starts before the previous
4738 one ends, we also must have overlap if the previous section
4739 wraps around the address space. */
4740 if (s_start
<= p_end
4742 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4743 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4748 /* If any memory region has overflowed, report by how much.
4749 We do not issue this diagnostic for regions that had sections
4750 explicitly placed outside their bounds; os_region_check's
4751 diagnostics are adequate for that case.
4753 FIXME: It is conceivable that m->current - (m->origin + m->length)
4754 might overflow a 32-bit integer. There is, alas, no way to print
4755 a bfd_vma quantity in decimal. */
4756 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4757 if (m
->had_full_message
)
4758 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4759 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4763 /* Make sure the new address is within the region. We explicitly permit the
4764 current address to be at the exact end of the region when the address is
4765 non-zero, in case the region is at the end of addressable memory and the
4766 calculation wraps around. */
4769 os_region_check (lang_output_section_statement_type
*os
,
4770 lang_memory_region_type
*region
,
4774 if ((region
->current
< region
->origin
4775 || (region
->current
- region
->origin
> region
->length
))
4776 && ((region
->current
!= region
->origin
+ region
->length
)
4781 einfo (_("%X%P: address 0x%v of %B section `%s'"
4782 " is not within region `%s'\n"),
4784 os
->bfd_section
->owner
,
4785 os
->bfd_section
->name
,
4786 region
->name_list
.name
);
4788 else if (!region
->had_full_message
)
4790 region
->had_full_message
= TRUE
;
4792 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4793 os
->bfd_section
->owner
,
4794 os
->bfd_section
->name
,
4795 region
->name_list
.name
);
4800 /* Set the sizes for all the output sections. */
4803 lang_size_sections_1
4804 (lang_statement_union_type
**prev
,
4805 lang_output_section_statement_type
*output_section_statement
,
4809 bfd_boolean check_regions
)
4811 lang_statement_union_type
*s
;
4813 /* Size up the sections from their constituent parts. */
4814 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4816 switch (s
->header
.type
)
4818 case lang_output_section_statement_enum
:
4820 bfd_vma newdot
, after
;
4821 lang_output_section_statement_type
*os
;
4822 lang_memory_region_type
*r
;
4823 int section_alignment
= 0;
4825 os
= &s
->output_section_statement
;
4826 if (os
->constraint
== -1)
4829 /* FIXME: We shouldn't need to zero section vmas for ld -r
4830 here, in lang_insert_orphan, or in the default linker scripts.
4831 This is covering for coff backend linker bugs. See PR6945. */
4832 if (os
->addr_tree
== NULL
4833 && link_info
.relocatable
4834 && (bfd_get_flavour (link_info
.output_bfd
)
4835 == bfd_target_coff_flavour
))
4836 os
->addr_tree
= exp_intop (0);
4837 if (os
->addr_tree
!= NULL
)
4839 os
->processed_vma
= FALSE
;
4840 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4842 if (expld
.result
.valid_p
)
4844 dot
= expld
.result
.value
;
4845 if (expld
.result
.section
!= NULL
)
4846 dot
+= expld
.result
.section
->vma
;
4848 else if (expld
.phase
!= lang_mark_phase_enum
)
4849 einfo (_("%F%S: non constant or forward reference"
4850 " address expression for section %s\n"),
4851 os
->addr_tree
, os
->name
);
4854 if (os
->bfd_section
== NULL
)
4855 /* This section was removed or never actually created. */
4858 /* If this is a COFF shared library section, use the size and
4859 address from the input section. FIXME: This is COFF
4860 specific; it would be cleaner if there were some other way
4861 to do this, but nothing simple comes to mind. */
4862 if (((bfd_get_flavour (link_info
.output_bfd
)
4863 == bfd_target_ecoff_flavour
)
4864 || (bfd_get_flavour (link_info
.output_bfd
)
4865 == bfd_target_coff_flavour
))
4866 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4870 if (os
->children
.head
== NULL
4871 || os
->children
.head
->header
.next
!= NULL
4872 || (os
->children
.head
->header
.type
4873 != lang_input_section_enum
))
4874 einfo (_("%P%X: Internal error on COFF shared library"
4875 " section %s\n"), os
->name
);
4877 input
= os
->children
.head
->input_section
.section
;
4878 bfd_set_section_vma (os
->bfd_section
->owner
,
4880 bfd_section_vma (input
->owner
, input
));
4881 os
->bfd_section
->size
= input
->size
;
4886 if (bfd_is_abs_section (os
->bfd_section
))
4888 /* No matter what happens, an abs section starts at zero. */
4889 ASSERT (os
->bfd_section
->vma
== 0);
4893 if (os
->addr_tree
== NULL
)
4895 /* No address specified for this section, get one
4896 from the region specification. */
4897 if (os
->region
== NULL
4898 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4899 && os
->region
->name_list
.name
[0] == '*'
4900 && strcmp (os
->region
->name_list
.name
,
4901 DEFAULT_MEMORY_REGION
) == 0))
4903 os
->region
= lang_memory_default (os
->bfd_section
);
4906 /* If a loadable section is using the default memory
4907 region, and some non default memory regions were
4908 defined, issue an error message. */
4910 && !IGNORE_SECTION (os
->bfd_section
)
4911 && ! link_info
.relocatable
4913 && strcmp (os
->region
->name_list
.name
,
4914 DEFAULT_MEMORY_REGION
) == 0
4915 && lang_memory_region_list
!= NULL
4916 && (strcmp (lang_memory_region_list
->name_list
.name
,
4917 DEFAULT_MEMORY_REGION
) != 0
4918 || lang_memory_region_list
->next
!= NULL
)
4919 && expld
.phase
!= lang_mark_phase_enum
)
4921 /* By default this is an error rather than just a
4922 warning because if we allocate the section to the
4923 default memory region we can end up creating an
4924 excessively large binary, or even seg faulting when
4925 attempting to perform a negative seek. See
4926 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4927 for an example of this. This behaviour can be
4928 overridden by the using the --no-check-sections
4930 if (command_line
.check_section_addresses
)
4931 einfo (_("%P%F: error: no memory region specified"
4932 " for loadable section `%s'\n"),
4933 bfd_get_section_name (link_info
.output_bfd
,
4936 einfo (_("%P: warning: no memory region specified"
4937 " for loadable section `%s'\n"),
4938 bfd_get_section_name (link_info
.output_bfd
,
4942 newdot
= os
->region
->current
;
4943 section_alignment
= os
->bfd_section
->alignment_power
;
4946 section_alignment
= os
->section_alignment
;
4948 /* Align to what the section needs. */
4949 if (section_alignment
> 0)
4951 bfd_vma savedot
= newdot
;
4952 newdot
= align_power (newdot
, section_alignment
);
4954 if (newdot
!= savedot
4955 && (config
.warn_section_align
4956 || os
->addr_tree
!= NULL
)
4957 && expld
.phase
!= lang_mark_phase_enum
)
4958 einfo (_("%P: warning: changing start of section"
4959 " %s by %lu bytes\n"),
4960 os
->name
, (unsigned long) (newdot
- savedot
));
4963 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4965 os
->bfd_section
->output_offset
= 0;
4968 lang_size_sections_1 (&os
->children
.head
, os
,
4969 os
->fill
, newdot
, relax
, check_regions
);
4971 os
->processed_vma
= TRUE
;
4973 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4974 /* Except for some special linker created sections,
4975 no output section should change from zero size
4976 after strip_excluded_output_sections. A non-zero
4977 size on an ignored section indicates that some
4978 input section was not sized early enough. */
4979 ASSERT (os
->bfd_section
->size
== 0);
4982 dot
= os
->bfd_section
->vma
;
4984 /* Put the section within the requested block size, or
4985 align at the block boundary. */
4987 + TO_ADDR (os
->bfd_section
->size
)
4988 + os
->block_value
- 1)
4989 & - (bfd_vma
) os
->block_value
);
4991 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4994 /* Set section lma. */
4997 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5001 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5002 os
->bfd_section
->lma
= lma
;
5004 else if (os
->lma_region
!= NULL
)
5006 bfd_vma lma
= os
->lma_region
->current
;
5008 if (section_alignment
> 0)
5009 lma
= align_power (lma
, section_alignment
);
5010 os
->bfd_section
->lma
= lma
;
5012 else if (r
->last_os
!= NULL
5013 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5018 last
= r
->last_os
->output_section_statement
.bfd_section
;
5020 /* A backwards move of dot should be accompanied by
5021 an explicit assignment to the section LMA (ie.
5022 os->load_base set) because backwards moves can
5023 create overlapping LMAs. */
5025 && os
->bfd_section
->size
!= 0
5026 && dot
+ os
->bfd_section
->size
<= last
->vma
)
5028 /* If dot moved backwards then leave lma equal to
5029 vma. This is the old default lma, which might
5030 just happen to work when the backwards move is
5031 sufficiently large. Nag if this changes anything,
5032 so people can fix their linker scripts. */
5034 if (last
->vma
!= last
->lma
)
5035 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5040 /* If this is an overlay, set the current lma to that
5041 at the end of the previous section. */
5042 if (os
->sectype
== overlay_section
)
5043 lma
= last
->lma
+ last
->size
;
5045 /* Otherwise, keep the same lma to vma relationship
5046 as the previous section. */
5048 lma
= dot
+ last
->lma
- last
->vma
;
5050 if (section_alignment
> 0)
5051 lma
= align_power (lma
, section_alignment
);
5052 os
->bfd_section
->lma
= lma
;
5055 os
->processed_lma
= TRUE
;
5057 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5060 /* Keep track of normal sections using the default
5061 lma region. We use this to set the lma for
5062 following sections. Overlays or other linker
5063 script assignment to lma might mean that the
5064 default lma == vma is incorrect.
5065 To avoid warnings about dot moving backwards when using
5066 -Ttext, don't start tracking sections until we find one
5067 of non-zero size or with lma set differently to vma. */
5068 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5069 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5070 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5071 && (os
->bfd_section
->size
!= 0
5072 || (r
->last_os
== NULL
5073 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5074 || (r
->last_os
!= NULL
5075 && dot
>= (r
->last_os
->output_section_statement
5076 .bfd_section
->vma
)))
5077 && os
->lma_region
== NULL
5078 && !link_info
.relocatable
)
5081 /* .tbss sections effectively have zero size. */
5082 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5083 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5084 || link_info
.relocatable
)
5085 dot
+= TO_ADDR (os
->bfd_section
->size
);
5087 if (os
->update_dot_tree
!= 0)
5088 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5090 /* Update dot in the region ?
5091 We only do this if the section is going to be allocated,
5092 since unallocated sections do not contribute to the region's
5093 overall size in memory. */
5094 if (os
->region
!= NULL
5095 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5097 os
->region
->current
= dot
;
5100 /* Make sure the new address is within the region. */
5101 os_region_check (os
, os
->region
, os
->addr_tree
,
5102 os
->bfd_section
->vma
);
5104 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5105 && (os
->bfd_section
->flags
& SEC_LOAD
))
5107 os
->lma_region
->current
5108 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5111 os_region_check (os
, os
->lma_region
, NULL
,
5112 os
->bfd_section
->lma
);
5118 case lang_constructors_statement_enum
:
5119 dot
= lang_size_sections_1 (&constructor_list
.head
,
5120 output_section_statement
,
5121 fill
, dot
, relax
, check_regions
);
5124 case lang_data_statement_enum
:
5126 unsigned int size
= 0;
5128 s
->data_statement
.output_offset
=
5129 dot
- output_section_statement
->bfd_section
->vma
;
5130 s
->data_statement
.output_section
=
5131 output_section_statement
->bfd_section
;
5133 /* We might refer to provided symbols in the expression, and
5134 need to mark them as needed. */
5135 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5137 switch (s
->data_statement
.type
)
5155 if (size
< TO_SIZE ((unsigned) 1))
5156 size
= TO_SIZE ((unsigned) 1);
5157 dot
+= TO_ADDR (size
);
5158 output_section_statement
->bfd_section
->size
+= size
;
5162 case lang_reloc_statement_enum
:
5166 s
->reloc_statement
.output_offset
=
5167 dot
- output_section_statement
->bfd_section
->vma
;
5168 s
->reloc_statement
.output_section
=
5169 output_section_statement
->bfd_section
;
5170 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5171 dot
+= TO_ADDR (size
);
5172 output_section_statement
->bfd_section
->size
+= size
;
5176 case lang_wild_statement_enum
:
5177 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5178 output_section_statement
,
5179 fill
, dot
, relax
, check_regions
);
5182 case lang_object_symbols_statement_enum
:
5183 link_info
.create_object_symbols_section
=
5184 output_section_statement
->bfd_section
;
5187 case lang_output_statement_enum
:
5188 case lang_target_statement_enum
:
5191 case lang_input_section_enum
:
5195 i
= s
->input_section
.section
;
5200 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5201 einfo (_("%P%F: can't relax section: %E\n"));
5205 dot
= size_input_section (prev
, output_section_statement
,
5206 output_section_statement
->fill
, dot
);
5210 case lang_input_statement_enum
:
5213 case lang_fill_statement_enum
:
5214 s
->fill_statement
.output_section
=
5215 output_section_statement
->bfd_section
;
5217 fill
= s
->fill_statement
.fill
;
5220 case lang_assignment_statement_enum
:
5222 bfd_vma newdot
= dot
;
5223 etree_type
*tree
= s
->assignment_statement
.exp
;
5225 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5227 exp_fold_tree (tree
,
5228 output_section_statement
->bfd_section
,
5231 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5233 if (!expld
.dataseg
.relro_start_stat
)
5234 expld
.dataseg
.relro_start_stat
= s
;
5237 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5240 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5242 if (!expld
.dataseg
.relro_end_stat
)
5243 expld
.dataseg
.relro_end_stat
= s
;
5246 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5249 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5251 /* This symbol may be relative to this section. */
5252 if ((tree
->type
.node_class
== etree_provided
5253 || tree
->type
.node_class
== etree_assign
)
5254 && (tree
->assign
.dst
[0] != '.'
5255 || tree
->assign
.dst
[1] != '\0'))
5256 output_section_statement
->update_dot
= 1;
5258 if (!output_section_statement
->ignored
)
5260 if (output_section_statement
== abs_output_section
)
5262 /* If we don't have an output section, then just adjust
5263 the default memory address. */
5264 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5265 FALSE
)->current
= newdot
;
5267 else if (newdot
!= dot
)
5269 /* Insert a pad after this statement. We can't
5270 put the pad before when relaxing, in case the
5271 assignment references dot. */
5272 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5273 output_section_statement
->bfd_section
, dot
);
5275 /* Don't neuter the pad below when relaxing. */
5278 /* If dot is advanced, this implies that the section
5279 should have space allocated to it, unless the
5280 user has explicitly stated that the section
5281 should not be allocated. */
5282 if (output_section_statement
->sectype
!= noalloc_section
5283 && (output_section_statement
->sectype
!= noload_section
5284 || (bfd_get_flavour (link_info
.output_bfd
)
5285 == bfd_target_elf_flavour
)))
5286 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5293 case lang_padding_statement_enum
:
5294 /* If this is the first time lang_size_sections is called,
5295 we won't have any padding statements. If this is the
5296 second or later passes when relaxing, we should allow
5297 padding to shrink. If padding is needed on this pass, it
5298 will be added back in. */
5299 s
->padding_statement
.size
= 0;
5301 /* Make sure output_offset is valid. If relaxation shrinks
5302 the section and this pad isn't needed, it's possible to
5303 have output_offset larger than the final size of the
5304 section. bfd_set_section_contents will complain even for
5305 a pad size of zero. */
5306 s
->padding_statement
.output_offset
5307 = dot
- output_section_statement
->bfd_section
->vma
;
5310 case lang_group_statement_enum
:
5311 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5312 output_section_statement
,
5313 fill
, dot
, relax
, check_regions
);
5316 case lang_insert_statement_enum
:
5319 /* We can only get here when relaxing is turned on. */
5320 case lang_address_statement_enum
:
5327 prev
= &s
->header
.next
;
5332 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5333 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5334 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5335 segments. We are allowed an opportunity to override this decision. */
5338 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5339 bfd
* abfd ATTRIBUTE_UNUSED
,
5340 asection
* current_section
,
5341 asection
* previous_section
,
5342 bfd_boolean new_segment
)
5344 lang_output_section_statement_type
* cur
;
5345 lang_output_section_statement_type
* prev
;
5347 /* The checks below are only necessary when the BFD library has decided
5348 that the two sections ought to be placed into the same segment. */
5352 /* Paranoia checks. */
5353 if (current_section
== NULL
|| previous_section
== NULL
)
5356 /* Find the memory regions associated with the two sections.
5357 We call lang_output_section_find() here rather than scanning the list
5358 of output sections looking for a matching section pointer because if
5359 we have a large number of sections then a hash lookup is faster. */
5360 cur
= lang_output_section_find (current_section
->name
);
5361 prev
= lang_output_section_find (previous_section
->name
);
5363 /* More paranoia. */
5364 if (cur
== NULL
|| prev
== NULL
)
5367 /* If the regions are different then force the sections to live in
5368 different segments. See the email thread starting at the following
5369 URL for the reasons why this is necessary:
5370 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5371 return cur
->region
!= prev
->region
;
5375 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5377 lang_statement_iteration
++;
5378 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5379 0, 0, relax
, check_regions
);
5383 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5385 expld
.phase
= lang_allocating_phase_enum
;
5386 expld
.dataseg
.phase
= exp_dataseg_none
;
5388 one_lang_size_sections_pass (relax
, check_regions
);
5389 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5390 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5392 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5393 to put expld.dataseg.relro on a (common) page boundary. */
5394 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5396 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5397 maxpage
= expld
.dataseg
.maxpagesize
;
5398 /* MIN_BASE is the absolute minimum address we are allowed to start the
5399 read-write segment (byte before will be mapped read-only). */
5400 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5401 /* OLD_BASE is the address for a feasible minimum address which will
5402 still not cause a data overlap inside MAXPAGE causing file offset skip
5404 old_base
= expld
.dataseg
.base
;
5405 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5406 & (expld
.dataseg
.pagesize
- 1));
5407 /* Compute the expected PT_GNU_RELRO segment end. */
5408 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5409 & ~(expld
.dataseg
.pagesize
- 1));
5410 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5412 expld
.dataseg
.base
-= maxpage
;
5413 relro_end
-= maxpage
;
5415 lang_reset_memory_regions ();
5416 one_lang_size_sections_pass (relax
, check_regions
);
5417 if (expld
.dataseg
.relro_end
> relro_end
)
5419 /* The alignment of sections between DATA_SEGMENT_ALIGN
5420 and DATA_SEGMENT_RELRO_END caused huge padding to be
5421 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5422 that the section alignments will fit in. */
5424 unsigned int max_alignment_power
= 0;
5426 /* Find maximum alignment power of sections between
5427 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5428 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5429 if (sec
->vma
>= expld
.dataseg
.base
5430 && sec
->vma
< expld
.dataseg
.relro_end
5431 && sec
->alignment_power
> max_alignment_power
)
5432 max_alignment_power
= sec
->alignment_power
;
5434 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5436 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5437 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5438 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5439 lang_reset_memory_regions ();
5440 one_lang_size_sections_pass (relax
, check_regions
);
5443 link_info
.relro_start
= expld
.dataseg
.base
;
5444 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5446 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5448 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5449 a page could be saved in the data segment. */
5450 bfd_vma first
, last
;
5452 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5453 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5455 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5456 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5457 && first
+ last
<= expld
.dataseg
.pagesize
)
5459 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5460 lang_reset_memory_regions ();
5461 one_lang_size_sections_pass (relax
, check_regions
);
5464 expld
.dataseg
.phase
= exp_dataseg_done
;
5467 expld
.dataseg
.phase
= exp_dataseg_done
;
5470 static lang_output_section_statement_type
*current_section
;
5471 static lang_assignment_statement_type
*current_assign
;
5472 static bfd_boolean prefer_next_section
;
5474 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5477 lang_do_assignments_1 (lang_statement_union_type
*s
,
5478 lang_output_section_statement_type
*current_os
,
5481 bfd_boolean
*found_end
)
5483 for (; s
!= NULL
; s
= s
->header
.next
)
5485 switch (s
->header
.type
)
5487 case lang_constructors_statement_enum
:
5488 dot
= lang_do_assignments_1 (constructor_list
.head
,
5489 current_os
, fill
, dot
, found_end
);
5492 case lang_output_section_statement_enum
:
5494 lang_output_section_statement_type
*os
;
5496 os
= &(s
->output_section_statement
);
5497 os
->after_end
= *found_end
;
5498 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5500 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5502 current_section
= os
;
5503 prefer_next_section
= FALSE
;
5505 dot
= os
->bfd_section
->vma
;
5507 lang_do_assignments_1 (os
->children
.head
,
5508 os
, os
->fill
, dot
, found_end
);
5510 /* .tbss sections effectively have zero size. */
5511 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5512 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5513 || link_info
.relocatable
)
5514 dot
+= TO_ADDR (os
->bfd_section
->size
);
5516 if (os
->update_dot_tree
!= NULL
)
5517 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5522 case lang_wild_statement_enum
:
5524 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5525 current_os
, fill
, dot
, found_end
);
5528 case lang_object_symbols_statement_enum
:
5529 case lang_output_statement_enum
:
5530 case lang_target_statement_enum
:
5533 case lang_data_statement_enum
:
5534 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5535 if (expld
.result
.valid_p
)
5537 s
->data_statement
.value
= expld
.result
.value
;
5538 if (expld
.result
.section
!= NULL
)
5539 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5542 einfo (_("%F%P: invalid data statement\n"));
5545 switch (s
->data_statement
.type
)
5563 if (size
< TO_SIZE ((unsigned) 1))
5564 size
= TO_SIZE ((unsigned) 1);
5565 dot
+= TO_ADDR (size
);
5569 case lang_reloc_statement_enum
:
5570 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5571 bfd_abs_section_ptr
, &dot
);
5572 if (expld
.result
.valid_p
)
5573 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5575 einfo (_("%F%P: invalid reloc statement\n"));
5576 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5579 case lang_input_section_enum
:
5581 asection
*in
= s
->input_section
.section
;
5583 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5584 dot
+= TO_ADDR (in
->size
);
5588 case lang_input_statement_enum
:
5591 case lang_fill_statement_enum
:
5592 fill
= s
->fill_statement
.fill
;
5595 case lang_assignment_statement_enum
:
5596 current_assign
= &s
->assignment_statement
;
5597 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5599 const char *p
= current_assign
->exp
->assign
.dst
;
5601 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5602 prefer_next_section
= TRUE
;
5606 if (strcmp (p
, "end") == 0)
5609 exp_fold_tree (s
->assignment_statement
.exp
,
5610 current_os
->bfd_section
,
5614 case lang_padding_statement_enum
:
5615 dot
+= TO_ADDR (s
->padding_statement
.size
);
5618 case lang_group_statement_enum
:
5619 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5620 current_os
, fill
, dot
, found_end
);
5623 case lang_insert_statement_enum
:
5626 case lang_address_statement_enum
:
5638 lang_do_assignments (lang_phase_type phase
)
5640 bfd_boolean found_end
= FALSE
;
5642 current_section
= NULL
;
5643 prefer_next_section
= FALSE
;
5644 expld
.phase
= phase
;
5645 lang_statement_iteration
++;
5646 lang_do_assignments_1 (statement_list
.head
,
5647 abs_output_section
, NULL
, 0, &found_end
);
5650 /* For an assignment statement outside of an output section statement,
5651 choose the best of neighbouring output sections to use for values
5655 section_for_dot (void)
5659 /* Assignments belong to the previous output section, unless there
5660 has been an assignment to "dot", in which case following
5661 assignments belong to the next output section. (The assumption
5662 is that an assignment to "dot" is setting up the address for the
5663 next output section.) Except that past the assignment to "_end"
5664 we always associate with the previous section. This exception is
5665 for targets like SH that define an alloc .stack or other
5666 weirdness after non-alloc sections. */
5667 if (current_section
== NULL
|| prefer_next_section
)
5669 lang_statement_union_type
*stmt
;
5670 lang_output_section_statement_type
*os
;
5672 for (stmt
= (lang_statement_union_type
*) current_assign
;
5674 stmt
= stmt
->header
.next
)
5675 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5678 os
= &stmt
->output_section_statement
;
5681 && (os
->bfd_section
== NULL
5682 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5683 || bfd_section_removed_from_list (link_info
.output_bfd
,
5687 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5690 s
= os
->bfd_section
;
5692 s
= link_info
.output_bfd
->section_last
;
5694 && ((s
->flags
& SEC_ALLOC
) == 0
5695 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5700 return bfd_abs_section_ptr
;
5704 s
= current_section
->bfd_section
;
5706 /* The section may have been stripped. */
5708 && ((s
->flags
& SEC_EXCLUDE
) != 0
5709 || (s
->flags
& SEC_ALLOC
) == 0
5710 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5711 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5714 s
= link_info
.output_bfd
->sections
;
5716 && ((s
->flags
& SEC_ALLOC
) == 0
5717 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5722 return bfd_abs_section_ptr
;
5725 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5726 operator .startof. (section_name), it produces an undefined symbol
5727 .startof.section_name. Similarly, when it sees
5728 .sizeof. (section_name), it produces an undefined symbol
5729 .sizeof.section_name. For all the output sections, we look for
5730 such symbols, and set them to the correct value. */
5733 lang_set_startof (void)
5737 if (link_info
.relocatable
)
5740 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5742 const char *secname
;
5744 struct bfd_link_hash_entry
*h
;
5746 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5747 buf
= (char *) xmalloc (10 + strlen (secname
));
5749 sprintf (buf
, ".startof.%s", secname
);
5750 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5751 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5753 h
->type
= bfd_link_hash_defined
;
5755 h
->u
.def
.section
= s
;
5758 sprintf (buf
, ".sizeof.%s", secname
);
5759 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5760 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5762 h
->type
= bfd_link_hash_defined
;
5763 h
->u
.def
.value
= TO_ADDR (s
->size
);
5764 h
->u
.def
.section
= bfd_abs_section_ptr
;
5774 struct bfd_link_hash_entry
*h
;
5777 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5778 || (link_info
.shared
&& !link_info
.executable
))
5779 warn
= entry_from_cmdline
;
5783 /* Force the user to specify a root when generating a relocatable with
5785 if (link_info
.gc_sections
&& link_info
.relocatable
5786 && !(entry_from_cmdline
|| undef_from_cmdline
))
5787 einfo (_("%P%F: gc-sections requires either an entry or "
5788 "an undefined symbol\n"));
5790 if (entry_symbol
.name
== NULL
)
5792 /* No entry has been specified. Look for the default entry, but
5793 don't warn if we don't find it. */
5794 entry_symbol
.name
= entry_symbol_default
;
5798 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5799 FALSE
, FALSE
, TRUE
);
5801 && (h
->type
== bfd_link_hash_defined
5802 || h
->type
== bfd_link_hash_defweak
)
5803 && h
->u
.def
.section
->output_section
!= NULL
)
5807 val
= (h
->u
.def
.value
5808 + bfd_get_section_vma (link_info
.output_bfd
,
5809 h
->u
.def
.section
->output_section
)
5810 + h
->u
.def
.section
->output_offset
);
5811 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5812 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5819 /* We couldn't find the entry symbol. Try parsing it as a
5821 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5824 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5825 einfo (_("%P%F: can't set start address\n"));
5831 /* Can't find the entry symbol, and it's not a number. Use
5832 the first address in the text section. */
5833 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5837 einfo (_("%P: warning: cannot find entry symbol %s;"
5838 " defaulting to %V\n"),
5840 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5841 if (!(bfd_set_start_address
5842 (link_info
.output_bfd
,
5843 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5844 einfo (_("%P%F: can't set start address\n"));
5849 einfo (_("%P: warning: cannot find entry symbol %s;"
5850 " not setting start address\n"),
5856 /* Don't bfd_hash_table_free (&lang_definedness_table);
5857 map file output may result in a call of lang_track_definedness. */
5860 /* This is a small function used when we want to ignore errors from
5864 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5866 /* Don't do anything. */
5869 /* Check that the architecture of all the input files is compatible
5870 with the output file. Also call the backend to let it do any
5871 other checking that is needed. */
5876 lang_statement_union_type
*file
;
5878 const bfd_arch_info_type
*compatible
;
5880 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5882 #ifdef ENABLE_PLUGINS
5883 /* Don't check format of files claimed by plugin. */
5884 if (file
->input_statement
.flags
.claimed
)
5886 #endif /* ENABLE_PLUGINS */
5887 input_bfd
= file
->input_statement
.the_bfd
;
5889 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5890 command_line
.accept_unknown_input_arch
);
5892 /* In general it is not possible to perform a relocatable
5893 link between differing object formats when the input
5894 file has relocations, because the relocations in the
5895 input format may not have equivalent representations in
5896 the output format (and besides BFD does not translate
5897 relocs for other link purposes than a final link). */
5898 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5899 && (compatible
== NULL
5900 || (bfd_get_flavour (input_bfd
)
5901 != bfd_get_flavour (link_info
.output_bfd
)))
5902 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5904 einfo (_("%P%F: Relocatable linking with relocations from"
5905 " format %s (%B) to format %s (%B) is not supported\n"),
5906 bfd_get_target (input_bfd
), input_bfd
,
5907 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5908 /* einfo with %F exits. */
5911 if (compatible
== NULL
)
5913 if (command_line
.warn_mismatch
)
5914 einfo (_("%P%X: %s architecture of input file `%B'"
5915 " is incompatible with %s output\n"),
5916 bfd_printable_name (input_bfd
), input_bfd
,
5917 bfd_printable_name (link_info
.output_bfd
));
5919 else if (bfd_count_sections (input_bfd
))
5921 /* If the input bfd has no contents, it shouldn't set the
5922 private data of the output bfd. */
5924 bfd_error_handler_type pfn
= NULL
;
5926 /* If we aren't supposed to warn about mismatched input
5927 files, temporarily set the BFD error handler to a
5928 function which will do nothing. We still want to call
5929 bfd_merge_private_bfd_data, since it may set up
5930 information which is needed in the output file. */
5931 if (! command_line
.warn_mismatch
)
5932 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5933 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5935 if (command_line
.warn_mismatch
)
5936 einfo (_("%P%X: failed to merge target specific data"
5937 " of file %B\n"), input_bfd
);
5939 if (! command_line
.warn_mismatch
)
5940 bfd_set_error_handler (pfn
);
5945 /* Look through all the global common symbols and attach them to the
5946 correct section. The -sort-common command line switch may be used
5947 to roughly sort the entries by alignment. */
5952 if (command_line
.inhibit_common_definition
)
5954 if (link_info
.relocatable
5955 && ! command_line
.force_common_definition
)
5958 if (! config
.sort_common
)
5959 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5964 if (config
.sort_common
== sort_descending
)
5966 for (power
= 4; power
> 0; power
--)
5967 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5970 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5974 for (power
= 0; power
<= 4; power
++)
5975 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5978 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5983 /* Place one common symbol in the correct section. */
5986 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5988 unsigned int power_of_two
;
5992 if (h
->type
!= bfd_link_hash_common
)
5996 power_of_two
= h
->u
.c
.p
->alignment_power
;
5998 if (config
.sort_common
== sort_descending
5999 && power_of_two
< *(unsigned int *) info
)
6001 else if (config
.sort_common
== sort_ascending
6002 && power_of_two
> *(unsigned int *) info
)
6005 section
= h
->u
.c
.p
->section
;
6006 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6007 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6010 if (config
.map_file
!= NULL
)
6012 static bfd_boolean header_printed
;
6017 if (! header_printed
)
6019 minfo (_("\nAllocating common symbols\n"));
6020 minfo (_("Common symbol size file\n\n"));
6021 header_printed
= TRUE
;
6024 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6025 DMGL_ANSI
| DMGL_PARAMS
);
6028 minfo ("%s", h
->root
.string
);
6029 len
= strlen (h
->root
.string
);
6034 len
= strlen (name
);
6050 if (size
<= 0xffffffff)
6051 sprintf (buf
, "%lx", (unsigned long) size
);
6053 sprintf_vma (buf
, size
);
6063 minfo ("%B\n", section
->owner
);
6069 /* Run through the input files and ensure that every input section has
6070 somewhere to go. If one is found without a destination then create
6071 an input request and place it into the statement tree. */
6074 lang_place_orphans (void)
6076 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6080 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6082 if (s
->output_section
== NULL
)
6084 /* This section of the file is not attached, root
6085 around for a sensible place for it to go. */
6087 if (file
->flags
.just_syms
)
6088 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6089 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
6090 s
->output_section
= bfd_abs_section_ptr
;
6091 else if (strcmp (s
->name
, "COMMON") == 0)
6093 /* This is a lonely common section which must have
6094 come from an archive. We attach to the section
6095 with the wildcard. */
6096 if (! link_info
.relocatable
6097 || command_line
.force_common_definition
)
6099 if (default_common_section
== NULL
)
6100 default_common_section
6101 = lang_output_section_statement_lookup (".bss", 0,
6103 lang_add_section (&default_common_section
->children
, s
,
6104 NULL
, default_common_section
);
6109 const char *name
= s
->name
;
6112 if (config
.unique_orphan_sections
6113 || unique_section_p (s
, NULL
))
6114 constraint
= SPECIAL
;
6116 if (!ldemul_place_orphan (s
, name
, constraint
))
6118 lang_output_section_statement_type
*os
;
6119 os
= lang_output_section_statement_lookup (name
,
6122 if (os
->addr_tree
== NULL
6123 && (link_info
.relocatable
6124 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6125 os
->addr_tree
= exp_intop (0);
6126 lang_add_section (&os
->children
, s
, NULL
, os
);
6135 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6137 flagword
*ptr_flags
;
6139 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6145 *ptr_flags
|= SEC_ALLOC
;
6149 *ptr_flags
|= SEC_READONLY
;
6153 *ptr_flags
|= SEC_DATA
;
6157 *ptr_flags
|= SEC_CODE
;
6162 *ptr_flags
|= SEC_LOAD
;
6166 einfo (_("%P%F: invalid syntax in flags\n"));
6173 /* Call a function on each input file. This function will be called
6174 on an archive, but not on the elements. */
6177 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6179 lang_input_statement_type
*f
;
6181 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6183 f
= (lang_input_statement_type
*) f
->next_real_file
)
6187 /* Call a function on each file. The function will be called on all
6188 the elements of an archive which are included in the link, but will
6189 not be called on the archive file itself. */
6192 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6194 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6201 ldlang_add_file (lang_input_statement_type
*entry
)
6203 lang_statement_append (&file_chain
,
6204 (lang_statement_union_type
*) entry
,
6207 /* The BFD linker needs to have a list of all input BFDs involved in
6209 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6210 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6212 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6213 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6214 entry
->the_bfd
->usrdata
= entry
;
6215 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6217 /* Look through the sections and check for any which should not be
6218 included in the link. We need to do this now, so that we can
6219 notice when the backend linker tries to report multiple
6220 definition errors for symbols which are in sections we aren't
6221 going to link. FIXME: It might be better to entirely ignore
6222 symbols which are defined in sections which are going to be
6223 discarded. This would require modifying the backend linker for
6224 each backend which might set the SEC_LINK_ONCE flag. If we do
6225 this, we should probably handle SEC_EXCLUDE in the same way. */
6227 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6231 lang_add_output (const char *name
, int from_script
)
6233 /* Make -o on command line override OUTPUT in script. */
6234 if (!had_output_filename
|| !from_script
)
6236 output_filename
= name
;
6237 had_output_filename
= TRUE
;
6250 for (l
= 0; l
< 32; l
++)
6252 if (i
>= (unsigned int) x
)
6260 lang_output_section_statement_type
*
6261 lang_enter_output_section_statement (const char *output_section_statement_name
,
6262 etree_type
*address_exp
,
6263 enum section_type sectype
,
6265 etree_type
*subalign
,
6269 lang_output_section_statement_type
*os
;
6271 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6273 current_section
= os
;
6275 if (os
->addr_tree
== NULL
)
6277 os
->addr_tree
= address_exp
;
6279 os
->sectype
= sectype
;
6280 if (sectype
!= noload_section
)
6281 os
->flags
= SEC_NO_FLAGS
;
6283 os
->flags
= SEC_NEVER_LOAD
;
6284 os
->block_value
= 1;
6286 /* Make next things chain into subchain of this. */
6287 push_stat_ptr (&os
->children
);
6289 os
->subsection_alignment
=
6290 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6291 os
->section_alignment
=
6292 topower (exp_get_value_int (align
, -1, "section alignment"));
6294 os
->load_base
= ebase
;
6301 lang_output_statement_type
*new_stmt
;
6303 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6304 new_stmt
->name
= output_filename
;
6308 /* Reset the current counters in the regions. */
6311 lang_reset_memory_regions (void)
6313 lang_memory_region_type
*p
= lang_memory_region_list
;
6315 lang_output_section_statement_type
*os
;
6317 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6319 p
->current
= p
->origin
;
6323 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6327 os
->processed_vma
= FALSE
;
6328 os
->processed_lma
= FALSE
;
6331 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6333 /* Save the last size for possible use by bfd_relax_section. */
6334 o
->rawsize
= o
->size
;
6339 /* Worker for lang_gc_sections_1. */
6342 gc_section_callback (lang_wild_statement_type
*ptr
,
6343 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6345 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6346 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6347 void *data ATTRIBUTE_UNUSED
)
6349 /* If the wild pattern was marked KEEP, the member sections
6350 should be as well. */
6351 if (ptr
->keep_sections
)
6352 section
->flags
|= SEC_KEEP
;
6355 /* Iterate over sections marking them against GC. */
6358 lang_gc_sections_1 (lang_statement_union_type
*s
)
6360 for (; s
!= NULL
; s
= s
->header
.next
)
6362 switch (s
->header
.type
)
6364 case lang_wild_statement_enum
:
6365 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6367 case lang_constructors_statement_enum
:
6368 lang_gc_sections_1 (constructor_list
.head
);
6370 case lang_output_section_statement_enum
:
6371 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6373 case lang_group_statement_enum
:
6374 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6383 lang_gc_sections (void)
6385 /* Keep all sections so marked in the link script. */
6387 lang_gc_sections_1 (statement_list
.head
);
6389 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6390 the special case of debug info. (See bfd/stabs.c)
6391 Twiddle the flag here, to simplify later linker code. */
6392 if (link_info
.relocatable
)
6394 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6397 #ifdef ENABLE_PLUGINS
6398 if (f
->flags
.claimed
)
6401 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6402 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6403 sec
->flags
&= ~SEC_EXCLUDE
;
6407 if (link_info
.gc_sections
)
6408 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6411 /* Worker for lang_find_relro_sections_1. */
6414 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6415 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6417 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6418 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6421 /* Discarded, excluded and ignored sections effectively have zero
6423 if (section
->output_section
!= NULL
6424 && section
->output_section
->owner
== link_info
.output_bfd
6425 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6426 && !IGNORE_SECTION (section
)
6427 && section
->size
!= 0)
6429 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6430 *has_relro_section
= TRUE
;
6434 /* Iterate over sections for relro sections. */
6437 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6438 bfd_boolean
*has_relro_section
)
6440 if (*has_relro_section
)
6443 for (; s
!= NULL
; s
= s
->header
.next
)
6445 if (s
== expld
.dataseg
.relro_end_stat
)
6448 switch (s
->header
.type
)
6450 case lang_wild_statement_enum
:
6451 walk_wild (&s
->wild_statement
,
6452 find_relro_section_callback
,
6455 case lang_constructors_statement_enum
:
6456 lang_find_relro_sections_1 (constructor_list
.head
,
6459 case lang_output_section_statement_enum
:
6460 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6463 case lang_group_statement_enum
:
6464 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6474 lang_find_relro_sections (void)
6476 bfd_boolean has_relro_section
= FALSE
;
6478 /* Check all sections in the link script. */
6480 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6481 &has_relro_section
);
6483 if (!has_relro_section
)
6484 link_info
.relro
= FALSE
;
6487 /* Relax all sections until bfd_relax_section gives up. */
6490 lang_relax_sections (bfd_boolean need_layout
)
6492 if (RELAXATION_ENABLED
)
6494 /* We may need more than one relaxation pass. */
6495 int i
= link_info
.relax_pass
;
6497 /* The backend can use it to determine the current pass. */
6498 link_info
.relax_pass
= 0;
6502 /* Keep relaxing until bfd_relax_section gives up. */
6503 bfd_boolean relax_again
;
6505 link_info
.relax_trip
= -1;
6508 link_info
.relax_trip
++;
6510 /* Note: pe-dll.c does something like this also. If you find
6511 you need to change this code, you probably need to change
6512 pe-dll.c also. DJ */
6514 /* Do all the assignments with our current guesses as to
6516 lang_do_assignments (lang_assigning_phase_enum
);
6518 /* We must do this after lang_do_assignments, because it uses
6520 lang_reset_memory_regions ();
6522 /* Perform another relax pass - this time we know where the
6523 globals are, so can make a better guess. */
6524 relax_again
= FALSE
;
6525 lang_size_sections (&relax_again
, FALSE
);
6527 while (relax_again
);
6529 link_info
.relax_pass
++;
6536 /* Final extra sizing to report errors. */
6537 lang_do_assignments (lang_assigning_phase_enum
);
6538 lang_reset_memory_regions ();
6539 lang_size_sections (NULL
, TRUE
);
6543 #ifdef ENABLE_PLUGINS
6544 /* Find the insert point for the plugin's replacement files. We
6545 place them after the first claimed real object file, or if the
6546 first claimed object is an archive member, after the last real
6547 object file immediately preceding the archive. In the event
6548 no objects have been claimed at all, we return the first dummy
6549 object file on the list as the insert point; that works, but
6550 the callee must be careful when relinking the file_chain as it
6551 is not actually on that chain, only the statement_list and the
6552 input_file list; in that case, the replacement files must be
6553 inserted at the head of the file_chain. */
6555 static lang_input_statement_type
*
6556 find_replacements_insert_point (void)
6558 lang_input_statement_type
*claim1
, *lastobject
;
6559 lastobject
= &input_file_chain
.head
->input_statement
;
6560 for (claim1
= &file_chain
.head
->input_statement
;
6562 claim1
= &claim1
->next
->input_statement
)
6564 if (claim1
->flags
.claimed
)
6565 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6566 /* Update lastobject if this is a real object file. */
6567 if (claim1
->the_bfd
&& (claim1
->the_bfd
->my_archive
== NULL
))
6568 lastobject
= claim1
;
6570 /* No files were claimed by the plugin. Choose the last object
6571 file found on the list (maybe the first, dummy entry) as the
6576 /* Insert SRCLIST into DESTLIST after given element by chaining
6577 on FIELD as the next-pointer. (Counterintuitively does not need
6578 a pointer to the actual after-node itself, just its chain field.) */
6581 lang_list_insert_after (lang_statement_list_type
*destlist
,
6582 lang_statement_list_type
*srclist
,
6583 lang_statement_union_type
**field
)
6585 *(srclist
->tail
) = *field
;
6586 *field
= srclist
->head
;
6587 if (destlist
->tail
== field
)
6588 destlist
->tail
= srclist
->tail
;
6591 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6592 was taken as a copy of it and leave them in ORIGLIST. */
6595 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6596 lang_statement_list_type
*origlist
)
6598 union lang_statement_union
**savetail
;
6599 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6600 ASSERT (origlist
->head
== destlist
->head
);
6601 savetail
= origlist
->tail
;
6602 origlist
->head
= *(savetail
);
6603 origlist
->tail
= destlist
->tail
;
6604 destlist
->tail
= savetail
;
6607 #endif /* ENABLE_PLUGINS */
6612 /* Finalize dynamic list. */
6613 if (link_info
.dynamic_list
)
6614 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6616 current_target
= default_target
;
6618 /* Open the output file. */
6619 lang_for_each_statement (ldlang_open_output
);
6622 ldemul_create_output_section_statements ();
6624 /* Add to the hash table all undefineds on the command line. */
6625 lang_place_undefineds ();
6627 if (!bfd_section_already_linked_table_init ())
6628 einfo (_("%P%F: Failed to create hash table\n"));
6630 /* Create a bfd for each input file. */
6631 current_target
= default_target
;
6632 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6634 #ifdef ENABLE_PLUGINS
6635 if (plugin_active_plugins_p ())
6637 lang_statement_list_type added
;
6638 lang_statement_list_type files
, inputfiles
;
6640 /* Now all files are read, let the plugin(s) decide if there
6641 are any more to be added to the link before we call the
6642 emulation's after_open hook. We create a private list of
6643 input statements for this purpose, which we will eventually
6644 insert into the global statment list after the first claimed
6647 /* We need to manipulate all three chains in synchrony. */
6649 inputfiles
= input_file_chain
;
6650 if (plugin_call_all_symbols_read ())
6651 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6652 plugin_error_plugin ());
6653 /* Open any newly added files, updating the file chains. */
6654 link_info
.loading_lto_outputs
= TRUE
;
6655 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6656 /* Restore the global list pointer now they have all been added. */
6657 lang_list_remove_tail (stat_ptr
, &added
);
6658 /* And detach the fresh ends of the file lists. */
6659 lang_list_remove_tail (&file_chain
, &files
);
6660 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6661 /* Were any new files added? */
6662 if (added
.head
!= NULL
)
6664 /* If so, we will insert them into the statement list immediately
6665 after the first input file that was claimed by the plugin. */
6666 plugin_insert
= find_replacements_insert_point ();
6667 /* If a plugin adds input files without having claimed any, we
6668 don't really have a good idea where to place them. Just putting
6669 them at the start or end of the list is liable to leave them
6670 outside the crtbegin...crtend range. */
6671 ASSERT (plugin_insert
!= NULL
);
6672 /* Splice the new statement list into the old one. */
6673 lang_list_insert_after (stat_ptr
, &added
,
6674 &plugin_insert
->header
.next
);
6675 /* Likewise for the file chains. */
6676 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6677 &plugin_insert
->next_real_file
);
6678 /* We must be careful when relinking file_chain; we may need to
6679 insert the new files at the head of the list if the insert
6680 point chosen is the dummy first input file. */
6681 if (plugin_insert
->filename
)
6682 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6684 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6686 /* Rescan archives in case new undefined symbols have appeared. */
6687 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6690 #endif /* ENABLE_PLUGINS */
6692 link_info
.gc_sym_list
= &entry_symbol
;
6693 if (entry_symbol
.name
== NULL
)
6694 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6696 ldemul_after_open ();
6698 bfd_section_already_linked_table_free ();
6700 /* Make sure that we're not mixing architectures. We call this
6701 after all the input files have been opened, but before we do any
6702 other processing, so that any operations merge_private_bfd_data
6703 does on the output file will be known during the rest of the
6707 /* Handle .exports instead of a version script if we're told to do so. */
6708 if (command_line
.version_exports_section
)
6709 lang_do_version_exports_section ();
6711 /* Build all sets based on the information gathered from the input
6713 ldctor_build_sets ();
6715 /* PR 13683: We must rerun the assignments prior to running garbage
6716 collection in order to make sure that all symbol aliases are resolved. */
6717 lang_do_assignments (lang_mark_phase_enum
);
6718 expld
.phase
= lang_first_phase_enum
;
6720 /* Remove unreferenced sections if asked to. */
6721 lang_gc_sections ();
6723 /* Size up the common data. */
6726 /* Update wild statements. */
6727 update_wild_statements (statement_list
.head
);
6729 /* Run through the contours of the script and attach input sections
6730 to the correct output sections. */
6731 lang_statement_iteration
++;
6732 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6734 process_insert_statements ();
6736 /* Find any sections not attached explicitly and handle them. */
6737 lang_place_orphans ();
6739 if (! link_info
.relocatable
)
6743 /* Merge SEC_MERGE sections. This has to be done after GC of
6744 sections, so that GCed sections are not merged, but before
6745 assigning dynamic symbols, since removing whole input sections
6747 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6749 /* Look for a text section and set the readonly attribute in it. */
6750 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6754 if (config
.text_read_only
)
6755 found
->flags
|= SEC_READONLY
;
6757 found
->flags
&= ~SEC_READONLY
;
6761 /* Do anything special before sizing sections. This is where ELF
6762 and other back-ends size dynamic sections. */
6763 ldemul_before_allocation ();
6765 /* We must record the program headers before we try to fix the
6766 section positions, since they will affect SIZEOF_HEADERS. */
6767 lang_record_phdrs ();
6769 /* Check relro sections. */
6770 if (link_info
.relro
&& ! link_info
.relocatable
)
6771 lang_find_relro_sections ();
6773 /* Size up the sections. */
6774 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6776 /* See if anything special should be done now we know how big
6777 everything is. This is where relaxation is done. */
6778 ldemul_after_allocation ();
6780 /* Fix any .startof. or .sizeof. symbols. */
6781 lang_set_startof ();
6783 /* Do all the assignments, now that we know the final resting places
6784 of all the symbols. */
6785 lang_do_assignments (lang_final_phase_enum
);
6789 /* Make sure that the section addresses make sense. */
6790 if (command_line
.check_section_addresses
)
6791 lang_check_section_addresses ();
6796 /* EXPORTED TO YACC */
6799 lang_add_wild (struct wildcard_spec
*filespec
,
6800 struct wildcard_list
*section_list
,
6801 bfd_boolean keep_sections
)
6803 struct wildcard_list
*curr
, *next
;
6804 lang_wild_statement_type
*new_stmt
;
6806 /* Reverse the list as the parser puts it back to front. */
6807 for (curr
= section_list
, section_list
= NULL
;
6809 section_list
= curr
, curr
= next
)
6811 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6812 placed_commons
= TRUE
;
6815 curr
->next
= section_list
;
6818 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6820 if (strcmp (filespec
->name
, "*") == 0)
6821 filespec
->name
= NULL
;
6822 else if (! wildcardp (filespec
->name
))
6823 lang_has_input_file
= TRUE
;
6826 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6827 new_stmt
->filename
= NULL
;
6828 new_stmt
->filenames_sorted
= FALSE
;
6829 new_stmt
->section_flag_list
= NULL
;
6830 if (filespec
!= NULL
)
6832 new_stmt
->filename
= filespec
->name
;
6833 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6834 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
6836 new_stmt
->section_list
= section_list
;
6837 new_stmt
->keep_sections
= keep_sections
;
6838 lang_list_init (&new_stmt
->children
);
6839 analyze_walk_wild_section_handler (new_stmt
);
6843 lang_section_start (const char *name
, etree_type
*address
,
6844 const segment_type
*segment
)
6846 lang_address_statement_type
*ad
;
6848 ad
= new_stat (lang_address_statement
, stat_ptr
);
6849 ad
->section_name
= name
;
6850 ad
->address
= address
;
6851 ad
->segment
= segment
;
6854 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6855 because of a -e argument on the command line, or zero if this is
6856 called by ENTRY in a linker script. Command line arguments take
6860 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6862 if (entry_symbol
.name
== NULL
6864 || ! entry_from_cmdline
)
6866 entry_symbol
.name
= name
;
6867 entry_from_cmdline
= cmdline
;
6871 /* Set the default start symbol to NAME. .em files should use this,
6872 not lang_add_entry, to override the use of "start" if neither the
6873 linker script nor the command line specifies an entry point. NAME
6874 must be permanently allocated. */
6876 lang_default_entry (const char *name
)
6878 entry_symbol_default
= name
;
6882 lang_add_target (const char *name
)
6884 lang_target_statement_type
*new_stmt
;
6886 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6887 new_stmt
->target
= name
;
6891 lang_add_map (const char *name
)
6898 map_option_f
= TRUE
;
6906 lang_add_fill (fill_type
*fill
)
6908 lang_fill_statement_type
*new_stmt
;
6910 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6911 new_stmt
->fill
= fill
;
6915 lang_add_data (int type
, union etree_union
*exp
)
6917 lang_data_statement_type
*new_stmt
;
6919 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6920 new_stmt
->exp
= exp
;
6921 new_stmt
->type
= type
;
6924 /* Create a new reloc statement. RELOC is the BFD relocation type to
6925 generate. HOWTO is the corresponding howto structure (we could
6926 look this up, but the caller has already done so). SECTION is the
6927 section to generate a reloc against, or NAME is the name of the
6928 symbol to generate a reloc against. Exactly one of SECTION and
6929 NAME must be NULL. ADDEND is an expression for the addend. */
6932 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6933 reloc_howto_type
*howto
,
6936 union etree_union
*addend
)
6938 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6942 p
->section
= section
;
6944 p
->addend_exp
= addend
;
6946 p
->addend_value
= 0;
6947 p
->output_section
= NULL
;
6948 p
->output_offset
= 0;
6951 lang_assignment_statement_type
*
6952 lang_add_assignment (etree_type
*exp
)
6954 lang_assignment_statement_type
*new_stmt
;
6956 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6957 new_stmt
->exp
= exp
;
6962 lang_add_attribute (enum statement_enum attribute
)
6964 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6968 lang_startup (const char *name
)
6970 if (first_file
->filename
!= NULL
)
6972 einfo (_("%P%F: multiple STARTUP files\n"));
6974 first_file
->filename
= name
;
6975 first_file
->local_sym_name
= name
;
6976 first_file
->flags
.real
= TRUE
;
6980 lang_float (bfd_boolean maybe
)
6982 lang_float_flag
= maybe
;
6986 /* Work out the load- and run-time regions from a script statement, and
6987 store them in *LMA_REGION and *REGION respectively.
6989 MEMSPEC is the name of the run-time region, or the value of
6990 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6991 LMA_MEMSPEC is the name of the load-time region, or null if the
6992 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6993 had an explicit load address.
6995 It is an error to specify both a load region and a load address. */
6998 lang_get_regions (lang_memory_region_type
**region
,
6999 lang_memory_region_type
**lma_region
,
7000 const char *memspec
,
7001 const char *lma_memspec
,
7002 bfd_boolean have_lma
,
7003 bfd_boolean have_vma
)
7005 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7007 /* If no runtime region or VMA has been specified, but the load region
7008 has been specified, then use the load region for the runtime region
7010 if (lma_memspec
!= NULL
7012 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7013 *region
= *lma_region
;
7015 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7017 if (have_lma
&& lma_memspec
!= 0)
7018 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7023 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7024 lang_output_section_phdr_list
*phdrs
,
7025 const char *lma_memspec
)
7027 lang_get_regions (¤t_section
->region
,
7028 ¤t_section
->lma_region
,
7029 memspec
, lma_memspec
,
7030 current_section
->load_base
!= NULL
,
7031 current_section
->addr_tree
!= NULL
);
7033 /* If this section has no load region or base, but uses the same
7034 region as the previous section, then propagate the previous
7035 section's load region. */
7037 if (current_section
->lma_region
== NULL
7038 && current_section
->load_base
== NULL
7039 && current_section
->addr_tree
== NULL
7040 && current_section
->region
== current_section
->prev
->region
)
7041 current_section
->lma_region
= current_section
->prev
->lma_region
;
7043 current_section
->fill
= fill
;
7044 current_section
->phdrs
= phdrs
;
7049 lang_statement_append (lang_statement_list_type
*list
,
7050 lang_statement_union_type
*element
,
7051 lang_statement_union_type
**field
)
7053 *(list
->tail
) = element
;
7057 /* Set the output format type. -oformat overrides scripts. */
7060 lang_add_output_format (const char *format
,
7065 if (output_target
== NULL
|| !from_script
)
7067 if (command_line
.endian
== ENDIAN_BIG
7070 else if (command_line
.endian
== ENDIAN_LITTLE
7074 output_target
= format
;
7079 lang_add_insert (const char *where
, int is_before
)
7081 lang_insert_statement_type
*new_stmt
;
7083 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7084 new_stmt
->where
= where
;
7085 new_stmt
->is_before
= is_before
;
7086 saved_script_handle
= previous_script_handle
;
7089 /* Enter a group. This creates a new lang_group_statement, and sets
7090 stat_ptr to build new statements within the group. */
7093 lang_enter_group (void)
7095 lang_group_statement_type
*g
;
7097 g
= new_stat (lang_group_statement
, stat_ptr
);
7098 lang_list_init (&g
->children
);
7099 push_stat_ptr (&g
->children
);
7102 /* Leave a group. This just resets stat_ptr to start writing to the
7103 regular list of statements again. Note that this will not work if
7104 groups can occur inside anything else which can adjust stat_ptr,
7105 but currently they can't. */
7108 lang_leave_group (void)
7113 /* Add a new program header. This is called for each entry in a PHDRS
7114 command in a linker script. */
7117 lang_new_phdr (const char *name
,
7119 bfd_boolean filehdr
,
7124 struct lang_phdr
*n
, **pp
;
7127 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7130 n
->type
= exp_get_value_int (type
, 0, "program header type");
7131 n
->filehdr
= filehdr
;
7136 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7138 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7141 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7143 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7144 " when prior PT_LOAD headers lack them\n"), NULL
);
7151 /* Record the program header information in the output BFD. FIXME: We
7152 should not be calling an ELF specific function here. */
7155 lang_record_phdrs (void)
7159 lang_output_section_phdr_list
*last
;
7160 struct lang_phdr
*l
;
7161 lang_output_section_statement_type
*os
;
7164 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7167 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7174 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7178 lang_output_section_phdr_list
*pl
;
7180 if (os
->constraint
< 0)
7188 if (os
->sectype
== noload_section
7189 || os
->bfd_section
== NULL
7190 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7193 /* Don't add orphans to PT_INTERP header. */
7199 lang_output_section_statement_type
* tmp_os
;
7201 /* If we have not run across a section with a program
7202 header assigned to it yet, then scan forwards to find
7203 one. This prevents inconsistencies in the linker's
7204 behaviour when a script has specified just a single
7205 header and there are sections in that script which are
7206 not assigned to it, and which occur before the first
7207 use of that header. See here for more details:
7208 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7209 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7212 last
= tmp_os
->phdrs
;
7216 einfo (_("%F%P: no sections assigned to phdrs\n"));
7221 if (os
->bfd_section
== NULL
)
7224 for (; pl
!= NULL
; pl
= pl
->next
)
7226 if (strcmp (pl
->name
, l
->name
) == 0)
7231 secs
= (asection
**) xrealloc (secs
,
7232 alc
* sizeof (asection
*));
7234 secs
[c
] = os
->bfd_section
;
7241 if (l
->flags
== NULL
)
7244 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7249 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7251 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7252 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7253 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7254 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7259 /* Make sure all the phdr assignments succeeded. */
7260 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7264 lang_output_section_phdr_list
*pl
;
7266 if (os
->constraint
< 0
7267 || os
->bfd_section
== NULL
)
7270 for (pl
= os
->phdrs
;
7273 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7274 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7275 os
->name
, pl
->name
);
7279 /* Record a list of sections which may not be cross referenced. */
7282 lang_add_nocrossref (lang_nocrossref_type
*l
)
7284 struct lang_nocrossrefs
*n
;
7286 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7287 n
->next
= nocrossref_list
;
7289 nocrossref_list
= n
;
7291 /* Set notice_all so that we get informed about all symbols. */
7292 link_info
.notice_all
= TRUE
;
7295 /* Overlay handling. We handle overlays with some static variables. */
7297 /* The overlay virtual address. */
7298 static etree_type
*overlay_vma
;
7299 /* And subsection alignment. */
7300 static etree_type
*overlay_subalign
;
7302 /* An expression for the maximum section size seen so far. */
7303 static etree_type
*overlay_max
;
7305 /* A list of all the sections in this overlay. */
7307 struct overlay_list
{
7308 struct overlay_list
*next
;
7309 lang_output_section_statement_type
*os
;
7312 static struct overlay_list
*overlay_list
;
7314 /* Start handling an overlay. */
7317 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7319 /* The grammar should prevent nested overlays from occurring. */
7320 ASSERT (overlay_vma
== NULL
7321 && overlay_subalign
== NULL
7322 && overlay_max
== NULL
);
7324 overlay_vma
= vma_expr
;
7325 overlay_subalign
= subalign
;
7328 /* Start a section in an overlay. We handle this by calling
7329 lang_enter_output_section_statement with the correct VMA.
7330 lang_leave_overlay sets up the LMA and memory regions. */
7333 lang_enter_overlay_section (const char *name
)
7335 struct overlay_list
*n
;
7338 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7339 0, overlay_subalign
, 0, 0);
7341 /* If this is the first section, then base the VMA of future
7342 sections on this one. This will work correctly even if `.' is
7343 used in the addresses. */
7344 if (overlay_list
== NULL
)
7345 overlay_vma
= exp_nameop (ADDR
, name
);
7347 /* Remember the section. */
7348 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7349 n
->os
= current_section
;
7350 n
->next
= overlay_list
;
7353 size
= exp_nameop (SIZEOF
, name
);
7355 /* Arrange to work out the maximum section end address. */
7356 if (overlay_max
== NULL
)
7359 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7362 /* Finish a section in an overlay. There isn't any special to do
7366 lang_leave_overlay_section (fill_type
*fill
,
7367 lang_output_section_phdr_list
*phdrs
)
7374 name
= current_section
->name
;
7376 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7377 region and that no load-time region has been specified. It doesn't
7378 really matter what we say here, since lang_leave_overlay will
7380 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7382 /* Define the magic symbols. */
7384 clean
= (char *) xmalloc (strlen (name
) + 1);
7386 for (s1
= name
; *s1
!= '\0'; s1
++)
7387 if (ISALNUM (*s1
) || *s1
== '_')
7391 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7392 sprintf (buf
, "__load_start_%s", clean
);
7393 lang_add_assignment (exp_provide (buf
,
7394 exp_nameop (LOADADDR
, name
),
7397 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7398 sprintf (buf
, "__load_stop_%s", clean
);
7399 lang_add_assignment (exp_provide (buf
,
7401 exp_nameop (LOADADDR
, name
),
7402 exp_nameop (SIZEOF
, name
)),
7408 /* Finish an overlay. If there are any overlay wide settings, this
7409 looks through all the sections in the overlay and sets them. */
7412 lang_leave_overlay (etree_type
*lma_expr
,
7415 const char *memspec
,
7416 lang_output_section_phdr_list
*phdrs
,
7417 const char *lma_memspec
)
7419 lang_memory_region_type
*region
;
7420 lang_memory_region_type
*lma_region
;
7421 struct overlay_list
*l
;
7422 lang_nocrossref_type
*nocrossref
;
7424 lang_get_regions (®ion
, &lma_region
,
7425 memspec
, lma_memspec
,
7426 lma_expr
!= NULL
, FALSE
);
7430 /* After setting the size of the last section, set '.' to end of the
7432 if (overlay_list
!= NULL
)
7434 overlay_list
->os
->update_dot
= 1;
7435 overlay_list
->os
->update_dot_tree
7436 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
));
7442 struct overlay_list
*next
;
7444 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7447 l
->os
->region
= region
;
7448 l
->os
->lma_region
= lma_region
;
7450 /* The first section has the load address specified in the
7451 OVERLAY statement. The rest are worked out from that.
7452 The base address is not needed (and should be null) if
7453 an LMA region was specified. */
7456 l
->os
->load_base
= lma_expr
;
7457 l
->os
->sectype
= normal_section
;
7459 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7460 l
->os
->phdrs
= phdrs
;
7464 lang_nocrossref_type
*nc
;
7466 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7467 nc
->name
= l
->os
->name
;
7468 nc
->next
= nocrossref
;
7477 if (nocrossref
!= NULL
)
7478 lang_add_nocrossref (nocrossref
);
7481 overlay_list
= NULL
;
7485 /* Version handling. This is only useful for ELF. */
7487 /* If PREV is NULL, return first version pattern matching particular symbol.
7488 If PREV is non-NULL, return first version pattern matching particular
7489 symbol after PREV (previously returned by lang_vers_match). */
7491 static struct bfd_elf_version_expr
*
7492 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7493 struct bfd_elf_version_expr
*prev
,
7497 const char *cxx_sym
= sym
;
7498 const char *java_sym
= sym
;
7499 struct bfd_elf_version_expr
*expr
= NULL
;
7500 enum demangling_styles curr_style
;
7502 curr_style
= CURRENT_DEMANGLING_STYLE
;
7503 cplus_demangle_set_style (no_demangling
);
7504 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7507 cplus_demangle_set_style (curr_style
);
7509 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7511 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7512 DMGL_PARAMS
| DMGL_ANSI
);
7516 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7518 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7523 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7525 struct bfd_elf_version_expr e
;
7527 switch (prev
? prev
->mask
: 0)
7530 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7533 expr
= (struct bfd_elf_version_expr
*)
7534 htab_find ((htab_t
) head
->htab
, &e
);
7535 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7536 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7542 case BFD_ELF_VERSION_C_TYPE
:
7543 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7545 e
.pattern
= cxx_sym
;
7546 expr
= (struct bfd_elf_version_expr
*)
7547 htab_find ((htab_t
) head
->htab
, &e
);
7548 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7549 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7555 case BFD_ELF_VERSION_CXX_TYPE
:
7556 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7558 e
.pattern
= java_sym
;
7559 expr
= (struct bfd_elf_version_expr
*)
7560 htab_find ((htab_t
) head
->htab
, &e
);
7561 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7562 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7573 /* Finally, try the wildcards. */
7574 if (prev
== NULL
|| prev
->literal
)
7575 expr
= head
->remaining
;
7578 for (; expr
; expr
= expr
->next
)
7585 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7588 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7590 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7594 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7600 free ((char *) c_sym
);
7602 free ((char *) cxx_sym
);
7603 if (java_sym
!= sym
)
7604 free ((char *) java_sym
);
7608 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7609 return a pointer to the symbol name with any backslash quotes removed. */
7612 realsymbol (const char *pattern
)
7615 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7616 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7618 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7620 /* It is a glob pattern only if there is no preceding
7624 /* Remove the preceding backslash. */
7631 if (*p
== '?' || *p
== '*' || *p
== '[')
7638 backslash
= *p
== '\\';
7654 /* This is called for each variable name or match expression. NEW_NAME is
7655 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7656 pattern to be matched against symbol names. */
7658 struct bfd_elf_version_expr
*
7659 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7660 const char *new_name
,
7662 bfd_boolean literal_p
)
7664 struct bfd_elf_version_expr
*ret
;
7666 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7670 ret
->literal
= TRUE
;
7671 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7672 if (ret
->pattern
== NULL
)
7674 ret
->pattern
= new_name
;
7675 ret
->literal
= FALSE
;
7678 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7679 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7680 else if (strcasecmp (lang
, "C++") == 0)
7681 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7682 else if (strcasecmp (lang
, "Java") == 0)
7683 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7686 einfo (_("%X%P: unknown language `%s' in version information\n"),
7688 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7691 return ldemul_new_vers_pattern (ret
);
7694 /* This is called for each set of variable names and match
7697 struct bfd_elf_version_tree
*
7698 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7699 struct bfd_elf_version_expr
*locals
)
7701 struct bfd_elf_version_tree
*ret
;
7703 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7704 ret
->globals
.list
= globals
;
7705 ret
->locals
.list
= locals
;
7706 ret
->match
= lang_vers_match
;
7707 ret
->name_indx
= (unsigned int) -1;
7711 /* This static variable keeps track of version indices. */
7713 static int version_index
;
7716 version_expr_head_hash (const void *p
)
7718 const struct bfd_elf_version_expr
*e
=
7719 (const struct bfd_elf_version_expr
*) p
;
7721 return htab_hash_string (e
->pattern
);
7725 version_expr_head_eq (const void *p1
, const void *p2
)
7727 const struct bfd_elf_version_expr
*e1
=
7728 (const struct bfd_elf_version_expr
*) p1
;
7729 const struct bfd_elf_version_expr
*e2
=
7730 (const struct bfd_elf_version_expr
*) p2
;
7732 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7736 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7739 struct bfd_elf_version_expr
*e
, *next
;
7740 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7742 for (e
= head
->list
; e
; e
= e
->next
)
7746 head
->mask
|= e
->mask
;
7751 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7752 version_expr_head_eq
, NULL
);
7753 list_loc
= &head
->list
;
7754 remaining_loc
= &head
->remaining
;
7755 for (e
= head
->list
; e
; e
= next
)
7761 remaining_loc
= &e
->next
;
7765 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7769 struct bfd_elf_version_expr
*e1
, *last
;
7771 e1
= (struct bfd_elf_version_expr
*) *loc
;
7775 if (e1
->mask
== e
->mask
)
7783 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7787 /* This is a duplicate. */
7788 /* FIXME: Memory leak. Sometimes pattern is not
7789 xmalloced alone, but in larger chunk of memory. */
7790 /* free (e->pattern); */
7795 e
->next
= last
->next
;
7803 list_loc
= &e
->next
;
7807 *remaining_loc
= NULL
;
7808 *list_loc
= head
->remaining
;
7811 head
->remaining
= head
->list
;
7814 /* This is called when we know the name and dependencies of the
7818 lang_register_vers_node (const char *name
,
7819 struct bfd_elf_version_tree
*version
,
7820 struct bfd_elf_version_deps
*deps
)
7822 struct bfd_elf_version_tree
*t
, **pp
;
7823 struct bfd_elf_version_expr
*e1
;
7828 if (link_info
.version_info
!= NULL
7829 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
7831 einfo (_("%X%P: anonymous version tag cannot be combined"
7832 " with other version tags\n"));
7837 /* Make sure this node has a unique name. */
7838 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7839 if (strcmp (t
->name
, name
) == 0)
7840 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7842 lang_finalize_version_expr_head (&version
->globals
);
7843 lang_finalize_version_expr_head (&version
->locals
);
7845 /* Check the global and local match names, and make sure there
7846 aren't any duplicates. */
7848 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7850 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7852 struct bfd_elf_version_expr
*e2
;
7854 if (t
->locals
.htab
&& e1
->literal
)
7856 e2
= (struct bfd_elf_version_expr
*)
7857 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7858 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7860 if (e1
->mask
== e2
->mask
)
7861 einfo (_("%X%P: duplicate expression `%s'"
7862 " in version information\n"), e1
->pattern
);
7866 else if (!e1
->literal
)
7867 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7868 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7869 && e1
->mask
== e2
->mask
)
7870 einfo (_("%X%P: duplicate expression `%s'"
7871 " in version information\n"), e1
->pattern
);
7875 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7877 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7879 struct bfd_elf_version_expr
*e2
;
7881 if (t
->globals
.htab
&& e1
->literal
)
7883 e2
= (struct bfd_elf_version_expr
*)
7884 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7885 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7887 if (e1
->mask
== e2
->mask
)
7888 einfo (_("%X%P: duplicate expression `%s'"
7889 " in version information\n"),
7894 else if (!e1
->literal
)
7895 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7896 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7897 && e1
->mask
== e2
->mask
)
7898 einfo (_("%X%P: duplicate expression `%s'"
7899 " in version information\n"), e1
->pattern
);
7903 version
->deps
= deps
;
7904 version
->name
= name
;
7905 if (name
[0] != '\0')
7908 version
->vernum
= version_index
;
7911 version
->vernum
= 0;
7913 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7918 /* This is called when we see a version dependency. */
7920 struct bfd_elf_version_deps
*
7921 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7923 struct bfd_elf_version_deps
*ret
;
7924 struct bfd_elf_version_tree
*t
;
7926 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7929 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7931 if (strcmp (t
->name
, name
) == 0)
7933 ret
->version_needed
= t
;
7938 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7940 ret
->version_needed
= NULL
;
7945 lang_do_version_exports_section (void)
7947 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7949 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7951 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7959 contents
= (char *) xmalloc (len
);
7960 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7961 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7964 while (p
< contents
+ len
)
7966 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7967 p
= strchr (p
, '\0') + 1;
7970 /* Do not free the contents, as we used them creating the regex. */
7972 /* Do not include this section in the link. */
7973 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7976 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7977 lang_register_vers_node (command_line
.version_exports_section
,
7978 lang_new_vers_node (greg
, lreg
), NULL
);
7982 lang_add_unique (const char *name
)
7984 struct unique_sections
*ent
;
7986 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7987 if (strcmp (ent
->name
, name
) == 0)
7990 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7991 ent
->name
= xstrdup (name
);
7992 ent
->next
= unique_section_list
;
7993 unique_section_list
= ent
;
7996 /* Append the list of dynamic symbols to the existing one. */
7999 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8001 if (link_info
.dynamic_list
)
8003 struct bfd_elf_version_expr
*tail
;
8004 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8006 tail
->next
= link_info
.dynamic_list
->head
.list
;
8007 link_info
.dynamic_list
->head
.list
= dynamic
;
8011 struct bfd_elf_dynamic_list
*d
;
8013 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8014 d
->head
.list
= dynamic
;
8015 d
->match
= lang_vers_match
;
8016 link_info
.dynamic_list
= d
;
8020 /* Append the list of C++ typeinfo dynamic symbols to the existing
8024 lang_append_dynamic_list_cpp_typeinfo (void)
8026 const char * symbols
[] =
8028 "typeinfo name for*",
8031 struct bfd_elf_version_expr
*dynamic
= NULL
;
8034 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8035 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8038 lang_append_dynamic_list (dynamic
);
8041 /* Append the list of C++ operator new and delete dynamic symbols to the
8045 lang_append_dynamic_list_cpp_new (void)
8047 const char * symbols
[] =
8052 struct bfd_elf_version_expr
*dynamic
= NULL
;
8055 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8056 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8059 lang_append_dynamic_list (dynamic
);
8062 /* Scan a space and/or comma separated string of features. */
8065 lang_ld_feature (char *str
)
8073 while (*p
== ',' || ISSPACE (*p
))
8078 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8082 if (strcasecmp (p
, "SANE_EXPR") == 0)
8083 config
.sane_expr
= TRUE
;
8085 einfo (_("%X%P: unknown feature `%s'\n"), p
);