1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005
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 bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
85 static void lang_record_phdrs (void);
86 static void lang_do_version_exports_section (void);
88 /* Exported variables. */
89 lang_output_section_statement_type
*abs_output_section
;
90 lang_statement_list_type lang_output_section_statement
;
91 lang_statement_list_type
*stat_ptr
= &statement_list
;
92 lang_statement_list_type file_chain
= { NULL
, NULL
};
93 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
94 static const char *entry_symbol_default
= "start";
95 const char *entry_section
= ".text";
96 bfd_boolean entry_from_cmdline
;
97 bfd_boolean lang_has_input_file
= FALSE
;
98 bfd_boolean had_output_filename
= FALSE
;
99 bfd_boolean lang_float_flag
= FALSE
;
100 bfd_boolean delete_output_file_on_failure
= FALSE
;
101 struct lang_nocrossrefs
*nocrossref_list
;
102 static struct unique_sections
*unique_section_list
;
103 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
104 int lang_statement_iteration
= 0;
106 etree_type
*base
; /* Relocation base - or null */
108 /* Return TRUE if the PATTERN argument is a wildcard pattern.
109 Although backslashes are treated specially if a pattern contains
110 wildcards, we do not consider the mere presence of a backslash to
111 be enough to cause the pattern to be treated as a wildcard.
112 That lets us handle DOS filenames more naturally. */
113 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
115 #define new_stat(x, y) \
116 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
118 #define outside_section_address(q) \
119 ((q)->output_offset + (q)->output_section->vma)
121 #define outside_symbol_address(q) \
122 ((q)->value + outside_section_address (q->section))
124 #define SECTION_NAME_MAP_LENGTH (16)
127 stat_alloc (size_t size
)
129 return obstack_alloc (&stat_obstack
, size
);
133 unique_section_p (const asection
*sec
)
135 struct unique_sections
*unam
;
138 if (link_info
.relocatable
139 && sec
->owner
!= NULL
140 && bfd_is_group_section (sec
->owner
, sec
))
144 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
145 if (wildcardp (unam
->name
)
146 ? fnmatch (unam
->name
, secnam
, 0) == 0
147 : strcmp (unam
->name
, secnam
) == 0)
155 /* Generic traversal routines for finding matching sections. */
157 /* Try processing a section against a wildcard. This just calls
158 the callback unless the filename exclusion list is present
159 and excludes the file. It's hardly ever present so this
160 function is very fast. */
163 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
164 lang_input_statement_type
*file
,
166 struct wildcard_list
*sec
,
170 bfd_boolean skip
= FALSE
;
171 struct name_list
*list_tmp
;
173 /* Don't process sections from files which were
175 for (list_tmp
= sec
->spec
.exclude_name_list
;
177 list_tmp
= list_tmp
->next
)
179 bfd_boolean is_wildcard
= wildcardp (list_tmp
->name
);
181 skip
= fnmatch (list_tmp
->name
, file
->filename
, 0) == 0;
183 skip
= strcmp (list_tmp
->name
, file
->filename
) == 0;
185 /* If this file is part of an archive, and the archive is
186 excluded, exclude this file. */
187 if (! skip
&& file
->the_bfd
!= NULL
188 && file
->the_bfd
->my_archive
!= NULL
189 && file
->the_bfd
->my_archive
->filename
!= NULL
)
192 skip
= fnmatch (list_tmp
->name
,
193 file
->the_bfd
->my_archive
->filename
,
196 skip
= strcmp (list_tmp
->name
,
197 file
->the_bfd
->my_archive
->filename
) == 0;
205 (*callback
) (ptr
, sec
, s
, file
, data
);
208 /* Lowest common denominator routine that can handle everything correctly,
212 walk_wild_section_general (lang_wild_statement_type
*ptr
,
213 lang_input_statement_type
*file
,
218 struct wildcard_list
*sec
;
220 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
222 sec
= ptr
->section_list
;
224 (*callback
) (ptr
, sec
, s
, file
, data
);
228 bfd_boolean skip
= FALSE
;
230 if (sec
->spec
.name
!= NULL
)
232 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
234 if (wildcardp (sec
->spec
.name
))
235 skip
= fnmatch (sec
->spec
.name
, sname
, 0) != 0;
237 skip
= strcmp (sec
->spec
.name
, sname
) != 0;
241 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
248 /* Routines to find a single section given its name. If there's more
249 than one section with that name, we report that. */
253 asection
*found_section
;
254 bfd_boolean multiple_sections_found
;
255 } section_iterator_callback_data
;
258 section_iterator_callback (bfd
*bfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
260 section_iterator_callback_data
*d
= data
;
262 if (d
->found_section
!= NULL
)
264 d
->multiple_sections_found
= TRUE
;
268 d
->found_section
= s
;
273 find_section (lang_input_statement_type
*file
,
274 struct wildcard_list
*sec
,
275 bfd_boolean
*multiple_sections_found
)
277 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
279 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
280 section_iterator_callback
, &cb_data
);
281 *multiple_sections_found
= cb_data
.multiple_sections_found
;
282 return cb_data
.found_section
;
285 /* Code for handling simple wildcards without going through fnmatch,
286 which can be expensive because of charset translations etc. */
288 /* A simple wild is a literal string followed by a single '*',
289 where the literal part is at least 4 characters long. */
292 is_simple_wild (const char *name
)
294 size_t len
= strcspn (name
, "*?[");
295 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
299 match_simple_wild (const char *pattern
, const char *name
)
301 /* The first four characters of the pattern are guaranteed valid
302 non-wildcard characters. So we can go faster. */
303 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
304 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
309 while (*pattern
!= '*')
310 if (*name
++ != *pattern
++)
316 /* Specialized, optimized routines for handling different kinds of
320 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
321 lang_input_statement_type
*file
,
325 /* We can just do a hash lookup for the section with the right name.
326 But if that lookup discovers more than one section with the name
327 (should be rare), we fall back to the general algorithm because
328 we would otherwise have to sort the sections to make sure they
329 get processed in the bfd's order. */
330 bfd_boolean multiple_sections_found
;
331 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
332 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
334 if (multiple_sections_found
)
335 walk_wild_section_general (ptr
, file
, callback
, data
);
337 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
341 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
342 lang_input_statement_type
*file
,
347 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
349 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
351 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
352 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
355 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
360 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
361 lang_input_statement_type
*file
,
366 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
367 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
368 bfd_boolean multiple_sections_found
;
369 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
371 if (multiple_sections_found
)
373 walk_wild_section_general (ptr
, file
, callback
, data
);
377 /* Note that if the section was not found, s0 is NULL and
378 we'll simply never succeed the s == s0 test below. */
379 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
381 /* Recall that in this code path, a section cannot satisfy more
382 than one spec, so if s == s0 then it cannot match
385 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
388 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
389 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
392 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
399 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
400 lang_input_statement_type
*file
,
405 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
406 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
407 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
408 bfd_boolean multiple_sections_found
;
409 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
411 if (multiple_sections_found
)
413 walk_wild_section_general (ptr
, file
, callback
, data
);
417 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
420 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
423 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
424 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
427 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
430 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
432 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
440 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
441 lang_input_statement_type
*file
,
446 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
447 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
448 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
449 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
450 bfd_boolean multiple_sections_found
;
451 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
453 if (multiple_sections_found
)
455 walk_wild_section_general (ptr
, file
, callback
, data
);
459 s1
= find_section (file
, sec1
, &multiple_sections_found
);
460 if (multiple_sections_found
)
462 walk_wild_section_general (ptr
, file
, callback
, data
);
466 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
469 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
472 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
475 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
476 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
480 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
484 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
486 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
494 walk_wild_section (lang_wild_statement_type
*ptr
,
495 lang_input_statement_type
*file
,
499 if (file
->just_syms_flag
)
502 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
505 /* Returns TRUE when name1 is a wildcard spec that might match
506 something name2 can match. We're conservative: we return FALSE
507 only if the prefixes of name1 and name2 are different up to the
508 first wildcard character. */
511 wild_spec_can_overlap (const char *name1
, const char *name2
)
513 size_t prefix1_len
= strcspn (name1
, "?*[");
514 size_t prefix2_len
= strcspn (name2
, "?*[");
515 size_t min_prefix_len
;
517 /* Note that if there is no wildcard character, then we treat the
518 terminating 0 as part of the prefix. Thus ".text" won't match
519 ".text." or ".text.*", for example. */
520 if (name1
[prefix1_len
] == '\0')
522 if (name2
[prefix2_len
] == '\0')
525 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
527 return memcmp (name1
, name2
, min_prefix_len
) == 0;
530 /* Select specialized code to handle various kinds of wildcard
534 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
537 int wild_name_count
= 0;
538 struct wildcard_list
*sec
;
542 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
544 /* Count how many wildcard_specs there are, and how many of those
545 actually use wildcards in the name. Also, bail out if any of the
546 wildcard names are NULL. (Can this actually happen?
547 walk_wild_section used to test for it.) And bail out if any
548 of the wildcards are more complex than a simple string
549 ending in a single '*'. */
550 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
553 if (sec
->spec
.name
== NULL
)
555 if (wildcardp (sec
->spec
.name
))
558 if (!is_simple_wild (sec
->spec
.name
))
563 /* The zero-spec case would be easy to optimize but it doesn't
564 happen in practice. Likewise, more than 4 specs doesn't
565 happen in practice. */
566 if (sec_count
== 0 || sec_count
> 4)
569 /* Check that no two specs can match the same section. */
570 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
572 struct wildcard_list
*sec2
;
573 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
575 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
580 signature
= (sec_count
<< 8) + wild_name_count
;
584 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
587 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
590 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
593 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
596 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
602 /* Now fill the data array with pointers to the specs, first the
603 specs with non-wildcard names, then the specs with wildcard
604 names. It's OK to process the specs in different order from the
605 given order, because we've already determined that no section
606 will match more than one spec. */
608 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
609 if (!wildcardp (sec
->spec
.name
))
610 ptr
->handler_data
[data_counter
++] = sec
;
611 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
612 if (wildcardp (sec
->spec
.name
))
613 ptr
->handler_data
[data_counter
++] = sec
;
616 /* Handle a wild statement for a single file F. */
619 walk_wild_file (lang_wild_statement_type
*s
,
620 lang_input_statement_type
*f
,
624 if (f
->the_bfd
== NULL
625 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
626 walk_wild_section (s
, f
, callback
, data
);
631 /* This is an archive file. We must map each member of the
632 archive separately. */
633 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
634 while (member
!= NULL
)
636 /* When lookup_name is called, it will call the add_symbols
637 entry point for the archive. For each element of the
638 archive which is included, BFD will call ldlang_add_file,
639 which will set the usrdata field of the member to the
640 lang_input_statement. */
641 if (member
->usrdata
!= NULL
)
643 walk_wild_section (s
, member
->usrdata
, callback
, data
);
646 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
652 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
654 const char *file_spec
= s
->filename
;
656 if (file_spec
== NULL
)
658 /* Perform the iteration over all files in the list. */
659 LANG_FOR_EACH_INPUT_STATEMENT (f
)
661 walk_wild_file (s
, f
, callback
, data
);
664 else if (wildcardp (file_spec
))
666 LANG_FOR_EACH_INPUT_STATEMENT (f
)
668 if (fnmatch (file_spec
, f
->filename
, FNM_FILE_NAME
) == 0)
669 walk_wild_file (s
, f
, callback
, data
);
674 lang_input_statement_type
*f
;
676 /* Perform the iteration over a single file. */
677 f
= lookup_name (file_spec
);
679 walk_wild_file (s
, f
, callback
, data
);
683 /* lang_for_each_statement walks the parse tree and calls the provided
684 function for each node. */
687 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
688 lang_statement_union_type
*s
)
690 for (; s
!= NULL
; s
= s
->header
.next
)
694 switch (s
->header
.type
)
696 case lang_constructors_statement_enum
:
697 lang_for_each_statement_worker (func
, constructor_list
.head
);
699 case lang_output_section_statement_enum
:
700 lang_for_each_statement_worker
701 (func
, s
->output_section_statement
.children
.head
);
703 case lang_wild_statement_enum
:
704 lang_for_each_statement_worker (func
,
705 s
->wild_statement
.children
.head
);
707 case lang_group_statement_enum
:
708 lang_for_each_statement_worker (func
,
709 s
->group_statement
.children
.head
);
711 case lang_data_statement_enum
:
712 case lang_reloc_statement_enum
:
713 case lang_object_symbols_statement_enum
:
714 case lang_output_statement_enum
:
715 case lang_target_statement_enum
:
716 case lang_input_section_enum
:
717 case lang_input_statement_enum
:
718 case lang_assignment_statement_enum
:
719 case lang_padding_statement_enum
:
720 case lang_address_statement_enum
:
721 case lang_fill_statement_enum
:
731 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
733 lang_for_each_statement_worker (func
, statement_list
.head
);
736 /*----------------------------------------------------------------------*/
739 lang_list_init (lang_statement_list_type
*list
)
742 list
->tail
= &list
->head
;
745 /* Build a new statement node for the parse tree. */
747 static lang_statement_union_type
*
748 new_statement (enum statement_enum type
,
750 lang_statement_list_type
*list
)
752 lang_statement_union_type
*new;
754 new = stat_alloc (size
);
755 new->header
.type
= type
;
756 new->header
.next
= NULL
;
757 lang_statement_append (list
, new, &new->header
.next
);
761 /* Build a new input file node for the language. There are several
762 ways in which we treat an input file, eg, we only look at symbols,
763 or prefix it with a -l etc.
765 We can be supplied with requests for input files more than once;
766 they may, for example be split over several lines like foo.o(.text)
767 foo.o(.data) etc, so when asked for a file we check that we haven't
768 got it already so we don't duplicate the bfd. */
770 static lang_input_statement_type
*
771 new_afile (const char *name
,
772 lang_input_file_enum_type file_type
,
774 bfd_boolean add_to_list
)
776 lang_input_statement_type
*p
;
779 p
= new_stat (lang_input_statement
, stat_ptr
);
782 p
= stat_alloc (sizeof (lang_input_statement_type
));
783 p
->header
.next
= NULL
;
786 lang_has_input_file
= TRUE
;
788 p
->sysrooted
= FALSE
;
791 case lang_input_file_is_symbols_only_enum
:
793 p
->is_archive
= FALSE
;
795 p
->local_sym_name
= name
;
796 p
->just_syms_flag
= TRUE
;
797 p
->search_dirs_flag
= FALSE
;
799 case lang_input_file_is_fake_enum
:
801 p
->is_archive
= FALSE
;
803 p
->local_sym_name
= name
;
804 p
->just_syms_flag
= FALSE
;
805 p
->search_dirs_flag
= FALSE
;
807 case lang_input_file_is_l_enum
:
808 p
->is_archive
= TRUE
;
811 p
->local_sym_name
= concat ("-l", name
, NULL
);
812 p
->just_syms_flag
= FALSE
;
813 p
->search_dirs_flag
= TRUE
;
815 case lang_input_file_is_marker_enum
:
817 p
->is_archive
= FALSE
;
819 p
->local_sym_name
= name
;
820 p
->just_syms_flag
= FALSE
;
821 p
->search_dirs_flag
= TRUE
;
823 case lang_input_file_is_search_file_enum
:
824 p
->sysrooted
= ldlang_sysrooted_script
;
826 p
->is_archive
= FALSE
;
828 p
->local_sym_name
= name
;
829 p
->just_syms_flag
= FALSE
;
830 p
->search_dirs_flag
= TRUE
;
832 case lang_input_file_is_file_enum
:
834 p
->is_archive
= FALSE
;
836 p
->local_sym_name
= name
;
837 p
->just_syms_flag
= FALSE
;
838 p
->search_dirs_flag
= FALSE
;
845 p
->next_real_file
= NULL
;
848 p
->dynamic
= config
.dynamic_link
;
849 p
->add_needed
= add_needed
;
850 p
->as_needed
= as_needed
;
851 p
->whole_archive
= whole_archive
;
853 lang_statement_append (&input_file_chain
,
854 (lang_statement_union_type
*) p
,
859 lang_input_statement_type
*
860 lang_add_input_file (const char *name
,
861 lang_input_file_enum_type file_type
,
864 lang_has_input_file
= TRUE
;
865 return new_afile (name
, file_type
, target
, TRUE
);
868 /* Build enough state so that the parser can build its tree. */
873 obstack_begin (&stat_obstack
, 1000);
875 stat_ptr
= &statement_list
;
877 lang_list_init (stat_ptr
);
879 lang_list_init (&input_file_chain
);
880 lang_list_init (&lang_output_section_statement
);
881 lang_list_init (&file_chain
);
882 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
885 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
887 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
889 /* The value "3" is ad-hoc, somewhat related to the expected number of
890 DEFINED expressions in a linker script. For most default linker
891 scripts, there are none. Why a hash table then? Well, it's somewhat
892 simpler to re-use working machinery than using a linked list in terms
893 of code-complexity here in ld, besides the initialization which just
894 looks like other code here. */
895 if (!bfd_hash_table_init_n (&lang_definedness_table
,
896 lang_definedness_newfunc
, 3))
897 einfo (_("%P%F: out of memory during initialization"));
899 /* Callers of exp_fold_tree need to increment this. */
900 lang_statement_iteration
= 0;
903 /*----------------------------------------------------------------------
904 A region is an area of memory declared with the
905 MEMORY { name:org=exp, len=exp ... }
908 We maintain a list of all the regions here.
910 If no regions are specified in the script, then the default is used
911 which is created when looked up to be the entire data space.
913 If create is true we are creating a region inside a MEMORY block.
914 In this case it is probably an error to create a region that has
915 already been created. If we are not inside a MEMORY block it is
916 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
917 and so we issue a warning. */
919 static lang_memory_region_type
*lang_memory_region_list
;
920 static lang_memory_region_type
**lang_memory_region_list_tail
921 = &lang_memory_region_list
;
923 lang_memory_region_type
*
924 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
926 lang_memory_region_type
*p
;
927 lang_memory_region_type
*new;
929 /* NAME is NULL for LMA memspecs if no region was specified. */
933 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
934 if (strcmp (p
->name
, name
) == 0)
937 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
942 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
943 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
945 new = stat_alloc (sizeof (lang_memory_region_type
));
947 new->name
= xstrdup (name
);
950 *lang_memory_region_list_tail
= new;
951 lang_memory_region_list_tail
= &new->next
;
955 new->length
= ~(bfd_size_type
) 0;
957 new->had_full_message
= FALSE
;
962 static lang_memory_region_type
*
963 lang_memory_default (asection
*section
)
965 lang_memory_region_type
*p
;
967 flagword sec_flags
= section
->flags
;
969 /* Override SEC_DATA to mean a writable section. */
970 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
971 sec_flags
|= SEC_DATA
;
973 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
975 if ((p
->flags
& sec_flags
) != 0
976 && (p
->not_flags
& sec_flags
) == 0)
981 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
984 static lang_output_section_statement_type
*
985 lang_output_section_find_1 (const char *const name
, int constraint
)
987 lang_output_section_statement_type
*lookup
;
989 for (lookup
= &lang_output_section_statement
.head
->output_section_statement
;
991 lookup
= lookup
->next
)
993 if (strcmp (name
, lookup
->name
) == 0
994 && lookup
->constraint
!= -1
996 || (constraint
== lookup
->constraint
997 && constraint
!= SPECIAL
)))
1003 lang_output_section_statement_type
*
1004 lang_output_section_find (const char *const name
)
1006 return lang_output_section_find_1 (name
, 0);
1009 static lang_output_section_statement_type
*
1010 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1012 lang_output_section_statement_type
*lookup
;
1014 lookup
= lang_output_section_find_1 (name
, constraint
);
1017 lookup
= new_stat (lang_output_section_statement
, stat_ptr
);
1018 lookup
->region
= NULL
;
1019 lookup
->lma_region
= NULL
;
1021 lookup
->block_value
= 1;
1022 lookup
->name
= name
;
1024 lookup
->next
= NULL
;
1025 lookup
->bfd_section
= NULL
;
1026 lookup
->processed
= 0;
1027 lookup
->constraint
= constraint
;
1028 lookup
->ignored
= FALSE
;
1029 lookup
->sectype
= normal_section
;
1030 lookup
->addr_tree
= NULL
;
1031 lang_list_init (&lookup
->children
);
1033 lookup
->memspec
= NULL
;
1035 lookup
->subsection_alignment
= -1;
1036 lookup
->section_alignment
= -1;
1037 lookup
->load_base
= NULL
;
1038 lookup
->update_dot_tree
= NULL
;
1039 lookup
->phdrs
= NULL
;
1041 lang_statement_append (&lang_output_section_statement
,
1042 (lang_statement_union_type
*) lookup
,
1043 (lang_statement_union_type
**) &lookup
->next
);
1048 lang_output_section_statement_type
*
1049 lang_output_section_statement_lookup (const char *const name
)
1051 return lang_output_section_statement_lookup_1 (name
, 0);
1054 /* A variant of lang_output_section_find used by place_orphan.
1055 Returns the output statement that should precede a new output
1056 statement for SEC. If an exact match is found on certain flags,
1059 lang_output_section_statement_type
*
1060 lang_output_section_find_by_flags (const asection
*sec
,
1061 lang_output_section_statement_type
**exact
)
1063 lang_output_section_statement_type
*first
, *look
, *found
;
1066 /* We know the first statement on this list is *ABS*. May as well
1068 first
= &lang_output_section_statement
.head
->output_section_statement
;
1069 first
= first
->next
;
1071 /* First try for an exact match. */
1073 for (look
= first
; look
; look
= look
->next
)
1075 flags
= look
->flags
;
1076 if (look
->bfd_section
!= NULL
)
1077 flags
= look
->bfd_section
->flags
;
1078 flags
^= sec
->flags
;
1079 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1080 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1089 if (sec
->flags
& SEC_CODE
)
1091 /* Try for a rw code section. */
1092 for (look
= first
; look
; look
= look
->next
)
1094 flags
= look
->flags
;
1095 if (look
->bfd_section
!= NULL
)
1096 flags
= look
->bfd_section
->flags
;
1097 flags
^= sec
->flags
;
1098 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1099 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1105 if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1107 /* .rodata can go after .text, .sdata2 after .rodata. */
1108 for (look
= first
; look
; look
= look
->next
)
1110 flags
= look
->flags
;
1111 if (look
->bfd_section
!= NULL
)
1112 flags
= look
->bfd_section
->flags
;
1113 flags
^= sec
->flags
;
1114 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1116 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1122 if (sec
->flags
& SEC_SMALL_DATA
)
1124 /* .sdata goes after .data, .sbss after .sdata. */
1125 for (look
= first
; look
; look
= look
->next
)
1127 flags
= look
->flags
;
1128 if (look
->bfd_section
!= NULL
)
1129 flags
= look
->bfd_section
->flags
;
1130 flags
^= sec
->flags
;
1131 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1132 | SEC_THREAD_LOCAL
))
1133 || ((look
->flags
& SEC_SMALL_DATA
)
1134 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1140 if (sec
->flags
& SEC_HAS_CONTENTS
)
1142 /* .data goes after .rodata. */
1143 for (look
= first
; look
; look
= look
->next
)
1145 flags
= look
->flags
;
1146 if (look
->bfd_section
!= NULL
)
1147 flags
= look
->bfd_section
->flags
;
1148 flags
^= sec
->flags
;
1149 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1150 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1156 /* .bss goes last. */
1157 for (look
= first
; look
; look
= look
->next
)
1159 flags
= look
->flags
;
1160 if (look
->bfd_section
!= NULL
)
1161 flags
= look
->bfd_section
->flags
;
1162 flags
^= sec
->flags
;
1163 if (!(flags
& SEC_ALLOC
))
1170 /* Find the last output section before given output statement.
1171 Used by place_orphan. */
1174 output_prev_sec_find (lang_output_section_statement_type
*os
)
1176 asection
*s
= (asection
*) NULL
;
1177 lang_output_section_statement_type
*lookup
;
1179 for (lookup
= &lang_output_section_statement
.head
->output_section_statement
;
1181 lookup
= lookup
->next
)
1183 if (lookup
->constraint
== -1)
1188 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1189 s
= lookup
->bfd_section
;
1195 lang_output_section_statement_type
*
1196 lang_insert_orphan (lang_input_statement_type
*file
,
1198 const char *secname
,
1199 lang_output_section_statement_type
*after
,
1200 struct orphan_save
*place
,
1201 etree_type
*address
,
1202 lang_statement_list_type
*add_child
)
1204 lang_statement_list_type
*old
;
1205 lang_statement_list_type add
;
1207 etree_type
*load_base
;
1208 lang_output_section_statement_type
*os
;
1209 lang_output_section_statement_type
**os_tail
;
1211 /* Start building a list of statements for this section.
1212 First save the current statement pointer. */
1215 /* If we have found an appropriate place for the output section
1216 statements for this orphan, add them to our own private list,
1217 inserting them later into the global statement list. */
1221 lang_list_init (stat_ptr
);
1225 if (config
.build_constructors
)
1227 /* If the name of the section is representable in C, then create
1228 symbols to mark the start and the end of the section. */
1229 for (ps
= secname
; *ps
!= '\0'; ps
++)
1230 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1235 etree_type
*e_align
;
1237 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1238 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1239 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1240 e_align
= exp_unop (ALIGN_K
,
1241 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1242 lang_add_assignment (exp_assop ('=', ".", e_align
));
1243 lang_add_assignment (exp_assop ('=', symname
,
1244 exp_nameop (NAME
, ".")));
1248 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1249 address
= exp_intop (0);
1252 if (after
!= NULL
&& after
->load_base
!= NULL
)
1254 etree_type
*lma_from_vma
;
1255 lma_from_vma
= exp_binop ('-', after
->load_base
,
1256 exp_nameop (ADDR
, after
->name
));
1257 load_base
= exp_binop ('+', lma_from_vma
,
1258 exp_nameop (ADDR
, secname
));
1261 os_tail
= ((lang_output_section_statement_type
**)
1262 lang_output_section_statement
.tail
);
1263 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1266 if (add_child
== NULL
)
1267 add_child
= &os
->children
;
1268 lang_add_section (add_child
, s
, os
, file
);
1270 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1272 if (config
.build_constructors
&& *ps
== '\0')
1276 /* lang_leave_ouput_section_statement resets stat_ptr.
1277 Put stat_ptr back where we want it. */
1281 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1282 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1283 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1284 lang_add_assignment (exp_assop ('=', symname
,
1285 exp_nameop (NAME
, ".")));
1288 /* Restore the global list pointer. */
1292 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1294 asection
*snew
, *as
;
1296 snew
= os
->bfd_section
;
1298 /* Shuffle the bfd section list to make the output file look
1299 neater. This is really only cosmetic. */
1300 if (place
->section
== NULL
1301 && after
!= (&lang_output_section_statement
.head
1302 ->output_section_statement
))
1304 asection
*bfd_section
= after
->bfd_section
;
1306 /* If the output statement hasn't been used to place any input
1307 sections (and thus doesn't have an output bfd_section),
1308 look for the closest prior output statement having an
1310 if (bfd_section
== NULL
)
1311 bfd_section
= output_prev_sec_find (after
);
1313 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1314 place
->section
= &bfd_section
->next
;
1317 if (place
->section
== NULL
)
1318 place
->section
= &output_bfd
->sections
;
1320 as
= *place
->section
;
1321 if (as
!= snew
&& as
->prev
!= snew
)
1323 /* Unlink the section. */
1324 bfd_section_list_remove (output_bfd
, snew
);
1326 /* Now tack it back on in the right place. */
1327 bfd_section_list_insert_before (output_bfd
, as
, snew
);
1330 /* Save the end of this list. Further ophans of this type will
1331 follow the one we've just added. */
1332 place
->section
= &snew
->next
;
1334 /* The following is non-cosmetic. We try to put the output
1335 statements in some sort of reasonable order here, because they
1336 determine the final load addresses of the orphan sections.
1337 In addition, placing output statements in the wrong order may
1338 require extra segments. For instance, given a typical
1339 situation of all read-only sections placed in one segment and
1340 following that a segment containing all the read-write
1341 sections, we wouldn't want to place an orphan read/write
1342 section before or amongst the read-only ones. */
1343 if (add
.head
!= NULL
)
1345 lang_output_section_statement_type
*newly_added_os
;
1347 if (place
->stmt
== NULL
)
1349 lang_statement_union_type
**where
;
1350 lang_statement_union_type
**assign
= NULL
;
1352 /* Look for a suitable place for the new statement list.
1353 The idea is to skip over anything that might be inside
1354 a SECTIONS {} statement in a script, before we find
1355 another output_section_statement. Assignments to "dot"
1356 before an output section statement are assumed to
1358 for (where
= &after
->header
.next
;
1360 where
= &(*where
)->header
.next
)
1362 switch ((*where
)->header
.type
)
1364 case lang_assignment_statement_enum
:
1367 lang_assignment_statement_type
*ass
;
1368 ass
= &(*where
)->assignment_statement
;
1369 if (ass
->exp
->type
.node_class
!= etree_assert
1370 && ass
->exp
->assign
.dst
[0] == '.'
1371 && ass
->exp
->assign
.dst
[1] == 0)
1375 case lang_wild_statement_enum
:
1376 case lang_input_section_enum
:
1377 case lang_object_symbols_statement_enum
:
1378 case lang_fill_statement_enum
:
1379 case lang_data_statement_enum
:
1380 case lang_reloc_statement_enum
:
1381 case lang_padding_statement_enum
:
1382 case lang_constructors_statement_enum
:
1385 case lang_output_section_statement_enum
:
1388 case lang_input_statement_enum
:
1389 case lang_address_statement_enum
:
1390 case lang_target_statement_enum
:
1391 case lang_output_statement_enum
:
1392 case lang_group_statement_enum
:
1393 case lang_afile_asection_pair_statement_enum
:
1402 place
->os_tail
= &after
->next
;
1406 /* Put it after the last orphan statement we added. */
1407 *add
.tail
= *place
->stmt
;
1408 *place
->stmt
= add
.head
;
1411 /* Fix the global list pointer if we happened to tack our
1412 new list at the tail. */
1413 if (*old
->tail
== add
.head
)
1414 old
->tail
= add
.tail
;
1416 /* Save the end of this list. */
1417 place
->stmt
= add
.tail
;
1419 /* Do the same for the list of output section statements. */
1420 newly_added_os
= *os_tail
;
1422 newly_added_os
->next
= *place
->os_tail
;
1423 *place
->os_tail
= newly_added_os
;
1424 place
->os_tail
= &newly_added_os
->next
;
1426 /* Fixing the global list pointer here is a little different.
1427 We added to the list in lang_enter_output_section_statement,
1428 trimmed off the new output_section_statment above when
1429 assigning *os_tail = NULL, but possibly added it back in
1430 the same place when assigning *place->os_tail. */
1431 if (*os_tail
== NULL
)
1432 lang_output_section_statement
.tail
1433 = (lang_statement_union_type
**) os_tail
;
1440 lang_map_flags (flagword flag
)
1442 if (flag
& SEC_ALLOC
)
1445 if (flag
& SEC_CODE
)
1448 if (flag
& SEC_READONLY
)
1451 if (flag
& SEC_DATA
)
1454 if (flag
& SEC_LOAD
)
1461 lang_memory_region_type
*m
;
1464 minfo (_("\nMemory Configuration\n\n"));
1465 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1466 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1468 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1473 fprintf (config
.map_file
, "%-16s ", m
->name
);
1475 sprintf_vma (buf
, m
->origin
);
1476 minfo ("0x%s ", buf
);
1484 minfo ("0x%V", m
->length
);
1485 if (m
->flags
|| m
->not_flags
)
1493 lang_map_flags (m
->flags
);
1499 lang_map_flags (m
->not_flags
);
1506 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1508 if (! command_line
.reduce_memory_overheads
)
1510 obstack_begin (&map_obstack
, 1000);
1511 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1512 bfd_map_over_sections (p
, init_map_userdata
, 0);
1513 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1515 print_statements ();
1519 init_map_userdata (abfd
, sec
, data
)
1520 bfd
*abfd ATTRIBUTE_UNUSED
;
1522 void *data ATTRIBUTE_UNUSED
;
1524 fat_section_userdata_type
*new_data
1525 = ((fat_section_userdata_type
*) (stat_alloc
1526 (sizeof (fat_section_userdata_type
))));
1528 ASSERT (get_userdata (sec
) == NULL
);
1529 get_userdata (sec
) = new_data
;
1530 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1534 sort_def_symbol (hash_entry
, info
)
1535 struct bfd_link_hash_entry
*hash_entry
;
1536 void *info ATTRIBUTE_UNUSED
;
1538 if (hash_entry
->type
== bfd_link_hash_defined
1539 || hash_entry
->type
== bfd_link_hash_defweak
)
1541 struct fat_user_section_struct
*ud
;
1542 struct map_symbol_def
*def
;
1544 ud
= get_userdata (hash_entry
->u
.def
.section
);
1547 /* ??? What do we have to do to initialize this beforehand? */
1548 /* The first time we get here is bfd_abs_section... */
1549 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1550 ud
= get_userdata (hash_entry
->u
.def
.section
);
1552 else if (!ud
->map_symbol_def_tail
)
1553 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1555 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1556 def
->entry
= hash_entry
;
1557 *(ud
->map_symbol_def_tail
) = def
;
1558 ud
->map_symbol_def_tail
= &def
->next
;
1563 /* Initialize an output section. */
1566 init_os (lang_output_section_statement_type
*s
)
1568 if (s
->bfd_section
!= NULL
)
1571 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1572 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1574 s
->bfd_section
= bfd_get_section_by_name (output_bfd
, s
->name
);
1575 if (s
->bfd_section
== NULL
)
1576 s
->bfd_section
= bfd_make_section (output_bfd
, s
->name
);
1577 if (s
->bfd_section
== NULL
)
1579 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1580 output_bfd
->xvec
->name
, s
->name
);
1582 s
->bfd_section
->output_section
= s
->bfd_section
;
1584 /* We initialize an output sections output offset to minus its own
1585 vma to allow us to output a section through itself. */
1586 s
->bfd_section
->output_offset
= 0;
1587 if (!command_line
.reduce_memory_overheads
)
1589 fat_section_userdata_type
*new
1590 = stat_alloc (sizeof (fat_section_userdata_type
));
1591 memset (new, 0, sizeof (fat_section_userdata_type
));
1592 get_userdata (s
->bfd_section
) = new;
1596 /* If there is a base address, make sure that any sections it might
1597 mention are initialized. */
1598 if (s
->addr_tree
!= NULL
)
1599 exp_init_os (s
->addr_tree
);
1601 if (s
->load_base
!= NULL
)
1602 exp_init_os (s
->load_base
);
1605 /* Make sure that all output sections mentioned in an expression are
1609 exp_init_os (etree_type
*exp
)
1611 switch (exp
->type
.node_class
)
1614 exp_init_os (exp
->assign
.src
);
1618 exp_init_os (exp
->binary
.lhs
);
1619 exp_init_os (exp
->binary
.rhs
);
1623 exp_init_os (exp
->trinary
.cond
);
1624 exp_init_os (exp
->trinary
.lhs
);
1625 exp_init_os (exp
->trinary
.rhs
);
1629 exp_init_os (exp
->assert_s
.child
);
1633 exp_init_os (exp
->unary
.child
);
1637 switch (exp
->type
.node_code
)
1643 lang_output_section_statement_type
*os
;
1645 os
= lang_output_section_find (exp
->name
.name
);
1646 if (os
!= NULL
&& os
->bfd_section
== NULL
)
1658 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
1660 lang_input_statement_type
*entry
= data
;
1662 /* If we are only reading symbols from this object, then we want to
1663 discard all sections. */
1664 if (entry
->just_syms_flag
)
1666 bfd_link_just_syms (abfd
, sec
, &link_info
);
1670 if (!(abfd
->flags
& DYNAMIC
))
1671 bfd_section_already_linked (abfd
, sec
);
1674 /* The wild routines.
1676 These expand statements like *(.text) and foo.o to a list of
1677 explicit actions, like foo.o(.text), bar.o(.text) and
1678 foo.o(.text, .data). */
1680 /* Add SECTION to the output section OUTPUT. Do this by creating a
1681 lang_input_section statement which is placed at PTR. FILE is the
1682 input file which holds SECTION. */
1685 lang_add_section (lang_statement_list_type
*ptr
,
1687 lang_output_section_statement_type
*output
,
1688 lang_input_statement_type
*file
)
1690 flagword flags
= section
->flags
;
1691 bfd_boolean discard
;
1693 /* Discard sections marked with SEC_EXCLUDE. */
1694 discard
= (flags
& SEC_EXCLUDE
) != 0;
1696 /* Discard input sections which are assigned to a section named
1697 DISCARD_SECTION_NAME. */
1698 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
1701 /* Discard debugging sections if we are stripping debugging
1703 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
1704 && (flags
& SEC_DEBUGGING
) != 0)
1709 if (section
->output_section
== NULL
)
1711 /* This prevents future calls from assigning this section. */
1712 section
->output_section
= bfd_abs_section_ptr
;
1717 if (section
->output_section
== NULL
)
1720 lang_input_section_type
*new;
1723 if (output
->bfd_section
== NULL
)
1726 first
= ! output
->bfd_section
->linker_has_input
;
1727 output
->bfd_section
->linker_has_input
= 1;
1729 if (!link_info
.relocatable
1730 && !stripped_excluded_sections
)
1732 asection
*s
= output
->bfd_section
->map_tail
.s
;
1733 output
->bfd_section
->map_tail
.s
= section
;
1734 section
->map_head
.s
= NULL
;
1735 section
->map_tail
.s
= s
;
1737 s
->map_head
.s
= section
;
1739 output
->bfd_section
->map_head
.s
= section
;
1742 /* Add a section reference to the list. */
1743 new = new_stat (lang_input_section
, ptr
);
1745 new->section
= section
;
1747 section
->output_section
= output
->bfd_section
;
1749 flags
= section
->flags
;
1751 /* We don't copy the SEC_NEVER_LOAD flag from an input section
1752 to an output section, because we want to be able to include a
1753 SEC_NEVER_LOAD section in the middle of an otherwise loaded
1754 section (I don't know why we want to do this, but we do).
1755 build_link_order in ldwrite.c handles this case by turning
1756 the embedded SEC_NEVER_LOAD section into a fill. */
1758 flags
&= ~ SEC_NEVER_LOAD
;
1760 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
1761 already been processed. One reason to do this is that on pe
1762 format targets, .text$foo sections go into .text and it's odd
1763 to see .text with SEC_LINK_ONCE set. */
1765 if (! link_info
.relocatable
)
1766 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
1768 /* If this is not the first input section, and the SEC_READONLY
1769 flag is not currently set, then don't set it just because the
1770 input section has it set. */
1772 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
1773 flags
&= ~ SEC_READONLY
;
1775 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
1777 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
1778 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
1779 || ((flags
& SEC_MERGE
)
1780 && output
->bfd_section
->entsize
!= section
->entsize
)))
1782 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1783 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1786 output
->bfd_section
->flags
|= flags
;
1788 if (flags
& SEC_MERGE
)
1789 output
->bfd_section
->entsize
= section
->entsize
;
1791 /* If SEC_READONLY is not set in the input section, then clear
1792 it from the output section. */
1793 if ((section
->flags
& SEC_READONLY
) == 0)
1794 output
->bfd_section
->flags
&= ~SEC_READONLY
;
1796 switch (output
->sectype
)
1798 case normal_section
:
1803 case overlay_section
:
1804 output
->bfd_section
->flags
&= ~SEC_ALLOC
;
1806 case noload_section
:
1807 output
->bfd_section
->flags
&= ~SEC_LOAD
;
1808 output
->bfd_section
->flags
|= SEC_NEVER_LOAD
;
1812 /* Copy over SEC_SMALL_DATA. */
1813 if (section
->flags
& SEC_SMALL_DATA
)
1814 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
1816 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
1817 output
->bfd_section
->alignment_power
= section
->alignment_power
;
1819 /* If supplied an alignment, then force it. */
1820 if (output
->section_alignment
!= -1)
1821 output
->bfd_section
->alignment_power
= output
->section_alignment
;
1823 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
1824 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
1826 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
1827 /* FIXME: This value should really be obtained from the bfd... */
1828 output
->block_value
= 128;
1833 /* Compare sections ASEC and BSEC according to SORT. */
1836 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
1845 case by_alignment_name
:
1846 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
1847 - bfd_section_alignment (asec
->owner
, asec
));
1853 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
1854 bfd_get_section_name (bsec
->owner
, bsec
));
1857 case by_name_alignment
:
1858 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
1859 bfd_get_section_name (bsec
->owner
, bsec
));
1865 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
1866 - bfd_section_alignment (asec
->owner
, asec
));
1873 /* Handle wildcard sorting. This returns the lang_input_section which
1874 should follow the one we are going to create for SECTION and FILE,
1875 based on the sorting requirements of WILD. It returns NULL if the
1876 new section should just go at the end of the current list. */
1878 static lang_statement_union_type
*
1879 wild_sort (lang_wild_statement_type
*wild
,
1880 struct wildcard_list
*sec
,
1881 lang_input_statement_type
*file
,
1884 const char *section_name
;
1885 lang_statement_union_type
*l
;
1887 if (!wild
->filenames_sorted
1888 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
1891 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
1892 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
1894 lang_input_section_type
*ls
;
1896 if (l
->header
.type
!= lang_input_section_enum
)
1898 ls
= &l
->input_section
;
1900 /* Sorting by filename takes precedence over sorting by section
1903 if (wild
->filenames_sorted
)
1905 const char *fn
, *ln
;
1909 /* The PE support for the .idata section as generated by
1910 dlltool assumes that files will be sorted by the name of
1911 the archive and then the name of the file within the
1914 if (file
->the_bfd
!= NULL
1915 && bfd_my_archive (file
->the_bfd
) != NULL
)
1917 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
1922 fn
= file
->filename
;
1926 if (ls
->ifile
->the_bfd
!= NULL
1927 && bfd_my_archive (ls
->ifile
->the_bfd
) != NULL
)
1929 ln
= bfd_get_filename (bfd_my_archive (ls
->ifile
->the_bfd
));
1934 ln
= ls
->ifile
->filename
;
1938 i
= strcmp (fn
, ln
);
1947 fn
= file
->filename
;
1949 ln
= ls
->ifile
->filename
;
1951 i
= strcmp (fn
, ln
);
1959 /* Here either the files are not sorted by name, or we are
1960 looking at the sections for this file. */
1962 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
1964 if (compare_section (sec
->spec
.sorted
, section
,
1973 /* Expand a wild statement for a particular FILE. SECTION may be
1974 NULL, in which case it is a wild card. */
1977 output_section_callback (lang_wild_statement_type
*ptr
,
1978 struct wildcard_list
*sec
,
1980 lang_input_statement_type
*file
,
1983 lang_statement_union_type
*before
;
1985 /* Exclude sections that match UNIQUE_SECTION_LIST. */
1986 if (unique_section_p (section
))
1989 before
= wild_sort (ptr
, sec
, file
, section
);
1991 /* Here BEFORE points to the lang_input_section which
1992 should follow the one we are about to add. If BEFORE
1993 is NULL, then the section should just go at the end
1994 of the current list. */
1997 lang_add_section (&ptr
->children
, section
,
1998 (lang_output_section_statement_type
*) output
,
2002 lang_statement_list_type list
;
2003 lang_statement_union_type
**pp
;
2005 lang_list_init (&list
);
2006 lang_add_section (&list
, section
,
2007 (lang_output_section_statement_type
*) output
,
2010 /* If we are discarding the section, LIST.HEAD will
2012 if (list
.head
!= NULL
)
2014 ASSERT (list
.head
->header
.next
== NULL
);
2016 for (pp
= &ptr
->children
.head
;
2018 pp
= &(*pp
)->header
.next
)
2019 ASSERT (*pp
!= NULL
);
2021 list
.head
->header
.next
= *pp
;
2027 /* Check if all sections in a wild statement for a particular FILE
2031 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2032 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2034 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2037 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2038 if (unique_section_p (section
))
2041 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2042 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2045 /* This is passed a file name which must have been seen already and
2046 added to the statement tree. We will see if it has been opened
2047 already and had its symbols read. If not then we'll read it. */
2049 static lang_input_statement_type
*
2050 lookup_name (const char *name
)
2052 lang_input_statement_type
*search
;
2054 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2056 search
= (lang_input_statement_type
*) search
->next_real_file
)
2058 /* Use the local_sym_name as the name of the file that has
2059 already been loaded as filename might have been transformed
2060 via the search directory lookup mechanism. */
2061 const char * filename
= search
->local_sym_name
;
2063 if (filename
== NULL
&& name
== NULL
)
2065 if (filename
!= NULL
2067 && strcmp (filename
, name
) == 0)
2072 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2073 default_target
, FALSE
);
2075 /* If we have already added this file, or this file is not real
2076 (FIXME: can that ever actually happen?) or the name is NULL
2077 (FIXME: can that ever actually happen?) don't add this file. */
2080 || search
->filename
== NULL
)
2083 if (! load_symbols (search
, NULL
))
2089 /* Save LIST as a list of libraries whose symbols should not be exported. */
2094 struct excluded_lib
*next
;
2096 static struct excluded_lib
*excluded_libs
;
2099 add_excluded_libs (const char *list
)
2101 const char *p
= list
, *end
;
2105 struct excluded_lib
*entry
;
2106 end
= strpbrk (p
, ",:");
2108 end
= p
+ strlen (p
);
2109 entry
= xmalloc (sizeof (*entry
));
2110 entry
->next
= excluded_libs
;
2111 entry
->name
= xmalloc (end
- p
+ 1);
2112 memcpy (entry
->name
, p
, end
- p
);
2113 entry
->name
[end
- p
] = '\0';
2114 excluded_libs
= entry
;
2122 check_excluded_libs (bfd
*abfd
)
2124 struct excluded_lib
*lib
= excluded_libs
;
2128 int len
= strlen (lib
->name
);
2129 const char *filename
= lbasename (abfd
->filename
);
2131 if (strcmp (lib
->name
, "ALL") == 0)
2133 abfd
->no_export
= TRUE
;
2137 if (strncmp (lib
->name
, filename
, len
) == 0
2138 && (filename
[len
] == '\0'
2139 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2140 && filename
[len
+ 2] == '\0')))
2142 abfd
->no_export
= TRUE
;
2150 /* Get the symbols for an input file. */
2153 load_symbols (lang_input_statement_type
*entry
,
2154 lang_statement_list_type
*place
)
2161 ldfile_open_file (entry
);
2163 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2164 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2167 lang_statement_list_type
*hold
;
2168 bfd_boolean bad_load
= TRUE
;
2169 bfd_boolean save_ldlang_sysrooted_script
;
2171 err
= bfd_get_error ();
2173 /* See if the emulation has some special knowledge. */
2174 if (ldemul_unrecognized_file (entry
))
2177 if (err
== bfd_error_file_ambiguously_recognized
)
2181 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2182 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2183 for (p
= matching
; *p
!= NULL
; p
++)
2187 else if (err
!= bfd_error_file_not_recognized
2189 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2193 bfd_close (entry
->the_bfd
);
2194 entry
->the_bfd
= NULL
;
2196 /* Try to interpret the file as a linker script. */
2197 ldfile_open_command_file (entry
->filename
);
2201 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2202 ldlang_sysrooted_script
= entry
->sysrooted
;
2204 ldfile_assumed_script
= TRUE
;
2205 parser_input
= input_script
;
2206 /* We want to use the same -Bdynamic/-Bstatic as the one for
2208 config
.dynamic_link
= entry
->dynamic
;
2210 ldfile_assumed_script
= FALSE
;
2212 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2218 if (ldemul_recognized_file (entry
))
2221 /* We don't call ldlang_add_file for an archive. Instead, the
2222 add_symbols entry point will call ldlang_add_file, via the
2223 add_archive_element callback, for each element of the archive
2225 switch (bfd_get_format (entry
->the_bfd
))
2231 ldlang_add_file (entry
);
2232 if (trace_files
|| trace_file_tries
)
2233 info_msg ("%I\n", entry
);
2237 check_excluded_libs (entry
->the_bfd
);
2239 if (entry
->whole_archive
)
2242 bfd_boolean loaded
= TRUE
;
2246 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2251 if (! bfd_check_format (member
, bfd_object
))
2253 einfo (_("%F%B: member %B in archive is not an object\n"),
2254 entry
->the_bfd
, member
);
2258 if (! ((*link_info
.callbacks
->add_archive_element
)
2259 (&link_info
, member
, "--whole-archive")))
2262 if (! bfd_link_add_symbols (member
, &link_info
))
2264 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2269 entry
->loaded
= loaded
;
2275 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2276 entry
->loaded
= TRUE
;
2278 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2280 return entry
->loaded
;
2283 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2284 may be NULL, indicating that it is a wildcard. Separate
2285 lang_input_section statements are created for each part of the
2286 expansion; they are added after the wild statement S. OUTPUT is
2287 the output section. */
2290 wild (lang_wild_statement_type
*s
,
2291 const char *target ATTRIBUTE_UNUSED
,
2292 lang_output_section_statement_type
*output
)
2294 struct wildcard_list
*sec
;
2296 walk_wild (s
, output_section_callback
, output
);
2298 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2300 if (default_common_section
!= NULL
)
2302 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2304 /* Remember the section that common is going to in case we
2305 later get something which doesn't know where to put it. */
2306 default_common_section
= output
;
2311 /* Return TRUE iff target is the sought target. */
2314 get_target (const bfd_target
*target
, void *data
)
2316 const char *sought
= data
;
2318 return strcmp (target
->name
, sought
) == 0;
2321 /* Like strcpy() but convert to lower case as well. */
2324 stricpy (char *dest
, char *src
)
2328 while ((c
= *src
++) != 0)
2329 *dest
++ = TOLOWER (c
);
2334 /* Remove the first occurrence of needle (if any) in haystack
2338 strcut (char *haystack
, char *needle
)
2340 haystack
= strstr (haystack
, needle
);
2346 for (src
= haystack
+ strlen (needle
); *src
;)
2347 *haystack
++ = *src
++;
2353 /* Compare two target format name strings.
2354 Return a value indicating how "similar" they are. */
2357 name_compare (char *first
, char *second
)
2363 copy1
= xmalloc (strlen (first
) + 1);
2364 copy2
= xmalloc (strlen (second
) + 1);
2366 /* Convert the names to lower case. */
2367 stricpy (copy1
, first
);
2368 stricpy (copy2
, second
);
2370 /* Remove size and endian strings from the name. */
2371 strcut (copy1
, "big");
2372 strcut (copy1
, "little");
2373 strcut (copy2
, "big");
2374 strcut (copy2
, "little");
2376 /* Return a value based on how many characters match,
2377 starting from the beginning. If both strings are
2378 the same then return 10 * their length. */
2379 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2380 if (copy1
[result
] == 0)
2392 /* Set by closest_target_match() below. */
2393 static const bfd_target
*winner
;
2395 /* Scan all the valid bfd targets looking for one that has the endianness
2396 requirement that was specified on the command line, and is the nearest
2397 match to the original output target. */
2400 closest_target_match (const bfd_target
*target
, void *data
)
2402 const bfd_target
*original
= data
;
2404 if (command_line
.endian
== ENDIAN_BIG
2405 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2408 if (command_line
.endian
== ENDIAN_LITTLE
2409 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2412 /* Must be the same flavour. */
2413 if (target
->flavour
!= original
->flavour
)
2416 /* If we have not found a potential winner yet, then record this one. */
2423 /* Oh dear, we now have two potential candidates for a successful match.
2424 Compare their names and choose the better one. */
2425 if (name_compare (target
->name
, original
->name
)
2426 > name_compare (winner
->name
, original
->name
))
2429 /* Keep on searching until wqe have checked them all. */
2433 /* Return the BFD target format of the first input file. */
2436 get_first_input_target (void)
2438 char *target
= NULL
;
2440 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2442 if (s
->header
.type
== lang_input_statement_enum
2445 ldfile_open_file (s
);
2447 if (s
->the_bfd
!= NULL
2448 && bfd_check_format (s
->the_bfd
, bfd_object
))
2450 target
= bfd_get_target (s
->the_bfd
);
2462 lang_get_output_target (void)
2466 /* Has the user told us which output format to use? */
2467 if (output_target
!= NULL
)
2468 return output_target
;
2470 /* No - has the current target been set to something other than
2472 if (current_target
!= default_target
)
2473 return current_target
;
2475 /* No - can we determine the format of the first input file? */
2476 target
= get_first_input_target ();
2480 /* Failed - use the default output target. */
2481 return default_target
;
2484 /* Open the output file. */
2487 open_output (const char *name
)
2491 output_target
= lang_get_output_target ();
2493 /* Has the user requested a particular endianness on the command
2495 if (command_line
.endian
!= ENDIAN_UNSET
)
2497 const bfd_target
*target
;
2498 enum bfd_endian desired_endian
;
2500 /* Get the chosen target. */
2501 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2503 /* If the target is not supported, we cannot do anything. */
2506 if (command_line
.endian
== ENDIAN_BIG
)
2507 desired_endian
= BFD_ENDIAN_BIG
;
2509 desired_endian
= BFD_ENDIAN_LITTLE
;
2511 /* See if the target has the wrong endianness. This should
2512 not happen if the linker script has provided big and
2513 little endian alternatives, but some scrips don't do
2515 if (target
->byteorder
!= desired_endian
)
2517 /* If it does, then see if the target provides
2518 an alternative with the correct endianness. */
2519 if (target
->alternative_target
!= NULL
2520 && (target
->alternative_target
->byteorder
== desired_endian
))
2521 output_target
= target
->alternative_target
->name
;
2524 /* Try to find a target as similar as possible to
2525 the default target, but which has the desired
2526 endian characteristic. */
2527 bfd_search_for_target (closest_target_match
,
2530 /* Oh dear - we could not find any targets that
2531 satisfy our requirements. */
2533 einfo (_("%P: warning: could not find any targets"
2534 " that match endianness requirement\n"));
2536 output_target
= winner
->name
;
2542 output
= bfd_openw (name
, output_target
);
2546 if (bfd_get_error () == bfd_error_invalid_target
)
2547 einfo (_("%P%F: target %s not found\n"), output_target
);
2549 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2552 delete_output_file_on_failure
= TRUE
;
2554 if (! bfd_set_format (output
, bfd_object
))
2555 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2556 if (! bfd_set_arch_mach (output
,
2557 ldfile_output_architecture
,
2558 ldfile_output_machine
))
2559 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2561 link_info
.hash
= bfd_link_hash_table_create (output
);
2562 if (link_info
.hash
== NULL
)
2563 einfo (_("%P%F: can not create link hash table: %E\n"));
2565 bfd_set_gp_size (output
, g_switch_value
);
2570 ldlang_open_output (lang_statement_union_type
*statement
)
2572 switch (statement
->header
.type
)
2574 case lang_output_statement_enum
:
2575 ASSERT (output_bfd
== NULL
);
2576 output_bfd
= open_output (statement
->output_statement
.name
);
2577 ldemul_set_output_arch ();
2578 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2579 output_bfd
->flags
|= D_PAGED
;
2581 output_bfd
->flags
&= ~D_PAGED
;
2582 if (config
.text_read_only
)
2583 output_bfd
->flags
|= WP_TEXT
;
2585 output_bfd
->flags
&= ~WP_TEXT
;
2586 if (link_info
.traditional_format
)
2587 output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2589 output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2592 case lang_target_statement_enum
:
2593 current_target
= statement
->target_statement
.target
;
2600 /* Convert between addresses in bytes and sizes in octets.
2601 For currently supported targets, octets_per_byte is always a power
2602 of two, so we can use shifts. */
2603 #define TO_ADDR(X) ((X) >> opb_shift)
2604 #define TO_SIZE(X) ((X) << opb_shift)
2606 /* Support the above. */
2607 static unsigned int opb_shift
= 0;
2612 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2613 ldfile_output_machine
);
2616 while ((x
& 1) == 0)
2624 /* Open all the input files. */
2627 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2629 for (; s
!= NULL
; s
= s
->header
.next
)
2631 switch (s
->header
.type
)
2633 case lang_constructors_statement_enum
:
2634 open_input_bfds (constructor_list
.head
, force
);
2636 case lang_output_section_statement_enum
:
2637 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2639 case lang_wild_statement_enum
:
2640 /* Maybe we should load the file's symbols. */
2641 if (s
->wild_statement
.filename
2642 && ! wildcardp (s
->wild_statement
.filename
))
2643 lookup_name (s
->wild_statement
.filename
);
2644 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2646 case lang_group_statement_enum
:
2648 struct bfd_link_hash_entry
*undefs
;
2650 /* We must continually search the entries in the group
2651 until no new symbols are added to the list of undefined
2656 undefs
= link_info
.hash
->undefs_tail
;
2657 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2659 while (undefs
!= link_info
.hash
->undefs_tail
);
2662 case lang_target_statement_enum
:
2663 current_target
= s
->target_statement
.target
;
2665 case lang_input_statement_enum
:
2666 if (s
->input_statement
.real
)
2668 lang_statement_list_type add
;
2670 s
->input_statement
.target
= current_target
;
2672 /* If we are being called from within a group, and this
2673 is an archive which has already been searched, then
2674 force it to be researched unless the whole archive
2675 has been loaded already. */
2677 && !s
->input_statement
.whole_archive
2678 && s
->input_statement
.loaded
2679 && bfd_check_format (s
->input_statement
.the_bfd
,
2681 s
->input_statement
.loaded
= FALSE
;
2683 lang_list_init (&add
);
2685 if (! load_symbols (&s
->input_statement
, &add
))
2686 config
.make_executable
= FALSE
;
2688 if (add
.head
!= NULL
)
2690 *add
.tail
= s
->header
.next
;
2691 s
->header
.next
= add
.head
;
2701 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2704 lang_track_definedness (const char *name
)
2706 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2707 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2710 /* New-function for the definedness hash table. */
2712 static struct bfd_hash_entry
*
2713 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2714 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2715 const char *name ATTRIBUTE_UNUSED
)
2717 struct lang_definedness_hash_entry
*ret
2718 = (struct lang_definedness_hash_entry
*) entry
;
2721 ret
= (struct lang_definedness_hash_entry
*)
2722 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
2725 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
2727 ret
->iteration
= -1;
2731 /* Return the iteration when the definition of NAME was last updated. A
2732 value of -1 means that the symbol is not defined in the linker script
2733 or the command line, but may be defined in the linker symbol table. */
2736 lang_symbol_definition_iteration (const char *name
)
2738 struct lang_definedness_hash_entry
*defentry
2739 = (struct lang_definedness_hash_entry
*)
2740 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2742 /* We've already created this one on the presence of DEFINED in the
2743 script, so it can't be NULL unless something is borked elsewhere in
2745 if (defentry
== NULL
)
2748 return defentry
->iteration
;
2751 /* Update the definedness state of NAME. */
2754 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
2756 struct lang_definedness_hash_entry
*defentry
2757 = (struct lang_definedness_hash_entry
*)
2758 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2760 /* We don't keep track of symbols not tested with DEFINED. */
2761 if (defentry
== NULL
)
2764 /* If the symbol was already defined, and not from an earlier statement
2765 iteration, don't update the definedness iteration, because that'd
2766 make the symbol seem defined in the linker script at this point, and
2767 it wasn't; it was defined in some object. If we do anyway, DEFINED
2768 would start to yield false before this point and the construct "sym =
2769 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2771 if (h
->type
!= bfd_link_hash_undefined
2772 && h
->type
!= bfd_link_hash_common
2773 && h
->type
!= bfd_link_hash_new
2774 && defentry
->iteration
== -1)
2777 defentry
->iteration
= lang_statement_iteration
;
2780 /* Add the supplied name to the symbol table as an undefined reference.
2781 This is a two step process as the symbol table doesn't even exist at
2782 the time the ld command line is processed. First we put the name
2783 on a list, then, once the output file has been opened, transfer the
2784 name to the symbol table. */
2786 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
2788 #define ldlang_undef_chain_list_head entry_symbol.next
2791 ldlang_add_undef (const char *const name
)
2793 ldlang_undef_chain_list_type
*new =
2794 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
2796 new->next
= ldlang_undef_chain_list_head
;
2797 ldlang_undef_chain_list_head
= new;
2799 new->name
= xstrdup (name
);
2801 if (output_bfd
!= NULL
)
2802 insert_undefined (new->name
);
2805 /* Insert NAME as undefined in the symbol table. */
2808 insert_undefined (const char *name
)
2810 struct bfd_link_hash_entry
*h
;
2812 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
2814 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2815 if (h
->type
== bfd_link_hash_new
)
2817 h
->type
= bfd_link_hash_undefined
;
2818 h
->u
.undef
.abfd
= NULL
;
2819 bfd_link_add_undef (link_info
.hash
, h
);
2823 /* Run through the list of undefineds created above and place them
2824 into the linker hash table as undefined symbols belonging to the
2828 lang_place_undefineds (void)
2830 ldlang_undef_chain_list_type
*ptr
;
2832 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
2833 insert_undefined (ptr
->name
);
2836 /* Check for all readonly or some readwrite sections. */
2839 check_input_sections
2840 (lang_statement_union_type
*s
,
2841 lang_output_section_statement_type
*output_section_statement
)
2843 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
2845 switch (s
->header
.type
)
2847 case lang_wild_statement_enum
:
2848 walk_wild (&s
->wild_statement
, check_section_callback
,
2849 output_section_statement
);
2850 if (! output_section_statement
->all_input_readonly
)
2853 case lang_constructors_statement_enum
:
2854 check_input_sections (constructor_list
.head
,
2855 output_section_statement
);
2856 if (! output_section_statement
->all_input_readonly
)
2859 case lang_group_statement_enum
:
2860 check_input_sections (s
->group_statement
.children
.head
,
2861 output_section_statement
);
2862 if (! output_section_statement
->all_input_readonly
)
2871 /* Update wildcard statements if needed. */
2874 update_wild_statements (lang_statement_union_type
*s
)
2876 struct wildcard_list
*sec
;
2878 switch (sort_section
)
2888 for (; s
!= NULL
; s
= s
->header
.next
)
2890 switch (s
->header
.type
)
2895 case lang_wild_statement_enum
:
2896 sec
= s
->wild_statement
.section_list
;
2899 switch (sec
->spec
.sorted
)
2902 sec
->spec
.sorted
= sort_section
;
2905 if (sort_section
== by_alignment
)
2906 sec
->spec
.sorted
= by_name_alignment
;
2909 if (sort_section
== by_name
)
2910 sec
->spec
.sorted
= by_alignment_name
;
2918 case lang_constructors_statement_enum
:
2919 update_wild_statements (constructor_list
.head
);
2922 case lang_output_section_statement_enum
:
2923 update_wild_statements
2924 (s
->output_section_statement
.children
.head
);
2927 case lang_group_statement_enum
:
2928 update_wild_statements (s
->group_statement
.children
.head
);
2936 /* Open input files and attach to output sections. */
2939 map_input_to_output_sections
2940 (lang_statement_union_type
*s
, const char *target
,
2941 lang_output_section_statement_type
*os
)
2943 for (; s
!= NULL
; s
= s
->header
.next
)
2945 switch (s
->header
.type
)
2947 case lang_wild_statement_enum
:
2948 wild (&s
->wild_statement
, target
, os
);
2950 case lang_constructors_statement_enum
:
2951 map_input_to_output_sections (constructor_list
.head
,
2955 case lang_output_section_statement_enum
:
2956 if (s
->output_section_statement
.constraint
)
2958 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
2959 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
2961 s
->output_section_statement
.all_input_readonly
= TRUE
;
2962 check_input_sections (s
->output_section_statement
.children
.head
,
2963 &s
->output_section_statement
);
2964 if ((s
->output_section_statement
.all_input_readonly
2965 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
2966 || (!s
->output_section_statement
.all_input_readonly
2967 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
2969 s
->output_section_statement
.constraint
= -1;
2974 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
2976 &s
->output_section_statement
);
2978 case lang_output_statement_enum
:
2980 case lang_target_statement_enum
:
2981 target
= s
->target_statement
.target
;
2983 case lang_group_statement_enum
:
2984 map_input_to_output_sections (s
->group_statement
.children
.head
,
2988 case lang_data_statement_enum
:
2989 /* Make sure that any sections mentioned in the expression
2991 exp_init_os (s
->data_statement
.exp
);
2992 if (os
!= NULL
&& os
->bfd_section
== NULL
)
2994 /* The output section gets contents, and then we inspect for
2995 any flags set in the input script which override any ALLOC. */
2996 os
->bfd_section
->flags
|= SEC_HAS_CONTENTS
;
2997 if (!(os
->flags
& SEC_NEVER_LOAD
))
2998 os
->bfd_section
->flags
|= SEC_ALLOC
| SEC_LOAD
;
3000 case lang_fill_statement_enum
:
3001 case lang_input_section_enum
:
3002 case lang_object_symbols_statement_enum
:
3003 case lang_reloc_statement_enum
:
3004 case lang_padding_statement_enum
:
3005 case lang_input_statement_enum
:
3006 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3009 case lang_assignment_statement_enum
:
3010 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3013 /* Make sure that any sections mentioned in the assignment
3015 exp_init_os (s
->assignment_statement
.exp
);
3017 case lang_afile_asection_pair_statement_enum
:
3020 case lang_address_statement_enum
:
3021 /* Mark the specified section with the supplied address.
3023 If this section was actually a segment marker, then the
3024 directive is ignored if the linker script explicitly
3025 processed the segment marker. Originally, the linker
3026 treated segment directives (like -Ttext on the
3027 command-line) as section directives. We honor the
3028 section directive semantics for backwards compatibilty;
3029 linker scripts that do not specifically check for
3030 SEGMENT_START automatically get the old semantics. */
3031 if (!s
->address_statement
.segment
3032 || !s
->address_statement
.segment
->used
)
3034 lang_output_section_statement_type
*aos
3035 = (lang_output_section_statement_lookup
3036 (s
->address_statement
.section_name
));
3038 if (aos
->bfd_section
== NULL
)
3040 aos
->addr_tree
= s
->address_statement
.address
;
3047 /* Worker function for lang_mark_used_section. Recursiveness goes
3051 lang_mark_used_section_1
3052 (lang_statement_union_type
*s
,
3053 lang_output_section_statement_type
*output_section_statement
)
3055 for (; s
!= NULL
; s
= s
->header
.next
)
3057 switch (s
->header
.type
)
3059 case lang_constructors_statement_enum
:
3062 case lang_output_section_statement_enum
:
3064 lang_output_section_statement_type
*os
;
3066 os
= &(s
->output_section_statement
);
3067 if (os
->bfd_section
!= NULL
)
3069 lang_mark_used_section_1 (os
->children
.head
, os
);
3071 exp_mark_used_section (os
->load_base
,
3072 bfd_abs_section_ptr
);
3076 case lang_wild_statement_enum
:
3077 lang_mark_used_section_1 (s
->wild_statement
.children
.head
,
3078 output_section_statement
);
3082 case lang_object_symbols_statement_enum
:
3083 case lang_output_statement_enum
:
3084 case lang_target_statement_enum
:
3086 case lang_data_statement_enum
:
3087 exp_mark_used_section (s
->data_statement
.exp
,
3088 bfd_abs_section_ptr
);
3091 case lang_reloc_statement_enum
:
3094 case lang_input_section_enum
:
3097 case lang_input_statement_enum
:
3099 case lang_fill_statement_enum
:
3101 case lang_assignment_statement_enum
:
3102 exp_mark_used_section (s
->assignment_statement
.exp
,
3103 output_section_statement
->bfd_section
);
3105 case lang_padding_statement_enum
:
3108 case lang_group_statement_enum
:
3109 lang_mark_used_section_1 (s
->group_statement
.children
.head
,
3110 output_section_statement
);
3116 case lang_address_statement_enum
:
3123 lang_mark_used_section (void)
3125 unsigned int gc_sections
= link_info
.gc_sections
;
3127 /* Callers of exp_fold_tree need to increment this. */
3128 lang_statement_iteration
++;
3129 lang_mark_used_section_1 (statement_list
.head
, abs_output_section
);
3131 link_info
.gc_sections
= 0;
3132 bfd_gc_sections (output_bfd
, &link_info
);
3133 link_info
.gc_sections
= gc_sections
;
3136 /* An output section might have been removed after its statement was
3137 added. For example, ldemul_before_allocation can remove dynamic
3138 sections if they turn out to be not needed. Clean them up here. */
3141 strip_excluded_output_sections (void)
3143 lang_output_section_statement_type
*os
;
3145 lang_mark_used_section ();
3147 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3151 asection
*output_section
;
3152 bfd_boolean exclude
;
3154 if (os
->constraint
== -1)
3157 output_section
= os
->bfd_section
;
3158 if (output_section
== NULL
)
3162 if (output_section
->map_head
.s
!= NULL
)
3166 for (s
= output_section
->map_head
.s
; s
!= NULL
;
3168 if ((s
->flags
& SEC_EXCLUDE
) == 0)
3171 output_section
->map_head
.link_order
= NULL
;
3172 output_section
->map_tail
.link_order
= NULL
;
3179 || (output_section
->linker_has_input
== 0
3180 && ((output_section
->flags
3181 & (SEC_KEEP
| SEC_HAS_CONTENTS
)) == 0)))
3184 os
->bfd_section
= NULL
;
3186 /* We don't set bfd_section to NULL since bfd_section of the
3187 * removed output section statement may still be used. */
3189 if (!bfd_section_removed_from_list (output_bfd
,
3192 bfd_section_list_remove (output_bfd
, output_section
);
3193 output_bfd
->section_count
--;
3198 /* Stop future calls to lang_add_section from messing with map_head
3199 and map_tail link_order fields. */
3200 stripped_excluded_sections
= TRUE
;
3204 print_output_section_statement
3205 (lang_output_section_statement_type
*output_section_statement
)
3207 asection
*section
= output_section_statement
->bfd_section
;
3210 if (output_section_statement
!= abs_output_section
)
3212 minfo ("\n%s", output_section_statement
->name
);
3214 if (section
!= NULL
)
3216 print_dot
= section
->vma
;
3218 len
= strlen (output_section_statement
->name
);
3219 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3224 while (len
< SECTION_NAME_MAP_LENGTH
)
3230 minfo ("0x%V %W", section
->vma
, section
->size
);
3232 if (output_section_statement
->load_base
!= NULL
)
3236 addr
= exp_get_abs_int (output_section_statement
->load_base
, 0,
3237 "load base", lang_final_phase_enum
);
3238 minfo (_(" load address 0x%V"), addr
);
3245 print_statement_list (output_section_statement
->children
.head
,
3246 output_section_statement
);
3249 /* Scan for the use of the destination in the right hand side
3250 of an expression. In such cases we will not compute the
3251 correct expression, since the value of DST that is used on
3252 the right hand side will be its final value, not its value
3253 just before this expression is evaluated. */
3256 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3258 if (rhs
== NULL
|| dst
== NULL
)
3261 switch (rhs
->type
.node_class
)
3264 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3265 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3268 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3269 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3272 case etree_provided
:
3274 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3276 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3279 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3283 return strcmp (dst
, rhs
->value
.str
) == 0;
3288 return strcmp (dst
, rhs
->name
.name
) == 0;
3300 print_assignment (lang_assignment_statement_type
*assignment
,
3301 lang_output_section_statement_type
*output_section
)
3305 bfd_boolean computation_is_valid
= TRUE
;
3307 etree_value_type result
;
3309 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3312 if (assignment
->exp
->type
.node_class
== etree_assert
)
3315 tree
= assignment
->exp
->assert_s
.child
;
3316 computation_is_valid
= TRUE
;
3320 const char *dst
= assignment
->exp
->assign
.dst
;
3322 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3323 tree
= assignment
->exp
->assign
.src
;
3324 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3327 result
= exp_fold_tree (tree
, output_section
->bfd_section
,
3328 lang_final_phase_enum
, print_dot
, &print_dot
);
3333 if (computation_is_valid
)
3335 value
= result
.value
;
3338 value
+= result
.section
->vma
;
3340 minfo ("0x%V", value
);
3346 struct bfd_link_hash_entry
*h
;
3348 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3349 FALSE
, FALSE
, TRUE
);
3352 value
= h
->u
.def
.value
;
3355 value
+= result
.section
->vma
;
3357 minfo ("[0x%V]", value
);
3360 minfo ("[unresolved]");
3372 exp_print_tree (assignment
->exp
);
3377 print_input_statement (lang_input_statement_type
*statm
)
3379 if (statm
->filename
!= NULL
)
3381 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3385 /* Print all symbols defined in a particular section. This is called
3386 via bfd_link_hash_traverse, or by print_all_symbols. */
3389 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3391 asection
*sec
= ptr
;
3393 if ((hash_entry
->type
== bfd_link_hash_defined
3394 || hash_entry
->type
== bfd_link_hash_defweak
)
3395 && sec
== hash_entry
->u
.def
.section
)
3399 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3402 (hash_entry
->u
.def
.value
3403 + hash_entry
->u
.def
.section
->output_offset
3404 + hash_entry
->u
.def
.section
->output_section
->vma
));
3406 minfo (" %T\n", hash_entry
->root
.string
);
3413 print_all_symbols (sec
)
3416 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3417 struct map_symbol_def
*def
;
3422 *ud
->map_symbol_def_tail
= 0;
3423 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3424 print_one_symbol (def
->entry
, sec
);
3427 /* Print information about an input section to the map file. */
3430 print_input_section (lang_input_section_type
*in
)
3432 asection
*i
= in
->section
;
3433 bfd_size_type size
= i
->size
;
3442 minfo ("%s", i
->name
);
3444 len
= 1 + strlen (i
->name
);
3445 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3450 while (len
< SECTION_NAME_MAP_LENGTH
)
3456 if (i
->output_section
!= NULL
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3457 addr
= i
->output_section
->vma
+ i
->output_offset
;
3464 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3466 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3468 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3480 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3483 if (i
->output_section
!= NULL
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3485 if (command_line
.reduce_memory_overheads
)
3486 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3488 print_all_symbols (i
);
3490 print_dot
= addr
+ TO_ADDR (size
);
3496 print_fill_statement (lang_fill_statement_type
*fill
)
3500 fputs (" FILL mask 0x", config
.map_file
);
3501 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3502 fprintf (config
.map_file
, "%02x", *p
);
3503 fputs ("\n", config
.map_file
);
3507 print_data_statement (lang_data_statement_type
*data
)
3515 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3518 addr
= data
->output_vma
;
3519 if (data
->output_section
!= NULL
)
3520 addr
+= data
->output_section
->vma
;
3548 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3550 if (data
->exp
->type
.node_class
!= etree_value
)
3553 exp_print_tree (data
->exp
);
3558 print_dot
= addr
+ TO_ADDR (size
);
3561 /* Print an address statement. These are generated by options like
3565 print_address_statement (lang_address_statement_type
*address
)
3567 minfo (_("Address of section %s set to "), address
->section_name
);
3568 exp_print_tree (address
->address
);
3572 /* Print a reloc statement. */
3575 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3582 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3585 addr
= reloc
->output_vma
;
3586 if (reloc
->output_section
!= NULL
)
3587 addr
+= reloc
->output_section
->vma
;
3589 size
= bfd_get_reloc_size (reloc
->howto
);
3591 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3593 if (reloc
->name
!= NULL
)
3594 minfo ("%s+", reloc
->name
);
3596 minfo ("%s+", reloc
->section
->name
);
3598 exp_print_tree (reloc
->addend_exp
);
3602 print_dot
= addr
+ TO_ADDR (size
);
3606 print_padding_statement (lang_padding_statement_type
*s
)
3614 len
= sizeof " *fill*" - 1;
3615 while (len
< SECTION_NAME_MAP_LENGTH
)
3621 addr
= s
->output_offset
;
3622 if (s
->output_section
!= NULL
)
3623 addr
+= s
->output_section
->vma
;
3624 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3626 if (s
->fill
->size
!= 0)
3630 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3631 fprintf (config
.map_file
, "%02x", *p
);
3636 print_dot
= addr
+ TO_ADDR (s
->size
);
3640 print_wild_statement (lang_wild_statement_type
*w
,
3641 lang_output_section_statement_type
*os
)
3643 struct wildcard_list
*sec
;
3647 if (w
->filenames_sorted
)
3649 if (w
->filename
!= NULL
)
3650 minfo ("%s", w
->filename
);
3653 if (w
->filenames_sorted
)
3657 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
3659 if (sec
->spec
.sorted
)
3661 if (sec
->spec
.exclude_name_list
!= NULL
)
3664 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
3665 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
3666 minfo (" %s", tmp
->name
);
3669 if (sec
->spec
.name
!= NULL
)
3670 minfo ("%s", sec
->spec
.name
);
3673 if (sec
->spec
.sorted
)
3682 print_statement_list (w
->children
.head
, os
);
3685 /* Print a group statement. */
3688 print_group (lang_group_statement_type
*s
,
3689 lang_output_section_statement_type
*os
)
3691 fprintf (config
.map_file
, "START GROUP\n");
3692 print_statement_list (s
->children
.head
, os
);
3693 fprintf (config
.map_file
, "END GROUP\n");
3696 /* Print the list of statements in S.
3697 This can be called for any statement type. */
3700 print_statement_list (lang_statement_union_type
*s
,
3701 lang_output_section_statement_type
*os
)
3705 print_statement (s
, os
);
3710 /* Print the first statement in statement list S.
3711 This can be called for any statement type. */
3714 print_statement (lang_statement_union_type
*s
,
3715 lang_output_section_statement_type
*os
)
3717 switch (s
->header
.type
)
3720 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
3723 case lang_constructors_statement_enum
:
3724 if (constructor_list
.head
!= NULL
)
3726 if (constructors_sorted
)
3727 minfo (" SORT (CONSTRUCTORS)\n");
3729 minfo (" CONSTRUCTORS\n");
3730 print_statement_list (constructor_list
.head
, os
);
3733 case lang_wild_statement_enum
:
3734 print_wild_statement (&s
->wild_statement
, os
);
3736 case lang_address_statement_enum
:
3737 print_address_statement (&s
->address_statement
);
3739 case lang_object_symbols_statement_enum
:
3740 minfo (" CREATE_OBJECT_SYMBOLS\n");
3742 case lang_fill_statement_enum
:
3743 print_fill_statement (&s
->fill_statement
);
3745 case lang_data_statement_enum
:
3746 print_data_statement (&s
->data_statement
);
3748 case lang_reloc_statement_enum
:
3749 print_reloc_statement (&s
->reloc_statement
);
3751 case lang_input_section_enum
:
3752 print_input_section (&s
->input_section
);
3754 case lang_padding_statement_enum
:
3755 print_padding_statement (&s
->padding_statement
);
3757 case lang_output_section_statement_enum
:
3758 print_output_section_statement (&s
->output_section_statement
);
3760 case lang_assignment_statement_enum
:
3761 print_assignment (&s
->assignment_statement
, os
);
3763 case lang_target_statement_enum
:
3764 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
3766 case lang_output_statement_enum
:
3767 minfo ("OUTPUT(%s", s
->output_statement
.name
);
3768 if (output_target
!= NULL
)
3769 minfo (" %s", output_target
);
3772 case lang_input_statement_enum
:
3773 print_input_statement (&s
->input_statement
);
3775 case lang_group_statement_enum
:
3776 print_group (&s
->group_statement
, os
);
3778 case lang_afile_asection_pair_statement_enum
:
3785 print_statements (void)
3787 print_statement_list (statement_list
.head
, abs_output_section
);
3790 /* Print the first N statements in statement list S to STDERR.
3791 If N == 0, nothing is printed.
3792 If N < 0, the entire list is printed.
3793 Intended to be called from GDB. */
3796 dprint_statement (lang_statement_union_type
*s
, int n
)
3798 FILE *map_save
= config
.map_file
;
3800 config
.map_file
= stderr
;
3803 print_statement_list (s
, abs_output_section
);
3806 while (s
&& --n
>= 0)
3808 print_statement (s
, abs_output_section
);
3813 config
.map_file
= map_save
;
3817 insert_pad (lang_statement_union_type
**ptr
,
3819 unsigned int alignment_needed
,
3820 asection
*output_section
,
3823 static fill_type zero_fill
= { 1, { 0 } };
3824 lang_statement_union_type
*pad
;
3826 pad
= ((lang_statement_union_type
*)
3827 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
3828 if (ptr
!= &statement_list
.head
3829 && pad
->header
.type
== lang_padding_statement_enum
3830 && pad
->padding_statement
.output_section
== output_section
)
3832 /* Use the existing pad statement. The above test on output
3833 section is probably redundant, but it doesn't hurt to check. */
3837 /* Make a new padding statement, linked into existing chain. */
3838 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
3839 pad
->header
.next
= *ptr
;
3841 pad
->header
.type
= lang_padding_statement_enum
;
3842 pad
->padding_statement
.output_section
= output_section
;
3845 pad
->padding_statement
.fill
= fill
;
3847 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
3848 pad
->padding_statement
.size
= alignment_needed
;
3849 output_section
->size
+= alignment_needed
;
3852 /* Work out how much this section will move the dot point. */
3856 (lang_statement_union_type
**this_ptr
,
3857 lang_output_section_statement_type
*output_section_statement
,
3861 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
3862 asection
*i
= is
->section
;
3864 if (!is
->ifile
->just_syms_flag
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3866 unsigned int alignment_needed
;
3869 /* Align this section first to the input sections requirement,
3870 then to the output section's requirement. If this alignment
3871 is greater than any seen before, then record it too. Perform
3872 the alignment by inserting a magic 'padding' statement. */
3874 if (output_section_statement
->subsection_alignment
!= -1)
3875 i
->alignment_power
= output_section_statement
->subsection_alignment
;
3877 o
= output_section_statement
->bfd_section
;
3878 if (o
->alignment_power
< i
->alignment_power
)
3879 o
->alignment_power
= i
->alignment_power
;
3881 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
3883 if (alignment_needed
!= 0)
3885 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
3886 dot
+= alignment_needed
;
3889 /* Remember where in the output section this input section goes. */
3891 i
->output_offset
= dot
- o
->vma
;
3893 /* Mark how big the output section must be to contain this now. */
3894 dot
+= TO_ADDR (i
->size
);
3895 o
->size
= TO_SIZE (dot
- o
->vma
);
3899 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
3906 sort_sections_by_lma (const void *arg1
, const void *arg2
)
3908 const asection
*sec1
= *(const asection
**) arg1
;
3909 const asection
*sec2
= *(const asection
**) arg2
;
3911 if (bfd_section_lma (sec1
->owner
, sec1
)
3912 < bfd_section_lma (sec2
->owner
, sec2
))
3914 else if (bfd_section_lma (sec1
->owner
, sec1
)
3915 > bfd_section_lma (sec2
->owner
, sec2
))
3921 #define IGNORE_SECTION(s) \
3922 ((s->flags & SEC_NEVER_LOAD) != 0 \
3923 || (s->flags & SEC_ALLOC) == 0 \
3924 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
3925 && (s->flags & SEC_LOAD) == 0))
3927 /* Check to see if any allocated sections overlap with other allocated
3928 sections. This can happen if a linker script specifies the output
3929 section addresses of the two sections. */
3932 lang_check_section_addresses (void)
3935 asection
**sections
, **spp
;
3943 if (bfd_count_sections (output_bfd
) <= 1)
3946 amt
= bfd_count_sections (output_bfd
) * sizeof (asection
*);
3947 sections
= xmalloc (amt
);
3949 /* Scan all sections in the output list. */
3951 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
3953 /* Only consider loadable sections with real contents. */
3954 if (IGNORE_SECTION (s
) || s
->size
== 0)
3957 sections
[count
] = s
;
3964 qsort (sections
, (size_t) count
, sizeof (asection
*),
3965 sort_sections_by_lma
);
3969 s_start
= bfd_section_lma (output_bfd
, s
);
3970 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
3971 for (count
--; count
; count
--)
3973 /* We must check the sections' LMA addresses not their VMA
3974 addresses because overlay sections can have overlapping VMAs
3975 but they must have distinct LMAs. */
3980 s_start
= bfd_section_lma (output_bfd
, s
);
3981 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
3983 /* Look for an overlap. */
3984 if (s_end
>= os_start
&& s_start
<= os_end
)
3985 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
3986 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
3992 /* Make sure the new address is within the region. We explicitly permit the
3993 current address to be at the exact end of the region when the address is
3994 non-zero, in case the region is at the end of addressable memory and the
3995 calculation wraps around. */
3998 os_region_check (lang_output_section_statement_type
*os
,
3999 lang_memory_region_type
*region
,
4003 if ((region
->current
< region
->origin
4004 || (region
->current
- region
->origin
> region
->length
))
4005 && ((region
->current
!= region
->origin
+ region
->length
)
4010 einfo (_("%X%P: address 0x%v of %B section %s"
4011 " is not within region %s\n"),
4013 os
->bfd_section
->owner
,
4014 os
->bfd_section
->name
,
4019 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4021 os
->bfd_section
->owner
,
4022 os
->bfd_section
->name
);
4024 /* Reset the region pointer. */
4025 region
->current
= region
->origin
;
4029 /* Set the sizes for all the output sections. */
4032 lang_size_sections_1
4033 (lang_statement_union_type
*s
,
4034 lang_output_section_statement_type
*output_section_statement
,
4035 lang_statement_union_type
**prev
,
4039 bfd_boolean check_regions
)
4041 /* Size up the sections from their constituent parts. */
4042 for (; s
!= NULL
; s
= s
->header
.next
)
4044 switch (s
->header
.type
)
4046 case lang_output_section_statement_enum
:
4049 lang_output_section_statement_type
*os
;
4051 os
= &s
->output_section_statement
;
4052 if (os
->bfd_section
== NULL
|| os
->ignored
)
4053 /* This section was removed or never actually created. */
4056 /* If this is a COFF shared library section, use the size and
4057 address from the input section. FIXME: This is COFF
4058 specific; it would be cleaner if there were some other way
4059 to do this, but nothing simple comes to mind. */
4060 if ((bfd_get_flavour (output_bfd
) == bfd_target_ecoff_flavour
4061 || bfd_get_flavour (output_bfd
) == bfd_target_coff_flavour
)
4062 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4066 if (os
->children
.head
== NULL
4067 || os
->children
.head
->header
.next
!= NULL
4068 || (os
->children
.head
->header
.type
4069 != lang_input_section_enum
))
4070 einfo (_("%P%X: Internal error on COFF shared library"
4071 " section %s\n"), os
->name
);
4073 input
= os
->children
.head
->input_section
.section
;
4074 bfd_set_section_vma (os
->bfd_section
->owner
,
4076 bfd_section_vma (input
->owner
, input
));
4077 os
->bfd_section
->size
= input
->size
;
4081 if (bfd_is_abs_section (os
->bfd_section
))
4083 /* No matter what happens, an abs section starts at zero. */
4084 ASSERT (os
->bfd_section
->vma
== 0);
4088 if (os
->addr_tree
== NULL
)
4090 /* No address specified for this section, get one
4091 from the region specification. */
4092 if (os
->region
== NULL
4093 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4094 && os
->region
->name
[0] == '*'
4095 && strcmp (os
->region
->name
,
4096 DEFAULT_MEMORY_REGION
) == 0))
4098 os
->region
= lang_memory_default (os
->bfd_section
);
4101 /* If a loadable section is using the default memory
4102 region, and some non default memory regions were
4103 defined, issue an error message. */
4104 if (!IGNORE_SECTION (os
->bfd_section
)
4105 && ! link_info
.relocatable
4107 && strcmp (os
->region
->name
,
4108 DEFAULT_MEMORY_REGION
) == 0
4109 && lang_memory_region_list
!= NULL
4110 && (strcmp (lang_memory_region_list
->name
,
4111 DEFAULT_MEMORY_REGION
) != 0
4112 || lang_memory_region_list
->next
!= NULL
))
4114 /* By default this is an error rather than just a
4115 warning because if we allocate the section to the
4116 default memory region we can end up creating an
4117 excessively large binary, or even seg faulting when
4118 attempting to perform a negative seek. See
4119 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4120 for an example of this. This behaviour can be
4121 overridden by the using the --no-check-sections
4123 if (command_line
.check_section_addresses
)
4124 einfo (_("%P%F: error: no memory region specified"
4125 " for loadable section `%s'\n"),
4126 bfd_get_section_name (output_bfd
,
4129 einfo (_("%P: warning: no memory region specified"
4130 " for loadable section `%s'\n"),
4131 bfd_get_section_name (output_bfd
,
4135 dot
= os
->region
->current
;
4137 if (os
->section_alignment
== -1)
4142 dot
= align_power (dot
,
4143 os
->bfd_section
->alignment_power
);
4145 if (dot
!= olddot
&& config
.warn_section_align
)
4146 einfo (_("%P: warning: changing start of section"
4147 " %s by %u bytes\n"),
4148 os
->name
, (unsigned int) (dot
- olddot
));
4156 r
= exp_fold_tree (os
->addr_tree
,
4157 bfd_abs_section_ptr
,
4158 lang_allocating_phase_enum
,
4163 einfo (_("%F%S: non constant or forward reference"
4164 " address expression for section %s\n"),
4167 dot
= r
.value
+ r
.section
->vma
;
4170 /* The section starts here.
4171 First, align to what the section needs. */
4173 if (os
->section_alignment
!= -1)
4174 dot
= align_power (dot
, os
->section_alignment
);
4176 bfd_set_section_vma (0, os
->bfd_section
, dot
);
4178 os
->bfd_section
->output_offset
= 0;
4181 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4182 os
->fill
, dot
, relax
, check_regions
);
4184 /* Put the section within the requested block size, or
4185 align at the block boundary. */
4186 after
= ((os
->bfd_section
->vma
4187 + TO_ADDR (os
->bfd_section
->size
)
4188 + os
->block_value
- 1)
4189 & - (bfd_vma
) os
->block_value
);
4191 if (bfd_is_abs_section (os
->bfd_section
))
4192 ASSERT (after
== os
->bfd_section
->vma
);
4194 os
->bfd_section
->size
4195 = TO_SIZE (after
- os
->bfd_section
->vma
);
4197 dot
= os
->bfd_section
->vma
;
4198 /* .tbss sections effectively have zero size. */
4199 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4200 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4201 || link_info
.relocatable
)
4202 dot
+= TO_ADDR (os
->bfd_section
->size
);
4206 if (os
->update_dot_tree
!= 0)
4207 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
,
4208 lang_allocating_phase_enum
, dot
, &dot
);
4210 /* Update dot in the region ?
4211 We only do this if the section is going to be allocated,
4212 since unallocated sections do not contribute to the region's
4213 overall size in memory.
4215 If the SEC_NEVER_LOAD bit is not set, it will affect the
4216 addresses of sections after it. We have to update
4218 if (os
->region
!= NULL
4219 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4220 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4222 os
->region
->current
= dot
;
4225 /* Make sure the new address is within the region. */
4226 os_region_check (os
, os
->region
, os
->addr_tree
,
4227 os
->bfd_section
->vma
);
4229 /* If there's no load address specified, use the run
4230 region as the load region. */
4231 if (os
->lma_region
== NULL
&& os
->load_base
== NULL
)
4232 os
->lma_region
= os
->region
;
4234 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
)
4236 /* Set load_base, which will be handled later. */
4237 os
->load_base
= exp_intop (os
->lma_region
->current
);
4238 os
->lma_region
->current
+=
4239 TO_ADDR (os
->bfd_section
->size
);
4241 os_region_check (os
, os
->lma_region
, NULL
,
4242 os
->bfd_section
->lma
);
4248 case lang_constructors_statement_enum
:
4249 dot
= lang_size_sections_1 (constructor_list
.head
,
4250 output_section_statement
,
4251 &s
->wild_statement
.children
.head
,
4252 fill
, dot
, relax
, check_regions
);
4255 case lang_data_statement_enum
:
4257 unsigned int size
= 0;
4259 s
->data_statement
.output_vma
=
4260 dot
- output_section_statement
->bfd_section
->vma
;
4261 s
->data_statement
.output_section
=
4262 output_section_statement
->bfd_section
;
4264 /* We might refer to provided symbols in the expression, and
4265 need to mark them as needed. */
4266 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
,
4267 lang_allocating_phase_enum
, dot
, &dot
);
4269 switch (s
->data_statement
.type
)
4287 if (size
< TO_SIZE ((unsigned) 1))
4288 size
= TO_SIZE ((unsigned) 1);
4289 dot
+= TO_ADDR (size
);
4290 output_section_statement
->bfd_section
->size
+= size
;
4294 case lang_reloc_statement_enum
:
4298 s
->reloc_statement
.output_vma
=
4299 dot
- output_section_statement
->bfd_section
->vma
;
4300 s
->reloc_statement
.output_section
=
4301 output_section_statement
->bfd_section
;
4302 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4303 dot
+= TO_ADDR (size
);
4304 output_section_statement
->bfd_section
->size
+= size
;
4308 case lang_wild_statement_enum
:
4310 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4311 output_section_statement
,
4312 &s
->wild_statement
.children
.head
,
4313 fill
, dot
, relax
, check_regions
);
4317 case lang_object_symbols_statement_enum
:
4318 link_info
.create_object_symbols_section
=
4319 output_section_statement
->bfd_section
;
4321 case lang_output_statement_enum
:
4322 case lang_target_statement_enum
:
4324 case lang_input_section_enum
:
4328 i
= (*prev
)->input_section
.section
;
4333 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4334 einfo (_("%P%F: can't relax section: %E\n"));
4338 dot
= size_input_section (prev
, output_section_statement
,
4339 output_section_statement
->fill
, dot
);
4342 case lang_input_statement_enum
:
4344 case lang_fill_statement_enum
:
4345 s
->fill_statement
.output_section
=
4346 output_section_statement
->bfd_section
;
4348 fill
= s
->fill_statement
.fill
;
4350 case lang_assignment_statement_enum
:
4352 bfd_vma newdot
= dot
;
4354 exp_fold_tree (s
->assignment_statement
.exp
,
4355 output_section_statement
->bfd_section
,
4356 lang_allocating_phase_enum
,
4362 if (output_section_statement
== abs_output_section
)
4364 /* If we don't have an output section, then just adjust
4365 the default memory address. */
4366 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4367 FALSE
)->current
= newdot
;
4371 /* Insert a pad after this statement. We can't
4372 put the pad before when relaxing, in case the
4373 assignment references dot. */
4374 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4375 output_section_statement
->bfd_section
, dot
);
4377 /* Don't neuter the pad below when relaxing. */
4381 /* If dot is advanced, this implies that the section should
4382 have space allocated to it, unless the user has explicitly
4383 stated that the section should never be loaded. */
4384 if (!(output_section_statement
->flags
4385 & (SEC_NEVER_LOAD
| SEC_ALLOC
)))
4386 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4393 case lang_padding_statement_enum
:
4394 /* If this is the first time lang_size_sections is called,
4395 we won't have any padding statements. If this is the
4396 second or later passes when relaxing, we should allow
4397 padding to shrink. If padding is needed on this pass, it
4398 will be added back in. */
4399 s
->padding_statement
.size
= 0;
4401 /* Make sure output_offset is valid. If relaxation shrinks
4402 the section and this pad isn't needed, it's possible to
4403 have output_offset larger than the final size of the
4404 section. bfd_set_section_contents will complain even for
4405 a pad size of zero. */
4406 s
->padding_statement
.output_offset
4407 = dot
- output_section_statement
->bfd_section
->vma
;
4410 case lang_group_statement_enum
:
4411 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4412 output_section_statement
,
4413 &s
->group_statement
.children
.head
,
4414 fill
, dot
, relax
, check_regions
);
4421 /* We can only get here when relaxing is turned on. */
4422 case lang_address_statement_enum
:
4425 prev
= &s
->header
.next
;
4432 (lang_statement_union_type
*s
,
4433 lang_output_section_statement_type
*output_section_statement
,
4434 lang_statement_union_type
**prev
,
4438 bfd_boolean check_regions
)
4442 /* Callers of exp_fold_tree need to increment this. */
4443 lang_statement_iteration
++;
4445 exp_data_seg
.phase
= exp_dataseg_none
;
4446 result
= lang_size_sections_1 (s
, output_section_statement
, prev
, fill
,
4447 dot
, relax
, check_regions
);
4448 if (exp_data_seg
.phase
== exp_dataseg_end_seen
4449 && link_info
.relro
&& exp_data_seg
.relro_end
)
4451 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4452 to put exp_data_seg.relro on a (common) page boundary. */
4453 bfd_vma old_min_base
, relro_end
, maxpage
;
4455 exp_data_seg
.phase
= exp_dataseg_relro_adjust
;
4456 old_min_base
= exp_data_seg
.min_base
;
4457 maxpage
= exp_data_seg
.maxpagesize
;
4458 exp_data_seg
.base
+= (-exp_data_seg
.relro_end
4459 & (exp_data_seg
.pagesize
- 1));
4460 /* Compute the expected PT_GNU_RELRO segment end. */
4461 relro_end
= (exp_data_seg
.relro_end
+ exp_data_seg
.pagesize
- 1)
4462 & ~(exp_data_seg
.pagesize
- 1);
4463 if (old_min_base
+ maxpage
< exp_data_seg
.base
)
4465 exp_data_seg
.base
-= maxpage
;
4466 relro_end
-= maxpage
;
4468 result
= lang_size_sections_1 (s
, output_section_statement
, prev
, fill
,
4469 dot
, relax
, check_regions
);
4470 if (exp_data_seg
.relro_end
> relro_end
)
4472 /* The alignment of sections between DATA_SEGMENT_ALIGN
4473 and DATA_SEGMENT_RELRO_END caused huge padding to be
4474 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4476 unsigned int max_alignment_power
= 0;
4478 /* Find maximum alignment power of sections between
4479 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4480 for (sec
= output_bfd
->sections
; sec
; sec
= sec
->next
)
4481 if (sec
->vma
>= exp_data_seg
.base
4482 && sec
->vma
< exp_data_seg
.relro_end
4483 && sec
->alignment_power
> max_alignment_power
)
4484 max_alignment_power
= sec
->alignment_power
;
4486 if (((bfd_vma
) 1 << max_alignment_power
) < exp_data_seg
.pagesize
)
4488 if (exp_data_seg
.base
- (1 << max_alignment_power
)
4490 exp_data_seg
.base
+= exp_data_seg
.pagesize
;
4491 exp_data_seg
.base
-= (1 << max_alignment_power
);
4492 result
= lang_size_sections_1 (s
, output_section_statement
,
4493 prev
, fill
, dot
, relax
,
4497 link_info
.relro_start
= exp_data_seg
.base
;
4498 link_info
.relro_end
= exp_data_seg
.relro_end
;
4500 else if (exp_data_seg
.phase
== exp_dataseg_end_seen
)
4502 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4503 a page could be saved in the data segment. */
4504 bfd_vma first
, last
;
4506 first
= -exp_data_seg
.base
& (exp_data_seg
.pagesize
- 1);
4507 last
= exp_data_seg
.end
& (exp_data_seg
.pagesize
- 1);
4509 && ((exp_data_seg
.base
& ~(exp_data_seg
.pagesize
- 1))
4510 != (exp_data_seg
.end
& ~(exp_data_seg
.pagesize
- 1)))
4511 && first
+ last
<= exp_data_seg
.pagesize
)
4513 exp_data_seg
.phase
= exp_dataseg_adjust
;
4514 lang_statement_iteration
++;
4515 result
= lang_size_sections_1 (s
, output_section_statement
, prev
,
4516 fill
, dot
, relax
, check_regions
);
4523 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4526 lang_do_assignments_1
4527 (lang_statement_union_type
*s
,
4528 lang_output_section_statement_type
*output_section_statement
,
4532 for (; s
!= NULL
; s
= s
->header
.next
)
4534 switch (s
->header
.type
)
4536 case lang_constructors_statement_enum
:
4537 dot
= lang_do_assignments_1 (constructor_list
.head
,
4538 output_section_statement
,
4543 case lang_output_section_statement_enum
:
4545 lang_output_section_statement_type
*os
;
4547 os
= &(s
->output_section_statement
);
4548 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
4550 dot
= os
->bfd_section
->vma
;
4551 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
4552 /* .tbss sections effectively have zero size. */
4553 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4554 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4555 || link_info
.relocatable
)
4556 dot
+= TO_ADDR (os
->bfd_section
->size
);
4560 /* If nothing has been placed into the output section then
4561 it won't have a bfd_section. */
4562 if (os
->bfd_section
&& !os
->ignored
)
4564 os
->bfd_section
->lma
4565 = exp_get_abs_int (os
->load_base
, 0, "load base",
4566 lang_final_phase_enum
);
4571 case lang_wild_statement_enum
:
4573 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
4574 output_section_statement
,
4579 case lang_object_symbols_statement_enum
:
4580 case lang_output_statement_enum
:
4581 case lang_target_statement_enum
:
4583 case lang_data_statement_enum
:
4585 etree_value_type value
;
4587 value
= exp_fold_tree (s
->data_statement
.exp
,
4588 bfd_abs_section_ptr
,
4589 lang_final_phase_enum
, dot
, &dot
);
4591 einfo (_("%F%P: invalid data statement\n"));
4592 s
->data_statement
.value
4593 = value
.value
+ value
.section
->vma
;
4597 switch (s
->data_statement
.type
)
4615 if (size
< TO_SIZE ((unsigned) 1))
4616 size
= TO_SIZE ((unsigned) 1);
4617 dot
+= TO_ADDR (size
);
4621 case lang_reloc_statement_enum
:
4623 etree_value_type value
;
4625 value
= exp_fold_tree (s
->reloc_statement
.addend_exp
,
4626 bfd_abs_section_ptr
,
4627 lang_final_phase_enum
, dot
, &dot
);
4628 s
->reloc_statement
.addend_value
= value
.value
;
4630 einfo (_("%F%P: invalid reloc statement\n"));
4632 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
4635 case lang_input_section_enum
:
4637 asection
*in
= s
->input_section
.section
;
4639 if ((in
->flags
& SEC_EXCLUDE
) == 0)
4640 dot
+= TO_ADDR (in
->size
);
4644 case lang_input_statement_enum
:
4646 case lang_fill_statement_enum
:
4647 fill
= s
->fill_statement
.fill
;
4649 case lang_assignment_statement_enum
:
4651 exp_fold_tree (s
->assignment_statement
.exp
,
4652 output_section_statement
->bfd_section
,
4653 lang_final_phase_enum
,
4659 case lang_padding_statement_enum
:
4660 dot
+= TO_ADDR (s
->padding_statement
.size
);
4663 case lang_group_statement_enum
:
4664 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
4665 output_section_statement
,
4673 case lang_address_statement_enum
:
4683 (lang_statement_union_type
*s
,
4684 lang_output_section_statement_type
*output_section_statement
,
4688 /* Callers of exp_fold_tree need to increment this. */
4689 lang_statement_iteration
++;
4690 lang_do_assignments_1 (s
, output_section_statement
, fill
, dot
);
4693 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4694 operator .startof. (section_name), it produces an undefined symbol
4695 .startof.section_name. Similarly, when it sees
4696 .sizeof. (section_name), it produces an undefined symbol
4697 .sizeof.section_name. For all the output sections, we look for
4698 such symbols, and set them to the correct value. */
4701 lang_set_startof (void)
4705 if (link_info
.relocatable
)
4708 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4710 const char *secname
;
4712 struct bfd_link_hash_entry
*h
;
4714 secname
= bfd_get_section_name (output_bfd
, s
);
4715 buf
= xmalloc (10 + strlen (secname
));
4717 sprintf (buf
, ".startof.%s", secname
);
4718 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4719 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4721 h
->type
= bfd_link_hash_defined
;
4722 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, s
);
4723 h
->u
.def
.section
= bfd_abs_section_ptr
;
4726 sprintf (buf
, ".sizeof.%s", secname
);
4727 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4728 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4730 h
->type
= bfd_link_hash_defined
;
4731 h
->u
.def
.value
= TO_ADDR (s
->size
);
4732 h
->u
.def
.section
= bfd_abs_section_ptr
;
4742 struct bfd_link_hash_entry
*h
;
4745 if (link_info
.relocatable
|| link_info
.shared
)
4750 if (entry_symbol
.name
== NULL
)
4752 /* No entry has been specified. Look for the default entry, but
4753 don't warn if we don't find it. */
4754 entry_symbol
.name
= entry_symbol_default
;
4758 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
4759 FALSE
, FALSE
, TRUE
);
4761 && (h
->type
== bfd_link_hash_defined
4762 || h
->type
== bfd_link_hash_defweak
)
4763 && h
->u
.def
.section
->output_section
!= NULL
)
4767 val
= (h
->u
.def
.value
4768 + bfd_get_section_vma (output_bfd
,
4769 h
->u
.def
.section
->output_section
)
4770 + h
->u
.def
.section
->output_offset
);
4771 if (! bfd_set_start_address (output_bfd
, val
))
4772 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
4779 /* We couldn't find the entry symbol. Try parsing it as a
4781 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
4784 if (! bfd_set_start_address (output_bfd
, val
))
4785 einfo (_("%P%F: can't set start address\n"));
4791 /* Can't find the entry symbol, and it's not a number. Use
4792 the first address in the text section. */
4793 ts
= bfd_get_section_by_name (output_bfd
, entry_section
);
4797 einfo (_("%P: warning: cannot find entry symbol %s;"
4798 " defaulting to %V\n"),
4800 bfd_get_section_vma (output_bfd
, ts
));
4801 if (! bfd_set_start_address (output_bfd
,
4802 bfd_get_section_vma (output_bfd
,
4804 einfo (_("%P%F: can't set start address\n"));
4809 einfo (_("%P: warning: cannot find entry symbol %s;"
4810 " not setting start address\n"),
4816 /* Don't bfd_hash_table_free (&lang_definedness_table);
4817 map file output may result in a call of lang_track_definedness. */
4820 /* This is a small function used when we want to ignore errors from
4824 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
4826 /* Don't do anything. */
4829 /* Check that the architecture of all the input files is compatible
4830 with the output file. Also call the backend to let it do any
4831 other checking that is needed. */
4836 lang_statement_union_type
*file
;
4838 const bfd_arch_info_type
*compatible
;
4840 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
4842 input_bfd
= file
->input_statement
.the_bfd
;
4844 = bfd_arch_get_compatible (input_bfd
, output_bfd
,
4845 command_line
.accept_unknown_input_arch
);
4847 /* In general it is not possible to perform a relocatable
4848 link between differing object formats when the input
4849 file has relocations, because the relocations in the
4850 input format may not have equivalent representations in
4851 the output format (and besides BFD does not translate
4852 relocs for other link purposes than a final link). */
4853 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
4854 && (compatible
== NULL
4855 || bfd_get_flavour (input_bfd
) != bfd_get_flavour (output_bfd
))
4856 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
4858 einfo (_("%P%F: Relocatable linking with relocations from"
4859 " format %s (%B) to format %s (%B) is not supported\n"),
4860 bfd_get_target (input_bfd
), input_bfd
,
4861 bfd_get_target (output_bfd
), output_bfd
);
4862 /* einfo with %F exits. */
4865 if (compatible
== NULL
)
4867 if (command_line
.warn_mismatch
)
4868 einfo (_("%P: warning: %s architecture of input file `%B'"
4869 " is incompatible with %s output\n"),
4870 bfd_printable_name (input_bfd
), input_bfd
,
4871 bfd_printable_name (output_bfd
));
4873 else if (bfd_count_sections (input_bfd
))
4875 /* If the input bfd has no contents, it shouldn't set the
4876 private data of the output bfd. */
4878 bfd_error_handler_type pfn
= NULL
;
4880 /* If we aren't supposed to warn about mismatched input
4881 files, temporarily set the BFD error handler to a
4882 function which will do nothing. We still want to call
4883 bfd_merge_private_bfd_data, since it may set up
4884 information which is needed in the output file. */
4885 if (! command_line
.warn_mismatch
)
4886 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
4887 if (! bfd_merge_private_bfd_data (input_bfd
, output_bfd
))
4889 if (command_line
.warn_mismatch
)
4890 einfo (_("%P%X: failed to merge target specific data"
4891 " of file %B\n"), input_bfd
);
4893 if (! command_line
.warn_mismatch
)
4894 bfd_set_error_handler (pfn
);
4899 /* Look through all the global common symbols and attach them to the
4900 correct section. The -sort-common command line switch may be used
4901 to roughly sort the entries by size. */
4906 if (command_line
.inhibit_common_definition
)
4908 if (link_info
.relocatable
4909 && ! command_line
.force_common_definition
)
4912 if (! config
.sort_common
)
4913 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
4918 for (power
= 4; power
>= 0; power
--)
4919 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
4923 /* Place one common symbol in the correct section. */
4926 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
4928 unsigned int power_of_two
;
4932 if (h
->type
!= bfd_link_hash_common
)
4936 power_of_two
= h
->u
.c
.p
->alignment_power
;
4938 if (config
.sort_common
4939 && power_of_two
< (unsigned int) *(int *) info
)
4942 section
= h
->u
.c
.p
->section
;
4944 /* Increase the size of the section to align the common sym. */
4945 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
4946 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
4948 /* Adjust the alignment if necessary. */
4949 if (power_of_two
> section
->alignment_power
)
4950 section
->alignment_power
= power_of_two
;
4952 /* Change the symbol from common to defined. */
4953 h
->type
= bfd_link_hash_defined
;
4954 h
->u
.def
.section
= section
;
4955 h
->u
.def
.value
= section
->size
;
4957 /* Increase the size of the section. */
4958 section
->size
+= size
;
4960 /* Make sure the section is allocated in memory, and make sure that
4961 it is no longer a common section. */
4962 section
->flags
|= SEC_ALLOC
;
4963 section
->flags
&= ~SEC_IS_COMMON
;
4965 if (config
.map_file
!= NULL
)
4967 static bfd_boolean header_printed
;
4972 if (! header_printed
)
4974 minfo (_("\nAllocating common symbols\n"));
4975 minfo (_("Common symbol size file\n\n"));
4976 header_printed
= TRUE
;
4979 name
= demangle (h
->root
.string
);
4981 len
= strlen (name
);
4996 if (size
<= 0xffffffff)
4997 sprintf (buf
, "%lx", (unsigned long) size
);
4999 sprintf_vma (buf
, size
);
5009 minfo ("%B\n", section
->owner
);
5015 /* Run through the input files and ensure that every input section has
5016 somewhere to go. If one is found without a destination then create
5017 an input request and place it into the statement tree. */
5020 lang_place_orphans (void)
5022 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5026 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5028 if (s
->output_section
== NULL
)
5030 /* This section of the file is not attached, root
5031 around for a sensible place for it to go. */
5033 if (file
->just_syms_flag
)
5034 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5035 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5036 s
->output_section
= bfd_abs_section_ptr
;
5037 else if (strcmp (s
->name
, "COMMON") == 0)
5039 /* This is a lonely common section which must have
5040 come from an archive. We attach to the section
5041 with the wildcard. */
5042 if (! link_info
.relocatable
5043 || command_line
.force_common_definition
)
5045 if (default_common_section
== NULL
)
5047 default_common_section
=
5048 lang_output_section_statement_lookup (".bss");
5051 lang_add_section (&default_common_section
->children
, s
,
5052 default_common_section
, file
);
5055 else if (ldemul_place_orphan (file
, s
))
5059 lang_output_section_statement_type
*os
;
5061 os
= lang_output_section_statement_lookup (s
->name
);
5062 lang_add_section (&os
->children
, s
, os
, file
);
5070 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5072 flagword
*ptr_flags
;
5074 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5080 *ptr_flags
|= SEC_ALLOC
;
5084 *ptr_flags
|= SEC_READONLY
;
5088 *ptr_flags
|= SEC_DATA
;
5092 *ptr_flags
|= SEC_CODE
;
5097 *ptr_flags
|= SEC_LOAD
;
5101 einfo (_("%P%F: invalid syntax in flags\n"));
5108 /* Call a function on each input file. This function will be called
5109 on an archive, but not on the elements. */
5112 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5114 lang_input_statement_type
*f
;
5116 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5118 f
= (lang_input_statement_type
*) f
->next_real_file
)
5122 /* Call a function on each file. The function will be called on all
5123 the elements of an archive which are included in the link, but will
5124 not be called on the archive file itself. */
5127 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5129 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5136 ldlang_add_file (lang_input_statement_type
*entry
)
5140 lang_statement_append (&file_chain
,
5141 (lang_statement_union_type
*) entry
,
5144 /* The BFD linker needs to have a list of all input BFDs involved in
5146 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5147 ASSERT (entry
->the_bfd
!= output_bfd
);
5148 for (pp
= &link_info
.input_bfds
; *pp
!= NULL
; pp
= &(*pp
)->link_next
)
5150 *pp
= entry
->the_bfd
;
5151 entry
->the_bfd
->usrdata
= entry
;
5152 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5154 /* Look through the sections and check for any which should not be
5155 included in the link. We need to do this now, so that we can
5156 notice when the backend linker tries to report multiple
5157 definition errors for symbols which are in sections we aren't
5158 going to link. FIXME: It might be better to entirely ignore
5159 symbols which are defined in sections which are going to be
5160 discarded. This would require modifying the backend linker for
5161 each backend which might set the SEC_LINK_ONCE flag. If we do
5162 this, we should probably handle SEC_EXCLUDE in the same way. */
5164 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5168 lang_add_output (const char *name
, int from_script
)
5170 /* Make -o on command line override OUTPUT in script. */
5171 if (!had_output_filename
|| !from_script
)
5173 output_filename
= name
;
5174 had_output_filename
= TRUE
;
5178 static lang_output_section_statement_type
*current_section
;
5189 for (l
= 0; l
< 32; l
++)
5191 if (i
>= (unsigned int) x
)
5199 lang_output_section_statement_type
*
5200 lang_enter_output_section_statement (const char *output_section_statement_name
,
5201 etree_type
*address_exp
,
5202 enum section_type sectype
,
5204 etree_type
*subalign
,
5208 lang_output_section_statement_type
*os
;
5212 lang_output_section_statement_lookup_1 (output_section_statement_name
,
5215 /* Make next things chain into subchain of this. */
5217 if (os
->addr_tree
== NULL
)
5219 os
->addr_tree
= address_exp
;
5221 os
->sectype
= sectype
;
5222 if (sectype
!= noload_section
)
5223 os
->flags
= SEC_NO_FLAGS
;
5225 os
->flags
= SEC_NEVER_LOAD
;
5226 os
->block_value
= 1;
5227 stat_ptr
= &os
->children
;
5229 os
->subsection_alignment
=
5230 topower (exp_get_value_int (subalign
, -1, "subsection alignment", 0));
5231 os
->section_alignment
=
5232 topower (exp_get_value_int (align
, -1, "section alignment", 0));
5234 os
->load_base
= ebase
;
5241 lang_output_statement_type
*new =
5242 new_stat (lang_output_statement
, stat_ptr
);
5244 new->name
= output_filename
;
5247 /* Reset the current counters in the regions. */
5250 lang_reset_memory_regions (void)
5252 lang_memory_region_type
*p
= lang_memory_region_list
;
5255 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5257 p
->old_length
= (bfd_size_type
) (p
->current
- p
->origin
);
5258 p
->current
= p
->origin
;
5261 for (o
= output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5263 /* Save the last size for possible use by bfd_relax_section. */
5264 o
->rawsize
= o
->size
;
5269 /* Worker for lang_gc_sections_1. */
5272 gc_section_callback (lang_wild_statement_type
*ptr
,
5273 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5275 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5276 void *data ATTRIBUTE_UNUSED
)
5278 /* If the wild pattern was marked KEEP, the member sections
5279 should be as well. */
5280 if (ptr
->keep_sections
)
5281 section
->flags
|= SEC_KEEP
;
5284 /* Iterate over sections marking them against GC. */
5287 lang_gc_sections_1 (lang_statement_union_type
*s
)
5289 for (; s
!= NULL
; s
= s
->header
.next
)
5291 switch (s
->header
.type
)
5293 case lang_wild_statement_enum
:
5294 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5296 case lang_constructors_statement_enum
:
5297 lang_gc_sections_1 (constructor_list
.head
);
5299 case lang_output_section_statement_enum
:
5300 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5302 case lang_group_statement_enum
:
5303 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5312 lang_gc_sections (void)
5314 struct bfd_link_hash_entry
*h
;
5315 ldlang_undef_chain_list_type
*ulist
;
5317 /* Keep all sections so marked in the link script. */
5319 lang_gc_sections_1 (statement_list
.head
);
5321 /* Keep all sections containing symbols undefined on the command-line,
5322 and the section containing the entry symbol. */
5324 for (ulist
= link_info
.gc_sym_list
; ulist
; ulist
= ulist
->next
)
5326 h
= bfd_link_hash_lookup (link_info
.hash
, ulist
->name
,
5327 FALSE
, FALSE
, FALSE
);
5330 && (h
->type
== bfd_link_hash_defined
5331 || h
->type
== bfd_link_hash_defweak
)
5332 && ! bfd_is_abs_section (h
->u
.def
.section
))
5334 h
->u
.def
.section
->flags
|= SEC_KEEP
;
5338 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5339 the special case of debug info. (See bfd/stabs.c)
5340 Twiddle the flag here, to simplify later linker code. */
5341 if (link_info
.relocatable
)
5343 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5346 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5347 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5348 sec
->flags
&= ~SEC_EXCLUDE
;
5352 if (link_info
.gc_sections
)
5353 bfd_gc_sections (output_bfd
, &link_info
);
5359 current_target
= default_target
;
5361 /* Open the output file. */
5362 lang_for_each_statement (ldlang_open_output
);
5365 ldemul_create_output_section_statements ();
5367 /* Add to the hash table all undefineds on the command line. */
5368 lang_place_undefineds ();
5370 if (!bfd_section_already_linked_table_init ())
5371 einfo (_("%P%F: Failed to create hash table\n"));
5373 /* Create a bfd for each input file. */
5374 current_target
= default_target
;
5375 open_input_bfds (statement_list
.head
, FALSE
);
5377 link_info
.gc_sym_list
= &entry_symbol
;
5378 if (entry_symbol
.name
== NULL
)
5379 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
5381 ldemul_after_open ();
5383 bfd_section_already_linked_table_free ();
5385 /* Make sure that we're not mixing architectures. We call this
5386 after all the input files have been opened, but before we do any
5387 other processing, so that any operations merge_private_bfd_data
5388 does on the output file will be known during the rest of the
5392 /* Handle .exports instead of a version script if we're told to do so. */
5393 if (command_line
.version_exports_section
)
5394 lang_do_version_exports_section ();
5396 /* Build all sets based on the information gathered from the input
5398 ldctor_build_sets ();
5400 /* Remove unreferenced sections if asked to. */
5401 lang_gc_sections ();
5403 /* Size up the common data. */
5406 /* Update wild statements. */
5407 update_wild_statements (statement_list
.head
);
5409 /* Run through the contours of the script and attach input sections
5410 to the correct output sections. */
5411 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
5413 /* Find any sections not attached explicitly and handle them. */
5414 lang_place_orphans ();
5416 if (! link_info
.relocatable
)
5420 /* Merge SEC_MERGE sections. This has to be done after GC of
5421 sections, so that GCed sections are not merged, but before
5422 assigning dynamic symbols, since removing whole input sections
5424 bfd_merge_sections (output_bfd
, &link_info
);
5426 /* Look for a text section and set the readonly attribute in it. */
5427 found
= bfd_get_section_by_name (output_bfd
, ".text");
5431 if (config
.text_read_only
)
5432 found
->flags
|= SEC_READONLY
;
5434 found
->flags
&= ~SEC_READONLY
;
5438 /* Do anything special before sizing sections. This is where ELF
5439 and other back-ends size dynamic sections. */
5440 ldemul_before_allocation ();
5442 /* We must record the program headers before we try to fix the
5443 section positions, since they will affect SIZEOF_HEADERS. */
5444 lang_record_phdrs ();
5446 /* Size up the sections. */
5447 lang_size_sections (statement_list
.head
, abs_output_section
,
5448 &statement_list
.head
, 0, 0, NULL
,
5449 command_line
.relax
? FALSE
: TRUE
);
5451 /* Now run around and relax if we can. */
5452 if (command_line
.relax
)
5454 /* Keep relaxing until bfd_relax_section gives up. */
5455 bfd_boolean relax_again
;
5459 relax_again
= FALSE
;
5461 /* Note: pe-dll.c does something like this also. If you find
5462 you need to change this code, you probably need to change
5463 pe-dll.c also. DJ */
5465 /* Do all the assignments with our current guesses as to
5467 lang_do_assignments (statement_list
.head
, abs_output_section
,
5470 /* We must do this after lang_do_assignments, because it uses
5472 lang_reset_memory_regions ();
5474 /* Perform another relax pass - this time we know where the
5475 globals are, so can make a better guess. */
5476 lang_size_sections (statement_list
.head
, abs_output_section
,
5477 &statement_list
.head
, 0, 0, &relax_again
, FALSE
);
5479 /* If the normal relax is done and the relax finalize pass
5480 is not performed yet, we perform another relax pass. */
5481 if (!relax_again
&& link_info
.need_relax_finalize
)
5483 link_info
.need_relax_finalize
= FALSE
;
5487 while (relax_again
);
5489 /* Final extra sizing to report errors. */
5490 lang_do_assignments (statement_list
.head
, abs_output_section
, NULL
, 0);
5491 lang_reset_memory_regions ();
5492 lang_size_sections (statement_list
.head
, abs_output_section
,
5493 &statement_list
.head
, 0, 0, NULL
, TRUE
);
5496 /* See if anything special should be done now we know how big
5498 ldemul_after_allocation ();
5500 /* Fix any .startof. or .sizeof. symbols. */
5501 lang_set_startof ();
5503 /* Do all the assignments, now that we know the final resting places
5504 of all the symbols. */
5506 lang_do_assignments (statement_list
.head
, abs_output_section
, NULL
, 0);
5508 /* Make sure that the section addresses make sense. */
5509 if (! link_info
.relocatable
5510 && command_line
.check_section_addresses
)
5511 lang_check_section_addresses ();
5518 /* EXPORTED TO YACC */
5521 lang_add_wild (struct wildcard_spec
*filespec
,
5522 struct wildcard_list
*section_list
,
5523 bfd_boolean keep_sections
)
5525 struct wildcard_list
*curr
, *next
;
5526 lang_wild_statement_type
*new;
5528 /* Reverse the list as the parser puts it back to front. */
5529 for (curr
= section_list
, section_list
= NULL
;
5531 section_list
= curr
, curr
= next
)
5533 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
5534 placed_commons
= TRUE
;
5537 curr
->next
= section_list
;
5540 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
5542 if (strcmp (filespec
->name
, "*") == 0)
5543 filespec
->name
= NULL
;
5544 else if (! wildcardp (filespec
->name
))
5545 lang_has_input_file
= TRUE
;
5548 new = new_stat (lang_wild_statement
, stat_ptr
);
5549 new->filename
= NULL
;
5550 new->filenames_sorted
= FALSE
;
5551 if (filespec
!= NULL
)
5553 new->filename
= filespec
->name
;
5554 new->filenames_sorted
= filespec
->sorted
== by_name
;
5556 new->section_list
= section_list
;
5557 new->keep_sections
= keep_sections
;
5558 lang_list_init (&new->children
);
5559 analyze_walk_wild_section_handler (new);
5563 lang_section_start (const char *name
, etree_type
*address
,
5564 const segment_type
*segment
)
5566 lang_address_statement_type
*ad
;
5568 ad
= new_stat (lang_address_statement
, stat_ptr
);
5569 ad
->section_name
= name
;
5570 ad
->address
= address
;
5571 ad
->segment
= segment
;
5574 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5575 because of a -e argument on the command line, or zero if this is
5576 called by ENTRY in a linker script. Command line arguments take
5580 lang_add_entry (const char *name
, bfd_boolean cmdline
)
5582 if (entry_symbol
.name
== NULL
5584 || ! entry_from_cmdline
)
5586 entry_symbol
.name
= name
;
5587 entry_from_cmdline
= cmdline
;
5591 /* Set the default start symbol to NAME. .em files should use this,
5592 not lang_add_entry, to override the use of "start" if neither the
5593 linker script nor the command line specifies an entry point. NAME
5594 must be permanently allocated. */
5596 lang_default_entry (const char *name
)
5598 entry_symbol_default
= name
;
5602 lang_add_target (const char *name
)
5604 lang_target_statement_type
*new = new_stat (lang_target_statement
,
5612 lang_add_map (const char *name
)
5619 map_option_f
= TRUE
;
5627 lang_add_fill (fill_type
*fill
)
5629 lang_fill_statement_type
*new = new_stat (lang_fill_statement
,
5636 lang_add_data (int type
, union etree_union
*exp
)
5639 lang_data_statement_type
*new = new_stat (lang_data_statement
,
5647 /* Create a new reloc statement. RELOC is the BFD relocation type to
5648 generate. HOWTO is the corresponding howto structure (we could
5649 look this up, but the caller has already done so). SECTION is the
5650 section to generate a reloc against, or NAME is the name of the
5651 symbol to generate a reloc against. Exactly one of SECTION and
5652 NAME must be NULL. ADDEND is an expression for the addend. */
5655 lang_add_reloc (bfd_reloc_code_real_type reloc
,
5656 reloc_howto_type
*howto
,
5659 union etree_union
*addend
)
5661 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
5665 p
->section
= section
;
5667 p
->addend_exp
= addend
;
5669 p
->addend_value
= 0;
5670 p
->output_section
= NULL
;
5674 lang_assignment_statement_type
*
5675 lang_add_assignment (etree_type
*exp
)
5677 lang_assignment_statement_type
*new = new_stat (lang_assignment_statement
,
5685 lang_add_attribute (enum statement_enum attribute
)
5687 new_statement (attribute
, sizeof (lang_statement_union_type
), stat_ptr
);
5691 lang_startup (const char *name
)
5693 if (startup_file
!= NULL
)
5695 einfo (_("%P%Fmultiple STARTUP files\n"));
5697 first_file
->filename
= name
;
5698 first_file
->local_sym_name
= name
;
5699 first_file
->real
= TRUE
;
5701 startup_file
= name
;
5705 lang_float (bfd_boolean maybe
)
5707 lang_float_flag
= maybe
;
5711 /* Work out the load- and run-time regions from a script statement, and
5712 store them in *LMA_REGION and *REGION respectively.
5714 MEMSPEC is the name of the run-time region, or the value of
5715 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5716 LMA_MEMSPEC is the name of the load-time region, or null if the
5717 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5718 had an explicit load address.
5720 It is an error to specify both a load region and a load address. */
5723 lang_get_regions (lang_memory_region_type
**region
,
5724 lang_memory_region_type
**lma_region
,
5725 const char *memspec
,
5726 const char *lma_memspec
,
5727 bfd_boolean have_lma
,
5728 bfd_boolean have_vma
)
5730 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
5732 /* If no runtime region or VMA has been specified, but the load region
5733 has been specified, then use the load region for the runtime region
5735 if (lma_memspec
!= NULL
5737 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
5738 *region
= *lma_region
;
5740 *region
= lang_memory_region_lookup (memspec
, FALSE
);
5742 if (have_lma
&& lma_memspec
!= 0)
5743 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5747 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
5748 lang_output_section_phdr_list
*phdrs
,
5749 const char *lma_memspec
)
5751 lang_get_regions (¤t_section
->region
,
5752 ¤t_section
->lma_region
,
5753 memspec
, lma_memspec
,
5754 current_section
->load_base
!= NULL
,
5755 current_section
->addr_tree
!= NULL
);
5756 current_section
->fill
= fill
;
5757 current_section
->phdrs
= phdrs
;
5758 stat_ptr
= &statement_list
;
5761 /* Create an absolute symbol with the given name with the value of the
5762 address of first byte of the section named.
5764 If the symbol already exists, then do nothing. */
5767 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
5769 struct bfd_link_hash_entry
*h
;
5771 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5773 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5775 if (h
->type
== bfd_link_hash_new
5776 || h
->type
== bfd_link_hash_undefined
)
5780 h
->type
= bfd_link_hash_defined
;
5782 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5786 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, sec
);
5788 h
->u
.def
.section
= bfd_abs_section_ptr
;
5792 /* Create an absolute symbol with the given name with the value of the
5793 address of the first byte after the end of the section named.
5795 If the symbol already exists, then do nothing. */
5798 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
5800 struct bfd_link_hash_entry
*h
;
5802 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5804 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5806 if (h
->type
== bfd_link_hash_new
5807 || h
->type
== bfd_link_hash_undefined
)
5811 h
->type
= bfd_link_hash_defined
;
5813 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5817 h
->u
.def
.value
= (bfd_get_section_vma (output_bfd
, sec
)
5818 + TO_ADDR (sec
->size
));
5820 h
->u
.def
.section
= bfd_abs_section_ptr
;
5825 lang_statement_append (lang_statement_list_type
*list
,
5826 lang_statement_union_type
*element
,
5827 lang_statement_union_type
**field
)
5829 *(list
->tail
) = element
;
5833 /* Set the output format type. -oformat overrides scripts. */
5836 lang_add_output_format (const char *format
,
5841 if (output_target
== NULL
|| !from_script
)
5843 if (command_line
.endian
== ENDIAN_BIG
5846 else if (command_line
.endian
== ENDIAN_LITTLE
5850 output_target
= format
;
5854 /* Enter a group. This creates a new lang_group_statement, and sets
5855 stat_ptr to build new statements within the group. */
5858 lang_enter_group (void)
5860 lang_group_statement_type
*g
;
5862 g
= new_stat (lang_group_statement
, stat_ptr
);
5863 lang_list_init (&g
->children
);
5864 stat_ptr
= &g
->children
;
5867 /* Leave a group. This just resets stat_ptr to start writing to the
5868 regular list of statements again. Note that this will not work if
5869 groups can occur inside anything else which can adjust stat_ptr,
5870 but currently they can't. */
5873 lang_leave_group (void)
5875 stat_ptr
= &statement_list
;
5878 /* Add a new program header. This is called for each entry in a PHDRS
5879 command in a linker script. */
5882 lang_new_phdr (const char *name
,
5884 bfd_boolean filehdr
,
5889 struct lang_phdr
*n
, **pp
;
5891 n
= stat_alloc (sizeof (struct lang_phdr
));
5894 n
->type
= exp_get_value_int (type
, 0, "program header type",
5895 lang_final_phase_enum
);
5896 n
->filehdr
= filehdr
;
5901 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
5906 /* Record the program header information in the output BFD. FIXME: We
5907 should not be calling an ELF specific function here. */
5910 lang_record_phdrs (void)
5914 lang_output_section_phdr_list
*last
;
5915 struct lang_phdr
*l
;
5916 lang_output_section_statement_type
*os
;
5919 secs
= xmalloc (alc
* sizeof (asection
*));
5921 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
5928 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5932 lang_output_section_phdr_list
*pl
;
5934 if (os
->constraint
== -1)
5942 if (os
->sectype
== noload_section
5943 || os
->bfd_section
== NULL
5944 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
5949 if (os
->bfd_section
== NULL
)
5952 for (; pl
!= NULL
; pl
= pl
->next
)
5954 if (strcmp (pl
->name
, l
->name
) == 0)
5959 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
5961 secs
[c
] = os
->bfd_section
;
5968 if (l
->flags
== NULL
)
5971 flags
= exp_get_vma (l
->flags
, 0, "phdr flags",
5972 lang_final_phase_enum
);
5977 at
= exp_get_vma (l
->at
, 0, "phdr load address",
5978 lang_final_phase_enum
);
5980 if (! bfd_record_phdr (output_bfd
, l
->type
,
5981 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
5982 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
5983 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
5988 /* Make sure all the phdr assignments succeeded. */
5989 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5993 lang_output_section_phdr_list
*pl
;
5995 if (os
->constraint
== -1
5996 || os
->bfd_section
== NULL
)
5999 for (pl
= os
->phdrs
;
6002 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6003 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6004 os
->name
, pl
->name
);
6008 /* Record a list of sections which may not be cross referenced. */
6011 lang_add_nocrossref (lang_nocrossref_type
*l
)
6013 struct lang_nocrossrefs
*n
;
6015 n
= xmalloc (sizeof *n
);
6016 n
->next
= nocrossref_list
;
6018 nocrossref_list
= n
;
6020 /* Set notice_all so that we get informed about all symbols. */
6021 link_info
.notice_all
= TRUE
;
6024 /* Overlay handling. We handle overlays with some static variables. */
6026 /* The overlay virtual address. */
6027 static etree_type
*overlay_vma
;
6028 /* And subsection alignment. */
6029 static etree_type
*overlay_subalign
;
6031 /* An expression for the maximum section size seen so far. */
6032 static etree_type
*overlay_max
;
6034 /* A list of all the sections in this overlay. */
6036 struct overlay_list
{
6037 struct overlay_list
*next
;
6038 lang_output_section_statement_type
*os
;
6041 static struct overlay_list
*overlay_list
;
6043 /* Start handling an overlay. */
6046 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6048 /* The grammar should prevent nested overlays from occurring. */
6049 ASSERT (overlay_vma
== NULL
6050 && overlay_subalign
== NULL
6051 && overlay_max
== NULL
);
6053 overlay_vma
= vma_expr
;
6054 overlay_subalign
= subalign
;
6057 /* Start a section in an overlay. We handle this by calling
6058 lang_enter_output_section_statement with the correct VMA.
6059 lang_leave_overlay sets up the LMA and memory regions. */
6062 lang_enter_overlay_section (const char *name
)
6064 struct overlay_list
*n
;
6067 lang_enter_output_section_statement (name
, overlay_vma
, normal_section
,
6068 0, overlay_subalign
, 0, 0);
6070 /* If this is the first section, then base the VMA of future
6071 sections on this one. This will work correctly even if `.' is
6072 used in the addresses. */
6073 if (overlay_list
== NULL
)
6074 overlay_vma
= exp_nameop (ADDR
, name
);
6076 /* Remember the section. */
6077 n
= xmalloc (sizeof *n
);
6078 n
->os
= current_section
;
6079 n
->next
= overlay_list
;
6082 size
= exp_nameop (SIZEOF
, name
);
6084 /* Arrange to work out the maximum section end address. */
6085 if (overlay_max
== NULL
)
6088 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6091 /* Finish a section in an overlay. There isn't any special to do
6095 lang_leave_overlay_section (fill_type
*fill
,
6096 lang_output_section_phdr_list
*phdrs
)
6103 name
= current_section
->name
;
6105 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6106 region and that no load-time region has been specified. It doesn't
6107 really matter what we say here, since lang_leave_overlay will
6109 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6111 /* Define the magic symbols. */
6113 clean
= xmalloc (strlen (name
) + 1);
6115 for (s1
= name
; *s1
!= '\0'; s1
++)
6116 if (ISALNUM (*s1
) || *s1
== '_')
6120 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6121 sprintf (buf
, "__load_start_%s", clean
);
6122 lang_add_assignment (exp_assop ('=', buf
,
6123 exp_nameop (LOADADDR
, name
)));
6125 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6126 sprintf (buf
, "__load_stop_%s", clean
);
6127 lang_add_assignment (exp_assop ('=', buf
,
6129 exp_nameop (LOADADDR
, name
),
6130 exp_nameop (SIZEOF
, name
))));
6135 /* Finish an overlay. If there are any overlay wide settings, this
6136 looks through all the sections in the overlay and sets them. */
6139 lang_leave_overlay (etree_type
*lma_expr
,
6142 const char *memspec
,
6143 lang_output_section_phdr_list
*phdrs
,
6144 const char *lma_memspec
)
6146 lang_memory_region_type
*region
;
6147 lang_memory_region_type
*lma_region
;
6148 struct overlay_list
*l
;
6149 lang_nocrossref_type
*nocrossref
;
6151 lang_get_regions (®ion
, &lma_region
,
6152 memspec
, lma_memspec
,
6153 lma_expr
!= NULL
, FALSE
);
6157 /* After setting the size of the last section, set '.' to end of the
6159 if (overlay_list
!= NULL
)
6160 overlay_list
->os
->update_dot_tree
6161 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6166 struct overlay_list
*next
;
6168 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6171 l
->os
->region
= region
;
6172 l
->os
->lma_region
= lma_region
;
6174 /* The first section has the load address specified in the
6175 OVERLAY statement. The rest are worked out from that.
6176 The base address is not needed (and should be null) if
6177 an LMA region was specified. */
6179 l
->os
->load_base
= lma_expr
;
6180 else if (lma_region
== 0)
6181 l
->os
->load_base
= exp_binop ('+',
6182 exp_nameop (LOADADDR
, l
->next
->os
->name
),
6183 exp_nameop (SIZEOF
, l
->next
->os
->name
));
6185 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6186 l
->os
->phdrs
= phdrs
;
6190 lang_nocrossref_type
*nc
;
6192 nc
= xmalloc (sizeof *nc
);
6193 nc
->name
= l
->os
->name
;
6194 nc
->next
= nocrossref
;
6203 if (nocrossref
!= NULL
)
6204 lang_add_nocrossref (nocrossref
);
6207 overlay_list
= NULL
;
6211 /* Version handling. This is only useful for ELF. */
6213 /* This global variable holds the version tree that we build. */
6215 struct bfd_elf_version_tree
*lang_elf_version_info
;
6217 /* If PREV is NULL, return first version pattern matching particular symbol.
6218 If PREV is non-NULL, return first version pattern matching particular
6219 symbol after PREV (previously returned by lang_vers_match). */
6221 static struct bfd_elf_version_expr
*
6222 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6223 struct bfd_elf_version_expr
*prev
,
6226 const char *cxx_sym
= sym
;
6227 const char *java_sym
= sym
;
6228 struct bfd_elf_version_expr
*expr
= NULL
;
6230 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6232 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6236 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6238 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6243 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6245 struct bfd_elf_version_expr e
;
6247 switch (prev
? prev
->mask
: 0)
6250 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6253 expr
= htab_find (head
->htab
, &e
);
6254 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6255 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6261 case BFD_ELF_VERSION_C_TYPE
:
6262 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6265 expr
= htab_find (head
->htab
, &e
);
6266 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6267 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6273 case BFD_ELF_VERSION_CXX_TYPE
:
6274 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6276 e
.symbol
= java_sym
;
6277 expr
= htab_find (head
->htab
, &e
);
6278 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6279 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6290 /* Finally, try the wildcards. */
6291 if (prev
== NULL
|| prev
->symbol
)
6292 expr
= head
->remaining
;
6299 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6302 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6304 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6308 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6315 free ((char *) cxx_sym
);
6316 if (java_sym
!= sym
)
6317 free ((char *) java_sym
);
6321 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6322 return a string pointing to the symbol name. */
6325 realsymbol (const char *pattern
)
6328 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6329 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6331 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6333 /* It is a glob pattern only if there is no preceding
6335 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6343 /* Remove the preceding backslash. */
6350 backslash
= *p
== '\\';
6365 /* This is called for each variable name or match expression. */
6367 struct bfd_elf_version_expr
*
6368 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
6372 struct bfd_elf_version_expr
*ret
;
6374 ret
= xmalloc (sizeof *ret
);
6379 ret
->symbol
= realsymbol (new);
6381 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
6382 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6383 else if (strcasecmp (lang
, "C++") == 0)
6384 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
6385 else if (strcasecmp (lang
, "Java") == 0)
6386 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
6389 einfo (_("%X%P: unknown language `%s' in version information\n"),
6391 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6394 return ldemul_new_vers_pattern (ret
);
6397 /* This is called for each set of variable names and match
6400 struct bfd_elf_version_tree
*
6401 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
6402 struct bfd_elf_version_expr
*locals
)
6404 struct bfd_elf_version_tree
*ret
;
6406 ret
= xcalloc (1, sizeof *ret
);
6407 ret
->globals
.list
= globals
;
6408 ret
->locals
.list
= locals
;
6409 ret
->match
= lang_vers_match
;
6410 ret
->name_indx
= (unsigned int) -1;
6414 /* This static variable keeps track of version indices. */
6416 static int version_index
;
6419 version_expr_head_hash (const void *p
)
6421 const struct bfd_elf_version_expr
*e
= p
;
6423 return htab_hash_string (e
->symbol
);
6427 version_expr_head_eq (const void *p1
, const void *p2
)
6429 const struct bfd_elf_version_expr
*e1
= p1
;
6430 const struct bfd_elf_version_expr
*e2
= p2
;
6432 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
6436 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
6439 struct bfd_elf_version_expr
*e
, *next
;
6440 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
6442 for (e
= head
->list
; e
; e
= e
->next
)
6446 head
->mask
|= e
->mask
;
6451 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
6452 version_expr_head_eq
, NULL
);
6453 list_loc
= &head
->list
;
6454 remaining_loc
= &head
->remaining
;
6455 for (e
= head
->list
; e
; e
= next
)
6461 remaining_loc
= &e
->next
;
6465 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
6469 struct bfd_elf_version_expr
*e1
, *last
;
6475 if (e1
->mask
== e
->mask
)
6483 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
6487 /* This is a duplicate. */
6488 /* FIXME: Memory leak. Sometimes pattern is not
6489 xmalloced alone, but in larger chunk of memory. */
6490 /* free (e->symbol); */
6495 e
->next
= last
->next
;
6503 list_loc
= &e
->next
;
6507 *remaining_loc
= NULL
;
6508 *list_loc
= head
->remaining
;
6511 head
->remaining
= head
->list
;
6514 /* This is called when we know the name and dependencies of the
6518 lang_register_vers_node (const char *name
,
6519 struct bfd_elf_version_tree
*version
,
6520 struct bfd_elf_version_deps
*deps
)
6522 struct bfd_elf_version_tree
*t
, **pp
;
6523 struct bfd_elf_version_expr
*e1
;
6528 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
6529 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
6531 einfo (_("%X%P: anonymous version tag cannot be combined"
6532 " with other version tags\n"));
6537 /* Make sure this node has a unique name. */
6538 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6539 if (strcmp (t
->name
, name
) == 0)
6540 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
6542 lang_finalize_version_expr_head (&version
->globals
);
6543 lang_finalize_version_expr_head (&version
->locals
);
6545 /* Check the global and local match names, and make sure there
6546 aren't any duplicates. */
6548 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
6550 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6552 struct bfd_elf_version_expr
*e2
;
6554 if (t
->locals
.htab
&& e1
->symbol
)
6556 e2
= htab_find (t
->locals
.htab
, e1
);
6557 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6559 if (e1
->mask
== e2
->mask
)
6560 einfo (_("%X%P: duplicate expression `%s'"
6561 " in version information\n"), e1
->symbol
);
6565 else if (!e1
->symbol
)
6566 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6567 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6568 && e1
->mask
== e2
->mask
)
6569 einfo (_("%X%P: duplicate expression `%s'"
6570 " in version information\n"), e1
->pattern
);
6574 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
6576 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6578 struct bfd_elf_version_expr
*e2
;
6580 if (t
->globals
.htab
&& e1
->symbol
)
6582 e2
= htab_find (t
->globals
.htab
, e1
);
6583 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6585 if (e1
->mask
== e2
->mask
)
6586 einfo (_("%X%P: duplicate expression `%s'"
6587 " in version information\n"),
6592 else if (!e1
->symbol
)
6593 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6594 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6595 && e1
->mask
== e2
->mask
)
6596 einfo (_("%X%P: duplicate expression `%s'"
6597 " in version information\n"), e1
->pattern
);
6601 version
->deps
= deps
;
6602 version
->name
= name
;
6603 if (name
[0] != '\0')
6606 version
->vernum
= version_index
;
6609 version
->vernum
= 0;
6611 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6616 /* This is called when we see a version dependency. */
6618 struct bfd_elf_version_deps
*
6619 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
6621 struct bfd_elf_version_deps
*ret
;
6622 struct bfd_elf_version_tree
*t
;
6624 ret
= xmalloc (sizeof *ret
);
6627 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6629 if (strcmp (t
->name
, name
) == 0)
6631 ret
->version_needed
= t
;
6636 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
6642 lang_do_version_exports_section (void)
6644 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
6646 LANG_FOR_EACH_INPUT_STATEMENT (is
)
6648 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
6656 contents
= xmalloc (len
);
6657 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
6658 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
6661 while (p
< contents
+ len
)
6663 greg
= lang_new_vers_pattern (greg
, p
, NULL
);
6664 p
= strchr (p
, '\0') + 1;
6667 /* Do not free the contents, as we used them creating the regex. */
6669 /* Do not include this section in the link. */
6670 sec
->flags
|= SEC_EXCLUDE
;
6673 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
);
6674 lang_register_vers_node (command_line
.version_exports_section
,
6675 lang_new_vers_node (greg
, lreg
), NULL
);
6679 lang_add_unique (const char *name
)
6681 struct unique_sections
*ent
;
6683 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
6684 if (strcmp (ent
->name
, name
) == 0)
6687 ent
= xmalloc (sizeof *ent
);
6688 ent
->name
= xstrdup (name
);
6689 ent
->next
= unique_section_list
;
6690 unique_section_list
= ent
;