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 /* Propagate the section_flag_info from the wild statement to the section. */
240 s
->section_flag_info
= ptr
->section_flag_list
;
242 /* Don't process sections from files which were excluded. */
243 for (list_tmp
= sec
->spec
.exclude_name_list
;
245 list_tmp
= list_tmp
->next
)
247 char *p
= archive_path (list_tmp
->name
);
251 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
255 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
258 /* FIXME: Perhaps remove the following at some stage? Matching
259 unadorned archives like this was never documented and has
260 been superceded by the archive:path syntax. */
261 else if (file
->the_bfd
!= NULL
262 && file
->the_bfd
->my_archive
!= NULL
263 && name_match (list_tmp
->name
,
264 file
->the_bfd
->my_archive
->filename
) == 0)
268 (*callback
) (ptr
, sec
, s
, file
, data
);
271 /* Lowest common denominator routine that can handle everything correctly,
275 walk_wild_section_general (lang_wild_statement_type
*ptr
,
276 lang_input_statement_type
*file
,
281 struct wildcard_list
*sec
;
283 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
285 sec
= ptr
->section_list
;
287 (*callback
) (ptr
, sec
, s
, file
, data
);
291 bfd_boolean skip
= FALSE
;
293 if (sec
->spec
.name
!= NULL
)
295 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
297 skip
= name_match (sec
->spec
.name
, sname
) != 0;
301 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
308 /* Routines to find a single section given its name. If there's more
309 than one section with that name, we report that. */
313 asection
*found_section
;
314 bfd_boolean multiple_sections_found
;
315 } section_iterator_callback_data
;
318 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
320 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
322 if (d
->found_section
!= NULL
)
324 d
->multiple_sections_found
= TRUE
;
328 d
->found_section
= s
;
333 find_section (lang_input_statement_type
*file
,
334 struct wildcard_list
*sec
,
335 bfd_boolean
*multiple_sections_found
)
337 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
339 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
340 section_iterator_callback
, &cb_data
);
341 *multiple_sections_found
= cb_data
.multiple_sections_found
;
342 return cb_data
.found_section
;
345 /* Code for handling simple wildcards without going through fnmatch,
346 which can be expensive because of charset translations etc. */
348 /* A simple wild is a literal string followed by a single '*',
349 where the literal part is at least 4 characters long. */
352 is_simple_wild (const char *name
)
354 size_t len
= strcspn (name
, "*?[");
355 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
359 match_simple_wild (const char *pattern
, const char *name
)
361 /* The first four characters of the pattern are guaranteed valid
362 non-wildcard characters. So we can go faster. */
363 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
364 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
369 while (*pattern
!= '*')
370 if (*name
++ != *pattern
++)
376 /* Return the numerical value of the init_priority attribute from
377 section name NAME. */
380 get_init_priority (const char *name
)
383 unsigned long init_priority
;
385 /* GCC uses the following section names for the init_priority
386 attribute with numerical values 101 and 65535 inclusive. A
387 lower value means a higher priority.
389 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
390 decimal numerical value of the init_priority attribute.
391 The order of execution in .init_array is forward and
392 .fini_array is backward.
393 2: .ctors.NNNN/.ctors.NNNN: Where NNNN is 65535 minus the
394 decimal numerical value of the init_priority attribute.
395 The order of execution in .ctors is backward and .dtors
398 if (strncmp (name
, ".init_array.", 12) == 0
399 || strncmp (name
, ".fini_array.", 12) == 0)
401 init_priority
= strtoul (name
+ 12, &end
, 10);
402 return *end
? 0 : init_priority
;
404 else if (strncmp (name
, ".ctors.", 7) == 0
405 || strncmp (name
, ".dtors.", 7) == 0)
407 init_priority
= strtoul (name
+ 7, &end
, 10);
408 return *end
? 0 : 65535 - init_priority
;
414 /* Compare sections ASEC and BSEC according to SORT. */
417 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
420 unsigned long ainit_priority
, binit_priority
;
427 case by_init_priority
:
429 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
431 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
432 if (ainit_priority
== 0 || binit_priority
== 0)
434 ret
= ainit_priority
- binit_priority
;
440 case by_alignment_name
:
441 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
442 - bfd_section_alignment (asec
->owner
, asec
));
449 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
450 bfd_get_section_name (bsec
->owner
, bsec
));
453 case by_name_alignment
:
454 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
455 bfd_get_section_name (bsec
->owner
, bsec
));
461 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
462 - bfd_section_alignment (asec
->owner
, asec
));
469 /* Build a Binary Search Tree to sort sections, unlike insertion sort
470 used in wild_sort(). BST is considerably faster if the number of
471 of sections are large. */
473 static lang_section_bst_type
**
474 wild_sort_fast (lang_wild_statement_type
*wild
,
475 struct wildcard_list
*sec
,
476 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
479 lang_section_bst_type
**tree
;
482 if (!wild
->filenames_sorted
483 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
485 /* Append at the right end of tree. */
487 tree
= &((*tree
)->right
);
493 /* Find the correct node to append this section. */
494 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
495 tree
= &((*tree
)->left
);
497 tree
= &((*tree
)->right
);
503 /* Use wild_sort_fast to build a BST to sort sections. */
506 output_section_callback_fast (lang_wild_statement_type
*ptr
,
507 struct wildcard_list
*sec
,
509 lang_input_statement_type
*file
,
512 lang_section_bst_type
*node
;
513 lang_section_bst_type
**tree
;
514 lang_output_section_statement_type
*os
;
516 os
= (lang_output_section_statement_type
*) output
;
518 if (unique_section_p (section
, os
))
521 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
524 node
->section
= section
;
526 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
531 /* Convert a sorted sections' BST back to list form. */
534 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
535 lang_section_bst_type
*tree
,
539 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
541 lang_add_section (&ptr
->children
, tree
->section
,
542 (lang_output_section_statement_type
*) output
);
545 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
550 /* Specialized, optimized routines for handling different kinds of
554 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
555 lang_input_statement_type
*file
,
559 /* We can just do a hash lookup for the section with the right name.
560 But if that lookup discovers more than one section with the name
561 (should be rare), we fall back to the general algorithm because
562 we would otherwise have to sort the sections to make sure they
563 get processed in the bfd's order. */
564 bfd_boolean multiple_sections_found
;
565 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
566 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
568 if (multiple_sections_found
)
569 walk_wild_section_general (ptr
, file
, callback
, data
);
571 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
575 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
576 lang_input_statement_type
*file
,
581 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
583 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
585 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
586 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
589 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
594 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
595 lang_input_statement_type
*file
,
600 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
601 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
602 bfd_boolean multiple_sections_found
;
603 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
605 if (multiple_sections_found
)
607 walk_wild_section_general (ptr
, file
, callback
, data
);
611 /* Note that if the section was not found, s0 is NULL and
612 we'll simply never succeed the s == s0 test below. */
613 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
615 /* Recall that in this code path, a section cannot satisfy more
616 than one spec, so if s == s0 then it cannot match
619 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
622 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
623 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
626 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
633 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
634 lang_input_statement_type
*file
,
639 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
640 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
641 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
642 bfd_boolean multiple_sections_found
;
643 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
645 if (multiple_sections_found
)
647 walk_wild_section_general (ptr
, file
, callback
, data
);
651 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
654 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
657 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
658 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
661 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
664 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
666 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
674 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
675 lang_input_statement_type
*file
,
680 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
681 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
682 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
683 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
684 bfd_boolean multiple_sections_found
;
685 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
687 if (multiple_sections_found
)
689 walk_wild_section_general (ptr
, file
, callback
, data
);
693 s1
= find_section (file
, sec1
, &multiple_sections_found
);
694 if (multiple_sections_found
)
696 walk_wild_section_general (ptr
, file
, callback
, data
);
700 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
703 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
706 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
709 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
710 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
714 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
718 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
720 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
728 walk_wild_section (lang_wild_statement_type
*ptr
,
729 lang_input_statement_type
*file
,
733 if (file
->flags
.just_syms
)
736 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
739 /* Returns TRUE when name1 is a wildcard spec that might match
740 something name2 can match. We're conservative: we return FALSE
741 only if the prefixes of name1 and name2 are different up to the
742 first wildcard character. */
745 wild_spec_can_overlap (const char *name1
, const char *name2
)
747 size_t prefix1_len
= strcspn (name1
, "?*[");
748 size_t prefix2_len
= strcspn (name2
, "?*[");
749 size_t min_prefix_len
;
751 /* Note that if there is no wildcard character, then we treat the
752 terminating 0 as part of the prefix. Thus ".text" won't match
753 ".text." or ".text.*", for example. */
754 if (name1
[prefix1_len
] == '\0')
756 if (name2
[prefix2_len
] == '\0')
759 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
761 return memcmp (name1
, name2
, min_prefix_len
) == 0;
764 /* Select specialized code to handle various kinds of wildcard
768 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
771 int wild_name_count
= 0;
772 struct wildcard_list
*sec
;
776 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
777 ptr
->handler_data
[0] = NULL
;
778 ptr
->handler_data
[1] = NULL
;
779 ptr
->handler_data
[2] = NULL
;
780 ptr
->handler_data
[3] = NULL
;
783 /* Count how many wildcard_specs there are, and how many of those
784 actually use wildcards in the name. Also, bail out if any of the
785 wildcard names are NULL. (Can this actually happen?
786 walk_wild_section used to test for it.) And bail out if any
787 of the wildcards are more complex than a simple string
788 ending in a single '*'. */
789 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
792 if (sec
->spec
.name
== NULL
)
794 if (wildcardp (sec
->spec
.name
))
797 if (!is_simple_wild (sec
->spec
.name
))
802 /* The zero-spec case would be easy to optimize but it doesn't
803 happen in practice. Likewise, more than 4 specs doesn't
804 happen in practice. */
805 if (sec_count
== 0 || sec_count
> 4)
808 /* Check that no two specs can match the same section. */
809 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
811 struct wildcard_list
*sec2
;
812 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
814 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
819 signature
= (sec_count
<< 8) + wild_name_count
;
823 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
826 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
829 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
832 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
835 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
841 /* Now fill the data array with pointers to the specs, first the
842 specs with non-wildcard names, then the specs with wildcard
843 names. It's OK to process the specs in different order from the
844 given order, because we've already determined that no section
845 will match more than one spec. */
847 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
848 if (!wildcardp (sec
->spec
.name
))
849 ptr
->handler_data
[data_counter
++] = sec
;
850 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
851 if (wildcardp (sec
->spec
.name
))
852 ptr
->handler_data
[data_counter
++] = sec
;
855 /* Handle a wild statement for a single file F. */
858 walk_wild_file (lang_wild_statement_type
*s
,
859 lang_input_statement_type
*f
,
863 if (f
->the_bfd
== NULL
864 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
865 walk_wild_section (s
, f
, callback
, data
);
870 /* This is an archive file. We must map each member of the
871 archive separately. */
872 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
873 while (member
!= NULL
)
875 /* When lookup_name is called, it will call the add_symbols
876 entry point for the archive. For each element of the
877 archive which is included, BFD will call ldlang_add_file,
878 which will set the usrdata field of the member to the
879 lang_input_statement. */
880 if (member
->usrdata
!= NULL
)
882 walk_wild_section (s
,
883 (lang_input_statement_type
*) member
->usrdata
,
887 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
893 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
895 const char *file_spec
= s
->filename
;
898 if (file_spec
== NULL
)
900 /* Perform the iteration over all files in the list. */
901 LANG_FOR_EACH_INPUT_STATEMENT (f
)
903 walk_wild_file (s
, f
, callback
, data
);
906 else if ((p
= archive_path (file_spec
)) != NULL
)
908 LANG_FOR_EACH_INPUT_STATEMENT (f
)
910 if (input_statement_is_archive_path (file_spec
, p
, f
))
911 walk_wild_file (s
, f
, callback
, data
);
914 else if (wildcardp (file_spec
))
916 LANG_FOR_EACH_INPUT_STATEMENT (f
)
918 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
919 walk_wild_file (s
, f
, callback
, data
);
924 lang_input_statement_type
*f
;
926 /* Perform the iteration over a single file. */
927 f
= lookup_name (file_spec
);
929 walk_wild_file (s
, f
, callback
, data
);
933 /* lang_for_each_statement walks the parse tree and calls the provided
934 function for each node, except those inside output section statements
935 with constraint set to -1. */
938 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
939 lang_statement_union_type
*s
)
941 for (; s
!= NULL
; s
= s
->header
.next
)
945 switch (s
->header
.type
)
947 case lang_constructors_statement_enum
:
948 lang_for_each_statement_worker (func
, constructor_list
.head
);
950 case lang_output_section_statement_enum
:
951 if (s
->output_section_statement
.constraint
!= -1)
952 lang_for_each_statement_worker
953 (func
, s
->output_section_statement
.children
.head
);
955 case lang_wild_statement_enum
:
956 lang_for_each_statement_worker (func
,
957 s
->wild_statement
.children
.head
);
959 case lang_group_statement_enum
:
960 lang_for_each_statement_worker (func
,
961 s
->group_statement
.children
.head
);
963 case lang_data_statement_enum
:
964 case lang_reloc_statement_enum
:
965 case lang_object_symbols_statement_enum
:
966 case lang_output_statement_enum
:
967 case lang_target_statement_enum
:
968 case lang_input_section_enum
:
969 case lang_input_statement_enum
:
970 case lang_assignment_statement_enum
:
971 case lang_padding_statement_enum
:
972 case lang_address_statement_enum
:
973 case lang_fill_statement_enum
:
974 case lang_insert_statement_enum
:
984 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
986 lang_for_each_statement_worker (func
, statement_list
.head
);
989 /*----------------------------------------------------------------------*/
992 lang_list_init (lang_statement_list_type
*list
)
995 list
->tail
= &list
->head
;
999 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1001 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1003 *stat_save_ptr
++ = stat_ptr
;
1010 if (stat_save_ptr
<= stat_save
)
1012 stat_ptr
= *--stat_save_ptr
;
1015 /* Build a new statement node for the parse tree. */
1017 static lang_statement_union_type
*
1018 new_statement (enum statement_enum type
,
1020 lang_statement_list_type
*list
)
1022 lang_statement_union_type
*new_stmt
;
1024 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1025 new_stmt
->header
.type
= type
;
1026 new_stmt
->header
.next
= NULL
;
1027 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1031 /* Build a new input file node for the language. There are several
1032 ways in which we treat an input file, eg, we only look at symbols,
1033 or prefix it with a -l etc.
1035 We can be supplied with requests for input files more than once;
1036 they may, for example be split over several lines like foo.o(.text)
1037 foo.o(.data) etc, so when asked for a file we check that we haven't
1038 got it already so we don't duplicate the bfd. */
1040 static lang_input_statement_type
*
1041 new_afile (const char *name
,
1042 lang_input_file_enum_type file_type
,
1044 bfd_boolean add_to_list
)
1046 lang_input_statement_type
*p
;
1048 lang_has_input_file
= TRUE
;
1051 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1054 p
= (lang_input_statement_type
*)
1055 stat_alloc (sizeof (lang_input_statement_type
));
1056 p
->header
.type
= lang_input_statement_enum
;
1057 p
->header
.next
= NULL
;
1060 memset (&p
->the_bfd
, 0,
1061 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1063 p
->flags
.dynamic
= input_flags
.dynamic
;
1064 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1065 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1066 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1067 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1069 if (file_type
== lang_input_file_is_l_enum
1070 && name
[0] == ':' && name
[1] != '\0')
1072 file_type
= lang_input_file_is_search_file_enum
;
1078 case lang_input_file_is_symbols_only_enum
:
1080 p
->local_sym_name
= name
;
1081 p
->flags
.real
= TRUE
;
1082 p
->flags
.just_syms
= TRUE
;
1084 case lang_input_file_is_fake_enum
:
1086 p
->local_sym_name
= name
;
1088 case lang_input_file_is_l_enum
:
1090 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1091 p
->flags
.maybe_archive
= TRUE
;
1092 p
->flags
.real
= TRUE
;
1093 p
->flags
.search_dirs
= TRUE
;
1095 case lang_input_file_is_marker_enum
:
1097 p
->local_sym_name
= name
;
1098 p
->flags
.search_dirs
= TRUE
;
1100 case lang_input_file_is_search_file_enum
:
1102 p
->local_sym_name
= name
;
1103 p
->flags
.real
= TRUE
;
1104 p
->flags
.search_dirs
= TRUE
;
1106 case lang_input_file_is_file_enum
:
1108 p
->local_sym_name
= name
;
1109 p
->flags
.real
= TRUE
;
1115 lang_statement_append (&input_file_chain
,
1116 (lang_statement_union_type
*) p
,
1117 &p
->next_real_file
);
1121 lang_input_statement_type
*
1122 lang_add_input_file (const char *name
,
1123 lang_input_file_enum_type file_type
,
1126 return new_afile (name
, file_type
, target
, TRUE
);
1129 struct out_section_hash_entry
1131 struct bfd_hash_entry root
;
1132 lang_statement_union_type s
;
1135 /* The hash table. */
1137 static struct bfd_hash_table output_section_statement_table
;
1139 /* Support routines for the hash table used by lang_output_section_find,
1140 initialize the table, fill in an entry and remove the table. */
1142 static struct bfd_hash_entry
*
1143 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1144 struct bfd_hash_table
*table
,
1147 lang_output_section_statement_type
**nextp
;
1148 struct out_section_hash_entry
*ret
;
1152 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1158 entry
= bfd_hash_newfunc (entry
, table
, string
);
1162 ret
= (struct out_section_hash_entry
*) entry
;
1163 memset (&ret
->s
, 0, sizeof (ret
->s
));
1164 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1165 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1166 ret
->s
.output_section_statement
.section_alignment
= -1;
1167 ret
->s
.output_section_statement
.block_value
= 1;
1168 lang_list_init (&ret
->s
.output_section_statement
.children
);
1169 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1171 /* For every output section statement added to the list, except the
1172 first one, lang_output_section_statement.tail points to the "next"
1173 field of the last element of the list. */
1174 if (lang_output_section_statement
.head
!= NULL
)
1175 ret
->s
.output_section_statement
.prev
1176 = ((lang_output_section_statement_type
*)
1177 ((char *) lang_output_section_statement
.tail
1178 - offsetof (lang_output_section_statement_type
, next
)));
1180 /* GCC's strict aliasing rules prevent us from just casting the
1181 address, so we store the pointer in a variable and cast that
1183 nextp
= &ret
->s
.output_section_statement
.next
;
1184 lang_statement_append (&lang_output_section_statement
,
1186 (lang_statement_union_type
**) nextp
);
1191 output_section_statement_table_init (void)
1193 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1194 output_section_statement_newfunc
,
1195 sizeof (struct out_section_hash_entry
),
1197 einfo (_("%P%F: can not create hash table: %E\n"));
1201 output_section_statement_table_free (void)
1203 bfd_hash_table_free (&output_section_statement_table
);
1206 /* Build enough state so that the parser can build its tree. */
1211 obstack_begin (&stat_obstack
, 1000);
1213 stat_ptr
= &statement_list
;
1215 output_section_statement_table_init ();
1217 lang_list_init (stat_ptr
);
1219 lang_list_init (&input_file_chain
);
1220 lang_list_init (&lang_output_section_statement
);
1221 lang_list_init (&file_chain
);
1222 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1224 abs_output_section
=
1225 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1227 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1229 /* The value "3" is ad-hoc, somewhat related to the expected number of
1230 DEFINED expressions in a linker script. For most default linker
1231 scripts, there are none. Why a hash table then? Well, it's somewhat
1232 simpler to re-use working machinery than using a linked list in terms
1233 of code-complexity here in ld, besides the initialization which just
1234 looks like other code here. */
1235 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1236 lang_definedness_newfunc
,
1237 sizeof (struct lang_definedness_hash_entry
),
1239 einfo (_("%P%F: can not create hash table: %E\n"));
1245 output_section_statement_table_free ();
1248 /*----------------------------------------------------------------------
1249 A region is an area of memory declared with the
1250 MEMORY { name:org=exp, len=exp ... }
1253 We maintain a list of all the regions here.
1255 If no regions are specified in the script, then the default is used
1256 which is created when looked up to be the entire data space.
1258 If create is true we are creating a region inside a MEMORY block.
1259 In this case it is probably an error to create a region that has
1260 already been created. If we are not inside a MEMORY block it is
1261 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1262 and so we issue a warning.
1264 Each region has at least one name. The first name is either
1265 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1266 alias names to an existing region within a script with
1267 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1270 static lang_memory_region_type
*lang_memory_region_list
;
1271 static lang_memory_region_type
**lang_memory_region_list_tail
1272 = &lang_memory_region_list
;
1274 lang_memory_region_type
*
1275 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1277 lang_memory_region_name
*n
;
1278 lang_memory_region_type
*r
;
1279 lang_memory_region_type
*new_region
;
1281 /* NAME is NULL for LMA memspecs if no region was specified. */
1285 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1286 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1287 if (strcmp (n
->name
, name
) == 0)
1290 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1295 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1296 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1299 new_region
= (lang_memory_region_type
*)
1300 stat_alloc (sizeof (lang_memory_region_type
));
1302 new_region
->name_list
.name
= xstrdup (name
);
1303 new_region
->name_list
.next
= NULL
;
1304 new_region
->next
= NULL
;
1305 new_region
->origin
= 0;
1306 new_region
->length
= ~(bfd_size_type
) 0;
1307 new_region
->current
= 0;
1308 new_region
->last_os
= NULL
;
1309 new_region
->flags
= 0;
1310 new_region
->not_flags
= 0;
1311 new_region
->had_full_message
= FALSE
;
1313 *lang_memory_region_list_tail
= new_region
;
1314 lang_memory_region_list_tail
= &new_region
->next
;
1320 lang_memory_region_alias (const char * alias
, const char * region_name
)
1322 lang_memory_region_name
* n
;
1323 lang_memory_region_type
* r
;
1324 lang_memory_region_type
* region
;
1326 /* The default region must be unique. This ensures that it is not necessary
1327 to iterate through the name list if someone wants the check if a region is
1328 the default memory region. */
1329 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1330 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1331 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL
);
1333 /* Look for the target region and check if the alias is not already
1336 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1337 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1339 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1341 if (strcmp (n
->name
, alias
) == 0)
1342 einfo (_("%F%P:%S: error: redefinition of memory region "
1347 /* Check if the target region exists. */
1349 einfo (_("%F%P:%S: error: memory region `%s' "
1350 "for alias `%s' does not exist\n"),
1351 NULL
, region_name
, alias
);
1353 /* Add alias to region name list. */
1354 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1355 n
->name
= xstrdup (alias
);
1356 n
->next
= region
->name_list
.next
;
1357 region
->name_list
.next
= n
;
1360 static lang_memory_region_type
*
1361 lang_memory_default (asection
* section
)
1363 lang_memory_region_type
*p
;
1365 flagword sec_flags
= section
->flags
;
1367 /* Override SEC_DATA to mean a writable section. */
1368 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1369 sec_flags
|= SEC_DATA
;
1371 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1373 if ((p
->flags
& sec_flags
) != 0
1374 && (p
->not_flags
& sec_flags
) == 0)
1379 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1382 /* Find or create an output_section_statement with the given NAME.
1383 If CONSTRAINT is non-zero match one with that constraint, otherwise
1384 match any non-negative constraint. If CREATE, always make a
1385 new output_section_statement for SPECIAL CONSTRAINT. */
1387 lang_output_section_statement_type
*
1388 lang_output_section_statement_lookup (const char *name
,
1392 struct out_section_hash_entry
*entry
;
1394 entry
= ((struct out_section_hash_entry
*)
1395 bfd_hash_lookup (&output_section_statement_table
, name
,
1400 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1404 if (entry
->s
.output_section_statement
.name
!= NULL
)
1406 /* We have a section of this name, but it might not have the correct
1408 struct out_section_hash_entry
*last_ent
;
1410 name
= entry
->s
.output_section_statement
.name
;
1411 if (create
&& constraint
== SPECIAL
)
1412 /* Not traversing to the end reverses the order of the second
1413 and subsequent SPECIAL sections in the hash table chain,
1414 but that shouldn't matter. */
1419 if (constraint
== entry
->s
.output_section_statement
.constraint
1421 && entry
->s
.output_section_statement
.constraint
>= 0))
1422 return &entry
->s
.output_section_statement
;
1424 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1426 while (entry
!= NULL
1427 && name
== entry
->s
.output_section_statement
.name
);
1433 = ((struct out_section_hash_entry
*)
1434 output_section_statement_newfunc (NULL
,
1435 &output_section_statement_table
,
1439 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1442 entry
->root
= last_ent
->root
;
1443 last_ent
->root
.next
= &entry
->root
;
1446 entry
->s
.output_section_statement
.name
= name
;
1447 entry
->s
.output_section_statement
.constraint
= constraint
;
1448 return &entry
->s
.output_section_statement
;
1451 /* Find the next output_section_statement with the same name as OS.
1452 If CONSTRAINT is non-zero, find one with that constraint otherwise
1453 match any non-negative constraint. */
1455 lang_output_section_statement_type
*
1456 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1459 /* All output_section_statements are actually part of a
1460 struct out_section_hash_entry. */
1461 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1463 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1464 const char *name
= os
->name
;
1466 ASSERT (name
== entry
->root
.string
);
1469 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1471 || name
!= entry
->s
.output_section_statement
.name
)
1474 while (constraint
!= entry
->s
.output_section_statement
.constraint
1476 || entry
->s
.output_section_statement
.constraint
< 0));
1478 return &entry
->s
.output_section_statement
;
1481 /* A variant of lang_output_section_find used by place_orphan.
1482 Returns the output statement that should precede a new output
1483 statement for SEC. If an exact match is found on certain flags,
1486 lang_output_section_statement_type
*
1487 lang_output_section_find_by_flags (const asection
*sec
,
1488 lang_output_section_statement_type
**exact
,
1489 lang_match_sec_type_func match_type
)
1491 lang_output_section_statement_type
*first
, *look
, *found
;
1494 /* We know the first statement on this list is *ABS*. May as well
1496 first
= &lang_output_section_statement
.head
->output_section_statement
;
1497 first
= first
->next
;
1499 /* First try for an exact match. */
1501 for (look
= first
; look
; look
= look
->next
)
1503 flags
= look
->flags
;
1504 if (look
->bfd_section
!= NULL
)
1506 flags
= look
->bfd_section
->flags
;
1507 if (match_type
&& !match_type (link_info
.output_bfd
,
1512 flags
^= sec
->flags
;
1513 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1514 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1524 if ((sec
->flags
& SEC_CODE
) != 0
1525 && (sec
->flags
& SEC_ALLOC
) != 0)
1527 /* Try for a rw code section. */
1528 for (look
= first
; look
; look
= look
->next
)
1530 flags
= look
->flags
;
1531 if (look
->bfd_section
!= NULL
)
1533 flags
= look
->bfd_section
->flags
;
1534 if (match_type
&& !match_type (link_info
.output_bfd
,
1539 flags
^= sec
->flags
;
1540 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1541 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1545 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1546 && (sec
->flags
& SEC_ALLOC
) != 0)
1548 /* .rodata can go after .text, .sdata2 after .rodata. */
1549 for (look
= first
; look
; look
= look
->next
)
1551 flags
= look
->flags
;
1552 if (look
->bfd_section
!= NULL
)
1554 flags
= look
->bfd_section
->flags
;
1555 if (match_type
&& !match_type (link_info
.output_bfd
,
1560 flags
^= sec
->flags
;
1561 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1562 | SEC_READONLY
| SEC_SMALL_DATA
))
1563 || (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1565 && !(look
->flags
& SEC_SMALL_DATA
))
1566 || (!(flags
& (SEC_THREAD_LOCAL
| SEC_ALLOC
))
1567 && (look
->flags
& SEC_THREAD_LOCAL
)
1568 && (!(flags
& SEC_LOAD
)
1569 || (look
->flags
& SEC_LOAD
))))
1573 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1574 && (sec
->flags
& SEC_ALLOC
) != 0)
1576 /* .sdata goes after .data, .sbss after .sdata. */
1577 for (look
= first
; look
; look
= look
->next
)
1579 flags
= look
->flags
;
1580 if (look
->bfd_section
!= NULL
)
1582 flags
= look
->bfd_section
->flags
;
1583 if (match_type
&& !match_type (link_info
.output_bfd
,
1588 flags
^= sec
->flags
;
1589 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1590 | SEC_THREAD_LOCAL
))
1591 || ((look
->flags
& SEC_SMALL_DATA
)
1592 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1596 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1597 && (sec
->flags
& SEC_ALLOC
) != 0)
1599 /* .data goes after .rodata. */
1600 for (look
= first
; look
; look
= look
->next
)
1602 flags
= look
->flags
;
1603 if (look
->bfd_section
!= NULL
)
1605 flags
= look
->bfd_section
->flags
;
1606 if (match_type
&& !match_type (link_info
.output_bfd
,
1611 flags
^= sec
->flags
;
1612 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1613 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1617 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1619 /* .bss goes after any other alloc section. */
1620 for (look
= first
; look
; look
= look
->next
)
1622 flags
= look
->flags
;
1623 if (look
->bfd_section
!= NULL
)
1625 flags
= look
->bfd_section
->flags
;
1626 if (match_type
&& !match_type (link_info
.output_bfd
,
1631 flags
^= sec
->flags
;
1632 if (!(flags
& SEC_ALLOC
))
1638 /* non-alloc go last. */
1639 for (look
= first
; look
; look
= look
->next
)
1641 flags
= look
->flags
;
1642 if (look
->bfd_section
!= NULL
)
1643 flags
= look
->bfd_section
->flags
;
1644 flags
^= sec
->flags
;
1645 if (!(flags
& SEC_DEBUGGING
))
1651 if (found
|| !match_type
)
1654 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1657 /* Find the last output section before given output statement.
1658 Used by place_orphan. */
1661 output_prev_sec_find (lang_output_section_statement_type
*os
)
1663 lang_output_section_statement_type
*lookup
;
1665 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1667 if (lookup
->constraint
< 0)
1670 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1671 return lookup
->bfd_section
;
1677 /* Look for a suitable place for a new output section statement. The
1678 idea is to skip over anything that might be inside a SECTIONS {}
1679 statement in a script, before we find another output section
1680 statement. Assignments to "dot" before an output section statement
1681 are assumed to belong to it, except in two cases; The first
1682 assignment to dot, and assignments before non-alloc sections.
1683 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1684 similar assignments that set the initial address, or we might
1685 insert non-alloc note sections among assignments setting end of
1688 static lang_statement_union_type
**
1689 insert_os_after (lang_output_section_statement_type
*after
)
1691 lang_statement_union_type
**where
;
1692 lang_statement_union_type
**assign
= NULL
;
1693 bfd_boolean ignore_first
;
1696 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1698 for (where
= &after
->header
.next
;
1700 where
= &(*where
)->header
.next
)
1702 switch ((*where
)->header
.type
)
1704 case lang_assignment_statement_enum
:
1707 lang_assignment_statement_type
*ass
;
1709 ass
= &(*where
)->assignment_statement
;
1710 if (ass
->exp
->type
.node_class
!= etree_assert
1711 && ass
->exp
->assign
.dst
[0] == '.'
1712 && ass
->exp
->assign
.dst
[1] == 0
1716 ignore_first
= FALSE
;
1718 case lang_wild_statement_enum
:
1719 case lang_input_section_enum
:
1720 case lang_object_symbols_statement_enum
:
1721 case lang_fill_statement_enum
:
1722 case lang_data_statement_enum
:
1723 case lang_reloc_statement_enum
:
1724 case lang_padding_statement_enum
:
1725 case lang_constructors_statement_enum
:
1728 case lang_output_section_statement_enum
:
1731 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1734 || s
->map_head
.s
== NULL
1735 || (s
->flags
& SEC_ALLOC
) != 0)
1739 case lang_input_statement_enum
:
1740 case lang_address_statement_enum
:
1741 case lang_target_statement_enum
:
1742 case lang_output_statement_enum
:
1743 case lang_group_statement_enum
:
1744 case lang_insert_statement_enum
:
1753 lang_output_section_statement_type
*
1754 lang_insert_orphan (asection
*s
,
1755 const char *secname
,
1757 lang_output_section_statement_type
*after
,
1758 struct orphan_save
*place
,
1759 etree_type
*address
,
1760 lang_statement_list_type
*add_child
)
1762 lang_statement_list_type add
;
1764 lang_output_section_statement_type
*os
;
1765 lang_output_section_statement_type
**os_tail
;
1767 /* If we have found an appropriate place for the output section
1768 statements for this orphan, add them to our own private list,
1769 inserting them later into the global statement list. */
1772 lang_list_init (&add
);
1773 push_stat_ptr (&add
);
1776 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1777 address
= exp_intop (0);
1779 os_tail
= ((lang_output_section_statement_type
**)
1780 lang_output_section_statement
.tail
);
1781 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1782 NULL
, NULL
, NULL
, constraint
);
1785 if (config
.build_constructors
&& *os_tail
== os
)
1787 /* If the name of the section is representable in C, then create
1788 symbols to mark the start and the end of the section. */
1789 for (ps
= secname
; *ps
!= '\0'; ps
++)
1790 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1795 etree_type
*e_align
;
1797 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1798 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1799 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1800 e_align
= exp_unop (ALIGN_K
,
1801 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1802 lang_add_assignment (exp_assign (".", e_align
));
1803 lang_add_assignment (exp_provide (symname
,
1805 exp_nameop (NAME
, ".")),
1810 if (add_child
== NULL
)
1811 add_child
= &os
->children
;
1812 lang_add_section (add_child
, s
, os
);
1814 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1816 const char *region
= (after
->region
1817 ? after
->region
->name_list
.name
1818 : DEFAULT_MEMORY_REGION
);
1819 const char *lma_region
= (after
->lma_region
1820 ? after
->lma_region
->name_list
.name
1822 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1826 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1829 if (ps
!= NULL
&& *ps
== '\0')
1833 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1834 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1835 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1836 lang_add_assignment (exp_provide (symname
,
1837 exp_nameop (NAME
, "."),
1841 /* Restore the global list pointer. */
1845 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1847 asection
*snew
, *as
;
1849 snew
= os
->bfd_section
;
1851 /* Shuffle the bfd section list to make the output file look
1852 neater. This is really only cosmetic. */
1853 if (place
->section
== NULL
1854 && after
!= (&lang_output_section_statement
.head
1855 ->output_section_statement
))
1857 asection
*bfd_section
= after
->bfd_section
;
1859 /* If the output statement hasn't been used to place any input
1860 sections (and thus doesn't have an output bfd_section),
1861 look for the closest prior output statement having an
1863 if (bfd_section
== NULL
)
1864 bfd_section
= output_prev_sec_find (after
);
1866 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1867 place
->section
= &bfd_section
->next
;
1870 if (place
->section
== NULL
)
1871 place
->section
= &link_info
.output_bfd
->sections
;
1873 as
= *place
->section
;
1877 /* Put the section at the end of the list. */
1879 /* Unlink the section. */
1880 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1882 /* Now tack it back on in the right place. */
1883 bfd_section_list_append (link_info
.output_bfd
, snew
);
1885 else if (as
!= snew
&& as
->prev
!= snew
)
1887 /* Unlink the section. */
1888 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1890 /* Now tack it back on in the right place. */
1891 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1894 /* Save the end of this list. Further ophans of this type will
1895 follow the one we've just added. */
1896 place
->section
= &snew
->next
;
1898 /* The following is non-cosmetic. We try to put the output
1899 statements in some sort of reasonable order here, because they
1900 determine the final load addresses of the orphan sections.
1901 In addition, placing output statements in the wrong order may
1902 require extra segments. For instance, given a typical
1903 situation of all read-only sections placed in one segment and
1904 following that a segment containing all the read-write
1905 sections, we wouldn't want to place an orphan read/write
1906 section before or amongst the read-only ones. */
1907 if (add
.head
!= NULL
)
1909 lang_output_section_statement_type
*newly_added_os
;
1911 if (place
->stmt
== NULL
)
1913 lang_statement_union_type
**where
= insert_os_after (after
);
1918 place
->os_tail
= &after
->next
;
1922 /* Put it after the last orphan statement we added. */
1923 *add
.tail
= *place
->stmt
;
1924 *place
->stmt
= add
.head
;
1927 /* Fix the global list pointer if we happened to tack our
1928 new list at the tail. */
1929 if (*stat_ptr
->tail
== add
.head
)
1930 stat_ptr
->tail
= add
.tail
;
1932 /* Save the end of this list. */
1933 place
->stmt
= add
.tail
;
1935 /* Do the same for the list of output section statements. */
1936 newly_added_os
= *os_tail
;
1938 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1939 ((char *) place
->os_tail
1940 - offsetof (lang_output_section_statement_type
, next
));
1941 newly_added_os
->next
= *place
->os_tail
;
1942 if (newly_added_os
->next
!= NULL
)
1943 newly_added_os
->next
->prev
= newly_added_os
;
1944 *place
->os_tail
= newly_added_os
;
1945 place
->os_tail
= &newly_added_os
->next
;
1947 /* Fixing the global list pointer here is a little different.
1948 We added to the list in lang_enter_output_section_statement,
1949 trimmed off the new output_section_statment above when
1950 assigning *os_tail = NULL, but possibly added it back in
1951 the same place when assigning *place->os_tail. */
1952 if (*os_tail
== NULL
)
1953 lang_output_section_statement
.tail
1954 = (lang_statement_union_type
**) os_tail
;
1961 lang_map_flags (flagword flag
)
1963 if (flag
& SEC_ALLOC
)
1966 if (flag
& SEC_CODE
)
1969 if (flag
& SEC_READONLY
)
1972 if (flag
& SEC_DATA
)
1975 if (flag
& SEC_LOAD
)
1982 lang_memory_region_type
*m
;
1983 bfd_boolean dis_header_printed
= FALSE
;
1986 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1990 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1991 || file
->flags
.just_syms
)
1994 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1995 if ((s
->output_section
== NULL
1996 || s
->output_section
->owner
!= link_info
.output_bfd
)
1997 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
1999 if (! dis_header_printed
)
2001 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2002 dis_header_printed
= TRUE
;
2005 print_input_section (s
, TRUE
);
2009 minfo (_("\nMemory Configuration\n\n"));
2010 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2011 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2013 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2018 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2020 sprintf_vma (buf
, m
->origin
);
2021 minfo ("0x%s ", buf
);
2029 minfo ("0x%V", m
->length
);
2030 if (m
->flags
|| m
->not_flags
)
2038 lang_map_flags (m
->flags
);
2044 lang_map_flags (m
->not_flags
);
2051 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2053 if (! link_info
.reduce_memory_overheads
)
2055 obstack_begin (&map_obstack
, 1000);
2056 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
2057 bfd_map_over_sections (p
, init_map_userdata
, 0);
2058 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2060 lang_statement_iteration
++;
2061 print_statements ();
2065 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
2067 void *data ATTRIBUTE_UNUSED
)
2069 fat_section_userdata_type
*new_data
2070 = ((fat_section_userdata_type
*) (stat_alloc
2071 (sizeof (fat_section_userdata_type
))));
2073 ASSERT (get_userdata (sec
) == NULL
);
2074 get_userdata (sec
) = new_data
;
2075 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
2076 new_data
->map_symbol_def_count
= 0;
2080 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2081 void *info ATTRIBUTE_UNUSED
)
2083 if (hash_entry
->type
== bfd_link_hash_defined
2084 || hash_entry
->type
== bfd_link_hash_defweak
)
2086 struct fat_user_section_struct
*ud
;
2087 struct map_symbol_def
*def
;
2089 ud
= (struct fat_user_section_struct
*)
2090 get_userdata (hash_entry
->u
.def
.section
);
2093 /* ??? What do we have to do to initialize this beforehand? */
2094 /* The first time we get here is bfd_abs_section... */
2095 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
2096 ud
= (struct fat_user_section_struct
*)
2097 get_userdata (hash_entry
->u
.def
.section
);
2099 else if (!ud
->map_symbol_def_tail
)
2100 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2102 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2103 def
->entry
= hash_entry
;
2104 *(ud
->map_symbol_def_tail
) = def
;
2105 ud
->map_symbol_def_tail
= &def
->next
;
2106 ud
->map_symbol_def_count
++;
2111 /* Initialize an output section. */
2114 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2116 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2117 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2119 if (s
->constraint
!= SPECIAL
)
2120 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2121 if (s
->bfd_section
== NULL
)
2122 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2124 if (s
->bfd_section
== NULL
)
2126 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2127 link_info
.output_bfd
->xvec
->name
, s
->name
);
2129 s
->bfd_section
->output_section
= s
->bfd_section
;
2130 s
->bfd_section
->output_offset
= 0;
2132 if (!link_info
.reduce_memory_overheads
)
2134 fat_section_userdata_type
*new_userdata
= (fat_section_userdata_type
*)
2135 stat_alloc (sizeof (fat_section_userdata_type
));
2136 memset (new_userdata
, 0, sizeof (fat_section_userdata_type
));
2137 get_userdata (s
->bfd_section
) = new_userdata
;
2140 /* If there is a base address, make sure that any sections it might
2141 mention are initialized. */
2142 if (s
->addr_tree
!= NULL
)
2143 exp_init_os (s
->addr_tree
);
2145 if (s
->load_base
!= NULL
)
2146 exp_init_os (s
->load_base
);
2148 /* If supplied an alignment, set it. */
2149 if (s
->section_alignment
!= -1)
2150 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2153 /* Make sure that all output sections mentioned in an expression are
2157 exp_init_os (etree_type
*exp
)
2159 switch (exp
->type
.node_class
)
2163 exp_init_os (exp
->assign
.src
);
2167 exp_init_os (exp
->binary
.lhs
);
2168 exp_init_os (exp
->binary
.rhs
);
2172 exp_init_os (exp
->trinary
.cond
);
2173 exp_init_os (exp
->trinary
.lhs
);
2174 exp_init_os (exp
->trinary
.rhs
);
2178 exp_init_os (exp
->assert_s
.child
);
2182 exp_init_os (exp
->unary
.child
);
2186 switch (exp
->type
.node_code
)
2192 lang_output_section_statement_type
*os
;
2194 os
= lang_output_section_find (exp
->name
.name
);
2195 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2207 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2209 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2211 /* If we are only reading symbols from this object, then we want to
2212 discard all sections. */
2213 if (entry
->flags
.just_syms
)
2215 bfd_link_just_syms (abfd
, sec
, &link_info
);
2219 if (!(abfd
->flags
& DYNAMIC
))
2220 bfd_section_already_linked (abfd
, sec
, &link_info
);
2223 /* The wild routines.
2225 These expand statements like *(.text) and foo.o to a list of
2226 explicit actions, like foo.o(.text), bar.o(.text) and
2227 foo.o(.text, .data). */
2229 /* Add SECTION to the output section OUTPUT. Do this by creating a
2230 lang_input_section statement which is placed at PTR. FILE is the
2231 input file which holds SECTION. */
2234 lang_add_section (lang_statement_list_type
*ptr
,
2236 lang_output_section_statement_type
*output
)
2238 flagword flags
= section
->flags
;
2239 struct flag_info
*sflag_info
= section
->section_flag_info
;
2241 bfd_boolean discard
;
2242 lang_input_section_type
*new_section
;
2243 bfd
*abfd
= link_info
.output_bfd
;
2245 /* Discard sections marked with SEC_EXCLUDE. */
2246 discard
= (flags
& SEC_EXCLUDE
) != 0;
2248 /* Discard input sections which are assigned to a section named
2249 DISCARD_SECTION_NAME. */
2250 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2253 /* Discard debugging sections if we are stripping debugging
2255 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2256 && (flags
& SEC_DEBUGGING
) != 0)
2261 if (section
->output_section
== NULL
)
2263 /* This prevents future calls from assigning this section. */
2264 section
->output_section
= bfd_abs_section_ptr
;
2271 if (sflag_info
->flags_initialized
== FALSE
)
2272 bfd_lookup_section_flags (&link_info
, sflag_info
);
2274 if (sflag_info
->only_with_flags
!= 0
2275 && sflag_info
->not_with_flags
!= 0
2276 && ((sflag_info
->not_with_flags
& flags
) != 0
2277 || (sflag_info
->only_with_flags
& flags
)
2278 != sflag_info
->only_with_flags
))
2281 if (sflag_info
->only_with_flags
!= 0
2282 && (sflag_info
->only_with_flags
& flags
)
2283 != sflag_info
->only_with_flags
)
2286 if (sflag_info
->not_with_flags
!= 0
2287 && (sflag_info
->not_with_flags
& flags
) != 0)
2291 if (section
->output_section
!= NULL
)
2294 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2295 to an output section, because we want to be able to include a
2296 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2297 section (I don't know why we want to do this, but we do).
2298 build_link_order in ldwrite.c handles this case by turning
2299 the embedded SEC_NEVER_LOAD section into a fill. */
2300 flags
&= ~ SEC_NEVER_LOAD
;
2302 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2303 already been processed. One reason to do this is that on pe
2304 format targets, .text$foo sections go into .text and it's odd
2305 to see .text with SEC_LINK_ONCE set. */
2307 if (!link_info
.relocatable
)
2308 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2310 switch (output
->sectype
)
2312 case normal_section
:
2313 case overlay_section
:
2315 case noalloc_section
:
2316 flags
&= ~SEC_ALLOC
;
2318 case noload_section
:
2320 flags
|= SEC_NEVER_LOAD
;
2321 /* Unfortunately GNU ld has managed to evolve two different
2322 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2323 alloc, no contents section. All others get a noload, noalloc
2325 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2326 flags
&= ~SEC_HAS_CONTENTS
;
2328 flags
&= ~SEC_ALLOC
;
2332 if (output
->bfd_section
== NULL
)
2333 init_os (output
, flags
);
2335 /* If SEC_READONLY is not set in the input section, then clear
2336 it from the output section. */
2337 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2339 if (output
->bfd_section
->linker_has_input
)
2341 /* Only set SEC_READONLY flag on the first input section. */
2342 flags
&= ~ SEC_READONLY
;
2344 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2345 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2346 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2347 || ((flags
& SEC_MERGE
) != 0
2348 && output
->bfd_section
->entsize
!= section
->entsize
))
2350 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2351 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2354 output
->bfd_section
->flags
|= flags
;
2356 if (!output
->bfd_section
->linker_has_input
)
2358 output
->bfd_section
->linker_has_input
= 1;
2359 /* This must happen after flags have been updated. The output
2360 section may have been created before we saw its first input
2361 section, eg. for a data statement. */
2362 bfd_init_private_section_data (section
->owner
, section
,
2363 link_info
.output_bfd
,
2364 output
->bfd_section
,
2366 if ((flags
& SEC_MERGE
) != 0)
2367 output
->bfd_section
->entsize
= section
->entsize
;
2370 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2371 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2373 /* FIXME: This value should really be obtained from the bfd... */
2374 output
->block_value
= 128;
2377 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2378 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2380 section
->output_section
= output
->bfd_section
;
2382 if (!link_info
.relocatable
2383 && !stripped_excluded_sections
)
2385 asection
*s
= output
->bfd_section
->map_tail
.s
;
2386 output
->bfd_section
->map_tail
.s
= section
;
2387 section
->map_head
.s
= NULL
;
2388 section
->map_tail
.s
= s
;
2390 s
->map_head
.s
= section
;
2392 output
->bfd_section
->map_head
.s
= section
;
2395 /* Add a section reference to the list. */
2396 new_section
= new_stat (lang_input_section
, ptr
);
2397 new_section
->section
= section
;
2400 /* Handle wildcard sorting. This returns the lang_input_section which
2401 should follow the one we are going to create for SECTION and FILE,
2402 based on the sorting requirements of WILD. It returns NULL if the
2403 new section should just go at the end of the current list. */
2405 static lang_statement_union_type
*
2406 wild_sort (lang_wild_statement_type
*wild
,
2407 struct wildcard_list
*sec
,
2408 lang_input_statement_type
*file
,
2411 lang_statement_union_type
*l
;
2413 if (!wild
->filenames_sorted
2414 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2417 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2419 lang_input_section_type
*ls
;
2421 if (l
->header
.type
!= lang_input_section_enum
)
2423 ls
= &l
->input_section
;
2425 /* Sorting by filename takes precedence over sorting by section
2428 if (wild
->filenames_sorted
)
2430 const char *fn
, *ln
;
2434 /* The PE support for the .idata section as generated by
2435 dlltool assumes that files will be sorted by the name of
2436 the archive and then the name of the file within the
2439 if (file
->the_bfd
!= NULL
2440 && bfd_my_archive (file
->the_bfd
) != NULL
)
2442 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2447 fn
= file
->filename
;
2451 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2453 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2458 ln
= ls
->section
->owner
->filename
;
2462 i
= filename_cmp (fn
, ln
);
2471 fn
= file
->filename
;
2473 ln
= ls
->section
->owner
->filename
;
2475 i
= filename_cmp (fn
, ln
);
2483 /* Here either the files are not sorted by name, or we are
2484 looking at the sections for this file. */
2486 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2487 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2494 /* Expand a wild statement for a particular FILE. SECTION may be
2495 NULL, in which case it is a wild card. */
2498 output_section_callback (lang_wild_statement_type
*ptr
,
2499 struct wildcard_list
*sec
,
2501 lang_input_statement_type
*file
,
2504 lang_statement_union_type
*before
;
2505 lang_output_section_statement_type
*os
;
2507 os
= (lang_output_section_statement_type
*) output
;
2509 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2510 if (unique_section_p (section
, os
))
2513 before
= wild_sort (ptr
, sec
, file
, section
);
2515 /* Here BEFORE points to the lang_input_section which
2516 should follow the one we are about to add. If BEFORE
2517 is NULL, then the section should just go at the end
2518 of the current list. */
2521 lang_add_section (&ptr
->children
, section
, os
);
2524 lang_statement_list_type list
;
2525 lang_statement_union_type
**pp
;
2527 lang_list_init (&list
);
2528 lang_add_section (&list
, section
, os
);
2530 /* If we are discarding the section, LIST.HEAD will
2532 if (list
.head
!= NULL
)
2534 ASSERT (list
.head
->header
.next
== NULL
);
2536 for (pp
= &ptr
->children
.head
;
2538 pp
= &(*pp
)->header
.next
)
2539 ASSERT (*pp
!= NULL
);
2541 list
.head
->header
.next
= *pp
;
2547 /* Check if all sections in a wild statement for a particular FILE
2551 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2552 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2554 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2557 lang_output_section_statement_type
*os
;
2559 os
= (lang_output_section_statement_type
*) output
;
2561 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2562 if (unique_section_p (section
, os
))
2565 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2566 os
->all_input_readonly
= FALSE
;
2569 /* This is passed a file name which must have been seen already and
2570 added to the statement tree. We will see if it has been opened
2571 already and had its symbols read. If not then we'll read it. */
2573 static lang_input_statement_type
*
2574 lookup_name (const char *name
)
2576 lang_input_statement_type
*search
;
2578 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2580 search
= (lang_input_statement_type
*) search
->next_real_file
)
2582 /* Use the local_sym_name as the name of the file that has
2583 already been loaded as filename might have been transformed
2584 via the search directory lookup mechanism. */
2585 const char *filename
= search
->local_sym_name
;
2587 if (filename
!= NULL
2588 && filename_cmp (filename
, name
) == 0)
2593 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2594 default_target
, FALSE
);
2596 /* If we have already added this file, or this file is not real
2597 don't add this file. */
2598 if (search
->flags
.loaded
|| !search
->flags
.real
)
2601 if (! load_symbols (search
, NULL
))
2607 /* Save LIST as a list of libraries whose symbols should not be exported. */
2612 struct excluded_lib
*next
;
2614 static struct excluded_lib
*excluded_libs
;
2617 add_excluded_libs (const char *list
)
2619 const char *p
= list
, *end
;
2623 struct excluded_lib
*entry
;
2624 end
= strpbrk (p
, ",:");
2626 end
= p
+ strlen (p
);
2627 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2628 entry
->next
= excluded_libs
;
2629 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2630 memcpy (entry
->name
, p
, end
- p
);
2631 entry
->name
[end
- p
] = '\0';
2632 excluded_libs
= entry
;
2640 check_excluded_libs (bfd
*abfd
)
2642 struct excluded_lib
*lib
= excluded_libs
;
2646 int len
= strlen (lib
->name
);
2647 const char *filename
= lbasename (abfd
->filename
);
2649 if (strcmp (lib
->name
, "ALL") == 0)
2651 abfd
->no_export
= TRUE
;
2655 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2656 && (filename
[len
] == '\0'
2657 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2658 && filename
[len
+ 2] == '\0')))
2660 abfd
->no_export
= TRUE
;
2668 /* Get the symbols for an input file. */
2671 load_symbols (lang_input_statement_type
*entry
,
2672 lang_statement_list_type
*place
)
2676 if (entry
->flags
.loaded
)
2679 ldfile_open_file (entry
);
2681 /* Do not process further if the file was missing. */
2682 if (entry
->flags
.missing_file
)
2685 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2686 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2689 struct lang_input_statement_flags save_flags
;
2691 err
= bfd_get_error ();
2693 /* See if the emulation has some special knowledge. */
2694 if (ldemul_unrecognized_file (entry
))
2697 if (err
== bfd_error_file_ambiguously_recognized
)
2701 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2702 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2703 for (p
= matching
; *p
!= NULL
; p
++)
2707 else if (err
!= bfd_error_file_not_recognized
2709 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2711 bfd_close (entry
->the_bfd
);
2712 entry
->the_bfd
= NULL
;
2714 /* Try to interpret the file as a linker script. */
2715 save_flags
= input_flags
;
2716 ldfile_open_command_file (entry
->filename
);
2718 push_stat_ptr (place
);
2719 input_flags
.add_DT_NEEDED_for_regular
2720 = entry
->flags
.add_DT_NEEDED_for_regular
;
2721 input_flags
.add_DT_NEEDED_for_dynamic
2722 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2723 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2724 input_flags
.dynamic
= entry
->flags
.dynamic
;
2726 ldfile_assumed_script
= TRUE
;
2727 parser_input
= input_script
;
2729 ldfile_assumed_script
= FALSE
;
2731 /* missing_file is sticky. sysrooted will already have been
2732 restored when seeing EOF in yyparse, but no harm to restore
2734 save_flags
.missing_file
|= input_flags
.missing_file
;
2735 input_flags
= save_flags
;
2741 if (ldemul_recognized_file (entry
))
2744 /* We don't call ldlang_add_file for an archive. Instead, the
2745 add_symbols entry point will call ldlang_add_file, via the
2746 add_archive_element callback, for each element of the archive
2748 switch (bfd_get_format (entry
->the_bfd
))
2754 #ifdef ENABLE_PLUGINS
2755 if (!entry
->flags
.reload
)
2757 ldlang_add_file (entry
);
2758 if (trace_files
|| trace_file_tries
)
2759 info_msg ("%I\n", entry
);
2763 check_excluded_libs (entry
->the_bfd
);
2765 if (entry
->flags
.whole_archive
)
2768 bfd_boolean loaded
= TRUE
;
2773 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2778 if (! bfd_check_format (member
, bfd_object
))
2780 einfo (_("%F%B: member %B in archive is not an object\n"),
2781 entry
->the_bfd
, member
);
2786 if (!(*link_info
.callbacks
2787 ->add_archive_element
) (&link_info
, member
,
2788 "--whole-archive", &subsbfd
))
2791 /* Potentially, the add_archive_element hook may have set a
2792 substitute BFD for us. */
2793 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2795 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2800 entry
->flags
.loaded
= loaded
;
2806 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2807 entry
->flags
.loaded
= TRUE
;
2809 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2811 return entry
->flags
.loaded
;
2814 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2815 may be NULL, indicating that it is a wildcard. Separate
2816 lang_input_section statements are created for each part of the
2817 expansion; they are added after the wild statement S. OUTPUT is
2818 the output section. */
2821 wild (lang_wild_statement_type
*s
,
2822 const char *target ATTRIBUTE_UNUSED
,
2823 lang_output_section_statement_type
*output
)
2825 struct wildcard_list
*sec
;
2827 if (s
->handler_data
[0]
2828 && s
->handler_data
[0]->spec
.sorted
== by_name
2829 && !s
->filenames_sorted
)
2831 lang_section_bst_type
*tree
;
2833 walk_wild (s
, output_section_callback_fast
, output
);
2838 output_section_callback_tree_to_list (s
, tree
, output
);
2843 walk_wild (s
, output_section_callback
, output
);
2845 if (default_common_section
== NULL
)
2846 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2847 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2849 /* Remember the section that common is going to in case we
2850 later get something which doesn't know where to put it. */
2851 default_common_section
= output
;
2856 /* Return TRUE iff target is the sought target. */
2859 get_target (const bfd_target
*target
, void *data
)
2861 const char *sought
= (const char *) data
;
2863 return strcmp (target
->name
, sought
) == 0;
2866 /* Like strcpy() but convert to lower case as well. */
2869 stricpy (char *dest
, char *src
)
2873 while ((c
= *src
++) != 0)
2874 *dest
++ = TOLOWER (c
);
2879 /* Remove the first occurrence of needle (if any) in haystack
2883 strcut (char *haystack
, char *needle
)
2885 haystack
= strstr (haystack
, needle
);
2891 for (src
= haystack
+ strlen (needle
); *src
;)
2892 *haystack
++ = *src
++;
2898 /* Compare two target format name strings.
2899 Return a value indicating how "similar" they are. */
2902 name_compare (char *first
, char *second
)
2908 copy1
= (char *) xmalloc (strlen (first
) + 1);
2909 copy2
= (char *) xmalloc (strlen (second
) + 1);
2911 /* Convert the names to lower case. */
2912 stricpy (copy1
, first
);
2913 stricpy (copy2
, second
);
2915 /* Remove size and endian strings from the name. */
2916 strcut (copy1
, "big");
2917 strcut (copy1
, "little");
2918 strcut (copy2
, "big");
2919 strcut (copy2
, "little");
2921 /* Return a value based on how many characters match,
2922 starting from the beginning. If both strings are
2923 the same then return 10 * their length. */
2924 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2925 if (copy1
[result
] == 0)
2937 /* Set by closest_target_match() below. */
2938 static const bfd_target
*winner
;
2940 /* Scan all the valid bfd targets looking for one that has the endianness
2941 requirement that was specified on the command line, and is the nearest
2942 match to the original output target. */
2945 closest_target_match (const bfd_target
*target
, void *data
)
2947 const bfd_target
*original
= (const bfd_target
*) data
;
2949 if (command_line
.endian
== ENDIAN_BIG
2950 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2953 if (command_line
.endian
== ENDIAN_LITTLE
2954 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2957 /* Must be the same flavour. */
2958 if (target
->flavour
!= original
->flavour
)
2961 /* Ignore generic big and little endian elf vectors. */
2962 if (strcmp (target
->name
, "elf32-big") == 0
2963 || strcmp (target
->name
, "elf64-big") == 0
2964 || strcmp (target
->name
, "elf32-little") == 0
2965 || strcmp (target
->name
, "elf64-little") == 0)
2968 /* If we have not found a potential winner yet, then record this one. */
2975 /* Oh dear, we now have two potential candidates for a successful match.
2976 Compare their names and choose the better one. */
2977 if (name_compare (target
->name
, original
->name
)
2978 > name_compare (winner
->name
, original
->name
))
2981 /* Keep on searching until wqe have checked them all. */
2985 /* Return the BFD target format of the first input file. */
2988 get_first_input_target (void)
2990 char *target
= NULL
;
2992 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2994 if (s
->header
.type
== lang_input_statement_enum
2997 ldfile_open_file (s
);
2999 if (s
->the_bfd
!= NULL
3000 && bfd_check_format (s
->the_bfd
, bfd_object
))
3002 target
= bfd_get_target (s
->the_bfd
);
3014 lang_get_output_target (void)
3018 /* Has the user told us which output format to use? */
3019 if (output_target
!= NULL
)
3020 return output_target
;
3022 /* No - has the current target been set to something other than
3024 if (current_target
!= default_target
&& current_target
!= NULL
)
3025 return current_target
;
3027 /* No - can we determine the format of the first input file? */
3028 target
= get_first_input_target ();
3032 /* Failed - use the default output target. */
3033 return default_target
;
3036 /* Open the output file. */
3039 open_output (const char *name
)
3041 output_target
= lang_get_output_target ();
3043 /* Has the user requested a particular endianness on the command
3045 if (command_line
.endian
!= ENDIAN_UNSET
)
3047 const bfd_target
*target
;
3048 enum bfd_endian desired_endian
;
3050 /* Get the chosen target. */
3051 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3053 /* If the target is not supported, we cannot do anything. */
3056 if (command_line
.endian
== ENDIAN_BIG
)
3057 desired_endian
= BFD_ENDIAN_BIG
;
3059 desired_endian
= BFD_ENDIAN_LITTLE
;
3061 /* See if the target has the wrong endianness. This should
3062 not happen if the linker script has provided big and
3063 little endian alternatives, but some scrips don't do
3065 if (target
->byteorder
!= desired_endian
)
3067 /* If it does, then see if the target provides
3068 an alternative with the correct endianness. */
3069 if (target
->alternative_target
!= NULL
3070 && (target
->alternative_target
->byteorder
== desired_endian
))
3071 output_target
= target
->alternative_target
->name
;
3074 /* Try to find a target as similar as possible to
3075 the default target, but which has the desired
3076 endian characteristic. */
3077 bfd_search_for_target (closest_target_match
,
3080 /* Oh dear - we could not find any targets that
3081 satisfy our requirements. */
3083 einfo (_("%P: warning: could not find any targets"
3084 " that match endianness requirement\n"));
3086 output_target
= winner
->name
;
3092 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3094 if (link_info
.output_bfd
== NULL
)
3096 if (bfd_get_error () == bfd_error_invalid_target
)
3097 einfo (_("%P%F: target %s not found\n"), output_target
);
3099 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3102 delete_output_file_on_failure
= TRUE
;
3104 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3105 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3106 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3107 ldfile_output_architecture
,
3108 ldfile_output_machine
))
3109 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3111 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3112 if (link_info
.hash
== NULL
)
3113 einfo (_("%P%F: can not create hash table: %E\n"));
3115 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3119 ldlang_open_output (lang_statement_union_type
*statement
)
3121 switch (statement
->header
.type
)
3123 case lang_output_statement_enum
:
3124 ASSERT (link_info
.output_bfd
== NULL
);
3125 open_output (statement
->output_statement
.name
);
3126 ldemul_set_output_arch ();
3127 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3128 link_info
.output_bfd
->flags
|= D_PAGED
;
3130 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3131 if (config
.text_read_only
)
3132 link_info
.output_bfd
->flags
|= WP_TEXT
;
3134 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3135 if (link_info
.traditional_format
)
3136 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3138 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3141 case lang_target_statement_enum
:
3142 current_target
= statement
->target_statement
.target
;
3149 /* Convert between addresses in bytes and sizes in octets.
3150 For currently supported targets, octets_per_byte is always a power
3151 of two, so we can use shifts. */
3152 #define TO_ADDR(X) ((X) >> opb_shift)
3153 #define TO_SIZE(X) ((X) << opb_shift)
3155 /* Support the above. */
3156 static unsigned int opb_shift
= 0;
3161 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3162 ldfile_output_machine
);
3165 while ((x
& 1) == 0)
3173 /* Open all the input files. */
3177 OPEN_BFD_NORMAL
= 0,
3181 #ifdef ENABLE_PLUGINS
3182 static lang_input_statement_type
*plugin_insert
= NULL
;
3186 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3188 for (; s
!= NULL
; s
= s
->header
.next
)
3190 switch (s
->header
.type
)
3192 case lang_constructors_statement_enum
:
3193 open_input_bfds (constructor_list
.head
, mode
);
3195 case lang_output_section_statement_enum
:
3196 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3198 case lang_wild_statement_enum
:
3199 /* Maybe we should load the file's symbols. */
3200 if ((mode
& OPEN_BFD_RESCAN
) == 0
3201 && s
->wild_statement
.filename
3202 && !wildcardp (s
->wild_statement
.filename
)
3203 && !archive_path (s
->wild_statement
.filename
))
3204 lookup_name (s
->wild_statement
.filename
);
3205 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3207 case lang_group_statement_enum
:
3209 struct bfd_link_hash_entry
*undefs
;
3211 /* We must continually search the entries in the group
3212 until no new symbols are added to the list of undefined
3217 undefs
= link_info
.hash
->undefs_tail
;
3218 open_input_bfds (s
->group_statement
.children
.head
,
3219 mode
| OPEN_BFD_FORCE
);
3221 while (undefs
!= link_info
.hash
->undefs_tail
);
3224 case lang_target_statement_enum
:
3225 current_target
= s
->target_statement
.target
;
3227 case lang_input_statement_enum
:
3228 if (s
->input_statement
.flags
.real
)
3230 lang_statement_union_type
**os_tail
;
3231 lang_statement_list_type add
;
3233 s
->input_statement
.target
= current_target
;
3235 /* If we are being called from within a group, and this
3236 is an archive which has already been searched, then
3237 force it to be researched unless the whole archive
3238 has been loaded already. Do the same for a rescan. */
3239 if (mode
!= OPEN_BFD_NORMAL
3240 #ifdef ENABLE_PLUGINS
3241 && ((mode
& OPEN_BFD_RESCAN
) == 0
3242 || plugin_insert
== NULL
)
3244 && !s
->input_statement
.flags
.whole_archive
3245 && s
->input_statement
.flags
.loaded
3246 && bfd_check_format (s
->input_statement
.the_bfd
,
3248 s
->input_statement
.flags
.loaded
= FALSE
;
3249 #ifdef ENABLE_PLUGINS
3250 /* When rescanning, reload --as-needed shared libs. */
3251 else if ((mode
& OPEN_BFD_RESCAN
) != 0
3252 && plugin_insert
== NULL
3253 && s
->input_statement
.flags
.loaded
3254 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3255 && ((s
->input_statement
.the_bfd
->flags
) & DYNAMIC
) != 0
3256 && plugin_should_reload (s
->input_statement
.the_bfd
))
3258 s
->input_statement
.flags
.loaded
= FALSE
;
3259 s
->input_statement
.flags
.reload
= TRUE
;
3263 os_tail
= lang_output_section_statement
.tail
;
3264 lang_list_init (&add
);
3266 if (! load_symbols (&s
->input_statement
, &add
))
3267 config
.make_executable
= FALSE
;
3269 if (add
.head
!= NULL
)
3271 /* If this was a script with output sections then
3272 tack any added statements on to the end of the
3273 list. This avoids having to reorder the output
3274 section statement list. Very likely the user
3275 forgot -T, and whatever we do here will not meet
3276 naive user expectations. */
3277 if (os_tail
!= lang_output_section_statement
.tail
)
3279 einfo (_("%P: warning: %s contains output sections;"
3280 " did you forget -T?\n"),
3281 s
->input_statement
.filename
);
3282 *stat_ptr
->tail
= add
.head
;
3283 stat_ptr
->tail
= add
.tail
;
3287 *add
.tail
= s
->header
.next
;
3288 s
->header
.next
= add
.head
;
3292 #ifdef ENABLE_PLUGINS
3293 /* If we have found the point at which a plugin added new
3294 files, clear plugin_insert to enable archive rescan. */
3295 if (&s
->input_statement
== plugin_insert
)
3296 plugin_insert
= NULL
;
3299 case lang_assignment_statement_enum
:
3300 if (s
->assignment_statement
.exp
->assign
.hidden
)
3301 /* This is from a --defsym on the command line. */
3302 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3309 /* Exit if any of the files were missing. */
3310 if (input_flags
.missing_file
)
3314 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3317 lang_track_definedness (const char *name
)
3319 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3320 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3323 /* New-function for the definedness hash table. */
3325 static struct bfd_hash_entry
*
3326 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3327 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3328 const char *name ATTRIBUTE_UNUSED
)
3330 struct lang_definedness_hash_entry
*ret
3331 = (struct lang_definedness_hash_entry
*) entry
;
3334 ret
= (struct lang_definedness_hash_entry
*)
3335 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3338 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3340 ret
->iteration
= -1;
3344 /* Return the iteration when the definition of NAME was last updated. A
3345 value of -1 means that the symbol is not defined in the linker script
3346 or the command line, but may be defined in the linker symbol table. */
3349 lang_symbol_definition_iteration (const char *name
)
3351 struct lang_definedness_hash_entry
*defentry
3352 = (struct lang_definedness_hash_entry
*)
3353 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3355 /* We've already created this one on the presence of DEFINED in the
3356 script, so it can't be NULL unless something is borked elsewhere in
3358 if (defentry
== NULL
)
3361 return defentry
->iteration
;
3364 /* Update the definedness state of NAME. */
3367 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3369 struct lang_definedness_hash_entry
*defentry
3370 = (struct lang_definedness_hash_entry
*)
3371 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3373 /* We don't keep track of symbols not tested with DEFINED. */
3374 if (defentry
== NULL
)
3377 /* If the symbol was already defined, and not from an earlier statement
3378 iteration, don't update the definedness iteration, because that'd
3379 make the symbol seem defined in the linker script at this point, and
3380 it wasn't; it was defined in some object. If we do anyway, DEFINED
3381 would start to yield false before this point and the construct "sym =
3382 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3384 if (h
->type
!= bfd_link_hash_undefined
3385 && h
->type
!= bfd_link_hash_common
3386 && h
->type
!= bfd_link_hash_new
3387 && defentry
->iteration
== -1)
3390 defentry
->iteration
= lang_statement_iteration
;
3393 /* Add the supplied name to the symbol table as an undefined reference.
3394 This is a two step process as the symbol table doesn't even exist at
3395 the time the ld command line is processed. First we put the name
3396 on a list, then, once the output file has been opened, transfer the
3397 name to the symbol table. */
3399 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3401 #define ldlang_undef_chain_list_head entry_symbol.next
3404 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3406 ldlang_undef_chain_list_type
*new_undef
;
3408 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3409 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3410 new_undef
->next
= ldlang_undef_chain_list_head
;
3411 ldlang_undef_chain_list_head
= new_undef
;
3413 new_undef
->name
= xstrdup (name
);
3415 if (link_info
.output_bfd
!= NULL
)
3416 insert_undefined (new_undef
->name
);
3419 /* Insert NAME as undefined in the symbol table. */
3422 insert_undefined (const char *name
)
3424 struct bfd_link_hash_entry
*h
;
3426 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3428 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3429 if (h
->type
== bfd_link_hash_new
)
3431 h
->type
= bfd_link_hash_undefined
;
3432 h
->u
.undef
.abfd
= NULL
;
3433 bfd_link_add_undef (link_info
.hash
, h
);
3437 /* Run through the list of undefineds created above and place them
3438 into the linker hash table as undefined symbols belonging to the
3442 lang_place_undefineds (void)
3444 ldlang_undef_chain_list_type
*ptr
;
3446 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3447 insert_undefined (ptr
->name
);
3450 /* Check for all readonly or some readwrite sections. */
3453 check_input_sections
3454 (lang_statement_union_type
*s
,
3455 lang_output_section_statement_type
*output_section_statement
)
3457 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3459 switch (s
->header
.type
)
3461 case lang_wild_statement_enum
:
3462 walk_wild (&s
->wild_statement
, check_section_callback
,
3463 output_section_statement
);
3464 if (! output_section_statement
->all_input_readonly
)
3467 case lang_constructors_statement_enum
:
3468 check_input_sections (constructor_list
.head
,
3469 output_section_statement
);
3470 if (! output_section_statement
->all_input_readonly
)
3473 case lang_group_statement_enum
:
3474 check_input_sections (s
->group_statement
.children
.head
,
3475 output_section_statement
);
3476 if (! output_section_statement
->all_input_readonly
)
3485 /* Update wildcard statements if needed. */
3488 update_wild_statements (lang_statement_union_type
*s
)
3490 struct wildcard_list
*sec
;
3492 switch (sort_section
)
3502 for (; s
!= NULL
; s
= s
->header
.next
)
3504 switch (s
->header
.type
)
3509 case lang_wild_statement_enum
:
3510 sec
= s
->wild_statement
.section_list
;
3511 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3514 switch (sec
->spec
.sorted
)
3517 sec
->spec
.sorted
= sort_section
;
3520 if (sort_section
== by_alignment
)
3521 sec
->spec
.sorted
= by_name_alignment
;
3524 if (sort_section
== by_name
)
3525 sec
->spec
.sorted
= by_alignment_name
;
3533 case lang_constructors_statement_enum
:
3534 update_wild_statements (constructor_list
.head
);
3537 case lang_output_section_statement_enum
:
3538 update_wild_statements
3539 (s
->output_section_statement
.children
.head
);
3542 case lang_group_statement_enum
:
3543 update_wild_statements (s
->group_statement
.children
.head
);
3551 /* Open input files and attach to output sections. */
3554 map_input_to_output_sections
3555 (lang_statement_union_type
*s
, const char *target
,
3556 lang_output_section_statement_type
*os
)
3558 for (; s
!= NULL
; s
= s
->header
.next
)
3560 lang_output_section_statement_type
*tos
;
3563 switch (s
->header
.type
)
3565 case lang_wild_statement_enum
:
3566 wild (&s
->wild_statement
, target
, os
);
3568 case lang_constructors_statement_enum
:
3569 map_input_to_output_sections (constructor_list
.head
,
3573 case lang_output_section_statement_enum
:
3574 tos
= &s
->output_section_statement
;
3575 if (tos
->constraint
!= 0)
3577 if (tos
->constraint
!= ONLY_IF_RW
3578 && tos
->constraint
!= ONLY_IF_RO
)
3580 tos
->all_input_readonly
= TRUE
;
3581 check_input_sections (tos
->children
.head
, tos
);
3582 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3584 tos
->constraint
= -1;
3588 map_input_to_output_sections (tos
->children
.head
,
3592 case lang_output_statement_enum
:
3594 case lang_target_statement_enum
:
3595 target
= s
->target_statement
.target
;
3597 case lang_group_statement_enum
:
3598 map_input_to_output_sections (s
->group_statement
.children
.head
,
3602 case lang_data_statement_enum
:
3603 /* Make sure that any sections mentioned in the expression
3605 exp_init_os (s
->data_statement
.exp
);
3606 /* The output section gets CONTENTS, ALLOC and LOAD, but
3607 these may be overridden by the script. */
3608 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3609 switch (os
->sectype
)
3611 case normal_section
:
3612 case overlay_section
:
3614 case noalloc_section
:
3615 flags
= SEC_HAS_CONTENTS
;
3617 case noload_section
:
3618 if (bfd_get_flavour (link_info
.output_bfd
)
3619 == bfd_target_elf_flavour
)
3620 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3622 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3625 if (os
->bfd_section
== NULL
)
3626 init_os (os
, flags
);
3628 os
->bfd_section
->flags
|= flags
;
3630 case lang_input_section_enum
:
3632 case lang_fill_statement_enum
:
3633 case lang_object_symbols_statement_enum
:
3634 case lang_reloc_statement_enum
:
3635 case lang_padding_statement_enum
:
3636 case lang_input_statement_enum
:
3637 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3640 case lang_assignment_statement_enum
:
3641 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3644 /* Make sure that any sections mentioned in the assignment
3646 exp_init_os (s
->assignment_statement
.exp
);
3648 case lang_address_statement_enum
:
3649 /* Mark the specified section with the supplied address.
3650 If this section was actually a segment marker, then the
3651 directive is ignored if the linker script explicitly
3652 processed the segment marker. Originally, the linker
3653 treated segment directives (like -Ttext on the
3654 command-line) as section directives. We honor the
3655 section directive semantics for backwards compatibilty;
3656 linker scripts that do not specifically check for
3657 SEGMENT_START automatically get the old semantics. */
3658 if (!s
->address_statement
.segment
3659 || !s
->address_statement
.segment
->used
)
3661 const char *name
= s
->address_statement
.section_name
;
3663 /* Create the output section statement here so that
3664 orphans with a set address will be placed after other
3665 script sections. If we let the orphan placement code
3666 place them in amongst other sections then the address
3667 will affect following script sections, which is
3668 likely to surprise naive users. */
3669 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3670 tos
->addr_tree
= s
->address_statement
.address
;
3671 if (tos
->bfd_section
== NULL
)
3675 case lang_insert_statement_enum
:
3681 /* An insert statement snips out all the linker statements from the
3682 start of the list and places them after the output section
3683 statement specified by the insert. This operation is complicated
3684 by the fact that we keep a doubly linked list of output section
3685 statements as well as the singly linked list of all statements. */
3688 process_insert_statements (void)
3690 lang_statement_union_type
**s
;
3691 lang_output_section_statement_type
*first_os
= NULL
;
3692 lang_output_section_statement_type
*last_os
= NULL
;
3693 lang_output_section_statement_type
*os
;
3695 /* "start of list" is actually the statement immediately after
3696 the special abs_section output statement, so that it isn't
3698 s
= &lang_output_section_statement
.head
;
3699 while (*(s
= &(*s
)->header
.next
) != NULL
)
3701 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3703 /* Keep pointers to the first and last output section
3704 statement in the sequence we may be about to move. */
3705 os
= &(*s
)->output_section_statement
;
3707 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3710 /* Set constraint negative so that lang_output_section_find
3711 won't match this output section statement. At this
3712 stage in linking constraint has values in the range
3713 [-1, ONLY_IN_RW]. */
3714 last_os
->constraint
= -2 - last_os
->constraint
;
3715 if (first_os
== NULL
)
3718 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3720 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3721 lang_output_section_statement_type
*where
;
3722 lang_statement_union_type
**ptr
;
3723 lang_statement_union_type
*first
;
3725 where
= lang_output_section_find (i
->where
);
3726 if (where
!= NULL
&& i
->is_before
)
3729 where
= where
->prev
;
3730 while (where
!= NULL
&& where
->constraint
< 0);
3734 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3738 /* Deal with reordering the output section statement list. */
3739 if (last_os
!= NULL
)
3741 asection
*first_sec
, *last_sec
;
3742 struct lang_output_section_statement_struct
**next
;
3744 /* Snip out the output sections we are moving. */
3745 first_os
->prev
->next
= last_os
->next
;
3746 if (last_os
->next
== NULL
)
3748 next
= &first_os
->prev
->next
;
3749 lang_output_section_statement
.tail
3750 = (lang_statement_union_type
**) next
;
3753 last_os
->next
->prev
= first_os
->prev
;
3754 /* Add them in at the new position. */
3755 last_os
->next
= where
->next
;
3756 if (where
->next
== NULL
)
3758 next
= &last_os
->next
;
3759 lang_output_section_statement
.tail
3760 = (lang_statement_union_type
**) next
;
3763 where
->next
->prev
= last_os
;
3764 first_os
->prev
= where
;
3765 where
->next
= first_os
;
3767 /* Move the bfd sections in the same way. */
3770 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3772 os
->constraint
= -2 - os
->constraint
;
3773 if (os
->bfd_section
!= NULL
3774 && os
->bfd_section
->owner
!= NULL
)
3776 last_sec
= os
->bfd_section
;
3777 if (first_sec
== NULL
)
3778 first_sec
= last_sec
;
3783 if (last_sec
!= NULL
)
3785 asection
*sec
= where
->bfd_section
;
3787 sec
= output_prev_sec_find (where
);
3789 /* The place we want to insert must come after the
3790 sections we are moving. So if we find no
3791 section or if the section is the same as our
3792 last section, then no move is needed. */
3793 if (sec
!= NULL
&& sec
!= last_sec
)
3795 /* Trim them off. */
3796 if (first_sec
->prev
!= NULL
)
3797 first_sec
->prev
->next
= last_sec
->next
;
3799 link_info
.output_bfd
->sections
= last_sec
->next
;
3800 if (last_sec
->next
!= NULL
)
3801 last_sec
->next
->prev
= first_sec
->prev
;
3803 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3805 last_sec
->next
= sec
->next
;
3806 if (sec
->next
!= NULL
)
3807 sec
->next
->prev
= last_sec
;
3809 link_info
.output_bfd
->section_last
= last_sec
;
3810 first_sec
->prev
= sec
;
3811 sec
->next
= first_sec
;
3819 ptr
= insert_os_after (where
);
3820 /* Snip everything after the abs_section output statement we
3821 know is at the start of the list, up to and including
3822 the insert statement we are currently processing. */
3823 first
= lang_output_section_statement
.head
->header
.next
;
3824 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3825 /* Add them back where they belong. */
3828 statement_list
.tail
= s
;
3830 s
= &lang_output_section_statement
.head
;
3834 /* Undo constraint twiddling. */
3835 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3837 os
->constraint
= -2 - os
->constraint
;
3843 /* An output section might have been removed after its statement was
3844 added. For example, ldemul_before_allocation can remove dynamic
3845 sections if they turn out to be not needed. Clean them up here. */
3848 strip_excluded_output_sections (void)
3850 lang_output_section_statement_type
*os
;
3852 /* Run lang_size_sections (if not already done). */
3853 if (expld
.phase
!= lang_mark_phase_enum
)
3855 expld
.phase
= lang_mark_phase_enum
;
3856 expld
.dataseg
.phase
= exp_dataseg_none
;
3857 one_lang_size_sections_pass (NULL
, FALSE
);
3858 lang_reset_memory_regions ();
3861 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3865 asection
*output_section
;
3866 bfd_boolean exclude
;
3868 if (os
->constraint
< 0)
3871 output_section
= os
->bfd_section
;
3872 if (output_section
== NULL
)
3875 exclude
= (output_section
->rawsize
== 0
3876 && (output_section
->flags
& SEC_KEEP
) == 0
3877 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3880 /* Some sections have not yet been sized, notably .gnu.version,
3881 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3882 input sections, so don't drop output sections that have such
3883 input sections unless they are also marked SEC_EXCLUDE. */
3884 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3888 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3889 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3890 && (s
->flags
& SEC_EXCLUDE
) == 0)
3897 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3898 output_section
->map_head
.link_order
= NULL
;
3899 output_section
->map_tail
.link_order
= NULL
;
3903 /* We don't set bfd_section to NULL since bfd_section of the
3904 removed output section statement may still be used. */
3905 if (!os
->section_relative_symbol
3906 && !os
->update_dot_tree
)
3908 output_section
->flags
|= SEC_EXCLUDE
;
3909 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3910 link_info
.output_bfd
->section_count
--;
3914 /* Stop future calls to lang_add_section from messing with map_head
3915 and map_tail link_order fields. */
3916 stripped_excluded_sections
= TRUE
;
3920 print_output_section_statement
3921 (lang_output_section_statement_type
*output_section_statement
)
3923 asection
*section
= output_section_statement
->bfd_section
;
3926 if (output_section_statement
!= abs_output_section
)
3928 minfo ("\n%s", output_section_statement
->name
);
3930 if (section
!= NULL
)
3932 print_dot
= section
->vma
;
3934 len
= strlen (output_section_statement
->name
);
3935 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3940 while (len
< SECTION_NAME_MAP_LENGTH
)
3946 minfo ("0x%V %W", section
->vma
, section
->size
);
3948 if (section
->vma
!= section
->lma
)
3949 minfo (_(" load address 0x%V"), section
->lma
);
3951 if (output_section_statement
->update_dot_tree
!= NULL
)
3952 exp_fold_tree (output_section_statement
->update_dot_tree
,
3953 bfd_abs_section_ptr
, &print_dot
);
3959 print_statement_list (output_section_statement
->children
.head
,
3960 output_section_statement
);
3963 /* Scan for the use of the destination in the right hand side
3964 of an expression. In such cases we will not compute the
3965 correct expression, since the value of DST that is used on
3966 the right hand side will be its final value, not its value
3967 just before this expression is evaluated. */
3970 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3972 if (rhs
== NULL
|| dst
== NULL
)
3975 switch (rhs
->type
.node_class
)
3978 return (scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3979 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
));
3982 return (scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3983 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
));
3986 case etree_provided
:
3988 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3990 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3993 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3997 return strcmp (dst
, rhs
->value
.str
) == 0;
4002 return strcmp (dst
, rhs
->name
.name
) == 0;
4014 print_assignment (lang_assignment_statement_type
*assignment
,
4015 lang_output_section_statement_type
*output_section
)
4019 bfd_boolean computation_is_valid
= TRUE
;
4023 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4026 if (assignment
->exp
->type
.node_class
== etree_assert
)
4029 tree
= assignment
->exp
->assert_s
.child
;
4030 computation_is_valid
= TRUE
;
4034 const char *dst
= assignment
->exp
->assign
.dst
;
4036 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4037 tree
= assignment
->exp
->assign
.src
;
4038 computation_is_valid
= is_dot
|| !scan_for_self_assignment (dst
, tree
);
4041 osec
= output_section
->bfd_section
;
4043 osec
= bfd_abs_section_ptr
;
4044 exp_fold_tree (tree
, osec
, &print_dot
);
4045 if (expld
.result
.valid_p
)
4049 if (computation_is_valid
)
4051 value
= expld
.result
.value
;
4053 if (expld
.result
.section
!= NULL
)
4054 value
+= expld
.result
.section
->vma
;
4056 minfo ("0x%V", value
);
4062 struct bfd_link_hash_entry
*h
;
4064 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4065 FALSE
, FALSE
, TRUE
);
4068 value
= h
->u
.def
.value
;
4069 value
+= h
->u
.def
.section
->output_section
->vma
;
4070 value
+= h
->u
.def
.section
->output_offset
;
4072 minfo ("[0x%V]", value
);
4075 minfo ("[unresolved]");
4087 exp_print_tree (assignment
->exp
);
4092 print_input_statement (lang_input_statement_type
*statm
)
4094 if (statm
->filename
!= NULL
4095 && (statm
->the_bfd
== NULL
4096 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4097 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4100 /* Print all symbols defined in a particular section. This is called
4101 via bfd_link_hash_traverse, or by print_all_symbols. */
4104 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4106 asection
*sec
= (asection
*) ptr
;
4108 if ((hash_entry
->type
== bfd_link_hash_defined
4109 || hash_entry
->type
== bfd_link_hash_defweak
)
4110 && sec
== hash_entry
->u
.def
.section
)
4114 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4117 (hash_entry
->u
.def
.value
4118 + hash_entry
->u
.def
.section
->output_offset
4119 + hash_entry
->u
.def
.section
->output_section
->vma
));
4121 minfo (" %T\n", hash_entry
->root
.string
);
4128 hash_entry_addr_cmp (const void *a
, const void *b
)
4130 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4131 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4133 if (l
->u
.def
.value
< r
->u
.def
.value
)
4135 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4142 print_all_symbols (asection
*sec
)
4144 struct fat_user_section_struct
*ud
=
4145 (struct fat_user_section_struct
*) get_userdata (sec
);
4146 struct map_symbol_def
*def
;
4147 struct bfd_link_hash_entry
**entries
;
4153 *ud
->map_symbol_def_tail
= 0;
4155 /* Sort the symbols by address. */
4156 entries
= (struct bfd_link_hash_entry
**)
4157 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4159 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4160 entries
[i
] = def
->entry
;
4162 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4163 hash_entry_addr_cmp
);
4165 /* Print the symbols. */
4166 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4167 print_one_symbol (entries
[i
], sec
);
4169 obstack_free (&map_obstack
, entries
);
4172 /* Print information about an input section to the map file. */
4175 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4177 bfd_size_type size
= i
->size
;
4184 minfo ("%s", i
->name
);
4186 len
= 1 + strlen (i
->name
);
4187 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4192 while (len
< SECTION_NAME_MAP_LENGTH
)
4198 if (i
->output_section
!= NULL
4199 && i
->output_section
->owner
== link_info
.output_bfd
)
4200 addr
= i
->output_section
->vma
+ i
->output_offset
;
4208 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4210 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4212 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4224 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4227 if (i
->output_section
!= NULL
4228 && i
->output_section
->owner
== link_info
.output_bfd
)
4230 if (link_info
.reduce_memory_overheads
)
4231 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4233 print_all_symbols (i
);
4235 /* Update print_dot, but make sure that we do not move it
4236 backwards - this could happen if we have overlays and a
4237 later overlay is shorter than an earier one. */
4238 if (addr
+ TO_ADDR (size
) > print_dot
)
4239 print_dot
= addr
+ TO_ADDR (size
);
4244 print_fill_statement (lang_fill_statement_type
*fill
)
4248 fputs (" FILL mask 0x", config
.map_file
);
4249 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4250 fprintf (config
.map_file
, "%02x", *p
);
4251 fputs ("\n", config
.map_file
);
4255 print_data_statement (lang_data_statement_type
*data
)
4263 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4266 addr
= data
->output_offset
;
4267 if (data
->output_section
!= NULL
)
4268 addr
+= data
->output_section
->vma
;
4296 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4298 if (data
->exp
->type
.node_class
!= etree_value
)
4301 exp_print_tree (data
->exp
);
4306 print_dot
= addr
+ TO_ADDR (size
);
4309 /* Print an address statement. These are generated by options like
4313 print_address_statement (lang_address_statement_type
*address
)
4315 minfo (_("Address of section %s set to "), address
->section_name
);
4316 exp_print_tree (address
->address
);
4320 /* Print a reloc statement. */
4323 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4330 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4333 addr
= reloc
->output_offset
;
4334 if (reloc
->output_section
!= NULL
)
4335 addr
+= reloc
->output_section
->vma
;
4337 size
= bfd_get_reloc_size (reloc
->howto
);
4339 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4341 if (reloc
->name
!= NULL
)
4342 minfo ("%s+", reloc
->name
);
4344 minfo ("%s+", reloc
->section
->name
);
4346 exp_print_tree (reloc
->addend_exp
);
4350 print_dot
= addr
+ TO_ADDR (size
);
4354 print_padding_statement (lang_padding_statement_type
*s
)
4362 len
= sizeof " *fill*" - 1;
4363 while (len
< SECTION_NAME_MAP_LENGTH
)
4369 addr
= s
->output_offset
;
4370 if (s
->output_section
!= NULL
)
4371 addr
+= s
->output_section
->vma
;
4372 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4374 if (s
->fill
->size
!= 0)
4378 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4379 fprintf (config
.map_file
, "%02x", *p
);
4384 print_dot
= addr
+ TO_ADDR (s
->size
);
4388 print_wild_statement (lang_wild_statement_type
*w
,
4389 lang_output_section_statement_type
*os
)
4391 struct wildcard_list
*sec
;
4395 if (w
->filenames_sorted
)
4397 if (w
->filename
!= NULL
)
4398 minfo ("%s", w
->filename
);
4401 if (w
->filenames_sorted
)
4405 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4407 if (sec
->spec
.sorted
)
4409 if (sec
->spec
.exclude_name_list
!= NULL
)
4412 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4413 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4414 minfo (" %s", tmp
->name
);
4417 if (sec
->spec
.name
!= NULL
)
4418 minfo ("%s", sec
->spec
.name
);
4421 if (sec
->spec
.sorted
)
4430 print_statement_list (w
->children
.head
, os
);
4433 /* Print a group statement. */
4436 print_group (lang_group_statement_type
*s
,
4437 lang_output_section_statement_type
*os
)
4439 fprintf (config
.map_file
, "START GROUP\n");
4440 print_statement_list (s
->children
.head
, os
);
4441 fprintf (config
.map_file
, "END GROUP\n");
4444 /* Print the list of statements in S.
4445 This can be called for any statement type. */
4448 print_statement_list (lang_statement_union_type
*s
,
4449 lang_output_section_statement_type
*os
)
4453 print_statement (s
, os
);
4458 /* Print the first statement in statement list S.
4459 This can be called for any statement type. */
4462 print_statement (lang_statement_union_type
*s
,
4463 lang_output_section_statement_type
*os
)
4465 switch (s
->header
.type
)
4468 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4471 case lang_constructors_statement_enum
:
4472 if (constructor_list
.head
!= NULL
)
4474 if (constructors_sorted
)
4475 minfo (" SORT (CONSTRUCTORS)\n");
4477 minfo (" CONSTRUCTORS\n");
4478 print_statement_list (constructor_list
.head
, os
);
4481 case lang_wild_statement_enum
:
4482 print_wild_statement (&s
->wild_statement
, os
);
4484 case lang_address_statement_enum
:
4485 print_address_statement (&s
->address_statement
);
4487 case lang_object_symbols_statement_enum
:
4488 minfo (" CREATE_OBJECT_SYMBOLS\n");
4490 case lang_fill_statement_enum
:
4491 print_fill_statement (&s
->fill_statement
);
4493 case lang_data_statement_enum
:
4494 print_data_statement (&s
->data_statement
);
4496 case lang_reloc_statement_enum
:
4497 print_reloc_statement (&s
->reloc_statement
);
4499 case lang_input_section_enum
:
4500 print_input_section (s
->input_section
.section
, FALSE
);
4502 case lang_padding_statement_enum
:
4503 print_padding_statement (&s
->padding_statement
);
4505 case lang_output_section_statement_enum
:
4506 print_output_section_statement (&s
->output_section_statement
);
4508 case lang_assignment_statement_enum
:
4509 print_assignment (&s
->assignment_statement
, os
);
4511 case lang_target_statement_enum
:
4512 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4514 case lang_output_statement_enum
:
4515 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4516 if (output_target
!= NULL
)
4517 minfo (" %s", output_target
);
4520 case lang_input_statement_enum
:
4521 print_input_statement (&s
->input_statement
);
4523 case lang_group_statement_enum
:
4524 print_group (&s
->group_statement
, os
);
4526 case lang_insert_statement_enum
:
4527 minfo ("INSERT %s %s\n",
4528 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4529 s
->insert_statement
.where
);
4535 print_statements (void)
4537 print_statement_list (statement_list
.head
, abs_output_section
);
4540 /* Print the first N statements in statement list S to STDERR.
4541 If N == 0, nothing is printed.
4542 If N < 0, the entire list is printed.
4543 Intended to be called from GDB. */
4546 dprint_statement (lang_statement_union_type
*s
, int n
)
4548 FILE *map_save
= config
.map_file
;
4550 config
.map_file
= stderr
;
4553 print_statement_list (s
, abs_output_section
);
4556 while (s
&& --n
>= 0)
4558 print_statement (s
, abs_output_section
);
4563 config
.map_file
= map_save
;
4567 insert_pad (lang_statement_union_type
**ptr
,
4569 bfd_size_type alignment_needed
,
4570 asection
*output_section
,
4573 static fill_type zero_fill
;
4574 lang_statement_union_type
*pad
= NULL
;
4576 if (ptr
!= &statement_list
.head
)
4577 pad
= ((lang_statement_union_type
*)
4578 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4580 && pad
->header
.type
== lang_padding_statement_enum
4581 && pad
->padding_statement
.output_section
== output_section
)
4583 /* Use the existing pad statement. */
4585 else if ((pad
= *ptr
) != NULL
4586 && pad
->header
.type
== lang_padding_statement_enum
4587 && pad
->padding_statement
.output_section
== output_section
)
4589 /* Use the existing pad statement. */
4593 /* Make a new padding statement, linked into existing chain. */
4594 pad
= (lang_statement_union_type
*)
4595 stat_alloc (sizeof (lang_padding_statement_type
));
4596 pad
->header
.next
= *ptr
;
4598 pad
->header
.type
= lang_padding_statement_enum
;
4599 pad
->padding_statement
.output_section
= output_section
;
4602 pad
->padding_statement
.fill
= fill
;
4604 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4605 pad
->padding_statement
.size
= alignment_needed
;
4606 output_section
->size
+= alignment_needed
;
4609 /* Work out how much this section will move the dot point. */
4613 (lang_statement_union_type
**this_ptr
,
4614 lang_output_section_statement_type
*output_section_statement
,
4618 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4619 asection
*i
= is
->section
;
4621 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->flags
.just_syms
4622 && (i
->flags
& SEC_EXCLUDE
) == 0)
4624 bfd_size_type alignment_needed
;
4627 /* Align this section first to the input sections requirement,
4628 then to the output section's requirement. If this alignment
4629 is greater than any seen before, then record it too. Perform
4630 the alignment by inserting a magic 'padding' statement. */
4632 if (output_section_statement
->subsection_alignment
!= -1)
4633 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4635 o
= output_section_statement
->bfd_section
;
4636 if (o
->alignment_power
< i
->alignment_power
)
4637 o
->alignment_power
= i
->alignment_power
;
4639 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4641 if (alignment_needed
!= 0)
4643 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4644 dot
+= alignment_needed
;
4647 /* Remember where in the output section this input section goes. */
4649 i
->output_offset
= dot
- o
->vma
;
4651 /* Mark how big the output section must be to contain this now. */
4652 dot
+= TO_ADDR (i
->size
);
4653 o
->size
= TO_SIZE (dot
- o
->vma
);
4657 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4664 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4666 const asection
*sec1
= *(const asection
**) arg1
;
4667 const asection
*sec2
= *(const asection
**) arg2
;
4669 if (bfd_section_lma (sec1
->owner
, sec1
)
4670 < bfd_section_lma (sec2
->owner
, sec2
))
4672 else if (bfd_section_lma (sec1
->owner
, sec1
)
4673 > bfd_section_lma (sec2
->owner
, sec2
))
4675 else if (sec1
->id
< sec2
->id
)
4677 else if (sec1
->id
> sec2
->id
)
4683 #define IGNORE_SECTION(s) \
4684 ((s->flags & SEC_ALLOC) == 0 \
4685 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4686 && (s->flags & SEC_LOAD) == 0))
4688 /* Check to see if any allocated sections overlap with other allocated
4689 sections. This can happen if a linker script specifies the output
4690 section addresses of the two sections. Also check whether any memory
4691 region has overflowed. */
4694 lang_check_section_addresses (void)
4697 asection
**sections
, **spp
;
4704 lang_memory_region_type
*m
;
4706 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4709 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4710 sections
= (asection
**) xmalloc (amt
);
4712 /* Scan all sections in the output list. */
4714 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4716 /* Only consider loadable sections with real contents. */
4717 if (!(s
->flags
& SEC_LOAD
)
4718 || !(s
->flags
& SEC_ALLOC
)
4722 sections
[count
] = s
;
4729 qsort (sections
, (size_t) count
, sizeof (asection
*),
4730 sort_sections_by_lma
);
4735 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4736 for (count
--; count
; count
--)
4738 /* We must check the sections' LMA addresses not their VMA
4739 addresses because overlay sections can have overlapping VMAs
4740 but they must have distinct LMAs. */
4746 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4748 /* Look for an overlap. We have sorted sections by lma, so we
4749 know that s_start >= p_start. Besides the obvious case of
4750 overlap when the current section starts before the previous
4751 one ends, we also must have overlap if the previous section
4752 wraps around the address space. */
4753 if (s_start
<= p_end
4755 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4756 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4761 /* If any memory region has overflowed, report by how much.
4762 We do not issue this diagnostic for regions that had sections
4763 explicitly placed outside their bounds; os_region_check's
4764 diagnostics are adequate for that case.
4766 FIXME: It is conceivable that m->current - (m->origin + m->length)
4767 might overflow a 32-bit integer. There is, alas, no way to print
4768 a bfd_vma quantity in decimal. */
4769 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4770 if (m
->had_full_message
)
4771 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4772 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4776 /* Make sure the new address is within the region. We explicitly permit the
4777 current address to be at the exact end of the region when the address is
4778 non-zero, in case the region is at the end of addressable memory and the
4779 calculation wraps around. */
4782 os_region_check (lang_output_section_statement_type
*os
,
4783 lang_memory_region_type
*region
,
4787 if ((region
->current
< region
->origin
4788 || (region
->current
- region
->origin
> region
->length
))
4789 && ((region
->current
!= region
->origin
+ region
->length
)
4794 einfo (_("%X%P: address 0x%v of %B section `%s'"
4795 " is not within region `%s'\n"),
4797 os
->bfd_section
->owner
,
4798 os
->bfd_section
->name
,
4799 region
->name_list
.name
);
4801 else if (!region
->had_full_message
)
4803 region
->had_full_message
= TRUE
;
4805 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4806 os
->bfd_section
->owner
,
4807 os
->bfd_section
->name
,
4808 region
->name_list
.name
);
4813 /* Set the sizes for all the output sections. */
4816 lang_size_sections_1
4817 (lang_statement_union_type
**prev
,
4818 lang_output_section_statement_type
*output_section_statement
,
4822 bfd_boolean check_regions
)
4824 lang_statement_union_type
*s
;
4826 /* Size up the sections from their constituent parts. */
4827 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4829 switch (s
->header
.type
)
4831 case lang_output_section_statement_enum
:
4833 bfd_vma newdot
, after
;
4834 lang_output_section_statement_type
*os
;
4835 lang_memory_region_type
*r
;
4836 int section_alignment
= 0;
4838 os
= &s
->output_section_statement
;
4839 if (os
->constraint
== -1)
4842 /* FIXME: We shouldn't need to zero section vmas for ld -r
4843 here, in lang_insert_orphan, or in the default linker scripts.
4844 This is covering for coff backend linker bugs. See PR6945. */
4845 if (os
->addr_tree
== NULL
4846 && link_info
.relocatable
4847 && (bfd_get_flavour (link_info
.output_bfd
)
4848 == bfd_target_coff_flavour
))
4849 os
->addr_tree
= exp_intop (0);
4850 if (os
->addr_tree
!= NULL
)
4852 os
->processed_vma
= FALSE
;
4853 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4855 if (expld
.result
.valid_p
)
4857 dot
= expld
.result
.value
;
4858 if (expld
.result
.section
!= NULL
)
4859 dot
+= expld
.result
.section
->vma
;
4861 else if (expld
.phase
!= lang_mark_phase_enum
)
4862 einfo (_("%F%S: non constant or forward reference"
4863 " address expression for section %s\n"),
4864 os
->addr_tree
, os
->name
);
4867 if (os
->bfd_section
== NULL
)
4868 /* This section was removed or never actually created. */
4871 /* If this is a COFF shared library section, use the size and
4872 address from the input section. FIXME: This is COFF
4873 specific; it would be cleaner if there were some other way
4874 to do this, but nothing simple comes to mind. */
4875 if (((bfd_get_flavour (link_info
.output_bfd
)
4876 == bfd_target_ecoff_flavour
)
4877 || (bfd_get_flavour (link_info
.output_bfd
)
4878 == bfd_target_coff_flavour
))
4879 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4883 if (os
->children
.head
== NULL
4884 || os
->children
.head
->header
.next
!= NULL
4885 || (os
->children
.head
->header
.type
4886 != lang_input_section_enum
))
4887 einfo (_("%P%X: Internal error on COFF shared library"
4888 " section %s\n"), os
->name
);
4890 input
= os
->children
.head
->input_section
.section
;
4891 bfd_set_section_vma (os
->bfd_section
->owner
,
4893 bfd_section_vma (input
->owner
, input
));
4894 os
->bfd_section
->size
= input
->size
;
4899 if (bfd_is_abs_section (os
->bfd_section
))
4901 /* No matter what happens, an abs section starts at zero. */
4902 ASSERT (os
->bfd_section
->vma
== 0);
4906 if (os
->addr_tree
== NULL
)
4908 /* No address specified for this section, get one
4909 from the region specification. */
4910 if (os
->region
== NULL
4911 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4912 && os
->region
->name_list
.name
[0] == '*'
4913 && strcmp (os
->region
->name_list
.name
,
4914 DEFAULT_MEMORY_REGION
) == 0))
4916 os
->region
= lang_memory_default (os
->bfd_section
);
4919 /* If a loadable section is using the default memory
4920 region, and some non default memory regions were
4921 defined, issue an error message. */
4923 && !IGNORE_SECTION (os
->bfd_section
)
4924 && ! link_info
.relocatable
4926 && strcmp (os
->region
->name_list
.name
,
4927 DEFAULT_MEMORY_REGION
) == 0
4928 && lang_memory_region_list
!= NULL
4929 && (strcmp (lang_memory_region_list
->name_list
.name
,
4930 DEFAULT_MEMORY_REGION
) != 0
4931 || lang_memory_region_list
->next
!= NULL
)
4932 && expld
.phase
!= lang_mark_phase_enum
)
4934 /* By default this is an error rather than just a
4935 warning because if we allocate the section to the
4936 default memory region we can end up creating an
4937 excessively large binary, or even seg faulting when
4938 attempting to perform a negative seek. See
4939 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4940 for an example of this. This behaviour can be
4941 overridden by the using the --no-check-sections
4943 if (command_line
.check_section_addresses
)
4944 einfo (_("%P%F: error: no memory region specified"
4945 " for loadable section `%s'\n"),
4946 bfd_get_section_name (link_info
.output_bfd
,
4949 einfo (_("%P: warning: no memory region specified"
4950 " for loadable section `%s'\n"),
4951 bfd_get_section_name (link_info
.output_bfd
,
4955 newdot
= os
->region
->current
;
4956 section_alignment
= os
->bfd_section
->alignment_power
;
4959 section_alignment
= os
->section_alignment
;
4961 /* Align to what the section needs. */
4962 if (section_alignment
> 0)
4964 bfd_vma savedot
= newdot
;
4965 newdot
= align_power (newdot
, section_alignment
);
4967 if (newdot
!= savedot
4968 && (config
.warn_section_align
4969 || os
->addr_tree
!= NULL
)
4970 && expld
.phase
!= lang_mark_phase_enum
)
4971 einfo (_("%P: warning: changing start of section"
4972 " %s by %lu bytes\n"),
4973 os
->name
, (unsigned long) (newdot
- savedot
));
4976 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4978 os
->bfd_section
->output_offset
= 0;
4981 lang_size_sections_1 (&os
->children
.head
, os
,
4982 os
->fill
, newdot
, relax
, check_regions
);
4984 os
->processed_vma
= TRUE
;
4986 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4987 /* Except for some special linker created sections,
4988 no output section should change from zero size
4989 after strip_excluded_output_sections. A non-zero
4990 size on an ignored section indicates that some
4991 input section was not sized early enough. */
4992 ASSERT (os
->bfd_section
->size
== 0);
4995 dot
= os
->bfd_section
->vma
;
4997 /* Put the section within the requested block size, or
4998 align at the block boundary. */
5000 + TO_ADDR (os
->bfd_section
->size
)
5001 + os
->block_value
- 1)
5002 & - (bfd_vma
) os
->block_value
);
5004 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
5007 /* Set section lma. */
5010 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5014 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5015 os
->bfd_section
->lma
= lma
;
5017 else if (os
->lma_region
!= NULL
)
5019 bfd_vma lma
= os
->lma_region
->current
;
5021 if (section_alignment
> 0)
5022 lma
= align_power (lma
, section_alignment
);
5023 os
->bfd_section
->lma
= lma
;
5025 else if (r
->last_os
!= NULL
5026 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5031 last
= r
->last_os
->output_section_statement
.bfd_section
;
5033 /* A backwards move of dot should be accompanied by
5034 an explicit assignment to the section LMA (ie.
5035 os->load_base set) because backwards moves can
5036 create overlapping LMAs. */
5038 && os
->bfd_section
->size
!= 0
5039 && dot
+ os
->bfd_section
->size
<= last
->vma
)
5041 /* If dot moved backwards then leave lma equal to
5042 vma. This is the old default lma, which might
5043 just happen to work when the backwards move is
5044 sufficiently large. Nag if this changes anything,
5045 so people can fix their linker scripts. */
5047 if (last
->vma
!= last
->lma
)
5048 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5053 /* If this is an overlay, set the current lma to that
5054 at the end of the previous section. */
5055 if (os
->sectype
== overlay_section
)
5056 lma
= last
->lma
+ last
->size
;
5058 /* Otherwise, keep the same lma to vma relationship
5059 as the previous section. */
5061 lma
= dot
+ last
->lma
- last
->vma
;
5063 if (section_alignment
> 0)
5064 lma
= align_power (lma
, section_alignment
);
5065 os
->bfd_section
->lma
= lma
;
5068 os
->processed_lma
= TRUE
;
5070 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5073 /* Keep track of normal sections using the default
5074 lma region. We use this to set the lma for
5075 following sections. Overlays or other linker
5076 script assignment to lma might mean that the
5077 default lma == vma is incorrect.
5078 To avoid warnings about dot moving backwards when using
5079 -Ttext, don't start tracking sections until we find one
5080 of non-zero size or with lma set differently to vma. */
5081 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5082 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5083 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5084 && (os
->bfd_section
->size
!= 0
5085 || (r
->last_os
== NULL
5086 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5087 || (r
->last_os
!= NULL
5088 && dot
>= (r
->last_os
->output_section_statement
5089 .bfd_section
->vma
)))
5090 && os
->lma_region
== NULL
5091 && !link_info
.relocatable
)
5094 /* .tbss sections effectively have zero size. */
5095 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5096 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5097 || link_info
.relocatable
)
5098 dot
+= TO_ADDR (os
->bfd_section
->size
);
5100 if (os
->update_dot_tree
!= 0)
5101 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5103 /* Update dot in the region ?
5104 We only do this if the section is going to be allocated,
5105 since unallocated sections do not contribute to the region's
5106 overall size in memory. */
5107 if (os
->region
!= NULL
5108 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5110 os
->region
->current
= dot
;
5113 /* Make sure the new address is within the region. */
5114 os_region_check (os
, os
->region
, os
->addr_tree
,
5115 os
->bfd_section
->vma
);
5117 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5118 && (os
->bfd_section
->flags
& SEC_LOAD
))
5120 os
->lma_region
->current
5121 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5124 os_region_check (os
, os
->lma_region
, NULL
,
5125 os
->bfd_section
->lma
);
5131 case lang_constructors_statement_enum
:
5132 dot
= lang_size_sections_1 (&constructor_list
.head
,
5133 output_section_statement
,
5134 fill
, dot
, relax
, check_regions
);
5137 case lang_data_statement_enum
:
5139 unsigned int size
= 0;
5141 s
->data_statement
.output_offset
=
5142 dot
- output_section_statement
->bfd_section
->vma
;
5143 s
->data_statement
.output_section
=
5144 output_section_statement
->bfd_section
;
5146 /* We might refer to provided symbols in the expression, and
5147 need to mark them as needed. */
5148 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5150 switch (s
->data_statement
.type
)
5168 if (size
< TO_SIZE ((unsigned) 1))
5169 size
= TO_SIZE ((unsigned) 1);
5170 dot
+= TO_ADDR (size
);
5171 output_section_statement
->bfd_section
->size
+= size
;
5175 case lang_reloc_statement_enum
:
5179 s
->reloc_statement
.output_offset
=
5180 dot
- output_section_statement
->bfd_section
->vma
;
5181 s
->reloc_statement
.output_section
=
5182 output_section_statement
->bfd_section
;
5183 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5184 dot
+= TO_ADDR (size
);
5185 output_section_statement
->bfd_section
->size
+= size
;
5189 case lang_wild_statement_enum
:
5190 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5191 output_section_statement
,
5192 fill
, dot
, relax
, check_regions
);
5195 case lang_object_symbols_statement_enum
:
5196 link_info
.create_object_symbols_section
=
5197 output_section_statement
->bfd_section
;
5200 case lang_output_statement_enum
:
5201 case lang_target_statement_enum
:
5204 case lang_input_section_enum
:
5208 i
= s
->input_section
.section
;
5213 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5214 einfo (_("%P%F: can't relax section: %E\n"));
5218 dot
= size_input_section (prev
, output_section_statement
,
5219 output_section_statement
->fill
, dot
);
5223 case lang_input_statement_enum
:
5226 case lang_fill_statement_enum
:
5227 s
->fill_statement
.output_section
=
5228 output_section_statement
->bfd_section
;
5230 fill
= s
->fill_statement
.fill
;
5233 case lang_assignment_statement_enum
:
5235 bfd_vma newdot
= dot
;
5236 etree_type
*tree
= s
->assignment_statement
.exp
;
5238 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5240 exp_fold_tree (tree
,
5241 output_section_statement
->bfd_section
,
5244 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5246 if (!expld
.dataseg
.relro_start_stat
)
5247 expld
.dataseg
.relro_start_stat
= s
;
5250 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5253 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5255 if (!expld
.dataseg
.relro_end_stat
)
5256 expld
.dataseg
.relro_end_stat
= s
;
5259 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5262 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5264 /* This symbol is relative to this section. */
5265 if ((tree
->type
.node_class
== etree_provided
5266 || tree
->type
.node_class
== etree_assign
)
5267 && (tree
->assign
.dst
[0] != '.'
5268 || tree
->assign
.dst
[1] != '\0'))
5269 output_section_statement
->section_relative_symbol
= 1;
5271 if (!output_section_statement
->ignored
)
5273 if (output_section_statement
== abs_output_section
)
5275 /* If we don't have an output section, then just adjust
5276 the default memory address. */
5277 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5278 FALSE
)->current
= newdot
;
5280 else if (newdot
!= dot
)
5282 /* Insert a pad after this statement. We can't
5283 put the pad before when relaxing, in case the
5284 assignment references dot. */
5285 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5286 output_section_statement
->bfd_section
, dot
);
5288 /* Don't neuter the pad below when relaxing. */
5291 /* If dot is advanced, this implies that the section
5292 should have space allocated to it, unless the
5293 user has explicitly stated that the section
5294 should not be allocated. */
5295 if (output_section_statement
->sectype
!= noalloc_section
5296 && (output_section_statement
->sectype
!= noload_section
5297 || (bfd_get_flavour (link_info
.output_bfd
)
5298 == bfd_target_elf_flavour
)))
5299 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5306 case lang_padding_statement_enum
:
5307 /* If this is the first time lang_size_sections is called,
5308 we won't have any padding statements. If this is the
5309 second or later passes when relaxing, we should allow
5310 padding to shrink. If padding is needed on this pass, it
5311 will be added back in. */
5312 s
->padding_statement
.size
= 0;
5314 /* Make sure output_offset is valid. If relaxation shrinks
5315 the section and this pad isn't needed, it's possible to
5316 have output_offset larger than the final size of the
5317 section. bfd_set_section_contents will complain even for
5318 a pad size of zero. */
5319 s
->padding_statement
.output_offset
5320 = dot
- output_section_statement
->bfd_section
->vma
;
5323 case lang_group_statement_enum
:
5324 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5325 output_section_statement
,
5326 fill
, dot
, relax
, check_regions
);
5329 case lang_insert_statement_enum
:
5332 /* We can only get here when relaxing is turned on. */
5333 case lang_address_statement_enum
:
5340 prev
= &s
->header
.next
;
5345 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5346 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5347 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5348 segments. We are allowed an opportunity to override this decision. */
5351 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5352 bfd
* abfd ATTRIBUTE_UNUSED
,
5353 asection
* current_section
,
5354 asection
* previous_section
,
5355 bfd_boolean new_segment
)
5357 lang_output_section_statement_type
* cur
;
5358 lang_output_section_statement_type
* prev
;
5360 /* The checks below are only necessary when the BFD library has decided
5361 that the two sections ought to be placed into the same segment. */
5365 /* Paranoia checks. */
5366 if (current_section
== NULL
|| previous_section
== NULL
)
5369 /* Find the memory regions associated with the two sections.
5370 We call lang_output_section_find() here rather than scanning the list
5371 of output sections looking for a matching section pointer because if
5372 we have a large number of sections then a hash lookup is faster. */
5373 cur
= lang_output_section_find (current_section
->name
);
5374 prev
= lang_output_section_find (previous_section
->name
);
5376 /* More paranoia. */
5377 if (cur
== NULL
|| prev
== NULL
)
5380 /* If the regions are different then force the sections to live in
5381 different segments. See the email thread starting at the following
5382 URL for the reasons why this is necessary:
5383 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5384 return cur
->region
!= prev
->region
;
5388 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5390 lang_statement_iteration
++;
5391 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5392 0, 0, relax
, check_regions
);
5396 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5398 expld
.phase
= lang_allocating_phase_enum
;
5399 expld
.dataseg
.phase
= exp_dataseg_none
;
5401 one_lang_size_sections_pass (relax
, check_regions
);
5402 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5403 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5405 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5406 to put expld.dataseg.relro on a (common) page boundary. */
5407 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5409 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5410 maxpage
= expld
.dataseg
.maxpagesize
;
5411 /* MIN_BASE is the absolute minimum address we are allowed to start the
5412 read-write segment (byte before will be mapped read-only). */
5413 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5414 /* OLD_BASE is the address for a feasible minimum address which will
5415 still not cause a data overlap inside MAXPAGE causing file offset skip
5417 old_base
= expld
.dataseg
.base
;
5418 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5419 & (expld
.dataseg
.pagesize
- 1));
5420 /* Compute the expected PT_GNU_RELRO segment end. */
5421 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5422 & ~(expld
.dataseg
.pagesize
- 1));
5423 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5425 expld
.dataseg
.base
-= maxpage
;
5426 relro_end
-= maxpage
;
5428 lang_reset_memory_regions ();
5429 one_lang_size_sections_pass (relax
, check_regions
);
5430 if (expld
.dataseg
.relro_end
> relro_end
)
5432 /* The alignment of sections between DATA_SEGMENT_ALIGN
5433 and DATA_SEGMENT_RELRO_END caused huge padding to be
5434 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5435 that the section alignments will fit in. */
5437 unsigned int max_alignment_power
= 0;
5439 /* Find maximum alignment power of sections between
5440 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5441 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5442 if (sec
->vma
>= expld
.dataseg
.base
5443 && sec
->vma
< expld
.dataseg
.relro_end
5444 && sec
->alignment_power
> max_alignment_power
)
5445 max_alignment_power
= sec
->alignment_power
;
5447 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5449 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5450 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5451 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5452 lang_reset_memory_regions ();
5453 one_lang_size_sections_pass (relax
, check_regions
);
5456 link_info
.relro_start
= expld
.dataseg
.base
;
5457 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5459 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5461 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5462 a page could be saved in the data segment. */
5463 bfd_vma first
, last
;
5465 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5466 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5468 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5469 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5470 && first
+ last
<= expld
.dataseg
.pagesize
)
5472 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5473 lang_reset_memory_regions ();
5474 one_lang_size_sections_pass (relax
, check_regions
);
5477 expld
.dataseg
.phase
= exp_dataseg_done
;
5480 expld
.dataseg
.phase
= exp_dataseg_done
;
5483 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5486 lang_do_assignments_1 (lang_statement_union_type
*s
,
5487 lang_output_section_statement_type
*current_os
,
5491 for (; s
!= NULL
; s
= s
->header
.next
)
5493 switch (s
->header
.type
)
5495 case lang_constructors_statement_enum
:
5496 dot
= lang_do_assignments_1 (constructor_list
.head
,
5497 current_os
, fill
, dot
);
5500 case lang_output_section_statement_enum
:
5502 lang_output_section_statement_type
*os
;
5504 os
= &(s
->output_section_statement
);
5505 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5507 dot
= os
->bfd_section
->vma
;
5509 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5511 /* .tbss sections effectively have zero size. */
5512 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5513 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5514 || link_info
.relocatable
)
5515 dot
+= TO_ADDR (os
->bfd_section
->size
);
5517 if (os
->update_dot_tree
!= NULL
)
5518 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5523 case lang_wild_statement_enum
:
5525 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5526 current_os
, fill
, dot
);
5529 case lang_object_symbols_statement_enum
:
5530 case lang_output_statement_enum
:
5531 case lang_target_statement_enum
:
5534 case lang_data_statement_enum
:
5535 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5536 if (expld
.result
.valid_p
)
5538 s
->data_statement
.value
= expld
.result
.value
;
5539 if (expld
.result
.section
!= NULL
)
5540 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5543 einfo (_("%F%P: invalid data statement\n"));
5546 switch (s
->data_statement
.type
)
5564 if (size
< TO_SIZE ((unsigned) 1))
5565 size
= TO_SIZE ((unsigned) 1);
5566 dot
+= TO_ADDR (size
);
5570 case lang_reloc_statement_enum
:
5571 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5572 bfd_abs_section_ptr
, &dot
);
5573 if (expld
.result
.valid_p
)
5574 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5576 einfo (_("%F%P: invalid reloc statement\n"));
5577 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5580 case lang_input_section_enum
:
5582 asection
*in
= s
->input_section
.section
;
5584 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5585 dot
+= TO_ADDR (in
->size
);
5589 case lang_input_statement_enum
:
5592 case lang_fill_statement_enum
:
5593 fill
= s
->fill_statement
.fill
;
5596 case lang_assignment_statement_enum
:
5597 exp_fold_tree (s
->assignment_statement
.exp
,
5598 current_os
->bfd_section
,
5602 case lang_padding_statement_enum
:
5603 dot
+= TO_ADDR (s
->padding_statement
.size
);
5606 case lang_group_statement_enum
:
5607 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5608 current_os
, fill
, dot
);
5611 case lang_insert_statement_enum
:
5614 case lang_address_statement_enum
:
5626 lang_do_assignments (lang_phase_type phase
)
5628 expld
.phase
= phase
;
5629 lang_statement_iteration
++;
5630 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5633 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5634 operator .startof. (section_name), it produces an undefined symbol
5635 .startof.section_name. Similarly, when it sees
5636 .sizeof. (section_name), it produces an undefined symbol
5637 .sizeof.section_name. For all the output sections, we look for
5638 such symbols, and set them to the correct value. */
5641 lang_set_startof (void)
5645 if (link_info
.relocatable
)
5648 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5650 const char *secname
;
5652 struct bfd_link_hash_entry
*h
;
5654 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5655 buf
= (char *) xmalloc (10 + strlen (secname
));
5657 sprintf (buf
, ".startof.%s", secname
);
5658 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5659 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5661 h
->type
= bfd_link_hash_defined
;
5662 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5663 h
->u
.def
.section
= bfd_abs_section_ptr
;
5666 sprintf (buf
, ".sizeof.%s", secname
);
5667 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5668 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5670 h
->type
= bfd_link_hash_defined
;
5671 h
->u
.def
.value
= TO_ADDR (s
->size
);
5672 h
->u
.def
.section
= bfd_abs_section_ptr
;
5682 struct bfd_link_hash_entry
*h
;
5685 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5686 || (link_info
.shared
&& !link_info
.executable
))
5687 warn
= entry_from_cmdline
;
5691 /* Force the user to specify a root when generating a relocatable with
5693 if (link_info
.gc_sections
&& link_info
.relocatable
5694 && !(entry_from_cmdline
|| undef_from_cmdline
))
5695 einfo (_("%P%F: gc-sections requires either an entry or "
5696 "an undefined symbol\n"));
5698 if (entry_symbol
.name
== NULL
)
5700 /* No entry has been specified. Look for the default entry, but
5701 don't warn if we don't find it. */
5702 entry_symbol
.name
= entry_symbol_default
;
5706 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5707 FALSE
, FALSE
, TRUE
);
5709 && (h
->type
== bfd_link_hash_defined
5710 || h
->type
== bfd_link_hash_defweak
)
5711 && h
->u
.def
.section
->output_section
!= NULL
)
5715 val
= (h
->u
.def
.value
5716 + bfd_get_section_vma (link_info
.output_bfd
,
5717 h
->u
.def
.section
->output_section
)
5718 + h
->u
.def
.section
->output_offset
);
5719 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5720 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5727 /* We couldn't find the entry symbol. Try parsing it as a
5729 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5732 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5733 einfo (_("%P%F: can't set start address\n"));
5739 /* Can't find the entry symbol, and it's not a number. Use
5740 the first address in the text section. */
5741 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5745 einfo (_("%P: warning: cannot find entry symbol %s;"
5746 " defaulting to %V\n"),
5748 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5749 if (!(bfd_set_start_address
5750 (link_info
.output_bfd
,
5751 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5752 einfo (_("%P%F: can't set start address\n"));
5757 einfo (_("%P: warning: cannot find entry symbol %s;"
5758 " not setting start address\n"),
5764 /* Don't bfd_hash_table_free (&lang_definedness_table);
5765 map file output may result in a call of lang_track_definedness. */
5768 /* This is a small function used when we want to ignore errors from
5772 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5774 /* Don't do anything. */
5777 /* Check that the architecture of all the input files is compatible
5778 with the output file. Also call the backend to let it do any
5779 other checking that is needed. */
5784 lang_statement_union_type
*file
;
5786 const bfd_arch_info_type
*compatible
;
5788 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5790 #ifdef ENABLE_PLUGINS
5791 /* Don't check format of files claimed by plugin. */
5792 if (file
->input_statement
.flags
.claimed
)
5794 #endif /* ENABLE_PLUGINS */
5795 input_bfd
= file
->input_statement
.the_bfd
;
5797 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5798 command_line
.accept_unknown_input_arch
);
5800 /* In general it is not possible to perform a relocatable
5801 link between differing object formats when the input
5802 file has relocations, because the relocations in the
5803 input format may not have equivalent representations in
5804 the output format (and besides BFD does not translate
5805 relocs for other link purposes than a final link). */
5806 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5807 && (compatible
== NULL
5808 || (bfd_get_flavour (input_bfd
)
5809 != bfd_get_flavour (link_info
.output_bfd
)))
5810 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5812 einfo (_("%P%F: Relocatable linking with relocations from"
5813 " format %s (%B) to format %s (%B) is not supported\n"),
5814 bfd_get_target (input_bfd
), input_bfd
,
5815 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5816 /* einfo with %F exits. */
5819 if (compatible
== NULL
)
5821 if (command_line
.warn_mismatch
)
5822 einfo (_("%P%X: %s architecture of input file `%B'"
5823 " is incompatible with %s output\n"),
5824 bfd_printable_name (input_bfd
), input_bfd
,
5825 bfd_printable_name (link_info
.output_bfd
));
5827 else if (bfd_count_sections (input_bfd
))
5829 /* If the input bfd has no contents, it shouldn't set the
5830 private data of the output bfd. */
5832 bfd_error_handler_type pfn
= NULL
;
5834 /* If we aren't supposed to warn about mismatched input
5835 files, temporarily set the BFD error handler to a
5836 function which will do nothing. We still want to call
5837 bfd_merge_private_bfd_data, since it may set up
5838 information which is needed in the output file. */
5839 if (! command_line
.warn_mismatch
)
5840 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5841 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5843 if (command_line
.warn_mismatch
)
5844 einfo (_("%P%X: failed to merge target specific data"
5845 " of file %B\n"), input_bfd
);
5847 if (! command_line
.warn_mismatch
)
5848 bfd_set_error_handler (pfn
);
5853 /* Look through all the global common symbols and attach them to the
5854 correct section. The -sort-common command line switch may be used
5855 to roughly sort the entries by alignment. */
5860 if (command_line
.inhibit_common_definition
)
5862 if (link_info
.relocatable
5863 && ! command_line
.force_common_definition
)
5866 if (! config
.sort_common
)
5867 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5872 if (config
.sort_common
== sort_descending
)
5874 for (power
= 4; power
> 0; power
--)
5875 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5878 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5882 for (power
= 0; power
<= 4; power
++)
5883 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5886 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5891 /* Place one common symbol in the correct section. */
5894 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5896 unsigned int power_of_two
;
5900 if (h
->type
!= bfd_link_hash_common
)
5904 power_of_two
= h
->u
.c
.p
->alignment_power
;
5906 if (config
.sort_common
== sort_descending
5907 && power_of_two
< *(unsigned int *) info
)
5909 else if (config
.sort_common
== sort_ascending
5910 && power_of_two
> *(unsigned int *) info
)
5913 section
= h
->u
.c
.p
->section
;
5914 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
5915 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5918 if (config
.map_file
!= NULL
)
5920 static bfd_boolean header_printed
;
5925 if (! header_printed
)
5927 minfo (_("\nAllocating common symbols\n"));
5928 minfo (_("Common symbol size file\n\n"));
5929 header_printed
= TRUE
;
5932 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5933 DMGL_ANSI
| DMGL_PARAMS
);
5936 minfo ("%s", h
->root
.string
);
5937 len
= strlen (h
->root
.string
);
5942 len
= strlen (name
);
5958 if (size
<= 0xffffffff)
5959 sprintf (buf
, "%lx", (unsigned long) size
);
5961 sprintf_vma (buf
, size
);
5971 minfo ("%B\n", section
->owner
);
5977 /* Run through the input files and ensure that every input section has
5978 somewhere to go. If one is found without a destination then create
5979 an input request and place it into the statement tree. */
5982 lang_place_orphans (void)
5984 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5988 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5990 if (s
->output_section
== NULL
)
5992 /* This section of the file is not attached, root
5993 around for a sensible place for it to go. */
5995 if (file
->flags
.just_syms
)
5996 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5997 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5998 s
->output_section
= bfd_abs_section_ptr
;
5999 else if (strcmp (s
->name
, "COMMON") == 0)
6001 /* This is a lonely common section which must have
6002 come from an archive. We attach to the section
6003 with the wildcard. */
6004 if (! link_info
.relocatable
6005 || command_line
.force_common_definition
)
6007 if (default_common_section
== NULL
)
6008 default_common_section
6009 = lang_output_section_statement_lookup (".bss", 0,
6011 lang_add_section (&default_common_section
->children
, s
,
6012 default_common_section
);
6017 const char *name
= s
->name
;
6020 if (config
.unique_orphan_sections
6021 || unique_section_p (s
, NULL
))
6022 constraint
= SPECIAL
;
6024 if (!ldemul_place_orphan (s
, name
, constraint
))
6026 lang_output_section_statement_type
*os
;
6027 os
= lang_output_section_statement_lookup (name
,
6030 if (os
->addr_tree
== NULL
6031 && (link_info
.relocatable
6032 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6033 os
->addr_tree
= exp_intop (0);
6034 lang_add_section (&os
->children
, s
, os
);
6043 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6045 flagword
*ptr_flags
;
6047 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6053 *ptr_flags
|= SEC_ALLOC
;
6057 *ptr_flags
|= SEC_READONLY
;
6061 *ptr_flags
|= SEC_DATA
;
6065 *ptr_flags
|= SEC_CODE
;
6070 *ptr_flags
|= SEC_LOAD
;
6074 einfo (_("%P%F: invalid syntax in flags\n"));
6081 /* Call a function on each input file. This function will be called
6082 on an archive, but not on the elements. */
6085 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6087 lang_input_statement_type
*f
;
6089 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6091 f
= (lang_input_statement_type
*) f
->next_real_file
)
6095 /* Call a function on each file. The function will be called on all
6096 the elements of an archive which are included in the link, but will
6097 not be called on the archive file itself. */
6100 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6102 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6109 ldlang_add_file (lang_input_statement_type
*entry
)
6111 lang_statement_append (&file_chain
,
6112 (lang_statement_union_type
*) entry
,
6115 /* The BFD linker needs to have a list of all input BFDs involved in
6117 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6118 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6120 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6121 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6122 entry
->the_bfd
->usrdata
= entry
;
6123 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6125 /* Look through the sections and check for any which should not be
6126 included in the link. We need to do this now, so that we can
6127 notice when the backend linker tries to report multiple
6128 definition errors for symbols which are in sections we aren't
6129 going to link. FIXME: It might be better to entirely ignore
6130 symbols which are defined in sections which are going to be
6131 discarded. This would require modifying the backend linker for
6132 each backend which might set the SEC_LINK_ONCE flag. If we do
6133 this, we should probably handle SEC_EXCLUDE in the same way. */
6135 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6139 lang_add_output (const char *name
, int from_script
)
6141 /* Make -o on command line override OUTPUT in script. */
6142 if (!had_output_filename
|| !from_script
)
6144 output_filename
= name
;
6145 had_output_filename
= TRUE
;
6149 static lang_output_section_statement_type
*current_section
;
6160 for (l
= 0; l
< 32; l
++)
6162 if (i
>= (unsigned int) x
)
6170 lang_output_section_statement_type
*
6171 lang_enter_output_section_statement (const char *output_section_statement_name
,
6172 etree_type
*address_exp
,
6173 enum section_type sectype
,
6175 etree_type
*subalign
,
6179 lang_output_section_statement_type
*os
;
6181 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6183 current_section
= os
;
6185 if (os
->addr_tree
== NULL
)
6187 os
->addr_tree
= address_exp
;
6189 os
->sectype
= sectype
;
6190 if (sectype
!= noload_section
)
6191 os
->flags
= SEC_NO_FLAGS
;
6193 os
->flags
= SEC_NEVER_LOAD
;
6194 os
->block_value
= 1;
6196 /* Make next things chain into subchain of this. */
6197 push_stat_ptr (&os
->children
);
6199 os
->subsection_alignment
=
6200 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6201 os
->section_alignment
=
6202 topower (exp_get_value_int (align
, -1, "section alignment"));
6204 os
->load_base
= ebase
;
6211 lang_output_statement_type
*new_stmt
;
6213 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6214 new_stmt
->name
= output_filename
;
6218 /* Reset the current counters in the regions. */
6221 lang_reset_memory_regions (void)
6223 lang_memory_region_type
*p
= lang_memory_region_list
;
6225 lang_output_section_statement_type
*os
;
6227 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6229 p
->current
= p
->origin
;
6233 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6237 os
->processed_vma
= FALSE
;
6238 os
->processed_lma
= FALSE
;
6241 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6243 /* Save the last size for possible use by bfd_relax_section. */
6244 o
->rawsize
= o
->size
;
6249 /* Worker for lang_gc_sections_1. */
6252 gc_section_callback (lang_wild_statement_type
*ptr
,
6253 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6255 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6256 void *data ATTRIBUTE_UNUSED
)
6258 /* If the wild pattern was marked KEEP, the member sections
6259 should be as well. */
6260 if (ptr
->keep_sections
)
6261 section
->flags
|= SEC_KEEP
;
6264 /* Iterate over sections marking them against GC. */
6267 lang_gc_sections_1 (lang_statement_union_type
*s
)
6269 for (; s
!= NULL
; s
= s
->header
.next
)
6271 switch (s
->header
.type
)
6273 case lang_wild_statement_enum
:
6274 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6276 case lang_constructors_statement_enum
:
6277 lang_gc_sections_1 (constructor_list
.head
);
6279 case lang_output_section_statement_enum
:
6280 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6282 case lang_group_statement_enum
:
6283 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6292 lang_gc_sections (void)
6294 /* Keep all sections so marked in the link script. */
6296 lang_gc_sections_1 (statement_list
.head
);
6298 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6299 the special case of debug info. (See bfd/stabs.c)
6300 Twiddle the flag here, to simplify later linker code. */
6301 if (link_info
.relocatable
)
6303 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6306 #ifdef ENABLE_PLUGINS
6307 if (f
->flags
.claimed
)
6310 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6311 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6312 sec
->flags
&= ~SEC_EXCLUDE
;
6316 if (link_info
.gc_sections
)
6317 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6320 /* Worker for lang_find_relro_sections_1. */
6323 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6324 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6326 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6329 /* Discarded, excluded and ignored sections effectively have zero
6331 if (section
->output_section
!= NULL
6332 && section
->output_section
->owner
== link_info
.output_bfd
6333 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6334 && !IGNORE_SECTION (section
)
6335 && section
->size
!= 0)
6337 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6338 *has_relro_section
= TRUE
;
6342 /* Iterate over sections for relro sections. */
6345 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6346 bfd_boolean
*has_relro_section
)
6348 if (*has_relro_section
)
6351 for (; s
!= NULL
; s
= s
->header
.next
)
6353 if (s
== expld
.dataseg
.relro_end_stat
)
6356 switch (s
->header
.type
)
6358 case lang_wild_statement_enum
:
6359 walk_wild (&s
->wild_statement
,
6360 find_relro_section_callback
,
6363 case lang_constructors_statement_enum
:
6364 lang_find_relro_sections_1 (constructor_list
.head
,
6367 case lang_output_section_statement_enum
:
6368 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6371 case lang_group_statement_enum
:
6372 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6382 lang_find_relro_sections (void)
6384 bfd_boolean has_relro_section
= FALSE
;
6386 /* Check all sections in the link script. */
6388 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6389 &has_relro_section
);
6391 if (!has_relro_section
)
6392 link_info
.relro
= FALSE
;
6395 /* Relax all sections until bfd_relax_section gives up. */
6398 lang_relax_sections (bfd_boolean need_layout
)
6400 if (RELAXATION_ENABLED
)
6402 /* We may need more than one relaxation pass. */
6403 int i
= link_info
.relax_pass
;
6405 /* The backend can use it to determine the current pass. */
6406 link_info
.relax_pass
= 0;
6410 /* Keep relaxing until bfd_relax_section gives up. */
6411 bfd_boolean relax_again
;
6413 link_info
.relax_trip
= -1;
6416 link_info
.relax_trip
++;
6418 /* Note: pe-dll.c does something like this also. If you find
6419 you need to change this code, you probably need to change
6420 pe-dll.c also. DJ */
6422 /* Do all the assignments with our current guesses as to
6424 lang_do_assignments (lang_assigning_phase_enum
);
6426 /* We must do this after lang_do_assignments, because it uses
6428 lang_reset_memory_regions ();
6430 /* Perform another relax pass - this time we know where the
6431 globals are, so can make a better guess. */
6432 relax_again
= FALSE
;
6433 lang_size_sections (&relax_again
, FALSE
);
6435 while (relax_again
);
6437 link_info
.relax_pass
++;
6444 /* Final extra sizing to report errors. */
6445 lang_do_assignments (lang_assigning_phase_enum
);
6446 lang_reset_memory_regions ();
6447 lang_size_sections (NULL
, TRUE
);
6451 #ifdef ENABLE_PLUGINS
6452 /* Find the insert point for the plugin's replacement files. We
6453 place them after the first claimed real object file, or if the
6454 first claimed object is an archive member, after the last real
6455 object file immediately preceding the archive. In the event
6456 no objects have been claimed at all, we return the first dummy
6457 object file on the list as the insert point; that works, but
6458 the callee must be careful when relinking the file_chain as it
6459 is not actually on that chain, only the statement_list and the
6460 input_file list; in that case, the replacement files must be
6461 inserted at the head of the file_chain. */
6463 static lang_input_statement_type
*
6464 find_replacements_insert_point (void)
6466 lang_input_statement_type
*claim1
, *lastobject
;
6467 lastobject
= &input_file_chain
.head
->input_statement
;
6468 for (claim1
= &file_chain
.head
->input_statement
;
6470 claim1
= &claim1
->next
->input_statement
)
6472 if (claim1
->flags
.claimed
)
6473 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6474 /* Update lastobject if this is a real object file. */
6475 if (claim1
->the_bfd
&& (claim1
->the_bfd
->my_archive
== NULL
))
6476 lastobject
= claim1
;
6478 /* No files were claimed by the plugin. Choose the last object
6479 file found on the list (maybe the first, dummy entry) as the
6484 /* Insert SRCLIST into DESTLIST after given element by chaining
6485 on FIELD as the next-pointer. (Counterintuitively does not need
6486 a pointer to the actual after-node itself, just its chain field.) */
6489 lang_list_insert_after (lang_statement_list_type
*destlist
,
6490 lang_statement_list_type
*srclist
,
6491 lang_statement_union_type
**field
)
6493 *(srclist
->tail
) = *field
;
6494 *field
= srclist
->head
;
6495 if (destlist
->tail
== field
)
6496 destlist
->tail
= srclist
->tail
;
6499 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6500 was taken as a copy of it and leave them in ORIGLIST. */
6503 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6504 lang_statement_list_type
*origlist
)
6506 union lang_statement_union
**savetail
;
6507 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6508 ASSERT (origlist
->head
== destlist
->head
);
6509 savetail
= origlist
->tail
;
6510 origlist
->head
= *(savetail
);
6511 origlist
->tail
= destlist
->tail
;
6512 destlist
->tail
= savetail
;
6515 #endif /* ENABLE_PLUGINS */
6520 /* Finalize dynamic list. */
6521 if (link_info
.dynamic_list
)
6522 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6524 current_target
= default_target
;
6526 /* Open the output file. */
6527 lang_for_each_statement (ldlang_open_output
);
6530 ldemul_create_output_section_statements ();
6532 /* Add to the hash table all undefineds on the command line. */
6533 lang_place_undefineds ();
6535 if (!bfd_section_already_linked_table_init ())
6536 einfo (_("%P%F: Failed to create hash table\n"));
6538 /* Create a bfd for each input file. */
6539 current_target
= default_target
;
6540 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6542 #ifdef ENABLE_PLUGINS
6543 if (plugin_active_plugins_p ())
6545 lang_statement_list_type added
;
6546 lang_statement_list_type files
, inputfiles
;
6548 /* Now all files are read, let the plugin(s) decide if there
6549 are any more to be added to the link before we call the
6550 emulation's after_open hook. We create a private list of
6551 input statements for this purpose, which we will eventually
6552 insert into the global statment list after the first claimed
6555 /* We need to manipulate all three chains in synchrony. */
6557 inputfiles
= input_file_chain
;
6558 if (plugin_call_all_symbols_read ())
6559 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6560 plugin_error_plugin ());
6561 /* Open any newly added files, updating the file chains. */
6562 link_info
.loading_lto_outputs
= TRUE
;
6563 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6564 /* Restore the global list pointer now they have all been added. */
6565 lang_list_remove_tail (stat_ptr
, &added
);
6566 /* And detach the fresh ends of the file lists. */
6567 lang_list_remove_tail (&file_chain
, &files
);
6568 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6569 /* Were any new files added? */
6570 if (added
.head
!= NULL
)
6572 /* If so, we will insert them into the statement list immediately
6573 after the first input file that was claimed by the plugin. */
6574 plugin_insert
= find_replacements_insert_point ();
6575 /* If a plugin adds input files without having claimed any, we
6576 don't really have a good idea where to place them. Just putting
6577 them at the start or end of the list is liable to leave them
6578 outside the crtbegin...crtend range. */
6579 ASSERT (plugin_insert
!= NULL
);
6580 /* Splice the new statement list into the old one. */
6581 lang_list_insert_after (stat_ptr
, &added
,
6582 &plugin_insert
->header
.next
);
6583 /* Likewise for the file chains. */
6584 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6585 &plugin_insert
->next_real_file
);
6586 /* We must be careful when relinking file_chain; we may need to
6587 insert the new files at the head of the list if the insert
6588 point chosen is the dummy first input file. */
6589 if (plugin_insert
->filename
)
6590 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6592 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6594 /* Rescan archives in case new undefined symbols have appeared. */
6595 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6598 #endif /* ENABLE_PLUGINS */
6600 link_info
.gc_sym_list
= &entry_symbol
;
6601 if (entry_symbol
.name
== NULL
)
6602 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6604 ldemul_after_open ();
6606 bfd_section_already_linked_table_free ();
6608 /* Make sure that we're not mixing architectures. We call this
6609 after all the input files have been opened, but before we do any
6610 other processing, so that any operations merge_private_bfd_data
6611 does on the output file will be known during the rest of the
6615 /* Handle .exports instead of a version script if we're told to do so. */
6616 if (command_line
.version_exports_section
)
6617 lang_do_version_exports_section ();
6619 /* Build all sets based on the information gathered from the input
6621 ldctor_build_sets ();
6623 /* PR 13683: We must rerun the assignments prior to running garbage
6624 collection in order to make sure that all symbol aliases are resolved. */
6625 lang_do_assignments (lang_mark_phase_enum
);
6626 expld
.phase
= lang_first_phase_enum
;
6628 /* Remove unreferenced sections if asked to. */
6629 lang_gc_sections ();
6631 /* Size up the common data. */
6634 /* Update wild statements. */
6635 update_wild_statements (statement_list
.head
);
6637 /* Run through the contours of the script and attach input sections
6638 to the correct output sections. */
6639 lang_statement_iteration
++;
6640 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6642 process_insert_statements ();
6644 /* Find any sections not attached explicitly and handle them. */
6645 lang_place_orphans ();
6647 if (! link_info
.relocatable
)
6651 /* Merge SEC_MERGE sections. This has to be done after GC of
6652 sections, so that GCed sections are not merged, but before
6653 assigning dynamic symbols, since removing whole input sections
6655 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6657 /* Look for a text section and set the readonly attribute in it. */
6658 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6662 if (config
.text_read_only
)
6663 found
->flags
|= SEC_READONLY
;
6665 found
->flags
&= ~SEC_READONLY
;
6669 /* Do anything special before sizing sections. This is where ELF
6670 and other back-ends size dynamic sections. */
6671 ldemul_before_allocation ();
6673 /* We must record the program headers before we try to fix the
6674 section positions, since they will affect SIZEOF_HEADERS. */
6675 lang_record_phdrs ();
6677 /* Check relro sections. */
6678 if (link_info
.relro
&& ! link_info
.relocatable
)
6679 lang_find_relro_sections ();
6681 /* Size up the sections. */
6682 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6684 /* See if anything special should be done now we know how big
6685 everything is. This is where relaxation is done. */
6686 ldemul_after_allocation ();
6688 /* Fix any .startof. or .sizeof. symbols. */
6689 lang_set_startof ();
6691 /* Do all the assignments, now that we know the final resting places
6692 of all the symbols. */
6693 lang_do_assignments (lang_final_phase_enum
);
6697 /* Make sure that the section addresses make sense. */
6698 if (command_line
.check_section_addresses
)
6699 lang_check_section_addresses ();
6704 /* EXPORTED TO YACC */
6707 lang_add_wild (struct wildcard_spec
*filespec
,
6708 struct wildcard_list
*section_list
,
6709 bfd_boolean keep_sections
)
6711 struct wildcard_list
*curr
, *next
;
6712 lang_wild_statement_type
*new_stmt
;
6714 /* Reverse the list as the parser puts it back to front. */
6715 for (curr
= section_list
, section_list
= NULL
;
6717 section_list
= curr
, curr
= next
)
6719 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6720 placed_commons
= TRUE
;
6723 curr
->next
= section_list
;
6726 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6728 if (strcmp (filespec
->name
, "*") == 0)
6729 filespec
->name
= NULL
;
6730 else if (! wildcardp (filespec
->name
))
6731 lang_has_input_file
= TRUE
;
6734 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6735 new_stmt
->filename
= NULL
;
6736 new_stmt
->filenames_sorted
= FALSE
;
6737 new_stmt
->section_flag_list
= NULL
;
6738 if (filespec
!= NULL
)
6740 new_stmt
->filename
= filespec
->name
;
6741 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6742 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
6744 new_stmt
->section_list
= section_list
;
6745 new_stmt
->keep_sections
= keep_sections
;
6746 lang_list_init (&new_stmt
->children
);
6747 analyze_walk_wild_section_handler (new_stmt
);
6751 lang_section_start (const char *name
, etree_type
*address
,
6752 const segment_type
*segment
)
6754 lang_address_statement_type
*ad
;
6756 ad
= new_stat (lang_address_statement
, stat_ptr
);
6757 ad
->section_name
= name
;
6758 ad
->address
= address
;
6759 ad
->segment
= segment
;
6762 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6763 because of a -e argument on the command line, or zero if this is
6764 called by ENTRY in a linker script. Command line arguments take
6768 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6770 if (entry_symbol
.name
== NULL
6772 || ! entry_from_cmdline
)
6774 entry_symbol
.name
= name
;
6775 entry_from_cmdline
= cmdline
;
6779 /* Set the default start symbol to NAME. .em files should use this,
6780 not lang_add_entry, to override the use of "start" if neither the
6781 linker script nor the command line specifies an entry point. NAME
6782 must be permanently allocated. */
6784 lang_default_entry (const char *name
)
6786 entry_symbol_default
= name
;
6790 lang_add_target (const char *name
)
6792 lang_target_statement_type
*new_stmt
;
6794 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6795 new_stmt
->target
= name
;
6799 lang_add_map (const char *name
)
6806 map_option_f
= TRUE
;
6814 lang_add_fill (fill_type
*fill
)
6816 lang_fill_statement_type
*new_stmt
;
6818 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6819 new_stmt
->fill
= fill
;
6823 lang_add_data (int type
, union etree_union
*exp
)
6825 lang_data_statement_type
*new_stmt
;
6827 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6828 new_stmt
->exp
= exp
;
6829 new_stmt
->type
= type
;
6832 /* Create a new reloc statement. RELOC is the BFD relocation type to
6833 generate. HOWTO is the corresponding howto structure (we could
6834 look this up, but the caller has already done so). SECTION is the
6835 section to generate a reloc against, or NAME is the name of the
6836 symbol to generate a reloc against. Exactly one of SECTION and
6837 NAME must be NULL. ADDEND is an expression for the addend. */
6840 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6841 reloc_howto_type
*howto
,
6844 union etree_union
*addend
)
6846 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6850 p
->section
= section
;
6852 p
->addend_exp
= addend
;
6854 p
->addend_value
= 0;
6855 p
->output_section
= NULL
;
6856 p
->output_offset
= 0;
6859 lang_assignment_statement_type
*
6860 lang_add_assignment (etree_type
*exp
)
6862 lang_assignment_statement_type
*new_stmt
;
6864 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6865 new_stmt
->exp
= exp
;
6870 lang_add_attribute (enum statement_enum attribute
)
6872 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6876 lang_startup (const char *name
)
6878 if (first_file
->filename
!= NULL
)
6880 einfo (_("%P%F: multiple STARTUP files\n"));
6882 first_file
->filename
= name
;
6883 first_file
->local_sym_name
= name
;
6884 first_file
->flags
.real
= TRUE
;
6888 lang_float (bfd_boolean maybe
)
6890 lang_float_flag
= maybe
;
6894 /* Work out the load- and run-time regions from a script statement, and
6895 store them in *LMA_REGION and *REGION respectively.
6897 MEMSPEC is the name of the run-time region, or the value of
6898 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6899 LMA_MEMSPEC is the name of the load-time region, or null if the
6900 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6901 had an explicit load address.
6903 It is an error to specify both a load region and a load address. */
6906 lang_get_regions (lang_memory_region_type
**region
,
6907 lang_memory_region_type
**lma_region
,
6908 const char *memspec
,
6909 const char *lma_memspec
,
6910 bfd_boolean have_lma
,
6911 bfd_boolean have_vma
)
6913 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6915 /* If no runtime region or VMA has been specified, but the load region
6916 has been specified, then use the load region for the runtime region
6918 if (lma_memspec
!= NULL
6920 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6921 *region
= *lma_region
;
6923 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6925 if (have_lma
&& lma_memspec
!= 0)
6926 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
6931 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6932 lang_output_section_phdr_list
*phdrs
,
6933 const char *lma_memspec
)
6935 lang_get_regions (¤t_section
->region
,
6936 ¤t_section
->lma_region
,
6937 memspec
, lma_memspec
,
6938 current_section
->load_base
!= NULL
,
6939 current_section
->addr_tree
!= NULL
);
6941 /* If this section has no load region or base, but uses the same
6942 region as the previous section, then propagate the previous
6943 section's load region. */
6945 if (current_section
->lma_region
== NULL
6946 && current_section
->load_base
== NULL
6947 && current_section
->addr_tree
== NULL
6948 && current_section
->region
== current_section
->prev
->region
)
6949 current_section
->lma_region
= current_section
->prev
->lma_region
;
6951 current_section
->fill
= fill
;
6952 current_section
->phdrs
= phdrs
;
6956 /* Create an absolute symbol with the given name with the value of the
6957 address of first byte of the section named.
6959 If the symbol already exists, then do nothing. */
6962 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6964 struct bfd_link_hash_entry
*h
;
6966 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6968 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6970 if (h
->type
== bfd_link_hash_new
6971 || h
->type
== bfd_link_hash_undefined
)
6975 h
->type
= bfd_link_hash_defined
;
6977 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6981 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6983 h
->u
.def
.section
= bfd_abs_section_ptr
;
6987 /* Create an absolute symbol with the given name with the value of the
6988 address of the first byte after the end of the section named.
6990 If the symbol already exists, then do nothing. */
6993 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6995 struct bfd_link_hash_entry
*h
;
6997 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6999 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
7001 if (h
->type
== bfd_link_hash_new
7002 || h
->type
== bfd_link_hash_undefined
)
7006 h
->type
= bfd_link_hash_defined
;
7008 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
7012 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
7013 + TO_ADDR (sec
->size
));
7015 h
->u
.def
.section
= bfd_abs_section_ptr
;
7020 lang_statement_append (lang_statement_list_type
*list
,
7021 lang_statement_union_type
*element
,
7022 lang_statement_union_type
**field
)
7024 *(list
->tail
) = element
;
7028 /* Set the output format type. -oformat overrides scripts. */
7031 lang_add_output_format (const char *format
,
7036 if (output_target
== NULL
|| !from_script
)
7038 if (command_line
.endian
== ENDIAN_BIG
7041 else if (command_line
.endian
== ENDIAN_LITTLE
7045 output_target
= format
;
7050 lang_add_insert (const char *where
, int is_before
)
7052 lang_insert_statement_type
*new_stmt
;
7054 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7055 new_stmt
->where
= where
;
7056 new_stmt
->is_before
= is_before
;
7057 saved_script_handle
= previous_script_handle
;
7060 /* Enter a group. This creates a new lang_group_statement, and sets
7061 stat_ptr to build new statements within the group. */
7064 lang_enter_group (void)
7066 lang_group_statement_type
*g
;
7068 g
= new_stat (lang_group_statement
, stat_ptr
);
7069 lang_list_init (&g
->children
);
7070 push_stat_ptr (&g
->children
);
7073 /* Leave a group. This just resets stat_ptr to start writing to the
7074 regular list of statements again. Note that this will not work if
7075 groups can occur inside anything else which can adjust stat_ptr,
7076 but currently they can't. */
7079 lang_leave_group (void)
7084 /* Add a new program header. This is called for each entry in a PHDRS
7085 command in a linker script. */
7088 lang_new_phdr (const char *name
,
7090 bfd_boolean filehdr
,
7095 struct lang_phdr
*n
, **pp
;
7098 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7101 n
->type
= exp_get_value_int (type
, 0, "program header type");
7102 n
->filehdr
= filehdr
;
7107 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7109 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7112 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7114 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7115 " when prior PT_LOAD headers lack them\n"), NULL
);
7122 /* Record the program header information in the output BFD. FIXME: We
7123 should not be calling an ELF specific function here. */
7126 lang_record_phdrs (void)
7130 lang_output_section_phdr_list
*last
;
7131 struct lang_phdr
*l
;
7132 lang_output_section_statement_type
*os
;
7135 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7138 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7145 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7149 lang_output_section_phdr_list
*pl
;
7151 if (os
->constraint
< 0)
7159 if (os
->sectype
== noload_section
7160 || os
->bfd_section
== NULL
7161 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7164 /* Don't add orphans to PT_INTERP header. */
7170 lang_output_section_statement_type
* tmp_os
;
7172 /* If we have not run across a section with a program
7173 header assigned to it yet, then scan forwards to find
7174 one. This prevents inconsistencies in the linker's
7175 behaviour when a script has specified just a single
7176 header and there are sections in that script which are
7177 not assigned to it, and which occur before the first
7178 use of that header. See here for more details:
7179 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7180 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7183 last
= tmp_os
->phdrs
;
7187 einfo (_("%F%P: no sections assigned to phdrs\n"));
7192 if (os
->bfd_section
== NULL
)
7195 for (; pl
!= NULL
; pl
= pl
->next
)
7197 if (strcmp (pl
->name
, l
->name
) == 0)
7202 secs
= (asection
**) xrealloc (secs
,
7203 alc
* sizeof (asection
*));
7205 secs
[c
] = os
->bfd_section
;
7212 if (l
->flags
== NULL
)
7215 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7220 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7222 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7223 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7224 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7225 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7230 /* Make sure all the phdr assignments succeeded. */
7231 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7235 lang_output_section_phdr_list
*pl
;
7237 if (os
->constraint
< 0
7238 || os
->bfd_section
== NULL
)
7241 for (pl
= os
->phdrs
;
7244 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7245 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7246 os
->name
, pl
->name
);
7250 /* Record a list of sections which may not be cross referenced. */
7253 lang_add_nocrossref (lang_nocrossref_type
*l
)
7255 struct lang_nocrossrefs
*n
;
7257 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7258 n
->next
= nocrossref_list
;
7260 nocrossref_list
= n
;
7262 /* Set notice_all so that we get informed about all symbols. */
7263 link_info
.notice_all
= TRUE
;
7266 /* Overlay handling. We handle overlays with some static variables. */
7268 /* The overlay virtual address. */
7269 static etree_type
*overlay_vma
;
7270 /* And subsection alignment. */
7271 static etree_type
*overlay_subalign
;
7273 /* An expression for the maximum section size seen so far. */
7274 static etree_type
*overlay_max
;
7276 /* A list of all the sections in this overlay. */
7278 struct overlay_list
{
7279 struct overlay_list
*next
;
7280 lang_output_section_statement_type
*os
;
7283 static struct overlay_list
*overlay_list
;
7285 /* Start handling an overlay. */
7288 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7290 /* The grammar should prevent nested overlays from occurring. */
7291 ASSERT (overlay_vma
== NULL
7292 && overlay_subalign
== NULL
7293 && overlay_max
== NULL
);
7295 overlay_vma
= vma_expr
;
7296 overlay_subalign
= subalign
;
7299 /* Start a section in an overlay. We handle this by calling
7300 lang_enter_output_section_statement with the correct VMA.
7301 lang_leave_overlay sets up the LMA and memory regions. */
7304 lang_enter_overlay_section (const char *name
)
7306 struct overlay_list
*n
;
7309 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7310 0, overlay_subalign
, 0, 0);
7312 /* If this is the first section, then base the VMA of future
7313 sections on this one. This will work correctly even if `.' is
7314 used in the addresses. */
7315 if (overlay_list
== NULL
)
7316 overlay_vma
= exp_nameop (ADDR
, name
);
7318 /* Remember the section. */
7319 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7320 n
->os
= current_section
;
7321 n
->next
= overlay_list
;
7324 size
= exp_nameop (SIZEOF
, name
);
7326 /* Arrange to work out the maximum section end address. */
7327 if (overlay_max
== NULL
)
7330 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7333 /* Finish a section in an overlay. There isn't any special to do
7337 lang_leave_overlay_section (fill_type
*fill
,
7338 lang_output_section_phdr_list
*phdrs
)
7345 name
= current_section
->name
;
7347 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7348 region and that no load-time region has been specified. It doesn't
7349 really matter what we say here, since lang_leave_overlay will
7351 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7353 /* Define the magic symbols. */
7355 clean
= (char *) xmalloc (strlen (name
) + 1);
7357 for (s1
= name
; *s1
!= '\0'; s1
++)
7358 if (ISALNUM (*s1
) || *s1
== '_')
7362 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7363 sprintf (buf
, "__load_start_%s", clean
);
7364 lang_add_assignment (exp_provide (buf
,
7365 exp_nameop (LOADADDR
, name
),
7368 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7369 sprintf (buf
, "__load_stop_%s", clean
);
7370 lang_add_assignment (exp_provide (buf
,
7372 exp_nameop (LOADADDR
, name
),
7373 exp_nameop (SIZEOF
, name
)),
7379 /* Finish an overlay. If there are any overlay wide settings, this
7380 looks through all the sections in the overlay and sets them. */
7383 lang_leave_overlay (etree_type
*lma_expr
,
7386 const char *memspec
,
7387 lang_output_section_phdr_list
*phdrs
,
7388 const char *lma_memspec
)
7390 lang_memory_region_type
*region
;
7391 lang_memory_region_type
*lma_region
;
7392 struct overlay_list
*l
;
7393 lang_nocrossref_type
*nocrossref
;
7395 lang_get_regions (®ion
, &lma_region
,
7396 memspec
, lma_memspec
,
7397 lma_expr
!= NULL
, FALSE
);
7401 /* After setting the size of the last section, set '.' to end of the
7403 if (overlay_list
!= NULL
)
7404 overlay_list
->os
->update_dot_tree
7405 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
));
7410 struct overlay_list
*next
;
7412 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7415 l
->os
->region
= region
;
7416 l
->os
->lma_region
= lma_region
;
7418 /* The first section has the load address specified in the
7419 OVERLAY statement. The rest are worked out from that.
7420 The base address is not needed (and should be null) if
7421 an LMA region was specified. */
7424 l
->os
->load_base
= lma_expr
;
7425 l
->os
->sectype
= normal_section
;
7427 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7428 l
->os
->phdrs
= phdrs
;
7432 lang_nocrossref_type
*nc
;
7434 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7435 nc
->name
= l
->os
->name
;
7436 nc
->next
= nocrossref
;
7445 if (nocrossref
!= NULL
)
7446 lang_add_nocrossref (nocrossref
);
7449 overlay_list
= NULL
;
7453 /* Version handling. This is only useful for ELF. */
7455 /* If PREV is NULL, return first version pattern matching particular symbol.
7456 If PREV is non-NULL, return first version pattern matching particular
7457 symbol after PREV (previously returned by lang_vers_match). */
7459 static struct bfd_elf_version_expr
*
7460 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7461 struct bfd_elf_version_expr
*prev
,
7465 const char *cxx_sym
= sym
;
7466 const char *java_sym
= sym
;
7467 struct bfd_elf_version_expr
*expr
= NULL
;
7468 enum demangling_styles curr_style
;
7470 curr_style
= CURRENT_DEMANGLING_STYLE
;
7471 cplus_demangle_set_style (no_demangling
);
7472 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7475 cplus_demangle_set_style (curr_style
);
7477 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7479 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7480 DMGL_PARAMS
| DMGL_ANSI
);
7484 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7486 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7491 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7493 struct bfd_elf_version_expr e
;
7495 switch (prev
? prev
->mask
: 0)
7498 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7501 expr
= (struct bfd_elf_version_expr
*)
7502 htab_find ((htab_t
) head
->htab
, &e
);
7503 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7504 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7510 case BFD_ELF_VERSION_C_TYPE
:
7511 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7513 e
.pattern
= cxx_sym
;
7514 expr
= (struct bfd_elf_version_expr
*)
7515 htab_find ((htab_t
) head
->htab
, &e
);
7516 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7517 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7523 case BFD_ELF_VERSION_CXX_TYPE
:
7524 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7526 e
.pattern
= java_sym
;
7527 expr
= (struct bfd_elf_version_expr
*)
7528 htab_find ((htab_t
) head
->htab
, &e
);
7529 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7530 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7541 /* Finally, try the wildcards. */
7542 if (prev
== NULL
|| prev
->literal
)
7543 expr
= head
->remaining
;
7546 for (; expr
; expr
= expr
->next
)
7553 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7556 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7558 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7562 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7568 free ((char *) c_sym
);
7570 free ((char *) cxx_sym
);
7571 if (java_sym
!= sym
)
7572 free ((char *) java_sym
);
7576 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7577 return a pointer to the symbol name with any backslash quotes removed. */
7580 realsymbol (const char *pattern
)
7583 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7584 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7586 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7588 /* It is a glob pattern only if there is no preceding
7592 /* Remove the preceding backslash. */
7599 if (*p
== '?' || *p
== '*' || *p
== '[')
7606 backslash
= *p
== '\\';
7622 /* This is called for each variable name or match expression. NEW_NAME is
7623 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7624 pattern to be matched against symbol names. */
7626 struct bfd_elf_version_expr
*
7627 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7628 const char *new_name
,
7630 bfd_boolean literal_p
)
7632 struct bfd_elf_version_expr
*ret
;
7634 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7638 ret
->literal
= TRUE
;
7639 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7640 if (ret
->pattern
== NULL
)
7642 ret
->pattern
= new_name
;
7643 ret
->literal
= FALSE
;
7646 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7647 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7648 else if (strcasecmp (lang
, "C++") == 0)
7649 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7650 else if (strcasecmp (lang
, "Java") == 0)
7651 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7654 einfo (_("%X%P: unknown language `%s' in version information\n"),
7656 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7659 return ldemul_new_vers_pattern (ret
);
7662 /* This is called for each set of variable names and match
7665 struct bfd_elf_version_tree
*
7666 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7667 struct bfd_elf_version_expr
*locals
)
7669 struct bfd_elf_version_tree
*ret
;
7671 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7672 ret
->globals
.list
= globals
;
7673 ret
->locals
.list
= locals
;
7674 ret
->match
= lang_vers_match
;
7675 ret
->name_indx
= (unsigned int) -1;
7679 /* This static variable keeps track of version indices. */
7681 static int version_index
;
7684 version_expr_head_hash (const void *p
)
7686 const struct bfd_elf_version_expr
*e
=
7687 (const struct bfd_elf_version_expr
*) p
;
7689 return htab_hash_string (e
->pattern
);
7693 version_expr_head_eq (const void *p1
, const void *p2
)
7695 const struct bfd_elf_version_expr
*e1
=
7696 (const struct bfd_elf_version_expr
*) p1
;
7697 const struct bfd_elf_version_expr
*e2
=
7698 (const struct bfd_elf_version_expr
*) p2
;
7700 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7704 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7707 struct bfd_elf_version_expr
*e
, *next
;
7708 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7710 for (e
= head
->list
; e
; e
= e
->next
)
7714 head
->mask
|= e
->mask
;
7719 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7720 version_expr_head_eq
, NULL
);
7721 list_loc
= &head
->list
;
7722 remaining_loc
= &head
->remaining
;
7723 for (e
= head
->list
; e
; e
= next
)
7729 remaining_loc
= &e
->next
;
7733 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7737 struct bfd_elf_version_expr
*e1
, *last
;
7739 e1
= (struct bfd_elf_version_expr
*) *loc
;
7743 if (e1
->mask
== e
->mask
)
7751 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7755 /* This is a duplicate. */
7756 /* FIXME: Memory leak. Sometimes pattern is not
7757 xmalloced alone, but in larger chunk of memory. */
7758 /* free (e->pattern); */
7763 e
->next
= last
->next
;
7771 list_loc
= &e
->next
;
7775 *remaining_loc
= NULL
;
7776 *list_loc
= head
->remaining
;
7779 head
->remaining
= head
->list
;
7782 /* This is called when we know the name and dependencies of the
7786 lang_register_vers_node (const char *name
,
7787 struct bfd_elf_version_tree
*version
,
7788 struct bfd_elf_version_deps
*deps
)
7790 struct bfd_elf_version_tree
*t
, **pp
;
7791 struct bfd_elf_version_expr
*e1
;
7796 if (link_info
.version_info
!= NULL
7797 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
7799 einfo (_("%X%P: anonymous version tag cannot be combined"
7800 " with other version tags\n"));
7805 /* Make sure this node has a unique name. */
7806 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7807 if (strcmp (t
->name
, name
) == 0)
7808 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7810 lang_finalize_version_expr_head (&version
->globals
);
7811 lang_finalize_version_expr_head (&version
->locals
);
7813 /* Check the global and local match names, and make sure there
7814 aren't any duplicates. */
7816 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7818 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7820 struct bfd_elf_version_expr
*e2
;
7822 if (t
->locals
.htab
&& e1
->literal
)
7824 e2
= (struct bfd_elf_version_expr
*)
7825 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7826 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7828 if (e1
->mask
== e2
->mask
)
7829 einfo (_("%X%P: duplicate expression `%s'"
7830 " in version information\n"), e1
->pattern
);
7834 else if (!e1
->literal
)
7835 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7836 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7837 && e1
->mask
== e2
->mask
)
7838 einfo (_("%X%P: duplicate expression `%s'"
7839 " in version information\n"), e1
->pattern
);
7843 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7845 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7847 struct bfd_elf_version_expr
*e2
;
7849 if (t
->globals
.htab
&& e1
->literal
)
7851 e2
= (struct bfd_elf_version_expr
*)
7852 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7853 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7855 if (e1
->mask
== e2
->mask
)
7856 einfo (_("%X%P: duplicate expression `%s'"
7857 " in version information\n"),
7862 else if (!e1
->literal
)
7863 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7864 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7865 && e1
->mask
== e2
->mask
)
7866 einfo (_("%X%P: duplicate expression `%s'"
7867 " in version information\n"), e1
->pattern
);
7871 version
->deps
= deps
;
7872 version
->name
= name
;
7873 if (name
[0] != '\0')
7876 version
->vernum
= version_index
;
7879 version
->vernum
= 0;
7881 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7886 /* This is called when we see a version dependency. */
7888 struct bfd_elf_version_deps
*
7889 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7891 struct bfd_elf_version_deps
*ret
;
7892 struct bfd_elf_version_tree
*t
;
7894 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7897 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7899 if (strcmp (t
->name
, name
) == 0)
7901 ret
->version_needed
= t
;
7906 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7908 ret
->version_needed
= NULL
;
7913 lang_do_version_exports_section (void)
7915 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7917 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7919 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7927 contents
= (char *) xmalloc (len
);
7928 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7929 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7932 while (p
< contents
+ len
)
7934 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7935 p
= strchr (p
, '\0') + 1;
7938 /* Do not free the contents, as we used them creating the regex. */
7940 /* Do not include this section in the link. */
7941 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7944 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7945 lang_register_vers_node (command_line
.version_exports_section
,
7946 lang_new_vers_node (greg
, lreg
), NULL
);
7950 lang_add_unique (const char *name
)
7952 struct unique_sections
*ent
;
7954 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7955 if (strcmp (ent
->name
, name
) == 0)
7958 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7959 ent
->name
= xstrdup (name
);
7960 ent
->next
= unique_section_list
;
7961 unique_section_list
= ent
;
7964 /* Append the list of dynamic symbols to the existing one. */
7967 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7969 if (link_info
.dynamic_list
)
7971 struct bfd_elf_version_expr
*tail
;
7972 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7974 tail
->next
= link_info
.dynamic_list
->head
.list
;
7975 link_info
.dynamic_list
->head
.list
= dynamic
;
7979 struct bfd_elf_dynamic_list
*d
;
7981 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
7982 d
->head
.list
= dynamic
;
7983 d
->match
= lang_vers_match
;
7984 link_info
.dynamic_list
= d
;
7988 /* Append the list of C++ typeinfo dynamic symbols to the existing
7992 lang_append_dynamic_list_cpp_typeinfo (void)
7994 const char * symbols
[] =
7996 "typeinfo name for*",
7999 struct bfd_elf_version_expr
*dynamic
= NULL
;
8002 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8003 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8006 lang_append_dynamic_list (dynamic
);
8009 /* Append the list of C++ operator new and delete dynamic symbols to the
8013 lang_append_dynamic_list_cpp_new (void)
8015 const char * symbols
[] =
8020 struct bfd_elf_version_expr
*dynamic
= NULL
;
8023 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8024 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8027 lang_append_dynamic_list (dynamic
);
8030 /* Scan a space and/or comma separated string of features. */
8033 lang_ld_feature (char *str
)
8041 while (*p
== ',' || ISSPACE (*p
))
8046 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8050 if (strcasecmp (p
, "SANE_EXPR") == 0)
8051 config
.sane_expr
= TRUE
;
8053 einfo (_("%X%P: unknown feature `%s'\n"), p
);