1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006
4 Free Software Foundation, Inc.
6 This file is part of GLD, the Gnu Linker.
8 GLD 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 2, or (at your option)
13 GLD 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 GLD; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
25 #include "libiberty.h"
26 #include "safe-ctype.h"
45 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
48 /* Locals variables. */
49 static struct obstack stat_obstack
;
50 static struct obstack map_obstack
;
52 #define obstack_chunk_alloc xmalloc
53 #define obstack_chunk_free free
54 static const char *startup_file
;
55 static lang_statement_list_type input_file_chain
;
56 static bfd_boolean placed_commons
= FALSE
;
57 static bfd_boolean stripped_excluded_sections
= FALSE
;
58 static lang_output_section_statement_type
*default_common_section
;
59 static bfd_boolean map_option_f
;
60 static bfd_vma print_dot
;
61 static lang_input_statement_type
*first_file
;
62 static const char *current_target
;
63 static const char *output_target
;
64 static lang_statement_list_type statement_list
;
65 static struct lang_phdr
*lang_phdr_list
;
66 static struct bfd_hash_table lang_definedness_table
;
68 /* Forward declarations. */
69 static void exp_init_os (etree_type
*);
70 static void init_map_userdata (bfd
*, asection
*, void *);
71 static lang_input_statement_type
*lookup_name (const char *);
72 static bfd_boolean
load_symbols (lang_input_statement_type
*,
73 lang_statement_list_type
*);
74 static struct bfd_hash_entry
*lang_definedness_newfunc
75 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
76 static void insert_undefined (const char *);
77 static void print_all_symbols (asection
*);
78 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
79 static void print_statement (lang_statement_union_type
*,
80 lang_output_section_statement_type
*);
81 static void print_statement_list (lang_statement_union_type
*,
82 lang_output_section_statement_type
*);
83 static void print_statements (void);
84 static void print_input_section (asection
*);
85 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
86 static void lang_record_phdrs (void);
87 static void lang_do_version_exports_section (void);
89 /* Exported variables. */
90 lang_output_section_statement_type
*abs_output_section
;
91 lang_statement_list_type lang_output_section_statement
;
92 lang_statement_list_type
*stat_ptr
= &statement_list
;
93 lang_statement_list_type file_chain
= { NULL
, NULL
};
94 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
95 static const char *entry_symbol_default
= "start";
96 const char *entry_section
= ".text";
97 bfd_boolean entry_from_cmdline
;
98 bfd_boolean lang_has_input_file
= FALSE
;
99 bfd_boolean had_output_filename
= FALSE
;
100 bfd_boolean lang_float_flag
= FALSE
;
101 bfd_boolean delete_output_file_on_failure
= FALSE
;
102 struct lang_nocrossrefs
*nocrossref_list
;
103 static struct unique_sections
*unique_section_list
;
104 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
106 /* Functions that traverse the linker script and might evaluate
107 DEFINED() need to increment this. */
108 int lang_statement_iteration
= 0;
110 etree_type
*base
; /* Relocation base - or null */
112 /* Return TRUE if the PATTERN argument is a wildcard pattern.
113 Although backslashes are treated specially if a pattern contains
114 wildcards, we do not consider the mere presence of a backslash to
115 be enough to cause the pattern to be treated as a wildcard.
116 That lets us handle DOS filenames more naturally. */
117 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
119 #define new_stat(x, y) \
120 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
122 #define outside_section_address(q) \
123 ((q)->output_offset + (q)->output_section->vma)
125 #define outside_symbol_address(q) \
126 ((q)->value + outside_section_address (q->section))
128 #define SECTION_NAME_MAP_LENGTH (16)
131 stat_alloc (size_t size
)
133 return obstack_alloc (&stat_obstack
, size
);
137 unique_section_p (const asection
*sec
)
139 struct unique_sections
*unam
;
142 if (link_info
.relocatable
143 && sec
->owner
!= NULL
144 && bfd_is_group_section (sec
->owner
, sec
))
148 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
149 if (wildcardp (unam
->name
)
150 ? fnmatch (unam
->name
, secnam
, 0) == 0
151 : strcmp (unam
->name
, secnam
) == 0)
159 /* Generic traversal routines for finding matching sections. */
161 /* Try processing a section against a wildcard. This just calls
162 the callback unless the filename exclusion list is present
163 and excludes the file. It's hardly ever present so this
164 function is very fast. */
167 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
168 lang_input_statement_type
*file
,
170 struct wildcard_list
*sec
,
174 bfd_boolean skip
= FALSE
;
175 struct name_list
*list_tmp
;
177 /* Don't process sections from files which were
179 for (list_tmp
= sec
->spec
.exclude_name_list
;
181 list_tmp
= list_tmp
->next
)
183 bfd_boolean is_wildcard
= wildcardp (list_tmp
->name
);
185 skip
= fnmatch (list_tmp
->name
, file
->filename
, 0) == 0;
187 skip
= strcmp (list_tmp
->name
, file
->filename
) == 0;
189 /* If this file is part of an archive, and the archive is
190 excluded, exclude this file. */
191 if (! skip
&& file
->the_bfd
!= NULL
192 && file
->the_bfd
->my_archive
!= NULL
193 && file
->the_bfd
->my_archive
->filename
!= NULL
)
196 skip
= fnmatch (list_tmp
->name
,
197 file
->the_bfd
->my_archive
->filename
,
200 skip
= strcmp (list_tmp
->name
,
201 file
->the_bfd
->my_archive
->filename
) == 0;
209 (*callback
) (ptr
, sec
, s
, file
, data
);
212 /* Lowest common denominator routine that can handle everything correctly,
216 walk_wild_section_general (lang_wild_statement_type
*ptr
,
217 lang_input_statement_type
*file
,
222 struct wildcard_list
*sec
;
224 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
226 sec
= ptr
->section_list
;
228 (*callback
) (ptr
, sec
, s
, file
, data
);
232 bfd_boolean skip
= FALSE
;
234 if (sec
->spec
.name
!= NULL
)
236 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
238 if (wildcardp (sec
->spec
.name
))
239 skip
= fnmatch (sec
->spec
.name
, sname
, 0) != 0;
241 skip
= strcmp (sec
->spec
.name
, sname
) != 0;
245 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
252 /* Routines to find a single section given its name. If there's more
253 than one section with that name, we report that. */
257 asection
*found_section
;
258 bfd_boolean multiple_sections_found
;
259 } section_iterator_callback_data
;
262 section_iterator_callback (bfd
*bfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
264 section_iterator_callback_data
*d
= data
;
266 if (d
->found_section
!= NULL
)
268 d
->multiple_sections_found
= TRUE
;
272 d
->found_section
= s
;
277 find_section (lang_input_statement_type
*file
,
278 struct wildcard_list
*sec
,
279 bfd_boolean
*multiple_sections_found
)
281 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
283 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
284 section_iterator_callback
, &cb_data
);
285 *multiple_sections_found
= cb_data
.multiple_sections_found
;
286 return cb_data
.found_section
;
289 /* Code for handling simple wildcards without going through fnmatch,
290 which can be expensive because of charset translations etc. */
292 /* A simple wild is a literal string followed by a single '*',
293 where the literal part is at least 4 characters long. */
296 is_simple_wild (const char *name
)
298 size_t len
= strcspn (name
, "*?[");
299 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
303 match_simple_wild (const char *pattern
, const char *name
)
305 /* The first four characters of the pattern are guaranteed valid
306 non-wildcard characters. So we can go faster. */
307 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
308 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
313 while (*pattern
!= '*')
314 if (*name
++ != *pattern
++)
320 /* Specialized, optimized routines for handling different kinds of
324 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
325 lang_input_statement_type
*file
,
329 /* We can just do a hash lookup for the section with the right name.
330 But if that lookup discovers more than one section with the name
331 (should be rare), we fall back to the general algorithm because
332 we would otherwise have to sort the sections to make sure they
333 get processed in the bfd's order. */
334 bfd_boolean multiple_sections_found
;
335 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
336 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
338 if (multiple_sections_found
)
339 walk_wild_section_general (ptr
, file
, callback
, data
);
341 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
345 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
346 lang_input_statement_type
*file
,
351 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
353 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
355 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
356 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
359 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
364 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
365 lang_input_statement_type
*file
,
370 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
371 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
372 bfd_boolean multiple_sections_found
;
373 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
375 if (multiple_sections_found
)
377 walk_wild_section_general (ptr
, file
, callback
, data
);
381 /* Note that if the section was not found, s0 is NULL and
382 we'll simply never succeed the s == s0 test below. */
383 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
385 /* Recall that in this code path, a section cannot satisfy more
386 than one spec, so if s == s0 then it cannot match
389 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
392 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
393 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
396 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
403 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
404 lang_input_statement_type
*file
,
409 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
410 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
411 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
412 bfd_boolean multiple_sections_found
;
413 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
415 if (multiple_sections_found
)
417 walk_wild_section_general (ptr
, file
, callback
, data
);
421 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
424 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
427 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
428 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
431 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
434 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
436 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
444 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
445 lang_input_statement_type
*file
,
450 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
451 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
452 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
453 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
454 bfd_boolean multiple_sections_found
;
455 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
457 if (multiple_sections_found
)
459 walk_wild_section_general (ptr
, file
, callback
, data
);
463 s1
= find_section (file
, sec1
, &multiple_sections_found
);
464 if (multiple_sections_found
)
466 walk_wild_section_general (ptr
, file
, callback
, data
);
470 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
473 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
476 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
479 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
480 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
484 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
488 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
490 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
498 walk_wild_section (lang_wild_statement_type
*ptr
,
499 lang_input_statement_type
*file
,
503 if (file
->just_syms_flag
)
506 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
509 /* Returns TRUE when name1 is a wildcard spec that might match
510 something name2 can match. We're conservative: we return FALSE
511 only if the prefixes of name1 and name2 are different up to the
512 first wildcard character. */
515 wild_spec_can_overlap (const char *name1
, const char *name2
)
517 size_t prefix1_len
= strcspn (name1
, "?*[");
518 size_t prefix2_len
= strcspn (name2
, "?*[");
519 size_t min_prefix_len
;
521 /* Note that if there is no wildcard character, then we treat the
522 terminating 0 as part of the prefix. Thus ".text" won't match
523 ".text." or ".text.*", for example. */
524 if (name1
[prefix1_len
] == '\0')
526 if (name2
[prefix2_len
] == '\0')
529 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
531 return memcmp (name1
, name2
, min_prefix_len
) == 0;
534 /* Select specialized code to handle various kinds of wildcard
538 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
541 int wild_name_count
= 0;
542 struct wildcard_list
*sec
;
546 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
548 /* Count how many wildcard_specs there are, and how many of those
549 actually use wildcards in the name. Also, bail out if any of the
550 wildcard names are NULL. (Can this actually happen?
551 walk_wild_section used to test for it.) And bail out if any
552 of the wildcards are more complex than a simple string
553 ending in a single '*'. */
554 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
557 if (sec
->spec
.name
== NULL
)
559 if (wildcardp (sec
->spec
.name
))
562 if (!is_simple_wild (sec
->spec
.name
))
567 /* The zero-spec case would be easy to optimize but it doesn't
568 happen in practice. Likewise, more than 4 specs doesn't
569 happen in practice. */
570 if (sec_count
== 0 || sec_count
> 4)
573 /* Check that no two specs can match the same section. */
574 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
576 struct wildcard_list
*sec2
;
577 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
579 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
584 signature
= (sec_count
<< 8) + wild_name_count
;
588 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
591 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
594 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
597 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
600 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
606 /* Now fill the data array with pointers to the specs, first the
607 specs with non-wildcard names, then the specs with wildcard
608 names. It's OK to process the specs in different order from the
609 given order, because we've already determined that no section
610 will match more than one spec. */
612 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
613 if (!wildcardp (sec
->spec
.name
))
614 ptr
->handler_data
[data_counter
++] = sec
;
615 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
616 if (wildcardp (sec
->spec
.name
))
617 ptr
->handler_data
[data_counter
++] = sec
;
620 /* Handle a wild statement for a single file F. */
623 walk_wild_file (lang_wild_statement_type
*s
,
624 lang_input_statement_type
*f
,
628 if (f
->the_bfd
== NULL
629 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
630 walk_wild_section (s
, f
, callback
, data
);
635 /* This is an archive file. We must map each member of the
636 archive separately. */
637 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
638 while (member
!= NULL
)
640 /* When lookup_name is called, it will call the add_symbols
641 entry point for the archive. For each element of the
642 archive which is included, BFD will call ldlang_add_file,
643 which will set the usrdata field of the member to the
644 lang_input_statement. */
645 if (member
->usrdata
!= NULL
)
647 walk_wild_section (s
, member
->usrdata
, callback
, data
);
650 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
656 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
658 const char *file_spec
= s
->filename
;
660 if (file_spec
== NULL
)
662 /* Perform the iteration over all files in the list. */
663 LANG_FOR_EACH_INPUT_STATEMENT (f
)
665 walk_wild_file (s
, f
, callback
, data
);
668 else if (wildcardp (file_spec
))
670 LANG_FOR_EACH_INPUT_STATEMENT (f
)
672 if (fnmatch (file_spec
, f
->filename
, FNM_FILE_NAME
) == 0)
673 walk_wild_file (s
, f
, callback
, data
);
678 lang_input_statement_type
*f
;
680 /* Perform the iteration over a single file. */
681 f
= lookup_name (file_spec
);
683 walk_wild_file (s
, f
, callback
, data
);
687 /* lang_for_each_statement walks the parse tree and calls the provided
688 function for each node. */
691 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
692 lang_statement_union_type
*s
)
694 for (; s
!= NULL
; s
= s
->header
.next
)
698 switch (s
->header
.type
)
700 case lang_constructors_statement_enum
:
701 lang_for_each_statement_worker (func
, constructor_list
.head
);
703 case lang_output_section_statement_enum
:
704 lang_for_each_statement_worker
705 (func
, s
->output_section_statement
.children
.head
);
707 case lang_wild_statement_enum
:
708 lang_for_each_statement_worker (func
,
709 s
->wild_statement
.children
.head
);
711 case lang_group_statement_enum
:
712 lang_for_each_statement_worker (func
,
713 s
->group_statement
.children
.head
);
715 case lang_data_statement_enum
:
716 case lang_reloc_statement_enum
:
717 case lang_object_symbols_statement_enum
:
718 case lang_output_statement_enum
:
719 case lang_target_statement_enum
:
720 case lang_input_section_enum
:
721 case lang_input_statement_enum
:
722 case lang_assignment_statement_enum
:
723 case lang_padding_statement_enum
:
724 case lang_address_statement_enum
:
725 case lang_fill_statement_enum
:
735 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
737 lang_for_each_statement_worker (func
, statement_list
.head
);
740 /*----------------------------------------------------------------------*/
743 lang_list_init (lang_statement_list_type
*list
)
746 list
->tail
= &list
->head
;
749 /* Build a new statement node for the parse tree. */
751 static lang_statement_union_type
*
752 new_statement (enum statement_enum type
,
754 lang_statement_list_type
*list
)
756 lang_statement_union_type
*new;
758 new = stat_alloc (size
);
759 new->header
.type
= type
;
760 new->header
.next
= NULL
;
761 lang_statement_append (list
, new, &new->header
.next
);
765 /* Build a new input file node for the language. There are several
766 ways in which we treat an input file, eg, we only look at symbols,
767 or prefix it with a -l etc.
769 We can be supplied with requests for input files more than once;
770 they may, for example be split over several lines like foo.o(.text)
771 foo.o(.data) etc, so when asked for a file we check that we haven't
772 got it already so we don't duplicate the bfd. */
774 static lang_input_statement_type
*
775 new_afile (const char *name
,
776 lang_input_file_enum_type file_type
,
778 bfd_boolean add_to_list
)
780 lang_input_statement_type
*p
;
783 p
= new_stat (lang_input_statement
, stat_ptr
);
786 p
= stat_alloc (sizeof (lang_input_statement_type
));
787 p
->header
.type
= lang_input_statement_enum
;
788 p
->header
.next
= NULL
;
791 lang_has_input_file
= TRUE
;
793 p
->sysrooted
= FALSE
;
796 case lang_input_file_is_symbols_only_enum
:
798 p
->is_archive
= FALSE
;
800 p
->local_sym_name
= name
;
801 p
->just_syms_flag
= TRUE
;
802 p
->search_dirs_flag
= FALSE
;
804 case lang_input_file_is_fake_enum
:
806 p
->is_archive
= FALSE
;
808 p
->local_sym_name
= name
;
809 p
->just_syms_flag
= FALSE
;
810 p
->search_dirs_flag
= FALSE
;
812 case lang_input_file_is_l_enum
:
813 p
->is_archive
= TRUE
;
816 p
->local_sym_name
= concat ("-l", name
, NULL
);
817 p
->just_syms_flag
= FALSE
;
818 p
->search_dirs_flag
= TRUE
;
820 case lang_input_file_is_marker_enum
:
822 p
->is_archive
= FALSE
;
824 p
->local_sym_name
= name
;
825 p
->just_syms_flag
= FALSE
;
826 p
->search_dirs_flag
= TRUE
;
828 case lang_input_file_is_search_file_enum
:
829 p
->sysrooted
= ldlang_sysrooted_script
;
831 p
->is_archive
= FALSE
;
833 p
->local_sym_name
= name
;
834 p
->just_syms_flag
= FALSE
;
835 p
->search_dirs_flag
= TRUE
;
837 case lang_input_file_is_file_enum
:
839 p
->is_archive
= FALSE
;
841 p
->local_sym_name
= name
;
842 p
->just_syms_flag
= FALSE
;
843 p
->search_dirs_flag
= FALSE
;
850 p
->next_real_file
= NULL
;
853 p
->dynamic
= config
.dynamic_link
;
854 p
->add_needed
= add_needed
;
855 p
->as_needed
= as_needed
;
856 p
->whole_archive
= whole_archive
;
858 lang_statement_append (&input_file_chain
,
859 (lang_statement_union_type
*) p
,
864 lang_input_statement_type
*
865 lang_add_input_file (const char *name
,
866 lang_input_file_enum_type file_type
,
869 lang_has_input_file
= TRUE
;
870 return new_afile (name
, file_type
, target
, TRUE
);
873 struct output_statement_hash_entry
875 struct bfd_hash_entry root
;
876 lang_output_section_statement_type os
;
879 /* The hash table. */
881 static struct bfd_hash_table output_statement_table
;
883 /* Support routines for the hash table used by lang_output_section_find,
884 initialize the table, fill in an entry and remove the table. */
886 static struct bfd_hash_entry
*
887 output_statement_newfunc (struct bfd_hash_entry
*entry
,
888 struct bfd_hash_table
*table
,
891 lang_output_section_statement_type
**nextp
;
892 struct output_statement_hash_entry
*ret
;
896 entry
= bfd_hash_allocate (table
, sizeof (*ret
));
901 entry
= bfd_hash_newfunc (entry
, table
, string
);
905 ret
= (struct output_statement_hash_entry
*) entry
;
906 memset (&ret
->os
, 0, sizeof (ret
->os
));
907 ret
->os
.header
.type
= lang_output_section_statement_enum
;
908 ret
->os
.subsection_alignment
= -1;
909 ret
->os
.section_alignment
= -1;
910 ret
->os
.block_value
= 1;
911 lang_list_init (&ret
->os
.children
);
912 lang_statement_append (stat_ptr
,
913 (lang_statement_union_type
*) &ret
->os
,
914 &ret
->os
.header
.next
);
916 /* For every output section statement added to the list, except the
917 first one, lang_output_section_statement.tail points to the "next"
918 field of the last element of the list. */
919 if (lang_output_section_statement
.head
!= NULL
)
920 ret
->os
.prev
= (lang_output_section_statement_type
*)
921 ((char *) lang_output_section_statement
.tail
922 - offsetof (lang_output_section_statement_type
, next
));
924 /* GCC's strict aliasing rules prevent us from just casting the
925 address, so we store the pointer in a variable and cast that
927 nextp
= &ret
->os
.next
;
928 lang_statement_append (&lang_output_section_statement
,
929 (lang_statement_union_type
*) &ret
->os
,
930 (lang_statement_union_type
**) nextp
);
935 output_statement_table_init (void)
937 if (!bfd_hash_table_init_n (&output_statement_table
,
938 output_statement_newfunc
,
939 sizeof (struct output_statement_hash_entry
),
941 einfo (_("%P%F: can not create hash table: %E\n"));
945 output_statement_table_free (void)
947 bfd_hash_table_free (&output_statement_table
);
950 /* Build enough state so that the parser can build its tree. */
955 obstack_begin (&stat_obstack
, 1000);
957 stat_ptr
= &statement_list
;
959 output_statement_table_init ();
961 lang_list_init (stat_ptr
);
963 lang_list_init (&input_file_chain
);
964 lang_list_init (&lang_output_section_statement
);
965 lang_list_init (&file_chain
);
966 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
969 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
971 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
973 /* The value "3" is ad-hoc, somewhat related to the expected number of
974 DEFINED expressions in a linker script. For most default linker
975 scripts, there are none. Why a hash table then? Well, it's somewhat
976 simpler to re-use working machinery than using a linked list in terms
977 of code-complexity here in ld, besides the initialization which just
978 looks like other code here. */
979 if (!bfd_hash_table_init_n (&lang_definedness_table
,
980 lang_definedness_newfunc
,
981 sizeof (struct lang_definedness_hash_entry
),
983 einfo (_("%P%F: can not create hash table: %E\n"));
989 output_statement_table_free ();
992 /*----------------------------------------------------------------------
993 A region is an area of memory declared with the
994 MEMORY { name:org=exp, len=exp ... }
997 We maintain a list of all the regions here.
999 If no regions are specified in the script, then the default is used
1000 which is created when looked up to be the entire data space.
1002 If create is true we are creating a region inside a MEMORY block.
1003 In this case it is probably an error to create a region that has
1004 already been created. If we are not inside a MEMORY block it is
1005 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1006 and so we issue a warning. */
1008 static lang_memory_region_type
*lang_memory_region_list
;
1009 static lang_memory_region_type
**lang_memory_region_list_tail
1010 = &lang_memory_region_list
;
1012 lang_memory_region_type
*
1013 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1015 lang_memory_region_type
*p
;
1016 lang_memory_region_type
*new;
1018 /* NAME is NULL for LMA memspecs if no region was specified. */
1022 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1023 if (strcmp (p
->name
, name
) == 0)
1026 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1031 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1032 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
1034 new = stat_alloc (sizeof (lang_memory_region_type
));
1036 new->name
= xstrdup (name
);
1039 *lang_memory_region_list_tail
= new;
1040 lang_memory_region_list_tail
= &new->next
;
1044 new->length
= ~(bfd_size_type
) 0;
1046 new->had_full_message
= FALSE
;
1051 static lang_memory_region_type
*
1052 lang_memory_default (asection
*section
)
1054 lang_memory_region_type
*p
;
1056 flagword sec_flags
= section
->flags
;
1058 /* Override SEC_DATA to mean a writable section. */
1059 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1060 sec_flags
|= SEC_DATA
;
1062 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1064 if ((p
->flags
& sec_flags
) != 0
1065 && (p
->not_flags
& sec_flags
) == 0)
1070 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1073 lang_output_section_statement_type
*
1074 lang_output_section_find (const char *const name
)
1076 struct output_statement_hash_entry
*entry
;
1079 entry
= ((struct output_statement_hash_entry
*)
1080 bfd_hash_lookup (&output_statement_table
, name
, FALSE
, FALSE
));
1084 hash
= entry
->root
.hash
;
1087 if (entry
->os
.constraint
!= -1)
1089 entry
= (struct output_statement_hash_entry
*) entry
->root
.next
;
1091 while (entry
!= NULL
1092 && entry
->root
.hash
== hash
1093 && strcmp (name
, entry
->os
.name
) == 0);
1098 static lang_output_section_statement_type
*
1099 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1101 struct output_statement_hash_entry
*entry
;
1102 struct output_statement_hash_entry
*last_ent
;
1105 entry
= ((struct output_statement_hash_entry
*)
1106 bfd_hash_lookup (&output_statement_table
, name
, TRUE
, FALSE
));
1109 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1113 if (entry
->os
.name
!= NULL
)
1115 /* We have a section of this name, but it might not have the correct
1117 hash
= entry
->root
.hash
;
1120 if (entry
->os
.constraint
!= -1
1122 || (constraint
== entry
->os
.constraint
1123 && constraint
!= SPECIAL
)))
1126 entry
= (struct output_statement_hash_entry
*) entry
->root
.next
;
1128 while (entry
!= NULL
1129 && entry
->root
.hash
== hash
1130 && strcmp (name
, entry
->os
.name
) == 0);
1132 entry
= ((struct output_statement_hash_entry
*)
1133 output_statement_newfunc (NULL
, &output_statement_table
, name
));
1136 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1139 entry
->root
= last_ent
->root
;
1140 last_ent
->root
.next
= &entry
->root
;
1143 entry
->os
.name
= name
;
1144 entry
->os
.constraint
= constraint
;
1148 lang_output_section_statement_type
*
1149 lang_output_section_statement_lookup (const char *const name
)
1151 return lang_output_section_statement_lookup_1 (name
, 0);
1154 /* A variant of lang_output_section_find used by place_orphan.
1155 Returns the output statement that should precede a new output
1156 statement for SEC. If an exact match is found on certain flags,
1159 lang_output_section_statement_type
*
1160 lang_output_section_find_by_flags (const asection
*sec
,
1161 lang_output_section_statement_type
**exact
,
1162 lang_match_sec_type_func match_type
)
1164 lang_output_section_statement_type
*first
, *look
, *found
;
1167 /* We know the first statement on this list is *ABS*. May as well
1169 first
= &lang_output_section_statement
.head
->output_section_statement
;
1170 first
= first
->next
;
1172 /* First try for an exact match. */
1174 for (look
= first
; look
; look
= look
->next
)
1176 flags
= look
->flags
;
1177 if (look
->bfd_section
!= NULL
)
1179 flags
= look
->bfd_section
->flags
;
1180 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1184 flags
^= sec
->flags
;
1185 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1186 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1196 if (sec
->flags
& SEC_CODE
)
1198 /* Try for a rw code section. */
1199 for (look
= first
; look
; look
= look
->next
)
1201 flags
= look
->flags
;
1202 if (look
->bfd_section
!= NULL
)
1204 flags
= look
->bfd_section
->flags
;
1205 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1209 flags
^= sec
->flags
;
1210 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1211 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1215 else if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1217 /* .rodata can go after .text, .sdata2 after .rodata. */
1218 for (look
= first
; look
; look
= look
->next
)
1220 flags
= look
->flags
;
1221 if (look
->bfd_section
!= NULL
)
1223 flags
= look
->bfd_section
->flags
;
1224 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1228 flags
^= sec
->flags
;
1229 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1231 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1235 else if (sec
->flags
& SEC_SMALL_DATA
)
1237 /* .sdata goes after .data, .sbss after .sdata. */
1238 for (look
= first
; look
; look
= look
->next
)
1240 flags
= look
->flags
;
1241 if (look
->bfd_section
!= NULL
)
1243 flags
= look
->bfd_section
->flags
;
1244 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1248 flags
^= sec
->flags
;
1249 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1250 | SEC_THREAD_LOCAL
))
1251 || ((look
->flags
& SEC_SMALL_DATA
)
1252 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1256 else if (sec
->flags
& SEC_HAS_CONTENTS
)
1258 /* .data goes after .rodata. */
1259 for (look
= first
; look
; look
= look
->next
)
1261 flags
= look
->flags
;
1262 if (look
->bfd_section
!= NULL
)
1264 flags
= look
->bfd_section
->flags
;
1265 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1269 flags
^= sec
->flags
;
1270 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1271 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1277 /* .bss goes last. */
1278 for (look
= first
; look
; look
= look
->next
)
1280 flags
= look
->flags
;
1281 if (look
->bfd_section
!= NULL
)
1283 flags
= look
->bfd_section
->flags
;
1284 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1288 flags
^= sec
->flags
;
1289 if (!(flags
& SEC_ALLOC
))
1294 if (found
|| !match_type
)
1297 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1300 /* Find the last output section before given output statement.
1301 Used by place_orphan. */
1304 output_prev_sec_find (lang_output_section_statement_type
*os
)
1306 lang_output_section_statement_type
*lookup
;
1308 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1310 if (lookup
->constraint
== -1)
1313 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1314 return lookup
->bfd_section
;
1320 lang_output_section_statement_type
*
1321 lang_insert_orphan (asection
*s
,
1322 const char *secname
,
1323 lang_output_section_statement_type
*after
,
1324 struct orphan_save
*place
,
1325 etree_type
*address
,
1326 lang_statement_list_type
*add_child
)
1328 lang_statement_list_type
*old
;
1329 lang_statement_list_type add
;
1331 etree_type
*load_base
;
1332 lang_output_section_statement_type
*os
;
1333 lang_output_section_statement_type
**os_tail
;
1335 /* Start building a list of statements for this section.
1336 First save the current statement pointer. */
1339 /* If we have found an appropriate place for the output section
1340 statements for this orphan, add them to our own private list,
1341 inserting them later into the global statement list. */
1345 lang_list_init (stat_ptr
);
1349 if (config
.build_constructors
)
1351 /* If the name of the section is representable in C, then create
1352 symbols to mark the start and the end of the section. */
1353 for (ps
= secname
; *ps
!= '\0'; ps
++)
1354 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1359 etree_type
*e_align
;
1361 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1362 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1363 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1364 e_align
= exp_unop (ALIGN_K
,
1365 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1366 lang_add_assignment (exp_assop ('=', ".", e_align
));
1367 lang_add_assignment (exp_assop ('=', symname
,
1368 exp_nameop (NAME
, ".")));
1372 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1373 address
= exp_intop (0);
1376 if (after
!= NULL
&& after
->load_base
!= NULL
)
1378 etree_type
*lma_from_vma
;
1379 lma_from_vma
= exp_binop ('-', after
->load_base
,
1380 exp_nameop (ADDR
, after
->name
));
1381 load_base
= exp_binop ('+', lma_from_vma
,
1382 exp_nameop (ADDR
, secname
));
1385 os_tail
= ((lang_output_section_statement_type
**)
1386 lang_output_section_statement
.tail
);
1387 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1390 if (add_child
== NULL
)
1391 add_child
= &os
->children
;
1392 lang_add_section (add_child
, s
, os
);
1394 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1396 if (config
.build_constructors
&& *ps
== '\0')
1400 /* lang_leave_ouput_section_statement resets stat_ptr.
1401 Put stat_ptr back where we want it. */
1405 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1406 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1407 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1408 lang_add_assignment (exp_assop ('=', symname
,
1409 exp_nameop (NAME
, ".")));
1412 /* Restore the global list pointer. */
1416 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1418 asection
*snew
, *as
;
1420 snew
= os
->bfd_section
;
1422 /* Shuffle the bfd section list to make the output file look
1423 neater. This is really only cosmetic. */
1424 if (place
->section
== NULL
1425 && after
!= (&lang_output_section_statement
.head
1426 ->output_section_statement
))
1428 asection
*bfd_section
= after
->bfd_section
;
1430 /* If the output statement hasn't been used to place any input
1431 sections (and thus doesn't have an output bfd_section),
1432 look for the closest prior output statement having an
1434 if (bfd_section
== NULL
)
1435 bfd_section
= output_prev_sec_find (after
);
1437 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1438 place
->section
= &bfd_section
->next
;
1441 if (place
->section
== NULL
)
1442 place
->section
= &output_bfd
->sections
;
1444 as
= *place
->section
;
1445 if (as
!= snew
&& as
->prev
!= snew
)
1447 /* Unlink the section. */
1448 bfd_section_list_remove (output_bfd
, snew
);
1450 /* Now tack it back on in the right place. */
1451 bfd_section_list_insert_before (output_bfd
, as
, snew
);
1454 /* Save the end of this list. Further ophans of this type will
1455 follow the one we've just added. */
1456 place
->section
= &snew
->next
;
1458 /* The following is non-cosmetic. We try to put the output
1459 statements in some sort of reasonable order here, because they
1460 determine the final load addresses of the orphan sections.
1461 In addition, placing output statements in the wrong order may
1462 require extra segments. For instance, given a typical
1463 situation of all read-only sections placed in one segment and
1464 following that a segment containing all the read-write
1465 sections, we wouldn't want to place an orphan read/write
1466 section before or amongst the read-only ones. */
1467 if (add
.head
!= NULL
)
1469 lang_output_section_statement_type
*newly_added_os
;
1471 if (place
->stmt
== NULL
)
1473 lang_statement_union_type
**where
;
1474 lang_statement_union_type
**assign
= NULL
;
1475 bfd_boolean ignore_first
;
1477 /* Look for a suitable place for the new statement list.
1478 The idea is to skip over anything that might be inside
1479 a SECTIONS {} statement in a script, before we find
1480 another output_section_statement. Assignments to "dot"
1481 before an output section statement are assumed to
1482 belong to it. An exception to this rule is made for
1483 the first assignment to dot, otherwise we might put an
1484 orphan before . = . + SIZEOF_HEADERS or similar
1485 assignments that set the initial address. */
1487 ignore_first
= after
== (&lang_output_section_statement
.head
1488 ->output_section_statement
);
1489 for (where
= &after
->header
.next
;
1491 where
= &(*where
)->header
.next
)
1493 switch ((*where
)->header
.type
)
1495 case lang_assignment_statement_enum
:
1498 lang_assignment_statement_type
*ass
;
1499 ass
= &(*where
)->assignment_statement
;
1500 if (ass
->exp
->type
.node_class
!= etree_assert
1501 && ass
->exp
->assign
.dst
[0] == '.'
1502 && ass
->exp
->assign
.dst
[1] == 0
1506 ignore_first
= FALSE
;
1508 case lang_wild_statement_enum
:
1509 case lang_input_section_enum
:
1510 case lang_object_symbols_statement_enum
:
1511 case lang_fill_statement_enum
:
1512 case lang_data_statement_enum
:
1513 case lang_reloc_statement_enum
:
1514 case lang_padding_statement_enum
:
1515 case lang_constructors_statement_enum
:
1518 case lang_output_section_statement_enum
:
1521 case lang_input_statement_enum
:
1522 case lang_address_statement_enum
:
1523 case lang_target_statement_enum
:
1524 case lang_output_statement_enum
:
1525 case lang_group_statement_enum
:
1526 case lang_afile_asection_pair_statement_enum
:
1535 place
->os_tail
= &after
->next
;
1539 /* Put it after the last orphan statement we added. */
1540 *add
.tail
= *place
->stmt
;
1541 *place
->stmt
= add
.head
;
1544 /* Fix the global list pointer if we happened to tack our
1545 new list at the tail. */
1546 if (*old
->tail
== add
.head
)
1547 old
->tail
= add
.tail
;
1549 /* Save the end of this list. */
1550 place
->stmt
= add
.tail
;
1552 /* Do the same for the list of output section statements. */
1553 newly_added_os
= *os_tail
;
1555 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1556 ((char *) place
->os_tail
1557 - offsetof (lang_output_section_statement_type
, next
));
1558 newly_added_os
->next
= *place
->os_tail
;
1559 if (newly_added_os
->next
!= NULL
)
1560 newly_added_os
->next
->prev
= newly_added_os
;
1561 *place
->os_tail
= newly_added_os
;
1562 place
->os_tail
= &newly_added_os
->next
;
1564 /* Fixing the global list pointer here is a little different.
1565 We added to the list in lang_enter_output_section_statement,
1566 trimmed off the new output_section_statment above when
1567 assigning *os_tail = NULL, but possibly added it back in
1568 the same place when assigning *place->os_tail. */
1569 if (*os_tail
== NULL
)
1570 lang_output_section_statement
.tail
1571 = (lang_statement_union_type
**) os_tail
;
1578 lang_map_flags (flagword flag
)
1580 if (flag
& SEC_ALLOC
)
1583 if (flag
& SEC_CODE
)
1586 if (flag
& SEC_READONLY
)
1589 if (flag
& SEC_DATA
)
1592 if (flag
& SEC_LOAD
)
1599 lang_memory_region_type
*m
;
1600 bfd_boolean dis_header_printed
= FALSE
;
1603 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1607 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1608 || file
->just_syms_flag
)
1611 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1612 if (s
->output_section
== NULL
1613 || s
->output_section
->owner
!= output_bfd
)
1615 if (! dis_header_printed
)
1617 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1618 dis_header_printed
= TRUE
;
1621 print_input_section (s
);
1625 minfo (_("\nMemory Configuration\n\n"));
1626 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1627 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1629 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1634 fprintf (config
.map_file
, "%-16s ", m
->name
);
1636 sprintf_vma (buf
, m
->origin
);
1637 minfo ("0x%s ", buf
);
1645 minfo ("0x%V", m
->length
);
1646 if (m
->flags
|| m
->not_flags
)
1654 lang_map_flags (m
->flags
);
1660 lang_map_flags (m
->not_flags
);
1667 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1669 if (! command_line
.reduce_memory_overheads
)
1671 obstack_begin (&map_obstack
, 1000);
1672 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1673 bfd_map_over_sections (p
, init_map_userdata
, 0);
1674 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1676 print_statements ();
1680 init_map_userdata (abfd
, sec
, data
)
1681 bfd
*abfd ATTRIBUTE_UNUSED
;
1683 void *data ATTRIBUTE_UNUSED
;
1685 fat_section_userdata_type
*new_data
1686 = ((fat_section_userdata_type
*) (stat_alloc
1687 (sizeof (fat_section_userdata_type
))));
1689 ASSERT (get_userdata (sec
) == NULL
);
1690 get_userdata (sec
) = new_data
;
1691 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1695 sort_def_symbol (hash_entry
, info
)
1696 struct bfd_link_hash_entry
*hash_entry
;
1697 void *info ATTRIBUTE_UNUSED
;
1699 if (hash_entry
->type
== bfd_link_hash_defined
1700 || hash_entry
->type
== bfd_link_hash_defweak
)
1702 struct fat_user_section_struct
*ud
;
1703 struct map_symbol_def
*def
;
1705 ud
= get_userdata (hash_entry
->u
.def
.section
);
1708 /* ??? What do we have to do to initialize this beforehand? */
1709 /* The first time we get here is bfd_abs_section... */
1710 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1711 ud
= get_userdata (hash_entry
->u
.def
.section
);
1713 else if (!ud
->map_symbol_def_tail
)
1714 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1716 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1717 def
->entry
= hash_entry
;
1718 *(ud
->map_symbol_def_tail
) = def
;
1719 ud
->map_symbol_def_tail
= &def
->next
;
1724 /* Initialize an output section. */
1727 init_os (lang_output_section_statement_type
*s
, asection
*isec
)
1729 if (s
->bfd_section
!= NULL
)
1732 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1733 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1735 s
->bfd_section
= bfd_get_section_by_name (output_bfd
, s
->name
);
1736 if (s
->bfd_section
== NULL
)
1737 s
->bfd_section
= bfd_make_section (output_bfd
, s
->name
);
1738 if (s
->bfd_section
== NULL
)
1740 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1741 output_bfd
->xvec
->name
, s
->name
);
1743 s
->bfd_section
->output_section
= s
->bfd_section
;
1744 s
->bfd_section
->output_offset
= 0;
1745 if (!command_line
.reduce_memory_overheads
)
1747 fat_section_userdata_type
*new
1748 = stat_alloc (sizeof (fat_section_userdata_type
));
1749 memset (new, 0, sizeof (fat_section_userdata_type
));
1750 get_userdata (s
->bfd_section
) = new;
1754 /* If there is a base address, make sure that any sections it might
1755 mention are initialized. */
1756 if (s
->addr_tree
!= NULL
)
1757 exp_init_os (s
->addr_tree
);
1759 if (s
->load_base
!= NULL
)
1760 exp_init_os (s
->load_base
);
1762 /* If supplied an alignment, set it. */
1763 if (s
->section_alignment
!= -1)
1764 s
->bfd_section
->alignment_power
= s
->section_alignment
;
1767 bfd_init_private_section_data (isec
->owner
, isec
,
1768 output_bfd
, s
->bfd_section
,
1772 /* Make sure that all output sections mentioned in an expression are
1776 exp_init_os (etree_type
*exp
)
1778 switch (exp
->type
.node_class
)
1782 exp_init_os (exp
->assign
.src
);
1786 exp_init_os (exp
->binary
.lhs
);
1787 exp_init_os (exp
->binary
.rhs
);
1791 exp_init_os (exp
->trinary
.cond
);
1792 exp_init_os (exp
->trinary
.lhs
);
1793 exp_init_os (exp
->trinary
.rhs
);
1797 exp_init_os (exp
->assert_s
.child
);
1801 exp_init_os (exp
->unary
.child
);
1805 switch (exp
->type
.node_code
)
1811 lang_output_section_statement_type
*os
;
1813 os
= lang_output_section_find (exp
->name
.name
);
1814 if (os
!= NULL
&& os
->bfd_section
== NULL
)
1826 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
1828 lang_input_statement_type
*entry
= data
;
1830 /* If we are only reading symbols from this object, then we want to
1831 discard all sections. */
1832 if (entry
->just_syms_flag
)
1834 bfd_link_just_syms (abfd
, sec
, &link_info
);
1838 if (!(abfd
->flags
& DYNAMIC
))
1839 bfd_section_already_linked (abfd
, sec
);
1842 /* The wild routines.
1844 These expand statements like *(.text) and foo.o to a list of
1845 explicit actions, like foo.o(.text), bar.o(.text) and
1846 foo.o(.text, .data). */
1848 /* Add SECTION to the output section OUTPUT. Do this by creating a
1849 lang_input_section statement which is placed at PTR. FILE is the
1850 input file which holds SECTION. */
1853 lang_add_section (lang_statement_list_type
*ptr
,
1855 lang_output_section_statement_type
*output
)
1857 flagword flags
= section
->flags
;
1858 bfd_boolean discard
;
1860 /* Discard sections marked with SEC_EXCLUDE. */
1861 discard
= (flags
& SEC_EXCLUDE
) != 0;
1863 /* Discard input sections which are assigned to a section named
1864 DISCARD_SECTION_NAME. */
1865 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
1868 /* Discard debugging sections if we are stripping debugging
1870 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
1871 && (flags
& SEC_DEBUGGING
) != 0)
1876 if (section
->output_section
== NULL
)
1878 /* This prevents future calls from assigning this section. */
1879 section
->output_section
= bfd_abs_section_ptr
;
1884 if (section
->output_section
== NULL
)
1887 lang_input_section_type
*new;
1890 if (output
->bfd_section
== NULL
)
1891 init_os (output
, section
);
1893 first
= ! output
->bfd_section
->linker_has_input
;
1894 output
->bfd_section
->linker_has_input
= 1;
1896 if (!link_info
.relocatable
1897 && !stripped_excluded_sections
)
1899 asection
*s
= output
->bfd_section
->map_tail
.s
;
1900 output
->bfd_section
->map_tail
.s
= section
;
1901 section
->map_head
.s
= NULL
;
1902 section
->map_tail
.s
= s
;
1904 s
->map_head
.s
= section
;
1906 output
->bfd_section
->map_head
.s
= section
;
1909 /* Add a section reference to the list. */
1910 new = new_stat (lang_input_section
, ptr
);
1912 new->section
= section
;
1913 section
->output_section
= output
->bfd_section
;
1915 flags
= section
->flags
;
1917 /* We don't copy the SEC_NEVER_LOAD flag from an input section
1918 to an output section, because we want to be able to include a
1919 SEC_NEVER_LOAD section in the middle of an otherwise loaded
1920 section (I don't know why we want to do this, but we do).
1921 build_link_order in ldwrite.c handles this case by turning
1922 the embedded SEC_NEVER_LOAD section into a fill. */
1924 flags
&= ~ SEC_NEVER_LOAD
;
1926 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
1927 already been processed. One reason to do this is that on pe
1928 format targets, .text$foo sections go into .text and it's odd
1929 to see .text with SEC_LINK_ONCE set. */
1931 if (! link_info
.relocatable
)
1932 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
1934 /* If this is not the first input section, and the SEC_READONLY
1935 flag is not currently set, then don't set it just because the
1936 input section has it set. */
1938 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
1939 flags
&= ~ SEC_READONLY
;
1941 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
1943 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
1944 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
1945 || ((flags
& SEC_MERGE
)
1946 && output
->bfd_section
->entsize
!= section
->entsize
)))
1948 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1949 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1952 output
->bfd_section
->flags
|= flags
;
1954 if (flags
& SEC_MERGE
)
1955 output
->bfd_section
->entsize
= section
->entsize
;
1957 /* If SEC_READONLY is not set in the input section, then clear
1958 it from the output section. */
1959 if ((section
->flags
& SEC_READONLY
) == 0)
1960 output
->bfd_section
->flags
&= ~SEC_READONLY
;
1962 switch (output
->sectype
)
1964 case normal_section
:
1969 case overlay_section
:
1970 output
->bfd_section
->flags
&= ~SEC_ALLOC
;
1972 case noload_section
:
1973 output
->bfd_section
->flags
&= ~SEC_LOAD
;
1974 output
->bfd_section
->flags
|= SEC_NEVER_LOAD
;
1978 /* Copy over SEC_SMALL_DATA. */
1979 if (section
->flags
& SEC_SMALL_DATA
)
1980 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
1982 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
1983 output
->bfd_section
->alignment_power
= section
->alignment_power
;
1985 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
1986 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
1988 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
1989 /* FIXME: This value should really be obtained from the bfd... */
1990 output
->block_value
= 128;
1995 /* Compare sections ASEC and BSEC according to SORT. */
1998 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
2007 case by_alignment_name
:
2008 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
2009 - bfd_section_alignment (asec
->owner
, asec
));
2015 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
2016 bfd_get_section_name (bsec
->owner
, bsec
));
2019 case by_name_alignment
:
2020 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
2021 bfd_get_section_name (bsec
->owner
, bsec
));
2027 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
2028 - bfd_section_alignment (asec
->owner
, asec
));
2035 /* Handle wildcard sorting. This returns the lang_input_section which
2036 should follow the one we are going to create for SECTION and FILE,
2037 based on the sorting requirements of WILD. It returns NULL if the
2038 new section should just go at the end of the current list. */
2040 static lang_statement_union_type
*
2041 wild_sort (lang_wild_statement_type
*wild
,
2042 struct wildcard_list
*sec
,
2043 lang_input_statement_type
*file
,
2046 const char *section_name
;
2047 lang_statement_union_type
*l
;
2049 if (!wild
->filenames_sorted
2050 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2053 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2054 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2056 lang_input_section_type
*ls
;
2058 if (l
->header
.type
!= lang_input_section_enum
)
2060 ls
= &l
->input_section
;
2062 /* Sorting by filename takes precedence over sorting by section
2065 if (wild
->filenames_sorted
)
2067 const char *fn
, *ln
;
2071 /* The PE support for the .idata section as generated by
2072 dlltool assumes that files will be sorted by the name of
2073 the archive and then the name of the file within the
2076 if (file
->the_bfd
!= NULL
2077 && bfd_my_archive (file
->the_bfd
) != NULL
)
2079 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2084 fn
= file
->filename
;
2088 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2090 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2095 ln
= ls
->section
->owner
->filename
;
2099 i
= strcmp (fn
, ln
);
2108 fn
= file
->filename
;
2110 ln
= ls
->section
->owner
->filename
;
2112 i
= strcmp (fn
, ln
);
2120 /* Here either the files are not sorted by name, or we are
2121 looking at the sections for this file. */
2123 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2124 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2131 /* Expand a wild statement for a particular FILE. SECTION may be
2132 NULL, in which case it is a wild card. */
2135 output_section_callback (lang_wild_statement_type
*ptr
,
2136 struct wildcard_list
*sec
,
2138 lang_input_statement_type
*file
,
2141 lang_statement_union_type
*before
;
2143 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2144 if (unique_section_p (section
))
2147 before
= wild_sort (ptr
, sec
, file
, section
);
2149 /* Here BEFORE points to the lang_input_section which
2150 should follow the one we are about to add. If BEFORE
2151 is NULL, then the section should just go at the end
2152 of the current list. */
2155 lang_add_section (&ptr
->children
, section
,
2156 (lang_output_section_statement_type
*) output
);
2159 lang_statement_list_type list
;
2160 lang_statement_union_type
**pp
;
2162 lang_list_init (&list
);
2163 lang_add_section (&list
, section
,
2164 (lang_output_section_statement_type
*) output
);
2166 /* If we are discarding the section, LIST.HEAD will
2168 if (list
.head
!= NULL
)
2170 ASSERT (list
.head
->header
.next
== NULL
);
2172 for (pp
= &ptr
->children
.head
;
2174 pp
= &(*pp
)->header
.next
)
2175 ASSERT (*pp
!= NULL
);
2177 list
.head
->header
.next
= *pp
;
2183 /* Check if all sections in a wild statement for a particular FILE
2187 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2188 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2190 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2193 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2194 if (unique_section_p (section
))
2197 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2198 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2201 /* This is passed a file name which must have been seen already and
2202 added to the statement tree. We will see if it has been opened
2203 already and had its symbols read. If not then we'll read it. */
2205 static lang_input_statement_type
*
2206 lookup_name (const char *name
)
2208 lang_input_statement_type
*search
;
2210 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2212 search
= (lang_input_statement_type
*) search
->next_real_file
)
2214 /* Use the local_sym_name as the name of the file that has
2215 already been loaded as filename might have been transformed
2216 via the search directory lookup mechanism. */
2217 const char * filename
= search
->local_sym_name
;
2219 if (filename
== NULL
&& name
== NULL
)
2221 if (filename
!= NULL
2223 && strcmp (filename
, name
) == 0)
2228 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2229 default_target
, FALSE
);
2231 /* If we have already added this file, or this file is not real
2232 (FIXME: can that ever actually happen?) or the name is NULL
2233 (FIXME: can that ever actually happen?) don't add this file. */
2236 || search
->filename
== NULL
)
2239 if (! load_symbols (search
, NULL
))
2245 /* Save LIST as a list of libraries whose symbols should not be exported. */
2250 struct excluded_lib
*next
;
2252 static struct excluded_lib
*excluded_libs
;
2255 add_excluded_libs (const char *list
)
2257 const char *p
= list
, *end
;
2261 struct excluded_lib
*entry
;
2262 end
= strpbrk (p
, ",:");
2264 end
= p
+ strlen (p
);
2265 entry
= xmalloc (sizeof (*entry
));
2266 entry
->next
= excluded_libs
;
2267 entry
->name
= xmalloc (end
- p
+ 1);
2268 memcpy (entry
->name
, p
, end
- p
);
2269 entry
->name
[end
- p
] = '\0';
2270 excluded_libs
= entry
;
2278 check_excluded_libs (bfd
*abfd
)
2280 struct excluded_lib
*lib
= excluded_libs
;
2284 int len
= strlen (lib
->name
);
2285 const char *filename
= lbasename (abfd
->filename
);
2287 if (strcmp (lib
->name
, "ALL") == 0)
2289 abfd
->no_export
= TRUE
;
2293 if (strncmp (lib
->name
, filename
, len
) == 0
2294 && (filename
[len
] == '\0'
2295 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2296 && filename
[len
+ 2] == '\0')))
2298 abfd
->no_export
= TRUE
;
2306 /* Get the symbols for an input file. */
2309 load_symbols (lang_input_statement_type
*entry
,
2310 lang_statement_list_type
*place
)
2317 ldfile_open_file (entry
);
2319 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2320 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2323 lang_statement_list_type
*hold
;
2324 bfd_boolean bad_load
= TRUE
;
2325 bfd_boolean save_ldlang_sysrooted_script
;
2327 err
= bfd_get_error ();
2329 /* See if the emulation has some special knowledge. */
2330 if (ldemul_unrecognized_file (entry
))
2333 if (err
== bfd_error_file_ambiguously_recognized
)
2337 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2338 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2339 for (p
= matching
; *p
!= NULL
; p
++)
2343 else if (err
!= bfd_error_file_not_recognized
2345 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2349 bfd_close (entry
->the_bfd
);
2350 entry
->the_bfd
= NULL
;
2352 /* Try to interpret the file as a linker script. */
2353 ldfile_open_command_file (entry
->filename
);
2357 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2358 ldlang_sysrooted_script
= entry
->sysrooted
;
2360 ldfile_assumed_script
= TRUE
;
2361 parser_input
= input_script
;
2362 /* We want to use the same -Bdynamic/-Bstatic as the one for
2364 config
.dynamic_link
= entry
->dynamic
;
2366 ldfile_assumed_script
= FALSE
;
2368 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2374 if (ldemul_recognized_file (entry
))
2377 /* We don't call ldlang_add_file for an archive. Instead, the
2378 add_symbols entry point will call ldlang_add_file, via the
2379 add_archive_element callback, for each element of the archive
2381 switch (bfd_get_format (entry
->the_bfd
))
2387 ldlang_add_file (entry
);
2388 if (trace_files
|| trace_file_tries
)
2389 info_msg ("%I\n", entry
);
2393 check_excluded_libs (entry
->the_bfd
);
2395 if (entry
->whole_archive
)
2398 bfd_boolean loaded
= TRUE
;
2402 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2407 if (! bfd_check_format (member
, bfd_object
))
2409 einfo (_("%F%B: member %B in archive is not an object\n"),
2410 entry
->the_bfd
, member
);
2414 if (! ((*link_info
.callbacks
->add_archive_element
)
2415 (&link_info
, member
, "--whole-archive")))
2418 if (! bfd_link_add_symbols (member
, &link_info
))
2420 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2425 entry
->loaded
= loaded
;
2431 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2432 entry
->loaded
= TRUE
;
2434 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2436 return entry
->loaded
;
2439 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2440 may be NULL, indicating that it is a wildcard. Separate
2441 lang_input_section statements are created for each part of the
2442 expansion; they are added after the wild statement S. OUTPUT is
2443 the output section. */
2446 wild (lang_wild_statement_type
*s
,
2447 const char *target ATTRIBUTE_UNUSED
,
2448 lang_output_section_statement_type
*output
)
2450 struct wildcard_list
*sec
;
2452 walk_wild (s
, output_section_callback
, output
);
2454 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2456 if (default_common_section
!= NULL
)
2458 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2460 /* Remember the section that common is going to in case we
2461 later get something which doesn't know where to put it. */
2462 default_common_section
= output
;
2467 /* Return TRUE iff target is the sought target. */
2470 get_target (const bfd_target
*target
, void *data
)
2472 const char *sought
= data
;
2474 return strcmp (target
->name
, sought
) == 0;
2477 /* Like strcpy() but convert to lower case as well. */
2480 stricpy (char *dest
, char *src
)
2484 while ((c
= *src
++) != 0)
2485 *dest
++ = TOLOWER (c
);
2490 /* Remove the first occurrence of needle (if any) in haystack
2494 strcut (char *haystack
, char *needle
)
2496 haystack
= strstr (haystack
, needle
);
2502 for (src
= haystack
+ strlen (needle
); *src
;)
2503 *haystack
++ = *src
++;
2509 /* Compare two target format name strings.
2510 Return a value indicating how "similar" they are. */
2513 name_compare (char *first
, char *second
)
2519 copy1
= xmalloc (strlen (first
) + 1);
2520 copy2
= xmalloc (strlen (second
) + 1);
2522 /* Convert the names to lower case. */
2523 stricpy (copy1
, first
);
2524 stricpy (copy2
, second
);
2526 /* Remove size and endian strings from the name. */
2527 strcut (copy1
, "big");
2528 strcut (copy1
, "little");
2529 strcut (copy2
, "big");
2530 strcut (copy2
, "little");
2532 /* Return a value based on how many characters match,
2533 starting from the beginning. If both strings are
2534 the same then return 10 * their length. */
2535 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2536 if (copy1
[result
] == 0)
2548 /* Set by closest_target_match() below. */
2549 static const bfd_target
*winner
;
2551 /* Scan all the valid bfd targets looking for one that has the endianness
2552 requirement that was specified on the command line, and is the nearest
2553 match to the original output target. */
2556 closest_target_match (const bfd_target
*target
, void *data
)
2558 const bfd_target
*original
= data
;
2560 if (command_line
.endian
== ENDIAN_BIG
2561 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2564 if (command_line
.endian
== ENDIAN_LITTLE
2565 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2568 /* Must be the same flavour. */
2569 if (target
->flavour
!= original
->flavour
)
2572 /* If we have not found a potential winner yet, then record this one. */
2579 /* Oh dear, we now have two potential candidates for a successful match.
2580 Compare their names and choose the better one. */
2581 if (name_compare (target
->name
, original
->name
)
2582 > name_compare (winner
->name
, original
->name
))
2585 /* Keep on searching until wqe have checked them all. */
2589 /* Return the BFD target format of the first input file. */
2592 get_first_input_target (void)
2594 char *target
= NULL
;
2596 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2598 if (s
->header
.type
== lang_input_statement_enum
2601 ldfile_open_file (s
);
2603 if (s
->the_bfd
!= NULL
2604 && bfd_check_format (s
->the_bfd
, bfd_object
))
2606 target
= bfd_get_target (s
->the_bfd
);
2618 lang_get_output_target (void)
2622 /* Has the user told us which output format to use? */
2623 if (output_target
!= NULL
)
2624 return output_target
;
2626 /* No - has the current target been set to something other than
2628 if (current_target
!= default_target
)
2629 return current_target
;
2631 /* No - can we determine the format of the first input file? */
2632 target
= get_first_input_target ();
2636 /* Failed - use the default output target. */
2637 return default_target
;
2640 /* Open the output file. */
2643 open_output (const char *name
)
2647 output_target
= lang_get_output_target ();
2649 /* Has the user requested a particular endianness on the command
2651 if (command_line
.endian
!= ENDIAN_UNSET
)
2653 const bfd_target
*target
;
2654 enum bfd_endian desired_endian
;
2656 /* Get the chosen target. */
2657 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2659 /* If the target is not supported, we cannot do anything. */
2662 if (command_line
.endian
== ENDIAN_BIG
)
2663 desired_endian
= BFD_ENDIAN_BIG
;
2665 desired_endian
= BFD_ENDIAN_LITTLE
;
2667 /* See if the target has the wrong endianness. This should
2668 not happen if the linker script has provided big and
2669 little endian alternatives, but some scrips don't do
2671 if (target
->byteorder
!= desired_endian
)
2673 /* If it does, then see if the target provides
2674 an alternative with the correct endianness. */
2675 if (target
->alternative_target
!= NULL
2676 && (target
->alternative_target
->byteorder
== desired_endian
))
2677 output_target
= target
->alternative_target
->name
;
2680 /* Try to find a target as similar as possible to
2681 the default target, but which has the desired
2682 endian characteristic. */
2683 bfd_search_for_target (closest_target_match
,
2686 /* Oh dear - we could not find any targets that
2687 satisfy our requirements. */
2689 einfo (_("%P: warning: could not find any targets"
2690 " that match endianness requirement\n"));
2692 output_target
= winner
->name
;
2698 output
= bfd_openw (name
, output_target
);
2702 if (bfd_get_error () == bfd_error_invalid_target
)
2703 einfo (_("%P%F: target %s not found\n"), output_target
);
2705 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2708 delete_output_file_on_failure
= TRUE
;
2710 if (! bfd_set_format (output
, bfd_object
))
2711 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2712 if (! bfd_set_arch_mach (output
,
2713 ldfile_output_architecture
,
2714 ldfile_output_machine
))
2715 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2717 link_info
.hash
= bfd_link_hash_table_create (output
);
2718 if (link_info
.hash
== NULL
)
2719 einfo (_("%P%F: can not create hash table: %E\n"));
2721 bfd_set_gp_size (output
, g_switch_value
);
2726 ldlang_open_output (lang_statement_union_type
*statement
)
2728 switch (statement
->header
.type
)
2730 case lang_output_statement_enum
:
2731 ASSERT (output_bfd
== NULL
);
2732 output_bfd
= open_output (statement
->output_statement
.name
);
2733 ldemul_set_output_arch ();
2734 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2735 output_bfd
->flags
|= D_PAGED
;
2737 output_bfd
->flags
&= ~D_PAGED
;
2738 if (config
.text_read_only
)
2739 output_bfd
->flags
|= WP_TEXT
;
2741 output_bfd
->flags
&= ~WP_TEXT
;
2742 if (link_info
.traditional_format
)
2743 output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2745 output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2748 case lang_target_statement_enum
:
2749 current_target
= statement
->target_statement
.target
;
2756 /* Convert between addresses in bytes and sizes in octets.
2757 For currently supported targets, octets_per_byte is always a power
2758 of two, so we can use shifts. */
2759 #define TO_ADDR(X) ((X) >> opb_shift)
2760 #define TO_SIZE(X) ((X) << opb_shift)
2762 /* Support the above. */
2763 static unsigned int opb_shift
= 0;
2768 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2769 ldfile_output_machine
);
2772 while ((x
& 1) == 0)
2780 /* Open all the input files. */
2783 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2785 for (; s
!= NULL
; s
= s
->header
.next
)
2787 switch (s
->header
.type
)
2789 case lang_constructors_statement_enum
:
2790 open_input_bfds (constructor_list
.head
, force
);
2792 case lang_output_section_statement_enum
:
2793 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2795 case lang_wild_statement_enum
:
2796 /* Maybe we should load the file's symbols. */
2797 if (s
->wild_statement
.filename
2798 && ! wildcardp (s
->wild_statement
.filename
))
2799 lookup_name (s
->wild_statement
.filename
);
2800 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2802 case lang_group_statement_enum
:
2804 struct bfd_link_hash_entry
*undefs
;
2806 /* We must continually search the entries in the group
2807 until no new symbols are added to the list of undefined
2812 undefs
= link_info
.hash
->undefs_tail
;
2813 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2815 while (undefs
!= link_info
.hash
->undefs_tail
);
2818 case lang_target_statement_enum
:
2819 current_target
= s
->target_statement
.target
;
2821 case lang_input_statement_enum
:
2822 if (s
->input_statement
.real
)
2824 lang_statement_list_type add
;
2826 s
->input_statement
.target
= current_target
;
2828 /* If we are being called from within a group, and this
2829 is an archive which has already been searched, then
2830 force it to be researched unless the whole archive
2831 has been loaded already. */
2833 && !s
->input_statement
.whole_archive
2834 && s
->input_statement
.loaded
2835 && bfd_check_format (s
->input_statement
.the_bfd
,
2837 s
->input_statement
.loaded
= FALSE
;
2839 lang_list_init (&add
);
2841 if (! load_symbols (&s
->input_statement
, &add
))
2842 config
.make_executable
= FALSE
;
2844 if (add
.head
!= NULL
)
2846 *add
.tail
= s
->header
.next
;
2847 s
->header
.next
= add
.head
;
2857 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2860 lang_track_definedness (const char *name
)
2862 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2863 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2866 /* New-function for the definedness hash table. */
2868 static struct bfd_hash_entry
*
2869 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2870 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2871 const char *name ATTRIBUTE_UNUSED
)
2873 struct lang_definedness_hash_entry
*ret
2874 = (struct lang_definedness_hash_entry
*) entry
;
2877 ret
= (struct lang_definedness_hash_entry
*)
2878 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
2881 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
2883 ret
->iteration
= -1;
2887 /* Return the iteration when the definition of NAME was last updated. A
2888 value of -1 means that the symbol is not defined in the linker script
2889 or the command line, but may be defined in the linker symbol table. */
2892 lang_symbol_definition_iteration (const char *name
)
2894 struct lang_definedness_hash_entry
*defentry
2895 = (struct lang_definedness_hash_entry
*)
2896 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2898 /* We've already created this one on the presence of DEFINED in the
2899 script, so it can't be NULL unless something is borked elsewhere in
2901 if (defentry
== NULL
)
2904 return defentry
->iteration
;
2907 /* Update the definedness state of NAME. */
2910 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
2912 struct lang_definedness_hash_entry
*defentry
2913 = (struct lang_definedness_hash_entry
*)
2914 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2916 /* We don't keep track of symbols not tested with DEFINED. */
2917 if (defentry
== NULL
)
2920 /* If the symbol was already defined, and not from an earlier statement
2921 iteration, don't update the definedness iteration, because that'd
2922 make the symbol seem defined in the linker script at this point, and
2923 it wasn't; it was defined in some object. If we do anyway, DEFINED
2924 would start to yield false before this point and the construct "sym =
2925 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2927 if (h
->type
!= bfd_link_hash_undefined
2928 && h
->type
!= bfd_link_hash_common
2929 && h
->type
!= bfd_link_hash_new
2930 && defentry
->iteration
== -1)
2933 defentry
->iteration
= lang_statement_iteration
;
2936 /* Add the supplied name to the symbol table as an undefined reference.
2937 This is a two step process as the symbol table doesn't even exist at
2938 the time the ld command line is processed. First we put the name
2939 on a list, then, once the output file has been opened, transfer the
2940 name to the symbol table. */
2942 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
2944 #define ldlang_undef_chain_list_head entry_symbol.next
2947 ldlang_add_undef (const char *const name
)
2949 ldlang_undef_chain_list_type
*new =
2950 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
2952 new->next
= ldlang_undef_chain_list_head
;
2953 ldlang_undef_chain_list_head
= new;
2955 new->name
= xstrdup (name
);
2957 if (output_bfd
!= NULL
)
2958 insert_undefined (new->name
);
2961 /* Insert NAME as undefined in the symbol table. */
2964 insert_undefined (const char *name
)
2966 struct bfd_link_hash_entry
*h
;
2968 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
2970 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2971 if (h
->type
== bfd_link_hash_new
)
2973 h
->type
= bfd_link_hash_undefined
;
2974 h
->u
.undef
.abfd
= NULL
;
2975 bfd_link_add_undef (link_info
.hash
, h
);
2979 /* Run through the list of undefineds created above and place them
2980 into the linker hash table as undefined symbols belonging to the
2984 lang_place_undefineds (void)
2986 ldlang_undef_chain_list_type
*ptr
;
2988 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
2989 insert_undefined (ptr
->name
);
2992 /* Check for all readonly or some readwrite sections. */
2995 check_input_sections
2996 (lang_statement_union_type
*s
,
2997 lang_output_section_statement_type
*output_section_statement
)
2999 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3001 switch (s
->header
.type
)
3003 case lang_wild_statement_enum
:
3004 walk_wild (&s
->wild_statement
, check_section_callback
,
3005 output_section_statement
);
3006 if (! output_section_statement
->all_input_readonly
)
3009 case lang_constructors_statement_enum
:
3010 check_input_sections (constructor_list
.head
,
3011 output_section_statement
);
3012 if (! output_section_statement
->all_input_readonly
)
3015 case lang_group_statement_enum
:
3016 check_input_sections (s
->group_statement
.children
.head
,
3017 output_section_statement
);
3018 if (! output_section_statement
->all_input_readonly
)
3027 /* Update wildcard statements if needed. */
3030 update_wild_statements (lang_statement_union_type
*s
)
3032 struct wildcard_list
*sec
;
3034 switch (sort_section
)
3044 for (; s
!= NULL
; s
= s
->header
.next
)
3046 switch (s
->header
.type
)
3051 case lang_wild_statement_enum
:
3052 sec
= s
->wild_statement
.section_list
;
3055 switch (sec
->spec
.sorted
)
3058 sec
->spec
.sorted
= sort_section
;
3061 if (sort_section
== by_alignment
)
3062 sec
->spec
.sorted
= by_name_alignment
;
3065 if (sort_section
== by_name
)
3066 sec
->spec
.sorted
= by_alignment_name
;
3074 case lang_constructors_statement_enum
:
3075 update_wild_statements (constructor_list
.head
);
3078 case lang_output_section_statement_enum
:
3079 update_wild_statements
3080 (s
->output_section_statement
.children
.head
);
3083 case lang_group_statement_enum
:
3084 update_wild_statements (s
->group_statement
.children
.head
);
3092 /* Open input files and attach to output sections. */
3095 map_input_to_output_sections
3096 (lang_statement_union_type
*s
, const char *target
,
3097 lang_output_section_statement_type
*os
)
3099 for (; s
!= NULL
; s
= s
->header
.next
)
3101 switch (s
->header
.type
)
3103 case lang_wild_statement_enum
:
3104 wild (&s
->wild_statement
, target
, os
);
3106 case lang_constructors_statement_enum
:
3107 map_input_to_output_sections (constructor_list
.head
,
3111 case lang_output_section_statement_enum
:
3112 if (s
->output_section_statement
.constraint
)
3114 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3115 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3117 s
->output_section_statement
.all_input_readonly
= TRUE
;
3118 check_input_sections (s
->output_section_statement
.children
.head
,
3119 &s
->output_section_statement
);
3120 if ((s
->output_section_statement
.all_input_readonly
3121 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3122 || (!s
->output_section_statement
.all_input_readonly
3123 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3125 s
->output_section_statement
.constraint
= -1;
3130 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3132 &s
->output_section_statement
);
3134 case lang_output_statement_enum
:
3136 case lang_target_statement_enum
:
3137 target
= s
->target_statement
.target
;
3139 case lang_group_statement_enum
:
3140 map_input_to_output_sections (s
->group_statement
.children
.head
,
3144 case lang_data_statement_enum
:
3145 /* Make sure that any sections mentioned in the expression
3147 exp_init_os (s
->data_statement
.exp
);
3148 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3150 /* The output section gets contents, and then we inspect for
3151 any flags set in the input script which override any ALLOC. */
3152 os
->bfd_section
->flags
|= SEC_HAS_CONTENTS
;
3153 if (!(os
->flags
& SEC_NEVER_LOAD
))
3154 os
->bfd_section
->flags
|= SEC_ALLOC
| SEC_LOAD
;
3156 case lang_fill_statement_enum
:
3157 case lang_input_section_enum
:
3158 case lang_object_symbols_statement_enum
:
3159 case lang_reloc_statement_enum
:
3160 case lang_padding_statement_enum
:
3161 case lang_input_statement_enum
:
3162 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3165 case lang_assignment_statement_enum
:
3166 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3169 /* Make sure that any sections mentioned in the assignment
3171 exp_init_os (s
->assignment_statement
.exp
);
3173 case lang_afile_asection_pair_statement_enum
:
3176 case lang_address_statement_enum
:
3177 /* Mark the specified section with the supplied address.
3179 If this section was actually a segment marker, then the
3180 directive is ignored if the linker script explicitly
3181 processed the segment marker. Originally, the linker
3182 treated segment directives (like -Ttext on the
3183 command-line) as section directives. We honor the
3184 section directive semantics for backwards compatibilty;
3185 linker scripts that do not specifically check for
3186 SEGMENT_START automatically get the old semantics. */
3187 if (!s
->address_statement
.segment
3188 || !s
->address_statement
.segment
->used
)
3190 lang_output_section_statement_type
*aos
3191 = (lang_output_section_statement_lookup
3192 (s
->address_statement
.section_name
));
3194 if (aos
->bfd_section
== NULL
)
3195 init_os (aos
, NULL
);
3196 aos
->addr_tree
= s
->address_statement
.address
;
3203 /* An output section might have been removed after its statement was
3204 added. For example, ldemul_before_allocation can remove dynamic
3205 sections if they turn out to be not needed. Clean them up here. */
3208 strip_excluded_output_sections (void)
3210 lang_output_section_statement_type
*os
;
3212 /* Run lang_size_sections (if not already done). */
3213 if (expld
.phase
!= lang_mark_phase_enum
)
3215 expld
.phase
= lang_mark_phase_enum
;
3216 expld
.dataseg
.phase
= exp_dataseg_none
;
3217 one_lang_size_sections_pass (NULL
, FALSE
);
3218 lang_reset_memory_regions ();
3221 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3225 asection
*output_section
;
3226 bfd_boolean exclude
;
3228 if (os
->constraint
== -1)
3231 output_section
= os
->bfd_section
;
3232 if (output_section
== NULL
)
3235 exclude
= (output_section
->rawsize
== 0
3236 && (output_section
->flags
& SEC_KEEP
) == 0
3237 && !bfd_section_removed_from_list (output_bfd
,
3240 /* Some sections have not yet been sized, notably .gnu.version,
3241 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3242 input sections, so don't drop output sections that have such
3243 input sections unless they are also marked SEC_EXCLUDE. */
3244 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3248 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3249 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3250 && (s
->flags
& SEC_EXCLUDE
) == 0)
3257 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3258 output_section
->map_head
.link_order
= NULL
;
3259 output_section
->map_tail
.link_order
= NULL
;
3263 /* We don't set bfd_section to NULL since bfd_section of the
3264 removed output section statement may still be used. */
3266 output_section
->flags
|= SEC_EXCLUDE
;
3267 bfd_section_list_remove (output_bfd
, output_section
);
3268 output_bfd
->section_count
--;
3272 /* Stop future calls to lang_add_section from messing with map_head
3273 and map_tail link_order fields. */
3274 stripped_excluded_sections
= TRUE
;
3278 print_output_section_statement
3279 (lang_output_section_statement_type
*output_section_statement
)
3281 asection
*section
= output_section_statement
->bfd_section
;
3284 if (output_section_statement
!= abs_output_section
)
3286 minfo ("\n%s", output_section_statement
->name
);
3288 if (section
!= NULL
)
3290 print_dot
= section
->vma
;
3292 len
= strlen (output_section_statement
->name
);
3293 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3298 while (len
< SECTION_NAME_MAP_LENGTH
)
3304 minfo ("0x%V %W", section
->vma
, section
->size
);
3306 if (output_section_statement
->load_base
!= NULL
)
3310 addr
= exp_get_abs_int (output_section_statement
->load_base
, 0,
3312 minfo (_(" load address 0x%V"), addr
);
3319 print_statement_list (output_section_statement
->children
.head
,
3320 output_section_statement
);
3323 /* Scan for the use of the destination in the right hand side
3324 of an expression. In such cases we will not compute the
3325 correct expression, since the value of DST that is used on
3326 the right hand side will be its final value, not its value
3327 just before this expression is evaluated. */
3330 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3332 if (rhs
== NULL
|| dst
== NULL
)
3335 switch (rhs
->type
.node_class
)
3338 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3339 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3342 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3343 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3346 case etree_provided
:
3348 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3350 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3353 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3357 return strcmp (dst
, rhs
->value
.str
) == 0;
3362 return strcmp (dst
, rhs
->name
.name
) == 0;
3374 print_assignment (lang_assignment_statement_type
*assignment
,
3375 lang_output_section_statement_type
*output_section
)
3379 bfd_boolean computation_is_valid
= TRUE
;
3382 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3385 if (assignment
->exp
->type
.node_class
== etree_assert
)
3388 tree
= assignment
->exp
->assert_s
.child
;
3389 computation_is_valid
= TRUE
;
3393 const char *dst
= assignment
->exp
->assign
.dst
;
3395 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3396 tree
= assignment
->exp
->assign
.src
;
3397 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3400 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3401 if (expld
.result
.valid_p
)
3405 if (computation_is_valid
)
3407 value
= expld
.result
.value
;
3409 if (expld
.result
.section
)
3410 value
+= expld
.result
.section
->vma
;
3412 minfo ("0x%V", value
);
3418 struct bfd_link_hash_entry
*h
;
3420 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3421 FALSE
, FALSE
, TRUE
);
3424 value
= h
->u
.def
.value
;
3426 if (expld
.result
.section
)
3427 value
+= expld
.result
.section
->vma
;
3429 minfo ("[0x%V]", value
);
3432 minfo ("[unresolved]");
3444 exp_print_tree (assignment
->exp
);
3449 print_input_statement (lang_input_statement_type
*statm
)
3451 if (statm
->filename
!= NULL
)
3453 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3457 /* Print all symbols defined in a particular section. This is called
3458 via bfd_link_hash_traverse, or by print_all_symbols. */
3461 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3463 asection
*sec
= ptr
;
3465 if ((hash_entry
->type
== bfd_link_hash_defined
3466 || hash_entry
->type
== bfd_link_hash_defweak
)
3467 && sec
== hash_entry
->u
.def
.section
)
3471 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3474 (hash_entry
->u
.def
.value
3475 + hash_entry
->u
.def
.section
->output_offset
3476 + hash_entry
->u
.def
.section
->output_section
->vma
));
3478 minfo (" %T\n", hash_entry
->root
.string
);
3485 print_all_symbols (sec
)
3488 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3489 struct map_symbol_def
*def
;
3494 *ud
->map_symbol_def_tail
= 0;
3495 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3496 print_one_symbol (def
->entry
, sec
);
3499 /* Print information about an input section to the map file. */
3502 print_input_section (asection
*i
)
3504 bfd_size_type size
= i
->size
;
3513 minfo ("%s", i
->name
);
3515 len
= 1 + strlen (i
->name
);
3516 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3521 while (len
< SECTION_NAME_MAP_LENGTH
)
3527 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3528 addr
= i
->output_section
->vma
+ i
->output_offset
;
3535 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3537 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3539 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3551 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3554 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3556 if (command_line
.reduce_memory_overheads
)
3557 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3559 print_all_symbols (i
);
3561 print_dot
= addr
+ TO_ADDR (size
);
3567 print_fill_statement (lang_fill_statement_type
*fill
)
3571 fputs (" FILL mask 0x", config
.map_file
);
3572 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3573 fprintf (config
.map_file
, "%02x", *p
);
3574 fputs ("\n", config
.map_file
);
3578 print_data_statement (lang_data_statement_type
*data
)
3586 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3589 addr
= data
->output_offset
;
3590 if (data
->output_section
!= NULL
)
3591 addr
+= data
->output_section
->vma
;
3619 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3621 if (data
->exp
->type
.node_class
!= etree_value
)
3624 exp_print_tree (data
->exp
);
3629 print_dot
= addr
+ TO_ADDR (size
);
3632 /* Print an address statement. These are generated by options like
3636 print_address_statement (lang_address_statement_type
*address
)
3638 minfo (_("Address of section %s set to "), address
->section_name
);
3639 exp_print_tree (address
->address
);
3643 /* Print a reloc statement. */
3646 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3653 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3656 addr
= reloc
->output_offset
;
3657 if (reloc
->output_section
!= NULL
)
3658 addr
+= reloc
->output_section
->vma
;
3660 size
= bfd_get_reloc_size (reloc
->howto
);
3662 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3664 if (reloc
->name
!= NULL
)
3665 minfo ("%s+", reloc
->name
);
3667 minfo ("%s+", reloc
->section
->name
);
3669 exp_print_tree (reloc
->addend_exp
);
3673 print_dot
= addr
+ TO_ADDR (size
);
3677 print_padding_statement (lang_padding_statement_type
*s
)
3685 len
= sizeof " *fill*" - 1;
3686 while (len
< SECTION_NAME_MAP_LENGTH
)
3692 addr
= s
->output_offset
;
3693 if (s
->output_section
!= NULL
)
3694 addr
+= s
->output_section
->vma
;
3695 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3697 if (s
->fill
->size
!= 0)
3701 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3702 fprintf (config
.map_file
, "%02x", *p
);
3707 print_dot
= addr
+ TO_ADDR (s
->size
);
3711 print_wild_statement (lang_wild_statement_type
*w
,
3712 lang_output_section_statement_type
*os
)
3714 struct wildcard_list
*sec
;
3718 if (w
->filenames_sorted
)
3720 if (w
->filename
!= NULL
)
3721 minfo ("%s", w
->filename
);
3724 if (w
->filenames_sorted
)
3728 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
3730 if (sec
->spec
.sorted
)
3732 if (sec
->spec
.exclude_name_list
!= NULL
)
3735 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
3736 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
3737 minfo (" %s", tmp
->name
);
3740 if (sec
->spec
.name
!= NULL
)
3741 minfo ("%s", sec
->spec
.name
);
3744 if (sec
->spec
.sorted
)
3753 print_statement_list (w
->children
.head
, os
);
3756 /* Print a group statement. */
3759 print_group (lang_group_statement_type
*s
,
3760 lang_output_section_statement_type
*os
)
3762 fprintf (config
.map_file
, "START GROUP\n");
3763 print_statement_list (s
->children
.head
, os
);
3764 fprintf (config
.map_file
, "END GROUP\n");
3767 /* Print the list of statements in S.
3768 This can be called for any statement type. */
3771 print_statement_list (lang_statement_union_type
*s
,
3772 lang_output_section_statement_type
*os
)
3776 print_statement (s
, os
);
3781 /* Print the first statement in statement list S.
3782 This can be called for any statement type. */
3785 print_statement (lang_statement_union_type
*s
,
3786 lang_output_section_statement_type
*os
)
3788 switch (s
->header
.type
)
3791 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
3794 case lang_constructors_statement_enum
:
3795 if (constructor_list
.head
!= NULL
)
3797 if (constructors_sorted
)
3798 minfo (" SORT (CONSTRUCTORS)\n");
3800 minfo (" CONSTRUCTORS\n");
3801 print_statement_list (constructor_list
.head
, os
);
3804 case lang_wild_statement_enum
:
3805 print_wild_statement (&s
->wild_statement
, os
);
3807 case lang_address_statement_enum
:
3808 print_address_statement (&s
->address_statement
);
3810 case lang_object_symbols_statement_enum
:
3811 minfo (" CREATE_OBJECT_SYMBOLS\n");
3813 case lang_fill_statement_enum
:
3814 print_fill_statement (&s
->fill_statement
);
3816 case lang_data_statement_enum
:
3817 print_data_statement (&s
->data_statement
);
3819 case lang_reloc_statement_enum
:
3820 print_reloc_statement (&s
->reloc_statement
);
3822 case lang_input_section_enum
:
3823 print_input_section (s
->input_section
.section
);
3825 case lang_padding_statement_enum
:
3826 print_padding_statement (&s
->padding_statement
);
3828 case lang_output_section_statement_enum
:
3829 print_output_section_statement (&s
->output_section_statement
);
3831 case lang_assignment_statement_enum
:
3832 print_assignment (&s
->assignment_statement
, os
);
3834 case lang_target_statement_enum
:
3835 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
3837 case lang_output_statement_enum
:
3838 minfo ("OUTPUT(%s", s
->output_statement
.name
);
3839 if (output_target
!= NULL
)
3840 minfo (" %s", output_target
);
3843 case lang_input_statement_enum
:
3844 print_input_statement (&s
->input_statement
);
3846 case lang_group_statement_enum
:
3847 print_group (&s
->group_statement
, os
);
3849 case lang_afile_asection_pair_statement_enum
:
3856 print_statements (void)
3858 print_statement_list (statement_list
.head
, abs_output_section
);
3861 /* Print the first N statements in statement list S to STDERR.
3862 If N == 0, nothing is printed.
3863 If N < 0, the entire list is printed.
3864 Intended to be called from GDB. */
3867 dprint_statement (lang_statement_union_type
*s
, int n
)
3869 FILE *map_save
= config
.map_file
;
3871 config
.map_file
= stderr
;
3874 print_statement_list (s
, abs_output_section
);
3877 while (s
&& --n
>= 0)
3879 print_statement (s
, abs_output_section
);
3884 config
.map_file
= map_save
;
3888 insert_pad (lang_statement_union_type
**ptr
,
3890 unsigned int alignment_needed
,
3891 asection
*output_section
,
3894 static fill_type zero_fill
= { 1, { 0 } };
3895 lang_statement_union_type
*pad
= NULL
;
3897 if (ptr
!= &statement_list
.head
)
3898 pad
= ((lang_statement_union_type
*)
3899 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
3901 && pad
->header
.type
== lang_padding_statement_enum
3902 && pad
->padding_statement
.output_section
== output_section
)
3904 /* Use the existing pad statement. */
3906 else if ((pad
= *ptr
) != NULL
3907 && pad
->header
.type
== lang_padding_statement_enum
3908 && pad
->padding_statement
.output_section
== output_section
)
3910 /* Use the existing pad statement. */
3914 /* Make a new padding statement, linked into existing chain. */
3915 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
3916 pad
->header
.next
= *ptr
;
3918 pad
->header
.type
= lang_padding_statement_enum
;
3919 pad
->padding_statement
.output_section
= output_section
;
3922 pad
->padding_statement
.fill
= fill
;
3924 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
3925 pad
->padding_statement
.size
= alignment_needed
;
3926 output_section
->size
+= alignment_needed
;
3929 /* Work out how much this section will move the dot point. */
3933 (lang_statement_union_type
**this_ptr
,
3934 lang_output_section_statement_type
*output_section_statement
,
3938 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
3939 asection
*i
= is
->section
;
3941 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
3942 && (i
->flags
& SEC_EXCLUDE
) == 0)
3944 unsigned int alignment_needed
;
3947 /* Align this section first to the input sections requirement,
3948 then to the output section's requirement. If this alignment
3949 is greater than any seen before, then record it too. Perform
3950 the alignment by inserting a magic 'padding' statement. */
3952 if (output_section_statement
->subsection_alignment
!= -1)
3953 i
->alignment_power
= output_section_statement
->subsection_alignment
;
3955 o
= output_section_statement
->bfd_section
;
3956 if (o
->alignment_power
< i
->alignment_power
)
3957 o
->alignment_power
= i
->alignment_power
;
3959 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
3961 if (alignment_needed
!= 0)
3963 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
3964 dot
+= alignment_needed
;
3967 /* Remember where in the output section this input section goes. */
3969 i
->output_offset
= dot
- o
->vma
;
3971 /* Mark how big the output section must be to contain this now. */
3972 dot
+= TO_ADDR (i
->size
);
3973 o
->size
= TO_SIZE (dot
- o
->vma
);
3977 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
3984 sort_sections_by_lma (const void *arg1
, const void *arg2
)
3986 const asection
*sec1
= *(const asection
**) arg1
;
3987 const asection
*sec2
= *(const asection
**) arg2
;
3989 if (bfd_section_lma (sec1
->owner
, sec1
)
3990 < bfd_section_lma (sec2
->owner
, sec2
))
3992 else if (bfd_section_lma (sec1
->owner
, sec1
)
3993 > bfd_section_lma (sec2
->owner
, sec2
))
3999 #define IGNORE_SECTION(s) \
4000 ((s->flags & SEC_NEVER_LOAD) != 0 \
4001 || (s->flags & SEC_ALLOC) == 0 \
4002 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4003 && (s->flags & SEC_LOAD) == 0))
4005 /* Check to see if any allocated sections overlap with other allocated
4006 sections. This can happen if a linker script specifies the output
4007 section addresses of the two sections. */
4010 lang_check_section_addresses (void)
4013 asection
**sections
, **spp
;
4021 if (bfd_count_sections (output_bfd
) <= 1)
4024 amt
= bfd_count_sections (output_bfd
) * sizeof (asection
*);
4025 sections
= xmalloc (amt
);
4027 /* Scan all sections in the output list. */
4029 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4031 /* Only consider loadable sections with real contents. */
4032 if (IGNORE_SECTION (s
) || s
->size
== 0)
4035 sections
[count
] = s
;
4042 qsort (sections
, (size_t) count
, sizeof (asection
*),
4043 sort_sections_by_lma
);
4047 s_start
= bfd_section_lma (output_bfd
, s
);
4048 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4049 for (count
--; count
; count
--)
4051 /* We must check the sections' LMA addresses not their VMA
4052 addresses because overlay sections can have overlapping VMAs
4053 but they must have distinct LMAs. */
4058 s_start
= bfd_section_lma (output_bfd
, s
);
4059 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4061 /* Look for an overlap. */
4062 if (s_end
>= os_start
&& s_start
<= os_end
)
4063 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4064 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4070 /* Make sure the new address is within the region. We explicitly permit the
4071 current address to be at the exact end of the region when the address is
4072 non-zero, in case the region is at the end of addressable memory and the
4073 calculation wraps around. */
4076 os_region_check (lang_output_section_statement_type
*os
,
4077 lang_memory_region_type
*region
,
4081 if ((region
->current
< region
->origin
4082 || (region
->current
- region
->origin
> region
->length
))
4083 && ((region
->current
!= region
->origin
+ region
->length
)
4088 einfo (_("%X%P: address 0x%v of %B section %s"
4089 " is not within region %s\n"),
4091 os
->bfd_section
->owner
,
4092 os
->bfd_section
->name
,
4097 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4099 os
->bfd_section
->owner
,
4100 os
->bfd_section
->name
);
4102 /* Reset the region pointer. */
4103 region
->current
= region
->origin
;
4107 /* Set the sizes for all the output sections. */
4110 lang_size_sections_1
4111 (lang_statement_union_type
*s
,
4112 lang_output_section_statement_type
*output_section_statement
,
4113 lang_statement_union_type
**prev
,
4117 bfd_boolean check_regions
)
4119 /* Size up the sections from their constituent parts. */
4120 for (; s
!= NULL
; s
= s
->header
.next
)
4122 switch (s
->header
.type
)
4124 case lang_output_section_statement_enum
:
4126 bfd_vma newdot
, after
;
4127 lang_output_section_statement_type
*os
;
4129 os
= &s
->output_section_statement
;
4130 if (os
->addr_tree
!= NULL
)
4132 os
->processed
= FALSE
;
4133 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4135 if (!expld
.result
.valid_p
4136 && expld
.phase
!= lang_mark_phase_enum
)
4137 einfo (_("%F%S: non constant or forward reference"
4138 " address expression for section %s\n"),
4141 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4144 if (os
->bfd_section
== NULL
)
4145 /* This section was removed or never actually created. */
4148 /* If this is a COFF shared library section, use the size and
4149 address from the input section. FIXME: This is COFF
4150 specific; it would be cleaner if there were some other way
4151 to do this, but nothing simple comes to mind. */
4152 if ((bfd_get_flavour (output_bfd
) == bfd_target_ecoff_flavour
4153 || bfd_get_flavour (output_bfd
) == bfd_target_coff_flavour
)
4154 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4158 if (os
->children
.head
== NULL
4159 || os
->children
.head
->header
.next
!= NULL
4160 || (os
->children
.head
->header
.type
4161 != lang_input_section_enum
))
4162 einfo (_("%P%X: Internal error on COFF shared library"
4163 " section %s\n"), os
->name
);
4165 input
= os
->children
.head
->input_section
.section
;
4166 bfd_set_section_vma (os
->bfd_section
->owner
,
4168 bfd_section_vma (input
->owner
, input
));
4169 os
->bfd_section
->size
= input
->size
;
4174 if (bfd_is_abs_section (os
->bfd_section
))
4176 /* No matter what happens, an abs section starts at zero. */
4177 ASSERT (os
->bfd_section
->vma
== 0);
4183 if (os
->addr_tree
== NULL
)
4185 /* No address specified for this section, get one
4186 from the region specification. */
4187 if (os
->region
== NULL
4188 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4189 && os
->region
->name
[0] == '*'
4190 && strcmp (os
->region
->name
,
4191 DEFAULT_MEMORY_REGION
) == 0))
4193 os
->region
= lang_memory_default (os
->bfd_section
);
4196 /* If a loadable section is using the default memory
4197 region, and some non default memory regions were
4198 defined, issue an error message. */
4199 if (!IGNORE_SECTION (os
->bfd_section
)
4200 && ! link_info
.relocatable
4202 && strcmp (os
->region
->name
,
4203 DEFAULT_MEMORY_REGION
) == 0
4204 && lang_memory_region_list
!= NULL
4205 && (strcmp (lang_memory_region_list
->name
,
4206 DEFAULT_MEMORY_REGION
) != 0
4207 || lang_memory_region_list
->next
!= NULL
)
4208 && expld
.phase
!= lang_mark_phase_enum
)
4210 /* By default this is an error rather than just a
4211 warning because if we allocate the section to the
4212 default memory region we can end up creating an
4213 excessively large binary, or even seg faulting when
4214 attempting to perform a negative seek. See
4215 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4216 for an example of this. This behaviour can be
4217 overridden by the using the --no-check-sections
4219 if (command_line
.check_section_addresses
)
4220 einfo (_("%P%F: error: no memory region specified"
4221 " for loadable section `%s'\n"),
4222 bfd_get_section_name (output_bfd
,
4225 einfo (_("%P: warning: no memory region specified"
4226 " for loadable section `%s'\n"),
4227 bfd_get_section_name (output_bfd
,
4231 newdot
= os
->region
->current
;
4232 align
= os
->bfd_section
->alignment_power
;
4235 align
= os
->section_alignment
;
4237 /* Align to what the section needs. */
4240 bfd_vma savedot
= newdot
;
4241 newdot
= align_power (newdot
, align
);
4243 if (newdot
!= savedot
4244 && (config
.warn_section_align
4245 || os
->addr_tree
!= NULL
)
4246 && expld
.phase
!= lang_mark_phase_enum
)
4247 einfo (_("%P: warning: changing start of section"
4248 " %s by %lu bytes\n"),
4249 os
->name
, (unsigned long) (newdot
- savedot
));
4252 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4254 os
->bfd_section
->output_offset
= 0;
4257 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4258 os
->fill
, newdot
, relax
, check_regions
);
4260 os
->processed
= TRUE
;
4262 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4264 ASSERT (os
->bfd_section
->size
== 0);
4268 dot
= os
->bfd_section
->vma
;
4270 /* Put the section within the requested block size, or
4271 align at the block boundary. */
4273 + TO_ADDR (os
->bfd_section
->size
)
4274 + os
->block_value
- 1)
4275 & - (bfd_vma
) os
->block_value
);
4277 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4279 /* .tbss sections effectively have zero size. */
4280 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4281 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4282 || link_info
.relocatable
)
4283 dot
+= TO_ADDR (os
->bfd_section
->size
);
4285 if (os
->update_dot_tree
!= 0)
4286 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4288 /* Update dot in the region ?
4289 We only do this if the section is going to be allocated,
4290 since unallocated sections do not contribute to the region's
4291 overall size in memory.
4293 If the SEC_NEVER_LOAD bit is not set, it will affect the
4294 addresses of sections after it. We have to update
4296 if (os
->region
!= NULL
4297 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4298 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4300 os
->region
->current
= dot
;
4303 /* Make sure the new address is within the region. */
4304 os_region_check (os
, os
->region
, os
->addr_tree
,
4305 os
->bfd_section
->vma
);
4307 /* If there's no load address specified, use the run
4308 region as the load region. */
4309 if (os
->lma_region
== NULL
&& os
->load_base
== NULL
)
4310 os
->lma_region
= os
->region
;
4312 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
)
4314 /* Set load_base, which will be handled later. */
4315 os
->load_base
= exp_intop (os
->lma_region
->current
);
4316 os
->lma_region
->current
+=
4317 TO_ADDR (os
->bfd_section
->size
);
4319 os_region_check (os
, os
->lma_region
, NULL
,
4320 os
->bfd_section
->lma
);
4326 case lang_constructors_statement_enum
:
4327 dot
= lang_size_sections_1 (constructor_list
.head
,
4328 output_section_statement
,
4329 &s
->wild_statement
.children
.head
,
4330 fill
, dot
, relax
, check_regions
);
4333 case lang_data_statement_enum
:
4335 unsigned int size
= 0;
4337 s
->data_statement
.output_offset
=
4338 dot
- output_section_statement
->bfd_section
->vma
;
4339 s
->data_statement
.output_section
=
4340 output_section_statement
->bfd_section
;
4342 /* We might refer to provided symbols in the expression, and
4343 need to mark them as needed. */
4344 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4346 switch (s
->data_statement
.type
)
4364 if (size
< TO_SIZE ((unsigned) 1))
4365 size
= TO_SIZE ((unsigned) 1);
4366 dot
+= TO_ADDR (size
);
4367 output_section_statement
->bfd_section
->size
+= size
;
4371 case lang_reloc_statement_enum
:
4375 s
->reloc_statement
.output_offset
=
4376 dot
- output_section_statement
->bfd_section
->vma
;
4377 s
->reloc_statement
.output_section
=
4378 output_section_statement
->bfd_section
;
4379 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4380 dot
+= TO_ADDR (size
);
4381 output_section_statement
->bfd_section
->size
+= size
;
4385 case lang_wild_statement_enum
:
4386 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4387 output_section_statement
,
4388 &s
->wild_statement
.children
.head
,
4389 fill
, dot
, relax
, check_regions
);
4392 case lang_object_symbols_statement_enum
:
4393 link_info
.create_object_symbols_section
=
4394 output_section_statement
->bfd_section
;
4397 case lang_output_statement_enum
:
4398 case lang_target_statement_enum
:
4401 case lang_input_section_enum
:
4405 i
= (*prev
)->input_section
.section
;
4410 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4411 einfo (_("%P%F: can't relax section: %E\n"));
4415 dot
= size_input_section (prev
, output_section_statement
,
4416 output_section_statement
->fill
, dot
);
4420 case lang_input_statement_enum
:
4423 case lang_fill_statement_enum
:
4424 s
->fill_statement
.output_section
=
4425 output_section_statement
->bfd_section
;
4427 fill
= s
->fill_statement
.fill
;
4430 case lang_assignment_statement_enum
:
4432 bfd_vma newdot
= dot
;
4434 exp_fold_tree (s
->assignment_statement
.exp
,
4435 output_section_statement
->bfd_section
,
4438 if (newdot
!= dot
&& !output_section_statement
->ignored
)
4440 if (output_section_statement
== abs_output_section
)
4442 /* If we don't have an output section, then just adjust
4443 the default memory address. */
4444 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4445 FALSE
)->current
= newdot
;
4449 /* Insert a pad after this statement. We can't
4450 put the pad before when relaxing, in case the
4451 assignment references dot. */
4452 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4453 output_section_statement
->bfd_section
, dot
);
4455 /* Don't neuter the pad below when relaxing. */
4458 /* If dot is advanced, this implies that the section
4459 should have space allocated to it, unless the
4460 user has explicitly stated that the section
4461 should never be loaded. */
4462 if (!(output_section_statement
->flags
4463 & (SEC_NEVER_LOAD
| SEC_ALLOC
)))
4464 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4471 case lang_padding_statement_enum
:
4472 /* If this is the first time lang_size_sections is called,
4473 we won't have any padding statements. If this is the
4474 second or later passes when relaxing, we should allow
4475 padding to shrink. If padding is needed on this pass, it
4476 will be added back in. */
4477 s
->padding_statement
.size
= 0;
4479 /* Make sure output_offset is valid. If relaxation shrinks
4480 the section and this pad isn't needed, it's possible to
4481 have output_offset larger than the final size of the
4482 section. bfd_set_section_contents will complain even for
4483 a pad size of zero. */
4484 s
->padding_statement
.output_offset
4485 = dot
- output_section_statement
->bfd_section
->vma
;
4488 case lang_group_statement_enum
:
4489 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4490 output_section_statement
,
4491 &s
->group_statement
.children
.head
,
4492 fill
, dot
, relax
, check_regions
);
4499 /* We can only get here when relaxing is turned on. */
4500 case lang_address_statement_enum
:
4503 prev
= &s
->header
.next
;
4509 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
4511 lang_statement_iteration
++;
4512 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
4513 &statement_list
.head
, 0, 0, relax
, check_regions
);
4517 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
4519 expld
.phase
= lang_allocating_phase_enum
;
4520 expld
.dataseg
.phase
= exp_dataseg_none
;
4522 one_lang_size_sections_pass (relax
, check_regions
);
4523 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
4524 && link_info
.relro
&& expld
.dataseg
.relro_end
)
4526 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4527 to put expld.dataseg.relro on a (common) page boundary. */
4528 bfd_vma old_min_base
, relro_end
, maxpage
;
4530 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
4531 old_min_base
= expld
.dataseg
.min_base
;
4532 maxpage
= expld
.dataseg
.maxpagesize
;
4533 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
4534 & (expld
.dataseg
.pagesize
- 1));
4535 /* Compute the expected PT_GNU_RELRO segment end. */
4536 relro_end
= (expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
4537 & ~(expld
.dataseg
.pagesize
- 1);
4538 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
4540 expld
.dataseg
.base
-= maxpage
;
4541 relro_end
-= maxpage
;
4543 one_lang_size_sections_pass (relax
, check_regions
);
4544 if (expld
.dataseg
.relro_end
> relro_end
)
4546 /* The alignment of sections between DATA_SEGMENT_ALIGN
4547 and DATA_SEGMENT_RELRO_END caused huge padding to be
4548 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4550 unsigned int max_alignment_power
= 0;
4552 /* Find maximum alignment power of sections between
4553 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4554 for (sec
= output_bfd
->sections
; sec
; sec
= sec
->next
)
4555 if (sec
->vma
>= expld
.dataseg
.base
4556 && sec
->vma
< expld
.dataseg
.relro_end
4557 && sec
->alignment_power
> max_alignment_power
)
4558 max_alignment_power
= sec
->alignment_power
;
4560 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
4562 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
4564 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
4565 expld
.dataseg
.base
-= (1 << max_alignment_power
);
4566 one_lang_size_sections_pass (relax
, check_regions
);
4569 link_info
.relro_start
= expld
.dataseg
.base
;
4570 link_info
.relro_end
= expld
.dataseg
.relro_end
;
4572 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
4574 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4575 a page could be saved in the data segment. */
4576 bfd_vma first
, last
;
4578 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
4579 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
4581 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
4582 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
4583 && first
+ last
<= expld
.dataseg
.pagesize
)
4585 expld
.dataseg
.phase
= exp_dataseg_adjust
;
4586 one_lang_size_sections_pass (relax
, check_regions
);
4590 expld
.phase
= lang_final_phase_enum
;
4593 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4596 lang_do_assignments_1
4597 (lang_statement_union_type
*s
,
4598 lang_output_section_statement_type
*output_section_statement
,
4602 for (; s
!= NULL
; s
= s
->header
.next
)
4604 switch (s
->header
.type
)
4606 case lang_constructors_statement_enum
:
4607 dot
= lang_do_assignments_1 (constructor_list
.head
,
4608 output_section_statement
,
4613 case lang_output_section_statement_enum
:
4615 lang_output_section_statement_type
*os
;
4617 os
= &(s
->output_section_statement
);
4618 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
4620 dot
= os
->bfd_section
->vma
;
4621 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
4622 /* .tbss sections effectively have zero size. */
4623 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4624 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4625 || link_info
.relocatable
)
4626 dot
+= TO_ADDR (os
->bfd_section
->size
);
4630 /* If nothing has been placed into the output section then
4631 it won't have a bfd_section. */
4632 if (os
->bfd_section
&& !os
->ignored
)
4634 os
->bfd_section
->lma
4635 = exp_get_abs_int (os
->load_base
, 0, "load base");
4641 case lang_wild_statement_enum
:
4643 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
4644 output_section_statement
,
4648 case lang_object_symbols_statement_enum
:
4649 case lang_output_statement_enum
:
4650 case lang_target_statement_enum
:
4653 case lang_data_statement_enum
:
4654 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4655 if (expld
.result
.valid_p
)
4656 s
->data_statement
.value
= (expld
.result
.value
4657 + expld
.result
.section
->vma
);
4659 einfo (_("%F%P: invalid data statement\n"));
4662 switch (s
->data_statement
.type
)
4680 if (size
< TO_SIZE ((unsigned) 1))
4681 size
= TO_SIZE ((unsigned) 1);
4682 dot
+= TO_ADDR (size
);
4686 case lang_reloc_statement_enum
:
4687 exp_fold_tree (s
->reloc_statement
.addend_exp
,
4688 bfd_abs_section_ptr
, &dot
);
4689 if (expld
.result
.valid_p
)
4690 s
->reloc_statement
.addend_value
= expld
.result
.value
;
4692 einfo (_("%F%P: invalid reloc statement\n"));
4693 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
4696 case lang_input_section_enum
:
4698 asection
*in
= s
->input_section
.section
;
4700 if ((in
->flags
& SEC_EXCLUDE
) == 0)
4701 dot
+= TO_ADDR (in
->size
);
4705 case lang_input_statement_enum
:
4708 case lang_fill_statement_enum
:
4709 fill
= s
->fill_statement
.fill
;
4712 case lang_assignment_statement_enum
:
4713 exp_fold_tree (s
->assignment_statement
.exp
,
4714 output_section_statement
->bfd_section
,
4718 case lang_padding_statement_enum
:
4719 dot
+= TO_ADDR (s
->padding_statement
.size
);
4722 case lang_group_statement_enum
:
4723 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
4724 output_section_statement
,
4732 case lang_address_statement_enum
:
4740 lang_do_assignments (void)
4742 lang_statement_iteration
++;
4743 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
4746 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4747 operator .startof. (section_name), it produces an undefined symbol
4748 .startof.section_name. Similarly, when it sees
4749 .sizeof. (section_name), it produces an undefined symbol
4750 .sizeof.section_name. For all the output sections, we look for
4751 such symbols, and set them to the correct value. */
4754 lang_set_startof (void)
4758 if (link_info
.relocatable
)
4761 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4763 const char *secname
;
4765 struct bfd_link_hash_entry
*h
;
4767 secname
= bfd_get_section_name (output_bfd
, s
);
4768 buf
= xmalloc (10 + strlen (secname
));
4770 sprintf (buf
, ".startof.%s", secname
);
4771 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4772 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4774 h
->type
= bfd_link_hash_defined
;
4775 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, s
);
4776 h
->u
.def
.section
= bfd_abs_section_ptr
;
4779 sprintf (buf
, ".sizeof.%s", secname
);
4780 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4781 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4783 h
->type
= bfd_link_hash_defined
;
4784 h
->u
.def
.value
= TO_ADDR (s
->size
);
4785 h
->u
.def
.section
= bfd_abs_section_ptr
;
4795 struct bfd_link_hash_entry
*h
;
4798 if (link_info
.relocatable
|| link_info
.shared
)
4803 if (entry_symbol
.name
== NULL
)
4805 /* No entry has been specified. Look for the default entry, but
4806 don't warn if we don't find it. */
4807 entry_symbol
.name
= entry_symbol_default
;
4811 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
4812 FALSE
, FALSE
, TRUE
);
4814 && (h
->type
== bfd_link_hash_defined
4815 || h
->type
== bfd_link_hash_defweak
)
4816 && h
->u
.def
.section
->output_section
!= NULL
)
4820 val
= (h
->u
.def
.value
4821 + bfd_get_section_vma (output_bfd
,
4822 h
->u
.def
.section
->output_section
)
4823 + h
->u
.def
.section
->output_offset
);
4824 if (! bfd_set_start_address (output_bfd
, val
))
4825 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
4832 /* We couldn't find the entry symbol. Try parsing it as a
4834 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
4837 if (! bfd_set_start_address (output_bfd
, val
))
4838 einfo (_("%P%F: can't set start address\n"));
4844 /* Can't find the entry symbol, and it's not a number. Use
4845 the first address in the text section. */
4846 ts
= bfd_get_section_by_name (output_bfd
, entry_section
);
4850 einfo (_("%P: warning: cannot find entry symbol %s;"
4851 " defaulting to %V\n"),
4853 bfd_get_section_vma (output_bfd
, ts
));
4854 if (! bfd_set_start_address (output_bfd
,
4855 bfd_get_section_vma (output_bfd
,
4857 einfo (_("%P%F: can't set start address\n"));
4862 einfo (_("%P: warning: cannot find entry symbol %s;"
4863 " not setting start address\n"),
4869 /* Don't bfd_hash_table_free (&lang_definedness_table);
4870 map file output may result in a call of lang_track_definedness. */
4873 /* This is a small function used when we want to ignore errors from
4877 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
4879 /* Don't do anything. */
4882 /* Check that the architecture of all the input files is compatible
4883 with the output file. Also call the backend to let it do any
4884 other checking that is needed. */
4889 lang_statement_union_type
*file
;
4891 const bfd_arch_info_type
*compatible
;
4893 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
4895 input_bfd
= file
->input_statement
.the_bfd
;
4897 = bfd_arch_get_compatible (input_bfd
, output_bfd
,
4898 command_line
.accept_unknown_input_arch
);
4900 /* In general it is not possible to perform a relocatable
4901 link between differing object formats when the input
4902 file has relocations, because the relocations in the
4903 input format may not have equivalent representations in
4904 the output format (and besides BFD does not translate
4905 relocs for other link purposes than a final link). */
4906 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
4907 && (compatible
== NULL
4908 || bfd_get_flavour (input_bfd
) != bfd_get_flavour (output_bfd
))
4909 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
4911 einfo (_("%P%F: Relocatable linking with relocations from"
4912 " format %s (%B) to format %s (%B) is not supported\n"),
4913 bfd_get_target (input_bfd
), input_bfd
,
4914 bfd_get_target (output_bfd
), output_bfd
);
4915 /* einfo with %F exits. */
4918 if (compatible
== NULL
)
4920 if (command_line
.warn_mismatch
)
4921 einfo (_("%P: warning: %s architecture of input file `%B'"
4922 " is incompatible with %s output\n"),
4923 bfd_printable_name (input_bfd
), input_bfd
,
4924 bfd_printable_name (output_bfd
));
4926 else if (bfd_count_sections (input_bfd
))
4928 /* If the input bfd has no contents, it shouldn't set the
4929 private data of the output bfd. */
4931 bfd_error_handler_type pfn
= NULL
;
4933 /* If we aren't supposed to warn about mismatched input
4934 files, temporarily set the BFD error handler to a
4935 function which will do nothing. We still want to call
4936 bfd_merge_private_bfd_data, since it may set up
4937 information which is needed in the output file. */
4938 if (! command_line
.warn_mismatch
)
4939 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
4940 if (! bfd_merge_private_bfd_data (input_bfd
, output_bfd
))
4942 if (command_line
.warn_mismatch
)
4943 einfo (_("%P%X: failed to merge target specific data"
4944 " of file %B\n"), input_bfd
);
4946 if (! command_line
.warn_mismatch
)
4947 bfd_set_error_handler (pfn
);
4952 /* Look through all the global common symbols and attach them to the
4953 correct section. The -sort-common command line switch may be used
4954 to roughly sort the entries by size. */
4959 if (command_line
.inhibit_common_definition
)
4961 if (link_info
.relocatable
4962 && ! command_line
.force_common_definition
)
4965 if (! config
.sort_common
)
4966 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
4971 for (power
= 4; power
>= 0; power
--)
4972 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
4976 /* Place one common symbol in the correct section. */
4979 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
4981 unsigned int power_of_two
;
4985 if (h
->type
!= bfd_link_hash_common
)
4989 power_of_two
= h
->u
.c
.p
->alignment_power
;
4991 if (config
.sort_common
4992 && power_of_two
< (unsigned int) *(int *) info
)
4995 section
= h
->u
.c
.p
->section
;
4997 /* Increase the size of the section to align the common sym. */
4998 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
4999 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
5001 /* Adjust the alignment if necessary. */
5002 if (power_of_two
> section
->alignment_power
)
5003 section
->alignment_power
= power_of_two
;
5005 /* Change the symbol from common to defined. */
5006 h
->type
= bfd_link_hash_defined
;
5007 h
->u
.def
.section
= section
;
5008 h
->u
.def
.value
= section
->size
;
5010 /* Increase the size of the section. */
5011 section
->size
+= size
;
5013 /* Make sure the section is allocated in memory, and make sure that
5014 it is no longer a common section. */
5015 section
->flags
|= SEC_ALLOC
;
5016 section
->flags
&= ~SEC_IS_COMMON
;
5018 if (config
.map_file
!= NULL
)
5020 static bfd_boolean header_printed
;
5025 if (! header_printed
)
5027 minfo (_("\nAllocating common symbols\n"));
5028 minfo (_("Common symbol size file\n\n"));
5029 header_printed
= TRUE
;
5032 name
= demangle (h
->root
.string
);
5034 len
= strlen (name
);
5049 if (size
<= 0xffffffff)
5050 sprintf (buf
, "%lx", (unsigned long) size
);
5052 sprintf_vma (buf
, size
);
5062 minfo ("%B\n", section
->owner
);
5068 /* Run through the input files and ensure that every input section has
5069 somewhere to go. If one is found without a destination then create
5070 an input request and place it into the statement tree. */
5073 lang_place_orphans (void)
5075 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5079 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5081 if (s
->output_section
== NULL
)
5083 /* This section of the file is not attached, root
5084 around for a sensible place for it to go. */
5086 if (file
->just_syms_flag
)
5087 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5088 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5089 s
->output_section
= bfd_abs_section_ptr
;
5090 else if (strcmp (s
->name
, "COMMON") == 0)
5092 /* This is a lonely common section which must have
5093 come from an archive. We attach to the section
5094 with the wildcard. */
5095 if (! link_info
.relocatable
5096 || command_line
.force_common_definition
)
5098 if (default_common_section
== NULL
)
5100 default_common_section
=
5101 lang_output_section_statement_lookup (".bss");
5104 lang_add_section (&default_common_section
->children
, s
,
5105 default_common_section
);
5108 else if (ldemul_place_orphan (s
))
5112 lang_output_section_statement_type
*os
;
5114 os
= lang_output_section_statement_lookup (s
->name
);
5115 lang_add_section (&os
->children
, s
, os
);
5123 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5125 flagword
*ptr_flags
;
5127 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5133 *ptr_flags
|= SEC_ALLOC
;
5137 *ptr_flags
|= SEC_READONLY
;
5141 *ptr_flags
|= SEC_DATA
;
5145 *ptr_flags
|= SEC_CODE
;
5150 *ptr_flags
|= SEC_LOAD
;
5154 einfo (_("%P%F: invalid syntax in flags\n"));
5161 /* Call a function on each input file. This function will be called
5162 on an archive, but not on the elements. */
5165 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5167 lang_input_statement_type
*f
;
5169 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5171 f
= (lang_input_statement_type
*) f
->next_real_file
)
5175 /* Call a function on each file. The function will be called on all
5176 the elements of an archive which are included in the link, but will
5177 not be called on the archive file itself. */
5180 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5182 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5189 ldlang_add_file (lang_input_statement_type
*entry
)
5193 lang_statement_append (&file_chain
,
5194 (lang_statement_union_type
*) entry
,
5197 /* The BFD linker needs to have a list of all input BFDs involved in
5199 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5200 ASSERT (entry
->the_bfd
!= output_bfd
);
5201 for (pp
= &link_info
.input_bfds
; *pp
!= NULL
; pp
= &(*pp
)->link_next
)
5203 *pp
= entry
->the_bfd
;
5204 entry
->the_bfd
->usrdata
= entry
;
5205 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5207 /* Look through the sections and check for any which should not be
5208 included in the link. We need to do this now, so that we can
5209 notice when the backend linker tries to report multiple
5210 definition errors for symbols which are in sections we aren't
5211 going to link. FIXME: It might be better to entirely ignore
5212 symbols which are defined in sections which are going to be
5213 discarded. This would require modifying the backend linker for
5214 each backend which might set the SEC_LINK_ONCE flag. If we do
5215 this, we should probably handle SEC_EXCLUDE in the same way. */
5217 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5221 lang_add_output (const char *name
, int from_script
)
5223 /* Make -o on command line override OUTPUT in script. */
5224 if (!had_output_filename
|| !from_script
)
5226 output_filename
= name
;
5227 had_output_filename
= TRUE
;
5231 static lang_output_section_statement_type
*current_section
;
5242 for (l
= 0; l
< 32; l
++)
5244 if (i
>= (unsigned int) x
)
5252 lang_output_section_statement_type
*
5253 lang_enter_output_section_statement (const char *output_section_statement_name
,
5254 etree_type
*address_exp
,
5255 enum section_type sectype
,
5257 etree_type
*subalign
,
5261 lang_output_section_statement_type
*os
;
5263 os
= lang_output_section_statement_lookup_1 (output_section_statement_name
,
5265 current_section
= os
;
5267 /* Make next things chain into subchain of this. */
5269 if (os
->addr_tree
== NULL
)
5271 os
->addr_tree
= address_exp
;
5273 os
->sectype
= sectype
;
5274 if (sectype
!= noload_section
)
5275 os
->flags
= SEC_NO_FLAGS
;
5277 os
->flags
= SEC_NEVER_LOAD
;
5278 os
->block_value
= 1;
5279 stat_ptr
= &os
->children
;
5281 os
->subsection_alignment
=
5282 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5283 os
->section_alignment
=
5284 topower (exp_get_value_int (align
, -1, "section alignment"));
5286 os
->load_base
= ebase
;
5293 lang_output_statement_type
*new;
5295 new = new_stat (lang_output_statement
, stat_ptr
);
5296 new->name
= output_filename
;
5299 /* Reset the current counters in the regions. */
5302 lang_reset_memory_regions (void)
5304 lang_memory_region_type
*p
= lang_memory_region_list
;
5306 lang_output_section_statement_type
*os
;
5308 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5310 p
->old_length
= (bfd_size_type
) (p
->current
- p
->origin
);
5311 p
->current
= p
->origin
;
5314 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5317 os
->processed
= FALSE
;
5319 for (o
= output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5321 /* Save the last size for possible use by bfd_relax_section. */
5322 o
->rawsize
= o
->size
;
5327 /* Worker for lang_gc_sections_1. */
5330 gc_section_callback (lang_wild_statement_type
*ptr
,
5331 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5333 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5334 void *data ATTRIBUTE_UNUSED
)
5336 /* If the wild pattern was marked KEEP, the member sections
5337 should be as well. */
5338 if (ptr
->keep_sections
)
5339 section
->flags
|= SEC_KEEP
;
5342 /* Iterate over sections marking them against GC. */
5345 lang_gc_sections_1 (lang_statement_union_type
*s
)
5347 for (; s
!= NULL
; s
= s
->header
.next
)
5349 switch (s
->header
.type
)
5351 case lang_wild_statement_enum
:
5352 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5354 case lang_constructors_statement_enum
:
5355 lang_gc_sections_1 (constructor_list
.head
);
5357 case lang_output_section_statement_enum
:
5358 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5360 case lang_group_statement_enum
:
5361 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5370 lang_gc_sections (void)
5372 struct bfd_link_hash_entry
*h
;
5373 ldlang_undef_chain_list_type
*ulist
;
5375 /* Keep all sections so marked in the link script. */
5377 lang_gc_sections_1 (statement_list
.head
);
5379 /* Keep all sections containing symbols undefined on the command-line,
5380 and the section containing the entry symbol. */
5382 for (ulist
= link_info
.gc_sym_list
; ulist
; ulist
= ulist
->next
)
5384 h
= bfd_link_hash_lookup (link_info
.hash
, ulist
->name
,
5385 FALSE
, FALSE
, FALSE
);
5388 && (h
->type
== bfd_link_hash_defined
5389 || h
->type
== bfd_link_hash_defweak
)
5390 && ! bfd_is_abs_section (h
->u
.def
.section
))
5392 h
->u
.def
.section
->flags
|= SEC_KEEP
;
5396 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5397 the special case of debug info. (See bfd/stabs.c)
5398 Twiddle the flag here, to simplify later linker code. */
5399 if (link_info
.relocatable
)
5401 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5404 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5405 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5406 sec
->flags
&= ~SEC_EXCLUDE
;
5410 if (link_info
.gc_sections
)
5411 bfd_gc_sections (output_bfd
, &link_info
);
5414 /* Relax all sections until bfd_relax_section gives up. */
5417 relax_sections (void)
5419 /* Keep relaxing until bfd_relax_section gives up. */
5420 bfd_boolean relax_again
;
5424 relax_again
= FALSE
;
5426 /* Note: pe-dll.c does something like this also. If you find
5427 you need to change this code, you probably need to change
5428 pe-dll.c also. DJ */
5430 /* Do all the assignments with our current guesses as to
5432 lang_do_assignments ();
5434 /* We must do this after lang_do_assignments, because it uses
5436 lang_reset_memory_regions ();
5438 /* Perform another relax pass - this time we know where the
5439 globals are, so can make a better guess. */
5440 lang_size_sections (&relax_again
, FALSE
);
5442 while (relax_again
);
5448 current_target
= default_target
;
5450 /* Open the output file. */
5451 lang_for_each_statement (ldlang_open_output
);
5454 ldemul_create_output_section_statements ();
5456 /* Add to the hash table all undefineds on the command line. */
5457 lang_place_undefineds ();
5459 if (!bfd_section_already_linked_table_init ())
5460 einfo (_("%P%F: Failed to create hash table\n"));
5462 /* Create a bfd for each input file. */
5463 current_target
= default_target
;
5464 open_input_bfds (statement_list
.head
, FALSE
);
5466 link_info
.gc_sym_list
= &entry_symbol
;
5467 if (entry_symbol
.name
== NULL
)
5468 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
5470 ldemul_after_open ();
5472 bfd_section_already_linked_table_free ();
5474 /* Make sure that we're not mixing architectures. We call this
5475 after all the input files have been opened, but before we do any
5476 other processing, so that any operations merge_private_bfd_data
5477 does on the output file will be known during the rest of the
5481 /* Handle .exports instead of a version script if we're told to do so. */
5482 if (command_line
.version_exports_section
)
5483 lang_do_version_exports_section ();
5485 /* Build all sets based on the information gathered from the input
5487 ldctor_build_sets ();
5489 /* Remove unreferenced sections if asked to. */
5490 lang_gc_sections ();
5492 /* Size up the common data. */
5495 /* Update wild statements. */
5496 update_wild_statements (statement_list
.head
);
5498 /* Run through the contours of the script and attach input sections
5499 to the correct output sections. */
5500 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
5502 /* Find any sections not attached explicitly and handle them. */
5503 lang_place_orphans ();
5505 if (! link_info
.relocatable
)
5509 /* Merge SEC_MERGE sections. This has to be done after GC of
5510 sections, so that GCed sections are not merged, but before
5511 assigning dynamic symbols, since removing whole input sections
5513 bfd_merge_sections (output_bfd
, &link_info
);
5515 /* Look for a text section and set the readonly attribute in it. */
5516 found
= bfd_get_section_by_name (output_bfd
, ".text");
5520 if (config
.text_read_only
)
5521 found
->flags
|= SEC_READONLY
;
5523 found
->flags
&= ~SEC_READONLY
;
5527 /* Do anything special before sizing sections. This is where ELF
5528 and other back-ends size dynamic sections. */
5529 ldemul_before_allocation ();
5531 /* We must record the program headers before we try to fix the
5532 section positions, since they will affect SIZEOF_HEADERS. */
5533 lang_record_phdrs ();
5535 /* Size up the sections. */
5536 lang_size_sections (NULL
, !command_line
.relax
);
5538 /* Now run around and relax if we can. */
5539 if (command_line
.relax
)
5541 /* We may need more than one relaxation pass. */
5542 int i
= link_info
.relax_pass
;
5544 /* The backend can use it to determine the current pass. */
5545 link_info
.relax_pass
= 0;
5550 link_info
.relax_pass
++;
5553 /* Final extra sizing to report errors. */
5554 lang_do_assignments ();
5555 lang_reset_memory_regions ();
5556 lang_size_sections (NULL
, TRUE
);
5559 /* See if anything special should be done now we know how big
5561 ldemul_after_allocation ();
5563 /* Fix any .startof. or .sizeof. symbols. */
5564 lang_set_startof ();
5566 /* Do all the assignments, now that we know the final resting places
5567 of all the symbols. */
5569 lang_do_assignments ();
5571 /* Make sure that the section addresses make sense. */
5572 if (! link_info
.relocatable
5573 && command_line
.check_section_addresses
)
5574 lang_check_section_addresses ();
5581 /* EXPORTED TO YACC */
5584 lang_add_wild (struct wildcard_spec
*filespec
,
5585 struct wildcard_list
*section_list
,
5586 bfd_boolean keep_sections
)
5588 struct wildcard_list
*curr
, *next
;
5589 lang_wild_statement_type
*new;
5591 /* Reverse the list as the parser puts it back to front. */
5592 for (curr
= section_list
, section_list
= NULL
;
5594 section_list
= curr
, curr
= next
)
5596 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
5597 placed_commons
= TRUE
;
5600 curr
->next
= section_list
;
5603 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
5605 if (strcmp (filespec
->name
, "*") == 0)
5606 filespec
->name
= NULL
;
5607 else if (! wildcardp (filespec
->name
))
5608 lang_has_input_file
= TRUE
;
5611 new = new_stat (lang_wild_statement
, stat_ptr
);
5612 new->filename
= NULL
;
5613 new->filenames_sorted
= FALSE
;
5614 if (filespec
!= NULL
)
5616 new->filename
= filespec
->name
;
5617 new->filenames_sorted
= filespec
->sorted
== by_name
;
5619 new->section_list
= section_list
;
5620 new->keep_sections
= keep_sections
;
5621 lang_list_init (&new->children
);
5622 analyze_walk_wild_section_handler (new);
5626 lang_section_start (const char *name
, etree_type
*address
,
5627 const segment_type
*segment
)
5629 lang_address_statement_type
*ad
;
5631 ad
= new_stat (lang_address_statement
, stat_ptr
);
5632 ad
->section_name
= name
;
5633 ad
->address
= address
;
5634 ad
->segment
= segment
;
5637 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5638 because of a -e argument on the command line, or zero if this is
5639 called by ENTRY in a linker script. Command line arguments take
5643 lang_add_entry (const char *name
, bfd_boolean cmdline
)
5645 if (entry_symbol
.name
== NULL
5647 || ! entry_from_cmdline
)
5649 entry_symbol
.name
= name
;
5650 entry_from_cmdline
= cmdline
;
5654 /* Set the default start symbol to NAME. .em files should use this,
5655 not lang_add_entry, to override the use of "start" if neither the
5656 linker script nor the command line specifies an entry point. NAME
5657 must be permanently allocated. */
5659 lang_default_entry (const char *name
)
5661 entry_symbol_default
= name
;
5665 lang_add_target (const char *name
)
5667 lang_target_statement_type
*new;
5669 new = new_stat (lang_target_statement
, stat_ptr
);
5674 lang_add_map (const char *name
)
5681 map_option_f
= TRUE
;
5689 lang_add_fill (fill_type
*fill
)
5691 lang_fill_statement_type
*new;
5693 new = new_stat (lang_fill_statement
, stat_ptr
);
5698 lang_add_data (int type
, union etree_union
*exp
)
5700 lang_data_statement_type
*new;
5702 new = new_stat (lang_data_statement
, stat_ptr
);
5707 /* Create a new reloc statement. RELOC is the BFD relocation type to
5708 generate. HOWTO is the corresponding howto structure (we could
5709 look this up, but the caller has already done so). SECTION is the
5710 section to generate a reloc against, or NAME is the name of the
5711 symbol to generate a reloc against. Exactly one of SECTION and
5712 NAME must be NULL. ADDEND is an expression for the addend. */
5715 lang_add_reloc (bfd_reloc_code_real_type reloc
,
5716 reloc_howto_type
*howto
,
5719 union etree_union
*addend
)
5721 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
5725 p
->section
= section
;
5727 p
->addend_exp
= addend
;
5729 p
->addend_value
= 0;
5730 p
->output_section
= NULL
;
5731 p
->output_offset
= 0;
5734 lang_assignment_statement_type
*
5735 lang_add_assignment (etree_type
*exp
)
5737 lang_assignment_statement_type
*new;
5739 new = new_stat (lang_assignment_statement
, stat_ptr
);
5745 lang_add_attribute (enum statement_enum attribute
)
5747 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
5751 lang_startup (const char *name
)
5753 if (startup_file
!= NULL
)
5755 einfo (_("%P%F: multiple STARTUP files\n"));
5757 first_file
->filename
= name
;
5758 first_file
->local_sym_name
= name
;
5759 first_file
->real
= TRUE
;
5761 startup_file
= name
;
5765 lang_float (bfd_boolean maybe
)
5767 lang_float_flag
= maybe
;
5771 /* Work out the load- and run-time regions from a script statement, and
5772 store them in *LMA_REGION and *REGION respectively.
5774 MEMSPEC is the name of the run-time region, or the value of
5775 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5776 LMA_MEMSPEC is the name of the load-time region, or null if the
5777 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5778 had an explicit load address.
5780 It is an error to specify both a load region and a load address. */
5783 lang_get_regions (lang_memory_region_type
**region
,
5784 lang_memory_region_type
**lma_region
,
5785 const char *memspec
,
5786 const char *lma_memspec
,
5787 bfd_boolean have_lma
,
5788 bfd_boolean have_vma
)
5790 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
5792 /* If no runtime region or VMA has been specified, but the load region
5793 has been specified, then use the load region for the runtime region
5795 if (lma_memspec
!= NULL
5797 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
5798 *region
= *lma_region
;
5800 *region
= lang_memory_region_lookup (memspec
, FALSE
);
5802 if (have_lma
&& lma_memspec
!= 0)
5803 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5807 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
5808 lang_output_section_phdr_list
*phdrs
,
5809 const char *lma_memspec
)
5811 lang_get_regions (¤t_section
->region
,
5812 ¤t_section
->lma_region
,
5813 memspec
, lma_memspec
,
5814 current_section
->load_base
!= NULL
,
5815 current_section
->addr_tree
!= NULL
);
5816 current_section
->fill
= fill
;
5817 current_section
->phdrs
= phdrs
;
5818 stat_ptr
= &statement_list
;
5821 /* Create an absolute symbol with the given name with the value of the
5822 address of first byte of the section named.
5824 If the symbol already exists, then do nothing. */
5827 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
5829 struct bfd_link_hash_entry
*h
;
5831 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5833 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5835 if (h
->type
== bfd_link_hash_new
5836 || h
->type
== bfd_link_hash_undefined
)
5840 h
->type
= bfd_link_hash_defined
;
5842 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5846 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, sec
);
5848 h
->u
.def
.section
= bfd_abs_section_ptr
;
5852 /* Create an absolute symbol with the given name with the value of the
5853 address of the first byte after the end of the section named.
5855 If the symbol already exists, then do nothing. */
5858 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
5860 struct bfd_link_hash_entry
*h
;
5862 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5864 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5866 if (h
->type
== bfd_link_hash_new
5867 || h
->type
== bfd_link_hash_undefined
)
5871 h
->type
= bfd_link_hash_defined
;
5873 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5877 h
->u
.def
.value
= (bfd_get_section_vma (output_bfd
, sec
)
5878 + TO_ADDR (sec
->size
));
5880 h
->u
.def
.section
= bfd_abs_section_ptr
;
5885 lang_statement_append (lang_statement_list_type
*list
,
5886 lang_statement_union_type
*element
,
5887 lang_statement_union_type
**field
)
5889 *(list
->tail
) = element
;
5893 /* Set the output format type. -oformat overrides scripts. */
5896 lang_add_output_format (const char *format
,
5901 if (output_target
== NULL
|| !from_script
)
5903 if (command_line
.endian
== ENDIAN_BIG
5906 else if (command_line
.endian
== ENDIAN_LITTLE
5910 output_target
= format
;
5914 /* Enter a group. This creates a new lang_group_statement, and sets
5915 stat_ptr to build new statements within the group. */
5918 lang_enter_group (void)
5920 lang_group_statement_type
*g
;
5922 g
= new_stat (lang_group_statement
, stat_ptr
);
5923 lang_list_init (&g
->children
);
5924 stat_ptr
= &g
->children
;
5927 /* Leave a group. This just resets stat_ptr to start writing to the
5928 regular list of statements again. Note that this will not work if
5929 groups can occur inside anything else which can adjust stat_ptr,
5930 but currently they can't. */
5933 lang_leave_group (void)
5935 stat_ptr
= &statement_list
;
5938 /* Add a new program header. This is called for each entry in a PHDRS
5939 command in a linker script. */
5942 lang_new_phdr (const char *name
,
5944 bfd_boolean filehdr
,
5949 struct lang_phdr
*n
, **pp
;
5951 n
= stat_alloc (sizeof (struct lang_phdr
));
5954 n
->type
= exp_get_value_int (type
, 0, "program header type");
5955 n
->filehdr
= filehdr
;
5960 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
5965 /* Record the program header information in the output BFD. FIXME: We
5966 should not be calling an ELF specific function here. */
5969 lang_record_phdrs (void)
5973 lang_output_section_phdr_list
*last
;
5974 struct lang_phdr
*l
;
5975 lang_output_section_statement_type
*os
;
5978 secs
= xmalloc (alc
* sizeof (asection
*));
5980 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
5987 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5991 lang_output_section_phdr_list
*pl
;
5993 if (os
->constraint
== -1)
6001 if (os
->sectype
== noload_section
6002 || os
->bfd_section
== NULL
6003 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6008 if (os
->bfd_section
== NULL
)
6011 for (; pl
!= NULL
; pl
= pl
->next
)
6013 if (strcmp (pl
->name
, l
->name
) == 0)
6018 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
6020 secs
[c
] = os
->bfd_section
;
6027 if (l
->flags
== NULL
)
6030 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6035 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6037 if (! bfd_record_phdr (output_bfd
, l
->type
,
6038 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6039 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6040 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6045 /* Make sure all the phdr assignments succeeded. */
6046 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6050 lang_output_section_phdr_list
*pl
;
6052 if (os
->constraint
== -1
6053 || os
->bfd_section
== NULL
)
6056 for (pl
= os
->phdrs
;
6059 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6060 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6061 os
->name
, pl
->name
);
6065 /* Record a list of sections which may not be cross referenced. */
6068 lang_add_nocrossref (lang_nocrossref_type
*l
)
6070 struct lang_nocrossrefs
*n
;
6072 n
= xmalloc (sizeof *n
);
6073 n
->next
= nocrossref_list
;
6075 nocrossref_list
= n
;
6077 /* Set notice_all so that we get informed about all symbols. */
6078 link_info
.notice_all
= TRUE
;
6081 /* Overlay handling. We handle overlays with some static variables. */
6083 /* The overlay virtual address. */
6084 static etree_type
*overlay_vma
;
6085 /* And subsection alignment. */
6086 static etree_type
*overlay_subalign
;
6088 /* An expression for the maximum section size seen so far. */
6089 static etree_type
*overlay_max
;
6091 /* A list of all the sections in this overlay. */
6093 struct overlay_list
{
6094 struct overlay_list
*next
;
6095 lang_output_section_statement_type
*os
;
6098 static struct overlay_list
*overlay_list
;
6100 /* Start handling an overlay. */
6103 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6105 /* The grammar should prevent nested overlays from occurring. */
6106 ASSERT (overlay_vma
== NULL
6107 && overlay_subalign
== NULL
6108 && overlay_max
== NULL
);
6110 overlay_vma
= vma_expr
;
6111 overlay_subalign
= subalign
;
6114 /* Start a section in an overlay. We handle this by calling
6115 lang_enter_output_section_statement with the correct VMA.
6116 lang_leave_overlay sets up the LMA and memory regions. */
6119 lang_enter_overlay_section (const char *name
)
6121 struct overlay_list
*n
;
6124 lang_enter_output_section_statement (name
, overlay_vma
, normal_section
,
6125 0, overlay_subalign
, 0, 0);
6127 /* If this is the first section, then base the VMA of future
6128 sections on this one. This will work correctly even if `.' is
6129 used in the addresses. */
6130 if (overlay_list
== NULL
)
6131 overlay_vma
= exp_nameop (ADDR
, name
);
6133 /* Remember the section. */
6134 n
= xmalloc (sizeof *n
);
6135 n
->os
= current_section
;
6136 n
->next
= overlay_list
;
6139 size
= exp_nameop (SIZEOF
, name
);
6141 /* Arrange to work out the maximum section end address. */
6142 if (overlay_max
== NULL
)
6145 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6148 /* Finish a section in an overlay. There isn't any special to do
6152 lang_leave_overlay_section (fill_type
*fill
,
6153 lang_output_section_phdr_list
*phdrs
)
6160 name
= current_section
->name
;
6162 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6163 region and that no load-time region has been specified. It doesn't
6164 really matter what we say here, since lang_leave_overlay will
6166 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6168 /* Define the magic symbols. */
6170 clean
= xmalloc (strlen (name
) + 1);
6172 for (s1
= name
; *s1
!= '\0'; s1
++)
6173 if (ISALNUM (*s1
) || *s1
== '_')
6177 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6178 sprintf (buf
, "__load_start_%s", clean
);
6179 lang_add_assignment (exp_assop ('=', buf
,
6180 exp_nameop (LOADADDR
, name
)));
6182 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6183 sprintf (buf
, "__load_stop_%s", clean
);
6184 lang_add_assignment (exp_assop ('=', buf
,
6186 exp_nameop (LOADADDR
, name
),
6187 exp_nameop (SIZEOF
, name
))));
6192 /* Finish an overlay. If there are any overlay wide settings, this
6193 looks through all the sections in the overlay and sets them. */
6196 lang_leave_overlay (etree_type
*lma_expr
,
6199 const char *memspec
,
6200 lang_output_section_phdr_list
*phdrs
,
6201 const char *lma_memspec
)
6203 lang_memory_region_type
*region
;
6204 lang_memory_region_type
*lma_region
;
6205 struct overlay_list
*l
;
6206 lang_nocrossref_type
*nocrossref
;
6208 lang_get_regions (®ion
, &lma_region
,
6209 memspec
, lma_memspec
,
6210 lma_expr
!= NULL
, FALSE
);
6214 /* After setting the size of the last section, set '.' to end of the
6216 if (overlay_list
!= NULL
)
6217 overlay_list
->os
->update_dot_tree
6218 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6223 struct overlay_list
*next
;
6225 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6228 l
->os
->region
= region
;
6229 l
->os
->lma_region
= lma_region
;
6231 /* The first section has the load address specified in the
6232 OVERLAY statement. The rest are worked out from that.
6233 The base address is not needed (and should be null) if
6234 an LMA region was specified. */
6236 l
->os
->load_base
= lma_expr
;
6237 else if (lma_region
== 0)
6238 l
->os
->load_base
= exp_binop ('+',
6239 exp_nameop (LOADADDR
, l
->next
->os
->name
),
6240 exp_nameop (SIZEOF
, l
->next
->os
->name
));
6242 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6243 l
->os
->phdrs
= phdrs
;
6247 lang_nocrossref_type
*nc
;
6249 nc
= xmalloc (sizeof *nc
);
6250 nc
->name
= l
->os
->name
;
6251 nc
->next
= nocrossref
;
6260 if (nocrossref
!= NULL
)
6261 lang_add_nocrossref (nocrossref
);
6264 overlay_list
= NULL
;
6268 /* Version handling. This is only useful for ELF. */
6270 /* This global variable holds the version tree that we build. */
6272 struct bfd_elf_version_tree
*lang_elf_version_info
;
6274 /* If PREV is NULL, return first version pattern matching particular symbol.
6275 If PREV is non-NULL, return first version pattern matching particular
6276 symbol after PREV (previously returned by lang_vers_match). */
6278 static struct bfd_elf_version_expr
*
6279 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6280 struct bfd_elf_version_expr
*prev
,
6283 const char *cxx_sym
= sym
;
6284 const char *java_sym
= sym
;
6285 struct bfd_elf_version_expr
*expr
= NULL
;
6287 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6289 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6293 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6295 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6300 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6302 struct bfd_elf_version_expr e
;
6304 switch (prev
? prev
->mask
: 0)
6307 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6310 expr
= htab_find (head
->htab
, &e
);
6311 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6312 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6318 case BFD_ELF_VERSION_C_TYPE
:
6319 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6322 expr
= htab_find (head
->htab
, &e
);
6323 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6324 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6330 case BFD_ELF_VERSION_CXX_TYPE
:
6331 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6333 e
.symbol
= java_sym
;
6334 expr
= htab_find (head
->htab
, &e
);
6335 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6336 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6347 /* Finally, try the wildcards. */
6348 if (prev
== NULL
|| prev
->symbol
)
6349 expr
= head
->remaining
;
6352 for (; expr
; expr
= expr
->next
)
6359 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6362 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6364 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6368 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6374 free ((char *) cxx_sym
);
6375 if (java_sym
!= sym
)
6376 free ((char *) java_sym
);
6380 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6381 return a string pointing to the symbol name. */
6384 realsymbol (const char *pattern
)
6387 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6388 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6390 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6392 /* It is a glob pattern only if there is no preceding
6394 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6402 /* Remove the preceding backslash. */
6409 backslash
= *p
== '\\';
6424 /* This is called for each variable name or match expression. NEW is
6425 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
6426 pattern to be matched against symbol names. */
6428 struct bfd_elf_version_expr
*
6429 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
6432 bfd_boolean literal_p
)
6434 struct bfd_elf_version_expr
*ret
;
6436 ret
= xmalloc (sizeof *ret
);
6438 ret
->pattern
= literal_p
? NULL
: new;
6441 ret
->symbol
= literal_p
? new : realsymbol (new);
6443 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
6444 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6445 else if (strcasecmp (lang
, "C++") == 0)
6446 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
6447 else if (strcasecmp (lang
, "Java") == 0)
6448 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
6451 einfo (_("%X%P: unknown language `%s' in version information\n"),
6453 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6456 return ldemul_new_vers_pattern (ret
);
6459 /* This is called for each set of variable names and match
6462 struct bfd_elf_version_tree
*
6463 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
6464 struct bfd_elf_version_expr
*locals
)
6466 struct bfd_elf_version_tree
*ret
;
6468 ret
= xcalloc (1, sizeof *ret
);
6469 ret
->globals
.list
= globals
;
6470 ret
->locals
.list
= locals
;
6471 ret
->match
= lang_vers_match
;
6472 ret
->name_indx
= (unsigned int) -1;
6476 /* This static variable keeps track of version indices. */
6478 static int version_index
;
6481 version_expr_head_hash (const void *p
)
6483 const struct bfd_elf_version_expr
*e
= p
;
6485 return htab_hash_string (e
->symbol
);
6489 version_expr_head_eq (const void *p1
, const void *p2
)
6491 const struct bfd_elf_version_expr
*e1
= p1
;
6492 const struct bfd_elf_version_expr
*e2
= p2
;
6494 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
6498 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
6501 struct bfd_elf_version_expr
*e
, *next
;
6502 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
6504 for (e
= head
->list
; e
; e
= e
->next
)
6508 head
->mask
|= e
->mask
;
6513 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
6514 version_expr_head_eq
, NULL
);
6515 list_loc
= &head
->list
;
6516 remaining_loc
= &head
->remaining
;
6517 for (e
= head
->list
; e
; e
= next
)
6523 remaining_loc
= &e
->next
;
6527 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
6531 struct bfd_elf_version_expr
*e1
, *last
;
6537 if (e1
->mask
== e
->mask
)
6545 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
6549 /* This is a duplicate. */
6550 /* FIXME: Memory leak. Sometimes pattern is not
6551 xmalloced alone, but in larger chunk of memory. */
6552 /* free (e->symbol); */
6557 e
->next
= last
->next
;
6565 list_loc
= &e
->next
;
6569 *remaining_loc
= NULL
;
6570 *list_loc
= head
->remaining
;
6573 head
->remaining
= head
->list
;
6576 /* This is called when we know the name and dependencies of the
6580 lang_register_vers_node (const char *name
,
6581 struct bfd_elf_version_tree
*version
,
6582 struct bfd_elf_version_deps
*deps
)
6584 struct bfd_elf_version_tree
*t
, **pp
;
6585 struct bfd_elf_version_expr
*e1
;
6590 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
6591 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
6593 einfo (_("%X%P: anonymous version tag cannot be combined"
6594 " with other version tags\n"));
6599 /* Make sure this node has a unique name. */
6600 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6601 if (strcmp (t
->name
, name
) == 0)
6602 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
6604 lang_finalize_version_expr_head (&version
->globals
);
6605 lang_finalize_version_expr_head (&version
->locals
);
6607 /* Check the global and local match names, and make sure there
6608 aren't any duplicates. */
6610 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
6612 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6614 struct bfd_elf_version_expr
*e2
;
6616 if (t
->locals
.htab
&& e1
->symbol
)
6618 e2
= htab_find (t
->locals
.htab
, e1
);
6619 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6621 if (e1
->mask
== e2
->mask
)
6622 einfo (_("%X%P: duplicate expression `%s'"
6623 " in version information\n"), e1
->symbol
);
6627 else if (!e1
->symbol
)
6628 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6629 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6630 && e1
->mask
== e2
->mask
)
6631 einfo (_("%X%P: duplicate expression `%s'"
6632 " in version information\n"), e1
->pattern
);
6636 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
6638 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6640 struct bfd_elf_version_expr
*e2
;
6642 if (t
->globals
.htab
&& e1
->symbol
)
6644 e2
= htab_find (t
->globals
.htab
, e1
);
6645 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6647 if (e1
->mask
== e2
->mask
)
6648 einfo (_("%X%P: duplicate expression `%s'"
6649 " in version information\n"),
6654 else if (!e1
->symbol
)
6655 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6656 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6657 && e1
->mask
== e2
->mask
)
6658 einfo (_("%X%P: duplicate expression `%s'"
6659 " in version information\n"), e1
->pattern
);
6663 version
->deps
= deps
;
6664 version
->name
= name
;
6665 if (name
[0] != '\0')
6668 version
->vernum
= version_index
;
6671 version
->vernum
= 0;
6673 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6678 /* This is called when we see a version dependency. */
6680 struct bfd_elf_version_deps
*
6681 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
6683 struct bfd_elf_version_deps
*ret
;
6684 struct bfd_elf_version_tree
*t
;
6686 ret
= xmalloc (sizeof *ret
);
6689 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6691 if (strcmp (t
->name
, name
) == 0)
6693 ret
->version_needed
= t
;
6698 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
6704 lang_do_version_exports_section (void)
6706 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
6708 LANG_FOR_EACH_INPUT_STATEMENT (is
)
6710 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
6718 contents
= xmalloc (len
);
6719 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
6720 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
6723 while (p
< contents
+ len
)
6725 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
6726 p
= strchr (p
, '\0') + 1;
6729 /* Do not free the contents, as we used them creating the regex. */
6731 /* Do not include this section in the link. */
6732 sec
->flags
|= SEC_EXCLUDE
;
6735 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
6736 lang_register_vers_node (command_line
.version_exports_section
,
6737 lang_new_vers_node (greg
, lreg
), NULL
);
6741 lang_add_unique (const char *name
)
6743 struct unique_sections
*ent
;
6745 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
6746 if (strcmp (ent
->name
, name
) == 0)
6749 ent
= xmalloc (sizeof *ent
);
6750 ent
->name
= xstrdup (name
);
6751 ent
->next
= unique_section_list
;
6752 unique_section_list
= ent
;