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 if (!(abfd
->flags
& DYNAMIC
))
2298 bfd_section_already_linked (abfd
, sec
, &link_info
);
2301 /* The wild routines.
2303 These expand statements like *(.text) and foo.o to a list of
2304 explicit actions, like foo.o(.text), bar.o(.text) and
2305 foo.o(.text, .data). */
2307 /* Add SECTION to the output section OUTPUT. Do this by creating a
2308 lang_input_section statement which is placed at PTR. */
2311 lang_add_section (lang_statement_list_type
*ptr
,
2313 struct flag_info
*sflag_info
,
2314 lang_output_section_statement_type
*output
)
2316 flagword flags
= section
->flags
;
2318 bfd_boolean discard
;
2319 lang_input_section_type
*new_section
;
2320 bfd
*abfd
= link_info
.output_bfd
;
2322 /* Discard sections marked with SEC_EXCLUDE. */
2323 discard
= (flags
& SEC_EXCLUDE
) != 0;
2325 /* Discard input sections which are assigned to a section named
2326 DISCARD_SECTION_NAME. */
2327 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2330 /* Discard debugging sections if we are stripping debugging
2332 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2333 && (flags
& SEC_DEBUGGING
) != 0)
2338 if (section
->output_section
== NULL
)
2340 /* This prevents future calls from assigning this section. */
2341 section
->output_section
= bfd_abs_section_ptr
;
2350 keep
= bfd_lookup_section_flags (&link_info
, sflag_info
, section
);
2355 if (section
->output_section
!= NULL
)
2358 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2359 to an output section, because we want to be able to include a
2360 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2361 section (I don't know why we want to do this, but we do).
2362 build_link_order in ldwrite.c handles this case by turning
2363 the embedded SEC_NEVER_LOAD section into a fill. */
2364 flags
&= ~ SEC_NEVER_LOAD
;
2366 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2367 already been processed. One reason to do this is that on pe
2368 format targets, .text$foo sections go into .text and it's odd
2369 to see .text with SEC_LINK_ONCE set. */
2371 if (!bfd_link_relocatable (&link_info
))
2372 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2374 switch (output
->sectype
)
2376 case normal_section
:
2377 case overlay_section
:
2379 case noalloc_section
:
2380 flags
&= ~SEC_ALLOC
;
2382 case noload_section
:
2384 flags
|= SEC_NEVER_LOAD
;
2385 /* Unfortunately GNU ld has managed to evolve two different
2386 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2387 alloc, no contents section. All others get a noload, noalloc
2389 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2390 flags
&= ~SEC_HAS_CONTENTS
;
2392 flags
&= ~SEC_ALLOC
;
2396 if (output
->bfd_section
== NULL
)
2397 init_os (output
, flags
);
2399 /* If SEC_READONLY is not set in the input section, then clear
2400 it from the output section. */
2401 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2403 if (output
->bfd_section
->linker_has_input
)
2405 /* Only set SEC_READONLY flag on the first input section. */
2406 flags
&= ~ SEC_READONLY
;
2408 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2409 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2410 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2411 || ((flags
& SEC_MERGE
) != 0
2412 && output
->bfd_section
->entsize
!= section
->entsize
))
2414 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2415 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2418 output
->bfd_section
->flags
|= flags
;
2420 if (!output
->bfd_section
->linker_has_input
)
2422 output
->bfd_section
->linker_has_input
= 1;
2423 /* This must happen after flags have been updated. The output
2424 section may have been created before we saw its first input
2425 section, eg. for a data statement. */
2426 bfd_init_private_section_data (section
->owner
, section
,
2427 link_info
.output_bfd
,
2428 output
->bfd_section
,
2430 if ((flags
& SEC_MERGE
) != 0)
2431 output
->bfd_section
->entsize
= section
->entsize
;
2434 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2435 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2437 /* FIXME: This value should really be obtained from the bfd... */
2438 output
->block_value
= 128;
2441 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2442 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2444 section
->output_section
= output
->bfd_section
;
2446 if (!map_head_is_link_order
)
2448 asection
*s
= output
->bfd_section
->map_tail
.s
;
2449 output
->bfd_section
->map_tail
.s
= section
;
2450 section
->map_head
.s
= NULL
;
2451 section
->map_tail
.s
= s
;
2453 s
->map_head
.s
= section
;
2455 output
->bfd_section
->map_head
.s
= section
;
2458 /* Add a section reference to the list. */
2459 new_section
= new_stat (lang_input_section
, ptr
);
2460 new_section
->section
= section
;
2463 /* Handle wildcard sorting. This returns the lang_input_section which
2464 should follow the one we are going to create for SECTION and FILE,
2465 based on the sorting requirements of WILD. It returns NULL if the
2466 new section should just go at the end of the current list. */
2468 static lang_statement_union_type
*
2469 wild_sort (lang_wild_statement_type
*wild
,
2470 struct wildcard_list
*sec
,
2471 lang_input_statement_type
*file
,
2474 lang_statement_union_type
*l
;
2476 if (!wild
->filenames_sorted
2477 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2480 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2482 lang_input_section_type
*ls
;
2484 if (l
->header
.type
!= lang_input_section_enum
)
2486 ls
= &l
->input_section
;
2488 /* Sorting by filename takes precedence over sorting by section
2491 if (wild
->filenames_sorted
)
2493 const char *fn
, *ln
;
2497 /* The PE support for the .idata section as generated by
2498 dlltool assumes that files will be sorted by the name of
2499 the archive and then the name of the file within the
2502 if (file
->the_bfd
!= NULL
2503 && file
->the_bfd
->my_archive
!= NULL
)
2505 fn
= bfd_get_filename (file
->the_bfd
->my_archive
);
2510 fn
= file
->filename
;
2514 if (ls
->section
->owner
->my_archive
!= NULL
)
2516 ln
= bfd_get_filename (ls
->section
->owner
->my_archive
);
2521 ln
= ls
->section
->owner
->filename
;
2525 i
= filename_cmp (fn
, ln
);
2534 fn
= file
->filename
;
2536 ln
= ls
->section
->owner
->filename
;
2538 i
= filename_cmp (fn
, ln
);
2546 /* Here either the files are not sorted by name, or we are
2547 looking at the sections for this file. */
2550 && sec
->spec
.sorted
!= none
2551 && sec
->spec
.sorted
!= by_none
)
2552 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2559 /* Expand a wild statement for a particular FILE. SECTION may be
2560 NULL, in which case it is a wild card. */
2563 output_section_callback (lang_wild_statement_type
*ptr
,
2564 struct wildcard_list
*sec
,
2566 struct flag_info
*sflag_info
,
2567 lang_input_statement_type
*file
,
2570 lang_statement_union_type
*before
;
2571 lang_output_section_statement_type
*os
;
2573 os
= (lang_output_section_statement_type
*) output
;
2575 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2576 if (unique_section_p (section
, os
))
2579 before
= wild_sort (ptr
, sec
, file
, section
);
2581 /* Here BEFORE points to the lang_input_section which
2582 should follow the one we are about to add. If BEFORE
2583 is NULL, then the section should just go at the end
2584 of the current list. */
2587 lang_add_section (&ptr
->children
, section
, sflag_info
, os
);
2590 lang_statement_list_type list
;
2591 lang_statement_union_type
**pp
;
2593 lang_list_init (&list
);
2594 lang_add_section (&list
, section
, sflag_info
, os
);
2596 /* If we are discarding the section, LIST.HEAD will
2598 if (list
.head
!= NULL
)
2600 ASSERT (list
.head
->header
.next
== NULL
);
2602 for (pp
= &ptr
->children
.head
;
2604 pp
= &(*pp
)->header
.next
)
2605 ASSERT (*pp
!= NULL
);
2607 list
.head
->header
.next
= *pp
;
2613 /* Check if all sections in a wild statement for a particular FILE
2617 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2618 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2620 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
2621 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2624 lang_output_section_statement_type
*os
;
2626 os
= (lang_output_section_statement_type
*) output
;
2628 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2629 if (unique_section_p (section
, os
))
2632 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2633 os
->all_input_readonly
= FALSE
;
2636 /* This is passed a file name which must have been seen already and
2637 added to the statement tree. We will see if it has been opened
2638 already and had its symbols read. If not then we'll read it. */
2640 static lang_input_statement_type
*
2641 lookup_name (const char *name
)
2643 lang_input_statement_type
*search
;
2645 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2647 search
= (lang_input_statement_type
*) search
->next_real_file
)
2649 /* Use the local_sym_name as the name of the file that has
2650 already been loaded as filename might have been transformed
2651 via the search directory lookup mechanism. */
2652 const char *filename
= search
->local_sym_name
;
2654 if (filename
!= NULL
2655 && filename_cmp (filename
, name
) == 0)
2660 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2661 default_target
, FALSE
);
2663 /* If we have already added this file, or this file is not real
2664 don't add this file. */
2665 if (search
->flags
.loaded
|| !search
->flags
.real
)
2668 if (!load_symbols (search
, NULL
))
2674 /* Save LIST as a list of libraries whose symbols should not be exported. */
2679 struct excluded_lib
*next
;
2681 static struct excluded_lib
*excluded_libs
;
2684 add_excluded_libs (const char *list
)
2686 const char *p
= list
, *end
;
2690 struct excluded_lib
*entry
;
2691 end
= strpbrk (p
, ",:");
2693 end
= p
+ strlen (p
);
2694 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2695 entry
->next
= excluded_libs
;
2696 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2697 memcpy (entry
->name
, p
, end
- p
);
2698 entry
->name
[end
- p
] = '\0';
2699 excluded_libs
= entry
;
2707 check_excluded_libs (bfd
*abfd
)
2709 struct excluded_lib
*lib
= excluded_libs
;
2713 int len
= strlen (lib
->name
);
2714 const char *filename
= lbasename (abfd
->filename
);
2716 if (strcmp (lib
->name
, "ALL") == 0)
2718 abfd
->no_export
= TRUE
;
2722 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2723 && (filename
[len
] == '\0'
2724 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2725 && filename
[len
+ 2] == '\0')))
2727 abfd
->no_export
= TRUE
;
2735 /* Get the symbols for an input file. */
2738 load_symbols (lang_input_statement_type
*entry
,
2739 lang_statement_list_type
*place
)
2743 if (entry
->flags
.loaded
)
2746 ldfile_open_file (entry
);
2748 /* Do not process further if the file was missing. */
2749 if (entry
->flags
.missing_file
)
2752 if (!bfd_check_format (entry
->the_bfd
, bfd_archive
)
2753 && !bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2756 struct lang_input_statement_flags save_flags
;
2759 err
= bfd_get_error ();
2761 /* See if the emulation has some special knowledge. */
2762 if (ldemul_unrecognized_file (entry
))
2765 if (err
== bfd_error_file_ambiguously_recognized
)
2769 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2770 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2771 for (p
= matching
; *p
!= NULL
; p
++)
2775 else if (err
!= bfd_error_file_not_recognized
2777 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2779 bfd_close (entry
->the_bfd
);
2780 entry
->the_bfd
= NULL
;
2782 /* Try to interpret the file as a linker script. */
2783 save_flags
= input_flags
;
2784 ldfile_open_command_file (entry
->filename
);
2786 push_stat_ptr (place
);
2787 input_flags
.add_DT_NEEDED_for_regular
2788 = entry
->flags
.add_DT_NEEDED_for_regular
;
2789 input_flags
.add_DT_NEEDED_for_dynamic
2790 = entry
->flags
.add_DT_NEEDED_for_dynamic
;
2791 input_flags
.whole_archive
= entry
->flags
.whole_archive
;
2792 input_flags
.dynamic
= entry
->flags
.dynamic
;
2794 ldfile_assumed_script
= TRUE
;
2795 parser_input
= input_script
;
2797 ldfile_assumed_script
= FALSE
;
2799 /* missing_file is sticky. sysrooted will already have been
2800 restored when seeing EOF in yyparse, but no harm to restore
2802 save_flags
.missing_file
|= input_flags
.missing_file
;
2803 input_flags
= save_flags
;
2807 entry
->flags
.loaded
= TRUE
;
2812 if (ldemul_recognized_file (entry
))
2815 /* We don't call ldlang_add_file for an archive. Instead, the
2816 add_symbols entry point will call ldlang_add_file, via the
2817 add_archive_element callback, for each element of the archive
2819 switch (bfd_get_format (entry
->the_bfd
))
2825 if (!entry
->flags
.reload
)
2826 ldlang_add_file (entry
);
2827 if (trace_files
|| verbose
)
2828 info_msg ("%I\n", entry
);
2832 check_excluded_libs (entry
->the_bfd
);
2834 if (entry
->flags
.whole_archive
)
2837 bfd_boolean loaded
= TRUE
;
2842 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2847 if (!bfd_check_format (member
, bfd_object
))
2849 einfo (_("%F%B: member %B in archive is not an object\n"),
2850 entry
->the_bfd
, member
);
2855 if (!(*link_info
.callbacks
2856 ->add_archive_element
) (&link_info
, member
,
2857 "--whole-archive", &subsbfd
))
2860 /* Potentially, the add_archive_element hook may have set a
2861 substitute BFD for us. */
2862 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2864 einfo (_("%F%B: error adding symbols: %E\n"), member
);
2869 entry
->flags
.loaded
= loaded
;
2875 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2876 entry
->flags
.loaded
= TRUE
;
2878 einfo (_("%F%B: error adding symbols: %E\n"), entry
->the_bfd
);
2880 return entry
->flags
.loaded
;
2883 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2884 may be NULL, indicating that it is a wildcard. Separate
2885 lang_input_section statements are created for each part of the
2886 expansion; they are added after the wild statement S. OUTPUT is
2887 the output section. */
2890 wild (lang_wild_statement_type
*s
,
2891 const char *target ATTRIBUTE_UNUSED
,
2892 lang_output_section_statement_type
*output
)
2894 struct wildcard_list
*sec
;
2896 if (s
->handler_data
[0]
2897 && s
->handler_data
[0]->spec
.sorted
== by_name
2898 && !s
->filenames_sorted
)
2900 lang_section_bst_type
*tree
;
2902 walk_wild (s
, output_section_callback_fast
, output
);
2907 output_section_callback_tree_to_list (s
, tree
, output
);
2912 walk_wild (s
, output_section_callback
, output
);
2914 if (default_common_section
== NULL
)
2915 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2916 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2918 /* Remember the section that common is going to in case we
2919 later get something which doesn't know where to put it. */
2920 default_common_section
= output
;
2925 /* Return TRUE iff target is the sought target. */
2928 get_target (const bfd_target
*target
, void *data
)
2930 const char *sought
= (const char *) data
;
2932 return strcmp (target
->name
, sought
) == 0;
2935 /* Like strcpy() but convert to lower case as well. */
2938 stricpy (char *dest
, char *src
)
2942 while ((c
= *src
++) != 0)
2943 *dest
++ = TOLOWER (c
);
2948 /* Remove the first occurrence of needle (if any) in haystack
2952 strcut (char *haystack
, char *needle
)
2954 haystack
= strstr (haystack
, needle
);
2960 for (src
= haystack
+ strlen (needle
); *src
;)
2961 *haystack
++ = *src
++;
2967 /* Compare two target format name strings.
2968 Return a value indicating how "similar" they are. */
2971 name_compare (char *first
, char *second
)
2977 copy1
= (char *) xmalloc (strlen (first
) + 1);
2978 copy2
= (char *) xmalloc (strlen (second
) + 1);
2980 /* Convert the names to lower case. */
2981 stricpy (copy1
, first
);
2982 stricpy (copy2
, second
);
2984 /* Remove size and endian strings from the name. */
2985 strcut (copy1
, "big");
2986 strcut (copy1
, "little");
2987 strcut (copy2
, "big");
2988 strcut (copy2
, "little");
2990 /* Return a value based on how many characters match,
2991 starting from the beginning. If both strings are
2992 the same then return 10 * their length. */
2993 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2994 if (copy1
[result
] == 0)
3006 /* Set by closest_target_match() below. */
3007 static const bfd_target
*winner
;
3009 /* Scan all the valid bfd targets looking for one that has the endianness
3010 requirement that was specified on the command line, and is the nearest
3011 match to the original output target. */
3014 closest_target_match (const bfd_target
*target
, void *data
)
3016 const bfd_target
*original
= (const bfd_target
*) data
;
3018 if (command_line
.endian
== ENDIAN_BIG
3019 && target
->byteorder
!= BFD_ENDIAN_BIG
)
3022 if (command_line
.endian
== ENDIAN_LITTLE
3023 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
3026 /* Must be the same flavour. */
3027 if (target
->flavour
!= original
->flavour
)
3030 /* Ignore generic big and little endian elf vectors. */
3031 if (strcmp (target
->name
, "elf32-big") == 0
3032 || strcmp (target
->name
, "elf64-big") == 0
3033 || strcmp (target
->name
, "elf32-little") == 0
3034 || strcmp (target
->name
, "elf64-little") == 0)
3037 /* If we have not found a potential winner yet, then record this one. */
3044 /* Oh dear, we now have two potential candidates for a successful match.
3045 Compare their names and choose the better one. */
3046 if (name_compare (target
->name
, original
->name
)
3047 > name_compare (winner
->name
, original
->name
))
3050 /* Keep on searching until wqe have checked them all. */
3054 /* Return the BFD target format of the first input file. */
3057 get_first_input_target (void)
3059 char *target
= NULL
;
3061 LANG_FOR_EACH_INPUT_STATEMENT (s
)
3063 if (s
->header
.type
== lang_input_statement_enum
3066 ldfile_open_file (s
);
3068 if (s
->the_bfd
!= NULL
3069 && bfd_check_format (s
->the_bfd
, bfd_object
))
3071 target
= bfd_get_target (s
->the_bfd
);
3083 lang_get_output_target (void)
3087 /* Has the user told us which output format to use? */
3088 if (output_target
!= NULL
)
3089 return output_target
;
3091 /* No - has the current target been set to something other than
3093 if (current_target
!= default_target
&& current_target
!= NULL
)
3094 return current_target
;
3096 /* No - can we determine the format of the first input file? */
3097 target
= get_first_input_target ();
3101 /* Failed - use the default output target. */
3102 return default_target
;
3105 /* Open the output file. */
3108 open_output (const char *name
)
3110 output_target
= lang_get_output_target ();
3112 /* Has the user requested a particular endianness on the command
3114 if (command_line
.endian
!= ENDIAN_UNSET
)
3116 const bfd_target
*target
;
3117 enum bfd_endian desired_endian
;
3119 /* Get the chosen target. */
3120 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3122 /* If the target is not supported, we cannot do anything. */
3125 if (command_line
.endian
== ENDIAN_BIG
)
3126 desired_endian
= BFD_ENDIAN_BIG
;
3128 desired_endian
= BFD_ENDIAN_LITTLE
;
3130 /* See if the target has the wrong endianness. This should
3131 not happen if the linker script has provided big and
3132 little endian alternatives, but some scrips don't do
3134 if (target
->byteorder
!= desired_endian
)
3136 /* If it does, then see if the target provides
3137 an alternative with the correct endianness. */
3138 if (target
->alternative_target
!= NULL
3139 && (target
->alternative_target
->byteorder
== desired_endian
))
3140 output_target
= target
->alternative_target
->name
;
3143 /* Try to find a target as similar as possible to
3144 the default target, but which has the desired
3145 endian characteristic. */
3146 bfd_search_for_target (closest_target_match
,
3149 /* Oh dear - we could not find any targets that
3150 satisfy our requirements. */
3152 einfo (_("%P: warning: could not find any targets"
3153 " that match endianness requirement\n"));
3155 output_target
= winner
->name
;
3161 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3163 if (link_info
.output_bfd
== NULL
)
3165 if (bfd_get_error () == bfd_error_invalid_target
)
3166 einfo (_("%P%F: target %s not found\n"), output_target
);
3168 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3171 delete_output_file_on_failure
= TRUE
;
3173 if (!bfd_set_format (link_info
.output_bfd
, bfd_object
))
3174 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3175 if (!bfd_set_arch_mach (link_info
.output_bfd
,
3176 ldfile_output_architecture
,
3177 ldfile_output_machine
))
3178 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3180 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3181 if (link_info
.hash
== NULL
)
3182 einfo (_("%P%F: can not create hash table: %E\n"));
3184 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3188 ldlang_open_output (lang_statement_union_type
*statement
)
3190 switch (statement
->header
.type
)
3192 case lang_output_statement_enum
:
3193 ASSERT (link_info
.output_bfd
== NULL
);
3194 open_output (statement
->output_statement
.name
);
3195 ldemul_set_output_arch ();
3196 if (config
.magic_demand_paged
3197 && !bfd_link_relocatable (&link_info
))
3198 link_info
.output_bfd
->flags
|= D_PAGED
;
3200 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3201 if (config
.text_read_only
)
3202 link_info
.output_bfd
->flags
|= WP_TEXT
;
3204 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3205 if (link_info
.traditional_format
)
3206 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3208 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3211 case lang_target_statement_enum
:
3212 current_target
= statement
->target_statement
.target
;
3222 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3223 ldfile_output_machine
);
3226 while ((x
& 1) == 0)
3234 /* Open all the input files. */
3238 OPEN_BFD_NORMAL
= 0,
3242 #ifdef ENABLE_PLUGINS
3243 static lang_input_statement_type
*plugin_insert
= NULL
;
3247 open_input_bfds (lang_statement_union_type
*s
, enum open_bfd_mode mode
)
3249 for (; s
!= NULL
; s
= s
->header
.next
)
3251 switch (s
->header
.type
)
3253 case lang_constructors_statement_enum
:
3254 open_input_bfds (constructor_list
.head
, mode
);
3256 case lang_output_section_statement_enum
:
3257 open_input_bfds (s
->output_section_statement
.children
.head
, mode
);
3259 case lang_wild_statement_enum
:
3260 /* Maybe we should load the file's symbols. */
3261 if ((mode
& OPEN_BFD_RESCAN
) == 0
3262 && s
->wild_statement
.filename
3263 && !wildcardp (s
->wild_statement
.filename
)
3264 && !archive_path (s
->wild_statement
.filename
))
3265 lookup_name (s
->wild_statement
.filename
);
3266 open_input_bfds (s
->wild_statement
.children
.head
, mode
);
3268 case lang_group_statement_enum
:
3270 struct bfd_link_hash_entry
*undefs
;
3272 /* We must continually search the entries in the group
3273 until no new symbols are added to the list of undefined
3278 undefs
= link_info
.hash
->undefs_tail
;
3279 open_input_bfds (s
->group_statement
.children
.head
,
3280 mode
| OPEN_BFD_FORCE
);
3282 while (undefs
!= link_info
.hash
->undefs_tail
);
3285 case lang_target_statement_enum
:
3286 current_target
= s
->target_statement
.target
;
3288 case lang_input_statement_enum
:
3289 if (s
->input_statement
.flags
.real
)
3291 lang_statement_union_type
**os_tail
;
3292 lang_statement_list_type add
;
3295 s
->input_statement
.target
= current_target
;
3297 /* If we are being called from within a group, and this
3298 is an archive which has already been searched, then
3299 force it to be researched unless the whole archive
3300 has been loaded already. Do the same for a rescan.
3301 Likewise reload --as-needed shared libs. */
3302 if (mode
!= OPEN_BFD_NORMAL
3303 #ifdef ENABLE_PLUGINS
3304 && ((mode
& OPEN_BFD_RESCAN
) == 0
3305 || plugin_insert
== NULL
)
3307 && s
->input_statement
.flags
.loaded
3308 && (abfd
= s
->input_statement
.the_bfd
) != NULL
3309 && ((bfd_get_format (abfd
) == bfd_archive
3310 && !s
->input_statement
.flags
.whole_archive
)
3311 || (bfd_get_format (abfd
) == bfd_object
3312 && ((abfd
->flags
) & DYNAMIC
) != 0
3313 && s
->input_statement
.flags
.add_DT_NEEDED_for_regular
3314 && bfd_get_flavour (abfd
) == bfd_target_elf_flavour
3315 && (elf_dyn_lib_class (abfd
) & DYN_AS_NEEDED
) != 0)))
3317 s
->input_statement
.flags
.loaded
= FALSE
;
3318 s
->input_statement
.flags
.reload
= TRUE
;
3321 os_tail
= lang_output_section_statement
.tail
;
3322 lang_list_init (&add
);
3324 if (!load_symbols (&s
->input_statement
, &add
))
3325 config
.make_executable
= FALSE
;
3327 if (add
.head
!= NULL
)
3329 /* If this was a script with output sections then
3330 tack any added statements on to the end of the
3331 list. This avoids having to reorder the output
3332 section statement list. Very likely the user
3333 forgot -T, and whatever we do here will not meet
3334 naive user expectations. */
3335 if (os_tail
!= lang_output_section_statement
.tail
)
3337 einfo (_("%P: warning: %s contains output sections;"
3338 " did you forget -T?\n"),
3339 s
->input_statement
.filename
);
3340 *stat_ptr
->tail
= add
.head
;
3341 stat_ptr
->tail
= add
.tail
;
3345 *add
.tail
= s
->header
.next
;
3346 s
->header
.next
= add
.head
;
3350 #ifdef ENABLE_PLUGINS
3351 /* If we have found the point at which a plugin added new
3352 files, clear plugin_insert to enable archive rescan. */
3353 if (&s
->input_statement
== plugin_insert
)
3354 plugin_insert
= NULL
;
3357 case lang_assignment_statement_enum
:
3358 if (s
->assignment_statement
.exp
->assign
.defsym
)
3359 /* This is from a --defsym on the command line. */
3360 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3367 /* Exit if any of the files were missing. */
3368 if (input_flags
.missing_file
)
3372 /* Add the supplied name to the symbol table as an undefined reference.
3373 This is a two step process as the symbol table doesn't even exist at
3374 the time the ld command line is processed. First we put the name
3375 on a list, then, once the output file has been opened, transfer the
3376 name to the symbol table. */
3378 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3380 #define ldlang_undef_chain_list_head entry_symbol.next
3383 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3385 ldlang_undef_chain_list_type
*new_undef
;
3387 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3388 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3389 new_undef
->next
= ldlang_undef_chain_list_head
;
3390 ldlang_undef_chain_list_head
= new_undef
;
3392 new_undef
->name
= xstrdup (name
);
3394 if (link_info
.output_bfd
!= NULL
)
3395 insert_undefined (new_undef
->name
);
3398 /* Insert NAME as undefined in the symbol table. */
3401 insert_undefined (const char *name
)
3403 struct bfd_link_hash_entry
*h
;
3405 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3407 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3408 if (h
->type
== bfd_link_hash_new
)
3410 h
->type
= bfd_link_hash_undefined
;
3411 h
->u
.undef
.abfd
= NULL
;
3412 bfd_link_add_undef (link_info
.hash
, h
);
3416 /* Run through the list of undefineds created above and place them
3417 into the linker hash table as undefined symbols belonging to the
3421 lang_place_undefineds (void)
3423 ldlang_undef_chain_list_type
*ptr
;
3425 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3426 insert_undefined (ptr
->name
);
3429 /* Structure used to build the list of symbols that the user has required
3432 struct require_defined_symbol
3435 struct require_defined_symbol
*next
;
3438 /* The list of symbols that the user has required be defined. */
3440 static struct require_defined_symbol
*require_defined_symbol_list
;
3442 /* Add a new symbol NAME to the list of symbols that are required to be
3446 ldlang_add_require_defined (const char *const name
)
3448 struct require_defined_symbol
*ptr
;
3450 ldlang_add_undef (name
, TRUE
);
3451 ptr
= (struct require_defined_symbol
*) stat_alloc (sizeof (*ptr
));
3452 ptr
->next
= require_defined_symbol_list
;
3453 ptr
->name
= strdup (name
);
3454 require_defined_symbol_list
= ptr
;
3457 /* Check that all symbols the user required to be defined, are defined,
3458 raise an error if we find a symbol that is not defined. */
3461 ldlang_check_require_defined_symbols (void)
3463 struct require_defined_symbol
*ptr
;
3465 for (ptr
= require_defined_symbol_list
; ptr
!= NULL
; ptr
= ptr
->next
)
3467 struct bfd_link_hash_entry
*h
;
3469 h
= bfd_link_hash_lookup (link_info
.hash
, ptr
->name
,
3470 FALSE
, FALSE
, TRUE
);
3472 || (h
->type
!= bfd_link_hash_defined
3473 && h
->type
!= bfd_link_hash_defweak
))
3474 einfo(_("%P%X: required symbol `%s' not defined\n"), ptr
->name
);
3478 /* Check for all readonly or some readwrite sections. */
3481 check_input_sections
3482 (lang_statement_union_type
*s
,
3483 lang_output_section_statement_type
*output_section_statement
)
3485 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3487 switch (s
->header
.type
)
3489 case lang_wild_statement_enum
:
3490 walk_wild (&s
->wild_statement
, check_section_callback
,
3491 output_section_statement
);
3492 if (!output_section_statement
->all_input_readonly
)
3495 case lang_constructors_statement_enum
:
3496 check_input_sections (constructor_list
.head
,
3497 output_section_statement
);
3498 if (!output_section_statement
->all_input_readonly
)
3501 case lang_group_statement_enum
:
3502 check_input_sections (s
->group_statement
.children
.head
,
3503 output_section_statement
);
3504 if (!output_section_statement
->all_input_readonly
)
3513 /* Update wildcard statements if needed. */
3516 update_wild_statements (lang_statement_union_type
*s
)
3518 struct wildcard_list
*sec
;
3520 switch (sort_section
)
3530 for (; s
!= NULL
; s
= s
->header
.next
)
3532 switch (s
->header
.type
)
3537 case lang_wild_statement_enum
:
3538 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3541 switch (sec
->spec
.sorted
)
3544 sec
->spec
.sorted
= sort_section
;
3547 if (sort_section
== by_alignment
)
3548 sec
->spec
.sorted
= by_name_alignment
;
3551 if (sort_section
== by_name
)
3552 sec
->spec
.sorted
= by_alignment_name
;
3560 case lang_constructors_statement_enum
:
3561 update_wild_statements (constructor_list
.head
);
3564 case lang_output_section_statement_enum
:
3565 /* Don't sort .init/.fini sections. */
3566 if (strcmp (s
->output_section_statement
.name
, ".init") != 0
3567 && strcmp (s
->output_section_statement
.name
, ".fini") != 0)
3568 update_wild_statements
3569 (s
->output_section_statement
.children
.head
);
3572 case lang_group_statement_enum
:
3573 update_wild_statements (s
->group_statement
.children
.head
);
3581 /* Open input files and attach to output sections. */
3584 map_input_to_output_sections
3585 (lang_statement_union_type
*s
, const char *target
,
3586 lang_output_section_statement_type
*os
)
3588 for (; s
!= NULL
; s
= s
->header
.next
)
3590 lang_output_section_statement_type
*tos
;
3593 switch (s
->header
.type
)
3595 case lang_wild_statement_enum
:
3596 wild (&s
->wild_statement
, target
, os
);
3598 case lang_constructors_statement_enum
:
3599 map_input_to_output_sections (constructor_list
.head
,
3603 case lang_output_section_statement_enum
:
3604 tos
= &s
->output_section_statement
;
3605 if (tos
->constraint
!= 0)
3607 if (tos
->constraint
!= ONLY_IF_RW
3608 && tos
->constraint
!= ONLY_IF_RO
)
3610 tos
->all_input_readonly
= TRUE
;
3611 check_input_sections (tos
->children
.head
, tos
);
3612 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3614 tos
->constraint
= -1;
3618 map_input_to_output_sections (tos
->children
.head
,
3622 case lang_output_statement_enum
:
3624 case lang_target_statement_enum
:
3625 target
= s
->target_statement
.target
;
3627 case lang_group_statement_enum
:
3628 map_input_to_output_sections (s
->group_statement
.children
.head
,
3632 case lang_data_statement_enum
:
3633 /* Make sure that any sections mentioned in the expression
3635 exp_init_os (s
->data_statement
.exp
);
3636 /* The output section gets CONTENTS, ALLOC and LOAD, but
3637 these may be overridden by the script. */
3638 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3639 switch (os
->sectype
)
3641 case normal_section
:
3642 case overlay_section
:
3644 case noalloc_section
:
3645 flags
= SEC_HAS_CONTENTS
;
3647 case noload_section
:
3648 if (bfd_get_flavour (link_info
.output_bfd
)
3649 == bfd_target_elf_flavour
)
3650 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3652 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3655 if (os
->bfd_section
== NULL
)
3656 init_os (os
, flags
);
3658 os
->bfd_section
->flags
|= flags
;
3660 case lang_input_section_enum
:
3662 case lang_fill_statement_enum
:
3663 case lang_object_symbols_statement_enum
:
3664 case lang_reloc_statement_enum
:
3665 case lang_padding_statement_enum
:
3666 case lang_input_statement_enum
:
3667 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3670 case lang_assignment_statement_enum
:
3671 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3674 /* Make sure that any sections mentioned in the assignment
3676 exp_init_os (s
->assignment_statement
.exp
);
3678 case lang_address_statement_enum
:
3679 /* Mark the specified section with the supplied address.
3680 If this section was actually a segment marker, then the
3681 directive is ignored if the linker script explicitly
3682 processed the segment marker. Originally, the linker
3683 treated segment directives (like -Ttext on the
3684 command-line) as section directives. We honor the
3685 section directive semantics for backwards compatibilty;
3686 linker scripts that do not specifically check for
3687 SEGMENT_START automatically get the old semantics. */
3688 if (!s
->address_statement
.segment
3689 || !s
->address_statement
.segment
->used
)
3691 const char *name
= s
->address_statement
.section_name
;
3693 /* Create the output section statement here so that
3694 orphans with a set address will be placed after other
3695 script sections. If we let the orphan placement code
3696 place them in amongst other sections then the address
3697 will affect following script sections, which is
3698 likely to surprise naive users. */
3699 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3700 tos
->addr_tree
= s
->address_statement
.address
;
3701 if (tos
->bfd_section
== NULL
)
3705 case lang_insert_statement_enum
:
3711 /* An insert statement snips out all the linker statements from the
3712 start of the list and places them after the output section
3713 statement specified by the insert. This operation is complicated
3714 by the fact that we keep a doubly linked list of output section
3715 statements as well as the singly linked list of all statements. */
3718 process_insert_statements (void)
3720 lang_statement_union_type
**s
;
3721 lang_output_section_statement_type
*first_os
= NULL
;
3722 lang_output_section_statement_type
*last_os
= NULL
;
3723 lang_output_section_statement_type
*os
;
3725 /* "start of list" is actually the statement immediately after
3726 the special abs_section output statement, so that it isn't
3728 s
= &lang_output_section_statement
.head
;
3729 while (*(s
= &(*s
)->header
.next
) != NULL
)
3731 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3733 /* Keep pointers to the first and last output section
3734 statement in the sequence we may be about to move. */
3735 os
= &(*s
)->output_section_statement
;
3737 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3740 /* Set constraint negative so that lang_output_section_find
3741 won't match this output section statement. At this
3742 stage in linking constraint has values in the range
3743 [-1, ONLY_IN_RW]. */
3744 last_os
->constraint
= -2 - last_os
->constraint
;
3745 if (first_os
== NULL
)
3748 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3750 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3751 lang_output_section_statement_type
*where
;
3752 lang_statement_union_type
**ptr
;
3753 lang_statement_union_type
*first
;
3755 where
= lang_output_section_find (i
->where
);
3756 if (where
!= NULL
&& i
->is_before
)
3759 where
= where
->prev
;
3760 while (where
!= NULL
&& where
->constraint
< 0);
3764 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3768 /* Deal with reordering the output section statement list. */
3769 if (last_os
!= NULL
)
3771 asection
*first_sec
, *last_sec
;
3772 struct lang_output_section_statement_struct
**next
;
3774 /* Snip out the output sections we are moving. */
3775 first_os
->prev
->next
= last_os
->next
;
3776 if (last_os
->next
== NULL
)
3778 next
= &first_os
->prev
->next
;
3779 lang_output_section_statement
.tail
3780 = (lang_statement_union_type
**) next
;
3783 last_os
->next
->prev
= first_os
->prev
;
3784 /* Add them in at the new position. */
3785 last_os
->next
= where
->next
;
3786 if (where
->next
== NULL
)
3788 next
= &last_os
->next
;
3789 lang_output_section_statement
.tail
3790 = (lang_statement_union_type
**) next
;
3793 where
->next
->prev
= last_os
;
3794 first_os
->prev
= where
;
3795 where
->next
= first_os
;
3797 /* Move the bfd sections in the same way. */
3800 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3802 os
->constraint
= -2 - os
->constraint
;
3803 if (os
->bfd_section
!= NULL
3804 && os
->bfd_section
->owner
!= NULL
)
3806 last_sec
= os
->bfd_section
;
3807 if (first_sec
== NULL
)
3808 first_sec
= last_sec
;
3813 if (last_sec
!= NULL
)
3815 asection
*sec
= where
->bfd_section
;
3817 sec
= output_prev_sec_find (where
);
3819 /* The place we want to insert must come after the
3820 sections we are moving. So if we find no
3821 section or if the section is the same as our
3822 last section, then no move is needed. */
3823 if (sec
!= NULL
&& sec
!= last_sec
)
3825 /* Trim them off. */
3826 if (first_sec
->prev
!= NULL
)
3827 first_sec
->prev
->next
= last_sec
->next
;
3829 link_info
.output_bfd
->sections
= last_sec
->next
;
3830 if (last_sec
->next
!= NULL
)
3831 last_sec
->next
->prev
= first_sec
->prev
;
3833 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3835 last_sec
->next
= sec
->next
;
3836 if (sec
->next
!= NULL
)
3837 sec
->next
->prev
= last_sec
;
3839 link_info
.output_bfd
->section_last
= last_sec
;
3840 first_sec
->prev
= sec
;
3841 sec
->next
= first_sec
;
3849 ptr
= insert_os_after (where
);
3850 /* Snip everything after the abs_section output statement we
3851 know is at the start of the list, up to and including
3852 the insert statement we are currently processing. */
3853 first
= lang_output_section_statement
.head
->header
.next
;
3854 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3855 /* Add them back where they belong. */
3858 statement_list
.tail
= s
;
3860 s
= &lang_output_section_statement
.head
;
3864 /* Undo constraint twiddling. */
3865 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3867 os
->constraint
= -2 - os
->constraint
;
3873 /* An output section might have been removed after its statement was
3874 added. For example, ldemul_before_allocation can remove dynamic
3875 sections if they turn out to be not needed. Clean them up here. */
3878 strip_excluded_output_sections (void)
3880 lang_output_section_statement_type
*os
;
3882 /* Run lang_size_sections (if not already done). */
3883 if (expld
.phase
!= lang_mark_phase_enum
)
3885 expld
.phase
= lang_mark_phase_enum
;
3886 expld
.dataseg
.phase
= exp_dataseg_none
;
3887 one_lang_size_sections_pass (NULL
, FALSE
);
3888 lang_reset_memory_regions ();
3891 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3895 asection
*output_section
;
3896 bfd_boolean exclude
;
3898 if (os
->constraint
< 0)
3901 output_section
= os
->bfd_section
;
3902 if (output_section
== NULL
)
3905 exclude
= (output_section
->rawsize
== 0
3906 && (output_section
->flags
& SEC_KEEP
) == 0
3907 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3910 /* Some sections have not yet been sized, notably .gnu.version,
3911 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3912 input sections, so don't drop output sections that have such
3913 input sections unless they are also marked SEC_EXCLUDE. */
3914 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3918 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3919 if ((s
->flags
& SEC_EXCLUDE
) == 0
3920 && ((s
->flags
& SEC_LINKER_CREATED
) != 0
3921 || link_info
.emitrelocations
))
3930 /* We don't set bfd_section to NULL since bfd_section of the
3931 removed output section statement may still be used. */
3932 if (!os
->update_dot
)
3934 output_section
->flags
|= SEC_EXCLUDE
;
3935 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3936 link_info
.output_bfd
->section_count
--;
3941 /* Called from ldwrite to clear out asection.map_head and
3942 asection.map_tail for use as link_orders in ldwrite.
3943 FIXME: Except for sh64elf.em which starts creating link_orders in
3944 its after_allocation routine so needs to call it early. */
3947 lang_clear_os_map (void)
3949 lang_output_section_statement_type
*os
;
3951 if (map_head_is_link_order
)
3954 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3958 asection
*output_section
;
3960 if (os
->constraint
< 0)
3963 output_section
= os
->bfd_section
;
3964 if (output_section
== NULL
)
3967 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3968 output_section
->map_head
.link_order
= NULL
;
3969 output_section
->map_tail
.link_order
= NULL
;
3972 /* Stop future calls to lang_add_section from messing with map_head
3973 and map_tail link_order fields. */
3974 map_head_is_link_order
= TRUE
;
3978 print_output_section_statement
3979 (lang_output_section_statement_type
*output_section_statement
)
3981 asection
*section
= output_section_statement
->bfd_section
;
3984 if (output_section_statement
!= abs_output_section
)
3986 minfo ("\n%s", output_section_statement
->name
);
3988 if (section
!= NULL
)
3990 print_dot
= section
->vma
;
3992 len
= strlen (output_section_statement
->name
);
3993 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3998 while (len
< SECTION_NAME_MAP_LENGTH
)
4004 minfo ("0x%V %W", section
->vma
, TO_ADDR (section
->size
));
4006 if (section
->vma
!= section
->lma
)
4007 minfo (_(" load address 0x%V"), section
->lma
);
4009 if (output_section_statement
->update_dot_tree
!= NULL
)
4010 exp_fold_tree (output_section_statement
->update_dot_tree
,
4011 bfd_abs_section_ptr
, &print_dot
);
4017 print_statement_list (output_section_statement
->children
.head
,
4018 output_section_statement
);
4022 print_assignment (lang_assignment_statement_type
*assignment
,
4023 lang_output_section_statement_type
*output_section
)
4030 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4033 if (assignment
->exp
->type
.node_class
== etree_assert
)
4036 tree
= assignment
->exp
->assert_s
.child
;
4040 const char *dst
= assignment
->exp
->assign
.dst
;
4042 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4044 expld
.assign_name
= dst
;
4045 tree
= assignment
->exp
->assign
.src
;
4048 osec
= output_section
->bfd_section
;
4050 osec
= bfd_abs_section_ptr
;
4052 if (assignment
->exp
->type
.node_class
!= etree_provide
)
4053 exp_fold_tree (tree
, osec
, &print_dot
);
4055 expld
.result
.valid_p
= FALSE
;
4057 if (expld
.result
.valid_p
)
4061 if (assignment
->exp
->type
.node_class
== etree_assert
4063 || expld
.assign_name
!= NULL
)
4065 value
= expld
.result
.value
;
4067 if (expld
.result
.section
!= NULL
)
4068 value
+= expld
.result
.section
->vma
;
4070 minfo ("0x%V", value
);
4076 struct bfd_link_hash_entry
*h
;
4078 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4079 FALSE
, FALSE
, TRUE
);
4082 value
= h
->u
.def
.value
;
4083 value
+= h
->u
.def
.section
->output_section
->vma
;
4084 value
+= h
->u
.def
.section
->output_offset
;
4086 minfo ("[0x%V]", value
);
4089 minfo ("[unresolved]");
4094 if (assignment
->exp
->type
.node_class
== etree_provide
)
4095 minfo ("[!provide]");
4102 expld
.assign_name
= NULL
;
4105 exp_print_tree (assignment
->exp
);
4110 print_input_statement (lang_input_statement_type
*statm
)
4112 if (statm
->filename
!= NULL
4113 && (statm
->the_bfd
== NULL
4114 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4115 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4118 /* Print all symbols defined in a particular section. This is called
4119 via bfd_link_hash_traverse, or by print_all_symbols. */
4122 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4124 asection
*sec
= (asection
*) ptr
;
4126 if ((hash_entry
->type
== bfd_link_hash_defined
4127 || hash_entry
->type
== bfd_link_hash_defweak
)
4128 && sec
== hash_entry
->u
.def
.section
)
4132 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4135 (hash_entry
->u
.def
.value
4136 + hash_entry
->u
.def
.section
->output_offset
4137 + hash_entry
->u
.def
.section
->output_section
->vma
));
4139 minfo (" %T\n", hash_entry
->root
.string
);
4146 hash_entry_addr_cmp (const void *a
, const void *b
)
4148 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4149 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4151 if (l
->u
.def
.value
< r
->u
.def
.value
)
4153 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4160 print_all_symbols (asection
*sec
)
4162 input_section_userdata_type
*ud
4163 = (input_section_userdata_type
*) get_userdata (sec
);
4164 struct map_symbol_def
*def
;
4165 struct bfd_link_hash_entry
**entries
;
4171 *ud
->map_symbol_def_tail
= 0;
4173 /* Sort the symbols by address. */
4174 entries
= (struct bfd_link_hash_entry
**)
4175 obstack_alloc (&map_obstack
,
4176 ud
->map_symbol_def_count
* sizeof (*entries
));
4178 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4179 entries
[i
] = def
->entry
;
4181 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4182 hash_entry_addr_cmp
);
4184 /* Print the symbols. */
4185 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4186 print_one_symbol (entries
[i
], sec
);
4188 obstack_free (&map_obstack
, entries
);
4191 /* Print information about an input section to the map file. */
4194 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4196 bfd_size_type size
= i
->size
;
4203 minfo ("%s", i
->name
);
4205 len
= 1 + strlen (i
->name
);
4206 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4211 while (len
< SECTION_NAME_MAP_LENGTH
)
4217 if (i
->output_section
!= NULL
4218 && i
->output_section
->owner
== link_info
.output_bfd
)
4219 addr
= i
->output_section
->vma
+ i
->output_offset
;
4227 minfo ("0x%V %W %B\n", addr
, size
, i
->owner
);
4229 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4231 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4243 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4246 if (i
->output_section
!= NULL
4247 && i
->output_section
->owner
== link_info
.output_bfd
)
4249 if (link_info
.reduce_memory_overheads
)
4250 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4252 print_all_symbols (i
);
4254 /* Update print_dot, but make sure that we do not move it
4255 backwards - this could happen if we have overlays and a
4256 later overlay is shorter than an earier one. */
4257 if (addr
+ TO_ADDR (size
) > print_dot
)
4258 print_dot
= addr
+ TO_ADDR (size
);
4263 print_fill_statement (lang_fill_statement_type
*fill
)
4267 fputs (" FILL mask 0x", config
.map_file
);
4268 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4269 fprintf (config
.map_file
, "%02x", *p
);
4270 fputs ("\n", config
.map_file
);
4274 print_data_statement (lang_data_statement_type
*data
)
4282 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4285 addr
= data
->output_offset
;
4286 if (data
->output_section
!= NULL
)
4287 addr
+= data
->output_section
->vma
;
4315 if (size
< TO_SIZE ((unsigned) 1))
4316 size
= TO_SIZE ((unsigned) 1);
4317 minfo ("0x%V %W %s 0x%v", addr
, TO_ADDR (size
), name
, data
->value
);
4319 if (data
->exp
->type
.node_class
!= etree_value
)
4322 exp_print_tree (data
->exp
);
4327 print_dot
= addr
+ TO_ADDR (size
);
4330 /* Print an address statement. These are generated by options like
4334 print_address_statement (lang_address_statement_type
*address
)
4336 minfo (_("Address of section %s set to "), address
->section_name
);
4337 exp_print_tree (address
->address
);
4341 /* Print a reloc statement. */
4344 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4351 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4354 addr
= reloc
->output_offset
;
4355 if (reloc
->output_section
!= NULL
)
4356 addr
+= reloc
->output_section
->vma
;
4358 size
= bfd_get_reloc_size (reloc
->howto
);
4360 minfo ("0x%V %W RELOC %s ", addr
, TO_ADDR (size
), reloc
->howto
->name
);
4362 if (reloc
->name
!= NULL
)
4363 minfo ("%s+", reloc
->name
);
4365 minfo ("%s+", reloc
->section
->name
);
4367 exp_print_tree (reloc
->addend_exp
);
4371 print_dot
= addr
+ TO_ADDR (size
);
4375 print_padding_statement (lang_padding_statement_type
*s
)
4383 len
= sizeof " *fill*" - 1;
4384 while (len
< SECTION_NAME_MAP_LENGTH
)
4390 addr
= s
->output_offset
;
4391 if (s
->output_section
!= NULL
)
4392 addr
+= s
->output_section
->vma
;
4393 minfo ("0x%V %W ", addr
, TO_ADDR (s
->size
));
4395 if (s
->fill
->size
!= 0)
4399 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4400 fprintf (config
.map_file
, "%02x", *p
);
4405 print_dot
= addr
+ TO_ADDR (s
->size
);
4409 print_wild_statement (lang_wild_statement_type
*w
,
4410 lang_output_section_statement_type
*os
)
4412 struct wildcard_list
*sec
;
4416 if (w
->filenames_sorted
)
4418 if (w
->filename
!= NULL
)
4419 minfo ("%s", w
->filename
);
4422 if (w
->filenames_sorted
)
4426 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4428 if (sec
->spec
.sorted
)
4430 if (sec
->spec
.exclude_name_list
!= NULL
)
4433 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4434 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4435 minfo (" %s", tmp
->name
);
4438 if (sec
->spec
.name
!= NULL
)
4439 minfo ("%s", sec
->spec
.name
);
4442 if (sec
->spec
.sorted
)
4451 print_statement_list (w
->children
.head
, os
);
4454 /* Print a group statement. */
4457 print_group (lang_group_statement_type
*s
,
4458 lang_output_section_statement_type
*os
)
4460 fprintf (config
.map_file
, "START GROUP\n");
4461 print_statement_list (s
->children
.head
, os
);
4462 fprintf (config
.map_file
, "END GROUP\n");
4465 /* Print the list of statements in S.
4466 This can be called for any statement type. */
4469 print_statement_list (lang_statement_union_type
*s
,
4470 lang_output_section_statement_type
*os
)
4474 print_statement (s
, os
);
4479 /* Print the first statement in statement list S.
4480 This can be called for any statement type. */
4483 print_statement (lang_statement_union_type
*s
,
4484 lang_output_section_statement_type
*os
)
4486 switch (s
->header
.type
)
4489 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4492 case lang_constructors_statement_enum
:
4493 if (constructor_list
.head
!= NULL
)
4495 if (constructors_sorted
)
4496 minfo (" SORT (CONSTRUCTORS)\n");
4498 minfo (" CONSTRUCTORS\n");
4499 print_statement_list (constructor_list
.head
, os
);
4502 case lang_wild_statement_enum
:
4503 print_wild_statement (&s
->wild_statement
, os
);
4505 case lang_address_statement_enum
:
4506 print_address_statement (&s
->address_statement
);
4508 case lang_object_symbols_statement_enum
:
4509 minfo (" CREATE_OBJECT_SYMBOLS\n");
4511 case lang_fill_statement_enum
:
4512 print_fill_statement (&s
->fill_statement
);
4514 case lang_data_statement_enum
:
4515 print_data_statement (&s
->data_statement
);
4517 case lang_reloc_statement_enum
:
4518 print_reloc_statement (&s
->reloc_statement
);
4520 case lang_input_section_enum
:
4521 print_input_section (s
->input_section
.section
, FALSE
);
4523 case lang_padding_statement_enum
:
4524 print_padding_statement (&s
->padding_statement
);
4526 case lang_output_section_statement_enum
:
4527 print_output_section_statement (&s
->output_section_statement
);
4529 case lang_assignment_statement_enum
:
4530 print_assignment (&s
->assignment_statement
, os
);
4532 case lang_target_statement_enum
:
4533 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4535 case lang_output_statement_enum
:
4536 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4537 if (output_target
!= NULL
)
4538 minfo (" %s", output_target
);
4541 case lang_input_statement_enum
:
4542 print_input_statement (&s
->input_statement
);
4544 case lang_group_statement_enum
:
4545 print_group (&s
->group_statement
, os
);
4547 case lang_insert_statement_enum
:
4548 minfo ("INSERT %s %s\n",
4549 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4550 s
->insert_statement
.where
);
4556 print_statements (void)
4558 print_statement_list (statement_list
.head
, abs_output_section
);
4561 /* Print the first N statements in statement list S to STDERR.
4562 If N == 0, nothing is printed.
4563 If N < 0, the entire list is printed.
4564 Intended to be called from GDB. */
4567 dprint_statement (lang_statement_union_type
*s
, int n
)
4569 FILE *map_save
= config
.map_file
;
4571 config
.map_file
= stderr
;
4574 print_statement_list (s
, abs_output_section
);
4577 while (s
&& --n
>= 0)
4579 print_statement (s
, abs_output_section
);
4584 config
.map_file
= map_save
;
4588 insert_pad (lang_statement_union_type
**ptr
,
4590 bfd_size_type alignment_needed
,
4591 asection
*output_section
,
4594 static fill_type zero_fill
;
4595 lang_statement_union_type
*pad
= NULL
;
4597 if (ptr
!= &statement_list
.head
)
4598 pad
= ((lang_statement_union_type
*)
4599 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4601 && pad
->header
.type
== lang_padding_statement_enum
4602 && pad
->padding_statement
.output_section
== output_section
)
4604 /* Use the existing pad statement. */
4606 else if ((pad
= *ptr
) != NULL
4607 && pad
->header
.type
== lang_padding_statement_enum
4608 && pad
->padding_statement
.output_section
== output_section
)
4610 /* Use the existing pad statement. */
4614 /* Make a new padding statement, linked into existing chain. */
4615 pad
= (lang_statement_union_type
*)
4616 stat_alloc (sizeof (lang_padding_statement_type
));
4617 pad
->header
.next
= *ptr
;
4619 pad
->header
.type
= lang_padding_statement_enum
;
4620 pad
->padding_statement
.output_section
= output_section
;
4623 pad
->padding_statement
.fill
= fill
;
4625 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4626 pad
->padding_statement
.size
= alignment_needed
;
4627 output_section
->size
= TO_SIZE (dot
+ TO_ADDR (alignment_needed
)
4628 - output_section
->vma
);
4631 /* Work out how much this section will move the dot point. */
4635 (lang_statement_union_type
**this_ptr
,
4636 lang_output_section_statement_type
*output_section_statement
,
4640 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4641 asection
*i
= is
->section
;
4642 asection
*o
= output_section_statement
->bfd_section
;
4644 if (i
->sec_info_type
== SEC_INFO_TYPE_JUST_SYMS
)
4645 i
->output_offset
= i
->vma
- o
->vma
;
4646 else if ((i
->flags
& SEC_EXCLUDE
) != 0)
4647 i
->output_offset
= dot
- o
->vma
;
4650 bfd_size_type alignment_needed
;
4652 /* Align this section first to the input sections requirement,
4653 then to the output section's requirement. If this alignment
4654 is greater than any seen before, then record it too. Perform
4655 the alignment by inserting a magic 'padding' statement. */
4657 if (output_section_statement
->subsection_alignment
!= -1)
4658 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4660 if (o
->alignment_power
< i
->alignment_power
)
4661 o
->alignment_power
= i
->alignment_power
;
4663 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4665 if (alignment_needed
!= 0)
4667 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4668 dot
+= alignment_needed
;
4671 /* Remember where in the output section this input section goes. */
4672 i
->output_offset
= dot
- o
->vma
;
4674 /* Mark how big the output section must be to contain this now. */
4675 dot
+= TO_ADDR (i
->size
);
4676 o
->size
= TO_SIZE (dot
- o
->vma
);
4689 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4691 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4692 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4694 if (sec1
->lma
< sec2
->lma
)
4696 else if (sec1
->lma
> sec2
->lma
)
4698 else if (sec1
->id
< sec2
->id
)
4700 else if (sec1
->id
> sec2
->id
)
4707 sort_sections_by_vma (const void *arg1
, const void *arg2
)
4709 const asection
*sec1
= ((const struct check_sec
*) arg1
)->sec
;
4710 const asection
*sec2
= ((const struct check_sec
*) arg2
)->sec
;
4712 if (sec1
->vma
< sec2
->vma
)
4714 else if (sec1
->vma
> sec2
->vma
)
4716 else if (sec1
->id
< sec2
->id
)
4718 else if (sec1
->id
> sec2
->id
)
4724 #define IS_TBSS(s) \
4725 ((s->flags & (SEC_LOAD | SEC_THREAD_LOCAL)) == SEC_THREAD_LOCAL)
4727 #define IGNORE_SECTION(s) \
4728 ((s->flags & SEC_ALLOC) == 0 || IS_TBSS (s))
4730 /* Check to see if any allocated sections overlap with other allocated
4731 sections. This can happen if a linker script specifies the output
4732 section addresses of the two sections. Also check whether any memory
4733 region has overflowed. */
4736 lang_check_section_addresses (void)
4739 struct check_sec
*sections
;
4743 bfd_vma p_start
= 0;
4745 lang_memory_region_type
*m
;
4746 bfd_boolean overlays
;
4748 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4751 count
= bfd_count_sections (link_info
.output_bfd
);
4752 sections
= XNEWVEC (struct check_sec
, count
);
4754 /* Scan all sections in the output list. */
4756 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4758 if (IGNORE_SECTION (s
)
4762 sections
[count
].sec
= s
;
4763 sections
[count
].warned
= FALSE
;
4773 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_lma
);
4775 /* First check section LMAs. There should be no overlap of LMAs on
4776 loadable sections, even with overlays. */
4777 for (p
= NULL
, i
= 0; i
< count
; i
++)
4779 s
= sections
[i
].sec
;
4780 if ((s
->flags
& SEC_LOAD
) != 0)
4783 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4785 /* Look for an overlap. We have sorted sections by lma, so
4786 we know that s_start >= p_start. Besides the obvious
4787 case of overlap when the current section starts before
4788 the previous one ends, we also must have overlap if the
4789 previous section wraps around the address space. */
4791 && (s_start
<= p_end
4792 || p_end
< p_start
))
4794 einfo (_("%X%P: section %s LMA [%V,%V]"
4795 " overlaps section %s LMA [%V,%V]\n"),
4796 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4797 sections
[i
].warned
= TRUE
;
4805 /* If any non-zero size allocated section (excluding tbss) starts at
4806 exactly the same VMA as another such section, then we have
4807 overlays. Overlays generated by the OVERLAY keyword will have
4808 this property. It is possible to intentionally generate overlays
4809 that fail this test, but it would be unusual. */
4810 qsort (sections
, count
, sizeof (*sections
), sort_sections_by_vma
);
4812 p_start
= sections
[0].sec
->vma
;
4813 for (i
= 1; i
< count
; i
++)
4815 s_start
= sections
[i
].sec
->vma
;
4816 if (p_start
== s_start
)
4824 /* Now check section VMAs if no overlays were detected. */
4827 for (p
= NULL
, i
= 0; i
< count
; i
++)
4829 s
= sections
[i
].sec
;
4831 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4834 && !sections
[i
].warned
4835 && (s_start
<= p_end
4836 || p_end
< p_start
))
4837 einfo (_("%X%P: section %s VMA [%V,%V]"
4838 " overlaps section %s VMA [%V,%V]\n"),
4839 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4848 /* If any memory region has overflowed, report by how much.
4849 We do not issue this diagnostic for regions that had sections
4850 explicitly placed outside their bounds; os_region_check's
4851 diagnostics are adequate for that case.
4853 FIXME: It is conceivable that m->current - (m->origin + m->length)
4854 might overflow a 32-bit integer. There is, alas, no way to print
4855 a bfd_vma quantity in decimal. */
4856 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4857 if (m
->had_full_message
)
4858 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4859 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4862 /* Make sure the new address is within the region. We explicitly permit the
4863 current address to be at the exact end of the region when the address is
4864 non-zero, in case the region is at the end of addressable memory and the
4865 calculation wraps around. */
4868 os_region_check (lang_output_section_statement_type
*os
,
4869 lang_memory_region_type
*region
,
4873 if ((region
->current
< region
->origin
4874 || (region
->current
- region
->origin
> region
->length
))
4875 && ((region
->current
!= region
->origin
+ region
->length
)
4880 einfo (_("%X%P: address 0x%v of %B section `%s'"
4881 " is not within region `%s'\n"),
4883 os
->bfd_section
->owner
,
4884 os
->bfd_section
->name
,
4885 region
->name_list
.name
);
4887 else if (!region
->had_full_message
)
4889 region
->had_full_message
= TRUE
;
4891 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4892 os
->bfd_section
->owner
,
4893 os
->bfd_section
->name
,
4894 region
->name_list
.name
);
4899 /* Set the sizes for all the output sections. */
4902 lang_size_sections_1
4903 (lang_statement_union_type
**prev
,
4904 lang_output_section_statement_type
*output_section_statement
,
4908 bfd_boolean check_regions
)
4910 lang_statement_union_type
*s
;
4912 /* Size up the sections from their constituent parts. */
4913 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4915 switch (s
->header
.type
)
4917 case lang_output_section_statement_enum
:
4919 bfd_vma newdot
, after
, dotdelta
;
4920 lang_output_section_statement_type
*os
;
4921 lang_memory_region_type
*r
;
4922 int section_alignment
= 0;
4924 os
= &s
->output_section_statement
;
4925 if (os
->constraint
== -1)
4928 /* FIXME: We shouldn't need to zero section vmas for ld -r
4929 here, in lang_insert_orphan, or in the default linker scripts.
4930 This is covering for coff backend linker bugs. See PR6945. */
4931 if (os
->addr_tree
== NULL
4932 && bfd_link_relocatable (&link_info
)
4933 && (bfd_get_flavour (link_info
.output_bfd
)
4934 == bfd_target_coff_flavour
))
4935 os
->addr_tree
= exp_intop (0);
4936 if (os
->addr_tree
!= NULL
)
4938 os
->processed_vma
= FALSE
;
4939 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4941 if (expld
.result
.valid_p
)
4943 dot
= expld
.result
.value
;
4944 if (expld
.result
.section
!= NULL
)
4945 dot
+= expld
.result
.section
->vma
;
4947 else if (expld
.phase
!= lang_mark_phase_enum
)
4948 einfo (_("%F%S: non constant or forward reference"
4949 " address expression for section %s\n"),
4950 os
->addr_tree
, os
->name
);
4953 if (os
->bfd_section
== NULL
)
4954 /* This section was removed or never actually created. */
4957 /* If this is a COFF shared library section, use the size and
4958 address from the input section. FIXME: This is COFF
4959 specific; it would be cleaner if there were some other way
4960 to do this, but nothing simple comes to mind. */
4961 if (((bfd_get_flavour (link_info
.output_bfd
)
4962 == bfd_target_ecoff_flavour
)
4963 || (bfd_get_flavour (link_info
.output_bfd
)
4964 == bfd_target_coff_flavour
))
4965 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4969 if (os
->children
.head
== NULL
4970 || os
->children
.head
->header
.next
!= NULL
4971 || (os
->children
.head
->header
.type
4972 != lang_input_section_enum
))
4973 einfo (_("%P%X: Internal error on COFF shared library"
4974 " section %s\n"), os
->name
);
4976 input
= os
->children
.head
->input_section
.section
;
4977 bfd_set_section_vma (os
->bfd_section
->owner
,
4979 bfd_section_vma (input
->owner
, input
));
4980 os
->bfd_section
->size
= input
->size
;
4986 if (bfd_is_abs_section (os
->bfd_section
))
4988 /* No matter what happens, an abs section starts at zero. */
4989 ASSERT (os
->bfd_section
->vma
== 0);
4993 if (os
->addr_tree
== NULL
)
4995 /* No address specified for this section, get one
4996 from the region specification. */
4997 if (os
->region
== NULL
4998 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4999 && os
->region
->name_list
.name
[0] == '*'
5000 && strcmp (os
->region
->name_list
.name
,
5001 DEFAULT_MEMORY_REGION
) == 0))
5003 os
->region
= lang_memory_default (os
->bfd_section
);
5006 /* If a loadable section is using the default memory
5007 region, and some non default memory regions were
5008 defined, issue an error message. */
5010 && !IGNORE_SECTION (os
->bfd_section
)
5011 && !bfd_link_relocatable (&link_info
)
5013 && strcmp (os
->region
->name_list
.name
,
5014 DEFAULT_MEMORY_REGION
) == 0
5015 && lang_memory_region_list
!= NULL
5016 && (strcmp (lang_memory_region_list
->name_list
.name
,
5017 DEFAULT_MEMORY_REGION
) != 0
5018 || lang_memory_region_list
->next
!= NULL
)
5019 && expld
.phase
!= lang_mark_phase_enum
)
5021 /* By default this is an error rather than just a
5022 warning because if we allocate the section to the
5023 default memory region we can end up creating an
5024 excessively large binary, or even seg faulting when
5025 attempting to perform a negative seek. See
5026 sources.redhat.com/ml/binutils/2003-04/msg00423.html
5027 for an example of this. This behaviour can be
5028 overridden by the using the --no-check-sections
5030 if (command_line
.check_section_addresses
)
5031 einfo (_("%P%F: error: no memory region specified"
5032 " for loadable section `%s'\n"),
5033 bfd_get_section_name (link_info
.output_bfd
,
5036 einfo (_("%P: warning: no memory region specified"
5037 " for loadable section `%s'\n"),
5038 bfd_get_section_name (link_info
.output_bfd
,
5042 newdot
= os
->region
->current
;
5043 section_alignment
= os
->bfd_section
->alignment_power
;
5046 section_alignment
= os
->section_alignment
;
5048 /* Align to what the section needs. */
5049 if (section_alignment
> 0)
5051 bfd_vma savedot
= newdot
;
5052 newdot
= align_power (newdot
, section_alignment
);
5054 dotdelta
= newdot
- savedot
;
5056 && (config
.warn_section_align
5057 || os
->addr_tree
!= NULL
)
5058 && expld
.phase
!= lang_mark_phase_enum
)
5059 einfo (_("%P: warning: changing start of section"
5060 " %s by %lu bytes\n"),
5061 os
->name
, (unsigned long) dotdelta
);
5064 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
5066 os
->bfd_section
->output_offset
= 0;
5069 lang_size_sections_1 (&os
->children
.head
, os
,
5070 os
->fill
, newdot
, relax
, check_regions
);
5072 os
->processed_vma
= TRUE
;
5074 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5075 /* Except for some special linker created sections,
5076 no output section should change from zero size
5077 after strip_excluded_output_sections. A non-zero
5078 size on an ignored section indicates that some
5079 input section was not sized early enough. */
5080 ASSERT (os
->bfd_section
->size
== 0);
5083 dot
= os
->bfd_section
->vma
;
5085 /* Put the section within the requested block size, or
5086 align at the block boundary. */
5088 + TO_ADDR (os
->bfd_section
->size
)
5089 + os
->block_value
- 1)
5090 & - (bfd_vma
) os
->block_value
);
5092 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
5095 /* Set section lma. */
5098 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
5102 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
5103 os
->bfd_section
->lma
= lma
;
5105 else if (os
->lma_region
!= NULL
)
5107 bfd_vma lma
= os
->lma_region
->current
;
5109 if (os
->align_lma_with_input
)
5113 /* When LMA_REGION is the same as REGION, align the LMA
5114 as we did for the VMA, possibly including alignment
5115 from the bfd section. If a different region, then
5116 only align according to the value in the output
5118 if (os
->lma_region
!= os
->region
)
5119 section_alignment
= os
->section_alignment
;
5120 if (section_alignment
> 0)
5121 lma
= align_power (lma
, section_alignment
);
5123 os
->bfd_section
->lma
= lma
;
5125 else if (r
->last_os
!= NULL
5126 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5131 last
= r
->last_os
->output_section_statement
.bfd_section
;
5133 /* A backwards move of dot should be accompanied by
5134 an explicit assignment to the section LMA (ie.
5135 os->load_base set) because backwards moves can
5136 create overlapping LMAs. */
5138 && os
->bfd_section
->size
!= 0
5139 && dot
+ TO_ADDR (os
->bfd_section
->size
) <= last
->vma
)
5141 /* If dot moved backwards then leave lma equal to
5142 vma. This is the old default lma, which might
5143 just happen to work when the backwards move is
5144 sufficiently large. Nag if this changes anything,
5145 so people can fix their linker scripts. */
5147 if (last
->vma
!= last
->lma
)
5148 einfo (_("%P: warning: dot moved backwards "
5149 "before `%s'\n"), os
->name
);
5153 /* If this is an overlay, set the current lma to that
5154 at the end of the previous section. */
5155 if (os
->sectype
== overlay_section
)
5156 lma
= last
->lma
+ TO_ADDR (last
->size
);
5158 /* Otherwise, keep the same lma to vma relationship
5159 as the previous section. */
5161 lma
= dot
+ last
->lma
- last
->vma
;
5163 if (section_alignment
> 0)
5164 lma
= align_power (lma
, section_alignment
);
5165 os
->bfd_section
->lma
= lma
;
5168 os
->processed_lma
= TRUE
;
5170 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5173 /* Keep track of normal sections using the default
5174 lma region. We use this to set the lma for
5175 following sections. Overlays or other linker
5176 script assignment to lma might mean that the
5177 default lma == vma is incorrect.
5178 To avoid warnings about dot moving backwards when using
5179 -Ttext, don't start tracking sections until we find one
5180 of non-zero size or with lma set differently to vma. */
5181 if (!IGNORE_SECTION (os
->bfd_section
)
5182 && (os
->bfd_section
->size
!= 0
5183 || (r
->last_os
== NULL
5184 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5185 || (r
->last_os
!= NULL
5186 && dot
>= (r
->last_os
->output_section_statement
5187 .bfd_section
->vma
)))
5188 && os
->lma_region
== NULL
5189 && !bfd_link_relocatable (&link_info
))
5192 /* .tbss sections effectively have zero size. */
5193 if (!IS_TBSS (os
->bfd_section
)
5194 || bfd_link_relocatable (&link_info
))
5195 dotdelta
= TO_ADDR (os
->bfd_section
->size
);
5200 if (os
->update_dot_tree
!= 0)
5201 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5203 /* Update dot in the region ?
5204 We only do this if the section is going to be allocated,
5205 since unallocated sections do not contribute to the region's
5206 overall size in memory. */
5207 if (os
->region
!= NULL
5208 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5210 os
->region
->current
= dot
;
5213 /* Make sure the new address is within the region. */
5214 os_region_check (os
, os
->region
, os
->addr_tree
,
5215 os
->bfd_section
->vma
);
5217 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5218 && ((os
->bfd_section
->flags
& SEC_LOAD
)
5219 || os
->align_lma_with_input
))
5221 os
->lma_region
->current
= os
->bfd_section
->lma
+ dotdelta
;
5224 os_region_check (os
, os
->lma_region
, NULL
,
5225 os
->bfd_section
->lma
);
5231 case lang_constructors_statement_enum
:
5232 dot
= lang_size_sections_1 (&constructor_list
.head
,
5233 output_section_statement
,
5234 fill
, dot
, relax
, check_regions
);
5237 case lang_data_statement_enum
:
5239 unsigned int size
= 0;
5241 s
->data_statement
.output_offset
=
5242 dot
- output_section_statement
->bfd_section
->vma
;
5243 s
->data_statement
.output_section
=
5244 output_section_statement
->bfd_section
;
5246 /* We might refer to provided symbols in the expression, and
5247 need to mark them as needed. */
5248 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5250 switch (s
->data_statement
.type
)
5268 if (size
< TO_SIZE ((unsigned) 1))
5269 size
= TO_SIZE ((unsigned) 1);
5270 dot
+= TO_ADDR (size
);
5271 output_section_statement
->bfd_section
->size
5272 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5277 case lang_reloc_statement_enum
:
5281 s
->reloc_statement
.output_offset
=
5282 dot
- output_section_statement
->bfd_section
->vma
;
5283 s
->reloc_statement
.output_section
=
5284 output_section_statement
->bfd_section
;
5285 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5286 dot
+= TO_ADDR (size
);
5287 output_section_statement
->bfd_section
->size
5288 = TO_SIZE (dot
- output_section_statement
->bfd_section
->vma
);
5292 case lang_wild_statement_enum
:
5293 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5294 output_section_statement
,
5295 fill
, dot
, relax
, check_regions
);
5298 case lang_object_symbols_statement_enum
:
5299 link_info
.create_object_symbols_section
=
5300 output_section_statement
->bfd_section
;
5303 case lang_output_statement_enum
:
5304 case lang_target_statement_enum
:
5307 case lang_input_section_enum
:
5311 i
= s
->input_section
.section
;
5316 if (!bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5317 einfo (_("%P%F: can't relax section: %E\n"));
5321 dot
= size_input_section (prev
, output_section_statement
,
5326 case lang_input_statement_enum
:
5329 case lang_fill_statement_enum
:
5330 s
->fill_statement
.output_section
=
5331 output_section_statement
->bfd_section
;
5333 fill
= s
->fill_statement
.fill
;
5336 case lang_assignment_statement_enum
:
5338 bfd_vma newdot
= dot
;
5339 etree_type
*tree
= s
->assignment_statement
.exp
;
5341 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5343 exp_fold_tree (tree
,
5344 output_section_statement
->bfd_section
,
5347 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5349 if (!expld
.dataseg
.relro_start_stat
)
5350 expld
.dataseg
.relro_start_stat
= s
;
5353 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5356 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5358 if (!expld
.dataseg
.relro_end_stat
)
5359 expld
.dataseg
.relro_end_stat
= s
;
5362 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5365 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5367 /* This symbol may be relative to this section. */
5368 if ((tree
->type
.node_class
== etree_provided
5369 || tree
->type
.node_class
== etree_assign
)
5370 && (tree
->assign
.dst
[0] != '.'
5371 || tree
->assign
.dst
[1] != '\0'))
5372 output_section_statement
->update_dot
= 1;
5374 if (!output_section_statement
->ignored
)
5376 if (output_section_statement
== abs_output_section
)
5378 /* If we don't have an output section, then just adjust
5379 the default memory address. */
5380 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5381 FALSE
)->current
= newdot
;
5383 else if (newdot
!= dot
)
5385 /* Insert a pad after this statement. We can't
5386 put the pad before when relaxing, in case the
5387 assignment references dot. */
5388 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5389 output_section_statement
->bfd_section
, dot
);
5391 /* Don't neuter the pad below when relaxing. */
5394 /* If dot is advanced, this implies that the section
5395 should have space allocated to it, unless the
5396 user has explicitly stated that the section
5397 should not be allocated. */
5398 if (output_section_statement
->sectype
!= noalloc_section
5399 && (output_section_statement
->sectype
!= noload_section
5400 || (bfd_get_flavour (link_info
.output_bfd
)
5401 == bfd_target_elf_flavour
)))
5402 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5409 case lang_padding_statement_enum
:
5410 /* If this is the first time lang_size_sections is called,
5411 we won't have any padding statements. If this is the
5412 second or later passes when relaxing, we should allow
5413 padding to shrink. If padding is needed on this pass, it
5414 will be added back in. */
5415 s
->padding_statement
.size
= 0;
5417 /* Make sure output_offset is valid. If relaxation shrinks
5418 the section and this pad isn't needed, it's possible to
5419 have output_offset larger than the final size of the
5420 section. bfd_set_section_contents will complain even for
5421 a pad size of zero. */
5422 s
->padding_statement
.output_offset
5423 = dot
- output_section_statement
->bfd_section
->vma
;
5426 case lang_group_statement_enum
:
5427 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5428 output_section_statement
,
5429 fill
, dot
, relax
, check_regions
);
5432 case lang_insert_statement_enum
:
5435 /* We can only get here when relaxing is turned on. */
5436 case lang_address_statement_enum
:
5443 prev
= &s
->header
.next
;
5448 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5449 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5450 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5451 segments. We are allowed an opportunity to override this decision. */
5454 ldlang_override_segment_assignment (struct bfd_link_info
*info ATTRIBUTE_UNUSED
,
5455 bfd
*abfd ATTRIBUTE_UNUSED
,
5456 asection
*current_section
,
5457 asection
*previous_section
,
5458 bfd_boolean new_segment
)
5460 lang_output_section_statement_type
*cur
;
5461 lang_output_section_statement_type
*prev
;
5463 /* The checks below are only necessary when the BFD library has decided
5464 that the two sections ought to be placed into the same segment. */
5468 /* Paranoia checks. */
5469 if (current_section
== NULL
|| previous_section
== NULL
)
5472 /* If this flag is set, the target never wants code and non-code
5473 sections comingled in the same segment. */
5474 if (config
.separate_code
5475 && ((current_section
->flags
^ previous_section
->flags
) & SEC_CODE
))
5478 /* Find the memory regions associated with the two sections.
5479 We call lang_output_section_find() here rather than scanning the list
5480 of output sections looking for a matching section pointer because if
5481 we have a large number of sections then a hash lookup is faster. */
5482 cur
= lang_output_section_find (current_section
->name
);
5483 prev
= lang_output_section_find (previous_section
->name
);
5485 /* More paranoia. */
5486 if (cur
== NULL
|| prev
== NULL
)
5489 /* If the regions are different then force the sections to live in
5490 different segments. See the email thread starting at the following
5491 URL for the reasons why this is necessary:
5492 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5493 return cur
->region
!= prev
->region
;
5497 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5499 lang_statement_iteration
++;
5500 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5501 0, 0, relax
, check_regions
);
5505 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5507 expld
.phase
= lang_allocating_phase_enum
;
5508 expld
.dataseg
.phase
= exp_dataseg_none
;
5510 one_lang_size_sections_pass (relax
, check_regions
);
5511 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5512 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5514 bfd_vma initial_base
, relro_end
, desired_end
;
5517 /* Compute the expected PT_GNU_RELRO segment end. */
5518 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5519 & ~(expld
.dataseg
.pagesize
- 1));
5521 /* Adjust by the offset arg of DATA_SEGMENT_RELRO_END. */
5522 desired_end
= relro_end
- expld
.dataseg
.relro_offset
;
5524 /* For sections in the relro segment.. */
5525 for (sec
= link_info
.output_bfd
->section_last
; sec
; sec
= sec
->prev
)
5526 if ((sec
->flags
& SEC_ALLOC
) != 0
5527 && sec
->vma
>= expld
.dataseg
.base
5528 && sec
->vma
< expld
.dataseg
.relro_end
- expld
.dataseg
.relro_offset
)
5530 /* Where do we want to put this section so that it ends as
5532 bfd_vma start
, end
, bump
;
5534 end
= start
= sec
->vma
;
5536 end
+= TO_ADDR (sec
->size
);
5537 bump
= desired_end
- end
;
5538 /* We'd like to increase START by BUMP, but we must heed
5539 alignment so the increase might be less than optimum. */
5541 start
&= ~(((bfd_vma
) 1 << sec
->alignment_power
) - 1);
5542 /* This is now the desired end for the previous section. */
5543 desired_end
= start
;
5546 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5547 ASSERT (desired_end
>= expld
.dataseg
.base
);
5548 initial_base
= expld
.dataseg
.base
;
5549 expld
.dataseg
.base
= desired_end
;
5550 lang_reset_memory_regions ();
5551 one_lang_size_sections_pass (relax
, check_regions
);
5553 if (expld
.dataseg
.relro_end
> relro_end
)
5555 /* Assignments to dot, or to output section address in a
5556 user script have increased padding over the original.
5558 expld
.dataseg
.base
= initial_base
;
5559 lang_reset_memory_regions ();
5560 one_lang_size_sections_pass (relax
, check_regions
);
5563 link_info
.relro_start
= expld
.dataseg
.base
;
5564 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5566 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5568 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5569 a page could be saved in the data segment. */
5570 bfd_vma first
, last
;
5572 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5573 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5575 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5576 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5577 && first
+ last
<= expld
.dataseg
.pagesize
)
5579 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5580 lang_reset_memory_regions ();
5581 one_lang_size_sections_pass (relax
, check_regions
);
5584 expld
.dataseg
.phase
= exp_dataseg_done
;
5587 expld
.dataseg
.phase
= exp_dataseg_done
;
5590 static lang_output_section_statement_type
*current_section
;
5591 static lang_assignment_statement_type
*current_assign
;
5592 static bfd_boolean prefer_next_section
;
5594 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5597 lang_do_assignments_1 (lang_statement_union_type
*s
,
5598 lang_output_section_statement_type
*current_os
,
5601 bfd_boolean
*found_end
)
5603 for (; s
!= NULL
; s
= s
->header
.next
)
5605 switch (s
->header
.type
)
5607 case lang_constructors_statement_enum
:
5608 dot
= lang_do_assignments_1 (constructor_list
.head
,
5609 current_os
, fill
, dot
, found_end
);
5612 case lang_output_section_statement_enum
:
5614 lang_output_section_statement_type
*os
;
5616 os
= &(s
->output_section_statement
);
5617 os
->after_end
= *found_end
;
5618 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5620 if ((os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
5622 current_section
= os
;
5623 prefer_next_section
= FALSE
;
5625 dot
= os
->bfd_section
->vma
;
5627 lang_do_assignments_1 (os
->children
.head
,
5628 os
, os
->fill
, dot
, found_end
);
5630 /* .tbss sections effectively have zero size. */
5631 if (!IS_TBSS (os
->bfd_section
)
5632 || bfd_link_relocatable (&link_info
))
5633 dot
+= TO_ADDR (os
->bfd_section
->size
);
5635 if (os
->update_dot_tree
!= NULL
)
5636 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
,
5642 case lang_wild_statement_enum
:
5644 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5645 current_os
, fill
, dot
, found_end
);
5648 case lang_object_symbols_statement_enum
:
5649 case lang_output_statement_enum
:
5650 case lang_target_statement_enum
:
5653 case lang_data_statement_enum
:
5654 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5655 if (expld
.result
.valid_p
)
5657 s
->data_statement
.value
= expld
.result
.value
;
5658 if (expld
.result
.section
!= NULL
)
5659 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5662 einfo (_("%F%P: invalid data statement\n"));
5665 switch (s
->data_statement
.type
)
5683 if (size
< TO_SIZE ((unsigned) 1))
5684 size
= TO_SIZE ((unsigned) 1);
5685 dot
+= TO_ADDR (size
);
5689 case lang_reloc_statement_enum
:
5690 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5691 bfd_abs_section_ptr
, &dot
);
5692 if (expld
.result
.valid_p
)
5693 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5695 einfo (_("%F%P: invalid reloc statement\n"));
5696 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5699 case lang_input_section_enum
:
5701 asection
*in
= s
->input_section
.section
;
5703 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5704 dot
+= TO_ADDR (in
->size
);
5708 case lang_input_statement_enum
:
5711 case lang_fill_statement_enum
:
5712 fill
= s
->fill_statement
.fill
;
5715 case lang_assignment_statement_enum
:
5716 current_assign
= &s
->assignment_statement
;
5717 if (current_assign
->exp
->type
.node_class
!= etree_assert
)
5719 const char *p
= current_assign
->exp
->assign
.dst
;
5721 if (current_os
== abs_output_section
&& p
[0] == '.' && p
[1] == 0)
5722 prefer_next_section
= TRUE
;
5726 if (strcmp (p
, "end") == 0)
5729 exp_fold_tree (s
->assignment_statement
.exp
,
5730 current_os
->bfd_section
,
5734 case lang_padding_statement_enum
:
5735 dot
+= TO_ADDR (s
->padding_statement
.size
);
5738 case lang_group_statement_enum
:
5739 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5740 current_os
, fill
, dot
, found_end
);
5743 case lang_insert_statement_enum
:
5746 case lang_address_statement_enum
:
5758 lang_do_assignments (lang_phase_type phase
)
5760 bfd_boolean found_end
= FALSE
;
5762 current_section
= NULL
;
5763 prefer_next_section
= FALSE
;
5764 expld
.phase
= phase
;
5765 lang_statement_iteration
++;
5766 lang_do_assignments_1 (statement_list
.head
,
5767 abs_output_section
, NULL
, 0, &found_end
);
5770 /* For an assignment statement outside of an output section statement,
5771 choose the best of neighbouring output sections to use for values
5775 section_for_dot (void)
5779 /* Assignments belong to the previous output section, unless there
5780 has been an assignment to "dot", in which case following
5781 assignments belong to the next output section. (The assumption
5782 is that an assignment to "dot" is setting up the address for the
5783 next output section.) Except that past the assignment to "_end"
5784 we always associate with the previous section. This exception is
5785 for targets like SH that define an alloc .stack or other
5786 weirdness after non-alloc sections. */
5787 if (current_section
== NULL
|| prefer_next_section
)
5789 lang_statement_union_type
*stmt
;
5790 lang_output_section_statement_type
*os
;
5792 for (stmt
= (lang_statement_union_type
*) current_assign
;
5794 stmt
= stmt
->header
.next
)
5795 if (stmt
->header
.type
== lang_output_section_statement_enum
)
5798 os
= &stmt
->output_section_statement
;
5801 && (os
->bfd_section
== NULL
5802 || (os
->bfd_section
->flags
& SEC_EXCLUDE
) != 0
5803 || bfd_section_removed_from_list (link_info
.output_bfd
,
5807 if (current_section
== NULL
|| os
== NULL
|| !os
->after_end
)
5810 s
= os
->bfd_section
;
5812 s
= link_info
.output_bfd
->section_last
;
5814 && ((s
->flags
& SEC_ALLOC
) == 0
5815 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5820 return bfd_abs_section_ptr
;
5824 s
= current_section
->bfd_section
;
5826 /* The section may have been stripped. */
5828 && ((s
->flags
& SEC_EXCLUDE
) != 0
5829 || (s
->flags
& SEC_ALLOC
) == 0
5830 || (s
->flags
& SEC_THREAD_LOCAL
) != 0
5831 || bfd_section_removed_from_list (link_info
.output_bfd
, s
)))
5834 s
= link_info
.output_bfd
->sections
;
5836 && ((s
->flags
& SEC_ALLOC
) == 0
5837 || (s
->flags
& SEC_THREAD_LOCAL
) != 0))
5842 return bfd_abs_section_ptr
;
5845 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5846 operator .startof. (section_name), it produces an undefined symbol
5847 .startof.section_name. Similarly, when it sees
5848 .sizeof. (section_name), it produces an undefined symbol
5849 .sizeof.section_name. For all the output sections, we look for
5850 such symbols, and set them to the correct value. */
5853 lang_set_startof (void)
5857 if (bfd_link_relocatable (&link_info
))
5860 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5862 const char *secname
;
5864 struct bfd_link_hash_entry
*h
;
5866 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5867 buf
= (char *) xmalloc (10 + strlen (secname
));
5869 sprintf (buf
, ".startof.%s", secname
);
5870 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5871 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5873 h
->type
= bfd_link_hash_defined
;
5875 h
->u
.def
.section
= s
;
5878 sprintf (buf
, ".sizeof.%s", secname
);
5879 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5880 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5882 h
->type
= bfd_link_hash_defined
;
5883 h
->u
.def
.value
= TO_ADDR (s
->size
);
5884 h
->u
.def
.section
= bfd_abs_section_ptr
;
5894 struct bfd_link_hash_entry
*h
;
5897 if ((bfd_link_relocatable (&link_info
) && !link_info
.gc_sections
)
5898 || bfd_link_dll (&link_info
))
5899 warn
= entry_from_cmdline
;
5903 /* Force the user to specify a root when generating a relocatable with
5905 if (link_info
.gc_sections
&& bfd_link_relocatable (&link_info
)
5906 && !(entry_from_cmdline
|| undef_from_cmdline
))
5907 einfo (_("%P%F: gc-sections requires either an entry or "
5908 "an undefined symbol\n"));
5910 if (entry_symbol
.name
== NULL
)
5912 /* No entry has been specified. Look for the default entry, but
5913 don't warn if we don't find it. */
5914 entry_symbol
.name
= entry_symbol_default
;
5918 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5919 FALSE
, FALSE
, TRUE
);
5921 && (h
->type
== bfd_link_hash_defined
5922 || h
->type
== bfd_link_hash_defweak
)
5923 && h
->u
.def
.section
->output_section
!= NULL
)
5927 val
= (h
->u
.def
.value
5928 + bfd_get_section_vma (link_info
.output_bfd
,
5929 h
->u
.def
.section
->output_section
)
5930 + h
->u
.def
.section
->output_offset
);
5931 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
5932 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5939 /* We couldn't find the entry symbol. Try parsing it as a
5941 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5944 if (!bfd_set_start_address (link_info
.output_bfd
, val
))
5945 einfo (_("%P%F: can't set start address\n"));
5951 /* Can't find the entry symbol, and it's not a number. Use
5952 the first address in the text section. */
5953 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5957 einfo (_("%P: warning: cannot find entry symbol %s;"
5958 " defaulting to %V\n"),
5960 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5961 if (!(bfd_set_start_address
5962 (link_info
.output_bfd
,
5963 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5964 einfo (_("%P%F: can't set start address\n"));
5969 einfo (_("%P: warning: cannot find entry symbol %s;"
5970 " not setting start address\n"),
5977 /* This is a small function used when we want to ignore errors from
5981 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5983 /* Don't do anything. */
5986 /* Check that the architecture of all the input files is compatible
5987 with the output file. Also call the backend to let it do any
5988 other checking that is needed. */
5993 lang_statement_union_type
*file
;
5995 const bfd_arch_info_type
*compatible
;
5997 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5999 #ifdef ENABLE_PLUGINS
6000 /* Don't check format of files claimed by plugin. */
6001 if (file
->input_statement
.flags
.claimed
)
6003 #endif /* ENABLE_PLUGINS */
6004 input_bfd
= file
->input_statement
.the_bfd
;
6006 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
6007 command_line
.accept_unknown_input_arch
);
6009 /* In general it is not possible to perform a relocatable
6010 link between differing object formats when the input
6011 file has relocations, because the relocations in the
6012 input format may not have equivalent representations in
6013 the output format (and besides BFD does not translate
6014 relocs for other link purposes than a final link). */
6015 if ((bfd_link_relocatable (&link_info
)
6016 || link_info
.emitrelocations
)
6017 && (compatible
== NULL
6018 || (bfd_get_flavour (input_bfd
)
6019 != bfd_get_flavour (link_info
.output_bfd
)))
6020 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
6022 einfo (_("%P%F: Relocatable linking with relocations from"
6023 " format %s (%B) to format %s (%B) is not supported\n"),
6024 bfd_get_target (input_bfd
), input_bfd
,
6025 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
6026 /* einfo with %F exits. */
6029 if (compatible
== NULL
)
6031 if (command_line
.warn_mismatch
)
6032 einfo (_("%P%X: %s architecture of input file `%B'"
6033 " is incompatible with %s output\n"),
6034 bfd_printable_name (input_bfd
), input_bfd
,
6035 bfd_printable_name (link_info
.output_bfd
));
6037 else if (bfd_count_sections (input_bfd
))
6039 /* If the input bfd has no contents, it shouldn't set the
6040 private data of the output bfd. */
6042 bfd_error_handler_type pfn
= NULL
;
6044 /* If we aren't supposed to warn about mismatched input
6045 files, temporarily set the BFD error handler to a
6046 function which will do nothing. We still want to call
6047 bfd_merge_private_bfd_data, since it may set up
6048 information which is needed in the output file. */
6049 if (!command_line
.warn_mismatch
)
6050 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
6051 if (!bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
6053 if (command_line
.warn_mismatch
)
6054 einfo (_("%P%X: failed to merge target specific data"
6055 " of file %B\n"), input_bfd
);
6057 if (!command_line
.warn_mismatch
)
6058 bfd_set_error_handler (pfn
);
6063 /* Look through all the global common symbols and attach them to the
6064 correct section. The -sort-common command line switch may be used
6065 to roughly sort the entries by alignment. */
6070 if (command_line
.inhibit_common_definition
)
6072 if (bfd_link_relocatable (&link_info
)
6073 && !command_line
.force_common_definition
)
6076 if (!config
.sort_common
)
6077 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
6082 if (config
.sort_common
== sort_descending
)
6084 for (power
= 4; power
> 0; power
--)
6085 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6088 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6092 for (power
= 0; power
<= 4; power
++)
6093 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6095 power
= (unsigned int) -1;
6096 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
6101 /* Place one common symbol in the correct section. */
6104 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
6106 unsigned int power_of_two
;
6110 if (h
->type
!= bfd_link_hash_common
)
6114 power_of_two
= h
->u
.c
.p
->alignment_power
;
6116 if (config
.sort_common
== sort_descending
6117 && power_of_two
< *(unsigned int *) info
)
6119 else if (config
.sort_common
== sort_ascending
6120 && power_of_two
> *(unsigned int *) info
)
6123 section
= h
->u
.c
.p
->section
;
6124 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
6125 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
6128 if (config
.map_file
!= NULL
)
6130 static bfd_boolean header_printed
;
6135 if (!header_printed
)
6137 minfo (_("\nAllocating common symbols\n"));
6138 minfo (_("Common symbol size file\n\n"));
6139 header_printed
= TRUE
;
6142 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
6143 DMGL_ANSI
| DMGL_PARAMS
);
6146 minfo ("%s", h
->root
.string
);
6147 len
= strlen (h
->root
.string
);
6152 len
= strlen (name
);
6168 if (size
<= 0xffffffff)
6169 sprintf (buf
, "%lx", (unsigned long) size
);
6171 sprintf_vma (buf
, size
);
6181 minfo ("%B\n", section
->owner
);
6187 /* Handle a single orphan section S, placing the orphan into an appropriate
6188 output section. The effects of the --orphan-handling command line
6189 option are handled here. */
6192 ldlang_place_orphan (asection
*s
)
6194 if (config
.orphan_handling
== orphan_handling_discard
)
6196 lang_output_section_statement_type
*os
;
6197 os
= lang_output_section_statement_lookup (DISCARD_SECTION_NAME
, 0,
6199 if (os
->addr_tree
== NULL
6200 && (bfd_link_relocatable (&link_info
)
6201 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6202 os
->addr_tree
= exp_intop (0);
6203 lang_add_section (&os
->children
, s
, NULL
, os
);
6207 lang_output_section_statement_type
*os
;
6208 const char *name
= s
->name
;
6211 if (config
.orphan_handling
== orphan_handling_error
)
6212 einfo ("%X%P: error: unplaced orphan section `%A' from `%B'.\n",
6215 if (config
.unique_orphan_sections
|| unique_section_p (s
, NULL
))
6216 constraint
= SPECIAL
;
6218 os
= ldemul_place_orphan (s
, name
, constraint
);
6221 os
= lang_output_section_statement_lookup (name
, constraint
, TRUE
);
6222 if (os
->addr_tree
== NULL
6223 && (bfd_link_relocatable (&link_info
)
6224 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6225 os
->addr_tree
= exp_intop (0);
6226 lang_add_section (&os
->children
, s
, NULL
, os
);
6229 if (config
.orphan_handling
== orphan_handling_warn
)
6230 einfo ("%P: warning: orphan section `%A' from `%B' being "
6231 "placed in section `%s'.\n",
6232 s
, s
->owner
, os
->name
);
6236 /* Run through the input files and ensure that every input section has
6237 somewhere to go. If one is found without a destination then create
6238 an input request and place it into the statement tree. */
6241 lang_place_orphans (void)
6243 LANG_FOR_EACH_INPUT_STATEMENT (file
)
6247 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
6249 if (s
->output_section
== NULL
)
6251 /* This section of the file is not attached, root
6252 around for a sensible place for it to go. */
6254 if (file
->flags
.just_syms
)
6255 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
6256 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
6257 s
->output_section
= bfd_abs_section_ptr
;
6258 else if (strcmp (s
->name
, "COMMON") == 0)
6260 /* This is a lonely common section which must have
6261 come from an archive. We attach to the section
6262 with the wildcard. */
6263 if (!bfd_link_relocatable (&link_info
)
6264 || command_line
.force_common_definition
)
6266 if (default_common_section
== NULL
)
6267 default_common_section
6268 = lang_output_section_statement_lookup (".bss", 0,
6270 lang_add_section (&default_common_section
->children
, s
,
6271 NULL
, default_common_section
);
6275 ldlang_place_orphan (s
);
6282 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6284 flagword
*ptr_flags
;
6286 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6292 /* PR 17900: An exclamation mark in the attributes reverses
6293 the sense of any of the attributes that follow. */
6296 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6300 *ptr_flags
|= SEC_ALLOC
;
6304 *ptr_flags
|= SEC_READONLY
;
6308 *ptr_flags
|= SEC_DATA
;
6312 *ptr_flags
|= SEC_CODE
;
6317 *ptr_flags
|= SEC_LOAD
;
6321 einfo (_("%P%F: invalid character %c (%d) in flags\n"),
6329 /* Call a function on each input file. This function will be called
6330 on an archive, but not on the elements. */
6333 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6335 lang_input_statement_type
*f
;
6337 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6339 f
= (lang_input_statement_type
*) f
->next_real_file
)
6343 /* Call a function on each file. The function will be called on all
6344 the elements of an archive which are included in the link, but will
6345 not be called on the archive file itself. */
6348 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6350 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6357 ldlang_add_file (lang_input_statement_type
*entry
)
6359 lang_statement_append (&file_chain
,
6360 (lang_statement_union_type
*) entry
,
6363 /* The BFD linker needs to have a list of all input BFDs involved in
6365 ASSERT (entry
->the_bfd
->link
.next
== NULL
);
6366 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6368 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6369 link_info
.input_bfds_tail
= &entry
->the_bfd
->link
.next
;
6370 entry
->the_bfd
->usrdata
= entry
;
6371 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6373 /* Look through the sections and check for any which should not be
6374 included in the link. We need to do this now, so that we can
6375 notice when the backend linker tries to report multiple
6376 definition errors for symbols which are in sections we aren't
6377 going to link. FIXME: It might be better to entirely ignore
6378 symbols which are defined in sections which are going to be
6379 discarded. This would require modifying the backend linker for
6380 each backend which might set the SEC_LINK_ONCE flag. If we do
6381 this, we should probably handle SEC_EXCLUDE in the same way. */
6383 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6387 lang_add_output (const char *name
, int from_script
)
6389 /* Make -o on command line override OUTPUT in script. */
6390 if (!had_output_filename
|| !from_script
)
6392 output_filename
= name
;
6393 had_output_filename
= TRUE
;
6406 for (l
= 0; l
< 32; l
++)
6408 if (i
>= (unsigned int) x
)
6416 lang_output_section_statement_type
*
6417 lang_enter_output_section_statement (const char *output_section_statement_name
,
6418 etree_type
*address_exp
,
6419 enum section_type sectype
,
6421 etree_type
*subalign
,
6424 int align_with_input
)
6426 lang_output_section_statement_type
*os
;
6428 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6430 current_section
= os
;
6432 if (os
->addr_tree
== NULL
)
6434 os
->addr_tree
= address_exp
;
6436 os
->sectype
= sectype
;
6437 if (sectype
!= noload_section
)
6438 os
->flags
= SEC_NO_FLAGS
;
6440 os
->flags
= SEC_NEVER_LOAD
;
6441 os
->block_value
= 1;
6443 /* Make next things chain into subchain of this. */
6444 push_stat_ptr (&os
->children
);
6446 os
->align_lma_with_input
= align_with_input
== ALIGN_WITH_INPUT
;
6447 if (os
->align_lma_with_input
&& align
!= NULL
)
6448 einfo (_("%F%P:%S: error: align with input and explicit align specified\n"),
6451 os
->subsection_alignment
=
6452 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6453 os
->section_alignment
=
6454 topower (exp_get_value_int (align
, -1, "section alignment"));
6456 os
->load_base
= ebase
;
6463 lang_output_statement_type
*new_stmt
;
6465 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6466 new_stmt
->name
= output_filename
;
6469 /* Reset the current counters in the regions. */
6472 lang_reset_memory_regions (void)
6474 lang_memory_region_type
*p
= lang_memory_region_list
;
6476 lang_output_section_statement_type
*os
;
6478 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6480 p
->current
= p
->origin
;
6484 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6488 os
->processed_vma
= FALSE
;
6489 os
->processed_lma
= FALSE
;
6492 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6494 /* Save the last size for possible use by bfd_relax_section. */
6495 o
->rawsize
= o
->size
;
6500 /* Worker for lang_gc_sections_1. */
6503 gc_section_callback (lang_wild_statement_type
*ptr
,
6504 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6506 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6507 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6508 void *data ATTRIBUTE_UNUSED
)
6510 /* If the wild pattern was marked KEEP, the member sections
6511 should be as well. */
6512 if (ptr
->keep_sections
)
6513 section
->flags
|= SEC_KEEP
;
6516 /* Iterate over sections marking them against GC. */
6519 lang_gc_sections_1 (lang_statement_union_type
*s
)
6521 for (; s
!= NULL
; s
= s
->header
.next
)
6523 switch (s
->header
.type
)
6525 case lang_wild_statement_enum
:
6526 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6528 case lang_constructors_statement_enum
:
6529 lang_gc_sections_1 (constructor_list
.head
);
6531 case lang_output_section_statement_enum
:
6532 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6534 case lang_group_statement_enum
:
6535 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6544 lang_gc_sections (void)
6546 /* Keep all sections so marked in the link script. */
6547 lang_gc_sections_1 (statement_list
.head
);
6549 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6550 the special case of debug info. (See bfd/stabs.c)
6551 Twiddle the flag here, to simplify later linker code. */
6552 if (bfd_link_relocatable (&link_info
))
6554 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6557 #ifdef ENABLE_PLUGINS
6558 if (f
->flags
.claimed
)
6561 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6562 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6563 sec
->flags
&= ~SEC_EXCLUDE
;
6567 if (link_info
.gc_sections
)
6568 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6571 /* Worker for lang_find_relro_sections_1. */
6574 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6575 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6577 struct flag_info
*sflag_info ATTRIBUTE_UNUSED
,
6578 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6581 /* Discarded, excluded and ignored sections effectively have zero
6583 if (section
->output_section
!= NULL
6584 && section
->output_section
->owner
== link_info
.output_bfd
6585 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6586 && !IGNORE_SECTION (section
)
6587 && section
->size
!= 0)
6589 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6590 *has_relro_section
= TRUE
;
6594 /* Iterate over sections for relro sections. */
6597 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6598 bfd_boolean
*has_relro_section
)
6600 if (*has_relro_section
)
6603 for (; s
!= NULL
; s
= s
->header
.next
)
6605 if (s
== expld
.dataseg
.relro_end_stat
)
6608 switch (s
->header
.type
)
6610 case lang_wild_statement_enum
:
6611 walk_wild (&s
->wild_statement
,
6612 find_relro_section_callback
,
6615 case lang_constructors_statement_enum
:
6616 lang_find_relro_sections_1 (constructor_list
.head
,
6619 case lang_output_section_statement_enum
:
6620 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6623 case lang_group_statement_enum
:
6624 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6634 lang_find_relro_sections (void)
6636 bfd_boolean has_relro_section
= FALSE
;
6638 /* Check all sections in the link script. */
6640 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6641 &has_relro_section
);
6643 if (!has_relro_section
)
6644 link_info
.relro
= FALSE
;
6647 /* Relax all sections until bfd_relax_section gives up. */
6650 lang_relax_sections (bfd_boolean need_layout
)
6652 if (RELAXATION_ENABLED
)
6654 /* We may need more than one relaxation pass. */
6655 int i
= link_info
.relax_pass
;
6657 /* The backend can use it to determine the current pass. */
6658 link_info
.relax_pass
= 0;
6662 /* Keep relaxing until bfd_relax_section gives up. */
6663 bfd_boolean relax_again
;
6665 link_info
.relax_trip
= -1;
6668 link_info
.relax_trip
++;
6670 /* Note: pe-dll.c does something like this also. If you find
6671 you need to change this code, you probably need to change
6672 pe-dll.c also. DJ */
6674 /* Do all the assignments with our current guesses as to
6676 lang_do_assignments (lang_assigning_phase_enum
);
6678 /* We must do this after lang_do_assignments, because it uses
6680 lang_reset_memory_regions ();
6682 /* Perform another relax pass - this time we know where the
6683 globals are, so can make a better guess. */
6684 relax_again
= FALSE
;
6685 lang_size_sections (&relax_again
, FALSE
);
6687 while (relax_again
);
6689 link_info
.relax_pass
++;
6696 /* Final extra sizing to report errors. */
6697 lang_do_assignments (lang_assigning_phase_enum
);
6698 lang_reset_memory_regions ();
6699 lang_size_sections (NULL
, TRUE
);
6703 #ifdef ENABLE_PLUGINS
6704 /* Find the insert point for the plugin's replacement files. We
6705 place them after the first claimed real object file, or if the
6706 first claimed object is an archive member, after the last real
6707 object file immediately preceding the archive. In the event
6708 no objects have been claimed at all, we return the first dummy
6709 object file on the list as the insert point; that works, but
6710 the callee must be careful when relinking the file_chain as it
6711 is not actually on that chain, only the statement_list and the
6712 input_file list; in that case, the replacement files must be
6713 inserted at the head of the file_chain. */
6715 static lang_input_statement_type
*
6716 find_replacements_insert_point (void)
6718 lang_input_statement_type
*claim1
, *lastobject
;
6719 lastobject
= &input_file_chain
.head
->input_statement
;
6720 for (claim1
= &file_chain
.head
->input_statement
;
6722 claim1
= &claim1
->next
->input_statement
)
6724 if (claim1
->flags
.claimed
)
6725 return claim1
->flags
.claim_archive
? lastobject
: claim1
;
6726 /* Update lastobject if this is a real object file. */
6727 if (claim1
->the_bfd
!= NULL
&& claim1
->the_bfd
->my_archive
== NULL
)
6728 lastobject
= claim1
;
6730 /* No files were claimed by the plugin. Choose the last object
6731 file found on the list (maybe the first, dummy entry) as the
6736 /* Insert SRCLIST into DESTLIST after given element by chaining
6737 on FIELD as the next-pointer. (Counterintuitively does not need
6738 a pointer to the actual after-node itself, just its chain field.) */
6741 lang_list_insert_after (lang_statement_list_type
*destlist
,
6742 lang_statement_list_type
*srclist
,
6743 lang_statement_union_type
**field
)
6745 *(srclist
->tail
) = *field
;
6746 *field
= srclist
->head
;
6747 if (destlist
->tail
== field
)
6748 destlist
->tail
= srclist
->tail
;
6751 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6752 was taken as a copy of it and leave them in ORIGLIST. */
6755 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6756 lang_statement_list_type
*origlist
)
6758 union lang_statement_union
**savetail
;
6759 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6760 ASSERT (origlist
->head
== destlist
->head
);
6761 savetail
= origlist
->tail
;
6762 origlist
->head
= *(savetail
);
6763 origlist
->tail
= destlist
->tail
;
6764 destlist
->tail
= savetail
;
6767 #endif /* ENABLE_PLUGINS */
6769 /* Add NAME to the list of garbage collection entry points. */
6772 lang_add_gc_name (const char *name
)
6774 struct bfd_sym_chain
*sym
;
6779 sym
= (struct bfd_sym_chain
*) stat_alloc (sizeof (*sym
));
6781 sym
->next
= link_info
.gc_sym_list
;
6783 link_info
.gc_sym_list
= sym
;
6786 /* Check relocations. */
6789 lang_check_relocs (void)
6791 if (link_info
.check_relocs_after_open_input
)
6795 for (abfd
= link_info
.input_bfds
;
6796 abfd
!= (bfd
*) NULL
; abfd
= abfd
->link
.next
)
6797 if (!bfd_link_check_relocs (abfd
, &link_info
))
6799 /* No object output, fail return. */
6800 config
.make_executable
= FALSE
;
6801 /* Note: we do not abort the loop, but rather
6802 continue the scan in case there are other
6803 bad relocations to report. */
6811 /* Finalize dynamic list. */
6812 if (link_info
.dynamic_list
)
6813 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6815 current_target
= default_target
;
6817 /* Open the output file. */
6818 lang_for_each_statement (ldlang_open_output
);
6821 ldemul_create_output_section_statements ();
6823 /* Add to the hash table all undefineds on the command line. */
6824 lang_place_undefineds ();
6826 if (!bfd_section_already_linked_table_init ())
6827 einfo (_("%P%F: Failed to create hash table\n"));
6829 /* Create a bfd for each input file. */
6830 current_target
= default_target
;
6831 open_input_bfds (statement_list
.head
, OPEN_BFD_NORMAL
);
6833 #ifdef ENABLE_PLUGINS
6834 if (link_info
.lto_plugin_active
)
6836 lang_statement_list_type added
;
6837 lang_statement_list_type files
, inputfiles
;
6839 /* Now all files are read, let the plugin(s) decide if there
6840 are any more to be added to the link before we call the
6841 emulation's after_open hook. We create a private list of
6842 input statements for this purpose, which we will eventually
6843 insert into the global statment list after the first claimed
6846 /* We need to manipulate all three chains in synchrony. */
6848 inputfiles
= input_file_chain
;
6849 if (plugin_call_all_symbols_read ())
6850 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6851 plugin_error_plugin ());
6852 /* Open any newly added files, updating the file chains. */
6853 open_input_bfds (*added
.tail
, OPEN_BFD_NORMAL
);
6854 /* Restore the global list pointer now they have all been added. */
6855 lang_list_remove_tail (stat_ptr
, &added
);
6856 /* And detach the fresh ends of the file lists. */
6857 lang_list_remove_tail (&file_chain
, &files
);
6858 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6859 /* Were any new files added? */
6860 if (added
.head
!= NULL
)
6862 /* If so, we will insert them into the statement list immediately
6863 after the first input file that was claimed by the plugin. */
6864 plugin_insert
= find_replacements_insert_point ();
6865 /* If a plugin adds input files without having claimed any, we
6866 don't really have a good idea where to place them. Just putting
6867 them at the start or end of the list is liable to leave them
6868 outside the crtbegin...crtend range. */
6869 ASSERT (plugin_insert
!= NULL
);
6870 /* Splice the new statement list into the old one. */
6871 lang_list_insert_after (stat_ptr
, &added
,
6872 &plugin_insert
->header
.next
);
6873 /* Likewise for the file chains. */
6874 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6875 &plugin_insert
->next_real_file
);
6876 /* We must be careful when relinking file_chain; we may need to
6877 insert the new files at the head of the list if the insert
6878 point chosen is the dummy first input file. */
6879 if (plugin_insert
->filename
)
6880 lang_list_insert_after (&file_chain
, &files
, &plugin_insert
->next
);
6882 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6884 /* Rescan archives in case new undefined symbols have appeared. */
6885 open_input_bfds (statement_list
.head
, OPEN_BFD_RESCAN
);
6888 #endif /* ENABLE_PLUGINS */
6890 /* Make sure that nobody has tried to add a symbol to this list
6892 ASSERT (link_info
.gc_sym_list
== NULL
);
6894 link_info
.gc_sym_list
= &entry_symbol
;
6896 if (entry_symbol
.name
== NULL
)
6898 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6900 /* entry_symbol is normally initialied by a ENTRY definition in the
6901 linker script or the -e command line option. But if neither of
6902 these have been used, the target specific backend may still have
6903 provided an entry symbol via a call to lang_default_entry().
6904 Unfortunately this value will not be processed until lang_end()
6905 is called, long after this function has finished. So detect this
6906 case here and add the target's entry symbol to the list of starting
6907 points for garbage collection resolution. */
6908 lang_add_gc_name (entry_symbol_default
);
6911 lang_add_gc_name (link_info
.init_function
);
6912 lang_add_gc_name (link_info
.fini_function
);
6914 ldemul_after_open ();
6915 if (config
.map_file
!= NULL
)
6916 lang_print_asneeded ();
6918 bfd_section_already_linked_table_free ();
6920 /* Make sure that we're not mixing architectures. We call this
6921 after all the input files have been opened, but before we do any
6922 other processing, so that any operations merge_private_bfd_data
6923 does on the output file will be known during the rest of the
6927 /* Handle .exports instead of a version script if we're told to do so. */
6928 if (command_line
.version_exports_section
)
6929 lang_do_version_exports_section ();
6931 /* Build all sets based on the information gathered from the input
6933 ldctor_build_sets ();
6935 /* PR 13683: We must rerun the assignments prior to running garbage
6936 collection in order to make sure that all symbol aliases are resolved. */
6937 lang_do_assignments (lang_mark_phase_enum
);
6939 lang_do_memory_regions();
6940 expld
.phase
= lang_first_phase_enum
;
6942 /* Size up the common data. */
6945 /* Remove unreferenced sections if asked to. */
6946 lang_gc_sections ();
6948 /* Check relocations. */
6949 lang_check_relocs ();
6951 /* Update wild statements. */
6952 update_wild_statements (statement_list
.head
);
6954 /* Run through the contours of the script and attach input sections
6955 to the correct output sections. */
6956 lang_statement_iteration
++;
6957 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6959 process_insert_statements ();
6961 /* Find any sections not attached explicitly and handle them. */
6962 lang_place_orphans ();
6964 if (!bfd_link_relocatable (&link_info
))
6968 /* Merge SEC_MERGE sections. This has to be done after GC of
6969 sections, so that GCed sections are not merged, but before
6970 assigning dynamic symbols, since removing whole input sections
6972 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6974 /* Look for a text section and set the readonly attribute in it. */
6975 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6979 if (config
.text_read_only
)
6980 found
->flags
|= SEC_READONLY
;
6982 found
->flags
&= ~SEC_READONLY
;
6986 /* Do anything special before sizing sections. This is where ELF
6987 and other back-ends size dynamic sections. */
6988 ldemul_before_allocation ();
6990 /* We must record the program headers before we try to fix the
6991 section positions, since they will affect SIZEOF_HEADERS. */
6992 lang_record_phdrs ();
6994 /* Check relro sections. */
6995 if (link_info
.relro
&& !bfd_link_relocatable (&link_info
))
6996 lang_find_relro_sections ();
6998 /* Size up the sections. */
6999 lang_size_sections (NULL
, !RELAXATION_ENABLED
);
7001 /* See if anything special should be done now we know how big
7002 everything is. This is where relaxation is done. */
7003 ldemul_after_allocation ();
7005 /* Fix any .startof. or .sizeof. symbols. */
7006 lang_set_startof ();
7008 /* Do all the assignments, now that we know the final resting places
7009 of all the symbols. */
7010 lang_do_assignments (lang_final_phase_enum
);
7014 /* Convert absolute symbols to section relative. */
7015 ldexp_finalize_syms ();
7017 /* Make sure that the section addresses make sense. */
7018 if (command_line
.check_section_addresses
)
7019 lang_check_section_addresses ();
7021 /* Check any required symbols are known. */
7022 ldlang_check_require_defined_symbols ();
7027 /* EXPORTED TO YACC */
7030 lang_add_wild (struct wildcard_spec
*filespec
,
7031 struct wildcard_list
*section_list
,
7032 bfd_boolean keep_sections
)
7034 struct wildcard_list
*curr
, *next
;
7035 lang_wild_statement_type
*new_stmt
;
7037 /* Reverse the list as the parser puts it back to front. */
7038 for (curr
= section_list
, section_list
= NULL
;
7040 section_list
= curr
, curr
= next
)
7042 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
7043 placed_commons
= TRUE
;
7046 curr
->next
= section_list
;
7049 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
7051 if (strcmp (filespec
->name
, "*") == 0)
7052 filespec
->name
= NULL
;
7053 else if (!wildcardp (filespec
->name
))
7054 lang_has_input_file
= TRUE
;
7057 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
7058 new_stmt
->filename
= NULL
;
7059 new_stmt
->filenames_sorted
= FALSE
;
7060 new_stmt
->section_flag_list
= NULL
;
7061 if (filespec
!= NULL
)
7063 new_stmt
->filename
= filespec
->name
;
7064 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
7065 new_stmt
->section_flag_list
= filespec
->section_flag_list
;
7067 new_stmt
->section_list
= section_list
;
7068 new_stmt
->keep_sections
= keep_sections
;
7069 lang_list_init (&new_stmt
->children
);
7070 analyze_walk_wild_section_handler (new_stmt
);
7074 lang_section_start (const char *name
, etree_type
*address
,
7075 const segment_type
*segment
)
7077 lang_address_statement_type
*ad
;
7079 ad
= new_stat (lang_address_statement
, stat_ptr
);
7080 ad
->section_name
= name
;
7081 ad
->address
= address
;
7082 ad
->segment
= segment
;
7085 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
7086 because of a -e argument on the command line, or zero if this is
7087 called by ENTRY in a linker script. Command line arguments take
7091 lang_add_entry (const char *name
, bfd_boolean cmdline
)
7093 if (entry_symbol
.name
== NULL
7095 || !entry_from_cmdline
)
7097 entry_symbol
.name
= name
;
7098 entry_from_cmdline
= cmdline
;
7102 /* Set the default start symbol to NAME. .em files should use this,
7103 not lang_add_entry, to override the use of "start" if neither the
7104 linker script nor the command line specifies an entry point. NAME
7105 must be permanently allocated. */
7107 lang_default_entry (const char *name
)
7109 entry_symbol_default
= name
;
7113 lang_add_target (const char *name
)
7115 lang_target_statement_type
*new_stmt
;
7117 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
7118 new_stmt
->target
= name
;
7122 lang_add_map (const char *name
)
7129 map_option_f
= TRUE
;
7137 lang_add_fill (fill_type
*fill
)
7139 lang_fill_statement_type
*new_stmt
;
7141 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
7142 new_stmt
->fill
= fill
;
7146 lang_add_data (int type
, union etree_union
*exp
)
7148 lang_data_statement_type
*new_stmt
;
7150 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
7151 new_stmt
->exp
= exp
;
7152 new_stmt
->type
= type
;
7155 /* Create a new reloc statement. RELOC is the BFD relocation type to
7156 generate. HOWTO is the corresponding howto structure (we could
7157 look this up, but the caller has already done so). SECTION is the
7158 section to generate a reloc against, or NAME is the name of the
7159 symbol to generate a reloc against. Exactly one of SECTION and
7160 NAME must be NULL. ADDEND is an expression for the addend. */
7163 lang_add_reloc (bfd_reloc_code_real_type reloc
,
7164 reloc_howto_type
*howto
,
7167 union etree_union
*addend
)
7169 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
7173 p
->section
= section
;
7175 p
->addend_exp
= addend
;
7177 p
->addend_value
= 0;
7178 p
->output_section
= NULL
;
7179 p
->output_offset
= 0;
7182 lang_assignment_statement_type
*
7183 lang_add_assignment (etree_type
*exp
)
7185 lang_assignment_statement_type
*new_stmt
;
7187 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
7188 new_stmt
->exp
= exp
;
7193 lang_add_attribute (enum statement_enum attribute
)
7195 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
7199 lang_startup (const char *name
)
7201 if (first_file
->filename
!= NULL
)
7203 einfo (_("%P%F: multiple STARTUP files\n"));
7205 first_file
->filename
= name
;
7206 first_file
->local_sym_name
= name
;
7207 first_file
->flags
.real
= TRUE
;
7211 lang_float (bfd_boolean maybe
)
7213 lang_float_flag
= maybe
;
7217 /* Work out the load- and run-time regions from a script statement, and
7218 store them in *LMA_REGION and *REGION respectively.
7220 MEMSPEC is the name of the run-time region, or the value of
7221 DEFAULT_MEMORY_REGION if the statement didn't specify one.
7222 LMA_MEMSPEC is the name of the load-time region, or null if the
7223 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
7224 had an explicit load address.
7226 It is an error to specify both a load region and a load address. */
7229 lang_get_regions (lang_memory_region_type
**region
,
7230 lang_memory_region_type
**lma_region
,
7231 const char *memspec
,
7232 const char *lma_memspec
,
7233 bfd_boolean have_lma
,
7234 bfd_boolean have_vma
)
7236 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
7238 /* If no runtime region or VMA has been specified, but the load region
7239 has been specified, then use the load region for the runtime region
7241 if (lma_memspec
!= NULL
7243 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
7244 *region
= *lma_region
;
7246 *region
= lang_memory_region_lookup (memspec
, FALSE
);
7248 if (have_lma
&& lma_memspec
!= 0)
7249 einfo (_("%X%P:%S: section has both a load address and a load region\n"),
7254 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
7255 lang_output_section_phdr_list
*phdrs
,
7256 const char *lma_memspec
)
7258 lang_get_regions (¤t_section
->region
,
7259 ¤t_section
->lma_region
,
7260 memspec
, lma_memspec
,
7261 current_section
->load_base
!= NULL
,
7262 current_section
->addr_tree
!= NULL
);
7264 /* If this section has no load region or base, but uses the same
7265 region as the previous section, then propagate the previous
7266 section's load region. */
7268 if (current_section
->lma_region
== NULL
7269 && current_section
->load_base
== NULL
7270 && current_section
->addr_tree
== NULL
7271 && current_section
->region
== current_section
->prev
->region
)
7272 current_section
->lma_region
= current_section
->prev
->lma_region
;
7274 current_section
->fill
= fill
;
7275 current_section
->phdrs
= phdrs
;
7280 lang_statement_append (lang_statement_list_type
*list
,
7281 lang_statement_union_type
*element
,
7282 lang_statement_union_type
**field
)
7284 *(list
->tail
) = element
;
7288 /* Set the output format type. -oformat overrides scripts. */
7291 lang_add_output_format (const char *format
,
7296 if (output_target
== NULL
|| !from_script
)
7298 if (command_line
.endian
== ENDIAN_BIG
7301 else if (command_line
.endian
== ENDIAN_LITTLE
7305 output_target
= format
;
7310 lang_add_insert (const char *where
, int is_before
)
7312 lang_insert_statement_type
*new_stmt
;
7314 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7315 new_stmt
->where
= where
;
7316 new_stmt
->is_before
= is_before
;
7317 saved_script_handle
= previous_script_handle
;
7320 /* Enter a group. This creates a new lang_group_statement, and sets
7321 stat_ptr to build new statements within the group. */
7324 lang_enter_group (void)
7326 lang_group_statement_type
*g
;
7328 g
= new_stat (lang_group_statement
, stat_ptr
);
7329 lang_list_init (&g
->children
);
7330 push_stat_ptr (&g
->children
);
7333 /* Leave a group. This just resets stat_ptr to start writing to the
7334 regular list of statements again. Note that this will not work if
7335 groups can occur inside anything else which can adjust stat_ptr,
7336 but currently they can't. */
7339 lang_leave_group (void)
7344 /* Add a new program header. This is called for each entry in a PHDRS
7345 command in a linker script. */
7348 lang_new_phdr (const char *name
,
7350 bfd_boolean filehdr
,
7355 struct lang_phdr
*n
, **pp
;
7358 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7361 n
->type
= exp_get_value_int (type
, 0, "program header type");
7362 n
->filehdr
= filehdr
;
7367 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7369 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7372 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7374 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported"
7375 " when prior PT_LOAD headers lack them\n"), NULL
);
7382 /* Record the program header information in the output BFD. FIXME: We
7383 should not be calling an ELF specific function here. */
7386 lang_record_phdrs (void)
7390 lang_output_section_phdr_list
*last
;
7391 struct lang_phdr
*l
;
7392 lang_output_section_statement_type
*os
;
7395 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7398 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7405 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7409 lang_output_section_phdr_list
*pl
;
7411 if (os
->constraint
< 0)
7419 if (os
->sectype
== noload_section
7420 || os
->bfd_section
== NULL
7421 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7424 /* Don't add orphans to PT_INTERP header. */
7430 lang_output_section_statement_type
*tmp_os
;
7432 /* If we have not run across a section with a program
7433 header assigned to it yet, then scan forwards to find
7434 one. This prevents inconsistencies in the linker's
7435 behaviour when a script has specified just a single
7436 header and there are sections in that script which are
7437 not assigned to it, and which occur before the first
7438 use of that header. See here for more details:
7439 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7440 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7443 last
= tmp_os
->phdrs
;
7447 einfo (_("%F%P: no sections assigned to phdrs\n"));
7452 if (os
->bfd_section
== NULL
)
7455 for (; pl
!= NULL
; pl
= pl
->next
)
7457 if (strcmp (pl
->name
, l
->name
) == 0)
7462 secs
= (asection
**) xrealloc (secs
,
7463 alc
* sizeof (asection
*));
7465 secs
[c
] = os
->bfd_section
;
7472 if (l
->flags
== NULL
)
7475 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7480 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7482 if (!bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7483 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7484 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7485 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7490 /* Make sure all the phdr assignments succeeded. */
7491 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7495 lang_output_section_phdr_list
*pl
;
7497 if (os
->constraint
< 0
7498 || os
->bfd_section
== NULL
)
7501 for (pl
= os
->phdrs
;
7504 if (!pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7505 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7506 os
->name
, pl
->name
);
7510 /* Record a list of sections which may not be cross referenced. */
7513 lang_add_nocrossref (lang_nocrossref_type
*l
)
7515 struct lang_nocrossrefs
*n
;
7517 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7518 n
->next
= nocrossref_list
;
7520 n
->onlyfirst
= FALSE
;
7521 nocrossref_list
= n
;
7523 /* Set notice_all so that we get informed about all symbols. */
7524 link_info
.notice_all
= TRUE
;
7527 /* Record a section that cannot be referenced from a list of sections. */
7530 lang_add_nocrossref_to (lang_nocrossref_type
*l
)
7532 lang_add_nocrossref (l
);
7533 nocrossref_list
->onlyfirst
= TRUE
;
7536 /* Overlay handling. We handle overlays with some static variables. */
7538 /* The overlay virtual address. */
7539 static etree_type
*overlay_vma
;
7540 /* And subsection alignment. */
7541 static etree_type
*overlay_subalign
;
7543 /* An expression for the maximum section size seen so far. */
7544 static etree_type
*overlay_max
;
7546 /* A list of all the sections in this overlay. */
7548 struct overlay_list
{
7549 struct overlay_list
*next
;
7550 lang_output_section_statement_type
*os
;
7553 static struct overlay_list
*overlay_list
;
7555 /* Start handling an overlay. */
7558 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7560 /* The grammar should prevent nested overlays from occurring. */
7561 ASSERT (overlay_vma
== NULL
7562 && overlay_subalign
== NULL
7563 && overlay_max
== NULL
);
7565 overlay_vma
= vma_expr
;
7566 overlay_subalign
= subalign
;
7569 /* Start a section in an overlay. We handle this by calling
7570 lang_enter_output_section_statement with the correct VMA.
7571 lang_leave_overlay sets up the LMA and memory regions. */
7574 lang_enter_overlay_section (const char *name
)
7576 struct overlay_list
*n
;
7579 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7580 0, overlay_subalign
, 0, 0, 0);
7582 /* If this is the first section, then base the VMA of future
7583 sections on this one. This will work correctly even if `.' is
7584 used in the addresses. */
7585 if (overlay_list
== NULL
)
7586 overlay_vma
= exp_nameop (ADDR
, name
);
7588 /* Remember the section. */
7589 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7590 n
->os
= current_section
;
7591 n
->next
= overlay_list
;
7594 size
= exp_nameop (SIZEOF
, name
);
7596 /* Arrange to work out the maximum section end address. */
7597 if (overlay_max
== NULL
)
7600 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7603 /* Finish a section in an overlay. There isn't any special to do
7607 lang_leave_overlay_section (fill_type
*fill
,
7608 lang_output_section_phdr_list
*phdrs
)
7615 name
= current_section
->name
;
7617 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7618 region and that no load-time region has been specified. It doesn't
7619 really matter what we say here, since lang_leave_overlay will
7621 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7623 /* Define the magic symbols. */
7625 clean
= (char *) xmalloc (strlen (name
) + 1);
7627 for (s1
= name
; *s1
!= '\0'; s1
++)
7628 if (ISALNUM (*s1
) || *s1
== '_')
7632 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7633 sprintf (buf
, "__load_start_%s", clean
);
7634 lang_add_assignment (exp_provide (buf
,
7635 exp_nameop (LOADADDR
, name
),
7638 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7639 sprintf (buf
, "__load_stop_%s", clean
);
7640 lang_add_assignment (exp_provide (buf
,
7642 exp_nameop (LOADADDR
, name
),
7643 exp_nameop (SIZEOF
, name
)),
7649 /* Finish an overlay. If there are any overlay wide settings, this
7650 looks through all the sections in the overlay and sets them. */
7653 lang_leave_overlay (etree_type
*lma_expr
,
7656 const char *memspec
,
7657 lang_output_section_phdr_list
*phdrs
,
7658 const char *lma_memspec
)
7660 lang_memory_region_type
*region
;
7661 lang_memory_region_type
*lma_region
;
7662 struct overlay_list
*l
;
7663 lang_nocrossref_type
*nocrossref
;
7665 lang_get_regions (®ion
, &lma_region
,
7666 memspec
, lma_memspec
,
7667 lma_expr
!= NULL
, FALSE
);
7671 /* After setting the size of the last section, set '.' to end of the
7673 if (overlay_list
!= NULL
)
7675 overlay_list
->os
->update_dot
= 1;
7676 overlay_list
->os
->update_dot_tree
7677 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
), FALSE
);
7683 struct overlay_list
*next
;
7685 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7688 l
->os
->region
= region
;
7689 l
->os
->lma_region
= lma_region
;
7691 /* The first section has the load address specified in the
7692 OVERLAY statement. The rest are worked out from that.
7693 The base address is not needed (and should be null) if
7694 an LMA region was specified. */
7697 l
->os
->load_base
= lma_expr
;
7698 l
->os
->sectype
= normal_section
;
7700 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7701 l
->os
->phdrs
= phdrs
;
7705 lang_nocrossref_type
*nc
;
7707 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7708 nc
->name
= l
->os
->name
;
7709 nc
->next
= nocrossref
;
7718 if (nocrossref
!= NULL
)
7719 lang_add_nocrossref (nocrossref
);
7722 overlay_list
= NULL
;
7726 /* Version handling. This is only useful for ELF. */
7728 /* If PREV is NULL, return first version pattern matching particular symbol.
7729 If PREV is non-NULL, return first version pattern matching particular
7730 symbol after PREV (previously returned by lang_vers_match). */
7732 static struct bfd_elf_version_expr
*
7733 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7734 struct bfd_elf_version_expr
*prev
,
7738 const char *cxx_sym
= sym
;
7739 const char *java_sym
= sym
;
7740 struct bfd_elf_version_expr
*expr
= NULL
;
7741 enum demangling_styles curr_style
;
7743 curr_style
= CURRENT_DEMANGLING_STYLE
;
7744 cplus_demangle_set_style (no_demangling
);
7745 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7748 cplus_demangle_set_style (curr_style
);
7750 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7752 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7753 DMGL_PARAMS
| DMGL_ANSI
);
7757 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7759 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7764 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7766 struct bfd_elf_version_expr e
;
7768 switch (prev
? prev
->mask
: 0)
7771 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7774 expr
= (struct bfd_elf_version_expr
*)
7775 htab_find ((htab_t
) head
->htab
, &e
);
7776 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7777 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7783 case BFD_ELF_VERSION_C_TYPE
:
7784 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7786 e
.pattern
= cxx_sym
;
7787 expr
= (struct bfd_elf_version_expr
*)
7788 htab_find ((htab_t
) head
->htab
, &e
);
7789 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7790 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7796 case BFD_ELF_VERSION_CXX_TYPE
:
7797 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7799 e
.pattern
= java_sym
;
7800 expr
= (struct bfd_elf_version_expr
*)
7801 htab_find ((htab_t
) head
->htab
, &e
);
7802 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7803 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7814 /* Finally, try the wildcards. */
7815 if (prev
== NULL
|| prev
->literal
)
7816 expr
= head
->remaining
;
7819 for (; expr
; expr
= expr
->next
)
7826 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7829 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7831 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7835 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7841 free ((char *) c_sym
);
7843 free ((char *) cxx_sym
);
7844 if (java_sym
!= sym
)
7845 free ((char *) java_sym
);
7849 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7850 return a pointer to the symbol name with any backslash quotes removed. */
7853 realsymbol (const char *pattern
)
7856 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7857 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7859 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7861 /* It is a glob pattern only if there is no preceding
7865 /* Remove the preceding backslash. */
7872 if (*p
== '?' || *p
== '*' || *p
== '[')
7879 backslash
= *p
== '\\';
7895 /* This is called for each variable name or match expression. NEW_NAME is
7896 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7897 pattern to be matched against symbol names. */
7899 struct bfd_elf_version_expr
*
7900 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7901 const char *new_name
,
7903 bfd_boolean literal_p
)
7905 struct bfd_elf_version_expr
*ret
;
7907 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7911 ret
->literal
= TRUE
;
7912 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7913 if (ret
->pattern
== NULL
)
7915 ret
->pattern
= new_name
;
7916 ret
->literal
= FALSE
;
7919 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7920 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7921 else if (strcasecmp (lang
, "C++") == 0)
7922 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7923 else if (strcasecmp (lang
, "Java") == 0)
7924 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7927 einfo (_("%X%P: unknown language `%s' in version information\n"),
7929 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7932 return ldemul_new_vers_pattern (ret
);
7935 /* This is called for each set of variable names and match
7938 struct bfd_elf_version_tree
*
7939 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7940 struct bfd_elf_version_expr
*locals
)
7942 struct bfd_elf_version_tree
*ret
;
7944 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7945 ret
->globals
.list
= globals
;
7946 ret
->locals
.list
= locals
;
7947 ret
->match
= lang_vers_match
;
7948 ret
->name_indx
= (unsigned int) -1;
7952 /* This static variable keeps track of version indices. */
7954 static int version_index
;
7957 version_expr_head_hash (const void *p
)
7959 const struct bfd_elf_version_expr
*e
=
7960 (const struct bfd_elf_version_expr
*) p
;
7962 return htab_hash_string (e
->pattern
);
7966 version_expr_head_eq (const void *p1
, const void *p2
)
7968 const struct bfd_elf_version_expr
*e1
=
7969 (const struct bfd_elf_version_expr
*) p1
;
7970 const struct bfd_elf_version_expr
*e2
=
7971 (const struct bfd_elf_version_expr
*) p2
;
7973 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7977 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7980 struct bfd_elf_version_expr
*e
, *next
;
7981 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7983 for (e
= head
->list
; e
; e
= e
->next
)
7987 head
->mask
|= e
->mask
;
7992 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7993 version_expr_head_eq
, NULL
);
7994 list_loc
= &head
->list
;
7995 remaining_loc
= &head
->remaining
;
7996 for (e
= head
->list
; e
; e
= next
)
8002 remaining_loc
= &e
->next
;
8006 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
8010 struct bfd_elf_version_expr
*e1
, *last
;
8012 e1
= (struct bfd_elf_version_expr
*) *loc
;
8016 if (e1
->mask
== e
->mask
)
8024 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
8028 /* This is a duplicate. */
8029 /* FIXME: Memory leak. Sometimes pattern is not
8030 xmalloced alone, but in larger chunk of memory. */
8031 /* free (e->pattern); */
8036 e
->next
= last
->next
;
8044 list_loc
= &e
->next
;
8048 *remaining_loc
= NULL
;
8049 *list_loc
= head
->remaining
;
8052 head
->remaining
= head
->list
;
8055 /* This is called when we know the name and dependencies of the
8059 lang_register_vers_node (const char *name
,
8060 struct bfd_elf_version_tree
*version
,
8061 struct bfd_elf_version_deps
*deps
)
8063 struct bfd_elf_version_tree
*t
, **pp
;
8064 struct bfd_elf_version_expr
*e1
;
8069 if (link_info
.version_info
!= NULL
8070 && (name
[0] == '\0' || link_info
.version_info
->name
[0] == '\0'))
8072 einfo (_("%X%P: anonymous version tag cannot be combined"
8073 " with other version tags\n"));
8078 /* Make sure this node has a unique name. */
8079 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8080 if (strcmp (t
->name
, name
) == 0)
8081 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
8083 lang_finalize_version_expr_head (&version
->globals
);
8084 lang_finalize_version_expr_head (&version
->locals
);
8086 /* Check the global and local match names, and make sure there
8087 aren't any duplicates. */
8089 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
8091 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8093 struct bfd_elf_version_expr
*e2
;
8095 if (t
->locals
.htab
&& e1
->literal
)
8097 e2
= (struct bfd_elf_version_expr
*)
8098 htab_find ((htab_t
) t
->locals
.htab
, e1
);
8099 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8101 if (e1
->mask
== e2
->mask
)
8102 einfo (_("%X%P: duplicate expression `%s'"
8103 " in version information\n"), e1
->pattern
);
8107 else if (!e1
->literal
)
8108 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8109 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8110 && e1
->mask
== e2
->mask
)
8111 einfo (_("%X%P: duplicate expression `%s'"
8112 " in version information\n"), e1
->pattern
);
8116 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
8118 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8120 struct bfd_elf_version_expr
*e2
;
8122 if (t
->globals
.htab
&& e1
->literal
)
8124 e2
= (struct bfd_elf_version_expr
*)
8125 htab_find ((htab_t
) t
->globals
.htab
, e1
);
8126 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
8128 if (e1
->mask
== e2
->mask
)
8129 einfo (_("%X%P: duplicate expression `%s'"
8130 " in version information\n"),
8135 else if (!e1
->literal
)
8136 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
8137 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
8138 && e1
->mask
== e2
->mask
)
8139 einfo (_("%X%P: duplicate expression `%s'"
8140 " in version information\n"), e1
->pattern
);
8144 version
->deps
= deps
;
8145 version
->name
= name
;
8146 if (name
[0] != '\0')
8149 version
->vernum
= version_index
;
8152 version
->vernum
= 0;
8154 for (pp
= &link_info
.version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
8159 /* This is called when we see a version dependency. */
8161 struct bfd_elf_version_deps
*
8162 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
8164 struct bfd_elf_version_deps
*ret
;
8165 struct bfd_elf_version_tree
*t
;
8167 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
8170 for (t
= link_info
.version_info
; t
!= NULL
; t
= t
->next
)
8172 if (strcmp (t
->name
, name
) == 0)
8174 ret
->version_needed
= t
;
8179 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
8181 ret
->version_needed
= NULL
;
8186 lang_do_version_exports_section (void)
8188 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
8190 LANG_FOR_EACH_INPUT_STATEMENT (is
)
8192 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
8200 contents
= (char *) xmalloc (len
);
8201 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
8202 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
8205 while (p
< contents
+ len
)
8207 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
8208 p
= strchr (p
, '\0') + 1;
8211 /* Do not free the contents, as we used them creating the regex. */
8213 /* Do not include this section in the link. */
8214 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
8217 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
8218 lang_register_vers_node (command_line
.version_exports_section
,
8219 lang_new_vers_node (greg
, lreg
), NULL
);
8222 /* Evaluate LENGTH and ORIGIN parts of MEMORY spec */
8225 lang_do_memory_regions (void)
8227 lang_memory_region_type
*r
= lang_memory_region_list
;
8229 for (; r
!= NULL
; r
= r
->next
)
8233 exp_fold_tree_no_dot (r
->origin_exp
);
8234 if (expld
.result
.valid_p
)
8236 r
->origin
= expld
.result
.value
;
8237 r
->current
= r
->origin
;
8240 einfo (_("%F%P: invalid origin for memory region %s\n"),
8245 exp_fold_tree_no_dot (r
->length_exp
);
8246 if (expld
.result
.valid_p
)
8247 r
->length
= expld
.result
.value
;
8249 einfo (_("%F%P: invalid length for memory region %s\n"),
8256 lang_add_unique (const char *name
)
8258 struct unique_sections
*ent
;
8260 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
8261 if (strcmp (ent
->name
, name
) == 0)
8264 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
8265 ent
->name
= xstrdup (name
);
8266 ent
->next
= unique_section_list
;
8267 unique_section_list
= ent
;
8270 /* Append the list of dynamic symbols to the existing one. */
8273 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
8275 if (link_info
.dynamic_list
)
8277 struct bfd_elf_version_expr
*tail
;
8278 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
8280 tail
->next
= link_info
.dynamic_list
->head
.list
;
8281 link_info
.dynamic_list
->head
.list
= dynamic
;
8285 struct bfd_elf_dynamic_list
*d
;
8287 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
8288 d
->head
.list
= dynamic
;
8289 d
->match
= lang_vers_match
;
8290 link_info
.dynamic_list
= d
;
8294 /* Append the list of C++ typeinfo dynamic symbols to the existing
8298 lang_append_dynamic_list_cpp_typeinfo (void)
8300 const char *symbols
[] =
8302 "typeinfo name for*",
8305 struct bfd_elf_version_expr
*dynamic
= NULL
;
8308 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8309 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8312 lang_append_dynamic_list (dynamic
);
8315 /* Append the list of C++ operator new and delete dynamic symbols to the
8319 lang_append_dynamic_list_cpp_new (void)
8321 const char *symbols
[] =
8326 struct bfd_elf_version_expr
*dynamic
= NULL
;
8329 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
8330 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
8333 lang_append_dynamic_list (dynamic
);
8336 /* Scan a space and/or comma separated string of features. */
8339 lang_ld_feature (char *str
)
8347 while (*p
== ',' || ISSPACE (*p
))
8352 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8356 if (strcasecmp (p
, "SANE_EXPR") == 0)
8357 config
.sane_expr
= TRUE
;
8359 einfo (_("%X%P: unknown feature `%s'\n"), p
);
8365 /* Pretty print memory amount. */
8368 lang_print_memory_size (bfd_vma sz
)
8370 if ((sz
& 0x3fffffff) == 0)
8371 printf ("%10" BFD_VMA_FMT
"u GB", sz
>> 30);
8372 else if ((sz
& 0xfffff) == 0)
8373 printf ("%10" BFD_VMA_FMT
"u MB", sz
>> 20);
8374 else if ((sz
& 0x3ff) == 0)
8375 printf ("%10" BFD_VMA_FMT
"u KB", sz
>> 10);
8377 printf (" %10" BFD_VMA_FMT
"u B", sz
);
8380 /* Implement --print-memory-usage: disply per region memory usage. */
8383 lang_print_memory_usage (void)
8385 lang_memory_region_type
*r
;
8387 printf ("Memory region Used Size Region Size %%age Used\n");
8388 for (r
= lang_memory_region_list
; r
->next
!= NULL
; r
= r
->next
)
8390 bfd_vma used_length
= r
->current
- r
->origin
;
8393 printf ("%16s: ",r
->name_list
.name
);
8394 lang_print_memory_size (used_length
);
8395 lang_print_memory_size ((bfd_vma
) r
->length
);
8397 percent
= used_length
* 100.0 / r
->length
;
8399 printf (" %6.2f%%\n", percent
);