1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
4 Free Software Foundation, Inc.
6 This file is part of the GNU Binutils.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
25 #include "libiberty.h"
26 #include "filenames.h"
27 #include "safe-ctype.h"
47 #endif /* ENABLE_PLUGINS */
50 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
53 /* Locals variables. */
54 static struct obstack stat_obstack
;
55 static struct obstack map_obstack
;
57 #define obstack_chunk_alloc xmalloc
58 #define obstack_chunk_free free
59 static const char *entry_symbol_default
= "start";
60 static bfd_boolean placed_commons
= FALSE
;
61 static bfd_boolean stripped_excluded_sections
= FALSE
;
62 static lang_output_section_statement_type
*default_common_section
;
63 static bfd_boolean map_option_f
;
64 static bfd_vma print_dot
;
65 static lang_input_statement_type
*first_file
;
66 static const char *current_target
;
67 static lang_statement_list_type statement_list
;
68 static struct bfd_hash_table lang_definedness_table
;
69 static lang_statement_list_type
*stat_save
[10];
70 static lang_statement_list_type
**stat_save_ptr
= &stat_save
[0];
71 static struct unique_sections
*unique_section_list
;
72 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
74 /* Forward declarations. */
75 static void exp_init_os (etree_type
*);
76 static void init_map_userdata (bfd
*, asection
*, void *);
77 static lang_input_statement_type
*lookup_name (const char *);
78 static struct bfd_hash_entry
*lang_definedness_newfunc
79 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
80 static void insert_undefined (const char *);
81 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
82 static void print_statement (lang_statement_union_type
*,
83 lang_output_section_statement_type
*);
84 static void print_statement_list (lang_statement_union_type
*,
85 lang_output_section_statement_type
*);
86 static void print_statements (void);
87 static void print_input_section (asection
*, bfd_boolean
);
88 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
90 static void lang_list_insert_after (lang_statement_list_type
*destlist
,
91 lang_statement_list_type
*srclist
,
92 lang_statement_union_type
**field
);
93 static void lang_list_remove_tail (lang_statement_list_type
*destlist
,
94 lang_statement_list_type
*origlist
);
95 #endif /* ENABLE_PLUGINS */
96 static void lang_record_phdrs (void);
97 static void lang_do_version_exports_section (void);
98 static void lang_finalize_version_expr_head
99 (struct bfd_elf_version_expr_head
*);
101 /* Exported variables. */
102 const char *output_target
;
103 lang_output_section_statement_type
*abs_output_section
;
104 lang_statement_list_type lang_output_section_statement
;
105 lang_statement_list_type
*stat_ptr
= &statement_list
;
106 lang_statement_list_type file_chain
= { NULL
, NULL
};
107 lang_statement_list_type input_file_chain
;
108 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
109 const char *entry_section
= ".text";
110 bfd_boolean entry_from_cmdline
;
111 bfd_boolean undef_from_cmdline
;
112 bfd_boolean lang_has_input_file
= FALSE
;
113 bfd_boolean had_output_filename
= FALSE
;
114 bfd_boolean lang_float_flag
= FALSE
;
115 bfd_boolean delete_output_file_on_failure
= FALSE
;
116 struct lang_phdr
*lang_phdr_list
;
117 struct lang_nocrossrefs
*nocrossref_list
;
118 bfd_boolean missing_file
= FALSE
;
120 /* Functions that traverse the linker script and might evaluate
121 DEFINED() need to increment this. */
122 int lang_statement_iteration
= 0;
124 etree_type
*base
; /* Relocation base - or null */
126 /* Return TRUE if the PATTERN argument is a wildcard pattern.
127 Although backslashes are treated specially if a pattern contains
128 wildcards, we do not consider the mere presence of a backslash to
129 be enough to cause the pattern to be treated as a wildcard.
130 That lets us handle DOS filenames more naturally. */
131 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
133 #define new_stat(x, y) \
134 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
136 #define outside_section_address(q) \
137 ((q)->output_offset + (q)->output_section->vma)
139 #define outside_symbol_address(q) \
140 ((q)->value + outside_section_address (q->section))
142 #define SECTION_NAME_MAP_LENGTH (16)
145 stat_alloc (size_t size
)
147 return obstack_alloc (&stat_obstack
, size
);
151 name_match (const char *pattern
, const char *name
)
153 if (wildcardp (pattern
))
154 return fnmatch (pattern
, name
, 0);
155 return strcmp (pattern
, name
);
158 /* If PATTERN is of the form archive:file, return a pointer to the
159 separator. If not, return NULL. */
162 archive_path (const char *pattern
)
166 if (link_info
.path_separator
== 0)
169 p
= strchr (pattern
, link_info
.path_separator
);
170 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
171 if (p
== NULL
|| link_info
.path_separator
!= ':')
174 /* Assume a match on the second char is part of drive specifier,
175 as in "c:\silly.dos". */
176 if (p
== pattern
+ 1 && ISALPHA (*pattern
))
177 p
= strchr (p
+ 1, link_info
.path_separator
);
182 /* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
183 return whether F matches FILE_SPEC. */
186 input_statement_is_archive_path (const char *file_spec
, char *sep
,
187 lang_input_statement_type
*f
)
189 bfd_boolean match
= FALSE
;
192 || name_match (sep
+ 1, f
->filename
) == 0)
193 && ((sep
!= file_spec
)
194 == (f
->the_bfd
!= NULL
&& f
->the_bfd
->my_archive
!= NULL
)))
198 if (sep
!= file_spec
)
200 const char *aname
= f
->the_bfd
->my_archive
->filename
;
202 match
= name_match (file_spec
, aname
) == 0;
203 *sep
= link_info
.path_separator
;
210 unique_section_p (const asection
*sec
,
211 const lang_output_section_statement_type
*os
)
213 struct unique_sections
*unam
;
216 if (link_info
.relocatable
217 && sec
->owner
!= NULL
218 && bfd_is_group_section (sec
->owner
, sec
))
220 && strcmp (os
->name
, DISCARD_SECTION_NAME
) == 0);
223 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
224 if (name_match (unam
->name
, secnam
) == 0)
230 /* Generic traversal routines for finding matching sections. */
232 /* Try processing a section against a wildcard. This just calls
233 the callback unless the filename exclusion list is present
234 and excludes the file. It's hardly ever present so this
235 function is very fast. */
238 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
239 lang_input_statement_type
*file
,
241 struct wildcard_list
*sec
,
245 struct name_list
*list_tmp
;
247 /* Don't process sections from files which were excluded. */
248 for (list_tmp
= sec
->spec
.exclude_name_list
;
250 list_tmp
= list_tmp
->next
)
252 char *p
= archive_path (list_tmp
->name
);
256 if (input_statement_is_archive_path (list_tmp
->name
, p
, file
))
260 else if (name_match (list_tmp
->name
, file
->filename
) == 0)
263 /* FIXME: Perhaps remove the following at some stage? Matching
264 unadorned archives like this was never documented and has
265 been superceded by the archive:path syntax. */
266 else if (file
->the_bfd
!= NULL
267 && file
->the_bfd
->my_archive
!= NULL
268 && name_match (list_tmp
->name
,
269 file
->the_bfd
->my_archive
->filename
) == 0)
273 (*callback
) (ptr
, sec
, s
, file
, data
);
276 /* Lowest common denominator routine that can handle everything correctly,
280 walk_wild_section_general (lang_wild_statement_type
*ptr
,
281 lang_input_statement_type
*file
,
286 struct wildcard_list
*sec
;
288 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
290 sec
= ptr
->section_list
;
292 (*callback
) (ptr
, sec
, s
, file
, data
);
296 bfd_boolean skip
= FALSE
;
298 if (sec
->spec
.name
!= NULL
)
300 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
302 skip
= name_match (sec
->spec
.name
, sname
) != 0;
306 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
313 /* Routines to find a single section given its name. If there's more
314 than one section with that name, we report that. */
318 asection
*found_section
;
319 bfd_boolean multiple_sections_found
;
320 } section_iterator_callback_data
;
323 section_iterator_callback (bfd
*abfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
325 section_iterator_callback_data
*d
= (section_iterator_callback_data
*) data
;
327 if (d
->found_section
!= NULL
)
329 d
->multiple_sections_found
= TRUE
;
333 d
->found_section
= s
;
338 find_section (lang_input_statement_type
*file
,
339 struct wildcard_list
*sec
,
340 bfd_boolean
*multiple_sections_found
)
342 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
344 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
345 section_iterator_callback
, &cb_data
);
346 *multiple_sections_found
= cb_data
.multiple_sections_found
;
347 return cb_data
.found_section
;
350 /* Code for handling simple wildcards without going through fnmatch,
351 which can be expensive because of charset translations etc. */
353 /* A simple wild is a literal string followed by a single '*',
354 where the literal part is at least 4 characters long. */
357 is_simple_wild (const char *name
)
359 size_t len
= strcspn (name
, "*?[");
360 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
364 match_simple_wild (const char *pattern
, const char *name
)
366 /* The first four characters of the pattern are guaranteed valid
367 non-wildcard characters. So we can go faster. */
368 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
369 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
374 while (*pattern
!= '*')
375 if (*name
++ != *pattern
++)
381 /* Return the numerical value of the init_priority attribute from
382 section name NAME. */
385 get_init_priority (const char *name
)
388 unsigned long init_priority
;
390 /* GCC uses the following section names for the init_priority
391 attribute with numerical values 101 and 65535 inclusive. A
392 lower value means a higher priority.
394 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
395 decimal numerical value of the init_priority attribute.
396 The order of execution in .init_array is forward and
397 .fini_array is backward.
398 2: .ctors.NNNN/.ctors.NNNN: Where NNNN is 65535 minus the
399 decimal numerical value of the init_priority attribute.
400 The order of execution in .ctors is backward and .dtors
403 if (strncmp (name
, ".init_array.", 12) == 0
404 || strncmp (name
, ".fini_array.", 12) == 0)
406 init_priority
= strtoul (name
+ 12, &end
, 10);
407 return *end
? 0 : init_priority
;
409 else if (strncmp (name
, ".ctors.", 7) == 0
410 || strncmp (name
, ".dtors.", 7) == 0)
412 init_priority
= strtoul (name
+ 7, &end
, 10);
413 return *end
? 0 : 65535 - init_priority
;
419 /* Compare sections ASEC and BSEC according to SORT. */
422 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
425 unsigned long ainit_priority
, binit_priority
;
432 case by_init_priority
:
434 = get_init_priority (bfd_get_section_name (asec
->owner
, asec
));
436 = get_init_priority (bfd_get_section_name (bsec
->owner
, bsec
));
437 if (ainit_priority
== 0 || binit_priority
== 0)
439 ret
= ainit_priority
- binit_priority
;
445 case by_alignment_name
:
446 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
447 - bfd_section_alignment (asec
->owner
, asec
));
454 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
455 bfd_get_section_name (bsec
->owner
, bsec
));
458 case by_name_alignment
:
459 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
460 bfd_get_section_name (bsec
->owner
, bsec
));
466 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
467 - bfd_section_alignment (asec
->owner
, asec
));
474 /* Build a Binary Search Tree to sort sections, unlike insertion sort
475 used in wild_sort(). BST is considerably faster if the number of
476 of sections are large. */
478 static lang_section_bst_type
**
479 wild_sort_fast (lang_wild_statement_type
*wild
,
480 struct wildcard_list
*sec
,
481 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
484 lang_section_bst_type
**tree
;
487 if (!wild
->filenames_sorted
488 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
490 /* Append at the right end of tree. */
492 tree
= &((*tree
)->right
);
498 /* Find the correct node to append this section. */
499 if (compare_section (sec
->spec
.sorted
, section
, (*tree
)->section
) < 0)
500 tree
= &((*tree
)->left
);
502 tree
= &((*tree
)->right
);
508 /* Use wild_sort_fast to build a BST to sort sections. */
511 output_section_callback_fast (lang_wild_statement_type
*ptr
,
512 struct wildcard_list
*sec
,
514 lang_input_statement_type
*file
,
517 lang_section_bst_type
*node
;
518 lang_section_bst_type
**tree
;
519 lang_output_section_statement_type
*os
;
521 os
= (lang_output_section_statement_type
*) output
;
523 if (unique_section_p (section
, os
))
526 node
= (lang_section_bst_type
*) xmalloc (sizeof (lang_section_bst_type
));
529 node
->section
= section
;
531 tree
= wild_sort_fast (ptr
, sec
, file
, section
);
536 /* Convert a sorted sections' BST back to list form. */
539 output_section_callback_tree_to_list (lang_wild_statement_type
*ptr
,
540 lang_section_bst_type
*tree
,
544 output_section_callback_tree_to_list (ptr
, tree
->left
, output
);
546 lang_add_section (&ptr
->children
, tree
->section
,
547 (lang_output_section_statement_type
*) output
);
550 output_section_callback_tree_to_list (ptr
, tree
->right
, output
);
555 /* Specialized, optimized routines for handling different kinds of
559 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
560 lang_input_statement_type
*file
,
564 /* We can just do a hash lookup for the section with the right name.
565 But if that lookup discovers more than one section with the name
566 (should be rare), we fall back to the general algorithm because
567 we would otherwise have to sort the sections to make sure they
568 get processed in the bfd's order. */
569 bfd_boolean multiple_sections_found
;
570 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
571 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
573 if (multiple_sections_found
)
574 walk_wild_section_general (ptr
, file
, callback
, data
);
576 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
580 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
581 lang_input_statement_type
*file
,
586 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
588 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
590 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
591 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
594 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
599 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
600 lang_input_statement_type
*file
,
605 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
606 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
607 bfd_boolean multiple_sections_found
;
608 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
610 if (multiple_sections_found
)
612 walk_wild_section_general (ptr
, file
, callback
, data
);
616 /* Note that if the section was not found, s0 is NULL and
617 we'll simply never succeed the s == s0 test below. */
618 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
620 /* Recall that in this code path, a section cannot satisfy more
621 than one spec, so if s == s0 then it cannot match
624 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
627 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
628 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
631 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
638 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
639 lang_input_statement_type
*file
,
644 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
645 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
646 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
647 bfd_boolean multiple_sections_found
;
648 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
650 if (multiple_sections_found
)
652 walk_wild_section_general (ptr
, file
, callback
, data
);
656 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
659 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
662 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
663 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
666 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
669 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
671 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
679 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
680 lang_input_statement_type
*file
,
685 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
686 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
687 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
688 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
689 bfd_boolean multiple_sections_found
;
690 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
692 if (multiple_sections_found
)
694 walk_wild_section_general (ptr
, file
, callback
, data
);
698 s1
= find_section (file
, sec1
, &multiple_sections_found
);
699 if (multiple_sections_found
)
701 walk_wild_section_general (ptr
, file
, callback
, data
);
705 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
708 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
711 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
714 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
715 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
719 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
723 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
725 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
733 walk_wild_section (lang_wild_statement_type
*ptr
,
734 lang_input_statement_type
*file
,
738 if (file
->just_syms_flag
)
741 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
744 /* Returns TRUE when name1 is a wildcard spec that might match
745 something name2 can match. We're conservative: we return FALSE
746 only if the prefixes of name1 and name2 are different up to the
747 first wildcard character. */
750 wild_spec_can_overlap (const char *name1
, const char *name2
)
752 size_t prefix1_len
= strcspn (name1
, "?*[");
753 size_t prefix2_len
= strcspn (name2
, "?*[");
754 size_t min_prefix_len
;
756 /* Note that if there is no wildcard character, then we treat the
757 terminating 0 as part of the prefix. Thus ".text" won't match
758 ".text." or ".text.*", for example. */
759 if (name1
[prefix1_len
] == '\0')
761 if (name2
[prefix2_len
] == '\0')
764 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
766 return memcmp (name1
, name2
, min_prefix_len
) == 0;
769 /* Select specialized code to handle various kinds of wildcard
773 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
776 int wild_name_count
= 0;
777 struct wildcard_list
*sec
;
781 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
782 ptr
->handler_data
[0] = NULL
;
783 ptr
->handler_data
[1] = NULL
;
784 ptr
->handler_data
[2] = NULL
;
785 ptr
->handler_data
[3] = NULL
;
788 /* Count how many wildcard_specs there are, and how many of those
789 actually use wildcards in the name. Also, bail out if any of the
790 wildcard names are NULL. (Can this actually happen?
791 walk_wild_section used to test for it.) And bail out if any
792 of the wildcards are more complex than a simple string
793 ending in a single '*'. */
794 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
797 if (sec
->spec
.name
== NULL
)
799 if (wildcardp (sec
->spec
.name
))
802 if (!is_simple_wild (sec
->spec
.name
))
807 /* The zero-spec case would be easy to optimize but it doesn't
808 happen in practice. Likewise, more than 4 specs doesn't
809 happen in practice. */
810 if (sec_count
== 0 || sec_count
> 4)
813 /* Check that no two specs can match the same section. */
814 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
816 struct wildcard_list
*sec2
;
817 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
819 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
824 signature
= (sec_count
<< 8) + wild_name_count
;
828 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
831 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
834 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
837 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
840 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
846 /* Now fill the data array with pointers to the specs, first the
847 specs with non-wildcard names, then the specs with wildcard
848 names. It's OK to process the specs in different order from the
849 given order, because we've already determined that no section
850 will match more than one spec. */
852 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
853 if (!wildcardp (sec
->spec
.name
))
854 ptr
->handler_data
[data_counter
++] = sec
;
855 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
856 if (wildcardp (sec
->spec
.name
))
857 ptr
->handler_data
[data_counter
++] = sec
;
860 /* Handle a wild statement for a single file F. */
863 walk_wild_file (lang_wild_statement_type
*s
,
864 lang_input_statement_type
*f
,
868 if (f
->the_bfd
== NULL
869 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
870 walk_wild_section (s
, f
, callback
, data
);
875 /* This is an archive file. We must map each member of the
876 archive separately. */
877 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
878 while (member
!= NULL
)
880 /* When lookup_name is called, it will call the add_symbols
881 entry point for the archive. For each element of the
882 archive which is included, BFD will call ldlang_add_file,
883 which will set the usrdata field of the member to the
884 lang_input_statement. */
885 if (member
->usrdata
!= NULL
)
887 walk_wild_section (s
,
888 (lang_input_statement_type
*) member
->usrdata
,
892 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
898 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
900 const char *file_spec
= s
->filename
;
903 if (file_spec
== NULL
)
905 /* Perform the iteration over all files in the list. */
906 LANG_FOR_EACH_INPUT_STATEMENT (f
)
908 walk_wild_file (s
, f
, callback
, data
);
911 else if ((p
= archive_path (file_spec
)) != NULL
)
913 LANG_FOR_EACH_INPUT_STATEMENT (f
)
915 if (input_statement_is_archive_path (file_spec
, p
, f
))
916 walk_wild_file (s
, f
, callback
, data
);
919 else if (wildcardp (file_spec
))
921 LANG_FOR_EACH_INPUT_STATEMENT (f
)
923 if (fnmatch (file_spec
, f
->filename
, 0) == 0)
924 walk_wild_file (s
, f
, callback
, data
);
929 lang_input_statement_type
*f
;
931 /* Perform the iteration over a single file. */
932 f
= lookup_name (file_spec
);
934 walk_wild_file (s
, f
, callback
, data
);
938 /* lang_for_each_statement walks the parse tree and calls the provided
939 function for each node, except those inside output section statements
940 with constraint set to -1. */
943 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
944 lang_statement_union_type
*s
)
946 for (; s
!= NULL
; s
= s
->header
.next
)
950 switch (s
->header
.type
)
952 case lang_constructors_statement_enum
:
953 lang_for_each_statement_worker (func
, constructor_list
.head
);
955 case lang_output_section_statement_enum
:
956 if (s
->output_section_statement
.constraint
!= -1)
957 lang_for_each_statement_worker
958 (func
, s
->output_section_statement
.children
.head
);
960 case lang_wild_statement_enum
:
961 lang_for_each_statement_worker (func
,
962 s
->wild_statement
.children
.head
);
964 case lang_group_statement_enum
:
965 lang_for_each_statement_worker (func
,
966 s
->group_statement
.children
.head
);
968 case lang_data_statement_enum
:
969 case lang_reloc_statement_enum
:
970 case lang_object_symbols_statement_enum
:
971 case lang_output_statement_enum
:
972 case lang_target_statement_enum
:
973 case lang_input_section_enum
:
974 case lang_input_statement_enum
:
975 case lang_assignment_statement_enum
:
976 case lang_padding_statement_enum
:
977 case lang_address_statement_enum
:
978 case lang_fill_statement_enum
:
979 case lang_insert_statement_enum
:
989 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
991 lang_for_each_statement_worker (func
, statement_list
.head
);
994 /*----------------------------------------------------------------------*/
997 lang_list_init (lang_statement_list_type
*list
)
1000 list
->tail
= &list
->head
;
1004 push_stat_ptr (lang_statement_list_type
*new_ptr
)
1006 if (stat_save_ptr
>= stat_save
+ sizeof (stat_save
) / sizeof (stat_save
[0]))
1008 *stat_save_ptr
++ = stat_ptr
;
1015 if (stat_save_ptr
<= stat_save
)
1017 stat_ptr
= *--stat_save_ptr
;
1020 /* Build a new statement node for the parse tree. */
1022 static lang_statement_union_type
*
1023 new_statement (enum statement_enum type
,
1025 lang_statement_list_type
*list
)
1027 lang_statement_union_type
*new_stmt
;
1029 new_stmt
= (lang_statement_union_type
*) stat_alloc (size
);
1030 new_stmt
->header
.type
= type
;
1031 new_stmt
->header
.next
= NULL
;
1032 lang_statement_append (list
, new_stmt
, &new_stmt
->header
.next
);
1036 /* Build a new input file node for the language. There are several
1037 ways in which we treat an input file, eg, we only look at symbols,
1038 or prefix it with a -l etc.
1040 We can be supplied with requests for input files more than once;
1041 they may, for example be split over several lines like foo.o(.text)
1042 foo.o(.data) etc, so when asked for a file we check that we haven't
1043 got it already so we don't duplicate the bfd. */
1045 static lang_input_statement_type
*
1046 new_afile (const char *name
,
1047 lang_input_file_enum_type file_type
,
1049 bfd_boolean add_to_list
)
1051 lang_input_statement_type
*p
;
1054 p
= (lang_input_statement_type
*) new_stat (lang_input_statement
, stat_ptr
);
1057 p
= (lang_input_statement_type
*)
1058 stat_alloc (sizeof (lang_input_statement_type
));
1059 p
->header
.type
= lang_input_statement_enum
;
1060 p
->header
.next
= NULL
;
1063 lang_has_input_file
= TRUE
;
1065 p
->sysrooted
= FALSE
;
1067 if (file_type
== lang_input_file_is_l_enum
1068 && name
[0] == ':' && name
[1] != '\0')
1070 file_type
= lang_input_file_is_search_file_enum
;
1076 case lang_input_file_is_symbols_only_enum
:
1078 p
->maybe_archive
= FALSE
;
1080 p
->local_sym_name
= name
;
1081 p
->just_syms_flag
= TRUE
;
1082 p
->search_dirs_flag
= FALSE
;
1084 case lang_input_file_is_fake_enum
:
1086 p
->maybe_archive
= FALSE
;
1088 p
->local_sym_name
= name
;
1089 p
->just_syms_flag
= FALSE
;
1090 p
->search_dirs_flag
= FALSE
;
1092 case lang_input_file_is_l_enum
:
1093 p
->maybe_archive
= TRUE
;
1096 p
->local_sym_name
= concat ("-l", name
, (const char *) NULL
);
1097 p
->just_syms_flag
= FALSE
;
1098 p
->search_dirs_flag
= TRUE
;
1100 case lang_input_file_is_marker_enum
:
1102 p
->maybe_archive
= FALSE
;
1104 p
->local_sym_name
= name
;
1105 p
->just_syms_flag
= FALSE
;
1106 p
->search_dirs_flag
= TRUE
;
1108 case lang_input_file_is_search_file_enum
:
1109 p
->sysrooted
= ldlang_sysrooted_script
;
1111 p
->maybe_archive
= FALSE
;
1113 p
->local_sym_name
= name
;
1114 p
->just_syms_flag
= FALSE
;
1115 p
->search_dirs_flag
= TRUE
;
1117 case lang_input_file_is_file_enum
:
1119 p
->maybe_archive
= FALSE
;
1121 p
->local_sym_name
= name
;
1122 p
->just_syms_flag
= FALSE
;
1123 p
->search_dirs_flag
= FALSE
;
1129 p
->next_real_file
= NULL
;
1131 p
->dynamic
= config
.dynamic_link
;
1132 p
->add_DT_NEEDED_for_dynamic
= add_DT_NEEDED_for_dynamic
;
1133 p
->add_DT_NEEDED_for_regular
= add_DT_NEEDED_for_regular
;
1134 p
->whole_archive
= whole_archive
;
1136 p
->missing_file
= FALSE
;
1137 #ifdef ENABLE_PLUGINS
1139 p
->claim_archive
= FALSE
;
1140 #endif /* ENABLE_PLUGINS */
1142 lang_statement_append (&input_file_chain
,
1143 (lang_statement_union_type
*) p
,
1144 &p
->next_real_file
);
1148 lang_input_statement_type
*
1149 lang_add_input_file (const char *name
,
1150 lang_input_file_enum_type file_type
,
1153 return new_afile (name
, file_type
, target
, TRUE
);
1156 struct out_section_hash_entry
1158 struct bfd_hash_entry root
;
1159 lang_statement_union_type s
;
1162 /* The hash table. */
1164 static struct bfd_hash_table output_section_statement_table
;
1166 /* Support routines for the hash table used by lang_output_section_find,
1167 initialize the table, fill in an entry and remove the table. */
1169 static struct bfd_hash_entry
*
1170 output_section_statement_newfunc (struct bfd_hash_entry
*entry
,
1171 struct bfd_hash_table
*table
,
1174 lang_output_section_statement_type
**nextp
;
1175 struct out_section_hash_entry
*ret
;
1179 entry
= (struct bfd_hash_entry
*) bfd_hash_allocate (table
,
1185 entry
= bfd_hash_newfunc (entry
, table
, string
);
1189 ret
= (struct out_section_hash_entry
*) entry
;
1190 memset (&ret
->s
, 0, sizeof (ret
->s
));
1191 ret
->s
.header
.type
= lang_output_section_statement_enum
;
1192 ret
->s
.output_section_statement
.subsection_alignment
= -1;
1193 ret
->s
.output_section_statement
.section_alignment
= -1;
1194 ret
->s
.output_section_statement
.block_value
= 1;
1195 lang_list_init (&ret
->s
.output_section_statement
.children
);
1196 lang_statement_append (stat_ptr
, &ret
->s
, &ret
->s
.header
.next
);
1198 /* For every output section statement added to the list, except the
1199 first one, lang_output_section_statement.tail points to the "next"
1200 field of the last element of the list. */
1201 if (lang_output_section_statement
.head
!= NULL
)
1202 ret
->s
.output_section_statement
.prev
1203 = ((lang_output_section_statement_type
*)
1204 ((char *) lang_output_section_statement
.tail
1205 - offsetof (lang_output_section_statement_type
, next
)));
1207 /* GCC's strict aliasing rules prevent us from just casting the
1208 address, so we store the pointer in a variable and cast that
1210 nextp
= &ret
->s
.output_section_statement
.next
;
1211 lang_statement_append (&lang_output_section_statement
,
1213 (lang_statement_union_type
**) nextp
);
1218 output_section_statement_table_init (void)
1220 if (!bfd_hash_table_init_n (&output_section_statement_table
,
1221 output_section_statement_newfunc
,
1222 sizeof (struct out_section_hash_entry
),
1224 einfo (_("%P%F: can not create hash table: %E\n"));
1228 output_section_statement_table_free (void)
1230 bfd_hash_table_free (&output_section_statement_table
);
1233 /* Build enough state so that the parser can build its tree. */
1238 obstack_begin (&stat_obstack
, 1000);
1240 stat_ptr
= &statement_list
;
1242 output_section_statement_table_init ();
1244 lang_list_init (stat_ptr
);
1246 lang_list_init (&input_file_chain
);
1247 lang_list_init (&lang_output_section_statement
);
1248 lang_list_init (&file_chain
);
1249 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
1251 abs_output_section
=
1252 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
, 0, TRUE
);
1254 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
1256 /* The value "3" is ad-hoc, somewhat related to the expected number of
1257 DEFINED expressions in a linker script. For most default linker
1258 scripts, there are none. Why a hash table then? Well, it's somewhat
1259 simpler to re-use working machinery than using a linked list in terms
1260 of code-complexity here in ld, besides the initialization which just
1261 looks like other code here. */
1262 if (!bfd_hash_table_init_n (&lang_definedness_table
,
1263 lang_definedness_newfunc
,
1264 sizeof (struct lang_definedness_hash_entry
),
1266 einfo (_("%P%F: can not create hash table: %E\n"));
1272 output_section_statement_table_free ();
1275 /*----------------------------------------------------------------------
1276 A region is an area of memory declared with the
1277 MEMORY { name:org=exp, len=exp ... }
1280 We maintain a list of all the regions here.
1282 If no regions are specified in the script, then the default is used
1283 which is created when looked up to be the entire data space.
1285 If create is true we are creating a region inside a MEMORY block.
1286 In this case it is probably an error to create a region that has
1287 already been created. If we are not inside a MEMORY block it is
1288 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1289 and so we issue a warning.
1291 Each region has at least one name. The first name is either
1292 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1293 alias names to an existing region within a script with
1294 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1297 static lang_memory_region_type
*lang_memory_region_list
;
1298 static lang_memory_region_type
**lang_memory_region_list_tail
1299 = &lang_memory_region_list
;
1301 lang_memory_region_type
*
1302 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1304 lang_memory_region_name
*n
;
1305 lang_memory_region_type
*r
;
1306 lang_memory_region_type
*new_region
;
1308 /* NAME is NULL for LMA memspecs if no region was specified. */
1312 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1313 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1314 if (strcmp (n
->name
, name
) == 0)
1317 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1322 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1323 einfo (_("%P:%S: warning: memory region `%s' not declared\n"), name
);
1325 new_region
= (lang_memory_region_type
*)
1326 stat_alloc (sizeof (lang_memory_region_type
));
1328 new_region
->name_list
.name
= xstrdup (name
);
1329 new_region
->name_list
.next
= NULL
;
1330 new_region
->next
= NULL
;
1331 new_region
->origin
= 0;
1332 new_region
->length
= ~(bfd_size_type
) 0;
1333 new_region
->current
= 0;
1334 new_region
->last_os
= NULL
;
1335 new_region
->flags
= 0;
1336 new_region
->not_flags
= 0;
1337 new_region
->had_full_message
= FALSE
;
1339 *lang_memory_region_list_tail
= new_region
;
1340 lang_memory_region_list_tail
= &new_region
->next
;
1346 lang_memory_region_alias (const char * alias
, const char * region_name
)
1348 lang_memory_region_name
* n
;
1349 lang_memory_region_type
* r
;
1350 lang_memory_region_type
* region
;
1352 /* The default region must be unique. This ensures that it is not necessary
1353 to iterate through the name list if someone wants the check if a region is
1354 the default memory region. */
1355 if (strcmp (region_name
, DEFAULT_MEMORY_REGION
) == 0
1356 || strcmp (alias
, DEFAULT_MEMORY_REGION
) == 0)
1357 einfo (_("%F%P:%S: error: alias for default memory region\n"));
1359 /* Look for the target region and check if the alias is not already
1362 for (r
= lang_memory_region_list
; r
!= NULL
; r
= r
->next
)
1363 for (n
= &r
->name_list
; n
!= NULL
; n
= n
->next
)
1365 if (region
== NULL
&& strcmp (n
->name
, region_name
) == 0)
1367 if (strcmp (n
->name
, alias
) == 0)
1368 einfo (_("%F%P:%S: error: redefinition of memory region "
1373 /* Check if the target region exists. */
1375 einfo (_("%F%P:%S: error: memory region `%s' "
1376 "for alias `%s' does not exist\n"),
1380 /* Add alias to region name list. */
1381 n
= (lang_memory_region_name
*) stat_alloc (sizeof (lang_memory_region_name
));
1382 n
->name
= xstrdup (alias
);
1383 n
->next
= region
->name_list
.next
;
1384 region
->name_list
.next
= n
;
1387 static lang_memory_region_type
*
1388 lang_memory_default (asection
* section
)
1390 lang_memory_region_type
*p
;
1392 flagword sec_flags
= section
->flags
;
1394 /* Override SEC_DATA to mean a writable section. */
1395 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1396 sec_flags
|= SEC_DATA
;
1398 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1400 if ((p
->flags
& sec_flags
) != 0
1401 && (p
->not_flags
& sec_flags
) == 0)
1406 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1409 /* Find or create an output_section_statement with the given NAME.
1410 If CONSTRAINT is non-zero match one with that constraint, otherwise
1411 match any non-negative constraint. If CREATE, always make a
1412 new output_section_statement for SPECIAL CONSTRAINT. */
1414 lang_output_section_statement_type
*
1415 lang_output_section_statement_lookup (const char *name
,
1419 struct out_section_hash_entry
*entry
;
1421 entry
= ((struct out_section_hash_entry
*)
1422 bfd_hash_lookup (&output_section_statement_table
, name
,
1427 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1431 if (entry
->s
.output_section_statement
.name
!= NULL
)
1433 /* We have a section of this name, but it might not have the correct
1435 struct out_section_hash_entry
*last_ent
;
1437 name
= entry
->s
.output_section_statement
.name
;
1438 if (create
&& constraint
== SPECIAL
)
1439 /* Not traversing to the end reverses the order of the second
1440 and subsequent SPECIAL sections in the hash table chain,
1441 but that shouldn't matter. */
1446 if (constraint
== entry
->s
.output_section_statement
.constraint
1448 && entry
->s
.output_section_statement
.constraint
>= 0))
1449 return &entry
->s
.output_section_statement
;
1451 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1453 while (entry
!= NULL
1454 && name
== entry
->s
.output_section_statement
.name
);
1460 = ((struct out_section_hash_entry
*)
1461 output_section_statement_newfunc (NULL
,
1462 &output_section_statement_table
,
1466 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1469 entry
->root
= last_ent
->root
;
1470 last_ent
->root
.next
= &entry
->root
;
1473 entry
->s
.output_section_statement
.name
= name
;
1474 entry
->s
.output_section_statement
.constraint
= constraint
;
1475 return &entry
->s
.output_section_statement
;
1478 /* Find the next output_section_statement with the same name as OS.
1479 If CONSTRAINT is non-zero, find one with that constraint otherwise
1480 match any non-negative constraint. */
1482 lang_output_section_statement_type
*
1483 next_matching_output_section_statement (lang_output_section_statement_type
*os
,
1486 /* All output_section_statements are actually part of a
1487 struct out_section_hash_entry. */
1488 struct out_section_hash_entry
*entry
= (struct out_section_hash_entry
*)
1490 - offsetof (struct out_section_hash_entry
, s
.output_section_statement
));
1491 const char *name
= os
->name
;
1493 ASSERT (name
== entry
->root
.string
);
1496 entry
= (struct out_section_hash_entry
*) entry
->root
.next
;
1498 || name
!= entry
->s
.output_section_statement
.name
)
1501 while (constraint
!= entry
->s
.output_section_statement
.constraint
1503 || entry
->s
.output_section_statement
.constraint
< 0));
1505 return &entry
->s
.output_section_statement
;
1508 /* A variant of lang_output_section_find used by place_orphan.
1509 Returns the output statement that should precede a new output
1510 statement for SEC. If an exact match is found on certain flags,
1513 lang_output_section_statement_type
*
1514 lang_output_section_find_by_flags (const asection
*sec
,
1515 lang_output_section_statement_type
**exact
,
1516 lang_match_sec_type_func match_type
)
1518 lang_output_section_statement_type
*first
, *look
, *found
;
1521 /* We know the first statement on this list is *ABS*. May as well
1523 first
= &lang_output_section_statement
.head
->output_section_statement
;
1524 first
= first
->next
;
1526 /* First try for an exact match. */
1528 for (look
= first
; look
; look
= look
->next
)
1530 flags
= look
->flags
;
1531 if (look
->bfd_section
!= NULL
)
1533 flags
= look
->bfd_section
->flags
;
1534 if (match_type
&& !match_type (link_info
.output_bfd
,
1539 flags
^= sec
->flags
;
1540 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1541 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1551 if ((sec
->flags
& SEC_CODE
) != 0
1552 && (sec
->flags
& SEC_ALLOC
) != 0)
1554 /* Try for a rw code section. */
1555 for (look
= first
; look
; look
= look
->next
)
1557 flags
= look
->flags
;
1558 if (look
->bfd_section
!= NULL
)
1560 flags
= look
->bfd_section
->flags
;
1561 if (match_type
&& !match_type (link_info
.output_bfd
,
1566 flags
^= sec
->flags
;
1567 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1568 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1572 else if ((sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
)) != 0
1573 && (sec
->flags
& SEC_ALLOC
) != 0)
1575 /* .rodata can go after .text, .sdata2 after .rodata. */
1576 for (look
= first
; look
; look
= look
->next
)
1578 flags
= look
->flags
;
1579 if (look
->bfd_section
!= NULL
)
1581 flags
= look
->bfd_section
->flags
;
1582 if (match_type
&& !match_type (link_info
.output_bfd
,
1587 flags
^= sec
->flags
;
1588 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1590 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1594 else if ((sec
->flags
& SEC_SMALL_DATA
) != 0
1595 && (sec
->flags
& SEC_ALLOC
) != 0)
1597 /* .sdata goes after .data, .sbss after .sdata. */
1598 for (look
= first
; look
; look
= look
->next
)
1600 flags
= look
->flags
;
1601 if (look
->bfd_section
!= NULL
)
1603 flags
= look
->bfd_section
->flags
;
1604 if (match_type
&& !match_type (link_info
.output_bfd
,
1609 flags
^= sec
->flags
;
1610 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1611 | SEC_THREAD_LOCAL
))
1612 || ((look
->flags
& SEC_SMALL_DATA
)
1613 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1617 else if ((sec
->flags
& SEC_HAS_CONTENTS
) != 0
1618 && (sec
->flags
& SEC_ALLOC
) != 0)
1620 /* .data goes after .rodata. */
1621 for (look
= first
; look
; look
= look
->next
)
1623 flags
= look
->flags
;
1624 if (look
->bfd_section
!= NULL
)
1626 flags
= look
->bfd_section
->flags
;
1627 if (match_type
&& !match_type (link_info
.output_bfd
,
1632 flags
^= sec
->flags
;
1633 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1634 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1638 else if ((sec
->flags
& SEC_ALLOC
) != 0)
1640 /* .bss goes after any other alloc section. */
1641 for (look
= first
; look
; look
= look
->next
)
1643 flags
= look
->flags
;
1644 if (look
->bfd_section
!= NULL
)
1646 flags
= look
->bfd_section
->flags
;
1647 if (match_type
&& !match_type (link_info
.output_bfd
,
1652 flags
^= sec
->flags
;
1653 if (!(flags
& SEC_ALLOC
))
1659 /* non-alloc go last. */
1660 for (look
= first
; look
; look
= look
->next
)
1662 flags
= look
->flags
;
1663 if (look
->bfd_section
!= NULL
)
1664 flags
= look
->bfd_section
->flags
;
1665 flags
^= sec
->flags
;
1666 if (!(flags
& SEC_DEBUGGING
))
1672 if (found
|| !match_type
)
1675 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1678 /* Find the last output section before given output statement.
1679 Used by place_orphan. */
1682 output_prev_sec_find (lang_output_section_statement_type
*os
)
1684 lang_output_section_statement_type
*lookup
;
1686 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1688 if (lookup
->constraint
< 0)
1691 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1692 return lookup
->bfd_section
;
1698 /* Look for a suitable place for a new output section statement. The
1699 idea is to skip over anything that might be inside a SECTIONS {}
1700 statement in a script, before we find another output section
1701 statement. Assignments to "dot" before an output section statement
1702 are assumed to belong to it, except in two cases; The first
1703 assignment to dot, and assignments before non-alloc sections.
1704 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1705 similar assignments that set the initial address, or we might
1706 insert non-alloc note sections among assignments setting end of
1709 static lang_statement_union_type
**
1710 insert_os_after (lang_output_section_statement_type
*after
)
1712 lang_statement_union_type
**where
;
1713 lang_statement_union_type
**assign
= NULL
;
1714 bfd_boolean ignore_first
;
1717 = after
== &lang_output_section_statement
.head
->output_section_statement
;
1719 for (where
= &after
->header
.next
;
1721 where
= &(*where
)->header
.next
)
1723 switch ((*where
)->header
.type
)
1725 case lang_assignment_statement_enum
:
1728 lang_assignment_statement_type
*ass
;
1730 ass
= &(*where
)->assignment_statement
;
1731 if (ass
->exp
->type
.node_class
!= etree_assert
1732 && ass
->exp
->assign
.dst
[0] == '.'
1733 && ass
->exp
->assign
.dst
[1] == 0
1737 ignore_first
= FALSE
;
1739 case lang_wild_statement_enum
:
1740 case lang_input_section_enum
:
1741 case lang_object_symbols_statement_enum
:
1742 case lang_fill_statement_enum
:
1743 case lang_data_statement_enum
:
1744 case lang_reloc_statement_enum
:
1745 case lang_padding_statement_enum
:
1746 case lang_constructors_statement_enum
:
1749 case lang_output_section_statement_enum
:
1752 asection
*s
= (*where
)->output_section_statement
.bfd_section
;
1755 || s
->map_head
.s
== NULL
1756 || (s
->flags
& SEC_ALLOC
) != 0)
1760 case lang_input_statement_enum
:
1761 case lang_address_statement_enum
:
1762 case lang_target_statement_enum
:
1763 case lang_output_statement_enum
:
1764 case lang_group_statement_enum
:
1765 case lang_insert_statement_enum
:
1774 lang_output_section_statement_type
*
1775 lang_insert_orphan (asection
*s
,
1776 const char *secname
,
1778 lang_output_section_statement_type
*after
,
1779 struct orphan_save
*place
,
1780 etree_type
*address
,
1781 lang_statement_list_type
*add_child
)
1783 lang_statement_list_type add
;
1785 lang_output_section_statement_type
*os
;
1786 lang_output_section_statement_type
**os_tail
;
1788 /* If we have found an appropriate place for the output section
1789 statements for this orphan, add them to our own private list,
1790 inserting them later into the global statement list. */
1793 lang_list_init (&add
);
1794 push_stat_ptr (&add
);
1797 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1798 address
= exp_intop (0);
1800 os_tail
= ((lang_output_section_statement_type
**)
1801 lang_output_section_statement
.tail
);
1802 os
= lang_enter_output_section_statement (secname
, address
, normal_section
,
1803 NULL
, NULL
, NULL
, constraint
);
1806 if (config
.build_constructors
&& *os_tail
== os
)
1808 /* If the name of the section is representable in C, then create
1809 symbols to mark the start and the end of the section. */
1810 for (ps
= secname
; *ps
!= '\0'; ps
++)
1811 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1816 etree_type
*e_align
;
1818 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1819 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1820 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1821 e_align
= exp_unop (ALIGN_K
,
1822 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1823 lang_add_assignment (exp_assign (".", e_align
));
1824 lang_add_assignment (exp_provide (symname
,
1826 exp_nameop (NAME
, ".")),
1831 if (add_child
== NULL
)
1832 add_child
= &os
->children
;
1833 lang_add_section (add_child
, s
, os
);
1835 if (after
&& (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) != 0)
1837 const char *region
= (after
->region
1838 ? after
->region
->name_list
.name
1839 : DEFAULT_MEMORY_REGION
);
1840 const char *lma_region
= (after
->lma_region
1841 ? after
->lma_region
->name_list
.name
1843 lang_leave_output_section_statement (NULL
, region
, after
->phdrs
,
1847 lang_leave_output_section_statement (NULL
, DEFAULT_MEMORY_REGION
, NULL
,
1850 if (ps
!= NULL
&& *ps
== '\0')
1854 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1855 symname
[0] = bfd_get_symbol_leading_char (link_info
.output_bfd
);
1856 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1857 lang_add_assignment (exp_provide (symname
,
1858 exp_nameop (NAME
, "."),
1862 /* Restore the global list pointer. */
1866 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1868 asection
*snew
, *as
;
1870 snew
= os
->bfd_section
;
1872 /* Shuffle the bfd section list to make the output file look
1873 neater. This is really only cosmetic. */
1874 if (place
->section
== NULL
1875 && after
!= (&lang_output_section_statement
.head
1876 ->output_section_statement
))
1878 asection
*bfd_section
= after
->bfd_section
;
1880 /* If the output statement hasn't been used to place any input
1881 sections (and thus doesn't have an output bfd_section),
1882 look for the closest prior output statement having an
1884 if (bfd_section
== NULL
)
1885 bfd_section
= output_prev_sec_find (after
);
1887 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1888 place
->section
= &bfd_section
->next
;
1891 if (place
->section
== NULL
)
1892 place
->section
= &link_info
.output_bfd
->sections
;
1894 as
= *place
->section
;
1898 /* Put the section at the end of the list. */
1900 /* Unlink the section. */
1901 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1903 /* Now tack it back on in the right place. */
1904 bfd_section_list_append (link_info
.output_bfd
, snew
);
1906 else if (as
!= snew
&& as
->prev
!= snew
)
1908 /* Unlink the section. */
1909 bfd_section_list_remove (link_info
.output_bfd
, snew
);
1911 /* Now tack it back on in the right place. */
1912 bfd_section_list_insert_before (link_info
.output_bfd
, as
, snew
);
1915 /* Save the end of this list. Further ophans of this type will
1916 follow the one we've just added. */
1917 place
->section
= &snew
->next
;
1919 /* The following is non-cosmetic. We try to put the output
1920 statements in some sort of reasonable order here, because they
1921 determine the final load addresses of the orphan sections.
1922 In addition, placing output statements in the wrong order may
1923 require extra segments. For instance, given a typical
1924 situation of all read-only sections placed in one segment and
1925 following that a segment containing all the read-write
1926 sections, we wouldn't want to place an orphan read/write
1927 section before or amongst the read-only ones. */
1928 if (add
.head
!= NULL
)
1930 lang_output_section_statement_type
*newly_added_os
;
1932 if (place
->stmt
== NULL
)
1934 lang_statement_union_type
**where
= insert_os_after (after
);
1939 place
->os_tail
= &after
->next
;
1943 /* Put it after the last orphan statement we added. */
1944 *add
.tail
= *place
->stmt
;
1945 *place
->stmt
= add
.head
;
1948 /* Fix the global list pointer if we happened to tack our
1949 new list at the tail. */
1950 if (*stat_ptr
->tail
== add
.head
)
1951 stat_ptr
->tail
= add
.tail
;
1953 /* Save the end of this list. */
1954 place
->stmt
= add
.tail
;
1956 /* Do the same for the list of output section statements. */
1957 newly_added_os
= *os_tail
;
1959 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1960 ((char *) place
->os_tail
1961 - offsetof (lang_output_section_statement_type
, next
));
1962 newly_added_os
->next
= *place
->os_tail
;
1963 if (newly_added_os
->next
!= NULL
)
1964 newly_added_os
->next
->prev
= newly_added_os
;
1965 *place
->os_tail
= newly_added_os
;
1966 place
->os_tail
= &newly_added_os
->next
;
1968 /* Fixing the global list pointer here is a little different.
1969 We added to the list in lang_enter_output_section_statement,
1970 trimmed off the new output_section_statment above when
1971 assigning *os_tail = NULL, but possibly added it back in
1972 the same place when assigning *place->os_tail. */
1973 if (*os_tail
== NULL
)
1974 lang_output_section_statement
.tail
1975 = (lang_statement_union_type
**) os_tail
;
1982 lang_map_flags (flagword flag
)
1984 if (flag
& SEC_ALLOC
)
1987 if (flag
& SEC_CODE
)
1990 if (flag
& SEC_READONLY
)
1993 if (flag
& SEC_DATA
)
1996 if (flag
& SEC_LOAD
)
2003 lang_memory_region_type
*m
;
2004 bfd_boolean dis_header_printed
= FALSE
;
2007 LANG_FOR_EACH_INPUT_STATEMENT (file
)
2011 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
2012 || file
->just_syms_flag
)
2015 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
2016 if ((s
->output_section
== NULL
2017 || s
->output_section
->owner
!= link_info
.output_bfd
)
2018 && (s
->flags
& (SEC_LINKER_CREATED
| SEC_KEEP
)) == 0)
2020 if (! dis_header_printed
)
2022 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
2023 dis_header_printed
= TRUE
;
2026 print_input_section (s
, TRUE
);
2030 minfo (_("\nMemory Configuration\n\n"));
2031 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
2032 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2034 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
2039 fprintf (config
.map_file
, "%-16s ", m
->name_list
.name
);
2041 sprintf_vma (buf
, m
->origin
);
2042 minfo ("0x%s ", buf
);
2050 minfo ("0x%V", m
->length
);
2051 if (m
->flags
|| m
->not_flags
)
2059 lang_map_flags (m
->flags
);
2065 lang_map_flags (m
->not_flags
);
2072 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
2074 if (! link_info
.reduce_memory_overheads
)
2076 obstack_begin (&map_obstack
, 1000);
2077 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
2078 bfd_map_over_sections (p
, init_map_userdata
, 0);
2079 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
2081 lang_statement_iteration
++;
2082 print_statements ();
2086 init_map_userdata (bfd
*abfd ATTRIBUTE_UNUSED
,
2088 void *data ATTRIBUTE_UNUSED
)
2090 fat_section_userdata_type
*new_data
2091 = ((fat_section_userdata_type
*) (stat_alloc
2092 (sizeof (fat_section_userdata_type
))));
2094 ASSERT (get_userdata (sec
) == NULL
);
2095 get_userdata (sec
) = new_data
;
2096 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
2097 new_data
->map_symbol_def_count
= 0;
2101 sort_def_symbol (struct bfd_link_hash_entry
*hash_entry
,
2102 void *info ATTRIBUTE_UNUSED
)
2104 if (hash_entry
->type
== bfd_link_hash_warning
)
2105 hash_entry
= (struct bfd_link_hash_entry
*) hash_entry
->u
.i
.link
;
2107 if (hash_entry
->type
== bfd_link_hash_defined
2108 || hash_entry
->type
== bfd_link_hash_defweak
)
2110 struct fat_user_section_struct
*ud
;
2111 struct map_symbol_def
*def
;
2113 ud
= (struct fat_user_section_struct
*)
2114 get_userdata (hash_entry
->u
.def
.section
);
2117 /* ??? What do we have to do to initialize this beforehand? */
2118 /* The first time we get here is bfd_abs_section... */
2119 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
2120 ud
= (struct fat_user_section_struct
*)
2121 get_userdata (hash_entry
->u
.def
.section
);
2123 else if (!ud
->map_symbol_def_tail
)
2124 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
2126 def
= (struct map_symbol_def
*) obstack_alloc (&map_obstack
, sizeof *def
);
2127 def
->entry
= hash_entry
;
2128 *(ud
->map_symbol_def_tail
) = def
;
2129 ud
->map_symbol_def_tail
= &def
->next
;
2130 ud
->map_symbol_def_count
++;
2135 /* Initialize an output section. */
2138 init_os (lang_output_section_statement_type
*s
, flagword flags
)
2140 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
2141 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
2143 if (s
->constraint
!= SPECIAL
)
2144 s
->bfd_section
= bfd_get_section_by_name (link_info
.output_bfd
, s
->name
);
2145 if (s
->bfd_section
== NULL
)
2146 s
->bfd_section
= bfd_make_section_anyway_with_flags (link_info
.output_bfd
,
2148 if (s
->bfd_section
== NULL
)
2150 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
2151 link_info
.output_bfd
->xvec
->name
, s
->name
);
2153 s
->bfd_section
->output_section
= s
->bfd_section
;
2154 s
->bfd_section
->output_offset
= 0;
2156 if (!link_info
.reduce_memory_overheads
)
2158 fat_section_userdata_type
*new_userdata
= (fat_section_userdata_type
*)
2159 stat_alloc (sizeof (fat_section_userdata_type
));
2160 memset (new_userdata
, 0, sizeof (fat_section_userdata_type
));
2161 get_userdata (s
->bfd_section
) = new_userdata
;
2164 /* If there is a base address, make sure that any sections it might
2165 mention are initialized. */
2166 if (s
->addr_tree
!= NULL
)
2167 exp_init_os (s
->addr_tree
);
2169 if (s
->load_base
!= NULL
)
2170 exp_init_os (s
->load_base
);
2172 /* If supplied an alignment, set it. */
2173 if (s
->section_alignment
!= -1)
2174 s
->bfd_section
->alignment_power
= s
->section_alignment
;
2177 /* Make sure that all output sections mentioned in an expression are
2181 exp_init_os (etree_type
*exp
)
2183 switch (exp
->type
.node_class
)
2187 exp_init_os (exp
->assign
.src
);
2191 exp_init_os (exp
->binary
.lhs
);
2192 exp_init_os (exp
->binary
.rhs
);
2196 exp_init_os (exp
->trinary
.cond
);
2197 exp_init_os (exp
->trinary
.lhs
);
2198 exp_init_os (exp
->trinary
.rhs
);
2202 exp_init_os (exp
->assert_s
.child
);
2206 exp_init_os (exp
->unary
.child
);
2210 switch (exp
->type
.node_code
)
2216 lang_output_section_statement_type
*os
;
2218 os
= lang_output_section_find (exp
->name
.name
);
2219 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2231 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
2233 lang_input_statement_type
*entry
= (lang_input_statement_type
*) data
;
2235 /* If we are only reading symbols from this object, then we want to
2236 discard all sections. */
2237 if (entry
->just_syms_flag
)
2239 bfd_link_just_syms (abfd
, sec
, &link_info
);
2243 if (!(abfd
->flags
& DYNAMIC
))
2244 bfd_section_already_linked (abfd
, sec
, &link_info
);
2247 /* The wild routines.
2249 These expand statements like *(.text) and foo.o to a list of
2250 explicit actions, like foo.o(.text), bar.o(.text) and
2251 foo.o(.text, .data). */
2253 /* Add SECTION to the output section OUTPUT. Do this by creating a
2254 lang_input_section statement which is placed at PTR. FILE is the
2255 input file which holds SECTION. */
2258 lang_add_section (lang_statement_list_type
*ptr
,
2260 lang_output_section_statement_type
*output
)
2262 flagword flags
= section
->flags
;
2263 bfd_boolean discard
;
2264 lang_input_section_type
*new_section
;
2266 /* Discard sections marked with SEC_EXCLUDE. */
2267 discard
= (flags
& SEC_EXCLUDE
) != 0;
2269 /* Discard input sections which are assigned to a section named
2270 DISCARD_SECTION_NAME. */
2271 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
2274 /* Discard debugging sections if we are stripping debugging
2276 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
2277 && (flags
& SEC_DEBUGGING
) != 0)
2282 if (section
->output_section
== NULL
)
2284 /* This prevents future calls from assigning this section. */
2285 section
->output_section
= bfd_abs_section_ptr
;
2290 if (section
->output_section
!= NULL
)
2293 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2294 to an output section, because we want to be able to include a
2295 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2296 section (I don't know why we want to do this, but we do).
2297 build_link_order in ldwrite.c handles this case by turning
2298 the embedded SEC_NEVER_LOAD section into a fill. */
2299 flags
&= ~ SEC_NEVER_LOAD
;
2301 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2302 already been processed. One reason to do this is that on pe
2303 format targets, .text$foo sections go into .text and it's odd
2304 to see .text with SEC_LINK_ONCE set. */
2306 if (!link_info
.relocatable
)
2307 flags
&= ~(SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
| SEC_RELOC
);
2309 switch (output
->sectype
)
2311 case normal_section
:
2312 case overlay_section
:
2314 case noalloc_section
:
2315 flags
&= ~SEC_ALLOC
;
2317 case noload_section
:
2319 flags
|= SEC_NEVER_LOAD
;
2320 /* Unfortunately GNU ld has managed to evolve two different
2321 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2322 alloc, no contents section. All others get a noload, noalloc
2324 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
2325 flags
&= ~SEC_HAS_CONTENTS
;
2327 flags
&= ~SEC_ALLOC
;
2331 if (output
->bfd_section
== NULL
)
2332 init_os (output
, flags
);
2334 /* If SEC_READONLY is not set in the input section, then clear
2335 it from the output section. */
2336 output
->bfd_section
->flags
&= flags
| ~SEC_READONLY
;
2338 if (output
->bfd_section
->linker_has_input
)
2340 /* Only set SEC_READONLY flag on the first input section. */
2341 flags
&= ~ SEC_READONLY
;
2343 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
2344 if ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
2345 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
2346 || ((flags
& SEC_MERGE
) != 0
2347 && output
->bfd_section
->entsize
!= section
->entsize
))
2349 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2350 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
2353 output
->bfd_section
->flags
|= flags
;
2355 if (!output
->bfd_section
->linker_has_input
)
2357 output
->bfd_section
->linker_has_input
= 1;
2358 /* This must happen after flags have been updated. The output
2359 section may have been created before we saw its first input
2360 section, eg. for a data statement. */
2361 bfd_init_private_section_data (section
->owner
, section
,
2362 link_info
.output_bfd
,
2363 output
->bfd_section
,
2365 if ((flags
& SEC_MERGE
) != 0)
2366 output
->bfd_section
->entsize
= section
->entsize
;
2369 if ((flags
& SEC_TIC54X_BLOCK
) != 0
2370 && bfd_get_arch (section
->owner
) == bfd_arch_tic54x
)
2372 /* FIXME: This value should really be obtained from the bfd... */
2373 output
->block_value
= 128;
2376 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
2377 output
->bfd_section
->alignment_power
= section
->alignment_power
;
2379 section
->output_section
= output
->bfd_section
;
2381 if (!link_info
.relocatable
2382 && !stripped_excluded_sections
)
2384 asection
*s
= output
->bfd_section
->map_tail
.s
;
2385 output
->bfd_section
->map_tail
.s
= section
;
2386 section
->map_head
.s
= NULL
;
2387 section
->map_tail
.s
= s
;
2389 s
->map_head
.s
= section
;
2391 output
->bfd_section
->map_head
.s
= section
;
2394 /* Add a section reference to the list. */
2395 new_section
= new_stat (lang_input_section
, ptr
);
2396 new_section
->section
= section
;
2399 /* Handle wildcard sorting. This returns the lang_input_section which
2400 should follow the one we are going to create for SECTION and FILE,
2401 based on the sorting requirements of WILD. It returns NULL if the
2402 new section should just go at the end of the current list. */
2404 static lang_statement_union_type
*
2405 wild_sort (lang_wild_statement_type
*wild
,
2406 struct wildcard_list
*sec
,
2407 lang_input_statement_type
*file
,
2410 lang_statement_union_type
*l
;
2412 if (!wild
->filenames_sorted
2413 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2416 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2418 lang_input_section_type
*ls
;
2420 if (l
->header
.type
!= lang_input_section_enum
)
2422 ls
= &l
->input_section
;
2424 /* Sorting by filename takes precedence over sorting by section
2427 if (wild
->filenames_sorted
)
2429 const char *fn
, *ln
;
2433 /* The PE support for the .idata section as generated by
2434 dlltool assumes that files will be sorted by the name of
2435 the archive and then the name of the file within the
2438 if (file
->the_bfd
!= NULL
2439 && bfd_my_archive (file
->the_bfd
) != NULL
)
2441 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2446 fn
= file
->filename
;
2450 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2452 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2457 ln
= ls
->section
->owner
->filename
;
2461 i
= filename_cmp (fn
, ln
);
2470 fn
= file
->filename
;
2472 ln
= ls
->section
->owner
->filename
;
2474 i
= filename_cmp (fn
, ln
);
2482 /* Here either the files are not sorted by name, or we are
2483 looking at the sections for this file. */
2485 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2486 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2493 /* Expand a wild statement for a particular FILE. SECTION may be
2494 NULL, in which case it is a wild card. */
2497 output_section_callback (lang_wild_statement_type
*ptr
,
2498 struct wildcard_list
*sec
,
2500 lang_input_statement_type
*file
,
2503 lang_statement_union_type
*before
;
2504 lang_output_section_statement_type
*os
;
2506 os
= (lang_output_section_statement_type
*) output
;
2508 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2509 if (unique_section_p (section
, os
))
2512 before
= wild_sort (ptr
, sec
, file
, section
);
2514 /* Here BEFORE points to the lang_input_section which
2515 should follow the one we are about to add. If BEFORE
2516 is NULL, then the section should just go at the end
2517 of the current list. */
2520 lang_add_section (&ptr
->children
, section
, os
);
2523 lang_statement_list_type list
;
2524 lang_statement_union_type
**pp
;
2526 lang_list_init (&list
);
2527 lang_add_section (&list
, section
, os
);
2529 /* If we are discarding the section, LIST.HEAD will
2531 if (list
.head
!= NULL
)
2533 ASSERT (list
.head
->header
.next
== NULL
);
2535 for (pp
= &ptr
->children
.head
;
2537 pp
= &(*pp
)->header
.next
)
2538 ASSERT (*pp
!= NULL
);
2540 list
.head
->header
.next
= *pp
;
2546 /* Check if all sections in a wild statement for a particular FILE
2550 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2551 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2553 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2556 lang_output_section_statement_type
*os
;
2558 os
= (lang_output_section_statement_type
*) output
;
2560 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2561 if (unique_section_p (section
, os
))
2564 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2565 os
->all_input_readonly
= FALSE
;
2568 /* This is passed a file name which must have been seen already and
2569 added to the statement tree. We will see if it has been opened
2570 already and had its symbols read. If not then we'll read it. */
2572 static lang_input_statement_type
*
2573 lookup_name (const char *name
)
2575 lang_input_statement_type
*search
;
2577 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2579 search
= (lang_input_statement_type
*) search
->next_real_file
)
2581 /* Use the local_sym_name as the name of the file that has
2582 already been loaded as filename might have been transformed
2583 via the search directory lookup mechanism. */
2584 const char *filename
= search
->local_sym_name
;
2586 if (filename
!= NULL
2587 && filename_cmp (filename
, name
) == 0)
2592 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2593 default_target
, FALSE
);
2595 /* If we have already added this file, or this file is not real
2596 don't add this file. */
2597 if (search
->loaded
|| !search
->real
)
2600 if (! load_symbols (search
, NULL
))
2606 /* Save LIST as a list of libraries whose symbols should not be exported. */
2611 struct excluded_lib
*next
;
2613 static struct excluded_lib
*excluded_libs
;
2616 add_excluded_libs (const char *list
)
2618 const char *p
= list
, *end
;
2622 struct excluded_lib
*entry
;
2623 end
= strpbrk (p
, ",:");
2625 end
= p
+ strlen (p
);
2626 entry
= (struct excluded_lib
*) xmalloc (sizeof (*entry
));
2627 entry
->next
= excluded_libs
;
2628 entry
->name
= (char *) xmalloc (end
- p
+ 1);
2629 memcpy (entry
->name
, p
, end
- p
);
2630 entry
->name
[end
- p
] = '\0';
2631 excluded_libs
= entry
;
2639 check_excluded_libs (bfd
*abfd
)
2641 struct excluded_lib
*lib
= excluded_libs
;
2645 int len
= strlen (lib
->name
);
2646 const char *filename
= lbasename (abfd
->filename
);
2648 if (strcmp (lib
->name
, "ALL") == 0)
2650 abfd
->no_export
= TRUE
;
2654 if (filename_ncmp (lib
->name
, filename
, len
) == 0
2655 && (filename
[len
] == '\0'
2656 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2657 && filename
[len
+ 2] == '\0')))
2659 abfd
->no_export
= TRUE
;
2667 /* Get the symbols for an input file. */
2670 load_symbols (lang_input_statement_type
*entry
,
2671 lang_statement_list_type
*place
)
2678 ldfile_open_file (entry
);
2680 /* Do not process further if the file was missing. */
2681 if (entry
->missing_file
)
2684 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2685 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2688 bfd_boolean save_ldlang_sysrooted_script
;
2689 bfd_boolean save_add_DT_NEEDED_for_regular
;
2690 bfd_boolean save_add_DT_NEEDED_for_dynamic
;
2691 bfd_boolean save_whole_archive
;
2693 err
= bfd_get_error ();
2695 /* See if the emulation has some special knowledge. */
2696 if (ldemul_unrecognized_file (entry
))
2699 if (err
== bfd_error_file_ambiguously_recognized
)
2703 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2704 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2705 for (p
= matching
; *p
!= NULL
; p
++)
2709 else if (err
!= bfd_error_file_not_recognized
2711 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2713 bfd_close (entry
->the_bfd
);
2714 entry
->the_bfd
= NULL
;
2716 /* Try to interpret the file as a linker script. */
2717 ldfile_open_command_file (entry
->filename
);
2719 push_stat_ptr (place
);
2720 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2721 ldlang_sysrooted_script
= entry
->sysrooted
;
2722 save_add_DT_NEEDED_for_regular
= add_DT_NEEDED_for_regular
;
2723 add_DT_NEEDED_for_regular
= entry
->add_DT_NEEDED_for_regular
;
2724 save_add_DT_NEEDED_for_dynamic
= add_DT_NEEDED_for_dynamic
;
2725 add_DT_NEEDED_for_dynamic
= entry
->add_DT_NEEDED_for_dynamic
;
2726 save_whole_archive
= whole_archive
;
2727 whole_archive
= entry
->whole_archive
;
2729 ldfile_assumed_script
= TRUE
;
2730 parser_input
= input_script
;
2731 /* We want to use the same -Bdynamic/-Bstatic as the one for
2733 config
.dynamic_link
= entry
->dynamic
;
2735 ldfile_assumed_script
= FALSE
;
2737 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2738 add_DT_NEEDED_for_regular
= save_add_DT_NEEDED_for_regular
;
2739 add_DT_NEEDED_for_dynamic
= save_add_DT_NEEDED_for_dynamic
;
2740 whole_archive
= save_whole_archive
;
2746 if (ldemul_recognized_file (entry
))
2749 /* We don't call ldlang_add_file for an archive. Instead, the
2750 add_symbols entry point will call ldlang_add_file, via the
2751 add_archive_element callback, for each element of the archive
2753 switch (bfd_get_format (entry
->the_bfd
))
2759 ldlang_add_file (entry
);
2760 if (trace_files
|| trace_file_tries
)
2761 info_msg ("%I\n", entry
);
2765 check_excluded_libs (entry
->the_bfd
);
2767 if (entry
->whole_archive
)
2770 bfd_boolean loaded
= TRUE
;
2775 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2780 if (! bfd_check_format (member
, bfd_object
))
2782 einfo (_("%F%B: member %B in archive is not an object\n"),
2783 entry
->the_bfd
, member
);
2788 if (!(*link_info
.callbacks
2789 ->add_archive_element
) (&link_info
, member
,
2790 "--whole-archive", &subsbfd
))
2793 /* Potentially, the add_archive_element hook may have set a
2794 substitute BFD for us. */
2795 if (!bfd_link_add_symbols (subsbfd
, &link_info
))
2797 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2802 entry
->loaded
= loaded
;
2808 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2809 entry
->loaded
= TRUE
;
2811 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2813 return entry
->loaded
;
2816 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2817 may be NULL, indicating that it is a wildcard. Separate
2818 lang_input_section statements are created for each part of the
2819 expansion; they are added after the wild statement S. OUTPUT is
2820 the output section. */
2823 wild (lang_wild_statement_type
*s
,
2824 const char *target ATTRIBUTE_UNUSED
,
2825 lang_output_section_statement_type
*output
)
2827 struct wildcard_list
*sec
;
2829 if (s
->handler_data
[0]
2830 && s
->handler_data
[0]->spec
.sorted
== by_name
2831 && !s
->filenames_sorted
)
2833 lang_section_bst_type
*tree
;
2835 walk_wild (s
, output_section_callback_fast
, output
);
2840 output_section_callback_tree_to_list (s
, tree
, output
);
2845 walk_wild (s
, output_section_callback
, output
);
2847 if (default_common_section
== NULL
)
2848 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2849 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2851 /* Remember the section that common is going to in case we
2852 later get something which doesn't know where to put it. */
2853 default_common_section
= output
;
2858 /* Return TRUE iff target is the sought target. */
2861 get_target (const bfd_target
*target
, void *data
)
2863 const char *sought
= (const char *) data
;
2865 return strcmp (target
->name
, sought
) == 0;
2868 /* Like strcpy() but convert to lower case as well. */
2871 stricpy (char *dest
, char *src
)
2875 while ((c
= *src
++) != 0)
2876 *dest
++ = TOLOWER (c
);
2881 /* Remove the first occurrence of needle (if any) in haystack
2885 strcut (char *haystack
, char *needle
)
2887 haystack
= strstr (haystack
, needle
);
2893 for (src
= haystack
+ strlen (needle
); *src
;)
2894 *haystack
++ = *src
++;
2900 /* Compare two target format name strings.
2901 Return a value indicating how "similar" they are. */
2904 name_compare (char *first
, char *second
)
2910 copy1
= (char *) xmalloc (strlen (first
) + 1);
2911 copy2
= (char *) xmalloc (strlen (second
) + 1);
2913 /* Convert the names to lower case. */
2914 stricpy (copy1
, first
);
2915 stricpy (copy2
, second
);
2917 /* Remove size and endian strings from the name. */
2918 strcut (copy1
, "big");
2919 strcut (copy1
, "little");
2920 strcut (copy2
, "big");
2921 strcut (copy2
, "little");
2923 /* Return a value based on how many characters match,
2924 starting from the beginning. If both strings are
2925 the same then return 10 * their length. */
2926 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2927 if (copy1
[result
] == 0)
2939 /* Set by closest_target_match() below. */
2940 static const bfd_target
*winner
;
2942 /* Scan all the valid bfd targets looking for one that has the endianness
2943 requirement that was specified on the command line, and is the nearest
2944 match to the original output target. */
2947 closest_target_match (const bfd_target
*target
, void *data
)
2949 const bfd_target
*original
= (const bfd_target
*) data
;
2951 if (command_line
.endian
== ENDIAN_BIG
2952 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2955 if (command_line
.endian
== ENDIAN_LITTLE
2956 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2959 /* Must be the same flavour. */
2960 if (target
->flavour
!= original
->flavour
)
2963 /* Ignore generic big and little endian elf vectors. */
2964 if (strcmp (target
->name
, "elf32-big") == 0
2965 || strcmp (target
->name
, "elf64-big") == 0
2966 || strcmp (target
->name
, "elf32-little") == 0
2967 || strcmp (target
->name
, "elf64-little") == 0)
2970 /* If we have not found a potential winner yet, then record this one. */
2977 /* Oh dear, we now have two potential candidates for a successful match.
2978 Compare their names and choose the better one. */
2979 if (name_compare (target
->name
, original
->name
)
2980 > name_compare (winner
->name
, original
->name
))
2983 /* Keep on searching until wqe have checked them all. */
2987 /* Return the BFD target format of the first input file. */
2990 get_first_input_target (void)
2992 char *target
= NULL
;
2994 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2996 if (s
->header
.type
== lang_input_statement_enum
2999 ldfile_open_file (s
);
3001 if (s
->the_bfd
!= NULL
3002 && bfd_check_format (s
->the_bfd
, bfd_object
))
3004 target
= bfd_get_target (s
->the_bfd
);
3016 lang_get_output_target (void)
3020 /* Has the user told us which output format to use? */
3021 if (output_target
!= NULL
)
3022 return output_target
;
3024 /* No - has the current target been set to something other than
3026 if (current_target
!= default_target
)
3027 return current_target
;
3029 /* No - can we determine the format of the first input file? */
3030 target
= get_first_input_target ();
3034 /* Failed - use the default output target. */
3035 return default_target
;
3038 /* Open the output file. */
3041 open_output (const char *name
)
3043 output_target
= lang_get_output_target ();
3045 /* Has the user requested a particular endianness on the command
3047 if (command_line
.endian
!= ENDIAN_UNSET
)
3049 const bfd_target
*target
;
3050 enum bfd_endian desired_endian
;
3052 /* Get the chosen target. */
3053 target
= bfd_search_for_target (get_target
, (void *) output_target
);
3055 /* If the target is not supported, we cannot do anything. */
3058 if (command_line
.endian
== ENDIAN_BIG
)
3059 desired_endian
= BFD_ENDIAN_BIG
;
3061 desired_endian
= BFD_ENDIAN_LITTLE
;
3063 /* See if the target has the wrong endianness. This should
3064 not happen if the linker script has provided big and
3065 little endian alternatives, but some scrips don't do
3067 if (target
->byteorder
!= desired_endian
)
3069 /* If it does, then see if the target provides
3070 an alternative with the correct endianness. */
3071 if (target
->alternative_target
!= NULL
3072 && (target
->alternative_target
->byteorder
== desired_endian
))
3073 output_target
= target
->alternative_target
->name
;
3076 /* Try to find a target as similar as possible to
3077 the default target, but which has the desired
3078 endian characteristic. */
3079 bfd_search_for_target (closest_target_match
,
3082 /* Oh dear - we could not find any targets that
3083 satisfy our requirements. */
3085 einfo (_("%P: warning: could not find any targets"
3086 " that match endianness requirement\n"));
3088 output_target
= winner
->name
;
3094 link_info
.output_bfd
= bfd_openw (name
, output_target
);
3096 if (link_info
.output_bfd
== NULL
)
3098 if (bfd_get_error () == bfd_error_invalid_target
)
3099 einfo (_("%P%F: target %s not found\n"), output_target
);
3101 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
3104 delete_output_file_on_failure
= TRUE
;
3106 if (! bfd_set_format (link_info
.output_bfd
, bfd_object
))
3107 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
3108 if (! bfd_set_arch_mach (link_info
.output_bfd
,
3109 ldfile_output_architecture
,
3110 ldfile_output_machine
))
3111 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
3113 link_info
.hash
= bfd_link_hash_table_create (link_info
.output_bfd
);
3114 if (link_info
.hash
== NULL
)
3115 einfo (_("%P%F: can not create hash table: %E\n"));
3117 bfd_set_gp_size (link_info
.output_bfd
, g_switch_value
);
3121 ldlang_open_output (lang_statement_union_type
*statement
)
3123 switch (statement
->header
.type
)
3125 case lang_output_statement_enum
:
3126 ASSERT (link_info
.output_bfd
== NULL
);
3127 open_output (statement
->output_statement
.name
);
3128 ldemul_set_output_arch ();
3129 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
3130 link_info
.output_bfd
->flags
|= D_PAGED
;
3132 link_info
.output_bfd
->flags
&= ~D_PAGED
;
3133 if (config
.text_read_only
)
3134 link_info
.output_bfd
->flags
|= WP_TEXT
;
3136 link_info
.output_bfd
->flags
&= ~WP_TEXT
;
3137 if (link_info
.traditional_format
)
3138 link_info
.output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
3140 link_info
.output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
3143 case lang_target_statement_enum
:
3144 current_target
= statement
->target_statement
.target
;
3151 /* Convert between addresses in bytes and sizes in octets.
3152 For currently supported targets, octets_per_byte is always a power
3153 of two, so we can use shifts. */
3154 #define TO_ADDR(X) ((X) >> opb_shift)
3155 #define TO_SIZE(X) ((X) << opb_shift)
3157 /* Support the above. */
3158 static unsigned int opb_shift
= 0;
3163 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
3164 ldfile_output_machine
);
3167 while ((x
& 1) == 0)
3175 /* Open all the input files. */
3178 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
3180 for (; s
!= NULL
; s
= s
->header
.next
)
3182 switch (s
->header
.type
)
3184 case lang_constructors_statement_enum
:
3185 open_input_bfds (constructor_list
.head
, force
);
3187 case lang_output_section_statement_enum
:
3188 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
3190 case lang_wild_statement_enum
:
3191 /* Maybe we should load the file's symbols. */
3192 if (s
->wild_statement
.filename
3193 && !wildcardp (s
->wild_statement
.filename
)
3194 && !archive_path (s
->wild_statement
.filename
))
3195 lookup_name (s
->wild_statement
.filename
);
3196 open_input_bfds (s
->wild_statement
.children
.head
, force
);
3198 case lang_group_statement_enum
:
3200 struct bfd_link_hash_entry
*undefs
;
3202 /* We must continually search the entries in the group
3203 until no new symbols are added to the list of undefined
3208 undefs
= link_info
.hash
->undefs_tail
;
3209 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
3211 while (undefs
!= link_info
.hash
->undefs_tail
);
3214 case lang_target_statement_enum
:
3215 current_target
= s
->target_statement
.target
;
3217 case lang_input_statement_enum
:
3218 if (s
->input_statement
.real
)
3220 lang_statement_union_type
**os_tail
;
3221 lang_statement_list_type add
;
3223 s
->input_statement
.target
= current_target
;
3225 /* If we are being called from within a group, and this
3226 is an archive which has already been searched, then
3227 force it to be researched unless the whole archive
3228 has been loaded already. */
3230 && !s
->input_statement
.whole_archive
3231 && s
->input_statement
.loaded
3232 && bfd_check_format (s
->input_statement
.the_bfd
,
3234 s
->input_statement
.loaded
= FALSE
;
3236 os_tail
= lang_output_section_statement
.tail
;
3237 lang_list_init (&add
);
3239 if (! load_symbols (&s
->input_statement
, &add
))
3240 config
.make_executable
= FALSE
;
3242 if (add
.head
!= NULL
)
3244 /* If this was a script with output sections then
3245 tack any added statements on to the end of the
3246 list. This avoids having to reorder the output
3247 section statement list. Very likely the user
3248 forgot -T, and whatever we do here will not meet
3249 naive user expectations. */
3250 if (os_tail
!= lang_output_section_statement
.tail
)
3252 einfo (_("%P: warning: %s contains output sections;"
3253 " did you forget -T?\n"),
3254 s
->input_statement
.filename
);
3255 *stat_ptr
->tail
= add
.head
;
3256 stat_ptr
->tail
= add
.tail
;
3260 *add
.tail
= s
->header
.next
;
3261 s
->header
.next
= add
.head
;
3266 case lang_assignment_statement_enum
:
3267 if (s
->assignment_statement
.exp
->assign
.hidden
)
3268 /* This is from a --defsym on the command line. */
3269 exp_fold_tree_no_dot (s
->assignment_statement
.exp
);
3276 /* Exit if any of the files were missing. */
3281 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3284 lang_track_definedness (const char *name
)
3286 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
3287 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
3290 /* New-function for the definedness hash table. */
3292 static struct bfd_hash_entry
*
3293 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
3294 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
3295 const char *name ATTRIBUTE_UNUSED
)
3297 struct lang_definedness_hash_entry
*ret
3298 = (struct lang_definedness_hash_entry
*) entry
;
3301 ret
= (struct lang_definedness_hash_entry
*)
3302 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
3305 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
3307 ret
->iteration
= -1;
3311 /* Return the iteration when the definition of NAME was last updated. A
3312 value of -1 means that the symbol is not defined in the linker script
3313 or the command line, but may be defined in the linker symbol table. */
3316 lang_symbol_definition_iteration (const char *name
)
3318 struct lang_definedness_hash_entry
*defentry
3319 = (struct lang_definedness_hash_entry
*)
3320 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3322 /* We've already created this one on the presence of DEFINED in the
3323 script, so it can't be NULL unless something is borked elsewhere in
3325 if (defentry
== NULL
)
3328 return defentry
->iteration
;
3331 /* Update the definedness state of NAME. */
3334 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
3336 struct lang_definedness_hash_entry
*defentry
3337 = (struct lang_definedness_hash_entry
*)
3338 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
3340 /* We don't keep track of symbols not tested with DEFINED. */
3341 if (defentry
== NULL
)
3344 /* If the symbol was already defined, and not from an earlier statement
3345 iteration, don't update the definedness iteration, because that'd
3346 make the symbol seem defined in the linker script at this point, and
3347 it wasn't; it was defined in some object. If we do anyway, DEFINED
3348 would start to yield false before this point and the construct "sym =
3349 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3351 if (h
->type
!= bfd_link_hash_undefined
3352 && h
->type
!= bfd_link_hash_common
3353 && h
->type
!= bfd_link_hash_new
3354 && defentry
->iteration
== -1)
3357 defentry
->iteration
= lang_statement_iteration
;
3360 /* Add the supplied name to the symbol table as an undefined reference.
3361 This is a two step process as the symbol table doesn't even exist at
3362 the time the ld command line is processed. First we put the name
3363 on a list, then, once the output file has been opened, transfer the
3364 name to the symbol table. */
3366 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
3368 #define ldlang_undef_chain_list_head entry_symbol.next
3371 ldlang_add_undef (const char *const name
, bfd_boolean cmdline
)
3373 ldlang_undef_chain_list_type
*new_undef
;
3375 undef_from_cmdline
= undef_from_cmdline
|| cmdline
;
3376 new_undef
= (ldlang_undef_chain_list_type
*) stat_alloc (sizeof (*new_undef
));
3377 new_undef
->next
= ldlang_undef_chain_list_head
;
3378 ldlang_undef_chain_list_head
= new_undef
;
3380 new_undef
->name
= xstrdup (name
);
3382 if (link_info
.output_bfd
!= NULL
)
3383 insert_undefined (new_undef
->name
);
3386 /* Insert NAME as undefined in the symbol table. */
3389 insert_undefined (const char *name
)
3391 struct bfd_link_hash_entry
*h
;
3393 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
3395 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3396 if (h
->type
== bfd_link_hash_new
)
3398 h
->type
= bfd_link_hash_undefined
;
3399 h
->u
.undef
.abfd
= NULL
;
3400 bfd_link_add_undef (link_info
.hash
, h
);
3404 /* Run through the list of undefineds created above and place them
3405 into the linker hash table as undefined symbols belonging to the
3409 lang_place_undefineds (void)
3411 ldlang_undef_chain_list_type
*ptr
;
3413 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
3414 insert_undefined (ptr
->name
);
3417 /* Check for all readonly or some readwrite sections. */
3420 check_input_sections
3421 (lang_statement_union_type
*s
,
3422 lang_output_section_statement_type
*output_section_statement
)
3424 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3426 switch (s
->header
.type
)
3428 case lang_wild_statement_enum
:
3429 walk_wild (&s
->wild_statement
, check_section_callback
,
3430 output_section_statement
);
3431 if (! output_section_statement
->all_input_readonly
)
3434 case lang_constructors_statement_enum
:
3435 check_input_sections (constructor_list
.head
,
3436 output_section_statement
);
3437 if (! output_section_statement
->all_input_readonly
)
3440 case lang_group_statement_enum
:
3441 check_input_sections (s
->group_statement
.children
.head
,
3442 output_section_statement
);
3443 if (! output_section_statement
->all_input_readonly
)
3452 /* Update wildcard statements if needed. */
3455 update_wild_statements (lang_statement_union_type
*s
)
3457 struct wildcard_list
*sec
;
3459 switch (sort_section
)
3469 for (; s
!= NULL
; s
= s
->header
.next
)
3471 switch (s
->header
.type
)
3476 case lang_wild_statement_enum
:
3477 sec
= s
->wild_statement
.section_list
;
3478 for (sec
= s
->wild_statement
.section_list
; sec
!= NULL
;
3481 switch (sec
->spec
.sorted
)
3484 sec
->spec
.sorted
= sort_section
;
3487 if (sort_section
== by_alignment
)
3488 sec
->spec
.sorted
= by_name_alignment
;
3491 if (sort_section
== by_name
)
3492 sec
->spec
.sorted
= by_alignment_name
;
3500 case lang_constructors_statement_enum
:
3501 update_wild_statements (constructor_list
.head
);
3504 case lang_output_section_statement_enum
:
3505 update_wild_statements
3506 (s
->output_section_statement
.children
.head
);
3509 case lang_group_statement_enum
:
3510 update_wild_statements (s
->group_statement
.children
.head
);
3518 /* Open input files and attach to output sections. */
3521 map_input_to_output_sections
3522 (lang_statement_union_type
*s
, const char *target
,
3523 lang_output_section_statement_type
*os
)
3525 for (; s
!= NULL
; s
= s
->header
.next
)
3527 lang_output_section_statement_type
*tos
;
3530 switch (s
->header
.type
)
3532 case lang_wild_statement_enum
:
3533 wild (&s
->wild_statement
, target
, os
);
3535 case lang_constructors_statement_enum
:
3536 map_input_to_output_sections (constructor_list
.head
,
3540 case lang_output_section_statement_enum
:
3541 tos
= &s
->output_section_statement
;
3542 if (tos
->constraint
!= 0)
3544 if (tos
->constraint
!= ONLY_IF_RW
3545 && tos
->constraint
!= ONLY_IF_RO
)
3547 tos
->all_input_readonly
= TRUE
;
3548 check_input_sections (tos
->children
.head
, tos
);
3549 if (tos
->all_input_readonly
!= (tos
->constraint
== ONLY_IF_RO
))
3551 tos
->constraint
= -1;
3555 map_input_to_output_sections (tos
->children
.head
,
3559 case lang_output_statement_enum
:
3561 case lang_target_statement_enum
:
3562 target
= s
->target_statement
.target
;
3564 case lang_group_statement_enum
:
3565 map_input_to_output_sections (s
->group_statement
.children
.head
,
3569 case lang_data_statement_enum
:
3570 /* Make sure that any sections mentioned in the expression
3572 exp_init_os (s
->data_statement
.exp
);
3573 /* The output section gets CONTENTS, ALLOC and LOAD, but
3574 these may be overridden by the script. */
3575 flags
= SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
;
3576 switch (os
->sectype
)
3578 case normal_section
:
3579 case overlay_section
:
3581 case noalloc_section
:
3582 flags
= SEC_HAS_CONTENTS
;
3584 case noload_section
:
3585 if (bfd_get_flavour (link_info
.output_bfd
)
3586 == bfd_target_elf_flavour
)
3587 flags
= SEC_NEVER_LOAD
| SEC_ALLOC
;
3589 flags
= SEC_NEVER_LOAD
| SEC_HAS_CONTENTS
;
3592 if (os
->bfd_section
== NULL
)
3593 init_os (os
, flags
);
3595 os
->bfd_section
->flags
|= flags
;
3597 case lang_input_section_enum
:
3599 case lang_fill_statement_enum
:
3600 case lang_object_symbols_statement_enum
:
3601 case lang_reloc_statement_enum
:
3602 case lang_padding_statement_enum
:
3603 case lang_input_statement_enum
:
3604 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3607 case lang_assignment_statement_enum
:
3608 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3611 /* Make sure that any sections mentioned in the assignment
3613 exp_init_os (s
->assignment_statement
.exp
);
3615 case lang_address_statement_enum
:
3616 /* Mark the specified section with the supplied address.
3617 If this section was actually a segment marker, then the
3618 directive is ignored if the linker script explicitly
3619 processed the segment marker. Originally, the linker
3620 treated segment directives (like -Ttext on the
3621 command-line) as section directives. We honor the
3622 section directive semantics for backwards compatibilty;
3623 linker scripts that do not specifically check for
3624 SEGMENT_START automatically get the old semantics. */
3625 if (!s
->address_statement
.segment
3626 || !s
->address_statement
.segment
->used
)
3628 const char *name
= s
->address_statement
.section_name
;
3630 /* Create the output section statement here so that
3631 orphans with a set address will be placed after other
3632 script sections. If we let the orphan placement code
3633 place them in amongst other sections then the address
3634 will affect following script sections, which is
3635 likely to surprise naive users. */
3636 tos
= lang_output_section_statement_lookup (name
, 0, TRUE
);
3637 tos
->addr_tree
= s
->address_statement
.address
;
3638 if (tos
->bfd_section
== NULL
)
3642 case lang_insert_statement_enum
:
3648 /* An insert statement snips out all the linker statements from the
3649 start of the list and places them after the output section
3650 statement specified by the insert. This operation is complicated
3651 by the fact that we keep a doubly linked list of output section
3652 statements as well as the singly linked list of all statements. */
3655 process_insert_statements (void)
3657 lang_statement_union_type
**s
;
3658 lang_output_section_statement_type
*first_os
= NULL
;
3659 lang_output_section_statement_type
*last_os
= NULL
;
3660 lang_output_section_statement_type
*os
;
3662 /* "start of list" is actually the statement immediately after
3663 the special abs_section output statement, so that it isn't
3665 s
= &lang_output_section_statement
.head
;
3666 while (*(s
= &(*s
)->header
.next
) != NULL
)
3668 if ((*s
)->header
.type
== lang_output_section_statement_enum
)
3670 /* Keep pointers to the first and last output section
3671 statement in the sequence we may be about to move. */
3672 os
= &(*s
)->output_section_statement
;
3674 ASSERT (last_os
== NULL
|| last_os
->next
== os
);
3677 /* Set constraint negative so that lang_output_section_find
3678 won't match this output section statement. At this
3679 stage in linking constraint has values in the range
3680 [-1, ONLY_IN_RW]. */
3681 last_os
->constraint
= -2 - last_os
->constraint
;
3682 if (first_os
== NULL
)
3685 else if ((*s
)->header
.type
== lang_insert_statement_enum
)
3687 lang_insert_statement_type
*i
= &(*s
)->insert_statement
;
3688 lang_output_section_statement_type
*where
;
3689 lang_statement_union_type
**ptr
;
3690 lang_statement_union_type
*first
;
3692 where
= lang_output_section_find (i
->where
);
3693 if (where
!= NULL
&& i
->is_before
)
3696 where
= where
->prev
;
3697 while (where
!= NULL
&& where
->constraint
< 0);
3701 einfo (_("%F%P: %s not found for insert\n"), i
->where
);
3705 /* Deal with reordering the output section statement list. */
3706 if (last_os
!= NULL
)
3708 asection
*first_sec
, *last_sec
;
3709 struct lang_output_section_statement_struct
**next
;
3711 /* Snip out the output sections we are moving. */
3712 first_os
->prev
->next
= last_os
->next
;
3713 if (last_os
->next
== NULL
)
3715 next
= &first_os
->prev
->next
;
3716 lang_output_section_statement
.tail
3717 = (lang_statement_union_type
**) next
;
3720 last_os
->next
->prev
= first_os
->prev
;
3721 /* Add them in at the new position. */
3722 last_os
->next
= where
->next
;
3723 if (where
->next
== NULL
)
3725 next
= &last_os
->next
;
3726 lang_output_section_statement
.tail
3727 = (lang_statement_union_type
**) next
;
3730 where
->next
->prev
= last_os
;
3731 first_os
->prev
= where
;
3732 where
->next
= first_os
;
3734 /* Move the bfd sections in the same way. */
3737 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3739 os
->constraint
= -2 - os
->constraint
;
3740 if (os
->bfd_section
!= NULL
3741 && os
->bfd_section
->owner
!= NULL
)
3743 last_sec
= os
->bfd_section
;
3744 if (first_sec
== NULL
)
3745 first_sec
= last_sec
;
3750 if (last_sec
!= NULL
)
3752 asection
*sec
= where
->bfd_section
;
3754 sec
= output_prev_sec_find (where
);
3756 /* The place we want to insert must come after the
3757 sections we are moving. So if we find no
3758 section or if the section is the same as our
3759 last section, then no move is needed. */
3760 if (sec
!= NULL
&& sec
!= last_sec
)
3762 /* Trim them off. */
3763 if (first_sec
->prev
!= NULL
)
3764 first_sec
->prev
->next
= last_sec
->next
;
3766 link_info
.output_bfd
->sections
= last_sec
->next
;
3767 if (last_sec
->next
!= NULL
)
3768 last_sec
->next
->prev
= first_sec
->prev
;
3770 link_info
.output_bfd
->section_last
= first_sec
->prev
;
3772 last_sec
->next
= sec
->next
;
3773 if (sec
->next
!= NULL
)
3774 sec
->next
->prev
= last_sec
;
3776 link_info
.output_bfd
->section_last
= last_sec
;
3777 first_sec
->prev
= sec
;
3778 sec
->next
= first_sec
;
3786 ptr
= insert_os_after (where
);
3787 /* Snip everything after the abs_section output statement we
3788 know is at the start of the list, up to and including
3789 the insert statement we are currently processing. */
3790 first
= lang_output_section_statement
.head
->header
.next
;
3791 lang_output_section_statement
.head
->header
.next
= (*s
)->header
.next
;
3792 /* Add them back where they belong. */
3795 statement_list
.tail
= s
;
3797 s
= &lang_output_section_statement
.head
;
3801 /* Undo constraint twiddling. */
3802 for (os
= first_os
; os
!= NULL
; os
= os
->next
)
3804 os
->constraint
= -2 - os
->constraint
;
3810 /* An output section might have been removed after its statement was
3811 added. For example, ldemul_before_allocation can remove dynamic
3812 sections if they turn out to be not needed. Clean them up here. */
3815 strip_excluded_output_sections (void)
3817 lang_output_section_statement_type
*os
;
3819 /* Run lang_size_sections (if not already done). */
3820 if (expld
.phase
!= lang_mark_phase_enum
)
3822 expld
.phase
= lang_mark_phase_enum
;
3823 expld
.dataseg
.phase
= exp_dataseg_none
;
3824 one_lang_size_sections_pass (NULL
, FALSE
);
3825 lang_reset_memory_regions ();
3828 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3832 asection
*output_section
;
3833 bfd_boolean exclude
;
3835 if (os
->constraint
< 0)
3838 output_section
= os
->bfd_section
;
3839 if (output_section
== NULL
)
3842 exclude
= (output_section
->rawsize
== 0
3843 && (output_section
->flags
& SEC_KEEP
) == 0
3844 && !bfd_section_removed_from_list (link_info
.output_bfd
,
3847 /* Some sections have not yet been sized, notably .gnu.version,
3848 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3849 input sections, so don't drop output sections that have such
3850 input sections unless they are also marked SEC_EXCLUDE. */
3851 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3855 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3856 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3857 && (s
->flags
& SEC_EXCLUDE
) == 0)
3864 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3865 output_section
->map_head
.link_order
= NULL
;
3866 output_section
->map_tail
.link_order
= NULL
;
3870 /* We don't set bfd_section to NULL since bfd_section of the
3871 removed output section statement may still be used. */
3872 if (!os
->section_relative_symbol
3873 && !os
->update_dot_tree
)
3875 output_section
->flags
|= SEC_EXCLUDE
;
3876 bfd_section_list_remove (link_info
.output_bfd
, output_section
);
3877 link_info
.output_bfd
->section_count
--;
3881 /* Stop future calls to lang_add_section from messing with map_head
3882 and map_tail link_order fields. */
3883 stripped_excluded_sections
= TRUE
;
3887 print_output_section_statement
3888 (lang_output_section_statement_type
*output_section_statement
)
3890 asection
*section
= output_section_statement
->bfd_section
;
3893 if (output_section_statement
!= abs_output_section
)
3895 minfo ("\n%s", output_section_statement
->name
);
3897 if (section
!= NULL
)
3899 print_dot
= section
->vma
;
3901 len
= strlen (output_section_statement
->name
);
3902 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3907 while (len
< SECTION_NAME_MAP_LENGTH
)
3913 minfo ("0x%V %W", section
->vma
, section
->size
);
3915 if (section
->vma
!= section
->lma
)
3916 minfo (_(" load address 0x%V"), section
->lma
);
3918 if (output_section_statement
->update_dot_tree
!= NULL
)
3919 exp_fold_tree (output_section_statement
->update_dot_tree
,
3920 bfd_abs_section_ptr
, &print_dot
);
3926 print_statement_list (output_section_statement
->children
.head
,
3927 output_section_statement
);
3930 /* Scan for the use of the destination in the right hand side
3931 of an expression. In such cases we will not compute the
3932 correct expression, since the value of DST that is used on
3933 the right hand side will be its final value, not its value
3934 just before this expression is evaluated. */
3937 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3939 if (rhs
== NULL
|| dst
== NULL
)
3942 switch (rhs
->type
.node_class
)
3945 return (scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3946 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
));
3949 return (scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3950 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
));
3953 case etree_provided
:
3955 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3957 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3960 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3964 return strcmp (dst
, rhs
->value
.str
) == 0;
3969 return strcmp (dst
, rhs
->name
.name
) == 0;
3981 print_assignment (lang_assignment_statement_type
*assignment
,
3982 lang_output_section_statement_type
*output_section
)
3986 bfd_boolean computation_is_valid
= TRUE
;
3990 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3993 if (assignment
->exp
->type
.node_class
== etree_assert
)
3996 tree
= assignment
->exp
->assert_s
.child
;
3997 computation_is_valid
= TRUE
;
4001 const char *dst
= assignment
->exp
->assign
.dst
;
4003 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
4004 tree
= assignment
->exp
->assign
.src
;
4005 computation_is_valid
= is_dot
|| !scan_for_self_assignment (dst
, tree
);
4008 osec
= output_section
->bfd_section
;
4010 osec
= bfd_abs_section_ptr
;
4011 exp_fold_tree (tree
, osec
, &print_dot
);
4012 if (expld
.result
.valid_p
)
4016 if (computation_is_valid
)
4018 value
= expld
.result
.value
;
4020 if (expld
.result
.section
!= NULL
)
4021 value
+= expld
.result
.section
->vma
;
4023 minfo ("0x%V", value
);
4029 struct bfd_link_hash_entry
*h
;
4031 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
4032 FALSE
, FALSE
, TRUE
);
4035 value
= h
->u
.def
.value
;
4037 if (expld
.result
.section
!= NULL
)
4038 value
+= expld
.result
.section
->vma
;
4040 minfo ("[0x%V]", value
);
4043 minfo ("[unresolved]");
4055 exp_print_tree (assignment
->exp
);
4060 print_input_statement (lang_input_statement_type
*statm
)
4062 if (statm
->filename
!= NULL
4063 && (statm
->the_bfd
== NULL
4064 || (statm
->the_bfd
->flags
& BFD_LINKER_CREATED
) == 0))
4065 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
4068 /* Print all symbols defined in a particular section. This is called
4069 via bfd_link_hash_traverse, or by print_all_symbols. */
4072 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
4074 asection
*sec
= (asection
*) ptr
;
4076 if ((hash_entry
->type
== bfd_link_hash_defined
4077 || hash_entry
->type
== bfd_link_hash_defweak
)
4078 && sec
== hash_entry
->u
.def
.section
)
4082 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4085 (hash_entry
->u
.def
.value
4086 + hash_entry
->u
.def
.section
->output_offset
4087 + hash_entry
->u
.def
.section
->output_section
->vma
));
4089 minfo (" %T\n", hash_entry
->root
.string
);
4096 hash_entry_addr_cmp (const void *a
, const void *b
)
4098 const struct bfd_link_hash_entry
*l
= *(const struct bfd_link_hash_entry
**)a
;
4099 const struct bfd_link_hash_entry
*r
= *(const struct bfd_link_hash_entry
**)b
;
4101 if (l
->u
.def
.value
< r
->u
.def
.value
)
4103 else if (l
->u
.def
.value
> r
->u
.def
.value
)
4110 print_all_symbols (asection
*sec
)
4112 struct fat_user_section_struct
*ud
=
4113 (struct fat_user_section_struct
*) get_userdata (sec
);
4114 struct map_symbol_def
*def
;
4115 struct bfd_link_hash_entry
**entries
;
4121 *ud
->map_symbol_def_tail
= 0;
4123 /* Sort the symbols by address. */
4124 entries
= (struct bfd_link_hash_entry
**)
4125 obstack_alloc (&map_obstack
, ud
->map_symbol_def_count
* sizeof (*entries
));
4127 for (i
= 0, def
= ud
->map_symbol_def_head
; def
; def
= def
->next
, i
++)
4128 entries
[i
] = def
->entry
;
4130 qsort (entries
, ud
->map_symbol_def_count
, sizeof (*entries
),
4131 hash_entry_addr_cmp
);
4133 /* Print the symbols. */
4134 for (i
= 0; i
< ud
->map_symbol_def_count
; i
++)
4135 print_one_symbol (entries
[i
], sec
);
4137 obstack_free (&map_obstack
, entries
);
4140 /* Print information about an input section to the map file. */
4143 print_input_section (asection
*i
, bfd_boolean is_discarded
)
4145 bfd_size_type size
= i
->size
;
4152 minfo ("%s", i
->name
);
4154 len
= 1 + strlen (i
->name
);
4155 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
4160 while (len
< SECTION_NAME_MAP_LENGTH
)
4166 if (i
->output_section
!= NULL
4167 && i
->output_section
->owner
== link_info
.output_bfd
)
4168 addr
= i
->output_section
->vma
+ i
->output_offset
;
4176 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
4178 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
4180 len
= SECTION_NAME_MAP_LENGTH
+ 3;
4192 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
4195 if (i
->output_section
!= NULL
4196 && i
->output_section
->owner
== link_info
.output_bfd
)
4198 if (link_info
.reduce_memory_overheads
)
4199 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
4201 print_all_symbols (i
);
4203 /* Update print_dot, but make sure that we do not move it
4204 backwards - this could happen if we have overlays and a
4205 later overlay is shorter than an earier one. */
4206 if (addr
+ TO_ADDR (size
) > print_dot
)
4207 print_dot
= addr
+ TO_ADDR (size
);
4212 print_fill_statement (lang_fill_statement_type
*fill
)
4216 fputs (" FILL mask 0x", config
.map_file
);
4217 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
4218 fprintf (config
.map_file
, "%02x", *p
);
4219 fputs ("\n", config
.map_file
);
4223 print_data_statement (lang_data_statement_type
*data
)
4231 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4234 addr
= data
->output_offset
;
4235 if (data
->output_section
!= NULL
)
4236 addr
+= data
->output_section
->vma
;
4264 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
4266 if (data
->exp
->type
.node_class
!= etree_value
)
4269 exp_print_tree (data
->exp
);
4274 print_dot
= addr
+ TO_ADDR (size
);
4277 /* Print an address statement. These are generated by options like
4281 print_address_statement (lang_address_statement_type
*address
)
4283 minfo (_("Address of section %s set to "), address
->section_name
);
4284 exp_print_tree (address
->address
);
4288 /* Print a reloc statement. */
4291 print_reloc_statement (lang_reloc_statement_type
*reloc
)
4298 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
4301 addr
= reloc
->output_offset
;
4302 if (reloc
->output_section
!= NULL
)
4303 addr
+= reloc
->output_section
->vma
;
4305 size
= bfd_get_reloc_size (reloc
->howto
);
4307 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
4309 if (reloc
->name
!= NULL
)
4310 minfo ("%s+", reloc
->name
);
4312 minfo ("%s+", reloc
->section
->name
);
4314 exp_print_tree (reloc
->addend_exp
);
4318 print_dot
= addr
+ TO_ADDR (size
);
4322 print_padding_statement (lang_padding_statement_type
*s
)
4330 len
= sizeof " *fill*" - 1;
4331 while (len
< SECTION_NAME_MAP_LENGTH
)
4337 addr
= s
->output_offset
;
4338 if (s
->output_section
!= NULL
)
4339 addr
+= s
->output_section
->vma
;
4340 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
4342 if (s
->fill
->size
!= 0)
4346 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
4347 fprintf (config
.map_file
, "%02x", *p
);
4352 print_dot
= addr
+ TO_ADDR (s
->size
);
4356 print_wild_statement (lang_wild_statement_type
*w
,
4357 lang_output_section_statement_type
*os
)
4359 struct wildcard_list
*sec
;
4363 if (w
->filenames_sorted
)
4365 if (w
->filename
!= NULL
)
4366 minfo ("%s", w
->filename
);
4369 if (w
->filenames_sorted
)
4373 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
4375 if (sec
->spec
.sorted
)
4377 if (sec
->spec
.exclude_name_list
!= NULL
)
4380 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
4381 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
4382 minfo (" %s", tmp
->name
);
4385 if (sec
->spec
.name
!= NULL
)
4386 minfo ("%s", sec
->spec
.name
);
4389 if (sec
->spec
.sorted
)
4398 print_statement_list (w
->children
.head
, os
);
4401 /* Print a group statement. */
4404 print_group (lang_group_statement_type
*s
,
4405 lang_output_section_statement_type
*os
)
4407 fprintf (config
.map_file
, "START GROUP\n");
4408 print_statement_list (s
->children
.head
, os
);
4409 fprintf (config
.map_file
, "END GROUP\n");
4412 /* Print the list of statements in S.
4413 This can be called for any statement type. */
4416 print_statement_list (lang_statement_union_type
*s
,
4417 lang_output_section_statement_type
*os
)
4421 print_statement (s
, os
);
4426 /* Print the first statement in statement list S.
4427 This can be called for any statement type. */
4430 print_statement (lang_statement_union_type
*s
,
4431 lang_output_section_statement_type
*os
)
4433 switch (s
->header
.type
)
4436 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
4439 case lang_constructors_statement_enum
:
4440 if (constructor_list
.head
!= NULL
)
4442 if (constructors_sorted
)
4443 minfo (" SORT (CONSTRUCTORS)\n");
4445 minfo (" CONSTRUCTORS\n");
4446 print_statement_list (constructor_list
.head
, os
);
4449 case lang_wild_statement_enum
:
4450 print_wild_statement (&s
->wild_statement
, os
);
4452 case lang_address_statement_enum
:
4453 print_address_statement (&s
->address_statement
);
4455 case lang_object_symbols_statement_enum
:
4456 minfo (" CREATE_OBJECT_SYMBOLS\n");
4458 case lang_fill_statement_enum
:
4459 print_fill_statement (&s
->fill_statement
);
4461 case lang_data_statement_enum
:
4462 print_data_statement (&s
->data_statement
);
4464 case lang_reloc_statement_enum
:
4465 print_reloc_statement (&s
->reloc_statement
);
4467 case lang_input_section_enum
:
4468 print_input_section (s
->input_section
.section
, FALSE
);
4470 case lang_padding_statement_enum
:
4471 print_padding_statement (&s
->padding_statement
);
4473 case lang_output_section_statement_enum
:
4474 print_output_section_statement (&s
->output_section_statement
);
4476 case lang_assignment_statement_enum
:
4477 print_assignment (&s
->assignment_statement
, os
);
4479 case lang_target_statement_enum
:
4480 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
4482 case lang_output_statement_enum
:
4483 minfo ("OUTPUT(%s", s
->output_statement
.name
);
4484 if (output_target
!= NULL
)
4485 minfo (" %s", output_target
);
4488 case lang_input_statement_enum
:
4489 print_input_statement (&s
->input_statement
);
4491 case lang_group_statement_enum
:
4492 print_group (&s
->group_statement
, os
);
4494 case lang_insert_statement_enum
:
4495 minfo ("INSERT %s %s\n",
4496 s
->insert_statement
.is_before
? "BEFORE" : "AFTER",
4497 s
->insert_statement
.where
);
4503 print_statements (void)
4505 print_statement_list (statement_list
.head
, abs_output_section
);
4508 /* Print the first N statements in statement list S to STDERR.
4509 If N == 0, nothing is printed.
4510 If N < 0, the entire list is printed.
4511 Intended to be called from GDB. */
4514 dprint_statement (lang_statement_union_type
*s
, int n
)
4516 FILE *map_save
= config
.map_file
;
4518 config
.map_file
= stderr
;
4521 print_statement_list (s
, abs_output_section
);
4524 while (s
&& --n
>= 0)
4526 print_statement (s
, abs_output_section
);
4531 config
.map_file
= map_save
;
4535 insert_pad (lang_statement_union_type
**ptr
,
4537 unsigned int alignment_needed
,
4538 asection
*output_section
,
4541 static fill_type zero_fill
= { 1, { 0 } };
4542 lang_statement_union_type
*pad
= NULL
;
4544 if (ptr
!= &statement_list
.head
)
4545 pad
= ((lang_statement_union_type
*)
4546 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
4548 && pad
->header
.type
== lang_padding_statement_enum
4549 && pad
->padding_statement
.output_section
== output_section
)
4551 /* Use the existing pad statement. */
4553 else if ((pad
= *ptr
) != NULL
4554 && pad
->header
.type
== lang_padding_statement_enum
4555 && pad
->padding_statement
.output_section
== output_section
)
4557 /* Use the existing pad statement. */
4561 /* Make a new padding statement, linked into existing chain. */
4562 pad
= (lang_statement_union_type
*)
4563 stat_alloc (sizeof (lang_padding_statement_type
));
4564 pad
->header
.next
= *ptr
;
4566 pad
->header
.type
= lang_padding_statement_enum
;
4567 pad
->padding_statement
.output_section
= output_section
;
4570 pad
->padding_statement
.fill
= fill
;
4572 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
4573 pad
->padding_statement
.size
= alignment_needed
;
4574 output_section
->size
+= alignment_needed
;
4577 /* Work out how much this section will move the dot point. */
4581 (lang_statement_union_type
**this_ptr
,
4582 lang_output_section_statement_type
*output_section_statement
,
4586 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
4587 asection
*i
= is
->section
;
4589 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
4590 && (i
->flags
& SEC_EXCLUDE
) == 0)
4592 unsigned int alignment_needed
;
4595 /* Align this section first to the input sections requirement,
4596 then to the output section's requirement. If this alignment
4597 is greater than any seen before, then record it too. Perform
4598 the alignment by inserting a magic 'padding' statement. */
4600 if (output_section_statement
->subsection_alignment
!= -1)
4601 i
->alignment_power
= output_section_statement
->subsection_alignment
;
4603 o
= output_section_statement
->bfd_section
;
4604 if (o
->alignment_power
< i
->alignment_power
)
4605 o
->alignment_power
= i
->alignment_power
;
4607 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
4609 if (alignment_needed
!= 0)
4611 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
4612 dot
+= alignment_needed
;
4615 /* Remember where in the output section this input section goes. */
4617 i
->output_offset
= dot
- o
->vma
;
4619 /* Mark how big the output section must be to contain this now. */
4620 dot
+= TO_ADDR (i
->size
);
4621 o
->size
= TO_SIZE (dot
- o
->vma
);
4625 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
4632 sort_sections_by_lma (const void *arg1
, const void *arg2
)
4634 const asection
*sec1
= *(const asection
**) arg1
;
4635 const asection
*sec2
= *(const asection
**) arg2
;
4637 if (bfd_section_lma (sec1
->owner
, sec1
)
4638 < bfd_section_lma (sec2
->owner
, sec2
))
4640 else if (bfd_section_lma (sec1
->owner
, sec1
)
4641 > bfd_section_lma (sec2
->owner
, sec2
))
4643 else if (sec1
->id
< sec2
->id
)
4645 else if (sec1
->id
> sec2
->id
)
4651 #define IGNORE_SECTION(s) \
4652 ((s->flags & SEC_ALLOC) == 0 \
4653 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4654 && (s->flags & SEC_LOAD) == 0))
4656 /* Check to see if any allocated sections overlap with other allocated
4657 sections. This can happen if a linker script specifies the output
4658 section addresses of the two sections. Also check whether any memory
4659 region has overflowed. */
4662 lang_check_section_addresses (void)
4665 asection
**sections
, **spp
;
4672 lang_memory_region_type
*m
;
4674 if (bfd_count_sections (link_info
.output_bfd
) <= 1)
4677 amt
= bfd_count_sections (link_info
.output_bfd
) * sizeof (asection
*);
4678 sections
= (asection
**) xmalloc (amt
);
4680 /* Scan all sections in the output list. */
4682 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4684 /* Only consider loadable sections with real contents. */
4685 if (!(s
->flags
& SEC_LOAD
)
4686 || !(s
->flags
& SEC_ALLOC
)
4690 sections
[count
] = s
;
4697 qsort (sections
, (size_t) count
, sizeof (asection
*),
4698 sort_sections_by_lma
);
4703 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4704 for (count
--; count
; count
--)
4706 /* We must check the sections' LMA addresses not their VMA
4707 addresses because overlay sections can have overlapping VMAs
4708 but they must have distinct LMAs. */
4714 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4716 /* Look for an overlap. We have sorted sections by lma, so we
4717 know that s_start >= p_start. Besides the obvious case of
4718 overlap when the current section starts before the previous
4719 one ends, we also must have overlap if the previous section
4720 wraps around the address space. */
4721 if (s_start
<= p_end
4723 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
4724 s
->name
, s_start
, s_end
, p
->name
, p_start
, p_end
);
4729 /* If any memory region has overflowed, report by how much.
4730 We do not issue this diagnostic for regions that had sections
4731 explicitly placed outside their bounds; os_region_check's
4732 diagnostics are adequate for that case.
4734 FIXME: It is conceivable that m->current - (m->origin + m->length)
4735 might overflow a 32-bit integer. There is, alas, no way to print
4736 a bfd_vma quantity in decimal. */
4737 for (m
= lang_memory_region_list
; m
; m
= m
->next
)
4738 if (m
->had_full_message
)
4739 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4740 m
->name_list
.name
, (long)(m
->current
- (m
->origin
+ m
->length
)));
4744 /* Make sure the new address is within the region. We explicitly permit the
4745 current address to be at the exact end of the region when the address is
4746 non-zero, in case the region is at the end of addressable memory and the
4747 calculation wraps around. */
4750 os_region_check (lang_output_section_statement_type
*os
,
4751 lang_memory_region_type
*region
,
4755 if ((region
->current
< region
->origin
4756 || (region
->current
- region
->origin
> region
->length
))
4757 && ((region
->current
!= region
->origin
+ region
->length
)
4762 einfo (_("%X%P: address 0x%v of %B section `%s'"
4763 " is not within region `%s'\n"),
4765 os
->bfd_section
->owner
,
4766 os
->bfd_section
->name
,
4767 region
->name_list
.name
);
4769 else if (!region
->had_full_message
)
4771 region
->had_full_message
= TRUE
;
4773 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
4774 os
->bfd_section
->owner
,
4775 os
->bfd_section
->name
,
4776 region
->name_list
.name
);
4781 /* Set the sizes for all the output sections. */
4784 lang_size_sections_1
4785 (lang_statement_union_type
**prev
,
4786 lang_output_section_statement_type
*output_section_statement
,
4790 bfd_boolean check_regions
)
4792 lang_statement_union_type
*s
;
4794 /* Size up the sections from their constituent parts. */
4795 for (s
= *prev
; s
!= NULL
; s
= s
->header
.next
)
4797 switch (s
->header
.type
)
4799 case lang_output_section_statement_enum
:
4801 bfd_vma newdot
, after
;
4802 lang_output_section_statement_type
*os
;
4803 lang_memory_region_type
*r
;
4804 int section_alignment
= 0;
4806 os
= &s
->output_section_statement
;
4807 if (os
->constraint
== -1)
4810 /* FIXME: We shouldn't need to zero section vmas for ld -r
4811 here, in lang_insert_orphan, or in the default linker scripts.
4812 This is covering for coff backend linker bugs. See PR6945. */
4813 if (os
->addr_tree
== NULL
4814 && link_info
.relocatable
4815 && (bfd_get_flavour (link_info
.output_bfd
)
4816 == bfd_target_coff_flavour
))
4817 os
->addr_tree
= exp_intop (0);
4818 if (os
->addr_tree
!= NULL
)
4820 os
->processed_vma
= FALSE
;
4821 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4823 if (expld
.result
.valid_p
)
4825 dot
= expld
.result
.value
;
4826 if (expld
.result
.section
!= NULL
)
4827 dot
+= expld
.result
.section
->vma
;
4829 else if (expld
.phase
!= lang_mark_phase_enum
)
4830 einfo (_("%F%S: non constant or forward reference"
4831 " address expression for section %s\n"),
4835 if (os
->bfd_section
== NULL
)
4836 /* This section was removed or never actually created. */
4839 /* If this is a COFF shared library section, use the size and
4840 address from the input section. FIXME: This is COFF
4841 specific; it would be cleaner if there were some other way
4842 to do this, but nothing simple comes to mind. */
4843 if (((bfd_get_flavour (link_info
.output_bfd
)
4844 == bfd_target_ecoff_flavour
)
4845 || (bfd_get_flavour (link_info
.output_bfd
)
4846 == bfd_target_coff_flavour
))
4847 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4851 if (os
->children
.head
== NULL
4852 || os
->children
.head
->header
.next
!= NULL
4853 || (os
->children
.head
->header
.type
4854 != lang_input_section_enum
))
4855 einfo (_("%P%X: Internal error on COFF shared library"
4856 " section %s\n"), os
->name
);
4858 input
= os
->children
.head
->input_section
.section
;
4859 bfd_set_section_vma (os
->bfd_section
->owner
,
4861 bfd_section_vma (input
->owner
, input
));
4862 os
->bfd_section
->size
= input
->size
;
4867 if (bfd_is_abs_section (os
->bfd_section
))
4869 /* No matter what happens, an abs section starts at zero. */
4870 ASSERT (os
->bfd_section
->vma
== 0);
4874 if (os
->addr_tree
== NULL
)
4876 /* No address specified for this section, get one
4877 from the region specification. */
4878 if (os
->region
== NULL
4879 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4880 && os
->region
->name_list
.name
[0] == '*'
4881 && strcmp (os
->region
->name_list
.name
,
4882 DEFAULT_MEMORY_REGION
) == 0))
4884 os
->region
= lang_memory_default (os
->bfd_section
);
4887 /* If a loadable section is using the default memory
4888 region, and some non default memory regions were
4889 defined, issue an error message. */
4891 && !IGNORE_SECTION (os
->bfd_section
)
4892 && ! link_info
.relocatable
4894 && strcmp (os
->region
->name_list
.name
,
4895 DEFAULT_MEMORY_REGION
) == 0
4896 && lang_memory_region_list
!= NULL
4897 && (strcmp (lang_memory_region_list
->name_list
.name
,
4898 DEFAULT_MEMORY_REGION
) != 0
4899 || lang_memory_region_list
->next
!= NULL
)
4900 && expld
.phase
!= lang_mark_phase_enum
)
4902 /* By default this is an error rather than just a
4903 warning because if we allocate the section to the
4904 default memory region we can end up creating an
4905 excessively large binary, or even seg faulting when
4906 attempting to perform a negative seek. See
4907 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4908 for an example of this. This behaviour can be
4909 overridden by the using the --no-check-sections
4911 if (command_line
.check_section_addresses
)
4912 einfo (_("%P%F: error: no memory region specified"
4913 " for loadable section `%s'\n"),
4914 bfd_get_section_name (link_info
.output_bfd
,
4917 einfo (_("%P: warning: no memory region specified"
4918 " for loadable section `%s'\n"),
4919 bfd_get_section_name (link_info
.output_bfd
,
4923 newdot
= os
->region
->current
;
4924 section_alignment
= os
->bfd_section
->alignment_power
;
4927 section_alignment
= os
->section_alignment
;
4929 /* Align to what the section needs. */
4930 if (section_alignment
> 0)
4932 bfd_vma savedot
= newdot
;
4933 newdot
= align_power (newdot
, section_alignment
);
4935 if (newdot
!= savedot
4936 && (config
.warn_section_align
4937 || os
->addr_tree
!= NULL
)
4938 && expld
.phase
!= lang_mark_phase_enum
)
4939 einfo (_("%P: warning: changing start of section"
4940 " %s by %lu bytes\n"),
4941 os
->name
, (unsigned long) (newdot
- savedot
));
4944 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4946 os
->bfd_section
->output_offset
= 0;
4949 lang_size_sections_1 (&os
->children
.head
, os
,
4950 os
->fill
, newdot
, relax
, check_regions
);
4952 os
->processed_vma
= TRUE
;
4954 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4955 /* Except for some special linker created sections,
4956 no output section should change from zero size
4957 after strip_excluded_output_sections. A non-zero
4958 size on an ignored section indicates that some
4959 input section was not sized early enough. */
4960 ASSERT (os
->bfd_section
->size
== 0);
4963 dot
= os
->bfd_section
->vma
;
4965 /* Put the section within the requested block size, or
4966 align at the block boundary. */
4968 + TO_ADDR (os
->bfd_section
->size
)
4969 + os
->block_value
- 1)
4970 & - (bfd_vma
) os
->block_value
);
4972 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4975 /* Set section lma. */
4978 r
= lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
4982 bfd_vma lma
= exp_get_abs_int (os
->load_base
, 0, "load base");
4983 os
->bfd_section
->lma
= lma
;
4985 else if (os
->lma_region
!= NULL
)
4987 bfd_vma lma
= os
->lma_region
->current
;
4989 if (section_alignment
> 0)
4990 lma
= align_power (lma
, section_alignment
);
4991 os
->bfd_section
->lma
= lma
;
4993 else if (r
->last_os
!= NULL
4994 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0)
4999 last
= r
->last_os
->output_section_statement
.bfd_section
;
5001 /* A backwards move of dot should be accompanied by
5002 an explicit assignment to the section LMA (ie.
5003 os->load_base set) because backwards moves can
5004 create overlapping LMAs. */
5006 && os
->bfd_section
->size
!= 0
5007 && dot
+ os
->bfd_section
->size
<= last
->vma
)
5009 /* If dot moved backwards then leave lma equal to
5010 vma. This is the old default lma, which might
5011 just happen to work when the backwards move is
5012 sufficiently large. Nag if this changes anything,
5013 so people can fix their linker scripts. */
5015 if (last
->vma
!= last
->lma
)
5016 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5021 /* If this is an overlay, set the current lma to that
5022 at the end of the previous section. */
5023 if (os
->sectype
== overlay_section
)
5024 lma
= last
->lma
+ last
->size
;
5026 /* Otherwise, keep the same lma to vma relationship
5027 as the previous section. */
5029 lma
= dot
+ last
->lma
- last
->vma
;
5031 if (section_alignment
> 0)
5032 lma
= align_power (lma
, section_alignment
);
5033 os
->bfd_section
->lma
= lma
;
5036 os
->processed_lma
= TRUE
;
5038 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
5041 /* Keep track of normal sections using the default
5042 lma region. We use this to set the lma for
5043 following sections. Overlays or other linker
5044 script assignment to lma might mean that the
5045 default lma == vma is incorrect.
5046 To avoid warnings about dot moving backwards when using
5047 -Ttext, don't start tracking sections until we find one
5048 of non-zero size or with lma set differently to vma. */
5049 if (((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5050 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0)
5051 && (os
->bfd_section
->flags
& SEC_ALLOC
) != 0
5052 && (os
->bfd_section
->size
!= 0
5053 || (r
->last_os
== NULL
5054 && os
->bfd_section
->vma
!= os
->bfd_section
->lma
)
5055 || (r
->last_os
!= NULL
5056 && dot
>= (r
->last_os
->output_section_statement
5057 .bfd_section
->vma
)))
5058 && os
->lma_region
== NULL
5059 && !link_info
.relocatable
)
5062 /* .tbss sections effectively have zero size. */
5063 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5064 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5065 || link_info
.relocatable
)
5066 dot
+= TO_ADDR (os
->bfd_section
->size
);
5068 if (os
->update_dot_tree
!= 0)
5069 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5071 /* Update dot in the region ?
5072 We only do this if the section is going to be allocated,
5073 since unallocated sections do not contribute to the region's
5074 overall size in memory. */
5075 if (os
->region
!= NULL
5076 && (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
)))
5078 os
->region
->current
= dot
;
5081 /* Make sure the new address is within the region. */
5082 os_region_check (os
, os
->region
, os
->addr_tree
,
5083 os
->bfd_section
->vma
);
5085 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
5086 && (os
->bfd_section
->flags
& SEC_LOAD
))
5088 os
->lma_region
->current
5089 = os
->bfd_section
->lma
+ TO_ADDR (os
->bfd_section
->size
);
5092 os_region_check (os
, os
->lma_region
, NULL
,
5093 os
->bfd_section
->lma
);
5099 case lang_constructors_statement_enum
:
5100 dot
= lang_size_sections_1 (&constructor_list
.head
,
5101 output_section_statement
,
5102 fill
, dot
, relax
, check_regions
);
5105 case lang_data_statement_enum
:
5107 unsigned int size
= 0;
5109 s
->data_statement
.output_offset
=
5110 dot
- output_section_statement
->bfd_section
->vma
;
5111 s
->data_statement
.output_section
=
5112 output_section_statement
->bfd_section
;
5114 /* We might refer to provided symbols in the expression, and
5115 need to mark them as needed. */
5116 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5118 switch (s
->data_statement
.type
)
5136 if (size
< TO_SIZE ((unsigned) 1))
5137 size
= TO_SIZE ((unsigned) 1);
5138 dot
+= TO_ADDR (size
);
5139 output_section_statement
->bfd_section
->size
+= size
;
5143 case lang_reloc_statement_enum
:
5147 s
->reloc_statement
.output_offset
=
5148 dot
- output_section_statement
->bfd_section
->vma
;
5149 s
->reloc_statement
.output_section
=
5150 output_section_statement
->bfd_section
;
5151 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
5152 dot
+= TO_ADDR (size
);
5153 output_section_statement
->bfd_section
->size
+= size
;
5157 case lang_wild_statement_enum
:
5158 dot
= lang_size_sections_1 (&s
->wild_statement
.children
.head
,
5159 output_section_statement
,
5160 fill
, dot
, relax
, check_regions
);
5163 case lang_object_symbols_statement_enum
:
5164 link_info
.create_object_symbols_section
=
5165 output_section_statement
->bfd_section
;
5168 case lang_output_statement_enum
:
5169 case lang_target_statement_enum
:
5172 case lang_input_section_enum
:
5176 i
= s
->input_section
.section
;
5181 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
5182 einfo (_("%P%F: can't relax section: %E\n"));
5186 dot
= size_input_section (prev
, output_section_statement
,
5187 output_section_statement
->fill
, dot
);
5191 case lang_input_statement_enum
:
5194 case lang_fill_statement_enum
:
5195 s
->fill_statement
.output_section
=
5196 output_section_statement
->bfd_section
;
5198 fill
= s
->fill_statement
.fill
;
5201 case lang_assignment_statement_enum
:
5203 bfd_vma newdot
= dot
;
5204 etree_type
*tree
= s
->assignment_statement
.exp
;
5206 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5208 exp_fold_tree (tree
,
5209 output_section_statement
->bfd_section
,
5212 if (expld
.dataseg
.relro
== exp_dataseg_relro_start
)
5214 if (!expld
.dataseg
.relro_start_stat
)
5215 expld
.dataseg
.relro_start_stat
= s
;
5218 ASSERT (expld
.dataseg
.relro_start_stat
== s
);
5221 else if (expld
.dataseg
.relro
== exp_dataseg_relro_end
)
5223 if (!expld
.dataseg
.relro_end_stat
)
5224 expld
.dataseg
.relro_end_stat
= s
;
5227 ASSERT (expld
.dataseg
.relro_end_stat
== s
);
5230 expld
.dataseg
.relro
= exp_dataseg_relro_none
;
5232 /* This symbol is relative to this section. */
5233 if ((tree
->type
.node_class
== etree_provided
5234 || tree
->type
.node_class
== etree_assign
)
5235 && (tree
->assign
.dst
[0] != '.'
5236 || tree
->assign
.dst
[1] != '\0'))
5237 output_section_statement
->section_relative_symbol
= 1;
5239 if (!output_section_statement
->ignored
)
5241 if (output_section_statement
== abs_output_section
)
5243 /* If we don't have an output section, then just adjust
5244 the default memory address. */
5245 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
5246 FALSE
)->current
= newdot
;
5248 else if (newdot
!= dot
)
5250 /* Insert a pad after this statement. We can't
5251 put the pad before when relaxing, in case the
5252 assignment references dot. */
5253 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
5254 output_section_statement
->bfd_section
, dot
);
5256 /* Don't neuter the pad below when relaxing. */
5259 /* If dot is advanced, this implies that the section
5260 should have space allocated to it, unless the
5261 user has explicitly stated that the section
5262 should not be allocated. */
5263 if (output_section_statement
->sectype
!= noalloc_section
5264 && (output_section_statement
->sectype
!= noload_section
5265 || (bfd_get_flavour (link_info
.output_bfd
)
5266 == bfd_target_elf_flavour
)))
5267 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
5274 case lang_padding_statement_enum
:
5275 /* If this is the first time lang_size_sections is called,
5276 we won't have any padding statements. If this is the
5277 second or later passes when relaxing, we should allow
5278 padding to shrink. If padding is needed on this pass, it
5279 will be added back in. */
5280 s
->padding_statement
.size
= 0;
5282 /* Make sure output_offset is valid. If relaxation shrinks
5283 the section and this pad isn't needed, it's possible to
5284 have output_offset larger than the final size of the
5285 section. bfd_set_section_contents will complain even for
5286 a pad size of zero. */
5287 s
->padding_statement
.output_offset
5288 = dot
- output_section_statement
->bfd_section
->vma
;
5291 case lang_group_statement_enum
:
5292 dot
= lang_size_sections_1 (&s
->group_statement
.children
.head
,
5293 output_section_statement
,
5294 fill
, dot
, relax
, check_regions
);
5297 case lang_insert_statement_enum
:
5300 /* We can only get here when relaxing is turned on. */
5301 case lang_address_statement_enum
:
5308 prev
= &s
->header
.next
;
5313 /* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5314 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5315 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5316 segments. We are allowed an opportunity to override this decision. */
5319 ldlang_override_segment_assignment (struct bfd_link_info
* info ATTRIBUTE_UNUSED
,
5320 bfd
* abfd ATTRIBUTE_UNUSED
,
5321 asection
* current_section
,
5322 asection
* previous_section
,
5323 bfd_boolean new_segment
)
5325 lang_output_section_statement_type
* cur
;
5326 lang_output_section_statement_type
* prev
;
5328 /* The checks below are only necessary when the BFD library has decided
5329 that the two sections ought to be placed into the same segment. */
5333 /* Paranoia checks. */
5334 if (current_section
== NULL
|| previous_section
== NULL
)
5337 /* Find the memory regions associated with the two sections.
5338 We call lang_output_section_find() here rather than scanning the list
5339 of output sections looking for a matching section pointer because if
5340 we have a large number of sections then a hash lookup is faster. */
5341 cur
= lang_output_section_find (current_section
->name
);
5342 prev
= lang_output_section_find (previous_section
->name
);
5344 /* More paranoia. */
5345 if (cur
== NULL
|| prev
== NULL
)
5348 /* If the regions are different then force the sections to live in
5349 different segments. See the email thread starting at the following
5350 URL for the reasons why this is necessary:
5351 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5352 return cur
->region
!= prev
->region
;
5356 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
5358 lang_statement_iteration
++;
5359 lang_size_sections_1 (&statement_list
.head
, abs_output_section
,
5360 0, 0, relax
, check_regions
);
5364 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
5366 expld
.phase
= lang_allocating_phase_enum
;
5367 expld
.dataseg
.phase
= exp_dataseg_none
;
5369 one_lang_size_sections_pass (relax
, check_regions
);
5370 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
5371 && link_info
.relro
&& expld
.dataseg
.relro_end
)
5373 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
5374 to put expld.dataseg.relro on a (common) page boundary. */
5375 bfd_vma min_base
, old_base
, relro_end
, maxpage
;
5377 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
5378 maxpage
= expld
.dataseg
.maxpagesize
;
5379 /* MIN_BASE is the absolute minimum address we are allowed to start the
5380 read-write segment (byte before will be mapped read-only). */
5381 min_base
= (expld
.dataseg
.min_base
+ maxpage
- 1) & ~(maxpage
- 1);
5382 /* OLD_BASE is the address for a feasible minimum address which will
5383 still not cause a data overlap inside MAXPAGE causing file offset skip
5385 old_base
= expld
.dataseg
.base
;
5386 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
5387 & (expld
.dataseg
.pagesize
- 1));
5388 /* Compute the expected PT_GNU_RELRO segment end. */
5389 relro_end
= ((expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
5390 & ~(expld
.dataseg
.pagesize
- 1));
5391 if (min_base
+ maxpage
< expld
.dataseg
.base
)
5393 expld
.dataseg
.base
-= maxpage
;
5394 relro_end
-= maxpage
;
5396 lang_reset_memory_regions ();
5397 one_lang_size_sections_pass (relax
, check_regions
);
5398 if (expld
.dataseg
.relro_end
> relro_end
)
5400 /* The alignment of sections between DATA_SEGMENT_ALIGN
5401 and DATA_SEGMENT_RELRO_END caused huge padding to be
5402 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5403 that the section alignments will fit in. */
5405 unsigned int max_alignment_power
= 0;
5407 /* Find maximum alignment power of sections between
5408 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
5409 for (sec
= link_info
.output_bfd
->sections
; sec
; sec
= sec
->next
)
5410 if (sec
->vma
>= expld
.dataseg
.base
5411 && sec
->vma
< expld
.dataseg
.relro_end
5412 && sec
->alignment_power
> max_alignment_power
)
5413 max_alignment_power
= sec
->alignment_power
;
5415 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
5417 if (expld
.dataseg
.base
- (1 << max_alignment_power
) < old_base
)
5418 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
5419 expld
.dataseg
.base
-= (1 << max_alignment_power
);
5420 lang_reset_memory_regions ();
5421 one_lang_size_sections_pass (relax
, check_regions
);
5424 link_info
.relro_start
= expld
.dataseg
.base
;
5425 link_info
.relro_end
= expld
.dataseg
.relro_end
;
5427 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
5429 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5430 a page could be saved in the data segment. */
5431 bfd_vma first
, last
;
5433 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
5434 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
5436 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
5437 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
5438 && first
+ last
<= expld
.dataseg
.pagesize
)
5440 expld
.dataseg
.phase
= exp_dataseg_adjust
;
5441 lang_reset_memory_regions ();
5442 one_lang_size_sections_pass (relax
, check_regions
);
5445 expld
.dataseg
.phase
= exp_dataseg_done
;
5448 expld
.dataseg
.phase
= exp_dataseg_done
;
5451 /* Worker function for lang_do_assignments. Recursiveness goes here. */
5454 lang_do_assignments_1 (lang_statement_union_type
*s
,
5455 lang_output_section_statement_type
*current_os
,
5459 for (; s
!= NULL
; s
= s
->header
.next
)
5461 switch (s
->header
.type
)
5463 case lang_constructors_statement_enum
:
5464 dot
= lang_do_assignments_1 (constructor_list
.head
,
5465 current_os
, fill
, dot
);
5468 case lang_output_section_statement_enum
:
5470 lang_output_section_statement_type
*os
;
5472 os
= &(s
->output_section_statement
);
5473 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
5475 dot
= os
->bfd_section
->vma
;
5477 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
5479 /* .tbss sections effectively have zero size. */
5480 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
5481 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
5482 || link_info
.relocatable
)
5483 dot
+= TO_ADDR (os
->bfd_section
->size
);
5485 if (os
->update_dot_tree
!= NULL
)
5486 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
5491 case lang_wild_statement_enum
:
5493 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
5494 current_os
, fill
, dot
);
5497 case lang_object_symbols_statement_enum
:
5498 case lang_output_statement_enum
:
5499 case lang_target_statement_enum
:
5502 case lang_data_statement_enum
:
5503 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
5504 if (expld
.result
.valid_p
)
5506 s
->data_statement
.value
= expld
.result
.value
;
5507 if (expld
.result
.section
!= NULL
)
5508 s
->data_statement
.value
+= expld
.result
.section
->vma
;
5511 einfo (_("%F%P: invalid data statement\n"));
5514 switch (s
->data_statement
.type
)
5532 if (size
< TO_SIZE ((unsigned) 1))
5533 size
= TO_SIZE ((unsigned) 1);
5534 dot
+= TO_ADDR (size
);
5538 case lang_reloc_statement_enum
:
5539 exp_fold_tree (s
->reloc_statement
.addend_exp
,
5540 bfd_abs_section_ptr
, &dot
);
5541 if (expld
.result
.valid_p
)
5542 s
->reloc_statement
.addend_value
= expld
.result
.value
;
5544 einfo (_("%F%P: invalid reloc statement\n"));
5545 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
5548 case lang_input_section_enum
:
5550 asection
*in
= s
->input_section
.section
;
5552 if ((in
->flags
& SEC_EXCLUDE
) == 0)
5553 dot
+= TO_ADDR (in
->size
);
5557 case lang_input_statement_enum
:
5560 case lang_fill_statement_enum
:
5561 fill
= s
->fill_statement
.fill
;
5564 case lang_assignment_statement_enum
:
5565 exp_fold_tree (s
->assignment_statement
.exp
,
5566 current_os
->bfd_section
,
5570 case lang_padding_statement_enum
:
5571 dot
+= TO_ADDR (s
->padding_statement
.size
);
5574 case lang_group_statement_enum
:
5575 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
5576 current_os
, fill
, dot
);
5579 case lang_insert_statement_enum
:
5582 case lang_address_statement_enum
:
5594 lang_do_assignments (void)
5596 lang_statement_iteration
++;
5597 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
5600 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5601 operator .startof. (section_name), it produces an undefined symbol
5602 .startof.section_name. Similarly, when it sees
5603 .sizeof. (section_name), it produces an undefined symbol
5604 .sizeof.section_name. For all the output sections, we look for
5605 such symbols, and set them to the correct value. */
5608 lang_set_startof (void)
5612 if (link_info
.relocatable
)
5615 for (s
= link_info
.output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5617 const char *secname
;
5619 struct bfd_link_hash_entry
*h
;
5621 secname
= bfd_get_section_name (link_info
.output_bfd
, s
);
5622 buf
= (char *) xmalloc (10 + strlen (secname
));
5624 sprintf (buf
, ".startof.%s", secname
);
5625 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5626 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5628 h
->type
= bfd_link_hash_defined
;
5629 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, s
);
5630 h
->u
.def
.section
= bfd_abs_section_ptr
;
5633 sprintf (buf
, ".sizeof.%s", secname
);
5634 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
5635 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
5637 h
->type
= bfd_link_hash_defined
;
5638 h
->u
.def
.value
= TO_ADDR (s
->size
);
5639 h
->u
.def
.section
= bfd_abs_section_ptr
;
5649 struct bfd_link_hash_entry
*h
;
5652 if ((link_info
.relocatable
&& !link_info
.gc_sections
)
5653 || (link_info
.shared
&& !link_info
.executable
))
5654 warn
= entry_from_cmdline
;
5658 /* Force the user to specify a root when generating a relocatable with
5660 if (link_info
.gc_sections
&& link_info
.relocatable
5661 && !(entry_from_cmdline
|| undef_from_cmdline
))
5662 einfo (_("%P%F: gc-sections requires either an entry or "
5663 "an undefined symbol\n"));
5665 if (entry_symbol
.name
== NULL
)
5667 /* No entry has been specified. Look for the default entry, but
5668 don't warn if we don't find it. */
5669 entry_symbol
.name
= entry_symbol_default
;
5673 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
5674 FALSE
, FALSE
, TRUE
);
5676 && (h
->type
== bfd_link_hash_defined
5677 || h
->type
== bfd_link_hash_defweak
)
5678 && h
->u
.def
.section
->output_section
!= NULL
)
5682 val
= (h
->u
.def
.value
5683 + bfd_get_section_vma (link_info
.output_bfd
,
5684 h
->u
.def
.section
->output_section
)
5685 + h
->u
.def
.section
->output_offset
);
5686 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5687 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
5694 /* We couldn't find the entry symbol. Try parsing it as a
5696 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
5699 if (! bfd_set_start_address (link_info
.output_bfd
, val
))
5700 einfo (_("%P%F: can't set start address\n"));
5706 /* Can't find the entry symbol, and it's not a number. Use
5707 the first address in the text section. */
5708 ts
= bfd_get_section_by_name (link_info
.output_bfd
, entry_section
);
5712 einfo (_("%P: warning: cannot find entry symbol %s;"
5713 " defaulting to %V\n"),
5715 bfd_get_section_vma (link_info
.output_bfd
, ts
));
5716 if (!(bfd_set_start_address
5717 (link_info
.output_bfd
,
5718 bfd_get_section_vma (link_info
.output_bfd
, ts
))))
5719 einfo (_("%P%F: can't set start address\n"));
5724 einfo (_("%P: warning: cannot find entry symbol %s;"
5725 " not setting start address\n"),
5731 /* Don't bfd_hash_table_free (&lang_definedness_table);
5732 map file output may result in a call of lang_track_definedness. */
5735 /* This is a small function used when we want to ignore errors from
5739 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
5741 /* Don't do anything. */
5744 /* Check that the architecture of all the input files is compatible
5745 with the output file. Also call the backend to let it do any
5746 other checking that is needed. */
5751 lang_statement_union_type
*file
;
5753 const bfd_arch_info_type
*compatible
;
5755 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
5757 #ifdef ENABLE_PLUGINS
5758 /* Don't check format of files claimed by plugin. */
5759 if (file
->input_statement
.claimed
)
5761 #endif /* ENABLE_PLUGINS */
5762 input_bfd
= file
->input_statement
.the_bfd
;
5764 = bfd_arch_get_compatible (input_bfd
, link_info
.output_bfd
,
5765 command_line
.accept_unknown_input_arch
);
5767 /* In general it is not possible to perform a relocatable
5768 link between differing object formats when the input
5769 file has relocations, because the relocations in the
5770 input format may not have equivalent representations in
5771 the output format (and besides BFD does not translate
5772 relocs for other link purposes than a final link). */
5773 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
5774 && (compatible
== NULL
5775 || (bfd_get_flavour (input_bfd
)
5776 != bfd_get_flavour (link_info
.output_bfd
)))
5777 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
5779 einfo (_("%P%F: Relocatable linking with relocations from"
5780 " format %s (%B) to format %s (%B) is not supported\n"),
5781 bfd_get_target (input_bfd
), input_bfd
,
5782 bfd_get_target (link_info
.output_bfd
), link_info
.output_bfd
);
5783 /* einfo with %F exits. */
5786 if (compatible
== NULL
)
5788 if (command_line
.warn_mismatch
)
5789 einfo (_("%P%X: %s architecture of input file `%B'"
5790 " is incompatible with %s output\n"),
5791 bfd_printable_name (input_bfd
), input_bfd
,
5792 bfd_printable_name (link_info
.output_bfd
));
5794 else if (bfd_count_sections (input_bfd
))
5796 /* If the input bfd has no contents, it shouldn't set the
5797 private data of the output bfd. */
5799 bfd_error_handler_type pfn
= NULL
;
5801 /* If we aren't supposed to warn about mismatched input
5802 files, temporarily set the BFD error handler to a
5803 function which will do nothing. We still want to call
5804 bfd_merge_private_bfd_data, since it may set up
5805 information which is needed in the output file. */
5806 if (! command_line
.warn_mismatch
)
5807 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
5808 if (! bfd_merge_private_bfd_data (input_bfd
, link_info
.output_bfd
))
5810 if (command_line
.warn_mismatch
)
5811 einfo (_("%P%X: failed to merge target specific data"
5812 " of file %B\n"), input_bfd
);
5814 if (! command_line
.warn_mismatch
)
5815 bfd_set_error_handler (pfn
);
5820 /* Look through all the global common symbols and attach them to the
5821 correct section. The -sort-common command line switch may be used
5822 to roughly sort the entries by alignment. */
5827 if (command_line
.inhibit_common_definition
)
5829 if (link_info
.relocatable
5830 && ! command_line
.force_common_definition
)
5833 if (! config
.sort_common
)
5834 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
5839 if (config
.sort_common
== sort_descending
)
5841 for (power
= 4; power
> 0; power
--)
5842 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5845 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5849 for (power
= 0; power
<= 4; power
++)
5850 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5853 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
5858 /* Place one common symbol in the correct section. */
5861 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
5863 unsigned int power_of_two
;
5867 if (h
->type
!= bfd_link_hash_common
)
5871 power_of_two
= h
->u
.c
.p
->alignment_power
;
5873 if (config
.sort_common
== sort_descending
5874 && power_of_two
< *(unsigned int *) info
)
5876 else if (config
.sort_common
== sort_ascending
5877 && power_of_two
> *(unsigned int *) info
)
5880 section
= h
->u
.c
.p
->section
;
5881 if (!bfd_define_common_symbol (link_info
.output_bfd
, &link_info
, h
))
5882 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5885 if (config
.map_file
!= NULL
)
5887 static bfd_boolean header_printed
;
5892 if (! header_printed
)
5894 minfo (_("\nAllocating common symbols\n"));
5895 minfo (_("Common symbol size file\n\n"));
5896 header_printed
= TRUE
;
5899 name
= bfd_demangle (link_info
.output_bfd
, h
->root
.string
,
5900 DMGL_ANSI
| DMGL_PARAMS
);
5903 minfo ("%s", h
->root
.string
);
5904 len
= strlen (h
->root
.string
);
5909 len
= strlen (name
);
5925 if (size
<= 0xffffffff)
5926 sprintf (buf
, "%lx", (unsigned long) size
);
5928 sprintf_vma (buf
, size
);
5938 minfo ("%B\n", section
->owner
);
5944 /* Run through the input files and ensure that every input section has
5945 somewhere to go. If one is found without a destination then create
5946 an input request and place it into the statement tree. */
5949 lang_place_orphans (void)
5951 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5955 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5957 if (s
->output_section
== NULL
)
5959 /* This section of the file is not attached, root
5960 around for a sensible place for it to go. */
5962 if (file
->just_syms_flag
)
5963 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5964 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5965 s
->output_section
= bfd_abs_section_ptr
;
5966 else if (strcmp (s
->name
, "COMMON") == 0)
5968 /* This is a lonely common section which must have
5969 come from an archive. We attach to the section
5970 with the wildcard. */
5971 if (! link_info
.relocatable
5972 || command_line
.force_common_definition
)
5974 if (default_common_section
== NULL
)
5975 default_common_section
5976 = lang_output_section_statement_lookup (".bss", 0,
5978 lang_add_section (&default_common_section
->children
, s
,
5979 default_common_section
);
5984 const char *name
= s
->name
;
5987 if (config
.unique_orphan_sections
5988 || unique_section_p (s
, NULL
))
5989 constraint
= SPECIAL
;
5991 if (!ldemul_place_orphan (s
, name
, constraint
))
5993 lang_output_section_statement_type
*os
;
5994 os
= lang_output_section_statement_lookup (name
,
5997 if (os
->addr_tree
== NULL
5998 && (link_info
.relocatable
5999 || (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0))
6000 os
->addr_tree
= exp_intop (0);
6001 lang_add_section (&os
->children
, s
, os
);
6010 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
6012 flagword
*ptr_flags
;
6014 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
6020 *ptr_flags
|= SEC_ALLOC
;
6024 *ptr_flags
|= SEC_READONLY
;
6028 *ptr_flags
|= SEC_DATA
;
6032 *ptr_flags
|= SEC_CODE
;
6037 *ptr_flags
|= SEC_LOAD
;
6041 einfo (_("%P%F: invalid syntax in flags\n"));
6048 /* Call a function on each input file. This function will be called
6049 on an archive, but not on the elements. */
6052 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
6054 lang_input_statement_type
*f
;
6056 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
6058 f
= (lang_input_statement_type
*) f
->next_real_file
)
6062 /* Call a function on each file. The function will be called on all
6063 the elements of an archive which are included in the link, but will
6064 not be called on the archive file itself. */
6067 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
6069 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6076 ldlang_add_file (lang_input_statement_type
*entry
)
6078 lang_statement_append (&file_chain
,
6079 (lang_statement_union_type
*) entry
,
6082 /* The BFD linker needs to have a list of all input BFDs involved in
6084 ASSERT (entry
->the_bfd
->link_next
== NULL
);
6085 ASSERT (entry
->the_bfd
!= link_info
.output_bfd
);
6087 *link_info
.input_bfds_tail
= entry
->the_bfd
;
6088 link_info
.input_bfds_tail
= &entry
->the_bfd
->link_next
;
6089 entry
->the_bfd
->usrdata
= entry
;
6090 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
6092 /* Look through the sections and check for any which should not be
6093 included in the link. We need to do this now, so that we can
6094 notice when the backend linker tries to report multiple
6095 definition errors for symbols which are in sections we aren't
6096 going to link. FIXME: It might be better to entirely ignore
6097 symbols which are defined in sections which are going to be
6098 discarded. This would require modifying the backend linker for
6099 each backend which might set the SEC_LINK_ONCE flag. If we do
6100 this, we should probably handle SEC_EXCLUDE in the same way. */
6102 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
6106 lang_add_output (const char *name
, int from_script
)
6108 /* Make -o on command line override OUTPUT in script. */
6109 if (!had_output_filename
|| !from_script
)
6111 output_filename
= name
;
6112 had_output_filename
= TRUE
;
6116 static lang_output_section_statement_type
*current_section
;
6127 for (l
= 0; l
< 32; l
++)
6129 if (i
>= (unsigned int) x
)
6137 lang_output_section_statement_type
*
6138 lang_enter_output_section_statement (const char *output_section_statement_name
,
6139 etree_type
*address_exp
,
6140 enum section_type sectype
,
6142 etree_type
*subalign
,
6146 lang_output_section_statement_type
*os
;
6148 os
= lang_output_section_statement_lookup (output_section_statement_name
,
6150 current_section
= os
;
6152 if (os
->addr_tree
== NULL
)
6154 os
->addr_tree
= address_exp
;
6156 os
->sectype
= sectype
;
6157 if (sectype
!= noload_section
)
6158 os
->flags
= SEC_NO_FLAGS
;
6160 os
->flags
= SEC_NEVER_LOAD
;
6161 os
->block_value
= 1;
6163 /* Make next things chain into subchain of this. */
6164 push_stat_ptr (&os
->children
);
6166 os
->subsection_alignment
=
6167 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
6168 os
->section_alignment
=
6169 topower (exp_get_value_int (align
, -1, "section alignment"));
6171 os
->load_base
= ebase
;
6178 lang_output_statement_type
*new_stmt
;
6180 new_stmt
= new_stat (lang_output_statement
, stat_ptr
);
6181 new_stmt
->name
= output_filename
;
6185 /* Reset the current counters in the regions. */
6188 lang_reset_memory_regions (void)
6190 lang_memory_region_type
*p
= lang_memory_region_list
;
6192 lang_output_section_statement_type
*os
;
6194 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
6196 p
->current
= p
->origin
;
6200 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6204 os
->processed_vma
= FALSE
;
6205 os
->processed_lma
= FALSE
;
6208 for (o
= link_info
.output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
6210 /* Save the last size for possible use by bfd_relax_section. */
6211 o
->rawsize
= o
->size
;
6216 /* Worker for lang_gc_sections_1. */
6219 gc_section_callback (lang_wild_statement_type
*ptr
,
6220 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6222 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6223 void *data ATTRIBUTE_UNUSED
)
6225 /* If the wild pattern was marked KEEP, the member sections
6226 should be as well. */
6227 if (ptr
->keep_sections
)
6228 section
->flags
|= SEC_KEEP
;
6231 /* Iterate over sections marking them against GC. */
6234 lang_gc_sections_1 (lang_statement_union_type
*s
)
6236 for (; s
!= NULL
; s
= s
->header
.next
)
6238 switch (s
->header
.type
)
6240 case lang_wild_statement_enum
:
6241 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
6243 case lang_constructors_statement_enum
:
6244 lang_gc_sections_1 (constructor_list
.head
);
6246 case lang_output_section_statement_enum
:
6247 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
6249 case lang_group_statement_enum
:
6250 lang_gc_sections_1 (s
->group_statement
.children
.head
);
6259 lang_gc_sections (void)
6261 /* Keep all sections so marked in the link script. */
6263 lang_gc_sections_1 (statement_list
.head
);
6265 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6266 the special case of debug info. (See bfd/stabs.c)
6267 Twiddle the flag here, to simplify later linker code. */
6268 if (link_info
.relocatable
)
6270 LANG_FOR_EACH_INPUT_STATEMENT (f
)
6273 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
6274 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
6275 sec
->flags
&= ~SEC_EXCLUDE
;
6279 if (link_info
.gc_sections
)
6280 bfd_gc_sections (link_info
.output_bfd
, &link_info
);
6283 /* Worker for lang_find_relro_sections_1. */
6286 find_relro_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
6287 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
6289 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
6292 /* Discarded, excluded and ignored sections effectively have zero
6294 if (section
->output_section
!= NULL
6295 && section
->output_section
->owner
== link_info
.output_bfd
6296 && (section
->output_section
->flags
& SEC_EXCLUDE
) == 0
6297 && !IGNORE_SECTION (section
)
6298 && section
->size
!= 0)
6300 bfd_boolean
*has_relro_section
= (bfd_boolean
*) data
;
6301 *has_relro_section
= TRUE
;
6305 /* Iterate over sections for relro sections. */
6308 lang_find_relro_sections_1 (lang_statement_union_type
*s
,
6309 bfd_boolean
*has_relro_section
)
6311 if (*has_relro_section
)
6314 for (; s
!= NULL
; s
= s
->header
.next
)
6316 if (s
== expld
.dataseg
.relro_end_stat
)
6319 switch (s
->header
.type
)
6321 case lang_wild_statement_enum
:
6322 walk_wild (&s
->wild_statement
,
6323 find_relro_section_callback
,
6326 case lang_constructors_statement_enum
:
6327 lang_find_relro_sections_1 (constructor_list
.head
,
6330 case lang_output_section_statement_enum
:
6331 lang_find_relro_sections_1 (s
->output_section_statement
.children
.head
,
6334 case lang_group_statement_enum
:
6335 lang_find_relro_sections_1 (s
->group_statement
.children
.head
,
6345 lang_find_relro_sections (void)
6347 bfd_boolean has_relro_section
= FALSE
;
6349 /* Check all sections in the link script. */
6351 lang_find_relro_sections_1 (expld
.dataseg
.relro_start_stat
,
6352 &has_relro_section
);
6354 if (!has_relro_section
)
6355 link_info
.relro
= FALSE
;
6358 /* Relax all sections until bfd_relax_section gives up. */
6361 lang_relax_sections (bfd_boolean need_layout
)
6363 if (RELAXATION_ENABLED
)
6365 /* We may need more than one relaxation pass. */
6366 int i
= link_info
.relax_pass
;
6368 /* The backend can use it to determine the current pass. */
6369 link_info
.relax_pass
= 0;
6373 /* Keep relaxing until bfd_relax_section gives up. */
6374 bfd_boolean relax_again
;
6376 link_info
.relax_trip
= -1;
6379 link_info
.relax_trip
++;
6381 /* Note: pe-dll.c does something like this also. If you find
6382 you need to change this code, you probably need to change
6383 pe-dll.c also. DJ */
6385 /* Do all the assignments with our current guesses as to
6387 lang_do_assignments ();
6389 /* We must do this after lang_do_assignments, because it uses
6391 lang_reset_memory_regions ();
6393 /* Perform another relax pass - this time we know where the
6394 globals are, so can make a better guess. */
6395 relax_again
= FALSE
;
6396 lang_size_sections (&relax_again
, FALSE
);
6398 while (relax_again
);
6400 link_info
.relax_pass
++;
6407 /* Final extra sizing to report errors. */
6408 lang_do_assignments ();
6409 lang_reset_memory_regions ();
6410 lang_size_sections (NULL
, TRUE
);
6414 #ifdef ENABLE_PLUGINS
6415 /* Find the insert point for the plugin's replacement files. We
6416 place them after the first claimed real object file, or if the
6417 first claimed object is an archive member, after the last real
6418 object file immediately preceding the archive. In the event
6419 no objects have been claimed at all, we return the first dummy
6420 object file on the list as the insert point; that works, but
6421 the callee must be careful when relinking the file_chain as it
6422 is not actually on that chain, only the statement_list and the
6423 input_file list; in that case, the replacement files must be
6424 inserted at the head of the file_chain. */
6426 static lang_input_statement_type
*
6427 find_replacements_insert_point (void)
6429 lang_input_statement_type
*claim1
, *lastobject
;
6430 lastobject
= &input_file_chain
.head
->input_statement
;
6431 for (claim1
= &file_chain
.head
->input_statement
;
6433 claim1
= &claim1
->next
->input_statement
)
6435 if (claim1
->claimed
)
6436 return claim1
->claim_archive
? lastobject
: claim1
;
6437 /* Update lastobject if this is a real object file. */
6438 if (claim1
->the_bfd
&& (claim1
->the_bfd
->my_archive
== NULL
))
6439 lastobject
= claim1
;
6441 /* No files were claimed by the plugin. Choose the last object
6442 file found on the list (maybe the first, dummy entry) as the
6446 #endif /* ENABLE_PLUGINS */
6451 /* Finalize dynamic list. */
6452 if (link_info
.dynamic_list
)
6453 lang_finalize_version_expr_head (&link_info
.dynamic_list
->head
);
6455 current_target
= default_target
;
6457 /* Open the output file. */
6458 lang_for_each_statement (ldlang_open_output
);
6461 ldemul_create_output_section_statements ();
6463 /* Add to the hash table all undefineds on the command line. */
6464 lang_place_undefineds ();
6466 if (!bfd_section_already_linked_table_init ())
6467 einfo (_("%P%F: Failed to create hash table\n"));
6469 /* Create a bfd for each input file. */
6470 current_target
= default_target
;
6471 open_input_bfds (statement_list
.head
, FALSE
);
6473 #ifdef ENABLE_PLUGINS
6474 if (plugin_active_plugins_p ())
6476 lang_statement_list_type added
;
6477 lang_statement_list_type files
, inputfiles
;
6478 /* Now all files are read, let the plugin(s) decide if there
6479 are any more to be added to the link before we call the
6480 emulation's after_open hook. We create a private list of
6481 input statements for this purpose, which we will eventually
6482 insert into the global statment list after the first claimed
6485 /* We need to manipulate all three chains in synchrony. */
6487 inputfiles
= input_file_chain
;
6488 if (plugin_call_all_symbols_read ())
6489 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6490 plugin_error_plugin ());
6491 /* Open any newly added files, updating the file chains. */
6492 open_input_bfds (added
.head
, FALSE
);
6493 /* Restore the global list pointer now they have all been added. */
6494 lang_list_remove_tail (stat_ptr
, &added
);
6495 /* And detach the fresh ends of the file lists. */
6496 lang_list_remove_tail (&file_chain
, &files
);
6497 lang_list_remove_tail (&input_file_chain
, &inputfiles
);
6498 /* Were any new files added? */
6499 if (added
.head
!= NULL
)
6501 /* If so, we will insert them into the statement list immediately
6502 after the first input file that was claimed by the plugin. */
6503 lang_input_statement_type
*claim1
= find_replacements_insert_point ();
6504 /* If a plugin adds input files without having claimed any, we
6505 don't really have a good idea where to place them. Just putting
6506 them at the start or end of the list is liable to leave them
6507 outside the crtbegin...crtend range. */
6508 ASSERT (claim1
!= NULL
);
6509 /* Splice the new statement list into the old one after claim1. */
6510 lang_list_insert_after (stat_ptr
, &added
, &claim1
->header
.next
);
6511 /* Likewise for the file chains. */
6512 lang_list_insert_after (&input_file_chain
, &inputfiles
,
6513 &claim1
->next_real_file
);
6514 /* We must be careful when relinking file_chain; we may need to
6515 insert the new files at the head of the list if the insert
6516 point chosen is the dummy first input file. */
6517 if (claim1
->filename
)
6518 lang_list_insert_after (&file_chain
, &files
, &claim1
->next
);
6520 lang_list_insert_after (&file_chain
, &files
, &file_chain
.head
);
6523 #endif /* ENABLE_PLUGINS */
6525 link_info
.gc_sym_list
= &entry_symbol
;
6526 if (entry_symbol
.name
== NULL
)
6527 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
6529 ldemul_after_open ();
6531 bfd_section_already_linked_table_free ();
6533 /* Make sure that we're not mixing architectures. We call this
6534 after all the input files have been opened, but before we do any
6535 other processing, so that any operations merge_private_bfd_data
6536 does on the output file will be known during the rest of the
6540 /* Handle .exports instead of a version script if we're told to do so. */
6541 if (command_line
.version_exports_section
)
6542 lang_do_version_exports_section ();
6544 /* Build all sets based on the information gathered from the input
6546 ldctor_build_sets ();
6548 /* Remove unreferenced sections if asked to. */
6549 lang_gc_sections ();
6551 /* Size up the common data. */
6554 /* Update wild statements. */
6555 update_wild_statements (statement_list
.head
);
6557 /* Run through the contours of the script and attach input sections
6558 to the correct output sections. */
6559 lang_statement_iteration
++;
6560 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
6562 process_insert_statements ();
6564 /* Find any sections not attached explicitly and handle them. */
6565 lang_place_orphans ();
6567 if (! link_info
.relocatable
)
6571 /* Merge SEC_MERGE sections. This has to be done after GC of
6572 sections, so that GCed sections are not merged, but before
6573 assigning dynamic symbols, since removing whole input sections
6575 bfd_merge_sections (link_info
.output_bfd
, &link_info
);
6577 /* Look for a text section and set the readonly attribute in it. */
6578 found
= bfd_get_section_by_name (link_info
.output_bfd
, ".text");
6582 if (config
.text_read_only
)
6583 found
->flags
|= SEC_READONLY
;
6585 found
->flags
&= ~SEC_READONLY
;
6589 /* Do anything special before sizing sections. This is where ELF
6590 and other back-ends size dynamic sections. */
6591 ldemul_before_allocation ();
6593 /* We must record the program headers before we try to fix the
6594 section positions, since they will affect SIZEOF_HEADERS. */
6595 lang_record_phdrs ();
6597 /* Check relro sections. */
6598 if (link_info
.relro
&& ! link_info
.relocatable
)
6599 lang_find_relro_sections ();
6601 /* Size up the sections. */
6602 lang_size_sections (NULL
, ! RELAXATION_ENABLED
);
6604 /* See if anything special should be done now we know how big
6605 everything is. This is where relaxation is done. */
6606 ldemul_after_allocation ();
6608 /* Fix any .startof. or .sizeof. symbols. */
6609 lang_set_startof ();
6611 /* Do all the assignments, now that we know the final resting places
6612 of all the symbols. */
6613 expld
.phase
= lang_final_phase_enum
;
6614 lang_do_assignments ();
6618 /* Make sure that the section addresses make sense. */
6619 if (command_line
.check_section_addresses
)
6620 lang_check_section_addresses ();
6625 /* EXPORTED TO YACC */
6628 lang_add_wild (struct wildcard_spec
*filespec
,
6629 struct wildcard_list
*section_list
,
6630 bfd_boolean keep_sections
)
6632 struct wildcard_list
*curr
, *next
;
6633 lang_wild_statement_type
*new_stmt
;
6635 /* Reverse the list as the parser puts it back to front. */
6636 for (curr
= section_list
, section_list
= NULL
;
6638 section_list
= curr
, curr
= next
)
6640 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
6641 placed_commons
= TRUE
;
6644 curr
->next
= section_list
;
6647 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
6649 if (strcmp (filespec
->name
, "*") == 0)
6650 filespec
->name
= NULL
;
6651 else if (! wildcardp (filespec
->name
))
6652 lang_has_input_file
= TRUE
;
6655 new_stmt
= new_stat (lang_wild_statement
, stat_ptr
);
6656 new_stmt
->filename
= NULL
;
6657 new_stmt
->filenames_sorted
= FALSE
;
6658 if (filespec
!= NULL
)
6660 new_stmt
->filename
= filespec
->name
;
6661 new_stmt
->filenames_sorted
= filespec
->sorted
== by_name
;
6663 new_stmt
->section_list
= section_list
;
6664 new_stmt
->keep_sections
= keep_sections
;
6665 lang_list_init (&new_stmt
->children
);
6666 analyze_walk_wild_section_handler (new_stmt
);
6670 lang_section_start (const char *name
, etree_type
*address
,
6671 const segment_type
*segment
)
6673 lang_address_statement_type
*ad
;
6675 ad
= new_stat (lang_address_statement
, stat_ptr
);
6676 ad
->section_name
= name
;
6677 ad
->address
= address
;
6678 ad
->segment
= segment
;
6681 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6682 because of a -e argument on the command line, or zero if this is
6683 called by ENTRY in a linker script. Command line arguments take
6687 lang_add_entry (const char *name
, bfd_boolean cmdline
)
6689 if (entry_symbol
.name
== NULL
6691 || ! entry_from_cmdline
)
6693 entry_symbol
.name
= name
;
6694 entry_from_cmdline
= cmdline
;
6698 /* Set the default start symbol to NAME. .em files should use this,
6699 not lang_add_entry, to override the use of "start" if neither the
6700 linker script nor the command line specifies an entry point. NAME
6701 must be permanently allocated. */
6703 lang_default_entry (const char *name
)
6705 entry_symbol_default
= name
;
6709 lang_add_target (const char *name
)
6711 lang_target_statement_type
*new_stmt
;
6713 new_stmt
= new_stat (lang_target_statement
, stat_ptr
);
6714 new_stmt
->target
= name
;
6718 lang_add_map (const char *name
)
6725 map_option_f
= TRUE
;
6733 lang_add_fill (fill_type
*fill
)
6735 lang_fill_statement_type
*new_stmt
;
6737 new_stmt
= new_stat (lang_fill_statement
, stat_ptr
);
6738 new_stmt
->fill
= fill
;
6742 lang_add_data (int type
, union etree_union
*exp
)
6744 lang_data_statement_type
*new_stmt
;
6746 new_stmt
= new_stat (lang_data_statement
, stat_ptr
);
6747 new_stmt
->exp
= exp
;
6748 new_stmt
->type
= type
;
6751 /* Create a new reloc statement. RELOC is the BFD relocation type to
6752 generate. HOWTO is the corresponding howto structure (we could
6753 look this up, but the caller has already done so). SECTION is the
6754 section to generate a reloc against, or NAME is the name of the
6755 symbol to generate a reloc against. Exactly one of SECTION and
6756 NAME must be NULL. ADDEND is an expression for the addend. */
6759 lang_add_reloc (bfd_reloc_code_real_type reloc
,
6760 reloc_howto_type
*howto
,
6763 union etree_union
*addend
)
6765 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
6769 p
->section
= section
;
6771 p
->addend_exp
= addend
;
6773 p
->addend_value
= 0;
6774 p
->output_section
= NULL
;
6775 p
->output_offset
= 0;
6778 lang_assignment_statement_type
*
6779 lang_add_assignment (etree_type
*exp
)
6781 lang_assignment_statement_type
*new_stmt
;
6783 new_stmt
= new_stat (lang_assignment_statement
, stat_ptr
);
6784 new_stmt
->exp
= exp
;
6789 lang_add_attribute (enum statement_enum attribute
)
6791 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
6795 lang_startup (const char *name
)
6797 if (first_file
->filename
!= NULL
)
6799 einfo (_("%P%F: multiple STARTUP files\n"));
6801 first_file
->filename
= name
;
6802 first_file
->local_sym_name
= name
;
6803 first_file
->real
= TRUE
;
6807 lang_float (bfd_boolean maybe
)
6809 lang_float_flag
= maybe
;
6813 /* Work out the load- and run-time regions from a script statement, and
6814 store them in *LMA_REGION and *REGION respectively.
6816 MEMSPEC is the name of the run-time region, or the value of
6817 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6818 LMA_MEMSPEC is the name of the load-time region, or null if the
6819 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6820 had an explicit load address.
6822 It is an error to specify both a load region and a load address. */
6825 lang_get_regions (lang_memory_region_type
**region
,
6826 lang_memory_region_type
**lma_region
,
6827 const char *memspec
,
6828 const char *lma_memspec
,
6829 bfd_boolean have_lma
,
6830 bfd_boolean have_vma
)
6832 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
6834 /* If no runtime region or VMA has been specified, but the load region
6835 has been specified, then use the load region for the runtime region
6837 if (lma_memspec
!= NULL
6839 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
6840 *region
= *lma_region
;
6842 *region
= lang_memory_region_lookup (memspec
, FALSE
);
6844 if (have_lma
&& lma_memspec
!= 0)
6845 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6849 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
6850 lang_output_section_phdr_list
*phdrs
,
6851 const char *lma_memspec
)
6853 lang_get_regions (¤t_section
->region
,
6854 ¤t_section
->lma_region
,
6855 memspec
, lma_memspec
,
6856 current_section
->load_base
!= NULL
,
6857 current_section
->addr_tree
!= NULL
);
6859 /* If this section has no load region or base, but has the same
6860 region as the previous section, then propagate the previous
6861 section's load region. */
6863 if (!current_section
->lma_region
&& !current_section
->load_base
6864 && current_section
->region
== current_section
->prev
->region
)
6865 current_section
->lma_region
= current_section
->prev
->lma_region
;
6867 current_section
->fill
= fill
;
6868 current_section
->phdrs
= phdrs
;
6872 /* Create an absolute symbol with the given name with the value of the
6873 address of first byte of the section named.
6875 If the symbol already exists, then do nothing. */
6878 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
6880 struct bfd_link_hash_entry
*h
;
6882 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6884 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6886 if (h
->type
== bfd_link_hash_new
6887 || h
->type
== bfd_link_hash_undefined
)
6891 h
->type
= bfd_link_hash_defined
;
6893 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6897 h
->u
.def
.value
= bfd_get_section_vma (link_info
.output_bfd
, sec
);
6899 h
->u
.def
.section
= bfd_abs_section_ptr
;
6903 /* Create an absolute symbol with the given name with the value of the
6904 address of the first byte after the end of the section named.
6906 If the symbol already exists, then do nothing. */
6909 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
6911 struct bfd_link_hash_entry
*h
;
6913 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
6915 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6917 if (h
->type
== bfd_link_hash_new
6918 || h
->type
== bfd_link_hash_undefined
)
6922 h
->type
= bfd_link_hash_defined
;
6924 sec
= bfd_get_section_by_name (link_info
.output_bfd
, secname
);
6928 h
->u
.def
.value
= (bfd_get_section_vma (link_info
.output_bfd
, sec
)
6929 + TO_ADDR (sec
->size
));
6931 h
->u
.def
.section
= bfd_abs_section_ptr
;
6936 lang_statement_append (lang_statement_list_type
*list
,
6937 lang_statement_union_type
*element
,
6938 lang_statement_union_type
**field
)
6940 *(list
->tail
) = element
;
6944 #ifdef ENABLE_PLUGINS
6945 /* Insert SRCLIST into DESTLIST after given element by chaining
6946 on FIELD as the next-pointer. (Counterintuitively does not need
6947 a pointer to the actual after-node itself, just its chain field.) */
6950 lang_list_insert_after (lang_statement_list_type
*destlist
,
6951 lang_statement_list_type
*srclist
,
6952 lang_statement_union_type
**field
)
6954 *(srclist
->tail
) = *field
;
6955 *field
= srclist
->head
;
6956 if (destlist
->tail
== field
)
6957 destlist
->tail
= srclist
->tail
;
6960 /* Detach new nodes added to DESTLIST since the time ORIGLIST
6961 was taken as a copy of it and leave them in ORIGLIST. */
6964 lang_list_remove_tail (lang_statement_list_type
*destlist
,
6965 lang_statement_list_type
*origlist
)
6967 union lang_statement_union
**savetail
;
6968 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6969 ASSERT (origlist
->head
== destlist
->head
);
6970 savetail
= origlist
->tail
;
6971 origlist
->head
= *(savetail
);
6972 origlist
->tail
= destlist
->tail
;
6973 destlist
->tail
= savetail
;
6976 #endif /* ENABLE_PLUGINS */
6978 /* Set the output format type. -oformat overrides scripts. */
6981 lang_add_output_format (const char *format
,
6986 if (output_target
== NULL
|| !from_script
)
6988 if (command_line
.endian
== ENDIAN_BIG
6991 else if (command_line
.endian
== ENDIAN_LITTLE
6995 output_target
= format
;
7000 lang_add_insert (const char *where
, int is_before
)
7002 lang_insert_statement_type
*new_stmt
;
7004 new_stmt
= new_stat (lang_insert_statement
, stat_ptr
);
7005 new_stmt
->where
= where
;
7006 new_stmt
->is_before
= is_before
;
7007 saved_script_handle
= previous_script_handle
;
7010 /* Enter a group. This creates a new lang_group_statement, and sets
7011 stat_ptr to build new statements within the group. */
7014 lang_enter_group (void)
7016 lang_group_statement_type
*g
;
7018 g
= new_stat (lang_group_statement
, stat_ptr
);
7019 lang_list_init (&g
->children
);
7020 push_stat_ptr (&g
->children
);
7023 /* Leave a group. This just resets stat_ptr to start writing to the
7024 regular list of statements again. Note that this will not work if
7025 groups can occur inside anything else which can adjust stat_ptr,
7026 but currently they can't. */
7029 lang_leave_group (void)
7034 /* Add a new program header. This is called for each entry in a PHDRS
7035 command in a linker script. */
7038 lang_new_phdr (const char *name
,
7040 bfd_boolean filehdr
,
7045 struct lang_phdr
*n
, **pp
;
7048 n
= (struct lang_phdr
*) stat_alloc (sizeof (struct lang_phdr
));
7051 n
->type
= exp_get_value_int (type
, 0, "program header type");
7052 n
->filehdr
= filehdr
;
7057 hdrs
= n
->type
== 1 && (phdrs
|| filehdr
);
7059 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7062 && !((*pp
)->filehdr
|| (*pp
)->phdrs
))
7064 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported when prior PT_LOAD headers lack them\n"));
7071 /* Record the program header information in the output BFD. FIXME: We
7072 should not be calling an ELF specific function here. */
7075 lang_record_phdrs (void)
7079 lang_output_section_phdr_list
*last
;
7080 struct lang_phdr
*l
;
7081 lang_output_section_statement_type
*os
;
7084 secs
= (asection
**) xmalloc (alc
* sizeof (asection
*));
7087 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
7094 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7098 lang_output_section_phdr_list
*pl
;
7100 if (os
->constraint
< 0)
7108 if (os
->sectype
== noload_section
7109 || os
->bfd_section
== NULL
7110 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
7113 /* Don't add orphans to PT_INTERP header. */
7119 lang_output_section_statement_type
* tmp_os
;
7121 /* If we have not run across a section with a program
7122 header assigned to it yet, then scan forwards to find
7123 one. This prevents inconsistencies in the linker's
7124 behaviour when a script has specified just a single
7125 header and there are sections in that script which are
7126 not assigned to it, and which occur before the first
7127 use of that header. See here for more details:
7128 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7129 for (tmp_os
= os
; tmp_os
; tmp_os
= tmp_os
->next
)
7132 last
= tmp_os
->phdrs
;
7136 einfo (_("%F%P: no sections assigned to phdrs\n"));
7141 if (os
->bfd_section
== NULL
)
7144 for (; pl
!= NULL
; pl
= pl
->next
)
7146 if (strcmp (pl
->name
, l
->name
) == 0)
7151 secs
= (asection
**) xrealloc (secs
,
7152 alc
* sizeof (asection
*));
7154 secs
[c
] = os
->bfd_section
;
7161 if (l
->flags
== NULL
)
7164 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
7169 at
= exp_get_vma (l
->at
, 0, "phdr load address");
7171 if (! bfd_record_phdr (link_info
.output_bfd
, l
->type
,
7172 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
7173 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
7174 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7179 /* Make sure all the phdr assignments succeeded. */
7180 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
7184 lang_output_section_phdr_list
*pl
;
7186 if (os
->constraint
< 0
7187 || os
->bfd_section
== NULL
)
7190 for (pl
= os
->phdrs
;
7193 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
7194 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
7195 os
->name
, pl
->name
);
7199 /* Record a list of sections which may not be cross referenced. */
7202 lang_add_nocrossref (lang_nocrossref_type
*l
)
7204 struct lang_nocrossrefs
*n
;
7206 n
= (struct lang_nocrossrefs
*) xmalloc (sizeof *n
);
7207 n
->next
= nocrossref_list
;
7209 nocrossref_list
= n
;
7211 /* Set notice_all so that we get informed about all symbols. */
7212 link_info
.notice_all
= TRUE
;
7215 /* Overlay handling. We handle overlays with some static variables. */
7217 /* The overlay virtual address. */
7218 static etree_type
*overlay_vma
;
7219 /* And subsection alignment. */
7220 static etree_type
*overlay_subalign
;
7222 /* An expression for the maximum section size seen so far. */
7223 static etree_type
*overlay_max
;
7225 /* A list of all the sections in this overlay. */
7227 struct overlay_list
{
7228 struct overlay_list
*next
;
7229 lang_output_section_statement_type
*os
;
7232 static struct overlay_list
*overlay_list
;
7234 /* Start handling an overlay. */
7237 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
7239 /* The grammar should prevent nested overlays from occurring. */
7240 ASSERT (overlay_vma
== NULL
7241 && overlay_subalign
== NULL
7242 && overlay_max
== NULL
);
7244 overlay_vma
= vma_expr
;
7245 overlay_subalign
= subalign
;
7248 /* Start a section in an overlay. We handle this by calling
7249 lang_enter_output_section_statement with the correct VMA.
7250 lang_leave_overlay sets up the LMA and memory regions. */
7253 lang_enter_overlay_section (const char *name
)
7255 struct overlay_list
*n
;
7258 lang_enter_output_section_statement (name
, overlay_vma
, overlay_section
,
7259 0, overlay_subalign
, 0, 0);
7261 /* If this is the first section, then base the VMA of future
7262 sections on this one. This will work correctly even if `.' is
7263 used in the addresses. */
7264 if (overlay_list
== NULL
)
7265 overlay_vma
= exp_nameop (ADDR
, name
);
7267 /* Remember the section. */
7268 n
= (struct overlay_list
*) xmalloc (sizeof *n
);
7269 n
->os
= current_section
;
7270 n
->next
= overlay_list
;
7273 size
= exp_nameop (SIZEOF
, name
);
7275 /* Arrange to work out the maximum section end address. */
7276 if (overlay_max
== NULL
)
7279 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
7282 /* Finish a section in an overlay. There isn't any special to do
7286 lang_leave_overlay_section (fill_type
*fill
,
7287 lang_output_section_phdr_list
*phdrs
)
7294 name
= current_section
->name
;
7296 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7297 region and that no load-time region has been specified. It doesn't
7298 really matter what we say here, since lang_leave_overlay will
7300 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
7302 /* Define the magic symbols. */
7304 clean
= (char *) xmalloc (strlen (name
) + 1);
7306 for (s1
= name
; *s1
!= '\0'; s1
++)
7307 if (ISALNUM (*s1
) || *s1
== '_')
7311 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_start_");
7312 sprintf (buf
, "__load_start_%s", clean
);
7313 lang_add_assignment (exp_provide (buf
,
7314 exp_nameop (LOADADDR
, name
),
7317 buf
= (char *) xmalloc (strlen (clean
) + sizeof "__load_stop_");
7318 sprintf (buf
, "__load_stop_%s", clean
);
7319 lang_add_assignment (exp_provide (buf
,
7321 exp_nameop (LOADADDR
, name
),
7322 exp_nameop (SIZEOF
, name
)),
7328 /* Finish an overlay. If there are any overlay wide settings, this
7329 looks through all the sections in the overlay and sets them. */
7332 lang_leave_overlay (etree_type
*lma_expr
,
7335 const char *memspec
,
7336 lang_output_section_phdr_list
*phdrs
,
7337 const char *lma_memspec
)
7339 lang_memory_region_type
*region
;
7340 lang_memory_region_type
*lma_region
;
7341 struct overlay_list
*l
;
7342 lang_nocrossref_type
*nocrossref
;
7344 lang_get_regions (®ion
, &lma_region
,
7345 memspec
, lma_memspec
,
7346 lma_expr
!= NULL
, FALSE
);
7350 /* After setting the size of the last section, set '.' to end of the
7352 if (overlay_list
!= NULL
)
7353 overlay_list
->os
->update_dot_tree
7354 = exp_assign (".", exp_binop ('+', overlay_vma
, overlay_max
));
7359 struct overlay_list
*next
;
7361 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
7364 l
->os
->region
= region
;
7365 l
->os
->lma_region
= lma_region
;
7367 /* The first section has the load address specified in the
7368 OVERLAY statement. The rest are worked out from that.
7369 The base address is not needed (and should be null) if
7370 an LMA region was specified. */
7373 l
->os
->load_base
= lma_expr
;
7374 l
->os
->sectype
= normal_section
;
7376 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
7377 l
->os
->phdrs
= phdrs
;
7381 lang_nocrossref_type
*nc
;
7383 nc
= (lang_nocrossref_type
*) xmalloc (sizeof *nc
);
7384 nc
->name
= l
->os
->name
;
7385 nc
->next
= nocrossref
;
7394 if (nocrossref
!= NULL
)
7395 lang_add_nocrossref (nocrossref
);
7398 overlay_list
= NULL
;
7402 /* Version handling. This is only useful for ELF. */
7404 /* This global variable holds the version tree that we build. */
7406 struct bfd_elf_version_tree
*lang_elf_version_info
;
7408 /* If PREV is NULL, return first version pattern matching particular symbol.
7409 If PREV is non-NULL, return first version pattern matching particular
7410 symbol after PREV (previously returned by lang_vers_match). */
7412 static struct bfd_elf_version_expr
*
7413 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
7414 struct bfd_elf_version_expr
*prev
,
7418 const char *cxx_sym
= sym
;
7419 const char *java_sym
= sym
;
7420 struct bfd_elf_version_expr
*expr
= NULL
;
7421 enum demangling_styles curr_style
;
7423 curr_style
= CURRENT_DEMANGLING_STYLE
;
7424 cplus_demangle_set_style (no_demangling
);
7425 c_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_NO_OPTS
);
7428 cplus_demangle_set_style (curr_style
);
7430 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7432 cxx_sym
= bfd_demangle (link_info
.output_bfd
, sym
,
7433 DMGL_PARAMS
| DMGL_ANSI
);
7437 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7439 java_sym
= bfd_demangle (link_info
.output_bfd
, sym
, DMGL_JAVA
);
7444 if (head
->htab
&& (prev
== NULL
|| prev
->literal
))
7446 struct bfd_elf_version_expr e
;
7448 switch (prev
? prev
->mask
: 0)
7451 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
7454 expr
= (struct bfd_elf_version_expr
*)
7455 htab_find ((htab_t
) head
->htab
, &e
);
7456 while (expr
&& strcmp (expr
->pattern
, c_sym
) == 0)
7457 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
7463 case BFD_ELF_VERSION_C_TYPE
:
7464 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
7466 e
.pattern
= cxx_sym
;
7467 expr
= (struct bfd_elf_version_expr
*)
7468 htab_find ((htab_t
) head
->htab
, &e
);
7469 while (expr
&& strcmp (expr
->pattern
, cxx_sym
) == 0)
7470 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7476 case BFD_ELF_VERSION_CXX_TYPE
:
7477 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
7479 e
.pattern
= java_sym
;
7480 expr
= (struct bfd_elf_version_expr
*)
7481 htab_find ((htab_t
) head
->htab
, &e
);
7482 while (expr
&& strcmp (expr
->pattern
, java_sym
) == 0)
7483 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7494 /* Finally, try the wildcards. */
7495 if (prev
== NULL
|| prev
->literal
)
7496 expr
= head
->remaining
;
7499 for (; expr
; expr
= expr
->next
)
7506 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
7509 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
7511 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
7515 if (fnmatch (expr
->pattern
, s
, 0) == 0)
7521 free ((char *) c_sym
);
7523 free ((char *) cxx_sym
);
7524 if (java_sym
!= sym
)
7525 free ((char *) java_sym
);
7529 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
7530 return a pointer to the symbol name with any backslash quotes removed. */
7533 realsymbol (const char *pattern
)
7536 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
7537 char *s
, *symbol
= (char *) xmalloc (strlen (pattern
) + 1);
7539 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
7541 /* It is a glob pattern only if there is no preceding
7545 /* Remove the preceding backslash. */
7552 if (*p
== '?' || *p
== '*' || *p
== '[')
7559 backslash
= *p
== '\\';
7575 /* This is called for each variable name or match expression. NEW_NAME is
7576 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7577 pattern to be matched against symbol names. */
7579 struct bfd_elf_version_expr
*
7580 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
7581 const char *new_name
,
7583 bfd_boolean literal_p
)
7585 struct bfd_elf_version_expr
*ret
;
7587 ret
= (struct bfd_elf_version_expr
*) xmalloc (sizeof *ret
);
7591 ret
->literal
= TRUE
;
7592 ret
->pattern
= literal_p
? new_name
: realsymbol (new_name
);
7593 if (ret
->pattern
== NULL
)
7595 ret
->pattern
= new_name
;
7596 ret
->literal
= FALSE
;
7599 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
7600 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7601 else if (strcasecmp (lang
, "C++") == 0)
7602 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
7603 else if (strcasecmp (lang
, "Java") == 0)
7604 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
7607 einfo (_("%X%P: unknown language `%s' in version information\n"),
7609 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
7612 return ldemul_new_vers_pattern (ret
);
7615 /* This is called for each set of variable names and match
7618 struct bfd_elf_version_tree
*
7619 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
7620 struct bfd_elf_version_expr
*locals
)
7622 struct bfd_elf_version_tree
*ret
;
7624 ret
= (struct bfd_elf_version_tree
*) xcalloc (1, sizeof *ret
);
7625 ret
->globals
.list
= globals
;
7626 ret
->locals
.list
= locals
;
7627 ret
->match
= lang_vers_match
;
7628 ret
->name_indx
= (unsigned int) -1;
7632 /* This static variable keeps track of version indices. */
7634 static int version_index
;
7637 version_expr_head_hash (const void *p
)
7639 const struct bfd_elf_version_expr
*e
=
7640 (const struct bfd_elf_version_expr
*) p
;
7642 return htab_hash_string (e
->pattern
);
7646 version_expr_head_eq (const void *p1
, const void *p2
)
7648 const struct bfd_elf_version_expr
*e1
=
7649 (const struct bfd_elf_version_expr
*) p1
;
7650 const struct bfd_elf_version_expr
*e2
=
7651 (const struct bfd_elf_version_expr
*) p2
;
7653 return strcmp (e1
->pattern
, e2
->pattern
) == 0;
7657 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
7660 struct bfd_elf_version_expr
*e
, *next
;
7661 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
7663 for (e
= head
->list
; e
; e
= e
->next
)
7667 head
->mask
|= e
->mask
;
7672 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
7673 version_expr_head_eq
, NULL
);
7674 list_loc
= &head
->list
;
7675 remaining_loc
= &head
->remaining
;
7676 for (e
= head
->list
; e
; e
= next
)
7682 remaining_loc
= &e
->next
;
7686 void **loc
= htab_find_slot ((htab_t
) head
->htab
, e
, INSERT
);
7690 struct bfd_elf_version_expr
*e1
, *last
;
7692 e1
= (struct bfd_elf_version_expr
*) *loc
;
7696 if (e1
->mask
== e
->mask
)
7704 while (e1
&& strcmp (e1
->pattern
, e
->pattern
) == 0);
7708 /* This is a duplicate. */
7709 /* FIXME: Memory leak. Sometimes pattern is not
7710 xmalloced alone, but in larger chunk of memory. */
7711 /* free (e->pattern); */
7716 e
->next
= last
->next
;
7724 list_loc
= &e
->next
;
7728 *remaining_loc
= NULL
;
7729 *list_loc
= head
->remaining
;
7732 head
->remaining
= head
->list
;
7735 /* This is called when we know the name and dependencies of the
7739 lang_register_vers_node (const char *name
,
7740 struct bfd_elf_version_tree
*version
,
7741 struct bfd_elf_version_deps
*deps
)
7743 struct bfd_elf_version_tree
*t
, **pp
;
7744 struct bfd_elf_version_expr
*e1
;
7749 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
7750 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
7752 einfo (_("%X%P: anonymous version tag cannot be combined"
7753 " with other version tags\n"));
7758 /* Make sure this node has a unique name. */
7759 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7760 if (strcmp (t
->name
, name
) == 0)
7761 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
7763 lang_finalize_version_expr_head (&version
->globals
);
7764 lang_finalize_version_expr_head (&version
->locals
);
7766 /* Check the global and local match names, and make sure there
7767 aren't any duplicates. */
7769 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
7771 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7773 struct bfd_elf_version_expr
*e2
;
7775 if (t
->locals
.htab
&& e1
->literal
)
7777 e2
= (struct bfd_elf_version_expr
*)
7778 htab_find ((htab_t
) t
->locals
.htab
, e1
);
7779 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7781 if (e1
->mask
== e2
->mask
)
7782 einfo (_("%X%P: duplicate expression `%s'"
7783 " in version information\n"), e1
->pattern
);
7787 else if (!e1
->literal
)
7788 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7789 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7790 && e1
->mask
== e2
->mask
)
7791 einfo (_("%X%P: duplicate expression `%s'"
7792 " in version information\n"), e1
->pattern
);
7796 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
7798 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7800 struct bfd_elf_version_expr
*e2
;
7802 if (t
->globals
.htab
&& e1
->literal
)
7804 e2
= (struct bfd_elf_version_expr
*)
7805 htab_find ((htab_t
) t
->globals
.htab
, e1
);
7806 while (e2
&& strcmp (e1
->pattern
, e2
->pattern
) == 0)
7808 if (e1
->mask
== e2
->mask
)
7809 einfo (_("%X%P: duplicate expression `%s'"
7810 " in version information\n"),
7815 else if (!e1
->literal
)
7816 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
7817 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
7818 && e1
->mask
== e2
->mask
)
7819 einfo (_("%X%P: duplicate expression `%s'"
7820 " in version information\n"), e1
->pattern
);
7824 version
->deps
= deps
;
7825 version
->name
= name
;
7826 if (name
[0] != '\0')
7829 version
->vernum
= version_index
;
7832 version
->vernum
= 0;
7834 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
7839 /* This is called when we see a version dependency. */
7841 struct bfd_elf_version_deps
*
7842 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
7844 struct bfd_elf_version_deps
*ret
;
7845 struct bfd_elf_version_tree
*t
;
7847 ret
= (struct bfd_elf_version_deps
*) xmalloc (sizeof *ret
);
7850 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
7852 if (strcmp (t
->name
, name
) == 0)
7854 ret
->version_needed
= t
;
7859 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
7861 ret
->version_needed
= NULL
;
7866 lang_do_version_exports_section (void)
7868 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
7870 LANG_FOR_EACH_INPUT_STATEMENT (is
)
7872 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
7880 contents
= (char *) xmalloc (len
);
7881 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
7882 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
7885 while (p
< contents
+ len
)
7887 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
7888 p
= strchr (p
, '\0') + 1;
7891 /* Do not free the contents, as we used them creating the regex. */
7893 /* Do not include this section in the link. */
7894 sec
->flags
|= SEC_EXCLUDE
| SEC_KEEP
;
7897 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
7898 lang_register_vers_node (command_line
.version_exports_section
,
7899 lang_new_vers_node (greg
, lreg
), NULL
);
7903 lang_add_unique (const char *name
)
7905 struct unique_sections
*ent
;
7907 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
7908 if (strcmp (ent
->name
, name
) == 0)
7911 ent
= (struct unique_sections
*) xmalloc (sizeof *ent
);
7912 ent
->name
= xstrdup (name
);
7913 ent
->next
= unique_section_list
;
7914 unique_section_list
= ent
;
7917 /* Append the list of dynamic symbols to the existing one. */
7920 lang_append_dynamic_list (struct bfd_elf_version_expr
*dynamic
)
7922 if (link_info
.dynamic_list
)
7924 struct bfd_elf_version_expr
*tail
;
7925 for (tail
= dynamic
; tail
->next
!= NULL
; tail
= tail
->next
)
7927 tail
->next
= link_info
.dynamic_list
->head
.list
;
7928 link_info
.dynamic_list
->head
.list
= dynamic
;
7932 struct bfd_elf_dynamic_list
*d
;
7934 d
= (struct bfd_elf_dynamic_list
*) xcalloc (1, sizeof *d
);
7935 d
->head
.list
= dynamic
;
7936 d
->match
= lang_vers_match
;
7937 link_info
.dynamic_list
= d
;
7941 /* Append the list of C++ typeinfo dynamic symbols to the existing
7945 lang_append_dynamic_list_cpp_typeinfo (void)
7947 const char * symbols
[] =
7949 "typeinfo name for*",
7952 struct bfd_elf_version_expr
*dynamic
= NULL
;
7955 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7956 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7959 lang_append_dynamic_list (dynamic
);
7962 /* Append the list of C++ operator new and delete dynamic symbols to the
7966 lang_append_dynamic_list_cpp_new (void)
7968 const char * symbols
[] =
7973 struct bfd_elf_version_expr
*dynamic
= NULL
;
7976 for (i
= 0; i
< ARRAY_SIZE (symbols
); i
++)
7977 dynamic
= lang_new_vers_pattern (dynamic
, symbols
[i
], "C++",
7980 lang_append_dynamic_list (dynamic
);
7983 /* Scan a space and/or comma separated string of features. */
7986 lang_ld_feature (char *str
)
7994 while (*p
== ',' || ISSPACE (*p
))
7999 while (*q
&& *q
!= ',' && !ISSPACE (*q
))
8003 if (strcasecmp (p
, "SANE_EXPR") == 0)
8004 config
.sane_expr
= TRUE
;
8006 einfo (_("%X%P: unknown feature `%s'\n"), p
);