1 /* Linker command language support.
2 Copyright (C) 1991-2016 Free Software Foundation, Inc.
4 This file is part of the GNU Binutils.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
23 #include "libiberty.h"
24 #include "filenames.h"
25 #include "safe-ctype.h"
45 #endif /* ENABLE_PLUGINS */
48 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
51 /* Convert between addresses in bytes and sizes in octets.
52 For currently supported targets, octets_per_byte is always a power
53 of two, so we can use shifts. */
54 #define TO_ADDR(X) ((X) >> opb_shift)
55 #define TO_SIZE(X) ((X) << opb_shift)
57 /* Local variables. */
58 static struct obstack stat_obstack
;
59 static struct obstack map_obstack
;
61 #define obstack_chunk_alloc xmalloc
62 #define obstack_chunk_free free
63 static const char *entry_symbol_default
= "start";
64 static bfd_boolean placed_commons
= FALSE
;
65 static bfd_boolean map_head_is_link_order
= FALSE
;
66 static lang_output_section_statement_type
*default_common_section
;
67 static bfd_boolean map_option_f
;
68 static bfd_vma print_dot
;
69 static lang_input_statement_type
*first_file
;
70 static const char *current_target
;
71 static lang_statement_list_type statement_list
;
72 static lang_statement_list_type
*stat_save
[10];
73 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
74 static struct unique_sections
*unique_section_list
;
75 static struct asneeded_minfo
*asneeded_list_head
;
76 static unsigned int opb_shift
= 0;
78 /* Forward declarations. */
79 static void exp_init_os (etree_type
*);
80 static lang_input_statement_type
*lookup_name (const char *);
81 static void insert_undefined (const char *);
82 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
83 static void print_statement (lang_statement_union_type
*,
84 lang_output_section_statement_type
*);
85 static void print_statement_list (lang_statement_union_type
*,
86 lang_output_section_statement_type
*);
87 static void print_statements (void);
88 static void print_input_section (asection
*, bfd_boolean
);
89 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
90 static void lang_record_phdrs (void);
91 static void lang_do_version_exports_section (void);
92 static void lang_finalize_version_expr_head
93 (struct bfd_elf_version_expr_head
*);
94 static void lang_do_memory_regions (void);
96 /* Exported variables. */
97 const char *output_target
;
98 lang_output_section_statement_type
*abs_output_section
;
99 lang_statement_list_type lang_output_section_statement
;
100 lang_statement_list_type
*stat_ptr
= &statement_list
;
101 lang_statement_list_type file_chain
= { NULL
, NULL
};
102 lang_statement_list_type input_file_chain
;
103 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
104 const char *entry_section
= ".text";
105 struct lang_input_statement_flags input_flags
;
106 bfd_boolean entry_from_cmdline
;
107 bfd_boolean undef_from_cmdline
;
108 bfd_boolean lang_has_input_file
= FALSE
;
109 bfd_boolean had_output_filename
= FALSE
;
110 bfd_boolean lang_float_flag
= FALSE
;
111 bfd_boolean delete_output_file_on_failure
= FALSE
;
112 struct lang_phdr
*lang_phdr_list
;
113 struct lang_nocrossrefs
*nocrossref_list
;
114 struct asneeded_minfo
**asneeded_list_tail
;
116 /* Functions that traverse the linker script and might evaluate
117 DEFINED() need to increment this at the start of the traversal. */
118 int lang_statement_iteration
= 0;
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 (bfd_link_relocatable (&link_info
)
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
, ptr
->section_flag_list
, 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
, ptr
->section_flag_list
, 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/.dtors.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 struct flag_info
*sflag_list ATTRIBUTE_UNUSED
,
509 lang_input_statement_type
*file
,
512 lang_section_bst_type
*node
;
513 lang_section_bst_type
**tree
;
514 lang_output_section_statement_type
*os
;
516 os
= (lang_output_section_statement_type
*) output
;
518 if (unique_section_p (section
, os
))
521 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
524 node
->section
= section
;
526 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
531 /* Convert a sorted sections' BST back to list form. */
534 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
535 lang_section_bst_type
*tree
,
539 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
541 lang_add_section (&ptr
->children
, tree
->section
, NULL
,
542 (lang_output_section_statement_type
*) output
);
545 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
550 /* Specialized, optimized routines for handling different kinds of
554 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
555 lang_input_statement_type
*file
,
559 /* We can just do a hash lookup for the section with the right name.
560 But if that lookup discovers more than one section with the name
561 (should be rare), we fall back to the general algorithm because
562 we would otherwise have to sort the sections to make sure they
563 get processed in the bfd's order. */
564 bfd_boolean multiple_sections_found
;
565 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
566 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
568 if (multiple_sections_found
)
569 walk_wild_section_general (ptr
, file
, callback
, data
);
571 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
575 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
576 lang_input_statement_type
*file
,
581 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
583 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
585 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
586 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
589 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
594 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
595 lang_input_statement_type
*file
,
600 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
601 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
602 bfd_boolean multiple_sections_found
;
603 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
605 if (multiple_sections_found
)
607 walk_wild_section_general (ptr
, file
, callback
, data
);
611 /* Note that if the section was not found, s0 is NULL and
612 we'll simply never succeed the s == s0 test below. */
613 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
615 /* Recall that in this code path, a section cannot satisfy more
616 than one spec, so if s == s0 then it cannot match
619 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
622 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
623 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
626 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
633 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
634 lang_input_statement_type
*file
,
639 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
640 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
641 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
642 bfd_boolean multiple_sections_found
;
643 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
645 if (multiple_sections_found
)
647 walk_wild_section_general (ptr
, file
, callback
, data
);
651 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
654 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
657 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
658 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
661 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
664 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
666 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
674 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
675 lang_input_statement_type
*file
,
680 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
681 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
682 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
683 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
684 bfd_boolean multiple_sections_found
;
685 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
687 if (multiple_sections_found
)
689 walk_wild_section_general (ptr
, file
, callback
, data
);
693 s1
= find_section (file
, sec1
, &multiple_sections_found
);
694 if (multiple_sections_found
)
696 walk_wild_section_general (ptr
, file
, callback
, data
);
700 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
703 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
706 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
709 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
710 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
714 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
718 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
720 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
728 walk_wild_section (lang_wild_statement_type
*ptr
,
729 lang_input_statement_type
*file
,
733 if (file
->flags
.just_syms
)
736 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
739 /* Returns TRUE when name1 is a wildcard spec that might match
740 something name2 can match. We're conservative: we return FALSE
741 only if the prefixes of name1 and name2 are different up to the
742 first wildcard character. */
745 wild_spec_can_overlap (const char *name1
, const char *name2
)
747 size_t prefix1_len
= strcspn (name1
, "?*[");
748 size_t prefix2_len
= strcspn (name2
, "?*[");
749 size_t min_prefix_len
;
751 /* Note that if there is no wildcard character, then we treat the
752 terminating 0 as part of the prefix. Thus ".text" won't match
753 ".text." or ".text.*", for example. */
754 if (name1
[prefix1_len
] == '\0')
756 if (name2
[prefix2_len
] == '\0')
759 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
761 return memcmp (name1
, name2
, min_prefix_len
) == 0;
764 /* Select specialized code to handle various kinds of wildcard
768 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
771 int wild_name_count
= 0;
772 struct wildcard_list
*sec
;
776 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
777 ptr
->handler_data
[0] = NULL
;
778 ptr
->handler_data
[1] = NULL
;
779 ptr
->handler_data
[2] = NULL
;
780 ptr
->handler_data
[3] = NULL
;
783 /* Count how many wildcard_specs there are, and how many of those
784 actually use wildcards in the name. Also, bail out if any of the
785 wildcard names are NULL. (Can this actually happen?
786 walk_wild_section used to test for it.) And bail out if any
787 of the wildcards are more complex than a simple string
788 ending in a single '*'. */
789 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
792 if (sec
->spec
.name
== NULL
)
794 if (wildcardp (sec
->spec
.name
))
797 if (!is_simple_wild (sec
->spec
.name
))
802 /* The zero-spec case would be easy to optimize but it doesn't
803 happen in practice. Likewise, more than 4 specs doesn't
804 happen in practice. */
805 if (sec_count
== 0 || sec_count
> 4)
808 /* Check that no two specs can match the same section. */
809 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
811 struct wildcard_list
*sec2
;
812 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
814 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
819 signature
= (sec_count
<< 8) + wild_name_count
;
823 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
826 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
829 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
832 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
835 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
841 /* Now fill the data array with pointers to the specs, first the
842 specs with non-wildcard names, then the specs with wildcard
843 names. It's OK to process the specs in different order from the
844 given order, because we've already determined that no section
845 will match more than one spec. */
847 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
848 if (!wildcardp (sec
->spec
.name
))
849 ptr
->handler_data
[data_counter
++] = sec
;
850 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
851 if (wildcardp (sec
->spec
.name
))
852 ptr
->handler_data
[data_counter
++] = sec
;
855 /* Handle a wild statement for a single file F. */
858 walk_wild_file (lang_wild_statement_type
*s
,
859 lang_input_statement_type
*f
,
863 if (f
->the_bfd
== NULL
864 || !bfd_check_format (f
->the_bfd
, bfd_archive
))
865 walk_wild_section (s
, f
, callback
, data
);
870 /* This is an archive file. We must map each member of the
871 archive separately. */
872 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
873 while (member
!= NULL
)
875 /* When lookup_name is called, it will call the add_symbols
876 entry point for the archive. For each element of the
877 archive which is included, BFD will call ldlang_add_file,
878 which will set the usrdata field of the member to the
879 lang_input_statement. */
880 if (member
->usrdata
!= NULL
)
882 walk_wild_section (s
,
883 (lang_input_statement_type
*) member
->usrdata
,
887 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
893 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
895 const char *file_spec
= s
->filename
;
898 if (file_spec
== NULL
)
900 /* Perform the iteration over all files in the list. */
901 LANG_FOR_EACH_INPUT_STATEMENT (f
)
903 walk_wild_file (s
, f
, callback
, data
);
906 else if ((p
= archive_path (file_spec
)) != NULL
)
908 LANG_FOR_EACH_INPUT_STATEMENT (f
)
910 if (input_statement_is_archive_path (file_spec
, p
, f
))
911 walk_wild_file (s
, f
, callback
, data
);
914 else if (wildcardp (file_spec
))
916 LANG_FOR_EACH_INPUT_STATEMENT (f
)
918 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
919 walk_wild_file (s
, f
, callback
, data
);
924 lang_input_statement_type
*f
;
926 /* Perform the iteration over a single file. */
927 f
= lookup_name (file_spec
);
929 walk_wild_file (s
, f
, callback
, data
);
933 /* lang_for_each_statement walks the parse tree and calls the provided
934 function for each node, except those inside output section statements
935 with constraint set to -1. */
938 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
939 lang_statement_union_type
*s
)
941 for (; s
!= NULL
; s
= s
->header
.next
)
945 switch (s
->header
.type
)
947 case lang_constructors_statement_enum
:
948 lang_for_each_statement_worker (func
, constructor_list
.head
);
950 case lang_output_section_statement_enum
:
951 if (s
->output_section_statement
.constraint
!= -1)
952 lang_for_each_statement_worker
953 (func
, s
->output_section_statement
.children
.head
);
955 case lang_wild_statement_enum
:
956 lang_for_each_statement_worker (func
,
957 s
->wild_statement
.children
.head
);
959 case lang_group_statement_enum
:
960 lang_for_each_statement_worker (func
,
961 s
->group_statement
.children
.head
);
963 case lang_data_statement_enum
:
964 case lang_reloc_statement_enum
:
965 case lang_object_symbols_statement_enum
:
966 case lang_output_statement_enum
:
967 case lang_target_statement_enum
:
968 case lang_input_section_enum
:
969 case lang_input_statement_enum
:
970 case lang_assignment_statement_enum
:
971 case lang_padding_statement_enum
:
972 case lang_address_statement_enum
:
973 case lang_fill_statement_enum
:
974 case lang_insert_statement_enum
:
984 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
986 lang_for_each_statement_worker (func
, statement_list
.head
);
989 /*----------------------------------------------------------------------*/
992 lang_list_init (lang_statement_list_type
*list
)
995 list
->tail
= &list
->head
;
999 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1001 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1003 *stat_save_ptr
++ = stat_ptr
;
1010 if (stat_save_ptr
<= stat_save
)
1012 stat_ptr
= *--stat_save_ptr
;
1015 /* Build a new statement node for the parse tree. */
1017 static lang_statement_union_type
*
1018 new_statement (enum statement_enum type
,
1020 lang_statement_list_type
*list
)
1022 lang_statement_union_type
*new_stmt
;
1024 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1025 new_stmt
->header
.type
= type
;
1026 new_stmt
->header
.next
= NULL
;
1027 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1031 /* Build a new input file node for the language. There are several
1032 ways in which we treat an input file, eg, we only look at symbols,
1033 or prefix it with a -l etc.
1035 We can be supplied with requests for input files more than once;
1036 they may, for example be split over several lines like foo.o(.text)
1037 foo.o(.data) etc, so when asked for a file we check that we haven't
1038 got it already so we don't duplicate the bfd. */
1040 static lang_input_statement_type
*
1041 new_afile (const char *name
,
1042 lang_input_file_enum_type file_type
,
1044 bfd_boolean add_to_list
)
1046 lang_input_statement_type
*p
;
1048 lang_has_input_file
= TRUE
;
1051 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1054 p
= (lang_input_statement_type
*)
1055 stat_alloc (sizeof (lang_input_statement_type
));
1056 p
->header
.type
= lang_input_statement_enum
;
1057 p
->header
.next
= NULL
;
1060 memset (&p
->the_bfd
, 0,
1061 sizeof (*p
) - offsetof (lang_input_statement_type
, the_bfd
));
1063 p
->flags
.dynamic
= input_flags
.dynamic
;
1064 p
->flags
.add_DT_NEEDED_for_dynamic
= input_flags
.add_DT_NEEDED_for_dynamic
;
1065 p
->flags
.add_DT_NEEDED_for_regular
= input_flags
.add_DT_NEEDED_for_regular
;
1066 p
->flags
.whole_archive
= input_flags
.whole_archive
;
1067 p
->flags
.sysrooted
= input_flags
.sysrooted
;
1071 case lang_input_file_is_symbols_only_enum
:
1073 p
->local_sym_name
= name
;
1074 p
->flags
.real
= TRUE
;
1075 p
->flags
.just_syms
= TRUE
;
1077 case lang_input_file_is_fake_enum
:
1079 p
->local_sym_name
= name
;
1081 case lang_input_file_is_l_enum
:
1082 if (name
[0] == ':' && name
[1] != '\0')
1084 p
->filename
= name
+ 1;
1085 p
->flags
.full_name_provided
= TRUE
;
1089 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1090 p
->flags
.maybe_archive
= TRUE
;
1091 p
->flags
.real
= TRUE
;
1092 p
->flags
.search_dirs
= TRUE
;
1094 case lang_input_file_is_marker_enum
:
1096 p
->local_sym_name
= name
;
1097 p
->flags
.search_dirs
= TRUE
;
1099 case lang_input_file_is_search_file_enum
:
1101 p
->local_sym_name
= name
;
1102 p
->flags
.real
= TRUE
;
1103 p
->flags
.search_dirs
= TRUE
;
1105 case lang_input_file_is_file_enum
:
1107 p
->local_sym_name
= name
;
1108 p
->flags
.real
= TRUE
;
1114 lang_statement_append (&input_file_chain
,
1115 (lang_statement_union_type
*) p
,
1116 &p
->next_real_file
);
1120 lang_input_statement_type
*
1121 lang_add_input_file (const char *name
,
1122 lang_input_file_enum_type file_type
,
1125 if (name
!= NULL
&& *name
== '=')
1127 lang_input_statement_type
*ret
;
1128 char *sysrooted_name
1129 = concat (ld_sysroot
, name
+ 1, (const char *) NULL
);
1131 /* We've now forcibly prepended the sysroot, making the input
1132 file independent of the context. Therefore, temporarily
1133 force a non-sysrooted context for this statement, so it won't
1134 get the sysroot prepended again when opened. (N.B. if it's a
1135 script, any child nodes with input files starting with "/"
1136 will be handled as "sysrooted" as they'll be found to be
1137 within the sysroot subdirectory.) */
1138 unsigned int outer_sysrooted
= input_flags
.sysrooted
;
1139 input_flags
.sysrooted
= 0;
1140 ret
= new_afile (sysrooted_name
, file_type
, target
, TRUE
);
1141 input_flags
.sysrooted
= outer_sysrooted
;
1145 return new_afile (name
, file_type
, target
, TRUE
);
1148 struct out_section_hash_entry
1150 struct bfd_hash_entry root
;
1151 lang_statement_union_type s
;
1154 /* The hash table. */
1156 static struct bfd_hash_table output_section_statement_table
;
1158 /* Support routines for the hash table used by lang_output_section_find,
1159 initialize the table, fill in an entry and remove the table. */
1161 static struct bfd_hash_entry
*
1162 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1163 struct bfd_hash_table
*table
,
1166 lang_output_section_statement_type
**nextp
;
1167 struct out_section_hash_entry
*ret
;
1171 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1177 entry
= bfd_hash_newfunc (entry
, table
, string
);
1181 ret
= (struct out_section_hash_entry
*) entry
;
1182 memset (&ret
->s
, 0, sizeof (ret
->s
));
1183 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1184 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1185 ret
->s
.output_section_statement
.section_alignment
= -1;
1186 ret
->s
.output_section_statement
.block_value
= 1;
1187 lang_list_init (&ret
->s
.output_section_statement
.children
);
1188 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1190 /* For every output section statement added to the list, except the
1191 first one, lang_output_section_statement.tail points to the "next"
1192 field of the last element of the list. */
1193 if (lang_output_section_statement
.head
!= NULL
)
1194 ret
->s
.output_section_statement
.prev
1195 = ((lang_output_section_statement_type
*)
1196 ((char *) lang_output_section_statement
.tail
1197 - offsetof (lang_output_section_statement_type
, next
)));
1199 /* GCC's strict aliasing rules prevent us from just casting the
1200 address, so we store the pointer in a variable and cast that
1202 nextp
= &ret
->s
.output_section_statement
.next
;
1203 lang_statement_append (&lang_output_section_statement
,
1205 (lang_statement_union_type
**) nextp
);
1210 output_section_statement_table_init (void)
1212 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1213 output_section_statement_newfunc
,
1214 sizeof (struct out_section_hash_entry
),
1216 einfo (_("%P%F: can not create hash table: %E\n"));
1220 output_section_statement_table_free (void)
1222 bfd_hash_table_free (&output_section_statement_table
);
1225 /* Build enough state so that the parser can build its tree. */
1230 obstack_begin (&stat_obstack
, 1000);
1232 stat_ptr
= &statement_list
;
1234 output_section_statement_table_init ();
1236 lang_list_init (stat_ptr
);
1238 lang_list_init (&input_file_chain
);
1239 lang_list_init (&lang_output_section_statement
);
1240 lang_list_init (&file_chain
);
1241 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1243 abs_output_section
=
1244 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1246 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1248 asneeded_list_head
= NULL
;
1249 asneeded_list_tail
= &asneeded_list_head
;
1255 output_section_statement_table_free ();
1258 /*----------------------------------------------------------------------
1259 A region is an area of memory declared with the
1260 MEMORY { name:org=exp, len=exp ... }
1263 We maintain a list of all the regions here.
1265 If no regions are specified in the script, then the default is used
1266 which is created when looked up to be the entire data space.
1268 If create is true we are creating a region inside a MEMORY block.
1269 In this case it is probably an error to create a region that has
1270 already been created. If we are not inside a MEMORY block it is
1271 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1272 and so we issue a warning.
1274 Each region has at least one name. The first name is either
1275 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1276 alias names to an existing region within a script with
1277 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1280 static lang_memory_region_type
*lang_memory_region_list
;
1281 static lang_memory_region_type
**lang_memory_region_list_tail
1282 = &lang_memory_region_list
;
1284 lang_memory_region_type
*
1285 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1287 lang_memory_region_name
*n
;
1288 lang_memory_region_type
*r
;
1289 lang_memory_region_type
*new_region
;
1291 /* NAME is NULL for LMA memspecs if no region was specified. */
1295 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1296 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1297 if (strcmp (n
->name
, name
) == 0)
1300 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1305 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1306 einfo (_("%P:%S: warning: memory region `%s' not declared\n"),
1309 new_region
= (lang_memory_region_type
*)
1310 stat_alloc (sizeof (lang_memory_region_type
));
1312 new_region
->name_list
.name
= xstrdup (name
);
1313 new_region
->name_list
.next
= NULL
;
1314 new_region
->next
= NULL
;
1315 new_region
->origin_exp
= NULL
;
1316 new_region
->origin
= 0;
1317 new_region
->length_exp
= NULL
;
1318 new_region
->length
= ~(bfd_size_type
) 0;
1319 new_region
->current
= 0;
1320 new_region
->last_os
= NULL
;
1321 new_region
->flags
= 0;
1322 new_region
->not_flags
= 0;
1323 new_region
->had_full_message
= FALSE
;
1325 *lang_memory_region_list_tail
= new_region
;
1326 lang_memory_region_list_tail
= &new_region
->next
;
1332 lang_memory_region_alias (const char *alias
, const char *region_name
)
1334 lang_memory_region_name
*n
;
1335 lang_memory_region_type
*r
;
1336 lang_memory_region_type
*region
;
1338 /* The default region must be unique. This ensures that it is not necessary
1339 to iterate through the name list if someone wants the check if a region is
1340 the default memory region. */
1341 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1342 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1343 einfo (_("%F%P:%S: error: alias for default memory region\n"), NULL
);
1345 /* Look for the target region and check if the alias is not already
1348 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1349 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1351 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1353 if (strcmp (n
->name
, alias
) == 0)
1354 einfo (_("%F%P:%S: error: redefinition of memory region "
1359 /* Check if the target region exists. */
1361 einfo (_("%F%P:%S: error: memory region `%s' "
1362 "for alias `%s' does not exist\n"),
1363 NULL
, region_name
, alias
);
1365 /* Add alias to region name list. */
1366 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1367 n
->name
= xstrdup (alias
);
1368 n
->next
= region
->name_list
.next
;
1369 region
->name_list
.next
= n
;
1372 static lang_memory_region_type
*
1373 lang_memory_default (asection
*section
)
1375 lang_memory_region_type
*p
;
1377 flagword sec_flags
= section
->flags
;
1379 /* Override SEC_DATA to mean a writable section. */
1380 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1381 sec_flags
|= SEC_DATA
;
1383 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1385 if ((p
->flags
& sec_flags
) != 0
1386 && (p
->not_flags
& sec_flags
) == 0)
1391 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1394 /* Get the output section statement directly from the userdata. */
1396 lang_output_section_statement_type
*
1397 lang_output_section_get (const asection
*output_section
)
1399 return get_userdata (output_section
);
1402 /* Find or create an output_section_statement with the given NAME.
1403 If CONSTRAINT is non-zero match one with that constraint, otherwise
1404 match any non-negative constraint. If CREATE, always make a
1405 new output_section_statement for SPECIAL CONSTRAINT. */
1407 lang_output_section_statement_type
*
1408 lang_output_section_statement_lookup (const char *name
,
1412 struct out_section_hash_entry
*entry
;
1414 entry
= ((struct out_section_hash_entry
*)
1415 bfd_hash_lookup (&output_section_statement_table
, name
,
1420 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1424 if (entry
->s
.output_section_statement
.name
!= NULL
)
1426 /* We have a section of this name, but it might not have the correct
1428 struct out_section_hash_entry
*last_ent
;
1430 name
= entry
->s
.output_section_statement
.name
;
1431 if (create
&& constraint
== SPECIAL
)
1432 /* Not traversing to the end reverses the order of the second
1433 and subsequent SPECIAL sections in the hash table chain,
1434 but that shouldn't matter. */
1439 if (constraint
== entry
->s
.output_section_statement
.constraint
1441 && entry
->s
.output_section_statement
.constraint
>= 0))
1442 return &entry
->s
.output_section_statement
;
1444 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1446 while (entry
!= NULL
1447 && name
== entry
->s
.output_section_statement
.name
);
1453 = ((struct out_section_hash_entry
*)
1454 output_section_statement_newfunc (NULL
,
1455 &output_section_statement_table
,
1459 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1462 entry
->root
= last_ent
->root
;
1463 last_ent
->root
.next
= &entry
->root
;
1466 entry
->s
.output_section_statement
.name
= name
;
1467 entry
->s
.output_section_statement
.constraint
= constraint
;
1468 return &entry
->s
.output_section_statement
;
1471 /* Find the next output_section_statement with the same name as OS.
1472 If CONSTRAINT is non-zero, find one with that constraint otherwise
1473 match any non-negative constraint. */
1475 lang_output_section_statement_type
*
1476 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1479 /* All output_section_statements are actually part of a
1480 struct out_section_hash_entry. */
1481 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1483 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1484 const char *name
= os
->name
;
1486 ASSERT (name
== entry
->root
.string
);
1489 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1491 || name
!= entry
->s
.output_section_statement
.name
)
1494 while (constraint
!= entry
->s
.output_section_statement
.constraint
1496 || entry
->s
.output_section_statement
.constraint
< 0));
1498 return &entry
->s
.output_section_statement
;
1501 /* A variant of lang_output_section_find used by place_orphan.
1502 Returns the output statement that should precede a new output
1503 statement for SEC. If an exact match is found on certain flags,
1506 lang_output_section_statement_type
*
1507 lang_output_section_find_by_flags (const asection
*sec
,
1509 lang_output_section_statement_type
**exact
,
1510 lang_match_sec_type_func match_type
)
1512 lang_output_section_statement_type
*first
, *look
, *found
;
1513 flagword look_flags
, differ
;
1515 /* We know the first statement on this list is *ABS*. May as well
1517 first
= &lang_output_section_statement
.head
->output_section_statement
;
1518 first
= first
->next
;
1520 /* First try for an exact match. */
1522 for (look
= first
; look
; look
= look
->next
)
1524 look_flags
= look
->flags
;
1525 if (look
->bfd_section
!= NULL
)
1527 look_flags
= look
->bfd_section
->flags
;
1528 if (match_type
&& !match_type (link_info
.output_bfd
,
1533 differ
= look_flags
^ sec_flags
;
1534 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1535 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1545 if ((sec_flags
& SEC_CODE
) != 0
1546 && (sec_flags
& SEC_ALLOC
) != 0)
1548 /* Try for a rw code section. */
1549 for (look
= first
; look
; look
= look
->next
)
1551 look_flags
= look
->flags
;
1552 if (look
->bfd_section
!= NULL
)
1554 look_flags
= look
->bfd_section
->flags
;
1555 if (match_type
&& !match_type (link_info
.output_bfd
,
1560 differ
= look_flags
^ sec_flags
;
1561 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1562 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1566 else if ((sec_flags
& SEC_READONLY
) != 0
1567 && (sec_flags
& SEC_ALLOC
) != 0)
1569 /* .rodata can go after .text, .sdata2 after .rodata. */
1570 for (look
= first
; look
; look
= look
->next
)
1572 look_flags
= look
->flags
;
1573 if (look
->bfd_section
!= NULL
)
1575 look_flags
= look
->bfd_section
->flags
;
1576 if (match_type
&& !match_type (link_info
.output_bfd
,
1581 differ
= look_flags
^ sec_flags
;
1582 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1583 | SEC_READONLY
| SEC_SMALL_DATA
))
1584 || (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1586 && !(look_flags
& SEC_SMALL_DATA
)))
1590 else if ((sec_flags
& SEC_THREAD_LOCAL
) != 0
1591 && (sec_flags
& SEC_ALLOC
) != 0)
1593 /* .tdata can go after .data, .tbss after .tdata. Treat .tbss
1594 as if it were a loaded section, and don't use match_type. */
1595 bfd_boolean seen_thread_local
= FALSE
;
1598 for (look
= first
; look
; look
= look
->next
)
1600 look_flags
= look
->flags
;
1601 if (look
->bfd_section
!= NULL
)
1602 look_flags
= look
->bfd_section
->flags
;
1604 differ
= look_flags
^ (sec_flags
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1605 if (!(differ
& (SEC_THREAD_LOCAL
| SEC_ALLOC
)))
1607 /* .tdata and .tbss must be adjacent and in that order. */
1608 if (!(look_flags
& SEC_LOAD
)
1609 && (sec_flags
& SEC_LOAD
))
1610 /* ..so if we're at a .tbss section and we're placing
1611 a .tdata section stop looking and return the
1612 previous section. */
1615 seen_thread_local
= TRUE
;
1617 else if (seen_thread_local
)
1619 else if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
)))
1623 else if ((sec_flags
& SEC_SMALL_DATA
) != 0
1624 && (sec_flags
& SEC_ALLOC
) != 0)
1626 /* .sdata goes after .data, .sbss after .sdata. */
1627 for (look
= first
; look
; look
= look
->next
)
1629 look_flags
= look
->flags
;
1630 if (look
->bfd_section
!= NULL
)
1632 look_flags
= look
->bfd_section
->flags
;
1633 if (match_type
&& !match_type (link_info
.output_bfd
,
1638 differ
= look_flags
^ sec_flags
;
1639 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1640 | SEC_THREAD_LOCAL
))
1641 || ((look_flags
& SEC_SMALL_DATA
)
1642 && !(sec_flags
& SEC_HAS_CONTENTS
)))
1646 else if ((sec_flags
& SEC_HAS_CONTENTS
) != 0
1647 && (sec_flags
& SEC_ALLOC
) != 0)
1649 /* .data goes after .rodata. */
1650 for (look
= first
; look
; look
= look
->next
)
1652 look_flags
= look
->flags
;
1653 if (look
->bfd_section
!= NULL
)
1655 look_flags
= look
->bfd_section
->flags
;
1656 if (match_type
&& !match_type (link_info
.output_bfd
,
1661 differ
= look_flags
^ sec_flags
;
1662 if (!(differ
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1663 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1667 else if ((sec_flags
& SEC_ALLOC
) != 0)
1669 /* .bss goes after any other alloc section. */
1670 for (look
= first
; look
; look
= look
->next
)
1672 look_flags
= look
->flags
;
1673 if (look
->bfd_section
!= NULL
)
1675 look_flags
= look
->bfd_section
->flags
;
1676 if (match_type
&& !match_type (link_info
.output_bfd
,
1681 differ
= look_flags
^ sec_flags
;
1682 if (!(differ
& SEC_ALLOC
))
1688 /* non-alloc go last. */
1689 for (look
= first
; look
; look
= look
->next
)
1691 look_flags
= look
->flags
;
1692 if (look
->bfd_section
!= NULL
)
1693 look_flags
= look
->bfd_section
->flags
;
1694 differ
= look_flags
^ sec_flags
;
1695 if (!(differ
& SEC_DEBUGGING
))
1701 if (found
|| !match_type
)
1704 return lang_output_section_find_by_flags (sec
, sec_flags
, NULL
, NULL
);
1707 /* Find the last output section before given output statement.
1708 Used by place_orphan. */
1711 output_prev_sec_find (lang_output_section_statement_type
*os
)
1713 lang_output_section_statement_type
*lookup
;
1715 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1717 if (lookup
->constraint
< 0)
1720 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1721 return lookup
->bfd_section
;
1727 /* Look for a suitable place for a new output section statement. The
1728 idea is to skip over anything that might be inside a SECTIONS {}
1729 statement in a script, before we find another output section
1730 statement. Assignments to "dot" before an output section statement
1731 are assumed to belong to it, except in two cases; The first
1732 assignment to dot, and assignments before non-alloc sections.
1733 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1734 similar assignments that set the initial address, or we might
1735 insert non-alloc note sections among assignments setting end of
1738 static lang_statement_union_type
**
1739 insert_os_after (lang_output_section_statement_type
*after
)
1741 lang_statement_union_type
**where
;
1742 lang_statement_union_type
**assign
= NULL
;
1743 bfd_boolean ignore_first
;
1746 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1748 for (where
= &after
->header
.next
;
1750 where
= &(*where
)->header
.next
)
1752 switch ((*where
)->header
.type
)
1754 case lang_assignment_statement_enum
:
1757 lang_assignment_statement_type
*ass
;
1759 ass
= &(*where
)->assignment_statement
;
1760 if (ass
->exp
->type
.node_class
!= etree_assert
1761 && ass
->exp
->assign
.dst
[0] == '.'
1762 && ass
->exp
->assign
.dst
[1] == 0
1766 ignore_first
= FALSE
;
1768 case lang_wild_statement_enum
:
1769 case lang_input_section_enum
:
1770 case lang_object_symbols_statement_enum
:
1771 case lang_fill_statement_enum
:
1772 case lang_data_statement_enum
:
1773 case lang_reloc_statement_enum
:
1774 case lang_padding_statement_enum
:
1775 case lang_constructors_statement_enum
:
1778 case lang_output_section_statement_enum
:
1781 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1784 || s
->map_head
.s
== NULL
1785 || (s
->flags
& SEC_ALLOC
) != 0)
1789 case lang_input_statement_enum
:
1790 case lang_address_statement_enum
:
1791 case lang_target_statement_enum
:
1792 case lang_output_statement_enum
:
1793 case lang_group_statement_enum
:
1794 case lang_insert_statement_enum
:
1803 lang_output_section_statement_type
*
1804 lang_insert_orphan (asection
*s
,
1805 const char *secname
,
1807 lang_output_section_statement_type
*after
,
1808 struct orphan_save
*place
,
1809 etree_type
*address
,
1810 lang_statement_list_type
*add_child
)
1812 lang_statement_list_type add
;
1814 lang_assignment_statement_type
*start_assign
;
1815 lang_output_section_statement_type
*os
;
1816 lang_output_section_statement_type
**os_tail
;
1818 /* If we have found an appropriate place for the output section
1819 statements for this orphan, add them to our own private list,
1820 inserting them later into the global statement list. */
1823 lang_list_init (&add
);
1824 push_stat_ptr (&add
);
1827 if (bfd_link_relocatable (&link_info
)
1828 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1829 address
= exp_intop (0);
1831 os_tail
= ((lang_output_section_statement_type
**)
1832 lang_output_section_statement
.tail
);
1833 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1834 NULL
, NULL
, NULL
, constraint
, 0);
1837 start_assign
= NULL
;
1838 if (config
.build_constructors
&& *os_tail
== os
)
1840 /* If the name of the section is representable in C, then create
1841 symbols to mark the start and the end of the section. */
1842 for (ps
= secname
; *ps
!= '\0'; ps
++)
1843 if (!ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1849 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1850 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1851 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1853 = lang_add_assignment (exp_provide (symname
,
1854 exp_nameop (NAME
, "."),
1859 if (add_child
== NULL
)
1860 add_child
= &os
->children
;
1861 lang_add_section (add_child
, s
, NULL
, os
);
1863 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1865 const char *region
= (after
->region
1866 ? after
->region
->name_list
.name
1867 : DEFAULT_MEMORY_REGION
);
1868 const char *lma_region
= (after
->lma_region
1869 ? after
->lma_region
->name_list
.name
1871 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1875 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1878 if (start_assign
!= NULL
)
1881 lang_assignment_statement_type
*stop_assign
;
1884 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1885 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1886 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1888 = lang_add_assignment (exp_provide (symname
,
1889 exp_nameop (NAME
, "."),
1891 /* Evaluate the expression to define the symbol if referenced,
1892 before sizing dynamic sections. */
1893 dot
= os
->bfd_section
->vma
;
1894 exp_fold_tree (start_assign
->exp
, os
->bfd_section
, &dot
);
1895 dot
+= TO_ADDR (s
->size
);
1896 exp_fold_tree (stop_assign
->exp
, os
->bfd_section
, &dot
);
1899 /* Restore the global list pointer. */
1903 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1905 asection
*snew
, *as
;
1907 snew
= os
->bfd_section
;
1909 /* Shuffle the bfd section list to make the output file look
1910 neater. This is really only cosmetic. */
1911 if (place
->section
== NULL
1912 && after
!= (&lang_output_section_statement
.head
1913 ->output_section_statement
))
1915 asection
*bfd_section
= after
->bfd_section
;
1917 /* If the output statement hasn't been used to place any input
1918 sections (and thus doesn't have an output bfd_section),
1919 look for the closest prior output statement having an
1921 if (bfd_section
== NULL
)
1922 bfd_section
= output_prev_sec_find (after
);
1924 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1925 place
->section
= &bfd_section
->next
;
1928 if (place
->section
== NULL
)
1929 place
->section
= &link_info
.output_bfd
->sections
;
1931 as
= *place
->section
;
1935 /* Put the section at the end of the list. */
1937 /* Unlink the section. */
1938 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1940 /* Now tack it back on in the right place. */
1941 bfd_section_list_append (link_info
.output_bfd
, snew
);
1943 else if (as
!= snew
&& as
->prev
!= snew
)
1945 /* Unlink the section. */
1946 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1948 /* Now tack it back on in the right place. */
1949 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1952 /* Save the end of this list. Further ophans of this type will
1953 follow the one we've just added. */
1954 place
->section
= &snew
->next
;
1956 /* The following is non-cosmetic. We try to put the output
1957 statements in some sort of reasonable order here, because they
1958 determine the final load addresses of the orphan sections.
1959 In addition, placing output statements in the wrong order may
1960 require extra segments. For instance, given a typical
1961 situation of all read-only sections placed in one segment and
1962 following that a segment containing all the read-write
1963 sections, we wouldn't want to place an orphan read/write
1964 section before or amongst the read-only ones. */
1965 if (add
.head
!= NULL
)
1967 lang_output_section_statement_type
*newly_added_os
;
1969 if (place
->stmt
== NULL
)
1971 lang_statement_union_type
**where
= insert_os_after (after
);
1976 place
->os_tail
= &after
->next
;
1980 /* Put it after the last orphan statement we added. */
1981 *add
.tail
= *place
->stmt
;
1982 *place
->stmt
= add
.head
;
1985 /* Fix the global list pointer if we happened to tack our
1986 new list at the tail. */
1987 if (*stat_ptr
->tail
== add
.head
)
1988 stat_ptr
->tail
= add
.tail
;
1990 /* Save the end of this list. */
1991 place
->stmt
= add
.tail
;
1993 /* Do the same for the list of output section statements. */
1994 newly_added_os
= *os_tail
;
1996 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1997 ((char *) place
->os_tail
1998 - offsetof (lang_output_section_statement_type
, next
));
1999 newly_added_os
->next
= *place
->os_tail
;
2000 if (newly_added_os
->next
!= NULL
)
2001 newly_added_os
->next
->prev
= newly_added_os
;
2002 *place
->os_tail
= newly_added_os
;
2003 place
->os_tail
= &newly_added_os
->next
;
2005 /* Fixing the global list pointer here is a little different.
2006 We added to the list in lang_enter_output_section_statement,
2007 trimmed off the new output_section_statment above when
2008 assigning *os_tail = NULL, but possibly added it back in
2009 the same place when assigning *place->os_tail. */
2010 if (*os_tail
== NULL
)
2011 lang_output_section_statement
.tail
2012 = (lang_statement_union_type
**) os_tail
;
2019 lang_print_asneeded (void)
2021 struct asneeded_minfo
*m
;
2024 if (asneeded_list_head
== NULL
)
2027 sprintf (buf
, _("\nAs-needed library included "
2028 "to satisfy reference by file (symbol)\n\n"));
2031 for (m
= asneeded_list_head
; m
!= NULL
; m
= m
->next
)
2035 minfo ("%s", m
->soname
);
2036 len
= strlen (m
->soname
);
2050 minfo ("%B ", m
->ref
);
2051 minfo ("(%T)\n", m
->name
);
2056 lang_map_flags (flagword flag
)
2058 if (flag
& SEC_ALLOC
)
2061 if (flag
& SEC_CODE
)
2064 if (flag
& SEC_READONLY
)
2067 if (flag
& SEC_DATA
)
2070 if (flag
& SEC_LOAD
)
2077 lang_memory_region_type
*m
;
2078 bfd_boolean dis_header_printed
= FALSE
;
2080 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2084 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2085 || file
->flags
.just_syms
)
2088 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2089 if ((s
->output_section
== NULL
2090 || s
->output_section
->owner
!= link_info
.output_bfd
)
2091 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2093 if (!dis_header_printed
)
2095 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2096 dis_header_printed
= TRUE
;
2099 print_input_section (s
, TRUE
);
2103 minfo (_("\nMemory Configuration\n\n"));
2104 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2105 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2107 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2112 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2114 sprintf_vma (buf
, m
->origin
);
2115 minfo ("0x%s ", buf
);
2123 minfo ("0x%V", m
->length
);
2124 if (m
->flags
|| m
->not_flags
)
2132 lang_map_flags (m
->flags
);
2138 lang_map_flags (m
->not_flags
);
2145 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2147 if (!link_info
.reduce_memory_overheads
)
2149 obstack_begin (&map_obstack
, 1000);
2150 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2152 lang_statement_iteration
++;
2153 print_statements ();
2155 ldemul_extra_map_file_text (link_info
.output_bfd
, &link_info
,
2160 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2161 void *info ATTRIBUTE_UNUSED
)
2163 if ((hash_entry
->type
== bfd_link_hash_defined
2164 || hash_entry
->type
== bfd_link_hash_defweak
)
2165 && hash_entry
->u
.def
.section
->owner
!= link_info
.output_bfd
2166 && hash_entry
->u
.def
.section
->owner
!= NULL
)
2168 input_section_userdata_type
*ud
;
2169 struct map_symbol_def
*def
;
2171 ud
= ((input_section_userdata_type
*)
2172 get_userdata (hash_entry
->u
.def
.section
));
2175 ud
= (input_section_userdata_type
*) stat_alloc (sizeof (*ud
));
2176 get_userdata (hash_entry
->u
.def
.section
) = ud
;
2177 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2178 ud
->map_symbol_def_count
= 0;
2180 else if (!ud
->map_symbol_def_tail
)
2181 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2183 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2184 def
->entry
= hash_entry
;
2185 *(ud
->map_symbol_def_tail
) = def
;
2186 ud
->map_symbol_def_tail
= &def
->next
;
2187 ud
->map_symbol_def_count
++;
2192 /* Initialize an output section. */
2195 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2197 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2198 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2200 if (s
->constraint
!= SPECIAL
)
2201 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2202 if (s
->bfd_section
== NULL
)
2203 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2205 if (s
->bfd_section
== NULL
)
2207 einfo (_("%P%F: output format %s cannot represent section"
2208 " called %s: %E\n"),
2209 link_info
.output_bfd
->xvec
->name
, s
->name
);
2211 s
->bfd_section
->output_section
= s
->bfd_section
;
2212 s
->bfd_section
->output_offset
= 0;
2214 /* Set the userdata of the output section to the output section
2215 statement to avoid lookup. */
2216 get_userdata (s
->bfd_section
) = s
;
2218 /* If there is a base address, make sure that any sections it might
2219 mention are initialized. */
2220 if (s
->addr_tree
!= NULL
)
2221 exp_init_os (s
->addr_tree
);
2223 if (s
->load_base
!= NULL
)
2224 exp_init_os (s
->load_base
);
2226 /* If supplied an alignment, set it. */
2227 if (s
->section_alignment
!= -1)
2228 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2231 /* Make sure that all output sections mentioned in an expression are
2235 exp_init_os (etree_type
*exp
)
2237 switch (exp
->type
.node_class
)
2241 exp_init_os (exp
->assign
.src
);
2245 exp_init_os (exp
->binary
.lhs
);
2246 exp_init_os (exp
->binary
.rhs
);
2250 exp_init_os (exp
->trinary
.cond
);
2251 exp_init_os (exp
->trinary
.lhs
);
2252 exp_init_os (exp
->trinary
.rhs
);
2256 exp_init_os (exp
->assert_s
.child
);
2260 exp_init_os (exp
->unary
.child
);
2264 switch (exp
->type
.node_code
)
2270 lang_output_section_statement_type
*os
;
2272 os
= lang_output_section_find (exp
->name
.name
);
2273 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2285 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2287 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2289 /* If we are only reading symbols from this object, then we want to
2290 discard all sections. */
2291 if (entry
->flags
.just_syms
)
2293 bfd_link_just_syms (abfd
, sec
, &link_info
);
2297 /* Deal with SHF_EXCLUDE ELF sections. */
2298 if (!bfd_link_relocatable (&link_info
)
2299 && (abfd
->flags
& BFD_PLUGIN
) == 0
2300 && (sec
->flags
& (SEC_GROUP
| SEC_KEEP
| SEC_EXCLUDE
)) == SEC_EXCLUDE
)
2301 sec
->output_section
= bfd_abs_section_ptr
;
2303 if (!(abfd
->flags
& DYNAMIC
))
2304 bfd_section_already_linked (abfd
, sec
, &link_info
);
2307 /* The wild routines.
2309 These expand statements like *(.text) and foo.o to a list of
2310 explicit actions, like foo.o(.text), bar.o(.text) and
2311 foo.o(.text, .data). */
2313 /* Add SECTION to the output section OUTPUT. Do this by creating a
2314 lang_input_section statement which is placed at PTR. */
2317 lang_add_section (lang_statement_list_type
*ptr
,
2319 struct flag_info
*sflag_info
,
2320 lang_output_section_statement_type
*output
)
2322 flagword flags
= section
->flags
;
2324 bfd_boolean discard
;
2325 lang_input_section_type
*new_section
;
2326 bfd
*abfd
= link_info
.output_bfd
;
2328 /* Discard sections marked with SEC_EXCLUDE. */
2329 discard
= (flags
& SEC_EXCLUDE
) != 0;
2331 /* Discard input sections which are assigned to a section named
2332 DISCARD_SECTION_NAME. */
2333 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2336 /* Discard debugging sections if we are stripping debugging
2338 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2339 && (flags
& SEC_DEBUGGING
) != 0)
2344 if (section
->output_section
== NULL
)
2346 /* This prevents future calls from assigning this section. */
2347 section
->output_section
= bfd_abs_section_ptr
;
2356 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2361 if (section
->output_section
!= NULL
)
2364 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2365 to an output section, because we want to be able to include a
2366 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2367 section (I don't know why we want to do this, but we do).
2368 build_link_order in ldwrite.c handles this case by turning
2369 the embedded SEC_NEVER_LOAD section into a fill. */
2370 flags
&= ~ SEC_NEVER_LOAD
;
2372 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2373 already been processed. One reason to do this is that on pe
2374 format targets, .text$foo sections go into .text and it's odd
2375 to see .text with SEC_LINK_ONCE set. */
2377 if (!bfd_link_relocatable (&link_info
))
2378 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2380 switch (output
->sectype
)
2382 case normal_section
:
2383 case overlay_section
:
2385 case noalloc_section
:
2386 flags
&= ~SEC_ALLOC
;
2388 case noload_section
:
2390 flags
|= SEC_NEVER_LOAD
;
2391 /* Unfortunately GNU ld has managed to evolve two different
2392 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2393 alloc, no contents section. All others get a noload, noalloc
2395 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2396 flags
&= ~SEC_HAS_CONTENTS
;
2398 flags
&= ~SEC_ALLOC
;
2402 if (output
->bfd_section
== NULL
)
2403 init_os (output
, flags
);
2405 /* If SEC_READONLY is not set in the input section, then clear
2406 it from the output section. */
2407 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2409 if (output
->bfd_section
->linker_has_input
)
2411 /* Only set SEC_READONLY flag on the first input section. */
2412 flags
&= ~ SEC_READONLY
;
2414 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2415 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2416 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2417 || ((flags
& SEC_MERGE
) != 0
2418 && output
->bfd_section
->entsize
!= section
->entsize
))
2420 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2421 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2424 output
->bfd_section
->flags
|= flags
;
2426 if (!output
->bfd_section
->linker_has_input
)
2428 output
->bfd_section
->linker_has_input
= 1;
2429 /* This must happen after flags have been updated. The output
2430 section may have been created before we saw its first input
2431 section, eg. for a data statement. */
2432 bfd_init_private_section_data (section
->owner
, section
,
2433 link_info
.output_bfd
,
2434 output
->bfd_section
,
2436 if ((flags
& SEC_MERGE
) != 0)
2437 output
->bfd_section
->entsize
= section
->entsize
;
2440 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2441 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2443 /* FIXME: This value should really be obtained from the bfd... */
2444 output
->block_value
= 128;
2447 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2448 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2450 section
->output_section
= output
->bfd_section
;
2452 if (!map_head_is_link_order
)
2454 asection
*s
= output
->bfd_section
->map_tail
.s
;
2455 output
->bfd_section
->map_tail
.s
= section
;
2456 section
->map_head
.s
= NULL
;
2457 section
->map_tail
.s
= s
;
2459 s
->map_head
.s
= section
;
2461 output
->bfd_section
->map_head
.s
= section
;
2464 /* Add a section reference to the list. */
2465 new_section
= new_stat (lang_input_section
, ptr
);
2466 new_section
->section
= section
;
2469 /* Handle wildcard sorting. This returns the lang_input_section which
2470 should follow the one we are going to create for SECTION and FILE,
2471 based on the sorting requirements of WILD. It returns NULL if the
2472 new section should just go at the end of the current list. */
2474 static lang_statement_union_type
*
2475 wild_sort (lang_wild_statement_type
*wild
,
2476 struct wildcard_list
*sec
,
2477 lang_input_statement_type
*file
,
2480 lang_statement_union_type
*l
;
2482 if (!wild
->filenames_sorted
2483 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2486 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2488 lang_input_section_type
*ls
;
2490 if (l
->header
.type
!= lang_input_section_enum
)
2492 ls
= &l
->input_section
;
2494 /* Sorting by filename takes precedence over sorting by section
2497 if (wild
->filenames_sorted
)
2499 const char *fn
, *ln
;
2503 /* The PE support for the .idata section as generated by
2504 dlltool assumes that files will be sorted by the name of
2505 the archive and then the name of the file within the
2508 if (file
->the_bfd
!= NULL
2509 && file
->the_bfd
->my_archive
!= NULL
)
2511 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2516 fn
= file
->filename
;
2520 if (ls
->section
->owner
->my_archive
!= NULL
)
2522 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2527 ln
= ls
->section
->owner
->filename
;
2531 i
= filename_cmp (fn
, ln
);
2540 fn
= file
->filename
;
2542 ln
= ls
->section
->owner
->filename
;
2544 i
= filename_cmp (fn
, ln
);
2552 /* Here either the files are not sorted by name, or we are
2553 looking at the sections for this file. */
2556 && sec
->spec
.sorted
!= none
2557 && sec
->spec
.sorted
!= by_none
)
2558 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2565 /* Expand a wild statement for a particular FILE. SECTION may be
2566 NULL, in which case it is a wild card. */
2569 output_section_callback (lang_wild_statement_type
*ptr
,
2570 struct wildcard_list
*sec
,
2572 struct flag_info
*sflag_info
,
2573 lang_input_statement_type
*file
,
2576 lang_statement_union_type
*before
;
2577 lang_output_section_statement_type
*os
;
2579 os
= (lang_output_section_statement_type
*) output
;
2581 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2582 if (unique_section_p (section
, os
))
2585 before
= wild_sort (ptr
, sec
, file
, section
);
2587 /* Here BEFORE points to the lang_input_section which
2588 should follow the one we are about to add. If BEFORE
2589 is NULL, then the section should just go at the end
2590 of the current list. */
2593 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2596 lang_statement_list_type list
;
2597 lang_statement_union_type
**pp
;
2599 lang_list_init (&list
);
2600 lang_add_section (&list
, section
, sflag_info
, os
);
2602 /* If we are discarding the section, LIST.HEAD will
2604 if (list
.head
!= NULL
)
2606 ASSERT (list
.head
->header
.next
== NULL
);
2608 for (pp
= &ptr
->children
.head
;
2610 pp
= &(*pp
)->header
.next
)
2611 ASSERT (*pp
!= NULL
);
2613 list
.head
->header
.next
= *pp
;
2619 /* Check if all sections in a wild statement for a particular FILE
2623 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2624 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2626 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2627 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2630 lang_output_section_statement_type
*os
;
2632 os
= (lang_output_section_statement_type
*) output
;
2634 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2635 if (unique_section_p (section
, os
))
2638 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2639 os
->all_input_readonly
= FALSE
;
2642 /* This is passed a file name which must have been seen already and
2643 added to the statement tree. We will see if it has been opened
2644 already and had its symbols read. If not then we'll read it. */
2646 static lang_input_statement_type
*
2647 lookup_name (const char *name
)
2649 lang_input_statement_type
*search
;
2651 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2653 search
= (lang_input_statement_type
*) search
->next_real_file
)
2655 /* Use the local_sym_name as the name of the file that has
2656 already been loaded as filename might have been transformed
2657 via the search directory lookup mechanism. */
2658 const char *filename
= search
->local_sym_name
;
2660 if (filename
!= NULL
2661 && filename_cmp (filename
, name
) == 0)
2666 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2667 default_target
, FALSE
);
2669 /* If we have already added this file, or this file is not real
2670 don't add this file. */
2671 if (search
->flags
.loaded
|| !search
->flags
.real
)
2674 if (!load_symbols (search
, NULL
))
2680 /* Save LIST as a list of libraries whose symbols should not be exported. */
2685 struct excluded_lib
*next
;
2687 static struct excluded_lib
*excluded_libs
;
2690 add_excluded_libs (const char *list
)
2692 const char *p
= list
, *end
;
2696 struct excluded_lib
*entry
;
2697 end
= strpbrk (p
, ",:");
2699 end
= p
+ strlen (p
);
2700 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2701 entry
->next
= excluded_libs
;
2702 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2703 memcpy (entry
->name
, p
, end
- p
);
2704 entry
->name
[end
- p
] = '\0';
2705 excluded_libs
= entry
;
2713 check_excluded_libs (bfd
*abfd
)
2715 struct excluded_lib
*lib
= excluded_libs
;
2719 int len
= strlen (lib
->name
);
2720 const char *filename
= lbasename (abfd
->filename
);
2722 if (strcmp (lib
->name
, "ALL") == 0)
2724 abfd
->no_export
= TRUE
;
2728 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2729 && (filename
[len
] == '\0'
2730 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2731 && filename
[len
+ 2] == '\0')))
2733 abfd
->no_export
= TRUE
;
2741 /* Get the symbols for an input file. */
2744 load_symbols (lang_input_statement_type
*entry
,
2745 lang_statement_list_type
*place
)
2749 if (entry
->flags
.loaded
)
2752 ldfile_open_file (entry
);
2754 /* Do not process further if the file was missing. */
2755 if (entry
->flags
.missing_file
)
2758 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
2759 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2762 struct lang_input_statement_flags save_flags
;
2765 err
= bfd_get_error ();
2767 /* See if the emulation has some special knowledge. */
2768 if (ldemul_unrecognized_file (entry
))
2771 if (err
== bfd_error_file_ambiguously_recognized
)
2775 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2776 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2777 for (p
= matching
; *p
!= NULL
; p
++)
2781 else if (err
!= bfd_error_file_not_recognized
2783 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2785 bfd_close (entry
->the_bfd
);
2786 entry
->the_bfd
= NULL
;
2788 /* Try to interpret the file as a linker script. */
2789 save_flags
= input_flags
;
2790 ldfile_open_command_file (entry
->filename
);
2792 push_stat_ptr (place
);
2793 input_flags
.add_DT_NEEDED_for_regular
2794 = entry
->flags
.add_DT_NEEDED_for_regular
;
2795 input_flags
.add_DT_NEEDED_for_dynamic
2796 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2797 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2798 input_flags
.dynamic
= entry
->flags
.dynamic
;
2800 ldfile_assumed_script
= TRUE
;
2801 parser_input
= input_script
;
2803 ldfile_assumed_script
= FALSE
;
2805 /* missing_file is sticky. sysrooted will already have been
2806 restored when seeing EOF in yyparse, but no harm to restore
2808 save_flags
.missing_file
|= input_flags
.missing_file
;
2809 input_flags
= save_flags
;
2813 entry
->flags
.loaded
= TRUE
;
2818 if (ldemul_recognized_file (entry
))
2821 /* We don't call ldlang_add_file for an archive. Instead, the
2822 add_symbols entry point will call ldlang_add_file, via the
2823 add_archive_element callback, for each element of the archive
2825 switch (bfd_get_format (entry
->the_bfd
))
2831 if (!entry
->flags
.reload
)
2832 ldlang_add_file (entry
);
2833 if (trace_files
|| verbose
)
2834 info_msg ("%I\n", entry
);
2838 check_excluded_libs (entry
->the_bfd
);
2840 if (entry
->flags
.whole_archive
)
2843 bfd_boolean loaded
= TRUE
;
2848 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2853 if (!bfd_check_format (member
, bfd_object
))
2855 einfo (_("%F%B: member %B in archive is not an object\n"),
2856 entry
->the_bfd
, member
);
2861 if (!(*link_info
.callbacks
2862 ->add_archive_element
) (&link_info
, member
,
2863 "--whole-archive", &subsbfd
))
2866 /* Potentially, the add_archive_element hook may have set a
2867 substitute BFD for us. */
2868 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2870 einfo (_("%F%B: error adding symbols: %E\n"), member
);
2875 entry
->flags
.loaded
= loaded
;
2881 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2882 entry
->flags
.loaded
= TRUE
;
2884 einfo (_("%F%B: error adding symbols: %E\n"), entry
->the_bfd
);
2886 return entry
->flags
.loaded
;
2889 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2890 may be NULL, indicating that it is a wildcard. Separate
2891 lang_input_section statements are created for each part of the
2892 expansion; they are added after the wild statement S. OUTPUT is
2893 the output section. */
2896 wild (lang_wild_statement_type
*s
,
2897 const char *target ATTRIBUTE_UNUSED
,
2898 lang_output_section_statement_type
*output
)
2900 struct wildcard_list
*sec
;
2902 if (s
->handler_data
[0]
2903 && s
->handler_data
[0]->spec
.sorted
== by_name
2904 && !s
->filenames_sorted
)
2906 lang_section_bst_type
*tree
;
2908 walk_wild (s
, output_section_callback_fast
, output
);
2913 output_section_callback_tree_to_list (s
, tree
, output
);
2918 walk_wild (s
, output_section_callback
, output
);
2920 if (default_common_section
== NULL
)
2921 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2922 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2924 /* Remember the section that common is going to in case we
2925 later get something which doesn't know where to put it. */
2926 default_common_section
= output
;
2931 /* Return TRUE iff target is the sought target. */
2934 get_target (const bfd_target
*target
, void *data
)
2936 const char *sought
= (const char *) data
;
2938 return strcmp (target
->name
, sought
) == 0;
2941 /* Like strcpy() but convert to lower case as well. */
2944 stricpy (char *dest
, char *src
)
2948 while ((c
= *src
++) != 0)
2949 *dest
++ = TOLOWER (c
);
2954 /* Remove the first occurrence of needle (if any) in haystack
2958 strcut (char *haystack
, char *needle
)
2960 haystack
= strstr (haystack
, needle
);
2966 for (src
= haystack
+ strlen (needle
); *src
;)
2967 *haystack
++ = *src
++;
2973 /* Compare two target format name strings.
2974 Return a value indicating how "similar" they are. */
2977 name_compare (char *first
, char *second
)
2983 copy1
= (char *) xmalloc (strlen (first
) + 1);
2984 copy2
= (char *) xmalloc (strlen (second
) + 1);
2986 /* Convert the names to lower case. */
2987 stricpy (copy1
, first
);
2988 stricpy (copy2
, second
);
2990 /* Remove size and endian strings from the name. */
2991 strcut (copy1
, "big");
2992 strcut (copy1
, "little");
2993 strcut (copy2
, "big");
2994 strcut (copy2
, "little");
2996 /* Return a value based on how many characters match,
2997 starting from the beginning. If both strings are
2998 the same then return 10 * their length. */
2999 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
3000 if (copy1
[result
] == 0)
3012 /* Set by closest_target_match() below. */
3013 static const bfd_target
*winner
;
3015 /* Scan all the valid bfd targets looking for one that has the endianness
3016 requirement that was specified on the command line, and is the nearest
3017 match to the original output target. */
3020 closest_target_match (const bfd_target
*target
, void *data
)
3022 const bfd_target
*original
= (const bfd_target
*) data
;
3024 if (command_line
.endian
== ENDIAN_BIG
3025 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3028 if (command_line
.endian
== ENDIAN_LITTLE
3029 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3032 /* Must be the same flavour. */
3033 if (target
->flavour
!= original
->flavour
)
3036 /* Ignore generic big and little endian elf vectors. */
3037 if (strcmp (target
->name
, "elf32-big") == 0
3038 || strcmp (target
->name
, "elf64-big") == 0
3039 || strcmp (target
->name
, "elf32-little") == 0
3040 || strcmp (target
->name
, "elf64-little") == 0)
3043 /* If we have not found a potential winner yet, then record this one. */
3050 /* Oh dear, we now have two potential candidates for a successful match.
3051 Compare their names and choose the better one. */
3052 if (name_compare (target
->name
, original
->name
)
3053 > name_compare (winner
->name
, original
->name
))
3056 /* Keep on searching until wqe have checked them all. */
3060 /* Return the BFD target format of the first input file. */
3063 get_first_input_target (void)
3065 char *target
= NULL
;
3067 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3069 if (s
->header
.type
== lang_input_statement_enum
3072 ldfile_open_file (s
);
3074 if (s
->the_bfd
!= NULL
3075 && bfd_check_format (s
->the_bfd
, bfd_object
))
3077 target
= bfd_get_target (s
->the_bfd
);
3089 lang_get_output_target (void)
3093 /* Has the user told us which output format to use? */
3094 if (output_target
!= NULL
)
3095 return output_target
;
3097 /* No - has the current target been set to something other than
3099 if (current_target
!= default_target
&& current_target
!= NULL
)
3100 return current_target
;
3102 /* No - can we determine the format of the first input file? */
3103 target
= get_first_input_target ();
3107 /* Failed - use the default output target. */
3108 return default_target
;
3111 /* Open the output file. */
3114 open_output (const char *name
)
3116 output_target
= lang_get_output_target ();
3118 /* Has the user requested a particular endianness on the command
3120 if (command_line
.endian
!= ENDIAN_UNSET
)
3122 /* Get the chosen target. */
3123 const bfd_target
*target
3124 = bfd_iterate_over_targets (get_target
, (void *) output_target
);
3126 /* If the target is not supported, we cannot do anything. */
3129 enum bfd_endian desired_endian
;
3131 if (command_line
.endian
== ENDIAN_BIG
)
3132 desired_endian
= BFD_ENDIAN_BIG
;
3134 desired_endian
= BFD_ENDIAN_LITTLE
;
3136 /* See if the target has the wrong endianness. This should
3137 not happen if the linker script has provided big and
3138 little endian alternatives, but some scrips don't do
3140 if (target
->byteorder
!= desired_endian
)
3142 /* If it does, then see if the target provides
3143 an alternative with the correct endianness. */
3144 if (target
->alternative_target
!= NULL
3145 && (target
->alternative_target
->byteorder
== desired_endian
))
3146 output_target
= target
->alternative_target
->name
;
3149 /* Try to find a target as similar as possible to
3150 the default target, but which has the desired
3151 endian characteristic. */
3152 bfd_iterate_over_targets (closest_target_match
,
3155 /* Oh dear - we could not find any targets that
3156 satisfy our requirements. */
3158 einfo (_("%P: warning: could not find any targets"
3159 " that match endianness requirement\n"));
3161 output_target
= winner
->name
;
3167 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3169 if (link_info
.output_bfd
== NULL
)
3171 if (bfd_get_error () == bfd_error_invalid_target
)
3172 einfo (_("%P%F: target %s not found\n"), output_target
);
3174 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3177 delete_output_file_on_failure
= TRUE
;
3179 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3180 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3181 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3182 ldfile_output_architecture
,
3183 ldfile_output_machine
))
3184 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3186 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3187 if (link_info
.hash
== NULL
)
3188 einfo (_("%P%F: can not create hash table: %E\n"));
3190 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3194 ldlang_open_output (lang_statement_union_type
*statement
)
3196 switch (statement
->header
.type
)
3198 case lang_output_statement_enum
:
3199 ASSERT (link_info
.output_bfd
== NULL
);
3200 open_output (statement
->output_statement
.name
);
3201 ldemul_set_output_arch ();
3202 if (config
.magic_demand_paged
3203 && !bfd_link_relocatable (&link_info
))
3204 link_info
.output_bfd
->flags
|= D_PAGED
;
3206 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3207 if (config
.text_read_only
)
3208 link_info
.output_bfd
->flags
|= WP_TEXT
;
3210 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3211 if (link_info
.traditional_format
)
3212 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3214 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3217 case lang_target_statement_enum
:
3218 current_target
= statement
->target_statement
.target
;
3228 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3229 ldfile_output_machine
);
3232 while ((x
& 1) == 0)
3240 /* Open all the input files. */
3244 OPEN_BFD_NORMAL
= 0,
3248 #ifdef ENABLE_PLUGINS
3249 static lang_input_statement_type
*plugin_insert
= NULL
;
3253 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3255 for (; s
!= NULL
; s
= s
->header
.next
)
3257 switch (s
->header
.type
)
3259 case lang_constructors_statement_enum
:
3260 open_input_bfds (constructor_list
.head
, mode
);
3262 case lang_output_section_statement_enum
:
3263 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3265 case lang_wild_statement_enum
:
3266 /* Maybe we should load the file's symbols. */
3267 if ((mode
& OPEN_BFD_RESCAN
) == 0
3268 && s
->wild_statement
.filename
3269 && !wildcardp (s
->wild_statement
.filename
)
3270 && !archive_path (s
->wild_statement
.filename
))
3271 lookup_name (s
->wild_statement
.filename
);
3272 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3274 case lang_group_statement_enum
:
3276 struct bfd_link_hash_entry
*undefs
;
3278 /* We must continually search the entries in the group
3279 until no new symbols are added to the list of undefined
3284 undefs
= link_info
.hash
->undefs_tail
;
3285 open_input_bfds (s
->group_statement
.children
.head
,
3286 mode
| OPEN_BFD_FORCE
);
3288 while (undefs
!= link_info
.hash
->undefs_tail
);
3291 case lang_target_statement_enum
:
3292 current_target
= s
->target_statement
.target
;
3294 case lang_input_statement_enum
:
3295 if (s
->input_statement
.flags
.real
)
3297 lang_statement_union_type
**os_tail
;
3298 lang_statement_list_type add
;
3301 s
->input_statement
.target
= current_target
;
3303 /* If we are being called from within a group, and this
3304 is an archive which has already been searched, then
3305 force it to be researched unless the whole archive
3306 has been loaded already. Do the same for a rescan.
3307 Likewise reload --as-needed shared libs. */
3308 if (mode
!= OPEN_BFD_NORMAL
3309 #ifdef ENABLE_PLUGINS
3310 && ((mode
& OPEN_BFD_RESCAN
) == 0
3311 || plugin_insert
== NULL
)
3313 && s
->input_statement
.flags
.loaded
3314 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3315 && ((bfd_get_format (abfd
) == bfd_archive
3316 && !s
->input_statement
.flags
.whole_archive
)
3317 || (bfd_get_format (abfd
) == bfd_object
3318 && ((abfd
->flags
) & DYNAMIC
) != 0
3319 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3320 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3321 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3323 s
->input_statement
.flags
.loaded
= FALSE
;
3324 s
->input_statement
.flags
.reload
= TRUE
;
3327 os_tail
= lang_output_section_statement
.tail
;
3328 lang_list_init (&add
);
3330 if (!load_symbols (&s
->input_statement
, &add
))
3331 config
.make_executable
= FALSE
;
3333 if (add
.head
!= NULL
)
3335 /* If this was a script with output sections then
3336 tack any added statements on to the end of the
3337 list. This avoids having to reorder the output
3338 section statement list. Very likely the user
3339 forgot -T, and whatever we do here will not meet
3340 naive user expectations. */
3341 if (os_tail
!= lang_output_section_statement
.tail
)
3343 einfo (_("%P: warning: %s contains output sections;"
3344 " did you forget -T?\n"),
3345 s
->input_statement
.filename
);
3346 *stat_ptr
->tail
= add
.head
;
3347 stat_ptr
->tail
= add
.tail
;
3351 *add
.tail
= s
->header
.next
;
3352 s
->header
.next
= add
.head
;
3356 #ifdef ENABLE_PLUGINS
3357 /* If we have found the point at which a plugin added new
3358 files, clear plugin_insert to enable archive rescan. */
3359 if (&s
->input_statement
== plugin_insert
)
3360 plugin_insert
= NULL
;
3363 case lang_assignment_statement_enum
:
3364 if (s
->assignment_statement
.exp
->assign
.defsym
)
3365 /* This is from a --defsym on the command line. */
3366 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3373 /* Exit if any of the files were missing. */
3374 if (input_flags
.missing_file
)
3378 /* Add the supplied name to the symbol table as an undefined reference.
3379 This is a two step process as the symbol table doesn't even exist at
3380 the time the ld command line is processed. First we put the name
3381 on a list, then, once the output file has been opened, transfer the
3382 name to the symbol table. */
3384 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3386 #define ldlang_undef_chain_list_head entry_symbol.next
3389 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3391 ldlang_undef_chain_list_type
*new_undef
;
3393 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3394 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3395 new_undef
->next
= ldlang_undef_chain_list_head
;
3396 ldlang_undef_chain_list_head
= new_undef
;
3398 new_undef
->name
= xstrdup (name
);
3400 if (link_info
.output_bfd
!= NULL
)
3401 insert_undefined (new_undef
->name
);
3404 /* Insert NAME as undefined in the symbol table. */
3407 insert_undefined (const char *name
)
3409 struct bfd_link_hash_entry
*h
;
3411 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3413 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3414 if (h
->type
== bfd_link_hash_new
)
3416 h
->type
= bfd_link_hash_undefined
;
3417 h
->u
.undef
.abfd
= NULL
;
3418 bfd_link_add_undef (link_info
.hash
, h
);
3422 /* Run through the list of undefineds created above and place them
3423 into the linker hash table as undefined symbols belonging to the
3427 lang_place_undefineds (void)
3429 ldlang_undef_chain_list_type
*ptr
;
3431 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3432 insert_undefined (ptr
->name
);
3435 /* Structure used to build the list of symbols that the user has required
3438 struct require_defined_symbol
3441 struct require_defined_symbol
*next
;
3444 /* The list of symbols that the user has required be defined. */
3446 static struct require_defined_symbol
*require_defined_symbol_list
;
3448 /* Add a new symbol NAME to the list of symbols that are required to be
3452 ldlang_add_require_defined (const char *const name
)
3454 struct require_defined_symbol
*ptr
;
3456 ldlang_add_undef (name
, TRUE
);
3457 ptr
= (struct require_defined_symbol
*) stat_alloc (sizeof (*ptr
));
3458 ptr
->next
= require_defined_symbol_list
;
3459 ptr
->name
= strdup (name
);
3460 require_defined_symbol_list
= ptr
;
3463 /* Check that all symbols the user required to be defined, are defined,
3464 raise an error if we find a symbol that is not defined. */
3467 ldlang_check_require_defined_symbols (void)
3469 struct require_defined_symbol
*ptr
;
3471 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
3473 struct bfd_link_hash_entry
*h
;
3475 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
3476 FALSE
, FALSE
, TRUE
);
3478 || (h
->type
!= bfd_link_hash_defined
3479 && h
->type
!= bfd_link_hash_defweak
))
3480 einfo(_("%P%X: required symbol `%s' not defined\n"), ptr
->name
);
3484 /* Check for all readonly or some readwrite sections. */
3487 check_input_sections
3488 (lang_statement_union_type
*s
,
3489 lang_output_section_statement_type
*output_section_statement
)
3491 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3493 switch (s
->header
.type
)
3495 case lang_wild_statement_enum
:
3496 walk_wild (&s
->wild_statement
, check_section_callback
,
3497 output_section_statement
);
3498 if (!output_section_statement
->all_input_readonly
)
3501 case lang_constructors_statement_enum
:
3502 check_input_sections (constructor_list
.head
,
3503 output_section_statement
);
3504 if (!output_section_statement
->all_input_readonly
)
3507 case lang_group_statement_enum
:
3508 check_input_sections (s
->group_statement
.children
.head
,
3509 output_section_statement
);
3510 if (!output_section_statement
->all_input_readonly
)
3519 /* Update wildcard statements if needed. */
3522 update_wild_statements (lang_statement_union_type
*s
)
3524 struct wildcard_list
*sec
;
3526 switch (sort_section
)
3536 for (; s
!= NULL
; s
= s
->header
.next
)
3538 switch (s
->header
.type
)
3543 case lang_wild_statement_enum
:
3544 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3547 switch (sec
->spec
.sorted
)
3550 sec
->spec
.sorted
= sort_section
;
3553 if (sort_section
== by_alignment
)
3554 sec
->spec
.sorted
= by_name_alignment
;
3557 if (sort_section
== by_name
)
3558 sec
->spec
.sorted
= by_alignment_name
;
3566 case lang_constructors_statement_enum
:
3567 update_wild_statements (constructor_list
.head
);
3570 case lang_output_section_statement_enum
:
3571 /* Don't sort .init/.fini sections. */
3572 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3573 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3574 update_wild_statements
3575 (s
->output_section_statement
.children
.head
);
3578 case lang_group_statement_enum
:
3579 update_wild_statements (s
->group_statement
.children
.head
);
3587 /* Open input files and attach to output sections. */
3590 map_input_to_output_sections
3591 (lang_statement_union_type
*s
, const char *target
,
3592 lang_output_section_statement_type
*os
)
3594 for (; s
!= NULL
; s
= s
->header
.next
)
3596 lang_output_section_statement_type
*tos
;
3599 switch (s
->header
.type
)
3601 case lang_wild_statement_enum
:
3602 wild (&s
->wild_statement
, target
, os
);
3604 case lang_constructors_statement_enum
:
3605 map_input_to_output_sections (constructor_list
.head
,
3609 case lang_output_section_statement_enum
:
3610 tos
= &s
->output_section_statement
;
3611 if (tos
->constraint
!= 0)
3613 if (tos
->constraint
!= ONLY_IF_RW
3614 && tos
->constraint
!= ONLY_IF_RO
)
3616 tos
->all_input_readonly
= TRUE
;
3617 check_input_sections (tos
->children
.head
, tos
);
3618 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3620 tos
->constraint
= -1;
3624 map_input_to_output_sections (tos
->children
.head
,
3628 case lang_output_statement_enum
:
3630 case lang_target_statement_enum
:
3631 target
= s
->target_statement
.target
;
3633 case lang_group_statement_enum
:
3634 map_input_to_output_sections (s
->group_statement
.children
.head
,
3638 case lang_data_statement_enum
:
3639 /* Make sure that any sections mentioned in the expression
3641 exp_init_os (s
->data_statement
.exp
);
3642 /* The output section gets CONTENTS, ALLOC and LOAD, but
3643 these may be overridden by the script. */
3644 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3645 switch (os
->sectype
)
3647 case normal_section
:
3648 case overlay_section
:
3650 case noalloc_section
:
3651 flags
= SEC_HAS_CONTENTS
;
3653 case noload_section
:
3654 if (bfd_get_flavour (link_info
.output_bfd
)
3655 == bfd_target_elf_flavour
)
3656 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3658 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3661 if (os
->bfd_section
== NULL
)
3662 init_os (os
, flags
);
3664 os
->bfd_section
->flags
|= flags
;
3666 case lang_input_section_enum
:
3668 case lang_fill_statement_enum
:
3669 case lang_object_symbols_statement_enum
:
3670 case lang_reloc_statement_enum
:
3671 case lang_padding_statement_enum
:
3672 case lang_input_statement_enum
:
3673 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3676 case lang_assignment_statement_enum
:
3677 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3680 /* Make sure that any sections mentioned in the assignment
3682 exp_init_os (s
->assignment_statement
.exp
);
3684 case lang_address_statement_enum
:
3685 /* Mark the specified section with the supplied address.
3686 If this section was actually a segment marker, then the
3687 directive is ignored if the linker script explicitly
3688 processed the segment marker. Originally, the linker
3689 treated segment directives (like -Ttext on the
3690 command-line) as section directives. We honor the
3691 section directive semantics for backwards compatibilty;
3692 linker scripts that do not specifically check for
3693 SEGMENT_START automatically get the old semantics. */
3694 if (!s
->address_statement
.segment
3695 || !s
->address_statement
.segment
->used
)
3697 const char *name
= s
->address_statement
.section_name
;
3699 /* Create the output section statement here so that
3700 orphans with a set address will be placed after other
3701 script sections. If we let the orphan placement code
3702 place them in amongst other sections then the address
3703 will affect following script sections, which is
3704 likely to surprise naive users. */
3705 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3706 tos
->addr_tree
= s
->address_statement
.address
;
3707 if (tos
->bfd_section
== NULL
)
3711 case lang_insert_statement_enum
:
3717 /* An insert statement snips out all the linker statements from the
3718 start of the list and places them after the output section
3719 statement specified by the insert. This operation is complicated
3720 by the fact that we keep a doubly linked list of output section
3721 statements as well as the singly linked list of all statements. */
3724 process_insert_statements (void)
3726 lang_statement_union_type
**s
;
3727 lang_output_section_statement_type
*first_os
= NULL
;
3728 lang_output_section_statement_type
*last_os
= NULL
;
3729 lang_output_section_statement_type
*os
;
3731 /* "start of list" is actually the statement immediately after
3732 the special abs_section output statement, so that it isn't
3734 s
= &lang_output_section_statement
.head
;
3735 while (*(s
= &(*s
)->header
.next
) != NULL
)
3737 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3739 /* Keep pointers to the first and last output section
3740 statement in the sequence we may be about to move. */
3741 os
= &(*s
)->output_section_statement
;
3743 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3746 /* Set constraint negative so that lang_output_section_find
3747 won't match this output section statement. At this
3748 stage in linking constraint has values in the range
3749 [-1, ONLY_IN_RW]. */
3750 last_os
->constraint
= -2 - last_os
->constraint
;
3751 if (first_os
== NULL
)
3754 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3756 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3757 lang_output_section_statement_type
*where
;
3758 lang_statement_union_type
**ptr
;
3759 lang_statement_union_type
*first
;
3761 where
= lang_output_section_find (i
->where
);
3762 if (where
!= NULL
&& i
->is_before
)
3765 where
= where
->prev
;
3766 while (where
!= NULL
&& where
->constraint
< 0);
3770 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3774 /* Deal with reordering the output section statement list. */
3775 if (last_os
!= NULL
)
3777 asection
*first_sec
, *last_sec
;
3778 struct lang_output_section_statement_struct
**next
;
3780 /* Snip out the output sections we are moving. */
3781 first_os
->prev
->next
= last_os
->next
;
3782 if (last_os
->next
== NULL
)
3784 next
= &first_os
->prev
->next
;
3785 lang_output_section_statement
.tail
3786 = (lang_statement_union_type
**) next
;
3789 last_os
->next
->prev
= first_os
->prev
;
3790 /* Add them in at the new position. */
3791 last_os
->next
= where
->next
;
3792 if (where
->next
== NULL
)
3794 next
= &last_os
->next
;
3795 lang_output_section_statement
.tail
3796 = (lang_statement_union_type
**) next
;
3799 where
->next
->prev
= last_os
;
3800 first_os
->prev
= where
;
3801 where
->next
= first_os
;
3803 /* Move the bfd sections in the same way. */
3806 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3808 os
->constraint
= -2 - os
->constraint
;
3809 if (os
->bfd_section
!= NULL
3810 && os
->bfd_section
->owner
!= NULL
)
3812 last_sec
= os
->bfd_section
;
3813 if (first_sec
== NULL
)
3814 first_sec
= last_sec
;
3819 if (last_sec
!= NULL
)
3821 asection
*sec
= where
->bfd_section
;
3823 sec
= output_prev_sec_find (where
);
3825 /* The place we want to insert must come after the
3826 sections we are moving. So if we find no
3827 section or if the section is the same as our
3828 last section, then no move is needed. */
3829 if (sec
!= NULL
&& sec
!= last_sec
)
3831 /* Trim them off. */
3832 if (first_sec
->prev
!= NULL
)
3833 first_sec
->prev
->next
= last_sec
->next
;
3835 link_info
.output_bfd
->sections
= last_sec
->next
;
3836 if (last_sec
->next
!= NULL
)
3837 last_sec
->next
->prev
= first_sec
->prev
;
3839 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3841 last_sec
->next
= sec
->next
;
3842 if (sec
->next
!= NULL
)
3843 sec
->next
->prev
= last_sec
;
3845 link_info
.output_bfd
->section_last
= last_sec
;
3846 first_sec
->prev
= sec
;
3847 sec
->next
= first_sec
;
3855 ptr
= insert_os_after (where
);
3856 /* Snip everything after the abs_section output statement we
3857 know is at the start of the list, up to and including
3858 the insert statement we are currently processing. */
3859 first
= lang_output_section_statement
.head
->header
.next
;
3860 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3861 /* Add them back where they belong. */
3864 statement_list
.tail
= s
;
3866 s
= &lang_output_section_statement
.head
;
3870 /* Undo constraint twiddling. */
3871 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3873 os
->constraint
= -2 - os
->constraint
;
3879 /* An output section might have been removed after its statement was
3880 added. For example, ldemul_before_allocation can remove dynamic
3881 sections if they turn out to be not needed. Clean them up here. */
3884 strip_excluded_output_sections (void)
3886 lang_output_section_statement_type
*os
;
3888 /* Run lang_size_sections (if not already done). */
3889 if (expld
.phase
!= lang_mark_phase_enum
)
3891 expld
.phase
= lang_mark_phase_enum
;
3892 expld
.dataseg
.phase
= exp_dataseg_none
;
3893 one_lang_size_sections_pass (NULL
, FALSE
);
3894 lang_reset_memory_regions ();
3897 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3901 asection
*output_section
;
3902 bfd_boolean exclude
;
3904 if (os
->constraint
< 0)
3907 output_section
= os
->bfd_section
;
3908 if (output_section
== NULL
)
3911 exclude
= (output_section
->rawsize
== 0
3912 && (output_section
->flags
& SEC_KEEP
) == 0
3913 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3916 /* Some sections have not yet been sized, notably .gnu.version,
3917 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3918 input sections, so don't drop output sections that have such
3919 input sections unless they are also marked SEC_EXCLUDE. */
3920 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3924 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3925 if ((s
->flags
& SEC_EXCLUDE
) == 0
3926 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3927 || link_info
.emitrelocations
))
3936 /* We don't set bfd_section to NULL since bfd_section of the
3937 removed output section statement may still be used. */
3938 if (!os
->update_dot
)
3940 output_section
->flags
|= SEC_EXCLUDE
;
3941 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3942 link_info
.output_bfd
->section_count
--;
3947 /* Called from ldwrite to clear out asection.map_head and
3948 asection.map_tail for use as link_orders in ldwrite.
3949 FIXME: Except for sh64elf.em which starts creating link_orders in
3950 its after_allocation routine so needs to call it early. */
3953 lang_clear_os_map (void)
3955 lang_output_section_statement_type
*os
;
3957 if (map_head_is_link_order
)
3960 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3964 asection
*output_section
;
3966 if (os
->constraint
< 0)
3969 output_section
= os
->bfd_section
;
3970 if (output_section
== NULL
)
3973 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3974 output_section
->map_head
.link_order
= NULL
;
3975 output_section
->map_tail
.link_order
= NULL
;
3978 /* Stop future calls to lang_add_section from messing with map_head
3979 and map_tail link_order fields. */
3980 map_head_is_link_order
= TRUE
;
3984 print_output_section_statement
3985 (lang_output_section_statement_type
*output_section_statement
)
3987 asection
*section
= output_section_statement
->bfd_section
;
3990 if (output_section_statement
!= abs_output_section
)
3992 minfo ("\n%s", output_section_statement
->name
);
3994 if (section
!= NULL
)
3996 print_dot
= section
->vma
;
3998 len
= strlen (output_section_statement
->name
);
3999 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4004 while (len
< SECTION_NAME_MAP_LENGTH
)
4010 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4012 if (section
->vma
!= section
->lma
)
4013 minfo (_(" load address 0x%V"), section
->lma
);
4015 if (output_section_statement
->update_dot_tree
!= NULL
)
4016 exp_fold_tree (output_section_statement
->update_dot_tree
,
4017 bfd_abs_section_ptr
, &print_dot
);
4023 print_statement_list (output_section_statement
->children
.head
,
4024 output_section_statement
);
4028 print_assignment (lang_assignment_statement_type
*assignment
,
4029 lang_output_section_statement_type
*output_section
)
4036 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4039 if (assignment
->exp
->type
.node_class
== etree_assert
)
4042 tree
= assignment
->exp
->assert_s
.child
;
4046 const char *dst
= assignment
->exp
->assign
.dst
;
4048 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4050 expld
.assign_name
= dst
;
4051 tree
= assignment
->exp
->assign
.src
;
4054 osec
= output_section
->bfd_section
;
4056 osec
= bfd_abs_section_ptr
;
4058 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4059 exp_fold_tree (tree
, osec
, &print_dot
);
4061 expld
.result
.valid_p
= FALSE
;
4063 if (expld
.result
.valid_p
)
4067 if (assignment
->exp
->type
.node_class
== etree_assert
4069 || expld
.assign_name
!= NULL
)
4071 value
= expld
.result
.value
;
4073 if (expld
.result
.section
!= NULL
)
4074 value
+= expld
.result
.section
->vma
;
4076 minfo ("0x%V", value
);
4082 struct bfd_link_hash_entry
*h
;
4084 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4085 FALSE
, FALSE
, TRUE
);
4088 value
= h
->u
.def
.value
;
4089 value
+= h
->u
.def
.section
->output_section
->vma
;
4090 value
+= h
->u
.def
.section
->output_offset
;
4092 minfo ("[0x%V]", value
);
4095 minfo ("[unresolved]");
4100 if (assignment
->exp
->type
.node_class
== etree_provide
)
4101 minfo ("[!provide]");
4108 expld
.assign_name
= NULL
;
4111 exp_print_tree (assignment
->exp
);
4116 print_input_statement (lang_input_statement_type
*statm
)
4118 if (statm
->filename
!= NULL
4119 && (statm
->the_bfd
== NULL
4120 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4121 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4124 /* Print all symbols defined in a particular section. This is called
4125 via bfd_link_hash_traverse, or by print_all_symbols. */
4128 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4130 asection
*sec
= (asection
*) ptr
;
4132 if ((hash_entry
->type
== bfd_link_hash_defined
4133 || hash_entry
->type
== bfd_link_hash_defweak
)
4134 && sec
== hash_entry
->u
.def
.section
)
4138 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4141 (hash_entry
->u
.def
.value
4142 + hash_entry
->u
.def
.section
->output_offset
4143 + hash_entry
->u
.def
.section
->output_section
->vma
));
4145 minfo (" %T\n", hash_entry
->root
.string
);
4152 hash_entry_addr_cmp (const void *a
, const void *b
)
4154 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4155 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4157 if (l
->u
.def
.value
< r
->u
.def
.value
)
4159 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4166 print_all_symbols (asection
*sec
)
4168 input_section_userdata_type
*ud
4169 = (input_section_userdata_type
*) get_userdata (sec
);
4170 struct map_symbol_def
*def
;
4171 struct bfd_link_hash_entry
**entries
;
4177 *ud
->map_symbol_def_tail
= 0;
4179 /* Sort the symbols by address. */
4180 entries
= (struct bfd_link_hash_entry
**)
4181 obstack_alloc (&map_obstack
,
4182 ud
->map_symbol_def_count
* sizeof (*entries
));
4184 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4185 entries
[i
] = def
->entry
;
4187 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4188 hash_entry_addr_cmp
);
4190 /* Print the symbols. */
4191 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4192 print_one_symbol (entries
[i
], sec
);
4194 obstack_free (&map_obstack
, entries
);
4197 /* Print information about an input section to the map file. */
4200 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4202 bfd_size_type size
= i
->size
;
4209 minfo ("%s", i
->name
);
4211 len
= 1 + strlen (i
->name
);
4212 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4217 while (len
< SECTION_NAME_MAP_LENGTH
)
4223 if (i
->output_section
!= NULL
4224 && i
->output_section
->owner
== link_info
.output_bfd
)
4225 addr
= i
->output_section
->vma
+ i
->output_offset
;
4233 minfo ("0x%V %W %B\n", addr
, size
, i
->owner
);
4235 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4237 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4249 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4252 if (i
->output_section
!= NULL
4253 && i
->output_section
->owner
== link_info
.output_bfd
)
4255 if (link_info
.reduce_memory_overheads
)
4256 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4258 print_all_symbols (i
);
4260 /* Update print_dot, but make sure that we do not move it
4261 backwards - this could happen if we have overlays and a
4262 later overlay is shorter than an earier one. */
4263 if (addr
+ TO_ADDR (size
) > print_dot
)
4264 print_dot
= addr
+ TO_ADDR (size
);
4269 print_fill_statement (lang_fill_statement_type
*fill
)
4273 fputs (" FILL mask 0x", config
.map_file
);
4274 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4275 fprintf (config
.map_file
, "%02x", *p
);
4276 fputs ("\n", config
.map_file
);
4280 print_data_statement (lang_data_statement_type
*data
)
4288 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4291 addr
= data
->output_offset
;
4292 if (data
->output_section
!= NULL
)
4293 addr
+= data
->output_section
->vma
;
4321 if (size
< TO_SIZE ((unsigned) 1))
4322 size
= TO_SIZE ((unsigned) 1);
4323 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4325 if (data
->exp
->type
.node_class
!= etree_value
)
4328 exp_print_tree (data
->exp
);
4333 print_dot
= addr
+ TO_ADDR (size
);
4336 /* Print an address statement. These are generated by options like
4340 print_address_statement (lang_address_statement_type
*address
)
4342 minfo (_("Address of section %s set to "), address
->section_name
);
4343 exp_print_tree (address
->address
);
4347 /* Print a reloc statement. */
4350 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4357 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4360 addr
= reloc
->output_offset
;
4361 if (reloc
->output_section
!= NULL
)
4362 addr
+= reloc
->output_section
->vma
;
4364 size
= bfd_get_reloc_size (reloc
->howto
);
4366 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4368 if (reloc
->name
!= NULL
)
4369 minfo ("%s+", reloc
->name
);
4371 minfo ("%s+", reloc
->section
->name
);
4373 exp_print_tree (reloc
->addend_exp
);
4377 print_dot
= addr
+ TO_ADDR (size
);
4381 print_padding_statement (lang_padding_statement_type
*s
)
4389 len
= sizeof " *fill*" - 1;
4390 while (len
< SECTION_NAME_MAP_LENGTH
)
4396 addr
= s
->output_offset
;
4397 if (s
->output_section
!= NULL
)
4398 addr
+= s
->output_section
->vma
;
4399 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4401 if (s
->fill
->size
!= 0)
4405 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4406 fprintf (config
.map_file
, "%02x", *p
);
4411 print_dot
= addr
+ TO_ADDR (s
->size
);
4415 print_wild_statement (lang_wild_statement_type
*w
,
4416 lang_output_section_statement_type
*os
)
4418 struct wildcard_list
*sec
;
4422 if (w
->filenames_sorted
)
4424 if (w
->filename
!= NULL
)
4425 minfo ("%s", w
->filename
);
4428 if (w
->filenames_sorted
)
4432 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4434 if (sec
->spec
.sorted
)
4436 if (sec
->spec
.exclude_name_list
!= NULL
)
4439 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4440 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4441 minfo (" %s", tmp
->name
);
4444 if (sec
->spec
.name
!= NULL
)
4445 minfo ("%s", sec
->spec
.name
);
4448 if (sec
->spec
.sorted
)
4457 print_statement_list (w
->children
.head
, os
);
4460 /* Print a group statement. */
4463 print_group (lang_group_statement_type
*s
,
4464 lang_output_section_statement_type
*os
)
4466 fprintf (config
.map_file
, "START GROUP\n");
4467 print_statement_list (s
->children
.head
, os
);
4468 fprintf (config
.map_file
, "END GROUP\n");
4471 /* Print the list of statements in S.
4472 This can be called for any statement type. */
4475 print_statement_list (lang_statement_union_type
*s
,
4476 lang_output_section_statement_type
*os
)
4480 print_statement (s
, os
);
4485 /* Print the first statement in statement list S.
4486 This can be called for any statement type. */
4489 print_statement (lang_statement_union_type
*s
,
4490 lang_output_section_statement_type
*os
)
4492 switch (s
->header
.type
)
4495 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4498 case lang_constructors_statement_enum
:
4499 if (constructor_list
.head
!= NULL
)
4501 if (constructors_sorted
)
4502 minfo (" SORT (CONSTRUCTORS)\n");
4504 minfo (" CONSTRUCTORS\n");
4505 print_statement_list (constructor_list
.head
, os
);
4508 case lang_wild_statement_enum
:
4509 print_wild_statement (&s
->wild_statement
, os
);
4511 case lang_address_statement_enum
:
4512 print_address_statement (&s
->address_statement
);
4514 case lang_object_symbols_statement_enum
:
4515 minfo (" CREATE_OBJECT_SYMBOLS\n");
4517 case lang_fill_statement_enum
:
4518 print_fill_statement (&s
->fill_statement
);
4520 case lang_data_statement_enum
:
4521 print_data_statement (&s
->data_statement
);
4523 case lang_reloc_statement_enum
:
4524 print_reloc_statement (&s
->reloc_statement
);
4526 case lang_input_section_enum
:
4527 print_input_section (s
->input_section
.section
, FALSE
);
4529 case lang_padding_statement_enum
:
4530 print_padding_statement (&s
->padding_statement
);
4532 case lang_output_section_statement_enum
:
4533 print_output_section_statement (&s
->output_section_statement
);
4535 case lang_assignment_statement_enum
:
4536 print_assignment (&s
->assignment_statement
, os
);
4538 case lang_target_statement_enum
:
4539 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4541 case lang_output_statement_enum
:
4542 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4543 if (output_target
!= NULL
)
4544 minfo (" %s", output_target
);
4547 case lang_input_statement_enum
:
4548 print_input_statement (&s
->input_statement
);
4550 case lang_group_statement_enum
:
4551 print_group (&s
->group_statement
, os
);
4553 case lang_insert_statement_enum
:
4554 minfo ("INSERT %s %s\n",
4555 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4556 s
->insert_statement
.where
);
4562 print_statements (void)
4564 print_statement_list (statement_list
.head
, abs_output_section
);
4567 /* Print the first N statements in statement list S to STDERR.
4568 If N == 0, nothing is printed.
4569 If N < 0, the entire list is printed.
4570 Intended to be called from GDB. */
4573 dprint_statement (lang_statement_union_type
*s
, int n
)
4575 FILE *map_save
= config
.map_file
;
4577 config
.map_file
= stderr
;
4580 print_statement_list (s
, abs_output_section
);
4583 while (s
&& --n
>= 0)
4585 print_statement (s
, abs_output_section
);
4590 config
.map_file
= map_save
;
4594 insert_pad (lang_statement_union_type
**ptr
,
4596 bfd_size_type alignment_needed
,
4597 asection
*output_section
,
4600 static fill_type zero_fill
;
4601 lang_statement_union_type
*pad
= NULL
;
4603 if (ptr
!= &statement_list
.head
)
4604 pad
= ((lang_statement_union_type
*)
4605 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4607 && pad
->header
.type
== lang_padding_statement_enum
4608 && pad
->padding_statement
.output_section
== output_section
)
4610 /* Use the existing pad statement. */
4612 else if ((pad
= *ptr
) != NULL
4613 && pad
->header
.type
== lang_padding_statement_enum
4614 && pad
->padding_statement
.output_section
== output_section
)
4616 /* Use the existing pad statement. */
4620 /* Make a new padding statement, linked into existing chain. */
4621 pad
= (lang_statement_union_type
*)
4622 stat_alloc (sizeof (lang_padding_statement_type
));
4623 pad
->header
.next
= *ptr
;
4625 pad
->header
.type
= lang_padding_statement_enum
;
4626 pad
->padding_statement
.output_section
= output_section
;
4629 pad
->padding_statement
.fill
= fill
;
4631 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4632 pad
->padding_statement
.size
= alignment_needed
;
4633 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4634 - output_section
->vma
);
4637 /* Work out how much this section will move the dot point. */
4641 (lang_statement_union_type
**this_ptr
,
4642 lang_output_section_statement_type
*output_section_statement
,
4646 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4647 asection
*i
= is
->section
;
4648 asection
*o
= output_section_statement
->bfd_section
;
4650 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4651 i
->output_offset
= i
->vma
- o
->vma
;
4652 else if ((i
->flags
& SEC_EXCLUDE
) != 0)
4653 i
->output_offset
= dot
- o
->vma
;
4656 bfd_size_type alignment_needed
;
4658 /* Align this section first to the input sections requirement,
4659 then to the output section's requirement. If this alignment
4660 is greater than any seen before, then record it too. Perform
4661 the alignment by inserting a magic 'padding' statement. */
4663 if (output_section_statement
->subsection_alignment
!= -1)
4664 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4666 if (o
->alignment_power
< i
->alignment_power
)
4667 o
->alignment_power
= i
->alignment_power
;
4669 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4671 if (alignment_needed
!= 0)
4673 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4674 dot
+= alignment_needed
;
4677 /* Remember where in the output section this input section goes. */
4678 i
->output_offset
= dot
- o
->vma
;
4680 /* Mark how big the output section must be to contain this now. */
4681 dot
+= TO_ADDR (i
->size
);
4682 o
->size
= TO_SIZE (dot
- o
->vma
);
4695 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4697 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4698 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4700 if (sec1
->lma
< sec2
->lma
)
4702 else if (sec1
->lma
> sec2
->lma
)
4704 else if (sec1
->id
< sec2
->id
)
4706 else if (sec1
->id
> sec2
->id
)
4713 sort_sections_by_vma (const void *arg1
, const void *arg2
)
4715 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4716 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4718 if (sec1
->vma
< sec2
->vma
)
4720 else if (sec1
->vma
> sec2
->vma
)
4722 else if (sec1
->id
< sec2
->id
)
4724 else if (sec1
->id
> sec2
->id
)
4730 #define IS_TBSS(s) \
4731 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4733 #define IGNORE_SECTION(s) \
4734 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4736 /* Check to see if any allocated sections overlap with other allocated
4737 sections. This can happen if a linker script specifies the output
4738 section addresses of the two sections. Also check whether any memory
4739 region has overflowed. */
4742 lang_check_section_addresses (void)
4745 struct check_sec
*sections
;
4749 bfd_vma p_start
= 0;
4751 lang_memory_region_type
*m
;
4752 bfd_boolean overlays
;
4754 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4757 count
= bfd_count_sections (link_info
.output_bfd
);
4758 sections
= XNEWVEC (struct check_sec
, count
);
4760 /* Scan all sections in the output list. */
4762 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4764 if (IGNORE_SECTION (s
)
4768 sections
[count
].sec
= s
;
4769 sections
[count
].warned
= FALSE
;
4779 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
4781 /* First check section LMAs. There should be no overlap of LMAs on
4782 loadable sections, even with overlays. */
4783 for (p
= NULL
, i
= 0; i
< count
; i
++)
4785 s
= sections
[i
].sec
;
4786 if ((s
->flags
& SEC_LOAD
) != 0)
4789 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4791 /* Look for an overlap. We have sorted sections by lma, so
4792 we know that s_start >= p_start. Besides the obvious
4793 case of overlap when the current section starts before
4794 the previous one ends, we also must have overlap if the
4795 previous section wraps around the address space. */
4797 && (s_start
<= p_end
4798 || p_end
< p_start
))
4800 einfo (_("%X%P: section %s LMA [%V,%V]"
4801 " overlaps section %s LMA [%V,%V]\n"),
4802 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4803 sections
[i
].warned
= TRUE
;
4811 /* If any non-zero size allocated section (excluding tbss) starts at
4812 exactly the same VMA as another such section, then we have
4813 overlays. Overlays generated by the OVERLAY keyword will have
4814 this property. It is possible to intentionally generate overlays
4815 that fail this test, but it would be unusual. */
4816 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
4818 p_start
= sections
[0].sec
->vma
;
4819 for (i
= 1; i
< count
; i
++)
4821 s_start
= sections
[i
].sec
->vma
;
4822 if (p_start
== s_start
)
4830 /* Now check section VMAs if no overlays were detected. */
4833 for (p
= NULL
, i
= 0; i
< count
; i
++)
4835 s
= sections
[i
].sec
;
4837 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4840 && !sections
[i
].warned
4841 && (s_start
<= p_end
4842 || p_end
< p_start
))
4843 einfo (_("%X%P: section %s VMA [%V,%V]"
4844 " overlaps section %s VMA [%V,%V]\n"),
4845 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4854 /* If any memory region has overflowed, report by how much.
4855 We do not issue this diagnostic for regions that had sections
4856 explicitly placed outside their bounds; os_region_check's
4857 diagnostics are adequate for that case.
4859 FIXME: It is conceivable that m->current - (m->origin + m->length)
4860 might overflow a 32-bit integer. There is, alas, no way to print
4861 a bfd_vma quantity in decimal. */
4862 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4863 if (m
->had_full_message
)
4864 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4865 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4868 /* Make sure the new address is within the region. We explicitly permit the
4869 current address to be at the exact end of the region when the address is
4870 non-zero, in case the region is at the end of addressable memory and the
4871 calculation wraps around. */
4874 os_region_check (lang_output_section_statement_type
*os
,
4875 lang_memory_region_type
*region
,
4879 if ((region
->current
< region
->origin
4880 || (region
->current
- region
->origin
> region
->length
))
4881 && ((region
->current
!= region
->origin
+ region
->length
)
4886 einfo (_("%X%P: address 0x%v of %B section `%s'"
4887 " is not within region `%s'\n"),
4889 os
->bfd_section
->owner
,
4890 os
->bfd_section
->name
,
4891 region
->name_list
.name
);
4893 else if (!region
->had_full_message
)
4895 region
->had_full_message
= TRUE
;
4897 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4898 os
->bfd_section
->owner
,
4899 os
->bfd_section
->name
,
4900 region
->name_list
.name
);
4905 /* Set the sizes for all the output sections. */
4908 lang_size_sections_1
4909 (lang_statement_union_type
**prev
,
4910 lang_output_section_statement_type
*output_section_statement
,
4914 bfd_boolean check_regions
)
4916 lang_statement_union_type
*s
;
4918 /* Size up the sections from their constituent parts. */
4919 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4921 switch (s
->header
.type
)
4923 case lang_output_section_statement_enum
:
4925 bfd_vma newdot
, after
, dotdelta
;
4926 lang_output_section_statement_type
*os
;
4927 lang_memory_region_type
*r
;
4928 int section_alignment
= 0;
4930 os
= &s
->output_section_statement
;
4931 if (os
->constraint
== -1)
4934 /* FIXME: We shouldn't need to zero section vmas for ld -r
4935 here, in lang_insert_orphan, or in the default linker scripts.
4936 This is covering for coff backend linker bugs. See PR6945. */
4937 if (os
->addr_tree
== NULL
4938 && bfd_link_relocatable (&link_info
)
4939 && (bfd_get_flavour (link_info
.output_bfd
)
4940 == bfd_target_coff_flavour
))
4941 os
->addr_tree
= exp_intop (0);
4942 if (os
->addr_tree
!= NULL
)
4944 os
->processed_vma
= FALSE
;
4945 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4947 if (expld
.result
.valid_p
)
4949 dot
= expld
.result
.value
;
4950 if (expld
.result
.section
!= NULL
)
4951 dot
+= expld
.result
.section
->vma
;
4953 else if (expld
.phase
!= lang_mark_phase_enum
)
4954 einfo (_("%F%S: non constant or forward reference"
4955 " address expression for section %s\n"),
4956 os
->addr_tree
, os
->name
);
4959 if (os
->bfd_section
== NULL
)
4960 /* This section was removed or never actually created. */
4963 /* If this is a COFF shared library section, use the size and
4964 address from the input section. FIXME: This is COFF
4965 specific; it would be cleaner if there were some other way
4966 to do this, but nothing simple comes to mind. */
4967 if (((bfd_get_flavour (link_info
.output_bfd
)
4968 == bfd_target_ecoff_flavour
)
4969 || (bfd_get_flavour (link_info
.output_bfd
)
4970 == bfd_target_coff_flavour
))
4971 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4975 if (os
->children
.head
== NULL
4976 || os
->children
.head
->header
.next
!= NULL
4977 || (os
->children
.head
->header
.type
4978 != lang_input_section_enum
))
4979 einfo (_("%P%X: Internal error on COFF shared library"
4980 " section %s\n"), os
->name
);
4982 input
= os
->children
.head
->input_section
.section
;
4983 bfd_set_section_vma (os
->bfd_section
->owner
,
4985 bfd_section_vma (input
->owner
, input
));
4986 os
->bfd_section
->size
= input
->size
;
4992 if (bfd_is_abs_section (os
->bfd_section
))
4994 /* No matter what happens, an abs section starts at zero. */
4995 ASSERT (os
->bfd_section
->vma
== 0);
4999 if (os
->addr_tree
== NULL
)
5001 /* No address specified for this section, get one
5002 from the region specification. */
5003 if (os
->region
== NULL
5004 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
5005 && os
->region
->name_list
.name
[0] == '*'
5006 && strcmp (os
->region
->name_list
.name
,
5007 DEFAULT_MEMORY_REGION
) == 0))
5009 os
->region
= lang_memory_default (os
->bfd_section
);
5012 /* If a loadable section is using the default memory
5013 region, and some non default memory regions were
5014 defined, issue an error message. */
5016 && !IGNORE_SECTION (os
->bfd_section
)
5017 && !bfd_link_relocatable (&link_info
)
5019 && strcmp (os
->region
->name_list
.name
,
5020 DEFAULT_MEMORY_REGION
) == 0
5021 && lang_memory_region_list
!= NULL
5022 && (strcmp (lang_memory_region_list
->name_list
.name
,
5023 DEFAULT_MEMORY_REGION
) != 0
5024 || lang_memory_region_list
->next
!= NULL
)
5025 && expld
.phase
!= lang_mark_phase_enum
)
5027 /* By default this is an error rather than just a
5028 warning because if we allocate the section to the
5029 default memory region we can end up creating an
5030 excessively large binary, or even seg faulting when
5031 attempting to perform a negative seek. See
5032 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5033 for an example of this. This behaviour can be
5034 overridden by the using the --no-check-sections
5036 if (command_line
.check_section_addresses
)
5037 einfo (_("%P%F: error: no memory region specified"
5038 " for loadable section `%s'\n"),
5039 bfd_get_section_name (link_info
.output_bfd
,
5042 einfo (_("%P: warning: no memory region specified"
5043 " for loadable section `%s'\n"),
5044 bfd_get_section_name (link_info
.output_bfd
,
5048 newdot
= os
->region
->current
;
5049 section_alignment
= os
->bfd_section
->alignment_power
;
5052 section_alignment
= os
->section_alignment
;
5054 /* Align to what the section needs. */
5055 if (section_alignment
> 0)
5057 bfd_vma savedot
= newdot
;
5058 newdot
= align_power (newdot
, section_alignment
);
5060 dotdelta
= newdot
- savedot
;
5062 && (config
.warn_section_align
5063 || os
->addr_tree
!= NULL
)
5064 && expld
.phase
!= lang_mark_phase_enum
)
5065 einfo (_("%P: warning: changing start of section"
5066 " %s by %lu bytes\n"),
5067 os
->name
, (unsigned long) dotdelta
);
5070 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
5072 os
->bfd_section
->output_offset
= 0;
5075 lang_size_sections_1 (&os
->children
.head
, os
,
5076 os
->fill
, newdot
, relax
, check_regions
);
5078 os
->processed_vma
= TRUE
;
5080 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5081 /* Except for some special linker created sections,
5082 no output section should change from zero size
5083 after strip_excluded_output_sections. A non-zero
5084 size on an ignored section indicates that some
5085 input section was not sized early enough. */
5086 ASSERT (os
->bfd_section
->size
== 0);
5089 dot
= os
->bfd_section
->vma
;
5091 /* Put the section within the requested block size, or
5092 align at the block boundary. */
5094 + TO_ADDR (os
->bfd_section
->size
)
5095 + os
->block_value
- 1)
5096 & - (bfd_vma
) os
->block_value
);
5098 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
5101 /* Set section lma. */
5104 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5108 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5109 os
->bfd_section
->lma
= lma
;
5111 else if (os
->lma_region
!= NULL
)
5113 bfd_vma lma
= os
->lma_region
->current
;
5115 if (os
->align_lma_with_input
)
5119 /* When LMA_REGION is the same as REGION, align the LMA
5120 as we did for the VMA, possibly including alignment
5121 from the bfd section. If a different region, then
5122 only align according to the value in the output
5124 if (os
->lma_region
!= os
->region
)
5125 section_alignment
= os
->section_alignment
;
5126 if (section_alignment
> 0)
5127 lma
= align_power (lma
, section_alignment
);
5129 os
->bfd_section
->lma
= lma
;
5131 else if (r
->last_os
!= NULL
5132 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5137 last
= r
->last_os
->output_section_statement
.bfd_section
;
5139 /* A backwards move of dot should be accompanied by
5140 an explicit assignment to the section LMA (ie.
5141 os->load_base set) because backwards moves can
5142 create overlapping LMAs. */
5144 && os
->bfd_section
->size
!= 0
5145 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5147 /* If dot moved backwards then leave lma equal to
5148 vma. This is the old default lma, which might
5149 just happen to work when the backwards move is
5150 sufficiently large. Nag if this changes anything,
5151 so people can fix their linker scripts. */
5153 if (last
->vma
!= last
->lma
)
5154 einfo (_("%P: warning: dot moved backwards "
5155 "before `%s'\n"), os
->name
);
5159 /* If this is an overlay, set the current lma to that
5160 at the end of the previous section. */
5161 if (os
->sectype
== overlay_section
)
5162 lma
= last
->lma
+ TO_ADDR (last
->size
);
5164 /* Otherwise, keep the same lma to vma relationship
5165 as the previous section. */
5167 lma
= dot
+ last
->lma
- last
->vma
;
5169 if (section_alignment
> 0)
5170 lma
= align_power (lma
, section_alignment
);
5171 os
->bfd_section
->lma
= lma
;
5174 os
->processed_lma
= TRUE
;
5176 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5179 /* Keep track of normal sections using the default
5180 lma region. We use this to set the lma for
5181 following sections. Overlays or other linker
5182 script assignment to lma might mean that the
5183 default lma == vma is incorrect.
5184 To avoid warnings about dot moving backwards when using
5185 -Ttext, don't start tracking sections until we find one
5186 of non-zero size or with lma set differently to vma. */
5187 if (!IGNORE_SECTION (os
->bfd_section
)
5188 && (os
->bfd_section
->size
!= 0
5189 || (r
->last_os
== NULL
5190 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5191 || (r
->last_os
!= NULL
5192 && dot
>= (r
->last_os
->output_section_statement
5193 .bfd_section
->vma
)))
5194 && os
->lma_region
== NULL
5195 && !bfd_link_relocatable (&link_info
))
5198 /* .tbss sections effectively have zero size. */
5199 if (!IS_TBSS (os
->bfd_section
)
5200 || bfd_link_relocatable (&link_info
))
5201 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5206 if (os
->update_dot_tree
!= 0)
5207 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5209 /* Update dot in the region ?
5210 We only do this if the section is going to be allocated,
5211 since unallocated sections do not contribute to the region's
5212 overall size in memory. */
5213 if (os
->region
!= NULL
5214 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5216 os
->region
->current
= dot
;
5219 /* Make sure the new address is within the region. */
5220 os_region_check (os
, os
->region
, os
->addr_tree
,
5221 os
->bfd_section
->vma
);
5223 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5224 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5225 || os
->align_lma_with_input
))
5227 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5230 os_region_check (os
, os
->lma_region
, NULL
,
5231 os
->bfd_section
->lma
);
5237 case lang_constructors_statement_enum
:
5238 dot
= lang_size_sections_1 (&constructor_list
.head
,
5239 output_section_statement
,
5240 fill
, dot
, relax
, check_regions
);
5243 case lang_data_statement_enum
:
5245 unsigned int size
= 0;
5247 s
->data_statement
.output_offset
=
5248 dot
- output_section_statement
->bfd_section
->vma
;
5249 s
->data_statement
.output_section
=
5250 output_section_statement
->bfd_section
;
5252 /* We might refer to provided symbols in the expression, and
5253 need to mark them as needed. */
5254 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5256 switch (s
->data_statement
.type
)
5274 if (size
< TO_SIZE ((unsigned) 1))
5275 size
= TO_SIZE ((unsigned) 1);
5276 dot
+= TO_ADDR (size
);
5277 output_section_statement
->bfd_section
->size
5278 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5283 case lang_reloc_statement_enum
:
5287 s
->reloc_statement
.output_offset
=
5288 dot
- output_section_statement
->bfd_section
->vma
;
5289 s
->reloc_statement
.output_section
=
5290 output_section_statement
->bfd_section
;
5291 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5292 dot
+= TO_ADDR (size
);
5293 output_section_statement
->bfd_section
->size
5294 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5298 case lang_wild_statement_enum
:
5299 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5300 output_section_statement
,
5301 fill
, dot
, relax
, check_regions
);
5304 case lang_object_symbols_statement_enum
:
5305 link_info
.create_object_symbols_section
=
5306 output_section_statement
->bfd_section
;
5309 case lang_output_statement_enum
:
5310 case lang_target_statement_enum
:
5313 case lang_input_section_enum
:
5317 i
= s
->input_section
.section
;
5322 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5323 einfo (_("%P%F: can't relax section: %E\n"));
5327 dot
= size_input_section (prev
, output_section_statement
,
5332 case lang_input_statement_enum
:
5335 case lang_fill_statement_enum
:
5336 s
->fill_statement
.output_section
=
5337 output_section_statement
->bfd_section
;
5339 fill
= s
->fill_statement
.fill
;
5342 case lang_assignment_statement_enum
:
5344 bfd_vma newdot
= dot
;
5345 etree_type
*tree
= s
->assignment_statement
.exp
;
5347 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5349 exp_fold_tree (tree
,
5350 output_section_statement
->bfd_section
,
5353 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5355 if (!expld
.dataseg
.relro_start_stat
)
5356 expld
.dataseg
.relro_start_stat
= s
;
5359 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5362 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5364 if (!expld
.dataseg
.relro_end_stat
)
5365 expld
.dataseg
.relro_end_stat
= s
;
5368 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5371 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5373 /* This symbol may be relative to this section. */
5374 if ((tree
->type
.node_class
== etree_provided
5375 || tree
->type
.node_class
== etree_assign
)
5376 && (tree
->assign
.dst
[0] != '.'
5377 || tree
->assign
.dst
[1] != '\0'))
5378 output_section_statement
->update_dot
= 1;
5380 if (!output_section_statement
->ignored
)
5382 if (output_section_statement
== abs_output_section
)
5384 /* If we don't have an output section, then just adjust
5385 the default memory address. */
5386 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5387 FALSE
)->current
= newdot
;
5389 else if (newdot
!= dot
)
5391 /* Insert a pad after this statement. We can't
5392 put the pad before when relaxing, in case the
5393 assignment references dot. */
5394 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5395 output_section_statement
->bfd_section
, dot
);
5397 /* Don't neuter the pad below when relaxing. */
5400 /* If dot is advanced, this implies that the section
5401 should have space allocated to it, unless the
5402 user has explicitly stated that the section
5403 should not be allocated. */
5404 if (output_section_statement
->sectype
!= noalloc_section
5405 && (output_section_statement
->sectype
!= noload_section
5406 || (bfd_get_flavour (link_info
.output_bfd
)
5407 == bfd_target_elf_flavour
)))
5408 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5415 case lang_padding_statement_enum
:
5416 /* If this is the first time lang_size_sections is called,
5417 we won't have any padding statements. If this is the
5418 second or later passes when relaxing, we should allow
5419 padding to shrink. If padding is needed on this pass, it
5420 will be added back in. */
5421 s
->padding_statement
.size
= 0;
5423 /* Make sure output_offset is valid. If relaxation shrinks
5424 the section and this pad isn't needed, it's possible to
5425 have output_offset larger than the final size of the
5426 section. bfd_set_section_contents will complain even for
5427 a pad size of zero. */
5428 s
->padding_statement
.output_offset
5429 = dot
- output_section_statement
->bfd_section
->vma
;
5432 case lang_group_statement_enum
:
5433 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5434 output_section_statement
,
5435 fill
, dot
, relax
, check_regions
);
5438 case lang_insert_statement_enum
:
5441 /* We can only get here when relaxing is turned on. */
5442 case lang_address_statement_enum
:
5449 prev
= &s
->header
.next
;
5454 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5455 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5456 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5457 segments. We are allowed an opportunity to override this decision. */
5460 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
5461 bfd
*abfd ATTRIBUTE_UNUSED
,
5462 asection
*current_section
,
5463 asection
*previous_section
,
5464 bfd_boolean new_segment
)
5466 lang_output_section_statement_type
*cur
;
5467 lang_output_section_statement_type
*prev
;
5469 /* The checks below are only necessary when the BFD library has decided
5470 that the two sections ought to be placed into the same segment. */
5474 /* Paranoia checks. */
5475 if (current_section
== NULL
|| previous_section
== NULL
)
5478 /* If this flag is set, the target never wants code and non-code
5479 sections comingled in the same segment. */
5480 if (config
.separate_code
5481 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5484 /* Find the memory regions associated with the two sections.
5485 We call lang_output_section_find() here rather than scanning the list
5486 of output sections looking for a matching section pointer because if
5487 we have a large number of sections then a hash lookup is faster. */
5488 cur
= lang_output_section_find (current_section
->name
);
5489 prev
= lang_output_section_find (previous_section
->name
);
5491 /* More paranoia. */
5492 if (cur
== NULL
|| prev
== NULL
)
5495 /* If the regions are different then force the sections to live in
5496 different segments. See the email thread starting at the following
5497 URL for the reasons why this is necessary:
5498 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5499 return cur
->region
!= prev
->region
;
5503 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5505 lang_statement_iteration
++;
5506 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5507 0, 0, relax
, check_regions
);
5511 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5513 expld
.phase
= lang_allocating_phase_enum
;
5514 expld
.dataseg
.phase
= exp_dataseg_none
;
5516 one_lang_size_sections_pass (relax
, check_regions
);
5517 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5518 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5520 bfd_vma initial_base
, relro_end
, desired_end
;
5523 /* Compute the expected PT_GNU_RELRO segment end. */
5524 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5525 & ~(expld
.dataseg
.pagesize
- 1));
5527 /* Adjust by the offset arg of DATA_SEGMENT_RELRO_END. */
5528 desired_end
= relro_end
- expld
.dataseg
.relro_offset
;
5530 /* For sections in the relro segment.. */
5531 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
5532 if ((sec
->flags
& SEC_ALLOC
) != 0
5533 && sec
->vma
>= expld
.dataseg
.base
5534 && sec
->vma
< expld
.dataseg
.relro_end
- expld
.dataseg
.relro_offset
)
5536 /* Where do we want to put this section so that it ends as
5538 bfd_vma start
, end
, bump
;
5540 end
= start
= sec
->vma
;
5542 end
+= TO_ADDR (sec
->size
);
5543 bump
= desired_end
- end
;
5544 /* We'd like to increase START by BUMP, but we must heed
5545 alignment so the increase might be less than optimum. */
5547 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
5548 /* This is now the desired end for the previous section. */
5549 desired_end
= start
;
5552 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5553 ASSERT (desired_end
>= expld
.dataseg
.base
);
5554 initial_base
= expld
.dataseg
.base
;
5555 expld
.dataseg
.base
= desired_end
;
5556 lang_reset_memory_regions ();
5557 one_lang_size_sections_pass (relax
, check_regions
);
5559 if (expld
.dataseg
.relro_end
> relro_end
)
5561 /* Assignments to dot, or to output section address in a
5562 user script have increased padding over the original.
5564 expld
.dataseg
.base
= initial_base
;
5565 lang_reset_memory_regions ();
5566 one_lang_size_sections_pass (relax
, check_regions
);
5569 link_info
.relro_start
= expld
.dataseg
.base
;
5570 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5572 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5574 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5575 a page could be saved in the data segment. */
5576 bfd_vma first
, last
;
5578 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5579 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5581 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5582 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5583 && first
+ last
<= expld
.dataseg
.pagesize
)
5585 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5586 lang_reset_memory_regions ();
5587 one_lang_size_sections_pass (relax
, check_regions
);
5590 expld
.dataseg
.phase
= exp_dataseg_done
;
5593 expld
.dataseg
.phase
= exp_dataseg_done
;
5596 static lang_output_section_statement_type
*current_section
;
5597 static lang_assignment_statement_type
*current_assign
;
5598 static bfd_boolean prefer_next_section
;
5600 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5603 lang_do_assignments_1 (lang_statement_union_type
*s
,
5604 lang_output_section_statement_type
*current_os
,
5607 bfd_boolean
*found_end
)
5609 for (; s
!= NULL
; s
= s
->header
.next
)
5611 switch (s
->header
.type
)
5613 case lang_constructors_statement_enum
:
5614 dot
= lang_do_assignments_1 (constructor_list
.head
,
5615 current_os
, fill
, dot
, found_end
);
5618 case lang_output_section_statement_enum
:
5620 lang_output_section_statement_type
*os
;
5623 os
= &(s
->output_section_statement
);
5624 os
->after_end
= *found_end
;
5625 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5627 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5629 current_section
= os
;
5630 prefer_next_section
= FALSE
;
5632 dot
= os
->bfd_section
->vma
;
5634 newdot
= lang_do_assignments_1 (os
->children
.head
,
5635 os
, os
->fill
, dot
, found_end
);
5638 if (os
->bfd_section
!= NULL
)
5640 /* .tbss sections effectively have zero size. */
5641 if (!IS_TBSS (os
->bfd_section
)
5642 || bfd_link_relocatable (&link_info
))
5643 dot
+= TO_ADDR (os
->bfd_section
->size
);
5645 if (os
->update_dot_tree
!= NULL
)
5646 exp_fold_tree (os
->update_dot_tree
,
5647 bfd_abs_section_ptr
, &dot
);
5655 case lang_wild_statement_enum
:
5657 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5658 current_os
, fill
, dot
, found_end
);
5661 case lang_object_symbols_statement_enum
:
5662 case lang_output_statement_enum
:
5663 case lang_target_statement_enum
:
5666 case lang_data_statement_enum
:
5667 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5668 if (expld
.result
.valid_p
)
5670 s
->data_statement
.value
= expld
.result
.value
;
5671 if (expld
.result
.section
!= NULL
)
5672 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5674 else if (expld
.phase
== lang_final_phase_enum
)
5675 einfo (_("%F%P: invalid data statement\n"));
5678 switch (s
->data_statement
.type
)
5696 if (size
< TO_SIZE ((unsigned) 1))
5697 size
= TO_SIZE ((unsigned) 1);
5698 dot
+= TO_ADDR (size
);
5702 case lang_reloc_statement_enum
:
5703 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5704 bfd_abs_section_ptr
, &dot
);
5705 if (expld
.result
.valid_p
)
5706 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5707 else if (expld
.phase
== lang_final_phase_enum
)
5708 einfo (_("%F%P: invalid reloc statement\n"));
5709 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5712 case lang_input_section_enum
:
5714 asection
*in
= s
->input_section
.section
;
5716 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5717 dot
+= TO_ADDR (in
->size
);
5721 case lang_input_statement_enum
:
5724 case lang_fill_statement_enum
:
5725 fill
= s
->fill_statement
.fill
;
5728 case lang_assignment_statement_enum
:
5729 current_assign
= &s
->assignment_statement
;
5730 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5732 const char *p
= current_assign
->exp
->assign
.dst
;
5734 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5735 prefer_next_section
= TRUE
;
5739 if (strcmp (p
, "end") == 0)
5742 exp_fold_tree (s
->assignment_statement
.exp
,
5743 (current_os
->bfd_section
!= NULL
5744 ? current_os
->bfd_section
: bfd_und_section_ptr
),
5748 case lang_padding_statement_enum
:
5749 dot
+= TO_ADDR (s
->padding_statement
.size
);
5752 case lang_group_statement_enum
:
5753 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5754 current_os
, fill
, dot
, found_end
);
5757 case lang_insert_statement_enum
:
5760 case lang_address_statement_enum
:
5772 lang_do_assignments (lang_phase_type phase
)
5774 bfd_boolean found_end
= FALSE
;
5776 current_section
= NULL
;
5777 prefer_next_section
= FALSE
;
5778 expld
.phase
= phase
;
5779 lang_statement_iteration
++;
5780 lang_do_assignments_1 (statement_list
.head
,
5781 abs_output_section
, NULL
, 0, &found_end
);
5784 /* For an assignment statement outside of an output section statement,
5785 choose the best of neighbouring output sections to use for values
5789 section_for_dot (void)
5793 /* Assignments belong to the previous output section, unless there
5794 has been an assignment to "dot", in which case following
5795 assignments belong to the next output section. (The assumption
5796 is that an assignment to "dot" is setting up the address for the
5797 next output section.) Except that past the assignment to "_end"
5798 we always associate with the previous section. This exception is
5799 for targets like SH that define an alloc .stack or other
5800 weirdness after non-alloc sections. */
5801 if (current_section
== NULL
|| prefer_next_section
)
5803 lang_statement_union_type
*stmt
;
5804 lang_output_section_statement_type
*os
;
5806 for (stmt
= (lang_statement_union_type
*) current_assign
;
5808 stmt
= stmt
->header
.next
)
5809 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5812 os
= &stmt
->output_section_statement
;
5815 && (os
->bfd_section
== NULL
5816 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5817 || bfd_section_removed_from_list (link_info
.output_bfd
,
5821 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5824 s
= os
->bfd_section
;
5826 s
= link_info
.output_bfd
->section_last
;
5828 && ((s
->flags
& SEC_ALLOC
) == 0
5829 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5834 return bfd_abs_section_ptr
;
5838 s
= current_section
->bfd_section
;
5840 /* The section may have been stripped. */
5842 && ((s
->flags
& SEC_EXCLUDE
) != 0
5843 || (s
->flags
& SEC_ALLOC
) == 0
5844 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5845 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5848 s
= link_info
.output_bfd
->sections
;
5850 && ((s
->flags
& SEC_ALLOC
) == 0
5851 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5856 return bfd_abs_section_ptr
;
5859 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5860 operator .startof. (section_name), it produces an undefined symbol
5861 .startof.section_name. Similarly, when it sees
5862 .sizeof. (section_name), it produces an undefined symbol
5863 .sizeof.section_name. For all the output sections, we look for
5864 such symbols, and set them to the correct value. */
5867 lang_set_startof (void)
5871 if (bfd_link_relocatable (&link_info
))
5874 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5876 const char *secname
;
5878 struct bfd_link_hash_entry
*h
;
5880 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5881 buf
= (char *) xmalloc (10 + strlen (secname
));
5883 sprintf (buf
, ".startof.%s", secname
);
5884 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5885 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5887 h
->type
= bfd_link_hash_defined
;
5889 h
->u
.def
.section
= s
;
5892 sprintf (buf
, ".sizeof.%s", secname
);
5893 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5894 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5896 h
->type
= bfd_link_hash_defined
;
5897 h
->u
.def
.value
= TO_ADDR (s
->size
);
5898 h
->u
.def
.section
= bfd_abs_section_ptr
;
5908 struct bfd_link_hash_entry
*h
;
5911 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
5912 || bfd_link_dll (&link_info
))
5913 warn
= entry_from_cmdline
;
5917 /* Force the user to specify a root when generating a relocatable with
5919 if (link_info
.gc_sections
&& bfd_link_relocatable (&link_info
)
5920 && !(entry_from_cmdline
|| undef_from_cmdline
))
5921 einfo (_("%P%F: gc-sections requires either an entry or "
5922 "an undefined symbol\n"));
5924 if (entry_symbol
.name
== NULL
)
5926 /* No entry has been specified. Look for the default entry, but
5927 don't warn if we don't find it. */
5928 entry_symbol
.name
= entry_symbol_default
;
5932 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5933 FALSE
, FALSE
, TRUE
);
5935 && (h
->type
== bfd_link_hash_defined
5936 || h
->type
== bfd_link_hash_defweak
)
5937 && h
->u
.def
.section
->output_section
!= NULL
)
5941 val
= (h
->u
.def
.value
5942 + bfd_get_section_vma (link_info
.output_bfd
,
5943 h
->u
.def
.section
->output_section
)
5944 + h
->u
.def
.section
->output_offset
);
5945 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
5946 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5953 /* We couldn't find the entry symbol. Try parsing it as a
5955 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5958 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
5959 einfo (_("%P%F: can't set start address\n"));
5965 /* Can't find the entry symbol, and it's not a number. Use
5966 the first address in the text section. */
5967 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5971 einfo (_("%P: warning: cannot find entry symbol %s;"
5972 " defaulting to %V\n"),
5974 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5975 if (!(bfd_set_start_address
5976 (link_info
.output_bfd
,
5977 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5978 einfo (_("%P%F: can't set start address\n"));
5983 einfo (_("%P: warning: cannot find entry symbol %s;"
5984 " not setting start address\n"),
5991 /* This is a small function used when we want to ignore errors from
5995 ignore_bfd_errors (const char *fmt ATTRIBUTE_UNUSED
,
5996 va_list ap ATTRIBUTE_UNUSED
)
5998 /* Don't do anything. */
6001 /* Check that the architecture of all the input files is compatible
6002 with the output file. Also call the backend to let it do any
6003 other checking that is needed. */
6008 lang_statement_union_type
*file
;
6010 const bfd_arch_info_type
*compatible
;
6012 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
6014 #ifdef ENABLE_PLUGINS
6015 /* Don't check format of files claimed by plugin. */
6016 if (file
->input_statement
.flags
.claimed
)
6018 #endif /* ENABLE_PLUGINS */
6019 input_bfd
= file
->input_statement
.the_bfd
;
6021 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
6022 command_line
.accept_unknown_input_arch
);
6024 /* In general it is not possible to perform a relocatable
6025 link between differing object formats when the input
6026 file has relocations, because the relocations in the
6027 input format may not have equivalent representations in
6028 the output format (and besides BFD does not translate
6029 relocs for other link purposes than a final link). */
6030 if ((bfd_link_relocatable (&link_info
)
6031 || link_info
.emitrelocations
)
6032 && (compatible
== NULL
6033 || (bfd_get_flavour (input_bfd
)
6034 != bfd_get_flavour (link_info
.output_bfd
)))
6035 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
6037 einfo (_("%P%F: Relocatable linking with relocations from"
6038 " format %s (%B) to format %s (%B) is not supported\n"),
6039 bfd_get_target (input_bfd
), input_bfd
,
6040 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
6041 /* einfo with %F exits. */
6044 if (compatible
== NULL
)
6046 if (command_line
.warn_mismatch
)
6047 einfo (_("%P%X: %s architecture of input file `%B'"
6048 " is incompatible with %s output\n"),
6049 bfd_printable_name (input_bfd
), input_bfd
,
6050 bfd_printable_name (link_info
.output_bfd
));
6052 else if (bfd_count_sections (input_bfd
))
6054 /* If the input bfd has no contents, it shouldn't set the
6055 private data of the output bfd. */
6057 bfd_error_handler_type pfn
= NULL
;
6059 /* If we aren't supposed to warn about mismatched input
6060 files, temporarily set the BFD error handler to a
6061 function which will do nothing. We still want to call
6062 bfd_merge_private_bfd_data, since it may set up
6063 information which is needed in the output file. */
6064 if (!command_line
.warn_mismatch
)
6065 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
6066 if (!bfd_merge_private_bfd_data (input_bfd
, &link_info
))
6068 if (command_line
.warn_mismatch
)
6069 einfo (_("%P%X: failed to merge target specific data"
6070 " of file %B\n"), input_bfd
);
6072 if (!command_line
.warn_mismatch
)
6073 bfd_set_error_handler (pfn
);
6078 /* Look through all the global common symbols and attach them to the
6079 correct section. The -sort-common command line switch may be used
6080 to roughly sort the entries by alignment. */
6085 if (command_line
.inhibit_common_definition
)
6087 if (bfd_link_relocatable (&link_info
)
6088 && !command_line
.force_common_definition
)
6091 if (!config
.sort_common
)
6092 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
6097 if (config
.sort_common
== sort_descending
)
6099 for (power
= 4; power
> 0; power
--)
6100 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6103 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6107 for (power
= 0; power
<= 4; power
++)
6108 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6110 power
= (unsigned int) -1;
6111 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6116 /* Place one common symbol in the correct section. */
6119 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
6121 unsigned int power_of_two
;
6125 if (h
->type
!= bfd_link_hash_common
)
6129 power_of_two
= h
->u
.c
.p
->alignment_power
;
6131 if (config
.sort_common
== sort_descending
6132 && power_of_two
< *(unsigned int *) info
)
6134 else if (config
.sort_common
== sort_ascending
6135 && power_of_two
> *(unsigned int *) info
)
6138 section
= h
->u
.c
.p
->section
;
6139 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6140 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6143 if (config
.map_file
!= NULL
)
6145 static bfd_boolean header_printed
;
6150 if (!header_printed
)
6152 minfo (_("\nAllocating common symbols\n"));
6153 minfo (_("Common symbol size file\n\n"));
6154 header_printed
= TRUE
;
6157 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6158 DMGL_ANSI
| DMGL_PARAMS
);
6161 minfo ("%s", h
->root
.string
);
6162 len
= strlen (h
->root
.string
);
6167 len
= strlen (name
);
6183 if (size
<= 0xffffffff)
6184 sprintf (buf
, "%lx", (unsigned long) size
);
6186 sprintf_vma (buf
, size
);
6196 minfo ("%B\n", section
->owner
);
6202 /* Handle a single orphan section S, placing the orphan into an appropriate
6203 output section. The effects of the --orphan-handling command line
6204 option are handled here. */
6207 ldlang_place_orphan (asection
*s
)
6209 if (config
.orphan_handling
== orphan_handling_discard
)
6211 lang_output_section_statement_type
*os
;
6212 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0,
6214 if (os
->addr_tree
== NULL
6215 && (bfd_link_relocatable (&link_info
)
6216 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6217 os
->addr_tree
= exp_intop (0);
6218 lang_add_section (&os
->children
, s
, NULL
, os
);
6222 lang_output_section_statement_type
*os
;
6223 const char *name
= s
->name
;
6226 if (config
.orphan_handling
== orphan_handling_error
)
6227 einfo ("%X%P: error: unplaced orphan section `%A' from `%B'.\n",
6230 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
6231 constraint
= SPECIAL
;
6233 os
= ldemul_place_orphan (s
, name
, constraint
);
6236 os
= lang_output_section_statement_lookup (name
, constraint
, TRUE
);
6237 if (os
->addr_tree
== NULL
6238 && (bfd_link_relocatable (&link_info
)
6239 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6240 os
->addr_tree
= exp_intop (0);
6241 lang_add_section (&os
->children
, s
, NULL
, os
);
6244 if (config
.orphan_handling
== orphan_handling_warn
)
6245 einfo ("%P: warning: orphan section `%A' from `%B' being "
6246 "placed in section `%s'.\n",
6247 s
, s
->owner
, os
->name
);
6251 /* Run through the input files and ensure that every input section has
6252 somewhere to go. If one is found without a destination then create
6253 an input request and place it into the statement tree. */
6256 lang_place_orphans (void)
6258 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6262 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6264 if (s
->output_section
== NULL
)
6266 /* This section of the file is not attached, root
6267 around for a sensible place for it to go. */
6269 if (file
->flags
.just_syms
)
6270 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6271 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
6272 s
->output_section
= bfd_abs_section_ptr
;
6273 else if (strcmp (s
->name
, "COMMON") == 0)
6275 /* This is a lonely common section which must have
6276 come from an archive. We attach to the section
6277 with the wildcard. */
6278 if (!bfd_link_relocatable (&link_info
)
6279 || command_line
.force_common_definition
)
6281 if (default_common_section
== NULL
)
6282 default_common_section
6283 = lang_output_section_statement_lookup (".bss", 0,
6285 lang_add_section (&default_common_section
->children
, s
,
6286 NULL
, default_common_section
);
6290 ldlang_place_orphan (s
);
6297 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6299 flagword
*ptr_flags
;
6301 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6307 /* PR 17900: An exclamation mark in the attributes reverses
6308 the sense of any of the attributes that follow. */
6311 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6315 *ptr_flags
|= SEC_ALLOC
;
6319 *ptr_flags
|= SEC_READONLY
;
6323 *ptr_flags
|= SEC_DATA
;
6327 *ptr_flags
|= SEC_CODE
;
6332 *ptr_flags
|= SEC_LOAD
;
6336 einfo (_("%P%F: invalid character %c (%d) in flags\n"),
6344 /* Call a function on each input file. This function will be called
6345 on an archive, but not on the elements. */
6348 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6350 lang_input_statement_type
*f
;
6352 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6354 f
= (lang_input_statement_type
*) f
->next_real_file
)
6358 /* Call a function on each file. The function will be called on all
6359 the elements of an archive which are included in the link, but will
6360 not be called on the archive file itself. */
6363 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6365 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6372 ldlang_add_file (lang_input_statement_type
*entry
)
6374 lang_statement_append (&file_chain
,
6375 (lang_statement_union_type
*) entry
,
6378 /* The BFD linker needs to have a list of all input BFDs involved in
6380 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
6381 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6383 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6384 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
6385 entry
->the_bfd
->usrdata
= entry
;
6386 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6388 /* Look through the sections and check for any which should not be
6389 included in the link. We need to do this now, so that we can
6390 notice when the backend linker tries to report multiple
6391 definition errors for symbols which are in sections we aren't
6392 going to link. FIXME: It might be better to entirely ignore
6393 symbols which are defined in sections which are going to be
6394 discarded. This would require modifying the backend linker for
6395 each backend which might set the SEC_LINK_ONCE flag. If we do
6396 this, we should probably handle SEC_EXCLUDE in the same way. */
6398 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6402 lang_add_output (const char *name
, int from_script
)
6404 /* Make -o on command line override OUTPUT in script. */
6405 if (!had_output_filename
|| !from_script
)
6407 output_filename
= name
;
6408 had_output_filename
= TRUE
;
6421 for (l
= 0; l
< 32; l
++)
6423 if (i
>= (unsigned int) x
)
6431 lang_output_section_statement_type
*
6432 lang_enter_output_section_statement (const char *output_section_statement_name
,
6433 etree_type
*address_exp
,
6434 enum section_type sectype
,
6436 etree_type
*subalign
,
6439 int align_with_input
)
6441 lang_output_section_statement_type
*os
;
6443 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6445 current_section
= os
;
6447 if (os
->addr_tree
== NULL
)
6449 os
->addr_tree
= address_exp
;
6451 os
->sectype
= sectype
;
6452 if (sectype
!= noload_section
)
6453 os
->flags
= SEC_NO_FLAGS
;
6455 os
->flags
= SEC_NEVER_LOAD
;
6456 os
->block_value
= 1;
6458 /* Make next things chain into subchain of this. */
6459 push_stat_ptr (&os
->children
);
6461 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6462 if (os
->align_lma_with_input
&& align
!= NULL
)
6463 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"),
6466 os
->subsection_alignment
=
6467 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6468 os
->section_alignment
=
6469 topower (exp_get_value_int (align
, -1, "section alignment"));
6471 os
->load_base
= ebase
;
6478 lang_output_statement_type
*new_stmt
;
6480 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6481 new_stmt
->name
= output_filename
;
6484 /* Reset the current counters in the regions. */
6487 lang_reset_memory_regions (void)
6489 lang_memory_region_type
*p
= lang_memory_region_list
;
6491 lang_output_section_statement_type
*os
;
6493 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6495 p
->current
= p
->origin
;
6499 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6503 os
->processed_vma
= FALSE
;
6504 os
->processed_lma
= FALSE
;
6507 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6509 /* Save the last size for possible use by bfd_relax_section. */
6510 o
->rawsize
= o
->size
;
6515 /* Worker for lang_gc_sections_1. */
6518 gc_section_callback (lang_wild_statement_type
*ptr
,
6519 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6521 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6522 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6523 void *data ATTRIBUTE_UNUSED
)
6525 /* If the wild pattern was marked KEEP, the member sections
6526 should be as well. */
6527 if (ptr
->keep_sections
)
6528 section
->flags
|= SEC_KEEP
;
6531 /* Iterate over sections marking them against GC. */
6534 lang_gc_sections_1 (lang_statement_union_type
*s
)
6536 for (; s
!= NULL
; s
= s
->header
.next
)
6538 switch (s
->header
.type
)
6540 case lang_wild_statement_enum
:
6541 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6543 case lang_constructors_statement_enum
:
6544 lang_gc_sections_1 (constructor_list
.head
);
6546 case lang_output_section_statement_enum
:
6547 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6549 case lang_group_statement_enum
:
6550 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6559 lang_gc_sections (void)
6561 /* Keep all sections so marked in the link script. */
6562 lang_gc_sections_1 (statement_list
.head
);
6564 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6565 the special case of debug info. (See bfd/stabs.c)
6566 Twiddle the flag here, to simplify later linker code. */
6567 if (bfd_link_relocatable (&link_info
))
6569 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6572 #ifdef ENABLE_PLUGINS
6573 if (f
->flags
.claimed
)
6576 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6577 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6578 sec
->flags
&= ~SEC_EXCLUDE
;
6582 if (link_info
.gc_sections
)
6583 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6586 /* Worker for lang_find_relro_sections_1. */
6589 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6590 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6592 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6593 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6596 /* Discarded, excluded and ignored sections effectively have zero
6598 if (section
->output_section
!= NULL
6599 && section
->output_section
->owner
== link_info
.output_bfd
6600 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6601 && !IGNORE_SECTION (section
)
6602 && section
->size
!= 0)
6604 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6605 *has_relro_section
= TRUE
;
6609 /* Iterate over sections for relro sections. */
6612 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6613 bfd_boolean
*has_relro_section
)
6615 if (*has_relro_section
)
6618 for (; s
!= NULL
; s
= s
->header
.next
)
6620 if (s
== expld
.dataseg
.relro_end_stat
)
6623 switch (s
->header
.type
)
6625 case lang_wild_statement_enum
:
6626 walk_wild (&s
->wild_statement
,
6627 find_relro_section_callback
,
6630 case lang_constructors_statement_enum
:
6631 lang_find_relro_sections_1 (constructor_list
.head
,
6634 case lang_output_section_statement_enum
:
6635 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6638 case lang_group_statement_enum
:
6639 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6649 lang_find_relro_sections (void)
6651 bfd_boolean has_relro_section
= FALSE
;
6653 /* Check all sections in the link script. */
6655 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6656 &has_relro_section
);
6658 if (!has_relro_section
)
6659 link_info
.relro
= FALSE
;
6662 /* Relax all sections until bfd_relax_section gives up. */
6665 lang_relax_sections (bfd_boolean need_layout
)
6667 if (RELAXATION_ENABLED
)
6669 /* We may need more than one relaxation pass. */
6670 int i
= link_info
.relax_pass
;
6672 /* The backend can use it to determine the current pass. */
6673 link_info
.relax_pass
= 0;
6677 /* Keep relaxing until bfd_relax_section gives up. */
6678 bfd_boolean relax_again
;
6680 link_info
.relax_trip
= -1;
6683 link_info
.relax_trip
++;
6685 /* Note: pe-dll.c does something like this also. If you find
6686 you need to change this code, you probably need to change
6687 pe-dll.c also. DJ */
6689 /* Do all the assignments with our current guesses as to
6691 lang_do_assignments (lang_assigning_phase_enum
);
6693 /* We must do this after lang_do_assignments, because it uses
6695 lang_reset_memory_regions ();
6697 /* Perform another relax pass - this time we know where the
6698 globals are, so can make a better guess. */
6699 relax_again
= FALSE
;
6700 lang_size_sections (&relax_again
, FALSE
);
6702 while (relax_again
);
6704 link_info
.relax_pass
++;
6711 /* Final extra sizing to report errors. */
6712 lang_do_assignments (lang_assigning_phase_enum
);
6713 lang_reset_memory_regions ();
6714 lang_size_sections (NULL
, TRUE
);
6718 #ifdef ENABLE_PLUGINS
6719 /* Find the insert point for the plugin's replacement files. We
6720 place them after the first claimed real object file, or if the
6721 first claimed object is an archive member, after the last real
6722 object file immediately preceding the archive. In the event
6723 no objects have been claimed at all, we return the first dummy
6724 object file on the list as the insert point; that works, but
6725 the callee must be careful when relinking the file_chain as it
6726 is not actually on that chain, only the statement_list and the
6727 input_file list; in that case, the replacement files must be
6728 inserted at the head of the file_chain. */
6730 static lang_input_statement_type
*
6731 find_replacements_insert_point (void)
6733 lang_input_statement_type
*claim1
, *lastobject
;
6734 lastobject
= &input_file_chain
.head
->input_statement
;
6735 for (claim1
= &file_chain
.head
->input_statement
;
6737 claim1
= &claim1
->next
->input_statement
)
6739 if (claim1
->flags
.claimed
)
6740 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6741 /* Update lastobject if this is a real object file. */
6742 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
6743 lastobject
= claim1
;
6745 /* No files were claimed by the plugin. Choose the last object
6746 file found on the list (maybe the first, dummy entry) as the
6751 /* Insert SRCLIST into DESTLIST after given element by chaining
6752 on FIELD as the next-pointer. (Counterintuitively does not need
6753 a pointer to the actual after-node itself, just its chain field.) */
6756 lang_list_insert_after (lang_statement_list_type
*destlist
,
6757 lang_statement_list_type
*srclist
,
6758 lang_statement_union_type
**field
)
6760 *(srclist
->tail
) = *field
;
6761 *field
= srclist
->head
;
6762 if (destlist
->tail
== field
)
6763 destlist
->tail
= srclist
->tail
;
6766 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6767 was taken as a copy of it and leave them in ORIGLIST. */
6770 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6771 lang_statement_list_type
*origlist
)
6773 union lang_statement_union
**savetail
;
6774 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6775 ASSERT (origlist
->head
== destlist
->head
);
6776 savetail
= origlist
->tail
;
6777 origlist
->head
= *(savetail
);
6778 origlist
->tail
= destlist
->tail
;
6779 destlist
->tail
= savetail
;
6782 #endif /* ENABLE_PLUGINS */
6784 /* Add NAME to the list of garbage collection entry points. */
6787 lang_add_gc_name (const char *name
)
6789 struct bfd_sym_chain
*sym
;
6794 sym
= (struct bfd_sym_chain
*) stat_alloc (sizeof (*sym
));
6796 sym
->next
= link_info
.gc_sym_list
;
6798 link_info
.gc_sym_list
= sym
;
6801 /* Check relocations. */
6804 lang_check_relocs (void)
6806 if (link_info
.check_relocs_after_open_input
)
6810 for (abfd
= link_info
.input_bfds
;
6811 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
6812 if (!bfd_link_check_relocs (abfd
, &link_info
))
6814 /* No object output, fail return. */
6815 config
.make_executable
= FALSE
;
6816 /* Note: we do not abort the loop, but rather
6817 continue the scan in case there are other
6818 bad relocations to report. */
6826 /* Finalize dynamic list. */
6827 if (link_info
.dynamic_list
)
6828 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6830 current_target
= default_target
;
6832 /* Open the output file. */
6833 lang_for_each_statement (ldlang_open_output
);
6836 ldemul_create_output_section_statements ();
6838 /* Add to the hash table all undefineds on the command line. */
6839 lang_place_undefineds ();
6841 if (!bfd_section_already_linked_table_init ())
6842 einfo (_("%P%F: Failed to create hash table\n"));
6844 /* Create a bfd for each input file. */
6845 current_target
= default_target
;
6846 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6848 #ifdef ENABLE_PLUGINS
6849 if (link_info
.lto_plugin_active
)
6851 lang_statement_list_type added
;
6852 lang_statement_list_type files
, inputfiles
;
6854 /* Now all files are read, let the plugin(s) decide if there
6855 are any more to be added to the link before we call the
6856 emulation's after_open hook. We create a private list of
6857 input statements for this purpose, which we will eventually
6858 insert into the global statment list after the first claimed
6861 /* We need to manipulate all three chains in synchrony. */
6863 inputfiles
= input_file_chain
;
6864 if (plugin_call_all_symbols_read ())
6865 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6866 plugin_error_plugin ());
6867 /* Open any newly added files, updating the file chains. */
6868 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6869 /* Restore the global list pointer now they have all been added. */
6870 lang_list_remove_tail (stat_ptr
, &added
);
6871 /* And detach the fresh ends of the file lists. */
6872 lang_list_remove_tail (&file_chain
, &files
);
6873 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6874 /* Were any new files added? */
6875 if (added
.head
!= NULL
)
6877 /* If so, we will insert them into the statement list immediately
6878 after the first input file that was claimed by the plugin. */
6879 plugin_insert
= find_replacements_insert_point ();
6880 /* If a plugin adds input files without having claimed any, we
6881 don't really have a good idea where to place them. Just putting
6882 them at the start or end of the list is liable to leave them
6883 outside the crtbegin...crtend range. */
6884 ASSERT (plugin_insert
!= NULL
);
6885 /* Splice the new statement list into the old one. */
6886 lang_list_insert_after (stat_ptr
, &added
,
6887 &plugin_insert
->header
.next
);
6888 /* Likewise for the file chains. */
6889 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6890 &plugin_insert
->next_real_file
);
6891 /* We must be careful when relinking file_chain; we may need to
6892 insert the new files at the head of the list if the insert
6893 point chosen is the dummy first input file. */
6894 if (plugin_insert
->filename
)
6895 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6897 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6899 /* Rescan archives in case new undefined symbols have appeared. */
6900 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6903 #endif /* ENABLE_PLUGINS */
6905 /* Make sure that nobody has tried to add a symbol to this list
6907 ASSERT (link_info
.gc_sym_list
== NULL
);
6909 link_info
.gc_sym_list
= &entry_symbol
;
6911 if (entry_symbol
.name
== NULL
)
6913 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6915 /* entry_symbol is normally initialied by a ENTRY definition in the
6916 linker script or the -e command line option. But if neither of
6917 these have been used, the target specific backend may still have
6918 provided an entry symbol via a call to lang_default_entry().
6919 Unfortunately this value will not be processed until lang_end()
6920 is called, long after this function has finished. So detect this
6921 case here and add the target's entry symbol to the list of starting
6922 points for garbage collection resolution. */
6923 lang_add_gc_name (entry_symbol_default
);
6926 lang_add_gc_name (link_info
.init_function
);
6927 lang_add_gc_name (link_info
.fini_function
);
6929 ldemul_after_open ();
6930 if (config
.map_file
!= NULL
)
6931 lang_print_asneeded ();
6933 bfd_section_already_linked_table_free ();
6935 /* Make sure that we're not mixing architectures. We call this
6936 after all the input files have been opened, but before we do any
6937 other processing, so that any operations merge_private_bfd_data
6938 does on the output file will be known during the rest of the
6942 /* Handle .exports instead of a version script if we're told to do so. */
6943 if (command_line
.version_exports_section
)
6944 lang_do_version_exports_section ();
6946 /* Build all sets based on the information gathered from the input
6948 ldctor_build_sets ();
6950 /* PR 13683: We must rerun the assignments prior to running garbage
6951 collection in order to make sure that all symbol aliases are resolved. */
6952 lang_do_assignments (lang_mark_phase_enum
);
6954 lang_do_memory_regions();
6955 expld
.phase
= lang_first_phase_enum
;
6957 /* Size up the common data. */
6960 /* Remove unreferenced sections if asked to. */
6961 lang_gc_sections ();
6963 /* Check relocations. */
6964 lang_check_relocs ();
6966 /* Update wild statements. */
6967 update_wild_statements (statement_list
.head
);
6969 /* Run through the contours of the script and attach input sections
6970 to the correct output sections. */
6971 lang_statement_iteration
++;
6972 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6974 process_insert_statements ();
6976 /* Find any sections not attached explicitly and handle them. */
6977 lang_place_orphans ();
6979 if (!bfd_link_relocatable (&link_info
))
6983 /* Merge SEC_MERGE sections. This has to be done after GC of
6984 sections, so that GCed sections are not merged, but before
6985 assigning dynamic symbols, since removing whole input sections
6987 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6989 /* Look for a text section and set the readonly attribute in it. */
6990 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6994 if (config
.text_read_only
)
6995 found
->flags
|= SEC_READONLY
;
6997 found
->flags
&= ~SEC_READONLY
;
7001 /* Do anything special before sizing sections. This is where ELF
7002 and other back-ends size dynamic sections. */
7003 ldemul_before_allocation ();
7005 /* We must record the program headers before we try to fix the
7006 section positions, since they will affect SIZEOF_HEADERS. */
7007 lang_record_phdrs ();
7009 /* Check relro sections. */
7010 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
7011 lang_find_relro_sections ();
7013 /* Size up the sections. */
7014 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
7016 /* See if anything special should be done now we know how big
7017 everything is. This is where relaxation is done. */
7018 ldemul_after_allocation ();
7020 /* Fix any .startof. or .sizeof. symbols. */
7021 lang_set_startof ();
7023 /* Do all the assignments, now that we know the final resting places
7024 of all the symbols. */
7025 lang_do_assignments (lang_final_phase_enum
);
7029 /* Convert absolute symbols to section relative. */
7030 ldexp_finalize_syms ();
7032 /* Make sure that the section addresses make sense. */
7033 if (command_line
.check_section_addresses
)
7034 lang_check_section_addresses ();
7036 /* Check any required symbols are known. */
7037 ldlang_check_require_defined_symbols ();
7042 /* EXPORTED TO YACC */
7045 lang_add_wild (struct wildcard_spec
*filespec
,
7046 struct wildcard_list
*section_list
,
7047 bfd_boolean keep_sections
)
7049 struct wildcard_list
*curr
, *next
;
7050 lang_wild_statement_type
*new_stmt
;
7052 /* Reverse the list as the parser puts it back to front. */
7053 for (curr
= section_list
, section_list
= NULL
;
7055 section_list
= curr
, curr
= next
)
7057 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
7058 placed_commons
= TRUE
;
7061 curr
->next
= section_list
;
7064 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
7066 if (strcmp (filespec
->name
, "*") == 0)
7067 filespec
->name
= NULL
;
7068 else if (!wildcardp (filespec
->name
))
7069 lang_has_input_file
= TRUE
;
7072 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
7073 new_stmt
->filename
= NULL
;
7074 new_stmt
->filenames_sorted
= FALSE
;
7075 new_stmt
->section_flag_list
= NULL
;
7076 if (filespec
!= NULL
)
7078 new_stmt
->filename
= filespec
->name
;
7079 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
7080 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
7082 new_stmt
->section_list
= section_list
;
7083 new_stmt
->keep_sections
= keep_sections
;
7084 lang_list_init (&new_stmt
->children
);
7085 analyze_walk_wild_section_handler (new_stmt
);
7089 lang_section_start (const char *name
, etree_type
*address
,
7090 const segment_type
*segment
)
7092 lang_address_statement_type
*ad
;
7094 ad
= new_stat (lang_address_statement
, stat_ptr
);
7095 ad
->section_name
= name
;
7096 ad
->address
= address
;
7097 ad
->segment
= segment
;
7100 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7101 because of a -e argument on the command line, or zero if this is
7102 called by ENTRY in a linker script. Command line arguments take
7106 lang_add_entry (const char *name
, bfd_boolean cmdline
)
7108 if (entry_symbol
.name
== NULL
7110 || !entry_from_cmdline
)
7112 entry_symbol
.name
= name
;
7113 entry_from_cmdline
= cmdline
;
7117 /* Set the default start symbol to NAME. .em files should use this,
7118 not lang_add_entry, to override the use of "start" if neither the
7119 linker script nor the command line specifies an entry point. NAME
7120 must be permanently allocated. */
7122 lang_default_entry (const char *name
)
7124 entry_symbol_default
= name
;
7128 lang_add_target (const char *name
)
7130 lang_target_statement_type
*new_stmt
;
7132 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
7133 new_stmt
->target
= name
;
7137 lang_add_map (const char *name
)
7144 map_option_f
= TRUE
;
7152 lang_add_fill (fill_type
*fill
)
7154 lang_fill_statement_type
*new_stmt
;
7156 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
7157 new_stmt
->fill
= fill
;
7161 lang_add_data (int type
, union etree_union
*exp
)
7163 lang_data_statement_type
*new_stmt
;
7165 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
7166 new_stmt
->exp
= exp
;
7167 new_stmt
->type
= type
;
7170 /* Create a new reloc statement. RELOC is the BFD relocation type to
7171 generate. HOWTO is the corresponding howto structure (we could
7172 look this up, but the caller has already done so). SECTION is the
7173 section to generate a reloc against, or NAME is the name of the
7174 symbol to generate a reloc against. Exactly one of SECTION and
7175 NAME must be NULL. ADDEND is an expression for the addend. */
7178 lang_add_reloc (bfd_reloc_code_real_type reloc
,
7179 reloc_howto_type
*howto
,
7182 union etree_union
*addend
)
7184 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
7188 p
->section
= section
;
7190 p
->addend_exp
= addend
;
7192 p
->addend_value
= 0;
7193 p
->output_section
= NULL
;
7194 p
->output_offset
= 0;
7197 lang_assignment_statement_type
*
7198 lang_add_assignment (etree_type
*exp
)
7200 lang_assignment_statement_type
*new_stmt
;
7202 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
7203 new_stmt
->exp
= exp
;
7208 lang_add_attribute (enum statement_enum attribute
)
7210 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
7214 lang_startup (const char *name
)
7216 if (first_file
->filename
!= NULL
)
7218 einfo (_("%P%F: multiple STARTUP files\n"));
7220 first_file
->filename
= name
;
7221 first_file
->local_sym_name
= name
;
7222 first_file
->flags
.real
= TRUE
;
7226 lang_float (bfd_boolean maybe
)
7228 lang_float_flag
= maybe
;
7232 /* Work out the load- and run-time regions from a script statement, and
7233 store them in *LMA_REGION and *REGION respectively.
7235 MEMSPEC is the name of the run-time region, or the value of
7236 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7237 LMA_MEMSPEC is the name of the load-time region, or null if the
7238 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7239 had an explicit load address.
7241 It is an error to specify both a load region and a load address. */
7244 lang_get_regions (lang_memory_region_type
**region
,
7245 lang_memory_region_type
**lma_region
,
7246 const char *memspec
,
7247 const char *lma_memspec
,
7248 bfd_boolean have_lma
,
7249 bfd_boolean have_vma
)
7251 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7253 /* If no runtime region or VMA has been specified, but the load region
7254 has been specified, then use the load region for the runtime region
7256 if (lma_memspec
!= NULL
7258 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7259 *region
= *lma_region
;
7261 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7263 if (have_lma
&& lma_memspec
!= 0)
7264 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7269 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7270 lang_output_section_phdr_list
*phdrs
,
7271 const char *lma_memspec
)
7273 lang_get_regions (¤t_section
->region
,
7274 ¤t_section
->lma_region
,
7275 memspec
, lma_memspec
,
7276 current_section
->load_base
!= NULL
,
7277 current_section
->addr_tree
!= NULL
);
7279 /* If this section has no load region or base, but uses the same
7280 region as the previous section, then propagate the previous
7281 section's load region. */
7283 if (current_section
->lma_region
== NULL
7284 && current_section
->load_base
== NULL
7285 && current_section
->addr_tree
== NULL
7286 && current_section
->region
== current_section
->prev
->region
)
7287 current_section
->lma_region
= current_section
->prev
->lma_region
;
7289 current_section
->fill
= fill
;
7290 current_section
->phdrs
= phdrs
;
7295 lang_statement_append (lang_statement_list_type
*list
,
7296 lang_statement_union_type
*element
,
7297 lang_statement_union_type
**field
)
7299 *(list
->tail
) = element
;
7303 /* Set the output format type. -oformat overrides scripts. */
7306 lang_add_output_format (const char *format
,
7311 if (output_target
== NULL
|| !from_script
)
7313 if (command_line
.endian
== ENDIAN_BIG
7316 else if (command_line
.endian
== ENDIAN_LITTLE
7320 output_target
= format
;
7325 lang_add_insert (const char *where
, int is_before
)
7327 lang_insert_statement_type
*new_stmt
;
7329 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7330 new_stmt
->where
= where
;
7331 new_stmt
->is_before
= is_before
;
7332 saved_script_handle
= previous_script_handle
;
7335 /* Enter a group. This creates a new lang_group_statement, and sets
7336 stat_ptr to build new statements within the group. */
7339 lang_enter_group (void)
7341 lang_group_statement_type
*g
;
7343 g
= new_stat (lang_group_statement
, stat_ptr
);
7344 lang_list_init (&g
->children
);
7345 push_stat_ptr (&g
->children
);
7348 /* Leave a group. This just resets stat_ptr to start writing to the
7349 regular list of statements again. Note that this will not work if
7350 groups can occur inside anything else which can adjust stat_ptr,
7351 but currently they can't. */
7354 lang_leave_group (void)
7359 /* Add a new program header. This is called for each entry in a PHDRS
7360 command in a linker script. */
7363 lang_new_phdr (const char *name
,
7365 bfd_boolean filehdr
,
7370 struct lang_phdr
*n
, **pp
;
7373 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7376 n
->type
= exp_get_value_int (type
, 0, "program header type");
7377 n
->filehdr
= filehdr
;
7382 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7384 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7387 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7389 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7390 " when prior PT_LOAD headers lack them\n"), NULL
);
7397 /* Record the program header information in the output BFD. FIXME: We
7398 should not be calling an ELF specific function here. */
7401 lang_record_phdrs (void)
7405 lang_output_section_phdr_list
*last
;
7406 struct lang_phdr
*l
;
7407 lang_output_section_statement_type
*os
;
7410 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7413 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7420 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7424 lang_output_section_phdr_list
*pl
;
7426 if (os
->constraint
< 0)
7434 if (os
->sectype
== noload_section
7435 || os
->bfd_section
== NULL
7436 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7439 /* Don't add orphans to PT_INTERP header. */
7445 lang_output_section_statement_type
*tmp_os
;
7447 /* If we have not run across a section with a program
7448 header assigned to it yet, then scan forwards to find
7449 one. This prevents inconsistencies in the linker's
7450 behaviour when a script has specified just a single
7451 header and there are sections in that script which are
7452 not assigned to it, and which occur before the first
7453 use of that header. See here for more details:
7454 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7455 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7458 last
= tmp_os
->phdrs
;
7462 einfo (_("%F%P: no sections assigned to phdrs\n"));
7467 if (os
->bfd_section
== NULL
)
7470 for (; pl
!= NULL
; pl
= pl
->next
)
7472 if (strcmp (pl
->name
, l
->name
) == 0)
7477 secs
= (asection
**) xrealloc (secs
,
7478 alc
* sizeof (asection
*));
7480 secs
[c
] = os
->bfd_section
;
7487 if (l
->flags
== NULL
)
7490 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7495 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7497 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7498 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7499 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7500 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7505 /* Make sure all the phdr assignments succeeded. */
7506 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7510 lang_output_section_phdr_list
*pl
;
7512 if (os
->constraint
< 0
7513 || os
->bfd_section
== NULL
)
7516 for (pl
= os
->phdrs
;
7519 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7520 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7521 os
->name
, pl
->name
);
7525 /* Record a list of sections which may not be cross referenced. */
7528 lang_add_nocrossref (lang_nocrossref_type
*l
)
7530 struct lang_nocrossrefs
*n
;
7532 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7533 n
->next
= nocrossref_list
;
7535 n
->onlyfirst
= FALSE
;
7536 nocrossref_list
= n
;
7538 /* Set notice_all so that we get informed about all symbols. */
7539 link_info
.notice_all
= TRUE
;
7542 /* Record a section that cannot be referenced from a list of sections. */
7545 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
7547 lang_add_nocrossref (l
);
7548 nocrossref_list
->onlyfirst
= TRUE
;
7551 /* Overlay handling. We handle overlays with some static variables. */
7553 /* The overlay virtual address. */
7554 static etree_type
*overlay_vma
;
7555 /* And subsection alignment. */
7556 static etree_type
*overlay_subalign
;
7558 /* An expression for the maximum section size seen so far. */
7559 static etree_type
*overlay_max
;
7561 /* A list of all the sections in this overlay. */
7563 struct overlay_list
{
7564 struct overlay_list
*next
;
7565 lang_output_section_statement_type
*os
;
7568 static struct overlay_list
*overlay_list
;
7570 /* Start handling an overlay. */
7573 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7575 /* The grammar should prevent nested overlays from occurring. */
7576 ASSERT (overlay_vma
== NULL
7577 && overlay_subalign
== NULL
7578 && overlay_max
== NULL
);
7580 overlay_vma
= vma_expr
;
7581 overlay_subalign
= subalign
;
7584 /* Start a section in an overlay. We handle this by calling
7585 lang_enter_output_section_statement with the correct VMA.
7586 lang_leave_overlay sets up the LMA and memory regions. */
7589 lang_enter_overlay_section (const char *name
)
7591 struct overlay_list
*n
;
7594 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7595 0, overlay_subalign
, 0, 0, 0);
7597 /* If this is the first section, then base the VMA of future
7598 sections on this one. This will work correctly even if `.' is
7599 used in the addresses. */
7600 if (overlay_list
== NULL
)
7601 overlay_vma
= exp_nameop (ADDR
, name
);
7603 /* Remember the section. */
7604 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7605 n
->os
= current_section
;
7606 n
->next
= overlay_list
;
7609 size
= exp_nameop (SIZEOF
, name
);
7611 /* Arrange to work out the maximum section end address. */
7612 if (overlay_max
== NULL
)
7615 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7618 /* Finish a section in an overlay. There isn't any special to do
7622 lang_leave_overlay_section (fill_type
*fill
,
7623 lang_output_section_phdr_list
*phdrs
)
7630 name
= current_section
->name
;
7632 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7633 region and that no load-time region has been specified. It doesn't
7634 really matter what we say here, since lang_leave_overlay will
7636 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7638 /* Define the magic symbols. */
7640 clean
= (char *) xmalloc (strlen (name
) + 1);
7642 for (s1
= name
; *s1
!= '\0'; s1
++)
7643 if (ISALNUM (*s1
) || *s1
== '_')
7647 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7648 sprintf (buf
, "__load_start_%s", clean
);
7649 lang_add_assignment (exp_provide (buf
,
7650 exp_nameop (LOADADDR
, name
),
7653 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7654 sprintf (buf
, "__load_stop_%s", clean
);
7655 lang_add_assignment (exp_provide (buf
,
7657 exp_nameop (LOADADDR
, name
),
7658 exp_nameop (SIZEOF
, name
)),
7664 /* Finish an overlay. If there are any overlay wide settings, this
7665 looks through all the sections in the overlay and sets them. */
7668 lang_leave_overlay (etree_type
*lma_expr
,
7671 const char *memspec
,
7672 lang_output_section_phdr_list
*phdrs
,
7673 const char *lma_memspec
)
7675 lang_memory_region_type
*region
;
7676 lang_memory_region_type
*lma_region
;
7677 struct overlay_list
*l
;
7678 lang_nocrossref_type
*nocrossref
;
7680 lang_get_regions (®ion
, &lma_region
,
7681 memspec
, lma_memspec
,
7682 lma_expr
!= NULL
, FALSE
);
7686 /* After setting the size of the last section, set '.' to end of the
7688 if (overlay_list
!= NULL
)
7690 overlay_list
->os
->update_dot
= 1;
7691 overlay_list
->os
->update_dot_tree
7692 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
7698 struct overlay_list
*next
;
7700 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7703 l
->os
->region
= region
;
7704 l
->os
->lma_region
= lma_region
;
7706 /* The first section has the load address specified in the
7707 OVERLAY statement. The rest are worked out from that.
7708 The base address is not needed (and should be null) if
7709 an LMA region was specified. */
7712 l
->os
->load_base
= lma_expr
;
7713 l
->os
->sectype
= normal_section
;
7715 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7716 l
->os
->phdrs
= phdrs
;
7720 lang_nocrossref_type
*nc
;
7722 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7723 nc
->name
= l
->os
->name
;
7724 nc
->next
= nocrossref
;
7733 if (nocrossref
!= NULL
)
7734 lang_add_nocrossref (nocrossref
);
7737 overlay_list
= NULL
;
7741 /* Version handling. This is only useful for ELF. */
7743 /* If PREV is NULL, return first version pattern matching particular symbol.
7744 If PREV is non-NULL, return first version pattern matching particular
7745 symbol after PREV (previously returned by lang_vers_match). */
7747 static struct bfd_elf_version_expr
*
7748 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7749 struct bfd_elf_version_expr
*prev
,
7753 const char *cxx_sym
= sym
;
7754 const char *java_sym
= sym
;
7755 struct bfd_elf_version_expr
*expr
= NULL
;
7756 enum demangling_styles curr_style
;
7758 curr_style
= CURRENT_DEMANGLING_STYLE
;
7759 cplus_demangle_set_style (no_demangling
);
7760 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7763 cplus_demangle_set_style (curr_style
);
7765 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7767 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7768 DMGL_PARAMS
| DMGL_ANSI
);
7772 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7774 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7779 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7781 struct bfd_elf_version_expr e
;
7783 switch (prev
? prev
->mask
: 0)
7786 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7789 expr
= (struct bfd_elf_version_expr
*)
7790 htab_find ((htab_t
) head
->htab
, &e
);
7791 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7792 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7798 case BFD_ELF_VERSION_C_TYPE
:
7799 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7801 e
.pattern
= cxx_sym
;
7802 expr
= (struct bfd_elf_version_expr
*)
7803 htab_find ((htab_t
) head
->htab
, &e
);
7804 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7805 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7811 case BFD_ELF_VERSION_CXX_TYPE
:
7812 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7814 e
.pattern
= java_sym
;
7815 expr
= (struct bfd_elf_version_expr
*)
7816 htab_find ((htab_t
) head
->htab
, &e
);
7817 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7818 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7829 /* Finally, try the wildcards. */
7830 if (prev
== NULL
|| prev
->literal
)
7831 expr
= head
->remaining
;
7834 for (; expr
; expr
= expr
->next
)
7841 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7844 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7846 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7850 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7856 free ((char *) c_sym
);
7858 free ((char *) cxx_sym
);
7859 if (java_sym
!= sym
)
7860 free ((char *) java_sym
);
7864 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7865 return a pointer to the symbol name with any backslash quotes removed. */
7868 realsymbol (const char *pattern
)
7871 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7872 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7874 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7876 /* It is a glob pattern only if there is no preceding
7880 /* Remove the preceding backslash. */
7887 if (*p
== '?' || *p
== '*' || *p
== '[')
7894 backslash
= *p
== '\\';
7910 /* This is called for each variable name or match expression. NEW_NAME is
7911 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7912 pattern to be matched against symbol names. */
7914 struct bfd_elf_version_expr
*
7915 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7916 const char *new_name
,
7918 bfd_boolean literal_p
)
7920 struct bfd_elf_version_expr
*ret
;
7922 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7926 ret
->literal
= TRUE
;
7927 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7928 if (ret
->pattern
== NULL
)
7930 ret
->pattern
= new_name
;
7931 ret
->literal
= FALSE
;
7934 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7935 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7936 else if (strcasecmp (lang
, "C++") == 0)
7937 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7938 else if (strcasecmp (lang
, "Java") == 0)
7939 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7942 einfo (_("%X%P: unknown language `%s' in version information\n"),
7944 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7947 return ldemul_new_vers_pattern (ret
);
7950 /* This is called for each set of variable names and match
7953 struct bfd_elf_version_tree
*
7954 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7955 struct bfd_elf_version_expr
*locals
)
7957 struct bfd_elf_version_tree
*ret
;
7959 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7960 ret
->globals
.list
= globals
;
7961 ret
->locals
.list
= locals
;
7962 ret
->match
= lang_vers_match
;
7963 ret
->name_indx
= (unsigned int) -1;
7967 /* This static variable keeps track of version indices. */
7969 static int version_index
;
7972 version_expr_head_hash (const void *p
)
7974 const struct bfd_elf_version_expr
*e
=
7975 (const struct bfd_elf_version_expr
*) p
;
7977 return htab_hash_string (e
->pattern
);
7981 version_expr_head_eq (const void *p1
, const void *p2
)
7983 const struct bfd_elf_version_expr
*e1
=
7984 (const struct bfd_elf_version_expr
*) p1
;
7985 const struct bfd_elf_version_expr
*e2
=
7986 (const struct bfd_elf_version_expr
*) p2
;
7988 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7992 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7995 struct bfd_elf_version_expr
*e
, *next
;
7996 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7998 for (e
= head
->list
; e
; e
= e
->next
)
8002 head
->mask
|= e
->mask
;
8007 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
8008 version_expr_head_eq
, NULL
);
8009 list_loc
= &head
->list
;
8010 remaining_loc
= &head
->remaining
;
8011 for (e
= head
->list
; e
; e
= next
)
8017 remaining_loc
= &e
->next
;
8021 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
8025 struct bfd_elf_version_expr
*e1
, *last
;
8027 e1
= (struct bfd_elf_version_expr
*) *loc
;
8031 if (e1
->mask
== e
->mask
)
8039 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
8043 /* This is a duplicate. */
8044 /* FIXME: Memory leak. Sometimes pattern is not
8045 xmalloced alone, but in larger chunk of memory. */
8046 /* free (e->pattern); */
8051 e
->next
= last
->next
;
8059 list_loc
= &e
->next
;
8063 *remaining_loc
= NULL
;
8064 *list_loc
= head
->remaining
;
8067 head
->remaining
= head
->list
;
8070 /* This is called when we know the name and dependencies of the
8074 lang_register_vers_node (const char *name
,
8075 struct bfd_elf_version_tree
*version
,
8076 struct bfd_elf_version_deps
*deps
)
8078 struct bfd_elf_version_tree
*t
, **pp
;
8079 struct bfd_elf_version_expr
*e1
;
8084 if (link_info
.version_info
!= NULL
8085 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
8087 einfo (_("%X%P: anonymous version tag cannot be combined"
8088 " with other version tags\n"));
8093 /* Make sure this node has a unique name. */
8094 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8095 if (strcmp (t
->name
, name
) == 0)
8096 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
8098 lang_finalize_version_expr_head (&version
->globals
);
8099 lang_finalize_version_expr_head (&version
->locals
);
8101 /* Check the global and local match names, and make sure there
8102 aren't any duplicates. */
8104 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
8106 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8108 struct bfd_elf_version_expr
*e2
;
8110 if (t
->locals
.htab
&& e1
->literal
)
8112 e2
= (struct bfd_elf_version_expr
*)
8113 htab_find ((htab_t
) t
->locals
.htab
, e1
);
8114 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8116 if (e1
->mask
== e2
->mask
)
8117 einfo (_("%X%P: duplicate expression `%s'"
8118 " in version information\n"), e1
->pattern
);
8122 else if (!e1
->literal
)
8123 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8124 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8125 && e1
->mask
== e2
->mask
)
8126 einfo (_("%X%P: duplicate expression `%s'"
8127 " in version information\n"), e1
->pattern
);
8131 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
8133 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8135 struct bfd_elf_version_expr
*e2
;
8137 if (t
->globals
.htab
&& e1
->literal
)
8139 e2
= (struct bfd_elf_version_expr
*)
8140 htab_find ((htab_t
) t
->globals
.htab
, e1
);
8141 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8143 if (e1
->mask
== e2
->mask
)
8144 einfo (_("%X%P: duplicate expression `%s'"
8145 " in version information\n"),
8150 else if (!e1
->literal
)
8151 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8152 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8153 && e1
->mask
== e2
->mask
)
8154 einfo (_("%X%P: duplicate expression `%s'"
8155 " in version information\n"), e1
->pattern
);
8159 version
->deps
= deps
;
8160 version
->name
= name
;
8161 if (name
[0] != '\0')
8164 version
->vernum
= version_index
;
8167 version
->vernum
= 0;
8169 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8174 /* This is called when we see a version dependency. */
8176 struct bfd_elf_version_deps
*
8177 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
8179 struct bfd_elf_version_deps
*ret
;
8180 struct bfd_elf_version_tree
*t
;
8182 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
8185 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8187 if (strcmp (t
->name
, name
) == 0)
8189 ret
->version_needed
= t
;
8194 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
8196 ret
->version_needed
= NULL
;
8201 lang_do_version_exports_section (void)
8203 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
8205 LANG_FOR_EACH_INPUT_STATEMENT (is
)
8207 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
8215 contents
= (char *) xmalloc (len
);
8216 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
8217 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
8220 while (p
< contents
+ len
)
8222 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
8223 p
= strchr (p
, '\0') + 1;
8226 /* Do not free the contents, as we used them creating the regex. */
8228 /* Do not include this section in the link. */
8229 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
8232 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
8233 lang_register_vers_node (command_line
.version_exports_section
,
8234 lang_new_vers_node (greg
, lreg
), NULL
);
8237 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8240 lang_do_memory_regions (void)
8242 lang_memory_region_type
*r
= lang_memory_region_list
;
8244 for (; r
!= NULL
; r
= r
->next
)
8248 exp_fold_tree_no_dot (r
->origin_exp
);
8249 if (expld
.result
.valid_p
)
8251 r
->origin
= expld
.result
.value
;
8252 r
->current
= r
->origin
;
8255 einfo (_("%F%P: invalid origin for memory region %s\n"),
8260 exp_fold_tree_no_dot (r
->length_exp
);
8261 if (expld
.result
.valid_p
)
8262 r
->length
= expld
.result
.value
;
8264 einfo (_("%F%P: invalid length for memory region %s\n"),
8271 lang_add_unique (const char *name
)
8273 struct unique_sections
*ent
;
8275 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8276 if (strcmp (ent
->name
, name
) == 0)
8279 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8280 ent
->name
= xstrdup (name
);
8281 ent
->next
= unique_section_list
;
8282 unique_section_list
= ent
;
8285 /* Append the list of dynamic symbols to the existing one. */
8288 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8290 if (link_info
.dynamic_list
)
8292 struct bfd_elf_version_expr
*tail
;
8293 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8295 tail
->next
= link_info
.dynamic_list
->head
.list
;
8296 link_info
.dynamic_list
->head
.list
= dynamic
;
8300 struct bfd_elf_dynamic_list
*d
;
8302 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8303 d
->head
.list
= dynamic
;
8304 d
->match
= lang_vers_match
;
8305 link_info
.dynamic_list
= d
;
8309 /* Append the list of C++ typeinfo dynamic symbols to the existing
8313 lang_append_dynamic_list_cpp_typeinfo (void)
8315 const char *symbols
[] =
8317 "typeinfo name for*",
8320 struct bfd_elf_version_expr
*dynamic
= NULL
;
8323 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8324 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8327 lang_append_dynamic_list (dynamic
);
8330 /* Append the list of C++ operator new and delete dynamic symbols to the
8334 lang_append_dynamic_list_cpp_new (void)
8336 const char *symbols
[] =
8341 struct bfd_elf_version_expr
*dynamic
= NULL
;
8344 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8345 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8348 lang_append_dynamic_list (dynamic
);
8351 /* Scan a space and/or comma separated string of features. */
8354 lang_ld_feature (char *str
)
8362 while (*p
== ',' || ISSPACE (*p
))
8367 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8371 if (strcasecmp (p
, "SANE_EXPR") == 0)
8372 config
.sane_expr
= TRUE
;
8374 einfo (_("%X%P: unknown feature `%s'\n"), p
);
8380 /* Pretty print memory amount. */
8383 lang_print_memory_size (bfd_vma sz
)
8385 if ((sz
& 0x3fffffff) == 0)
8386 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
8387 else if ((sz
& 0xfffff) == 0)
8388 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
8389 else if ((sz
& 0x3ff) == 0)
8390 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
8392 printf (" %10" BFD_VMA_FMT
"u B", sz
);
8395 /* Implement --print-memory-usage: disply per region memory usage. */
8398 lang_print_memory_usage (void)
8400 lang_memory_region_type
*r
;
8402 printf ("Memory region Used Size Region Size %%age Used\n");
8403 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
8405 bfd_vma used_length
= r
->current
- r
->origin
;
8408 printf ("%16s: ",r
->name_list
.name
);
8409 lang_print_memory_size (used_length
);
8410 lang_print_memory_size ((bfd_vma
) r
->length
);
8412 percent
= used_length
* 100.0 / r
->length
;
8414 printf (" %6.2f%%\n", percent
);