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
;
2326 bfd_boolean save_as_needed
, save_add_needed
;
2328 err
= bfd_get_error ();
2330 /* See if the emulation has some special knowledge. */
2331 if (ldemul_unrecognized_file (entry
))
2334 if (err
== bfd_error_file_ambiguously_recognized
)
2338 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2339 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2340 for (p
= matching
; *p
!= NULL
; p
++)
2344 else if (err
!= bfd_error_file_not_recognized
2346 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2350 bfd_close (entry
->the_bfd
);
2351 entry
->the_bfd
= NULL
;
2353 /* Try to interpret the file as a linker script. */
2354 ldfile_open_command_file (entry
->filename
);
2358 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2359 ldlang_sysrooted_script
= entry
->sysrooted
;
2360 save_as_needed
= as_needed
;
2361 as_needed
= entry
->as_needed
;
2362 save_add_needed
= add_needed
;
2363 add_needed
= entry
->add_needed
;
2365 ldfile_assumed_script
= TRUE
;
2366 parser_input
= input_script
;
2367 /* We want to use the same -Bdynamic/-Bstatic as the one for
2369 config
.dynamic_link
= entry
->dynamic
;
2371 ldfile_assumed_script
= FALSE
;
2373 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2374 as_needed
= save_as_needed
;
2375 add_needed
= save_add_needed
;
2381 if (ldemul_recognized_file (entry
))
2384 /* We don't call ldlang_add_file for an archive. Instead, the
2385 add_symbols entry point will call ldlang_add_file, via the
2386 add_archive_element callback, for each element of the archive
2388 switch (bfd_get_format (entry
->the_bfd
))
2394 ldlang_add_file (entry
);
2395 if (trace_files
|| trace_file_tries
)
2396 info_msg ("%I\n", entry
);
2400 check_excluded_libs (entry
->the_bfd
);
2402 if (entry
->whole_archive
)
2405 bfd_boolean loaded
= TRUE
;
2409 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2414 if (! bfd_check_format (member
, bfd_object
))
2416 einfo (_("%F%B: member %B in archive is not an object\n"),
2417 entry
->the_bfd
, member
);
2421 if (! ((*link_info
.callbacks
->add_archive_element
)
2422 (&link_info
, member
, "--whole-archive")))
2425 if (! bfd_link_add_symbols (member
, &link_info
))
2427 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2432 entry
->loaded
= loaded
;
2438 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2439 entry
->loaded
= TRUE
;
2441 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2443 return entry
->loaded
;
2446 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2447 may be NULL, indicating that it is a wildcard. Separate
2448 lang_input_section statements are created for each part of the
2449 expansion; they are added after the wild statement S. OUTPUT is
2450 the output section. */
2453 wild (lang_wild_statement_type
*s
,
2454 const char *target ATTRIBUTE_UNUSED
,
2455 lang_output_section_statement_type
*output
)
2457 struct wildcard_list
*sec
;
2459 walk_wild (s
, output_section_callback
, output
);
2461 if (default_common_section
== NULL
)
2462 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2463 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2465 /* Remember the section that common is going to in case we
2466 later get something which doesn't know where to put it. */
2467 default_common_section
= output
;
2472 /* Return TRUE iff target is the sought target. */
2475 get_target (const bfd_target
*target
, void *data
)
2477 const char *sought
= data
;
2479 return strcmp (target
->name
, sought
) == 0;
2482 /* Like strcpy() but convert to lower case as well. */
2485 stricpy (char *dest
, char *src
)
2489 while ((c
= *src
++) != 0)
2490 *dest
++ = TOLOWER (c
);
2495 /* Remove the first occurrence of needle (if any) in haystack
2499 strcut (char *haystack
, char *needle
)
2501 haystack
= strstr (haystack
, needle
);
2507 for (src
= haystack
+ strlen (needle
); *src
;)
2508 *haystack
++ = *src
++;
2514 /* Compare two target format name strings.
2515 Return a value indicating how "similar" they are. */
2518 name_compare (char *first
, char *second
)
2524 copy1
= xmalloc (strlen (first
) + 1);
2525 copy2
= xmalloc (strlen (second
) + 1);
2527 /* Convert the names to lower case. */
2528 stricpy (copy1
, first
);
2529 stricpy (copy2
, second
);
2531 /* Remove size and endian strings from the name. */
2532 strcut (copy1
, "big");
2533 strcut (copy1
, "little");
2534 strcut (copy2
, "big");
2535 strcut (copy2
, "little");
2537 /* Return a value based on how many characters match,
2538 starting from the beginning. If both strings are
2539 the same then return 10 * their length. */
2540 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2541 if (copy1
[result
] == 0)
2553 /* Set by closest_target_match() below. */
2554 static const bfd_target
*winner
;
2556 /* Scan all the valid bfd targets looking for one that has the endianness
2557 requirement that was specified on the command line, and is the nearest
2558 match to the original output target. */
2561 closest_target_match (const bfd_target
*target
, void *data
)
2563 const bfd_target
*original
= data
;
2565 if (command_line
.endian
== ENDIAN_BIG
2566 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2569 if (command_line
.endian
== ENDIAN_LITTLE
2570 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2573 /* Must be the same flavour. */
2574 if (target
->flavour
!= original
->flavour
)
2577 /* If we have not found a potential winner yet, then record this one. */
2584 /* Oh dear, we now have two potential candidates for a successful match.
2585 Compare their names and choose the better one. */
2586 if (name_compare (target
->name
, original
->name
)
2587 > name_compare (winner
->name
, original
->name
))
2590 /* Keep on searching until wqe have checked them all. */
2594 /* Return the BFD target format of the first input file. */
2597 get_first_input_target (void)
2599 char *target
= NULL
;
2601 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2603 if (s
->header
.type
== lang_input_statement_enum
2606 ldfile_open_file (s
);
2608 if (s
->the_bfd
!= NULL
2609 && bfd_check_format (s
->the_bfd
, bfd_object
))
2611 target
= bfd_get_target (s
->the_bfd
);
2623 lang_get_output_target (void)
2627 /* Has the user told us which output format to use? */
2628 if (output_target
!= NULL
)
2629 return output_target
;
2631 /* No - has the current target been set to something other than
2633 if (current_target
!= default_target
)
2634 return current_target
;
2636 /* No - can we determine the format of the first input file? */
2637 target
= get_first_input_target ();
2641 /* Failed - use the default output target. */
2642 return default_target
;
2645 /* Open the output file. */
2648 open_output (const char *name
)
2652 output_target
= lang_get_output_target ();
2654 /* Has the user requested a particular endianness on the command
2656 if (command_line
.endian
!= ENDIAN_UNSET
)
2658 const bfd_target
*target
;
2659 enum bfd_endian desired_endian
;
2661 /* Get the chosen target. */
2662 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2664 /* If the target is not supported, we cannot do anything. */
2667 if (command_line
.endian
== ENDIAN_BIG
)
2668 desired_endian
= BFD_ENDIAN_BIG
;
2670 desired_endian
= BFD_ENDIAN_LITTLE
;
2672 /* See if the target has the wrong endianness. This should
2673 not happen if the linker script has provided big and
2674 little endian alternatives, but some scrips don't do
2676 if (target
->byteorder
!= desired_endian
)
2678 /* If it does, then see if the target provides
2679 an alternative with the correct endianness. */
2680 if (target
->alternative_target
!= NULL
2681 && (target
->alternative_target
->byteorder
== desired_endian
))
2682 output_target
= target
->alternative_target
->name
;
2685 /* Try to find a target as similar as possible to
2686 the default target, but which has the desired
2687 endian characteristic. */
2688 bfd_search_for_target (closest_target_match
,
2691 /* Oh dear - we could not find any targets that
2692 satisfy our requirements. */
2694 einfo (_("%P: warning: could not find any targets"
2695 " that match endianness requirement\n"));
2697 output_target
= winner
->name
;
2703 output
= bfd_openw (name
, output_target
);
2707 if (bfd_get_error () == bfd_error_invalid_target
)
2708 einfo (_("%P%F: target %s not found\n"), output_target
);
2710 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2713 delete_output_file_on_failure
= TRUE
;
2715 if (! bfd_set_format (output
, bfd_object
))
2716 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2717 if (! bfd_set_arch_mach (output
,
2718 ldfile_output_architecture
,
2719 ldfile_output_machine
))
2720 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2722 link_info
.hash
= bfd_link_hash_table_create (output
);
2723 if (link_info
.hash
== NULL
)
2724 einfo (_("%P%F: can not create hash table: %E\n"));
2726 bfd_set_gp_size (output
, g_switch_value
);
2731 ldlang_open_output (lang_statement_union_type
*statement
)
2733 switch (statement
->header
.type
)
2735 case lang_output_statement_enum
:
2736 ASSERT (output_bfd
== NULL
);
2737 output_bfd
= open_output (statement
->output_statement
.name
);
2738 ldemul_set_output_arch ();
2739 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2740 output_bfd
->flags
|= D_PAGED
;
2742 output_bfd
->flags
&= ~D_PAGED
;
2743 if (config
.text_read_only
)
2744 output_bfd
->flags
|= WP_TEXT
;
2746 output_bfd
->flags
&= ~WP_TEXT
;
2747 if (link_info
.traditional_format
)
2748 output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2750 output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2753 case lang_target_statement_enum
:
2754 current_target
= statement
->target_statement
.target
;
2761 /* Convert between addresses in bytes and sizes in octets.
2762 For currently supported targets, octets_per_byte is always a power
2763 of two, so we can use shifts. */
2764 #define TO_ADDR(X) ((X) >> opb_shift)
2765 #define TO_SIZE(X) ((X) << opb_shift)
2767 /* Support the above. */
2768 static unsigned int opb_shift
= 0;
2773 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2774 ldfile_output_machine
);
2777 while ((x
& 1) == 0)
2785 /* Open all the input files. */
2788 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2790 for (; s
!= NULL
; s
= s
->header
.next
)
2792 switch (s
->header
.type
)
2794 case lang_constructors_statement_enum
:
2795 open_input_bfds (constructor_list
.head
, force
);
2797 case lang_output_section_statement_enum
:
2798 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2800 case lang_wild_statement_enum
:
2801 /* Maybe we should load the file's symbols. */
2802 if (s
->wild_statement
.filename
2803 && ! wildcardp (s
->wild_statement
.filename
))
2804 lookup_name (s
->wild_statement
.filename
);
2805 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2807 case lang_group_statement_enum
:
2809 struct bfd_link_hash_entry
*undefs
;
2811 /* We must continually search the entries in the group
2812 until no new symbols are added to the list of undefined
2817 undefs
= link_info
.hash
->undefs_tail
;
2818 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2820 while (undefs
!= link_info
.hash
->undefs_tail
);
2823 case lang_target_statement_enum
:
2824 current_target
= s
->target_statement
.target
;
2826 case lang_input_statement_enum
:
2827 if (s
->input_statement
.real
)
2829 lang_statement_list_type add
;
2831 s
->input_statement
.target
= current_target
;
2833 /* If we are being called from within a group, and this
2834 is an archive which has already been searched, then
2835 force it to be researched unless the whole archive
2836 has been loaded already. */
2838 && !s
->input_statement
.whole_archive
2839 && s
->input_statement
.loaded
2840 && bfd_check_format (s
->input_statement
.the_bfd
,
2842 s
->input_statement
.loaded
= FALSE
;
2844 lang_list_init (&add
);
2846 if (! load_symbols (&s
->input_statement
, &add
))
2847 config
.make_executable
= FALSE
;
2849 if (add
.head
!= NULL
)
2851 *add
.tail
= s
->header
.next
;
2852 s
->header
.next
= add
.head
;
2862 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2865 lang_track_definedness (const char *name
)
2867 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2868 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2871 /* New-function for the definedness hash table. */
2873 static struct bfd_hash_entry
*
2874 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2875 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2876 const char *name ATTRIBUTE_UNUSED
)
2878 struct lang_definedness_hash_entry
*ret
2879 = (struct lang_definedness_hash_entry
*) entry
;
2882 ret
= (struct lang_definedness_hash_entry
*)
2883 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
2886 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
2888 ret
->iteration
= -1;
2892 /* Return the iteration when the definition of NAME was last updated. A
2893 value of -1 means that the symbol is not defined in the linker script
2894 or the command line, but may be defined in the linker symbol table. */
2897 lang_symbol_definition_iteration (const char *name
)
2899 struct lang_definedness_hash_entry
*defentry
2900 = (struct lang_definedness_hash_entry
*)
2901 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2903 /* We've already created this one on the presence of DEFINED in the
2904 script, so it can't be NULL unless something is borked elsewhere in
2906 if (defentry
== NULL
)
2909 return defentry
->iteration
;
2912 /* Update the definedness state of NAME. */
2915 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
2917 struct lang_definedness_hash_entry
*defentry
2918 = (struct lang_definedness_hash_entry
*)
2919 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2921 /* We don't keep track of symbols not tested with DEFINED. */
2922 if (defentry
== NULL
)
2925 /* If the symbol was already defined, and not from an earlier statement
2926 iteration, don't update the definedness iteration, because that'd
2927 make the symbol seem defined in the linker script at this point, and
2928 it wasn't; it was defined in some object. If we do anyway, DEFINED
2929 would start to yield false before this point and the construct "sym =
2930 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2932 if (h
->type
!= bfd_link_hash_undefined
2933 && h
->type
!= bfd_link_hash_common
2934 && h
->type
!= bfd_link_hash_new
2935 && defentry
->iteration
== -1)
2938 defentry
->iteration
= lang_statement_iteration
;
2941 /* Add the supplied name to the symbol table as an undefined reference.
2942 This is a two step process as the symbol table doesn't even exist at
2943 the time the ld command line is processed. First we put the name
2944 on a list, then, once the output file has been opened, transfer the
2945 name to the symbol table. */
2947 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
2949 #define ldlang_undef_chain_list_head entry_symbol.next
2952 ldlang_add_undef (const char *const name
)
2954 ldlang_undef_chain_list_type
*new =
2955 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
2957 new->next
= ldlang_undef_chain_list_head
;
2958 ldlang_undef_chain_list_head
= new;
2960 new->name
= xstrdup (name
);
2962 if (output_bfd
!= NULL
)
2963 insert_undefined (new->name
);
2966 /* Insert NAME as undefined in the symbol table. */
2969 insert_undefined (const char *name
)
2971 struct bfd_link_hash_entry
*h
;
2973 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
2975 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2976 if (h
->type
== bfd_link_hash_new
)
2978 h
->type
= bfd_link_hash_undefined
;
2979 h
->u
.undef
.abfd
= NULL
;
2980 bfd_link_add_undef (link_info
.hash
, h
);
2984 /* Run through the list of undefineds created above and place them
2985 into the linker hash table as undefined symbols belonging to the
2989 lang_place_undefineds (void)
2991 ldlang_undef_chain_list_type
*ptr
;
2993 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
2994 insert_undefined (ptr
->name
);
2997 /* Check for all readonly or some readwrite sections. */
3000 check_input_sections
3001 (lang_statement_union_type
*s
,
3002 lang_output_section_statement_type
*output_section_statement
)
3004 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
3006 switch (s
->header
.type
)
3008 case lang_wild_statement_enum
:
3009 walk_wild (&s
->wild_statement
, check_section_callback
,
3010 output_section_statement
);
3011 if (! output_section_statement
->all_input_readonly
)
3014 case lang_constructors_statement_enum
:
3015 check_input_sections (constructor_list
.head
,
3016 output_section_statement
);
3017 if (! output_section_statement
->all_input_readonly
)
3020 case lang_group_statement_enum
:
3021 check_input_sections (s
->group_statement
.children
.head
,
3022 output_section_statement
);
3023 if (! output_section_statement
->all_input_readonly
)
3032 /* Update wildcard statements if needed. */
3035 update_wild_statements (lang_statement_union_type
*s
)
3037 struct wildcard_list
*sec
;
3039 switch (sort_section
)
3049 for (; s
!= NULL
; s
= s
->header
.next
)
3051 switch (s
->header
.type
)
3056 case lang_wild_statement_enum
:
3057 sec
= s
->wild_statement
.section_list
;
3060 switch (sec
->spec
.sorted
)
3063 sec
->spec
.sorted
= sort_section
;
3066 if (sort_section
== by_alignment
)
3067 sec
->spec
.sorted
= by_name_alignment
;
3070 if (sort_section
== by_name
)
3071 sec
->spec
.sorted
= by_alignment_name
;
3079 case lang_constructors_statement_enum
:
3080 update_wild_statements (constructor_list
.head
);
3083 case lang_output_section_statement_enum
:
3084 update_wild_statements
3085 (s
->output_section_statement
.children
.head
);
3088 case lang_group_statement_enum
:
3089 update_wild_statements (s
->group_statement
.children
.head
);
3097 /* Open input files and attach to output sections. */
3100 map_input_to_output_sections
3101 (lang_statement_union_type
*s
, const char *target
,
3102 lang_output_section_statement_type
*os
)
3104 for (; s
!= NULL
; s
= s
->header
.next
)
3106 switch (s
->header
.type
)
3108 case lang_wild_statement_enum
:
3109 wild (&s
->wild_statement
, target
, os
);
3111 case lang_constructors_statement_enum
:
3112 map_input_to_output_sections (constructor_list
.head
,
3116 case lang_output_section_statement_enum
:
3117 if (s
->output_section_statement
.constraint
)
3119 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3120 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3122 s
->output_section_statement
.all_input_readonly
= TRUE
;
3123 check_input_sections (s
->output_section_statement
.children
.head
,
3124 &s
->output_section_statement
);
3125 if ((s
->output_section_statement
.all_input_readonly
3126 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3127 || (!s
->output_section_statement
.all_input_readonly
3128 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3130 s
->output_section_statement
.constraint
= -1;
3135 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3137 &s
->output_section_statement
);
3139 case lang_output_statement_enum
:
3141 case lang_target_statement_enum
:
3142 target
= s
->target_statement
.target
;
3144 case lang_group_statement_enum
:
3145 map_input_to_output_sections (s
->group_statement
.children
.head
,
3149 case lang_data_statement_enum
:
3150 /* Make sure that any sections mentioned in the expression
3152 exp_init_os (s
->data_statement
.exp
);
3153 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3155 /* The output section gets contents, and then we inspect for
3156 any flags set in the input script which override any ALLOC. */
3157 os
->bfd_section
->flags
|= SEC_HAS_CONTENTS
;
3158 if (!(os
->flags
& SEC_NEVER_LOAD
))
3159 os
->bfd_section
->flags
|= SEC_ALLOC
| SEC_LOAD
;
3161 case lang_fill_statement_enum
:
3162 case lang_input_section_enum
:
3163 case lang_object_symbols_statement_enum
:
3164 case lang_reloc_statement_enum
:
3165 case lang_padding_statement_enum
:
3166 case lang_input_statement_enum
:
3167 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3170 case lang_assignment_statement_enum
:
3171 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3174 /* Make sure that any sections mentioned in the assignment
3176 exp_init_os (s
->assignment_statement
.exp
);
3178 case lang_afile_asection_pair_statement_enum
:
3181 case lang_address_statement_enum
:
3182 /* Mark the specified section with the supplied address.
3184 If this section was actually a segment marker, then the
3185 directive is ignored if the linker script explicitly
3186 processed the segment marker. Originally, the linker
3187 treated segment directives (like -Ttext on the
3188 command-line) as section directives. We honor the
3189 section directive semantics for backwards compatibilty;
3190 linker scripts that do not specifically check for
3191 SEGMENT_START automatically get the old semantics. */
3192 if (!s
->address_statement
.segment
3193 || !s
->address_statement
.segment
->used
)
3195 lang_output_section_statement_type
*aos
3196 = (lang_output_section_statement_lookup
3197 (s
->address_statement
.section_name
));
3199 if (aos
->bfd_section
== NULL
)
3200 init_os (aos
, NULL
);
3201 aos
->addr_tree
= s
->address_statement
.address
;
3208 /* An output section might have been removed after its statement was
3209 added. For example, ldemul_before_allocation can remove dynamic
3210 sections if they turn out to be not needed. Clean them up here. */
3213 strip_excluded_output_sections (void)
3215 lang_output_section_statement_type
*os
;
3217 /* Run lang_size_sections (if not already done). */
3218 if (expld
.phase
!= lang_mark_phase_enum
)
3220 expld
.phase
= lang_mark_phase_enum
;
3221 expld
.dataseg
.phase
= exp_dataseg_none
;
3222 one_lang_size_sections_pass (NULL
, FALSE
);
3223 lang_reset_memory_regions ();
3226 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3230 asection
*output_section
;
3231 bfd_boolean exclude
;
3233 if (os
->constraint
== -1)
3236 output_section
= os
->bfd_section
;
3237 if (output_section
== NULL
)
3240 exclude
= (output_section
->rawsize
== 0
3241 && (output_section
->flags
& SEC_KEEP
) == 0
3242 && !bfd_section_removed_from_list (output_bfd
,
3245 /* Some sections have not yet been sized, notably .gnu.version,
3246 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3247 input sections, so don't drop output sections that have such
3248 input sections unless they are also marked SEC_EXCLUDE. */
3249 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3253 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3254 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3255 && (s
->flags
& SEC_EXCLUDE
) == 0)
3262 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3263 output_section
->map_head
.link_order
= NULL
;
3264 output_section
->map_tail
.link_order
= NULL
;
3268 /* We don't set bfd_section to NULL since bfd_section of the
3269 removed output section statement may still be used. */
3271 output_section
->flags
|= SEC_EXCLUDE
;
3272 bfd_section_list_remove (output_bfd
, output_section
);
3273 output_bfd
->section_count
--;
3277 /* Stop future calls to lang_add_section from messing with map_head
3278 and map_tail link_order fields. */
3279 stripped_excluded_sections
= TRUE
;
3283 print_output_section_statement
3284 (lang_output_section_statement_type
*output_section_statement
)
3286 asection
*section
= output_section_statement
->bfd_section
;
3289 if (output_section_statement
!= abs_output_section
)
3291 minfo ("\n%s", output_section_statement
->name
);
3293 if (section
!= NULL
)
3295 print_dot
= section
->vma
;
3297 len
= strlen (output_section_statement
->name
);
3298 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3303 while (len
< SECTION_NAME_MAP_LENGTH
)
3309 minfo ("0x%V %W", section
->vma
, section
->size
);
3311 if (output_section_statement
->load_base
!= NULL
)
3315 addr
= exp_get_abs_int (output_section_statement
->load_base
, 0,
3317 minfo (_(" load address 0x%V"), addr
);
3324 print_statement_list (output_section_statement
->children
.head
,
3325 output_section_statement
);
3328 /* Scan for the use of the destination in the right hand side
3329 of an expression. In such cases we will not compute the
3330 correct expression, since the value of DST that is used on
3331 the right hand side will be its final value, not its value
3332 just before this expression is evaluated. */
3335 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3337 if (rhs
== NULL
|| dst
== NULL
)
3340 switch (rhs
->type
.node_class
)
3343 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3344 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3347 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3348 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3351 case etree_provided
:
3353 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3355 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3358 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3362 return strcmp (dst
, rhs
->value
.str
) == 0;
3367 return strcmp (dst
, rhs
->name
.name
) == 0;
3379 print_assignment (lang_assignment_statement_type
*assignment
,
3380 lang_output_section_statement_type
*output_section
)
3384 bfd_boolean computation_is_valid
= TRUE
;
3387 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3390 if (assignment
->exp
->type
.node_class
== etree_assert
)
3393 tree
= assignment
->exp
->assert_s
.child
;
3394 computation_is_valid
= TRUE
;
3398 const char *dst
= assignment
->exp
->assign
.dst
;
3400 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3401 tree
= assignment
->exp
->assign
.src
;
3402 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3405 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3406 if (expld
.result
.valid_p
)
3410 if (computation_is_valid
)
3412 value
= expld
.result
.value
;
3414 if (expld
.result
.section
)
3415 value
+= expld
.result
.section
->vma
;
3417 minfo ("0x%V", value
);
3423 struct bfd_link_hash_entry
*h
;
3425 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3426 FALSE
, FALSE
, TRUE
);
3429 value
= h
->u
.def
.value
;
3431 if (expld
.result
.section
)
3432 value
+= expld
.result
.section
->vma
;
3434 minfo ("[0x%V]", value
);
3437 minfo ("[unresolved]");
3449 exp_print_tree (assignment
->exp
);
3454 print_input_statement (lang_input_statement_type
*statm
)
3456 if (statm
->filename
!= NULL
)
3458 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3462 /* Print all symbols defined in a particular section. This is called
3463 via bfd_link_hash_traverse, or by print_all_symbols. */
3466 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3468 asection
*sec
= ptr
;
3470 if ((hash_entry
->type
== bfd_link_hash_defined
3471 || hash_entry
->type
== bfd_link_hash_defweak
)
3472 && sec
== hash_entry
->u
.def
.section
)
3476 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3479 (hash_entry
->u
.def
.value
3480 + hash_entry
->u
.def
.section
->output_offset
3481 + hash_entry
->u
.def
.section
->output_section
->vma
));
3483 minfo (" %T\n", hash_entry
->root
.string
);
3490 print_all_symbols (sec
)
3493 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3494 struct map_symbol_def
*def
;
3499 *ud
->map_symbol_def_tail
= 0;
3500 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3501 print_one_symbol (def
->entry
, sec
);
3504 /* Print information about an input section to the map file. */
3507 print_input_section (asection
*i
)
3509 bfd_size_type size
= i
->size
;
3516 minfo ("%s", i
->name
);
3518 len
= 1 + strlen (i
->name
);
3519 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3524 while (len
< SECTION_NAME_MAP_LENGTH
)
3530 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3531 addr
= i
->output_section
->vma
+ i
->output_offset
;
3538 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3540 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3542 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3554 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3557 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3559 if (command_line
.reduce_memory_overheads
)
3560 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3562 print_all_symbols (i
);
3564 print_dot
= addr
+ TO_ADDR (size
);
3569 print_fill_statement (lang_fill_statement_type
*fill
)
3573 fputs (" FILL mask 0x", config
.map_file
);
3574 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3575 fprintf (config
.map_file
, "%02x", *p
);
3576 fputs ("\n", config
.map_file
);
3580 print_data_statement (lang_data_statement_type
*data
)
3588 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3591 addr
= data
->output_offset
;
3592 if (data
->output_section
!= NULL
)
3593 addr
+= data
->output_section
->vma
;
3621 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3623 if (data
->exp
->type
.node_class
!= etree_value
)
3626 exp_print_tree (data
->exp
);
3631 print_dot
= addr
+ TO_ADDR (size
);
3634 /* Print an address statement. These are generated by options like
3638 print_address_statement (lang_address_statement_type
*address
)
3640 minfo (_("Address of section %s set to "), address
->section_name
);
3641 exp_print_tree (address
->address
);
3645 /* Print a reloc statement. */
3648 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3655 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3658 addr
= reloc
->output_offset
;
3659 if (reloc
->output_section
!= NULL
)
3660 addr
+= reloc
->output_section
->vma
;
3662 size
= bfd_get_reloc_size (reloc
->howto
);
3664 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3666 if (reloc
->name
!= NULL
)
3667 minfo ("%s+", reloc
->name
);
3669 minfo ("%s+", reloc
->section
->name
);
3671 exp_print_tree (reloc
->addend_exp
);
3675 print_dot
= addr
+ TO_ADDR (size
);
3679 print_padding_statement (lang_padding_statement_type
*s
)
3687 len
= sizeof " *fill*" - 1;
3688 while (len
< SECTION_NAME_MAP_LENGTH
)
3694 addr
= s
->output_offset
;
3695 if (s
->output_section
!= NULL
)
3696 addr
+= s
->output_section
->vma
;
3697 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3699 if (s
->fill
->size
!= 0)
3703 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3704 fprintf (config
.map_file
, "%02x", *p
);
3709 print_dot
= addr
+ TO_ADDR (s
->size
);
3713 print_wild_statement (lang_wild_statement_type
*w
,
3714 lang_output_section_statement_type
*os
)
3716 struct wildcard_list
*sec
;
3720 if (w
->filenames_sorted
)
3722 if (w
->filename
!= NULL
)
3723 minfo ("%s", w
->filename
);
3726 if (w
->filenames_sorted
)
3730 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
3732 if (sec
->spec
.sorted
)
3734 if (sec
->spec
.exclude_name_list
!= NULL
)
3737 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
3738 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
3739 minfo (" %s", tmp
->name
);
3742 if (sec
->spec
.name
!= NULL
)
3743 minfo ("%s", sec
->spec
.name
);
3746 if (sec
->spec
.sorted
)
3755 print_statement_list (w
->children
.head
, os
);
3758 /* Print a group statement. */
3761 print_group (lang_group_statement_type
*s
,
3762 lang_output_section_statement_type
*os
)
3764 fprintf (config
.map_file
, "START GROUP\n");
3765 print_statement_list (s
->children
.head
, os
);
3766 fprintf (config
.map_file
, "END GROUP\n");
3769 /* Print the list of statements in S.
3770 This can be called for any statement type. */
3773 print_statement_list (lang_statement_union_type
*s
,
3774 lang_output_section_statement_type
*os
)
3778 print_statement (s
, os
);
3783 /* Print the first statement in statement list S.
3784 This can be called for any statement type. */
3787 print_statement (lang_statement_union_type
*s
,
3788 lang_output_section_statement_type
*os
)
3790 switch (s
->header
.type
)
3793 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
3796 case lang_constructors_statement_enum
:
3797 if (constructor_list
.head
!= NULL
)
3799 if (constructors_sorted
)
3800 minfo (" SORT (CONSTRUCTORS)\n");
3802 minfo (" CONSTRUCTORS\n");
3803 print_statement_list (constructor_list
.head
, os
);
3806 case lang_wild_statement_enum
:
3807 print_wild_statement (&s
->wild_statement
, os
);
3809 case lang_address_statement_enum
:
3810 print_address_statement (&s
->address_statement
);
3812 case lang_object_symbols_statement_enum
:
3813 minfo (" CREATE_OBJECT_SYMBOLS\n");
3815 case lang_fill_statement_enum
:
3816 print_fill_statement (&s
->fill_statement
);
3818 case lang_data_statement_enum
:
3819 print_data_statement (&s
->data_statement
);
3821 case lang_reloc_statement_enum
:
3822 print_reloc_statement (&s
->reloc_statement
);
3824 case lang_input_section_enum
:
3825 print_input_section (s
->input_section
.section
);
3827 case lang_padding_statement_enum
:
3828 print_padding_statement (&s
->padding_statement
);
3830 case lang_output_section_statement_enum
:
3831 print_output_section_statement (&s
->output_section_statement
);
3833 case lang_assignment_statement_enum
:
3834 print_assignment (&s
->assignment_statement
, os
);
3836 case lang_target_statement_enum
:
3837 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
3839 case lang_output_statement_enum
:
3840 minfo ("OUTPUT(%s", s
->output_statement
.name
);
3841 if (output_target
!= NULL
)
3842 minfo (" %s", output_target
);
3845 case lang_input_statement_enum
:
3846 print_input_statement (&s
->input_statement
);
3848 case lang_group_statement_enum
:
3849 print_group (&s
->group_statement
, os
);
3851 case lang_afile_asection_pair_statement_enum
:
3858 print_statements (void)
3860 print_statement_list (statement_list
.head
, abs_output_section
);
3863 /* Print the first N statements in statement list S to STDERR.
3864 If N == 0, nothing is printed.
3865 If N < 0, the entire list is printed.
3866 Intended to be called from GDB. */
3869 dprint_statement (lang_statement_union_type
*s
, int n
)
3871 FILE *map_save
= config
.map_file
;
3873 config
.map_file
= stderr
;
3876 print_statement_list (s
, abs_output_section
);
3879 while (s
&& --n
>= 0)
3881 print_statement (s
, abs_output_section
);
3886 config
.map_file
= map_save
;
3890 insert_pad (lang_statement_union_type
**ptr
,
3892 unsigned int alignment_needed
,
3893 asection
*output_section
,
3896 static fill_type zero_fill
= { 1, { 0 } };
3897 lang_statement_union_type
*pad
= NULL
;
3899 if (ptr
!= &statement_list
.head
)
3900 pad
= ((lang_statement_union_type
*)
3901 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
3903 && pad
->header
.type
== lang_padding_statement_enum
3904 && pad
->padding_statement
.output_section
== output_section
)
3906 /* Use the existing pad statement. */
3908 else if ((pad
= *ptr
) != NULL
3909 && pad
->header
.type
== lang_padding_statement_enum
3910 && pad
->padding_statement
.output_section
== output_section
)
3912 /* Use the existing pad statement. */
3916 /* Make a new padding statement, linked into existing chain. */
3917 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
3918 pad
->header
.next
= *ptr
;
3920 pad
->header
.type
= lang_padding_statement_enum
;
3921 pad
->padding_statement
.output_section
= output_section
;
3924 pad
->padding_statement
.fill
= fill
;
3926 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
3927 pad
->padding_statement
.size
= alignment_needed
;
3928 output_section
->size
+= alignment_needed
;
3931 /* Work out how much this section will move the dot point. */
3935 (lang_statement_union_type
**this_ptr
,
3936 lang_output_section_statement_type
*output_section_statement
,
3940 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
3941 asection
*i
= is
->section
;
3943 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
3944 && (i
->flags
& SEC_EXCLUDE
) == 0)
3946 unsigned int alignment_needed
;
3949 /* Align this section first to the input sections requirement,
3950 then to the output section's requirement. If this alignment
3951 is greater than any seen before, then record it too. Perform
3952 the alignment by inserting a magic 'padding' statement. */
3954 if (output_section_statement
->subsection_alignment
!= -1)
3955 i
->alignment_power
= output_section_statement
->subsection_alignment
;
3957 o
= output_section_statement
->bfd_section
;
3958 if (o
->alignment_power
< i
->alignment_power
)
3959 o
->alignment_power
= i
->alignment_power
;
3961 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
3963 if (alignment_needed
!= 0)
3965 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
3966 dot
+= alignment_needed
;
3969 /* Remember where in the output section this input section goes. */
3971 i
->output_offset
= dot
- o
->vma
;
3973 /* Mark how big the output section must be to contain this now. */
3974 dot
+= TO_ADDR (i
->size
);
3975 o
->size
= TO_SIZE (dot
- o
->vma
);
3979 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
3986 sort_sections_by_lma (const void *arg1
, const void *arg2
)
3988 const asection
*sec1
= *(const asection
**) arg1
;
3989 const asection
*sec2
= *(const asection
**) arg2
;
3991 if (bfd_section_lma (sec1
->owner
, sec1
)
3992 < bfd_section_lma (sec2
->owner
, sec2
))
3994 else if (bfd_section_lma (sec1
->owner
, sec1
)
3995 > bfd_section_lma (sec2
->owner
, sec2
))
4001 #define IGNORE_SECTION(s) \
4002 ((s->flags & SEC_NEVER_LOAD) != 0 \
4003 || (s->flags & SEC_ALLOC) == 0 \
4004 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
4005 && (s->flags & SEC_LOAD) == 0))
4007 /* Check to see if any allocated sections overlap with other allocated
4008 sections. This can happen if a linker script specifies the output
4009 section addresses of the two sections. */
4012 lang_check_section_addresses (void)
4015 asection
**sections
, **spp
;
4023 if (bfd_count_sections (output_bfd
) <= 1)
4026 amt
= bfd_count_sections (output_bfd
) * sizeof (asection
*);
4027 sections
= xmalloc (amt
);
4029 /* Scan all sections in the output list. */
4031 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4033 /* Only consider loadable sections with real contents. */
4034 if (IGNORE_SECTION (s
) || s
->size
== 0)
4037 sections
[count
] = s
;
4044 qsort (sections
, (size_t) count
, sizeof (asection
*),
4045 sort_sections_by_lma
);
4049 s_start
= bfd_section_lma (output_bfd
, s
);
4050 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4051 for (count
--; count
; count
--)
4053 /* We must check the sections' LMA addresses not their VMA
4054 addresses because overlay sections can have overlapping VMAs
4055 but they must have distinct LMAs. */
4060 s_start
= bfd_section_lma (output_bfd
, s
);
4061 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4063 /* Look for an overlap. */
4064 if (s_end
>= os_start
&& s_start
<= os_end
)
4065 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4066 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4072 /* Make sure the new address is within the region. We explicitly permit the
4073 current address to be at the exact end of the region when the address is
4074 non-zero, in case the region is at the end of addressable memory and the
4075 calculation wraps around. */
4078 os_region_check (lang_output_section_statement_type
*os
,
4079 lang_memory_region_type
*region
,
4083 if ((region
->current
< region
->origin
4084 || (region
->current
- region
->origin
> region
->length
))
4085 && ((region
->current
!= region
->origin
+ region
->length
)
4090 einfo (_("%X%P: address 0x%v of %B section %s"
4091 " is not within region %s\n"),
4093 os
->bfd_section
->owner
,
4094 os
->bfd_section
->name
,
4099 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4101 os
->bfd_section
->owner
,
4102 os
->bfd_section
->name
);
4104 /* Reset the region pointer. */
4105 region
->current
= region
->origin
;
4109 /* Set the sizes for all the output sections. */
4112 lang_size_sections_1
4113 (lang_statement_union_type
*s
,
4114 lang_output_section_statement_type
*output_section_statement
,
4115 lang_statement_union_type
**prev
,
4119 bfd_boolean check_regions
)
4121 /* Size up the sections from their constituent parts. */
4122 for (; s
!= NULL
; s
= s
->header
.next
)
4124 switch (s
->header
.type
)
4126 case lang_output_section_statement_enum
:
4128 bfd_vma newdot
, after
;
4129 lang_output_section_statement_type
*os
;
4131 os
= &s
->output_section_statement
;
4132 if (os
->addr_tree
!= NULL
)
4134 os
->processed
= FALSE
;
4135 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4137 if (!expld
.result
.valid_p
4138 && expld
.phase
!= lang_mark_phase_enum
)
4139 einfo (_("%F%S: non constant or forward reference"
4140 " address expression for section %s\n"),
4143 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4146 if (os
->bfd_section
== NULL
)
4147 /* This section was removed or never actually created. */
4150 /* If this is a COFF shared library section, use the size and
4151 address from the input section. FIXME: This is COFF
4152 specific; it would be cleaner if there were some other way
4153 to do this, but nothing simple comes to mind. */
4154 if ((bfd_get_flavour (output_bfd
) == bfd_target_ecoff_flavour
4155 || bfd_get_flavour (output_bfd
) == bfd_target_coff_flavour
)
4156 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4160 if (os
->children
.head
== NULL
4161 || os
->children
.head
->header
.next
!= NULL
4162 || (os
->children
.head
->header
.type
4163 != lang_input_section_enum
))
4164 einfo (_("%P%X: Internal error on COFF shared library"
4165 " section %s\n"), os
->name
);
4167 input
= os
->children
.head
->input_section
.section
;
4168 bfd_set_section_vma (os
->bfd_section
->owner
,
4170 bfd_section_vma (input
->owner
, input
));
4171 os
->bfd_section
->size
= input
->size
;
4176 if (bfd_is_abs_section (os
->bfd_section
))
4178 /* No matter what happens, an abs section starts at zero. */
4179 ASSERT (os
->bfd_section
->vma
== 0);
4185 if (os
->addr_tree
== NULL
)
4187 /* No address specified for this section, get one
4188 from the region specification. */
4189 if (os
->region
== NULL
4190 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4191 && os
->region
->name
[0] == '*'
4192 && strcmp (os
->region
->name
,
4193 DEFAULT_MEMORY_REGION
) == 0))
4195 os
->region
= lang_memory_default (os
->bfd_section
);
4198 /* If a loadable section is using the default memory
4199 region, and some non default memory regions were
4200 defined, issue an error message. */
4201 if (!IGNORE_SECTION (os
->bfd_section
)
4202 && ! link_info
.relocatable
4204 && strcmp (os
->region
->name
,
4205 DEFAULT_MEMORY_REGION
) == 0
4206 && lang_memory_region_list
!= NULL
4207 && (strcmp (lang_memory_region_list
->name
,
4208 DEFAULT_MEMORY_REGION
) != 0
4209 || lang_memory_region_list
->next
!= NULL
)
4210 && expld
.phase
!= lang_mark_phase_enum
)
4212 /* By default this is an error rather than just a
4213 warning because if we allocate the section to the
4214 default memory region we can end up creating an
4215 excessively large binary, or even seg faulting when
4216 attempting to perform a negative seek. See
4217 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4218 for an example of this. This behaviour can be
4219 overridden by the using the --no-check-sections
4221 if (command_line
.check_section_addresses
)
4222 einfo (_("%P%F: error: no memory region specified"
4223 " for loadable section `%s'\n"),
4224 bfd_get_section_name (output_bfd
,
4227 einfo (_("%P: warning: no memory region specified"
4228 " for loadable section `%s'\n"),
4229 bfd_get_section_name (output_bfd
,
4233 newdot
= os
->region
->current
;
4234 align
= os
->bfd_section
->alignment_power
;
4237 align
= os
->section_alignment
;
4239 /* Align to what the section needs. */
4242 bfd_vma savedot
= newdot
;
4243 newdot
= align_power (newdot
, align
);
4245 if (newdot
!= savedot
4246 && (config
.warn_section_align
4247 || os
->addr_tree
!= NULL
)
4248 && expld
.phase
!= lang_mark_phase_enum
)
4249 einfo (_("%P: warning: changing start of section"
4250 " %s by %lu bytes\n"),
4251 os
->name
, (unsigned long) (newdot
- savedot
));
4254 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4256 os
->bfd_section
->output_offset
= 0;
4259 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4260 os
->fill
, newdot
, relax
, check_regions
);
4262 os
->processed
= TRUE
;
4264 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4266 ASSERT (os
->bfd_section
->size
== 0);
4270 dot
= os
->bfd_section
->vma
;
4272 /* Put the section within the requested block size, or
4273 align at the block boundary. */
4275 + TO_ADDR (os
->bfd_section
->size
)
4276 + os
->block_value
- 1)
4277 & - (bfd_vma
) os
->block_value
);
4279 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4281 /* .tbss sections effectively have zero size. */
4282 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4283 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4284 || link_info
.relocatable
)
4285 dot
+= TO_ADDR (os
->bfd_section
->size
);
4287 if (os
->update_dot_tree
!= 0)
4288 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4290 /* Update dot in the region ?
4291 We only do this if the section is going to be allocated,
4292 since unallocated sections do not contribute to the region's
4293 overall size in memory.
4295 If the SEC_NEVER_LOAD bit is not set, it will affect the
4296 addresses of sections after it. We have to update
4298 if (os
->region
!= NULL
4299 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4300 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4302 os
->region
->current
= dot
;
4305 /* Make sure the new address is within the region. */
4306 os_region_check (os
, os
->region
, os
->addr_tree
,
4307 os
->bfd_section
->vma
);
4309 /* If there's no load address specified, use the run
4310 region as the load region. */
4311 if (os
->lma_region
== NULL
&& os
->load_base
== NULL
)
4312 os
->lma_region
= os
->region
;
4314 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
)
4316 /* Set load_base, which will be handled later. */
4317 os
->load_base
= exp_intop (os
->lma_region
->current
);
4318 os
->lma_region
->current
+=
4319 TO_ADDR (os
->bfd_section
->size
);
4321 os_region_check (os
, os
->lma_region
, NULL
,
4322 os
->bfd_section
->lma
);
4328 case lang_constructors_statement_enum
:
4329 dot
= lang_size_sections_1 (constructor_list
.head
,
4330 output_section_statement
,
4331 &s
->wild_statement
.children
.head
,
4332 fill
, dot
, relax
, check_regions
);
4335 case lang_data_statement_enum
:
4337 unsigned int size
= 0;
4339 s
->data_statement
.output_offset
=
4340 dot
- output_section_statement
->bfd_section
->vma
;
4341 s
->data_statement
.output_section
=
4342 output_section_statement
->bfd_section
;
4344 /* We might refer to provided symbols in the expression, and
4345 need to mark them as needed. */
4346 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4348 switch (s
->data_statement
.type
)
4366 if (size
< TO_SIZE ((unsigned) 1))
4367 size
= TO_SIZE ((unsigned) 1);
4368 dot
+= TO_ADDR (size
);
4369 output_section_statement
->bfd_section
->size
+= size
;
4373 case lang_reloc_statement_enum
:
4377 s
->reloc_statement
.output_offset
=
4378 dot
- output_section_statement
->bfd_section
->vma
;
4379 s
->reloc_statement
.output_section
=
4380 output_section_statement
->bfd_section
;
4381 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4382 dot
+= TO_ADDR (size
);
4383 output_section_statement
->bfd_section
->size
+= size
;
4387 case lang_wild_statement_enum
:
4388 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4389 output_section_statement
,
4390 &s
->wild_statement
.children
.head
,
4391 fill
, dot
, relax
, check_regions
);
4394 case lang_object_symbols_statement_enum
:
4395 link_info
.create_object_symbols_section
=
4396 output_section_statement
->bfd_section
;
4399 case lang_output_statement_enum
:
4400 case lang_target_statement_enum
:
4403 case lang_input_section_enum
:
4407 i
= (*prev
)->input_section
.section
;
4412 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4413 einfo (_("%P%F: can't relax section: %E\n"));
4417 dot
= size_input_section (prev
, output_section_statement
,
4418 output_section_statement
->fill
, dot
);
4422 case lang_input_statement_enum
:
4425 case lang_fill_statement_enum
:
4426 s
->fill_statement
.output_section
=
4427 output_section_statement
->bfd_section
;
4429 fill
= s
->fill_statement
.fill
;
4432 case lang_assignment_statement_enum
:
4434 bfd_vma newdot
= dot
;
4436 exp_fold_tree (s
->assignment_statement
.exp
,
4437 output_section_statement
->bfd_section
,
4440 if (newdot
!= dot
&& !output_section_statement
->ignored
)
4442 if (output_section_statement
== abs_output_section
)
4444 /* If we don't have an output section, then just adjust
4445 the default memory address. */
4446 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4447 FALSE
)->current
= newdot
;
4451 /* Insert a pad after this statement. We can't
4452 put the pad before when relaxing, in case the
4453 assignment references dot. */
4454 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4455 output_section_statement
->bfd_section
, dot
);
4457 /* Don't neuter the pad below when relaxing. */
4460 /* If dot is advanced, this implies that the section
4461 should have space allocated to it, unless the
4462 user has explicitly stated that the section
4463 should never be loaded. */
4464 if (!(output_section_statement
->flags
4465 & (SEC_NEVER_LOAD
| SEC_ALLOC
)))
4466 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4473 case lang_padding_statement_enum
:
4474 /* If this is the first time lang_size_sections is called,
4475 we won't have any padding statements. If this is the
4476 second or later passes when relaxing, we should allow
4477 padding to shrink. If padding is needed on this pass, it
4478 will be added back in. */
4479 s
->padding_statement
.size
= 0;
4481 /* Make sure output_offset is valid. If relaxation shrinks
4482 the section and this pad isn't needed, it's possible to
4483 have output_offset larger than the final size of the
4484 section. bfd_set_section_contents will complain even for
4485 a pad size of zero. */
4486 s
->padding_statement
.output_offset
4487 = dot
- output_section_statement
->bfd_section
->vma
;
4490 case lang_group_statement_enum
:
4491 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4492 output_section_statement
,
4493 &s
->group_statement
.children
.head
,
4494 fill
, dot
, relax
, check_regions
);
4501 /* We can only get here when relaxing is turned on. */
4502 case lang_address_statement_enum
:
4505 prev
= &s
->header
.next
;
4511 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
4513 lang_statement_iteration
++;
4514 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
4515 &statement_list
.head
, 0, 0, relax
, check_regions
);
4519 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
4521 expld
.phase
= lang_allocating_phase_enum
;
4522 expld
.dataseg
.phase
= exp_dataseg_none
;
4524 one_lang_size_sections_pass (relax
, check_regions
);
4525 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
4526 && link_info
.relro
&& expld
.dataseg
.relro_end
)
4528 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4529 to put expld.dataseg.relro on a (common) page boundary. */
4530 bfd_vma old_min_base
, relro_end
, maxpage
;
4532 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
4533 old_min_base
= expld
.dataseg
.min_base
;
4534 maxpage
= expld
.dataseg
.maxpagesize
;
4535 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
4536 & (expld
.dataseg
.pagesize
- 1));
4537 /* Compute the expected PT_GNU_RELRO segment end. */
4538 relro_end
= (expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
4539 & ~(expld
.dataseg
.pagesize
- 1);
4540 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
4542 expld
.dataseg
.base
-= maxpage
;
4543 relro_end
-= maxpage
;
4545 lang_reset_memory_regions ();
4546 one_lang_size_sections_pass (relax
, check_regions
);
4547 if (expld
.dataseg
.relro_end
> relro_end
)
4549 /* The alignment of sections between DATA_SEGMENT_ALIGN
4550 and DATA_SEGMENT_RELRO_END caused huge padding to be
4551 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4553 unsigned int max_alignment_power
= 0;
4555 /* Find maximum alignment power of sections between
4556 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4557 for (sec
= output_bfd
->sections
; sec
; sec
= sec
->next
)
4558 if (sec
->vma
>= expld
.dataseg
.base
4559 && sec
->vma
< expld
.dataseg
.relro_end
4560 && sec
->alignment_power
> max_alignment_power
)
4561 max_alignment_power
= sec
->alignment_power
;
4563 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
4565 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
4567 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
4568 expld
.dataseg
.base
-= (1 << max_alignment_power
);
4569 lang_reset_memory_regions ();
4570 one_lang_size_sections_pass (relax
, check_regions
);
4573 link_info
.relro_start
= expld
.dataseg
.base
;
4574 link_info
.relro_end
= expld
.dataseg
.relro_end
;
4576 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
4578 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4579 a page could be saved in the data segment. */
4580 bfd_vma first
, last
;
4582 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
4583 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
4585 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
4586 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
4587 && first
+ last
<= expld
.dataseg
.pagesize
)
4589 expld
.dataseg
.phase
= exp_dataseg_adjust
;
4590 lang_reset_memory_regions ();
4591 one_lang_size_sections_pass (relax
, check_regions
);
4595 expld
.phase
= lang_final_phase_enum
;
4598 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4601 lang_do_assignments_1
4602 (lang_statement_union_type
*s
,
4603 lang_output_section_statement_type
*output_section_statement
,
4607 for (; s
!= NULL
; s
= s
->header
.next
)
4609 switch (s
->header
.type
)
4611 case lang_constructors_statement_enum
:
4612 dot
= lang_do_assignments_1 (constructor_list
.head
,
4613 output_section_statement
,
4618 case lang_output_section_statement_enum
:
4620 lang_output_section_statement_type
*os
;
4622 os
= &(s
->output_section_statement
);
4623 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
4625 dot
= os
->bfd_section
->vma
;
4626 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
4627 /* .tbss sections effectively have zero size. */
4628 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4629 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4630 || link_info
.relocatable
)
4631 dot
+= TO_ADDR (os
->bfd_section
->size
);
4635 /* If nothing has been placed into the output section then
4636 it won't have a bfd_section. */
4637 if (os
->bfd_section
&& !os
->ignored
)
4639 os
->bfd_section
->lma
4640 = exp_get_abs_int (os
->load_base
, 0, "load base");
4646 case lang_wild_statement_enum
:
4648 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
4649 output_section_statement
,
4653 case lang_object_symbols_statement_enum
:
4654 case lang_output_statement_enum
:
4655 case lang_target_statement_enum
:
4658 case lang_data_statement_enum
:
4659 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4660 if (expld
.result
.valid_p
)
4661 s
->data_statement
.value
= (expld
.result
.value
4662 + expld
.result
.section
->vma
);
4664 einfo (_("%F%P: invalid data statement\n"));
4667 switch (s
->data_statement
.type
)
4685 if (size
< TO_SIZE ((unsigned) 1))
4686 size
= TO_SIZE ((unsigned) 1);
4687 dot
+= TO_ADDR (size
);
4691 case lang_reloc_statement_enum
:
4692 exp_fold_tree (s
->reloc_statement
.addend_exp
,
4693 bfd_abs_section_ptr
, &dot
);
4694 if (expld
.result
.valid_p
)
4695 s
->reloc_statement
.addend_value
= expld
.result
.value
;
4697 einfo (_("%F%P: invalid reloc statement\n"));
4698 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
4701 case lang_input_section_enum
:
4703 asection
*in
= s
->input_section
.section
;
4705 if ((in
->flags
& SEC_EXCLUDE
) == 0)
4706 dot
+= TO_ADDR (in
->size
);
4710 case lang_input_statement_enum
:
4713 case lang_fill_statement_enum
:
4714 fill
= s
->fill_statement
.fill
;
4717 case lang_assignment_statement_enum
:
4718 exp_fold_tree (s
->assignment_statement
.exp
,
4719 output_section_statement
->bfd_section
,
4723 case lang_padding_statement_enum
:
4724 dot
+= TO_ADDR (s
->padding_statement
.size
);
4727 case lang_group_statement_enum
:
4728 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
4729 output_section_statement
,
4737 case lang_address_statement_enum
:
4745 lang_do_assignments (void)
4747 lang_statement_iteration
++;
4748 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
4751 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4752 operator .startof. (section_name), it produces an undefined symbol
4753 .startof.section_name. Similarly, when it sees
4754 .sizeof. (section_name), it produces an undefined symbol
4755 .sizeof.section_name. For all the output sections, we look for
4756 such symbols, and set them to the correct value. */
4759 lang_set_startof (void)
4763 if (link_info
.relocatable
)
4766 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4768 const char *secname
;
4770 struct bfd_link_hash_entry
*h
;
4772 secname
= bfd_get_section_name (output_bfd
, s
);
4773 buf
= xmalloc (10 + strlen (secname
));
4775 sprintf (buf
, ".startof.%s", secname
);
4776 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4777 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4779 h
->type
= bfd_link_hash_defined
;
4780 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, s
);
4781 h
->u
.def
.section
= bfd_abs_section_ptr
;
4784 sprintf (buf
, ".sizeof.%s", secname
);
4785 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4786 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4788 h
->type
= bfd_link_hash_defined
;
4789 h
->u
.def
.value
= TO_ADDR (s
->size
);
4790 h
->u
.def
.section
= bfd_abs_section_ptr
;
4800 struct bfd_link_hash_entry
*h
;
4803 if (link_info
.relocatable
|| link_info
.shared
)
4808 if (entry_symbol
.name
== NULL
)
4810 /* No entry has been specified. Look for the default entry, but
4811 don't warn if we don't find it. */
4812 entry_symbol
.name
= entry_symbol_default
;
4816 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
4817 FALSE
, FALSE
, TRUE
);
4819 && (h
->type
== bfd_link_hash_defined
4820 || h
->type
== bfd_link_hash_defweak
)
4821 && h
->u
.def
.section
->output_section
!= NULL
)
4825 val
= (h
->u
.def
.value
4826 + bfd_get_section_vma (output_bfd
,
4827 h
->u
.def
.section
->output_section
)
4828 + h
->u
.def
.section
->output_offset
);
4829 if (! bfd_set_start_address (output_bfd
, val
))
4830 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
4837 /* We couldn't find the entry symbol. Try parsing it as a
4839 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
4842 if (! bfd_set_start_address (output_bfd
, val
))
4843 einfo (_("%P%F: can't set start address\n"));
4849 /* Can't find the entry symbol, and it's not a number. Use
4850 the first address in the text section. */
4851 ts
= bfd_get_section_by_name (output_bfd
, entry_section
);
4855 einfo (_("%P: warning: cannot find entry symbol %s;"
4856 " defaulting to %V\n"),
4858 bfd_get_section_vma (output_bfd
, ts
));
4859 if (! bfd_set_start_address (output_bfd
,
4860 bfd_get_section_vma (output_bfd
,
4862 einfo (_("%P%F: can't set start address\n"));
4867 einfo (_("%P: warning: cannot find entry symbol %s;"
4868 " not setting start address\n"),
4874 /* Don't bfd_hash_table_free (&lang_definedness_table);
4875 map file output may result in a call of lang_track_definedness. */
4878 /* This is a small function used when we want to ignore errors from
4882 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
4884 /* Don't do anything. */
4887 /* Check that the architecture of all the input files is compatible
4888 with the output file. Also call the backend to let it do any
4889 other checking that is needed. */
4894 lang_statement_union_type
*file
;
4896 const bfd_arch_info_type
*compatible
;
4898 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
4900 input_bfd
= file
->input_statement
.the_bfd
;
4902 = bfd_arch_get_compatible (input_bfd
, output_bfd
,
4903 command_line
.accept_unknown_input_arch
);
4905 /* In general it is not possible to perform a relocatable
4906 link between differing object formats when the input
4907 file has relocations, because the relocations in the
4908 input format may not have equivalent representations in
4909 the output format (and besides BFD does not translate
4910 relocs for other link purposes than a final link). */
4911 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
4912 && (compatible
== NULL
4913 || bfd_get_flavour (input_bfd
) != bfd_get_flavour (output_bfd
))
4914 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
4916 einfo (_("%P%F: Relocatable linking with relocations from"
4917 " format %s (%B) to format %s (%B) is not supported\n"),
4918 bfd_get_target (input_bfd
), input_bfd
,
4919 bfd_get_target (output_bfd
), output_bfd
);
4920 /* einfo with %F exits. */
4923 if (compatible
== NULL
)
4925 if (command_line
.warn_mismatch
)
4926 einfo (_("%P: warning: %s architecture of input file `%B'"
4927 " is incompatible with %s output\n"),
4928 bfd_printable_name (input_bfd
), input_bfd
,
4929 bfd_printable_name (output_bfd
));
4931 else if (bfd_count_sections (input_bfd
))
4933 /* If the input bfd has no contents, it shouldn't set the
4934 private data of the output bfd. */
4936 bfd_error_handler_type pfn
= NULL
;
4938 /* If we aren't supposed to warn about mismatched input
4939 files, temporarily set the BFD error handler to a
4940 function which will do nothing. We still want to call
4941 bfd_merge_private_bfd_data, since it may set up
4942 information which is needed in the output file. */
4943 if (! command_line
.warn_mismatch
)
4944 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
4945 if (! bfd_merge_private_bfd_data (input_bfd
, output_bfd
))
4947 if (command_line
.warn_mismatch
)
4948 einfo (_("%P%X: failed to merge target specific data"
4949 " of file %B\n"), input_bfd
);
4951 if (! command_line
.warn_mismatch
)
4952 bfd_set_error_handler (pfn
);
4957 /* Look through all the global common symbols and attach them to the
4958 correct section. The -sort-common command line switch may be used
4959 to roughly sort the entries by size. */
4964 if (command_line
.inhibit_common_definition
)
4966 if (link_info
.relocatable
4967 && ! command_line
.force_common_definition
)
4970 if (! config
.sort_common
)
4971 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
4976 for (power
= 4; power
>= 0; power
--)
4977 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
4981 /* Place one common symbol in the correct section. */
4984 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
4986 unsigned int power_of_two
;
4990 if (h
->type
!= bfd_link_hash_common
)
4994 power_of_two
= h
->u
.c
.p
->alignment_power
;
4996 if (config
.sort_common
4997 && power_of_two
< (unsigned int) *(int *) info
)
5000 section
= h
->u
.c
.p
->section
;
5002 /* Increase the size of the section to align the common sym. */
5003 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
5004 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
5006 /* Adjust the alignment if necessary. */
5007 if (power_of_two
> section
->alignment_power
)
5008 section
->alignment_power
= power_of_two
;
5010 /* Change the symbol from common to defined. */
5011 h
->type
= bfd_link_hash_defined
;
5012 h
->u
.def
.section
= section
;
5013 h
->u
.def
.value
= section
->size
;
5015 /* Increase the size of the section. */
5016 section
->size
+= size
;
5018 /* Make sure the section is allocated in memory, and make sure that
5019 it is no longer a common section. */
5020 section
->flags
|= SEC_ALLOC
;
5021 section
->flags
&= ~SEC_IS_COMMON
;
5023 if (config
.map_file
!= NULL
)
5025 static bfd_boolean header_printed
;
5030 if (! header_printed
)
5032 minfo (_("\nAllocating common symbols\n"));
5033 minfo (_("Common symbol size file\n\n"));
5034 header_printed
= TRUE
;
5037 name
= demangle (h
->root
.string
);
5039 len
= strlen (name
);
5054 if (size
<= 0xffffffff)
5055 sprintf (buf
, "%lx", (unsigned long) size
);
5057 sprintf_vma (buf
, size
);
5067 minfo ("%B\n", section
->owner
);
5073 /* Run through the input files and ensure that every input section has
5074 somewhere to go. If one is found without a destination then create
5075 an input request and place it into the statement tree. */
5078 lang_place_orphans (void)
5080 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5084 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5086 if (s
->output_section
== NULL
)
5088 /* This section of the file is not attached, root
5089 around for a sensible place for it to go. */
5091 if (file
->just_syms_flag
)
5092 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5093 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5094 s
->output_section
= bfd_abs_section_ptr
;
5095 else if (strcmp (s
->name
, "COMMON") == 0)
5097 /* This is a lonely common section which must have
5098 come from an archive. We attach to the section
5099 with the wildcard. */
5100 if (! link_info
.relocatable
5101 || command_line
.force_common_definition
)
5103 if (default_common_section
== NULL
)
5105 default_common_section
=
5106 lang_output_section_statement_lookup (".bss");
5109 lang_add_section (&default_common_section
->children
, s
,
5110 default_common_section
);
5113 else if (ldemul_place_orphan (s
))
5117 lang_output_section_statement_type
*os
;
5119 os
= lang_output_section_statement_lookup (s
->name
);
5120 lang_add_section (&os
->children
, s
, os
);
5128 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5130 flagword
*ptr_flags
;
5132 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5138 *ptr_flags
|= SEC_ALLOC
;
5142 *ptr_flags
|= SEC_READONLY
;
5146 *ptr_flags
|= SEC_DATA
;
5150 *ptr_flags
|= SEC_CODE
;
5155 *ptr_flags
|= SEC_LOAD
;
5159 einfo (_("%P%F: invalid syntax in flags\n"));
5166 /* Call a function on each input file. This function will be called
5167 on an archive, but not on the elements. */
5170 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5172 lang_input_statement_type
*f
;
5174 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5176 f
= (lang_input_statement_type
*) f
->next_real_file
)
5180 /* Call a function on each file. The function will be called on all
5181 the elements of an archive which are included in the link, but will
5182 not be called on the archive file itself. */
5185 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5187 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5194 ldlang_add_file (lang_input_statement_type
*entry
)
5198 lang_statement_append (&file_chain
,
5199 (lang_statement_union_type
*) entry
,
5202 /* The BFD linker needs to have a list of all input BFDs involved in
5204 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5205 ASSERT (entry
->the_bfd
!= output_bfd
);
5206 for (pp
= &link_info
.input_bfds
; *pp
!= NULL
; pp
= &(*pp
)->link_next
)
5208 *pp
= entry
->the_bfd
;
5209 entry
->the_bfd
->usrdata
= entry
;
5210 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5212 /* Look through the sections and check for any which should not be
5213 included in the link. We need to do this now, so that we can
5214 notice when the backend linker tries to report multiple
5215 definition errors for symbols which are in sections we aren't
5216 going to link. FIXME: It might be better to entirely ignore
5217 symbols which are defined in sections which are going to be
5218 discarded. This would require modifying the backend linker for
5219 each backend which might set the SEC_LINK_ONCE flag. If we do
5220 this, we should probably handle SEC_EXCLUDE in the same way. */
5222 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5226 lang_add_output (const char *name
, int from_script
)
5228 /* Make -o on command line override OUTPUT in script. */
5229 if (!had_output_filename
|| !from_script
)
5231 output_filename
= name
;
5232 had_output_filename
= TRUE
;
5236 static lang_output_section_statement_type
*current_section
;
5247 for (l
= 0; l
< 32; l
++)
5249 if (i
>= (unsigned int) x
)
5257 lang_output_section_statement_type
*
5258 lang_enter_output_section_statement (const char *output_section_statement_name
,
5259 etree_type
*address_exp
,
5260 enum section_type sectype
,
5262 etree_type
*subalign
,
5266 lang_output_section_statement_type
*os
;
5268 os
= lang_output_section_statement_lookup_1 (output_section_statement_name
,
5270 current_section
= os
;
5272 /* Make next things chain into subchain of this. */
5274 if (os
->addr_tree
== NULL
)
5276 os
->addr_tree
= address_exp
;
5278 os
->sectype
= sectype
;
5279 if (sectype
!= noload_section
)
5280 os
->flags
= SEC_NO_FLAGS
;
5282 os
->flags
= SEC_NEVER_LOAD
;
5283 os
->block_value
= 1;
5284 stat_ptr
= &os
->children
;
5286 os
->subsection_alignment
=
5287 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5288 os
->section_alignment
=
5289 topower (exp_get_value_int (align
, -1, "section alignment"));
5291 os
->load_base
= ebase
;
5298 lang_output_statement_type
*new;
5300 new = new_stat (lang_output_statement
, stat_ptr
);
5301 new->name
= output_filename
;
5304 /* Reset the current counters in the regions. */
5307 lang_reset_memory_regions (void)
5309 lang_memory_region_type
*p
= lang_memory_region_list
;
5311 lang_output_section_statement_type
*os
;
5313 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5315 p
->old_length
= (bfd_size_type
) (p
->current
- p
->origin
);
5316 p
->current
= p
->origin
;
5319 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5322 os
->processed
= FALSE
;
5324 for (o
= output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5326 /* Save the last size for possible use by bfd_relax_section. */
5327 o
->rawsize
= o
->size
;
5332 /* Worker for lang_gc_sections_1. */
5335 gc_section_callback (lang_wild_statement_type
*ptr
,
5336 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5338 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5339 void *data ATTRIBUTE_UNUSED
)
5341 /* If the wild pattern was marked KEEP, the member sections
5342 should be as well. */
5343 if (ptr
->keep_sections
)
5344 section
->flags
|= SEC_KEEP
;
5347 /* Iterate over sections marking them against GC. */
5350 lang_gc_sections_1 (lang_statement_union_type
*s
)
5352 for (; s
!= NULL
; s
= s
->header
.next
)
5354 switch (s
->header
.type
)
5356 case lang_wild_statement_enum
:
5357 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5359 case lang_constructors_statement_enum
:
5360 lang_gc_sections_1 (constructor_list
.head
);
5362 case lang_output_section_statement_enum
:
5363 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5365 case lang_group_statement_enum
:
5366 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5375 lang_gc_sections (void)
5377 struct bfd_link_hash_entry
*h
;
5378 ldlang_undef_chain_list_type
*ulist
;
5380 /* Keep all sections so marked in the link script. */
5382 lang_gc_sections_1 (statement_list
.head
);
5384 /* Keep all sections containing symbols undefined on the command-line,
5385 and the section containing the entry symbol. */
5387 for (ulist
= link_info
.gc_sym_list
; ulist
; ulist
= ulist
->next
)
5389 h
= bfd_link_hash_lookup (link_info
.hash
, ulist
->name
,
5390 FALSE
, FALSE
, FALSE
);
5393 && (h
->type
== bfd_link_hash_defined
5394 || h
->type
== bfd_link_hash_defweak
)
5395 && ! bfd_is_abs_section (h
->u
.def
.section
))
5397 h
->u
.def
.section
->flags
|= SEC_KEEP
;
5401 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5402 the special case of debug info. (See bfd/stabs.c)
5403 Twiddle the flag here, to simplify later linker code. */
5404 if (link_info
.relocatable
)
5406 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5409 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5410 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5411 sec
->flags
&= ~SEC_EXCLUDE
;
5415 if (link_info
.gc_sections
)
5416 bfd_gc_sections (output_bfd
, &link_info
);
5419 /* Relax all sections until bfd_relax_section gives up. */
5422 relax_sections (void)
5424 /* Keep relaxing until bfd_relax_section gives up. */
5425 bfd_boolean relax_again
;
5429 relax_again
= FALSE
;
5431 /* Note: pe-dll.c does something like this also. If you find
5432 you need to change this code, you probably need to change
5433 pe-dll.c also. DJ */
5435 /* Do all the assignments with our current guesses as to
5437 lang_do_assignments ();
5439 /* We must do this after lang_do_assignments, because it uses
5441 lang_reset_memory_regions ();
5443 /* Perform another relax pass - this time we know where the
5444 globals are, so can make a better guess. */
5445 lang_size_sections (&relax_again
, FALSE
);
5447 while (relax_again
);
5453 current_target
= default_target
;
5455 /* Open the output file. */
5456 lang_for_each_statement (ldlang_open_output
);
5459 ldemul_create_output_section_statements ();
5461 /* Add to the hash table all undefineds on the command line. */
5462 lang_place_undefineds ();
5464 if (!bfd_section_already_linked_table_init ())
5465 einfo (_("%P%F: Failed to create hash table\n"));
5467 /* Create a bfd for each input file. */
5468 current_target
= default_target
;
5469 open_input_bfds (statement_list
.head
, FALSE
);
5471 link_info
.gc_sym_list
= &entry_symbol
;
5472 if (entry_symbol
.name
== NULL
)
5473 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
5475 ldemul_after_open ();
5477 bfd_section_already_linked_table_free ();
5479 /* Make sure that we're not mixing architectures. We call this
5480 after all the input files have been opened, but before we do any
5481 other processing, so that any operations merge_private_bfd_data
5482 does on the output file will be known during the rest of the
5486 /* Handle .exports instead of a version script if we're told to do so. */
5487 if (command_line
.version_exports_section
)
5488 lang_do_version_exports_section ();
5490 /* Build all sets based on the information gathered from the input
5492 ldctor_build_sets ();
5494 /* Remove unreferenced sections if asked to. */
5495 lang_gc_sections ();
5497 /* Size up the common data. */
5500 /* Update wild statements. */
5501 update_wild_statements (statement_list
.head
);
5503 /* Run through the contours of the script and attach input sections
5504 to the correct output sections. */
5505 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
5507 /* Find any sections not attached explicitly and handle them. */
5508 lang_place_orphans ();
5510 if (! link_info
.relocatable
)
5514 /* Merge SEC_MERGE sections. This has to be done after GC of
5515 sections, so that GCed sections are not merged, but before
5516 assigning dynamic symbols, since removing whole input sections
5518 bfd_merge_sections (output_bfd
, &link_info
);
5520 /* Look for a text section and set the readonly attribute in it. */
5521 found
= bfd_get_section_by_name (output_bfd
, ".text");
5525 if (config
.text_read_only
)
5526 found
->flags
|= SEC_READONLY
;
5528 found
->flags
&= ~SEC_READONLY
;
5532 /* Do anything special before sizing sections. This is where ELF
5533 and other back-ends size dynamic sections. */
5534 ldemul_before_allocation ();
5536 /* We must record the program headers before we try to fix the
5537 section positions, since they will affect SIZEOF_HEADERS. */
5538 lang_record_phdrs ();
5540 /* Size up the sections. */
5541 lang_size_sections (NULL
, !command_line
.relax
);
5543 /* Now run around and relax if we can. */
5544 if (command_line
.relax
)
5546 /* We may need more than one relaxation pass. */
5547 int i
= link_info
.relax_pass
;
5549 /* The backend can use it to determine the current pass. */
5550 link_info
.relax_pass
= 0;
5555 link_info
.relax_pass
++;
5558 /* Final extra sizing to report errors. */
5559 lang_do_assignments ();
5560 lang_reset_memory_regions ();
5561 lang_size_sections (NULL
, TRUE
);
5564 /* See if anything special should be done now we know how big
5566 ldemul_after_allocation ();
5568 /* Fix any .startof. or .sizeof. symbols. */
5569 lang_set_startof ();
5571 /* Do all the assignments, now that we know the final resting places
5572 of all the symbols. */
5574 lang_do_assignments ();
5576 /* Make sure that the section addresses make sense. */
5577 if (! link_info
.relocatable
5578 && command_line
.check_section_addresses
)
5579 lang_check_section_addresses ();
5586 /* EXPORTED TO YACC */
5589 lang_add_wild (struct wildcard_spec
*filespec
,
5590 struct wildcard_list
*section_list
,
5591 bfd_boolean keep_sections
)
5593 struct wildcard_list
*curr
, *next
;
5594 lang_wild_statement_type
*new;
5596 /* Reverse the list as the parser puts it back to front. */
5597 for (curr
= section_list
, section_list
= NULL
;
5599 section_list
= curr
, curr
= next
)
5601 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
5602 placed_commons
= TRUE
;
5605 curr
->next
= section_list
;
5608 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
5610 if (strcmp (filespec
->name
, "*") == 0)
5611 filespec
->name
= NULL
;
5612 else if (! wildcardp (filespec
->name
))
5613 lang_has_input_file
= TRUE
;
5616 new = new_stat (lang_wild_statement
, stat_ptr
);
5617 new->filename
= NULL
;
5618 new->filenames_sorted
= FALSE
;
5619 if (filespec
!= NULL
)
5621 new->filename
= filespec
->name
;
5622 new->filenames_sorted
= filespec
->sorted
== by_name
;
5624 new->section_list
= section_list
;
5625 new->keep_sections
= keep_sections
;
5626 lang_list_init (&new->children
);
5627 analyze_walk_wild_section_handler (new);
5631 lang_section_start (const char *name
, etree_type
*address
,
5632 const segment_type
*segment
)
5634 lang_address_statement_type
*ad
;
5636 ad
= new_stat (lang_address_statement
, stat_ptr
);
5637 ad
->section_name
= name
;
5638 ad
->address
= address
;
5639 ad
->segment
= segment
;
5642 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5643 because of a -e argument on the command line, or zero if this is
5644 called by ENTRY in a linker script. Command line arguments take
5648 lang_add_entry (const char *name
, bfd_boolean cmdline
)
5650 if (entry_symbol
.name
== NULL
5652 || ! entry_from_cmdline
)
5654 entry_symbol
.name
= name
;
5655 entry_from_cmdline
= cmdline
;
5659 /* Set the default start symbol to NAME. .em files should use this,
5660 not lang_add_entry, to override the use of "start" if neither the
5661 linker script nor the command line specifies an entry point. NAME
5662 must be permanently allocated. */
5664 lang_default_entry (const char *name
)
5666 entry_symbol_default
= name
;
5670 lang_add_target (const char *name
)
5672 lang_target_statement_type
*new;
5674 new = new_stat (lang_target_statement
, stat_ptr
);
5679 lang_add_map (const char *name
)
5686 map_option_f
= TRUE
;
5694 lang_add_fill (fill_type
*fill
)
5696 lang_fill_statement_type
*new;
5698 new = new_stat (lang_fill_statement
, stat_ptr
);
5703 lang_add_data (int type
, union etree_union
*exp
)
5705 lang_data_statement_type
*new;
5707 new = new_stat (lang_data_statement
, stat_ptr
);
5712 /* Create a new reloc statement. RELOC is the BFD relocation type to
5713 generate. HOWTO is the corresponding howto structure (we could
5714 look this up, but the caller has already done so). SECTION is the
5715 section to generate a reloc against, or NAME is the name of the
5716 symbol to generate a reloc against. Exactly one of SECTION and
5717 NAME must be NULL. ADDEND is an expression for the addend. */
5720 lang_add_reloc (bfd_reloc_code_real_type reloc
,
5721 reloc_howto_type
*howto
,
5724 union etree_union
*addend
)
5726 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
5730 p
->section
= section
;
5732 p
->addend_exp
= addend
;
5734 p
->addend_value
= 0;
5735 p
->output_section
= NULL
;
5736 p
->output_offset
= 0;
5739 lang_assignment_statement_type
*
5740 lang_add_assignment (etree_type
*exp
)
5742 lang_assignment_statement_type
*new;
5744 new = new_stat (lang_assignment_statement
, stat_ptr
);
5750 lang_add_attribute (enum statement_enum attribute
)
5752 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
5756 lang_startup (const char *name
)
5758 if (startup_file
!= NULL
)
5760 einfo (_("%P%F: multiple STARTUP files\n"));
5762 first_file
->filename
= name
;
5763 first_file
->local_sym_name
= name
;
5764 first_file
->real
= TRUE
;
5766 startup_file
= name
;
5770 lang_float (bfd_boolean maybe
)
5772 lang_float_flag
= maybe
;
5776 /* Work out the load- and run-time regions from a script statement, and
5777 store them in *LMA_REGION and *REGION respectively.
5779 MEMSPEC is the name of the run-time region, or the value of
5780 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5781 LMA_MEMSPEC is the name of the load-time region, or null if the
5782 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5783 had an explicit load address.
5785 It is an error to specify both a load region and a load address. */
5788 lang_get_regions (lang_memory_region_type
**region
,
5789 lang_memory_region_type
**lma_region
,
5790 const char *memspec
,
5791 const char *lma_memspec
,
5792 bfd_boolean have_lma
,
5793 bfd_boolean have_vma
)
5795 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
5797 /* If no runtime region or VMA has been specified, but the load region
5798 has been specified, then use the load region for the runtime region
5800 if (lma_memspec
!= NULL
5802 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
5803 *region
= *lma_region
;
5805 *region
= lang_memory_region_lookup (memspec
, FALSE
);
5807 if (have_lma
&& lma_memspec
!= 0)
5808 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5812 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
5813 lang_output_section_phdr_list
*phdrs
,
5814 const char *lma_memspec
)
5816 lang_get_regions (¤t_section
->region
,
5817 ¤t_section
->lma_region
,
5818 memspec
, lma_memspec
,
5819 current_section
->load_base
!= NULL
,
5820 current_section
->addr_tree
!= NULL
);
5821 current_section
->fill
= fill
;
5822 current_section
->phdrs
= phdrs
;
5823 stat_ptr
= &statement_list
;
5826 /* Create an absolute symbol with the given name with the value of the
5827 address of first byte of the section named.
5829 If the symbol already exists, then do nothing. */
5832 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
5834 struct bfd_link_hash_entry
*h
;
5836 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5838 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5840 if (h
->type
== bfd_link_hash_new
5841 || h
->type
== bfd_link_hash_undefined
)
5845 h
->type
= bfd_link_hash_defined
;
5847 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5851 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, sec
);
5853 h
->u
.def
.section
= bfd_abs_section_ptr
;
5857 /* Create an absolute symbol with the given name with the value of the
5858 address of the first byte after the end of the section named.
5860 If the symbol already exists, then do nothing. */
5863 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
5865 struct bfd_link_hash_entry
*h
;
5867 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5869 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5871 if (h
->type
== bfd_link_hash_new
5872 || h
->type
== bfd_link_hash_undefined
)
5876 h
->type
= bfd_link_hash_defined
;
5878 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5882 h
->u
.def
.value
= (bfd_get_section_vma (output_bfd
, sec
)
5883 + TO_ADDR (sec
->size
));
5885 h
->u
.def
.section
= bfd_abs_section_ptr
;
5890 lang_statement_append (lang_statement_list_type
*list
,
5891 lang_statement_union_type
*element
,
5892 lang_statement_union_type
**field
)
5894 *(list
->tail
) = element
;
5898 /* Set the output format type. -oformat overrides scripts. */
5901 lang_add_output_format (const char *format
,
5906 if (output_target
== NULL
|| !from_script
)
5908 if (command_line
.endian
== ENDIAN_BIG
5911 else if (command_line
.endian
== ENDIAN_LITTLE
5915 output_target
= format
;
5919 /* Enter a group. This creates a new lang_group_statement, and sets
5920 stat_ptr to build new statements within the group. */
5923 lang_enter_group (void)
5925 lang_group_statement_type
*g
;
5927 g
= new_stat (lang_group_statement
, stat_ptr
);
5928 lang_list_init (&g
->children
);
5929 stat_ptr
= &g
->children
;
5932 /* Leave a group. This just resets stat_ptr to start writing to the
5933 regular list of statements again. Note that this will not work if
5934 groups can occur inside anything else which can adjust stat_ptr,
5935 but currently they can't. */
5938 lang_leave_group (void)
5940 stat_ptr
= &statement_list
;
5943 /* Add a new program header. This is called for each entry in a PHDRS
5944 command in a linker script. */
5947 lang_new_phdr (const char *name
,
5949 bfd_boolean filehdr
,
5954 struct lang_phdr
*n
, **pp
;
5956 n
= stat_alloc (sizeof (struct lang_phdr
));
5959 n
->type
= exp_get_value_int (type
, 0, "program header type");
5960 n
->filehdr
= filehdr
;
5965 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
5970 /* Record the program header information in the output BFD. FIXME: We
5971 should not be calling an ELF specific function here. */
5974 lang_record_phdrs (void)
5978 lang_output_section_phdr_list
*last
;
5979 struct lang_phdr
*l
;
5980 lang_output_section_statement_type
*os
;
5983 secs
= xmalloc (alc
* sizeof (asection
*));
5985 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
5992 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5996 lang_output_section_phdr_list
*pl
;
5998 if (os
->constraint
== -1)
6006 if (os
->sectype
== noload_section
6007 || os
->bfd_section
== NULL
6008 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6013 if (os
->bfd_section
== NULL
)
6016 for (; pl
!= NULL
; pl
= pl
->next
)
6018 if (strcmp (pl
->name
, l
->name
) == 0)
6023 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
6025 secs
[c
] = os
->bfd_section
;
6032 if (l
->flags
== NULL
)
6035 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6040 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6042 if (! bfd_record_phdr (output_bfd
, l
->type
,
6043 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6044 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6045 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6050 /* Make sure all the phdr assignments succeeded. */
6051 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6055 lang_output_section_phdr_list
*pl
;
6057 if (os
->constraint
== -1
6058 || os
->bfd_section
== NULL
)
6061 for (pl
= os
->phdrs
;
6064 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6065 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6066 os
->name
, pl
->name
);
6070 /* Record a list of sections which may not be cross referenced. */
6073 lang_add_nocrossref (lang_nocrossref_type
*l
)
6075 struct lang_nocrossrefs
*n
;
6077 n
= xmalloc (sizeof *n
);
6078 n
->next
= nocrossref_list
;
6080 nocrossref_list
= n
;
6082 /* Set notice_all so that we get informed about all symbols. */
6083 link_info
.notice_all
= TRUE
;
6086 /* Overlay handling. We handle overlays with some static variables. */
6088 /* The overlay virtual address. */
6089 static etree_type
*overlay_vma
;
6090 /* And subsection alignment. */
6091 static etree_type
*overlay_subalign
;
6093 /* An expression for the maximum section size seen so far. */
6094 static etree_type
*overlay_max
;
6096 /* A list of all the sections in this overlay. */
6098 struct overlay_list
{
6099 struct overlay_list
*next
;
6100 lang_output_section_statement_type
*os
;
6103 static struct overlay_list
*overlay_list
;
6105 /* Start handling an overlay. */
6108 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6110 /* The grammar should prevent nested overlays from occurring. */
6111 ASSERT (overlay_vma
== NULL
6112 && overlay_subalign
== NULL
6113 && overlay_max
== NULL
);
6115 overlay_vma
= vma_expr
;
6116 overlay_subalign
= subalign
;
6119 /* Start a section in an overlay. We handle this by calling
6120 lang_enter_output_section_statement with the correct VMA.
6121 lang_leave_overlay sets up the LMA and memory regions. */
6124 lang_enter_overlay_section (const char *name
)
6126 struct overlay_list
*n
;
6129 lang_enter_output_section_statement (name
, overlay_vma
, normal_section
,
6130 0, overlay_subalign
, 0, 0);
6132 /* If this is the first section, then base the VMA of future
6133 sections on this one. This will work correctly even if `.' is
6134 used in the addresses. */
6135 if (overlay_list
== NULL
)
6136 overlay_vma
= exp_nameop (ADDR
, name
);
6138 /* Remember the section. */
6139 n
= xmalloc (sizeof *n
);
6140 n
->os
= current_section
;
6141 n
->next
= overlay_list
;
6144 size
= exp_nameop (SIZEOF
, name
);
6146 /* Arrange to work out the maximum section end address. */
6147 if (overlay_max
== NULL
)
6150 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6153 /* Finish a section in an overlay. There isn't any special to do
6157 lang_leave_overlay_section (fill_type
*fill
,
6158 lang_output_section_phdr_list
*phdrs
)
6165 name
= current_section
->name
;
6167 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6168 region and that no load-time region has been specified. It doesn't
6169 really matter what we say here, since lang_leave_overlay will
6171 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6173 /* Define the magic symbols. */
6175 clean
= xmalloc (strlen (name
) + 1);
6177 for (s1
= name
; *s1
!= '\0'; s1
++)
6178 if (ISALNUM (*s1
) || *s1
== '_')
6182 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6183 sprintf (buf
, "__load_start_%s", clean
);
6184 lang_add_assignment (exp_assop ('=', buf
,
6185 exp_nameop (LOADADDR
, name
)));
6187 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6188 sprintf (buf
, "__load_stop_%s", clean
);
6189 lang_add_assignment (exp_assop ('=', buf
,
6191 exp_nameop (LOADADDR
, name
),
6192 exp_nameop (SIZEOF
, name
))));
6197 /* Finish an overlay. If there are any overlay wide settings, this
6198 looks through all the sections in the overlay and sets them. */
6201 lang_leave_overlay (etree_type
*lma_expr
,
6204 const char *memspec
,
6205 lang_output_section_phdr_list
*phdrs
,
6206 const char *lma_memspec
)
6208 lang_memory_region_type
*region
;
6209 lang_memory_region_type
*lma_region
;
6210 struct overlay_list
*l
;
6211 lang_nocrossref_type
*nocrossref
;
6213 lang_get_regions (®ion
, &lma_region
,
6214 memspec
, lma_memspec
,
6215 lma_expr
!= NULL
, FALSE
);
6219 /* After setting the size of the last section, set '.' to end of the
6221 if (overlay_list
!= NULL
)
6222 overlay_list
->os
->update_dot_tree
6223 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6228 struct overlay_list
*next
;
6230 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6233 l
->os
->region
= region
;
6234 l
->os
->lma_region
= lma_region
;
6236 /* The first section has the load address specified in the
6237 OVERLAY statement. The rest are worked out from that.
6238 The base address is not needed (and should be null) if
6239 an LMA region was specified. */
6241 l
->os
->load_base
= lma_expr
;
6242 else if (lma_region
== 0)
6243 l
->os
->load_base
= exp_binop ('+',
6244 exp_nameop (LOADADDR
, l
->next
->os
->name
),
6245 exp_nameop (SIZEOF
, l
->next
->os
->name
));
6247 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6248 l
->os
->phdrs
= phdrs
;
6252 lang_nocrossref_type
*nc
;
6254 nc
= xmalloc (sizeof *nc
);
6255 nc
->name
= l
->os
->name
;
6256 nc
->next
= nocrossref
;
6265 if (nocrossref
!= NULL
)
6266 lang_add_nocrossref (nocrossref
);
6269 overlay_list
= NULL
;
6273 /* Version handling. This is only useful for ELF. */
6275 /* This global variable holds the version tree that we build. */
6277 struct bfd_elf_version_tree
*lang_elf_version_info
;
6279 /* If PREV is NULL, return first version pattern matching particular symbol.
6280 If PREV is non-NULL, return first version pattern matching particular
6281 symbol after PREV (previously returned by lang_vers_match). */
6283 static struct bfd_elf_version_expr
*
6284 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6285 struct bfd_elf_version_expr
*prev
,
6288 const char *cxx_sym
= sym
;
6289 const char *java_sym
= sym
;
6290 struct bfd_elf_version_expr
*expr
= NULL
;
6292 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6294 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6298 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6300 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6305 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6307 struct bfd_elf_version_expr e
;
6309 switch (prev
? prev
->mask
: 0)
6312 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6315 expr
= htab_find (head
->htab
, &e
);
6316 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6317 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6323 case BFD_ELF_VERSION_C_TYPE
:
6324 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6327 expr
= htab_find (head
->htab
, &e
);
6328 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6329 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6335 case BFD_ELF_VERSION_CXX_TYPE
:
6336 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6338 e
.symbol
= java_sym
;
6339 expr
= htab_find (head
->htab
, &e
);
6340 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6341 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6352 /* Finally, try the wildcards. */
6353 if (prev
== NULL
|| prev
->symbol
)
6354 expr
= head
->remaining
;
6357 for (; expr
; expr
= expr
->next
)
6364 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6367 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6369 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6373 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6379 free ((char *) cxx_sym
);
6380 if (java_sym
!= sym
)
6381 free ((char *) java_sym
);
6385 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6386 return a string pointing to the symbol name. */
6389 realsymbol (const char *pattern
)
6392 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6393 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6395 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6397 /* It is a glob pattern only if there is no preceding
6399 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6407 /* Remove the preceding backslash. */
6414 backslash
= *p
== '\\';
6429 /* This is called for each variable name or match expression. NEW is
6430 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
6431 pattern to be matched against symbol names. */
6433 struct bfd_elf_version_expr
*
6434 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
6437 bfd_boolean literal_p
)
6439 struct bfd_elf_version_expr
*ret
;
6441 ret
= xmalloc (sizeof *ret
);
6443 ret
->pattern
= literal_p
? NULL
: new;
6446 ret
->symbol
= literal_p
? new : realsymbol (new);
6448 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
6449 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6450 else if (strcasecmp (lang
, "C++") == 0)
6451 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
6452 else if (strcasecmp (lang
, "Java") == 0)
6453 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
6456 einfo (_("%X%P: unknown language `%s' in version information\n"),
6458 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6461 return ldemul_new_vers_pattern (ret
);
6464 /* This is called for each set of variable names and match
6467 struct bfd_elf_version_tree
*
6468 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
6469 struct bfd_elf_version_expr
*locals
)
6471 struct bfd_elf_version_tree
*ret
;
6473 ret
= xcalloc (1, sizeof *ret
);
6474 ret
->globals
.list
= globals
;
6475 ret
->locals
.list
= locals
;
6476 ret
->match
= lang_vers_match
;
6477 ret
->name_indx
= (unsigned int) -1;
6481 /* This static variable keeps track of version indices. */
6483 static int version_index
;
6486 version_expr_head_hash (const void *p
)
6488 const struct bfd_elf_version_expr
*e
= p
;
6490 return htab_hash_string (e
->symbol
);
6494 version_expr_head_eq (const void *p1
, const void *p2
)
6496 const struct bfd_elf_version_expr
*e1
= p1
;
6497 const struct bfd_elf_version_expr
*e2
= p2
;
6499 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
6503 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
6506 struct bfd_elf_version_expr
*e
, *next
;
6507 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
6509 for (e
= head
->list
; e
; e
= e
->next
)
6513 head
->mask
|= e
->mask
;
6518 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
6519 version_expr_head_eq
, NULL
);
6520 list_loc
= &head
->list
;
6521 remaining_loc
= &head
->remaining
;
6522 for (e
= head
->list
; e
; e
= next
)
6528 remaining_loc
= &e
->next
;
6532 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
6536 struct bfd_elf_version_expr
*e1
, *last
;
6542 if (e1
->mask
== e
->mask
)
6550 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
6554 /* This is a duplicate. */
6555 /* FIXME: Memory leak. Sometimes pattern is not
6556 xmalloced alone, but in larger chunk of memory. */
6557 /* free (e->symbol); */
6562 e
->next
= last
->next
;
6570 list_loc
= &e
->next
;
6574 *remaining_loc
= NULL
;
6575 *list_loc
= head
->remaining
;
6578 head
->remaining
= head
->list
;
6581 /* This is called when we know the name and dependencies of the
6585 lang_register_vers_node (const char *name
,
6586 struct bfd_elf_version_tree
*version
,
6587 struct bfd_elf_version_deps
*deps
)
6589 struct bfd_elf_version_tree
*t
, **pp
;
6590 struct bfd_elf_version_expr
*e1
;
6595 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
6596 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
6598 einfo (_("%X%P: anonymous version tag cannot be combined"
6599 " with other version tags\n"));
6604 /* Make sure this node has a unique name. */
6605 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6606 if (strcmp (t
->name
, name
) == 0)
6607 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
6609 lang_finalize_version_expr_head (&version
->globals
);
6610 lang_finalize_version_expr_head (&version
->locals
);
6612 /* Check the global and local match names, and make sure there
6613 aren't any duplicates. */
6615 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
6617 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6619 struct bfd_elf_version_expr
*e2
;
6621 if (t
->locals
.htab
&& e1
->symbol
)
6623 e2
= htab_find (t
->locals
.htab
, e1
);
6624 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6626 if (e1
->mask
== e2
->mask
)
6627 einfo (_("%X%P: duplicate expression `%s'"
6628 " in version information\n"), e1
->symbol
);
6632 else if (!e1
->symbol
)
6633 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6634 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6635 && e1
->mask
== e2
->mask
)
6636 einfo (_("%X%P: duplicate expression `%s'"
6637 " in version information\n"), e1
->pattern
);
6641 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
6643 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6645 struct bfd_elf_version_expr
*e2
;
6647 if (t
->globals
.htab
&& e1
->symbol
)
6649 e2
= htab_find (t
->globals
.htab
, e1
);
6650 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6652 if (e1
->mask
== e2
->mask
)
6653 einfo (_("%X%P: duplicate expression `%s'"
6654 " in version information\n"),
6659 else if (!e1
->symbol
)
6660 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6661 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6662 && e1
->mask
== e2
->mask
)
6663 einfo (_("%X%P: duplicate expression `%s'"
6664 " in version information\n"), e1
->pattern
);
6668 version
->deps
= deps
;
6669 version
->name
= name
;
6670 if (name
[0] != '\0')
6673 version
->vernum
= version_index
;
6676 version
->vernum
= 0;
6678 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6683 /* This is called when we see a version dependency. */
6685 struct bfd_elf_version_deps
*
6686 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
6688 struct bfd_elf_version_deps
*ret
;
6689 struct bfd_elf_version_tree
*t
;
6691 ret
= xmalloc (sizeof *ret
);
6694 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6696 if (strcmp (t
->name
, name
) == 0)
6698 ret
->version_needed
= t
;
6703 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
6709 lang_do_version_exports_section (void)
6711 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
6713 LANG_FOR_EACH_INPUT_STATEMENT (is
)
6715 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
6723 contents
= xmalloc (len
);
6724 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
6725 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
6728 while (p
< contents
+ len
)
6730 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
6731 p
= strchr (p
, '\0') + 1;
6734 /* Do not free the contents, as we used them creating the regex. */
6736 /* Do not include this section in the link. */
6737 sec
->flags
|= SEC_EXCLUDE
;
6740 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
6741 lang_register_vers_node (command_line
.version_exports_section
,
6742 lang_new_vers_node (greg
, lreg
), NULL
);
6746 lang_add_unique (const char *name
)
6748 struct unique_sections
*ent
;
6750 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
6751 if (strcmp (ent
->name
, name
) == 0)
6754 ent
= xmalloc (sizeof *ent
);
6755 ent
->name
= xstrdup (name
);
6756 ent
->next
= unique_section_list
;
6757 unique_section_list
= ent
;