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 && !link_info
.emitrelocations
2384 && !stripped_excluded_sections
)
2386 asection
*s
= output
->bfd_section
->map_tail
.s
;
2387 output
->bfd_section
->map_tail
.s
= section
;
2388 section
->map_head
.s
= NULL
;
2389 section
->map_tail
.s
= s
;
2391 s
->map_head
.s
= section
;
2393 output
->bfd_section
->map_head
.s
= section
;
2396 /* Add a section reference to the list. */
2397 new_section
= new_stat (lang_input_section
, ptr
);
2398 new_section
->section
= section
;
2401 /* Handle wildcard sorting. This returns the lang_input_section which
2402 should follow the one we are going to create for SECTION and FILE,
2403 based on the sorting requirements of WILD. It returns NULL if the
2404 new section should just go at the end of the current list. */
2406 static lang_statement_union_type
*
2407 wild_sort (lang_wild_statement_type
*wild
,
2408 struct wildcard_list
*sec
,
2409 lang_input_statement_type
*file
,
2412 lang_statement_union_type
*l
;
2414 if (!wild
->filenames_sorted
2415 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2418 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2420 lang_input_section_type
*ls
;
2422 if (l
->header
.type
!= lang_input_section_enum
)
2424 ls
= &l
->input_section
;
2426 /* Sorting by filename takes precedence over sorting by section
2429 if (wild
->filenames_sorted
)
2431 const char *fn
, *ln
;
2435 /* The PE support for the .idata section as generated by
2436 dlltool assumes that files will be sorted by the name of
2437 the archive and then the name of the file within the
2440 if (file
->the_bfd
!= NULL
2441 && bfd_my_archive (file
->the_bfd
) != NULL
)
2443 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2448 fn
= file
->filename
;
2452 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2454 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2459 ln
= ls
->section
->owner
->filename
;
2463 i
= filename_cmp (fn
, ln
);
2472 fn
= file
->filename
;
2474 ln
= ls
->section
->owner
->filename
;
2476 i
= filename_cmp (fn
, ln
);
2484 /* Here either the files are not sorted by name, or we are
2485 looking at the sections for this file. */
2487 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2488 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2495 /* Expand a wild statement for a particular FILE. SECTION may be
2496 NULL, in which case it is a wild card. */
2499 output_section_callback (lang_wild_statement_type
*ptr
,
2500 struct wildcard_list
*sec
,
2502 lang_input_statement_type
*file
,
2505 lang_statement_union_type
*before
;
2506 lang_output_section_statement_type
*os
;
2508 os
= (lang_output_section_statement_type
*) output
;
2510 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2511 if (unique_section_p (section
, os
))
2514 before
= wild_sort (ptr
, sec
, file
, section
);
2516 /* Here BEFORE points to the lang_input_section which
2517 should follow the one we are about to add. If BEFORE
2518 is NULL, then the section should just go at the end
2519 of the current list. */
2522 lang_add_section (&ptr
->children
, section
, os
);
2525 lang_statement_list_type list
;
2526 lang_statement_union_type
**pp
;
2528 lang_list_init (&list
);
2529 lang_add_section (&list
, section
, os
);
2531 /* If we are discarding the section, LIST.HEAD will
2533 if (list
.head
!= NULL
)
2535 ASSERT (list
.head
->header
.next
== NULL
);
2537 for (pp
= &ptr
->children
.head
;
2539 pp
= &(*pp
)->header
.next
)
2540 ASSERT (*pp
!= NULL
);
2542 list
.head
->header
.next
= *pp
;
2548 /* Check if all sections in a wild statement for a particular FILE
2552 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2553 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2555 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2558 lang_output_section_statement_type
*os
;
2560 os
= (lang_output_section_statement_type
*) output
;
2562 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2563 if (unique_section_p (section
, os
))
2566 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2567 os
->all_input_readonly
= FALSE
;
2570 /* This is passed a file name which must have been seen already and
2571 added to the statement tree. We will see if it has been opened
2572 already and had its symbols read. If not then we'll read it. */
2574 static lang_input_statement_type
*
2575 lookup_name (const char *name
)
2577 lang_input_statement_type
*search
;
2579 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2581 search
= (lang_input_statement_type
*) search
->next_real_file
)
2583 /* Use the local_sym_name as the name of the file that has
2584 already been loaded as filename might have been transformed
2585 via the search directory lookup mechanism. */
2586 const char *filename
= search
->local_sym_name
;
2588 if (filename
!= NULL
2589 && filename_cmp (filename
, name
) == 0)
2594 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2595 default_target
, FALSE
);
2597 /* If we have already added this file, or this file is not real
2598 don't add this file. */
2599 if (search
->flags
.loaded
|| !search
->flags
.real
)
2602 if (! load_symbols (search
, NULL
))
2608 /* Save LIST as a list of libraries whose symbols should not be exported. */
2613 struct excluded_lib
*next
;
2615 static struct excluded_lib
*excluded_libs
;
2618 add_excluded_libs (const char *list
)
2620 const char *p
= list
, *end
;
2624 struct excluded_lib
*entry
;
2625 end
= strpbrk (p
, ",:");
2627 end
= p
+ strlen (p
);
2628 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2629 entry
->next
= excluded_libs
;
2630 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2631 memcpy (entry
->name
, p
, end
- p
);
2632 entry
->name
[end
- p
] = '\0';
2633 excluded_libs
= entry
;
2641 check_excluded_libs (bfd
*abfd
)
2643 struct excluded_lib
*lib
= excluded_libs
;
2647 int len
= strlen (lib
->name
);
2648 const char *filename
= lbasename (abfd
->filename
);
2650 if (strcmp (lib
->name
, "ALL") == 0)
2652 abfd
->no_export
= TRUE
;
2656 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2657 && (filename
[len
] == '\0'
2658 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2659 && filename
[len
+ 2] == '\0')))
2661 abfd
->no_export
= TRUE
;
2669 /* Get the symbols for an input file. */
2672 load_symbols (lang_input_statement_type
*entry
,
2673 lang_statement_list_type
*place
)
2677 if (entry
->flags
.loaded
)
2680 ldfile_open_file (entry
);
2682 /* Do not process further if the file was missing. */
2683 if (entry
->flags
.missing_file
)
2686 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2687 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2690 struct lang_input_statement_flags save_flags
;
2692 err
= bfd_get_error ();
2694 /* See if the emulation has some special knowledge. */
2695 if (ldemul_unrecognized_file (entry
))
2698 if (err
== bfd_error_file_ambiguously_recognized
)
2702 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2703 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2704 for (p
= matching
; *p
!= NULL
; p
++)
2708 else if (err
!= bfd_error_file_not_recognized
2710 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2712 bfd_close (entry
->the_bfd
);
2713 entry
->the_bfd
= NULL
;
2715 /* Try to interpret the file as a linker script. */
2716 save_flags
= input_flags
;
2717 ldfile_open_command_file (entry
->filename
);
2719 push_stat_ptr (place
);
2720 input_flags
.add_DT_NEEDED_for_regular
2721 = entry
->flags
.add_DT_NEEDED_for_regular
;
2722 input_flags
.add_DT_NEEDED_for_dynamic
2723 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2724 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2725 input_flags
.dynamic
= entry
->flags
.dynamic
;
2727 ldfile_assumed_script
= TRUE
;
2728 parser_input
= input_script
;
2730 ldfile_assumed_script
= FALSE
;
2732 /* missing_file is sticky. sysrooted will already have been
2733 restored when seeing EOF in yyparse, but no harm to restore
2735 save_flags
.missing_file
|= input_flags
.missing_file
;
2736 input_flags
= save_flags
;
2742 if (ldemul_recognized_file (entry
))
2745 /* We don't call ldlang_add_file for an archive. Instead, the
2746 add_symbols entry point will call ldlang_add_file, via the
2747 add_archive_element callback, for each element of the archive
2749 switch (bfd_get_format (entry
->the_bfd
))
2755 #ifdef ENABLE_PLUGINS
2756 if (!entry
->flags
.reload
)
2758 ldlang_add_file (entry
);
2759 if (trace_files
|| trace_file_tries
)
2760 info_msg ("%I\n", entry
);
2764 check_excluded_libs (entry
->the_bfd
);
2766 if (entry
->flags
.whole_archive
)
2769 bfd_boolean loaded
= TRUE
;
2774 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2779 if (! bfd_check_format (member
, bfd_object
))
2781 einfo (_("%F%B: member %B in archive is not an object\n"),
2782 entry
->the_bfd
, member
);
2787 if (!(*link_info
.callbacks
2788 ->add_archive_element
) (&link_info
, member
,
2789 "--whole-archive", &subsbfd
))
2792 /* Potentially, the add_archive_element hook may have set a
2793 substitute BFD for us. */
2794 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2796 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2801 entry
->flags
.loaded
= loaded
;
2807 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2808 entry
->flags
.loaded
= TRUE
;
2810 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2812 return entry
->flags
.loaded
;
2815 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2816 may be NULL, indicating that it is a wildcard. Separate
2817 lang_input_section statements are created for each part of the
2818 expansion; they are added after the wild statement S. OUTPUT is
2819 the output section. */
2822 wild (lang_wild_statement_type
*s
,
2823 const char *target ATTRIBUTE_UNUSED
,
2824 lang_output_section_statement_type
*output
)
2826 struct wildcard_list
*sec
;
2828 if (s
->handler_data
[0]
2829 && s
->handler_data
[0]->spec
.sorted
== by_name
2830 && !s
->filenames_sorted
)
2832 lang_section_bst_type
*tree
;
2834 walk_wild (s
, output_section_callback_fast
, output
);
2839 output_section_callback_tree_to_list (s
, tree
, output
);
2844 walk_wild (s
, output_section_callback
, output
);
2846 if (default_common_section
== NULL
)
2847 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2848 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2850 /* Remember the section that common is going to in case we
2851 later get something which doesn't know where to put it. */
2852 default_common_section
= output
;
2857 /* Return TRUE iff target is the sought target. */
2860 get_target (const bfd_target
*target
, void *data
)
2862 const char *sought
= (const char *) data
;
2864 return strcmp (target
->name
, sought
) == 0;
2867 /* Like strcpy() but convert to lower case as well. */
2870 stricpy (char *dest
, char *src
)
2874 while ((c
= *src
++) != 0)
2875 *dest
++ = TOLOWER (c
);
2880 /* Remove the first occurrence of needle (if any) in haystack
2884 strcut (char *haystack
, char *needle
)
2886 haystack
= strstr (haystack
, needle
);
2892 for (src
= haystack
+ strlen (needle
); *src
;)
2893 *haystack
++ = *src
++;
2899 /* Compare two target format name strings.
2900 Return a value indicating how "similar" they are. */
2903 name_compare (char *first
, char *second
)
2909 copy1
= (char *) xmalloc (strlen (first
) + 1);
2910 copy2
= (char *) xmalloc (strlen (second
) + 1);
2912 /* Convert the names to lower case. */
2913 stricpy (copy1
, first
);
2914 stricpy (copy2
, second
);
2916 /* Remove size and endian strings from the name. */
2917 strcut (copy1
, "big");
2918 strcut (copy1
, "little");
2919 strcut (copy2
, "big");
2920 strcut (copy2
, "little");
2922 /* Return a value based on how many characters match,
2923 starting from the beginning. If both strings are
2924 the same then return 10 * their length. */
2925 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2926 if (copy1
[result
] == 0)
2938 /* Set by closest_target_match() below. */
2939 static const bfd_target
*winner
;
2941 /* Scan all the valid bfd targets looking for one that has the endianness
2942 requirement that was specified on the command line, and is the nearest
2943 match to the original output target. */
2946 closest_target_match (const bfd_target
*target
, void *data
)
2948 const bfd_target
*original
= (const bfd_target
*) data
;
2950 if (command_line
.endian
== ENDIAN_BIG
2951 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2954 if (command_line
.endian
== ENDIAN_LITTLE
2955 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2958 /* Must be the same flavour. */
2959 if (target
->flavour
!= original
->flavour
)
2962 /* Ignore generic big and little endian elf vectors. */
2963 if (strcmp (target
->name
, "elf32-big") == 0
2964 || strcmp (target
->name
, "elf64-big") == 0
2965 || strcmp (target
->name
, "elf32-little") == 0
2966 || strcmp (target
->name
, "elf64-little") == 0)
2969 /* If we have not found a potential winner yet, then record this one. */
2976 /* Oh dear, we now have two potential candidates for a successful match.
2977 Compare their names and choose the better one. */
2978 if (name_compare (target
->name
, original
->name
)
2979 > name_compare (winner
->name
, original
->name
))
2982 /* Keep on searching until wqe have checked them all. */
2986 /* Return the BFD target format of the first input file. */
2989 get_first_input_target (void)
2991 char *target
= NULL
;
2993 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2995 if (s
->header
.type
== lang_input_statement_enum
2998 ldfile_open_file (s
);
3000 if (s
->the_bfd
!= NULL
3001 && bfd_check_format (s
->the_bfd
, bfd_object
))
3003 target
= bfd_get_target (s
->the_bfd
);
3015 lang_get_output_target (void)
3019 /* Has the user told us which output format to use? */
3020 if (output_target
!= NULL
)
3021 return output_target
;
3023 /* No - has the current target been set to something other than
3025 if (current_target
!= default_target
&& current_target
!= NULL
)
3026 return current_target
;
3028 /* No - can we determine the format of the first input file? */
3029 target
= get_first_input_target ();
3033 /* Failed - use the default output target. */
3034 return default_target
;
3037 /* Open the output file. */
3040 open_output (const char *name
)
3042 output_target
= lang_get_output_target ();
3044 /* Has the user requested a particular endianness on the command
3046 if (command_line
.endian
!= ENDIAN_UNSET
)
3048 const bfd_target
*target
;
3049 enum bfd_endian desired_endian
;
3051 /* Get the chosen target. */
3052 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3054 /* If the target is not supported, we cannot do anything. */
3057 if (command_line
.endian
== ENDIAN_BIG
)
3058 desired_endian
= BFD_ENDIAN_BIG
;
3060 desired_endian
= BFD_ENDIAN_LITTLE
;
3062 /* See if the target has the wrong endianness. This should
3063 not happen if the linker script has provided big and
3064 little endian alternatives, but some scrips don't do
3066 if (target
->byteorder
!= desired_endian
)
3068 /* If it does, then see if the target provides
3069 an alternative with the correct endianness. */
3070 if (target
->alternative_target
!= NULL
3071 && (target
->alternative_target
->byteorder
== desired_endian
))
3072 output_target
= target
->alternative_target
->name
;
3075 /* Try to find a target as similar as possible to
3076 the default target, but which has the desired
3077 endian characteristic. */
3078 bfd_search_for_target (closest_target_match
,
3081 /* Oh dear - we could not find any targets that
3082 satisfy our requirements. */
3084 einfo (_("%P: warning: could not find any targets"
3085 " that match endianness requirement\n"));
3087 output_target
= winner
->name
;
3093 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3095 if (link_info
.output_bfd
== NULL
)
3097 if (bfd_get_error () == bfd_error_invalid_target
)
3098 einfo (_("%P%F: target %s not found\n"), output_target
);
3100 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3103 delete_output_file_on_failure
= TRUE
;
3105 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3106 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3107 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3108 ldfile_output_architecture
,
3109 ldfile_output_machine
))
3110 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3112 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3113 if (link_info
.hash
== NULL
)
3114 einfo (_("%P%F: can not create hash table: %E\n"));
3116 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3120 ldlang_open_output (lang_statement_union_type
*statement
)
3122 switch (statement
->header
.type
)
3124 case lang_output_statement_enum
:
3125 ASSERT (link_info
.output_bfd
== NULL
);
3126 open_output (statement
->output_statement
.name
);
3127 ldemul_set_output_arch ();
3128 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3129 link_info
.output_bfd
->flags
|= D_PAGED
;
3131 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3132 if (config
.text_read_only
)
3133 link_info
.output_bfd
->flags
|= WP_TEXT
;
3135 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3136 if (link_info
.traditional_format
)
3137 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3139 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3142 case lang_target_statement_enum
:
3143 current_target
= statement
->target_statement
.target
;
3150 /* Convert between addresses in bytes and sizes in octets.
3151 For currently supported targets, octets_per_byte is always a power
3152 of two, so we can use shifts. */
3153 #define TO_ADDR(X) ((X) >> opb_shift)
3154 #define TO_SIZE(X) ((X) << opb_shift)
3156 /* Support the above. */
3157 static unsigned int opb_shift
= 0;
3162 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3163 ldfile_output_machine
);
3166 while ((x
& 1) == 0)
3174 /* Open all the input files. */
3178 OPEN_BFD_NORMAL
= 0,
3182 #ifdef ENABLE_PLUGINS
3183 static lang_input_statement_type
*plugin_insert
= NULL
;
3187 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3189 for (; s
!= NULL
; s
= s
->header
.next
)
3191 switch (s
->header
.type
)
3193 case lang_constructors_statement_enum
:
3194 open_input_bfds (constructor_list
.head
, mode
);
3196 case lang_output_section_statement_enum
:
3197 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3199 case lang_wild_statement_enum
:
3200 /* Maybe we should load the file's symbols. */
3201 if ((mode
& OPEN_BFD_RESCAN
) == 0
3202 && s
->wild_statement
.filename
3203 && !wildcardp (s
->wild_statement
.filename
)
3204 && !archive_path (s
->wild_statement
.filename
))
3205 lookup_name (s
->wild_statement
.filename
);
3206 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3208 case lang_group_statement_enum
:
3210 struct bfd_link_hash_entry
*undefs
;
3212 /* We must continually search the entries in the group
3213 until no new symbols are added to the list of undefined
3218 undefs
= link_info
.hash
->undefs_tail
;
3219 open_input_bfds (s
->group_statement
.children
.head
,
3220 mode
| OPEN_BFD_FORCE
);
3222 while (undefs
!= link_info
.hash
->undefs_tail
);
3225 case lang_target_statement_enum
:
3226 current_target
= s
->target_statement
.target
;
3228 case lang_input_statement_enum
:
3229 if (s
->input_statement
.flags
.real
)
3231 lang_statement_union_type
**os_tail
;
3232 lang_statement_list_type add
;
3234 s
->input_statement
.target
= current_target
;
3236 /* If we are being called from within a group, and this
3237 is an archive which has already been searched, then
3238 force it to be researched unless the whole archive
3239 has been loaded already. Do the same for a rescan. */
3240 if (mode
!= OPEN_BFD_NORMAL
3241 #ifdef ENABLE_PLUGINS
3242 && ((mode
& OPEN_BFD_RESCAN
) == 0
3243 || plugin_insert
== NULL
)
3245 && !s
->input_statement
.flags
.whole_archive
3246 && s
->input_statement
.flags
.loaded
3247 && bfd_check_format (s
->input_statement
.the_bfd
,
3249 s
->input_statement
.flags
.loaded
= FALSE
;
3250 #ifdef ENABLE_PLUGINS
3251 /* When rescanning, reload --as-needed shared libs. */
3252 else if ((mode
& OPEN_BFD_RESCAN
) != 0
3253 && plugin_insert
== NULL
3254 && s
->input_statement
.flags
.loaded
3255 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3256 && ((s
->input_statement
.the_bfd
->flags
) & DYNAMIC
) != 0
3257 && plugin_should_reload (s
->input_statement
.the_bfd
))
3259 s
->input_statement
.flags
.loaded
= FALSE
;
3260 s
->input_statement
.flags
.reload
= TRUE
;
3264 os_tail
= lang_output_section_statement
.tail
;
3265 lang_list_init (&add
);
3267 if (! load_symbols (&s
->input_statement
, &add
))
3268 config
.make_executable
= FALSE
;
3270 if (add
.head
!= NULL
)
3272 /* If this was a script with output sections then
3273 tack any added statements on to the end of the
3274 list. This avoids having to reorder the output
3275 section statement list. Very likely the user
3276 forgot -T, and whatever we do here will not meet
3277 naive user expectations. */
3278 if (os_tail
!= lang_output_section_statement
.tail
)
3280 einfo (_("%P: warning: %s contains output sections;"
3281 " did you forget -T?\n"),
3282 s
->input_statement
.filename
);
3283 *stat_ptr
->tail
= add
.head
;
3284 stat_ptr
->tail
= add
.tail
;
3288 *add
.tail
= s
->header
.next
;
3289 s
->header
.next
= add
.head
;
3293 #ifdef ENABLE_PLUGINS
3294 /* If we have found the point at which a plugin added new
3295 files, clear plugin_insert to enable archive rescan. */
3296 if (&s
->input_statement
== plugin_insert
)
3297 plugin_insert
= NULL
;
3300 case lang_assignment_statement_enum
:
3301 if (s
->assignment_statement
.exp
->assign
.hidden
)
3302 /* This is from a --defsym on the command line. */
3303 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3310 /* Exit if any of the files were missing. */
3311 if (input_flags
.missing_file
)
3315 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3318 lang_track_definedness (const char *name
)
3320 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3321 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3324 /* New-function for the definedness hash table. */
3326 static struct bfd_hash_entry
*
3327 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3328 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3329 const char *name ATTRIBUTE_UNUSED
)
3331 struct lang_definedness_hash_entry
*ret
3332 = (struct lang_definedness_hash_entry
*) entry
;
3335 ret
= (struct lang_definedness_hash_entry
*)
3336 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3339 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3341 ret
->iteration
= -1;
3345 /* Return the iteration when the definition of NAME was last updated. A
3346 value of -1 means that the symbol is not defined in the linker script
3347 or the command line, but may be defined in the linker symbol table. */
3350 lang_symbol_definition_iteration (const char *name
)
3352 struct lang_definedness_hash_entry
*defentry
3353 = (struct lang_definedness_hash_entry
*)
3354 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3356 /* We've already created this one on the presence of DEFINED in the
3357 script, so it can't be NULL unless something is borked elsewhere in
3359 if (defentry
== NULL
)
3362 return defentry
->iteration
;
3365 /* Update the definedness state of NAME. */
3368 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3370 struct lang_definedness_hash_entry
*defentry
3371 = (struct lang_definedness_hash_entry
*)
3372 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3374 /* We don't keep track of symbols not tested with DEFINED. */
3375 if (defentry
== NULL
)
3378 /* If the symbol was already defined, and not from an earlier statement
3379 iteration, don't update the definedness iteration, because that'd
3380 make the symbol seem defined in the linker script at this point, and
3381 it wasn't; it was defined in some object. If we do anyway, DEFINED
3382 would start to yield false before this point and the construct "sym =
3383 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3385 if (h
->type
!= bfd_link_hash_undefined
3386 && h
->type
!= bfd_link_hash_common
3387 && h
->type
!= bfd_link_hash_new
3388 && defentry
->iteration
== -1)
3391 defentry
->iteration
= lang_statement_iteration
;
3394 /* Add the supplied name to the symbol table as an undefined reference.
3395 This is a two step process as the symbol table doesn't even exist at
3396 the time the ld command line is processed. First we put the name
3397 on a list, then, once the output file has been opened, transfer the
3398 name to the symbol table. */
3400 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3402 #define ldlang_undef_chain_list_head entry_symbol.next
3405 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3407 ldlang_undef_chain_list_type
*new_undef
;
3409 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3410 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3411 new_undef
->next
= ldlang_undef_chain_list_head
;
3412 ldlang_undef_chain_list_head
= new_undef
;
3414 new_undef
->name
= xstrdup (name
);
3416 if (link_info
.output_bfd
!= NULL
)
3417 insert_undefined (new_undef
->name
);
3420 /* Insert NAME as undefined in the symbol table. */
3423 insert_undefined (const char *name
)
3425 struct bfd_link_hash_entry
*h
;
3427 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3429 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3430 if (h
->type
== bfd_link_hash_new
)
3432 h
->type
= bfd_link_hash_undefined
;
3433 h
->u
.undef
.abfd
= NULL
;
3434 bfd_link_add_undef (link_info
.hash
, h
);
3438 /* Run through the list of undefineds created above and place them
3439 into the linker hash table as undefined symbols belonging to the
3443 lang_place_undefineds (void)
3445 ldlang_undef_chain_list_type
*ptr
;
3447 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3448 insert_undefined (ptr
->name
);
3451 /* Check for all readonly or some readwrite sections. */
3454 check_input_sections
3455 (lang_statement_union_type
*s
,
3456 lang_output_section_statement_type
*output_section_statement
)
3458 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3460 switch (s
->header
.type
)
3462 case lang_wild_statement_enum
:
3463 walk_wild (&s
->wild_statement
, check_section_callback
,
3464 output_section_statement
);
3465 if (! output_section_statement
->all_input_readonly
)
3468 case lang_constructors_statement_enum
:
3469 check_input_sections (constructor_list
.head
,
3470 output_section_statement
);
3471 if (! output_section_statement
->all_input_readonly
)
3474 case lang_group_statement_enum
:
3475 check_input_sections (s
->group_statement
.children
.head
,
3476 output_section_statement
);
3477 if (! output_section_statement
->all_input_readonly
)
3486 /* Update wildcard statements if needed. */
3489 update_wild_statements (lang_statement_union_type
*s
)
3491 struct wildcard_list
*sec
;
3493 switch (sort_section
)
3503 for (; s
!= NULL
; s
= s
->header
.next
)
3505 switch (s
->header
.type
)
3510 case lang_wild_statement_enum
:
3511 sec
= s
->wild_statement
.section_list
;
3512 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3515 switch (sec
->spec
.sorted
)
3518 sec
->spec
.sorted
= sort_section
;
3521 if (sort_section
== by_alignment
)
3522 sec
->spec
.sorted
= by_name_alignment
;
3525 if (sort_section
== by_name
)
3526 sec
->spec
.sorted
= by_alignment_name
;
3534 case lang_constructors_statement_enum
:
3535 update_wild_statements (constructor_list
.head
);
3538 case lang_output_section_statement_enum
:
3539 update_wild_statements
3540 (s
->output_section_statement
.children
.head
);
3543 case lang_group_statement_enum
:
3544 update_wild_statements (s
->group_statement
.children
.head
);
3552 /* Open input files and attach to output sections. */
3555 map_input_to_output_sections
3556 (lang_statement_union_type
*s
, const char *target
,
3557 lang_output_section_statement_type
*os
)
3559 for (; s
!= NULL
; s
= s
->header
.next
)
3561 lang_output_section_statement_type
*tos
;
3564 switch (s
->header
.type
)
3566 case lang_wild_statement_enum
:
3567 wild (&s
->wild_statement
, target
, os
);
3569 case lang_constructors_statement_enum
:
3570 map_input_to_output_sections (constructor_list
.head
,
3574 case lang_output_section_statement_enum
:
3575 tos
= &s
->output_section_statement
;
3576 if (tos
->constraint
!= 0)
3578 if (tos
->constraint
!= ONLY_IF_RW
3579 && tos
->constraint
!= ONLY_IF_RO
)
3581 tos
->all_input_readonly
= TRUE
;
3582 check_input_sections (tos
->children
.head
, tos
);
3583 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3585 tos
->constraint
= -1;
3589 map_input_to_output_sections (tos
->children
.head
,
3593 case lang_output_statement_enum
:
3595 case lang_target_statement_enum
:
3596 target
= s
->target_statement
.target
;
3598 case lang_group_statement_enum
:
3599 map_input_to_output_sections (s
->group_statement
.children
.head
,
3603 case lang_data_statement_enum
:
3604 /* Make sure that any sections mentioned in the expression
3606 exp_init_os (s
->data_statement
.exp
);
3607 /* The output section gets CONTENTS, ALLOC and LOAD, but
3608 these may be overridden by the script. */
3609 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3610 switch (os
->sectype
)
3612 case normal_section
:
3613 case overlay_section
:
3615 case noalloc_section
:
3616 flags
= SEC_HAS_CONTENTS
;
3618 case noload_section
:
3619 if (bfd_get_flavour (link_info
.output_bfd
)
3620 == bfd_target_elf_flavour
)
3621 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3623 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3626 if (os
->bfd_section
== NULL
)
3627 init_os (os
, flags
);
3629 os
->bfd_section
->flags
|= flags
;
3631 case lang_input_section_enum
:
3633 case lang_fill_statement_enum
:
3634 case lang_object_symbols_statement_enum
:
3635 case lang_reloc_statement_enum
:
3636 case lang_padding_statement_enum
:
3637 case lang_input_statement_enum
:
3638 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3641 case lang_assignment_statement_enum
:
3642 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3645 /* Make sure that any sections mentioned in the assignment
3647 exp_init_os (s
->assignment_statement
.exp
);
3649 case lang_address_statement_enum
:
3650 /* Mark the specified section with the supplied address.
3651 If this section was actually a segment marker, then the
3652 directive is ignored if the linker script explicitly
3653 processed the segment marker. Originally, the linker
3654 treated segment directives (like -Ttext on the
3655 command-line) as section directives. We honor the
3656 section directive semantics for backwards compatibilty;
3657 linker scripts that do not specifically check for
3658 SEGMENT_START automatically get the old semantics. */
3659 if (!s
->address_statement
.segment
3660 || !s
->address_statement
.segment
->used
)
3662 const char *name
= s
->address_statement
.section_name
;
3664 /* Create the output section statement here so that
3665 orphans with a set address will be placed after other
3666 script sections. If we let the orphan placement code
3667 place them in amongst other sections then the address
3668 will affect following script sections, which is
3669 likely to surprise naive users. */
3670 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3671 tos
->addr_tree
= s
->address_statement
.address
;
3672 if (tos
->bfd_section
== NULL
)
3676 case lang_insert_statement_enum
:
3682 /* An insert statement snips out all the linker statements from the
3683 start of the list and places them after the output section
3684 statement specified by the insert. This operation is complicated
3685 by the fact that we keep a doubly linked list of output section
3686 statements as well as the singly linked list of all statements. */
3689 process_insert_statements (void)
3691 lang_statement_union_type
**s
;
3692 lang_output_section_statement_type
*first_os
= NULL
;
3693 lang_output_section_statement_type
*last_os
= NULL
;
3694 lang_output_section_statement_type
*os
;
3696 /* "start of list" is actually the statement immediately after
3697 the special abs_section output statement, so that it isn't
3699 s
= &lang_output_section_statement
.head
;
3700 while (*(s
= &(*s
)->header
.next
) != NULL
)
3702 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3704 /* Keep pointers to the first and last output section
3705 statement in the sequence we may be about to move. */
3706 os
= &(*s
)->output_section_statement
;
3708 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3711 /* Set constraint negative so that lang_output_section_find
3712 won't match this output section statement. At this
3713 stage in linking constraint has values in the range
3714 [-1, ONLY_IN_RW]. */
3715 last_os
->constraint
= -2 - last_os
->constraint
;
3716 if (first_os
== NULL
)
3719 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3721 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3722 lang_output_section_statement_type
*where
;
3723 lang_statement_union_type
**ptr
;
3724 lang_statement_union_type
*first
;
3726 where
= lang_output_section_find (i
->where
);
3727 if (where
!= NULL
&& i
->is_before
)
3730 where
= where
->prev
;
3731 while (where
!= NULL
&& where
->constraint
< 0);
3735 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3739 /* Deal with reordering the output section statement list. */
3740 if (last_os
!= NULL
)
3742 asection
*first_sec
, *last_sec
;
3743 struct lang_output_section_statement_struct
**next
;
3745 /* Snip out the output sections we are moving. */
3746 first_os
->prev
->next
= last_os
->next
;
3747 if (last_os
->next
== NULL
)
3749 next
= &first_os
->prev
->next
;
3750 lang_output_section_statement
.tail
3751 = (lang_statement_union_type
**) next
;
3754 last_os
->next
->prev
= first_os
->prev
;
3755 /* Add them in at the new position. */
3756 last_os
->next
= where
->next
;
3757 if (where
->next
== NULL
)
3759 next
= &last_os
->next
;
3760 lang_output_section_statement
.tail
3761 = (lang_statement_union_type
**) next
;
3764 where
->next
->prev
= last_os
;
3765 first_os
->prev
= where
;
3766 where
->next
= first_os
;
3768 /* Move the bfd sections in the same way. */
3771 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3773 os
->constraint
= -2 - os
->constraint
;
3774 if (os
->bfd_section
!= NULL
3775 && os
->bfd_section
->owner
!= NULL
)
3777 last_sec
= os
->bfd_section
;
3778 if (first_sec
== NULL
)
3779 first_sec
= last_sec
;
3784 if (last_sec
!= NULL
)
3786 asection
*sec
= where
->bfd_section
;
3788 sec
= output_prev_sec_find (where
);
3790 /* The place we want to insert must come after the
3791 sections we are moving. So if we find no
3792 section or if the section is the same as our
3793 last section, then no move is needed. */
3794 if (sec
!= NULL
&& sec
!= last_sec
)
3796 /* Trim them off. */
3797 if (first_sec
->prev
!= NULL
)
3798 first_sec
->prev
->next
= last_sec
->next
;
3800 link_info
.output_bfd
->sections
= last_sec
->next
;
3801 if (last_sec
->next
!= NULL
)
3802 last_sec
->next
->prev
= first_sec
->prev
;
3804 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3806 last_sec
->next
= sec
->next
;
3807 if (sec
->next
!= NULL
)
3808 sec
->next
->prev
= last_sec
;
3810 link_info
.output_bfd
->section_last
= last_sec
;
3811 first_sec
->prev
= sec
;
3812 sec
->next
= first_sec
;
3820 ptr
= insert_os_after (where
);
3821 /* Snip everything after the abs_section output statement we
3822 know is at the start of the list, up to and including
3823 the insert statement we are currently processing. */
3824 first
= lang_output_section_statement
.head
->header
.next
;
3825 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3826 /* Add them back where they belong. */
3829 statement_list
.tail
= s
;
3831 s
= &lang_output_section_statement
.head
;
3835 /* Undo constraint twiddling. */
3836 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3838 os
->constraint
= -2 - os
->constraint
;
3844 /* An output section might have been removed after its statement was
3845 added. For example, ldemul_before_allocation can remove dynamic
3846 sections if they turn out to be not needed. Clean them up here. */
3849 strip_excluded_output_sections (void)
3851 lang_output_section_statement_type
*os
;
3853 /* Run lang_size_sections (if not already done). */
3854 if (expld
.phase
!= lang_mark_phase_enum
)
3856 expld
.phase
= lang_mark_phase_enum
;
3857 expld
.dataseg
.phase
= exp_dataseg_none
;
3858 one_lang_size_sections_pass (NULL
, FALSE
);
3859 lang_reset_memory_regions ();
3862 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3866 asection
*output_section
;
3867 bfd_boolean exclude
;
3869 if (os
->constraint
< 0)
3872 output_section
= os
->bfd_section
;
3873 if (output_section
== NULL
)
3876 exclude
= (output_section
->rawsize
== 0
3877 && (output_section
->flags
& SEC_KEEP
) == 0
3878 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3881 /* Some sections have not yet been sized, notably .gnu.version,
3882 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3883 input sections, so don't drop output sections that have such
3884 input sections unless they are also marked SEC_EXCLUDE. */
3885 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3889 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3890 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3891 && (s
->flags
& SEC_EXCLUDE
) == 0)
3898 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3899 output_section
->map_head
.link_order
= NULL
;
3900 output_section
->map_tail
.link_order
= NULL
;
3904 /* We don't set bfd_section to NULL since bfd_section of the
3905 removed output section statement may still be used. */
3906 if (!os
->section_relative_symbol
3907 && !os
->update_dot_tree
)
3909 output_section
->flags
|= SEC_EXCLUDE
;
3910 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3911 link_info
.output_bfd
->section_count
--;
3915 /* Stop future calls to lang_add_section from messing with map_head
3916 and map_tail link_order fields. */
3917 stripped_excluded_sections
= TRUE
;
3921 print_output_section_statement
3922 (lang_output_section_statement_type
*output_section_statement
)
3924 asection
*section
= output_section_statement
->bfd_section
;
3927 if (output_section_statement
!= abs_output_section
)
3929 minfo ("\n%s", output_section_statement
->name
);
3931 if (section
!= NULL
)
3933 print_dot
= section
->vma
;
3935 len
= strlen (output_section_statement
->name
);
3936 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3941 while (len
< SECTION_NAME_MAP_LENGTH
)
3947 minfo ("0x%V %W", section
->vma
, section
->size
);
3949 if (section
->vma
!= section
->lma
)
3950 minfo (_(" load address 0x%V"), section
->lma
);
3952 if (output_section_statement
->update_dot_tree
!= NULL
)
3953 exp_fold_tree (output_section_statement
->update_dot_tree
,
3954 bfd_abs_section_ptr
, &print_dot
);
3960 print_statement_list (output_section_statement
->children
.head
,
3961 output_section_statement
);
3964 /* Scan for the use of the destination in the right hand side
3965 of an expression. In such cases we will not compute the
3966 correct expression, since the value of DST that is used on
3967 the right hand side will be its final value, not its value
3968 just before this expression is evaluated. */
3971 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3973 if (rhs
== NULL
|| dst
== NULL
)
3976 switch (rhs
->type
.node_class
)
3979 return (scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3980 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
));
3983 return (scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3984 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
));
3987 case etree_provided
:
3989 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3991 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3994 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3998 return strcmp (dst
, rhs
->value
.str
) == 0;
4003 return strcmp (dst
, rhs
->name
.name
) == 0;
4015 print_assignment (lang_assignment_statement_type
*assignment
,
4016 lang_output_section_statement_type
*output_section
)
4020 bfd_boolean computation_is_valid
= TRUE
;
4024 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4027 if (assignment
->exp
->type
.node_class
== etree_assert
)
4030 tree
= assignment
->exp
->assert_s
.child
;
4031 computation_is_valid
= TRUE
;
4035 const char *dst
= assignment
->exp
->assign
.dst
;
4037 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4038 tree
= assignment
->exp
->assign
.src
;
4039 computation_is_valid
= is_dot
|| !scan_for_self_assignment (dst
, tree
);
4042 osec
= output_section
->bfd_section
;
4044 osec
= bfd_abs_section_ptr
;
4045 exp_fold_tree (tree
, osec
, &print_dot
);
4046 if (expld
.result
.valid_p
)
4050 if (computation_is_valid
)
4052 value
= expld
.result
.value
;
4054 if (expld
.result
.section
!= NULL
)
4055 value
+= expld
.result
.section
->vma
;
4057 minfo ("0x%V", value
);
4063 struct bfd_link_hash_entry
*h
;
4065 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4066 FALSE
, FALSE
, TRUE
);
4069 value
= h
->u
.def
.value
;
4070 value
+= h
->u
.def
.section
->output_section
->vma
;
4071 value
+= h
->u
.def
.section
->output_offset
;
4073 minfo ("[0x%V]", value
);
4076 minfo ("[unresolved]");
4088 exp_print_tree (assignment
->exp
);
4093 print_input_statement (lang_input_statement_type
*statm
)
4095 if (statm
->filename
!= NULL
4096 && (statm
->the_bfd
== NULL
4097 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4098 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4101 /* Print all symbols defined in a particular section. This is called
4102 via bfd_link_hash_traverse, or by print_all_symbols. */
4105 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4107 asection
*sec
= (asection
*) ptr
;
4109 if ((hash_entry
->type
== bfd_link_hash_defined
4110 || hash_entry
->type
== bfd_link_hash_defweak
)
4111 && sec
== hash_entry
->u
.def
.section
)
4115 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4118 (hash_entry
->u
.def
.value
4119 + hash_entry
->u
.def
.section
->output_offset
4120 + hash_entry
->u
.def
.section
->output_section
->vma
));
4122 minfo (" %T\n", hash_entry
->root
.string
);
4129 hash_entry_addr_cmp (const void *a
, const void *b
)
4131 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4132 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4134 if (l
->u
.def
.value
< r
->u
.def
.value
)
4136 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4143 print_all_symbols (asection
*sec
)
4145 struct fat_user_section_struct
*ud
=
4146 (struct fat_user_section_struct
*) get_userdata (sec
);
4147 struct map_symbol_def
*def
;
4148 struct bfd_link_hash_entry
**entries
;
4154 *ud
->map_symbol_def_tail
= 0;
4156 /* Sort the symbols by address. */
4157 entries
= (struct bfd_link_hash_entry
**)
4158 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4160 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4161 entries
[i
] = def
->entry
;
4163 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4164 hash_entry_addr_cmp
);
4166 /* Print the symbols. */
4167 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4168 print_one_symbol (entries
[i
], sec
);
4170 obstack_free (&map_obstack
, entries
);
4173 /* Print information about an input section to the map file. */
4176 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4178 bfd_size_type size
= i
->size
;
4185 minfo ("%s", i
->name
);
4187 len
= 1 + strlen (i
->name
);
4188 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4193 while (len
< SECTION_NAME_MAP_LENGTH
)
4199 if (i
->output_section
!= NULL
4200 && i
->output_section
->owner
== link_info
.output_bfd
)
4201 addr
= i
->output_section
->vma
+ i
->output_offset
;
4209 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4211 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4213 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4225 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4228 if (i
->output_section
!= NULL
4229 && i
->output_section
->owner
== link_info
.output_bfd
)
4231 if (link_info
.reduce_memory_overheads
)
4232 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4234 print_all_symbols (i
);
4236 /* Update print_dot, but make sure that we do not move it
4237 backwards - this could happen if we have overlays and a
4238 later overlay is shorter than an earier one. */
4239 if (addr
+ TO_ADDR (size
) > print_dot
)
4240 print_dot
= addr
+ TO_ADDR (size
);
4245 print_fill_statement (lang_fill_statement_type
*fill
)
4249 fputs (" FILL mask 0x", config
.map_file
);
4250 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4251 fprintf (config
.map_file
, "%02x", *p
);
4252 fputs ("\n", config
.map_file
);
4256 print_data_statement (lang_data_statement_type
*data
)
4264 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4267 addr
= data
->output_offset
;
4268 if (data
->output_section
!= NULL
)
4269 addr
+= data
->output_section
->vma
;
4297 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4299 if (data
->exp
->type
.node_class
!= etree_value
)
4302 exp_print_tree (data
->exp
);
4307 print_dot
= addr
+ TO_ADDR (size
);
4310 /* Print an address statement. These are generated by options like
4314 print_address_statement (lang_address_statement_type
*address
)
4316 minfo (_("Address of section %s set to "), address
->section_name
);
4317 exp_print_tree (address
->address
);
4321 /* Print a reloc statement. */
4324 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4331 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4334 addr
= reloc
->output_offset
;
4335 if (reloc
->output_section
!= NULL
)
4336 addr
+= reloc
->output_section
->vma
;
4338 size
= bfd_get_reloc_size (reloc
->howto
);
4340 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4342 if (reloc
->name
!= NULL
)
4343 minfo ("%s+", reloc
->name
);
4345 minfo ("%s+", reloc
->section
->name
);
4347 exp_print_tree (reloc
->addend_exp
);
4351 print_dot
= addr
+ TO_ADDR (size
);
4355 print_padding_statement (lang_padding_statement_type
*s
)
4363 len
= sizeof " *fill*" - 1;
4364 while (len
< SECTION_NAME_MAP_LENGTH
)
4370 addr
= s
->output_offset
;
4371 if (s
->output_section
!= NULL
)
4372 addr
+= s
->output_section
->vma
;
4373 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4375 if (s
->fill
->size
!= 0)
4379 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4380 fprintf (config
.map_file
, "%02x", *p
);
4385 print_dot
= addr
+ TO_ADDR (s
->size
);
4389 print_wild_statement (lang_wild_statement_type
*w
,
4390 lang_output_section_statement_type
*os
)
4392 struct wildcard_list
*sec
;
4396 if (w
->filenames_sorted
)
4398 if (w
->filename
!= NULL
)
4399 minfo ("%s", w
->filename
);
4402 if (w
->filenames_sorted
)
4406 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4408 if (sec
->spec
.sorted
)
4410 if (sec
->spec
.exclude_name_list
!= NULL
)
4413 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4414 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4415 minfo (" %s", tmp
->name
);
4418 if (sec
->spec
.name
!= NULL
)
4419 minfo ("%s", sec
->spec
.name
);
4422 if (sec
->spec
.sorted
)
4431 print_statement_list (w
->children
.head
, os
);
4434 /* Print a group statement. */
4437 print_group (lang_group_statement_type
*s
,
4438 lang_output_section_statement_type
*os
)
4440 fprintf (config
.map_file
, "START GROUP\n");
4441 print_statement_list (s
->children
.head
, os
);
4442 fprintf (config
.map_file
, "END GROUP\n");
4445 /* Print the list of statements in S.
4446 This can be called for any statement type. */
4449 print_statement_list (lang_statement_union_type
*s
,
4450 lang_output_section_statement_type
*os
)
4454 print_statement (s
, os
);
4459 /* Print the first statement in statement list S.
4460 This can be called for any statement type. */
4463 print_statement (lang_statement_union_type
*s
,
4464 lang_output_section_statement_type
*os
)
4466 switch (s
->header
.type
)
4469 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4472 case lang_constructors_statement_enum
:
4473 if (constructor_list
.head
!= NULL
)
4475 if (constructors_sorted
)
4476 minfo (" SORT (CONSTRUCTORS)\n");
4478 minfo (" CONSTRUCTORS\n");
4479 print_statement_list (constructor_list
.head
, os
);
4482 case lang_wild_statement_enum
:
4483 print_wild_statement (&s
->wild_statement
, os
);
4485 case lang_address_statement_enum
:
4486 print_address_statement (&s
->address_statement
);
4488 case lang_object_symbols_statement_enum
:
4489 minfo (" CREATE_OBJECT_SYMBOLS\n");
4491 case lang_fill_statement_enum
:
4492 print_fill_statement (&s
->fill_statement
);
4494 case lang_data_statement_enum
:
4495 print_data_statement (&s
->data_statement
);
4497 case lang_reloc_statement_enum
:
4498 print_reloc_statement (&s
->reloc_statement
);
4500 case lang_input_section_enum
:
4501 print_input_section (s
->input_section
.section
, FALSE
);
4503 case lang_padding_statement_enum
:
4504 print_padding_statement (&s
->padding_statement
);
4506 case lang_output_section_statement_enum
:
4507 print_output_section_statement (&s
->output_section_statement
);
4509 case lang_assignment_statement_enum
:
4510 print_assignment (&s
->assignment_statement
, os
);
4512 case lang_target_statement_enum
:
4513 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4515 case lang_output_statement_enum
:
4516 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4517 if (output_target
!= NULL
)
4518 minfo (" %s", output_target
);
4521 case lang_input_statement_enum
:
4522 print_input_statement (&s
->input_statement
);
4524 case lang_group_statement_enum
:
4525 print_group (&s
->group_statement
, os
);
4527 case lang_insert_statement_enum
:
4528 minfo ("INSERT %s %s\n",
4529 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4530 s
->insert_statement
.where
);
4536 print_statements (void)
4538 print_statement_list (statement_list
.head
, abs_output_section
);
4541 /* Print the first N statements in statement list S to STDERR.
4542 If N == 0, nothing is printed.
4543 If N < 0, the entire list is printed.
4544 Intended to be called from GDB. */
4547 dprint_statement (lang_statement_union_type
*s
, int n
)
4549 FILE *map_save
= config
.map_file
;
4551 config
.map_file
= stderr
;
4554 print_statement_list (s
, abs_output_section
);
4557 while (s
&& --n
>= 0)
4559 print_statement (s
, abs_output_section
);
4564 config
.map_file
= map_save
;
4568 insert_pad (lang_statement_union_type
**ptr
,
4570 bfd_size_type alignment_needed
,
4571 asection
*output_section
,
4574 static fill_type zero_fill
;
4575 lang_statement_union_type
*pad
= NULL
;
4577 if (ptr
!= &statement_list
.head
)
4578 pad
= ((lang_statement_union_type
*)
4579 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4581 && pad
->header
.type
== lang_padding_statement_enum
4582 && pad
->padding_statement
.output_section
== output_section
)
4584 /* Use the existing pad statement. */
4586 else if ((pad
= *ptr
) != NULL
4587 && pad
->header
.type
== lang_padding_statement_enum
4588 && pad
->padding_statement
.output_section
== output_section
)
4590 /* Use the existing pad statement. */
4594 /* Make a new padding statement, linked into existing chain. */
4595 pad
= (lang_statement_union_type
*)
4596 stat_alloc (sizeof (lang_padding_statement_type
));
4597 pad
->header
.next
= *ptr
;
4599 pad
->header
.type
= lang_padding_statement_enum
;
4600 pad
->padding_statement
.output_section
= output_section
;
4603 pad
->padding_statement
.fill
= fill
;
4605 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4606 pad
->padding_statement
.size
= alignment_needed
;
4607 output_section
->size
+= alignment_needed
;
4610 /* Work out how much this section will move the dot point. */
4614 (lang_statement_union_type
**this_ptr
,
4615 lang_output_section_statement_type
*output_section_statement
,
4619 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4620 asection
*i
= is
->section
;
4622 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->flags
.just_syms
4623 && (i
->flags
& SEC_EXCLUDE
) == 0)
4625 bfd_size_type alignment_needed
;
4628 /* Align this section first to the input sections requirement,
4629 then to the output section's requirement. If this alignment
4630 is greater than any seen before, then record it too. Perform
4631 the alignment by inserting a magic 'padding' statement. */
4633 if (output_section_statement
->subsection_alignment
!= -1)
4634 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4636 o
= output_section_statement
->bfd_section
;
4637 if (o
->alignment_power
< i
->alignment_power
)
4638 o
->alignment_power
= i
->alignment_power
;
4640 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4642 if (alignment_needed
!= 0)
4644 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4645 dot
+= alignment_needed
;
4648 /* Remember where in the output section this input section goes. */
4650 i
->output_offset
= dot
- o
->vma
;
4652 /* Mark how big the output section must be to contain this now. */
4653 dot
+= TO_ADDR (i
->size
);
4654 o
->size
= TO_SIZE (dot
- o
->vma
);
4658 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4665 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4667 const asection
*sec1
= *(const asection
**) arg1
;
4668 const asection
*sec2
= *(const asection
**) arg2
;
4670 if (bfd_section_lma (sec1
->owner
, sec1
)
4671 < bfd_section_lma (sec2
->owner
, sec2
))
4673 else if (bfd_section_lma (sec1
->owner
, sec1
)
4674 > bfd_section_lma (sec2
->owner
, sec2
))
4676 else if (sec1
->id
< sec2
->id
)
4678 else if (sec1
->id
> sec2
->id
)
4684 #define IGNORE_SECTION(s) \
4685 ((s->flags & SEC_ALLOC) == 0 \
4686 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4687 && (s->flags & SEC_LOAD) == 0))
4689 /* Check to see if any allocated sections overlap with other allocated
4690 sections. This can happen if a linker script specifies the output
4691 section addresses of the two sections. Also check whether any memory
4692 region has overflowed. */
4695 lang_check_section_addresses (void)
4698 asection
**sections
, **spp
;
4705 lang_memory_region_type
*m
;
4707 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4710 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4711 sections
= (asection
**) xmalloc (amt
);
4713 /* Scan all sections in the output list. */
4715 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4717 /* Only consider loadable sections with real contents. */
4718 if (!(s
->flags
& SEC_LOAD
)
4719 || !(s
->flags
& SEC_ALLOC
)
4723 sections
[count
] = s
;
4730 qsort (sections
, (size_t) count
, sizeof (asection
*),
4731 sort_sections_by_lma
);
4736 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4737 for (count
--; count
; count
--)
4739 /* We must check the sections' LMA addresses not their VMA
4740 addresses because overlay sections can have overlapping VMAs
4741 but they must have distinct LMAs. */
4747 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4749 /* Look for an overlap. We have sorted sections by lma, so we
4750 know that s_start >= p_start. Besides the obvious case of
4751 overlap when the current section starts before the previous
4752 one ends, we also must have overlap if the previous section
4753 wraps around the address space. */
4754 if (s_start
<= p_end
4756 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4757 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4762 /* If any memory region has overflowed, report by how much.
4763 We do not issue this diagnostic for regions that had sections
4764 explicitly placed outside their bounds; os_region_check's
4765 diagnostics are adequate for that case.
4767 FIXME: It is conceivable that m->current - (m->origin + m->length)
4768 might overflow a 32-bit integer. There is, alas, no way to print
4769 a bfd_vma quantity in decimal. */
4770 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4771 if (m
->had_full_message
)
4772 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4773 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4777 /* Make sure the new address is within the region. We explicitly permit the
4778 current address to be at the exact end of the region when the address is
4779 non-zero, in case the region is at the end of addressable memory and the
4780 calculation wraps around. */
4783 os_region_check (lang_output_section_statement_type
*os
,
4784 lang_memory_region_type
*region
,
4788 if ((region
->current
< region
->origin
4789 || (region
->current
- region
->origin
> region
->length
))
4790 && ((region
->current
!= region
->origin
+ region
->length
)
4795 einfo (_("%X%P: address 0x%v of %B section `%s'"
4796 " is not within region `%s'\n"),
4798 os
->bfd_section
->owner
,
4799 os
->bfd_section
->name
,
4800 region
->name_list
.name
);
4802 else if (!region
->had_full_message
)
4804 region
->had_full_message
= TRUE
;
4806 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4807 os
->bfd_section
->owner
,
4808 os
->bfd_section
->name
,
4809 region
->name_list
.name
);
4814 /* Set the sizes for all the output sections. */
4817 lang_size_sections_1
4818 (lang_statement_union_type
**prev
,
4819 lang_output_section_statement_type
*output_section_statement
,
4823 bfd_boolean check_regions
)
4825 lang_statement_union_type
*s
;
4827 /* Size up the sections from their constituent parts. */
4828 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4830 switch (s
->header
.type
)
4832 case lang_output_section_statement_enum
:
4834 bfd_vma newdot
, after
;
4835 lang_output_section_statement_type
*os
;
4836 lang_memory_region_type
*r
;
4837 int section_alignment
= 0;
4839 os
= &s
->output_section_statement
;
4840 if (os
->constraint
== -1)
4843 /* FIXME: We shouldn't need to zero section vmas for ld -r
4844 here, in lang_insert_orphan, or in the default linker scripts.
4845 This is covering for coff backend linker bugs. See PR6945. */
4846 if (os
->addr_tree
== NULL
4847 && link_info
.relocatable
4848 && (bfd_get_flavour (link_info
.output_bfd
)
4849 == bfd_target_coff_flavour
))
4850 os
->addr_tree
= exp_intop (0);
4851 if (os
->addr_tree
!= NULL
)
4853 os
->processed_vma
= FALSE
;
4854 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4856 if (expld
.result
.valid_p
)
4858 dot
= expld
.result
.value
;
4859 if (expld
.result
.section
!= NULL
)
4860 dot
+= expld
.result
.section
->vma
;
4862 else if (expld
.phase
!= lang_mark_phase_enum
)
4863 einfo (_("%F%S: non constant or forward reference"
4864 " address expression for section %s\n"),
4865 os
->addr_tree
, os
->name
);
4868 if (os
->bfd_section
== NULL
)
4869 /* This section was removed or never actually created. */
4872 /* If this is a COFF shared library section, use the size and
4873 address from the input section. FIXME: This is COFF
4874 specific; it would be cleaner if there were some other way
4875 to do this, but nothing simple comes to mind. */
4876 if (((bfd_get_flavour (link_info
.output_bfd
)
4877 == bfd_target_ecoff_flavour
)
4878 || (bfd_get_flavour (link_info
.output_bfd
)
4879 == bfd_target_coff_flavour
))
4880 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4884 if (os
->children
.head
== NULL
4885 || os
->children
.head
->header
.next
!= NULL
4886 || (os
->children
.head
->header
.type
4887 != lang_input_section_enum
))
4888 einfo (_("%P%X: Internal error on COFF shared library"
4889 " section %s\n"), os
->name
);
4891 input
= os
->children
.head
->input_section
.section
;
4892 bfd_set_section_vma (os
->bfd_section
->owner
,
4894 bfd_section_vma (input
->owner
, input
));
4895 os
->bfd_section
->size
= input
->size
;
4900 if (bfd_is_abs_section (os
->bfd_section
))
4902 /* No matter what happens, an abs section starts at zero. */
4903 ASSERT (os
->bfd_section
->vma
== 0);
4907 if (os
->addr_tree
== NULL
)
4909 /* No address specified for this section, get one
4910 from the region specification. */
4911 if (os
->region
== NULL
4912 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4913 && os
->region
->name_list
.name
[0] == '*'
4914 && strcmp (os
->region
->name_list
.name
,
4915 DEFAULT_MEMORY_REGION
) == 0))
4917 os
->region
= lang_memory_default (os
->bfd_section
);
4920 /* If a loadable section is using the default memory
4921 region, and some non default memory regions were
4922 defined, issue an error message. */
4924 && !IGNORE_SECTION (os
->bfd_section
)
4925 && ! link_info
.relocatable
4927 && strcmp (os
->region
->name_list
.name
,
4928 DEFAULT_MEMORY_REGION
) == 0
4929 && lang_memory_region_list
!= NULL
4930 && (strcmp (lang_memory_region_list
->name_list
.name
,
4931 DEFAULT_MEMORY_REGION
) != 0
4932 || lang_memory_region_list
->next
!= NULL
)
4933 && expld
.phase
!= lang_mark_phase_enum
)
4935 /* By default this is an error rather than just a
4936 warning because if we allocate the section to the
4937 default memory region we can end up creating an
4938 excessively large binary, or even seg faulting when
4939 attempting to perform a negative seek. See
4940 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4941 for an example of this. This behaviour can be
4942 overridden by the using the --no-check-sections
4944 if (command_line
.check_section_addresses
)
4945 einfo (_("%P%F: error: no memory region specified"
4946 " for loadable section `%s'\n"),
4947 bfd_get_section_name (link_info
.output_bfd
,
4950 einfo (_("%P: warning: no memory region specified"
4951 " for loadable section `%s'\n"),
4952 bfd_get_section_name (link_info
.output_bfd
,
4956 newdot
= os
->region
->current
;
4957 section_alignment
= os
->bfd_section
->alignment_power
;
4960 section_alignment
= os
->section_alignment
;
4962 /* Align to what the section needs. */
4963 if (section_alignment
> 0)
4965 bfd_vma savedot
= newdot
;
4966 newdot
= align_power (newdot
, section_alignment
);
4968 if (newdot
!= savedot
4969 && (config
.warn_section_align
4970 || os
->addr_tree
!= NULL
)
4971 && expld
.phase
!= lang_mark_phase_enum
)
4972 einfo (_("%P: warning: changing start of section"
4973 " %s by %lu bytes\n"),
4974 os
->name
, (unsigned long) (newdot
- savedot
));
4977 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4979 os
->bfd_section
->output_offset
= 0;
4982 lang_size_sections_1 (&os
->children
.head
, os
,
4983 os
->fill
, newdot
, relax
, check_regions
);
4985 os
->processed_vma
= TRUE
;
4987 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4988 /* Except for some special linker created sections,
4989 no output section should change from zero size
4990 after strip_excluded_output_sections. A non-zero
4991 size on an ignored section indicates that some
4992 input section was not sized early enough. */
4993 ASSERT (os
->bfd_section
->size
== 0);
4996 dot
= os
->bfd_section
->vma
;
4998 /* Put the section within the requested block size, or
4999 align at the block boundary. */
5001 + TO_ADDR (os
->bfd_section
->size
)
5002 + os
->block_value
- 1)
5003 & - (bfd_vma
) os
->block_value
);
5005 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
5008 /* Set section lma. */
5011 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5015 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5016 os
->bfd_section
->lma
= lma
;
5018 else if (os
->lma_region
!= NULL
)
5020 bfd_vma lma
= os
->lma_region
->current
;
5022 if (section_alignment
> 0)
5023 lma
= align_power (lma
, section_alignment
);
5024 os
->bfd_section
->lma
= lma
;
5026 else if (r
->last_os
!= NULL
5027 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5032 last
= r
->last_os
->output_section_statement
.bfd_section
;
5034 /* A backwards move of dot should be accompanied by
5035 an explicit assignment to the section LMA (ie.
5036 os->load_base set) because backwards moves can
5037 create overlapping LMAs. */
5039 && os
->bfd_section
->size
!= 0
5040 && dot
+ os
->bfd_section
->size
<= last
->vma
)
5042 /* If dot moved backwards then leave lma equal to
5043 vma. This is the old default lma, which might
5044 just happen to work when the backwards move is
5045 sufficiently large. Nag if this changes anything,
5046 so people can fix their linker scripts. */
5048 if (last
->vma
!= last
->lma
)
5049 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5054 /* If this is an overlay, set the current lma to that
5055 at the end of the previous section. */
5056 if (os
->sectype
== overlay_section
)
5057 lma
= last
->lma
+ last
->size
;
5059 /* Otherwise, keep the same lma to vma relationship
5060 as the previous section. */
5062 lma
= dot
+ last
->lma
- last
->vma
;
5064 if (section_alignment
> 0)
5065 lma
= align_power (lma
, section_alignment
);
5066 os
->bfd_section
->lma
= lma
;
5069 os
->processed_lma
= TRUE
;
5071 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5074 /* Keep track of normal sections using the default
5075 lma region. We use this to set the lma for
5076 following sections. Overlays or other linker
5077 script assignment to lma might mean that the
5078 default lma == vma is incorrect.
5079 To avoid warnings about dot moving backwards when using
5080 -Ttext, don't start tracking sections until we find one
5081 of non-zero size or with lma set differently to vma. */
5082 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5083 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5084 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5085 && (os
->bfd_section
->size
!= 0
5086 || (r
->last_os
== NULL
5087 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5088 || (r
->last_os
!= NULL
5089 && dot
>= (r
->last_os
->output_section_statement
5090 .bfd_section
->vma
)))
5091 && os
->lma_region
== NULL
5092 && !link_info
.relocatable
)
5095 /* .tbss sections effectively have zero size. */
5096 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5097 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5098 || link_info
.relocatable
)
5099 dot
+= TO_ADDR (os
->bfd_section
->size
);
5101 if (os
->update_dot_tree
!= 0)
5102 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5104 /* Update dot in the region ?
5105 We only do this if the section is going to be allocated,
5106 since unallocated sections do not contribute to the region's
5107 overall size in memory. */
5108 if (os
->region
!= NULL
5109 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5111 os
->region
->current
= dot
;
5114 /* Make sure the new address is within the region. */
5115 os_region_check (os
, os
->region
, os
->addr_tree
,
5116 os
->bfd_section
->vma
);
5118 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5119 && (os
->bfd_section
->flags
& SEC_LOAD
))
5121 os
->lma_region
->current
5122 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5125 os_region_check (os
, os
->lma_region
, NULL
,
5126 os
->bfd_section
->lma
);
5132 case lang_constructors_statement_enum
:
5133 dot
= lang_size_sections_1 (&constructor_list
.head
,
5134 output_section_statement
,
5135 fill
, dot
, relax
, check_regions
);
5138 case lang_data_statement_enum
:
5140 unsigned int size
= 0;
5142 s
->data_statement
.output_offset
=
5143 dot
- output_section_statement
->bfd_section
->vma
;
5144 s
->data_statement
.output_section
=
5145 output_section_statement
->bfd_section
;
5147 /* We might refer to provided symbols in the expression, and
5148 need to mark them as needed. */
5149 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5151 switch (s
->data_statement
.type
)
5169 if (size
< TO_SIZE ((unsigned) 1))
5170 size
= TO_SIZE ((unsigned) 1);
5171 dot
+= TO_ADDR (size
);
5172 output_section_statement
->bfd_section
->size
+= size
;
5176 case lang_reloc_statement_enum
:
5180 s
->reloc_statement
.output_offset
=
5181 dot
- output_section_statement
->bfd_section
->vma
;
5182 s
->reloc_statement
.output_section
=
5183 output_section_statement
->bfd_section
;
5184 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5185 dot
+= TO_ADDR (size
);
5186 output_section_statement
->bfd_section
->size
+= size
;
5190 case lang_wild_statement_enum
:
5191 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5192 output_section_statement
,
5193 fill
, dot
, relax
, check_regions
);
5196 case lang_object_symbols_statement_enum
:
5197 link_info
.create_object_symbols_section
=
5198 output_section_statement
->bfd_section
;
5201 case lang_output_statement_enum
:
5202 case lang_target_statement_enum
:
5205 case lang_input_section_enum
:
5209 i
= s
->input_section
.section
;
5214 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5215 einfo (_("%P%F: can't relax section: %E\n"));
5219 dot
= size_input_section (prev
, output_section_statement
,
5220 output_section_statement
->fill
, dot
);
5224 case lang_input_statement_enum
:
5227 case lang_fill_statement_enum
:
5228 s
->fill_statement
.output_section
=
5229 output_section_statement
->bfd_section
;
5231 fill
= s
->fill_statement
.fill
;
5234 case lang_assignment_statement_enum
:
5236 bfd_vma newdot
= dot
;
5237 etree_type
*tree
= s
->assignment_statement
.exp
;
5239 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5241 exp_fold_tree (tree
,
5242 output_section_statement
->bfd_section
,
5245 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5247 if (!expld
.dataseg
.relro_start_stat
)
5248 expld
.dataseg
.relro_start_stat
= s
;
5251 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5254 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5256 if (!expld
.dataseg
.relro_end_stat
)
5257 expld
.dataseg
.relro_end_stat
= s
;
5260 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5263 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5265 /* This symbol is relative to this section. */
5266 if ((tree
->type
.node_class
== etree_provided
5267 || tree
->type
.node_class
== etree_assign
)
5268 && (tree
->assign
.dst
[0] != '.'
5269 || tree
->assign
.dst
[1] != '\0'))
5270 output_section_statement
->section_relative_symbol
= 1;
5272 if (!output_section_statement
->ignored
)
5274 if (output_section_statement
== abs_output_section
)
5276 /* If we don't have an output section, then just adjust
5277 the default memory address. */
5278 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5279 FALSE
)->current
= newdot
;
5281 else if (newdot
!= dot
)
5283 /* Insert a pad after this statement. We can't
5284 put the pad before when relaxing, in case the
5285 assignment references dot. */
5286 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5287 output_section_statement
->bfd_section
, dot
);
5289 /* Don't neuter the pad below when relaxing. */
5292 /* If dot is advanced, this implies that the section
5293 should have space allocated to it, unless the
5294 user has explicitly stated that the section
5295 should not be allocated. */
5296 if (output_section_statement
->sectype
!= noalloc_section
5297 && (output_section_statement
->sectype
!= noload_section
5298 || (bfd_get_flavour (link_info
.output_bfd
)
5299 == bfd_target_elf_flavour
)))
5300 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5307 case lang_padding_statement_enum
:
5308 /* If this is the first time lang_size_sections is called,
5309 we won't have any padding statements. If this is the
5310 second or later passes when relaxing, we should allow
5311 padding to shrink. If padding is needed on this pass, it
5312 will be added back in. */
5313 s
->padding_statement
.size
= 0;
5315 /* Make sure output_offset is valid. If relaxation shrinks
5316 the section and this pad isn't needed, it's possible to
5317 have output_offset larger than the final size of the
5318 section. bfd_set_section_contents will complain even for
5319 a pad size of zero. */
5320 s
->padding_statement
.output_offset
5321 = dot
- output_section_statement
->bfd_section
->vma
;
5324 case lang_group_statement_enum
:
5325 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5326 output_section_statement
,
5327 fill
, dot
, relax
, check_regions
);
5330 case lang_insert_statement_enum
:
5333 /* We can only get here when relaxing is turned on. */
5334 case lang_address_statement_enum
:
5341 prev
= &s
->header
.next
;
5346 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5347 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5348 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5349 segments. We are allowed an opportunity to override this decision. */
5352 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5353 bfd
* abfd ATTRIBUTE_UNUSED
,
5354 asection
* current_section
,
5355 asection
* previous_section
,
5356 bfd_boolean new_segment
)
5358 lang_output_section_statement_type
* cur
;
5359 lang_output_section_statement_type
* prev
;
5361 /* The checks below are only necessary when the BFD library has decided
5362 that the two sections ought to be placed into the same segment. */
5366 /* Paranoia checks. */
5367 if (current_section
== NULL
|| previous_section
== NULL
)
5370 /* Find the memory regions associated with the two sections.
5371 We call lang_output_section_find() here rather than scanning the list
5372 of output sections looking for a matching section pointer because if
5373 we have a large number of sections then a hash lookup is faster. */
5374 cur
= lang_output_section_find (current_section
->name
);
5375 prev
= lang_output_section_find (previous_section
->name
);
5377 /* More paranoia. */
5378 if (cur
== NULL
|| prev
== NULL
)
5381 /* If the regions are different then force the sections to live in
5382 different segments. See the email thread starting at the following
5383 URL for the reasons why this is necessary:
5384 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5385 return cur
->region
!= prev
->region
;
5389 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5391 lang_statement_iteration
++;
5392 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5393 0, 0, relax
, check_regions
);
5397 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5399 expld
.phase
= lang_allocating_phase_enum
;
5400 expld
.dataseg
.phase
= exp_dataseg_none
;
5402 one_lang_size_sections_pass (relax
, check_regions
);
5403 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5404 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5406 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5407 to put expld.dataseg.relro on a (common) page boundary. */
5408 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5410 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5411 maxpage
= expld
.dataseg
.maxpagesize
;
5412 /* MIN_BASE is the absolute minimum address we are allowed to start the
5413 read-write segment (byte before will be mapped read-only). */
5414 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5415 /* OLD_BASE is the address for a feasible minimum address which will
5416 still not cause a data overlap inside MAXPAGE causing file offset skip
5418 old_base
= expld
.dataseg
.base
;
5419 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5420 & (expld
.dataseg
.pagesize
- 1));
5421 /* Compute the expected PT_GNU_RELRO segment end. */
5422 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5423 & ~(expld
.dataseg
.pagesize
- 1));
5424 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5426 expld
.dataseg
.base
-= maxpage
;
5427 relro_end
-= maxpage
;
5429 lang_reset_memory_regions ();
5430 one_lang_size_sections_pass (relax
, check_regions
);
5431 if (expld
.dataseg
.relro_end
> relro_end
)
5433 /* The alignment of sections between DATA_SEGMENT_ALIGN
5434 and DATA_SEGMENT_RELRO_END caused huge padding to be
5435 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5436 that the section alignments will fit in. */
5438 unsigned int max_alignment_power
= 0;
5440 /* Find maximum alignment power of sections between
5441 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5442 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5443 if (sec
->vma
>= expld
.dataseg
.base
5444 && sec
->vma
< expld
.dataseg
.relro_end
5445 && sec
->alignment_power
> max_alignment_power
)
5446 max_alignment_power
= sec
->alignment_power
;
5448 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5450 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5451 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5452 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5453 lang_reset_memory_regions ();
5454 one_lang_size_sections_pass (relax
, check_regions
);
5457 link_info
.relro_start
= expld
.dataseg
.base
;
5458 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5460 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5462 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5463 a page could be saved in the data segment. */
5464 bfd_vma first
, last
;
5466 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5467 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5469 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5470 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5471 && first
+ last
<= expld
.dataseg
.pagesize
)
5473 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5474 lang_reset_memory_regions ();
5475 one_lang_size_sections_pass (relax
, check_regions
);
5478 expld
.dataseg
.phase
= exp_dataseg_done
;
5481 expld
.dataseg
.phase
= exp_dataseg_done
;
5484 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5487 lang_do_assignments_1 (lang_statement_union_type
*s
,
5488 lang_output_section_statement_type
*current_os
,
5492 for (; s
!= NULL
; s
= s
->header
.next
)
5494 switch (s
->header
.type
)
5496 case lang_constructors_statement_enum
:
5497 dot
= lang_do_assignments_1 (constructor_list
.head
,
5498 current_os
, fill
, dot
);
5501 case lang_output_section_statement_enum
:
5503 lang_output_section_statement_type
*os
;
5505 os
= &(s
->output_section_statement
);
5506 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5508 dot
= os
->bfd_section
->vma
;
5510 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5512 /* .tbss sections effectively have zero size. */
5513 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5514 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5515 || link_info
.relocatable
)
5516 dot
+= TO_ADDR (os
->bfd_section
->size
);
5518 if (os
->update_dot_tree
!= NULL
)
5519 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5524 case lang_wild_statement_enum
:
5526 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5527 current_os
, fill
, dot
);
5530 case lang_object_symbols_statement_enum
:
5531 case lang_output_statement_enum
:
5532 case lang_target_statement_enum
:
5535 case lang_data_statement_enum
:
5536 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5537 if (expld
.result
.valid_p
)
5539 s
->data_statement
.value
= expld
.result
.value
;
5540 if (expld
.result
.section
!= NULL
)
5541 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5544 einfo (_("%F%P: invalid data statement\n"));
5547 switch (s
->data_statement
.type
)
5565 if (size
< TO_SIZE ((unsigned) 1))
5566 size
= TO_SIZE ((unsigned) 1);
5567 dot
+= TO_ADDR (size
);
5571 case lang_reloc_statement_enum
:
5572 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5573 bfd_abs_section_ptr
, &dot
);
5574 if (expld
.result
.valid_p
)
5575 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5577 einfo (_("%F%P: invalid reloc statement\n"));
5578 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5581 case lang_input_section_enum
:
5583 asection
*in
= s
->input_section
.section
;
5585 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5586 dot
+= TO_ADDR (in
->size
);
5590 case lang_input_statement_enum
:
5593 case lang_fill_statement_enum
:
5594 fill
= s
->fill_statement
.fill
;
5597 case lang_assignment_statement_enum
:
5598 exp_fold_tree (s
->assignment_statement
.exp
,
5599 current_os
->bfd_section
,
5603 case lang_padding_statement_enum
:
5604 dot
+= TO_ADDR (s
->padding_statement
.size
);
5607 case lang_group_statement_enum
:
5608 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5609 current_os
, fill
, dot
);
5612 case lang_insert_statement_enum
:
5615 case lang_address_statement_enum
:
5627 lang_do_assignments (lang_phase_type phase
)
5629 expld
.phase
= phase
;
5630 lang_statement_iteration
++;
5631 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5634 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5635 operator .startof. (section_name), it produces an undefined symbol
5636 .startof.section_name. Similarly, when it sees
5637 .sizeof. (section_name), it produces an undefined symbol
5638 .sizeof.section_name. For all the output sections, we look for
5639 such symbols, and set them to the correct value. */
5642 lang_set_startof (void)
5646 if (link_info
.relocatable
)
5649 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5651 const char *secname
;
5653 struct bfd_link_hash_entry
*h
;
5655 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5656 buf
= (char *) xmalloc (10 + strlen (secname
));
5658 sprintf (buf
, ".startof.%s", secname
);
5659 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5660 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5662 h
->type
= bfd_link_hash_defined
;
5663 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5664 h
->u
.def
.section
= bfd_abs_section_ptr
;
5667 sprintf (buf
, ".sizeof.%s", secname
);
5668 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5669 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5671 h
->type
= bfd_link_hash_defined
;
5672 h
->u
.def
.value
= TO_ADDR (s
->size
);
5673 h
->u
.def
.section
= bfd_abs_section_ptr
;
5683 struct bfd_link_hash_entry
*h
;
5686 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5687 || (link_info
.shared
&& !link_info
.executable
))
5688 warn
= entry_from_cmdline
;
5692 /* Force the user to specify a root when generating a relocatable with
5694 if (link_info
.gc_sections
&& link_info
.relocatable
5695 && !(entry_from_cmdline
|| undef_from_cmdline
))
5696 einfo (_("%P%F: gc-sections requires either an entry or "
5697 "an undefined symbol\n"));
5699 if (entry_symbol
.name
== NULL
)
5701 /* No entry has been specified. Look for the default entry, but
5702 don't warn if we don't find it. */
5703 entry_symbol
.name
= entry_symbol_default
;
5707 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5708 FALSE
, FALSE
, TRUE
);
5710 && (h
->type
== bfd_link_hash_defined
5711 || h
->type
== bfd_link_hash_defweak
)
5712 && h
->u
.def
.section
->output_section
!= NULL
)
5716 val
= (h
->u
.def
.value
5717 + bfd_get_section_vma (link_info
.output_bfd
,
5718 h
->u
.def
.section
->output_section
)
5719 + h
->u
.def
.section
->output_offset
);
5720 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5721 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5728 /* We couldn't find the entry symbol. Try parsing it as a
5730 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5733 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5734 einfo (_("%P%F: can't set start address\n"));
5740 /* Can't find the entry symbol, and it's not a number. Use
5741 the first address in the text section. */
5742 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5746 einfo (_("%P: warning: cannot find entry symbol %s;"
5747 " defaulting to %V\n"),
5749 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5750 if (!(bfd_set_start_address
5751 (link_info
.output_bfd
,
5752 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5753 einfo (_("%P%F: can't set start address\n"));
5758 einfo (_("%P: warning: cannot find entry symbol %s;"
5759 " not setting start address\n"),
5765 /* Don't bfd_hash_table_free (&lang_definedness_table);
5766 map file output may result in a call of lang_track_definedness. */
5769 /* This is a small function used when we want to ignore errors from
5773 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5775 /* Don't do anything. */
5778 /* Check that the architecture of all the input files is compatible
5779 with the output file. Also call the backend to let it do any
5780 other checking that is needed. */
5785 lang_statement_union_type
*file
;
5787 const bfd_arch_info_type
*compatible
;
5789 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5791 #ifdef ENABLE_PLUGINS
5792 /* Don't check format of files claimed by plugin. */
5793 if (file
->input_statement
.flags
.claimed
)
5795 #endif /* ENABLE_PLUGINS */
5796 input_bfd
= file
->input_statement
.the_bfd
;
5798 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5799 command_line
.accept_unknown_input_arch
);
5801 /* In general it is not possible to perform a relocatable
5802 link between differing object formats when the input
5803 file has relocations, because the relocations in the
5804 input format may not have equivalent representations in
5805 the output format (and besides BFD does not translate
5806 relocs for other link purposes than a final link). */
5807 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5808 && (compatible
== NULL
5809 || (bfd_get_flavour (input_bfd
)
5810 != bfd_get_flavour (link_info
.output_bfd
)))
5811 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5813 einfo (_("%P%F: Relocatable linking with relocations from"
5814 " format %s (%B) to format %s (%B) is not supported\n"),
5815 bfd_get_target (input_bfd
), input_bfd
,
5816 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5817 /* einfo with %F exits. */
5820 if (compatible
== NULL
)
5822 if (command_line
.warn_mismatch
)
5823 einfo (_("%P%X: %s architecture of input file `%B'"
5824 " is incompatible with %s output\n"),
5825 bfd_printable_name (input_bfd
), input_bfd
,
5826 bfd_printable_name (link_info
.output_bfd
));
5828 else if (bfd_count_sections (input_bfd
))
5830 /* If the input bfd has no contents, it shouldn't set the
5831 private data of the output bfd. */
5833 bfd_error_handler_type pfn
= NULL
;
5835 /* If we aren't supposed to warn about mismatched input
5836 files, temporarily set the BFD error handler to a
5837 function which will do nothing. We still want to call
5838 bfd_merge_private_bfd_data, since it may set up
5839 information which is needed in the output file. */
5840 if (! command_line
.warn_mismatch
)
5841 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5842 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5844 if (command_line
.warn_mismatch
)
5845 einfo (_("%P%X: failed to merge target specific data"
5846 " of file %B\n"), input_bfd
);
5848 if (! command_line
.warn_mismatch
)
5849 bfd_set_error_handler (pfn
);
5854 /* Look through all the global common symbols and attach them to the
5855 correct section. The -sort-common command line switch may be used
5856 to roughly sort the entries by alignment. */
5861 if (command_line
.inhibit_common_definition
)
5863 if (link_info
.relocatable
5864 && ! command_line
.force_common_definition
)
5867 if (! config
.sort_common
)
5868 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5873 if (config
.sort_common
== sort_descending
)
5875 for (power
= 4; power
> 0; power
--)
5876 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5879 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5883 for (power
= 0; power
<= 4; power
++)
5884 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5887 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5892 /* Place one common symbol in the correct section. */
5895 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5897 unsigned int power_of_two
;
5901 if (h
->type
!= bfd_link_hash_common
)
5905 power_of_two
= h
->u
.c
.p
->alignment_power
;
5907 if (config
.sort_common
== sort_descending
5908 && power_of_two
< *(unsigned int *) info
)
5910 else if (config
.sort_common
== sort_ascending
5911 && power_of_two
> *(unsigned int *) info
)
5914 section
= h
->u
.c
.p
->section
;
5915 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
5916 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5919 if (config
.map_file
!= NULL
)
5921 static bfd_boolean header_printed
;
5926 if (! header_printed
)
5928 minfo (_("\nAllocating common symbols\n"));
5929 minfo (_("Common symbol size file\n\n"));
5930 header_printed
= TRUE
;
5933 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5934 DMGL_ANSI
| DMGL_PARAMS
);
5937 minfo ("%s", h
->root
.string
);
5938 len
= strlen (h
->root
.string
);
5943 len
= strlen (name
);
5959 if (size
<= 0xffffffff)
5960 sprintf (buf
, "%lx", (unsigned long) size
);
5962 sprintf_vma (buf
, size
);
5972 minfo ("%B\n", section
->owner
);
5978 /* Run through the input files and ensure that every input section has
5979 somewhere to go. If one is found without a destination then create
5980 an input request and place it into the statement tree. */
5983 lang_place_orphans (void)
5985 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5989 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5991 if (s
->output_section
== NULL
)
5993 /* This section of the file is not attached, root
5994 around for a sensible place for it to go. */
5996 if (file
->flags
.just_syms
)
5997 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5998 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5999 s
->output_section
= bfd_abs_section_ptr
;
6000 else if (strcmp (s
->name
, "COMMON") == 0)
6002 /* This is a lonely common section which must have
6003 come from an archive. We attach to the section
6004 with the wildcard. */
6005 if (! link_info
.relocatable
6006 || command_line
.force_common_definition
)
6008 if (default_common_section
== NULL
)
6009 default_common_section
6010 = lang_output_section_statement_lookup (".bss", 0,
6012 lang_add_section (&default_common_section
->children
, s
,
6013 default_common_section
);
6018 const char *name
= s
->name
;
6021 if (config
.unique_orphan_sections
6022 || unique_section_p (s
, NULL
))
6023 constraint
= SPECIAL
;
6025 if (!ldemul_place_orphan (s
, name
, constraint
))
6027 lang_output_section_statement_type
*os
;
6028 os
= lang_output_section_statement_lookup (name
,
6031 if (os
->addr_tree
== NULL
6032 && (link_info
.relocatable
6033 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6034 os
->addr_tree
= exp_intop (0);
6035 lang_add_section (&os
->children
, s
, os
);
6044 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6046 flagword
*ptr_flags
;
6048 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6054 *ptr_flags
|= SEC_ALLOC
;
6058 *ptr_flags
|= SEC_READONLY
;
6062 *ptr_flags
|= SEC_DATA
;
6066 *ptr_flags
|= SEC_CODE
;
6071 *ptr_flags
|= SEC_LOAD
;
6075 einfo (_("%P%F: invalid syntax in flags\n"));
6082 /* Call a function on each input file. This function will be called
6083 on an archive, but not on the elements. */
6086 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6088 lang_input_statement_type
*f
;
6090 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6092 f
= (lang_input_statement_type
*) f
->next_real_file
)
6096 /* Call a function on each file. The function will be called on all
6097 the elements of an archive which are included in the link, but will
6098 not be called on the archive file itself. */
6101 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6103 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6110 ldlang_add_file (lang_input_statement_type
*entry
)
6112 lang_statement_append (&file_chain
,
6113 (lang_statement_union_type
*) entry
,
6116 /* The BFD linker needs to have a list of all input BFDs involved in
6118 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6119 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6121 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6122 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6123 entry
->the_bfd
->usrdata
= entry
;
6124 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6126 /* Look through the sections and check for any which should not be
6127 included in the link. We need to do this now, so that we can
6128 notice when the backend linker tries to report multiple
6129 definition errors for symbols which are in sections we aren't
6130 going to link. FIXME: It might be better to entirely ignore
6131 symbols which are defined in sections which are going to be
6132 discarded. This would require modifying the backend linker for
6133 each backend which might set the SEC_LINK_ONCE flag. If we do
6134 this, we should probably handle SEC_EXCLUDE in the same way. */
6136 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6140 lang_add_output (const char *name
, int from_script
)
6142 /* Make -o on command line override OUTPUT in script. */
6143 if (!had_output_filename
|| !from_script
)
6145 output_filename
= name
;
6146 had_output_filename
= TRUE
;
6150 static lang_output_section_statement_type
*current_section
;
6161 for (l
= 0; l
< 32; l
++)
6163 if (i
>= (unsigned int) x
)
6171 lang_output_section_statement_type
*
6172 lang_enter_output_section_statement (const char *output_section_statement_name
,
6173 etree_type
*address_exp
,
6174 enum section_type sectype
,
6176 etree_type
*subalign
,
6180 lang_output_section_statement_type
*os
;
6182 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6184 current_section
= os
;
6186 if (os
->addr_tree
== NULL
)
6188 os
->addr_tree
= address_exp
;
6190 os
->sectype
= sectype
;
6191 if (sectype
!= noload_section
)
6192 os
->flags
= SEC_NO_FLAGS
;
6194 os
->flags
= SEC_NEVER_LOAD
;
6195 os
->block_value
= 1;
6197 /* Make next things chain into subchain of this. */
6198 push_stat_ptr (&os
->children
);
6200 os
->subsection_alignment
=
6201 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6202 os
->section_alignment
=
6203 topower (exp_get_value_int (align
, -1, "section alignment"));
6205 os
->load_base
= ebase
;
6212 lang_output_statement_type
*new_stmt
;
6214 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6215 new_stmt
->name
= output_filename
;
6219 /* Reset the current counters in the regions. */
6222 lang_reset_memory_regions (void)
6224 lang_memory_region_type
*p
= lang_memory_region_list
;
6226 lang_output_section_statement_type
*os
;
6228 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6230 p
->current
= p
->origin
;
6234 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6238 os
->processed_vma
= FALSE
;
6239 os
->processed_lma
= FALSE
;
6242 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6244 /* Save the last size for possible use by bfd_relax_section. */
6245 o
->rawsize
= o
->size
;
6250 /* Worker for lang_gc_sections_1. */
6253 gc_section_callback (lang_wild_statement_type
*ptr
,
6254 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6256 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6257 void *data ATTRIBUTE_UNUSED
)
6259 /* If the wild pattern was marked KEEP, the member sections
6260 should be as well. */
6261 if (ptr
->keep_sections
)
6262 section
->flags
|= SEC_KEEP
;
6265 /* Iterate over sections marking them against GC. */
6268 lang_gc_sections_1 (lang_statement_union_type
*s
)
6270 for (; s
!= NULL
; s
= s
->header
.next
)
6272 switch (s
->header
.type
)
6274 case lang_wild_statement_enum
:
6275 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6277 case lang_constructors_statement_enum
:
6278 lang_gc_sections_1 (constructor_list
.head
);
6280 case lang_output_section_statement_enum
:
6281 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6283 case lang_group_statement_enum
:
6284 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6293 lang_gc_sections (void)
6295 /* Keep all sections so marked in the link script. */
6297 lang_gc_sections_1 (statement_list
.head
);
6299 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6300 the special case of debug info. (See bfd/stabs.c)
6301 Twiddle the flag here, to simplify later linker code. */
6302 if (link_info
.relocatable
)
6304 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6307 #ifdef ENABLE_PLUGINS
6308 if (f
->flags
.claimed
)
6311 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6312 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6313 sec
->flags
&= ~SEC_EXCLUDE
;
6317 if (link_info
.gc_sections
)
6318 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6321 /* Worker for lang_find_relro_sections_1. */
6324 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6325 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6327 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6330 /* Discarded, excluded and ignored sections effectively have zero
6332 if (section
->output_section
!= NULL
6333 && section
->output_section
->owner
== link_info
.output_bfd
6334 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6335 && !IGNORE_SECTION (section
)
6336 && section
->size
!= 0)
6338 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6339 *has_relro_section
= TRUE
;
6343 /* Iterate over sections for relro sections. */
6346 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6347 bfd_boolean
*has_relro_section
)
6349 if (*has_relro_section
)
6352 for (; s
!= NULL
; s
= s
->header
.next
)
6354 if (s
== expld
.dataseg
.relro_end_stat
)
6357 switch (s
->header
.type
)
6359 case lang_wild_statement_enum
:
6360 walk_wild (&s
->wild_statement
,
6361 find_relro_section_callback
,
6364 case lang_constructors_statement_enum
:
6365 lang_find_relro_sections_1 (constructor_list
.head
,
6368 case lang_output_section_statement_enum
:
6369 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6372 case lang_group_statement_enum
:
6373 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6383 lang_find_relro_sections (void)
6385 bfd_boolean has_relro_section
= FALSE
;
6387 /* Check all sections in the link script. */
6389 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6390 &has_relro_section
);
6392 if (!has_relro_section
)
6393 link_info
.relro
= FALSE
;
6396 /* Relax all sections until bfd_relax_section gives up. */
6399 lang_relax_sections (bfd_boolean need_layout
)
6401 if (RELAXATION_ENABLED
)
6403 /* We may need more than one relaxation pass. */
6404 int i
= link_info
.relax_pass
;
6406 /* The backend can use it to determine the current pass. */
6407 link_info
.relax_pass
= 0;
6411 /* Keep relaxing until bfd_relax_section gives up. */
6412 bfd_boolean relax_again
;
6414 link_info
.relax_trip
= -1;
6417 link_info
.relax_trip
++;
6419 /* Note: pe-dll.c does something like this also. If you find
6420 you need to change this code, you probably need to change
6421 pe-dll.c also. DJ */
6423 /* Do all the assignments with our current guesses as to
6425 lang_do_assignments (lang_assigning_phase_enum
);
6427 /* We must do this after lang_do_assignments, because it uses
6429 lang_reset_memory_regions ();
6431 /* Perform another relax pass - this time we know where the
6432 globals are, so can make a better guess. */
6433 relax_again
= FALSE
;
6434 lang_size_sections (&relax_again
, FALSE
);
6436 while (relax_again
);
6438 link_info
.relax_pass
++;
6445 /* Final extra sizing to report errors. */
6446 lang_do_assignments (lang_assigning_phase_enum
);
6447 lang_reset_memory_regions ();
6448 lang_size_sections (NULL
, TRUE
);
6452 #ifdef ENABLE_PLUGINS
6453 /* Find the insert point for the plugin's replacement files. We
6454 place them after the first claimed real object file, or if the
6455 first claimed object is an archive member, after the last real
6456 object file immediately preceding the archive. In the event
6457 no objects have been claimed at all, we return the first dummy
6458 object file on the list as the insert point; that works, but
6459 the callee must be careful when relinking the file_chain as it
6460 is not actually on that chain, only the statement_list and the
6461 input_file list; in that case, the replacement files must be
6462 inserted at the head of the file_chain. */
6464 static lang_input_statement_type
*
6465 find_replacements_insert_point (void)
6467 lang_input_statement_type
*claim1
, *lastobject
;
6468 lastobject
= &input_file_chain
.head
->input_statement
;
6469 for (claim1
= &file_chain
.head
->input_statement
;
6471 claim1
= &claim1
->next
->input_statement
)
6473 if (claim1
->flags
.claimed
)
6474 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6475 /* Update lastobject if this is a real object file. */
6476 if (claim1
->the_bfd
&& (claim1
->the_bfd
->my_archive
== NULL
))
6477 lastobject
= claim1
;
6479 /* No files were claimed by the plugin. Choose the last object
6480 file found on the list (maybe the first, dummy entry) as the
6485 /* Insert SRCLIST into DESTLIST after given element by chaining
6486 on FIELD as the next-pointer. (Counterintuitively does not need
6487 a pointer to the actual after-node itself, just its chain field.) */
6490 lang_list_insert_after (lang_statement_list_type
*destlist
,
6491 lang_statement_list_type
*srclist
,
6492 lang_statement_union_type
**field
)
6494 *(srclist
->tail
) = *field
;
6495 *field
= srclist
->head
;
6496 if (destlist
->tail
== field
)
6497 destlist
->tail
= srclist
->tail
;
6500 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6501 was taken as a copy of it and leave them in ORIGLIST. */
6504 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6505 lang_statement_list_type
*origlist
)
6507 union lang_statement_union
**savetail
;
6508 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6509 ASSERT (origlist
->head
== destlist
->head
);
6510 savetail
= origlist
->tail
;
6511 origlist
->head
= *(savetail
);
6512 origlist
->tail
= destlist
->tail
;
6513 destlist
->tail
= savetail
;
6516 #endif /* ENABLE_PLUGINS */
6521 /* Finalize dynamic list. */
6522 if (link_info
.dynamic_list
)
6523 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6525 current_target
= default_target
;
6527 /* Open the output file. */
6528 lang_for_each_statement (ldlang_open_output
);
6531 ldemul_create_output_section_statements ();
6533 /* Add to the hash table all undefineds on the command line. */
6534 lang_place_undefineds ();
6536 if (!bfd_section_already_linked_table_init ())
6537 einfo (_("%P%F: Failed to create hash table\n"));
6539 /* Create a bfd for each input file. */
6540 current_target
= default_target
;
6541 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6543 #ifdef ENABLE_PLUGINS
6544 if (plugin_active_plugins_p ())
6546 lang_statement_list_type added
;
6547 lang_statement_list_type files
, inputfiles
;
6549 /* Now all files are read, let the plugin(s) decide if there
6550 are any more to be added to the link before we call the
6551 emulation's after_open hook. We create a private list of
6552 input statements for this purpose, which we will eventually
6553 insert into the global statment list after the first claimed
6556 /* We need to manipulate all three chains in synchrony. */
6558 inputfiles
= input_file_chain
;
6559 if (plugin_call_all_symbols_read ())
6560 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6561 plugin_error_plugin ());
6562 /* Open any newly added files, updating the file chains. */
6563 link_info
.loading_lto_outputs
= TRUE
;
6564 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6565 /* Restore the global list pointer now they have all been added. */
6566 lang_list_remove_tail (stat_ptr
, &added
);
6567 /* And detach the fresh ends of the file lists. */
6568 lang_list_remove_tail (&file_chain
, &files
);
6569 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6570 /* Were any new files added? */
6571 if (added
.head
!= NULL
)
6573 /* If so, we will insert them into the statement list immediately
6574 after the first input file that was claimed by the plugin. */
6575 plugin_insert
= find_replacements_insert_point ();
6576 /* If a plugin adds input files without having claimed any, we
6577 don't really have a good idea where to place them. Just putting
6578 them at the start or end of the list is liable to leave them
6579 outside the crtbegin...crtend range. */
6580 ASSERT (plugin_insert
!= NULL
);
6581 /* Splice the new statement list into the old one. */
6582 lang_list_insert_after (stat_ptr
, &added
,
6583 &plugin_insert
->header
.next
);
6584 /* Likewise for the file chains. */
6585 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6586 &plugin_insert
->next_real_file
);
6587 /* We must be careful when relinking file_chain; we may need to
6588 insert the new files at the head of the list if the insert
6589 point chosen is the dummy first input file. */
6590 if (plugin_insert
->filename
)
6591 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6593 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6595 /* Rescan archives in case new undefined symbols have appeared. */
6596 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6599 #endif /* ENABLE_PLUGINS */
6601 link_info
.gc_sym_list
= &entry_symbol
;
6602 if (entry_symbol
.name
== NULL
)
6603 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6605 ldemul_after_open ();
6607 bfd_section_already_linked_table_free ();
6609 /* Make sure that we're not mixing architectures. We call this
6610 after all the input files have been opened, but before we do any
6611 other processing, so that any operations merge_private_bfd_data
6612 does on the output file will be known during the rest of the
6616 /* Handle .exports instead of a version script if we're told to do so. */
6617 if (command_line
.version_exports_section
)
6618 lang_do_version_exports_section ();
6620 /* Build all sets based on the information gathered from the input
6622 ldctor_build_sets ();
6624 /* PR 13683: We must rerun the assignments prior to running garbage
6625 collection in order to make sure that all symbol aliases are resolved. */
6626 lang_do_assignments (lang_mark_phase_enum
);
6627 expld
.phase
= lang_first_phase_enum
;
6629 /* Remove unreferenced sections if asked to. */
6630 lang_gc_sections ();
6632 /* Size up the common data. */
6635 /* Update wild statements. */
6636 update_wild_statements (statement_list
.head
);
6638 /* Run through the contours of the script and attach input sections
6639 to the correct output sections. */
6640 lang_statement_iteration
++;
6641 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6643 process_insert_statements ();
6645 /* Find any sections not attached explicitly and handle them. */
6646 lang_place_orphans ();
6648 if (! link_info
.relocatable
)
6652 /* Merge SEC_MERGE sections. This has to be done after GC of
6653 sections, so that GCed sections are not merged, but before
6654 assigning dynamic symbols, since removing whole input sections
6656 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6658 /* Look for a text section and set the readonly attribute in it. */
6659 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6663 if (config
.text_read_only
)
6664 found
->flags
|= SEC_READONLY
;
6666 found
->flags
&= ~SEC_READONLY
;
6670 /* Do anything special before sizing sections. This is where ELF
6671 and other back-ends size dynamic sections. */
6672 ldemul_before_allocation ();
6674 /* We must record the program headers before we try to fix the
6675 section positions, since they will affect SIZEOF_HEADERS. */
6676 lang_record_phdrs ();
6678 /* Check relro sections. */
6679 if (link_info
.relro
&& ! link_info
.relocatable
)
6680 lang_find_relro_sections ();
6682 /* Size up the sections. */
6683 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6685 /* See if anything special should be done now we know how big
6686 everything is. This is where relaxation is done. */
6687 ldemul_after_allocation ();
6689 /* Fix any .startof. or .sizeof. symbols. */
6690 lang_set_startof ();
6692 /* Do all the assignments, now that we know the final resting places
6693 of all the symbols. */
6694 lang_do_assignments (lang_final_phase_enum
);
6698 /* Make sure that the section addresses make sense. */
6699 if (command_line
.check_section_addresses
)
6700 lang_check_section_addresses ();
6705 /* EXPORTED TO YACC */
6708 lang_add_wild (struct wildcard_spec
*filespec
,
6709 struct wildcard_list
*section_list
,
6710 bfd_boolean keep_sections
)
6712 struct wildcard_list
*curr
, *next
;
6713 lang_wild_statement_type
*new_stmt
;
6715 /* Reverse the list as the parser puts it back to front. */
6716 for (curr
= section_list
, section_list
= NULL
;
6718 section_list
= curr
, curr
= next
)
6720 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6721 placed_commons
= TRUE
;
6724 curr
->next
= section_list
;
6727 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6729 if (strcmp (filespec
->name
, "*") == 0)
6730 filespec
->name
= NULL
;
6731 else if (! wildcardp (filespec
->name
))
6732 lang_has_input_file
= TRUE
;
6735 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6736 new_stmt
->filename
= NULL
;
6737 new_stmt
->filenames_sorted
= FALSE
;
6738 new_stmt
->section_flag_list
= NULL
;
6739 if (filespec
!= NULL
)
6741 new_stmt
->filename
= filespec
->name
;
6742 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6743 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
6745 new_stmt
->section_list
= section_list
;
6746 new_stmt
->keep_sections
= keep_sections
;
6747 lang_list_init (&new_stmt
->children
);
6748 analyze_walk_wild_section_handler (new_stmt
);
6752 lang_section_start (const char *name
, etree_type
*address
,
6753 const segment_type
*segment
)
6755 lang_address_statement_type
*ad
;
6757 ad
= new_stat (lang_address_statement
, stat_ptr
);
6758 ad
->section_name
= name
;
6759 ad
->address
= address
;
6760 ad
->segment
= segment
;
6763 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6764 because of a -e argument on the command line, or zero if this is
6765 called by ENTRY in a linker script. Command line arguments take
6769 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6771 if (entry_symbol
.name
== NULL
6773 || ! entry_from_cmdline
)
6775 entry_symbol
.name
= name
;
6776 entry_from_cmdline
= cmdline
;
6780 /* Set the default start symbol to NAME. .em files should use this,
6781 not lang_add_entry, to override the use of "start" if neither the
6782 linker script nor the command line specifies an entry point. NAME
6783 must be permanently allocated. */
6785 lang_default_entry (const char *name
)
6787 entry_symbol_default
= name
;
6791 lang_add_target (const char *name
)
6793 lang_target_statement_type
*new_stmt
;
6795 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6796 new_stmt
->target
= name
;
6800 lang_add_map (const char *name
)
6807 map_option_f
= TRUE
;
6815 lang_add_fill (fill_type
*fill
)
6817 lang_fill_statement_type
*new_stmt
;
6819 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6820 new_stmt
->fill
= fill
;
6824 lang_add_data (int type
, union etree_union
*exp
)
6826 lang_data_statement_type
*new_stmt
;
6828 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6829 new_stmt
->exp
= exp
;
6830 new_stmt
->type
= type
;
6833 /* Create a new reloc statement. RELOC is the BFD relocation type to
6834 generate. HOWTO is the corresponding howto structure (we could
6835 look this up, but the caller has already done so). SECTION is the
6836 section to generate a reloc against, or NAME is the name of the
6837 symbol to generate a reloc against. Exactly one of SECTION and
6838 NAME must be NULL. ADDEND is an expression for the addend. */
6841 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6842 reloc_howto_type
*howto
,
6845 union etree_union
*addend
)
6847 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6851 p
->section
= section
;
6853 p
->addend_exp
= addend
;
6855 p
->addend_value
= 0;
6856 p
->output_section
= NULL
;
6857 p
->output_offset
= 0;
6860 lang_assignment_statement_type
*
6861 lang_add_assignment (etree_type
*exp
)
6863 lang_assignment_statement_type
*new_stmt
;
6865 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6866 new_stmt
->exp
= exp
;
6871 lang_add_attribute (enum statement_enum attribute
)
6873 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6877 lang_startup (const char *name
)
6879 if (first_file
->filename
!= NULL
)
6881 einfo (_("%P%F: multiple STARTUP files\n"));
6883 first_file
->filename
= name
;
6884 first_file
->local_sym_name
= name
;
6885 first_file
->flags
.real
= TRUE
;
6889 lang_float (bfd_boolean maybe
)
6891 lang_float_flag
= maybe
;
6895 /* Work out the load- and run-time regions from a script statement, and
6896 store them in *LMA_REGION and *REGION respectively.
6898 MEMSPEC is the name of the run-time region, or the value of
6899 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6900 LMA_MEMSPEC is the name of the load-time region, or null if the
6901 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6902 had an explicit load address.
6904 It is an error to specify both a load region and a load address. */
6907 lang_get_regions (lang_memory_region_type
**region
,
6908 lang_memory_region_type
**lma_region
,
6909 const char *memspec
,
6910 const char *lma_memspec
,
6911 bfd_boolean have_lma
,
6912 bfd_boolean have_vma
)
6914 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6916 /* If no runtime region or VMA has been specified, but the load region
6917 has been specified, then use the load region for the runtime region
6919 if (lma_memspec
!= NULL
6921 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6922 *region
= *lma_region
;
6924 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6926 if (have_lma
&& lma_memspec
!= 0)
6927 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
6932 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6933 lang_output_section_phdr_list
*phdrs
,
6934 const char *lma_memspec
)
6936 lang_get_regions (¤t_section
->region
,
6937 ¤t_section
->lma_region
,
6938 memspec
, lma_memspec
,
6939 current_section
->load_base
!= NULL
,
6940 current_section
->addr_tree
!= NULL
);
6942 /* If this section has no load region or base, but uses the same
6943 region as the previous section, then propagate the previous
6944 section's load region. */
6946 if (current_section
->lma_region
== NULL
6947 && current_section
->load_base
== NULL
6948 && current_section
->addr_tree
== NULL
6949 && current_section
->region
== current_section
->prev
->region
)
6950 current_section
->lma_region
= current_section
->prev
->lma_region
;
6952 current_section
->fill
= fill
;
6953 current_section
->phdrs
= phdrs
;
6957 /* Create an absolute symbol with the given name with the value of the
6958 address of first byte of the section named.
6960 If the symbol already exists, then do nothing. */
6963 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6965 struct bfd_link_hash_entry
*h
;
6967 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6969 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6971 if (h
->type
== bfd_link_hash_new
6972 || h
->type
== bfd_link_hash_undefined
)
6976 h
->type
= bfd_link_hash_defined
;
6978 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6982 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6984 h
->u
.def
.section
= bfd_abs_section_ptr
;
6988 /* Create an absolute symbol with the given name with the value of the
6989 address of the first byte after the end of the section named.
6991 If the symbol already exists, then do nothing. */
6994 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6996 struct bfd_link_hash_entry
*h
;
6998 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
7000 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
7002 if (h
->type
== bfd_link_hash_new
7003 || h
->type
== bfd_link_hash_undefined
)
7007 h
->type
= bfd_link_hash_defined
;
7009 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
7013 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
7014 + TO_ADDR (sec
->size
));
7016 h
->u
.def
.section
= bfd_abs_section_ptr
;
7021 lang_statement_append (lang_statement_list_type
*list
,
7022 lang_statement_union_type
*element
,
7023 lang_statement_union_type
**field
)
7025 *(list
->tail
) = element
;
7029 /* Set the output format type. -oformat overrides scripts. */
7032 lang_add_output_format (const char *format
,
7037 if (output_target
== NULL
|| !from_script
)
7039 if (command_line
.endian
== ENDIAN_BIG
7042 else if (command_line
.endian
== ENDIAN_LITTLE
7046 output_target
= format
;
7051 lang_add_insert (const char *where
, int is_before
)
7053 lang_insert_statement_type
*new_stmt
;
7055 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7056 new_stmt
->where
= where
;
7057 new_stmt
->is_before
= is_before
;
7058 saved_script_handle
= previous_script_handle
;
7061 /* Enter a group. This creates a new lang_group_statement, and sets
7062 stat_ptr to build new statements within the group. */
7065 lang_enter_group (void)
7067 lang_group_statement_type
*g
;
7069 g
= new_stat (lang_group_statement
, stat_ptr
);
7070 lang_list_init (&g
->children
);
7071 push_stat_ptr (&g
->children
);
7074 /* Leave a group. This just resets stat_ptr to start writing to the
7075 regular list of statements again. Note that this will not work if
7076 groups can occur inside anything else which can adjust stat_ptr,
7077 but currently they can't. */
7080 lang_leave_group (void)
7085 /* Add a new program header. This is called for each entry in a PHDRS
7086 command in a linker script. */
7089 lang_new_phdr (const char *name
,
7091 bfd_boolean filehdr
,
7096 struct lang_phdr
*n
, **pp
;
7099 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7102 n
->type
= exp_get_value_int (type
, 0, "program header type");
7103 n
->filehdr
= filehdr
;
7108 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7110 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7113 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7115 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7116 " when prior PT_LOAD headers lack them\n"), NULL
);
7123 /* Record the program header information in the output BFD. FIXME: We
7124 should not be calling an ELF specific function here. */
7127 lang_record_phdrs (void)
7131 lang_output_section_phdr_list
*last
;
7132 struct lang_phdr
*l
;
7133 lang_output_section_statement_type
*os
;
7136 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7139 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7146 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7150 lang_output_section_phdr_list
*pl
;
7152 if (os
->constraint
< 0)
7160 if (os
->sectype
== noload_section
7161 || os
->bfd_section
== NULL
7162 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7165 /* Don't add orphans to PT_INTERP header. */
7171 lang_output_section_statement_type
* tmp_os
;
7173 /* If we have not run across a section with a program
7174 header assigned to it yet, then scan forwards to find
7175 one. This prevents inconsistencies in the linker's
7176 behaviour when a script has specified just a single
7177 header and there are sections in that script which are
7178 not assigned to it, and which occur before the first
7179 use of that header. See here for more details:
7180 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7181 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7184 last
= tmp_os
->phdrs
;
7188 einfo (_("%F%P: no sections assigned to phdrs\n"));
7193 if (os
->bfd_section
== NULL
)
7196 for (; pl
!= NULL
; pl
= pl
->next
)
7198 if (strcmp (pl
->name
, l
->name
) == 0)
7203 secs
= (asection
**) xrealloc (secs
,
7204 alc
* sizeof (asection
*));
7206 secs
[c
] = os
->bfd_section
;
7213 if (l
->flags
== NULL
)
7216 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7221 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7223 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7224 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7225 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7226 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7231 /* Make sure all the phdr assignments succeeded. */
7232 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7236 lang_output_section_phdr_list
*pl
;
7238 if (os
->constraint
< 0
7239 || os
->bfd_section
== NULL
)
7242 for (pl
= os
->phdrs
;
7245 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7246 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7247 os
->name
, pl
->name
);
7251 /* Record a list of sections which may not be cross referenced. */
7254 lang_add_nocrossref (lang_nocrossref_type
*l
)
7256 struct lang_nocrossrefs
*n
;
7258 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7259 n
->next
= nocrossref_list
;
7261 nocrossref_list
= n
;
7263 /* Set notice_all so that we get informed about all symbols. */
7264 link_info
.notice_all
= TRUE
;
7267 /* Overlay handling. We handle overlays with some static variables. */
7269 /* The overlay virtual address. */
7270 static etree_type
*overlay_vma
;
7271 /* And subsection alignment. */
7272 static etree_type
*overlay_subalign
;
7274 /* An expression for the maximum section size seen so far. */
7275 static etree_type
*overlay_max
;
7277 /* A list of all the sections in this overlay. */
7279 struct overlay_list
{
7280 struct overlay_list
*next
;
7281 lang_output_section_statement_type
*os
;
7284 static struct overlay_list
*overlay_list
;
7286 /* Start handling an overlay. */
7289 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7291 /* The grammar should prevent nested overlays from occurring. */
7292 ASSERT (overlay_vma
== NULL
7293 && overlay_subalign
== NULL
7294 && overlay_max
== NULL
);
7296 overlay_vma
= vma_expr
;
7297 overlay_subalign
= subalign
;
7300 /* Start a section in an overlay. We handle this by calling
7301 lang_enter_output_section_statement with the correct VMA.
7302 lang_leave_overlay sets up the LMA and memory regions. */
7305 lang_enter_overlay_section (const char *name
)
7307 struct overlay_list
*n
;
7310 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7311 0, overlay_subalign
, 0, 0);
7313 /* If this is the first section, then base the VMA of future
7314 sections on this one. This will work correctly even if `.' is
7315 used in the addresses. */
7316 if (overlay_list
== NULL
)
7317 overlay_vma
= exp_nameop (ADDR
, name
);
7319 /* Remember the section. */
7320 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7321 n
->os
= current_section
;
7322 n
->next
= overlay_list
;
7325 size
= exp_nameop (SIZEOF
, name
);
7327 /* Arrange to work out the maximum section end address. */
7328 if (overlay_max
== NULL
)
7331 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7334 /* Finish a section in an overlay. There isn't any special to do
7338 lang_leave_overlay_section (fill_type
*fill
,
7339 lang_output_section_phdr_list
*phdrs
)
7346 name
= current_section
->name
;
7348 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7349 region and that no load-time region has been specified. It doesn't
7350 really matter what we say here, since lang_leave_overlay will
7352 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7354 /* Define the magic symbols. */
7356 clean
= (char *) xmalloc (strlen (name
) + 1);
7358 for (s1
= name
; *s1
!= '\0'; s1
++)
7359 if (ISALNUM (*s1
) || *s1
== '_')
7363 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7364 sprintf (buf
, "__load_start_%s", clean
);
7365 lang_add_assignment (exp_provide (buf
,
7366 exp_nameop (LOADADDR
, name
),
7369 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7370 sprintf (buf
, "__load_stop_%s", clean
);
7371 lang_add_assignment (exp_provide (buf
,
7373 exp_nameop (LOADADDR
, name
),
7374 exp_nameop (SIZEOF
, name
)),
7380 /* Finish an overlay. If there are any overlay wide settings, this
7381 looks through all the sections in the overlay and sets them. */
7384 lang_leave_overlay (etree_type
*lma_expr
,
7387 const char *memspec
,
7388 lang_output_section_phdr_list
*phdrs
,
7389 const char *lma_memspec
)
7391 lang_memory_region_type
*region
;
7392 lang_memory_region_type
*lma_region
;
7393 struct overlay_list
*l
;
7394 lang_nocrossref_type
*nocrossref
;
7396 lang_get_regions (®ion
, &lma_region
,
7397 memspec
, lma_memspec
,
7398 lma_expr
!= NULL
, FALSE
);
7402 /* After setting the size of the last section, set '.' to end of the
7404 if (overlay_list
!= NULL
)
7405 overlay_list
->os
->update_dot_tree
7406 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
));
7411 struct overlay_list
*next
;
7413 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7416 l
->os
->region
= region
;
7417 l
->os
->lma_region
= lma_region
;
7419 /* The first section has the load address specified in the
7420 OVERLAY statement. The rest are worked out from that.
7421 The base address is not needed (and should be null) if
7422 an LMA region was specified. */
7425 l
->os
->load_base
= lma_expr
;
7426 l
->os
->sectype
= normal_section
;
7428 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7429 l
->os
->phdrs
= phdrs
;
7433 lang_nocrossref_type
*nc
;
7435 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7436 nc
->name
= l
->os
->name
;
7437 nc
->next
= nocrossref
;
7446 if (nocrossref
!= NULL
)
7447 lang_add_nocrossref (nocrossref
);
7450 overlay_list
= NULL
;
7454 /* Version handling. This is only useful for ELF. */
7456 /* If PREV is NULL, return first version pattern matching particular symbol.
7457 If PREV is non-NULL, return first version pattern matching particular
7458 symbol after PREV (previously returned by lang_vers_match). */
7460 static struct bfd_elf_version_expr
*
7461 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7462 struct bfd_elf_version_expr
*prev
,
7466 const char *cxx_sym
= sym
;
7467 const char *java_sym
= sym
;
7468 struct bfd_elf_version_expr
*expr
= NULL
;
7469 enum demangling_styles curr_style
;
7471 curr_style
= CURRENT_DEMANGLING_STYLE
;
7472 cplus_demangle_set_style (no_demangling
);
7473 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7476 cplus_demangle_set_style (curr_style
);
7478 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7480 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7481 DMGL_PARAMS
| DMGL_ANSI
);
7485 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7487 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7492 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7494 struct bfd_elf_version_expr e
;
7496 switch (prev
? prev
->mask
: 0)
7499 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7502 expr
= (struct bfd_elf_version_expr
*)
7503 htab_find ((htab_t
) head
->htab
, &e
);
7504 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7505 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7511 case BFD_ELF_VERSION_C_TYPE
:
7512 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7514 e
.pattern
= cxx_sym
;
7515 expr
= (struct bfd_elf_version_expr
*)
7516 htab_find ((htab_t
) head
->htab
, &e
);
7517 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7518 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7524 case BFD_ELF_VERSION_CXX_TYPE
:
7525 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7527 e
.pattern
= java_sym
;
7528 expr
= (struct bfd_elf_version_expr
*)
7529 htab_find ((htab_t
) head
->htab
, &e
);
7530 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7531 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7542 /* Finally, try the wildcards. */
7543 if (prev
== NULL
|| prev
->literal
)
7544 expr
= head
->remaining
;
7547 for (; expr
; expr
= expr
->next
)
7554 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7557 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7559 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7563 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7569 free ((char *) c_sym
);
7571 free ((char *) cxx_sym
);
7572 if (java_sym
!= sym
)
7573 free ((char *) java_sym
);
7577 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7578 return a pointer to the symbol name with any backslash quotes removed. */
7581 realsymbol (const char *pattern
)
7584 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7585 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7587 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7589 /* It is a glob pattern only if there is no preceding
7593 /* Remove the preceding backslash. */
7600 if (*p
== '?' || *p
== '*' || *p
== '[')
7607 backslash
= *p
== '\\';
7623 /* This is called for each variable name or match expression. NEW_NAME is
7624 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7625 pattern to be matched against symbol names. */
7627 struct bfd_elf_version_expr
*
7628 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7629 const char *new_name
,
7631 bfd_boolean literal_p
)
7633 struct bfd_elf_version_expr
*ret
;
7635 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7639 ret
->literal
= TRUE
;
7640 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7641 if (ret
->pattern
== NULL
)
7643 ret
->pattern
= new_name
;
7644 ret
->literal
= FALSE
;
7647 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7648 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7649 else if (strcasecmp (lang
, "C++") == 0)
7650 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7651 else if (strcasecmp (lang
, "Java") == 0)
7652 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7655 einfo (_("%X%P: unknown language `%s' in version information\n"),
7657 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7660 return ldemul_new_vers_pattern (ret
);
7663 /* This is called for each set of variable names and match
7666 struct bfd_elf_version_tree
*
7667 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7668 struct bfd_elf_version_expr
*locals
)
7670 struct bfd_elf_version_tree
*ret
;
7672 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7673 ret
->globals
.list
= globals
;
7674 ret
->locals
.list
= locals
;
7675 ret
->match
= lang_vers_match
;
7676 ret
->name_indx
= (unsigned int) -1;
7680 /* This static variable keeps track of version indices. */
7682 static int version_index
;
7685 version_expr_head_hash (const void *p
)
7687 const struct bfd_elf_version_expr
*e
=
7688 (const struct bfd_elf_version_expr
*) p
;
7690 return htab_hash_string (e
->pattern
);
7694 version_expr_head_eq (const void *p1
, const void *p2
)
7696 const struct bfd_elf_version_expr
*e1
=
7697 (const struct bfd_elf_version_expr
*) p1
;
7698 const struct bfd_elf_version_expr
*e2
=
7699 (const struct bfd_elf_version_expr
*) p2
;
7701 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7705 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7708 struct bfd_elf_version_expr
*e
, *next
;
7709 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7711 for (e
= head
->list
; e
; e
= e
->next
)
7715 head
->mask
|= e
->mask
;
7720 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7721 version_expr_head_eq
, NULL
);
7722 list_loc
= &head
->list
;
7723 remaining_loc
= &head
->remaining
;
7724 for (e
= head
->list
; e
; e
= next
)
7730 remaining_loc
= &e
->next
;
7734 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7738 struct bfd_elf_version_expr
*e1
, *last
;
7740 e1
= (struct bfd_elf_version_expr
*) *loc
;
7744 if (e1
->mask
== e
->mask
)
7752 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7756 /* This is a duplicate. */
7757 /* FIXME: Memory leak. Sometimes pattern is not
7758 xmalloced alone, but in larger chunk of memory. */
7759 /* free (e->pattern); */
7764 e
->next
= last
->next
;
7772 list_loc
= &e
->next
;
7776 *remaining_loc
= NULL
;
7777 *list_loc
= head
->remaining
;
7780 head
->remaining
= head
->list
;
7783 /* This is called when we know the name and dependencies of the
7787 lang_register_vers_node (const char *name
,
7788 struct bfd_elf_version_tree
*version
,
7789 struct bfd_elf_version_deps
*deps
)
7791 struct bfd_elf_version_tree
*t
, **pp
;
7792 struct bfd_elf_version_expr
*e1
;
7797 if (link_info
.version_info
!= NULL
7798 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
7800 einfo (_("%X%P: anonymous version tag cannot be combined"
7801 " with other version tags\n"));
7806 /* Make sure this node has a unique name. */
7807 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7808 if (strcmp (t
->name
, name
) == 0)
7809 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7811 lang_finalize_version_expr_head (&version
->globals
);
7812 lang_finalize_version_expr_head (&version
->locals
);
7814 /* Check the global and local match names, and make sure there
7815 aren't any duplicates. */
7817 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7819 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7821 struct bfd_elf_version_expr
*e2
;
7823 if (t
->locals
.htab
&& e1
->literal
)
7825 e2
= (struct bfd_elf_version_expr
*)
7826 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7827 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7829 if (e1
->mask
== e2
->mask
)
7830 einfo (_("%X%P: duplicate expression `%s'"
7831 " in version information\n"), e1
->pattern
);
7835 else if (!e1
->literal
)
7836 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7837 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7838 && e1
->mask
== e2
->mask
)
7839 einfo (_("%X%P: duplicate expression `%s'"
7840 " in version information\n"), e1
->pattern
);
7844 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7846 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7848 struct bfd_elf_version_expr
*e2
;
7850 if (t
->globals
.htab
&& e1
->literal
)
7852 e2
= (struct bfd_elf_version_expr
*)
7853 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7854 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7856 if (e1
->mask
== e2
->mask
)
7857 einfo (_("%X%P: duplicate expression `%s'"
7858 " in version information\n"),
7863 else if (!e1
->literal
)
7864 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7865 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7866 && e1
->mask
== e2
->mask
)
7867 einfo (_("%X%P: duplicate expression `%s'"
7868 " in version information\n"), e1
->pattern
);
7872 version
->deps
= deps
;
7873 version
->name
= name
;
7874 if (name
[0] != '\0')
7877 version
->vernum
= version_index
;
7880 version
->vernum
= 0;
7882 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7887 /* This is called when we see a version dependency. */
7889 struct bfd_elf_version_deps
*
7890 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7892 struct bfd_elf_version_deps
*ret
;
7893 struct bfd_elf_version_tree
*t
;
7895 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7898 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
7900 if (strcmp (t
->name
, name
) == 0)
7902 ret
->version_needed
= t
;
7907 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7909 ret
->version_needed
= NULL
;
7914 lang_do_version_exports_section (void)
7916 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7918 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7920 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7928 contents
= (char *) xmalloc (len
);
7929 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7930 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7933 while (p
< contents
+ len
)
7935 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7936 p
= strchr (p
, '\0') + 1;
7939 /* Do not free the contents, as we used them creating the regex. */
7941 /* Do not include this section in the link. */
7942 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7945 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7946 lang_register_vers_node (command_line
.version_exports_section
,
7947 lang_new_vers_node (greg
, lreg
), NULL
);
7951 lang_add_unique (const char *name
)
7953 struct unique_sections
*ent
;
7955 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7956 if (strcmp (ent
->name
, name
) == 0)
7959 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7960 ent
->name
= xstrdup (name
);
7961 ent
->next
= unique_section_list
;
7962 unique_section_list
= ent
;
7965 /* Append the list of dynamic symbols to the existing one. */
7968 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7970 if (link_info
.dynamic_list
)
7972 struct bfd_elf_version_expr
*tail
;
7973 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7975 tail
->next
= link_info
.dynamic_list
->head
.list
;
7976 link_info
.dynamic_list
->head
.list
= dynamic
;
7980 struct bfd_elf_dynamic_list
*d
;
7982 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
7983 d
->head
.list
= dynamic
;
7984 d
->match
= lang_vers_match
;
7985 link_info
.dynamic_list
= d
;
7989 /* Append the list of C++ typeinfo dynamic symbols to the existing
7993 lang_append_dynamic_list_cpp_typeinfo (void)
7995 const char * symbols
[] =
7997 "typeinfo name for*",
8000 struct bfd_elf_version_expr
*dynamic
= NULL
;
8003 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8004 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8007 lang_append_dynamic_list (dynamic
);
8010 /* Append the list of C++ operator new and delete dynamic symbols to the
8014 lang_append_dynamic_list_cpp_new (void)
8016 const char * symbols
[] =
8021 struct bfd_elf_version_expr
*dynamic
= NULL
;
8024 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8025 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8028 lang_append_dynamic_list (dynamic
);
8031 /* Scan a space and/or comma separated string of features. */
8034 lang_ld_feature (char *str
)
8042 while (*p
== ',' || ISSPACE (*p
))
8047 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8051 if (strcasecmp (p
, "SANE_EXPR") == 0)
8052 config
.sane_expr
= TRUE
;
8054 einfo (_("%X%P: unknown feature `%s'\n"), p
);