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
;
105 /* Functions that traverse the linker script and might evaluate
106 DEFINED() need to increment this. */
107 int lang_statement_iteration
= 0;
109 etree_type
*base
; /* Relocation base - or null */
111 /* Return TRUE if the PATTERN argument is a wildcard pattern.
112 Although backslashes are treated specially if a pattern contains
113 wildcards, we do not consider the mere presence of a backslash to
114 be enough to cause the pattern to be treated as a wildcard.
115 That lets us handle DOS filenames more naturally. */
116 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
118 #define new_stat(x, y) \
119 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
121 #define outside_section_address(q) \
122 ((q)->output_offset + (q)->output_section->vma)
124 #define outside_symbol_address(q) \
125 ((q)->value + outside_section_address (q->section))
127 #define SECTION_NAME_MAP_LENGTH (16)
130 stat_alloc (size_t size
)
132 return obstack_alloc (&stat_obstack
, size
);
136 unique_section_p (const asection
*sec
)
138 struct unique_sections
*unam
;
141 if (link_info
.relocatable
142 && sec
->owner
!= NULL
143 && bfd_is_group_section (sec
->owner
, sec
))
147 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
148 if (wildcardp (unam
->name
)
149 ? fnmatch (unam
->name
, secnam
, 0) == 0
150 : strcmp (unam
->name
, secnam
) == 0)
158 /* Generic traversal routines for finding matching sections. */
160 /* Try processing a section against a wildcard. This just calls
161 the callback unless the filename exclusion list is present
162 and excludes the file. It's hardly ever present so this
163 function is very fast. */
166 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
167 lang_input_statement_type
*file
,
169 struct wildcard_list
*sec
,
173 bfd_boolean skip
= FALSE
;
174 struct name_list
*list_tmp
;
176 /* Don't process sections from files which were
178 for (list_tmp
= sec
->spec
.exclude_name_list
;
180 list_tmp
= list_tmp
->next
)
182 bfd_boolean is_wildcard
= wildcardp (list_tmp
->name
);
184 skip
= fnmatch (list_tmp
->name
, file
->filename
, 0) == 0;
186 skip
= strcmp (list_tmp
->name
, file
->filename
) == 0;
188 /* If this file is part of an archive, and the archive is
189 excluded, exclude this file. */
190 if (! skip
&& file
->the_bfd
!= NULL
191 && file
->the_bfd
->my_archive
!= NULL
192 && file
->the_bfd
->my_archive
->filename
!= NULL
)
195 skip
= fnmatch (list_tmp
->name
,
196 file
->the_bfd
->my_archive
->filename
,
199 skip
= strcmp (list_tmp
->name
,
200 file
->the_bfd
->my_archive
->filename
) == 0;
208 (*callback
) (ptr
, sec
, s
, file
, data
);
211 /* Lowest common denominator routine that can handle everything correctly,
215 walk_wild_section_general (lang_wild_statement_type
*ptr
,
216 lang_input_statement_type
*file
,
221 struct wildcard_list
*sec
;
223 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
225 sec
= ptr
->section_list
;
227 (*callback
) (ptr
, sec
, s
, file
, data
);
231 bfd_boolean skip
= FALSE
;
233 if (sec
->spec
.name
!= NULL
)
235 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
237 if (wildcardp (sec
->spec
.name
))
238 skip
= fnmatch (sec
->spec
.name
, sname
, 0) != 0;
240 skip
= strcmp (sec
->spec
.name
, sname
) != 0;
244 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
251 /* Routines to find a single section given its name. If there's more
252 than one section with that name, we report that. */
256 asection
*found_section
;
257 bfd_boolean multiple_sections_found
;
258 } section_iterator_callback_data
;
261 section_iterator_callback (bfd
*bfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
263 section_iterator_callback_data
*d
= data
;
265 if (d
->found_section
!= NULL
)
267 d
->multiple_sections_found
= TRUE
;
271 d
->found_section
= s
;
276 find_section (lang_input_statement_type
*file
,
277 struct wildcard_list
*sec
,
278 bfd_boolean
*multiple_sections_found
)
280 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
282 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
283 section_iterator_callback
, &cb_data
);
284 *multiple_sections_found
= cb_data
.multiple_sections_found
;
285 return cb_data
.found_section
;
288 /* Code for handling simple wildcards without going through fnmatch,
289 which can be expensive because of charset translations etc. */
291 /* A simple wild is a literal string followed by a single '*',
292 where the literal part is at least 4 characters long. */
295 is_simple_wild (const char *name
)
297 size_t len
= strcspn (name
, "*?[");
298 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
302 match_simple_wild (const char *pattern
, const char *name
)
304 /* The first four characters of the pattern are guaranteed valid
305 non-wildcard characters. So we can go faster. */
306 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
307 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
312 while (*pattern
!= '*')
313 if (*name
++ != *pattern
++)
319 /* Specialized, optimized routines for handling different kinds of
323 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
324 lang_input_statement_type
*file
,
328 /* We can just do a hash lookup for the section with the right name.
329 But if that lookup discovers more than one section with the name
330 (should be rare), we fall back to the general algorithm because
331 we would otherwise have to sort the sections to make sure they
332 get processed in the bfd's order. */
333 bfd_boolean multiple_sections_found
;
334 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
335 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
337 if (multiple_sections_found
)
338 walk_wild_section_general (ptr
, file
, callback
, data
);
340 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
344 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
345 lang_input_statement_type
*file
,
350 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
352 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
354 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
355 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
358 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
363 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
364 lang_input_statement_type
*file
,
369 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
370 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
371 bfd_boolean multiple_sections_found
;
372 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
374 if (multiple_sections_found
)
376 walk_wild_section_general (ptr
, file
, callback
, data
);
380 /* Note that if the section was not found, s0 is NULL and
381 we'll simply never succeed the s == s0 test below. */
382 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
384 /* Recall that in this code path, a section cannot satisfy more
385 than one spec, so if s == s0 then it cannot match
388 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
391 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
392 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
395 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
402 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
403 lang_input_statement_type
*file
,
408 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
409 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
410 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
411 bfd_boolean multiple_sections_found
;
412 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
414 if (multiple_sections_found
)
416 walk_wild_section_general (ptr
, file
, callback
, data
);
420 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
423 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
426 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
427 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
430 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
433 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
435 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
443 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
444 lang_input_statement_type
*file
,
449 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
450 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
451 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
452 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
453 bfd_boolean multiple_sections_found
;
454 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
456 if (multiple_sections_found
)
458 walk_wild_section_general (ptr
, file
, callback
, data
);
462 s1
= find_section (file
, sec1
, &multiple_sections_found
);
463 if (multiple_sections_found
)
465 walk_wild_section_general (ptr
, file
, callback
, data
);
469 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
472 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
475 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
478 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
479 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
483 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
487 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
489 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
497 walk_wild_section (lang_wild_statement_type
*ptr
,
498 lang_input_statement_type
*file
,
502 if (file
->just_syms_flag
)
505 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
508 /* Returns TRUE when name1 is a wildcard spec that might match
509 something name2 can match. We're conservative: we return FALSE
510 only if the prefixes of name1 and name2 are different up to the
511 first wildcard character. */
514 wild_spec_can_overlap (const char *name1
, const char *name2
)
516 size_t prefix1_len
= strcspn (name1
, "?*[");
517 size_t prefix2_len
= strcspn (name2
, "?*[");
518 size_t min_prefix_len
;
520 /* Note that if there is no wildcard character, then we treat the
521 terminating 0 as part of the prefix. Thus ".text" won't match
522 ".text." or ".text.*", for example. */
523 if (name1
[prefix1_len
] == '\0')
525 if (name2
[prefix2_len
] == '\0')
528 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
530 return memcmp (name1
, name2
, min_prefix_len
) == 0;
533 /* Select specialized code to handle various kinds of wildcard
537 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
540 int wild_name_count
= 0;
541 struct wildcard_list
*sec
;
545 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
547 /* Count how many wildcard_specs there are, and how many of those
548 actually use wildcards in the name. Also, bail out if any of the
549 wildcard names are NULL. (Can this actually happen?
550 walk_wild_section used to test for it.) And bail out if any
551 of the wildcards are more complex than a simple string
552 ending in a single '*'. */
553 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
556 if (sec
->spec
.name
== NULL
)
558 if (wildcardp (sec
->spec
.name
))
561 if (!is_simple_wild (sec
->spec
.name
))
566 /* The zero-spec case would be easy to optimize but it doesn't
567 happen in practice. Likewise, more than 4 specs doesn't
568 happen in practice. */
569 if (sec_count
== 0 || sec_count
> 4)
572 /* Check that no two specs can match the same section. */
573 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
575 struct wildcard_list
*sec2
;
576 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
578 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
583 signature
= (sec_count
<< 8) + wild_name_count
;
587 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
590 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
593 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
596 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
599 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
605 /* Now fill the data array with pointers to the specs, first the
606 specs with non-wildcard names, then the specs with wildcard
607 names. It's OK to process the specs in different order from the
608 given order, because we've already determined that no section
609 will match more than one spec. */
611 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
612 if (!wildcardp (sec
->spec
.name
))
613 ptr
->handler_data
[data_counter
++] = sec
;
614 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
615 if (wildcardp (sec
->spec
.name
))
616 ptr
->handler_data
[data_counter
++] = sec
;
619 /* Handle a wild statement for a single file F. */
622 walk_wild_file (lang_wild_statement_type
*s
,
623 lang_input_statement_type
*f
,
627 if (f
->the_bfd
== NULL
628 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
629 walk_wild_section (s
, f
, callback
, data
);
634 /* This is an archive file. We must map each member of the
635 archive separately. */
636 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
637 while (member
!= NULL
)
639 /* When lookup_name is called, it will call the add_symbols
640 entry point for the archive. For each element of the
641 archive which is included, BFD will call ldlang_add_file,
642 which will set the usrdata field of the member to the
643 lang_input_statement. */
644 if (member
->usrdata
!= NULL
)
646 walk_wild_section (s
, member
->usrdata
, callback
, data
);
649 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
655 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
657 const char *file_spec
= s
->filename
;
659 if (file_spec
== NULL
)
661 /* Perform the iteration over all files in the list. */
662 LANG_FOR_EACH_INPUT_STATEMENT (f
)
664 walk_wild_file (s
, f
, callback
, data
);
667 else if (wildcardp (file_spec
))
669 LANG_FOR_EACH_INPUT_STATEMENT (f
)
671 if (fnmatch (file_spec
, f
->filename
, FNM_FILE_NAME
) == 0)
672 walk_wild_file (s
, f
, callback
, data
);
677 lang_input_statement_type
*f
;
679 /* Perform the iteration over a single file. */
680 f
= lookup_name (file_spec
);
682 walk_wild_file (s
, f
, callback
, data
);
686 /* lang_for_each_statement walks the parse tree and calls the provided
687 function for each node. */
690 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
691 lang_statement_union_type
*s
)
693 for (; s
!= NULL
; s
= s
->header
.next
)
697 switch (s
->header
.type
)
699 case lang_constructors_statement_enum
:
700 lang_for_each_statement_worker (func
, constructor_list
.head
);
702 case lang_output_section_statement_enum
:
703 lang_for_each_statement_worker
704 (func
, s
->output_section_statement
.children
.head
);
706 case lang_wild_statement_enum
:
707 lang_for_each_statement_worker (func
,
708 s
->wild_statement
.children
.head
);
710 case lang_group_statement_enum
:
711 lang_for_each_statement_worker (func
,
712 s
->group_statement
.children
.head
);
714 case lang_data_statement_enum
:
715 case lang_reloc_statement_enum
:
716 case lang_object_symbols_statement_enum
:
717 case lang_output_statement_enum
:
718 case lang_target_statement_enum
:
719 case lang_input_section_enum
:
720 case lang_input_statement_enum
:
721 case lang_assignment_statement_enum
:
722 case lang_padding_statement_enum
:
723 case lang_address_statement_enum
:
724 case lang_fill_statement_enum
:
734 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
736 lang_for_each_statement_worker (func
, statement_list
.head
);
739 /*----------------------------------------------------------------------*/
742 lang_list_init (lang_statement_list_type
*list
)
745 list
->tail
= &list
->head
;
748 /* Build a new statement node for the parse tree. */
750 static lang_statement_union_type
*
751 new_statement (enum statement_enum type
,
753 lang_statement_list_type
*list
)
755 lang_statement_union_type
*new;
757 new = stat_alloc (size
);
758 new->header
.type
= type
;
759 new->header
.next
= NULL
;
760 lang_statement_append (list
, new, &new->header
.next
);
764 /* Build a new input file node for the language. There are several
765 ways in which we treat an input file, eg, we only look at symbols,
766 or prefix it with a -l etc.
768 We can be supplied with requests for input files more than once;
769 they may, for example be split over several lines like foo.o(.text)
770 foo.o(.data) etc, so when asked for a file we check that we haven't
771 got it already so we don't duplicate the bfd. */
773 static lang_input_statement_type
*
774 new_afile (const char *name
,
775 lang_input_file_enum_type file_type
,
777 bfd_boolean add_to_list
)
779 lang_input_statement_type
*p
;
782 p
= new_stat (lang_input_statement
, stat_ptr
);
785 p
= stat_alloc (sizeof (lang_input_statement_type
));
786 p
->header
.next
= NULL
;
789 lang_has_input_file
= TRUE
;
791 p
->sysrooted
= FALSE
;
794 case lang_input_file_is_symbols_only_enum
:
796 p
->is_archive
= FALSE
;
798 p
->local_sym_name
= name
;
799 p
->just_syms_flag
= TRUE
;
800 p
->search_dirs_flag
= FALSE
;
802 case lang_input_file_is_fake_enum
:
804 p
->is_archive
= FALSE
;
806 p
->local_sym_name
= name
;
807 p
->just_syms_flag
= FALSE
;
808 p
->search_dirs_flag
= FALSE
;
810 case lang_input_file_is_l_enum
:
811 p
->is_archive
= TRUE
;
814 p
->local_sym_name
= concat ("-l", name
, NULL
);
815 p
->just_syms_flag
= FALSE
;
816 p
->search_dirs_flag
= TRUE
;
818 case lang_input_file_is_marker_enum
:
820 p
->is_archive
= FALSE
;
822 p
->local_sym_name
= name
;
823 p
->just_syms_flag
= FALSE
;
824 p
->search_dirs_flag
= TRUE
;
826 case lang_input_file_is_search_file_enum
:
827 p
->sysrooted
= ldlang_sysrooted_script
;
829 p
->is_archive
= FALSE
;
831 p
->local_sym_name
= name
;
832 p
->just_syms_flag
= FALSE
;
833 p
->search_dirs_flag
= TRUE
;
835 case lang_input_file_is_file_enum
:
837 p
->is_archive
= FALSE
;
839 p
->local_sym_name
= name
;
840 p
->just_syms_flag
= FALSE
;
841 p
->search_dirs_flag
= FALSE
;
848 p
->next_real_file
= NULL
;
851 p
->dynamic
= config
.dynamic_link
;
852 p
->add_needed
= add_needed
;
853 p
->as_needed
= as_needed
;
854 p
->whole_archive
= whole_archive
;
856 lang_statement_append (&input_file_chain
,
857 (lang_statement_union_type
*) p
,
862 lang_input_statement_type
*
863 lang_add_input_file (const char *name
,
864 lang_input_file_enum_type file_type
,
867 lang_has_input_file
= TRUE
;
868 return new_afile (name
, file_type
, target
, TRUE
);
871 struct output_statement_hash_entry
873 struct bfd_hash_entry root
;
874 lang_output_section_statement_type
*entry
;
877 /* The hash table. */
879 static struct bfd_hash_table output_statement_table
;
881 /* Support routines for the hash table used by lang_output_section_find_1,
882 initialize the table, fill in an entry and remove the table. */
884 static struct bfd_hash_entry
*
885 output_statement_newfunc (struct bfd_hash_entry
*entry ATTRIBUTE_UNUSED
,
886 struct bfd_hash_table
*table
,
887 const char *string ATTRIBUTE_UNUSED
)
889 struct output_statement_hash_entry
*ret
890 = bfd_hash_allocate (table
,
891 sizeof (struct output_statement_hash_entry
));
893 return (struct bfd_hash_entry
*) ret
;
897 output_statement_table_init (void)
899 if (! bfd_hash_table_init_n (&output_statement_table
,
900 output_statement_newfunc
, 61))
901 einfo (_("%P%F: Failed to create hash table\n"));
905 output_statement_table_free (void)
907 bfd_hash_table_free (&output_statement_table
);
910 /* Build enough state so that the parser can build its tree. */
915 obstack_begin (&stat_obstack
, 1000);
917 stat_ptr
= &statement_list
;
919 output_statement_table_init ();
921 lang_list_init (stat_ptr
);
923 lang_list_init (&input_file_chain
);
924 lang_list_init (&lang_output_section_statement
);
925 lang_list_init (&file_chain
);
926 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
929 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
931 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
933 /* The value "3" is ad-hoc, somewhat related to the expected number of
934 DEFINED expressions in a linker script. For most default linker
935 scripts, there are none. Why a hash table then? Well, it's somewhat
936 simpler to re-use working machinery than using a linked list in terms
937 of code-complexity here in ld, besides the initialization which just
938 looks like other code here. */
939 if (!bfd_hash_table_init_n (&lang_definedness_table
,
940 lang_definedness_newfunc
, 3))
941 einfo (_("%P%F: out of memory during initialization"));
947 output_statement_table_free ();
950 /*----------------------------------------------------------------------
951 A region is an area of memory declared with the
952 MEMORY { name:org=exp, len=exp ... }
955 We maintain a list of all the regions here.
957 If no regions are specified in the script, then the default is used
958 which is created when looked up to be the entire data space.
960 If create is true we are creating a region inside a MEMORY block.
961 In this case it is probably an error to create a region that has
962 already been created. If we are not inside a MEMORY block it is
963 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
964 and so we issue a warning. */
966 static lang_memory_region_type
*lang_memory_region_list
;
967 static lang_memory_region_type
**lang_memory_region_list_tail
968 = &lang_memory_region_list
;
970 lang_memory_region_type
*
971 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
973 lang_memory_region_type
*p
;
974 lang_memory_region_type
*new;
976 /* NAME is NULL for LMA memspecs if no region was specified. */
980 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
981 if (strcmp (p
->name
, name
) == 0)
984 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
989 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
990 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
992 new = stat_alloc (sizeof (lang_memory_region_type
));
994 new->name
= xstrdup (name
);
997 *lang_memory_region_list_tail
= new;
998 lang_memory_region_list_tail
= &new->next
;
1002 new->length
= ~(bfd_size_type
) 0;
1004 new->had_full_message
= FALSE
;
1009 static lang_memory_region_type
*
1010 lang_memory_default (asection
*section
)
1012 lang_memory_region_type
*p
;
1014 flagword sec_flags
= section
->flags
;
1016 /* Override SEC_DATA to mean a writable section. */
1017 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1018 sec_flags
|= SEC_DATA
;
1020 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1022 if ((p
->flags
& sec_flags
) != 0
1023 && (p
->not_flags
& sec_flags
) == 0)
1028 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1031 static lang_output_section_statement_type
*
1032 lang_output_section_find_1 (const char *const name
, int constraint
)
1034 lang_output_section_statement_type
*lookup
;
1035 struct output_statement_hash_entry
*entry
;
1038 entry
= ((struct output_statement_hash_entry
*)
1039 bfd_hash_lookup (&output_statement_table
, name
, FALSE
,
1041 if (entry
== NULL
|| (lookup
= entry
->entry
) == NULL
)
1044 hash
= entry
->root
.hash
;
1047 if (lookup
->constraint
!= -1
1049 || (constraint
== lookup
->constraint
1050 && constraint
!= SPECIAL
)))
1052 entry
= (struct output_statement_hash_entry
*) entry
->root
.next
;
1053 lookup
= entry
? entry
->entry
: NULL
;
1055 while (entry
!= NULL
1056 && entry
->root
.hash
== hash
1057 && strcmp (name
, lookup
->name
) == 0);
1062 lang_output_section_statement_type
*
1063 lang_output_section_find (const char *const name
)
1065 return lang_output_section_find_1 (name
, 0);
1068 static lang_output_section_statement_type
*
1069 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1071 lang_output_section_statement_type
*lookup
;
1072 lang_output_section_statement_type
**nextp
;
1074 lookup
= lang_output_section_find_1 (name
, constraint
);
1077 struct output_statement_hash_entry
*entry
;
1079 lookup
= new_stat (lang_output_section_statement
, stat_ptr
);
1080 lookup
->region
= NULL
;
1081 lookup
->lma_region
= NULL
;
1083 lookup
->block_value
= 1;
1084 lookup
->name
= name
;
1086 lookup
->next
= NULL
;
1087 lookup
->bfd_section
= NULL
;
1088 lookup
->processed
= FALSE
;
1089 lookup
->constraint
= constraint
;
1090 lookup
->ignored
= FALSE
;
1091 lookup
->sectype
= normal_section
;
1092 lookup
->addr_tree
= NULL
;
1093 lang_list_init (&lookup
->children
);
1095 lookup
->memspec
= NULL
;
1097 lookup
->subsection_alignment
= -1;
1098 lookup
->section_alignment
= -1;
1099 lookup
->load_base
= NULL
;
1100 lookup
->update_dot_tree
= NULL
;
1101 lookup
->phdrs
= NULL
;
1103 entry
= ((struct output_statement_hash_entry
*)
1104 bfd_hash_lookup (&output_statement_table
, name
, TRUE
,
1107 einfo (_("%P%F: bfd_hash_lookup failed creating section `%s'\n"),
1110 entry
->entry
= lookup
;
1112 /* GCC's strict aliasing rules prevent us from just casting the
1113 address, so we store the pointer in a variable and cast that
1115 nextp
= &lookup
->next
;
1116 lang_statement_append (&lang_output_section_statement
,
1117 (lang_statement_union_type
*) lookup
,
1118 (lang_statement_union_type
**) nextp
);
1123 lang_output_section_statement_type
*
1124 lang_output_section_statement_lookup (const char *const name
)
1126 return lang_output_section_statement_lookup_1 (name
, 0);
1129 /* A variant of lang_output_section_find used by place_orphan.
1130 Returns the output statement that should precede a new output
1131 statement for SEC. If an exact match is found on certain flags,
1134 lang_output_section_statement_type
*
1135 lang_output_section_find_by_flags (const asection
*sec
,
1136 lang_output_section_statement_type
**exact
)
1138 lang_output_section_statement_type
*first
, *look
, *found
;
1141 /* We know the first statement on this list is *ABS*. May as well
1143 first
= &lang_output_section_statement
.head
->output_section_statement
;
1144 first
= first
->next
;
1146 /* First try for an exact match. */
1148 for (look
= first
; look
; look
= look
->next
)
1150 flags
= look
->flags
;
1151 if (look
->bfd_section
!= NULL
)
1153 flags
= look
->bfd_section
->flags
;
1154 if (!bfd_match_sections_by_type (output_bfd
,
1159 flags
^= sec
->flags
;
1160 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1161 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1170 if (sec
->flags
& SEC_CODE
)
1172 /* Try for a rw code section. */
1173 for (look
= first
; look
; look
= look
->next
)
1175 flags
= look
->flags
;
1176 if (look
->bfd_section
!= NULL
)
1178 flags
= look
->bfd_section
->flags
;
1179 if (!bfd_match_sections_by_type (output_bfd
,
1184 flags
^= sec
->flags
;
1185 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1186 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1192 if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1194 /* .rodata can go after .text, .sdata2 after .rodata. */
1195 for (look
= first
; look
; look
= look
->next
)
1197 flags
= look
->flags
;
1198 if (look
->bfd_section
!= NULL
)
1200 flags
= look
->bfd_section
->flags
;
1201 if (!bfd_match_sections_by_type (output_bfd
,
1206 flags
^= sec
->flags
;
1207 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1209 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1215 if (sec
->flags
& SEC_SMALL_DATA
)
1217 /* .sdata goes after .data, .sbss after .sdata. */
1218 for (look
= first
; look
; look
= look
->next
)
1220 flags
= look
->flags
;
1221 if (look
->bfd_section
!= NULL
)
1223 flags
= look
->bfd_section
->flags
;
1224 if (!bfd_match_sections_by_type (output_bfd
,
1229 flags
^= sec
->flags
;
1230 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1231 | SEC_THREAD_LOCAL
))
1232 || ((look
->flags
& SEC_SMALL_DATA
)
1233 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1239 if (sec
->flags
& SEC_HAS_CONTENTS
)
1241 /* .data goes after .rodata. */
1242 for (look
= first
; look
; look
= look
->next
)
1244 flags
= look
->flags
;
1245 if (look
->bfd_section
!= NULL
)
1247 flags
= look
->bfd_section
->flags
;
1248 if (!bfd_match_sections_by_type (output_bfd
,
1253 flags
^= sec
->flags
;
1254 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1255 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1261 /* .bss goes last. */
1262 for (look
= first
; look
; look
= look
->next
)
1264 flags
= look
->flags
;
1265 if (look
->bfd_section
!= NULL
)
1267 flags
= look
->bfd_section
->flags
;
1268 if (!bfd_match_sections_by_type (output_bfd
,
1273 flags
^= sec
->flags
;
1274 if (!(flags
& SEC_ALLOC
))
1281 /* Find the last output section before given output statement.
1282 Used by place_orphan. */
1285 output_prev_sec_find (lang_output_section_statement_type
*os
)
1287 asection
*s
= (asection
*) NULL
;
1288 lang_output_section_statement_type
*lookup
;
1290 for (lookup
= &lang_output_section_statement
.head
->output_section_statement
;
1292 lookup
= lookup
->next
)
1294 if (lookup
->constraint
== -1)
1299 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1300 s
= lookup
->bfd_section
;
1306 lang_output_section_statement_type
*
1307 lang_insert_orphan (lang_input_statement_type
*file
,
1309 const char *secname
,
1310 lang_output_section_statement_type
*after
,
1311 struct orphan_save
*place
,
1312 etree_type
*address
,
1313 lang_statement_list_type
*add_child
)
1315 lang_statement_list_type
*old
;
1316 lang_statement_list_type add
;
1318 etree_type
*load_base
;
1319 lang_output_section_statement_type
*os
;
1320 lang_output_section_statement_type
**os_tail
;
1322 /* Start building a list of statements for this section.
1323 First save the current statement pointer. */
1326 /* If we have found an appropriate place for the output section
1327 statements for this orphan, add them to our own private list,
1328 inserting them later into the global statement list. */
1332 lang_list_init (stat_ptr
);
1336 if (config
.build_constructors
)
1338 /* If the name of the section is representable in C, then create
1339 symbols to mark the start and the end of the section. */
1340 for (ps
= secname
; *ps
!= '\0'; ps
++)
1341 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1346 etree_type
*e_align
;
1348 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1349 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1350 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1351 e_align
= exp_unop (ALIGN_K
,
1352 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1353 lang_add_assignment (exp_assop ('=', ".", e_align
));
1354 lang_add_assignment (exp_assop ('=', symname
,
1355 exp_nameop (NAME
, ".")));
1359 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1360 address
= exp_intop (0);
1363 if (after
!= NULL
&& after
->load_base
!= NULL
)
1365 etree_type
*lma_from_vma
;
1366 lma_from_vma
= exp_binop ('-', after
->load_base
,
1367 exp_nameop (ADDR
, after
->name
));
1368 load_base
= exp_binop ('+', lma_from_vma
,
1369 exp_nameop (ADDR
, secname
));
1372 os_tail
= ((lang_output_section_statement_type
**)
1373 lang_output_section_statement
.tail
);
1374 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1377 if (add_child
== NULL
)
1378 add_child
= &os
->children
;
1379 lang_add_section (add_child
, s
, os
, file
);
1381 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1383 if (config
.build_constructors
&& *ps
== '\0')
1387 /* lang_leave_ouput_section_statement resets stat_ptr.
1388 Put stat_ptr back where we want it. */
1392 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1393 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1394 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1395 lang_add_assignment (exp_assop ('=', symname
,
1396 exp_nameop (NAME
, ".")));
1399 /* Restore the global list pointer. */
1403 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1405 asection
*snew
, *as
;
1407 snew
= os
->bfd_section
;
1409 /* Shuffle the bfd section list to make the output file look
1410 neater. This is really only cosmetic. */
1411 if (place
->section
== NULL
1412 && after
!= (&lang_output_section_statement
.head
1413 ->output_section_statement
))
1415 asection
*bfd_section
= after
->bfd_section
;
1417 /* If the output statement hasn't been used to place any input
1418 sections (and thus doesn't have an output bfd_section),
1419 look for the closest prior output statement having an
1421 if (bfd_section
== NULL
)
1422 bfd_section
= output_prev_sec_find (after
);
1424 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1425 place
->section
= &bfd_section
->next
;
1428 if (place
->section
== NULL
)
1429 place
->section
= &output_bfd
->sections
;
1431 as
= *place
->section
;
1432 if (as
!= snew
&& as
->prev
!= snew
)
1434 /* Unlink the section. */
1435 bfd_section_list_remove (output_bfd
, snew
);
1437 /* Now tack it back on in the right place. */
1438 bfd_section_list_insert_before (output_bfd
, as
, snew
);
1441 /* Save the end of this list. Further ophans of this type will
1442 follow the one we've just added. */
1443 place
->section
= &snew
->next
;
1445 /* The following is non-cosmetic. We try to put the output
1446 statements in some sort of reasonable order here, because they
1447 determine the final load addresses of the orphan sections.
1448 In addition, placing output statements in the wrong order may
1449 require extra segments. For instance, given a typical
1450 situation of all read-only sections placed in one segment and
1451 following that a segment containing all the read-write
1452 sections, we wouldn't want to place an orphan read/write
1453 section before or amongst the read-only ones. */
1454 if (add
.head
!= NULL
)
1456 lang_output_section_statement_type
*newly_added_os
;
1458 if (place
->stmt
== NULL
)
1460 lang_statement_union_type
**where
;
1461 lang_statement_union_type
**assign
= NULL
;
1463 /* Look for a suitable place for the new statement list.
1464 The idea is to skip over anything that might be inside
1465 a SECTIONS {} statement in a script, before we find
1466 another output_section_statement. Assignments to "dot"
1467 before an output section statement are assumed to
1469 for (where
= &after
->header
.next
;
1471 where
= &(*where
)->header
.next
)
1473 switch ((*where
)->header
.type
)
1475 case lang_assignment_statement_enum
:
1478 lang_assignment_statement_type
*ass
;
1479 ass
= &(*where
)->assignment_statement
;
1480 if (ass
->exp
->type
.node_class
!= etree_assert
1481 && ass
->exp
->assign
.dst
[0] == '.'
1482 && ass
->exp
->assign
.dst
[1] == 0)
1486 case lang_wild_statement_enum
:
1487 case lang_input_section_enum
:
1488 case lang_object_symbols_statement_enum
:
1489 case lang_fill_statement_enum
:
1490 case lang_data_statement_enum
:
1491 case lang_reloc_statement_enum
:
1492 case lang_padding_statement_enum
:
1493 case lang_constructors_statement_enum
:
1496 case lang_output_section_statement_enum
:
1499 case lang_input_statement_enum
:
1500 case lang_address_statement_enum
:
1501 case lang_target_statement_enum
:
1502 case lang_output_statement_enum
:
1503 case lang_group_statement_enum
:
1504 case lang_afile_asection_pair_statement_enum
:
1513 place
->os_tail
= &after
->next
;
1517 /* Put it after the last orphan statement we added. */
1518 *add
.tail
= *place
->stmt
;
1519 *place
->stmt
= add
.head
;
1522 /* Fix the global list pointer if we happened to tack our
1523 new list at the tail. */
1524 if (*old
->tail
== add
.head
)
1525 old
->tail
= add
.tail
;
1527 /* Save the end of this list. */
1528 place
->stmt
= add
.tail
;
1530 /* Do the same for the list of output section statements. */
1531 newly_added_os
= *os_tail
;
1533 newly_added_os
->next
= *place
->os_tail
;
1534 *place
->os_tail
= newly_added_os
;
1535 place
->os_tail
= &newly_added_os
->next
;
1537 /* Fixing the global list pointer here is a little different.
1538 We added to the list in lang_enter_output_section_statement,
1539 trimmed off the new output_section_statment above when
1540 assigning *os_tail = NULL, but possibly added it back in
1541 the same place when assigning *place->os_tail. */
1542 if (*os_tail
== NULL
)
1543 lang_output_section_statement
.tail
1544 = (lang_statement_union_type
**) os_tail
;
1551 lang_map_flags (flagword flag
)
1553 if (flag
& SEC_ALLOC
)
1556 if (flag
& SEC_CODE
)
1559 if (flag
& SEC_READONLY
)
1562 if (flag
& SEC_DATA
)
1565 if (flag
& SEC_LOAD
)
1572 lang_memory_region_type
*m
;
1575 minfo (_("\nMemory Configuration\n\n"));
1576 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1577 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1579 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1584 fprintf (config
.map_file
, "%-16s ", m
->name
);
1586 sprintf_vma (buf
, m
->origin
);
1587 minfo ("0x%s ", buf
);
1595 minfo ("0x%V", m
->length
);
1596 if (m
->flags
|| m
->not_flags
)
1604 lang_map_flags (m
->flags
);
1610 lang_map_flags (m
->not_flags
);
1617 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1619 if (! command_line
.reduce_memory_overheads
)
1621 obstack_begin (&map_obstack
, 1000);
1622 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1623 bfd_map_over_sections (p
, init_map_userdata
, 0);
1624 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1626 print_statements ();
1630 init_map_userdata (abfd
, sec
, data
)
1631 bfd
*abfd ATTRIBUTE_UNUSED
;
1633 void *data ATTRIBUTE_UNUSED
;
1635 fat_section_userdata_type
*new_data
1636 = ((fat_section_userdata_type
*) (stat_alloc
1637 (sizeof (fat_section_userdata_type
))));
1639 ASSERT (get_userdata (sec
) == NULL
);
1640 get_userdata (sec
) = new_data
;
1641 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1645 sort_def_symbol (hash_entry
, info
)
1646 struct bfd_link_hash_entry
*hash_entry
;
1647 void *info ATTRIBUTE_UNUSED
;
1649 if (hash_entry
->type
== bfd_link_hash_defined
1650 || hash_entry
->type
== bfd_link_hash_defweak
)
1652 struct fat_user_section_struct
*ud
;
1653 struct map_symbol_def
*def
;
1655 ud
= get_userdata (hash_entry
->u
.def
.section
);
1658 /* ??? What do we have to do to initialize this beforehand? */
1659 /* The first time we get here is bfd_abs_section... */
1660 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1661 ud
= get_userdata (hash_entry
->u
.def
.section
);
1663 else if (!ud
->map_symbol_def_tail
)
1664 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1666 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1667 def
->entry
= hash_entry
;
1668 *(ud
->map_symbol_def_tail
) = def
;
1669 ud
->map_symbol_def_tail
= &def
->next
;
1674 /* Initialize an output section. */
1677 init_os (lang_output_section_statement_type
*s
, asection
*isec
)
1679 if (s
->bfd_section
!= NULL
)
1682 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1683 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1685 s
->bfd_section
= bfd_get_section_by_name (output_bfd
, s
->name
);
1686 if (s
->bfd_section
== NULL
)
1687 s
->bfd_section
= bfd_make_section (output_bfd
, s
->name
);
1688 if (s
->bfd_section
== NULL
)
1690 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1691 output_bfd
->xvec
->name
, s
->name
);
1693 s
->bfd_section
->output_section
= s
->bfd_section
;
1695 /* We initialize an output sections output offset to minus its own
1696 vma to allow us to output a section through itself. */
1697 s
->bfd_section
->output_offset
= 0;
1698 if (!command_line
.reduce_memory_overheads
)
1700 fat_section_userdata_type
*new
1701 = stat_alloc (sizeof (fat_section_userdata_type
));
1702 memset (new, 0, sizeof (fat_section_userdata_type
));
1703 get_userdata (s
->bfd_section
) = new;
1707 /* If there is a base address, make sure that any sections it might
1708 mention are initialized. */
1709 if (s
->addr_tree
!= NULL
)
1710 exp_init_os (s
->addr_tree
);
1712 if (s
->load_base
!= NULL
)
1713 exp_init_os (s
->load_base
);
1716 bfd_init_private_section_data (isec
->owner
, isec
,
1717 output_bfd
, s
->bfd_section
,
1721 /* Make sure that all output sections mentioned in an expression are
1725 exp_init_os (etree_type
*exp
)
1727 switch (exp
->type
.node_class
)
1731 exp_init_os (exp
->assign
.src
);
1735 exp_init_os (exp
->binary
.lhs
);
1736 exp_init_os (exp
->binary
.rhs
);
1740 exp_init_os (exp
->trinary
.cond
);
1741 exp_init_os (exp
->trinary
.lhs
);
1742 exp_init_os (exp
->trinary
.rhs
);
1746 exp_init_os (exp
->assert_s
.child
);
1750 exp_init_os (exp
->unary
.child
);
1754 switch (exp
->type
.node_code
)
1760 lang_output_section_statement_type
*os
;
1762 os
= lang_output_section_find (exp
->name
.name
);
1763 if (os
!= NULL
&& os
->bfd_section
== NULL
)
1775 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
1777 lang_input_statement_type
*entry
= data
;
1779 /* If we are only reading symbols from this object, then we want to
1780 discard all sections. */
1781 if (entry
->just_syms_flag
)
1783 bfd_link_just_syms (abfd
, sec
, &link_info
);
1787 if (!(abfd
->flags
& DYNAMIC
))
1788 bfd_section_already_linked (abfd
, sec
);
1791 /* The wild routines.
1793 These expand statements like *(.text) and foo.o to a list of
1794 explicit actions, like foo.o(.text), bar.o(.text) and
1795 foo.o(.text, .data). */
1797 /* Add SECTION to the output section OUTPUT. Do this by creating a
1798 lang_input_section statement which is placed at PTR. FILE is the
1799 input file which holds SECTION. */
1802 lang_add_section (lang_statement_list_type
*ptr
,
1804 lang_output_section_statement_type
*output
,
1805 lang_input_statement_type
*file
)
1807 flagword flags
= section
->flags
;
1808 bfd_boolean discard
;
1810 /* Discard sections marked with SEC_EXCLUDE. */
1811 discard
= (flags
& SEC_EXCLUDE
) != 0;
1813 /* Discard input sections which are assigned to a section named
1814 DISCARD_SECTION_NAME. */
1815 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
1818 /* Discard debugging sections if we are stripping debugging
1820 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
1821 && (flags
& SEC_DEBUGGING
) != 0)
1826 if (section
->output_section
== NULL
)
1828 /* This prevents future calls from assigning this section. */
1829 section
->output_section
= bfd_abs_section_ptr
;
1834 if (section
->output_section
== NULL
)
1837 lang_input_section_type
*new;
1840 if (output
->bfd_section
== NULL
)
1841 init_os (output
, section
);
1843 first
= ! output
->bfd_section
->linker_has_input
;
1844 output
->bfd_section
->linker_has_input
= 1;
1846 if (!link_info
.relocatable
1847 && !stripped_excluded_sections
)
1849 asection
*s
= output
->bfd_section
->map_tail
.s
;
1850 output
->bfd_section
->map_tail
.s
= section
;
1851 section
->map_head
.s
= NULL
;
1852 section
->map_tail
.s
= s
;
1854 s
->map_head
.s
= section
;
1856 output
->bfd_section
->map_head
.s
= section
;
1859 /* Add a section reference to the list. */
1860 new = new_stat (lang_input_section
, ptr
);
1862 new->section
= section
;
1864 section
->output_section
= output
->bfd_section
;
1866 flags
= section
->flags
;
1868 /* We don't copy the SEC_NEVER_LOAD flag from an input section
1869 to an output section, because we want to be able to include a
1870 SEC_NEVER_LOAD section in the middle of an otherwise loaded
1871 section (I don't know why we want to do this, but we do).
1872 build_link_order in ldwrite.c handles this case by turning
1873 the embedded SEC_NEVER_LOAD section into a fill. */
1875 flags
&= ~ SEC_NEVER_LOAD
;
1877 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
1878 already been processed. One reason to do this is that on pe
1879 format targets, .text$foo sections go into .text and it's odd
1880 to see .text with SEC_LINK_ONCE set. */
1882 if (! link_info
.relocatable
)
1883 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
1885 /* If this is not the first input section, and the SEC_READONLY
1886 flag is not currently set, then don't set it just because the
1887 input section has it set. */
1889 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
1890 flags
&= ~ SEC_READONLY
;
1892 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
1894 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
1895 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
1896 || ((flags
& SEC_MERGE
)
1897 && output
->bfd_section
->entsize
!= section
->entsize
)))
1899 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1900 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1903 output
->bfd_section
->flags
|= flags
;
1905 if (flags
& SEC_MERGE
)
1906 output
->bfd_section
->entsize
= section
->entsize
;
1908 /* If SEC_READONLY is not set in the input section, then clear
1909 it from the output section. */
1910 if ((section
->flags
& SEC_READONLY
) == 0)
1911 output
->bfd_section
->flags
&= ~SEC_READONLY
;
1913 switch (output
->sectype
)
1915 case normal_section
:
1920 case overlay_section
:
1921 output
->bfd_section
->flags
&= ~SEC_ALLOC
;
1923 case noload_section
:
1924 output
->bfd_section
->flags
&= ~SEC_LOAD
;
1925 output
->bfd_section
->flags
|= SEC_NEVER_LOAD
;
1929 /* Copy over SEC_SMALL_DATA. */
1930 if (section
->flags
& SEC_SMALL_DATA
)
1931 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
1933 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
1934 output
->bfd_section
->alignment_power
= section
->alignment_power
;
1936 /* If supplied an alignment, then force it. */
1937 if (output
->section_alignment
!= -1)
1938 output
->bfd_section
->alignment_power
= output
->section_alignment
;
1940 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
1941 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
1943 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
1944 /* FIXME: This value should really be obtained from the bfd... */
1945 output
->block_value
= 128;
1950 /* Compare sections ASEC and BSEC according to SORT. */
1953 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
1962 case by_alignment_name
:
1963 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
1964 - bfd_section_alignment (asec
->owner
, asec
));
1970 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
1971 bfd_get_section_name (bsec
->owner
, bsec
));
1974 case by_name_alignment
:
1975 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
1976 bfd_get_section_name (bsec
->owner
, bsec
));
1982 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
1983 - bfd_section_alignment (asec
->owner
, asec
));
1990 /* Handle wildcard sorting. This returns the lang_input_section which
1991 should follow the one we are going to create for SECTION and FILE,
1992 based on the sorting requirements of WILD. It returns NULL if the
1993 new section should just go at the end of the current list. */
1995 static lang_statement_union_type
*
1996 wild_sort (lang_wild_statement_type
*wild
,
1997 struct wildcard_list
*sec
,
1998 lang_input_statement_type
*file
,
2001 const char *section_name
;
2002 lang_statement_union_type
*l
;
2004 if (!wild
->filenames_sorted
2005 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2008 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2009 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2011 lang_input_section_type
*ls
;
2013 if (l
->header
.type
!= lang_input_section_enum
)
2015 ls
= &l
->input_section
;
2017 /* Sorting by filename takes precedence over sorting by section
2020 if (wild
->filenames_sorted
)
2022 const char *fn
, *ln
;
2026 /* The PE support for the .idata section as generated by
2027 dlltool assumes that files will be sorted by the name of
2028 the archive and then the name of the file within the
2031 if (file
->the_bfd
!= NULL
2032 && bfd_my_archive (file
->the_bfd
) != NULL
)
2034 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2039 fn
= file
->filename
;
2043 if (ls
->ifile
->the_bfd
!= NULL
2044 && bfd_my_archive (ls
->ifile
->the_bfd
) != NULL
)
2046 ln
= bfd_get_filename (bfd_my_archive (ls
->ifile
->the_bfd
));
2051 ln
= ls
->ifile
->filename
;
2055 i
= strcmp (fn
, ln
);
2064 fn
= file
->filename
;
2066 ln
= ls
->ifile
->filename
;
2068 i
= strcmp (fn
, ln
);
2076 /* Here either the files are not sorted by name, or we are
2077 looking at the sections for this file. */
2079 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2080 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2087 /* Expand a wild statement for a particular FILE. SECTION may be
2088 NULL, in which case it is a wild card. */
2091 output_section_callback (lang_wild_statement_type
*ptr
,
2092 struct wildcard_list
*sec
,
2094 lang_input_statement_type
*file
,
2097 lang_statement_union_type
*before
;
2099 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2100 if (unique_section_p (section
))
2103 before
= wild_sort (ptr
, sec
, file
, section
);
2105 /* Here BEFORE points to the lang_input_section which
2106 should follow the one we are about to add. If BEFORE
2107 is NULL, then the section should just go at the end
2108 of the current list. */
2111 lang_add_section (&ptr
->children
, section
,
2112 (lang_output_section_statement_type
*) output
,
2116 lang_statement_list_type list
;
2117 lang_statement_union_type
**pp
;
2119 lang_list_init (&list
);
2120 lang_add_section (&list
, section
,
2121 (lang_output_section_statement_type
*) output
,
2124 /* If we are discarding the section, LIST.HEAD will
2126 if (list
.head
!= NULL
)
2128 ASSERT (list
.head
->header
.next
== NULL
);
2130 for (pp
= &ptr
->children
.head
;
2132 pp
= &(*pp
)->header
.next
)
2133 ASSERT (*pp
!= NULL
);
2135 list
.head
->header
.next
= *pp
;
2141 /* Check if all sections in a wild statement for a particular FILE
2145 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2146 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2148 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2151 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2152 if (unique_section_p (section
))
2155 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2156 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2159 /* This is passed a file name which must have been seen already and
2160 added to the statement tree. We will see if it has been opened
2161 already and had its symbols read. If not then we'll read it. */
2163 static lang_input_statement_type
*
2164 lookup_name (const char *name
)
2166 lang_input_statement_type
*search
;
2168 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2170 search
= (lang_input_statement_type
*) search
->next_real_file
)
2172 /* Use the local_sym_name as the name of the file that has
2173 already been loaded as filename might have been transformed
2174 via the search directory lookup mechanism. */
2175 const char * filename
= search
->local_sym_name
;
2177 if (filename
== NULL
&& name
== NULL
)
2179 if (filename
!= NULL
2181 && strcmp (filename
, name
) == 0)
2186 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2187 default_target
, FALSE
);
2189 /* If we have already added this file, or this file is not real
2190 (FIXME: can that ever actually happen?) or the name is NULL
2191 (FIXME: can that ever actually happen?) don't add this file. */
2194 || search
->filename
== NULL
)
2197 if (! load_symbols (search
, NULL
))
2203 /* Save LIST as a list of libraries whose symbols should not be exported. */
2208 struct excluded_lib
*next
;
2210 static struct excluded_lib
*excluded_libs
;
2213 add_excluded_libs (const char *list
)
2215 const char *p
= list
, *end
;
2219 struct excluded_lib
*entry
;
2220 end
= strpbrk (p
, ",:");
2222 end
= p
+ strlen (p
);
2223 entry
= xmalloc (sizeof (*entry
));
2224 entry
->next
= excluded_libs
;
2225 entry
->name
= xmalloc (end
- p
+ 1);
2226 memcpy (entry
->name
, p
, end
- p
);
2227 entry
->name
[end
- p
] = '\0';
2228 excluded_libs
= entry
;
2236 check_excluded_libs (bfd
*abfd
)
2238 struct excluded_lib
*lib
= excluded_libs
;
2242 int len
= strlen (lib
->name
);
2243 const char *filename
= lbasename (abfd
->filename
);
2245 if (strcmp (lib
->name
, "ALL") == 0)
2247 abfd
->no_export
= TRUE
;
2251 if (strncmp (lib
->name
, filename
, len
) == 0
2252 && (filename
[len
] == '\0'
2253 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2254 && filename
[len
+ 2] == '\0')))
2256 abfd
->no_export
= TRUE
;
2264 /* Get the symbols for an input file. */
2267 load_symbols (lang_input_statement_type
*entry
,
2268 lang_statement_list_type
*place
)
2275 ldfile_open_file (entry
);
2277 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2278 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2281 lang_statement_list_type
*hold
;
2282 bfd_boolean bad_load
= TRUE
;
2283 bfd_boolean save_ldlang_sysrooted_script
;
2285 err
= bfd_get_error ();
2287 /* See if the emulation has some special knowledge. */
2288 if (ldemul_unrecognized_file (entry
))
2291 if (err
== bfd_error_file_ambiguously_recognized
)
2295 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2296 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2297 for (p
= matching
; *p
!= NULL
; p
++)
2301 else if (err
!= bfd_error_file_not_recognized
2303 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2307 bfd_close (entry
->the_bfd
);
2308 entry
->the_bfd
= NULL
;
2310 /* Try to interpret the file as a linker script. */
2311 ldfile_open_command_file (entry
->filename
);
2315 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2316 ldlang_sysrooted_script
= entry
->sysrooted
;
2318 ldfile_assumed_script
= TRUE
;
2319 parser_input
= input_script
;
2320 /* We want to use the same -Bdynamic/-Bstatic as the one for
2322 config
.dynamic_link
= entry
->dynamic
;
2324 ldfile_assumed_script
= FALSE
;
2326 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2332 if (ldemul_recognized_file (entry
))
2335 /* We don't call ldlang_add_file for an archive. Instead, the
2336 add_symbols entry point will call ldlang_add_file, via the
2337 add_archive_element callback, for each element of the archive
2339 switch (bfd_get_format (entry
->the_bfd
))
2345 ldlang_add_file (entry
);
2346 if (trace_files
|| trace_file_tries
)
2347 info_msg ("%I\n", entry
);
2351 check_excluded_libs (entry
->the_bfd
);
2353 if (entry
->whole_archive
)
2356 bfd_boolean loaded
= TRUE
;
2360 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2365 if (! bfd_check_format (member
, bfd_object
))
2367 einfo (_("%F%B: member %B in archive is not an object\n"),
2368 entry
->the_bfd
, member
);
2372 if (! ((*link_info
.callbacks
->add_archive_element
)
2373 (&link_info
, member
, "--whole-archive")))
2376 if (! bfd_link_add_symbols (member
, &link_info
))
2378 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2383 entry
->loaded
= loaded
;
2389 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2390 entry
->loaded
= TRUE
;
2392 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2394 return entry
->loaded
;
2397 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2398 may be NULL, indicating that it is a wildcard. Separate
2399 lang_input_section statements are created for each part of the
2400 expansion; they are added after the wild statement S. OUTPUT is
2401 the output section. */
2404 wild (lang_wild_statement_type
*s
,
2405 const char *target ATTRIBUTE_UNUSED
,
2406 lang_output_section_statement_type
*output
)
2408 struct wildcard_list
*sec
;
2410 walk_wild (s
, output_section_callback
, output
);
2412 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2414 if (default_common_section
!= NULL
)
2416 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2418 /* Remember the section that common is going to in case we
2419 later get something which doesn't know where to put it. */
2420 default_common_section
= output
;
2425 /* Return TRUE iff target is the sought target. */
2428 get_target (const bfd_target
*target
, void *data
)
2430 const char *sought
= data
;
2432 return strcmp (target
->name
, sought
) == 0;
2435 /* Like strcpy() but convert to lower case as well. */
2438 stricpy (char *dest
, char *src
)
2442 while ((c
= *src
++) != 0)
2443 *dest
++ = TOLOWER (c
);
2448 /* Remove the first occurrence of needle (if any) in haystack
2452 strcut (char *haystack
, char *needle
)
2454 haystack
= strstr (haystack
, needle
);
2460 for (src
= haystack
+ strlen (needle
); *src
;)
2461 *haystack
++ = *src
++;
2467 /* Compare two target format name strings.
2468 Return a value indicating how "similar" they are. */
2471 name_compare (char *first
, char *second
)
2477 copy1
= xmalloc (strlen (first
) + 1);
2478 copy2
= xmalloc (strlen (second
) + 1);
2480 /* Convert the names to lower case. */
2481 stricpy (copy1
, first
);
2482 stricpy (copy2
, second
);
2484 /* Remove size and endian strings from the name. */
2485 strcut (copy1
, "big");
2486 strcut (copy1
, "little");
2487 strcut (copy2
, "big");
2488 strcut (copy2
, "little");
2490 /* Return a value based on how many characters match,
2491 starting from the beginning. If both strings are
2492 the same then return 10 * their length. */
2493 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2494 if (copy1
[result
] == 0)
2506 /* Set by closest_target_match() below. */
2507 static const bfd_target
*winner
;
2509 /* Scan all the valid bfd targets looking for one that has the endianness
2510 requirement that was specified on the command line, and is the nearest
2511 match to the original output target. */
2514 closest_target_match (const bfd_target
*target
, void *data
)
2516 const bfd_target
*original
= data
;
2518 if (command_line
.endian
== ENDIAN_BIG
2519 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2522 if (command_line
.endian
== ENDIAN_LITTLE
2523 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2526 /* Must be the same flavour. */
2527 if (target
->flavour
!= original
->flavour
)
2530 /* If we have not found a potential winner yet, then record this one. */
2537 /* Oh dear, we now have two potential candidates for a successful match.
2538 Compare their names and choose the better one. */
2539 if (name_compare (target
->name
, original
->name
)
2540 > name_compare (winner
->name
, original
->name
))
2543 /* Keep on searching until wqe have checked them all. */
2547 /* Return the BFD target format of the first input file. */
2550 get_first_input_target (void)
2552 char *target
= NULL
;
2554 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2556 if (s
->header
.type
== lang_input_statement_enum
2559 ldfile_open_file (s
);
2561 if (s
->the_bfd
!= NULL
2562 && bfd_check_format (s
->the_bfd
, bfd_object
))
2564 target
= bfd_get_target (s
->the_bfd
);
2576 lang_get_output_target (void)
2580 /* Has the user told us which output format to use? */
2581 if (output_target
!= NULL
)
2582 return output_target
;
2584 /* No - has the current target been set to something other than
2586 if (current_target
!= default_target
)
2587 return current_target
;
2589 /* No - can we determine the format of the first input file? */
2590 target
= get_first_input_target ();
2594 /* Failed - use the default output target. */
2595 return default_target
;
2598 /* Open the output file. */
2601 open_output (const char *name
)
2605 output_target
= lang_get_output_target ();
2607 /* Has the user requested a particular endianness on the command
2609 if (command_line
.endian
!= ENDIAN_UNSET
)
2611 const bfd_target
*target
;
2612 enum bfd_endian desired_endian
;
2614 /* Get the chosen target. */
2615 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2617 /* If the target is not supported, we cannot do anything. */
2620 if (command_line
.endian
== ENDIAN_BIG
)
2621 desired_endian
= BFD_ENDIAN_BIG
;
2623 desired_endian
= BFD_ENDIAN_LITTLE
;
2625 /* See if the target has the wrong endianness. This should
2626 not happen if the linker script has provided big and
2627 little endian alternatives, but some scrips don't do
2629 if (target
->byteorder
!= desired_endian
)
2631 /* If it does, then see if the target provides
2632 an alternative with the correct endianness. */
2633 if (target
->alternative_target
!= NULL
2634 && (target
->alternative_target
->byteorder
== desired_endian
))
2635 output_target
= target
->alternative_target
->name
;
2638 /* Try to find a target as similar as possible to
2639 the default target, but which has the desired
2640 endian characteristic. */
2641 bfd_search_for_target (closest_target_match
,
2644 /* Oh dear - we could not find any targets that
2645 satisfy our requirements. */
2647 einfo (_("%P: warning: could not find any targets"
2648 " that match endianness requirement\n"));
2650 output_target
= winner
->name
;
2656 output
= bfd_openw (name
, output_target
);
2660 if (bfd_get_error () == bfd_error_invalid_target
)
2661 einfo (_("%P%F: target %s not found\n"), output_target
);
2663 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2666 delete_output_file_on_failure
= TRUE
;
2668 if (! bfd_set_format (output
, bfd_object
))
2669 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2670 if (! bfd_set_arch_mach (output
,
2671 ldfile_output_architecture
,
2672 ldfile_output_machine
))
2673 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2675 link_info
.hash
= bfd_link_hash_table_create (output
);
2676 if (link_info
.hash
== NULL
)
2677 einfo (_("%P%F: can not create link hash table: %E\n"));
2679 bfd_set_gp_size (output
, g_switch_value
);
2684 ldlang_open_output (lang_statement_union_type
*statement
)
2686 switch (statement
->header
.type
)
2688 case lang_output_statement_enum
:
2689 ASSERT (output_bfd
== NULL
);
2690 output_bfd
= open_output (statement
->output_statement
.name
);
2691 ldemul_set_output_arch ();
2692 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2693 output_bfd
->flags
|= D_PAGED
;
2695 output_bfd
->flags
&= ~D_PAGED
;
2696 if (config
.text_read_only
)
2697 output_bfd
->flags
|= WP_TEXT
;
2699 output_bfd
->flags
&= ~WP_TEXT
;
2700 if (link_info
.traditional_format
)
2701 output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2703 output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2706 case lang_target_statement_enum
:
2707 current_target
= statement
->target_statement
.target
;
2714 /* Convert between addresses in bytes and sizes in octets.
2715 For currently supported targets, octets_per_byte is always a power
2716 of two, so we can use shifts. */
2717 #define TO_ADDR(X) ((X) >> opb_shift)
2718 #define TO_SIZE(X) ((X) << opb_shift)
2720 /* Support the above. */
2721 static unsigned int opb_shift
= 0;
2726 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2727 ldfile_output_machine
);
2730 while ((x
& 1) == 0)
2738 /* Open all the input files. */
2741 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2743 for (; s
!= NULL
; s
= s
->header
.next
)
2745 switch (s
->header
.type
)
2747 case lang_constructors_statement_enum
:
2748 open_input_bfds (constructor_list
.head
, force
);
2750 case lang_output_section_statement_enum
:
2751 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2753 case lang_wild_statement_enum
:
2754 /* Maybe we should load the file's symbols. */
2755 if (s
->wild_statement
.filename
2756 && ! wildcardp (s
->wild_statement
.filename
))
2757 lookup_name (s
->wild_statement
.filename
);
2758 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2760 case lang_group_statement_enum
:
2762 struct bfd_link_hash_entry
*undefs
;
2764 /* We must continually search the entries in the group
2765 until no new symbols are added to the list of undefined
2770 undefs
= link_info
.hash
->undefs_tail
;
2771 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2773 while (undefs
!= link_info
.hash
->undefs_tail
);
2776 case lang_target_statement_enum
:
2777 current_target
= s
->target_statement
.target
;
2779 case lang_input_statement_enum
:
2780 if (s
->input_statement
.real
)
2782 lang_statement_list_type add
;
2784 s
->input_statement
.target
= current_target
;
2786 /* If we are being called from within a group, and this
2787 is an archive which has already been searched, then
2788 force it to be researched unless the whole archive
2789 has been loaded already. */
2791 && !s
->input_statement
.whole_archive
2792 && s
->input_statement
.loaded
2793 && bfd_check_format (s
->input_statement
.the_bfd
,
2795 s
->input_statement
.loaded
= FALSE
;
2797 lang_list_init (&add
);
2799 if (! load_symbols (&s
->input_statement
, &add
))
2800 config
.make_executable
= FALSE
;
2802 if (add
.head
!= NULL
)
2804 *add
.tail
= s
->header
.next
;
2805 s
->header
.next
= add
.head
;
2815 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2818 lang_track_definedness (const char *name
)
2820 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2821 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2824 /* New-function for the definedness hash table. */
2826 static struct bfd_hash_entry
*
2827 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2828 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2829 const char *name ATTRIBUTE_UNUSED
)
2831 struct lang_definedness_hash_entry
*ret
2832 = (struct lang_definedness_hash_entry
*) entry
;
2835 ret
= (struct lang_definedness_hash_entry
*)
2836 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
2839 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
2841 ret
->iteration
= -1;
2845 /* Return the iteration when the definition of NAME was last updated. A
2846 value of -1 means that the symbol is not defined in the linker script
2847 or the command line, but may be defined in the linker symbol table. */
2850 lang_symbol_definition_iteration (const char *name
)
2852 struct lang_definedness_hash_entry
*defentry
2853 = (struct lang_definedness_hash_entry
*)
2854 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2856 /* We've already created this one on the presence of DEFINED in the
2857 script, so it can't be NULL unless something is borked elsewhere in
2859 if (defentry
== NULL
)
2862 return defentry
->iteration
;
2865 /* Update the definedness state of NAME. */
2868 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
2870 struct lang_definedness_hash_entry
*defentry
2871 = (struct lang_definedness_hash_entry
*)
2872 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2874 /* We don't keep track of symbols not tested with DEFINED. */
2875 if (defentry
== NULL
)
2878 /* If the symbol was already defined, and not from an earlier statement
2879 iteration, don't update the definedness iteration, because that'd
2880 make the symbol seem defined in the linker script at this point, and
2881 it wasn't; it was defined in some object. If we do anyway, DEFINED
2882 would start to yield false before this point and the construct "sym =
2883 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2885 if (h
->type
!= bfd_link_hash_undefined
2886 && h
->type
!= bfd_link_hash_common
2887 && h
->type
!= bfd_link_hash_new
2888 && defentry
->iteration
== -1)
2891 defentry
->iteration
= lang_statement_iteration
;
2894 /* Add the supplied name to the symbol table as an undefined reference.
2895 This is a two step process as the symbol table doesn't even exist at
2896 the time the ld command line is processed. First we put the name
2897 on a list, then, once the output file has been opened, transfer the
2898 name to the symbol table. */
2900 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
2902 #define ldlang_undef_chain_list_head entry_symbol.next
2905 ldlang_add_undef (const char *const name
)
2907 ldlang_undef_chain_list_type
*new =
2908 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
2910 new->next
= ldlang_undef_chain_list_head
;
2911 ldlang_undef_chain_list_head
= new;
2913 new->name
= xstrdup (name
);
2915 if (output_bfd
!= NULL
)
2916 insert_undefined (new->name
);
2919 /* Insert NAME as undefined in the symbol table. */
2922 insert_undefined (const char *name
)
2924 struct bfd_link_hash_entry
*h
;
2926 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
2928 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2929 if (h
->type
== bfd_link_hash_new
)
2931 h
->type
= bfd_link_hash_undefined
;
2932 h
->u
.undef
.abfd
= NULL
;
2933 bfd_link_add_undef (link_info
.hash
, h
);
2937 /* Run through the list of undefineds created above and place them
2938 into the linker hash table as undefined symbols belonging to the
2942 lang_place_undefineds (void)
2944 ldlang_undef_chain_list_type
*ptr
;
2946 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
2947 insert_undefined (ptr
->name
);
2950 /* Check for all readonly or some readwrite sections. */
2953 check_input_sections
2954 (lang_statement_union_type
*s
,
2955 lang_output_section_statement_type
*output_section_statement
)
2957 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
2959 switch (s
->header
.type
)
2961 case lang_wild_statement_enum
:
2962 walk_wild (&s
->wild_statement
, check_section_callback
,
2963 output_section_statement
);
2964 if (! output_section_statement
->all_input_readonly
)
2967 case lang_constructors_statement_enum
:
2968 check_input_sections (constructor_list
.head
,
2969 output_section_statement
);
2970 if (! output_section_statement
->all_input_readonly
)
2973 case lang_group_statement_enum
:
2974 check_input_sections (s
->group_statement
.children
.head
,
2975 output_section_statement
);
2976 if (! output_section_statement
->all_input_readonly
)
2985 /* Update wildcard statements if needed. */
2988 update_wild_statements (lang_statement_union_type
*s
)
2990 struct wildcard_list
*sec
;
2992 switch (sort_section
)
3002 for (; s
!= NULL
; s
= s
->header
.next
)
3004 switch (s
->header
.type
)
3009 case lang_wild_statement_enum
:
3010 sec
= s
->wild_statement
.section_list
;
3013 switch (sec
->spec
.sorted
)
3016 sec
->spec
.sorted
= sort_section
;
3019 if (sort_section
== by_alignment
)
3020 sec
->spec
.sorted
= by_name_alignment
;
3023 if (sort_section
== by_name
)
3024 sec
->spec
.sorted
= by_alignment_name
;
3032 case lang_constructors_statement_enum
:
3033 update_wild_statements (constructor_list
.head
);
3036 case lang_output_section_statement_enum
:
3037 update_wild_statements
3038 (s
->output_section_statement
.children
.head
);
3041 case lang_group_statement_enum
:
3042 update_wild_statements (s
->group_statement
.children
.head
);
3050 /* Open input files and attach to output sections. */
3053 map_input_to_output_sections
3054 (lang_statement_union_type
*s
, const char *target
,
3055 lang_output_section_statement_type
*os
)
3057 for (; s
!= NULL
; s
= s
->header
.next
)
3059 switch (s
->header
.type
)
3061 case lang_wild_statement_enum
:
3062 wild (&s
->wild_statement
, target
, os
);
3064 case lang_constructors_statement_enum
:
3065 map_input_to_output_sections (constructor_list
.head
,
3069 case lang_output_section_statement_enum
:
3070 if (s
->output_section_statement
.constraint
)
3072 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3073 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3075 s
->output_section_statement
.all_input_readonly
= TRUE
;
3076 check_input_sections (s
->output_section_statement
.children
.head
,
3077 &s
->output_section_statement
);
3078 if ((s
->output_section_statement
.all_input_readonly
3079 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3080 || (!s
->output_section_statement
.all_input_readonly
3081 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3083 s
->output_section_statement
.constraint
= -1;
3088 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3090 &s
->output_section_statement
);
3092 case lang_output_statement_enum
:
3094 case lang_target_statement_enum
:
3095 target
= s
->target_statement
.target
;
3097 case lang_group_statement_enum
:
3098 map_input_to_output_sections (s
->group_statement
.children
.head
,
3102 case lang_data_statement_enum
:
3103 /* Make sure that any sections mentioned in the expression
3105 exp_init_os (s
->data_statement
.exp
);
3106 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3108 /* The output section gets contents, and then we inspect for
3109 any flags set in the input script which override any ALLOC. */
3110 os
->bfd_section
->flags
|= SEC_HAS_CONTENTS
;
3111 if (!(os
->flags
& SEC_NEVER_LOAD
))
3112 os
->bfd_section
->flags
|= SEC_ALLOC
| SEC_LOAD
;
3114 case lang_fill_statement_enum
:
3115 case lang_input_section_enum
:
3116 case lang_object_symbols_statement_enum
:
3117 case lang_reloc_statement_enum
:
3118 case lang_padding_statement_enum
:
3119 case lang_input_statement_enum
:
3120 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3123 case lang_assignment_statement_enum
:
3124 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3127 /* Make sure that any sections mentioned in the assignment
3129 exp_init_os (s
->assignment_statement
.exp
);
3131 case lang_afile_asection_pair_statement_enum
:
3134 case lang_address_statement_enum
:
3135 /* Mark the specified section with the supplied address.
3137 If this section was actually a segment marker, then the
3138 directive is ignored if the linker script explicitly
3139 processed the segment marker. Originally, the linker
3140 treated segment directives (like -Ttext on the
3141 command-line) as section directives. We honor the
3142 section directive semantics for backwards compatibilty;
3143 linker scripts that do not specifically check for
3144 SEGMENT_START automatically get the old semantics. */
3145 if (!s
->address_statement
.segment
3146 || !s
->address_statement
.segment
->used
)
3148 lang_output_section_statement_type
*aos
3149 = (lang_output_section_statement_lookup
3150 (s
->address_statement
.section_name
));
3152 if (aos
->bfd_section
== NULL
)
3153 init_os (aos
, NULL
);
3154 aos
->addr_tree
= s
->address_statement
.address
;
3161 /* An output section might have been removed after its statement was
3162 added. For example, ldemul_before_allocation can remove dynamic
3163 sections if they turn out to be not needed. Clean them up here. */
3166 strip_excluded_output_sections (void)
3168 lang_output_section_statement_type
*os
;
3170 /* Run lang_size_sections (if not already done). */
3171 if (expld
.phase
!= lang_mark_phase_enum
)
3173 expld
.phase
= lang_mark_phase_enum
;
3174 expld
.dataseg
.phase
= exp_dataseg_none
;
3175 one_lang_size_sections_pass (NULL
, FALSE
);
3176 lang_reset_memory_regions ();
3179 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3183 asection
*output_section
;
3184 bfd_boolean exclude
;
3186 if (os
->constraint
== -1)
3189 output_section
= os
->bfd_section
;
3190 if (output_section
== NULL
)
3193 exclude
= (output_section
->rawsize
== 0
3194 && (output_section
->flags
& SEC_KEEP
) == 0
3195 && !bfd_section_removed_from_list (output_bfd
,
3198 /* Some sections have not yet been sized, notably .gnu.version,
3199 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3200 input sections, so don't drop output sections that have such
3201 input sections unless they are also marked SEC_EXCLUDE. */
3202 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3206 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3207 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3208 && (s
->flags
& SEC_EXCLUDE
) == 0)
3215 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3216 output_section
->map_head
.link_order
= NULL
;
3217 output_section
->map_tail
.link_order
= NULL
;
3221 /* We don't set bfd_section to NULL since bfd_section of the
3222 removed output section statement may still be used. */
3224 output_section
->flags
|= SEC_EXCLUDE
;
3225 bfd_section_list_remove (output_bfd
, output_section
);
3226 output_bfd
->section_count
--;
3230 /* Stop future calls to lang_add_section from messing with map_head
3231 and map_tail link_order fields. */
3232 stripped_excluded_sections
= TRUE
;
3236 print_output_section_statement
3237 (lang_output_section_statement_type
*output_section_statement
)
3239 asection
*section
= output_section_statement
->bfd_section
;
3242 if (output_section_statement
!= abs_output_section
)
3244 minfo ("\n%s", output_section_statement
->name
);
3246 if (section
!= NULL
)
3248 print_dot
= section
->vma
;
3250 len
= strlen (output_section_statement
->name
);
3251 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3256 while (len
< SECTION_NAME_MAP_LENGTH
)
3262 minfo ("0x%V %W", section
->vma
, section
->size
);
3264 if (output_section_statement
->load_base
!= NULL
)
3268 addr
= exp_get_abs_int (output_section_statement
->load_base
, 0,
3270 minfo (_(" load address 0x%V"), addr
);
3277 print_statement_list (output_section_statement
->children
.head
,
3278 output_section_statement
);
3281 /* Scan for the use of the destination in the right hand side
3282 of an expression. In such cases we will not compute the
3283 correct expression, since the value of DST that is used on
3284 the right hand side will be its final value, not its value
3285 just before this expression is evaluated. */
3288 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3290 if (rhs
== NULL
|| dst
== NULL
)
3293 switch (rhs
->type
.node_class
)
3296 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3297 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3300 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3301 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3304 case etree_provided
:
3306 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3308 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3311 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3315 return strcmp (dst
, rhs
->value
.str
) == 0;
3320 return strcmp (dst
, rhs
->name
.name
) == 0;
3332 print_assignment (lang_assignment_statement_type
*assignment
,
3333 lang_output_section_statement_type
*output_section
)
3337 bfd_boolean computation_is_valid
= TRUE
;
3340 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3343 if (assignment
->exp
->type
.node_class
== etree_assert
)
3346 tree
= assignment
->exp
->assert_s
.child
;
3347 computation_is_valid
= TRUE
;
3351 const char *dst
= assignment
->exp
->assign
.dst
;
3353 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3354 tree
= assignment
->exp
->assign
.src
;
3355 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3358 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3359 if (expld
.result
.valid_p
)
3363 if (computation_is_valid
)
3365 value
= expld
.result
.value
;
3367 if (expld
.result
.section
)
3368 value
+= expld
.result
.section
->vma
;
3370 minfo ("0x%V", value
);
3376 struct bfd_link_hash_entry
*h
;
3378 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3379 FALSE
, FALSE
, TRUE
);
3382 value
= h
->u
.def
.value
;
3384 if (expld
.result
.section
)
3385 value
+= expld
.result
.section
->vma
;
3387 minfo ("[0x%V]", value
);
3390 minfo ("[unresolved]");
3402 exp_print_tree (assignment
->exp
);
3407 print_input_statement (lang_input_statement_type
*statm
)
3409 if (statm
->filename
!= NULL
)
3411 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3415 /* Print all symbols defined in a particular section. This is called
3416 via bfd_link_hash_traverse, or by print_all_symbols. */
3419 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3421 asection
*sec
= ptr
;
3423 if ((hash_entry
->type
== bfd_link_hash_defined
3424 || hash_entry
->type
== bfd_link_hash_defweak
)
3425 && sec
== hash_entry
->u
.def
.section
)
3429 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3432 (hash_entry
->u
.def
.value
3433 + hash_entry
->u
.def
.section
->output_offset
3434 + hash_entry
->u
.def
.section
->output_section
->vma
));
3436 minfo (" %T\n", hash_entry
->root
.string
);
3443 print_all_symbols (sec
)
3446 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3447 struct map_symbol_def
*def
;
3452 *ud
->map_symbol_def_tail
= 0;
3453 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3454 print_one_symbol (def
->entry
, sec
);
3457 /* Print information about an input section to the map file. */
3460 print_input_section (lang_input_section_type
*in
)
3462 asection
*i
= in
->section
;
3463 bfd_size_type size
= i
->size
;
3472 minfo ("%s", i
->name
);
3474 len
= 1 + strlen (i
->name
);
3475 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3480 while (len
< SECTION_NAME_MAP_LENGTH
)
3486 if (i
->output_section
!= NULL
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3487 addr
= i
->output_section
->vma
+ i
->output_offset
;
3494 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3496 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3498 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3510 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3513 if (i
->output_section
!= NULL
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3515 if (command_line
.reduce_memory_overheads
)
3516 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3518 print_all_symbols (i
);
3520 print_dot
= addr
+ TO_ADDR (size
);
3526 print_fill_statement (lang_fill_statement_type
*fill
)
3530 fputs (" FILL mask 0x", config
.map_file
);
3531 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3532 fprintf (config
.map_file
, "%02x", *p
);
3533 fputs ("\n", config
.map_file
);
3537 print_data_statement (lang_data_statement_type
*data
)
3545 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3548 addr
= data
->output_vma
;
3549 if (data
->output_section
!= NULL
)
3550 addr
+= data
->output_section
->vma
;
3578 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3580 if (data
->exp
->type
.node_class
!= etree_value
)
3583 exp_print_tree (data
->exp
);
3588 print_dot
= addr
+ TO_ADDR (size
);
3591 /* Print an address statement. These are generated by options like
3595 print_address_statement (lang_address_statement_type
*address
)
3597 minfo (_("Address of section %s set to "), address
->section_name
);
3598 exp_print_tree (address
->address
);
3602 /* Print a reloc statement. */
3605 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3612 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3615 addr
= reloc
->output_vma
;
3616 if (reloc
->output_section
!= NULL
)
3617 addr
+= reloc
->output_section
->vma
;
3619 size
= bfd_get_reloc_size (reloc
->howto
);
3621 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3623 if (reloc
->name
!= NULL
)
3624 minfo ("%s+", reloc
->name
);
3626 minfo ("%s+", reloc
->section
->name
);
3628 exp_print_tree (reloc
->addend_exp
);
3632 print_dot
= addr
+ TO_ADDR (size
);
3636 print_padding_statement (lang_padding_statement_type
*s
)
3644 len
= sizeof " *fill*" - 1;
3645 while (len
< SECTION_NAME_MAP_LENGTH
)
3651 addr
= s
->output_offset
;
3652 if (s
->output_section
!= NULL
)
3653 addr
+= s
->output_section
->vma
;
3654 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3656 if (s
->fill
->size
!= 0)
3660 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3661 fprintf (config
.map_file
, "%02x", *p
);
3666 print_dot
= addr
+ TO_ADDR (s
->size
);
3670 print_wild_statement (lang_wild_statement_type
*w
,
3671 lang_output_section_statement_type
*os
)
3673 struct wildcard_list
*sec
;
3677 if (w
->filenames_sorted
)
3679 if (w
->filename
!= NULL
)
3680 minfo ("%s", w
->filename
);
3683 if (w
->filenames_sorted
)
3687 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
3689 if (sec
->spec
.sorted
)
3691 if (sec
->spec
.exclude_name_list
!= NULL
)
3694 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
3695 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
3696 minfo (" %s", tmp
->name
);
3699 if (sec
->spec
.name
!= NULL
)
3700 minfo ("%s", sec
->spec
.name
);
3703 if (sec
->spec
.sorted
)
3712 print_statement_list (w
->children
.head
, os
);
3715 /* Print a group statement. */
3718 print_group (lang_group_statement_type
*s
,
3719 lang_output_section_statement_type
*os
)
3721 fprintf (config
.map_file
, "START GROUP\n");
3722 print_statement_list (s
->children
.head
, os
);
3723 fprintf (config
.map_file
, "END GROUP\n");
3726 /* Print the list of statements in S.
3727 This can be called for any statement type. */
3730 print_statement_list (lang_statement_union_type
*s
,
3731 lang_output_section_statement_type
*os
)
3735 print_statement (s
, os
);
3740 /* Print the first statement in statement list S.
3741 This can be called for any statement type. */
3744 print_statement (lang_statement_union_type
*s
,
3745 lang_output_section_statement_type
*os
)
3747 switch (s
->header
.type
)
3750 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
3753 case lang_constructors_statement_enum
:
3754 if (constructor_list
.head
!= NULL
)
3756 if (constructors_sorted
)
3757 minfo (" SORT (CONSTRUCTORS)\n");
3759 minfo (" CONSTRUCTORS\n");
3760 print_statement_list (constructor_list
.head
, os
);
3763 case lang_wild_statement_enum
:
3764 print_wild_statement (&s
->wild_statement
, os
);
3766 case lang_address_statement_enum
:
3767 print_address_statement (&s
->address_statement
);
3769 case lang_object_symbols_statement_enum
:
3770 minfo (" CREATE_OBJECT_SYMBOLS\n");
3772 case lang_fill_statement_enum
:
3773 print_fill_statement (&s
->fill_statement
);
3775 case lang_data_statement_enum
:
3776 print_data_statement (&s
->data_statement
);
3778 case lang_reloc_statement_enum
:
3779 print_reloc_statement (&s
->reloc_statement
);
3781 case lang_input_section_enum
:
3782 print_input_section (&s
->input_section
);
3784 case lang_padding_statement_enum
:
3785 print_padding_statement (&s
->padding_statement
);
3787 case lang_output_section_statement_enum
:
3788 print_output_section_statement (&s
->output_section_statement
);
3790 case lang_assignment_statement_enum
:
3791 print_assignment (&s
->assignment_statement
, os
);
3793 case lang_target_statement_enum
:
3794 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
3796 case lang_output_statement_enum
:
3797 minfo ("OUTPUT(%s", s
->output_statement
.name
);
3798 if (output_target
!= NULL
)
3799 minfo (" %s", output_target
);
3802 case lang_input_statement_enum
:
3803 print_input_statement (&s
->input_statement
);
3805 case lang_group_statement_enum
:
3806 print_group (&s
->group_statement
, os
);
3808 case lang_afile_asection_pair_statement_enum
:
3815 print_statements (void)
3817 print_statement_list (statement_list
.head
, abs_output_section
);
3820 /* Print the first N statements in statement list S to STDERR.
3821 If N == 0, nothing is printed.
3822 If N < 0, the entire list is printed.
3823 Intended to be called from GDB. */
3826 dprint_statement (lang_statement_union_type
*s
, int n
)
3828 FILE *map_save
= config
.map_file
;
3830 config
.map_file
= stderr
;
3833 print_statement_list (s
, abs_output_section
);
3836 while (s
&& --n
>= 0)
3838 print_statement (s
, abs_output_section
);
3843 config
.map_file
= map_save
;
3847 insert_pad (lang_statement_union_type
**ptr
,
3849 unsigned int alignment_needed
,
3850 asection
*output_section
,
3853 static fill_type zero_fill
= { 1, { 0 } };
3854 lang_statement_union_type
*pad
= NULL
;
3856 if (ptr
!= &statement_list
.head
)
3857 pad
= ((lang_statement_union_type
*)
3858 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
3860 && pad
->header
.type
== lang_padding_statement_enum
3861 && pad
->padding_statement
.output_section
== output_section
)
3863 /* Use the existing pad statement. */
3865 else if ((pad
= *ptr
) != NULL
3866 && pad
->header
.type
== lang_padding_statement_enum
3867 && pad
->padding_statement
.output_section
== output_section
)
3869 /* Use the existing pad statement. */
3873 /* Make a new padding statement, linked into existing chain. */
3874 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
3875 pad
->header
.next
= *ptr
;
3877 pad
->header
.type
= lang_padding_statement_enum
;
3878 pad
->padding_statement
.output_section
= output_section
;
3881 pad
->padding_statement
.fill
= fill
;
3883 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
3884 pad
->padding_statement
.size
= alignment_needed
;
3885 output_section
->size
+= alignment_needed
;
3888 /* Work out how much this section will move the dot point. */
3892 (lang_statement_union_type
**this_ptr
,
3893 lang_output_section_statement_type
*output_section_statement
,
3897 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
3898 asection
*i
= is
->section
;
3900 if (!is
->ifile
->just_syms_flag
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3902 unsigned int alignment_needed
;
3905 /* Align this section first to the input sections requirement,
3906 then to the output section's requirement. If this alignment
3907 is greater than any seen before, then record it too. Perform
3908 the alignment by inserting a magic 'padding' statement. */
3910 if (output_section_statement
->subsection_alignment
!= -1)
3911 i
->alignment_power
= output_section_statement
->subsection_alignment
;
3913 o
= output_section_statement
->bfd_section
;
3914 if (o
->alignment_power
< i
->alignment_power
)
3915 o
->alignment_power
= i
->alignment_power
;
3917 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
3919 if (alignment_needed
!= 0)
3921 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
3922 dot
+= alignment_needed
;
3925 /* Remember where in the output section this input section goes. */
3927 i
->output_offset
= dot
- o
->vma
;
3929 /* Mark how big the output section must be to contain this now. */
3930 dot
+= TO_ADDR (i
->size
);
3931 o
->size
= TO_SIZE (dot
- o
->vma
);
3935 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
3942 sort_sections_by_lma (const void *arg1
, const void *arg2
)
3944 const asection
*sec1
= *(const asection
**) arg1
;
3945 const asection
*sec2
= *(const asection
**) arg2
;
3947 if (bfd_section_lma (sec1
->owner
, sec1
)
3948 < bfd_section_lma (sec2
->owner
, sec2
))
3950 else if (bfd_section_lma (sec1
->owner
, sec1
)
3951 > bfd_section_lma (sec2
->owner
, sec2
))
3957 #define IGNORE_SECTION(s) \
3958 ((s->flags & SEC_NEVER_LOAD) != 0 \
3959 || (s->flags & SEC_ALLOC) == 0 \
3960 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
3961 && (s->flags & SEC_LOAD) == 0))
3963 /* Check to see if any allocated sections overlap with other allocated
3964 sections. This can happen if a linker script specifies the output
3965 section addresses of the two sections. */
3968 lang_check_section_addresses (void)
3971 asection
**sections
, **spp
;
3979 if (bfd_count_sections (output_bfd
) <= 1)
3982 amt
= bfd_count_sections (output_bfd
) * sizeof (asection
*);
3983 sections
= xmalloc (amt
);
3985 /* Scan all sections in the output list. */
3987 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
3989 /* Only consider loadable sections with real contents. */
3990 if (IGNORE_SECTION (s
) || s
->size
== 0)
3993 sections
[count
] = s
;
4000 qsort (sections
, (size_t) count
, sizeof (asection
*),
4001 sort_sections_by_lma
);
4005 s_start
= bfd_section_lma (output_bfd
, s
);
4006 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4007 for (count
--; count
; count
--)
4009 /* We must check the sections' LMA addresses not their VMA
4010 addresses because overlay sections can have overlapping VMAs
4011 but they must have distinct LMAs. */
4016 s_start
= bfd_section_lma (output_bfd
, s
);
4017 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4019 /* Look for an overlap. */
4020 if (s_end
>= os_start
&& s_start
<= os_end
)
4021 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4022 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4028 /* Make sure the new address is within the region. We explicitly permit the
4029 current address to be at the exact end of the region when the address is
4030 non-zero, in case the region is at the end of addressable memory and the
4031 calculation wraps around. */
4034 os_region_check (lang_output_section_statement_type
*os
,
4035 lang_memory_region_type
*region
,
4039 if ((region
->current
< region
->origin
4040 || (region
->current
- region
->origin
> region
->length
))
4041 && ((region
->current
!= region
->origin
+ region
->length
)
4046 einfo (_("%X%P: address 0x%v of %B section %s"
4047 " is not within region %s\n"),
4049 os
->bfd_section
->owner
,
4050 os
->bfd_section
->name
,
4055 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4057 os
->bfd_section
->owner
,
4058 os
->bfd_section
->name
);
4060 /* Reset the region pointer. */
4061 region
->current
= region
->origin
;
4065 /* Set the sizes for all the output sections. */
4068 lang_size_sections_1
4069 (lang_statement_union_type
*s
,
4070 lang_output_section_statement_type
*output_section_statement
,
4071 lang_statement_union_type
**prev
,
4075 bfd_boolean check_regions
)
4077 /* Size up the sections from their constituent parts. */
4078 for (; s
!= NULL
; s
= s
->header
.next
)
4080 switch (s
->header
.type
)
4082 case lang_output_section_statement_enum
:
4084 bfd_vma newdot
, after
;
4085 lang_output_section_statement_type
*os
;
4087 os
= &s
->output_section_statement
;
4088 if (os
->addr_tree
!= NULL
)
4090 os
->processed
= FALSE
;
4091 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4093 if (!expld
.result
.valid_p
4094 && expld
.phase
!= lang_mark_phase_enum
)
4095 einfo (_("%F%S: non constant or forward reference"
4096 " address expression for section %s\n"),
4099 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4102 if (os
->bfd_section
== NULL
)
4103 /* This section was removed or never actually created. */
4106 /* If this is a COFF shared library section, use the size and
4107 address from the input section. FIXME: This is COFF
4108 specific; it would be cleaner if there were some other way
4109 to do this, but nothing simple comes to mind. */
4110 if ((bfd_get_flavour (output_bfd
) == bfd_target_ecoff_flavour
4111 || bfd_get_flavour (output_bfd
) == bfd_target_coff_flavour
)
4112 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4116 if (os
->children
.head
== NULL
4117 || os
->children
.head
->header
.next
!= NULL
4118 || (os
->children
.head
->header
.type
4119 != lang_input_section_enum
))
4120 einfo (_("%P%X: Internal error on COFF shared library"
4121 " section %s\n"), os
->name
);
4123 input
= os
->children
.head
->input_section
.section
;
4124 bfd_set_section_vma (os
->bfd_section
->owner
,
4126 bfd_section_vma (input
->owner
, input
));
4127 os
->bfd_section
->size
= input
->size
;
4132 if (bfd_is_abs_section (os
->bfd_section
))
4134 /* No matter what happens, an abs section starts at zero. */
4135 ASSERT (os
->bfd_section
->vma
== 0);
4139 if (os
->addr_tree
== NULL
)
4141 /* No address specified for this section, get one
4142 from the region specification. */
4143 if (os
->region
== NULL
4144 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4145 && os
->region
->name
[0] == '*'
4146 && strcmp (os
->region
->name
,
4147 DEFAULT_MEMORY_REGION
) == 0))
4149 os
->region
= lang_memory_default (os
->bfd_section
);
4152 /* If a loadable section is using the default memory
4153 region, and some non default memory regions were
4154 defined, issue an error message. */
4155 if (!IGNORE_SECTION (os
->bfd_section
)
4156 && ! link_info
.relocatable
4158 && strcmp (os
->region
->name
,
4159 DEFAULT_MEMORY_REGION
) == 0
4160 && lang_memory_region_list
!= NULL
4161 && (strcmp (lang_memory_region_list
->name
,
4162 DEFAULT_MEMORY_REGION
) != 0
4163 || lang_memory_region_list
->next
!= NULL
)
4164 && expld
.phase
!= lang_mark_phase_enum
)
4166 /* By default this is an error rather than just a
4167 warning because if we allocate the section to the
4168 default memory region we can end up creating an
4169 excessively large binary, or even seg faulting when
4170 attempting to perform a negative seek. See
4171 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4172 for an example of this. This behaviour can be
4173 overridden by the using the --no-check-sections
4175 if (command_line
.check_section_addresses
)
4176 einfo (_("%P%F: error: no memory region specified"
4177 " for loadable section `%s'\n"),
4178 bfd_get_section_name (output_bfd
,
4181 einfo (_("%P: warning: no memory region specified"
4182 " for loadable section `%s'\n"),
4183 bfd_get_section_name (output_bfd
,
4187 newdot
= os
->region
->current
;
4189 if (os
->section_alignment
== -1)
4191 bfd_vma savedot
= newdot
;
4192 newdot
= align_power (newdot
,
4193 os
->bfd_section
->alignment_power
);
4195 if (newdot
!= savedot
4196 && config
.warn_section_align
4197 && expld
.phase
!= lang_mark_phase_enum
)
4198 einfo (_("%P: warning: changing start of section"
4199 " %s by %lu bytes\n"),
4200 os
->name
, (unsigned long) (newdot
- savedot
));
4204 /* The section starts here.
4205 First, align to what the section needs. */
4207 if (os
->section_alignment
!= -1)
4208 newdot
= align_power (newdot
, os
->section_alignment
);
4210 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4212 os
->bfd_section
->output_offset
= 0;
4215 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4216 os
->fill
, newdot
, relax
, check_regions
);
4218 os
->processed
= TRUE
;
4220 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4222 ASSERT (os
->bfd_section
->size
== 0);
4226 dot
= os
->bfd_section
->vma
;
4228 /* Put the section within the requested block size, or
4229 align at the block boundary. */
4231 + TO_ADDR (os
->bfd_section
->size
)
4232 + os
->block_value
- 1)
4233 & - (bfd_vma
) os
->block_value
);
4235 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4237 /* .tbss sections effectively have zero size. */
4238 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4239 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4240 || link_info
.relocatable
)
4241 dot
+= TO_ADDR (os
->bfd_section
->size
);
4243 if (os
->update_dot_tree
!= 0)
4244 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4246 /* Update dot in the region ?
4247 We only do this if the section is going to be allocated,
4248 since unallocated sections do not contribute to the region's
4249 overall size in memory.
4251 If the SEC_NEVER_LOAD bit is not set, it will affect the
4252 addresses of sections after it. We have to update
4254 if (os
->region
!= NULL
4255 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4256 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4258 os
->region
->current
= dot
;
4261 /* Make sure the new address is within the region. */
4262 os_region_check (os
, os
->region
, os
->addr_tree
,
4263 os
->bfd_section
->vma
);
4265 /* If there's no load address specified, use the run
4266 region as the load region. */
4267 if (os
->lma_region
== NULL
&& os
->load_base
== NULL
)
4268 os
->lma_region
= os
->region
;
4270 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
)
4272 /* Set load_base, which will be handled later. */
4273 os
->load_base
= exp_intop (os
->lma_region
->current
);
4274 os
->lma_region
->current
+=
4275 TO_ADDR (os
->bfd_section
->size
);
4277 os_region_check (os
, os
->lma_region
, NULL
,
4278 os
->bfd_section
->lma
);
4284 case lang_constructors_statement_enum
:
4285 dot
= lang_size_sections_1 (constructor_list
.head
,
4286 output_section_statement
,
4287 &s
->wild_statement
.children
.head
,
4288 fill
, dot
, relax
, check_regions
);
4291 case lang_data_statement_enum
:
4293 unsigned int size
= 0;
4295 s
->data_statement
.output_vma
=
4296 dot
- output_section_statement
->bfd_section
->vma
;
4297 s
->data_statement
.output_section
=
4298 output_section_statement
->bfd_section
;
4300 /* We might refer to provided symbols in the expression, and
4301 need to mark them as needed. */
4302 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4304 switch (s
->data_statement
.type
)
4322 if (size
< TO_SIZE ((unsigned) 1))
4323 size
= TO_SIZE ((unsigned) 1);
4324 dot
+= TO_ADDR (size
);
4325 output_section_statement
->bfd_section
->size
+= size
;
4329 case lang_reloc_statement_enum
:
4333 s
->reloc_statement
.output_vma
=
4334 dot
- output_section_statement
->bfd_section
->vma
;
4335 s
->reloc_statement
.output_section
=
4336 output_section_statement
->bfd_section
;
4337 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4338 dot
+= TO_ADDR (size
);
4339 output_section_statement
->bfd_section
->size
+= size
;
4343 case lang_wild_statement_enum
:
4344 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4345 output_section_statement
,
4346 &s
->wild_statement
.children
.head
,
4347 fill
, dot
, relax
, check_regions
);
4350 case lang_object_symbols_statement_enum
:
4351 link_info
.create_object_symbols_section
=
4352 output_section_statement
->bfd_section
;
4355 case lang_output_statement_enum
:
4356 case lang_target_statement_enum
:
4359 case lang_input_section_enum
:
4363 i
= (*prev
)->input_section
.section
;
4368 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4369 einfo (_("%P%F: can't relax section: %E\n"));
4373 dot
= size_input_section (prev
, output_section_statement
,
4374 output_section_statement
->fill
, dot
);
4378 case lang_input_statement_enum
:
4381 case lang_fill_statement_enum
:
4382 s
->fill_statement
.output_section
=
4383 output_section_statement
->bfd_section
;
4385 fill
= s
->fill_statement
.fill
;
4388 case lang_assignment_statement_enum
:
4390 bfd_vma newdot
= dot
;
4392 exp_fold_tree (s
->assignment_statement
.exp
,
4393 output_section_statement
->bfd_section
,
4396 if (newdot
!= dot
&& !output_section_statement
->ignored
)
4398 if (output_section_statement
== abs_output_section
)
4400 /* If we don't have an output section, then just adjust
4401 the default memory address. */
4402 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4403 FALSE
)->current
= newdot
;
4407 /* Insert a pad after this statement. We can't
4408 put the pad before when relaxing, in case the
4409 assignment references dot. */
4410 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4411 output_section_statement
->bfd_section
, dot
);
4413 /* Don't neuter the pad below when relaxing. */
4416 /* If dot is advanced, this implies that the section
4417 should have space allocated to it, unless the
4418 user has explicitly stated that the section
4419 should never be loaded. */
4420 if (!(output_section_statement
->flags
4421 & (SEC_NEVER_LOAD
| SEC_ALLOC
)))
4422 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4429 case lang_padding_statement_enum
:
4430 /* If this is the first time lang_size_sections is called,
4431 we won't have any padding statements. If this is the
4432 second or later passes when relaxing, we should allow
4433 padding to shrink. If padding is needed on this pass, it
4434 will be added back in. */
4435 s
->padding_statement
.size
= 0;
4437 /* Make sure output_offset is valid. If relaxation shrinks
4438 the section and this pad isn't needed, it's possible to
4439 have output_offset larger than the final size of the
4440 section. bfd_set_section_contents will complain even for
4441 a pad size of zero. */
4442 s
->padding_statement
.output_offset
4443 = dot
- output_section_statement
->bfd_section
->vma
;
4446 case lang_group_statement_enum
:
4447 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4448 output_section_statement
,
4449 &s
->group_statement
.children
.head
,
4450 fill
, dot
, relax
, check_regions
);
4457 /* We can only get here when relaxing is turned on. */
4458 case lang_address_statement_enum
:
4461 prev
= &s
->header
.next
;
4467 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
4469 lang_statement_iteration
++;
4470 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
4471 &statement_list
.head
, 0, 0, relax
, check_regions
);
4475 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
4477 expld
.phase
= lang_allocating_phase_enum
;
4478 expld
.dataseg
.phase
= exp_dataseg_none
;
4480 one_lang_size_sections_pass (relax
, check_regions
);
4481 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
4482 && link_info
.relro
&& expld
.dataseg
.relro_end
)
4484 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4485 to put expld.dataseg.relro on a (common) page boundary. */
4486 bfd_vma old_min_base
, relro_end
, maxpage
;
4488 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
4489 old_min_base
= expld
.dataseg
.min_base
;
4490 maxpage
= expld
.dataseg
.maxpagesize
;
4491 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
4492 & (expld
.dataseg
.pagesize
- 1));
4493 /* Compute the expected PT_GNU_RELRO segment end. */
4494 relro_end
= (expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
4495 & ~(expld
.dataseg
.pagesize
- 1);
4496 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
4498 expld
.dataseg
.base
-= maxpage
;
4499 relro_end
-= maxpage
;
4501 one_lang_size_sections_pass (relax
, check_regions
);
4502 if (expld
.dataseg
.relro_end
> relro_end
)
4504 /* The alignment of sections between DATA_SEGMENT_ALIGN
4505 and DATA_SEGMENT_RELRO_END caused huge padding to be
4506 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4508 unsigned int max_alignment_power
= 0;
4510 /* Find maximum alignment power of sections between
4511 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4512 for (sec
= output_bfd
->sections
; sec
; sec
= sec
->next
)
4513 if (sec
->vma
>= expld
.dataseg
.base
4514 && sec
->vma
< expld
.dataseg
.relro_end
4515 && sec
->alignment_power
> max_alignment_power
)
4516 max_alignment_power
= sec
->alignment_power
;
4518 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
4520 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
4522 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
4523 expld
.dataseg
.base
-= (1 << max_alignment_power
);
4524 one_lang_size_sections_pass (relax
, check_regions
);
4527 link_info
.relro_start
= expld
.dataseg
.base
;
4528 link_info
.relro_end
= expld
.dataseg
.relro_end
;
4530 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
4532 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4533 a page could be saved in the data segment. */
4534 bfd_vma first
, last
;
4536 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
4537 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
4539 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
4540 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
4541 && first
+ last
<= expld
.dataseg
.pagesize
)
4543 expld
.dataseg
.phase
= exp_dataseg_adjust
;
4544 one_lang_size_sections_pass (relax
, check_regions
);
4548 expld
.phase
= lang_final_phase_enum
;
4551 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4554 lang_do_assignments_1
4555 (lang_statement_union_type
*s
,
4556 lang_output_section_statement_type
*output_section_statement
,
4560 for (; s
!= NULL
; s
= s
->header
.next
)
4562 switch (s
->header
.type
)
4564 case lang_constructors_statement_enum
:
4565 dot
= lang_do_assignments_1 (constructor_list
.head
,
4566 output_section_statement
,
4571 case lang_output_section_statement_enum
:
4573 lang_output_section_statement_type
*os
;
4575 os
= &(s
->output_section_statement
);
4576 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
4578 dot
= os
->bfd_section
->vma
;
4579 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
4580 /* .tbss sections effectively have zero size. */
4581 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4582 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4583 || link_info
.relocatable
)
4584 dot
+= TO_ADDR (os
->bfd_section
->size
);
4588 /* If nothing has been placed into the output section then
4589 it won't have a bfd_section. */
4590 if (os
->bfd_section
&& !os
->ignored
)
4592 os
->bfd_section
->lma
4593 = exp_get_abs_int (os
->load_base
, 0, "load base");
4599 case lang_wild_statement_enum
:
4601 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
4602 output_section_statement
,
4606 case lang_object_symbols_statement_enum
:
4607 case lang_output_statement_enum
:
4608 case lang_target_statement_enum
:
4611 case lang_data_statement_enum
:
4612 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4613 if (expld
.result
.valid_p
)
4614 s
->data_statement
.value
= (expld
.result
.value
4615 + expld
.result
.section
->vma
);
4617 einfo (_("%F%P: invalid data statement\n"));
4620 switch (s
->data_statement
.type
)
4638 if (size
< TO_SIZE ((unsigned) 1))
4639 size
= TO_SIZE ((unsigned) 1);
4640 dot
+= TO_ADDR (size
);
4644 case lang_reloc_statement_enum
:
4645 exp_fold_tree (s
->reloc_statement
.addend_exp
,
4646 bfd_abs_section_ptr
, &dot
);
4647 if (expld
.result
.valid_p
)
4648 s
->reloc_statement
.addend_value
= expld
.result
.value
;
4650 einfo (_("%F%P: invalid reloc statement\n"));
4651 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
4654 case lang_input_section_enum
:
4656 asection
*in
= s
->input_section
.section
;
4658 if ((in
->flags
& SEC_EXCLUDE
) == 0)
4659 dot
+= TO_ADDR (in
->size
);
4663 case lang_input_statement_enum
:
4666 case lang_fill_statement_enum
:
4667 fill
= s
->fill_statement
.fill
;
4670 case lang_assignment_statement_enum
:
4671 exp_fold_tree (s
->assignment_statement
.exp
,
4672 output_section_statement
->bfd_section
,
4676 case lang_padding_statement_enum
:
4677 dot
+= TO_ADDR (s
->padding_statement
.size
);
4680 case lang_group_statement_enum
:
4681 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
4682 output_section_statement
,
4690 case lang_address_statement_enum
:
4698 lang_do_assignments (void)
4700 lang_statement_iteration
++;
4701 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
4704 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4705 operator .startof. (section_name), it produces an undefined symbol
4706 .startof.section_name. Similarly, when it sees
4707 .sizeof. (section_name), it produces an undefined symbol
4708 .sizeof.section_name. For all the output sections, we look for
4709 such symbols, and set them to the correct value. */
4712 lang_set_startof (void)
4716 if (link_info
.relocatable
)
4719 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4721 const char *secname
;
4723 struct bfd_link_hash_entry
*h
;
4725 secname
= bfd_get_section_name (output_bfd
, s
);
4726 buf
= xmalloc (10 + strlen (secname
));
4728 sprintf (buf
, ".startof.%s", secname
);
4729 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4730 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4732 h
->type
= bfd_link_hash_defined
;
4733 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, s
);
4734 h
->u
.def
.section
= bfd_abs_section_ptr
;
4737 sprintf (buf
, ".sizeof.%s", secname
);
4738 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4739 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4741 h
->type
= bfd_link_hash_defined
;
4742 h
->u
.def
.value
= TO_ADDR (s
->size
);
4743 h
->u
.def
.section
= bfd_abs_section_ptr
;
4753 struct bfd_link_hash_entry
*h
;
4756 if (link_info
.relocatable
|| link_info
.shared
)
4761 if (entry_symbol
.name
== NULL
)
4763 /* No entry has been specified. Look for the default entry, but
4764 don't warn if we don't find it. */
4765 entry_symbol
.name
= entry_symbol_default
;
4769 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
4770 FALSE
, FALSE
, TRUE
);
4772 && (h
->type
== bfd_link_hash_defined
4773 || h
->type
== bfd_link_hash_defweak
)
4774 && h
->u
.def
.section
->output_section
!= NULL
)
4778 val
= (h
->u
.def
.value
4779 + bfd_get_section_vma (output_bfd
,
4780 h
->u
.def
.section
->output_section
)
4781 + h
->u
.def
.section
->output_offset
);
4782 if (! bfd_set_start_address (output_bfd
, val
))
4783 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
4790 /* We couldn't find the entry symbol. Try parsing it as a
4792 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
4795 if (! bfd_set_start_address (output_bfd
, val
))
4796 einfo (_("%P%F: can't set start address\n"));
4802 /* Can't find the entry symbol, and it's not a number. Use
4803 the first address in the text section. */
4804 ts
= bfd_get_section_by_name (output_bfd
, entry_section
);
4808 einfo (_("%P: warning: cannot find entry symbol %s;"
4809 " defaulting to %V\n"),
4811 bfd_get_section_vma (output_bfd
, ts
));
4812 if (! bfd_set_start_address (output_bfd
,
4813 bfd_get_section_vma (output_bfd
,
4815 einfo (_("%P%F: can't set start address\n"));
4820 einfo (_("%P: warning: cannot find entry symbol %s;"
4821 " not setting start address\n"),
4827 /* Don't bfd_hash_table_free (&lang_definedness_table);
4828 map file output may result in a call of lang_track_definedness. */
4831 /* This is a small function used when we want to ignore errors from
4835 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
4837 /* Don't do anything. */
4840 /* Check that the architecture of all the input files is compatible
4841 with the output file. Also call the backend to let it do any
4842 other checking that is needed. */
4847 lang_statement_union_type
*file
;
4849 const bfd_arch_info_type
*compatible
;
4851 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
4853 input_bfd
= file
->input_statement
.the_bfd
;
4855 = bfd_arch_get_compatible (input_bfd
, output_bfd
,
4856 command_line
.accept_unknown_input_arch
);
4858 /* In general it is not possible to perform a relocatable
4859 link between differing object formats when the input
4860 file has relocations, because the relocations in the
4861 input format may not have equivalent representations in
4862 the output format (and besides BFD does not translate
4863 relocs for other link purposes than a final link). */
4864 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
4865 && (compatible
== NULL
4866 || bfd_get_flavour (input_bfd
) != bfd_get_flavour (output_bfd
))
4867 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
4869 einfo (_("%P%F: Relocatable linking with relocations from"
4870 " format %s (%B) to format %s (%B) is not supported\n"),
4871 bfd_get_target (input_bfd
), input_bfd
,
4872 bfd_get_target (output_bfd
), output_bfd
);
4873 /* einfo with %F exits. */
4876 if (compatible
== NULL
)
4878 if (command_line
.warn_mismatch
)
4879 einfo (_("%P: warning: %s architecture of input file `%B'"
4880 " is incompatible with %s output\n"),
4881 bfd_printable_name (input_bfd
), input_bfd
,
4882 bfd_printable_name (output_bfd
));
4884 else if (bfd_count_sections (input_bfd
))
4886 /* If the input bfd has no contents, it shouldn't set the
4887 private data of the output bfd. */
4889 bfd_error_handler_type pfn
= NULL
;
4891 /* If we aren't supposed to warn about mismatched input
4892 files, temporarily set the BFD error handler to a
4893 function which will do nothing. We still want to call
4894 bfd_merge_private_bfd_data, since it may set up
4895 information which is needed in the output file. */
4896 if (! command_line
.warn_mismatch
)
4897 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
4898 if (! bfd_merge_private_bfd_data (input_bfd
, output_bfd
))
4900 if (command_line
.warn_mismatch
)
4901 einfo (_("%P%X: failed to merge target specific data"
4902 " of file %B\n"), input_bfd
);
4904 if (! command_line
.warn_mismatch
)
4905 bfd_set_error_handler (pfn
);
4910 /* Look through all the global common symbols and attach them to the
4911 correct section. The -sort-common command line switch may be used
4912 to roughly sort the entries by size. */
4917 if (command_line
.inhibit_common_definition
)
4919 if (link_info
.relocatable
4920 && ! command_line
.force_common_definition
)
4923 if (! config
.sort_common
)
4924 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
4929 for (power
= 4; power
>= 0; power
--)
4930 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
4934 /* Place one common symbol in the correct section. */
4937 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
4939 unsigned int power_of_two
;
4943 if (h
->type
!= bfd_link_hash_common
)
4947 power_of_two
= h
->u
.c
.p
->alignment_power
;
4949 if (config
.sort_common
4950 && power_of_two
< (unsigned int) *(int *) info
)
4953 section
= h
->u
.c
.p
->section
;
4955 /* Increase the size of the section to align the common sym. */
4956 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
4957 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
4959 /* Adjust the alignment if necessary. */
4960 if (power_of_two
> section
->alignment_power
)
4961 section
->alignment_power
= power_of_two
;
4963 /* Change the symbol from common to defined. */
4964 h
->type
= bfd_link_hash_defined
;
4965 h
->u
.def
.section
= section
;
4966 h
->u
.def
.value
= section
->size
;
4968 /* Increase the size of the section. */
4969 section
->size
+= size
;
4971 /* Make sure the section is allocated in memory, and make sure that
4972 it is no longer a common section. */
4973 section
->flags
|= SEC_ALLOC
;
4974 section
->flags
&= ~SEC_IS_COMMON
;
4976 if (config
.map_file
!= NULL
)
4978 static bfd_boolean header_printed
;
4983 if (! header_printed
)
4985 minfo (_("\nAllocating common symbols\n"));
4986 minfo (_("Common symbol size file\n\n"));
4987 header_printed
= TRUE
;
4990 name
= demangle (h
->root
.string
);
4992 len
= strlen (name
);
5007 if (size
<= 0xffffffff)
5008 sprintf (buf
, "%lx", (unsigned long) size
);
5010 sprintf_vma (buf
, size
);
5020 minfo ("%B\n", section
->owner
);
5026 /* Run through the input files and ensure that every input section has
5027 somewhere to go. If one is found without a destination then create
5028 an input request and place it into the statement tree. */
5031 lang_place_orphans (void)
5033 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5037 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5039 if (s
->output_section
== NULL
)
5041 /* This section of the file is not attached, root
5042 around for a sensible place for it to go. */
5044 if (file
->just_syms_flag
)
5045 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5046 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5047 s
->output_section
= bfd_abs_section_ptr
;
5048 else if (strcmp (s
->name
, "COMMON") == 0)
5050 /* This is a lonely common section which must have
5051 come from an archive. We attach to the section
5052 with the wildcard. */
5053 if (! link_info
.relocatable
5054 || command_line
.force_common_definition
)
5056 if (default_common_section
== NULL
)
5058 default_common_section
=
5059 lang_output_section_statement_lookup (".bss");
5062 lang_add_section (&default_common_section
->children
, s
,
5063 default_common_section
, file
);
5066 else if (ldemul_place_orphan (file
, s
))
5070 lang_output_section_statement_type
*os
;
5072 os
= lang_output_section_statement_lookup (s
->name
);
5073 lang_add_section (&os
->children
, s
, os
, file
);
5081 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5083 flagword
*ptr_flags
;
5085 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5091 *ptr_flags
|= SEC_ALLOC
;
5095 *ptr_flags
|= SEC_READONLY
;
5099 *ptr_flags
|= SEC_DATA
;
5103 *ptr_flags
|= SEC_CODE
;
5108 *ptr_flags
|= SEC_LOAD
;
5112 einfo (_("%P%F: invalid syntax in flags\n"));
5119 /* Call a function on each input file. This function will be called
5120 on an archive, but not on the elements. */
5123 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5125 lang_input_statement_type
*f
;
5127 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5129 f
= (lang_input_statement_type
*) f
->next_real_file
)
5133 /* Call a function on each file. The function will be called on all
5134 the elements of an archive which are included in the link, but will
5135 not be called on the archive file itself. */
5138 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5140 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5147 ldlang_add_file (lang_input_statement_type
*entry
)
5151 lang_statement_append (&file_chain
,
5152 (lang_statement_union_type
*) entry
,
5155 /* The BFD linker needs to have a list of all input BFDs involved in
5157 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5158 ASSERT (entry
->the_bfd
!= output_bfd
);
5159 for (pp
= &link_info
.input_bfds
; *pp
!= NULL
; pp
= &(*pp
)->link_next
)
5161 *pp
= entry
->the_bfd
;
5162 entry
->the_bfd
->usrdata
= entry
;
5163 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5165 /* Look through the sections and check for any which should not be
5166 included in the link. We need to do this now, so that we can
5167 notice when the backend linker tries to report multiple
5168 definition errors for symbols which are in sections we aren't
5169 going to link. FIXME: It might be better to entirely ignore
5170 symbols which are defined in sections which are going to be
5171 discarded. This would require modifying the backend linker for
5172 each backend which might set the SEC_LINK_ONCE flag. If we do
5173 this, we should probably handle SEC_EXCLUDE in the same way. */
5175 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5179 lang_add_output (const char *name
, int from_script
)
5181 /* Make -o on command line override OUTPUT in script. */
5182 if (!had_output_filename
|| !from_script
)
5184 output_filename
= name
;
5185 had_output_filename
= TRUE
;
5189 static lang_output_section_statement_type
*current_section
;
5200 for (l
= 0; l
< 32; l
++)
5202 if (i
>= (unsigned int) x
)
5210 lang_output_section_statement_type
*
5211 lang_enter_output_section_statement (const char *output_section_statement_name
,
5212 etree_type
*address_exp
,
5213 enum section_type sectype
,
5215 etree_type
*subalign
,
5219 lang_output_section_statement_type
*os
;
5223 lang_output_section_statement_lookup_1 (output_section_statement_name
,
5226 /* Make next things chain into subchain of this. */
5228 if (os
->addr_tree
== NULL
)
5230 os
->addr_tree
= address_exp
;
5232 os
->sectype
= sectype
;
5233 if (sectype
!= noload_section
)
5234 os
->flags
= SEC_NO_FLAGS
;
5236 os
->flags
= SEC_NEVER_LOAD
;
5237 os
->block_value
= 1;
5238 stat_ptr
= &os
->children
;
5240 os
->subsection_alignment
=
5241 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5242 os
->section_alignment
=
5243 topower (exp_get_value_int (align
, -1, "section alignment"));
5245 os
->load_base
= ebase
;
5252 lang_output_statement_type
*new =
5253 new_stat (lang_output_statement
, stat_ptr
);
5255 new->name
= output_filename
;
5258 /* Reset the current counters in the regions. */
5261 lang_reset_memory_regions (void)
5263 lang_memory_region_type
*p
= lang_memory_region_list
;
5265 lang_output_section_statement_type
*os
;
5267 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5269 p
->old_length
= (bfd_size_type
) (p
->current
- p
->origin
);
5270 p
->current
= p
->origin
;
5273 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5276 os
->processed
= FALSE
;
5278 for (o
= output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5280 /* Save the last size for possible use by bfd_relax_section. */
5281 o
->rawsize
= o
->size
;
5286 /* Worker for lang_gc_sections_1. */
5289 gc_section_callback (lang_wild_statement_type
*ptr
,
5290 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5292 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5293 void *data ATTRIBUTE_UNUSED
)
5295 /* If the wild pattern was marked KEEP, the member sections
5296 should be as well. */
5297 if (ptr
->keep_sections
)
5298 section
->flags
|= SEC_KEEP
;
5301 /* Iterate over sections marking them against GC. */
5304 lang_gc_sections_1 (lang_statement_union_type
*s
)
5306 for (; s
!= NULL
; s
= s
->header
.next
)
5308 switch (s
->header
.type
)
5310 case lang_wild_statement_enum
:
5311 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5313 case lang_constructors_statement_enum
:
5314 lang_gc_sections_1 (constructor_list
.head
);
5316 case lang_output_section_statement_enum
:
5317 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5319 case lang_group_statement_enum
:
5320 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5329 lang_gc_sections (void)
5331 struct bfd_link_hash_entry
*h
;
5332 ldlang_undef_chain_list_type
*ulist
;
5334 /* Keep all sections so marked in the link script. */
5336 lang_gc_sections_1 (statement_list
.head
);
5338 /* Keep all sections containing symbols undefined on the command-line,
5339 and the section containing the entry symbol. */
5341 for (ulist
= link_info
.gc_sym_list
; ulist
; ulist
= ulist
->next
)
5343 h
= bfd_link_hash_lookup (link_info
.hash
, ulist
->name
,
5344 FALSE
, FALSE
, FALSE
);
5347 && (h
->type
== bfd_link_hash_defined
5348 || h
->type
== bfd_link_hash_defweak
)
5349 && ! bfd_is_abs_section (h
->u
.def
.section
))
5351 h
->u
.def
.section
->flags
|= SEC_KEEP
;
5355 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5356 the special case of debug info. (See bfd/stabs.c)
5357 Twiddle the flag here, to simplify later linker code. */
5358 if (link_info
.relocatable
)
5360 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5363 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5364 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5365 sec
->flags
&= ~SEC_EXCLUDE
;
5369 if (link_info
.gc_sections
)
5370 bfd_gc_sections (output_bfd
, &link_info
);
5376 current_target
= default_target
;
5378 /* Open the output file. */
5379 lang_for_each_statement (ldlang_open_output
);
5382 ldemul_create_output_section_statements ();
5384 /* Add to the hash table all undefineds on the command line. */
5385 lang_place_undefineds ();
5387 if (!bfd_section_already_linked_table_init ())
5388 einfo (_("%P%F: Failed to create hash table\n"));
5390 /* Create a bfd for each input file. */
5391 current_target
= default_target
;
5392 open_input_bfds (statement_list
.head
, FALSE
);
5394 link_info
.gc_sym_list
= &entry_symbol
;
5395 if (entry_symbol
.name
== NULL
)
5396 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
5398 ldemul_after_open ();
5400 bfd_section_already_linked_table_free ();
5402 /* Make sure that we're not mixing architectures. We call this
5403 after all the input files have been opened, but before we do any
5404 other processing, so that any operations merge_private_bfd_data
5405 does on the output file will be known during the rest of the
5409 /* Handle .exports instead of a version script if we're told to do so. */
5410 if (command_line
.version_exports_section
)
5411 lang_do_version_exports_section ();
5413 /* Build all sets based on the information gathered from the input
5415 ldctor_build_sets ();
5417 /* Remove unreferenced sections if asked to. */
5418 lang_gc_sections ();
5420 /* Size up the common data. */
5423 /* Update wild statements. */
5424 update_wild_statements (statement_list
.head
);
5426 /* Run through the contours of the script and attach input sections
5427 to the correct output sections. */
5428 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
5430 /* Find any sections not attached explicitly and handle them. */
5431 lang_place_orphans ();
5433 if (! link_info
.relocatable
)
5437 /* Merge SEC_MERGE sections. This has to be done after GC of
5438 sections, so that GCed sections are not merged, but before
5439 assigning dynamic symbols, since removing whole input sections
5441 bfd_merge_sections (output_bfd
, &link_info
);
5443 /* Look for a text section and set the readonly attribute in it. */
5444 found
= bfd_get_section_by_name (output_bfd
, ".text");
5448 if (config
.text_read_only
)
5449 found
->flags
|= SEC_READONLY
;
5451 found
->flags
&= ~SEC_READONLY
;
5455 /* Do anything special before sizing sections. This is where ELF
5456 and other back-ends size dynamic sections. */
5457 ldemul_before_allocation ();
5459 /* We must record the program headers before we try to fix the
5460 section positions, since they will affect SIZEOF_HEADERS. */
5461 lang_record_phdrs ();
5463 /* Size up the sections. */
5464 lang_size_sections (NULL
, !command_line
.relax
);
5466 /* Now run around and relax if we can. */
5467 if (command_line
.relax
)
5469 /* Keep relaxing until bfd_relax_section gives up. */
5470 bfd_boolean relax_again
;
5474 relax_again
= FALSE
;
5476 /* Note: pe-dll.c does something like this also. If you find
5477 you need to change this code, you probably need to change
5478 pe-dll.c also. DJ */
5480 /* Do all the assignments with our current guesses as to
5482 lang_do_assignments ();
5484 /* We must do this after lang_do_assignments, because it uses
5486 lang_reset_memory_regions ();
5488 /* Perform another relax pass - this time we know where the
5489 globals are, so can make a better guess. */
5490 lang_size_sections (&relax_again
, FALSE
);
5492 /* If the normal relax is done and the relax finalize pass
5493 is not performed yet, we perform another relax pass. */
5494 if (!relax_again
&& link_info
.need_relax_finalize
)
5496 link_info
.need_relax_finalize
= FALSE
;
5500 while (relax_again
);
5502 /* Final extra sizing to report errors. */
5503 lang_do_assignments ();
5504 lang_reset_memory_regions ();
5505 lang_size_sections (NULL
, TRUE
);
5508 /* See if anything special should be done now we know how big
5510 ldemul_after_allocation ();
5512 /* Fix any .startof. or .sizeof. symbols. */
5513 lang_set_startof ();
5515 /* Do all the assignments, now that we know the final resting places
5516 of all the symbols. */
5518 lang_do_assignments ();
5520 /* Make sure that the section addresses make sense. */
5521 if (! link_info
.relocatable
5522 && command_line
.check_section_addresses
)
5523 lang_check_section_addresses ();
5530 /* EXPORTED TO YACC */
5533 lang_add_wild (struct wildcard_spec
*filespec
,
5534 struct wildcard_list
*section_list
,
5535 bfd_boolean keep_sections
)
5537 struct wildcard_list
*curr
, *next
;
5538 lang_wild_statement_type
*new;
5540 /* Reverse the list as the parser puts it back to front. */
5541 for (curr
= section_list
, section_list
= NULL
;
5543 section_list
= curr
, curr
= next
)
5545 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
5546 placed_commons
= TRUE
;
5549 curr
->next
= section_list
;
5552 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
5554 if (strcmp (filespec
->name
, "*") == 0)
5555 filespec
->name
= NULL
;
5556 else if (! wildcardp (filespec
->name
))
5557 lang_has_input_file
= TRUE
;
5560 new = new_stat (lang_wild_statement
, stat_ptr
);
5561 new->filename
= NULL
;
5562 new->filenames_sorted
= FALSE
;
5563 if (filespec
!= NULL
)
5565 new->filename
= filespec
->name
;
5566 new->filenames_sorted
= filespec
->sorted
== by_name
;
5568 new->section_list
= section_list
;
5569 new->keep_sections
= keep_sections
;
5570 lang_list_init (&new->children
);
5571 analyze_walk_wild_section_handler (new);
5575 lang_section_start (const char *name
, etree_type
*address
,
5576 const segment_type
*segment
)
5578 lang_address_statement_type
*ad
;
5580 ad
= new_stat (lang_address_statement
, stat_ptr
);
5581 ad
->section_name
= name
;
5582 ad
->address
= address
;
5583 ad
->segment
= segment
;
5586 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5587 because of a -e argument on the command line, or zero if this is
5588 called by ENTRY in a linker script. Command line arguments take
5592 lang_add_entry (const char *name
, bfd_boolean cmdline
)
5594 if (entry_symbol
.name
== NULL
5596 || ! entry_from_cmdline
)
5598 entry_symbol
.name
= name
;
5599 entry_from_cmdline
= cmdline
;
5603 /* Set the default start symbol to NAME. .em files should use this,
5604 not lang_add_entry, to override the use of "start" if neither the
5605 linker script nor the command line specifies an entry point. NAME
5606 must be permanently allocated. */
5608 lang_default_entry (const char *name
)
5610 entry_symbol_default
= name
;
5614 lang_add_target (const char *name
)
5616 lang_target_statement_type
*new = new_stat (lang_target_statement
,
5624 lang_add_map (const char *name
)
5631 map_option_f
= TRUE
;
5639 lang_add_fill (fill_type
*fill
)
5641 lang_fill_statement_type
*new = new_stat (lang_fill_statement
,
5648 lang_add_data (int type
, union etree_union
*exp
)
5651 lang_data_statement_type
*new = new_stat (lang_data_statement
,
5659 /* Create a new reloc statement. RELOC is the BFD relocation type to
5660 generate. HOWTO is the corresponding howto structure (we could
5661 look this up, but the caller has already done so). SECTION is the
5662 section to generate a reloc against, or NAME is the name of the
5663 symbol to generate a reloc against. Exactly one of SECTION and
5664 NAME must be NULL. ADDEND is an expression for the addend. */
5667 lang_add_reloc (bfd_reloc_code_real_type reloc
,
5668 reloc_howto_type
*howto
,
5671 union etree_union
*addend
)
5673 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
5677 p
->section
= section
;
5679 p
->addend_exp
= addend
;
5681 p
->addend_value
= 0;
5682 p
->output_section
= NULL
;
5686 lang_assignment_statement_type
*
5687 lang_add_assignment (etree_type
*exp
)
5689 lang_assignment_statement_type
*new = new_stat (lang_assignment_statement
,
5697 lang_add_attribute (enum statement_enum attribute
)
5699 new_statement (attribute
, sizeof (lang_statement_union_type
), stat_ptr
);
5703 lang_startup (const char *name
)
5705 if (startup_file
!= NULL
)
5707 einfo (_("%P%F: multiple STARTUP files\n"));
5709 first_file
->filename
= name
;
5710 first_file
->local_sym_name
= name
;
5711 first_file
->real
= TRUE
;
5713 startup_file
= name
;
5717 lang_float (bfd_boolean maybe
)
5719 lang_float_flag
= maybe
;
5723 /* Work out the load- and run-time regions from a script statement, and
5724 store them in *LMA_REGION and *REGION respectively.
5726 MEMSPEC is the name of the run-time region, or the value of
5727 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5728 LMA_MEMSPEC is the name of the load-time region, or null if the
5729 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5730 had an explicit load address.
5732 It is an error to specify both a load region and a load address. */
5735 lang_get_regions (lang_memory_region_type
**region
,
5736 lang_memory_region_type
**lma_region
,
5737 const char *memspec
,
5738 const char *lma_memspec
,
5739 bfd_boolean have_lma
,
5740 bfd_boolean have_vma
)
5742 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
5744 /* If no runtime region or VMA has been specified, but the load region
5745 has been specified, then use the load region for the runtime region
5747 if (lma_memspec
!= NULL
5749 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
5750 *region
= *lma_region
;
5752 *region
= lang_memory_region_lookup (memspec
, FALSE
);
5754 if (have_lma
&& lma_memspec
!= 0)
5755 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5759 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
5760 lang_output_section_phdr_list
*phdrs
,
5761 const char *lma_memspec
)
5763 lang_get_regions (¤t_section
->region
,
5764 ¤t_section
->lma_region
,
5765 memspec
, lma_memspec
,
5766 current_section
->load_base
!= NULL
,
5767 current_section
->addr_tree
!= NULL
);
5768 current_section
->fill
= fill
;
5769 current_section
->phdrs
= phdrs
;
5770 stat_ptr
= &statement_list
;
5773 /* Create an absolute symbol with the given name with the value of the
5774 address of first byte of the section named.
5776 If the symbol already exists, then do nothing. */
5779 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
5781 struct bfd_link_hash_entry
*h
;
5783 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5785 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5787 if (h
->type
== bfd_link_hash_new
5788 || h
->type
== bfd_link_hash_undefined
)
5792 h
->type
= bfd_link_hash_defined
;
5794 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5798 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, sec
);
5800 h
->u
.def
.section
= bfd_abs_section_ptr
;
5804 /* Create an absolute symbol with the given name with the value of the
5805 address of the first byte after the end of the section named.
5807 If the symbol already exists, then do nothing. */
5810 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
5812 struct bfd_link_hash_entry
*h
;
5814 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5816 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5818 if (h
->type
== bfd_link_hash_new
5819 || h
->type
== bfd_link_hash_undefined
)
5823 h
->type
= bfd_link_hash_defined
;
5825 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5829 h
->u
.def
.value
= (bfd_get_section_vma (output_bfd
, sec
)
5830 + TO_ADDR (sec
->size
));
5832 h
->u
.def
.section
= bfd_abs_section_ptr
;
5837 lang_statement_append (lang_statement_list_type
*list
,
5838 lang_statement_union_type
*element
,
5839 lang_statement_union_type
**field
)
5841 *(list
->tail
) = element
;
5845 /* Set the output format type. -oformat overrides scripts. */
5848 lang_add_output_format (const char *format
,
5853 if (output_target
== NULL
|| !from_script
)
5855 if (command_line
.endian
== ENDIAN_BIG
5858 else if (command_line
.endian
== ENDIAN_LITTLE
5862 output_target
= format
;
5866 /* Enter a group. This creates a new lang_group_statement, and sets
5867 stat_ptr to build new statements within the group. */
5870 lang_enter_group (void)
5872 lang_group_statement_type
*g
;
5874 g
= new_stat (lang_group_statement
, stat_ptr
);
5875 lang_list_init (&g
->children
);
5876 stat_ptr
= &g
->children
;
5879 /* Leave a group. This just resets stat_ptr to start writing to the
5880 regular list of statements again. Note that this will not work if
5881 groups can occur inside anything else which can adjust stat_ptr,
5882 but currently they can't. */
5885 lang_leave_group (void)
5887 stat_ptr
= &statement_list
;
5890 /* Add a new program header. This is called for each entry in a PHDRS
5891 command in a linker script. */
5894 lang_new_phdr (const char *name
,
5896 bfd_boolean filehdr
,
5901 struct lang_phdr
*n
, **pp
;
5903 n
= stat_alloc (sizeof (struct lang_phdr
));
5906 n
->type
= exp_get_value_int (type
, 0, "program header type");
5907 n
->filehdr
= filehdr
;
5912 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
5917 /* Record the program header information in the output BFD. FIXME: We
5918 should not be calling an ELF specific function here. */
5921 lang_record_phdrs (void)
5925 lang_output_section_phdr_list
*last
;
5926 struct lang_phdr
*l
;
5927 lang_output_section_statement_type
*os
;
5930 secs
= xmalloc (alc
* sizeof (asection
*));
5932 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
5939 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5943 lang_output_section_phdr_list
*pl
;
5945 if (os
->constraint
== -1)
5953 if (os
->sectype
== noload_section
5954 || os
->bfd_section
== NULL
5955 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
5960 if (os
->bfd_section
== NULL
)
5963 for (; pl
!= NULL
; pl
= pl
->next
)
5965 if (strcmp (pl
->name
, l
->name
) == 0)
5970 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
5972 secs
[c
] = os
->bfd_section
;
5979 if (l
->flags
== NULL
)
5982 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
5987 at
= exp_get_vma (l
->at
, 0, "phdr load address");
5989 if (! bfd_record_phdr (output_bfd
, l
->type
,
5990 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
5991 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
5992 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
5997 /* Make sure all the phdr assignments succeeded. */
5998 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6002 lang_output_section_phdr_list
*pl
;
6004 if (os
->constraint
== -1
6005 || os
->bfd_section
== NULL
)
6008 for (pl
= os
->phdrs
;
6011 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6012 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6013 os
->name
, pl
->name
);
6017 /* Record a list of sections which may not be cross referenced. */
6020 lang_add_nocrossref (lang_nocrossref_type
*l
)
6022 struct lang_nocrossrefs
*n
;
6024 n
= xmalloc (sizeof *n
);
6025 n
->next
= nocrossref_list
;
6027 nocrossref_list
= n
;
6029 /* Set notice_all so that we get informed about all symbols. */
6030 link_info
.notice_all
= TRUE
;
6033 /* Overlay handling. We handle overlays with some static variables. */
6035 /* The overlay virtual address. */
6036 static etree_type
*overlay_vma
;
6037 /* And subsection alignment. */
6038 static etree_type
*overlay_subalign
;
6040 /* An expression for the maximum section size seen so far. */
6041 static etree_type
*overlay_max
;
6043 /* A list of all the sections in this overlay. */
6045 struct overlay_list
{
6046 struct overlay_list
*next
;
6047 lang_output_section_statement_type
*os
;
6050 static struct overlay_list
*overlay_list
;
6052 /* Start handling an overlay. */
6055 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6057 /* The grammar should prevent nested overlays from occurring. */
6058 ASSERT (overlay_vma
== NULL
6059 && overlay_subalign
== NULL
6060 && overlay_max
== NULL
);
6062 overlay_vma
= vma_expr
;
6063 overlay_subalign
= subalign
;
6066 /* Start a section in an overlay. We handle this by calling
6067 lang_enter_output_section_statement with the correct VMA.
6068 lang_leave_overlay sets up the LMA and memory regions. */
6071 lang_enter_overlay_section (const char *name
)
6073 struct overlay_list
*n
;
6076 lang_enter_output_section_statement (name
, overlay_vma
, normal_section
,
6077 0, overlay_subalign
, 0, 0);
6079 /* If this is the first section, then base the VMA of future
6080 sections on this one. This will work correctly even if `.' is
6081 used in the addresses. */
6082 if (overlay_list
== NULL
)
6083 overlay_vma
= exp_nameop (ADDR
, name
);
6085 /* Remember the section. */
6086 n
= xmalloc (sizeof *n
);
6087 n
->os
= current_section
;
6088 n
->next
= overlay_list
;
6091 size
= exp_nameop (SIZEOF
, name
);
6093 /* Arrange to work out the maximum section end address. */
6094 if (overlay_max
== NULL
)
6097 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6100 /* Finish a section in an overlay. There isn't any special to do
6104 lang_leave_overlay_section (fill_type
*fill
,
6105 lang_output_section_phdr_list
*phdrs
)
6112 name
= current_section
->name
;
6114 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6115 region and that no load-time region has been specified. It doesn't
6116 really matter what we say here, since lang_leave_overlay will
6118 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6120 /* Define the magic symbols. */
6122 clean
= xmalloc (strlen (name
) + 1);
6124 for (s1
= name
; *s1
!= '\0'; s1
++)
6125 if (ISALNUM (*s1
) || *s1
== '_')
6129 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6130 sprintf (buf
, "__load_start_%s", clean
);
6131 lang_add_assignment (exp_assop ('=', buf
,
6132 exp_nameop (LOADADDR
, name
)));
6134 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6135 sprintf (buf
, "__load_stop_%s", clean
);
6136 lang_add_assignment (exp_assop ('=', buf
,
6138 exp_nameop (LOADADDR
, name
),
6139 exp_nameop (SIZEOF
, name
))));
6144 /* Finish an overlay. If there are any overlay wide settings, this
6145 looks through all the sections in the overlay and sets them. */
6148 lang_leave_overlay (etree_type
*lma_expr
,
6151 const char *memspec
,
6152 lang_output_section_phdr_list
*phdrs
,
6153 const char *lma_memspec
)
6155 lang_memory_region_type
*region
;
6156 lang_memory_region_type
*lma_region
;
6157 struct overlay_list
*l
;
6158 lang_nocrossref_type
*nocrossref
;
6160 lang_get_regions (®ion
, &lma_region
,
6161 memspec
, lma_memspec
,
6162 lma_expr
!= NULL
, FALSE
);
6166 /* After setting the size of the last section, set '.' to end of the
6168 if (overlay_list
!= NULL
)
6169 overlay_list
->os
->update_dot_tree
6170 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6175 struct overlay_list
*next
;
6177 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6180 l
->os
->region
= region
;
6181 l
->os
->lma_region
= lma_region
;
6183 /* The first section has the load address specified in the
6184 OVERLAY statement. The rest are worked out from that.
6185 The base address is not needed (and should be null) if
6186 an LMA region was specified. */
6188 l
->os
->load_base
= lma_expr
;
6189 else if (lma_region
== 0)
6190 l
->os
->load_base
= exp_binop ('+',
6191 exp_nameop (LOADADDR
, l
->next
->os
->name
),
6192 exp_nameop (SIZEOF
, l
->next
->os
->name
));
6194 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6195 l
->os
->phdrs
= phdrs
;
6199 lang_nocrossref_type
*nc
;
6201 nc
= xmalloc (sizeof *nc
);
6202 nc
->name
= l
->os
->name
;
6203 nc
->next
= nocrossref
;
6212 if (nocrossref
!= NULL
)
6213 lang_add_nocrossref (nocrossref
);
6216 overlay_list
= NULL
;
6220 /* Version handling. This is only useful for ELF. */
6222 /* This global variable holds the version tree that we build. */
6224 struct bfd_elf_version_tree
*lang_elf_version_info
;
6226 /* If PREV is NULL, return first version pattern matching particular symbol.
6227 If PREV is non-NULL, return first version pattern matching particular
6228 symbol after PREV (previously returned by lang_vers_match). */
6230 static struct bfd_elf_version_expr
*
6231 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6232 struct bfd_elf_version_expr
*prev
,
6235 const char *cxx_sym
= sym
;
6236 const char *java_sym
= sym
;
6237 struct bfd_elf_version_expr
*expr
= NULL
;
6239 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6241 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6245 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6247 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6252 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6254 struct bfd_elf_version_expr e
;
6256 switch (prev
? prev
->mask
: 0)
6259 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6262 expr
= htab_find (head
->htab
, &e
);
6263 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6264 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6270 case BFD_ELF_VERSION_C_TYPE
:
6271 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6274 expr
= htab_find (head
->htab
, &e
);
6275 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6276 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6282 case BFD_ELF_VERSION_CXX_TYPE
:
6283 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6285 e
.symbol
= java_sym
;
6286 expr
= htab_find (head
->htab
, &e
);
6287 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6288 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6299 /* Finally, try the wildcards. */
6300 if (prev
== NULL
|| prev
->symbol
)
6301 expr
= head
->remaining
;
6304 for (; expr
; expr
= expr
->next
)
6311 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6314 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6316 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6320 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6326 free ((char *) cxx_sym
);
6327 if (java_sym
!= sym
)
6328 free ((char *) java_sym
);
6332 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6333 return a string pointing to the symbol name. */
6336 realsymbol (const char *pattern
)
6339 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6340 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6342 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6344 /* It is a glob pattern only if there is no preceding
6346 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6354 /* Remove the preceding backslash. */
6361 backslash
= *p
== '\\';
6376 /* This is called for each variable name or match expression. NEW is
6377 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
6378 pattern to be matched against symbol names. */
6380 struct bfd_elf_version_expr
*
6381 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
6384 bfd_boolean literal_p
)
6386 struct bfd_elf_version_expr
*ret
;
6388 ret
= xmalloc (sizeof *ret
);
6390 ret
->pattern
= literal_p
? NULL
: new;
6393 ret
->symbol
= literal_p
? new : realsymbol (new);
6395 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
6396 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6397 else if (strcasecmp (lang
, "C++") == 0)
6398 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
6399 else if (strcasecmp (lang
, "Java") == 0)
6400 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
6403 einfo (_("%X%P: unknown language `%s' in version information\n"),
6405 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6408 return ldemul_new_vers_pattern (ret
);
6411 /* This is called for each set of variable names and match
6414 struct bfd_elf_version_tree
*
6415 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
6416 struct bfd_elf_version_expr
*locals
)
6418 struct bfd_elf_version_tree
*ret
;
6420 ret
= xcalloc (1, sizeof *ret
);
6421 ret
->globals
.list
= globals
;
6422 ret
->locals
.list
= locals
;
6423 ret
->match
= lang_vers_match
;
6424 ret
->name_indx
= (unsigned int) -1;
6428 /* This static variable keeps track of version indices. */
6430 static int version_index
;
6433 version_expr_head_hash (const void *p
)
6435 const struct bfd_elf_version_expr
*e
= p
;
6437 return htab_hash_string (e
->symbol
);
6441 version_expr_head_eq (const void *p1
, const void *p2
)
6443 const struct bfd_elf_version_expr
*e1
= p1
;
6444 const struct bfd_elf_version_expr
*e2
= p2
;
6446 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
6450 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
6453 struct bfd_elf_version_expr
*e
, *next
;
6454 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
6456 for (e
= head
->list
; e
; e
= e
->next
)
6460 head
->mask
|= e
->mask
;
6465 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
6466 version_expr_head_eq
, NULL
);
6467 list_loc
= &head
->list
;
6468 remaining_loc
= &head
->remaining
;
6469 for (e
= head
->list
; e
; e
= next
)
6475 remaining_loc
= &e
->next
;
6479 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
6483 struct bfd_elf_version_expr
*e1
, *last
;
6489 if (e1
->mask
== e
->mask
)
6497 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
6501 /* This is a duplicate. */
6502 /* FIXME: Memory leak. Sometimes pattern is not
6503 xmalloced alone, but in larger chunk of memory. */
6504 /* free (e->symbol); */
6509 e
->next
= last
->next
;
6517 list_loc
= &e
->next
;
6521 *remaining_loc
= NULL
;
6522 *list_loc
= head
->remaining
;
6525 head
->remaining
= head
->list
;
6528 /* This is called when we know the name and dependencies of the
6532 lang_register_vers_node (const char *name
,
6533 struct bfd_elf_version_tree
*version
,
6534 struct bfd_elf_version_deps
*deps
)
6536 struct bfd_elf_version_tree
*t
, **pp
;
6537 struct bfd_elf_version_expr
*e1
;
6542 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
6543 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
6545 einfo (_("%X%P: anonymous version tag cannot be combined"
6546 " with other version tags\n"));
6551 /* Make sure this node has a unique name. */
6552 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6553 if (strcmp (t
->name
, name
) == 0)
6554 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
6556 lang_finalize_version_expr_head (&version
->globals
);
6557 lang_finalize_version_expr_head (&version
->locals
);
6559 /* Check the global and local match names, and make sure there
6560 aren't any duplicates. */
6562 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
6564 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6566 struct bfd_elf_version_expr
*e2
;
6568 if (t
->locals
.htab
&& e1
->symbol
)
6570 e2
= htab_find (t
->locals
.htab
, e1
);
6571 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6573 if (e1
->mask
== e2
->mask
)
6574 einfo (_("%X%P: duplicate expression `%s'"
6575 " in version information\n"), e1
->symbol
);
6579 else if (!e1
->symbol
)
6580 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6581 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6582 && e1
->mask
== e2
->mask
)
6583 einfo (_("%X%P: duplicate expression `%s'"
6584 " in version information\n"), e1
->pattern
);
6588 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
6590 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6592 struct bfd_elf_version_expr
*e2
;
6594 if (t
->globals
.htab
&& e1
->symbol
)
6596 e2
= htab_find (t
->globals
.htab
, e1
);
6597 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6599 if (e1
->mask
== e2
->mask
)
6600 einfo (_("%X%P: duplicate expression `%s'"
6601 " in version information\n"),
6606 else if (!e1
->symbol
)
6607 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6608 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6609 && e1
->mask
== e2
->mask
)
6610 einfo (_("%X%P: duplicate expression `%s'"
6611 " in version information\n"), e1
->pattern
);
6615 version
->deps
= deps
;
6616 version
->name
= name
;
6617 if (name
[0] != '\0')
6620 version
->vernum
= version_index
;
6623 version
->vernum
= 0;
6625 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6630 /* This is called when we see a version dependency. */
6632 struct bfd_elf_version_deps
*
6633 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
6635 struct bfd_elf_version_deps
*ret
;
6636 struct bfd_elf_version_tree
*t
;
6638 ret
= xmalloc (sizeof *ret
);
6641 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6643 if (strcmp (t
->name
, name
) == 0)
6645 ret
->version_needed
= t
;
6650 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
6656 lang_do_version_exports_section (void)
6658 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
6660 LANG_FOR_EACH_INPUT_STATEMENT (is
)
6662 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
6670 contents
= xmalloc (len
);
6671 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
6672 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
6675 while (p
< contents
+ len
)
6677 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
6678 p
= strchr (p
, '\0') + 1;
6681 /* Do not free the contents, as we used them creating the regex. */
6683 /* Do not include this section in the link. */
6684 sec
->flags
|= SEC_EXCLUDE
;
6687 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
6688 lang_register_vers_node (command_line
.version_exports_section
,
6689 lang_new_vers_node (greg
, lreg
), NULL
);
6693 lang_add_unique (const char *name
)
6695 struct unique_sections
*ent
;
6697 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
6698 if (strcmp (ent
->name
, name
) == 0)
6701 ent
= xmalloc (sizeof *ent
);
6702 ent
->name
= xstrdup (name
);
6703 ent
->next
= unique_section_list
;
6704 unique_section_list
= ent
;