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
.type
= lang_input_statement_enum
;
787 p
->header
.next
= NULL
;
790 lang_has_input_file
= TRUE
;
792 p
->sysrooted
= FALSE
;
795 case lang_input_file_is_symbols_only_enum
:
797 p
->is_archive
= FALSE
;
799 p
->local_sym_name
= name
;
800 p
->just_syms_flag
= TRUE
;
801 p
->search_dirs_flag
= FALSE
;
803 case lang_input_file_is_fake_enum
:
805 p
->is_archive
= FALSE
;
807 p
->local_sym_name
= name
;
808 p
->just_syms_flag
= FALSE
;
809 p
->search_dirs_flag
= FALSE
;
811 case lang_input_file_is_l_enum
:
812 p
->is_archive
= TRUE
;
815 p
->local_sym_name
= concat ("-l", name
, NULL
);
816 p
->just_syms_flag
= FALSE
;
817 p
->search_dirs_flag
= TRUE
;
819 case lang_input_file_is_marker_enum
:
821 p
->is_archive
= FALSE
;
823 p
->local_sym_name
= name
;
824 p
->just_syms_flag
= FALSE
;
825 p
->search_dirs_flag
= TRUE
;
827 case lang_input_file_is_search_file_enum
:
828 p
->sysrooted
= ldlang_sysrooted_script
;
830 p
->is_archive
= FALSE
;
832 p
->local_sym_name
= name
;
833 p
->just_syms_flag
= FALSE
;
834 p
->search_dirs_flag
= TRUE
;
836 case lang_input_file_is_file_enum
:
838 p
->is_archive
= FALSE
;
840 p
->local_sym_name
= name
;
841 p
->just_syms_flag
= FALSE
;
842 p
->search_dirs_flag
= FALSE
;
849 p
->next_real_file
= NULL
;
852 p
->dynamic
= config
.dynamic_link
;
853 p
->add_needed
= add_needed
;
854 p
->as_needed
= as_needed
;
855 p
->whole_archive
= whole_archive
;
857 lang_statement_append (&input_file_chain
,
858 (lang_statement_union_type
*) p
,
863 lang_input_statement_type
*
864 lang_add_input_file (const char *name
,
865 lang_input_file_enum_type file_type
,
868 lang_has_input_file
= TRUE
;
869 return new_afile (name
, file_type
, target
, TRUE
);
872 struct output_statement_hash_entry
874 struct bfd_hash_entry root
;
875 lang_output_section_statement_type os
;
878 /* The hash table. */
880 static struct bfd_hash_table output_statement_table
;
882 /* Support routines for the hash table used by lang_output_section_find,
883 initialize the table, fill in an entry and remove the table. */
885 static struct bfd_hash_entry
*
886 output_statement_newfunc (struct bfd_hash_entry
*entry
,
887 struct bfd_hash_table
*table
,
890 lang_output_section_statement_type
**nextp
;
891 struct output_statement_hash_entry
*ret
;
895 entry
= bfd_hash_allocate (table
, sizeof (*ret
));
900 entry
= bfd_hash_newfunc (entry
, table
, string
);
904 ret
= (struct output_statement_hash_entry
*) entry
;
905 memset (&ret
->os
, 0, sizeof (ret
->os
));
906 ret
->os
.header
.type
= lang_output_section_statement_enum
;
907 ret
->os
.subsection_alignment
= -1;
908 ret
->os
.section_alignment
= -1;
909 ret
->os
.block_value
= 1;
910 lang_list_init (&ret
->os
.children
);
911 lang_statement_append (stat_ptr
,
912 (lang_statement_union_type
*) &ret
->os
,
913 &ret
->os
.header
.next
);
915 ret
->os
.prev
= &((*lang_output_section_statement
.tail
)
916 ->output_section_statement
);
917 /* GCC's strict aliasing rules prevent us from just casting the
918 address, so we store the pointer in a variable and cast that
920 nextp
= &ret
->os
.next
;
921 lang_statement_append (&lang_output_section_statement
,
922 (lang_statement_union_type
*) &ret
->os
,
923 (lang_statement_union_type
**) nextp
);
928 output_statement_table_init (void)
930 if (! bfd_hash_table_init_n (&output_statement_table
,
931 output_statement_newfunc
, 61))
932 einfo (_("%P%F: can not create hash table: %E\n"));
936 output_statement_table_free (void)
938 bfd_hash_table_free (&output_statement_table
);
941 /* Build enough state so that the parser can build its tree. */
946 obstack_begin (&stat_obstack
, 1000);
948 stat_ptr
= &statement_list
;
950 output_statement_table_init ();
952 lang_list_init (stat_ptr
);
954 lang_list_init (&input_file_chain
);
955 lang_list_init (&lang_output_section_statement
);
956 lang_list_init (&file_chain
);
957 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
960 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
962 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
964 /* The value "3" is ad-hoc, somewhat related to the expected number of
965 DEFINED expressions in a linker script. For most default linker
966 scripts, there are none. Why a hash table then? Well, it's somewhat
967 simpler to re-use working machinery than using a linked list in terms
968 of code-complexity here in ld, besides the initialization which just
969 looks like other code here. */
970 if (!bfd_hash_table_init_n (&lang_definedness_table
,
971 lang_definedness_newfunc
, 3))
972 einfo (_("%P%F: can not create hash table: %E\n"));
978 output_statement_table_free ();
981 /*----------------------------------------------------------------------
982 A region is an area of memory declared with the
983 MEMORY { name:org=exp, len=exp ... }
986 We maintain a list of all the regions here.
988 If no regions are specified in the script, then the default is used
989 which is created when looked up to be the entire data space.
991 If create is true we are creating a region inside a MEMORY block.
992 In this case it is probably an error to create a region that has
993 already been created. If we are not inside a MEMORY block it is
994 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
995 and so we issue a warning. */
997 static lang_memory_region_type
*lang_memory_region_list
;
998 static lang_memory_region_type
**lang_memory_region_list_tail
999 = &lang_memory_region_list
;
1001 lang_memory_region_type
*
1002 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1004 lang_memory_region_type
*p
;
1005 lang_memory_region_type
*new;
1007 /* NAME is NULL for LMA memspecs if no region was specified. */
1011 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1012 if (strcmp (p
->name
, name
) == 0)
1015 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1020 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1021 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
1023 new = stat_alloc (sizeof (lang_memory_region_type
));
1025 new->name
= xstrdup (name
);
1028 *lang_memory_region_list_tail
= new;
1029 lang_memory_region_list_tail
= &new->next
;
1033 new->length
= ~(bfd_size_type
) 0;
1035 new->had_full_message
= FALSE
;
1040 static lang_memory_region_type
*
1041 lang_memory_default (asection
*section
)
1043 lang_memory_region_type
*p
;
1045 flagword sec_flags
= section
->flags
;
1047 /* Override SEC_DATA to mean a writable section. */
1048 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1049 sec_flags
|= SEC_DATA
;
1051 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1053 if ((p
->flags
& sec_flags
) != 0
1054 && (p
->not_flags
& sec_flags
) == 0)
1059 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1062 lang_output_section_statement_type
*
1063 lang_output_section_find (const char *const name
)
1065 struct output_statement_hash_entry
*entry
;
1068 entry
= ((struct output_statement_hash_entry
*)
1069 bfd_hash_lookup (&output_statement_table
, name
, FALSE
, FALSE
));
1073 hash
= entry
->root
.hash
;
1076 if (entry
->os
.constraint
!= -1)
1078 entry
= (struct output_statement_hash_entry
*) entry
->root
.next
;
1080 while (entry
!= NULL
1081 && entry
->root
.hash
== hash
1082 && strcmp (name
, entry
->os
.name
) == 0);
1087 static lang_output_section_statement_type
*
1088 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1090 struct output_statement_hash_entry
*entry
;
1091 struct output_statement_hash_entry
*last_ent
;
1094 entry
= ((struct output_statement_hash_entry
*)
1095 bfd_hash_lookup (&output_statement_table
, name
, TRUE
, FALSE
));
1098 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1102 if (entry
->os
.name
!= NULL
)
1104 /* We have a section of this name, but it might not have the correct
1106 hash
= entry
->root
.hash
;
1109 if (entry
->os
.constraint
!= -1
1111 || (constraint
== entry
->os
.constraint
1112 && constraint
!= SPECIAL
)))
1115 entry
= (struct output_statement_hash_entry
*) entry
->root
.next
;
1117 while (entry
!= NULL
1118 && entry
->root
.hash
== hash
1119 && strcmp (name
, entry
->os
.name
) == 0);
1121 entry
= ((struct output_statement_hash_entry
*)
1122 output_statement_newfunc (NULL
, &output_statement_table
, name
));
1125 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1128 entry
->root
= last_ent
->root
;
1129 last_ent
->root
.next
= &entry
->root
;
1132 entry
->os
.name
= name
;
1133 entry
->os
.constraint
= constraint
;
1137 lang_output_section_statement_type
*
1138 lang_output_section_statement_lookup (const char *const name
)
1140 return lang_output_section_statement_lookup_1 (name
, 0);
1143 /* A variant of lang_output_section_find used by place_orphan.
1144 Returns the output statement that should precede a new output
1145 statement for SEC. If an exact match is found on certain flags,
1148 lang_output_section_statement_type
*
1149 lang_output_section_find_by_flags (const asection
*sec
,
1150 lang_output_section_statement_type
**exact
)
1152 lang_output_section_statement_type
*first
, *look
, *found
;
1155 /* We know the first statement on this list is *ABS*. May as well
1157 first
= &lang_output_section_statement
.head
->output_section_statement
;
1158 first
= first
->next
;
1160 /* First try for an exact match. */
1162 for (look
= first
; look
; look
= look
->next
)
1164 flags
= look
->flags
;
1165 if (look
->bfd_section
!= NULL
)
1167 flags
= look
->bfd_section
->flags
;
1168 if (!bfd_match_sections_by_type (output_bfd
,
1173 flags
^= sec
->flags
;
1174 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1175 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1184 if (sec
->flags
& SEC_CODE
)
1186 /* Try for a rw code section. */
1187 for (look
= first
; look
; look
= look
->next
)
1189 flags
= look
->flags
;
1190 if (look
->bfd_section
!= NULL
)
1192 flags
= look
->bfd_section
->flags
;
1193 if (!bfd_match_sections_by_type (output_bfd
,
1198 flags
^= sec
->flags
;
1199 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1200 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1206 if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1208 /* .rodata can go after .text, .sdata2 after .rodata. */
1209 for (look
= first
; look
; look
= look
->next
)
1211 flags
= look
->flags
;
1212 if (look
->bfd_section
!= NULL
)
1214 flags
= look
->bfd_section
->flags
;
1215 if (!bfd_match_sections_by_type (output_bfd
,
1220 flags
^= sec
->flags
;
1221 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1223 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1229 if (sec
->flags
& SEC_SMALL_DATA
)
1231 /* .sdata goes after .data, .sbss after .sdata. */
1232 for (look
= first
; look
; look
= look
->next
)
1234 flags
= look
->flags
;
1235 if (look
->bfd_section
!= NULL
)
1237 flags
= look
->bfd_section
->flags
;
1238 if (!bfd_match_sections_by_type (output_bfd
,
1243 flags
^= sec
->flags
;
1244 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1245 | SEC_THREAD_LOCAL
))
1246 || ((look
->flags
& SEC_SMALL_DATA
)
1247 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1253 if (sec
->flags
& SEC_HAS_CONTENTS
)
1255 /* .data goes after .rodata. */
1256 for (look
= first
; look
; look
= look
->next
)
1258 flags
= look
->flags
;
1259 if (look
->bfd_section
!= NULL
)
1261 flags
= look
->bfd_section
->flags
;
1262 if (!bfd_match_sections_by_type (output_bfd
,
1267 flags
^= sec
->flags
;
1268 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1269 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1275 /* .bss goes last. */
1276 for (look
= first
; look
; look
= look
->next
)
1278 flags
= look
->flags
;
1279 if (look
->bfd_section
!= NULL
)
1281 flags
= look
->bfd_section
->flags
;
1282 if (!bfd_match_sections_by_type (output_bfd
,
1287 flags
^= sec
->flags
;
1288 if (!(flags
& SEC_ALLOC
))
1295 /* Find the last output section before given output statement.
1296 Used by place_orphan. */
1299 output_prev_sec_find (lang_output_section_statement_type
*os
)
1301 lang_output_section_statement_type
*lookup
;
1303 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1305 if (lookup
->constraint
== -1)
1308 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1309 return lookup
->bfd_section
;
1315 lang_output_section_statement_type
*
1316 lang_insert_orphan (asection
*s
,
1317 const char *secname
,
1318 lang_output_section_statement_type
*after
,
1319 struct orphan_save
*place
,
1320 etree_type
*address
,
1321 lang_statement_list_type
*add_child
)
1323 lang_statement_list_type
*old
;
1324 lang_statement_list_type add
;
1326 etree_type
*load_base
;
1327 lang_output_section_statement_type
*os
;
1328 lang_output_section_statement_type
**os_tail
;
1330 /* Start building a list of statements for this section.
1331 First save the current statement pointer. */
1334 /* If we have found an appropriate place for the output section
1335 statements for this orphan, add them to our own private list,
1336 inserting them later into the global statement list. */
1340 lang_list_init (stat_ptr
);
1344 if (config
.build_constructors
)
1346 /* If the name of the section is representable in C, then create
1347 symbols to mark the start and the end of the section. */
1348 for (ps
= secname
; *ps
!= '\0'; ps
++)
1349 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1354 etree_type
*e_align
;
1356 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1357 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1358 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1359 e_align
= exp_unop (ALIGN_K
,
1360 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1361 lang_add_assignment (exp_assop ('=', ".", e_align
));
1362 lang_add_assignment (exp_assop ('=', symname
,
1363 exp_nameop (NAME
, ".")));
1367 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1368 address
= exp_intop (0);
1371 if (after
!= NULL
&& after
->load_base
!= NULL
)
1373 etree_type
*lma_from_vma
;
1374 lma_from_vma
= exp_binop ('-', after
->load_base
,
1375 exp_nameop (ADDR
, after
->name
));
1376 load_base
= exp_binop ('+', lma_from_vma
,
1377 exp_nameop (ADDR
, secname
));
1380 os_tail
= ((lang_output_section_statement_type
**)
1381 lang_output_section_statement
.tail
);
1382 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1385 if (add_child
== NULL
)
1386 add_child
= &os
->children
;
1387 lang_add_section (add_child
, s
, os
);
1389 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1391 if (config
.build_constructors
&& *ps
== '\0')
1395 /* lang_leave_ouput_section_statement resets stat_ptr.
1396 Put stat_ptr back where we want it. */
1400 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1401 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1402 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1403 lang_add_assignment (exp_assop ('=', symname
,
1404 exp_nameop (NAME
, ".")));
1407 /* Restore the global list pointer. */
1411 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1413 asection
*snew
, *as
;
1415 snew
= os
->bfd_section
;
1417 /* Shuffle the bfd section list to make the output file look
1418 neater. This is really only cosmetic. */
1419 if (place
->section
== NULL
1420 && after
!= (&lang_output_section_statement
.head
1421 ->output_section_statement
))
1423 asection
*bfd_section
= after
->bfd_section
;
1425 /* If the output statement hasn't been used to place any input
1426 sections (and thus doesn't have an output bfd_section),
1427 look for the closest prior output statement having an
1429 if (bfd_section
== NULL
)
1430 bfd_section
= output_prev_sec_find (after
);
1432 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1433 place
->section
= &bfd_section
->next
;
1436 if (place
->section
== NULL
)
1437 place
->section
= &output_bfd
->sections
;
1439 as
= *place
->section
;
1440 if (as
!= snew
&& as
->prev
!= snew
)
1442 /* Unlink the section. */
1443 bfd_section_list_remove (output_bfd
, snew
);
1445 /* Now tack it back on in the right place. */
1446 bfd_section_list_insert_before (output_bfd
, as
, snew
);
1449 /* Save the end of this list. Further ophans of this type will
1450 follow the one we've just added. */
1451 place
->section
= &snew
->next
;
1453 /* The following is non-cosmetic. We try to put the output
1454 statements in some sort of reasonable order here, because they
1455 determine the final load addresses of the orphan sections.
1456 In addition, placing output statements in the wrong order may
1457 require extra segments. For instance, given a typical
1458 situation of all read-only sections placed in one segment and
1459 following that a segment containing all the read-write
1460 sections, we wouldn't want to place an orphan read/write
1461 section before or amongst the read-only ones. */
1462 if (add
.head
!= NULL
)
1464 lang_output_section_statement_type
*newly_added_os
;
1466 if (place
->stmt
== NULL
)
1468 lang_statement_union_type
**where
;
1469 lang_statement_union_type
**assign
= NULL
;
1470 bfd_boolean ignore_first
;
1472 /* Look for a suitable place for the new statement list.
1473 The idea is to skip over anything that might be inside
1474 a SECTIONS {} statement in a script, before we find
1475 another output_section_statement. Assignments to "dot"
1476 before an output section statement are assumed to
1477 belong to it. An exception to this rule is made for
1478 the first assignment to dot, otherwise we might put an
1479 orphan before . = . + SIZEOF_HEADERS or similar
1480 assignments that set the initial address. */
1482 ignore_first
= after
== (&lang_output_section_statement
.head
1483 ->output_section_statement
);
1484 for (where
= &after
->header
.next
;
1486 where
= &(*where
)->header
.next
)
1488 switch ((*where
)->header
.type
)
1490 case lang_assignment_statement_enum
:
1493 lang_assignment_statement_type
*ass
;
1494 ass
= &(*where
)->assignment_statement
;
1495 if (ass
->exp
->type
.node_class
!= etree_assert
1496 && ass
->exp
->assign
.dst
[0] == '.'
1497 && ass
->exp
->assign
.dst
[1] == 0
1501 ignore_first
= FALSE
;
1503 case lang_wild_statement_enum
:
1504 case lang_input_section_enum
:
1505 case lang_object_symbols_statement_enum
:
1506 case lang_fill_statement_enum
:
1507 case lang_data_statement_enum
:
1508 case lang_reloc_statement_enum
:
1509 case lang_padding_statement_enum
:
1510 case lang_constructors_statement_enum
:
1513 case lang_output_section_statement_enum
:
1516 case lang_input_statement_enum
:
1517 case lang_address_statement_enum
:
1518 case lang_target_statement_enum
:
1519 case lang_output_statement_enum
:
1520 case lang_group_statement_enum
:
1521 case lang_afile_asection_pair_statement_enum
:
1530 place
->os_tail
= &after
->next
;
1534 /* Put it after the last orphan statement we added. */
1535 *add
.tail
= *place
->stmt
;
1536 *place
->stmt
= add
.head
;
1539 /* Fix the global list pointer if we happened to tack our
1540 new list at the tail. */
1541 if (*old
->tail
== add
.head
)
1542 old
->tail
= add
.tail
;
1544 /* Save the end of this list. */
1545 place
->stmt
= add
.tail
;
1547 /* Do the same for the list of output section statements. */
1548 newly_added_os
= *os_tail
;
1550 newly_added_os
->next
= *place
->os_tail
;
1551 *place
->os_tail
= newly_added_os
;
1552 place
->os_tail
= &newly_added_os
->next
;
1554 /* Fixing the global list pointer here is a little different.
1555 We added to the list in lang_enter_output_section_statement,
1556 trimmed off the new output_section_statment above when
1557 assigning *os_tail = NULL, but possibly added it back in
1558 the same place when assigning *place->os_tail. */
1559 if (*os_tail
== NULL
)
1560 lang_output_section_statement
.tail
1561 = (lang_statement_union_type
**) os_tail
;
1568 lang_map_flags (flagword flag
)
1570 if (flag
& SEC_ALLOC
)
1573 if (flag
& SEC_CODE
)
1576 if (flag
& SEC_READONLY
)
1579 if (flag
& SEC_DATA
)
1582 if (flag
& SEC_LOAD
)
1589 lang_memory_region_type
*m
;
1592 minfo (_("\nMemory Configuration\n\n"));
1593 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1594 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1596 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1601 fprintf (config
.map_file
, "%-16s ", m
->name
);
1603 sprintf_vma (buf
, m
->origin
);
1604 minfo ("0x%s ", buf
);
1612 minfo ("0x%V", m
->length
);
1613 if (m
->flags
|| m
->not_flags
)
1621 lang_map_flags (m
->flags
);
1627 lang_map_flags (m
->not_flags
);
1634 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1636 if (! command_line
.reduce_memory_overheads
)
1638 obstack_begin (&map_obstack
, 1000);
1639 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1640 bfd_map_over_sections (p
, init_map_userdata
, 0);
1641 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1643 print_statements ();
1647 init_map_userdata (abfd
, sec
, data
)
1648 bfd
*abfd ATTRIBUTE_UNUSED
;
1650 void *data ATTRIBUTE_UNUSED
;
1652 fat_section_userdata_type
*new_data
1653 = ((fat_section_userdata_type
*) (stat_alloc
1654 (sizeof (fat_section_userdata_type
))));
1656 ASSERT (get_userdata (sec
) == NULL
);
1657 get_userdata (sec
) = new_data
;
1658 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1662 sort_def_symbol (hash_entry
, info
)
1663 struct bfd_link_hash_entry
*hash_entry
;
1664 void *info ATTRIBUTE_UNUSED
;
1666 if (hash_entry
->type
== bfd_link_hash_defined
1667 || hash_entry
->type
== bfd_link_hash_defweak
)
1669 struct fat_user_section_struct
*ud
;
1670 struct map_symbol_def
*def
;
1672 ud
= get_userdata (hash_entry
->u
.def
.section
);
1675 /* ??? What do we have to do to initialize this beforehand? */
1676 /* The first time we get here is bfd_abs_section... */
1677 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1678 ud
= get_userdata (hash_entry
->u
.def
.section
);
1680 else if (!ud
->map_symbol_def_tail
)
1681 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1683 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1684 def
->entry
= hash_entry
;
1685 *(ud
->map_symbol_def_tail
) = def
;
1686 ud
->map_symbol_def_tail
= &def
->next
;
1691 /* Initialize an output section. */
1694 init_os (lang_output_section_statement_type
*s
, asection
*isec
)
1696 if (s
->bfd_section
!= NULL
)
1699 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1700 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1702 s
->bfd_section
= bfd_get_section_by_name (output_bfd
, s
->name
);
1703 if (s
->bfd_section
== NULL
)
1704 s
->bfd_section
= bfd_make_section (output_bfd
, s
->name
);
1705 if (s
->bfd_section
== NULL
)
1707 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1708 output_bfd
->xvec
->name
, s
->name
);
1710 s
->bfd_section
->output_section
= s
->bfd_section
;
1711 s
->bfd_section
->output_offset
= 0;
1712 if (!command_line
.reduce_memory_overheads
)
1714 fat_section_userdata_type
*new
1715 = stat_alloc (sizeof (fat_section_userdata_type
));
1716 memset (new, 0, sizeof (fat_section_userdata_type
));
1717 get_userdata (s
->bfd_section
) = new;
1721 /* If there is a base address, make sure that any sections it might
1722 mention are initialized. */
1723 if (s
->addr_tree
!= NULL
)
1724 exp_init_os (s
->addr_tree
);
1726 if (s
->load_base
!= NULL
)
1727 exp_init_os (s
->load_base
);
1729 /* If supplied an alignment, set it. */
1730 if (s
->section_alignment
!= -1)
1731 s
->bfd_section
->alignment_power
= s
->section_alignment
;
1734 bfd_init_private_section_data (isec
->owner
, isec
,
1735 output_bfd
, s
->bfd_section
,
1739 /* Make sure that all output sections mentioned in an expression are
1743 exp_init_os (etree_type
*exp
)
1745 switch (exp
->type
.node_class
)
1749 exp_init_os (exp
->assign
.src
);
1753 exp_init_os (exp
->binary
.lhs
);
1754 exp_init_os (exp
->binary
.rhs
);
1758 exp_init_os (exp
->trinary
.cond
);
1759 exp_init_os (exp
->trinary
.lhs
);
1760 exp_init_os (exp
->trinary
.rhs
);
1764 exp_init_os (exp
->assert_s
.child
);
1768 exp_init_os (exp
->unary
.child
);
1772 switch (exp
->type
.node_code
)
1778 lang_output_section_statement_type
*os
;
1780 os
= lang_output_section_find (exp
->name
.name
);
1781 if (os
!= NULL
&& os
->bfd_section
== NULL
)
1793 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
1795 lang_input_statement_type
*entry
= data
;
1797 /* If we are only reading symbols from this object, then we want to
1798 discard all sections. */
1799 if (entry
->just_syms_flag
)
1801 bfd_link_just_syms (abfd
, sec
, &link_info
);
1805 if (!(abfd
->flags
& DYNAMIC
))
1806 bfd_section_already_linked (abfd
, sec
);
1809 /* The wild routines.
1811 These expand statements like *(.text) and foo.o to a list of
1812 explicit actions, like foo.o(.text), bar.o(.text) and
1813 foo.o(.text, .data). */
1815 /* Add SECTION to the output section OUTPUT. Do this by creating a
1816 lang_input_section statement which is placed at PTR. FILE is the
1817 input file which holds SECTION. */
1820 lang_add_section (lang_statement_list_type
*ptr
,
1822 lang_output_section_statement_type
*output
)
1824 flagword flags
= section
->flags
;
1825 bfd_boolean discard
;
1827 /* Discard sections marked with SEC_EXCLUDE. */
1828 discard
= (flags
& SEC_EXCLUDE
) != 0;
1830 /* Discard input sections which are assigned to a section named
1831 DISCARD_SECTION_NAME. */
1832 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
1835 /* Discard debugging sections if we are stripping debugging
1837 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
1838 && (flags
& SEC_DEBUGGING
) != 0)
1843 if (section
->output_section
== NULL
)
1845 /* This prevents future calls from assigning this section. */
1846 section
->output_section
= bfd_abs_section_ptr
;
1851 if (section
->output_section
== NULL
)
1854 lang_input_section_type
*new;
1857 if (output
->bfd_section
== NULL
)
1858 init_os (output
, section
);
1860 first
= ! output
->bfd_section
->linker_has_input
;
1861 output
->bfd_section
->linker_has_input
= 1;
1863 if (!link_info
.relocatable
1864 && !stripped_excluded_sections
)
1866 asection
*s
= output
->bfd_section
->map_tail
.s
;
1867 output
->bfd_section
->map_tail
.s
= section
;
1868 section
->map_head
.s
= NULL
;
1869 section
->map_tail
.s
= s
;
1871 s
->map_head
.s
= section
;
1873 output
->bfd_section
->map_head
.s
= section
;
1876 /* Add a section reference to the list. */
1877 new = new_stat (lang_input_section
, ptr
);
1879 new->section
= section
;
1880 section
->output_section
= output
->bfd_section
;
1882 flags
= section
->flags
;
1884 /* We don't copy the SEC_NEVER_LOAD flag from an input section
1885 to an output section, because we want to be able to include a
1886 SEC_NEVER_LOAD section in the middle of an otherwise loaded
1887 section (I don't know why we want to do this, but we do).
1888 build_link_order in ldwrite.c handles this case by turning
1889 the embedded SEC_NEVER_LOAD section into a fill. */
1891 flags
&= ~ SEC_NEVER_LOAD
;
1893 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
1894 already been processed. One reason to do this is that on pe
1895 format targets, .text$foo sections go into .text and it's odd
1896 to see .text with SEC_LINK_ONCE set. */
1898 if (! link_info
.relocatable
)
1899 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
1901 /* If this is not the first input section, and the SEC_READONLY
1902 flag is not currently set, then don't set it just because the
1903 input section has it set. */
1905 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
1906 flags
&= ~ SEC_READONLY
;
1908 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
1910 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
1911 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
1912 || ((flags
& SEC_MERGE
)
1913 && output
->bfd_section
->entsize
!= section
->entsize
)))
1915 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1916 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1919 output
->bfd_section
->flags
|= flags
;
1921 if (flags
& SEC_MERGE
)
1922 output
->bfd_section
->entsize
= section
->entsize
;
1924 /* If SEC_READONLY is not set in the input section, then clear
1925 it from the output section. */
1926 if ((section
->flags
& SEC_READONLY
) == 0)
1927 output
->bfd_section
->flags
&= ~SEC_READONLY
;
1929 switch (output
->sectype
)
1931 case normal_section
:
1936 case overlay_section
:
1937 output
->bfd_section
->flags
&= ~SEC_ALLOC
;
1939 case noload_section
:
1940 output
->bfd_section
->flags
&= ~SEC_LOAD
;
1941 output
->bfd_section
->flags
|= SEC_NEVER_LOAD
;
1945 /* Copy over SEC_SMALL_DATA. */
1946 if (section
->flags
& SEC_SMALL_DATA
)
1947 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
1949 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
1950 output
->bfd_section
->alignment_power
= section
->alignment_power
;
1952 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
1953 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
1955 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
1956 /* FIXME: This value should really be obtained from the bfd... */
1957 output
->block_value
= 128;
1962 /* Compare sections ASEC and BSEC according to SORT. */
1965 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
1974 case by_alignment_name
:
1975 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
1976 - bfd_section_alignment (asec
->owner
, asec
));
1982 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
1983 bfd_get_section_name (bsec
->owner
, bsec
));
1986 case by_name_alignment
:
1987 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
1988 bfd_get_section_name (bsec
->owner
, bsec
));
1994 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
1995 - bfd_section_alignment (asec
->owner
, asec
));
2002 /* Handle wildcard sorting. This returns the lang_input_section which
2003 should follow the one we are going to create for SECTION and FILE,
2004 based on the sorting requirements of WILD. It returns NULL if the
2005 new section should just go at the end of the current list. */
2007 static lang_statement_union_type
*
2008 wild_sort (lang_wild_statement_type
*wild
,
2009 struct wildcard_list
*sec
,
2010 lang_input_statement_type
*file
,
2013 const char *section_name
;
2014 lang_statement_union_type
*l
;
2016 if (!wild
->filenames_sorted
2017 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2020 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2021 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2023 lang_input_section_type
*ls
;
2025 if (l
->header
.type
!= lang_input_section_enum
)
2027 ls
= &l
->input_section
;
2029 /* Sorting by filename takes precedence over sorting by section
2032 if (wild
->filenames_sorted
)
2034 const char *fn
, *ln
;
2038 /* The PE support for the .idata section as generated by
2039 dlltool assumes that files will be sorted by the name of
2040 the archive and then the name of the file within the
2043 if (file
->the_bfd
!= NULL
2044 && bfd_my_archive (file
->the_bfd
) != NULL
)
2046 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2051 fn
= file
->filename
;
2055 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2057 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2062 ln
= ls
->section
->owner
->filename
;
2066 i
= strcmp (fn
, ln
);
2075 fn
= file
->filename
;
2077 ln
= ls
->section
->owner
->filename
;
2079 i
= strcmp (fn
, ln
);
2087 /* Here either the files are not sorted by name, or we are
2088 looking at the sections for this file. */
2090 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2091 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2098 /* Expand a wild statement for a particular FILE. SECTION may be
2099 NULL, in which case it is a wild card. */
2102 output_section_callback (lang_wild_statement_type
*ptr
,
2103 struct wildcard_list
*sec
,
2105 lang_input_statement_type
*file
,
2108 lang_statement_union_type
*before
;
2110 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2111 if (unique_section_p (section
))
2114 before
= wild_sort (ptr
, sec
, file
, section
);
2116 /* Here BEFORE points to the lang_input_section which
2117 should follow the one we are about to add. If BEFORE
2118 is NULL, then the section should just go at the end
2119 of the current list. */
2122 lang_add_section (&ptr
->children
, section
,
2123 (lang_output_section_statement_type
*) output
);
2126 lang_statement_list_type list
;
2127 lang_statement_union_type
**pp
;
2129 lang_list_init (&list
);
2130 lang_add_section (&list
, section
,
2131 (lang_output_section_statement_type
*) output
);
2133 /* If we are discarding the section, LIST.HEAD will
2135 if (list
.head
!= NULL
)
2137 ASSERT (list
.head
->header
.next
== NULL
);
2139 for (pp
= &ptr
->children
.head
;
2141 pp
= &(*pp
)->header
.next
)
2142 ASSERT (*pp
!= NULL
);
2144 list
.head
->header
.next
= *pp
;
2150 /* Check if all sections in a wild statement for a particular FILE
2154 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2155 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2157 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2160 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2161 if (unique_section_p (section
))
2164 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2165 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2168 /* This is passed a file name which must have been seen already and
2169 added to the statement tree. We will see if it has been opened
2170 already and had its symbols read. If not then we'll read it. */
2172 static lang_input_statement_type
*
2173 lookup_name (const char *name
)
2175 lang_input_statement_type
*search
;
2177 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2179 search
= (lang_input_statement_type
*) search
->next_real_file
)
2181 /* Use the local_sym_name as the name of the file that has
2182 already been loaded as filename might have been transformed
2183 via the search directory lookup mechanism. */
2184 const char * filename
= search
->local_sym_name
;
2186 if (filename
== NULL
&& name
== NULL
)
2188 if (filename
!= NULL
2190 && strcmp (filename
, name
) == 0)
2195 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2196 default_target
, FALSE
);
2198 /* If we have already added this file, or this file is not real
2199 (FIXME: can that ever actually happen?) or the name is NULL
2200 (FIXME: can that ever actually happen?) don't add this file. */
2203 || search
->filename
== NULL
)
2206 if (! load_symbols (search
, NULL
))
2212 /* Save LIST as a list of libraries whose symbols should not be exported. */
2217 struct excluded_lib
*next
;
2219 static struct excluded_lib
*excluded_libs
;
2222 add_excluded_libs (const char *list
)
2224 const char *p
= list
, *end
;
2228 struct excluded_lib
*entry
;
2229 end
= strpbrk (p
, ",:");
2231 end
= p
+ strlen (p
);
2232 entry
= xmalloc (sizeof (*entry
));
2233 entry
->next
= excluded_libs
;
2234 entry
->name
= xmalloc (end
- p
+ 1);
2235 memcpy (entry
->name
, p
, end
- p
);
2236 entry
->name
[end
- p
] = '\0';
2237 excluded_libs
= entry
;
2245 check_excluded_libs (bfd
*abfd
)
2247 struct excluded_lib
*lib
= excluded_libs
;
2251 int len
= strlen (lib
->name
);
2252 const char *filename
= lbasename (abfd
->filename
);
2254 if (strcmp (lib
->name
, "ALL") == 0)
2256 abfd
->no_export
= TRUE
;
2260 if (strncmp (lib
->name
, filename
, len
) == 0
2261 && (filename
[len
] == '\0'
2262 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2263 && filename
[len
+ 2] == '\0')))
2265 abfd
->no_export
= TRUE
;
2273 /* Get the symbols for an input file. */
2276 load_symbols (lang_input_statement_type
*entry
,
2277 lang_statement_list_type
*place
)
2284 ldfile_open_file (entry
);
2286 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2287 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2290 lang_statement_list_type
*hold
;
2291 bfd_boolean bad_load
= TRUE
;
2292 bfd_boolean save_ldlang_sysrooted_script
;
2294 err
= bfd_get_error ();
2296 /* See if the emulation has some special knowledge. */
2297 if (ldemul_unrecognized_file (entry
))
2300 if (err
== bfd_error_file_ambiguously_recognized
)
2304 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2305 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2306 for (p
= matching
; *p
!= NULL
; p
++)
2310 else if (err
!= bfd_error_file_not_recognized
2312 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2316 bfd_close (entry
->the_bfd
);
2317 entry
->the_bfd
= NULL
;
2319 /* Try to interpret the file as a linker script. */
2320 ldfile_open_command_file (entry
->filename
);
2324 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2325 ldlang_sysrooted_script
= entry
->sysrooted
;
2327 ldfile_assumed_script
= TRUE
;
2328 parser_input
= input_script
;
2329 /* We want to use the same -Bdynamic/-Bstatic as the one for
2331 config
.dynamic_link
= entry
->dynamic
;
2333 ldfile_assumed_script
= FALSE
;
2335 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2341 if (ldemul_recognized_file (entry
))
2344 /* We don't call ldlang_add_file for an archive. Instead, the
2345 add_symbols entry point will call ldlang_add_file, via the
2346 add_archive_element callback, for each element of the archive
2348 switch (bfd_get_format (entry
->the_bfd
))
2354 ldlang_add_file (entry
);
2355 if (trace_files
|| trace_file_tries
)
2356 info_msg ("%I\n", entry
);
2360 check_excluded_libs (entry
->the_bfd
);
2362 if (entry
->whole_archive
)
2365 bfd_boolean loaded
= TRUE
;
2369 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2374 if (! bfd_check_format (member
, bfd_object
))
2376 einfo (_("%F%B: member %B in archive is not an object\n"),
2377 entry
->the_bfd
, member
);
2381 if (! ((*link_info
.callbacks
->add_archive_element
)
2382 (&link_info
, member
, "--whole-archive")))
2385 if (! bfd_link_add_symbols (member
, &link_info
))
2387 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2392 entry
->loaded
= loaded
;
2398 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2399 entry
->loaded
= TRUE
;
2401 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2403 return entry
->loaded
;
2406 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2407 may be NULL, indicating that it is a wildcard. Separate
2408 lang_input_section statements are created for each part of the
2409 expansion; they are added after the wild statement S. OUTPUT is
2410 the output section. */
2413 wild (lang_wild_statement_type
*s
,
2414 const char *target ATTRIBUTE_UNUSED
,
2415 lang_output_section_statement_type
*output
)
2417 struct wildcard_list
*sec
;
2419 walk_wild (s
, output_section_callback
, output
);
2421 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2423 if (default_common_section
!= NULL
)
2425 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2427 /* Remember the section that common is going to in case we
2428 later get something which doesn't know where to put it. */
2429 default_common_section
= output
;
2434 /* Return TRUE iff target is the sought target. */
2437 get_target (const bfd_target
*target
, void *data
)
2439 const char *sought
= data
;
2441 return strcmp (target
->name
, sought
) == 0;
2444 /* Like strcpy() but convert to lower case as well. */
2447 stricpy (char *dest
, char *src
)
2451 while ((c
= *src
++) != 0)
2452 *dest
++ = TOLOWER (c
);
2457 /* Remove the first occurrence of needle (if any) in haystack
2461 strcut (char *haystack
, char *needle
)
2463 haystack
= strstr (haystack
, needle
);
2469 for (src
= haystack
+ strlen (needle
); *src
;)
2470 *haystack
++ = *src
++;
2476 /* Compare two target format name strings.
2477 Return a value indicating how "similar" they are. */
2480 name_compare (char *first
, char *second
)
2486 copy1
= xmalloc (strlen (first
) + 1);
2487 copy2
= xmalloc (strlen (second
) + 1);
2489 /* Convert the names to lower case. */
2490 stricpy (copy1
, first
);
2491 stricpy (copy2
, second
);
2493 /* Remove size and endian strings from the name. */
2494 strcut (copy1
, "big");
2495 strcut (copy1
, "little");
2496 strcut (copy2
, "big");
2497 strcut (copy2
, "little");
2499 /* Return a value based on how many characters match,
2500 starting from the beginning. If both strings are
2501 the same then return 10 * their length. */
2502 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2503 if (copy1
[result
] == 0)
2515 /* Set by closest_target_match() below. */
2516 static const bfd_target
*winner
;
2518 /* Scan all the valid bfd targets looking for one that has the endianness
2519 requirement that was specified on the command line, and is the nearest
2520 match to the original output target. */
2523 closest_target_match (const bfd_target
*target
, void *data
)
2525 const bfd_target
*original
= data
;
2527 if (command_line
.endian
== ENDIAN_BIG
2528 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2531 if (command_line
.endian
== ENDIAN_LITTLE
2532 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2535 /* Must be the same flavour. */
2536 if (target
->flavour
!= original
->flavour
)
2539 /* If we have not found a potential winner yet, then record this one. */
2546 /* Oh dear, we now have two potential candidates for a successful match.
2547 Compare their names and choose the better one. */
2548 if (name_compare (target
->name
, original
->name
)
2549 > name_compare (winner
->name
, original
->name
))
2552 /* Keep on searching until wqe have checked them all. */
2556 /* Return the BFD target format of the first input file. */
2559 get_first_input_target (void)
2561 char *target
= NULL
;
2563 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2565 if (s
->header
.type
== lang_input_statement_enum
2568 ldfile_open_file (s
);
2570 if (s
->the_bfd
!= NULL
2571 && bfd_check_format (s
->the_bfd
, bfd_object
))
2573 target
= bfd_get_target (s
->the_bfd
);
2585 lang_get_output_target (void)
2589 /* Has the user told us which output format to use? */
2590 if (output_target
!= NULL
)
2591 return output_target
;
2593 /* No - has the current target been set to something other than
2595 if (current_target
!= default_target
)
2596 return current_target
;
2598 /* No - can we determine the format of the first input file? */
2599 target
= get_first_input_target ();
2603 /* Failed - use the default output target. */
2604 return default_target
;
2607 /* Open the output file. */
2610 open_output (const char *name
)
2614 output_target
= lang_get_output_target ();
2616 /* Has the user requested a particular endianness on the command
2618 if (command_line
.endian
!= ENDIAN_UNSET
)
2620 const bfd_target
*target
;
2621 enum bfd_endian desired_endian
;
2623 /* Get the chosen target. */
2624 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2626 /* If the target is not supported, we cannot do anything. */
2629 if (command_line
.endian
== ENDIAN_BIG
)
2630 desired_endian
= BFD_ENDIAN_BIG
;
2632 desired_endian
= BFD_ENDIAN_LITTLE
;
2634 /* See if the target has the wrong endianness. This should
2635 not happen if the linker script has provided big and
2636 little endian alternatives, but some scrips don't do
2638 if (target
->byteorder
!= desired_endian
)
2640 /* If it does, then see if the target provides
2641 an alternative with the correct endianness. */
2642 if (target
->alternative_target
!= NULL
2643 && (target
->alternative_target
->byteorder
== desired_endian
))
2644 output_target
= target
->alternative_target
->name
;
2647 /* Try to find a target as similar as possible to
2648 the default target, but which has the desired
2649 endian characteristic. */
2650 bfd_search_for_target (closest_target_match
,
2653 /* Oh dear - we could not find any targets that
2654 satisfy our requirements. */
2656 einfo (_("%P: warning: could not find any targets"
2657 " that match endianness requirement\n"));
2659 output_target
= winner
->name
;
2665 output
= bfd_openw (name
, output_target
);
2669 if (bfd_get_error () == bfd_error_invalid_target
)
2670 einfo (_("%P%F: target %s not found\n"), output_target
);
2672 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2675 delete_output_file_on_failure
= TRUE
;
2677 if (! bfd_set_format (output
, bfd_object
))
2678 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2679 if (! bfd_set_arch_mach (output
,
2680 ldfile_output_architecture
,
2681 ldfile_output_machine
))
2682 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2684 link_info
.hash
= bfd_link_hash_table_create (output
);
2685 if (link_info
.hash
== NULL
)
2686 einfo (_("%P%F: can not create hash table: %E\n"));
2688 bfd_set_gp_size (output
, g_switch_value
);
2693 ldlang_open_output (lang_statement_union_type
*statement
)
2695 switch (statement
->header
.type
)
2697 case lang_output_statement_enum
:
2698 ASSERT (output_bfd
== NULL
);
2699 output_bfd
= open_output (statement
->output_statement
.name
);
2700 ldemul_set_output_arch ();
2701 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2702 output_bfd
->flags
|= D_PAGED
;
2704 output_bfd
->flags
&= ~D_PAGED
;
2705 if (config
.text_read_only
)
2706 output_bfd
->flags
|= WP_TEXT
;
2708 output_bfd
->flags
&= ~WP_TEXT
;
2709 if (link_info
.traditional_format
)
2710 output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2712 output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2715 case lang_target_statement_enum
:
2716 current_target
= statement
->target_statement
.target
;
2723 /* Convert between addresses in bytes and sizes in octets.
2724 For currently supported targets, octets_per_byte is always a power
2725 of two, so we can use shifts. */
2726 #define TO_ADDR(X) ((X) >> opb_shift)
2727 #define TO_SIZE(X) ((X) << opb_shift)
2729 /* Support the above. */
2730 static unsigned int opb_shift
= 0;
2735 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2736 ldfile_output_machine
);
2739 while ((x
& 1) == 0)
2747 /* Open all the input files. */
2750 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2752 for (; s
!= NULL
; s
= s
->header
.next
)
2754 switch (s
->header
.type
)
2756 case lang_constructors_statement_enum
:
2757 open_input_bfds (constructor_list
.head
, force
);
2759 case lang_output_section_statement_enum
:
2760 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2762 case lang_wild_statement_enum
:
2763 /* Maybe we should load the file's symbols. */
2764 if (s
->wild_statement
.filename
2765 && ! wildcardp (s
->wild_statement
.filename
))
2766 lookup_name (s
->wild_statement
.filename
);
2767 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2769 case lang_group_statement_enum
:
2771 struct bfd_link_hash_entry
*undefs
;
2773 /* We must continually search the entries in the group
2774 until no new symbols are added to the list of undefined
2779 undefs
= link_info
.hash
->undefs_tail
;
2780 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2782 while (undefs
!= link_info
.hash
->undefs_tail
);
2785 case lang_target_statement_enum
:
2786 current_target
= s
->target_statement
.target
;
2788 case lang_input_statement_enum
:
2789 if (s
->input_statement
.real
)
2791 lang_statement_list_type add
;
2793 s
->input_statement
.target
= current_target
;
2795 /* If we are being called from within a group, and this
2796 is an archive which has already been searched, then
2797 force it to be researched unless the whole archive
2798 has been loaded already. */
2800 && !s
->input_statement
.whole_archive
2801 && s
->input_statement
.loaded
2802 && bfd_check_format (s
->input_statement
.the_bfd
,
2804 s
->input_statement
.loaded
= FALSE
;
2806 lang_list_init (&add
);
2808 if (! load_symbols (&s
->input_statement
, &add
))
2809 config
.make_executable
= FALSE
;
2811 if (add
.head
!= NULL
)
2813 *add
.tail
= s
->header
.next
;
2814 s
->header
.next
= add
.head
;
2824 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2827 lang_track_definedness (const char *name
)
2829 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2830 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2833 /* New-function for the definedness hash table. */
2835 static struct bfd_hash_entry
*
2836 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2837 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2838 const char *name ATTRIBUTE_UNUSED
)
2840 struct lang_definedness_hash_entry
*ret
2841 = (struct lang_definedness_hash_entry
*) entry
;
2844 ret
= (struct lang_definedness_hash_entry
*)
2845 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
2848 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
2850 ret
->iteration
= -1;
2854 /* Return the iteration when the definition of NAME was last updated. A
2855 value of -1 means that the symbol is not defined in the linker script
2856 or the command line, but may be defined in the linker symbol table. */
2859 lang_symbol_definition_iteration (const char *name
)
2861 struct lang_definedness_hash_entry
*defentry
2862 = (struct lang_definedness_hash_entry
*)
2863 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2865 /* We've already created this one on the presence of DEFINED in the
2866 script, so it can't be NULL unless something is borked elsewhere in
2868 if (defentry
== NULL
)
2871 return defentry
->iteration
;
2874 /* Update the definedness state of NAME. */
2877 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
2879 struct lang_definedness_hash_entry
*defentry
2880 = (struct lang_definedness_hash_entry
*)
2881 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2883 /* We don't keep track of symbols not tested with DEFINED. */
2884 if (defentry
== NULL
)
2887 /* If the symbol was already defined, and not from an earlier statement
2888 iteration, don't update the definedness iteration, because that'd
2889 make the symbol seem defined in the linker script at this point, and
2890 it wasn't; it was defined in some object. If we do anyway, DEFINED
2891 would start to yield false before this point and the construct "sym =
2892 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2894 if (h
->type
!= bfd_link_hash_undefined
2895 && h
->type
!= bfd_link_hash_common
2896 && h
->type
!= bfd_link_hash_new
2897 && defentry
->iteration
== -1)
2900 defentry
->iteration
= lang_statement_iteration
;
2903 /* Add the supplied name to the symbol table as an undefined reference.
2904 This is a two step process as the symbol table doesn't even exist at
2905 the time the ld command line is processed. First we put the name
2906 on a list, then, once the output file has been opened, transfer the
2907 name to the symbol table. */
2909 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
2911 #define ldlang_undef_chain_list_head entry_symbol.next
2914 ldlang_add_undef (const char *const name
)
2916 ldlang_undef_chain_list_type
*new =
2917 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
2919 new->next
= ldlang_undef_chain_list_head
;
2920 ldlang_undef_chain_list_head
= new;
2922 new->name
= xstrdup (name
);
2924 if (output_bfd
!= NULL
)
2925 insert_undefined (new->name
);
2928 /* Insert NAME as undefined in the symbol table. */
2931 insert_undefined (const char *name
)
2933 struct bfd_link_hash_entry
*h
;
2935 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
2937 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2938 if (h
->type
== bfd_link_hash_new
)
2940 h
->type
= bfd_link_hash_undefined
;
2941 h
->u
.undef
.abfd
= NULL
;
2942 bfd_link_add_undef (link_info
.hash
, h
);
2946 /* Run through the list of undefineds created above and place them
2947 into the linker hash table as undefined symbols belonging to the
2951 lang_place_undefineds (void)
2953 ldlang_undef_chain_list_type
*ptr
;
2955 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
2956 insert_undefined (ptr
->name
);
2959 /* Check for all readonly or some readwrite sections. */
2962 check_input_sections
2963 (lang_statement_union_type
*s
,
2964 lang_output_section_statement_type
*output_section_statement
)
2966 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
2968 switch (s
->header
.type
)
2970 case lang_wild_statement_enum
:
2971 walk_wild (&s
->wild_statement
, check_section_callback
,
2972 output_section_statement
);
2973 if (! output_section_statement
->all_input_readonly
)
2976 case lang_constructors_statement_enum
:
2977 check_input_sections (constructor_list
.head
,
2978 output_section_statement
);
2979 if (! output_section_statement
->all_input_readonly
)
2982 case lang_group_statement_enum
:
2983 check_input_sections (s
->group_statement
.children
.head
,
2984 output_section_statement
);
2985 if (! output_section_statement
->all_input_readonly
)
2994 /* Update wildcard statements if needed. */
2997 update_wild_statements (lang_statement_union_type
*s
)
2999 struct wildcard_list
*sec
;
3001 switch (sort_section
)
3011 for (; s
!= NULL
; s
= s
->header
.next
)
3013 switch (s
->header
.type
)
3018 case lang_wild_statement_enum
:
3019 sec
= s
->wild_statement
.section_list
;
3022 switch (sec
->spec
.sorted
)
3025 sec
->spec
.sorted
= sort_section
;
3028 if (sort_section
== by_alignment
)
3029 sec
->spec
.sorted
= by_name_alignment
;
3032 if (sort_section
== by_name
)
3033 sec
->spec
.sorted
= by_alignment_name
;
3041 case lang_constructors_statement_enum
:
3042 update_wild_statements (constructor_list
.head
);
3045 case lang_output_section_statement_enum
:
3046 update_wild_statements
3047 (s
->output_section_statement
.children
.head
);
3050 case lang_group_statement_enum
:
3051 update_wild_statements (s
->group_statement
.children
.head
);
3059 /* Open input files and attach to output sections. */
3062 map_input_to_output_sections
3063 (lang_statement_union_type
*s
, const char *target
,
3064 lang_output_section_statement_type
*os
)
3066 for (; s
!= NULL
; s
= s
->header
.next
)
3068 switch (s
->header
.type
)
3070 case lang_wild_statement_enum
:
3071 wild (&s
->wild_statement
, target
, os
);
3073 case lang_constructors_statement_enum
:
3074 map_input_to_output_sections (constructor_list
.head
,
3078 case lang_output_section_statement_enum
:
3079 if (s
->output_section_statement
.constraint
)
3081 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3082 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3084 s
->output_section_statement
.all_input_readonly
= TRUE
;
3085 check_input_sections (s
->output_section_statement
.children
.head
,
3086 &s
->output_section_statement
);
3087 if ((s
->output_section_statement
.all_input_readonly
3088 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3089 || (!s
->output_section_statement
.all_input_readonly
3090 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3092 s
->output_section_statement
.constraint
= -1;
3097 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3099 &s
->output_section_statement
);
3101 case lang_output_statement_enum
:
3103 case lang_target_statement_enum
:
3104 target
= s
->target_statement
.target
;
3106 case lang_group_statement_enum
:
3107 map_input_to_output_sections (s
->group_statement
.children
.head
,
3111 case lang_data_statement_enum
:
3112 /* Make sure that any sections mentioned in the expression
3114 exp_init_os (s
->data_statement
.exp
);
3115 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3117 /* The output section gets contents, and then we inspect for
3118 any flags set in the input script which override any ALLOC. */
3119 os
->bfd_section
->flags
|= SEC_HAS_CONTENTS
;
3120 if (!(os
->flags
& SEC_NEVER_LOAD
))
3121 os
->bfd_section
->flags
|= SEC_ALLOC
| SEC_LOAD
;
3123 case lang_fill_statement_enum
:
3124 case lang_input_section_enum
:
3125 case lang_object_symbols_statement_enum
:
3126 case lang_reloc_statement_enum
:
3127 case lang_padding_statement_enum
:
3128 case lang_input_statement_enum
:
3129 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3132 case lang_assignment_statement_enum
:
3133 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3136 /* Make sure that any sections mentioned in the assignment
3138 exp_init_os (s
->assignment_statement
.exp
);
3140 case lang_afile_asection_pair_statement_enum
:
3143 case lang_address_statement_enum
:
3144 /* Mark the specified section with the supplied address.
3146 If this section was actually a segment marker, then the
3147 directive is ignored if the linker script explicitly
3148 processed the segment marker. Originally, the linker
3149 treated segment directives (like -Ttext on the
3150 command-line) as section directives. We honor the
3151 section directive semantics for backwards compatibilty;
3152 linker scripts that do not specifically check for
3153 SEGMENT_START automatically get the old semantics. */
3154 if (!s
->address_statement
.segment
3155 || !s
->address_statement
.segment
->used
)
3157 lang_output_section_statement_type
*aos
3158 = (lang_output_section_statement_lookup
3159 (s
->address_statement
.section_name
));
3161 if (aos
->bfd_section
== NULL
)
3162 init_os (aos
, NULL
);
3163 aos
->addr_tree
= s
->address_statement
.address
;
3170 /* An output section might have been removed after its statement was
3171 added. For example, ldemul_before_allocation can remove dynamic
3172 sections if they turn out to be not needed. Clean them up here. */
3175 strip_excluded_output_sections (void)
3177 lang_output_section_statement_type
*os
;
3179 /* Run lang_size_sections (if not already done). */
3180 if (expld
.phase
!= lang_mark_phase_enum
)
3182 expld
.phase
= lang_mark_phase_enum
;
3183 expld
.dataseg
.phase
= exp_dataseg_none
;
3184 one_lang_size_sections_pass (NULL
, FALSE
);
3185 lang_reset_memory_regions ();
3188 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3192 asection
*output_section
;
3193 bfd_boolean exclude
;
3195 if (os
->constraint
== -1)
3198 output_section
= os
->bfd_section
;
3199 if (output_section
== NULL
)
3202 exclude
= (output_section
->rawsize
== 0
3203 && (output_section
->flags
& SEC_KEEP
) == 0
3204 && !bfd_section_removed_from_list (output_bfd
,
3207 /* Some sections have not yet been sized, notably .gnu.version,
3208 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3209 input sections, so don't drop output sections that have such
3210 input sections unless they are also marked SEC_EXCLUDE. */
3211 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3215 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3216 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3217 && (s
->flags
& SEC_EXCLUDE
) == 0)
3224 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3225 output_section
->map_head
.link_order
= NULL
;
3226 output_section
->map_tail
.link_order
= NULL
;
3230 /* We don't set bfd_section to NULL since bfd_section of the
3231 removed output section statement may still be used. */
3233 output_section
->flags
|= SEC_EXCLUDE
;
3234 bfd_section_list_remove (output_bfd
, output_section
);
3235 output_bfd
->section_count
--;
3239 /* Stop future calls to lang_add_section from messing with map_head
3240 and map_tail link_order fields. */
3241 stripped_excluded_sections
= TRUE
;
3245 print_output_section_statement
3246 (lang_output_section_statement_type
*output_section_statement
)
3248 asection
*section
= output_section_statement
->bfd_section
;
3251 if (output_section_statement
!= abs_output_section
)
3253 minfo ("\n%s", output_section_statement
->name
);
3255 if (section
!= NULL
)
3257 print_dot
= section
->vma
;
3259 len
= strlen (output_section_statement
->name
);
3260 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3265 while (len
< SECTION_NAME_MAP_LENGTH
)
3271 minfo ("0x%V %W", section
->vma
, section
->size
);
3273 if (output_section_statement
->load_base
!= NULL
)
3277 addr
= exp_get_abs_int (output_section_statement
->load_base
, 0,
3279 minfo (_(" load address 0x%V"), addr
);
3286 print_statement_list (output_section_statement
->children
.head
,
3287 output_section_statement
);
3290 /* Scan for the use of the destination in the right hand side
3291 of an expression. In such cases we will not compute the
3292 correct expression, since the value of DST that is used on
3293 the right hand side will be its final value, not its value
3294 just before this expression is evaluated. */
3297 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3299 if (rhs
== NULL
|| dst
== NULL
)
3302 switch (rhs
->type
.node_class
)
3305 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3306 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3309 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3310 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3313 case etree_provided
:
3315 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3317 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3320 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3324 return strcmp (dst
, rhs
->value
.str
) == 0;
3329 return strcmp (dst
, rhs
->name
.name
) == 0;
3341 print_assignment (lang_assignment_statement_type
*assignment
,
3342 lang_output_section_statement_type
*output_section
)
3346 bfd_boolean computation_is_valid
= TRUE
;
3349 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3352 if (assignment
->exp
->type
.node_class
== etree_assert
)
3355 tree
= assignment
->exp
->assert_s
.child
;
3356 computation_is_valid
= TRUE
;
3360 const char *dst
= assignment
->exp
->assign
.dst
;
3362 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3363 tree
= assignment
->exp
->assign
.src
;
3364 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3367 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3368 if (expld
.result
.valid_p
)
3372 if (computation_is_valid
)
3374 value
= expld
.result
.value
;
3376 if (expld
.result
.section
)
3377 value
+= expld
.result
.section
->vma
;
3379 minfo ("0x%V", value
);
3385 struct bfd_link_hash_entry
*h
;
3387 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3388 FALSE
, FALSE
, TRUE
);
3391 value
= h
->u
.def
.value
;
3393 if (expld
.result
.section
)
3394 value
+= expld
.result
.section
->vma
;
3396 minfo ("[0x%V]", value
);
3399 minfo ("[unresolved]");
3411 exp_print_tree (assignment
->exp
);
3416 print_input_statement (lang_input_statement_type
*statm
)
3418 if (statm
->filename
!= NULL
)
3420 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3424 /* Print all symbols defined in a particular section. This is called
3425 via bfd_link_hash_traverse, or by print_all_symbols. */
3428 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3430 asection
*sec
= ptr
;
3432 if ((hash_entry
->type
== bfd_link_hash_defined
3433 || hash_entry
->type
== bfd_link_hash_defweak
)
3434 && sec
== hash_entry
->u
.def
.section
)
3438 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3441 (hash_entry
->u
.def
.value
3442 + hash_entry
->u
.def
.section
->output_offset
3443 + hash_entry
->u
.def
.section
->output_section
->vma
));
3445 minfo (" %T\n", hash_entry
->root
.string
);
3452 print_all_symbols (sec
)
3455 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3456 struct map_symbol_def
*def
;
3461 *ud
->map_symbol_def_tail
= 0;
3462 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3463 print_one_symbol (def
->entry
, sec
);
3466 /* Print information about an input section to the map file. */
3469 print_input_section (lang_input_section_type
*in
)
3471 asection
*i
= in
->section
;
3472 bfd_size_type size
= i
->size
;
3481 minfo ("%s", i
->name
);
3483 len
= 1 + strlen (i
->name
);
3484 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3489 while (len
< SECTION_NAME_MAP_LENGTH
)
3495 if (i
->output_section
!= NULL
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3496 addr
= i
->output_section
->vma
+ i
->output_offset
;
3503 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3505 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3507 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3519 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3522 if (i
->output_section
!= NULL
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3524 if (command_line
.reduce_memory_overheads
)
3525 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3527 print_all_symbols (i
);
3529 print_dot
= addr
+ TO_ADDR (size
);
3535 print_fill_statement (lang_fill_statement_type
*fill
)
3539 fputs (" FILL mask 0x", config
.map_file
);
3540 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3541 fprintf (config
.map_file
, "%02x", *p
);
3542 fputs ("\n", config
.map_file
);
3546 print_data_statement (lang_data_statement_type
*data
)
3554 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3557 addr
= data
->output_offset
;
3558 if (data
->output_section
!= NULL
)
3559 addr
+= data
->output_section
->vma
;
3587 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3589 if (data
->exp
->type
.node_class
!= etree_value
)
3592 exp_print_tree (data
->exp
);
3597 print_dot
= addr
+ TO_ADDR (size
);
3600 /* Print an address statement. These are generated by options like
3604 print_address_statement (lang_address_statement_type
*address
)
3606 minfo (_("Address of section %s set to "), address
->section_name
);
3607 exp_print_tree (address
->address
);
3611 /* Print a reloc statement. */
3614 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3621 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3624 addr
= reloc
->output_offset
;
3625 if (reloc
->output_section
!= NULL
)
3626 addr
+= reloc
->output_section
->vma
;
3628 size
= bfd_get_reloc_size (reloc
->howto
);
3630 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3632 if (reloc
->name
!= NULL
)
3633 minfo ("%s+", reloc
->name
);
3635 minfo ("%s+", reloc
->section
->name
);
3637 exp_print_tree (reloc
->addend_exp
);
3641 print_dot
= addr
+ TO_ADDR (size
);
3645 print_padding_statement (lang_padding_statement_type
*s
)
3653 len
= sizeof " *fill*" - 1;
3654 while (len
< SECTION_NAME_MAP_LENGTH
)
3660 addr
= s
->output_offset
;
3661 if (s
->output_section
!= NULL
)
3662 addr
+= s
->output_section
->vma
;
3663 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3665 if (s
->fill
->size
!= 0)
3669 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3670 fprintf (config
.map_file
, "%02x", *p
);
3675 print_dot
= addr
+ TO_ADDR (s
->size
);
3679 print_wild_statement (lang_wild_statement_type
*w
,
3680 lang_output_section_statement_type
*os
)
3682 struct wildcard_list
*sec
;
3686 if (w
->filenames_sorted
)
3688 if (w
->filename
!= NULL
)
3689 minfo ("%s", w
->filename
);
3692 if (w
->filenames_sorted
)
3696 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
3698 if (sec
->spec
.sorted
)
3700 if (sec
->spec
.exclude_name_list
!= NULL
)
3703 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
3704 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
3705 minfo (" %s", tmp
->name
);
3708 if (sec
->spec
.name
!= NULL
)
3709 minfo ("%s", sec
->spec
.name
);
3712 if (sec
->spec
.sorted
)
3721 print_statement_list (w
->children
.head
, os
);
3724 /* Print a group statement. */
3727 print_group (lang_group_statement_type
*s
,
3728 lang_output_section_statement_type
*os
)
3730 fprintf (config
.map_file
, "START GROUP\n");
3731 print_statement_list (s
->children
.head
, os
);
3732 fprintf (config
.map_file
, "END GROUP\n");
3735 /* Print the list of statements in S.
3736 This can be called for any statement type. */
3739 print_statement_list (lang_statement_union_type
*s
,
3740 lang_output_section_statement_type
*os
)
3744 print_statement (s
, os
);
3749 /* Print the first statement in statement list S.
3750 This can be called for any statement type. */
3753 print_statement (lang_statement_union_type
*s
,
3754 lang_output_section_statement_type
*os
)
3756 switch (s
->header
.type
)
3759 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
3762 case lang_constructors_statement_enum
:
3763 if (constructor_list
.head
!= NULL
)
3765 if (constructors_sorted
)
3766 minfo (" SORT (CONSTRUCTORS)\n");
3768 minfo (" CONSTRUCTORS\n");
3769 print_statement_list (constructor_list
.head
, os
);
3772 case lang_wild_statement_enum
:
3773 print_wild_statement (&s
->wild_statement
, os
);
3775 case lang_address_statement_enum
:
3776 print_address_statement (&s
->address_statement
);
3778 case lang_object_symbols_statement_enum
:
3779 minfo (" CREATE_OBJECT_SYMBOLS\n");
3781 case lang_fill_statement_enum
:
3782 print_fill_statement (&s
->fill_statement
);
3784 case lang_data_statement_enum
:
3785 print_data_statement (&s
->data_statement
);
3787 case lang_reloc_statement_enum
:
3788 print_reloc_statement (&s
->reloc_statement
);
3790 case lang_input_section_enum
:
3791 print_input_section (&s
->input_section
);
3793 case lang_padding_statement_enum
:
3794 print_padding_statement (&s
->padding_statement
);
3796 case lang_output_section_statement_enum
:
3797 print_output_section_statement (&s
->output_section_statement
);
3799 case lang_assignment_statement_enum
:
3800 print_assignment (&s
->assignment_statement
, os
);
3802 case lang_target_statement_enum
:
3803 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
3805 case lang_output_statement_enum
:
3806 minfo ("OUTPUT(%s", s
->output_statement
.name
);
3807 if (output_target
!= NULL
)
3808 minfo (" %s", output_target
);
3811 case lang_input_statement_enum
:
3812 print_input_statement (&s
->input_statement
);
3814 case lang_group_statement_enum
:
3815 print_group (&s
->group_statement
, os
);
3817 case lang_afile_asection_pair_statement_enum
:
3824 print_statements (void)
3826 print_statement_list (statement_list
.head
, abs_output_section
);
3829 /* Print the first N statements in statement list S to STDERR.
3830 If N == 0, nothing is printed.
3831 If N < 0, the entire list is printed.
3832 Intended to be called from GDB. */
3835 dprint_statement (lang_statement_union_type
*s
, int n
)
3837 FILE *map_save
= config
.map_file
;
3839 config
.map_file
= stderr
;
3842 print_statement_list (s
, abs_output_section
);
3845 while (s
&& --n
>= 0)
3847 print_statement (s
, abs_output_section
);
3852 config
.map_file
= map_save
;
3856 insert_pad (lang_statement_union_type
**ptr
,
3858 unsigned int alignment_needed
,
3859 asection
*output_section
,
3862 static fill_type zero_fill
= { 1, { 0 } };
3863 lang_statement_union_type
*pad
= NULL
;
3865 if (ptr
!= &statement_list
.head
)
3866 pad
= ((lang_statement_union_type
*)
3867 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
3869 && pad
->header
.type
== lang_padding_statement_enum
3870 && pad
->padding_statement
.output_section
== output_section
)
3872 /* Use the existing pad statement. */
3874 else if ((pad
= *ptr
) != NULL
3875 && pad
->header
.type
== lang_padding_statement_enum
3876 && pad
->padding_statement
.output_section
== output_section
)
3878 /* Use the existing pad statement. */
3882 /* Make a new padding statement, linked into existing chain. */
3883 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
3884 pad
->header
.next
= *ptr
;
3886 pad
->header
.type
= lang_padding_statement_enum
;
3887 pad
->padding_statement
.output_section
= output_section
;
3890 pad
->padding_statement
.fill
= fill
;
3892 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
3893 pad
->padding_statement
.size
= alignment_needed
;
3894 output_section
->size
+= alignment_needed
;
3897 /* Work out how much this section will move the dot point. */
3901 (lang_statement_union_type
**this_ptr
,
3902 lang_output_section_statement_type
*output_section_statement
,
3906 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
3907 asection
*i
= is
->section
;
3909 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
3910 && (i
->flags
& SEC_EXCLUDE
) == 0)
3912 unsigned int alignment_needed
;
3915 /* Align this section first to the input sections requirement,
3916 then to the output section's requirement. If this alignment
3917 is greater than any seen before, then record it too. Perform
3918 the alignment by inserting a magic 'padding' statement. */
3920 if (output_section_statement
->subsection_alignment
!= -1)
3921 i
->alignment_power
= output_section_statement
->subsection_alignment
;
3923 o
= output_section_statement
->bfd_section
;
3924 if (o
->alignment_power
< i
->alignment_power
)
3925 o
->alignment_power
= i
->alignment_power
;
3927 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
3929 if (alignment_needed
!= 0)
3931 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
3932 dot
+= alignment_needed
;
3935 /* Remember where in the output section this input section goes. */
3937 i
->output_offset
= dot
- o
->vma
;
3939 /* Mark how big the output section must be to contain this now. */
3940 dot
+= TO_ADDR (i
->size
);
3941 o
->size
= TO_SIZE (dot
- o
->vma
);
3945 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
3952 sort_sections_by_lma (const void *arg1
, const void *arg2
)
3954 const asection
*sec1
= *(const asection
**) arg1
;
3955 const asection
*sec2
= *(const asection
**) arg2
;
3957 if (bfd_section_lma (sec1
->owner
, sec1
)
3958 < bfd_section_lma (sec2
->owner
, sec2
))
3960 else if (bfd_section_lma (sec1
->owner
, sec1
)
3961 > bfd_section_lma (sec2
->owner
, sec2
))
3967 #define IGNORE_SECTION(s) \
3968 ((s->flags & SEC_NEVER_LOAD) != 0 \
3969 || (s->flags & SEC_ALLOC) == 0 \
3970 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
3971 && (s->flags & SEC_LOAD) == 0))
3973 /* Check to see if any allocated sections overlap with other allocated
3974 sections. This can happen if a linker script specifies the output
3975 section addresses of the two sections. */
3978 lang_check_section_addresses (void)
3981 asection
**sections
, **spp
;
3989 if (bfd_count_sections (output_bfd
) <= 1)
3992 amt
= bfd_count_sections (output_bfd
) * sizeof (asection
*);
3993 sections
= xmalloc (amt
);
3995 /* Scan all sections in the output list. */
3997 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
3999 /* Only consider loadable sections with real contents. */
4000 if (IGNORE_SECTION (s
) || s
->size
== 0)
4003 sections
[count
] = s
;
4010 qsort (sections
, (size_t) count
, sizeof (asection
*),
4011 sort_sections_by_lma
);
4015 s_start
= bfd_section_lma (output_bfd
, s
);
4016 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4017 for (count
--; count
; count
--)
4019 /* We must check the sections' LMA addresses not their VMA
4020 addresses because overlay sections can have overlapping VMAs
4021 but they must have distinct LMAs. */
4026 s_start
= bfd_section_lma (output_bfd
, s
);
4027 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4029 /* Look for an overlap. */
4030 if (s_end
>= os_start
&& s_start
<= os_end
)
4031 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4032 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4038 /* Make sure the new address is within the region. We explicitly permit the
4039 current address to be at the exact end of the region when the address is
4040 non-zero, in case the region is at the end of addressable memory and the
4041 calculation wraps around. */
4044 os_region_check (lang_output_section_statement_type
*os
,
4045 lang_memory_region_type
*region
,
4049 if ((region
->current
< region
->origin
4050 || (region
->current
- region
->origin
> region
->length
))
4051 && ((region
->current
!= region
->origin
+ region
->length
)
4056 einfo (_("%X%P: address 0x%v of %B section %s"
4057 " is not within region %s\n"),
4059 os
->bfd_section
->owner
,
4060 os
->bfd_section
->name
,
4065 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4067 os
->bfd_section
->owner
,
4068 os
->bfd_section
->name
);
4070 /* Reset the region pointer. */
4071 region
->current
= region
->origin
;
4075 /* Set the sizes for all the output sections. */
4078 lang_size_sections_1
4079 (lang_statement_union_type
*s
,
4080 lang_output_section_statement_type
*output_section_statement
,
4081 lang_statement_union_type
**prev
,
4085 bfd_boolean check_regions
)
4087 /* Size up the sections from their constituent parts. */
4088 for (; s
!= NULL
; s
= s
->header
.next
)
4090 switch (s
->header
.type
)
4092 case lang_output_section_statement_enum
:
4094 bfd_vma newdot
, after
;
4095 lang_output_section_statement_type
*os
;
4097 os
= &s
->output_section_statement
;
4098 if (os
->addr_tree
!= NULL
)
4100 os
->processed
= FALSE
;
4101 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4103 if (!expld
.result
.valid_p
4104 && expld
.phase
!= lang_mark_phase_enum
)
4105 einfo (_("%F%S: non constant or forward reference"
4106 " address expression for section %s\n"),
4109 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4112 if (os
->bfd_section
== NULL
)
4113 /* This section was removed or never actually created. */
4116 /* If this is a COFF shared library section, use the size and
4117 address from the input section. FIXME: This is COFF
4118 specific; it would be cleaner if there were some other way
4119 to do this, but nothing simple comes to mind. */
4120 if ((bfd_get_flavour (output_bfd
) == bfd_target_ecoff_flavour
4121 || bfd_get_flavour (output_bfd
) == bfd_target_coff_flavour
)
4122 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4126 if (os
->children
.head
== NULL
4127 || os
->children
.head
->header
.next
!= NULL
4128 || (os
->children
.head
->header
.type
4129 != lang_input_section_enum
))
4130 einfo (_("%P%X: Internal error on COFF shared library"
4131 " section %s\n"), os
->name
);
4133 input
= os
->children
.head
->input_section
.section
;
4134 bfd_set_section_vma (os
->bfd_section
->owner
,
4136 bfd_section_vma (input
->owner
, input
));
4137 os
->bfd_section
->size
= input
->size
;
4142 if (bfd_is_abs_section (os
->bfd_section
))
4144 /* No matter what happens, an abs section starts at zero. */
4145 ASSERT (os
->bfd_section
->vma
== 0);
4151 if (os
->addr_tree
== NULL
)
4153 /* No address specified for this section, get one
4154 from the region specification. */
4155 if (os
->region
== NULL
4156 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4157 && os
->region
->name
[0] == '*'
4158 && strcmp (os
->region
->name
,
4159 DEFAULT_MEMORY_REGION
) == 0))
4161 os
->region
= lang_memory_default (os
->bfd_section
);
4164 /* If a loadable section is using the default memory
4165 region, and some non default memory regions were
4166 defined, issue an error message. */
4167 if (!IGNORE_SECTION (os
->bfd_section
)
4168 && ! link_info
.relocatable
4170 && strcmp (os
->region
->name
,
4171 DEFAULT_MEMORY_REGION
) == 0
4172 && lang_memory_region_list
!= NULL
4173 && (strcmp (lang_memory_region_list
->name
,
4174 DEFAULT_MEMORY_REGION
) != 0
4175 || lang_memory_region_list
->next
!= NULL
)
4176 && expld
.phase
!= lang_mark_phase_enum
)
4178 /* By default this is an error rather than just a
4179 warning because if we allocate the section to the
4180 default memory region we can end up creating an
4181 excessively large binary, or even seg faulting when
4182 attempting to perform a negative seek. See
4183 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4184 for an example of this. This behaviour can be
4185 overridden by the using the --no-check-sections
4187 if (command_line
.check_section_addresses
)
4188 einfo (_("%P%F: error: no memory region specified"
4189 " for loadable section `%s'\n"),
4190 bfd_get_section_name (output_bfd
,
4193 einfo (_("%P: warning: no memory region specified"
4194 " for loadable section `%s'\n"),
4195 bfd_get_section_name (output_bfd
,
4199 newdot
= os
->region
->current
;
4200 align
= os
->bfd_section
->alignment_power
;
4203 align
= os
->section_alignment
;
4205 /* Align to what the section needs. */
4208 bfd_vma savedot
= newdot
;
4209 newdot
= align_power (newdot
, align
);
4211 if (newdot
!= savedot
4212 && (config
.warn_section_align
4213 || os
->addr_tree
!= NULL
)
4214 && expld
.phase
!= lang_mark_phase_enum
)
4215 einfo (_("%P: warning: changing start of section"
4216 " %s by %lu bytes\n"),
4217 os
->name
, (unsigned long) (newdot
- savedot
));
4220 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4222 os
->bfd_section
->output_offset
= 0;
4225 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4226 os
->fill
, newdot
, relax
, check_regions
);
4228 os
->processed
= TRUE
;
4230 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4232 ASSERT (os
->bfd_section
->size
== 0);
4236 dot
= os
->bfd_section
->vma
;
4238 /* Put the section within the requested block size, or
4239 align at the block boundary. */
4241 + TO_ADDR (os
->bfd_section
->size
)
4242 + os
->block_value
- 1)
4243 & - (bfd_vma
) os
->block_value
);
4245 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4247 /* .tbss sections effectively have zero size. */
4248 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4249 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4250 || link_info
.relocatable
)
4251 dot
+= TO_ADDR (os
->bfd_section
->size
);
4253 if (os
->update_dot_tree
!= 0)
4254 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4256 /* Update dot in the region ?
4257 We only do this if the section is going to be allocated,
4258 since unallocated sections do not contribute to the region's
4259 overall size in memory.
4261 If the SEC_NEVER_LOAD bit is not set, it will affect the
4262 addresses of sections after it. We have to update
4264 if (os
->region
!= NULL
4265 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4266 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4268 os
->region
->current
= dot
;
4271 /* Make sure the new address is within the region. */
4272 os_region_check (os
, os
->region
, os
->addr_tree
,
4273 os
->bfd_section
->vma
);
4275 /* If there's no load address specified, use the run
4276 region as the load region. */
4277 if (os
->lma_region
== NULL
&& os
->load_base
== NULL
)
4278 os
->lma_region
= os
->region
;
4280 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
)
4282 /* Set load_base, which will be handled later. */
4283 os
->load_base
= exp_intop (os
->lma_region
->current
);
4284 os
->lma_region
->current
+=
4285 TO_ADDR (os
->bfd_section
->size
);
4287 os_region_check (os
, os
->lma_region
, NULL
,
4288 os
->bfd_section
->lma
);
4294 case lang_constructors_statement_enum
:
4295 dot
= lang_size_sections_1 (constructor_list
.head
,
4296 output_section_statement
,
4297 &s
->wild_statement
.children
.head
,
4298 fill
, dot
, relax
, check_regions
);
4301 case lang_data_statement_enum
:
4303 unsigned int size
= 0;
4305 s
->data_statement
.output_offset
=
4306 dot
- output_section_statement
->bfd_section
->vma
;
4307 s
->data_statement
.output_section
=
4308 output_section_statement
->bfd_section
;
4310 /* We might refer to provided symbols in the expression, and
4311 need to mark them as needed. */
4312 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4314 switch (s
->data_statement
.type
)
4332 if (size
< TO_SIZE ((unsigned) 1))
4333 size
= TO_SIZE ((unsigned) 1);
4334 dot
+= TO_ADDR (size
);
4335 output_section_statement
->bfd_section
->size
+= size
;
4339 case lang_reloc_statement_enum
:
4343 s
->reloc_statement
.output_offset
=
4344 dot
- output_section_statement
->bfd_section
->vma
;
4345 s
->reloc_statement
.output_section
=
4346 output_section_statement
->bfd_section
;
4347 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4348 dot
+= TO_ADDR (size
);
4349 output_section_statement
->bfd_section
->size
+= size
;
4353 case lang_wild_statement_enum
:
4354 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4355 output_section_statement
,
4356 &s
->wild_statement
.children
.head
,
4357 fill
, dot
, relax
, check_regions
);
4360 case lang_object_symbols_statement_enum
:
4361 link_info
.create_object_symbols_section
=
4362 output_section_statement
->bfd_section
;
4365 case lang_output_statement_enum
:
4366 case lang_target_statement_enum
:
4369 case lang_input_section_enum
:
4373 i
= (*prev
)->input_section
.section
;
4378 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4379 einfo (_("%P%F: can't relax section: %E\n"));
4383 dot
= size_input_section (prev
, output_section_statement
,
4384 output_section_statement
->fill
, dot
);
4388 case lang_input_statement_enum
:
4391 case lang_fill_statement_enum
:
4392 s
->fill_statement
.output_section
=
4393 output_section_statement
->bfd_section
;
4395 fill
= s
->fill_statement
.fill
;
4398 case lang_assignment_statement_enum
:
4400 bfd_vma newdot
= dot
;
4402 exp_fold_tree (s
->assignment_statement
.exp
,
4403 output_section_statement
->bfd_section
,
4406 if (newdot
!= dot
&& !output_section_statement
->ignored
)
4408 if (output_section_statement
== abs_output_section
)
4410 /* If we don't have an output section, then just adjust
4411 the default memory address. */
4412 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4413 FALSE
)->current
= newdot
;
4417 /* Insert a pad after this statement. We can't
4418 put the pad before when relaxing, in case the
4419 assignment references dot. */
4420 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4421 output_section_statement
->bfd_section
, dot
);
4423 /* Don't neuter the pad below when relaxing. */
4426 /* If dot is advanced, this implies that the section
4427 should have space allocated to it, unless the
4428 user has explicitly stated that the section
4429 should never be loaded. */
4430 if (!(output_section_statement
->flags
4431 & (SEC_NEVER_LOAD
| SEC_ALLOC
)))
4432 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4439 case lang_padding_statement_enum
:
4440 /* If this is the first time lang_size_sections is called,
4441 we won't have any padding statements. If this is the
4442 second or later passes when relaxing, we should allow
4443 padding to shrink. If padding is needed on this pass, it
4444 will be added back in. */
4445 s
->padding_statement
.size
= 0;
4447 /* Make sure output_offset is valid. If relaxation shrinks
4448 the section and this pad isn't needed, it's possible to
4449 have output_offset larger than the final size of the
4450 section. bfd_set_section_contents will complain even for
4451 a pad size of zero. */
4452 s
->padding_statement
.output_offset
4453 = dot
- output_section_statement
->bfd_section
->vma
;
4456 case lang_group_statement_enum
:
4457 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4458 output_section_statement
,
4459 &s
->group_statement
.children
.head
,
4460 fill
, dot
, relax
, check_regions
);
4467 /* We can only get here when relaxing is turned on. */
4468 case lang_address_statement_enum
:
4471 prev
= &s
->header
.next
;
4477 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
4479 lang_statement_iteration
++;
4480 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
4481 &statement_list
.head
, 0, 0, relax
, check_regions
);
4485 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
4487 expld
.phase
= lang_allocating_phase_enum
;
4488 expld
.dataseg
.phase
= exp_dataseg_none
;
4490 one_lang_size_sections_pass (relax
, check_regions
);
4491 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
4492 && link_info
.relro
&& expld
.dataseg
.relro_end
)
4494 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4495 to put expld.dataseg.relro on a (common) page boundary. */
4496 bfd_vma old_min_base
, relro_end
, maxpage
;
4498 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
4499 old_min_base
= expld
.dataseg
.min_base
;
4500 maxpage
= expld
.dataseg
.maxpagesize
;
4501 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
4502 & (expld
.dataseg
.pagesize
- 1));
4503 /* Compute the expected PT_GNU_RELRO segment end. */
4504 relro_end
= (expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
4505 & ~(expld
.dataseg
.pagesize
- 1);
4506 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
4508 expld
.dataseg
.base
-= maxpage
;
4509 relro_end
-= maxpage
;
4511 one_lang_size_sections_pass (relax
, check_regions
);
4512 if (expld
.dataseg
.relro_end
> relro_end
)
4514 /* The alignment of sections between DATA_SEGMENT_ALIGN
4515 and DATA_SEGMENT_RELRO_END caused huge padding to be
4516 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4518 unsigned int max_alignment_power
= 0;
4520 /* Find maximum alignment power of sections between
4521 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4522 for (sec
= output_bfd
->sections
; sec
; sec
= sec
->next
)
4523 if (sec
->vma
>= expld
.dataseg
.base
4524 && sec
->vma
< expld
.dataseg
.relro_end
4525 && sec
->alignment_power
> max_alignment_power
)
4526 max_alignment_power
= sec
->alignment_power
;
4528 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
4530 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
4532 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
4533 expld
.dataseg
.base
-= (1 << max_alignment_power
);
4534 one_lang_size_sections_pass (relax
, check_regions
);
4537 link_info
.relro_start
= expld
.dataseg
.base
;
4538 link_info
.relro_end
= expld
.dataseg
.relro_end
;
4540 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
4542 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4543 a page could be saved in the data segment. */
4544 bfd_vma first
, last
;
4546 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
4547 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
4549 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
4550 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
4551 && first
+ last
<= expld
.dataseg
.pagesize
)
4553 expld
.dataseg
.phase
= exp_dataseg_adjust
;
4554 one_lang_size_sections_pass (relax
, check_regions
);
4558 expld
.phase
= lang_final_phase_enum
;
4561 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4564 lang_do_assignments_1
4565 (lang_statement_union_type
*s
,
4566 lang_output_section_statement_type
*output_section_statement
,
4570 for (; s
!= NULL
; s
= s
->header
.next
)
4572 switch (s
->header
.type
)
4574 case lang_constructors_statement_enum
:
4575 dot
= lang_do_assignments_1 (constructor_list
.head
,
4576 output_section_statement
,
4581 case lang_output_section_statement_enum
:
4583 lang_output_section_statement_type
*os
;
4585 os
= &(s
->output_section_statement
);
4586 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
4588 dot
= os
->bfd_section
->vma
;
4589 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
4590 /* .tbss sections effectively have zero size. */
4591 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4592 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4593 || link_info
.relocatable
)
4594 dot
+= TO_ADDR (os
->bfd_section
->size
);
4598 /* If nothing has been placed into the output section then
4599 it won't have a bfd_section. */
4600 if (os
->bfd_section
&& !os
->ignored
)
4602 os
->bfd_section
->lma
4603 = exp_get_abs_int (os
->load_base
, 0, "load base");
4609 case lang_wild_statement_enum
:
4611 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
4612 output_section_statement
,
4616 case lang_object_symbols_statement_enum
:
4617 case lang_output_statement_enum
:
4618 case lang_target_statement_enum
:
4621 case lang_data_statement_enum
:
4622 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4623 if (expld
.result
.valid_p
)
4624 s
->data_statement
.value
= (expld
.result
.value
4625 + expld
.result
.section
->vma
);
4627 einfo (_("%F%P: invalid data statement\n"));
4630 switch (s
->data_statement
.type
)
4648 if (size
< TO_SIZE ((unsigned) 1))
4649 size
= TO_SIZE ((unsigned) 1);
4650 dot
+= TO_ADDR (size
);
4654 case lang_reloc_statement_enum
:
4655 exp_fold_tree (s
->reloc_statement
.addend_exp
,
4656 bfd_abs_section_ptr
, &dot
);
4657 if (expld
.result
.valid_p
)
4658 s
->reloc_statement
.addend_value
= expld
.result
.value
;
4660 einfo (_("%F%P: invalid reloc statement\n"));
4661 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
4664 case lang_input_section_enum
:
4666 asection
*in
= s
->input_section
.section
;
4668 if ((in
->flags
& SEC_EXCLUDE
) == 0)
4669 dot
+= TO_ADDR (in
->size
);
4673 case lang_input_statement_enum
:
4676 case lang_fill_statement_enum
:
4677 fill
= s
->fill_statement
.fill
;
4680 case lang_assignment_statement_enum
:
4681 exp_fold_tree (s
->assignment_statement
.exp
,
4682 output_section_statement
->bfd_section
,
4686 case lang_padding_statement_enum
:
4687 dot
+= TO_ADDR (s
->padding_statement
.size
);
4690 case lang_group_statement_enum
:
4691 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
4692 output_section_statement
,
4700 case lang_address_statement_enum
:
4708 lang_do_assignments (void)
4710 lang_statement_iteration
++;
4711 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
4714 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4715 operator .startof. (section_name), it produces an undefined symbol
4716 .startof.section_name. Similarly, when it sees
4717 .sizeof. (section_name), it produces an undefined symbol
4718 .sizeof.section_name. For all the output sections, we look for
4719 such symbols, and set them to the correct value. */
4722 lang_set_startof (void)
4726 if (link_info
.relocatable
)
4729 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4731 const char *secname
;
4733 struct bfd_link_hash_entry
*h
;
4735 secname
= bfd_get_section_name (output_bfd
, s
);
4736 buf
= xmalloc (10 + strlen (secname
));
4738 sprintf (buf
, ".startof.%s", secname
);
4739 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4740 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4742 h
->type
= bfd_link_hash_defined
;
4743 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, s
);
4744 h
->u
.def
.section
= bfd_abs_section_ptr
;
4747 sprintf (buf
, ".sizeof.%s", secname
);
4748 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4749 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4751 h
->type
= bfd_link_hash_defined
;
4752 h
->u
.def
.value
= TO_ADDR (s
->size
);
4753 h
->u
.def
.section
= bfd_abs_section_ptr
;
4763 struct bfd_link_hash_entry
*h
;
4766 if (link_info
.relocatable
|| link_info
.shared
)
4771 if (entry_symbol
.name
== NULL
)
4773 /* No entry has been specified. Look for the default entry, but
4774 don't warn if we don't find it. */
4775 entry_symbol
.name
= entry_symbol_default
;
4779 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
4780 FALSE
, FALSE
, TRUE
);
4782 && (h
->type
== bfd_link_hash_defined
4783 || h
->type
== bfd_link_hash_defweak
)
4784 && h
->u
.def
.section
->output_section
!= NULL
)
4788 val
= (h
->u
.def
.value
4789 + bfd_get_section_vma (output_bfd
,
4790 h
->u
.def
.section
->output_section
)
4791 + h
->u
.def
.section
->output_offset
);
4792 if (! bfd_set_start_address (output_bfd
, val
))
4793 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
4800 /* We couldn't find the entry symbol. Try parsing it as a
4802 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
4805 if (! bfd_set_start_address (output_bfd
, val
))
4806 einfo (_("%P%F: can't set start address\n"));
4812 /* Can't find the entry symbol, and it's not a number. Use
4813 the first address in the text section. */
4814 ts
= bfd_get_section_by_name (output_bfd
, entry_section
);
4818 einfo (_("%P: warning: cannot find entry symbol %s;"
4819 " defaulting to %V\n"),
4821 bfd_get_section_vma (output_bfd
, ts
));
4822 if (! bfd_set_start_address (output_bfd
,
4823 bfd_get_section_vma (output_bfd
,
4825 einfo (_("%P%F: can't set start address\n"));
4830 einfo (_("%P: warning: cannot find entry symbol %s;"
4831 " not setting start address\n"),
4837 /* Don't bfd_hash_table_free (&lang_definedness_table);
4838 map file output may result in a call of lang_track_definedness. */
4841 /* This is a small function used when we want to ignore errors from
4845 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
4847 /* Don't do anything. */
4850 /* Check that the architecture of all the input files is compatible
4851 with the output file. Also call the backend to let it do any
4852 other checking that is needed. */
4857 lang_statement_union_type
*file
;
4859 const bfd_arch_info_type
*compatible
;
4861 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
4863 input_bfd
= file
->input_statement
.the_bfd
;
4865 = bfd_arch_get_compatible (input_bfd
, output_bfd
,
4866 command_line
.accept_unknown_input_arch
);
4868 /* In general it is not possible to perform a relocatable
4869 link between differing object formats when the input
4870 file has relocations, because the relocations in the
4871 input format may not have equivalent representations in
4872 the output format (and besides BFD does not translate
4873 relocs for other link purposes than a final link). */
4874 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
4875 && (compatible
== NULL
4876 || bfd_get_flavour (input_bfd
) != bfd_get_flavour (output_bfd
))
4877 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
4879 einfo (_("%P%F: Relocatable linking with relocations from"
4880 " format %s (%B) to format %s (%B) is not supported\n"),
4881 bfd_get_target (input_bfd
), input_bfd
,
4882 bfd_get_target (output_bfd
), output_bfd
);
4883 /* einfo with %F exits. */
4886 if (compatible
== NULL
)
4888 if (command_line
.warn_mismatch
)
4889 einfo (_("%P: warning: %s architecture of input file `%B'"
4890 " is incompatible with %s output\n"),
4891 bfd_printable_name (input_bfd
), input_bfd
,
4892 bfd_printable_name (output_bfd
));
4894 else if (bfd_count_sections (input_bfd
))
4896 /* If the input bfd has no contents, it shouldn't set the
4897 private data of the output bfd. */
4899 bfd_error_handler_type pfn
= NULL
;
4901 /* If we aren't supposed to warn about mismatched input
4902 files, temporarily set the BFD error handler to a
4903 function which will do nothing. We still want to call
4904 bfd_merge_private_bfd_data, since it may set up
4905 information which is needed in the output file. */
4906 if (! command_line
.warn_mismatch
)
4907 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
4908 if (! bfd_merge_private_bfd_data (input_bfd
, output_bfd
))
4910 if (command_line
.warn_mismatch
)
4911 einfo (_("%P%X: failed to merge target specific data"
4912 " of file %B\n"), input_bfd
);
4914 if (! command_line
.warn_mismatch
)
4915 bfd_set_error_handler (pfn
);
4920 /* Look through all the global common symbols and attach them to the
4921 correct section. The -sort-common command line switch may be used
4922 to roughly sort the entries by size. */
4927 if (command_line
.inhibit_common_definition
)
4929 if (link_info
.relocatable
4930 && ! command_line
.force_common_definition
)
4933 if (! config
.sort_common
)
4934 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
4939 for (power
= 4; power
>= 0; power
--)
4940 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
4944 /* Place one common symbol in the correct section. */
4947 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
4949 unsigned int power_of_two
;
4953 if (h
->type
!= bfd_link_hash_common
)
4957 power_of_two
= h
->u
.c
.p
->alignment_power
;
4959 if (config
.sort_common
4960 && power_of_two
< (unsigned int) *(int *) info
)
4963 section
= h
->u
.c
.p
->section
;
4965 /* Increase the size of the section to align the common sym. */
4966 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
4967 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
4969 /* Adjust the alignment if necessary. */
4970 if (power_of_two
> section
->alignment_power
)
4971 section
->alignment_power
= power_of_two
;
4973 /* Change the symbol from common to defined. */
4974 h
->type
= bfd_link_hash_defined
;
4975 h
->u
.def
.section
= section
;
4976 h
->u
.def
.value
= section
->size
;
4978 /* Increase the size of the section. */
4979 section
->size
+= size
;
4981 /* Make sure the section is allocated in memory, and make sure that
4982 it is no longer a common section. */
4983 section
->flags
|= SEC_ALLOC
;
4984 section
->flags
&= ~SEC_IS_COMMON
;
4986 if (config
.map_file
!= NULL
)
4988 static bfd_boolean header_printed
;
4993 if (! header_printed
)
4995 minfo (_("\nAllocating common symbols\n"));
4996 minfo (_("Common symbol size file\n\n"));
4997 header_printed
= TRUE
;
5000 name
= demangle (h
->root
.string
);
5002 len
= strlen (name
);
5017 if (size
<= 0xffffffff)
5018 sprintf (buf
, "%lx", (unsigned long) size
);
5020 sprintf_vma (buf
, size
);
5030 minfo ("%B\n", section
->owner
);
5036 /* Run through the input files and ensure that every input section has
5037 somewhere to go. If one is found without a destination then create
5038 an input request and place it into the statement tree. */
5041 lang_place_orphans (void)
5043 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5047 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5049 if (s
->output_section
== NULL
)
5051 /* This section of the file is not attached, root
5052 around for a sensible place for it to go. */
5054 if (file
->just_syms_flag
)
5055 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5056 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5057 s
->output_section
= bfd_abs_section_ptr
;
5058 else if (strcmp (s
->name
, "COMMON") == 0)
5060 /* This is a lonely common section which must have
5061 come from an archive. We attach to the section
5062 with the wildcard. */
5063 if (! link_info
.relocatable
5064 || command_line
.force_common_definition
)
5066 if (default_common_section
== NULL
)
5068 default_common_section
=
5069 lang_output_section_statement_lookup (".bss");
5072 lang_add_section (&default_common_section
->children
, s
,
5073 default_common_section
);
5076 else if (ldemul_place_orphan (s
))
5080 lang_output_section_statement_type
*os
;
5082 os
= lang_output_section_statement_lookup (s
->name
);
5083 lang_add_section (&os
->children
, s
, os
);
5091 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5093 flagword
*ptr_flags
;
5095 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5101 *ptr_flags
|= SEC_ALLOC
;
5105 *ptr_flags
|= SEC_READONLY
;
5109 *ptr_flags
|= SEC_DATA
;
5113 *ptr_flags
|= SEC_CODE
;
5118 *ptr_flags
|= SEC_LOAD
;
5122 einfo (_("%P%F: invalid syntax in flags\n"));
5129 /* Call a function on each input file. This function will be called
5130 on an archive, but not on the elements. */
5133 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5135 lang_input_statement_type
*f
;
5137 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5139 f
= (lang_input_statement_type
*) f
->next_real_file
)
5143 /* Call a function on each file. The function will be called on all
5144 the elements of an archive which are included in the link, but will
5145 not be called on the archive file itself. */
5148 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5150 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5157 ldlang_add_file (lang_input_statement_type
*entry
)
5161 lang_statement_append (&file_chain
,
5162 (lang_statement_union_type
*) entry
,
5165 /* The BFD linker needs to have a list of all input BFDs involved in
5167 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5168 ASSERT (entry
->the_bfd
!= output_bfd
);
5169 for (pp
= &link_info
.input_bfds
; *pp
!= NULL
; pp
= &(*pp
)->link_next
)
5171 *pp
= entry
->the_bfd
;
5172 entry
->the_bfd
->usrdata
= entry
;
5173 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5175 /* Look through the sections and check for any which should not be
5176 included in the link. We need to do this now, so that we can
5177 notice when the backend linker tries to report multiple
5178 definition errors for symbols which are in sections we aren't
5179 going to link. FIXME: It might be better to entirely ignore
5180 symbols which are defined in sections which are going to be
5181 discarded. This would require modifying the backend linker for
5182 each backend which might set the SEC_LINK_ONCE flag. If we do
5183 this, we should probably handle SEC_EXCLUDE in the same way. */
5185 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5189 lang_add_output (const char *name
, int from_script
)
5191 /* Make -o on command line override OUTPUT in script. */
5192 if (!had_output_filename
|| !from_script
)
5194 output_filename
= name
;
5195 had_output_filename
= TRUE
;
5199 static lang_output_section_statement_type
*current_section
;
5210 for (l
= 0; l
< 32; l
++)
5212 if (i
>= (unsigned int) x
)
5220 lang_output_section_statement_type
*
5221 lang_enter_output_section_statement (const char *output_section_statement_name
,
5222 etree_type
*address_exp
,
5223 enum section_type sectype
,
5225 etree_type
*subalign
,
5229 lang_output_section_statement_type
*os
;
5231 os
= lang_output_section_statement_lookup_1 (output_section_statement_name
,
5233 current_section
= os
;
5235 /* Make next things chain into subchain of this. */
5237 if (os
->addr_tree
== NULL
)
5239 os
->addr_tree
= address_exp
;
5241 os
->sectype
= sectype
;
5242 if (sectype
!= noload_section
)
5243 os
->flags
= SEC_NO_FLAGS
;
5245 os
->flags
= SEC_NEVER_LOAD
;
5246 os
->block_value
= 1;
5247 stat_ptr
= &os
->children
;
5249 os
->subsection_alignment
=
5250 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5251 os
->section_alignment
=
5252 topower (exp_get_value_int (align
, -1, "section alignment"));
5254 os
->load_base
= ebase
;
5261 lang_output_statement_type
*new;
5263 new = new_stat (lang_output_statement
, stat_ptr
);
5264 new->name
= output_filename
;
5267 /* Reset the current counters in the regions. */
5270 lang_reset_memory_regions (void)
5272 lang_memory_region_type
*p
= lang_memory_region_list
;
5274 lang_output_section_statement_type
*os
;
5276 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5278 p
->old_length
= (bfd_size_type
) (p
->current
- p
->origin
);
5279 p
->current
= p
->origin
;
5282 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5285 os
->processed
= FALSE
;
5287 for (o
= output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5289 /* Save the last size for possible use by bfd_relax_section. */
5290 o
->rawsize
= o
->size
;
5295 /* Worker for lang_gc_sections_1. */
5298 gc_section_callback (lang_wild_statement_type
*ptr
,
5299 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5301 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5302 void *data ATTRIBUTE_UNUSED
)
5304 /* If the wild pattern was marked KEEP, the member sections
5305 should be as well. */
5306 if (ptr
->keep_sections
)
5307 section
->flags
|= SEC_KEEP
;
5310 /* Iterate over sections marking them against GC. */
5313 lang_gc_sections_1 (lang_statement_union_type
*s
)
5315 for (; s
!= NULL
; s
= s
->header
.next
)
5317 switch (s
->header
.type
)
5319 case lang_wild_statement_enum
:
5320 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5322 case lang_constructors_statement_enum
:
5323 lang_gc_sections_1 (constructor_list
.head
);
5325 case lang_output_section_statement_enum
:
5326 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5328 case lang_group_statement_enum
:
5329 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5338 lang_gc_sections (void)
5340 struct bfd_link_hash_entry
*h
;
5341 ldlang_undef_chain_list_type
*ulist
;
5343 /* Keep all sections so marked in the link script. */
5345 lang_gc_sections_1 (statement_list
.head
);
5347 /* Keep all sections containing symbols undefined on the command-line,
5348 and the section containing the entry symbol. */
5350 for (ulist
= link_info
.gc_sym_list
; ulist
; ulist
= ulist
->next
)
5352 h
= bfd_link_hash_lookup (link_info
.hash
, ulist
->name
,
5353 FALSE
, FALSE
, FALSE
);
5356 && (h
->type
== bfd_link_hash_defined
5357 || h
->type
== bfd_link_hash_defweak
)
5358 && ! bfd_is_abs_section (h
->u
.def
.section
))
5360 h
->u
.def
.section
->flags
|= SEC_KEEP
;
5364 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5365 the special case of debug info. (See bfd/stabs.c)
5366 Twiddle the flag here, to simplify later linker code. */
5367 if (link_info
.relocatable
)
5369 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5372 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5373 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5374 sec
->flags
&= ~SEC_EXCLUDE
;
5378 if (link_info
.gc_sections
)
5379 bfd_gc_sections (output_bfd
, &link_info
);
5385 current_target
= default_target
;
5387 /* Open the output file. */
5388 lang_for_each_statement (ldlang_open_output
);
5391 ldemul_create_output_section_statements ();
5393 /* Add to the hash table all undefineds on the command line. */
5394 lang_place_undefineds ();
5396 if (!bfd_section_already_linked_table_init ())
5397 einfo (_("%P%F: Failed to create hash table\n"));
5399 /* Create a bfd for each input file. */
5400 current_target
= default_target
;
5401 open_input_bfds (statement_list
.head
, FALSE
);
5403 link_info
.gc_sym_list
= &entry_symbol
;
5404 if (entry_symbol
.name
== NULL
)
5405 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
5407 ldemul_after_open ();
5409 bfd_section_already_linked_table_free ();
5411 /* Make sure that we're not mixing architectures. We call this
5412 after all the input files have been opened, but before we do any
5413 other processing, so that any operations merge_private_bfd_data
5414 does on the output file will be known during the rest of the
5418 /* Handle .exports instead of a version script if we're told to do so. */
5419 if (command_line
.version_exports_section
)
5420 lang_do_version_exports_section ();
5422 /* Build all sets based on the information gathered from the input
5424 ldctor_build_sets ();
5426 /* Remove unreferenced sections if asked to. */
5427 lang_gc_sections ();
5429 /* Size up the common data. */
5432 /* Update wild statements. */
5433 update_wild_statements (statement_list
.head
);
5435 /* Run through the contours of the script and attach input sections
5436 to the correct output sections. */
5437 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
5439 /* Find any sections not attached explicitly and handle them. */
5440 lang_place_orphans ();
5442 if (! link_info
.relocatable
)
5446 /* Merge SEC_MERGE sections. This has to be done after GC of
5447 sections, so that GCed sections are not merged, but before
5448 assigning dynamic symbols, since removing whole input sections
5450 bfd_merge_sections (output_bfd
, &link_info
);
5452 /* Look for a text section and set the readonly attribute in it. */
5453 found
= bfd_get_section_by_name (output_bfd
, ".text");
5457 if (config
.text_read_only
)
5458 found
->flags
|= SEC_READONLY
;
5460 found
->flags
&= ~SEC_READONLY
;
5464 /* Do anything special before sizing sections. This is where ELF
5465 and other back-ends size dynamic sections. */
5466 ldemul_before_allocation ();
5468 /* We must record the program headers before we try to fix the
5469 section positions, since they will affect SIZEOF_HEADERS. */
5470 lang_record_phdrs ();
5472 /* Size up the sections. */
5473 lang_size_sections (NULL
, !command_line
.relax
);
5475 /* Now run around and relax if we can. */
5476 if (command_line
.relax
)
5478 /* Keep relaxing until bfd_relax_section gives up. */
5479 bfd_boolean relax_again
;
5483 relax_again
= FALSE
;
5485 /* Note: pe-dll.c does something like this also. If you find
5486 you need to change this code, you probably need to change
5487 pe-dll.c also. DJ */
5489 /* Do all the assignments with our current guesses as to
5491 lang_do_assignments ();
5493 /* We must do this after lang_do_assignments, because it uses
5495 lang_reset_memory_regions ();
5497 /* Perform another relax pass - this time we know where the
5498 globals are, so can make a better guess. */
5499 lang_size_sections (&relax_again
, FALSE
);
5501 /* If the normal relax is done and the relax finalize pass
5502 is not performed yet, we perform another relax pass. */
5503 if (!relax_again
&& link_info
.need_relax_finalize
)
5505 link_info
.need_relax_finalize
= FALSE
;
5509 while (relax_again
);
5511 /* Final extra sizing to report errors. */
5512 lang_do_assignments ();
5513 lang_reset_memory_regions ();
5514 lang_size_sections (NULL
, TRUE
);
5517 /* See if anything special should be done now we know how big
5519 ldemul_after_allocation ();
5521 /* Fix any .startof. or .sizeof. symbols. */
5522 lang_set_startof ();
5524 /* Do all the assignments, now that we know the final resting places
5525 of all the symbols. */
5527 lang_do_assignments ();
5529 /* Make sure that the section addresses make sense. */
5530 if (! link_info
.relocatable
5531 && command_line
.check_section_addresses
)
5532 lang_check_section_addresses ();
5539 /* EXPORTED TO YACC */
5542 lang_add_wild (struct wildcard_spec
*filespec
,
5543 struct wildcard_list
*section_list
,
5544 bfd_boolean keep_sections
)
5546 struct wildcard_list
*curr
, *next
;
5547 lang_wild_statement_type
*new;
5549 /* Reverse the list as the parser puts it back to front. */
5550 for (curr
= section_list
, section_list
= NULL
;
5552 section_list
= curr
, curr
= next
)
5554 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
5555 placed_commons
= TRUE
;
5558 curr
->next
= section_list
;
5561 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
5563 if (strcmp (filespec
->name
, "*") == 0)
5564 filespec
->name
= NULL
;
5565 else if (! wildcardp (filespec
->name
))
5566 lang_has_input_file
= TRUE
;
5569 new = new_stat (lang_wild_statement
, stat_ptr
);
5570 new->filename
= NULL
;
5571 new->filenames_sorted
= FALSE
;
5572 if (filespec
!= NULL
)
5574 new->filename
= filespec
->name
;
5575 new->filenames_sorted
= filespec
->sorted
== by_name
;
5577 new->section_list
= section_list
;
5578 new->keep_sections
= keep_sections
;
5579 lang_list_init (&new->children
);
5580 analyze_walk_wild_section_handler (new);
5584 lang_section_start (const char *name
, etree_type
*address
,
5585 const segment_type
*segment
)
5587 lang_address_statement_type
*ad
;
5589 ad
= new_stat (lang_address_statement
, stat_ptr
);
5590 ad
->section_name
= name
;
5591 ad
->address
= address
;
5592 ad
->segment
= segment
;
5595 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5596 because of a -e argument on the command line, or zero if this is
5597 called by ENTRY in a linker script. Command line arguments take
5601 lang_add_entry (const char *name
, bfd_boolean cmdline
)
5603 if (entry_symbol
.name
== NULL
5605 || ! entry_from_cmdline
)
5607 entry_symbol
.name
= name
;
5608 entry_from_cmdline
= cmdline
;
5612 /* Set the default start symbol to NAME. .em files should use this,
5613 not lang_add_entry, to override the use of "start" if neither the
5614 linker script nor the command line specifies an entry point. NAME
5615 must be permanently allocated. */
5617 lang_default_entry (const char *name
)
5619 entry_symbol_default
= name
;
5623 lang_add_target (const char *name
)
5625 lang_target_statement_type
*new;
5627 new = new_stat (lang_target_statement
, stat_ptr
);
5632 lang_add_map (const char *name
)
5639 map_option_f
= TRUE
;
5647 lang_add_fill (fill_type
*fill
)
5649 lang_fill_statement_type
*new;
5651 new = new_stat (lang_fill_statement
, stat_ptr
);
5656 lang_add_data (int type
, union etree_union
*exp
)
5658 lang_data_statement_type
*new;
5660 new = new_stat (lang_data_statement
, stat_ptr
);
5665 /* Create a new reloc statement. RELOC is the BFD relocation type to
5666 generate. HOWTO is the corresponding howto structure (we could
5667 look this up, but the caller has already done so). SECTION is the
5668 section to generate a reloc against, or NAME is the name of the
5669 symbol to generate a reloc against. Exactly one of SECTION and
5670 NAME must be NULL. ADDEND is an expression for the addend. */
5673 lang_add_reloc (bfd_reloc_code_real_type reloc
,
5674 reloc_howto_type
*howto
,
5677 union etree_union
*addend
)
5679 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
5683 p
->section
= section
;
5685 p
->addend_exp
= addend
;
5687 p
->addend_value
= 0;
5688 p
->output_section
= NULL
;
5689 p
->output_offset
= 0;
5692 lang_assignment_statement_type
*
5693 lang_add_assignment (etree_type
*exp
)
5695 lang_assignment_statement_type
*new;
5697 new = new_stat (lang_assignment_statement
, stat_ptr
);
5703 lang_add_attribute (enum statement_enum attribute
)
5705 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
5709 lang_startup (const char *name
)
5711 if (startup_file
!= NULL
)
5713 einfo (_("%P%F: multiple STARTUP files\n"));
5715 first_file
->filename
= name
;
5716 first_file
->local_sym_name
= name
;
5717 first_file
->real
= TRUE
;
5719 startup_file
= name
;
5723 lang_float (bfd_boolean maybe
)
5725 lang_float_flag
= maybe
;
5729 /* Work out the load- and run-time regions from a script statement, and
5730 store them in *LMA_REGION and *REGION respectively.
5732 MEMSPEC is the name of the run-time region, or the value of
5733 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5734 LMA_MEMSPEC is the name of the load-time region, or null if the
5735 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5736 had an explicit load address.
5738 It is an error to specify both a load region and a load address. */
5741 lang_get_regions (lang_memory_region_type
**region
,
5742 lang_memory_region_type
**lma_region
,
5743 const char *memspec
,
5744 const char *lma_memspec
,
5745 bfd_boolean have_lma
,
5746 bfd_boolean have_vma
)
5748 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
5750 /* If no runtime region or VMA has been specified, but the load region
5751 has been specified, then use the load region for the runtime region
5753 if (lma_memspec
!= NULL
5755 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
5756 *region
= *lma_region
;
5758 *region
= lang_memory_region_lookup (memspec
, FALSE
);
5760 if (have_lma
&& lma_memspec
!= 0)
5761 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5765 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
5766 lang_output_section_phdr_list
*phdrs
,
5767 const char *lma_memspec
)
5769 lang_get_regions (¤t_section
->region
,
5770 ¤t_section
->lma_region
,
5771 memspec
, lma_memspec
,
5772 current_section
->load_base
!= NULL
,
5773 current_section
->addr_tree
!= NULL
);
5774 current_section
->fill
= fill
;
5775 current_section
->phdrs
= phdrs
;
5776 stat_ptr
= &statement_list
;
5779 /* Create an absolute symbol with the given name with the value of the
5780 address of first byte of the section named.
5782 If the symbol already exists, then do nothing. */
5785 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
5787 struct bfd_link_hash_entry
*h
;
5789 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5791 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5793 if (h
->type
== bfd_link_hash_new
5794 || h
->type
== bfd_link_hash_undefined
)
5798 h
->type
= bfd_link_hash_defined
;
5800 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5804 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, sec
);
5806 h
->u
.def
.section
= bfd_abs_section_ptr
;
5810 /* Create an absolute symbol with the given name with the value of the
5811 address of the first byte after the end of the section named.
5813 If the symbol already exists, then do nothing. */
5816 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
5818 struct bfd_link_hash_entry
*h
;
5820 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5822 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5824 if (h
->type
== bfd_link_hash_new
5825 || h
->type
== bfd_link_hash_undefined
)
5829 h
->type
= bfd_link_hash_defined
;
5831 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5835 h
->u
.def
.value
= (bfd_get_section_vma (output_bfd
, sec
)
5836 + TO_ADDR (sec
->size
));
5838 h
->u
.def
.section
= bfd_abs_section_ptr
;
5843 lang_statement_append (lang_statement_list_type
*list
,
5844 lang_statement_union_type
*element
,
5845 lang_statement_union_type
**field
)
5847 *(list
->tail
) = element
;
5851 /* Set the output format type. -oformat overrides scripts. */
5854 lang_add_output_format (const char *format
,
5859 if (output_target
== NULL
|| !from_script
)
5861 if (command_line
.endian
== ENDIAN_BIG
5864 else if (command_line
.endian
== ENDIAN_LITTLE
5868 output_target
= format
;
5872 /* Enter a group. This creates a new lang_group_statement, and sets
5873 stat_ptr to build new statements within the group. */
5876 lang_enter_group (void)
5878 lang_group_statement_type
*g
;
5880 g
= new_stat (lang_group_statement
, stat_ptr
);
5881 lang_list_init (&g
->children
);
5882 stat_ptr
= &g
->children
;
5885 /* Leave a group. This just resets stat_ptr to start writing to the
5886 regular list of statements again. Note that this will not work if
5887 groups can occur inside anything else which can adjust stat_ptr,
5888 but currently they can't. */
5891 lang_leave_group (void)
5893 stat_ptr
= &statement_list
;
5896 /* Add a new program header. This is called for each entry in a PHDRS
5897 command in a linker script. */
5900 lang_new_phdr (const char *name
,
5902 bfd_boolean filehdr
,
5907 struct lang_phdr
*n
, **pp
;
5909 n
= stat_alloc (sizeof (struct lang_phdr
));
5912 n
->type
= exp_get_value_int (type
, 0, "program header type");
5913 n
->filehdr
= filehdr
;
5918 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
5923 /* Record the program header information in the output BFD. FIXME: We
5924 should not be calling an ELF specific function here. */
5927 lang_record_phdrs (void)
5931 lang_output_section_phdr_list
*last
;
5932 struct lang_phdr
*l
;
5933 lang_output_section_statement_type
*os
;
5936 secs
= xmalloc (alc
* sizeof (asection
*));
5938 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
5945 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5949 lang_output_section_phdr_list
*pl
;
5951 if (os
->constraint
== -1)
5959 if (os
->sectype
== noload_section
5960 || os
->bfd_section
== NULL
5961 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
5966 if (os
->bfd_section
== NULL
)
5969 for (; pl
!= NULL
; pl
= pl
->next
)
5971 if (strcmp (pl
->name
, l
->name
) == 0)
5976 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
5978 secs
[c
] = os
->bfd_section
;
5985 if (l
->flags
== NULL
)
5988 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
5993 at
= exp_get_vma (l
->at
, 0, "phdr load address");
5995 if (! bfd_record_phdr (output_bfd
, l
->type
,
5996 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
5997 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
5998 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6003 /* Make sure all the phdr assignments succeeded. */
6004 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6008 lang_output_section_phdr_list
*pl
;
6010 if (os
->constraint
== -1
6011 || os
->bfd_section
== NULL
)
6014 for (pl
= os
->phdrs
;
6017 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6018 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6019 os
->name
, pl
->name
);
6023 /* Record a list of sections which may not be cross referenced. */
6026 lang_add_nocrossref (lang_nocrossref_type
*l
)
6028 struct lang_nocrossrefs
*n
;
6030 n
= xmalloc (sizeof *n
);
6031 n
->next
= nocrossref_list
;
6033 nocrossref_list
= n
;
6035 /* Set notice_all so that we get informed about all symbols. */
6036 link_info
.notice_all
= TRUE
;
6039 /* Overlay handling. We handle overlays with some static variables. */
6041 /* The overlay virtual address. */
6042 static etree_type
*overlay_vma
;
6043 /* And subsection alignment. */
6044 static etree_type
*overlay_subalign
;
6046 /* An expression for the maximum section size seen so far. */
6047 static etree_type
*overlay_max
;
6049 /* A list of all the sections in this overlay. */
6051 struct overlay_list
{
6052 struct overlay_list
*next
;
6053 lang_output_section_statement_type
*os
;
6056 static struct overlay_list
*overlay_list
;
6058 /* Start handling an overlay. */
6061 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6063 /* The grammar should prevent nested overlays from occurring. */
6064 ASSERT (overlay_vma
== NULL
6065 && overlay_subalign
== NULL
6066 && overlay_max
== NULL
);
6068 overlay_vma
= vma_expr
;
6069 overlay_subalign
= subalign
;
6072 /* Start a section in an overlay. We handle this by calling
6073 lang_enter_output_section_statement with the correct VMA.
6074 lang_leave_overlay sets up the LMA and memory regions. */
6077 lang_enter_overlay_section (const char *name
)
6079 struct overlay_list
*n
;
6082 lang_enter_output_section_statement (name
, overlay_vma
, normal_section
,
6083 0, overlay_subalign
, 0, 0);
6085 /* If this is the first section, then base the VMA of future
6086 sections on this one. This will work correctly even if `.' is
6087 used in the addresses. */
6088 if (overlay_list
== NULL
)
6089 overlay_vma
= exp_nameop (ADDR
, name
);
6091 /* Remember the section. */
6092 n
= xmalloc (sizeof *n
);
6093 n
->os
= current_section
;
6094 n
->next
= overlay_list
;
6097 size
= exp_nameop (SIZEOF
, name
);
6099 /* Arrange to work out the maximum section end address. */
6100 if (overlay_max
== NULL
)
6103 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6106 /* Finish a section in an overlay. There isn't any special to do
6110 lang_leave_overlay_section (fill_type
*fill
,
6111 lang_output_section_phdr_list
*phdrs
)
6118 name
= current_section
->name
;
6120 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6121 region and that no load-time region has been specified. It doesn't
6122 really matter what we say here, since lang_leave_overlay will
6124 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6126 /* Define the magic symbols. */
6128 clean
= xmalloc (strlen (name
) + 1);
6130 for (s1
= name
; *s1
!= '\0'; s1
++)
6131 if (ISALNUM (*s1
) || *s1
== '_')
6135 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6136 sprintf (buf
, "__load_start_%s", clean
);
6137 lang_add_assignment (exp_assop ('=', buf
,
6138 exp_nameop (LOADADDR
, name
)));
6140 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6141 sprintf (buf
, "__load_stop_%s", clean
);
6142 lang_add_assignment (exp_assop ('=', buf
,
6144 exp_nameop (LOADADDR
, name
),
6145 exp_nameop (SIZEOF
, name
))));
6150 /* Finish an overlay. If there are any overlay wide settings, this
6151 looks through all the sections in the overlay and sets them. */
6154 lang_leave_overlay (etree_type
*lma_expr
,
6157 const char *memspec
,
6158 lang_output_section_phdr_list
*phdrs
,
6159 const char *lma_memspec
)
6161 lang_memory_region_type
*region
;
6162 lang_memory_region_type
*lma_region
;
6163 struct overlay_list
*l
;
6164 lang_nocrossref_type
*nocrossref
;
6166 lang_get_regions (®ion
, &lma_region
,
6167 memspec
, lma_memspec
,
6168 lma_expr
!= NULL
, FALSE
);
6172 /* After setting the size of the last section, set '.' to end of the
6174 if (overlay_list
!= NULL
)
6175 overlay_list
->os
->update_dot_tree
6176 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6181 struct overlay_list
*next
;
6183 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6186 l
->os
->region
= region
;
6187 l
->os
->lma_region
= lma_region
;
6189 /* The first section has the load address specified in the
6190 OVERLAY statement. The rest are worked out from that.
6191 The base address is not needed (and should be null) if
6192 an LMA region was specified. */
6194 l
->os
->load_base
= lma_expr
;
6195 else if (lma_region
== 0)
6196 l
->os
->load_base
= exp_binop ('+',
6197 exp_nameop (LOADADDR
, l
->next
->os
->name
),
6198 exp_nameop (SIZEOF
, l
->next
->os
->name
));
6200 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6201 l
->os
->phdrs
= phdrs
;
6205 lang_nocrossref_type
*nc
;
6207 nc
= xmalloc (sizeof *nc
);
6208 nc
->name
= l
->os
->name
;
6209 nc
->next
= nocrossref
;
6218 if (nocrossref
!= NULL
)
6219 lang_add_nocrossref (nocrossref
);
6222 overlay_list
= NULL
;
6226 /* Version handling. This is only useful for ELF. */
6228 /* This global variable holds the version tree that we build. */
6230 struct bfd_elf_version_tree
*lang_elf_version_info
;
6232 /* If PREV is NULL, return first version pattern matching particular symbol.
6233 If PREV is non-NULL, return first version pattern matching particular
6234 symbol after PREV (previously returned by lang_vers_match). */
6236 static struct bfd_elf_version_expr
*
6237 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6238 struct bfd_elf_version_expr
*prev
,
6241 const char *cxx_sym
= sym
;
6242 const char *java_sym
= sym
;
6243 struct bfd_elf_version_expr
*expr
= NULL
;
6245 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6247 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6251 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6253 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6258 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6260 struct bfd_elf_version_expr e
;
6262 switch (prev
? prev
->mask
: 0)
6265 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6268 expr
= htab_find (head
->htab
, &e
);
6269 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6270 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6276 case BFD_ELF_VERSION_C_TYPE
:
6277 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6280 expr
= htab_find (head
->htab
, &e
);
6281 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6282 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6288 case BFD_ELF_VERSION_CXX_TYPE
:
6289 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6291 e
.symbol
= java_sym
;
6292 expr
= htab_find (head
->htab
, &e
);
6293 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6294 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6305 /* Finally, try the wildcards. */
6306 if (prev
== NULL
|| prev
->symbol
)
6307 expr
= head
->remaining
;
6310 for (; expr
; expr
= expr
->next
)
6317 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6320 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6322 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6326 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6332 free ((char *) cxx_sym
);
6333 if (java_sym
!= sym
)
6334 free ((char *) java_sym
);
6338 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6339 return a string pointing to the symbol name. */
6342 realsymbol (const char *pattern
)
6345 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6346 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6348 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6350 /* It is a glob pattern only if there is no preceding
6352 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6360 /* Remove the preceding backslash. */
6367 backslash
= *p
== '\\';
6382 /* This is called for each variable name or match expression. NEW is
6383 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
6384 pattern to be matched against symbol names. */
6386 struct bfd_elf_version_expr
*
6387 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
6390 bfd_boolean literal_p
)
6392 struct bfd_elf_version_expr
*ret
;
6394 ret
= xmalloc (sizeof *ret
);
6396 ret
->pattern
= literal_p
? NULL
: new;
6399 ret
->symbol
= literal_p
? new : realsymbol (new);
6401 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
6402 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6403 else if (strcasecmp (lang
, "C++") == 0)
6404 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
6405 else if (strcasecmp (lang
, "Java") == 0)
6406 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
6409 einfo (_("%X%P: unknown language `%s' in version information\n"),
6411 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6414 return ldemul_new_vers_pattern (ret
);
6417 /* This is called for each set of variable names and match
6420 struct bfd_elf_version_tree
*
6421 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
6422 struct bfd_elf_version_expr
*locals
)
6424 struct bfd_elf_version_tree
*ret
;
6426 ret
= xcalloc (1, sizeof *ret
);
6427 ret
->globals
.list
= globals
;
6428 ret
->locals
.list
= locals
;
6429 ret
->match
= lang_vers_match
;
6430 ret
->name_indx
= (unsigned int) -1;
6434 /* This static variable keeps track of version indices. */
6436 static int version_index
;
6439 version_expr_head_hash (const void *p
)
6441 const struct bfd_elf_version_expr
*e
= p
;
6443 return htab_hash_string (e
->symbol
);
6447 version_expr_head_eq (const void *p1
, const void *p2
)
6449 const struct bfd_elf_version_expr
*e1
= p1
;
6450 const struct bfd_elf_version_expr
*e2
= p2
;
6452 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
6456 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
6459 struct bfd_elf_version_expr
*e
, *next
;
6460 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
6462 for (e
= head
->list
; e
; e
= e
->next
)
6466 head
->mask
|= e
->mask
;
6471 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
6472 version_expr_head_eq
, NULL
);
6473 list_loc
= &head
->list
;
6474 remaining_loc
= &head
->remaining
;
6475 for (e
= head
->list
; e
; e
= next
)
6481 remaining_loc
= &e
->next
;
6485 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
6489 struct bfd_elf_version_expr
*e1
, *last
;
6495 if (e1
->mask
== e
->mask
)
6503 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
6507 /* This is a duplicate. */
6508 /* FIXME: Memory leak. Sometimes pattern is not
6509 xmalloced alone, but in larger chunk of memory. */
6510 /* free (e->symbol); */
6515 e
->next
= last
->next
;
6523 list_loc
= &e
->next
;
6527 *remaining_loc
= NULL
;
6528 *list_loc
= head
->remaining
;
6531 head
->remaining
= head
->list
;
6534 /* This is called when we know the name and dependencies of the
6538 lang_register_vers_node (const char *name
,
6539 struct bfd_elf_version_tree
*version
,
6540 struct bfd_elf_version_deps
*deps
)
6542 struct bfd_elf_version_tree
*t
, **pp
;
6543 struct bfd_elf_version_expr
*e1
;
6548 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
6549 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
6551 einfo (_("%X%P: anonymous version tag cannot be combined"
6552 " with other version tags\n"));
6557 /* Make sure this node has a unique name. */
6558 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6559 if (strcmp (t
->name
, name
) == 0)
6560 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
6562 lang_finalize_version_expr_head (&version
->globals
);
6563 lang_finalize_version_expr_head (&version
->locals
);
6565 /* Check the global and local match names, and make sure there
6566 aren't any duplicates. */
6568 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
6570 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6572 struct bfd_elf_version_expr
*e2
;
6574 if (t
->locals
.htab
&& e1
->symbol
)
6576 e2
= htab_find (t
->locals
.htab
, e1
);
6577 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6579 if (e1
->mask
== e2
->mask
)
6580 einfo (_("%X%P: duplicate expression `%s'"
6581 " in version information\n"), e1
->symbol
);
6585 else if (!e1
->symbol
)
6586 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6587 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6588 && e1
->mask
== e2
->mask
)
6589 einfo (_("%X%P: duplicate expression `%s'"
6590 " in version information\n"), e1
->pattern
);
6594 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
6596 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6598 struct bfd_elf_version_expr
*e2
;
6600 if (t
->globals
.htab
&& e1
->symbol
)
6602 e2
= htab_find (t
->globals
.htab
, e1
);
6603 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6605 if (e1
->mask
== e2
->mask
)
6606 einfo (_("%X%P: duplicate expression `%s'"
6607 " in version information\n"),
6612 else if (!e1
->symbol
)
6613 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6614 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6615 && e1
->mask
== e2
->mask
)
6616 einfo (_("%X%P: duplicate expression `%s'"
6617 " in version information\n"), e1
->pattern
);
6621 version
->deps
= deps
;
6622 version
->name
= name
;
6623 if (name
[0] != '\0')
6626 version
->vernum
= version_index
;
6629 version
->vernum
= 0;
6631 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6636 /* This is called when we see a version dependency. */
6638 struct bfd_elf_version_deps
*
6639 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
6641 struct bfd_elf_version_deps
*ret
;
6642 struct bfd_elf_version_tree
*t
;
6644 ret
= xmalloc (sizeof *ret
);
6647 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6649 if (strcmp (t
->name
, name
) == 0)
6651 ret
->version_needed
= t
;
6656 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
6662 lang_do_version_exports_section (void)
6664 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
6666 LANG_FOR_EACH_INPUT_STATEMENT (is
)
6668 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
6676 contents
= xmalloc (len
);
6677 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
6678 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
6681 while (p
< contents
+ len
)
6683 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
6684 p
= strchr (p
, '\0') + 1;
6687 /* Do not free the contents, as we used them creating the regex. */
6689 /* Do not include this section in the link. */
6690 sec
->flags
|= SEC_EXCLUDE
;
6693 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
6694 lang_register_vers_node (command_line
.version_exports_section
,
6695 lang_new_vers_node (greg
, lreg
), NULL
);
6699 lang_add_unique (const char *name
)
6701 struct unique_sections
*ent
;
6703 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
6704 if (strcmp (ent
->name
, name
) == 0)
6707 ent
= xmalloc (sizeof *ent
);
6708 ent
->name
= xstrdup (name
);
6709 ent
->next
= unique_section_list
;
6710 unique_section_list
= ent
;