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
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 "safe-ctype.h"
46 #endif /* ENABLE_PLUGINS */
49 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
52 /* Locals variables. */
53 static struct obstack stat_obstack
;
54 static struct obstack map_obstack
;
56 #define obstack_chunk_alloc xmalloc
57 #define obstack_chunk_free free
58 static const char *startup_file
;
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
;
72 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
74 /* Forward declarations. */
75 static void exp_init_os (etree_type
*);
76 static void init_map_userdata (bfd
*, asection
*, void *);
77 static lang_input_statement_type
*lookup_name (const char *);
78 static struct bfd_hash_entry
*lang_definedness_newfunc
79 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
80 static void insert_undefined (const char *);
81 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
82 static void print_statement (lang_statement_union_type
*,
83 lang_output_section_statement_type
*);
84 static void print_statement_list (lang_statement_union_type
*,
85 lang_output_section_statement_type
*);
86 static void print_statements (void);
87 static void print_input_section (asection
*, bfd_boolean
);
88 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
89 static void lang_record_phdrs (void);
90 static void lang_do_version_exports_section (void);
91 static void lang_finalize_version_expr_head
92 (struct bfd_elf_version_expr_head
*);
94 /* Exported variables. */
95 const char *output_target
;
96 lang_output_section_statement_type
*abs_output_section
;
97 lang_statement_list_type lang_output_section_statement
;
98 lang_statement_list_type
*stat_ptr
= &statement_list
;
99 lang_statement_list_type file_chain
= { NULL
, NULL
};
100 lang_statement_list_type input_file_chain
;
101 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
102 const char *entry_section
= ".text";
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
;
111 bfd_boolean missing_file
= FALSE
;
112 int ld_compatibility
;
114 /* Functions that traverse the linker script and might evaluate
115 DEFINED() need to increment this. */
116 int lang_statement_iteration
= 0;
118 etree_type
*base
; /* Relocation base - or null */
120 /* Return TRUE if the PATTERN argument is a wildcard pattern.
121 Although backslashes are treated specially if a pattern contains
122 wildcards, we do not consider the mere presence of a backslash to
123 be enough to cause the pattern to be treated as a wildcard.
124 That lets us handle DOS filenames more naturally. */
125 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
127 #define new_stat(x, y) \
128 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
130 #define outside_section_address(q) \
131 ((q)->output_offset + (q)->output_section->vma)
133 #define outside_symbol_address(q) \
134 ((q)->value + outside_section_address (q->section))
136 #define SECTION_NAME_MAP_LENGTH (16)
139 stat_alloc (size_t size
)
141 return obstack_alloc (&stat_obstack
, size
);
145 name_match (const char *pattern
, const char *name
)
147 if (wildcardp (pattern
))
148 return fnmatch (pattern
, name
, 0);
149 return strcmp (pattern
, name
);
152 /* If PATTERN is of the form archive:file, return a pointer to the
153 separator. If not, return NULL. */
156 archive_path (const char *pattern
)
160 if (link_info
.path_separator
== 0)
163 p
= strchr (pattern
, link_info
.path_separator
);
164 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
165 if (p
== NULL
|| link_info
.path_separator
!= ':')
168 /* Assume a match on the second char is part of drive specifier,
169 as in "c:\silly.dos". */
170 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
171 p
= strchr (p
+ 1, link_info
.path_separator
);
176 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
177 return whether F matches FILE_SPEC. */
180 input_statement_is_archive_path (const char *file_spec
, char *sep
,
181 lang_input_statement_type
*f
)
183 bfd_boolean match
= FALSE
;
186 || name_match (sep
+ 1, f
->filename
) == 0)
187 && ((sep
!= file_spec
)
188 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
192 if (sep
!= file_spec
)
194 const char *aname
= f
->the_bfd
->my_archive
->filename
;
196 match
= name_match (file_spec
, aname
) == 0;
197 *sep
= link_info
.path_separator
;
204 unique_section_p (const asection
*sec
,
205 const lang_output_section_statement_type
*os
)
207 struct unique_sections
*unam
;
210 if (link_info
.relocatable
211 && sec
->owner
!= NULL
212 && bfd_is_group_section (sec
->owner
, sec
))
214 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
217 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
218 if (name_match (unam
->name
, secnam
) == 0)
224 /* Generic traversal routines for finding matching sections. */
226 /* Try processing a section against a wildcard. This just calls
227 the callback unless the filename exclusion list is present
228 and excludes the file. It's hardly ever present so this
229 function is very fast. */
232 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
233 lang_input_statement_type
*file
,
235 struct wildcard_list
*sec
,
239 struct name_list
*list_tmp
;
241 /* Don't process sections from files which were excluded. */
242 for (list_tmp
= sec
->spec
.exclude_name_list
;
244 list_tmp
= list_tmp
->next
)
246 char *p
= archive_path (list_tmp
->name
);
250 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
254 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
257 /* FIXME: Perhaps remove the following at some stage? Matching
258 unadorned archives like this was never documented and has
259 been superceded by the archive:path syntax. */
260 else if (file
->the_bfd
!= NULL
261 && file
->the_bfd
->my_archive
!= NULL
262 && name_match (list_tmp
->name
,
263 file
->the_bfd
->my_archive
->filename
) == 0)
267 (*callback
) (ptr
, sec
, s
, file
, data
);
270 /* Lowest common denominator routine that can handle everything correctly,
274 walk_wild_section_general (lang_wild_statement_type
*ptr
,
275 lang_input_statement_type
*file
,
280 struct wildcard_list
*sec
;
282 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
284 sec
= ptr
->section_list
;
286 (*callback
) (ptr
, sec
, s
, file
, data
);
290 bfd_boolean skip
= FALSE
;
292 if (sec
->spec
.name
!= NULL
)
294 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
296 skip
= name_match (sec
->spec
.name
, sname
) != 0;
300 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
307 /* Routines to find a single section given its name. If there's more
308 than one section with that name, we report that. */
312 asection
*found_section
;
313 bfd_boolean multiple_sections_found
;
314 } section_iterator_callback_data
;
317 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
319 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
321 if (d
->found_section
!= NULL
)
323 d
->multiple_sections_found
= TRUE
;
327 d
->found_section
= s
;
332 find_section (lang_input_statement_type
*file
,
333 struct wildcard_list
*sec
,
334 bfd_boolean
*multiple_sections_found
)
336 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
338 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
339 section_iterator_callback
, &cb_data
);
340 *multiple_sections_found
= cb_data
.multiple_sections_found
;
341 return cb_data
.found_section
;
344 /* Code for handling simple wildcards without going through fnmatch,
345 which can be expensive because of charset translations etc. */
347 /* A simple wild is a literal string followed by a single '*',
348 where the literal part is at least 4 characters long. */
351 is_simple_wild (const char *name
)
353 size_t len
= strcspn (name
, "*?[");
354 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
358 match_simple_wild (const char *pattern
, const char *name
)
360 /* The first four characters of the pattern are guaranteed valid
361 non-wildcard characters. So we can go faster. */
362 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
363 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
368 while (*pattern
!= '*')
369 if (*name
++ != *pattern
++)
375 /* Return the numerical value of the init_priority attribute from
376 section name NAME. */
379 get_init_priority (const char *name
)
382 unsigned long init_priority
;
384 /* GCC uses the following section names for the init_priority
385 attribute with numerical values 101 and 65535 inclusive. A
386 lower value means a higher priority.
388 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
389 decimal numerical value of the init_priority attribute.
390 The order of execution in .init_array is forward and
391 .fini_array is backward.
392 2: .ctors.NNNN/.ctors.NNNN: Where NNNN is 65535 minus the
393 decimal numerical value of the init_priority attribute.
394 The order of execution in .ctors is backward and .dtors
397 if (strncmp (name
, ".init_array.", 12) == 0
398 || strncmp (name
, ".fini_array.", 12) == 0)
400 init_priority
= strtoul (name
+ 12, &end
, 10);
401 return *end
? 0 : init_priority
;
403 else if (strncmp (name
, ".ctors.", 7) == 0
404 || strncmp (name
, ".dtors.", 7) == 0)
406 init_priority
= strtoul (name
+ 7, &end
, 10);
407 return *end
? 0 : 65535 - init_priority
;
413 /* Compare sections ASEC and BSEC according to SORT. */
416 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
419 unsigned long ainit_priority
, binit_priority
;
426 case by_init_priority
:
428 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
430 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
431 if (ainit_priority
== 0 || binit_priority
== 0)
433 ret
= ainit_priority
- binit_priority
;
439 case by_alignment_name
:
440 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
441 - bfd_section_alignment (asec
->owner
, asec
));
448 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
449 bfd_get_section_name (bsec
->owner
, bsec
));
452 case by_name_alignment
:
453 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
454 bfd_get_section_name (bsec
->owner
, bsec
));
460 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
461 - bfd_section_alignment (asec
->owner
, asec
));
468 /* Build a Binary Search Tree to sort sections, unlike insertion sort
469 used in wild_sort(). BST is considerably faster if the number of
470 of sections are large. */
472 static lang_section_bst_type
**
473 wild_sort_fast (lang_wild_statement_type
*wild
,
474 struct wildcard_list
*sec
,
475 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
478 lang_section_bst_type
**tree
;
481 if (!wild
->filenames_sorted
482 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
484 /* Append at the right end of tree. */
486 tree
= &((*tree
)->right
);
492 /* Find the correct node to append this section. */
493 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
494 tree
= &((*tree
)->left
);
496 tree
= &((*tree
)->right
);
502 /* Use wild_sort_fast to build a BST to sort sections. */
505 output_section_callback_fast (lang_wild_statement_type
*ptr
,
506 struct wildcard_list
*sec
,
508 lang_input_statement_type
*file
,
511 lang_section_bst_type
*node
;
512 lang_section_bst_type
**tree
;
513 lang_output_section_statement_type
*os
;
515 os
= (lang_output_section_statement_type
*) output
;
517 if (unique_section_p (section
, os
))
520 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
523 node
->section
= section
;
525 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
530 /* Convert a sorted sections' BST back to list form. */
533 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
534 lang_section_bst_type
*tree
,
538 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
540 lang_add_section (&ptr
->children
, tree
->section
,
541 (lang_output_section_statement_type
*) output
);
544 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
549 /* Specialized, optimized routines for handling different kinds of
553 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
554 lang_input_statement_type
*file
,
558 /* We can just do a hash lookup for the section with the right name.
559 But if that lookup discovers more than one section with the name
560 (should be rare), we fall back to the general algorithm because
561 we would otherwise have to sort the sections to make sure they
562 get processed in the bfd's order. */
563 bfd_boolean multiple_sections_found
;
564 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
565 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
567 if (multiple_sections_found
)
568 walk_wild_section_general (ptr
, file
, callback
, data
);
570 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
574 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
575 lang_input_statement_type
*file
,
580 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
582 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
584 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
585 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
588 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
593 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
594 lang_input_statement_type
*file
,
599 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
600 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
601 bfd_boolean multiple_sections_found
;
602 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
604 if (multiple_sections_found
)
606 walk_wild_section_general (ptr
, file
, callback
, data
);
610 /* Note that if the section was not found, s0 is NULL and
611 we'll simply never succeed the s == s0 test below. */
612 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
614 /* Recall that in this code path, a section cannot satisfy more
615 than one spec, so if s == s0 then it cannot match
618 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
621 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
622 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
625 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
632 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
633 lang_input_statement_type
*file
,
638 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
639 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
640 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
641 bfd_boolean multiple_sections_found
;
642 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
644 if (multiple_sections_found
)
646 walk_wild_section_general (ptr
, file
, callback
, data
);
650 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
653 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
656 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
657 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
660 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
663 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
665 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
673 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
674 lang_input_statement_type
*file
,
679 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
680 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
681 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
682 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
683 bfd_boolean multiple_sections_found
;
684 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
686 if (multiple_sections_found
)
688 walk_wild_section_general (ptr
, file
, callback
, data
);
692 s1
= find_section (file
, sec1
, &multiple_sections_found
);
693 if (multiple_sections_found
)
695 walk_wild_section_general (ptr
, file
, callback
, data
);
699 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
702 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
705 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
708 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
709 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
713 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
717 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
719 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
727 walk_wild_section (lang_wild_statement_type
*ptr
,
728 lang_input_statement_type
*file
,
732 if (file
->just_syms_flag
)
735 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
738 /* Returns TRUE when name1 is a wildcard spec that might match
739 something name2 can match. We're conservative: we return FALSE
740 only if the prefixes of name1 and name2 are different up to the
741 first wildcard character. */
744 wild_spec_can_overlap (const char *name1
, const char *name2
)
746 size_t prefix1_len
= strcspn (name1
, "?*[");
747 size_t prefix2_len
= strcspn (name2
, "?*[");
748 size_t min_prefix_len
;
750 /* Note that if there is no wildcard character, then we treat the
751 terminating 0 as part of the prefix. Thus ".text" won't match
752 ".text." or ".text.*", for example. */
753 if (name1
[prefix1_len
] == '\0')
755 if (name2
[prefix2_len
] == '\0')
758 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
760 return memcmp (name1
, name2
, min_prefix_len
) == 0;
763 /* Select specialized code to handle various kinds of wildcard
767 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
770 int wild_name_count
= 0;
771 struct wildcard_list
*sec
;
775 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
776 ptr
->handler_data
[0] = NULL
;
777 ptr
->handler_data
[1] = NULL
;
778 ptr
->handler_data
[2] = NULL
;
779 ptr
->handler_data
[3] = NULL
;
782 /* Count how many wildcard_specs there are, and how many of those
783 actually use wildcards in the name. Also, bail out if any of the
784 wildcard names are NULL. (Can this actually happen?
785 walk_wild_section used to test for it.) And bail out if any
786 of the wildcards are more complex than a simple string
787 ending in a single '*'. */
788 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
791 if (sec
->spec
.name
== NULL
)
793 if (wildcardp (sec
->spec
.name
))
796 if (!is_simple_wild (sec
->spec
.name
))
801 /* The zero-spec case would be easy to optimize but it doesn't
802 happen in practice. Likewise, more than 4 specs doesn't
803 happen in practice. */
804 if (sec_count
== 0 || sec_count
> 4)
807 /* Check that no two specs can match the same section. */
808 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
810 struct wildcard_list
*sec2
;
811 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
813 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
818 signature
= (sec_count
<< 8) + wild_name_count
;
822 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
825 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
828 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
831 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
834 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
840 /* Now fill the data array with pointers to the specs, first the
841 specs with non-wildcard names, then the specs with wildcard
842 names. It's OK to process the specs in different order from the
843 given order, because we've already determined that no section
844 will match more than one spec. */
846 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
847 if (!wildcardp (sec
->spec
.name
))
848 ptr
->handler_data
[data_counter
++] = sec
;
849 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
850 if (wildcardp (sec
->spec
.name
))
851 ptr
->handler_data
[data_counter
++] = sec
;
854 /* Handle a wild statement for a single file F. */
857 walk_wild_file (lang_wild_statement_type
*s
,
858 lang_input_statement_type
*f
,
862 if (f
->the_bfd
== NULL
863 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
864 walk_wild_section (s
, f
, callback
, data
);
869 /* This is an archive file. We must map each member of the
870 archive separately. */
871 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
872 while (member
!= NULL
)
874 /* When lookup_name is called, it will call the add_symbols
875 entry point for the archive. For each element of the
876 archive which is included, BFD will call ldlang_add_file,
877 which will set the usrdata field of the member to the
878 lang_input_statement. */
879 if (member
->usrdata
!= NULL
)
881 walk_wild_section (s
,
882 (lang_input_statement_type
*) member
->usrdata
,
886 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
892 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
894 const char *file_spec
= s
->filename
;
897 if (file_spec
== NULL
)
899 /* Perform the iteration over all files in the list. */
900 LANG_FOR_EACH_INPUT_STATEMENT (f
)
902 walk_wild_file (s
, f
, callback
, data
);
905 else if ((p
= archive_path (file_spec
)) != NULL
)
907 LANG_FOR_EACH_INPUT_STATEMENT (f
)
909 if (input_statement_is_archive_path (file_spec
, p
, f
))
910 walk_wild_file (s
, f
, callback
, data
);
913 else if (wildcardp (file_spec
))
915 LANG_FOR_EACH_INPUT_STATEMENT (f
)
917 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
918 walk_wild_file (s
, f
, callback
, data
);
923 lang_input_statement_type
*f
;
925 /* Perform the iteration over a single file. */
926 f
= lookup_name (file_spec
);
928 walk_wild_file (s
, f
, callback
, data
);
932 /* lang_for_each_statement walks the parse tree and calls the provided
933 function for each node, except those inside output section statements
934 with constraint set to -1. */
937 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
938 lang_statement_union_type
*s
)
940 for (; s
!= NULL
; s
= s
->header
.next
)
944 switch (s
->header
.type
)
946 case lang_constructors_statement_enum
:
947 lang_for_each_statement_worker (func
, constructor_list
.head
);
949 case lang_output_section_statement_enum
:
950 if (s
->output_section_statement
.constraint
!= -1)
951 lang_for_each_statement_worker
952 (func
, s
->output_section_statement
.children
.head
);
954 case lang_wild_statement_enum
:
955 lang_for_each_statement_worker (func
,
956 s
->wild_statement
.children
.head
);
958 case lang_group_statement_enum
:
959 lang_for_each_statement_worker (func
,
960 s
->group_statement
.children
.head
);
962 case lang_data_statement_enum
:
963 case lang_reloc_statement_enum
:
964 case lang_object_symbols_statement_enum
:
965 case lang_output_statement_enum
:
966 case lang_target_statement_enum
:
967 case lang_input_section_enum
:
968 case lang_input_statement_enum
:
969 case lang_assignment_statement_enum
:
970 case lang_padding_statement_enum
:
971 case lang_address_statement_enum
:
972 case lang_fill_statement_enum
:
973 case lang_insert_statement_enum
:
983 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
985 lang_for_each_statement_worker (func
, statement_list
.head
);
988 /*----------------------------------------------------------------------*/
991 lang_list_init (lang_statement_list_type
*list
)
994 list
->tail
= &list
->head
;
998 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1000 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1002 *stat_save_ptr
++ = stat_ptr
;
1009 if (stat_save_ptr
<= stat_save
)
1011 stat_ptr
= *--stat_save_ptr
;
1014 /* Build a new statement node for the parse tree. */
1016 static lang_statement_union_type
*
1017 new_statement (enum statement_enum type
,
1019 lang_statement_list_type
*list
)
1021 lang_statement_union_type
*new_stmt
;
1023 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1024 new_stmt
->header
.type
= type
;
1025 new_stmt
->header
.next
= NULL
;
1026 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1030 /* Build a new input file node for the language. There are several
1031 ways in which we treat an input file, eg, we only look at symbols,
1032 or prefix it with a -l etc.
1034 We can be supplied with requests for input files more than once;
1035 they may, for example be split over several lines like foo.o(.text)
1036 foo.o(.data) etc, so when asked for a file we check that we haven't
1037 got it already so we don't duplicate the bfd. */
1039 static lang_input_statement_type
*
1040 new_afile (const char *name
,
1041 lang_input_file_enum_type file_type
,
1043 bfd_boolean add_to_list
)
1045 lang_input_statement_type
*p
;
1048 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1051 p
= (lang_input_statement_type
*)
1052 stat_alloc (sizeof (lang_input_statement_type
));
1053 p
->header
.type
= lang_input_statement_enum
;
1054 p
->header
.next
= NULL
;
1057 lang_has_input_file
= TRUE
;
1059 p
->sysrooted
= FALSE
;
1061 if (file_type
== lang_input_file_is_l_enum
1062 && name
[0] == ':' && name
[1] != '\0')
1064 file_type
= lang_input_file_is_search_file_enum
;
1070 case lang_input_file_is_symbols_only_enum
:
1072 p
->maybe_archive
= FALSE
;
1074 p
->local_sym_name
= name
;
1075 p
->just_syms_flag
= TRUE
;
1076 p
->search_dirs_flag
= FALSE
;
1078 case lang_input_file_is_fake_enum
:
1080 p
->maybe_archive
= FALSE
;
1082 p
->local_sym_name
= name
;
1083 p
->just_syms_flag
= FALSE
;
1084 p
->search_dirs_flag
= FALSE
;
1086 case lang_input_file_is_l_enum
:
1087 p
->maybe_archive
= TRUE
;
1090 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1091 p
->just_syms_flag
= FALSE
;
1092 p
->search_dirs_flag
= TRUE
;
1094 case lang_input_file_is_marker_enum
:
1096 p
->maybe_archive
= FALSE
;
1098 p
->local_sym_name
= name
;
1099 p
->just_syms_flag
= FALSE
;
1100 p
->search_dirs_flag
= TRUE
;
1102 case lang_input_file_is_search_file_enum
:
1103 p
->sysrooted
= ldlang_sysrooted_script
;
1105 p
->maybe_archive
= FALSE
;
1107 p
->local_sym_name
= name
;
1108 p
->just_syms_flag
= FALSE
;
1109 p
->search_dirs_flag
= TRUE
;
1111 case lang_input_file_is_file_enum
:
1113 p
->maybe_archive
= FALSE
;
1115 p
->local_sym_name
= name
;
1116 p
->just_syms_flag
= FALSE
;
1117 p
->search_dirs_flag
= FALSE
;
1123 p
->next_real_file
= NULL
;
1125 p
->dynamic
= config
.dynamic_link
;
1126 p
->add_DT_NEEDED_for_dynamic
= add_DT_NEEDED_for_dynamic
;
1127 p
->add_DT_NEEDED_for_regular
= add_DT_NEEDED_for_regular
;
1128 p
->whole_archive
= whole_archive
;
1130 p
->missing_file
= FALSE
;
1132 lang_statement_append (&input_file_chain
,
1133 (lang_statement_union_type
*) p
,
1134 &p
->next_real_file
);
1138 lang_input_statement_type
*
1139 lang_add_input_file (const char *name
,
1140 lang_input_file_enum_type file_type
,
1143 return new_afile (name
, file_type
, target
, TRUE
);
1146 struct out_section_hash_entry
1148 struct bfd_hash_entry root
;
1149 lang_statement_union_type s
;
1152 /* The hash table. */
1154 static struct bfd_hash_table output_section_statement_table
;
1156 /* Support routines for the hash table used by lang_output_section_find,
1157 initialize the table, fill in an entry and remove the table. */
1159 static struct bfd_hash_entry
*
1160 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1161 struct bfd_hash_table
*table
,
1164 lang_output_section_statement_type
**nextp
;
1165 struct out_section_hash_entry
*ret
;
1169 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1175 entry
= bfd_hash_newfunc (entry
, table
, string
);
1179 ret
= (struct out_section_hash_entry
*) entry
;
1180 memset (&ret
->s
, 0, sizeof (ret
->s
));
1181 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1182 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1183 ret
->s
.output_section_statement
.section_alignment
= -1;
1184 ret
->s
.output_section_statement
.block_value
= 1;
1185 lang_list_init (&ret
->s
.output_section_statement
.children
);
1186 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1188 /* For every output section statement added to the list, except the
1189 first one, lang_output_section_statement.tail points to the "next"
1190 field of the last element of the list. */
1191 if (lang_output_section_statement
.head
!= NULL
)
1192 ret
->s
.output_section_statement
.prev
1193 = ((lang_output_section_statement_type
*)
1194 ((char *) lang_output_section_statement
.tail
1195 - offsetof (lang_output_section_statement_type
, next
)));
1197 /* GCC's strict aliasing rules prevent us from just casting the
1198 address, so we store the pointer in a variable and cast that
1200 nextp
= &ret
->s
.output_section_statement
.next
;
1201 lang_statement_append (&lang_output_section_statement
,
1203 (lang_statement_union_type
**) nextp
);
1208 output_section_statement_table_init (void)
1210 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1211 output_section_statement_newfunc
,
1212 sizeof (struct out_section_hash_entry
),
1214 einfo (_("%P%F: can not create hash table: %E\n"));
1218 output_section_statement_table_free (void)
1220 bfd_hash_table_free (&output_section_statement_table
);
1223 /* Build enough state so that the parser can build its tree. */
1228 obstack_begin (&stat_obstack
, 1000);
1230 stat_ptr
= &statement_list
;
1232 output_section_statement_table_init ();
1234 lang_list_init (stat_ptr
);
1236 lang_list_init (&input_file_chain
);
1237 lang_list_init (&lang_output_section_statement
);
1238 lang_list_init (&file_chain
);
1239 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1241 abs_output_section
=
1242 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1244 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1246 /* The value "3" is ad-hoc, somewhat related to the expected number of
1247 DEFINED expressions in a linker script. For most default linker
1248 scripts, there are none. Why a hash table then? Well, it's somewhat
1249 simpler to re-use working machinery than using a linked list in terms
1250 of code-complexity here in ld, besides the initialization which just
1251 looks like other code here. */
1252 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1253 lang_definedness_newfunc
,
1254 sizeof (struct lang_definedness_hash_entry
),
1256 einfo (_("%P%F: can not create hash table: %E\n"));
1262 output_section_statement_table_free ();
1265 /*----------------------------------------------------------------------
1266 A region is an area of memory declared with the
1267 MEMORY { name:org=exp, len=exp ... }
1270 We maintain a list of all the regions here.
1272 If no regions are specified in the script, then the default is used
1273 which is created when looked up to be the entire data space.
1275 If create is true we are creating a region inside a MEMORY block.
1276 In this case it is probably an error to create a region that has
1277 already been created. If we are not inside a MEMORY block it is
1278 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1279 and so we issue a warning.
1281 Each region has at least one name. The first name is either
1282 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1283 alias names to an existing region within a script with
1284 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1287 static lang_memory_region_type
*lang_memory_region_list
;
1288 static lang_memory_region_type
**lang_memory_region_list_tail
1289 = &lang_memory_region_list
;
1291 lang_memory_region_type
*
1292 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1294 lang_memory_region_name
*n
;
1295 lang_memory_region_type
*r
;
1296 lang_memory_region_type
*new_region
;
1298 /* NAME is NULL for LMA memspecs if no region was specified. */
1302 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1303 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1304 if (strcmp (n
->name
, name
) == 0)
1307 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1312 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1313 einfo (_("%P:%S: warning: memory region `%s' not declared\n"), name
);
1315 new_region
= (lang_memory_region_type
*)
1316 stat_alloc (sizeof (lang_memory_region_type
));
1318 new_region
->name_list
.name
= xstrdup (name
);
1319 new_region
->name_list
.next
= NULL
;
1320 new_region
->next
= NULL
;
1321 new_region
->origin
= 0;
1322 new_region
->length
= ~(bfd_size_type
) 0;
1323 new_region
->current
= 0;
1324 new_region
->last_os
= NULL
;
1325 new_region
->flags
= 0;
1326 new_region
->not_flags
= 0;
1327 new_region
->had_full_message
= FALSE
;
1329 *lang_memory_region_list_tail
= new_region
;
1330 lang_memory_region_list_tail
= &new_region
->next
;
1336 lang_memory_region_alias (const char * alias
, const char * region_name
)
1338 lang_memory_region_name
* n
;
1339 lang_memory_region_type
* r
;
1340 lang_memory_region_type
* region
;
1342 /* The default region must be unique. This ensures that it is not necessary
1343 to iterate through the name list if someone wants the check if a region is
1344 the default memory region. */
1345 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1346 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1347 einfo (_("%F%P:%S: error: alias for default memory region\n"));
1349 /* Look for the target region and check if the alias is not already
1352 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1353 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1355 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1357 if (strcmp (n
->name
, alias
) == 0)
1358 einfo (_("%F%P:%S: error: redefinition of memory region "
1363 /* Check if the target region exists. */
1365 einfo (_("%F%P:%S: error: memory region `%s' "
1366 "for alias `%s' does not exist\n"),
1370 /* Add alias to region name list. */
1371 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1372 n
->name
= xstrdup (alias
);
1373 n
->next
= region
->name_list
.next
;
1374 region
->name_list
.next
= n
;
1377 static lang_memory_region_type
*
1378 lang_memory_default (asection
* section
)
1380 lang_memory_region_type
*p
;
1382 flagword sec_flags
= section
->flags
;
1384 /* Override SEC_DATA to mean a writable section. */
1385 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1386 sec_flags
|= SEC_DATA
;
1388 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1390 if ((p
->flags
& sec_flags
) != 0
1391 && (p
->not_flags
& sec_flags
) == 0)
1396 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1399 /* Find or create an output_section_statement with the given NAME.
1400 If CONSTRAINT is non-zero match one with that constraint, otherwise
1401 match any non-negative constraint. If CREATE, always make a
1402 new output_section_statement for SPECIAL CONSTRAINT. */
1404 lang_output_section_statement_type
*
1405 lang_output_section_statement_lookup (const char *name
,
1409 struct out_section_hash_entry
*entry
;
1411 entry
= ((struct out_section_hash_entry
*)
1412 bfd_hash_lookup (&output_section_statement_table
, name
,
1417 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1421 if (entry
->s
.output_section_statement
.name
!= NULL
)
1423 /* We have a section of this name, but it might not have the correct
1425 struct out_section_hash_entry
*last_ent
;
1427 name
= entry
->s
.output_section_statement
.name
;
1428 if (create
&& constraint
== SPECIAL
)
1429 /* Not traversing to the end reverses the order of the second
1430 and subsequent SPECIAL sections in the hash table chain,
1431 but that shouldn't matter. */
1436 if (constraint
== entry
->s
.output_section_statement
.constraint
1438 && entry
->s
.output_section_statement
.constraint
>= 0))
1439 return &entry
->s
.output_section_statement
;
1441 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1443 while (entry
!= NULL
1444 && name
== entry
->s
.output_section_statement
.name
);
1450 = ((struct out_section_hash_entry
*)
1451 output_section_statement_newfunc (NULL
,
1452 &output_section_statement_table
,
1456 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1459 entry
->root
= last_ent
->root
;
1460 last_ent
->root
.next
= &entry
->root
;
1463 entry
->s
.output_section_statement
.name
= name
;
1464 entry
->s
.output_section_statement
.constraint
= constraint
;
1465 return &entry
->s
.output_section_statement
;
1468 /* Find the next output_section_statement with the same name as OS.
1469 If CONSTRAINT is non-zero, find one with that constraint otherwise
1470 match any non-negative constraint. */
1472 lang_output_section_statement_type
*
1473 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1476 /* All output_section_statements are actually part of a
1477 struct out_section_hash_entry. */
1478 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1480 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1481 const char *name
= os
->name
;
1483 ASSERT (name
== entry
->root
.string
);
1486 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1488 || name
!= entry
->s
.output_section_statement
.name
)
1491 while (constraint
!= entry
->s
.output_section_statement
.constraint
1493 || entry
->s
.output_section_statement
.constraint
< 0));
1495 return &entry
->s
.output_section_statement
;
1498 /* A variant of lang_output_section_find used by place_orphan.
1499 Returns the output statement that should precede a new output
1500 statement for SEC. If an exact match is found on certain flags,
1503 lang_output_section_statement_type
*
1504 lang_output_section_find_by_flags (const asection
*sec
,
1505 lang_output_section_statement_type
**exact
,
1506 lang_match_sec_type_func match_type
)
1508 lang_output_section_statement_type
*first
, *look
, *found
;
1511 /* We know the first statement on this list is *ABS*. May as well
1513 first
= &lang_output_section_statement
.head
->output_section_statement
;
1514 first
= first
->next
;
1516 /* First try for an exact match. */
1518 for (look
= first
; look
; look
= look
->next
)
1520 flags
= look
->flags
;
1521 if (look
->bfd_section
!= NULL
)
1523 flags
= look
->bfd_section
->flags
;
1524 if (match_type
&& !match_type (link_info
.output_bfd
,
1529 flags
^= sec
->flags
;
1530 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1531 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1541 if ((sec
->flags
& SEC_CODE
) != 0
1542 && (sec
->flags
& SEC_ALLOC
) != 0)
1544 /* Try for a rw code section. */
1545 for (look
= first
; look
; look
= look
->next
)
1547 flags
= look
->flags
;
1548 if (look
->bfd_section
!= NULL
)
1550 flags
= look
->bfd_section
->flags
;
1551 if (match_type
&& !match_type (link_info
.output_bfd
,
1556 flags
^= sec
->flags
;
1557 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1558 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1562 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1563 && (sec
->flags
& SEC_ALLOC
) != 0)
1565 /* .rodata can go after .text, .sdata2 after .rodata. */
1566 for (look
= first
; look
; look
= look
->next
)
1568 flags
= look
->flags
;
1569 if (look
->bfd_section
!= NULL
)
1571 flags
= look
->bfd_section
->flags
;
1572 if (match_type
&& !match_type (link_info
.output_bfd
,
1577 flags
^= sec
->flags
;
1578 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1580 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1584 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1585 && (sec
->flags
& SEC_ALLOC
) != 0)
1587 /* .sdata goes after .data, .sbss after .sdata. */
1588 for (look
= first
; look
; look
= look
->next
)
1590 flags
= look
->flags
;
1591 if (look
->bfd_section
!= NULL
)
1593 flags
= look
->bfd_section
->flags
;
1594 if (match_type
&& !match_type (link_info
.output_bfd
,
1599 flags
^= sec
->flags
;
1600 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1601 | SEC_THREAD_LOCAL
))
1602 || ((look
->flags
& SEC_SMALL_DATA
)
1603 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1607 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1608 && (sec
->flags
& SEC_ALLOC
) != 0)
1610 /* .data goes after .rodata. */
1611 for (look
= first
; look
; look
= look
->next
)
1613 flags
= look
->flags
;
1614 if (look
->bfd_section
!= NULL
)
1616 flags
= look
->bfd_section
->flags
;
1617 if (match_type
&& !match_type (link_info
.output_bfd
,
1622 flags
^= sec
->flags
;
1623 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1624 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1628 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1630 /* .bss goes after any other alloc section. */
1631 for (look
= first
; look
; look
= look
->next
)
1633 flags
= look
->flags
;
1634 if (look
->bfd_section
!= NULL
)
1636 flags
= look
->bfd_section
->flags
;
1637 if (match_type
&& !match_type (link_info
.output_bfd
,
1642 flags
^= sec
->flags
;
1643 if (!(flags
& SEC_ALLOC
))
1649 /* non-alloc go last. */
1650 for (look
= first
; look
; look
= look
->next
)
1652 flags
= look
->flags
;
1653 if (look
->bfd_section
!= NULL
)
1654 flags
= look
->bfd_section
->flags
;
1655 flags
^= sec
->flags
;
1656 if (!(flags
& SEC_DEBUGGING
))
1662 if (found
|| !match_type
)
1665 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1668 /* Find the last output section before given output statement.
1669 Used by place_orphan. */
1672 output_prev_sec_find (lang_output_section_statement_type
*os
)
1674 lang_output_section_statement_type
*lookup
;
1676 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1678 if (lookup
->constraint
< 0)
1681 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1682 return lookup
->bfd_section
;
1688 /* Look for a suitable place for a new output section statement. The
1689 idea is to skip over anything that might be inside a SECTIONS {}
1690 statement in a script, before we find another output section
1691 statement. Assignments to "dot" before an output section statement
1692 are assumed to belong to it, except in two cases; The first
1693 assignment to dot, and assignments before non-alloc sections.
1694 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1695 similar assignments that set the initial address, or we might
1696 insert non-alloc note sections among assignments setting end of
1699 static lang_statement_union_type
**
1700 insert_os_after (lang_output_section_statement_type
*after
)
1702 lang_statement_union_type
**where
;
1703 lang_statement_union_type
**assign
= NULL
;
1704 bfd_boolean ignore_first
;
1707 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1709 for (where
= &after
->header
.next
;
1711 where
= &(*where
)->header
.next
)
1713 switch ((*where
)->header
.type
)
1715 case lang_assignment_statement_enum
:
1718 lang_assignment_statement_type
*ass
;
1720 ass
= &(*where
)->assignment_statement
;
1721 if (ass
->exp
->type
.node_class
!= etree_assert
1722 && ass
->exp
->assign
.dst
[0] == '.'
1723 && ass
->exp
->assign
.dst
[1] == 0
1727 ignore_first
= FALSE
;
1729 case lang_wild_statement_enum
:
1730 case lang_input_section_enum
:
1731 case lang_object_symbols_statement_enum
:
1732 case lang_fill_statement_enum
:
1733 case lang_data_statement_enum
:
1734 case lang_reloc_statement_enum
:
1735 case lang_padding_statement_enum
:
1736 case lang_constructors_statement_enum
:
1739 case lang_output_section_statement_enum
:
1742 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1745 || s
->map_head
.s
== NULL
1746 || (s
->flags
& SEC_ALLOC
) != 0)
1750 case lang_input_statement_enum
:
1751 case lang_address_statement_enum
:
1752 case lang_target_statement_enum
:
1753 case lang_output_statement_enum
:
1754 case lang_group_statement_enum
:
1755 case lang_insert_statement_enum
:
1764 lang_output_section_statement_type
*
1765 lang_insert_orphan (asection
*s
,
1766 const char *secname
,
1768 lang_output_section_statement_type
*after
,
1769 struct orphan_save
*place
,
1770 etree_type
*address
,
1771 lang_statement_list_type
*add_child
)
1773 lang_statement_list_type add
;
1775 lang_output_section_statement_type
*os
;
1776 lang_output_section_statement_type
**os_tail
;
1778 /* If we have found an appropriate place for the output section
1779 statements for this orphan, add them to our own private list,
1780 inserting them later into the global statement list. */
1783 lang_list_init (&add
);
1784 push_stat_ptr (&add
);
1787 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1788 address
= exp_intop (0);
1790 os_tail
= ((lang_output_section_statement_type
**)
1791 lang_output_section_statement
.tail
);
1792 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1793 NULL
, NULL
, NULL
, constraint
);
1796 if (config
.build_constructors
&& *os_tail
== os
)
1798 /* If the name of the section is representable in C, then create
1799 symbols to mark the start and the end of the section. */
1800 for (ps
= secname
; *ps
!= '\0'; ps
++)
1801 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1806 etree_type
*e_align
;
1808 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1809 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1810 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1811 e_align
= exp_unop (ALIGN_K
,
1812 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1813 lang_add_assignment (exp_assop ('=', ".", e_align
));
1814 lang_add_assignment (exp_provide (symname
,
1816 exp_nameop (NAME
, ".")),
1821 if (add_child
== NULL
)
1822 add_child
= &os
->children
;
1823 lang_add_section (add_child
, s
, os
);
1825 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1827 const char *region
= (after
->region
1828 ? after
->region
->name_list
.name
1829 : DEFAULT_MEMORY_REGION
);
1830 const char *lma_region
= (after
->lma_region
1831 ? after
->lma_region
->name_list
.name
1833 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1837 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1840 if (ps
!= NULL
&& *ps
== '\0')
1844 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1845 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1846 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1847 lang_add_assignment (exp_provide (symname
,
1848 exp_nameop (NAME
, "."),
1852 /* Restore the global list pointer. */
1856 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1858 asection
*snew
, *as
;
1860 snew
= os
->bfd_section
;
1862 /* Shuffle the bfd section list to make the output file look
1863 neater. This is really only cosmetic. */
1864 if (place
->section
== NULL
1865 && after
!= (&lang_output_section_statement
.head
1866 ->output_section_statement
))
1868 asection
*bfd_section
= after
->bfd_section
;
1870 /* If the output statement hasn't been used to place any input
1871 sections (and thus doesn't have an output bfd_section),
1872 look for the closest prior output statement having an
1874 if (bfd_section
== NULL
)
1875 bfd_section
= output_prev_sec_find (after
);
1877 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1878 place
->section
= &bfd_section
->next
;
1881 if (place
->section
== NULL
)
1882 place
->section
= &link_info
.output_bfd
->sections
;
1884 as
= *place
->section
;
1888 /* Put the section at the end of the list. */
1890 /* Unlink the section. */
1891 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1893 /* Now tack it back on in the right place. */
1894 bfd_section_list_append (link_info
.output_bfd
, snew
);
1896 else if (as
!= snew
&& as
->prev
!= snew
)
1898 /* Unlink the section. */
1899 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1901 /* Now tack it back on in the right place. */
1902 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1905 /* Save the end of this list. Further ophans of this type will
1906 follow the one we've just added. */
1907 place
->section
= &snew
->next
;
1909 /* The following is non-cosmetic. We try to put the output
1910 statements in some sort of reasonable order here, because they
1911 determine the final load addresses of the orphan sections.
1912 In addition, placing output statements in the wrong order may
1913 require extra segments. For instance, given a typical
1914 situation of all read-only sections placed in one segment and
1915 following that a segment containing all the read-write
1916 sections, we wouldn't want to place an orphan read/write
1917 section before or amongst the read-only ones. */
1918 if (add
.head
!= NULL
)
1920 lang_output_section_statement_type
*newly_added_os
;
1922 if (place
->stmt
== NULL
)
1924 lang_statement_union_type
**where
= insert_os_after (after
);
1929 place
->os_tail
= &after
->next
;
1933 /* Put it after the last orphan statement we added. */
1934 *add
.tail
= *place
->stmt
;
1935 *place
->stmt
= add
.head
;
1938 /* Fix the global list pointer if we happened to tack our
1939 new list at the tail. */
1940 if (*stat_ptr
->tail
== add
.head
)
1941 stat_ptr
->tail
= add
.tail
;
1943 /* Save the end of this list. */
1944 place
->stmt
= add
.tail
;
1946 /* Do the same for the list of output section statements. */
1947 newly_added_os
= *os_tail
;
1949 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1950 ((char *) place
->os_tail
1951 - offsetof (lang_output_section_statement_type
, next
));
1952 newly_added_os
->next
= *place
->os_tail
;
1953 if (newly_added_os
->next
!= NULL
)
1954 newly_added_os
->next
->prev
= newly_added_os
;
1955 *place
->os_tail
= newly_added_os
;
1956 place
->os_tail
= &newly_added_os
->next
;
1958 /* Fixing the global list pointer here is a little different.
1959 We added to the list in lang_enter_output_section_statement,
1960 trimmed off the new output_section_statment above when
1961 assigning *os_tail = NULL, but possibly added it back in
1962 the same place when assigning *place->os_tail. */
1963 if (*os_tail
== NULL
)
1964 lang_output_section_statement
.tail
1965 = (lang_statement_union_type
**) os_tail
;
1972 lang_map_flags (flagword flag
)
1974 if (flag
& SEC_ALLOC
)
1977 if (flag
& SEC_CODE
)
1980 if (flag
& SEC_READONLY
)
1983 if (flag
& SEC_DATA
)
1986 if (flag
& SEC_LOAD
)
1993 lang_memory_region_type
*m
;
1994 bfd_boolean dis_header_printed
= FALSE
;
1997 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2001 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2002 || file
->just_syms_flag
)
2005 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2006 if ((s
->output_section
== NULL
2007 || s
->output_section
->owner
!= link_info
.output_bfd
)
2008 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2010 if (! dis_header_printed
)
2012 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2013 dis_header_printed
= TRUE
;
2016 print_input_section (s
, TRUE
);
2020 minfo (_("\nMemory Configuration\n\n"));
2021 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2022 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2024 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2029 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2031 sprintf_vma (buf
, m
->origin
);
2032 minfo ("0x%s ", buf
);
2040 minfo ("0x%V", m
->length
);
2041 if (m
->flags
|| m
->not_flags
)
2049 lang_map_flags (m
->flags
);
2055 lang_map_flags (m
->not_flags
);
2062 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2064 if (! link_info
.reduce_memory_overheads
)
2066 obstack_begin (&map_obstack
, 1000);
2067 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
2068 bfd_map_over_sections (p
, init_map_userdata
, 0);
2069 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2071 lang_statement_iteration
++;
2072 print_statements ();
2076 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
2078 void *data ATTRIBUTE_UNUSED
)
2080 fat_section_userdata_type
*new_data
2081 = ((fat_section_userdata_type
*) (stat_alloc
2082 (sizeof (fat_section_userdata_type
))));
2084 ASSERT (get_userdata (sec
) == NULL
);
2085 get_userdata (sec
) = new_data
;
2086 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
2087 new_data
->map_symbol_def_count
= 0;
2091 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2092 void *info ATTRIBUTE_UNUSED
)
2094 if (hash_entry
->type
== bfd_link_hash_defined
2095 || hash_entry
->type
== bfd_link_hash_defweak
)
2097 struct fat_user_section_struct
*ud
;
2098 struct map_symbol_def
*def
;
2100 ud
= (struct fat_user_section_struct
*)
2101 get_userdata (hash_entry
->u
.def
.section
);
2104 /* ??? What do we have to do to initialize this beforehand? */
2105 /* The first time we get here is bfd_abs_section... */
2106 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
2107 ud
= (struct fat_user_section_struct
*)
2108 get_userdata (hash_entry
->u
.def
.section
);
2110 else if (!ud
->map_symbol_def_tail
)
2111 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2113 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2114 def
->entry
= hash_entry
;
2115 *(ud
->map_symbol_def_tail
) = def
;
2116 ud
->map_symbol_def_tail
= &def
->next
;
2117 ud
->map_symbol_def_count
++;
2122 /* Initialize an output section. */
2125 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2127 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2128 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2130 if (s
->constraint
!= SPECIAL
)
2131 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2132 if (s
->bfd_section
== NULL
)
2133 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2135 if (s
->bfd_section
== NULL
)
2137 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2138 link_info
.output_bfd
->xvec
->name
, s
->name
);
2140 s
->bfd_section
->output_section
= s
->bfd_section
;
2141 s
->bfd_section
->output_offset
= 0;
2143 if (!link_info
.reduce_memory_overheads
)
2145 fat_section_userdata_type
*new_userdata
= (fat_section_userdata_type
*)
2146 stat_alloc (sizeof (fat_section_userdata_type
));
2147 memset (new_userdata
, 0, sizeof (fat_section_userdata_type
));
2148 get_userdata (s
->bfd_section
) = new_userdata
;
2151 /* If there is a base address, make sure that any sections it might
2152 mention are initialized. */
2153 if (s
->addr_tree
!= NULL
)
2154 exp_init_os (s
->addr_tree
);
2156 if (s
->load_base
!= NULL
)
2157 exp_init_os (s
->load_base
);
2159 /* If supplied an alignment, set it. */
2160 if (s
->section_alignment
!= -1)
2161 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2164 /* Make sure that all output sections mentioned in an expression are
2168 exp_init_os (etree_type
*exp
)
2170 switch (exp
->type
.node_class
)
2174 exp_init_os (exp
->assign
.src
);
2178 exp_init_os (exp
->binary
.lhs
);
2179 exp_init_os (exp
->binary
.rhs
);
2183 exp_init_os (exp
->trinary
.cond
);
2184 exp_init_os (exp
->trinary
.lhs
);
2185 exp_init_os (exp
->trinary
.rhs
);
2189 exp_init_os (exp
->assert_s
.child
);
2193 exp_init_os (exp
->unary
.child
);
2197 switch (exp
->type
.node_code
)
2203 lang_output_section_statement_type
*os
;
2205 os
= lang_output_section_find (exp
->name
.name
);
2206 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2218 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2220 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2222 /* If we are only reading symbols from this object, then we want to
2223 discard all sections. */
2224 if (entry
->just_syms_flag
)
2226 bfd_link_just_syms (abfd
, sec
, &link_info
);
2230 if (!(abfd
->flags
& DYNAMIC
))
2231 bfd_section_already_linked (abfd
, sec
, &link_info
);
2234 /* The wild routines.
2236 These expand statements like *(.text) and foo.o to a list of
2237 explicit actions, like foo.o(.text), bar.o(.text) and
2238 foo.o(.text, .data). */
2240 /* Add SECTION to the output section OUTPUT. Do this by creating a
2241 lang_input_section statement which is placed at PTR. FILE is the
2242 input file which holds SECTION. */
2245 lang_add_section (lang_statement_list_type
*ptr
,
2247 lang_output_section_statement_type
*output
)
2249 flagword flags
= section
->flags
;
2250 bfd_boolean discard
;
2251 lang_input_section_type
*new_section
;
2253 /* Discard sections marked with SEC_EXCLUDE. */
2254 discard
= (flags
& SEC_EXCLUDE
) != 0;
2256 /* Discard input sections which are assigned to a section named
2257 DISCARD_SECTION_NAME. */
2258 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2261 /* Discard debugging sections if we are stripping debugging
2263 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2264 && (flags
& SEC_DEBUGGING
) != 0)
2269 if (section
->output_section
== NULL
)
2271 /* This prevents future calls from assigning this section. */
2272 section
->output_section
= bfd_abs_section_ptr
;
2277 if (section
->output_section
!= NULL
)
2280 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2281 to an output section, because we want to be able to include a
2282 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2283 section (I don't know why we want to do this, but we do).
2284 build_link_order in ldwrite.c handles this case by turning
2285 the embedded SEC_NEVER_LOAD section into a fill. */
2286 flags
&= ~ SEC_NEVER_LOAD
;
2288 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2289 already been processed. One reason to do this is that on pe
2290 format targets, .text$foo sections go into .text and it's odd
2291 to see .text with SEC_LINK_ONCE set. */
2293 if (!link_info
.relocatable
)
2294 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2296 switch (output
->sectype
)
2298 case normal_section
:
2299 case overlay_section
:
2301 case noalloc_section
:
2302 flags
&= ~SEC_ALLOC
;
2304 case noload_section
:
2306 flags
|= SEC_NEVER_LOAD
;
2307 /* Unfortunately GNU ld has managed to evolve two different
2308 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2309 alloc, no contents section. All others get a noload, noalloc
2311 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2312 flags
&= ~SEC_HAS_CONTENTS
;
2314 flags
&= ~SEC_ALLOC
;
2318 if (output
->bfd_section
== NULL
)
2319 init_os (output
, flags
);
2321 /* If SEC_READONLY is not set in the input section, then clear
2322 it from the output section. */
2323 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2325 if (output
->bfd_section
->linker_has_input
)
2327 /* Only set SEC_READONLY flag on the first input section. */
2328 flags
&= ~ SEC_READONLY
;
2330 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2331 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2332 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2333 || ((flags
& SEC_MERGE
) != 0
2334 && output
->bfd_section
->entsize
!= section
->entsize
))
2336 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2337 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2340 output
->bfd_section
->flags
|= flags
;
2342 if (!output
->bfd_section
->linker_has_input
)
2344 output
->bfd_section
->linker_has_input
= 1;
2345 /* This must happen after flags have been updated. The output
2346 section may have been created before we saw its first input
2347 section, eg. for a data statement. */
2348 bfd_init_private_section_data (section
->owner
, section
,
2349 link_info
.output_bfd
,
2350 output
->bfd_section
,
2352 if ((flags
& SEC_MERGE
) != 0)
2353 output
->bfd_section
->entsize
= section
->entsize
;
2356 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2357 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2359 /* FIXME: This value should really be obtained from the bfd... */
2360 output
->block_value
= 128;
2363 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2364 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2366 section
->output_section
= output
->bfd_section
;
2368 if (!link_info
.relocatable
2369 && !stripped_excluded_sections
)
2371 asection
*s
= output
->bfd_section
->map_tail
.s
;
2372 output
->bfd_section
->map_tail
.s
= section
;
2373 section
->map_head
.s
= NULL
;
2374 section
->map_tail
.s
= s
;
2376 s
->map_head
.s
= section
;
2378 output
->bfd_section
->map_head
.s
= section
;
2381 /* Add a section reference to the list. */
2382 new_section
= new_stat (lang_input_section
, ptr
);
2383 new_section
->section
= section
;
2386 /* Handle wildcard sorting. This returns the lang_input_section which
2387 should follow the one we are going to create for SECTION and FILE,
2388 based on the sorting requirements of WILD. It returns NULL if the
2389 new section should just go at the end of the current list. */
2391 static lang_statement_union_type
*
2392 wild_sort (lang_wild_statement_type
*wild
,
2393 struct wildcard_list
*sec
,
2394 lang_input_statement_type
*file
,
2397 lang_statement_union_type
*l
;
2399 if (!wild
->filenames_sorted
2400 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2403 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2405 lang_input_section_type
*ls
;
2407 if (l
->header
.type
!= lang_input_section_enum
)
2409 ls
= &l
->input_section
;
2411 /* Sorting by filename takes precedence over sorting by section
2414 if (wild
->filenames_sorted
)
2416 const char *fn
, *ln
;
2420 /* The PE support for the .idata section as generated by
2421 dlltool assumes that files will be sorted by the name of
2422 the archive and then the name of the file within the
2425 if (file
->the_bfd
!= NULL
2426 && bfd_my_archive (file
->the_bfd
) != NULL
)
2428 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2433 fn
= file
->filename
;
2437 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2439 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2444 ln
= ls
->section
->owner
->filename
;
2448 i
= strcmp (fn
, ln
);
2457 fn
= file
->filename
;
2459 ln
= ls
->section
->owner
->filename
;
2461 i
= strcmp (fn
, ln
);
2469 /* Here either the files are not sorted by name, or we are
2470 looking at the sections for this file. */
2472 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2473 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2480 /* Expand a wild statement for a particular FILE. SECTION may be
2481 NULL, in which case it is a wild card. */
2484 output_section_callback (lang_wild_statement_type
*ptr
,
2485 struct wildcard_list
*sec
,
2487 lang_input_statement_type
*file
,
2490 lang_statement_union_type
*before
;
2491 lang_output_section_statement_type
*os
;
2493 os
= (lang_output_section_statement_type
*) output
;
2495 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2496 if (unique_section_p (section
, os
))
2499 before
= wild_sort (ptr
, sec
, file
, section
);
2501 /* Here BEFORE points to the lang_input_section which
2502 should follow the one we are about to add. If BEFORE
2503 is NULL, then the section should just go at the end
2504 of the current list. */
2507 lang_add_section (&ptr
->children
, section
, os
);
2510 lang_statement_list_type list
;
2511 lang_statement_union_type
**pp
;
2513 lang_list_init (&list
);
2514 lang_add_section (&list
, section
, os
);
2516 /* If we are discarding the section, LIST.HEAD will
2518 if (list
.head
!= NULL
)
2520 ASSERT (list
.head
->header
.next
== NULL
);
2522 for (pp
= &ptr
->children
.head
;
2524 pp
= &(*pp
)->header
.next
)
2525 ASSERT (*pp
!= NULL
);
2527 list
.head
->header
.next
= *pp
;
2533 /* Check if all sections in a wild statement for a particular FILE
2537 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2538 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2540 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2543 lang_output_section_statement_type
*os
;
2545 os
= (lang_output_section_statement_type
*) output
;
2547 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2548 if (unique_section_p (section
, os
))
2551 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2552 os
->all_input_readonly
= FALSE
;
2555 /* This is passed a file name which must have been seen already and
2556 added to the statement tree. We will see if it has been opened
2557 already and had its symbols read. If not then we'll read it. */
2559 static lang_input_statement_type
*
2560 lookup_name (const char *name
)
2562 lang_input_statement_type
*search
;
2564 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2566 search
= (lang_input_statement_type
*) search
->next_real_file
)
2568 /* Use the local_sym_name as the name of the file that has
2569 already been loaded as filename might have been transformed
2570 via the search directory lookup mechanism. */
2571 const char *filename
= search
->local_sym_name
;
2573 if (filename
!= NULL
2574 && strcmp (filename
, name
) == 0)
2579 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2580 default_target
, FALSE
);
2582 /* If we have already added this file, or this file is not real
2583 don't add this file. */
2584 if (search
->loaded
|| !search
->real
)
2587 if (! load_symbols (search
, NULL
))
2593 /* Save LIST as a list of libraries whose symbols should not be exported. */
2598 struct excluded_lib
*next
;
2600 static struct excluded_lib
*excluded_libs
;
2603 add_excluded_libs (const char *list
)
2605 const char *p
= list
, *end
;
2609 struct excluded_lib
*entry
;
2610 end
= strpbrk (p
, ",:");
2612 end
= p
+ strlen (p
);
2613 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2614 entry
->next
= excluded_libs
;
2615 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2616 memcpy (entry
->name
, p
, end
- p
);
2617 entry
->name
[end
- p
] = '\0';
2618 excluded_libs
= entry
;
2626 check_excluded_libs (bfd
*abfd
)
2628 struct excluded_lib
*lib
= excluded_libs
;
2632 int len
= strlen (lib
->name
);
2633 const char *filename
= lbasename (abfd
->filename
);
2635 if (strcmp (lib
->name
, "ALL") == 0)
2637 abfd
->no_export
= TRUE
;
2641 if (strncmp (lib
->name
, filename
, len
) == 0
2642 && (filename
[len
] == '\0'
2643 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2644 && filename
[len
+ 2] == '\0')))
2646 abfd
->no_export
= TRUE
;
2654 /* Get the symbols for an input file. */
2657 load_symbols (lang_input_statement_type
*entry
,
2658 lang_statement_list_type
*place
)
2665 ldfile_open_file (entry
);
2667 /* Do not process further if the file was missing. */
2668 if (entry
->missing_file
)
2671 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2672 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2675 bfd_boolean save_ldlang_sysrooted_script
;
2676 bfd_boolean save_add_DT_NEEDED_for_regular
;
2677 bfd_boolean save_add_DT_NEEDED_for_dynamic
;
2678 bfd_boolean save_whole_archive
;
2680 err
= bfd_get_error ();
2682 /* See if the emulation has some special knowledge. */
2683 if (ldemul_unrecognized_file (entry
))
2686 if (err
== bfd_error_file_ambiguously_recognized
)
2690 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2691 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2692 for (p
= matching
; *p
!= NULL
; p
++)
2696 else if (err
!= bfd_error_file_not_recognized
2698 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2700 bfd_close (entry
->the_bfd
);
2701 entry
->the_bfd
= NULL
;
2703 /* Try to interpret the file as a linker script. */
2704 ldfile_open_command_file (entry
->filename
);
2706 push_stat_ptr (place
);
2707 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2708 ldlang_sysrooted_script
= entry
->sysrooted
;
2709 save_add_DT_NEEDED_for_regular
= add_DT_NEEDED_for_regular
;
2710 add_DT_NEEDED_for_regular
= entry
->add_DT_NEEDED_for_regular
;
2711 save_add_DT_NEEDED_for_dynamic
= add_DT_NEEDED_for_dynamic
;
2712 add_DT_NEEDED_for_dynamic
= entry
->add_DT_NEEDED_for_dynamic
;
2713 save_whole_archive
= whole_archive
;
2714 whole_archive
= entry
->whole_archive
;
2716 ldfile_assumed_script
= TRUE
;
2717 parser_input
= input_script
;
2718 /* We want to use the same -Bdynamic/-Bstatic as the one for
2720 config
.dynamic_link
= entry
->dynamic
;
2722 ldfile_assumed_script
= FALSE
;
2724 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2725 add_DT_NEEDED_for_regular
= save_add_DT_NEEDED_for_regular
;
2726 add_DT_NEEDED_for_dynamic
= save_add_DT_NEEDED_for_dynamic
;
2727 whole_archive
= save_whole_archive
;
2733 if (ldemul_recognized_file (entry
))
2736 /* We don't call ldlang_add_file for an archive. Instead, the
2737 add_symbols entry point will call ldlang_add_file, via the
2738 add_archive_element callback, for each element of the archive
2740 switch (bfd_get_format (entry
->the_bfd
))
2746 ldlang_add_file (entry
);
2747 if (trace_files
|| trace_file_tries
)
2748 info_msg ("%I\n", entry
);
2752 check_excluded_libs (entry
->the_bfd
);
2754 if (entry
->whole_archive
)
2757 bfd_boolean loaded
= TRUE
;
2762 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2767 if (! bfd_check_format (member
, bfd_object
))
2769 einfo (_("%F%B: member %B in archive is not an object\n"),
2770 entry
->the_bfd
, member
);
2775 if (!(*link_info
.callbacks
2776 ->add_archive_element
) (&link_info
, member
,
2777 "--whole-archive", &subsbfd
))
2780 /* Potentially, the add_archive_element hook may have set a
2781 substitute BFD for us. */
2782 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2784 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2789 entry
->loaded
= loaded
;
2795 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2796 entry
->loaded
= TRUE
;
2798 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2800 return entry
->loaded
;
2803 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2804 may be NULL, indicating that it is a wildcard. Separate
2805 lang_input_section statements are created for each part of the
2806 expansion; they are added after the wild statement S. OUTPUT is
2807 the output section. */
2810 wild (lang_wild_statement_type
*s
,
2811 const char *target ATTRIBUTE_UNUSED
,
2812 lang_output_section_statement_type
*output
)
2814 struct wildcard_list
*sec
;
2816 if (s
->handler_data
[0]
2817 && s
->handler_data
[0]->spec
.sorted
== by_name
2818 && !s
->filenames_sorted
)
2820 lang_section_bst_type
*tree
;
2822 walk_wild (s
, output_section_callback_fast
, output
);
2827 output_section_callback_tree_to_list (s
, tree
, output
);
2832 walk_wild (s
, output_section_callback
, output
);
2834 if (default_common_section
== NULL
)
2835 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2836 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2838 /* Remember the section that common is going to in case we
2839 later get something which doesn't know where to put it. */
2840 default_common_section
= output
;
2845 /* Return TRUE iff target is the sought target. */
2848 get_target (const bfd_target
*target
, void *data
)
2850 const char *sought
= (const char *) data
;
2852 return strcmp (target
->name
, sought
) == 0;
2855 /* Like strcpy() but convert to lower case as well. */
2858 stricpy (char *dest
, char *src
)
2862 while ((c
= *src
++) != 0)
2863 *dest
++ = TOLOWER (c
);
2868 /* Remove the first occurrence of needle (if any) in haystack
2872 strcut (char *haystack
, char *needle
)
2874 haystack
= strstr (haystack
, needle
);
2880 for (src
= haystack
+ strlen (needle
); *src
;)
2881 *haystack
++ = *src
++;
2887 /* Compare two target format name strings.
2888 Return a value indicating how "similar" they are. */
2891 name_compare (char *first
, char *second
)
2897 copy1
= (char *) xmalloc (strlen (first
) + 1);
2898 copy2
= (char *) xmalloc (strlen (second
) + 1);
2900 /* Convert the names to lower case. */
2901 stricpy (copy1
, first
);
2902 stricpy (copy2
, second
);
2904 /* Remove size and endian strings from the name. */
2905 strcut (copy1
, "big");
2906 strcut (copy1
, "little");
2907 strcut (copy2
, "big");
2908 strcut (copy2
, "little");
2910 /* Return a value based on how many characters match,
2911 starting from the beginning. If both strings are
2912 the same then return 10 * their length. */
2913 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2914 if (copy1
[result
] == 0)
2926 /* Set by closest_target_match() below. */
2927 static const bfd_target
*winner
;
2929 /* Scan all the valid bfd targets looking for one that has the endianness
2930 requirement that was specified on the command line, and is the nearest
2931 match to the original output target. */
2934 closest_target_match (const bfd_target
*target
, void *data
)
2936 const bfd_target
*original
= (const bfd_target
*) data
;
2938 if (command_line
.endian
== ENDIAN_BIG
2939 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2942 if (command_line
.endian
== ENDIAN_LITTLE
2943 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2946 /* Must be the same flavour. */
2947 if (target
->flavour
!= original
->flavour
)
2950 /* Ignore generic big and little endian elf vectors. */
2951 if (strcmp (target
->name
, "elf32-big") == 0
2952 || strcmp (target
->name
, "elf64-big") == 0
2953 || strcmp (target
->name
, "elf32-little") == 0
2954 || strcmp (target
->name
, "elf64-little") == 0)
2957 /* If we have not found a potential winner yet, then record this one. */
2964 /* Oh dear, we now have two potential candidates for a successful match.
2965 Compare their names and choose the better one. */
2966 if (name_compare (target
->name
, original
->name
)
2967 > name_compare (winner
->name
, original
->name
))
2970 /* Keep on searching until wqe have checked them all. */
2974 /* Return the BFD target format of the first input file. */
2977 get_first_input_target (void)
2979 char *target
= NULL
;
2981 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2983 if (s
->header
.type
== lang_input_statement_enum
2986 ldfile_open_file (s
);
2988 if (s
->the_bfd
!= NULL
2989 && bfd_check_format (s
->the_bfd
, bfd_object
))
2991 target
= bfd_get_target (s
->the_bfd
);
3003 lang_get_output_target (void)
3007 /* Has the user told us which output format to use? */
3008 if (output_target
!= NULL
)
3009 return output_target
;
3011 /* No - has the current target been set to something other than
3013 if (current_target
!= default_target
)
3014 return current_target
;
3016 /* No - can we determine the format of the first input file? */
3017 target
= get_first_input_target ();
3021 /* Failed - use the default output target. */
3022 return default_target
;
3025 /* Open the output file. */
3028 open_output (const char *name
)
3030 output_target
= lang_get_output_target ();
3032 /* Has the user requested a particular endianness on the command
3034 if (command_line
.endian
!= ENDIAN_UNSET
)
3036 const bfd_target
*target
;
3037 enum bfd_endian desired_endian
;
3039 /* Get the chosen target. */
3040 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3042 /* If the target is not supported, we cannot do anything. */
3045 if (command_line
.endian
== ENDIAN_BIG
)
3046 desired_endian
= BFD_ENDIAN_BIG
;
3048 desired_endian
= BFD_ENDIAN_LITTLE
;
3050 /* See if the target has the wrong endianness. This should
3051 not happen if the linker script has provided big and
3052 little endian alternatives, but some scrips don't do
3054 if (target
->byteorder
!= desired_endian
)
3056 /* If it does, then see if the target provides
3057 an alternative with the correct endianness. */
3058 if (target
->alternative_target
!= NULL
3059 && (target
->alternative_target
->byteorder
== desired_endian
))
3060 output_target
= target
->alternative_target
->name
;
3063 /* Try to find a target as similar as possible to
3064 the default target, but which has the desired
3065 endian characteristic. */
3066 bfd_search_for_target (closest_target_match
,
3069 /* Oh dear - we could not find any targets that
3070 satisfy our requirements. */
3072 einfo (_("%P: warning: could not find any targets"
3073 " that match endianness requirement\n"));
3075 output_target
= winner
->name
;
3081 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3083 if (link_info
.output_bfd
== NULL
)
3085 if (bfd_get_error () == bfd_error_invalid_target
)
3086 einfo (_("%P%F: target %s not found\n"), output_target
);
3088 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3091 delete_output_file_on_failure
= TRUE
;
3093 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3094 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3095 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3096 ldfile_output_architecture
,
3097 ldfile_output_machine
))
3098 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3100 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3101 if (link_info
.hash
== NULL
)
3102 einfo (_("%P%F: can not create hash table: %E\n"));
3104 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3108 ldlang_open_output (lang_statement_union_type
*statement
)
3110 switch (statement
->header
.type
)
3112 case lang_output_statement_enum
:
3113 ASSERT (link_info
.output_bfd
== NULL
);
3114 open_output (statement
->output_statement
.name
);
3115 ldemul_set_output_arch ();
3116 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3117 link_info
.output_bfd
->flags
|= D_PAGED
;
3119 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3120 if (config
.text_read_only
)
3121 link_info
.output_bfd
->flags
|= WP_TEXT
;
3123 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3124 if (link_info
.traditional_format
)
3125 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3127 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3130 case lang_target_statement_enum
:
3131 current_target
= statement
->target_statement
.target
;
3138 /* Convert between addresses in bytes and sizes in octets.
3139 For currently supported targets, octets_per_byte is always a power
3140 of two, so we can use shifts. */
3141 #define TO_ADDR(X) ((X) >> opb_shift)
3142 #define TO_SIZE(X) ((X) << opb_shift)
3144 /* Support the above. */
3145 static unsigned int opb_shift
= 0;
3150 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3151 ldfile_output_machine
);
3154 while ((x
& 1) == 0)
3162 /* Open all the input files. */
3165 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
3167 for (; s
!= NULL
; s
= s
->header
.next
)
3169 switch (s
->header
.type
)
3171 case lang_constructors_statement_enum
:
3172 open_input_bfds (constructor_list
.head
, force
);
3174 case lang_output_section_statement_enum
:
3175 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
3177 case lang_wild_statement_enum
:
3178 /* Maybe we should load the file's symbols. */
3179 if (s
->wild_statement
.filename
3180 && !wildcardp (s
->wild_statement
.filename
)
3181 && !archive_path (s
->wild_statement
.filename
))
3182 lookup_name (s
->wild_statement
.filename
);
3183 open_input_bfds (s
->wild_statement
.children
.head
, force
);
3185 case lang_group_statement_enum
:
3187 struct bfd_link_hash_entry
*undefs
;
3189 /* We must continually search the entries in the group
3190 until no new symbols are added to the list of undefined
3195 undefs
= link_info
.hash
->undefs_tail
;
3196 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
3198 while (undefs
!= link_info
.hash
->undefs_tail
);
3201 case lang_target_statement_enum
:
3202 current_target
= s
->target_statement
.target
;
3204 case lang_input_statement_enum
:
3205 if (s
->input_statement
.real
)
3207 lang_statement_union_type
**os_tail
;
3208 lang_statement_list_type add
;
3210 s
->input_statement
.target
= current_target
;
3212 /* If we are being called from within a group, and this
3213 is an archive which has already been searched, then
3214 force it to be researched unless the whole archive
3215 has been loaded already. */
3217 && !s
->input_statement
.whole_archive
3218 && s
->input_statement
.loaded
3219 && bfd_check_format (s
->input_statement
.the_bfd
,
3221 s
->input_statement
.loaded
= FALSE
;
3223 os_tail
= lang_output_section_statement
.tail
;
3224 lang_list_init (&add
);
3226 if (! load_symbols (&s
->input_statement
, &add
))
3227 config
.make_executable
= FALSE
;
3229 if (add
.head
!= NULL
)
3231 /* If this was a script with output sections then
3232 tack any added statements on to the end of the
3233 list. This avoids having to reorder the output
3234 section statement list. Very likely the user
3235 forgot -T, and whatever we do here will not meet
3236 naive user expectations. */
3237 if (os_tail
!= lang_output_section_statement
.tail
)
3239 einfo (_("%P: warning: %s contains output sections;"
3240 " did you forget -T?\n"),
3241 s
->input_statement
.filename
);
3242 *stat_ptr
->tail
= add
.head
;
3243 stat_ptr
->tail
= add
.tail
;
3247 *add
.tail
= s
->header
.next
;
3248 s
->header
.next
= add
.head
;
3253 case lang_assignment_statement_enum
:
3254 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3261 /* Exit if any of the files were missing. */
3266 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3269 lang_track_definedness (const char *name
)
3271 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3272 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3275 /* New-function for the definedness hash table. */
3277 static struct bfd_hash_entry
*
3278 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3279 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3280 const char *name ATTRIBUTE_UNUSED
)
3282 struct lang_definedness_hash_entry
*ret
3283 = (struct lang_definedness_hash_entry
*) entry
;
3286 ret
= (struct lang_definedness_hash_entry
*)
3287 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3290 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3292 ret
->iteration
= -1;
3296 /* Return the iteration when the definition of NAME was last updated. A
3297 value of -1 means that the symbol is not defined in the linker script
3298 or the command line, but may be defined in the linker symbol table. */
3301 lang_symbol_definition_iteration (const char *name
)
3303 struct lang_definedness_hash_entry
*defentry
3304 = (struct lang_definedness_hash_entry
*)
3305 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3307 /* We've already created this one on the presence of DEFINED in the
3308 script, so it can't be NULL unless something is borked elsewhere in
3310 if (defentry
== NULL
)
3313 return defentry
->iteration
;
3316 /* Update the definedness state of NAME. */
3319 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3321 struct lang_definedness_hash_entry
*defentry
3322 = (struct lang_definedness_hash_entry
*)
3323 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3325 /* We don't keep track of symbols not tested with DEFINED. */
3326 if (defentry
== NULL
)
3329 /* If the symbol was already defined, and not from an earlier statement
3330 iteration, don't update the definedness iteration, because that'd
3331 make the symbol seem defined in the linker script at this point, and
3332 it wasn't; it was defined in some object. If we do anyway, DEFINED
3333 would start to yield false before this point and the construct "sym =
3334 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3336 if (h
->type
!= bfd_link_hash_undefined
3337 && h
->type
!= bfd_link_hash_common
3338 && h
->type
!= bfd_link_hash_new
3339 && defentry
->iteration
== -1)
3342 defentry
->iteration
= lang_statement_iteration
;
3345 /* Add the supplied name to the symbol table as an undefined reference.
3346 This is a two step process as the symbol table doesn't even exist at
3347 the time the ld command line is processed. First we put the name
3348 on a list, then, once the output file has been opened, transfer the
3349 name to the symbol table. */
3351 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3353 #define ldlang_undef_chain_list_head entry_symbol.next
3356 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3358 ldlang_undef_chain_list_type
*new_undef
;
3360 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3361 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3362 new_undef
->next
= ldlang_undef_chain_list_head
;
3363 ldlang_undef_chain_list_head
= new_undef
;
3365 new_undef
->name
= xstrdup (name
);
3367 if (link_info
.output_bfd
!= NULL
)
3368 insert_undefined (new_undef
->name
);
3371 /* Insert NAME as undefined in the symbol table. */
3374 insert_undefined (const char *name
)
3376 struct bfd_link_hash_entry
*h
;
3378 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3380 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3381 if (h
->type
== bfd_link_hash_new
)
3383 h
->type
= bfd_link_hash_undefined
;
3384 h
->u
.undef
.abfd
= NULL
;
3385 bfd_link_add_undef (link_info
.hash
, h
);
3389 /* Run through the list of undefineds created above and place them
3390 into the linker hash table as undefined symbols belonging to the
3394 lang_place_undefineds (void)
3396 ldlang_undef_chain_list_type
*ptr
;
3398 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3399 insert_undefined (ptr
->name
);
3402 /* Check for all readonly or some readwrite sections. */
3405 check_input_sections
3406 (lang_statement_union_type
*s
,
3407 lang_output_section_statement_type
*output_section_statement
)
3409 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3411 switch (s
->header
.type
)
3413 case lang_wild_statement_enum
:
3414 walk_wild (&s
->wild_statement
, check_section_callback
,
3415 output_section_statement
);
3416 if (! output_section_statement
->all_input_readonly
)
3419 case lang_constructors_statement_enum
:
3420 check_input_sections (constructor_list
.head
,
3421 output_section_statement
);
3422 if (! output_section_statement
->all_input_readonly
)
3425 case lang_group_statement_enum
:
3426 check_input_sections (s
->group_statement
.children
.head
,
3427 output_section_statement
);
3428 if (! output_section_statement
->all_input_readonly
)
3437 /* Update wildcard statements if needed. */
3440 update_wild_statements (lang_statement_union_type
*s
)
3442 struct wildcard_list
*sec
;
3444 switch (sort_section
)
3454 for (; s
!= NULL
; s
= s
->header
.next
)
3456 switch (s
->header
.type
)
3461 case lang_wild_statement_enum
:
3462 sec
= s
->wild_statement
.section_list
;
3463 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3466 switch (sec
->spec
.sorted
)
3469 sec
->spec
.sorted
= sort_section
;
3472 if (sort_section
== by_alignment
)
3473 sec
->spec
.sorted
= by_name_alignment
;
3476 if (sort_section
== by_name
)
3477 sec
->spec
.sorted
= by_alignment_name
;
3485 case lang_constructors_statement_enum
:
3486 update_wild_statements (constructor_list
.head
);
3489 case lang_output_section_statement_enum
:
3490 update_wild_statements
3491 (s
->output_section_statement
.children
.head
);
3494 case lang_group_statement_enum
:
3495 update_wild_statements (s
->group_statement
.children
.head
);
3503 /* Open input files and attach to output sections. */
3506 map_input_to_output_sections
3507 (lang_statement_union_type
*s
, const char *target
,
3508 lang_output_section_statement_type
*os
)
3510 for (; s
!= NULL
; s
= s
->header
.next
)
3512 lang_output_section_statement_type
*tos
;
3515 switch (s
->header
.type
)
3517 case lang_wild_statement_enum
:
3518 wild (&s
->wild_statement
, target
, os
);
3520 case lang_constructors_statement_enum
:
3521 map_input_to_output_sections (constructor_list
.head
,
3525 case lang_output_section_statement_enum
:
3526 tos
= &s
->output_section_statement
;
3527 if (tos
->constraint
!= 0)
3529 if (tos
->constraint
!= ONLY_IF_RW
3530 && tos
->constraint
!= ONLY_IF_RO
)
3532 tos
->all_input_readonly
= TRUE
;
3533 check_input_sections (tos
->children
.head
, tos
);
3534 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3536 tos
->constraint
= -1;
3540 map_input_to_output_sections (tos
->children
.head
,
3544 case lang_output_statement_enum
:
3546 case lang_target_statement_enum
:
3547 target
= s
->target_statement
.target
;
3549 case lang_group_statement_enum
:
3550 map_input_to_output_sections (s
->group_statement
.children
.head
,
3554 case lang_data_statement_enum
:
3555 /* Make sure that any sections mentioned in the expression
3557 exp_init_os (s
->data_statement
.exp
);
3558 /* The output section gets CONTENTS, ALLOC and LOAD, but
3559 these may be overridden by the script. */
3560 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3561 switch (os
->sectype
)
3563 case normal_section
:
3564 case overlay_section
:
3566 case noalloc_section
:
3567 flags
= SEC_HAS_CONTENTS
;
3569 case noload_section
:
3570 if (bfd_get_flavour (link_info
.output_bfd
)
3571 == bfd_target_elf_flavour
)
3572 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3574 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3577 if (os
->bfd_section
== NULL
)
3578 init_os (os
, flags
);
3580 os
->bfd_section
->flags
|= flags
;
3582 case lang_input_section_enum
:
3584 case lang_fill_statement_enum
:
3585 case lang_object_symbols_statement_enum
:
3586 case lang_reloc_statement_enum
:
3587 case lang_padding_statement_enum
:
3588 case lang_input_statement_enum
:
3589 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3592 case lang_assignment_statement_enum
:
3593 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3596 /* Make sure that any sections mentioned in the assignment
3598 exp_init_os (s
->assignment_statement
.exp
);
3600 case lang_address_statement_enum
:
3601 /* Mark the specified section with the supplied address.
3602 If this section was actually a segment marker, then the
3603 directive is ignored if the linker script explicitly
3604 processed the segment marker. Originally, the linker
3605 treated segment directives (like -Ttext on the
3606 command-line) as section directives. We honor the
3607 section directive semantics for backwards compatibilty;
3608 linker scripts that do not specifically check for
3609 SEGMENT_START automatically get the old semantics. */
3610 if (!s
->address_statement
.segment
3611 || !s
->address_statement
.segment
->used
)
3613 const char *name
= s
->address_statement
.section_name
;
3615 /* Create the output section statement here so that
3616 orphans with a set address will be placed after other
3617 script sections. If we let the orphan placement code
3618 place them in amongst other sections then the address
3619 will affect following script sections, which is
3620 likely to surprise naive users. */
3621 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3622 tos
->addr_tree
= s
->address_statement
.address
;
3623 if (tos
->bfd_section
== NULL
)
3627 case lang_insert_statement_enum
:
3633 /* An insert statement snips out all the linker statements from the
3634 start of the list and places them after the output section
3635 statement specified by the insert. This operation is complicated
3636 by the fact that we keep a doubly linked list of output section
3637 statements as well as the singly linked list of all statements. */
3640 process_insert_statements (void)
3642 lang_statement_union_type
**s
;
3643 lang_output_section_statement_type
*first_os
= NULL
;
3644 lang_output_section_statement_type
*last_os
= NULL
;
3645 lang_output_section_statement_type
*os
;
3647 /* "start of list" is actually the statement immediately after
3648 the special abs_section output statement, so that it isn't
3650 s
= &lang_output_section_statement
.head
;
3651 while (*(s
= &(*s
)->header
.next
) != NULL
)
3653 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3655 /* Keep pointers to the first and last output section
3656 statement in the sequence we may be about to move. */
3657 os
= &(*s
)->output_section_statement
;
3659 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3662 /* Set constraint negative so that lang_output_section_find
3663 won't match this output section statement. At this
3664 stage in linking constraint has values in the range
3665 [-1, ONLY_IN_RW]. */
3666 last_os
->constraint
= -2 - last_os
->constraint
;
3667 if (first_os
== NULL
)
3670 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3672 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3673 lang_output_section_statement_type
*where
;
3674 lang_statement_union_type
**ptr
;
3675 lang_statement_union_type
*first
;
3677 where
= lang_output_section_find (i
->where
);
3678 if (where
!= NULL
&& i
->is_before
)
3681 where
= where
->prev
;
3682 while (where
!= NULL
&& where
->constraint
< 0);
3686 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3690 /* Deal with reordering the output section statement list. */
3691 if (last_os
!= NULL
)
3693 asection
*first_sec
, *last_sec
;
3694 struct lang_output_section_statement_struct
**next
;
3696 /* Snip out the output sections we are moving. */
3697 first_os
->prev
->next
= last_os
->next
;
3698 if (last_os
->next
== NULL
)
3700 next
= &first_os
->prev
->next
;
3701 lang_output_section_statement
.tail
3702 = (lang_statement_union_type
**) next
;
3705 last_os
->next
->prev
= first_os
->prev
;
3706 /* Add them in at the new position. */
3707 last_os
->next
= where
->next
;
3708 if (where
->next
== NULL
)
3710 next
= &last_os
->next
;
3711 lang_output_section_statement
.tail
3712 = (lang_statement_union_type
**) next
;
3715 where
->next
->prev
= last_os
;
3716 first_os
->prev
= where
;
3717 where
->next
= first_os
;
3719 /* Move the bfd sections in the same way. */
3722 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3724 os
->constraint
= -2 - os
->constraint
;
3725 if (os
->bfd_section
!= NULL
3726 && os
->bfd_section
->owner
!= NULL
)
3728 last_sec
= os
->bfd_section
;
3729 if (first_sec
== NULL
)
3730 first_sec
= last_sec
;
3735 if (last_sec
!= NULL
)
3737 asection
*sec
= where
->bfd_section
;
3739 sec
= output_prev_sec_find (where
);
3741 /* The place we want to insert must come after the
3742 sections we are moving. So if we find no
3743 section or if the section is the same as our
3744 last section, then no move is needed. */
3745 if (sec
!= NULL
&& sec
!= last_sec
)
3747 /* Trim them off. */
3748 if (first_sec
->prev
!= NULL
)
3749 first_sec
->prev
->next
= last_sec
->next
;
3751 link_info
.output_bfd
->sections
= last_sec
->next
;
3752 if (last_sec
->next
!= NULL
)
3753 last_sec
->next
->prev
= first_sec
->prev
;
3755 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3757 last_sec
->next
= sec
->next
;
3758 if (sec
->next
!= NULL
)
3759 sec
->next
->prev
= last_sec
;
3761 link_info
.output_bfd
->section_last
= last_sec
;
3762 first_sec
->prev
= sec
;
3763 sec
->next
= first_sec
;
3771 ptr
= insert_os_after (where
);
3772 /* Snip everything after the abs_section output statement we
3773 know is at the start of the list, up to and including
3774 the insert statement we are currently processing. */
3775 first
= lang_output_section_statement
.head
->header
.next
;
3776 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3777 /* Add them back where they belong. */
3780 statement_list
.tail
= s
;
3782 s
= &lang_output_section_statement
.head
;
3786 /* Undo constraint twiddling. */
3787 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3789 os
->constraint
= -2 - os
->constraint
;
3795 /* An output section might have been removed after its statement was
3796 added. For example, ldemul_before_allocation can remove dynamic
3797 sections if they turn out to be not needed. Clean them up here. */
3800 strip_excluded_output_sections (void)
3802 lang_output_section_statement_type
*os
;
3804 /* Run lang_size_sections (if not already done). */
3805 if (expld
.phase
!= lang_mark_phase_enum
)
3807 expld
.phase
= lang_mark_phase_enum
;
3808 expld
.dataseg
.phase
= exp_dataseg_none
;
3809 one_lang_size_sections_pass (NULL
, FALSE
);
3810 lang_reset_memory_regions ();
3813 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3817 asection
*output_section
;
3818 bfd_boolean exclude
;
3820 if (os
->constraint
< 0)
3823 output_section
= os
->bfd_section
;
3824 if (output_section
== NULL
)
3827 exclude
= (output_section
->rawsize
== 0
3828 && (output_section
->flags
& SEC_KEEP
) == 0
3829 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3832 /* Some sections have not yet been sized, notably .gnu.version,
3833 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3834 input sections, so don't drop output sections that have such
3835 input sections unless they are also marked SEC_EXCLUDE. */
3836 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3840 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3841 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3842 && (s
->flags
& SEC_EXCLUDE
) == 0)
3849 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3850 output_section
->map_head
.link_order
= NULL
;
3851 output_section
->map_tail
.link_order
= NULL
;
3855 /* We don't set bfd_section to NULL since bfd_section of the
3856 removed output section statement may still be used. */
3857 if (!os
->section_relative_symbol
3858 && !os
->update_dot_tree
)
3860 output_section
->flags
|= SEC_EXCLUDE
;
3861 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3862 link_info
.output_bfd
->section_count
--;
3866 /* Stop future calls to lang_add_section from messing with map_head
3867 and map_tail link_order fields. */
3868 stripped_excluded_sections
= TRUE
;
3872 print_output_section_statement
3873 (lang_output_section_statement_type
*output_section_statement
)
3875 asection
*section
= output_section_statement
->bfd_section
;
3878 if (output_section_statement
!= abs_output_section
)
3880 minfo ("\n%s", output_section_statement
->name
);
3882 if (section
!= NULL
)
3884 print_dot
= section
->vma
;
3886 len
= strlen (output_section_statement
->name
);
3887 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3892 while (len
< SECTION_NAME_MAP_LENGTH
)
3898 minfo ("0x%V %W", section
->vma
, section
->size
);
3900 if (section
->vma
!= section
->lma
)
3901 minfo (_(" load address 0x%V"), section
->lma
);
3903 if (output_section_statement
->update_dot_tree
!= NULL
)
3904 exp_fold_tree (output_section_statement
->update_dot_tree
,
3905 bfd_abs_section_ptr
, &print_dot
);
3911 print_statement_list (output_section_statement
->children
.head
,
3912 output_section_statement
);
3915 /* Scan for the use of the destination in the right hand side
3916 of an expression. In such cases we will not compute the
3917 correct expression, since the value of DST that is used on
3918 the right hand side will be its final value, not its value
3919 just before this expression is evaluated. */
3922 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3924 if (rhs
== NULL
|| dst
== NULL
)
3927 switch (rhs
->type
.node_class
)
3930 return (scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3931 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
));
3934 return (scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3935 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
));
3938 case etree_provided
:
3940 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3942 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3945 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3949 return strcmp (dst
, rhs
->value
.str
) == 0;
3954 return strcmp (dst
, rhs
->name
.name
) == 0;
3966 print_assignment (lang_assignment_statement_type
*assignment
,
3967 lang_output_section_statement_type
*output_section
)
3971 bfd_boolean computation_is_valid
= TRUE
;
3975 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3978 if (assignment
->exp
->type
.node_class
== etree_assert
)
3981 tree
= assignment
->exp
->assert_s
.child
;
3982 computation_is_valid
= TRUE
;
3986 const char *dst
= assignment
->exp
->assign
.dst
;
3988 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3989 tree
= assignment
->exp
->assign
.src
;
3990 computation_is_valid
= is_dot
|| !scan_for_self_assignment (dst
, tree
);
3993 osec
= output_section
->bfd_section
;
3995 osec
= bfd_abs_section_ptr
;
3996 exp_fold_tree (tree
, osec
, &print_dot
);
3997 if (expld
.result
.valid_p
)
4001 if (computation_is_valid
)
4003 value
= expld
.result
.value
;
4005 if (expld
.result
.section
!= NULL
)
4006 value
+= expld
.result
.section
->vma
;
4008 minfo ("0x%V", value
);
4014 struct bfd_link_hash_entry
*h
;
4016 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4017 FALSE
, FALSE
, TRUE
);
4020 value
= h
->u
.def
.value
;
4022 if (expld
.result
.section
!= NULL
)
4023 value
+= expld
.result
.section
->vma
;
4025 minfo ("[0x%V]", value
);
4028 minfo ("[unresolved]");
4040 exp_print_tree (assignment
->exp
);
4045 print_input_statement (lang_input_statement_type
*statm
)
4047 if (statm
->filename
!= NULL
4048 && (statm
->the_bfd
== NULL
4049 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4050 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4053 /* Print all symbols defined in a particular section. This is called
4054 via bfd_link_hash_traverse, or by print_all_symbols. */
4057 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4059 asection
*sec
= (asection
*) ptr
;
4061 if ((hash_entry
->type
== bfd_link_hash_defined
4062 || hash_entry
->type
== bfd_link_hash_defweak
)
4063 && sec
== hash_entry
->u
.def
.section
)
4067 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4070 (hash_entry
->u
.def
.value
4071 + hash_entry
->u
.def
.section
->output_offset
4072 + hash_entry
->u
.def
.section
->output_section
->vma
));
4074 minfo (" %T\n", hash_entry
->root
.string
);
4081 hash_entry_addr_cmp (const void *a
, const void *b
)
4083 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4084 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4086 if (l
->u
.def
.value
< r
->u
.def
.value
)
4088 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4095 print_all_symbols (asection
*sec
)
4097 struct fat_user_section_struct
*ud
=
4098 (struct fat_user_section_struct
*) get_userdata (sec
);
4099 struct map_symbol_def
*def
;
4100 struct bfd_link_hash_entry
**entries
;
4106 *ud
->map_symbol_def_tail
= 0;
4108 /* Sort the symbols by address. */
4109 entries
= (struct bfd_link_hash_entry
**)
4110 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4112 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4113 entries
[i
] = def
->entry
;
4115 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4116 hash_entry_addr_cmp
);
4118 /* Print the symbols. */
4119 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4120 print_one_symbol (entries
[i
], sec
);
4122 obstack_free (&map_obstack
, entries
);
4125 /* Print information about an input section to the map file. */
4128 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4130 bfd_size_type size
= i
->size
;
4137 minfo ("%s", i
->name
);
4139 len
= 1 + strlen (i
->name
);
4140 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4145 while (len
< SECTION_NAME_MAP_LENGTH
)
4151 if (i
->output_section
!= NULL
4152 && i
->output_section
->owner
== link_info
.output_bfd
)
4153 addr
= i
->output_section
->vma
+ i
->output_offset
;
4161 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4163 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4165 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4177 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4180 if (i
->output_section
!= NULL
4181 && i
->output_section
->owner
== link_info
.output_bfd
)
4183 if (link_info
.reduce_memory_overheads
)
4184 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4186 print_all_symbols (i
);
4188 /* Update print_dot, but make sure that we do not move it
4189 backwards - this could happen if we have overlays and a
4190 later overlay is shorter than an earier one. */
4191 if (addr
+ TO_ADDR (size
) > print_dot
)
4192 print_dot
= addr
+ TO_ADDR (size
);
4197 print_fill_statement (lang_fill_statement_type
*fill
)
4201 fputs (" FILL mask 0x", config
.map_file
);
4202 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4203 fprintf (config
.map_file
, "%02x", *p
);
4204 fputs ("\n", config
.map_file
);
4208 print_data_statement (lang_data_statement_type
*data
)
4216 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4219 addr
= data
->output_offset
;
4220 if (data
->output_section
!= NULL
)
4221 addr
+= data
->output_section
->vma
;
4249 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4251 if (data
->exp
->type
.node_class
!= etree_value
)
4254 exp_print_tree (data
->exp
);
4259 print_dot
= addr
+ TO_ADDR (size
);
4262 /* Print an address statement. These are generated by options like
4266 print_address_statement (lang_address_statement_type
*address
)
4268 minfo (_("Address of section %s set to "), address
->section_name
);
4269 exp_print_tree (address
->address
);
4273 /* Print a reloc statement. */
4276 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4283 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4286 addr
= reloc
->output_offset
;
4287 if (reloc
->output_section
!= NULL
)
4288 addr
+= reloc
->output_section
->vma
;
4290 size
= bfd_get_reloc_size (reloc
->howto
);
4292 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4294 if (reloc
->name
!= NULL
)
4295 minfo ("%s+", reloc
->name
);
4297 minfo ("%s+", reloc
->section
->name
);
4299 exp_print_tree (reloc
->addend_exp
);
4303 print_dot
= addr
+ TO_ADDR (size
);
4307 print_padding_statement (lang_padding_statement_type
*s
)
4315 len
= sizeof " *fill*" - 1;
4316 while (len
< SECTION_NAME_MAP_LENGTH
)
4322 addr
= s
->output_offset
;
4323 if (s
->output_section
!= NULL
)
4324 addr
+= s
->output_section
->vma
;
4325 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4327 if (s
->fill
->size
!= 0)
4331 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4332 fprintf (config
.map_file
, "%02x", *p
);
4337 print_dot
= addr
+ TO_ADDR (s
->size
);
4341 print_wild_statement (lang_wild_statement_type
*w
,
4342 lang_output_section_statement_type
*os
)
4344 struct wildcard_list
*sec
;
4348 if (w
->filenames_sorted
)
4350 if (w
->filename
!= NULL
)
4351 minfo ("%s", w
->filename
);
4354 if (w
->filenames_sorted
)
4358 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4360 if (sec
->spec
.sorted
)
4362 if (sec
->spec
.exclude_name_list
!= NULL
)
4365 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4366 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4367 minfo (" %s", tmp
->name
);
4370 if (sec
->spec
.name
!= NULL
)
4371 minfo ("%s", sec
->spec
.name
);
4374 if (sec
->spec
.sorted
)
4383 print_statement_list (w
->children
.head
, os
);
4386 /* Print a group statement. */
4389 print_group (lang_group_statement_type
*s
,
4390 lang_output_section_statement_type
*os
)
4392 fprintf (config
.map_file
, "START GROUP\n");
4393 print_statement_list (s
->children
.head
, os
);
4394 fprintf (config
.map_file
, "END GROUP\n");
4397 /* Print the list of statements in S.
4398 This can be called for any statement type. */
4401 print_statement_list (lang_statement_union_type
*s
,
4402 lang_output_section_statement_type
*os
)
4406 print_statement (s
, os
);
4411 /* Print the first statement in statement list S.
4412 This can be called for any statement type. */
4415 print_statement (lang_statement_union_type
*s
,
4416 lang_output_section_statement_type
*os
)
4418 switch (s
->header
.type
)
4421 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4424 case lang_constructors_statement_enum
:
4425 if (constructor_list
.head
!= NULL
)
4427 if (constructors_sorted
)
4428 minfo (" SORT (CONSTRUCTORS)\n");
4430 minfo (" CONSTRUCTORS\n");
4431 print_statement_list (constructor_list
.head
, os
);
4434 case lang_wild_statement_enum
:
4435 print_wild_statement (&s
->wild_statement
, os
);
4437 case lang_address_statement_enum
:
4438 print_address_statement (&s
->address_statement
);
4440 case lang_object_symbols_statement_enum
:
4441 minfo (" CREATE_OBJECT_SYMBOLS\n");
4443 case lang_fill_statement_enum
:
4444 print_fill_statement (&s
->fill_statement
);
4446 case lang_data_statement_enum
:
4447 print_data_statement (&s
->data_statement
);
4449 case lang_reloc_statement_enum
:
4450 print_reloc_statement (&s
->reloc_statement
);
4452 case lang_input_section_enum
:
4453 print_input_section (s
->input_section
.section
, FALSE
);
4455 case lang_padding_statement_enum
:
4456 print_padding_statement (&s
->padding_statement
);
4458 case lang_output_section_statement_enum
:
4459 print_output_section_statement (&s
->output_section_statement
);
4461 case lang_assignment_statement_enum
:
4462 print_assignment (&s
->assignment_statement
, os
);
4464 case lang_target_statement_enum
:
4465 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4467 case lang_output_statement_enum
:
4468 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4469 if (output_target
!= NULL
)
4470 minfo (" %s", output_target
);
4473 case lang_input_statement_enum
:
4474 print_input_statement (&s
->input_statement
);
4476 case lang_group_statement_enum
:
4477 print_group (&s
->group_statement
, os
);
4479 case lang_insert_statement_enum
:
4480 minfo ("INSERT %s %s\n",
4481 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4482 s
->insert_statement
.where
);
4488 print_statements (void)
4490 print_statement_list (statement_list
.head
, abs_output_section
);
4493 /* Print the first N statements in statement list S to STDERR.
4494 If N == 0, nothing is printed.
4495 If N < 0, the entire list is printed.
4496 Intended to be called from GDB. */
4499 dprint_statement (lang_statement_union_type
*s
, int n
)
4501 FILE *map_save
= config
.map_file
;
4503 config
.map_file
= stderr
;
4506 print_statement_list (s
, abs_output_section
);
4509 while (s
&& --n
>= 0)
4511 print_statement (s
, abs_output_section
);
4516 config
.map_file
= map_save
;
4520 insert_pad (lang_statement_union_type
**ptr
,
4522 unsigned int alignment_needed
,
4523 asection
*output_section
,
4526 static fill_type zero_fill
= { 1, { 0 } };
4527 lang_statement_union_type
*pad
= NULL
;
4529 if (ptr
!= &statement_list
.head
)
4530 pad
= ((lang_statement_union_type
*)
4531 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4533 && pad
->header
.type
== lang_padding_statement_enum
4534 && pad
->padding_statement
.output_section
== output_section
)
4536 /* Use the existing pad statement. */
4538 else if ((pad
= *ptr
) != NULL
4539 && pad
->header
.type
== lang_padding_statement_enum
4540 && pad
->padding_statement
.output_section
== output_section
)
4542 /* Use the existing pad statement. */
4546 /* Make a new padding statement, linked into existing chain. */
4547 pad
= (lang_statement_union_type
*)
4548 stat_alloc (sizeof (lang_padding_statement_type
));
4549 pad
->header
.next
= *ptr
;
4551 pad
->header
.type
= lang_padding_statement_enum
;
4552 pad
->padding_statement
.output_section
= output_section
;
4555 pad
->padding_statement
.fill
= fill
;
4557 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4558 pad
->padding_statement
.size
= alignment_needed
;
4559 output_section
->size
+= alignment_needed
;
4562 /* Work out how much this section will move the dot point. */
4566 (lang_statement_union_type
**this_ptr
,
4567 lang_output_section_statement_type
*output_section_statement
,
4571 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4572 asection
*i
= is
->section
;
4574 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4575 && (i
->flags
& SEC_EXCLUDE
) == 0)
4577 unsigned int alignment_needed
;
4580 /* Align this section first to the input sections requirement,
4581 then to the output section's requirement. If this alignment
4582 is greater than any seen before, then record it too. Perform
4583 the alignment by inserting a magic 'padding' statement. */
4585 if (output_section_statement
->subsection_alignment
!= -1)
4586 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4588 o
= output_section_statement
->bfd_section
;
4589 if (o
->alignment_power
< i
->alignment_power
)
4590 o
->alignment_power
= i
->alignment_power
;
4592 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4594 if (alignment_needed
!= 0)
4596 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4597 dot
+= alignment_needed
;
4600 /* Remember where in the output section this input section goes. */
4602 i
->output_offset
= dot
- o
->vma
;
4604 /* Mark how big the output section must be to contain this now. */
4605 dot
+= TO_ADDR (i
->size
);
4606 o
->size
= TO_SIZE (dot
- o
->vma
);
4610 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4617 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4619 const asection
*sec1
= *(const asection
**) arg1
;
4620 const asection
*sec2
= *(const asection
**) arg2
;
4622 if (bfd_section_lma (sec1
->owner
, sec1
)
4623 < bfd_section_lma (sec2
->owner
, sec2
))
4625 else if (bfd_section_lma (sec1
->owner
, sec1
)
4626 > bfd_section_lma (sec2
->owner
, sec2
))
4628 else if (sec1
->id
< sec2
->id
)
4630 else if (sec1
->id
> sec2
->id
)
4636 #define IGNORE_SECTION(s) \
4637 ((s->flags & SEC_ALLOC) == 0 \
4638 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4639 && (s->flags & SEC_LOAD) == 0))
4641 /* Check to see if any allocated sections overlap with other allocated
4642 sections. This can happen if a linker script specifies the output
4643 section addresses of the two sections. Also check whether any memory
4644 region has overflowed. */
4647 lang_check_section_addresses (void)
4650 asection
**sections
, **spp
;
4657 lang_memory_region_type
*m
;
4659 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4662 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4663 sections
= (asection
**) xmalloc (amt
);
4665 /* Scan all sections in the output list. */
4667 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4669 /* Only consider loadable sections with real contents. */
4670 if (!(s
->flags
& SEC_LOAD
)
4671 || !(s
->flags
& SEC_ALLOC
)
4675 sections
[count
] = s
;
4682 qsort (sections
, (size_t) count
, sizeof (asection
*),
4683 sort_sections_by_lma
);
4688 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4689 for (count
--; count
; count
--)
4691 /* We must check the sections' LMA addresses not their VMA
4692 addresses because overlay sections can have overlapping VMAs
4693 but they must have distinct LMAs. */
4699 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4701 /* Look for an overlap. We have sorted sections by lma, so we
4702 know that s_start >= p_start. Besides the obvious case of
4703 overlap when the current section starts before the previous
4704 one ends, we also must have overlap if the previous section
4705 wraps around the address space. */
4706 if (s_start
<= p_end
4708 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4709 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4714 /* If any memory region has overflowed, report by how much.
4715 We do not issue this diagnostic for regions that had sections
4716 explicitly placed outside their bounds; os_region_check's
4717 diagnostics are adequate for that case.
4719 FIXME: It is conceivable that m->current - (m->origin + m->length)
4720 might overflow a 32-bit integer. There is, alas, no way to print
4721 a bfd_vma quantity in decimal. */
4722 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4723 if (m
->had_full_message
)
4724 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4725 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4729 /* Make sure the new address is within the region. We explicitly permit the
4730 current address to be at the exact end of the region when the address is
4731 non-zero, in case the region is at the end of addressable memory and the
4732 calculation wraps around. */
4735 os_region_check (lang_output_section_statement_type
*os
,
4736 lang_memory_region_type
*region
,
4740 if ((region
->current
< region
->origin
4741 || (region
->current
- region
->origin
> region
->length
))
4742 && ((region
->current
!= region
->origin
+ region
->length
)
4747 einfo (_("%X%P: address 0x%v of %B section `%s'"
4748 " is not within region `%s'\n"),
4750 os
->bfd_section
->owner
,
4751 os
->bfd_section
->name
,
4752 region
->name_list
.name
);
4754 else if (!region
->had_full_message
)
4756 region
->had_full_message
= TRUE
;
4758 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4759 os
->bfd_section
->owner
,
4760 os
->bfd_section
->name
,
4761 region
->name_list
.name
);
4766 /* Set the sizes for all the output sections. */
4769 lang_size_sections_1
4770 (lang_statement_union_type
**prev
,
4771 lang_output_section_statement_type
*output_section_statement
,
4775 bfd_boolean check_regions
)
4777 lang_statement_union_type
*s
;
4779 /* Size up the sections from their constituent parts. */
4780 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4782 switch (s
->header
.type
)
4784 case lang_output_section_statement_enum
:
4786 bfd_vma newdot
, after
;
4787 lang_output_section_statement_type
*os
;
4788 lang_memory_region_type
*r
;
4789 int section_alignment
= 0;
4791 os
= &s
->output_section_statement
;
4792 if (os
->constraint
== -1)
4795 /* FIXME: We shouldn't need to zero section vmas for ld -r
4796 here, in lang_insert_orphan, or in the default linker scripts.
4797 This is covering for coff backend linker bugs. See PR6945. */
4798 if (os
->addr_tree
== NULL
4799 && link_info
.relocatable
4800 && (bfd_get_flavour (link_info
.output_bfd
)
4801 == bfd_target_coff_flavour
))
4802 os
->addr_tree
= exp_intop (0);
4803 if (os
->addr_tree
!= NULL
)
4805 os
->processed_vma
= FALSE
;
4806 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4808 if (expld
.result
.valid_p
)
4810 dot
= expld
.result
.value
;
4811 if (expld
.result
.section
!= NULL
)
4812 dot
+= expld
.result
.section
->vma
;
4814 else if (expld
.phase
!= lang_mark_phase_enum
)
4815 einfo (_("%F%S: non constant or forward reference"
4816 " address expression for section %s\n"),
4820 if (os
->bfd_section
== NULL
)
4821 /* This section was removed or never actually created. */
4824 /* If this is a COFF shared library section, use the size and
4825 address from the input section. FIXME: This is COFF
4826 specific; it would be cleaner if there were some other way
4827 to do this, but nothing simple comes to mind. */
4828 if (((bfd_get_flavour (link_info
.output_bfd
)
4829 == bfd_target_ecoff_flavour
)
4830 || (bfd_get_flavour (link_info
.output_bfd
)
4831 == bfd_target_coff_flavour
))
4832 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4836 if (os
->children
.head
== NULL
4837 || os
->children
.head
->header
.next
!= NULL
4838 || (os
->children
.head
->header
.type
4839 != lang_input_section_enum
))
4840 einfo (_("%P%X: Internal error on COFF shared library"
4841 " section %s\n"), os
->name
);
4843 input
= os
->children
.head
->input_section
.section
;
4844 bfd_set_section_vma (os
->bfd_section
->owner
,
4846 bfd_section_vma (input
->owner
, input
));
4847 os
->bfd_section
->size
= input
->size
;
4852 if (bfd_is_abs_section (os
->bfd_section
))
4854 /* No matter what happens, an abs section starts at zero. */
4855 ASSERT (os
->bfd_section
->vma
== 0);
4859 if (os
->addr_tree
== NULL
)
4861 /* No address specified for this section, get one
4862 from the region specification. */
4863 if (os
->region
== NULL
4864 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4865 && os
->region
->name_list
.name
[0] == '*'
4866 && strcmp (os
->region
->name_list
.name
,
4867 DEFAULT_MEMORY_REGION
) == 0))
4869 os
->region
= lang_memory_default (os
->bfd_section
);
4872 /* If a loadable section is using the default memory
4873 region, and some non default memory regions were
4874 defined, issue an error message. */
4876 && !IGNORE_SECTION (os
->bfd_section
)
4877 && ! link_info
.relocatable
4879 && strcmp (os
->region
->name_list
.name
,
4880 DEFAULT_MEMORY_REGION
) == 0
4881 && lang_memory_region_list
!= NULL
4882 && (strcmp (lang_memory_region_list
->name_list
.name
,
4883 DEFAULT_MEMORY_REGION
) != 0
4884 || lang_memory_region_list
->next
!= NULL
)
4885 && expld
.phase
!= lang_mark_phase_enum
)
4887 /* By default this is an error rather than just a
4888 warning because if we allocate the section to the
4889 default memory region we can end up creating an
4890 excessively large binary, or even seg faulting when
4891 attempting to perform a negative seek. See
4892 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4893 for an example of this. This behaviour can be
4894 overridden by the using the --no-check-sections
4896 if (command_line
.check_section_addresses
)
4897 einfo (_("%P%F: error: no memory region specified"
4898 " for loadable section `%s'\n"),
4899 bfd_get_section_name (link_info
.output_bfd
,
4902 einfo (_("%P: warning: no memory region specified"
4903 " for loadable section `%s'\n"),
4904 bfd_get_section_name (link_info
.output_bfd
,
4908 newdot
= os
->region
->current
;
4909 section_alignment
= os
->bfd_section
->alignment_power
;
4912 section_alignment
= os
->section_alignment
;
4914 /* Align to what the section needs. */
4915 if (section_alignment
> 0)
4917 bfd_vma savedot
= newdot
;
4918 newdot
= align_power (newdot
, section_alignment
);
4920 if (newdot
!= savedot
4921 && (config
.warn_section_align
4922 || os
->addr_tree
!= NULL
)
4923 && expld
.phase
!= lang_mark_phase_enum
)
4924 einfo (_("%P: warning: changing start of section"
4925 " %s by %lu bytes\n"),
4926 os
->name
, (unsigned long) (newdot
- savedot
));
4929 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4931 os
->bfd_section
->output_offset
= 0;
4934 lang_size_sections_1 (&os
->children
.head
, os
,
4935 os
->fill
, newdot
, relax
, check_regions
);
4937 os
->processed_vma
= TRUE
;
4939 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4940 /* Except for some special linker created sections,
4941 no output section should change from zero size
4942 after strip_excluded_output_sections. A non-zero
4943 size on an ignored section indicates that some
4944 input section was not sized early enough. */
4945 ASSERT (os
->bfd_section
->size
== 0);
4948 dot
= os
->bfd_section
->vma
;
4950 /* Put the section within the requested block size, or
4951 align at the block boundary. */
4953 + TO_ADDR (os
->bfd_section
->size
)
4954 + os
->block_value
- 1)
4955 & - (bfd_vma
) os
->block_value
);
4957 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4960 /* Set section lma. */
4963 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4967 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4968 os
->bfd_section
->lma
= lma
;
4970 else if (os
->lma_region
!= NULL
)
4972 bfd_vma lma
= os
->lma_region
->current
;
4974 if (section_alignment
> 0)
4975 lma
= align_power (lma
, section_alignment
);
4976 os
->bfd_section
->lma
= lma
;
4978 else if (r
->last_os
!= NULL
4979 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4984 last
= r
->last_os
->output_section_statement
.bfd_section
;
4986 /* A backwards move of dot should be accompanied by
4987 an explicit assignment to the section LMA (ie.
4988 os->load_base set) because backwards moves can
4989 create overlapping LMAs. */
4991 && os
->bfd_section
->size
!= 0
4992 && dot
+ os
->bfd_section
->size
<= last
->vma
)
4994 /* If dot moved backwards then leave lma equal to
4995 vma. This is the old default lma, which might
4996 just happen to work when the backwards move is
4997 sufficiently large. Nag if this changes anything,
4998 so people can fix their linker scripts. */
5000 if (last
->vma
!= last
->lma
)
5001 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5006 /* If this is an overlay, set the current lma to that
5007 at the end of the previous section. */
5008 if (os
->sectype
== overlay_section
)
5009 lma
= last
->lma
+ last
->size
;
5011 /* Otherwise, keep the same lma to vma relationship
5012 as the previous section. */
5014 lma
= dot
+ last
->lma
- last
->vma
;
5016 if (section_alignment
> 0)
5017 lma
= align_power (lma
, section_alignment
);
5018 os
->bfd_section
->lma
= lma
;
5021 os
->processed_lma
= TRUE
;
5023 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5026 /* Keep track of normal sections using the default
5027 lma region. We use this to set the lma for
5028 following sections. Overlays or other linker
5029 script assignment to lma might mean that the
5030 default lma == vma is incorrect.
5031 To avoid warnings about dot moving backwards when using
5032 -Ttext, don't start tracking sections until we find one
5033 of non-zero size or with lma set differently to vma. */
5034 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5035 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5036 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5037 && (os
->bfd_section
->size
!= 0
5038 || (r
->last_os
== NULL
5039 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5040 || (r
->last_os
!= NULL
5041 && dot
>= (r
->last_os
->output_section_statement
5042 .bfd_section
->vma
)))
5043 && os
->lma_region
== NULL
5044 && !link_info
.relocatable
)
5047 /* .tbss sections effectively have zero size. */
5048 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5049 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5050 || link_info
.relocatable
)
5051 dot
+= TO_ADDR (os
->bfd_section
->size
);
5053 if (os
->update_dot_tree
!= 0)
5054 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5056 /* Update dot in the region ?
5057 We only do this if the section is going to be allocated,
5058 since unallocated sections do not contribute to the region's
5059 overall size in memory. */
5060 if (os
->region
!= NULL
5061 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5063 os
->region
->current
= dot
;
5066 /* Make sure the new address is within the region. */
5067 os_region_check (os
, os
->region
, os
->addr_tree
,
5068 os
->bfd_section
->vma
);
5070 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5071 && (os
->bfd_section
->flags
& SEC_LOAD
))
5073 os
->lma_region
->current
5074 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5077 os_region_check (os
, os
->lma_region
, NULL
,
5078 os
->bfd_section
->lma
);
5084 case lang_constructors_statement_enum
:
5085 dot
= lang_size_sections_1 (&constructor_list
.head
,
5086 output_section_statement
,
5087 fill
, dot
, relax
, check_regions
);
5090 case lang_data_statement_enum
:
5092 unsigned int size
= 0;
5094 s
->data_statement
.output_offset
=
5095 dot
- output_section_statement
->bfd_section
->vma
;
5096 s
->data_statement
.output_section
=
5097 output_section_statement
->bfd_section
;
5099 /* We might refer to provided symbols in the expression, and
5100 need to mark them as needed. */
5101 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5103 switch (s
->data_statement
.type
)
5121 if (size
< TO_SIZE ((unsigned) 1))
5122 size
= TO_SIZE ((unsigned) 1);
5123 dot
+= TO_ADDR (size
);
5124 output_section_statement
->bfd_section
->size
+= size
;
5128 case lang_reloc_statement_enum
:
5132 s
->reloc_statement
.output_offset
=
5133 dot
- output_section_statement
->bfd_section
->vma
;
5134 s
->reloc_statement
.output_section
=
5135 output_section_statement
->bfd_section
;
5136 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5137 dot
+= TO_ADDR (size
);
5138 output_section_statement
->bfd_section
->size
+= size
;
5142 case lang_wild_statement_enum
:
5143 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5144 output_section_statement
,
5145 fill
, dot
, relax
, check_regions
);
5148 case lang_object_symbols_statement_enum
:
5149 link_info
.create_object_symbols_section
=
5150 output_section_statement
->bfd_section
;
5153 case lang_output_statement_enum
:
5154 case lang_target_statement_enum
:
5157 case lang_input_section_enum
:
5161 i
= s
->input_section
.section
;
5166 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5167 einfo (_("%P%F: can't relax section: %E\n"));
5171 dot
= size_input_section (prev
, output_section_statement
,
5172 output_section_statement
->fill
, dot
);
5176 case lang_input_statement_enum
:
5179 case lang_fill_statement_enum
:
5180 s
->fill_statement
.output_section
=
5181 output_section_statement
->bfd_section
;
5183 fill
= s
->fill_statement
.fill
;
5186 case lang_assignment_statement_enum
:
5188 bfd_vma newdot
= dot
;
5189 etree_type
*tree
= s
->assignment_statement
.exp
;
5191 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5193 exp_fold_tree (tree
,
5194 output_section_statement
->bfd_section
,
5197 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5199 if (!expld
.dataseg
.relro_start_stat
)
5200 expld
.dataseg
.relro_start_stat
= s
;
5203 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5206 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5208 if (!expld
.dataseg
.relro_end_stat
)
5209 expld
.dataseg
.relro_end_stat
= s
;
5212 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5215 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5217 /* This symbol is relative to this section. */
5218 if ((tree
->type
.node_class
== etree_provided
5219 || tree
->type
.node_class
== etree_assign
)
5220 && (tree
->assign
.dst
[0] != '.'
5221 || tree
->assign
.dst
[1] != '\0'))
5222 output_section_statement
->section_relative_symbol
= 1;
5224 if (!output_section_statement
->ignored
)
5226 if (output_section_statement
== abs_output_section
)
5228 /* If we don't have an output section, then just adjust
5229 the default memory address. */
5230 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5231 FALSE
)->current
= newdot
;
5233 else if (newdot
!= dot
)
5235 /* Insert a pad after this statement. We can't
5236 put the pad before when relaxing, in case the
5237 assignment references dot. */
5238 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5239 output_section_statement
->bfd_section
, dot
);
5241 /* Don't neuter the pad below when relaxing. */
5244 /* If dot is advanced, this implies that the section
5245 should have space allocated to it, unless the
5246 user has explicitly stated that the section
5247 should not be allocated. */
5248 if (output_section_statement
->sectype
!= noalloc_section
5249 && (output_section_statement
->sectype
!= noload_section
5250 || (bfd_get_flavour (link_info
.output_bfd
)
5251 == bfd_target_elf_flavour
)))
5252 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5259 case lang_padding_statement_enum
:
5260 /* If this is the first time lang_size_sections is called,
5261 we won't have any padding statements. If this is the
5262 second or later passes when relaxing, we should allow
5263 padding to shrink. If padding is needed on this pass, it
5264 will be added back in. */
5265 s
->padding_statement
.size
= 0;
5267 /* Make sure output_offset is valid. If relaxation shrinks
5268 the section and this pad isn't needed, it's possible to
5269 have output_offset larger than the final size of the
5270 section. bfd_set_section_contents will complain even for
5271 a pad size of zero. */
5272 s
->padding_statement
.output_offset
5273 = dot
- output_section_statement
->bfd_section
->vma
;
5276 case lang_group_statement_enum
:
5277 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5278 output_section_statement
,
5279 fill
, dot
, relax
, check_regions
);
5282 case lang_insert_statement_enum
:
5285 /* We can only get here when relaxing is turned on. */
5286 case lang_address_statement_enum
:
5293 prev
= &s
->header
.next
;
5298 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5299 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5300 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5301 segments. We are allowed an opportunity to override this decision. */
5304 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5305 bfd
* abfd ATTRIBUTE_UNUSED
,
5306 asection
* current_section
,
5307 asection
* previous_section
,
5308 bfd_boolean new_segment
)
5310 lang_output_section_statement_type
* cur
;
5311 lang_output_section_statement_type
* prev
;
5313 /* The checks below are only necessary when the BFD library has decided
5314 that the two sections ought to be placed into the same segment. */
5318 /* Paranoia checks. */
5319 if (current_section
== NULL
|| previous_section
== NULL
)
5322 /* Find the memory regions associated with the two sections.
5323 We call lang_output_section_find() here rather than scanning the list
5324 of output sections looking for a matching section pointer because if
5325 we have a large number of sections then a hash lookup is faster. */
5326 cur
= lang_output_section_find (current_section
->name
);
5327 prev
= lang_output_section_find (previous_section
->name
);
5329 /* More paranoia. */
5330 if (cur
== NULL
|| prev
== NULL
)
5333 /* If the regions are different then force the sections to live in
5334 different segments. See the email thread starting at the following
5335 URL for the reasons why this is necessary:
5336 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5337 return cur
->region
!= prev
->region
;
5341 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5343 lang_statement_iteration
++;
5344 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5345 0, 0, relax
, check_regions
);
5349 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5351 expld
.phase
= lang_allocating_phase_enum
;
5352 expld
.dataseg
.phase
= exp_dataseg_none
;
5354 one_lang_size_sections_pass (relax
, check_regions
);
5355 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5356 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5358 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5359 to put expld.dataseg.relro on a (common) page boundary. */
5360 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5362 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5363 maxpage
= expld
.dataseg
.maxpagesize
;
5364 /* MIN_BASE is the absolute minimum address we are allowed to start the
5365 read-write segment (byte before will be mapped read-only). */
5366 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5367 /* OLD_BASE is the address for a feasible minimum address which will
5368 still not cause a data overlap inside MAXPAGE causing file offset skip
5370 old_base
= expld
.dataseg
.base
;
5371 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5372 & (expld
.dataseg
.pagesize
- 1));
5373 /* Compute the expected PT_GNU_RELRO segment end. */
5374 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5375 & ~(expld
.dataseg
.pagesize
- 1));
5376 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5378 expld
.dataseg
.base
-= maxpage
;
5379 relro_end
-= maxpage
;
5381 lang_reset_memory_regions ();
5382 one_lang_size_sections_pass (relax
, check_regions
);
5383 if (expld
.dataseg
.relro_end
> relro_end
)
5385 /* The alignment of sections between DATA_SEGMENT_ALIGN
5386 and DATA_SEGMENT_RELRO_END caused huge padding to be
5387 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5388 that the section alignments will fit in. */
5390 unsigned int max_alignment_power
= 0;
5392 /* Find maximum alignment power of sections between
5393 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5394 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5395 if (sec
->vma
>= expld
.dataseg
.base
5396 && sec
->vma
< expld
.dataseg
.relro_end
5397 && sec
->alignment_power
> max_alignment_power
)
5398 max_alignment_power
= sec
->alignment_power
;
5400 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5402 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5403 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5404 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5405 lang_reset_memory_regions ();
5406 one_lang_size_sections_pass (relax
, check_regions
);
5409 link_info
.relro_start
= expld
.dataseg
.base
;
5410 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5412 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5414 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5415 a page could be saved in the data segment. */
5416 bfd_vma first
, last
;
5418 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5419 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5421 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5422 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5423 && first
+ last
<= expld
.dataseg
.pagesize
)
5425 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5426 lang_reset_memory_regions ();
5427 one_lang_size_sections_pass (relax
, check_regions
);
5431 expld
.phase
= lang_final_phase_enum
;
5434 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5437 lang_do_assignments_1 (lang_statement_union_type
*s
,
5438 lang_output_section_statement_type
*current_os
,
5442 for (; s
!= NULL
; s
= s
->header
.next
)
5444 switch (s
->header
.type
)
5446 case lang_constructors_statement_enum
:
5447 dot
= lang_do_assignments_1 (constructor_list
.head
,
5448 current_os
, fill
, dot
);
5451 case lang_output_section_statement_enum
:
5453 lang_output_section_statement_type
*os
;
5455 os
= &(s
->output_section_statement
);
5456 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5458 dot
= os
->bfd_section
->vma
;
5460 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5462 /* .tbss sections effectively have zero size. */
5463 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5464 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5465 || link_info
.relocatable
)
5466 dot
+= TO_ADDR (os
->bfd_section
->size
);
5468 if (os
->update_dot_tree
!= NULL
)
5469 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5474 case lang_wild_statement_enum
:
5476 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5477 current_os
, fill
, dot
);
5480 case lang_object_symbols_statement_enum
:
5481 case lang_output_statement_enum
:
5482 case lang_target_statement_enum
:
5485 case lang_data_statement_enum
:
5486 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5487 if (expld
.result
.valid_p
)
5489 s
->data_statement
.value
= expld
.result
.value
;
5490 if (expld
.result
.section
!= NULL
)
5491 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5494 einfo (_("%F%P: invalid data statement\n"));
5497 switch (s
->data_statement
.type
)
5515 if (size
< TO_SIZE ((unsigned) 1))
5516 size
= TO_SIZE ((unsigned) 1);
5517 dot
+= TO_ADDR (size
);
5521 case lang_reloc_statement_enum
:
5522 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5523 bfd_abs_section_ptr
, &dot
);
5524 if (expld
.result
.valid_p
)
5525 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5527 einfo (_("%F%P: invalid reloc statement\n"));
5528 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5531 case lang_input_section_enum
:
5533 asection
*in
= s
->input_section
.section
;
5535 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5536 dot
+= TO_ADDR (in
->size
);
5540 case lang_input_statement_enum
:
5543 case lang_fill_statement_enum
:
5544 fill
= s
->fill_statement
.fill
;
5547 case lang_assignment_statement_enum
:
5548 exp_fold_tree (s
->assignment_statement
.exp
,
5549 current_os
->bfd_section
,
5553 case lang_padding_statement_enum
:
5554 dot
+= TO_ADDR (s
->padding_statement
.size
);
5557 case lang_group_statement_enum
:
5558 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5559 current_os
, fill
, dot
);
5562 case lang_insert_statement_enum
:
5565 case lang_address_statement_enum
:
5577 lang_do_assignments (void)
5579 lang_statement_iteration
++;
5580 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5583 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5584 operator .startof. (section_name), it produces an undefined symbol
5585 .startof.section_name. Similarly, when it sees
5586 .sizeof. (section_name), it produces an undefined symbol
5587 .sizeof.section_name. For all the output sections, we look for
5588 such symbols, and set them to the correct value. */
5591 lang_set_startof (void)
5595 if (link_info
.relocatable
)
5598 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5600 const char *secname
;
5602 struct bfd_link_hash_entry
*h
;
5604 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5605 buf
= (char *) xmalloc (10 + strlen (secname
));
5607 sprintf (buf
, ".startof.%s", secname
);
5608 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5609 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5611 h
->type
= bfd_link_hash_defined
;
5612 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5613 h
->u
.def
.section
= bfd_abs_section_ptr
;
5616 sprintf (buf
, ".sizeof.%s", secname
);
5617 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5618 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5620 h
->type
= bfd_link_hash_defined
;
5621 h
->u
.def
.value
= TO_ADDR (s
->size
);
5622 h
->u
.def
.section
= bfd_abs_section_ptr
;
5632 struct bfd_link_hash_entry
*h
;
5635 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5636 || (link_info
.shared
&& !link_info
.executable
))
5637 warn
= entry_from_cmdline
;
5641 /* Force the user to specify a root when generating a relocatable with
5643 if (link_info
.gc_sections
&& link_info
.relocatable
5644 && !(entry_from_cmdline
|| undef_from_cmdline
))
5645 einfo (_("%P%F: gc-sections requires either an entry or "
5646 "an undefined symbol\n"));
5648 if (entry_symbol
.name
== NULL
)
5650 /* No entry has been specified. Look for the default entry, but
5651 don't warn if we don't find it. */
5652 entry_symbol
.name
= entry_symbol_default
;
5656 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5657 FALSE
, FALSE
, TRUE
);
5659 && (h
->type
== bfd_link_hash_defined
5660 || h
->type
== bfd_link_hash_defweak
)
5661 && h
->u
.def
.section
->output_section
!= NULL
)
5665 val
= (h
->u
.def
.value
5666 + bfd_get_section_vma (link_info
.output_bfd
,
5667 h
->u
.def
.section
->output_section
)
5668 + h
->u
.def
.section
->output_offset
);
5669 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5670 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5677 /* We couldn't find the entry symbol. Try parsing it as a
5679 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5682 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5683 einfo (_("%P%F: can't set start address\n"));
5689 /* Can't find the entry symbol, and it's not a number. Use
5690 the first address in the text section. */
5691 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5695 einfo (_("%P: warning: cannot find entry symbol %s;"
5696 " defaulting to %V\n"),
5698 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5699 if (!(bfd_set_start_address
5700 (link_info
.output_bfd
,
5701 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5702 einfo (_("%P%F: can't set start address\n"));
5707 einfo (_("%P: warning: cannot find entry symbol %s;"
5708 " not setting start address\n"),
5714 /* Don't bfd_hash_table_free (&lang_definedness_table);
5715 map file output may result in a call of lang_track_definedness. */
5718 /* This is a small function used when we want to ignore errors from
5722 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5724 /* Don't do anything. */
5727 /* Check that the architecture of all the input files is compatible
5728 with the output file. Also call the backend to let it do any
5729 other checking that is needed. */
5734 lang_statement_union_type
*file
;
5736 const bfd_arch_info_type
*compatible
;
5738 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5740 input_bfd
= file
->input_statement
.the_bfd
;
5742 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5743 command_line
.accept_unknown_input_arch
);
5745 /* In general it is not possible to perform a relocatable
5746 link between differing object formats when the input
5747 file has relocations, because the relocations in the
5748 input format may not have equivalent representations in
5749 the output format (and besides BFD does not translate
5750 relocs for other link purposes than a final link). */
5751 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5752 && (compatible
== NULL
5753 || (bfd_get_flavour (input_bfd
)
5754 != bfd_get_flavour (link_info
.output_bfd
)))
5755 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5757 einfo (_("%P%F: Relocatable linking with relocations from"
5758 " format %s (%B) to format %s (%B) is not supported\n"),
5759 bfd_get_target (input_bfd
), input_bfd
,
5760 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5761 /* einfo with %F exits. */
5764 if (compatible
== NULL
)
5766 if (command_line
.warn_mismatch
)
5767 einfo (_("%P%X: %s architecture of input file `%B'"
5768 " is incompatible with %s output\n"),
5769 bfd_printable_name (input_bfd
), input_bfd
,
5770 bfd_printable_name (link_info
.output_bfd
));
5772 else if (bfd_count_sections (input_bfd
))
5774 /* If the input bfd has no contents, it shouldn't set the
5775 private data of the output bfd. */
5777 bfd_error_handler_type pfn
= NULL
;
5779 /* If we aren't supposed to warn about mismatched input
5780 files, temporarily set the BFD error handler to a
5781 function which will do nothing. We still want to call
5782 bfd_merge_private_bfd_data, since it may set up
5783 information which is needed in the output file. */
5784 if (! command_line
.warn_mismatch
)
5785 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5786 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5788 if (command_line
.warn_mismatch
)
5789 einfo (_("%P%X: failed to merge target specific data"
5790 " of file %B\n"), input_bfd
);
5792 if (! command_line
.warn_mismatch
)
5793 bfd_set_error_handler (pfn
);
5798 /* Look through all the global common symbols and attach them to the
5799 correct section. The -sort-common command line switch may be used
5800 to roughly sort the entries by alignment. */
5805 if (command_line
.inhibit_common_definition
)
5807 if (link_info
.relocatable
5808 && ! command_line
.force_common_definition
)
5811 if (! config
.sort_common
)
5812 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5817 if (config
.sort_common
== sort_descending
)
5819 for (power
= 4; power
> 0; power
--)
5820 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5823 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5827 for (power
= 0; power
<= 4; power
++)
5828 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5831 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5836 /* Place one common symbol in the correct section. */
5839 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5841 unsigned int power_of_two
;
5845 if (h
->type
!= bfd_link_hash_common
)
5849 power_of_two
= h
->u
.c
.p
->alignment_power
;
5851 if (config
.sort_common
== sort_descending
5852 && power_of_two
< *(unsigned int *) info
)
5854 else if (config
.sort_common
== sort_ascending
5855 && power_of_two
> *(unsigned int *) info
)
5858 section
= h
->u
.c
.p
->section
;
5859 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
5860 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5863 if (config
.map_file
!= NULL
)
5865 static bfd_boolean header_printed
;
5870 if (! header_printed
)
5872 minfo (_("\nAllocating common symbols\n"));
5873 minfo (_("Common symbol size file\n\n"));
5874 header_printed
= TRUE
;
5877 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5878 DMGL_ANSI
| DMGL_PARAMS
);
5881 minfo ("%s", h
->root
.string
);
5882 len
= strlen (h
->root
.string
);
5887 len
= strlen (name
);
5903 if (size
<= 0xffffffff)
5904 sprintf (buf
, "%lx", (unsigned long) size
);
5906 sprintf_vma (buf
, size
);
5916 minfo ("%B\n", section
->owner
);
5922 /* Run through the input files and ensure that every input section has
5923 somewhere to go. If one is found without a destination then create
5924 an input request and place it into the statement tree. */
5927 lang_place_orphans (void)
5929 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5933 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5935 if (s
->output_section
== NULL
)
5937 /* This section of the file is not attached, root
5938 around for a sensible place for it to go. */
5940 if (file
->just_syms_flag
)
5941 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5942 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5943 s
->output_section
= bfd_abs_section_ptr
;
5944 else if (strcmp (s
->name
, "COMMON") == 0)
5946 /* This is a lonely common section which must have
5947 come from an archive. We attach to the section
5948 with the wildcard. */
5949 if (! link_info
.relocatable
5950 || command_line
.force_common_definition
)
5952 if (default_common_section
== NULL
)
5953 default_common_section
5954 = lang_output_section_statement_lookup (".bss", 0,
5956 lang_add_section (&default_common_section
->children
, s
,
5957 default_common_section
);
5962 const char *name
= s
->name
;
5965 if (config
.unique_orphan_sections
5966 || unique_section_p (s
, NULL
))
5967 constraint
= SPECIAL
;
5969 if (!ldemul_place_orphan (s
, name
, constraint
))
5971 lang_output_section_statement_type
*os
;
5972 os
= lang_output_section_statement_lookup (name
,
5975 if (os
->addr_tree
== NULL
5976 && (link_info
.relocatable
5977 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
5978 os
->addr_tree
= exp_intop (0);
5979 lang_add_section (&os
->children
, s
, os
);
5988 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5990 flagword
*ptr_flags
;
5992 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5998 *ptr_flags
|= SEC_ALLOC
;
6002 *ptr_flags
|= SEC_READONLY
;
6006 *ptr_flags
|= SEC_DATA
;
6010 *ptr_flags
|= SEC_CODE
;
6015 *ptr_flags
|= SEC_LOAD
;
6019 einfo (_("%P%F: invalid syntax in flags\n"));
6026 /* Call a function on each input file. This function will be called
6027 on an archive, but not on the elements. */
6030 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6032 lang_input_statement_type
*f
;
6034 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6036 f
= (lang_input_statement_type
*) f
->next_real_file
)
6040 /* Call a function on each file. The function will be called on all
6041 the elements of an archive which are included in the link, but will
6042 not be called on the archive file itself. */
6045 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6047 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6054 ldlang_add_file (lang_input_statement_type
*entry
)
6056 lang_statement_append (&file_chain
,
6057 (lang_statement_union_type
*) entry
,
6060 /* The BFD linker needs to have a list of all input BFDs involved in
6062 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6063 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6065 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6066 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6067 entry
->the_bfd
->usrdata
= entry
;
6068 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6070 /* Look through the sections and check for any which should not be
6071 included in the link. We need to do this now, so that we can
6072 notice when the backend linker tries to report multiple
6073 definition errors for symbols which are in sections we aren't
6074 going to link. FIXME: It might be better to entirely ignore
6075 symbols which are defined in sections which are going to be
6076 discarded. This would require modifying the backend linker for
6077 each backend which might set the SEC_LINK_ONCE flag. If we do
6078 this, we should probably handle SEC_EXCLUDE in the same way. */
6080 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6084 lang_add_output (const char *name
, int from_script
)
6086 /* Make -o on command line override OUTPUT in script. */
6087 if (!had_output_filename
|| !from_script
)
6089 output_filename
= name
;
6090 had_output_filename
= TRUE
;
6094 static lang_output_section_statement_type
*current_section
;
6105 for (l
= 0; l
< 32; l
++)
6107 if (i
>= (unsigned int) x
)
6115 lang_output_section_statement_type
*
6116 lang_enter_output_section_statement (const char *output_section_statement_name
,
6117 etree_type
*address_exp
,
6118 enum section_type sectype
,
6120 etree_type
*subalign
,
6124 lang_output_section_statement_type
*os
;
6126 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6128 current_section
= os
;
6130 if (os
->addr_tree
== NULL
)
6132 os
->addr_tree
= address_exp
;
6134 os
->sectype
= sectype
;
6135 if (sectype
!= noload_section
)
6136 os
->flags
= SEC_NO_FLAGS
;
6138 os
->flags
= SEC_NEVER_LOAD
;
6139 os
->block_value
= 1;
6141 /* Make next things chain into subchain of this. */
6142 push_stat_ptr (&os
->children
);
6144 os
->subsection_alignment
=
6145 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6146 os
->section_alignment
=
6147 topower (exp_get_value_int (align
, -1, "section alignment"));
6149 os
->load_base
= ebase
;
6156 lang_output_statement_type
*new_stmt
;
6158 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6159 new_stmt
->name
= output_filename
;
6163 /* Reset the current counters in the regions. */
6166 lang_reset_memory_regions (void)
6168 lang_memory_region_type
*p
= lang_memory_region_list
;
6170 lang_output_section_statement_type
*os
;
6172 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6174 p
->current
= p
->origin
;
6178 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6182 os
->processed_vma
= FALSE
;
6183 os
->processed_lma
= FALSE
;
6186 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6188 /* Save the last size for possible use by bfd_relax_section. */
6189 o
->rawsize
= o
->size
;
6194 /* Worker for lang_gc_sections_1. */
6197 gc_section_callback (lang_wild_statement_type
*ptr
,
6198 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6200 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6201 void *data ATTRIBUTE_UNUSED
)
6203 /* If the wild pattern was marked KEEP, the member sections
6204 should be as well. */
6205 if (ptr
->keep_sections
)
6206 section
->flags
|= SEC_KEEP
;
6209 /* Iterate over sections marking them against GC. */
6212 lang_gc_sections_1 (lang_statement_union_type
*s
)
6214 for (; s
!= NULL
; s
= s
->header
.next
)
6216 switch (s
->header
.type
)
6218 case lang_wild_statement_enum
:
6219 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6221 case lang_constructors_statement_enum
:
6222 lang_gc_sections_1 (constructor_list
.head
);
6224 case lang_output_section_statement_enum
:
6225 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6227 case lang_group_statement_enum
:
6228 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6237 lang_gc_sections (void)
6239 /* Keep all sections so marked in the link script. */
6241 lang_gc_sections_1 (statement_list
.head
);
6243 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6244 the special case of debug info. (See bfd/stabs.c)
6245 Twiddle the flag here, to simplify later linker code. */
6246 if (link_info
.relocatable
)
6248 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6251 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6252 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6253 sec
->flags
&= ~SEC_EXCLUDE
;
6257 if (link_info
.gc_sections
)
6258 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6261 /* Worker for lang_find_relro_sections_1. */
6264 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6265 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6267 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6270 /* Discarded, excluded and ignored sections effectively have zero
6272 if (section
->output_section
!= NULL
6273 && section
->output_section
->owner
== link_info
.output_bfd
6274 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6275 && !IGNORE_SECTION (section
)
6276 && section
->size
!= 0)
6278 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6279 *has_relro_section
= TRUE
;
6283 /* Iterate over sections for relro sections. */
6286 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6287 bfd_boolean
*has_relro_section
)
6289 if (*has_relro_section
)
6292 for (; s
!= NULL
; s
= s
->header
.next
)
6294 if (s
== expld
.dataseg
.relro_end_stat
)
6297 switch (s
->header
.type
)
6299 case lang_wild_statement_enum
:
6300 walk_wild (&s
->wild_statement
,
6301 find_relro_section_callback
,
6304 case lang_constructors_statement_enum
:
6305 lang_find_relro_sections_1 (constructor_list
.head
,
6308 case lang_output_section_statement_enum
:
6309 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6312 case lang_group_statement_enum
:
6313 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6323 lang_find_relro_sections (void)
6325 bfd_boolean has_relro_section
= FALSE
;
6327 /* Check all sections in the link script. */
6329 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6330 &has_relro_section
);
6332 if (!has_relro_section
)
6333 link_info
.relro
= FALSE
;
6336 /* Relax all sections until bfd_relax_section gives up. */
6339 lang_relax_sections (bfd_boolean need_layout
)
6341 if (RELAXATION_ENABLED
)
6343 /* We may need more than one relaxation pass. */
6344 int i
= link_info
.relax_pass
;
6346 /* The backend can use it to determine the current pass. */
6347 link_info
.relax_pass
= 0;
6351 /* Keep relaxing until bfd_relax_section gives up. */
6352 bfd_boolean relax_again
;
6354 link_info
.relax_trip
= -1;
6357 link_info
.relax_trip
++;
6359 /* Note: pe-dll.c does something like this also. If you find
6360 you need to change this code, you probably need to change
6361 pe-dll.c also. DJ */
6363 /* Do all the assignments with our current guesses as to
6365 lang_do_assignments ();
6367 /* We must do this after lang_do_assignments, because it uses
6369 lang_reset_memory_regions ();
6371 /* Perform another relax pass - this time we know where the
6372 globals are, so can make a better guess. */
6373 relax_again
= FALSE
;
6374 lang_size_sections (&relax_again
, FALSE
);
6376 while (relax_again
);
6378 link_info
.relax_pass
++;
6385 /* Final extra sizing to report errors. */
6386 lang_do_assignments ();
6387 lang_reset_memory_regions ();
6388 lang_size_sections (NULL
, TRUE
);
6395 /* Finalize dynamic list. */
6396 if (link_info
.dynamic_list
)
6397 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6399 current_target
= default_target
;
6401 /* Open the output file. */
6402 lang_for_each_statement (ldlang_open_output
);
6405 ldemul_create_output_section_statements ();
6407 /* Add to the hash table all undefineds on the command line. */
6408 lang_place_undefineds ();
6410 if (!bfd_section_already_linked_table_init ())
6411 einfo (_("%P%F: Failed to create hash table\n"));
6413 /* Create a bfd for each input file. */
6414 current_target
= default_target
;
6415 open_input_bfds (statement_list
.head
, FALSE
);
6417 #ifdef ENABLE_PLUGINS
6419 union lang_statement_union
**listend
;
6420 /* Now all files are read, let the plugin(s) decide if there
6421 are any more to be added to the link before we call the
6422 emulation's after_open hook. */
6423 listend
= statement_list
.tail
;
6425 if (plugin_call_all_symbols_read ())
6426 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6427 plugin_error_plugin ());
6428 /* If any new files were added, they will be on the end of the
6429 statement list, and we can open them now by getting open_input_bfds
6430 to carry on from where it ended last time. */
6432 open_input_bfds (*listend
, FALSE
);
6434 #endif /* ENABLE_PLUGINS */
6436 link_info
.gc_sym_list
= &entry_symbol
;
6437 if (entry_symbol
.name
== NULL
)
6438 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6440 ldemul_after_open ();
6442 bfd_section_already_linked_table_free ();
6444 /* Make sure that we're not mixing architectures. We call this
6445 after all the input files have been opened, but before we do any
6446 other processing, so that any operations merge_private_bfd_data
6447 does on the output file will be known during the rest of the
6451 /* Handle .exports instead of a version script if we're told to do so. */
6452 if (command_line
.version_exports_section
)
6453 lang_do_version_exports_section ();
6455 /* Build all sets based on the information gathered from the input
6457 ldctor_build_sets ();
6459 /* Remove unreferenced sections if asked to. */
6460 lang_gc_sections ();
6462 /* Size up the common data. */
6465 /* Update wild statements. */
6466 update_wild_statements (statement_list
.head
);
6468 /* Run through the contours of the script and attach input sections
6469 to the correct output sections. */
6470 lang_statement_iteration
++;
6471 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6473 process_insert_statements ();
6475 /* Find any sections not attached explicitly and handle them. */
6476 lang_place_orphans ();
6478 if (! link_info
.relocatable
)
6482 /* Merge SEC_MERGE sections. This has to be done after GC of
6483 sections, so that GCed sections are not merged, but before
6484 assigning dynamic symbols, since removing whole input sections
6486 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6488 /* Look for a text section and set the readonly attribute in it. */
6489 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6493 if (config
.text_read_only
)
6494 found
->flags
|= SEC_READONLY
;
6496 found
->flags
&= ~SEC_READONLY
;
6500 /* Do anything special before sizing sections. This is where ELF
6501 and other back-ends size dynamic sections. */
6502 ldemul_before_allocation ();
6504 /* We must record the program headers before we try to fix the
6505 section positions, since they will affect SIZEOF_HEADERS. */
6506 lang_record_phdrs ();
6508 /* Check relro sections. */
6509 if (link_info
.relro
&& ! link_info
.relocatable
)
6510 lang_find_relro_sections ();
6512 /* Size up the sections. */
6513 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6515 /* See if anything special should be done now we know how big
6516 everything is. This is where relaxation is done. */
6517 ldemul_after_allocation ();
6519 /* Fix any .startof. or .sizeof. symbols. */
6520 lang_set_startof ();
6522 /* Do all the assignments, now that we know the final resting places
6523 of all the symbols. */
6525 lang_do_assignments ();
6529 /* Make sure that the section addresses make sense. */
6530 if (command_line
.check_section_addresses
)
6531 lang_check_section_addresses ();
6536 /* EXPORTED TO YACC */
6539 lang_add_wild (struct wildcard_spec
*filespec
,
6540 struct wildcard_list
*section_list
,
6541 bfd_boolean keep_sections
)
6543 struct wildcard_list
*curr
, *next
;
6544 lang_wild_statement_type
*new_stmt
;
6546 /* Reverse the list as the parser puts it back to front. */
6547 for (curr
= section_list
, section_list
= NULL
;
6549 section_list
= curr
, curr
= next
)
6551 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6552 placed_commons
= TRUE
;
6555 curr
->next
= section_list
;
6558 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6560 if (strcmp (filespec
->name
, "*") == 0)
6561 filespec
->name
= NULL
;
6562 else if (! wildcardp (filespec
->name
))
6563 lang_has_input_file
= TRUE
;
6566 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6567 new_stmt
->filename
= NULL
;
6568 new_stmt
->filenames_sorted
= FALSE
;
6569 if (filespec
!= NULL
)
6571 new_stmt
->filename
= filespec
->name
;
6572 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6574 new_stmt
->section_list
= section_list
;
6575 new_stmt
->keep_sections
= keep_sections
;
6576 lang_list_init (&new_stmt
->children
);
6577 analyze_walk_wild_section_handler (new_stmt
);
6581 lang_section_start (const char *name
, etree_type
*address
,
6582 const segment_type
*segment
)
6584 lang_address_statement_type
*ad
;
6586 ad
= new_stat (lang_address_statement
, stat_ptr
);
6587 ad
->section_name
= name
;
6588 ad
->address
= address
;
6589 ad
->segment
= segment
;
6592 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6593 because of a -e argument on the command line, or zero if this is
6594 called by ENTRY in a linker script. Command line arguments take
6598 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6600 if (entry_symbol
.name
== NULL
6602 || ! entry_from_cmdline
)
6604 entry_symbol
.name
= name
;
6605 entry_from_cmdline
= cmdline
;
6609 /* Set the default start symbol to NAME. .em files should use this,
6610 not lang_add_entry, to override the use of "start" if neither the
6611 linker script nor the command line specifies an entry point. NAME
6612 must be permanently allocated. */
6614 lang_default_entry (const char *name
)
6616 entry_symbol_default
= name
;
6620 lang_add_target (const char *name
)
6622 lang_target_statement_type
*new_stmt
;
6624 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6625 new_stmt
->target
= name
;
6629 lang_add_map (const char *name
)
6636 map_option_f
= TRUE
;
6644 lang_add_fill (fill_type
*fill
)
6646 lang_fill_statement_type
*new_stmt
;
6648 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6649 new_stmt
->fill
= fill
;
6653 lang_add_data (int type
, union etree_union
*exp
)
6655 lang_data_statement_type
*new_stmt
;
6657 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6658 new_stmt
->exp
= exp
;
6659 new_stmt
->type
= type
;
6662 /* Create a new reloc statement. RELOC is the BFD relocation type to
6663 generate. HOWTO is the corresponding howto structure (we could
6664 look this up, but the caller has already done so). SECTION is the
6665 section to generate a reloc against, or NAME is the name of the
6666 symbol to generate a reloc against. Exactly one of SECTION and
6667 NAME must be NULL. ADDEND is an expression for the addend. */
6670 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6671 reloc_howto_type
*howto
,
6674 union etree_union
*addend
)
6676 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6680 p
->section
= section
;
6682 p
->addend_exp
= addend
;
6684 p
->addend_value
= 0;
6685 p
->output_section
= NULL
;
6686 p
->output_offset
= 0;
6689 lang_assignment_statement_type
*
6690 lang_add_assignment (etree_type
*exp
)
6692 lang_assignment_statement_type
*new_stmt
;
6694 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6695 new_stmt
->exp
= exp
;
6700 lang_add_attribute (enum statement_enum attribute
)
6702 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6706 lang_startup (const char *name
)
6708 if (startup_file
!= NULL
)
6710 einfo (_("%P%F: multiple STARTUP files\n"));
6712 first_file
->filename
= name
;
6713 first_file
->local_sym_name
= name
;
6714 first_file
->real
= TRUE
;
6716 startup_file
= name
;
6720 lang_float (bfd_boolean maybe
)
6722 lang_float_flag
= maybe
;
6726 /* Work out the load- and run-time regions from a script statement, and
6727 store them in *LMA_REGION and *REGION respectively.
6729 MEMSPEC is the name of the run-time region, or the value of
6730 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6731 LMA_MEMSPEC is the name of the load-time region, or null if the
6732 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6733 had an explicit load address.
6735 It is an error to specify both a load region and a load address. */
6738 lang_get_regions (lang_memory_region_type
**region
,
6739 lang_memory_region_type
**lma_region
,
6740 const char *memspec
,
6741 const char *lma_memspec
,
6742 bfd_boolean have_lma
,
6743 bfd_boolean have_vma
)
6745 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6747 /* If no runtime region or VMA has been specified, but the load region
6748 has been specified, then use the load region for the runtime region
6750 if (lma_memspec
!= NULL
6752 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6753 *region
= *lma_region
;
6755 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6757 if (have_lma
&& lma_memspec
!= 0)
6758 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6762 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6763 lang_output_section_phdr_list
*phdrs
,
6764 const char *lma_memspec
)
6766 lang_get_regions (¤t_section
->region
,
6767 ¤t_section
->lma_region
,
6768 memspec
, lma_memspec
,
6769 current_section
->load_base
!= NULL
,
6770 current_section
->addr_tree
!= NULL
);
6772 /* If this section has no load region or base, but has the same
6773 region as the previous section, then propagate the previous
6774 section's load region. */
6776 if (!current_section
->lma_region
&& !current_section
->load_base
6777 && current_section
->region
== current_section
->prev
->region
)
6778 current_section
->lma_region
= current_section
->prev
->lma_region
;
6780 current_section
->fill
= fill
;
6781 current_section
->phdrs
= phdrs
;
6785 /* Create an absolute symbol with the given name with the value of the
6786 address of first byte of the section named.
6788 If the symbol already exists, then do nothing. */
6791 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6793 struct bfd_link_hash_entry
*h
;
6795 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6797 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6799 if (h
->type
== bfd_link_hash_new
6800 || h
->type
== bfd_link_hash_undefined
)
6804 h
->type
= bfd_link_hash_defined
;
6806 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6810 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6812 h
->u
.def
.section
= bfd_abs_section_ptr
;
6816 /* Create an absolute symbol with the given name with the value of the
6817 address of the first byte after the end of the section named.
6819 If the symbol already exists, then do nothing. */
6822 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6824 struct bfd_link_hash_entry
*h
;
6826 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6828 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6830 if (h
->type
== bfd_link_hash_new
6831 || h
->type
== bfd_link_hash_undefined
)
6835 h
->type
= bfd_link_hash_defined
;
6837 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6841 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
6842 + TO_ADDR (sec
->size
));
6844 h
->u
.def
.section
= bfd_abs_section_ptr
;
6849 lang_statement_append (lang_statement_list_type
*list
,
6850 lang_statement_union_type
*element
,
6851 lang_statement_union_type
**field
)
6853 *(list
->tail
) = element
;
6857 /* Set the output format type. -oformat overrides scripts. */
6860 lang_add_output_format (const char *format
,
6865 if (output_target
== NULL
|| !from_script
)
6867 if (command_line
.endian
== ENDIAN_BIG
6870 else if (command_line
.endian
== ENDIAN_LITTLE
6874 output_target
= format
;
6879 lang_add_insert (const char *where
, int is_before
)
6881 lang_insert_statement_type
*new_stmt
;
6883 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
6884 new_stmt
->where
= where
;
6885 new_stmt
->is_before
= is_before
;
6886 saved_script_handle
= previous_script_handle
;
6889 /* Enter a group. This creates a new lang_group_statement, and sets
6890 stat_ptr to build new statements within the group. */
6893 lang_enter_group (void)
6895 lang_group_statement_type
*g
;
6897 g
= new_stat (lang_group_statement
, stat_ptr
);
6898 lang_list_init (&g
->children
);
6899 push_stat_ptr (&g
->children
);
6902 /* Leave a group. This just resets stat_ptr to start writing to the
6903 regular list of statements again. Note that this will not work if
6904 groups can occur inside anything else which can adjust stat_ptr,
6905 but currently they can't. */
6908 lang_leave_group (void)
6913 /* Add a new program header. This is called for each entry in a PHDRS
6914 command in a linker script. */
6917 lang_new_phdr (const char *name
,
6919 bfd_boolean filehdr
,
6924 struct lang_phdr
*n
, **pp
;
6927 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
6930 n
->type
= exp_get_value_int (type
, 0, "program header type");
6931 n
->filehdr
= filehdr
;
6936 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
6938 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6941 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
6943 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported when prior PT_LOAD headers lack them\n"));
6950 /* Record the program header information in the output BFD. FIXME: We
6951 should not be calling an ELF specific function here. */
6954 lang_record_phdrs (void)
6958 lang_output_section_phdr_list
*last
;
6959 struct lang_phdr
*l
;
6960 lang_output_section_statement_type
*os
;
6963 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
6966 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
6973 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6977 lang_output_section_phdr_list
*pl
;
6979 if (os
->constraint
< 0)
6987 if (os
->sectype
== noload_section
6988 || os
->bfd_section
== NULL
6989 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6992 /* Don't add orphans to PT_INTERP header. */
6998 lang_output_section_statement_type
* tmp_os
;
7000 /* If we have not run across a section with a program
7001 header assigned to it yet, then scan forwards to find
7002 one. This prevents inconsistencies in the linker's
7003 behaviour when a script has specified just a single
7004 header and there are sections in that script which are
7005 not assigned to it, and which occur before the first
7006 use of that header. See here for more details:
7007 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7008 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7011 last
= tmp_os
->phdrs
;
7015 einfo (_("%F%P: no sections assigned to phdrs\n"));
7020 if (os
->bfd_section
== NULL
)
7023 for (; pl
!= NULL
; pl
= pl
->next
)
7025 if (strcmp (pl
->name
, l
->name
) == 0)
7030 secs
= (asection
**) xrealloc (secs
,
7031 alc
* sizeof (asection
*));
7033 secs
[c
] = os
->bfd_section
;
7040 if (l
->flags
== NULL
)
7043 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7048 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7050 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7051 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7052 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7053 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7058 /* Make sure all the phdr assignments succeeded. */
7059 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7063 lang_output_section_phdr_list
*pl
;
7065 if (os
->constraint
< 0
7066 || os
->bfd_section
== NULL
)
7069 for (pl
= os
->phdrs
;
7072 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7073 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7074 os
->name
, pl
->name
);
7078 /* Record a list of sections which may not be cross referenced. */
7081 lang_add_nocrossref (lang_nocrossref_type
*l
)
7083 struct lang_nocrossrefs
*n
;
7085 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7086 n
->next
= nocrossref_list
;
7088 nocrossref_list
= n
;
7090 /* Set notice_all so that we get informed about all symbols. */
7091 link_info
.notice_all
= TRUE
;
7094 /* Overlay handling. We handle overlays with some static variables. */
7096 /* The overlay virtual address. */
7097 static etree_type
*overlay_vma
;
7098 /* And subsection alignment. */
7099 static etree_type
*overlay_subalign
;
7101 /* An expression for the maximum section size seen so far. */
7102 static etree_type
*overlay_max
;
7104 /* A list of all the sections in this overlay. */
7106 struct overlay_list
{
7107 struct overlay_list
*next
;
7108 lang_output_section_statement_type
*os
;
7111 static struct overlay_list
*overlay_list
;
7113 /* Start handling an overlay. */
7116 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7118 /* The grammar should prevent nested overlays from occurring. */
7119 ASSERT (overlay_vma
== NULL
7120 && overlay_subalign
== NULL
7121 && overlay_max
== NULL
);
7123 overlay_vma
= vma_expr
;
7124 overlay_subalign
= subalign
;
7127 /* Start a section in an overlay. We handle this by calling
7128 lang_enter_output_section_statement with the correct VMA.
7129 lang_leave_overlay sets up the LMA and memory regions. */
7132 lang_enter_overlay_section (const char *name
)
7134 struct overlay_list
*n
;
7137 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7138 0, overlay_subalign
, 0, 0);
7140 /* If this is the first section, then base the VMA of future
7141 sections on this one. This will work correctly even if `.' is
7142 used in the addresses. */
7143 if (overlay_list
== NULL
)
7144 overlay_vma
= exp_nameop (ADDR
, name
);
7146 /* Remember the section. */
7147 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7148 n
->os
= current_section
;
7149 n
->next
= overlay_list
;
7152 size
= exp_nameop (SIZEOF
, name
);
7154 /* Arrange to work out the maximum section end address. */
7155 if (overlay_max
== NULL
)
7158 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7161 /* Finish a section in an overlay. There isn't any special to do
7165 lang_leave_overlay_section (fill_type
*fill
,
7166 lang_output_section_phdr_list
*phdrs
)
7173 name
= current_section
->name
;
7175 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7176 region and that no load-time region has been specified. It doesn't
7177 really matter what we say here, since lang_leave_overlay will
7179 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7181 /* Define the magic symbols. */
7183 clean
= (char *) xmalloc (strlen (name
) + 1);
7185 for (s1
= name
; *s1
!= '\0'; s1
++)
7186 if (ISALNUM (*s1
) || *s1
== '_')
7190 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7191 sprintf (buf
, "__load_start_%s", clean
);
7192 lang_add_assignment (exp_provide (buf
,
7193 exp_nameop (LOADADDR
, name
),
7196 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7197 sprintf (buf
, "__load_stop_%s", clean
);
7198 lang_add_assignment (exp_provide (buf
,
7200 exp_nameop (LOADADDR
, name
),
7201 exp_nameop (SIZEOF
, name
)),
7207 /* Finish an overlay. If there are any overlay wide settings, this
7208 looks through all the sections in the overlay and sets them. */
7211 lang_leave_overlay (etree_type
*lma_expr
,
7214 const char *memspec
,
7215 lang_output_section_phdr_list
*phdrs
,
7216 const char *lma_memspec
)
7218 lang_memory_region_type
*region
;
7219 lang_memory_region_type
*lma_region
;
7220 struct overlay_list
*l
;
7221 lang_nocrossref_type
*nocrossref
;
7223 lang_get_regions (®ion
, &lma_region
,
7224 memspec
, lma_memspec
,
7225 lma_expr
!= NULL
, FALSE
);
7229 /* After setting the size of the last section, set '.' to end of the
7231 if (overlay_list
!= NULL
)
7232 overlay_list
->os
->update_dot_tree
7233 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
7238 struct overlay_list
*next
;
7240 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7243 l
->os
->region
= region
;
7244 l
->os
->lma_region
= lma_region
;
7246 /* The first section has the load address specified in the
7247 OVERLAY statement. The rest are worked out from that.
7248 The base address is not needed (and should be null) if
7249 an LMA region was specified. */
7252 l
->os
->load_base
= lma_expr
;
7253 l
->os
->sectype
= normal_section
;
7255 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7256 l
->os
->phdrs
= phdrs
;
7260 lang_nocrossref_type
*nc
;
7262 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7263 nc
->name
= l
->os
->name
;
7264 nc
->next
= nocrossref
;
7273 if (nocrossref
!= NULL
)
7274 lang_add_nocrossref (nocrossref
);
7277 overlay_list
= NULL
;
7281 /* Version handling. This is only useful for ELF. */
7283 /* This global variable holds the version tree that we build. */
7285 struct bfd_elf_version_tree
*lang_elf_version_info
;
7287 /* If PREV is NULL, return first version pattern matching particular symbol.
7288 If PREV is non-NULL, return first version pattern matching particular
7289 symbol after PREV (previously returned by lang_vers_match). */
7291 static struct bfd_elf_version_expr
*
7292 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7293 struct bfd_elf_version_expr
*prev
,
7296 const char *cxx_sym
= sym
;
7297 const char *java_sym
= sym
;
7298 struct bfd_elf_version_expr
*expr
= NULL
;
7300 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7302 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
7306 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7308 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
7313 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7315 struct bfd_elf_version_expr e
;
7317 switch (prev
? prev
->mask
: 0)
7320 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7323 expr
= (struct bfd_elf_version_expr
*)
7324 htab_find ((htab_t
) head
->htab
, &e
);
7325 while (expr
&& strcmp (expr
->pattern
, sym
) == 0)
7326 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7332 case BFD_ELF_VERSION_C_TYPE
:
7333 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7335 e
.pattern
= cxx_sym
;
7336 expr
= (struct bfd_elf_version_expr
*)
7337 htab_find ((htab_t
) head
->htab
, &e
);
7338 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7339 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7345 case BFD_ELF_VERSION_CXX_TYPE
:
7346 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7348 e
.pattern
= java_sym
;
7349 expr
= (struct bfd_elf_version_expr
*)
7350 htab_find ((htab_t
) head
->htab
, &e
);
7351 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7352 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7363 /* Finally, try the wildcards. */
7364 if (prev
== NULL
|| prev
->literal
)
7365 expr
= head
->remaining
;
7368 for (; expr
; expr
= expr
->next
)
7375 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7378 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7380 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7384 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7390 free ((char *) cxx_sym
);
7391 if (java_sym
!= sym
)
7392 free ((char *) java_sym
);
7396 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7397 return a pointer to the symbol name with any backslash quotes removed. */
7400 realsymbol (const char *pattern
)
7403 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7404 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7406 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7408 /* It is a glob pattern only if there is no preceding
7412 /* Remove the preceding backslash. */
7419 if (*p
== '?' || *p
== '*' || *p
== '[')
7426 backslash
= *p
== '\\';
7442 /* This is called for each variable name or match expression. NEW_NAME is
7443 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7444 pattern to be matched against symbol names. */
7446 struct bfd_elf_version_expr
*
7447 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7448 const char *new_name
,
7450 bfd_boolean literal_p
)
7452 struct bfd_elf_version_expr
*ret
;
7454 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7458 ret
->literal
= TRUE
;
7459 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7460 if (ret
->pattern
== NULL
)
7462 ret
->pattern
= new_name
;
7463 ret
->literal
= FALSE
;
7466 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7467 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7468 else if (strcasecmp (lang
, "C++") == 0)
7469 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7470 else if (strcasecmp (lang
, "Java") == 0)
7471 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7474 einfo (_("%X%P: unknown language `%s' in version information\n"),
7476 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7479 return ldemul_new_vers_pattern (ret
);
7482 /* This is called for each set of variable names and match
7485 struct bfd_elf_version_tree
*
7486 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7487 struct bfd_elf_version_expr
*locals
)
7489 struct bfd_elf_version_tree
*ret
;
7491 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7492 ret
->globals
.list
= globals
;
7493 ret
->locals
.list
= locals
;
7494 ret
->match
= lang_vers_match
;
7495 ret
->name_indx
= (unsigned int) -1;
7499 /* This static variable keeps track of version indices. */
7501 static int version_index
;
7504 version_expr_head_hash (const void *p
)
7506 const struct bfd_elf_version_expr
*e
=
7507 (const struct bfd_elf_version_expr
*) p
;
7509 return htab_hash_string (e
->pattern
);
7513 version_expr_head_eq (const void *p1
, const void *p2
)
7515 const struct bfd_elf_version_expr
*e1
=
7516 (const struct bfd_elf_version_expr
*) p1
;
7517 const struct bfd_elf_version_expr
*e2
=
7518 (const struct bfd_elf_version_expr
*) p2
;
7520 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7524 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7527 struct bfd_elf_version_expr
*e
, *next
;
7528 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7530 for (e
= head
->list
; e
; e
= e
->next
)
7534 head
->mask
|= e
->mask
;
7539 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7540 version_expr_head_eq
, NULL
);
7541 list_loc
= &head
->list
;
7542 remaining_loc
= &head
->remaining
;
7543 for (e
= head
->list
; e
; e
= next
)
7549 remaining_loc
= &e
->next
;
7553 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7557 struct bfd_elf_version_expr
*e1
, *last
;
7559 e1
= (struct bfd_elf_version_expr
*) *loc
;
7563 if (e1
->mask
== e
->mask
)
7571 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7575 /* This is a duplicate. */
7576 /* FIXME: Memory leak. Sometimes pattern is not
7577 xmalloced alone, but in larger chunk of memory. */
7578 /* free (e->pattern); */
7583 e
->next
= last
->next
;
7591 list_loc
= &e
->next
;
7595 *remaining_loc
= NULL
;
7596 *list_loc
= head
->remaining
;
7599 head
->remaining
= head
->list
;
7602 /* This is called when we know the name and dependencies of the
7606 lang_register_vers_node (const char *name
,
7607 struct bfd_elf_version_tree
*version
,
7608 struct bfd_elf_version_deps
*deps
)
7610 struct bfd_elf_version_tree
*t
, **pp
;
7611 struct bfd_elf_version_expr
*e1
;
7616 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
7617 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
7619 einfo (_("%X%P: anonymous version tag cannot be combined"
7620 " with other version tags\n"));
7625 /* Make sure this node has a unique name. */
7626 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7627 if (strcmp (t
->name
, name
) == 0)
7628 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7630 lang_finalize_version_expr_head (&version
->globals
);
7631 lang_finalize_version_expr_head (&version
->locals
);
7633 /* Check the global and local match names, and make sure there
7634 aren't any duplicates. */
7636 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7638 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7640 struct bfd_elf_version_expr
*e2
;
7642 if (t
->locals
.htab
&& e1
->literal
)
7644 e2
= (struct bfd_elf_version_expr
*)
7645 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7646 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7648 if (e1
->mask
== e2
->mask
)
7649 einfo (_("%X%P: duplicate expression `%s'"
7650 " in version information\n"), e1
->pattern
);
7654 else if (!e1
->literal
)
7655 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7656 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7657 && e1
->mask
== e2
->mask
)
7658 einfo (_("%X%P: duplicate expression `%s'"
7659 " in version information\n"), e1
->pattern
);
7663 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7665 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7667 struct bfd_elf_version_expr
*e2
;
7669 if (t
->globals
.htab
&& e1
->literal
)
7671 e2
= (struct bfd_elf_version_expr
*)
7672 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7673 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7675 if (e1
->mask
== e2
->mask
)
7676 einfo (_("%X%P: duplicate expression `%s'"
7677 " in version information\n"),
7682 else if (!e1
->literal
)
7683 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7684 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7685 && e1
->mask
== e2
->mask
)
7686 einfo (_("%X%P: duplicate expression `%s'"
7687 " in version information\n"), e1
->pattern
);
7691 version
->deps
= deps
;
7692 version
->name
= name
;
7693 if (name
[0] != '\0')
7696 version
->vernum
= version_index
;
7699 version
->vernum
= 0;
7701 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7706 /* This is called when we see a version dependency. */
7708 struct bfd_elf_version_deps
*
7709 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7711 struct bfd_elf_version_deps
*ret
;
7712 struct bfd_elf_version_tree
*t
;
7714 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7717 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7719 if (strcmp (t
->name
, name
) == 0)
7721 ret
->version_needed
= t
;
7726 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7728 ret
->version_needed
= NULL
;
7733 lang_do_version_exports_section (void)
7735 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7737 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7739 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7747 contents
= (char *) xmalloc (len
);
7748 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7749 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7752 while (p
< contents
+ len
)
7754 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7755 p
= strchr (p
, '\0') + 1;
7758 /* Do not free the contents, as we used them creating the regex. */
7760 /* Do not include this section in the link. */
7761 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7764 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7765 lang_register_vers_node (command_line
.version_exports_section
,
7766 lang_new_vers_node (greg
, lreg
), NULL
);
7770 lang_add_unique (const char *name
)
7772 struct unique_sections
*ent
;
7774 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7775 if (strcmp (ent
->name
, name
) == 0)
7778 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7779 ent
->name
= xstrdup (name
);
7780 ent
->next
= unique_section_list
;
7781 unique_section_list
= ent
;
7784 /* Append the list of dynamic symbols to the existing one. */
7787 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7789 if (link_info
.dynamic_list
)
7791 struct bfd_elf_version_expr
*tail
;
7792 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7794 tail
->next
= link_info
.dynamic_list
->head
.list
;
7795 link_info
.dynamic_list
->head
.list
= dynamic
;
7799 struct bfd_elf_dynamic_list
*d
;
7801 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
7802 d
->head
.list
= dynamic
;
7803 d
->match
= lang_vers_match
;
7804 link_info
.dynamic_list
= d
;
7808 /* Append the list of C++ typeinfo dynamic symbols to the existing
7812 lang_append_dynamic_list_cpp_typeinfo (void)
7814 const char * symbols
[] =
7816 "typeinfo name for*",
7819 struct bfd_elf_version_expr
*dynamic
= NULL
;
7822 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7823 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7826 lang_append_dynamic_list (dynamic
);
7829 /* Append the list of C++ operator new and delete dynamic symbols to the
7833 lang_append_dynamic_list_cpp_new (void)
7835 const char * symbols
[] =
7840 struct bfd_elf_version_expr
*dynamic
= NULL
;
7843 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7844 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7847 lang_append_dynamic_list (dynamic
);