1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006
4 Free Software Foundation, Inc.
6 This file is part of GLD, the Gnu Linker.
8 GLD is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GLD is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GLD; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
25 #include "libiberty.h"
26 #include "safe-ctype.h"
45 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
48 /* Locals variables. */
49 static struct obstack stat_obstack
;
50 static struct obstack map_obstack
;
52 #define obstack_chunk_alloc xmalloc
53 #define obstack_chunk_free free
54 static const char *startup_file
;
55 static lang_statement_list_type input_file_chain
;
56 static bfd_boolean placed_commons
= FALSE
;
57 static bfd_boolean stripped_excluded_sections
= FALSE
;
58 static lang_output_section_statement_type
*default_common_section
;
59 static bfd_boolean map_option_f
;
60 static bfd_vma print_dot
;
61 static lang_input_statement_type
*first_file
;
62 static const char *current_target
;
63 static const char *output_target
;
64 static lang_statement_list_type statement_list
;
65 static struct lang_phdr
*lang_phdr_list
;
66 static struct bfd_hash_table lang_definedness_table
;
68 /* Forward declarations. */
69 static void exp_init_os (etree_type
*);
70 static void init_map_userdata (bfd
*, asection
*, void *);
71 static lang_input_statement_type
*lookup_name (const char *);
72 static bfd_boolean
load_symbols (lang_input_statement_type
*,
73 lang_statement_list_type
*);
74 static struct bfd_hash_entry
*lang_definedness_newfunc
75 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
76 static void insert_undefined (const char *);
77 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
78 static void print_statement (lang_statement_union_type
*,
79 lang_output_section_statement_type
*);
80 static void print_statement_list (lang_statement_union_type
*,
81 lang_output_section_statement_type
*);
82 static void print_statements (void);
83 static void print_input_section (asection
*);
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 /* For every output section statement added to the list, except the
916 first one, lang_output_section_statement.tail points to the "next"
917 field of the last element of the list. */
918 if (lang_output_section_statement
.head
!= NULL
)
919 ret
->os
.prev
= (lang_output_section_statement_type
*)
920 ((char *) lang_output_section_statement
.tail
921 - offsetof (lang_output_section_statement_type
, next
));
923 /* GCC's strict aliasing rules prevent us from just casting the
924 address, so we store the pointer in a variable and cast that
926 nextp
= &ret
->os
.next
;
927 lang_statement_append (&lang_output_section_statement
,
928 (lang_statement_union_type
*) &ret
->os
,
929 (lang_statement_union_type
**) nextp
);
934 output_statement_table_init (void)
936 if (!bfd_hash_table_init_n (&output_statement_table
,
937 output_statement_newfunc
,
938 sizeof (struct output_statement_hash_entry
),
940 einfo (_("%P%F: can not create hash table: %E\n"));
944 output_statement_table_free (void)
946 bfd_hash_table_free (&output_statement_table
);
949 /* Build enough state so that the parser can build its tree. */
954 obstack_begin (&stat_obstack
, 1000);
956 stat_ptr
= &statement_list
;
958 output_statement_table_init ();
960 lang_list_init (stat_ptr
);
962 lang_list_init (&input_file_chain
);
963 lang_list_init (&lang_output_section_statement
);
964 lang_list_init (&file_chain
);
965 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
968 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
970 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
972 /* The value "3" is ad-hoc, somewhat related to the expected number of
973 DEFINED expressions in a linker script. For most default linker
974 scripts, there are none. Why a hash table then? Well, it's somewhat
975 simpler to re-use working machinery than using a linked list in terms
976 of code-complexity here in ld, besides the initialization which just
977 looks like other code here. */
978 if (!bfd_hash_table_init_n (&lang_definedness_table
,
979 lang_definedness_newfunc
,
980 sizeof (struct lang_definedness_hash_entry
),
982 einfo (_("%P%F: can not create hash table: %E\n"));
988 output_statement_table_free ();
991 /*----------------------------------------------------------------------
992 A region is an area of memory declared with the
993 MEMORY { name:org=exp, len=exp ... }
996 We maintain a list of all the regions here.
998 If no regions are specified in the script, then the default is used
999 which is created when looked up to be the entire data space.
1001 If create is true we are creating a region inside a MEMORY block.
1002 In this case it is probably an error to create a region that has
1003 already been created. If we are not inside a MEMORY block it is
1004 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
1005 and so we issue a warning. */
1007 static lang_memory_region_type
*lang_memory_region_list
;
1008 static lang_memory_region_type
**lang_memory_region_list_tail
1009 = &lang_memory_region_list
;
1011 lang_memory_region_type
*
1012 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
1014 lang_memory_region_type
*p
;
1015 lang_memory_region_type
*new;
1017 /* NAME is NULL for LMA memspecs if no region was specified. */
1021 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1022 if (strcmp (p
->name
, name
) == 0)
1025 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
1030 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
1031 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
1033 new = stat_alloc (sizeof (lang_memory_region_type
));
1035 new->name
= xstrdup (name
);
1038 *lang_memory_region_list_tail
= new;
1039 lang_memory_region_list_tail
= &new->next
;
1043 new->length
= ~(bfd_size_type
) 0;
1045 new->had_full_message
= FALSE
;
1050 static lang_memory_region_type
*
1051 lang_memory_default (asection
*section
)
1053 lang_memory_region_type
*p
;
1055 flagword sec_flags
= section
->flags
;
1057 /* Override SEC_DATA to mean a writable section. */
1058 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1059 sec_flags
|= SEC_DATA
;
1061 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1063 if ((p
->flags
& sec_flags
) != 0
1064 && (p
->not_flags
& sec_flags
) == 0)
1069 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1072 lang_output_section_statement_type
*
1073 lang_output_section_find (const char *const name
)
1075 struct output_statement_hash_entry
*entry
;
1078 entry
= ((struct output_statement_hash_entry
*)
1079 bfd_hash_lookup (&output_statement_table
, name
, FALSE
, FALSE
));
1083 hash
= entry
->root
.hash
;
1086 if (entry
->os
.constraint
!= -1)
1088 entry
= (struct output_statement_hash_entry
*) entry
->root
.next
;
1090 while (entry
!= NULL
1091 && entry
->root
.hash
== hash
1092 && strcmp (name
, entry
->os
.name
) == 0);
1097 static lang_output_section_statement_type
*
1098 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1100 struct output_statement_hash_entry
*entry
;
1101 struct output_statement_hash_entry
*last_ent
;
1104 entry
= ((struct output_statement_hash_entry
*)
1105 bfd_hash_lookup (&output_statement_table
, name
, TRUE
, FALSE
));
1108 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1112 if (entry
->os
.name
!= NULL
)
1114 /* We have a section of this name, but it might not have the correct
1116 hash
= entry
->root
.hash
;
1119 if (entry
->os
.constraint
!= -1
1121 || (constraint
== entry
->os
.constraint
1122 && constraint
!= SPECIAL
)))
1125 entry
= (struct output_statement_hash_entry
*) entry
->root
.next
;
1127 while (entry
!= NULL
1128 && entry
->root
.hash
== hash
1129 && strcmp (name
, entry
->os
.name
) == 0);
1131 entry
= ((struct output_statement_hash_entry
*)
1132 output_statement_newfunc (NULL
, &output_statement_table
, name
));
1135 einfo (_("%P%F: failed creating section `%s': %E\n"), name
);
1138 entry
->root
= last_ent
->root
;
1139 last_ent
->root
.next
= &entry
->root
;
1142 entry
->os
.name
= name
;
1143 entry
->os
.constraint
= constraint
;
1147 lang_output_section_statement_type
*
1148 lang_output_section_statement_lookup (const char *const name
)
1150 return lang_output_section_statement_lookup_1 (name
, 0);
1153 /* A variant of lang_output_section_find used by place_orphan.
1154 Returns the output statement that should precede a new output
1155 statement for SEC. If an exact match is found on certain flags,
1158 lang_output_section_statement_type
*
1159 lang_output_section_find_by_flags (const asection
*sec
,
1160 lang_output_section_statement_type
**exact
,
1161 lang_match_sec_type_func match_type
)
1163 lang_output_section_statement_type
*first
, *look
, *found
;
1166 /* We know the first statement on this list is *ABS*. May as well
1168 first
= &lang_output_section_statement
.head
->output_section_statement
;
1169 first
= first
->next
;
1171 /* First try for an exact match. */
1173 for (look
= first
; look
; look
= look
->next
)
1175 flags
= look
->flags
;
1176 if (look
->bfd_section
!= NULL
)
1178 flags
= look
->bfd_section
->flags
;
1179 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1183 flags
^= sec
->flags
;
1184 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1185 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1195 if (sec
->flags
& SEC_CODE
)
1197 /* Try for a rw code section. */
1198 for (look
= first
; look
; look
= look
->next
)
1200 flags
= look
->flags
;
1201 if (look
->bfd_section
!= NULL
)
1203 flags
= look
->bfd_section
->flags
;
1204 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1208 flags
^= sec
->flags
;
1209 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1210 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1214 else if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1216 /* .rodata can go after .text, .sdata2 after .rodata. */
1217 for (look
= first
; look
; look
= look
->next
)
1219 flags
= look
->flags
;
1220 if (look
->bfd_section
!= NULL
)
1222 flags
= look
->bfd_section
->flags
;
1223 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1227 flags
^= sec
->flags
;
1228 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1230 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1234 else if (sec
->flags
& SEC_SMALL_DATA
)
1236 /* .sdata goes after .data, .sbss after .sdata. */
1237 for (look
= first
; look
; look
= look
->next
)
1239 flags
= look
->flags
;
1240 if (look
->bfd_section
!= NULL
)
1242 flags
= look
->bfd_section
->flags
;
1243 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1247 flags
^= sec
->flags
;
1248 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1249 | SEC_THREAD_LOCAL
))
1250 || ((look
->flags
& SEC_SMALL_DATA
)
1251 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1255 else if (sec
->flags
& SEC_HAS_CONTENTS
)
1257 /* .data goes after .rodata. */
1258 for (look
= first
; look
; look
= look
->next
)
1260 flags
= look
->flags
;
1261 if (look
->bfd_section
!= NULL
)
1263 flags
= look
->bfd_section
->flags
;
1264 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1268 flags
^= sec
->flags
;
1269 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1270 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1276 /* .bss goes last. */
1277 for (look
= first
; look
; look
= look
->next
)
1279 flags
= look
->flags
;
1280 if (look
->bfd_section
!= NULL
)
1282 flags
= look
->bfd_section
->flags
;
1283 if (match_type
&& !match_type (output_bfd
, look
->bfd_section
,
1287 flags
^= sec
->flags
;
1288 if (!(flags
& SEC_ALLOC
))
1293 if (found
|| !match_type
)
1296 return lang_output_section_find_by_flags (sec
, NULL
, NULL
);
1299 /* Find the last output section before given output statement.
1300 Used by place_orphan. */
1303 output_prev_sec_find (lang_output_section_statement_type
*os
)
1305 lang_output_section_statement_type
*lookup
;
1307 for (lookup
= os
->prev
; lookup
!= NULL
; lookup
= lookup
->prev
)
1309 if (lookup
->constraint
== -1)
1312 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1313 return lookup
->bfd_section
;
1319 lang_output_section_statement_type
*
1320 lang_insert_orphan (asection
*s
,
1321 const char *secname
,
1322 lang_output_section_statement_type
*after
,
1323 struct orphan_save
*place
,
1324 etree_type
*address
,
1325 lang_statement_list_type
*add_child
)
1327 lang_statement_list_type
*old
;
1328 lang_statement_list_type add
;
1330 etree_type
*load_base
;
1331 lang_output_section_statement_type
*os
;
1332 lang_output_section_statement_type
**os_tail
;
1334 /* Start building a list of statements for this section.
1335 First save the current statement pointer. */
1338 /* If we have found an appropriate place for the output section
1339 statements for this orphan, add them to our own private list,
1340 inserting them later into the global statement list. */
1344 lang_list_init (stat_ptr
);
1348 if (config
.build_constructors
)
1350 /* If the name of the section is representable in C, then create
1351 symbols to mark the start and the end of the section. */
1352 for (ps
= secname
; *ps
!= '\0'; ps
++)
1353 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1358 etree_type
*e_align
;
1360 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1361 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1362 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1363 e_align
= exp_unop (ALIGN_K
,
1364 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1365 lang_add_assignment (exp_assop ('=', ".", e_align
));
1366 lang_add_assignment (exp_assop ('=', symname
,
1367 exp_nameop (NAME
, ".")));
1371 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1372 address
= exp_intop (0);
1375 if (after
!= NULL
&& after
->load_base
!= NULL
)
1377 etree_type
*lma_from_vma
;
1378 lma_from_vma
= exp_binop ('-', after
->load_base
,
1379 exp_nameop (ADDR
, after
->name
));
1380 load_base
= exp_binop ('+', lma_from_vma
,
1381 exp_nameop (ADDR
, secname
));
1384 os_tail
= ((lang_output_section_statement_type
**)
1385 lang_output_section_statement
.tail
);
1386 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1389 if (add_child
== NULL
)
1390 add_child
= &os
->children
;
1391 lang_add_section (add_child
, s
, os
);
1393 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1395 if (config
.build_constructors
&& *ps
== '\0')
1399 /* lang_leave_ouput_section_statement resets stat_ptr.
1400 Put stat_ptr back where we want it. */
1404 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1405 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1406 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1407 lang_add_assignment (exp_assop ('=', symname
,
1408 exp_nameop (NAME
, ".")));
1411 /* Restore the global list pointer. */
1415 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1417 asection
*snew
, *as
;
1419 snew
= os
->bfd_section
;
1421 /* Shuffle the bfd section list to make the output file look
1422 neater. This is really only cosmetic. */
1423 if (place
->section
== NULL
1424 && after
!= (&lang_output_section_statement
.head
1425 ->output_section_statement
))
1427 asection
*bfd_section
= after
->bfd_section
;
1429 /* If the output statement hasn't been used to place any input
1430 sections (and thus doesn't have an output bfd_section),
1431 look for the closest prior output statement having an
1433 if (bfd_section
== NULL
)
1434 bfd_section
= output_prev_sec_find (after
);
1436 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1437 place
->section
= &bfd_section
->next
;
1440 if (place
->section
== NULL
)
1441 place
->section
= &output_bfd
->sections
;
1443 as
= *place
->section
;
1444 if (as
!= snew
&& as
->prev
!= snew
)
1446 /* Unlink the section. */
1447 bfd_section_list_remove (output_bfd
, snew
);
1449 /* Now tack it back on in the right place. */
1450 bfd_section_list_insert_before (output_bfd
, as
, snew
);
1453 /* Save the end of this list. Further ophans of this type will
1454 follow the one we've just added. */
1455 place
->section
= &snew
->next
;
1457 /* The following is non-cosmetic. We try to put the output
1458 statements in some sort of reasonable order here, because they
1459 determine the final load addresses of the orphan sections.
1460 In addition, placing output statements in the wrong order may
1461 require extra segments. For instance, given a typical
1462 situation of all read-only sections placed in one segment and
1463 following that a segment containing all the read-write
1464 sections, we wouldn't want to place an orphan read/write
1465 section before or amongst the read-only ones. */
1466 if (add
.head
!= NULL
)
1468 lang_output_section_statement_type
*newly_added_os
;
1470 if (place
->stmt
== NULL
)
1472 lang_statement_union_type
**where
;
1473 lang_statement_union_type
**assign
= NULL
;
1474 bfd_boolean ignore_first
;
1476 /* Look for a suitable place for the new statement list.
1477 The idea is to skip over anything that might be inside
1478 a SECTIONS {} statement in a script, before we find
1479 another output_section_statement. Assignments to "dot"
1480 before an output section statement are assumed to
1481 belong to it. An exception to this rule is made for
1482 the first assignment to dot, otherwise we might put an
1483 orphan before . = . + SIZEOF_HEADERS or similar
1484 assignments that set the initial address. */
1486 ignore_first
= after
== (&lang_output_section_statement
.head
1487 ->output_section_statement
);
1488 for (where
= &after
->header
.next
;
1490 where
= &(*where
)->header
.next
)
1492 switch ((*where
)->header
.type
)
1494 case lang_assignment_statement_enum
:
1497 lang_assignment_statement_type
*ass
;
1498 ass
= &(*where
)->assignment_statement
;
1499 if (ass
->exp
->type
.node_class
!= etree_assert
1500 && ass
->exp
->assign
.dst
[0] == '.'
1501 && ass
->exp
->assign
.dst
[1] == 0
1505 ignore_first
= FALSE
;
1507 case lang_wild_statement_enum
:
1508 case lang_input_section_enum
:
1509 case lang_object_symbols_statement_enum
:
1510 case lang_fill_statement_enum
:
1511 case lang_data_statement_enum
:
1512 case lang_reloc_statement_enum
:
1513 case lang_padding_statement_enum
:
1514 case lang_constructors_statement_enum
:
1517 case lang_output_section_statement_enum
:
1520 case lang_input_statement_enum
:
1521 case lang_address_statement_enum
:
1522 case lang_target_statement_enum
:
1523 case lang_output_statement_enum
:
1524 case lang_group_statement_enum
:
1525 case lang_afile_asection_pair_statement_enum
:
1534 place
->os_tail
= &after
->next
;
1538 /* Put it after the last orphan statement we added. */
1539 *add
.tail
= *place
->stmt
;
1540 *place
->stmt
= add
.head
;
1543 /* Fix the global list pointer if we happened to tack our
1544 new list at the tail. */
1545 if (*old
->tail
== add
.head
)
1546 old
->tail
= add
.tail
;
1548 /* Save the end of this list. */
1549 place
->stmt
= add
.tail
;
1551 /* Do the same for the list of output section statements. */
1552 newly_added_os
= *os_tail
;
1554 newly_added_os
->prev
= (lang_output_section_statement_type
*)
1555 ((char *) place
->os_tail
1556 - offsetof (lang_output_section_statement_type
, next
));
1557 newly_added_os
->next
= *place
->os_tail
;
1558 if (newly_added_os
->next
!= NULL
)
1559 newly_added_os
->next
->prev
= newly_added_os
;
1560 *place
->os_tail
= newly_added_os
;
1561 place
->os_tail
= &newly_added_os
->next
;
1563 /* Fixing the global list pointer here is a little different.
1564 We added to the list in lang_enter_output_section_statement,
1565 trimmed off the new output_section_statment above when
1566 assigning *os_tail = NULL, but possibly added it back in
1567 the same place when assigning *place->os_tail. */
1568 if (*os_tail
== NULL
)
1569 lang_output_section_statement
.tail
1570 = (lang_statement_union_type
**) os_tail
;
1577 lang_map_flags (flagword flag
)
1579 if (flag
& SEC_ALLOC
)
1582 if (flag
& SEC_CODE
)
1585 if (flag
& SEC_READONLY
)
1588 if (flag
& SEC_DATA
)
1591 if (flag
& SEC_LOAD
)
1598 lang_memory_region_type
*m
;
1599 bfd_boolean dis_header_printed
= FALSE
;
1602 LANG_FOR_EACH_INPUT_STATEMENT (file
)
1606 if ((file
->the_bfd
->flags
& (BFD_LINKER_CREATED
| DYNAMIC
)) != 0
1607 || file
->just_syms_flag
)
1610 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
1611 if (s
->output_section
== NULL
1612 || s
->output_section
->owner
!= output_bfd
)
1614 if (! dis_header_printed
)
1616 fprintf (config
.map_file
, _("\nDiscarded input sections\n\n"));
1617 dis_header_printed
= TRUE
;
1620 print_input_section (s
);
1624 minfo (_("\nMemory Configuration\n\n"));
1625 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1626 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1628 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1633 fprintf (config
.map_file
, "%-16s ", m
->name
);
1635 sprintf_vma (buf
, m
->origin
);
1636 minfo ("0x%s ", buf
);
1644 minfo ("0x%V", m
->length
);
1645 if (m
->flags
|| m
->not_flags
)
1653 lang_map_flags (m
->flags
);
1659 lang_map_flags (m
->not_flags
);
1666 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1668 if (! command_line
.reduce_memory_overheads
)
1670 obstack_begin (&map_obstack
, 1000);
1671 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1672 bfd_map_over_sections (p
, init_map_userdata
, 0);
1673 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1675 print_statements ();
1679 init_map_userdata (abfd
, sec
, data
)
1680 bfd
*abfd ATTRIBUTE_UNUSED
;
1682 void *data ATTRIBUTE_UNUSED
;
1684 fat_section_userdata_type
*new_data
1685 = ((fat_section_userdata_type
*) (stat_alloc
1686 (sizeof (fat_section_userdata_type
))));
1688 ASSERT (get_userdata (sec
) == NULL
);
1689 get_userdata (sec
) = new_data
;
1690 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1694 sort_def_symbol (hash_entry
, info
)
1695 struct bfd_link_hash_entry
*hash_entry
;
1696 void *info ATTRIBUTE_UNUSED
;
1698 if (hash_entry
->type
== bfd_link_hash_defined
1699 || hash_entry
->type
== bfd_link_hash_defweak
)
1701 struct fat_user_section_struct
*ud
;
1702 struct map_symbol_def
*def
;
1704 ud
= get_userdata (hash_entry
->u
.def
.section
);
1707 /* ??? What do we have to do to initialize this beforehand? */
1708 /* The first time we get here is bfd_abs_section... */
1709 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1710 ud
= get_userdata (hash_entry
->u
.def
.section
);
1712 else if (!ud
->map_symbol_def_tail
)
1713 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1715 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1716 def
->entry
= hash_entry
;
1717 *(ud
->map_symbol_def_tail
) = def
;
1718 ud
->map_symbol_def_tail
= &def
->next
;
1723 /* Initialize an output section. */
1726 init_os (lang_output_section_statement_type
*s
, asection
*isec
)
1728 if (s
->bfd_section
!= NULL
)
1731 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1732 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1734 s
->bfd_section
= bfd_get_section_by_name (output_bfd
, s
->name
);
1735 if (s
->bfd_section
== NULL
)
1736 s
->bfd_section
= bfd_make_section (output_bfd
, s
->name
);
1737 if (s
->bfd_section
== NULL
)
1739 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1740 output_bfd
->xvec
->name
, s
->name
);
1742 s
->bfd_section
->output_section
= s
->bfd_section
;
1743 s
->bfd_section
->output_offset
= 0;
1745 if (!command_line
.reduce_memory_overheads
)
1747 fat_section_userdata_type
*new
1748 = stat_alloc (sizeof (fat_section_userdata_type
));
1749 memset (new, 0, sizeof (fat_section_userdata_type
));
1750 get_userdata (s
->bfd_section
) = new;
1753 /* If there is a base address, make sure that any sections it might
1754 mention are initialized. */
1755 if (s
->addr_tree
!= NULL
)
1756 exp_init_os (s
->addr_tree
);
1758 if (s
->load_base
!= NULL
)
1759 exp_init_os (s
->load_base
);
1761 /* If supplied an alignment, set it. */
1762 if (s
->section_alignment
!= -1)
1763 s
->bfd_section
->alignment_power
= s
->section_alignment
;
1766 bfd_init_private_section_data (isec
->owner
, isec
,
1767 output_bfd
, s
->bfd_section
,
1771 /* Make sure that all output sections mentioned in an expression are
1775 exp_init_os (etree_type
*exp
)
1777 switch (exp
->type
.node_class
)
1781 exp_init_os (exp
->assign
.src
);
1785 exp_init_os (exp
->binary
.lhs
);
1786 exp_init_os (exp
->binary
.rhs
);
1790 exp_init_os (exp
->trinary
.cond
);
1791 exp_init_os (exp
->trinary
.lhs
);
1792 exp_init_os (exp
->trinary
.rhs
);
1796 exp_init_os (exp
->assert_s
.child
);
1800 exp_init_os (exp
->unary
.child
);
1804 switch (exp
->type
.node_code
)
1810 lang_output_section_statement_type
*os
;
1812 os
= lang_output_section_find (exp
->name
.name
);
1813 if (os
!= NULL
&& os
->bfd_section
== NULL
)
1825 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
1827 lang_input_statement_type
*entry
= data
;
1829 /* If we are only reading symbols from this object, then we want to
1830 discard all sections. */
1831 if (entry
->just_syms_flag
)
1833 bfd_link_just_syms (abfd
, sec
, &link_info
);
1837 if (!(abfd
->flags
& DYNAMIC
))
1838 bfd_section_already_linked (abfd
, sec
);
1841 /* The wild routines.
1843 These expand statements like *(.text) and foo.o to a list of
1844 explicit actions, like foo.o(.text), bar.o(.text) and
1845 foo.o(.text, .data). */
1847 /* Add SECTION to the output section OUTPUT. Do this by creating a
1848 lang_input_section statement which is placed at PTR. FILE is the
1849 input file which holds SECTION. */
1852 lang_add_section (lang_statement_list_type
*ptr
,
1854 lang_output_section_statement_type
*output
)
1856 flagword flags
= section
->flags
;
1857 bfd_boolean discard
;
1859 /* Discard sections marked with SEC_EXCLUDE. */
1860 discard
= (flags
& SEC_EXCLUDE
) != 0;
1862 /* Discard input sections which are assigned to a section named
1863 DISCARD_SECTION_NAME. */
1864 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
1867 /* Discard debugging sections if we are stripping debugging
1869 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
1870 && (flags
& SEC_DEBUGGING
) != 0)
1875 if (section
->output_section
== NULL
)
1877 /* This prevents future calls from assigning this section. */
1878 section
->output_section
= bfd_abs_section_ptr
;
1883 if (section
->output_section
== NULL
)
1886 lang_input_section_type
*new;
1889 if (output
->bfd_section
== NULL
)
1890 init_os (output
, section
);
1892 first
= ! output
->bfd_section
->linker_has_input
;
1893 output
->bfd_section
->linker_has_input
= 1;
1895 if (!link_info
.relocatable
1896 && !stripped_excluded_sections
)
1898 asection
*s
= output
->bfd_section
->map_tail
.s
;
1899 output
->bfd_section
->map_tail
.s
= section
;
1900 section
->map_head
.s
= NULL
;
1901 section
->map_tail
.s
= s
;
1903 s
->map_head
.s
= section
;
1905 output
->bfd_section
->map_head
.s
= section
;
1908 /* Add a section reference to the list. */
1909 new = new_stat (lang_input_section
, ptr
);
1911 new->section
= section
;
1912 section
->output_section
= output
->bfd_section
;
1914 flags
= section
->flags
;
1916 /* We don't copy the SEC_NEVER_LOAD flag from an input section
1917 to an output section, because we want to be able to include a
1918 SEC_NEVER_LOAD section in the middle of an otherwise loaded
1919 section (I don't know why we want to do this, but we do).
1920 build_link_order in ldwrite.c handles this case by turning
1921 the embedded SEC_NEVER_LOAD section into a fill. */
1923 flags
&= ~ SEC_NEVER_LOAD
;
1925 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
1926 already been processed. One reason to do this is that on pe
1927 format targets, .text$foo sections go into .text and it's odd
1928 to see .text with SEC_LINK_ONCE set. */
1930 if (! link_info
.relocatable
)
1931 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
1933 /* If this is not the first input section, and the SEC_READONLY
1934 flag is not currently set, then don't set it just because the
1935 input section has it set. */
1937 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
1938 flags
&= ~ SEC_READONLY
;
1940 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
1942 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
1943 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
1944 || ((flags
& SEC_MERGE
)
1945 && output
->bfd_section
->entsize
!= section
->entsize
)))
1947 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1948 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1951 output
->bfd_section
->flags
|= flags
;
1953 if (flags
& SEC_MERGE
)
1954 output
->bfd_section
->entsize
= section
->entsize
;
1956 /* If SEC_READONLY is not set in the input section, then clear
1957 it from the output section. */
1958 if ((section
->flags
& SEC_READONLY
) == 0)
1959 output
->bfd_section
->flags
&= ~SEC_READONLY
;
1961 switch (output
->sectype
)
1963 case normal_section
:
1965 case noalloc_section
:
1966 output
->bfd_section
->flags
&= ~SEC_ALLOC
;
1968 case noload_section
:
1969 output
->bfd_section
->flags
&= ~SEC_LOAD
;
1970 output
->bfd_section
->flags
|= SEC_NEVER_LOAD
;
1974 /* Copy over SEC_SMALL_DATA. */
1975 if (section
->flags
& SEC_SMALL_DATA
)
1976 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
1978 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
1979 output
->bfd_section
->alignment_power
= section
->alignment_power
;
1981 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
1982 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
1984 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
1985 /* FIXME: This value should really be obtained from the bfd... */
1986 output
->block_value
= 128;
1991 /* Compare sections ASEC and BSEC according to SORT. */
1994 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
2003 case by_alignment_name
:
2004 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
2005 - bfd_section_alignment (asec
->owner
, asec
));
2011 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
2012 bfd_get_section_name (bsec
->owner
, bsec
));
2015 case by_name_alignment
:
2016 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
2017 bfd_get_section_name (bsec
->owner
, bsec
));
2023 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
2024 - bfd_section_alignment (asec
->owner
, asec
));
2031 /* Handle wildcard sorting. This returns the lang_input_section which
2032 should follow the one we are going to create for SECTION and FILE,
2033 based on the sorting requirements of WILD. It returns NULL if the
2034 new section should just go at the end of the current list. */
2036 static lang_statement_union_type
*
2037 wild_sort (lang_wild_statement_type
*wild
,
2038 struct wildcard_list
*sec
,
2039 lang_input_statement_type
*file
,
2042 const char *section_name
;
2043 lang_statement_union_type
*l
;
2045 if (!wild
->filenames_sorted
2046 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
2049 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
2050 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
2052 lang_input_section_type
*ls
;
2054 if (l
->header
.type
!= lang_input_section_enum
)
2056 ls
= &l
->input_section
;
2058 /* Sorting by filename takes precedence over sorting by section
2061 if (wild
->filenames_sorted
)
2063 const char *fn
, *ln
;
2067 /* The PE support for the .idata section as generated by
2068 dlltool assumes that files will be sorted by the name of
2069 the archive and then the name of the file within the
2072 if (file
->the_bfd
!= NULL
2073 && bfd_my_archive (file
->the_bfd
) != NULL
)
2075 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
2080 fn
= file
->filename
;
2084 if (bfd_my_archive (ls
->section
->owner
) != NULL
)
2086 ln
= bfd_get_filename (bfd_my_archive (ls
->section
->owner
));
2091 ln
= ls
->section
->owner
->filename
;
2095 i
= strcmp (fn
, ln
);
2104 fn
= file
->filename
;
2106 ln
= ls
->section
->owner
->filename
;
2108 i
= strcmp (fn
, ln
);
2116 /* Here either the files are not sorted by name, or we are
2117 looking at the sections for this file. */
2119 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2120 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2127 /* Expand a wild statement for a particular FILE. SECTION may be
2128 NULL, in which case it is a wild card. */
2131 output_section_callback (lang_wild_statement_type
*ptr
,
2132 struct wildcard_list
*sec
,
2134 lang_input_statement_type
*file
,
2137 lang_statement_union_type
*before
;
2139 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2140 if (unique_section_p (section
))
2143 before
= wild_sort (ptr
, sec
, file
, section
);
2145 /* Here BEFORE points to the lang_input_section which
2146 should follow the one we are about to add. If BEFORE
2147 is NULL, then the section should just go at the end
2148 of the current list. */
2151 lang_add_section (&ptr
->children
, section
,
2152 (lang_output_section_statement_type
*) output
);
2155 lang_statement_list_type list
;
2156 lang_statement_union_type
**pp
;
2158 lang_list_init (&list
);
2159 lang_add_section (&list
, section
,
2160 (lang_output_section_statement_type
*) output
);
2162 /* If we are discarding the section, LIST.HEAD will
2164 if (list
.head
!= NULL
)
2166 ASSERT (list
.head
->header
.next
== NULL
);
2168 for (pp
= &ptr
->children
.head
;
2170 pp
= &(*pp
)->header
.next
)
2171 ASSERT (*pp
!= NULL
);
2173 list
.head
->header
.next
= *pp
;
2179 /* Check if all sections in a wild statement for a particular FILE
2183 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2184 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2186 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2189 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2190 if (unique_section_p (section
))
2193 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2194 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2197 /* This is passed a file name which must have been seen already and
2198 added to the statement tree. We will see if it has been opened
2199 already and had its symbols read. If not then we'll read it. */
2201 static lang_input_statement_type
*
2202 lookup_name (const char *name
)
2204 lang_input_statement_type
*search
;
2206 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2208 search
= (lang_input_statement_type
*) search
->next_real_file
)
2210 /* Use the local_sym_name as the name of the file that has
2211 already been loaded as filename might have been transformed
2212 via the search directory lookup mechanism. */
2213 const char *filename
= search
->local_sym_name
;
2215 if (filename
!= NULL
2216 && strcmp (filename
, name
) == 0)
2221 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2222 default_target
, FALSE
);
2224 /* If we have already added this file, or this file is not real
2225 don't add this file. */
2226 if (search
->loaded
|| !search
->real
)
2229 if (! load_symbols (search
, NULL
))
2235 /* Save LIST as a list of libraries whose symbols should not be exported. */
2240 struct excluded_lib
*next
;
2242 static struct excluded_lib
*excluded_libs
;
2245 add_excluded_libs (const char *list
)
2247 const char *p
= list
, *end
;
2251 struct excluded_lib
*entry
;
2252 end
= strpbrk (p
, ",:");
2254 end
= p
+ strlen (p
);
2255 entry
= xmalloc (sizeof (*entry
));
2256 entry
->next
= excluded_libs
;
2257 entry
->name
= xmalloc (end
- p
+ 1);
2258 memcpy (entry
->name
, p
, end
- p
);
2259 entry
->name
[end
- p
] = '\0';
2260 excluded_libs
= entry
;
2268 check_excluded_libs (bfd
*abfd
)
2270 struct excluded_lib
*lib
= excluded_libs
;
2274 int len
= strlen (lib
->name
);
2275 const char *filename
= lbasename (abfd
->filename
);
2277 if (strcmp (lib
->name
, "ALL") == 0)
2279 abfd
->no_export
= TRUE
;
2283 if (strncmp (lib
->name
, filename
, len
) == 0
2284 && (filename
[len
] == '\0'
2285 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2286 && filename
[len
+ 2] == '\0')))
2288 abfd
->no_export
= TRUE
;
2296 /* Get the symbols for an input file. */
2299 load_symbols (lang_input_statement_type
*entry
,
2300 lang_statement_list_type
*place
)
2307 ldfile_open_file (entry
);
2309 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2310 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2313 lang_statement_list_type
*hold
;
2314 bfd_boolean bad_load
= TRUE
;
2315 bfd_boolean save_ldlang_sysrooted_script
;
2316 bfd_boolean save_as_needed
, save_add_needed
;
2318 err
= bfd_get_error ();
2320 /* See if the emulation has some special knowledge. */
2321 if (ldemul_unrecognized_file (entry
))
2324 if (err
== bfd_error_file_ambiguously_recognized
)
2328 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2329 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2330 for (p
= matching
; *p
!= NULL
; p
++)
2334 else if (err
!= bfd_error_file_not_recognized
2336 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2340 bfd_close (entry
->the_bfd
);
2341 entry
->the_bfd
= NULL
;
2343 /* Try to interpret the file as a linker script. */
2344 ldfile_open_command_file (entry
->filename
);
2348 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2349 ldlang_sysrooted_script
= entry
->sysrooted
;
2350 save_as_needed
= as_needed
;
2351 as_needed
= entry
->as_needed
;
2352 save_add_needed
= add_needed
;
2353 add_needed
= entry
->add_needed
;
2355 ldfile_assumed_script
= TRUE
;
2356 parser_input
= input_script
;
2357 /* We want to use the same -Bdynamic/-Bstatic as the one for
2359 config
.dynamic_link
= entry
->dynamic
;
2361 ldfile_assumed_script
= FALSE
;
2363 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2364 as_needed
= save_as_needed
;
2365 add_needed
= save_add_needed
;
2371 if (ldemul_recognized_file (entry
))
2374 /* We don't call ldlang_add_file for an archive. Instead, the
2375 add_symbols entry point will call ldlang_add_file, via the
2376 add_archive_element callback, for each element of the archive
2378 switch (bfd_get_format (entry
->the_bfd
))
2384 ldlang_add_file (entry
);
2385 if (trace_files
|| trace_file_tries
)
2386 info_msg ("%I\n", entry
);
2390 check_excluded_libs (entry
->the_bfd
);
2392 if (entry
->whole_archive
)
2395 bfd_boolean loaded
= TRUE
;
2399 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2404 if (! bfd_check_format (member
, bfd_object
))
2406 einfo (_("%F%B: member %B in archive is not an object\n"),
2407 entry
->the_bfd
, member
);
2411 if (! ((*link_info
.callbacks
->add_archive_element
)
2412 (&link_info
, member
, "--whole-archive")))
2415 if (! bfd_link_add_symbols (member
, &link_info
))
2417 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2422 entry
->loaded
= loaded
;
2428 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2429 entry
->loaded
= TRUE
;
2431 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2433 return entry
->loaded
;
2436 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2437 may be NULL, indicating that it is a wildcard. Separate
2438 lang_input_section statements are created for each part of the
2439 expansion; they are added after the wild statement S. OUTPUT is
2440 the output section. */
2443 wild (lang_wild_statement_type
*s
,
2444 const char *target ATTRIBUTE_UNUSED
,
2445 lang_output_section_statement_type
*output
)
2447 struct wildcard_list
*sec
;
2449 walk_wild (s
, output_section_callback
, output
);
2451 if (default_common_section
== NULL
)
2452 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2453 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2455 /* Remember the section that common is going to in case we
2456 later get something which doesn't know where to put it. */
2457 default_common_section
= output
;
2462 /* Return TRUE iff target is the sought target. */
2465 get_target (const bfd_target
*target
, void *data
)
2467 const char *sought
= data
;
2469 return strcmp (target
->name
, sought
) == 0;
2472 /* Like strcpy() but convert to lower case as well. */
2475 stricpy (char *dest
, char *src
)
2479 while ((c
= *src
++) != 0)
2480 *dest
++ = TOLOWER (c
);
2485 /* Remove the first occurrence of needle (if any) in haystack
2489 strcut (char *haystack
, char *needle
)
2491 haystack
= strstr (haystack
, needle
);
2497 for (src
= haystack
+ strlen (needle
); *src
;)
2498 *haystack
++ = *src
++;
2504 /* Compare two target format name strings.
2505 Return a value indicating how "similar" they are. */
2508 name_compare (char *first
, char *second
)
2514 copy1
= xmalloc (strlen (first
) + 1);
2515 copy2
= xmalloc (strlen (second
) + 1);
2517 /* Convert the names to lower case. */
2518 stricpy (copy1
, first
);
2519 stricpy (copy2
, second
);
2521 /* Remove size and endian strings from the name. */
2522 strcut (copy1
, "big");
2523 strcut (copy1
, "little");
2524 strcut (copy2
, "big");
2525 strcut (copy2
, "little");
2527 /* Return a value based on how many characters match,
2528 starting from the beginning. If both strings are
2529 the same then return 10 * their length. */
2530 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2531 if (copy1
[result
] == 0)
2543 /* Set by closest_target_match() below. */
2544 static const bfd_target
*winner
;
2546 /* Scan all the valid bfd targets looking for one that has the endianness
2547 requirement that was specified on the command line, and is the nearest
2548 match to the original output target. */
2551 closest_target_match (const bfd_target
*target
, void *data
)
2553 const bfd_target
*original
= data
;
2555 if (command_line
.endian
== ENDIAN_BIG
2556 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2559 if (command_line
.endian
== ENDIAN_LITTLE
2560 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2563 /* Must be the same flavour. */
2564 if (target
->flavour
!= original
->flavour
)
2567 /* If we have not found a potential winner yet, then record this one. */
2574 /* Oh dear, we now have two potential candidates for a successful match.
2575 Compare their names and choose the better one. */
2576 if (name_compare (target
->name
, original
->name
)
2577 > name_compare (winner
->name
, original
->name
))
2580 /* Keep on searching until wqe have checked them all. */
2584 /* Return the BFD target format of the first input file. */
2587 get_first_input_target (void)
2589 char *target
= NULL
;
2591 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2593 if (s
->header
.type
== lang_input_statement_enum
2596 ldfile_open_file (s
);
2598 if (s
->the_bfd
!= NULL
2599 && bfd_check_format (s
->the_bfd
, bfd_object
))
2601 target
= bfd_get_target (s
->the_bfd
);
2613 lang_get_output_target (void)
2617 /* Has the user told us which output format to use? */
2618 if (output_target
!= NULL
)
2619 return output_target
;
2621 /* No - has the current target been set to something other than
2623 if (current_target
!= default_target
)
2624 return current_target
;
2626 /* No - can we determine the format of the first input file? */
2627 target
= get_first_input_target ();
2631 /* Failed - use the default output target. */
2632 return default_target
;
2635 /* Open the output file. */
2638 open_output (const char *name
)
2642 output_target
= lang_get_output_target ();
2644 /* Has the user requested a particular endianness on the command
2646 if (command_line
.endian
!= ENDIAN_UNSET
)
2648 const bfd_target
*target
;
2649 enum bfd_endian desired_endian
;
2651 /* Get the chosen target. */
2652 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2654 /* If the target is not supported, we cannot do anything. */
2657 if (command_line
.endian
== ENDIAN_BIG
)
2658 desired_endian
= BFD_ENDIAN_BIG
;
2660 desired_endian
= BFD_ENDIAN_LITTLE
;
2662 /* See if the target has the wrong endianness. This should
2663 not happen if the linker script has provided big and
2664 little endian alternatives, but some scrips don't do
2666 if (target
->byteorder
!= desired_endian
)
2668 /* If it does, then see if the target provides
2669 an alternative with the correct endianness. */
2670 if (target
->alternative_target
!= NULL
2671 && (target
->alternative_target
->byteorder
== desired_endian
))
2672 output_target
= target
->alternative_target
->name
;
2675 /* Try to find a target as similar as possible to
2676 the default target, but which has the desired
2677 endian characteristic. */
2678 bfd_search_for_target (closest_target_match
,
2681 /* Oh dear - we could not find any targets that
2682 satisfy our requirements. */
2684 einfo (_("%P: warning: could not find any targets"
2685 " that match endianness requirement\n"));
2687 output_target
= winner
->name
;
2693 output
= bfd_openw (name
, output_target
);
2697 if (bfd_get_error () == bfd_error_invalid_target
)
2698 einfo (_("%P%F: target %s not found\n"), output_target
);
2700 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2703 delete_output_file_on_failure
= TRUE
;
2705 if (! bfd_set_format (output
, bfd_object
))
2706 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2707 if (! bfd_set_arch_mach (output
,
2708 ldfile_output_architecture
,
2709 ldfile_output_machine
))
2710 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2712 link_info
.hash
= bfd_link_hash_table_create (output
);
2713 if (link_info
.hash
== NULL
)
2714 einfo (_("%P%F: can not create hash table: %E\n"));
2716 bfd_set_gp_size (output
, g_switch_value
);
2721 ldlang_open_output (lang_statement_union_type
*statement
)
2723 switch (statement
->header
.type
)
2725 case lang_output_statement_enum
:
2726 ASSERT (output_bfd
== NULL
);
2727 output_bfd
= open_output (statement
->output_statement
.name
);
2728 ldemul_set_output_arch ();
2729 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2730 output_bfd
->flags
|= D_PAGED
;
2732 output_bfd
->flags
&= ~D_PAGED
;
2733 if (config
.text_read_only
)
2734 output_bfd
->flags
|= WP_TEXT
;
2736 output_bfd
->flags
&= ~WP_TEXT
;
2737 if (link_info
.traditional_format
)
2738 output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2740 output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2743 case lang_target_statement_enum
:
2744 current_target
= statement
->target_statement
.target
;
2751 /* Convert between addresses in bytes and sizes in octets.
2752 For currently supported targets, octets_per_byte is always a power
2753 of two, so we can use shifts. */
2754 #define TO_ADDR(X) ((X) >> opb_shift)
2755 #define TO_SIZE(X) ((X) << opb_shift)
2757 /* Support the above. */
2758 static unsigned int opb_shift
= 0;
2763 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2764 ldfile_output_machine
);
2767 while ((x
& 1) == 0)
2775 /* Open all the input files. */
2778 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2780 for (; s
!= NULL
; s
= s
->header
.next
)
2782 switch (s
->header
.type
)
2784 case lang_constructors_statement_enum
:
2785 open_input_bfds (constructor_list
.head
, force
);
2787 case lang_output_section_statement_enum
:
2788 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2790 case lang_wild_statement_enum
:
2791 /* Maybe we should load the file's symbols. */
2792 if (s
->wild_statement
.filename
2793 && ! wildcardp (s
->wild_statement
.filename
))
2794 lookup_name (s
->wild_statement
.filename
);
2795 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2797 case lang_group_statement_enum
:
2799 struct bfd_link_hash_entry
*undefs
;
2801 /* We must continually search the entries in the group
2802 until no new symbols are added to the list of undefined
2807 undefs
= link_info
.hash
->undefs_tail
;
2808 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2810 while (undefs
!= link_info
.hash
->undefs_tail
);
2813 case lang_target_statement_enum
:
2814 current_target
= s
->target_statement
.target
;
2816 case lang_input_statement_enum
:
2817 if (s
->input_statement
.real
)
2819 lang_statement_list_type add
;
2821 s
->input_statement
.target
= current_target
;
2823 /* If we are being called from within a group, and this
2824 is an archive which has already been searched, then
2825 force it to be researched unless the whole archive
2826 has been loaded already. */
2828 && !s
->input_statement
.whole_archive
2829 && s
->input_statement
.loaded
2830 && bfd_check_format (s
->input_statement
.the_bfd
,
2832 s
->input_statement
.loaded
= FALSE
;
2834 lang_list_init (&add
);
2836 if (! load_symbols (&s
->input_statement
, &add
))
2837 config
.make_executable
= FALSE
;
2839 if (add
.head
!= NULL
)
2841 *add
.tail
= s
->header
.next
;
2842 s
->header
.next
= add
.head
;
2852 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2855 lang_track_definedness (const char *name
)
2857 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2858 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2861 /* New-function for the definedness hash table. */
2863 static struct bfd_hash_entry
*
2864 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2865 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2866 const char *name ATTRIBUTE_UNUSED
)
2868 struct lang_definedness_hash_entry
*ret
2869 = (struct lang_definedness_hash_entry
*) entry
;
2872 ret
= (struct lang_definedness_hash_entry
*)
2873 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
2876 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
2878 ret
->iteration
= -1;
2882 /* Return the iteration when the definition of NAME was last updated. A
2883 value of -1 means that the symbol is not defined in the linker script
2884 or the command line, but may be defined in the linker symbol table. */
2887 lang_symbol_definition_iteration (const char *name
)
2889 struct lang_definedness_hash_entry
*defentry
2890 = (struct lang_definedness_hash_entry
*)
2891 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2893 /* We've already created this one on the presence of DEFINED in the
2894 script, so it can't be NULL unless something is borked elsewhere in
2896 if (defentry
== NULL
)
2899 return defentry
->iteration
;
2902 /* Update the definedness state of NAME. */
2905 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
2907 struct lang_definedness_hash_entry
*defentry
2908 = (struct lang_definedness_hash_entry
*)
2909 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2911 /* We don't keep track of symbols not tested with DEFINED. */
2912 if (defentry
== NULL
)
2915 /* If the symbol was already defined, and not from an earlier statement
2916 iteration, don't update the definedness iteration, because that'd
2917 make the symbol seem defined in the linker script at this point, and
2918 it wasn't; it was defined in some object. If we do anyway, DEFINED
2919 would start to yield false before this point and the construct "sym =
2920 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2922 if (h
->type
!= bfd_link_hash_undefined
2923 && h
->type
!= bfd_link_hash_common
2924 && h
->type
!= bfd_link_hash_new
2925 && defentry
->iteration
== -1)
2928 defentry
->iteration
= lang_statement_iteration
;
2931 /* Add the supplied name to the symbol table as an undefined reference.
2932 This is a two step process as the symbol table doesn't even exist at
2933 the time the ld command line is processed. First we put the name
2934 on a list, then, once the output file has been opened, transfer the
2935 name to the symbol table. */
2937 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
2939 #define ldlang_undef_chain_list_head entry_symbol.next
2942 ldlang_add_undef (const char *const name
)
2944 ldlang_undef_chain_list_type
*new =
2945 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
2947 new->next
= ldlang_undef_chain_list_head
;
2948 ldlang_undef_chain_list_head
= new;
2950 new->name
= xstrdup (name
);
2952 if (output_bfd
!= NULL
)
2953 insert_undefined (new->name
);
2956 /* Insert NAME as undefined in the symbol table. */
2959 insert_undefined (const char *name
)
2961 struct bfd_link_hash_entry
*h
;
2963 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
2965 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2966 if (h
->type
== bfd_link_hash_new
)
2968 h
->type
= bfd_link_hash_undefined
;
2969 h
->u
.undef
.abfd
= NULL
;
2970 bfd_link_add_undef (link_info
.hash
, h
);
2974 /* Run through the list of undefineds created above and place them
2975 into the linker hash table as undefined symbols belonging to the
2979 lang_place_undefineds (void)
2981 ldlang_undef_chain_list_type
*ptr
;
2983 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
2984 insert_undefined (ptr
->name
);
2987 /* Check for all readonly or some readwrite sections. */
2990 check_input_sections
2991 (lang_statement_union_type
*s
,
2992 lang_output_section_statement_type
*output_section_statement
)
2994 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
2996 switch (s
->header
.type
)
2998 case lang_wild_statement_enum
:
2999 walk_wild (&s
->wild_statement
, check_section_callback
,
3000 output_section_statement
);
3001 if (! output_section_statement
->all_input_readonly
)
3004 case lang_constructors_statement_enum
:
3005 check_input_sections (constructor_list
.head
,
3006 output_section_statement
);
3007 if (! output_section_statement
->all_input_readonly
)
3010 case lang_group_statement_enum
:
3011 check_input_sections (s
->group_statement
.children
.head
,
3012 output_section_statement
);
3013 if (! output_section_statement
->all_input_readonly
)
3022 /* Update wildcard statements if needed. */
3025 update_wild_statements (lang_statement_union_type
*s
)
3027 struct wildcard_list
*sec
;
3029 switch (sort_section
)
3039 for (; s
!= NULL
; s
= s
->header
.next
)
3041 switch (s
->header
.type
)
3046 case lang_wild_statement_enum
:
3047 sec
= s
->wild_statement
.section_list
;
3050 switch (sec
->spec
.sorted
)
3053 sec
->spec
.sorted
= sort_section
;
3056 if (sort_section
== by_alignment
)
3057 sec
->spec
.sorted
= by_name_alignment
;
3060 if (sort_section
== by_name
)
3061 sec
->spec
.sorted
= by_alignment_name
;
3069 case lang_constructors_statement_enum
:
3070 update_wild_statements (constructor_list
.head
);
3073 case lang_output_section_statement_enum
:
3074 update_wild_statements
3075 (s
->output_section_statement
.children
.head
);
3078 case lang_group_statement_enum
:
3079 update_wild_statements (s
->group_statement
.children
.head
);
3087 /* Open input files and attach to output sections. */
3090 map_input_to_output_sections
3091 (lang_statement_union_type
*s
, const char *target
,
3092 lang_output_section_statement_type
*os
)
3094 for (; s
!= NULL
; s
= s
->header
.next
)
3096 switch (s
->header
.type
)
3098 case lang_wild_statement_enum
:
3099 wild (&s
->wild_statement
, target
, os
);
3101 case lang_constructors_statement_enum
:
3102 map_input_to_output_sections (constructor_list
.head
,
3106 case lang_output_section_statement_enum
:
3107 if (s
->output_section_statement
.constraint
)
3109 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3110 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3112 s
->output_section_statement
.all_input_readonly
= TRUE
;
3113 check_input_sections (s
->output_section_statement
.children
.head
,
3114 &s
->output_section_statement
);
3115 if ((s
->output_section_statement
.all_input_readonly
3116 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3117 || (!s
->output_section_statement
.all_input_readonly
3118 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3120 s
->output_section_statement
.constraint
= -1;
3125 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3127 &s
->output_section_statement
);
3129 case lang_output_statement_enum
:
3131 case lang_target_statement_enum
:
3132 target
= s
->target_statement
.target
;
3134 case lang_group_statement_enum
:
3135 map_input_to_output_sections (s
->group_statement
.children
.head
,
3139 case lang_data_statement_enum
:
3140 /* Make sure that any sections mentioned in the expression
3142 exp_init_os (s
->data_statement
.exp
);
3143 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3145 /* The output section gets contents, and then we inspect for
3146 any flags set in the input script which override any ALLOC. */
3147 os
->bfd_section
->flags
|= SEC_HAS_CONTENTS
;
3148 if (!(os
->flags
& SEC_NEVER_LOAD
))
3149 os
->bfd_section
->flags
|= SEC_ALLOC
| SEC_LOAD
;
3151 case lang_input_section_enum
:
3153 case lang_fill_statement_enum
:
3154 case lang_object_symbols_statement_enum
:
3155 case lang_reloc_statement_enum
:
3156 case lang_padding_statement_enum
:
3157 case lang_input_statement_enum
:
3158 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3161 case lang_assignment_statement_enum
:
3162 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3165 /* Make sure that any sections mentioned in the assignment
3167 exp_init_os (s
->assignment_statement
.exp
);
3169 case lang_afile_asection_pair_statement_enum
:
3172 case lang_address_statement_enum
:
3173 /* Mark the specified section with the supplied address.
3175 If this section was actually a segment marker, then the
3176 directive is ignored if the linker script explicitly
3177 processed the segment marker. Originally, the linker
3178 treated segment directives (like -Ttext on the
3179 command-line) as section directives. We honor the
3180 section directive semantics for backwards compatibilty;
3181 linker scripts that do not specifically check for
3182 SEGMENT_START automatically get the old semantics. */
3183 if (!s
->address_statement
.segment
3184 || !s
->address_statement
.segment
->used
)
3186 lang_output_section_statement_type
*aos
3187 = (lang_output_section_statement_lookup
3188 (s
->address_statement
.section_name
));
3190 if (aos
->bfd_section
== NULL
)
3191 init_os (aos
, NULL
);
3192 aos
->addr_tree
= s
->address_statement
.address
;
3199 /* An output section might have been removed after its statement was
3200 added. For example, ldemul_before_allocation can remove dynamic
3201 sections if they turn out to be not needed. Clean them up here. */
3204 strip_excluded_output_sections (void)
3206 lang_output_section_statement_type
*os
;
3208 /* Run lang_size_sections (if not already done). */
3209 if (expld
.phase
!= lang_mark_phase_enum
)
3211 expld
.phase
= lang_mark_phase_enum
;
3212 expld
.dataseg
.phase
= exp_dataseg_none
;
3213 one_lang_size_sections_pass (NULL
, FALSE
);
3214 lang_reset_memory_regions ();
3217 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3221 asection
*output_section
;
3222 bfd_boolean exclude
;
3224 if (os
->constraint
== -1)
3227 output_section
= os
->bfd_section
;
3228 if (output_section
== NULL
)
3231 exclude
= (output_section
->rawsize
== 0
3232 && (output_section
->flags
& SEC_KEEP
) == 0
3233 && !bfd_section_removed_from_list (output_bfd
,
3236 /* Some sections have not yet been sized, notably .gnu.version,
3237 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3238 input sections, so don't drop output sections that have such
3239 input sections unless they are also marked SEC_EXCLUDE. */
3240 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3244 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3245 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3246 && (s
->flags
& SEC_EXCLUDE
) == 0)
3253 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3254 output_section
->map_head
.link_order
= NULL
;
3255 output_section
->map_tail
.link_order
= NULL
;
3259 /* We don't set bfd_section to NULL since bfd_section of the
3260 removed output section statement may still be used. */
3262 output_section
->flags
|= SEC_EXCLUDE
;
3263 bfd_section_list_remove (output_bfd
, output_section
);
3264 output_bfd
->section_count
--;
3268 /* Stop future calls to lang_add_section from messing with map_head
3269 and map_tail link_order fields. */
3270 stripped_excluded_sections
= TRUE
;
3274 print_output_section_statement
3275 (lang_output_section_statement_type
*output_section_statement
)
3277 asection
*section
= output_section_statement
->bfd_section
;
3280 if (output_section_statement
!= abs_output_section
)
3282 minfo ("\n%s", output_section_statement
->name
);
3284 if (section
!= NULL
)
3286 print_dot
= section
->vma
;
3288 len
= strlen (output_section_statement
->name
);
3289 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3294 while (len
< SECTION_NAME_MAP_LENGTH
)
3300 minfo ("0x%V %W", section
->vma
, section
->size
);
3302 if (output_section_statement
->load_base
!= NULL
)
3306 addr
= exp_get_abs_int (output_section_statement
->load_base
, 0,
3308 minfo (_(" load address 0x%V"), addr
);
3315 print_statement_list (output_section_statement
->children
.head
,
3316 output_section_statement
);
3319 /* Scan for the use of the destination in the right hand side
3320 of an expression. In such cases we will not compute the
3321 correct expression, since the value of DST that is used on
3322 the right hand side will be its final value, not its value
3323 just before this expression is evaluated. */
3326 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3328 if (rhs
== NULL
|| dst
== NULL
)
3331 switch (rhs
->type
.node_class
)
3334 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3335 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3338 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3339 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3342 case etree_provided
:
3344 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3346 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3349 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3353 return strcmp (dst
, rhs
->value
.str
) == 0;
3358 return strcmp (dst
, rhs
->name
.name
) == 0;
3370 print_assignment (lang_assignment_statement_type
*assignment
,
3371 lang_output_section_statement_type
*output_section
)
3375 bfd_boolean computation_is_valid
= TRUE
;
3378 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3381 if (assignment
->exp
->type
.node_class
== etree_assert
)
3384 tree
= assignment
->exp
->assert_s
.child
;
3385 computation_is_valid
= TRUE
;
3389 const char *dst
= assignment
->exp
->assign
.dst
;
3391 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3392 tree
= assignment
->exp
->assign
.src
;
3393 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3396 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3397 if (expld
.result
.valid_p
)
3401 if (computation_is_valid
)
3403 value
= expld
.result
.value
;
3405 if (expld
.result
.section
)
3406 value
+= expld
.result
.section
->vma
;
3408 minfo ("0x%V", value
);
3414 struct bfd_link_hash_entry
*h
;
3416 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3417 FALSE
, FALSE
, TRUE
);
3420 value
= h
->u
.def
.value
;
3422 if (expld
.result
.section
)
3423 value
+= expld
.result
.section
->vma
;
3425 minfo ("[0x%V]", value
);
3428 minfo ("[unresolved]");
3440 exp_print_tree (assignment
->exp
);
3445 print_input_statement (lang_input_statement_type
*statm
)
3447 if (statm
->filename
!= NULL
)
3449 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3453 /* Print all symbols defined in a particular section. This is called
3454 via bfd_link_hash_traverse, or by print_all_symbols. */
3457 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3459 asection
*sec
= ptr
;
3461 if ((hash_entry
->type
== bfd_link_hash_defined
3462 || hash_entry
->type
== bfd_link_hash_defweak
)
3463 && sec
== hash_entry
->u
.def
.section
)
3467 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3470 (hash_entry
->u
.def
.value
3471 + hash_entry
->u
.def
.section
->output_offset
3472 + hash_entry
->u
.def
.section
->output_section
->vma
));
3474 minfo (" %T\n", hash_entry
->root
.string
);
3481 print_all_symbols (asection
*sec
)
3483 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3484 struct map_symbol_def
*def
;
3489 *ud
->map_symbol_def_tail
= 0;
3490 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3491 print_one_symbol (def
->entry
, sec
);
3494 /* Print information about an input section to the map file. */
3497 print_input_section (asection
*i
)
3499 bfd_size_type size
= i
->size
;
3506 minfo ("%s", i
->name
);
3508 len
= 1 + strlen (i
->name
);
3509 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3514 while (len
< SECTION_NAME_MAP_LENGTH
)
3520 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3521 addr
= i
->output_section
->vma
+ i
->output_offset
;
3528 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3530 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3532 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3544 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3547 if (i
->output_section
!= NULL
&& i
->output_section
->owner
== output_bfd
)
3549 if (command_line
.reduce_memory_overheads
)
3550 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3552 print_all_symbols (i
);
3554 print_dot
= addr
+ TO_ADDR (size
);
3559 print_fill_statement (lang_fill_statement_type
*fill
)
3563 fputs (" FILL mask 0x", config
.map_file
);
3564 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3565 fprintf (config
.map_file
, "%02x", *p
);
3566 fputs ("\n", config
.map_file
);
3570 print_data_statement (lang_data_statement_type
*data
)
3578 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3581 addr
= data
->output_offset
;
3582 if (data
->output_section
!= NULL
)
3583 addr
+= data
->output_section
->vma
;
3611 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3613 if (data
->exp
->type
.node_class
!= etree_value
)
3616 exp_print_tree (data
->exp
);
3621 print_dot
= addr
+ TO_ADDR (size
);
3624 /* Print an address statement. These are generated by options like
3628 print_address_statement (lang_address_statement_type
*address
)
3630 minfo (_("Address of section %s set to "), address
->section_name
);
3631 exp_print_tree (address
->address
);
3635 /* Print a reloc statement. */
3638 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3645 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3648 addr
= reloc
->output_offset
;
3649 if (reloc
->output_section
!= NULL
)
3650 addr
+= reloc
->output_section
->vma
;
3652 size
= bfd_get_reloc_size (reloc
->howto
);
3654 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3656 if (reloc
->name
!= NULL
)
3657 minfo ("%s+", reloc
->name
);
3659 minfo ("%s+", reloc
->section
->name
);
3661 exp_print_tree (reloc
->addend_exp
);
3665 print_dot
= addr
+ TO_ADDR (size
);
3669 print_padding_statement (lang_padding_statement_type
*s
)
3677 len
= sizeof " *fill*" - 1;
3678 while (len
< SECTION_NAME_MAP_LENGTH
)
3684 addr
= s
->output_offset
;
3685 if (s
->output_section
!= NULL
)
3686 addr
+= s
->output_section
->vma
;
3687 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3689 if (s
->fill
->size
!= 0)
3693 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3694 fprintf (config
.map_file
, "%02x", *p
);
3699 print_dot
= addr
+ TO_ADDR (s
->size
);
3703 print_wild_statement (lang_wild_statement_type
*w
,
3704 lang_output_section_statement_type
*os
)
3706 struct wildcard_list
*sec
;
3710 if (w
->filenames_sorted
)
3712 if (w
->filename
!= NULL
)
3713 minfo ("%s", w
->filename
);
3716 if (w
->filenames_sorted
)
3720 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
3722 if (sec
->spec
.sorted
)
3724 if (sec
->spec
.exclude_name_list
!= NULL
)
3727 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
3728 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
3729 minfo (" %s", tmp
->name
);
3732 if (sec
->spec
.name
!= NULL
)
3733 minfo ("%s", sec
->spec
.name
);
3736 if (sec
->spec
.sorted
)
3745 print_statement_list (w
->children
.head
, os
);
3748 /* Print a group statement. */
3751 print_group (lang_group_statement_type
*s
,
3752 lang_output_section_statement_type
*os
)
3754 fprintf (config
.map_file
, "START GROUP\n");
3755 print_statement_list (s
->children
.head
, os
);
3756 fprintf (config
.map_file
, "END GROUP\n");
3759 /* Print the list of statements in S.
3760 This can be called for any statement type. */
3763 print_statement_list (lang_statement_union_type
*s
,
3764 lang_output_section_statement_type
*os
)
3768 print_statement (s
, os
);
3773 /* Print the first statement in statement list S.
3774 This can be called for any statement type. */
3777 print_statement (lang_statement_union_type
*s
,
3778 lang_output_section_statement_type
*os
)
3780 switch (s
->header
.type
)
3783 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
3786 case lang_constructors_statement_enum
:
3787 if (constructor_list
.head
!= NULL
)
3789 if (constructors_sorted
)
3790 minfo (" SORT (CONSTRUCTORS)\n");
3792 minfo (" CONSTRUCTORS\n");
3793 print_statement_list (constructor_list
.head
, os
);
3796 case lang_wild_statement_enum
:
3797 print_wild_statement (&s
->wild_statement
, os
);
3799 case lang_address_statement_enum
:
3800 print_address_statement (&s
->address_statement
);
3802 case lang_object_symbols_statement_enum
:
3803 minfo (" CREATE_OBJECT_SYMBOLS\n");
3805 case lang_fill_statement_enum
:
3806 print_fill_statement (&s
->fill_statement
);
3808 case lang_data_statement_enum
:
3809 print_data_statement (&s
->data_statement
);
3811 case lang_reloc_statement_enum
:
3812 print_reloc_statement (&s
->reloc_statement
);
3814 case lang_input_section_enum
:
3815 print_input_section (s
->input_section
.section
);
3817 case lang_padding_statement_enum
:
3818 print_padding_statement (&s
->padding_statement
);
3820 case lang_output_section_statement_enum
:
3821 print_output_section_statement (&s
->output_section_statement
);
3823 case lang_assignment_statement_enum
:
3824 print_assignment (&s
->assignment_statement
, os
);
3826 case lang_target_statement_enum
:
3827 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
3829 case lang_output_statement_enum
:
3830 minfo ("OUTPUT(%s", s
->output_statement
.name
);
3831 if (output_target
!= NULL
)
3832 minfo (" %s", output_target
);
3835 case lang_input_statement_enum
:
3836 print_input_statement (&s
->input_statement
);
3838 case lang_group_statement_enum
:
3839 print_group (&s
->group_statement
, os
);
3841 case lang_afile_asection_pair_statement_enum
:
3848 print_statements (void)
3850 print_statement_list (statement_list
.head
, abs_output_section
);
3853 /* Print the first N statements in statement list S to STDERR.
3854 If N == 0, nothing is printed.
3855 If N < 0, the entire list is printed.
3856 Intended to be called from GDB. */
3859 dprint_statement (lang_statement_union_type
*s
, int n
)
3861 FILE *map_save
= config
.map_file
;
3863 config
.map_file
= stderr
;
3866 print_statement_list (s
, abs_output_section
);
3869 while (s
&& --n
>= 0)
3871 print_statement (s
, abs_output_section
);
3876 config
.map_file
= map_save
;
3880 insert_pad (lang_statement_union_type
**ptr
,
3882 unsigned int alignment_needed
,
3883 asection
*output_section
,
3886 static fill_type zero_fill
= { 1, { 0 } };
3887 lang_statement_union_type
*pad
= NULL
;
3889 if (ptr
!= &statement_list
.head
)
3890 pad
= ((lang_statement_union_type
*)
3891 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
3893 && pad
->header
.type
== lang_padding_statement_enum
3894 && pad
->padding_statement
.output_section
== output_section
)
3896 /* Use the existing pad statement. */
3898 else if ((pad
= *ptr
) != NULL
3899 && pad
->header
.type
== lang_padding_statement_enum
3900 && pad
->padding_statement
.output_section
== output_section
)
3902 /* Use the existing pad statement. */
3906 /* Make a new padding statement, linked into existing chain. */
3907 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
3908 pad
->header
.next
= *ptr
;
3910 pad
->header
.type
= lang_padding_statement_enum
;
3911 pad
->padding_statement
.output_section
= output_section
;
3914 pad
->padding_statement
.fill
= fill
;
3916 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
3917 pad
->padding_statement
.size
= alignment_needed
;
3918 output_section
->size
+= alignment_needed
;
3921 /* Work out how much this section will move the dot point. */
3925 (lang_statement_union_type
**this_ptr
,
3926 lang_output_section_statement_type
*output_section_statement
,
3930 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
3931 asection
*i
= is
->section
;
3933 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
3934 && (i
->flags
& SEC_EXCLUDE
) == 0)
3936 unsigned int alignment_needed
;
3939 /* Align this section first to the input sections requirement,
3940 then to the output section's requirement. If this alignment
3941 is greater than any seen before, then record it too. Perform
3942 the alignment by inserting a magic 'padding' statement. */
3944 if (output_section_statement
->subsection_alignment
!= -1)
3945 i
->alignment_power
= output_section_statement
->subsection_alignment
;
3947 o
= output_section_statement
->bfd_section
;
3948 if (o
->alignment_power
< i
->alignment_power
)
3949 o
->alignment_power
= i
->alignment_power
;
3951 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
3953 if (alignment_needed
!= 0)
3955 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
3956 dot
+= alignment_needed
;
3959 /* Remember where in the output section this input section goes. */
3961 i
->output_offset
= dot
- o
->vma
;
3963 /* Mark how big the output section must be to contain this now. */
3964 dot
+= TO_ADDR (i
->size
);
3965 o
->size
= TO_SIZE (dot
- o
->vma
);
3969 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
3976 sort_sections_by_lma (const void *arg1
, const void *arg2
)
3978 const asection
*sec1
= *(const asection
**) arg1
;
3979 const asection
*sec2
= *(const asection
**) arg2
;
3981 if (bfd_section_lma (sec1
->owner
, sec1
)
3982 < bfd_section_lma (sec2
->owner
, sec2
))
3984 else if (bfd_section_lma (sec1
->owner
, sec1
)
3985 > bfd_section_lma (sec2
->owner
, sec2
))
3991 #define IGNORE_SECTION(s) \
3992 ((s->flags & SEC_NEVER_LOAD) != 0 \
3993 || (s->flags & SEC_ALLOC) == 0 \
3994 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
3995 && (s->flags & SEC_LOAD) == 0))
3997 /* Check to see if any allocated sections overlap with other allocated
3998 sections. This can happen if a linker script specifies the output
3999 section addresses of the two sections. */
4002 lang_check_section_addresses (void)
4005 asection
**sections
, **spp
;
4013 if (bfd_count_sections (output_bfd
) <= 1)
4016 amt
= bfd_count_sections (output_bfd
) * sizeof (asection
*);
4017 sections
= xmalloc (amt
);
4019 /* Scan all sections in the output list. */
4021 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4023 /* Only consider loadable sections with real contents. */
4024 if (IGNORE_SECTION (s
) || s
->size
== 0)
4027 sections
[count
] = s
;
4034 qsort (sections
, (size_t) count
, sizeof (asection
*),
4035 sort_sections_by_lma
);
4039 s_start
= bfd_section_lma (output_bfd
, s
);
4040 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4041 for (count
--; count
; count
--)
4043 /* We must check the sections' LMA addresses not their VMA
4044 addresses because overlay sections can have overlapping VMAs
4045 but they must have distinct LMAs. */
4050 s_start
= bfd_section_lma (output_bfd
, s
);
4051 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
4053 /* Look for an overlap. */
4054 if (s_end
>= os_start
&& s_start
<= os_end
)
4055 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
4056 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
4062 /* Make sure the new address is within the region. We explicitly permit the
4063 current address to be at the exact end of the region when the address is
4064 non-zero, in case the region is at the end of addressable memory and the
4065 calculation wraps around. */
4068 os_region_check (lang_output_section_statement_type
*os
,
4069 lang_memory_region_type
*region
,
4073 if ((region
->current
< region
->origin
4074 || (region
->current
- region
->origin
> region
->length
))
4075 && ((region
->current
!= region
->origin
+ region
->length
)
4080 einfo (_("%X%P: address 0x%v of %B section %s"
4081 " is not within region %s\n"),
4083 os
->bfd_section
->owner
,
4084 os
->bfd_section
->name
,
4089 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4091 os
->bfd_section
->owner
,
4092 os
->bfd_section
->name
);
4094 /* Reset the region pointer. */
4095 region
->current
= region
->origin
;
4099 /* Set the sizes for all the output sections. */
4102 lang_size_sections_1
4103 (lang_statement_union_type
*s
,
4104 lang_output_section_statement_type
*output_section_statement
,
4105 lang_statement_union_type
**prev
,
4109 bfd_boolean check_regions
)
4111 /* Size up the sections from their constituent parts. */
4112 for (; s
!= NULL
; s
= s
->header
.next
)
4114 switch (s
->header
.type
)
4116 case lang_output_section_statement_enum
:
4118 bfd_vma newdot
, after
;
4119 lang_output_section_statement_type
*os
;
4121 os
= &s
->output_section_statement
;
4122 if (os
->addr_tree
!= NULL
)
4124 os
->processed
= FALSE
;
4125 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4127 if (!expld
.result
.valid_p
4128 && expld
.phase
!= lang_mark_phase_enum
)
4129 einfo (_("%F%S: non constant or forward reference"
4130 " address expression for section %s\n"),
4133 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4136 if (os
->bfd_section
== NULL
)
4137 /* This section was removed or never actually created. */
4140 /* If this is a COFF shared library section, use the size and
4141 address from the input section. FIXME: This is COFF
4142 specific; it would be cleaner if there were some other way
4143 to do this, but nothing simple comes to mind. */
4144 if ((bfd_get_flavour (output_bfd
) == bfd_target_ecoff_flavour
4145 || bfd_get_flavour (output_bfd
) == bfd_target_coff_flavour
)
4146 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4150 if (os
->children
.head
== NULL
4151 || os
->children
.head
->header
.next
!= NULL
4152 || (os
->children
.head
->header
.type
4153 != lang_input_section_enum
))
4154 einfo (_("%P%X: Internal error on COFF shared library"
4155 " section %s\n"), os
->name
);
4157 input
= os
->children
.head
->input_section
.section
;
4158 bfd_set_section_vma (os
->bfd_section
->owner
,
4160 bfd_section_vma (input
->owner
, input
));
4161 os
->bfd_section
->size
= input
->size
;
4166 if (bfd_is_abs_section (os
->bfd_section
))
4168 /* No matter what happens, an abs section starts at zero. */
4169 ASSERT (os
->bfd_section
->vma
== 0);
4175 if (os
->addr_tree
== NULL
)
4177 /* No address specified for this section, get one
4178 from the region specification. */
4179 if (os
->region
== NULL
4180 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4181 && os
->region
->name
[0] == '*'
4182 && strcmp (os
->region
->name
,
4183 DEFAULT_MEMORY_REGION
) == 0))
4185 os
->region
= lang_memory_default (os
->bfd_section
);
4188 /* If a loadable section is using the default memory
4189 region, and some non default memory regions were
4190 defined, issue an error message. */
4192 && !IGNORE_SECTION (os
->bfd_section
)
4193 && ! link_info
.relocatable
4195 && strcmp (os
->region
->name
,
4196 DEFAULT_MEMORY_REGION
) == 0
4197 && lang_memory_region_list
!= NULL
4198 && (strcmp (lang_memory_region_list
->name
,
4199 DEFAULT_MEMORY_REGION
) != 0
4200 || lang_memory_region_list
->next
!= NULL
)
4201 && expld
.phase
!= lang_mark_phase_enum
)
4203 /* By default this is an error rather than just a
4204 warning because if we allocate the section to the
4205 default memory region we can end up creating an
4206 excessively large binary, or even seg faulting when
4207 attempting to perform a negative seek. See
4208 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4209 for an example of this. This behaviour can be
4210 overridden by the using the --no-check-sections
4212 if (command_line
.check_section_addresses
)
4213 einfo (_("%P%F: error: no memory region specified"
4214 " for loadable section `%s'\n"),
4215 bfd_get_section_name (output_bfd
,
4218 einfo (_("%P: warning: no memory region specified"
4219 " for loadable section `%s'\n"),
4220 bfd_get_section_name (output_bfd
,
4224 newdot
= os
->region
->current
;
4225 align
= os
->bfd_section
->alignment_power
;
4228 align
= os
->section_alignment
;
4230 /* Align to what the section needs. */
4233 bfd_vma savedot
= newdot
;
4234 newdot
= align_power (newdot
, align
);
4236 if (newdot
!= savedot
4237 && (config
.warn_section_align
4238 || os
->addr_tree
!= NULL
)
4239 && expld
.phase
!= lang_mark_phase_enum
)
4240 einfo (_("%P: warning: changing start of section"
4241 " %s by %lu bytes\n"),
4242 os
->name
, (unsigned long) (newdot
- savedot
));
4245 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4247 os
->bfd_section
->output_offset
= 0;
4250 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4251 os
->fill
, newdot
, relax
, check_regions
);
4253 os
->processed
= TRUE
;
4255 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4257 ASSERT (os
->bfd_section
->size
== 0);
4261 dot
= os
->bfd_section
->vma
;
4263 /* Put the section within the requested block size, or
4264 align at the block boundary. */
4266 + TO_ADDR (os
->bfd_section
->size
)
4267 + os
->block_value
- 1)
4268 & - (bfd_vma
) os
->block_value
);
4270 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4272 /* .tbss sections effectively have zero size. */
4273 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4274 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4275 || link_info
.relocatable
)
4276 dot
+= TO_ADDR (os
->bfd_section
->size
);
4278 if (os
->update_dot_tree
!= 0)
4279 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4281 /* Update dot in the region ?
4282 We only do this if the section is going to be allocated,
4283 since unallocated sections do not contribute to the region's
4284 overall size in memory.
4286 If the SEC_NEVER_LOAD bit is not set, it will affect the
4287 addresses of sections after it. We have to update
4289 if (os
->region
!= NULL
4290 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4291 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4293 os
->region
->current
= dot
;
4296 /* Make sure the new address is within the region. */
4297 os_region_check (os
, os
->region
, os
->addr_tree
,
4298 os
->bfd_section
->vma
);
4300 /* If there's no load address specified, use the run
4301 region as the load region. */
4302 if (os
->lma_region
== NULL
&& os
->load_base
== NULL
)
4303 os
->lma_region
= os
->region
;
4305 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
)
4307 /* Set load_base, which will be handled later. */
4308 os
->load_base
= exp_intop (os
->lma_region
->current
);
4309 os
->lma_region
->current
+=
4310 TO_ADDR (os
->bfd_section
->size
);
4312 os_region_check (os
, os
->lma_region
, NULL
,
4313 os
->bfd_section
->lma
);
4319 case lang_constructors_statement_enum
:
4320 dot
= lang_size_sections_1 (constructor_list
.head
,
4321 output_section_statement
,
4322 &s
->wild_statement
.children
.head
,
4323 fill
, dot
, relax
, check_regions
);
4326 case lang_data_statement_enum
:
4328 unsigned int size
= 0;
4330 s
->data_statement
.output_offset
=
4331 dot
- output_section_statement
->bfd_section
->vma
;
4332 s
->data_statement
.output_section
=
4333 output_section_statement
->bfd_section
;
4335 /* We might refer to provided symbols in the expression, and
4336 need to mark them as needed. */
4337 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4339 switch (s
->data_statement
.type
)
4357 if (size
< TO_SIZE ((unsigned) 1))
4358 size
= TO_SIZE ((unsigned) 1);
4359 dot
+= TO_ADDR (size
);
4360 output_section_statement
->bfd_section
->size
+= size
;
4364 case lang_reloc_statement_enum
:
4368 s
->reloc_statement
.output_offset
=
4369 dot
- output_section_statement
->bfd_section
->vma
;
4370 s
->reloc_statement
.output_section
=
4371 output_section_statement
->bfd_section
;
4372 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4373 dot
+= TO_ADDR (size
);
4374 output_section_statement
->bfd_section
->size
+= size
;
4378 case lang_wild_statement_enum
:
4379 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4380 output_section_statement
,
4381 &s
->wild_statement
.children
.head
,
4382 fill
, dot
, relax
, check_regions
);
4385 case lang_object_symbols_statement_enum
:
4386 link_info
.create_object_symbols_section
=
4387 output_section_statement
->bfd_section
;
4390 case lang_output_statement_enum
:
4391 case lang_target_statement_enum
:
4394 case lang_input_section_enum
:
4398 i
= (*prev
)->input_section
.section
;
4403 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4404 einfo (_("%P%F: can't relax section: %E\n"));
4408 dot
= size_input_section (prev
, output_section_statement
,
4409 output_section_statement
->fill
, dot
);
4413 case lang_input_statement_enum
:
4416 case lang_fill_statement_enum
:
4417 s
->fill_statement
.output_section
=
4418 output_section_statement
->bfd_section
;
4420 fill
= s
->fill_statement
.fill
;
4423 case lang_assignment_statement_enum
:
4425 bfd_vma newdot
= dot
;
4427 exp_fold_tree (s
->assignment_statement
.exp
,
4428 output_section_statement
->bfd_section
,
4431 if (newdot
!= dot
&& !output_section_statement
->ignored
)
4433 if (output_section_statement
== abs_output_section
)
4435 /* If we don't have an output section, then just adjust
4436 the default memory address. */
4437 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4438 FALSE
)->current
= newdot
;
4442 /* Insert a pad after this statement. We can't
4443 put the pad before when relaxing, in case the
4444 assignment references dot. */
4445 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4446 output_section_statement
->bfd_section
, dot
);
4448 /* Don't neuter the pad below when relaxing. */
4451 /* If dot is advanced, this implies that the section
4452 should have space allocated to it, unless the
4453 user has explicitly stated that the section
4454 should never be loaded. */
4455 if (!(output_section_statement
->flags
4456 & (SEC_NEVER_LOAD
| SEC_ALLOC
)))
4457 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4464 case lang_padding_statement_enum
:
4465 /* If this is the first time lang_size_sections is called,
4466 we won't have any padding statements. If this is the
4467 second or later passes when relaxing, we should allow
4468 padding to shrink. If padding is needed on this pass, it
4469 will be added back in. */
4470 s
->padding_statement
.size
= 0;
4472 /* Make sure output_offset is valid. If relaxation shrinks
4473 the section and this pad isn't needed, it's possible to
4474 have output_offset larger than the final size of the
4475 section. bfd_set_section_contents will complain even for
4476 a pad size of zero. */
4477 s
->padding_statement
.output_offset
4478 = dot
- output_section_statement
->bfd_section
->vma
;
4481 case lang_group_statement_enum
:
4482 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4483 output_section_statement
,
4484 &s
->group_statement
.children
.head
,
4485 fill
, dot
, relax
, check_regions
);
4492 /* We can only get here when relaxing is turned on. */
4493 case lang_address_statement_enum
:
4496 prev
= &s
->header
.next
;
4502 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
4504 lang_statement_iteration
++;
4505 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
4506 &statement_list
.head
, 0, 0, relax
, check_regions
);
4510 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
4512 expld
.phase
= lang_allocating_phase_enum
;
4513 expld
.dataseg
.phase
= exp_dataseg_none
;
4515 one_lang_size_sections_pass (relax
, check_regions
);
4516 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
4517 && link_info
.relro
&& expld
.dataseg
.relro_end
)
4519 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4520 to put expld.dataseg.relro on a (common) page boundary. */
4521 bfd_vma old_min_base
, relro_end
, maxpage
;
4523 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
4524 old_min_base
= expld
.dataseg
.min_base
;
4525 maxpage
= expld
.dataseg
.maxpagesize
;
4526 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
4527 & (expld
.dataseg
.pagesize
- 1));
4528 /* Compute the expected PT_GNU_RELRO segment end. */
4529 relro_end
= (expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
4530 & ~(expld
.dataseg
.pagesize
- 1);
4531 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
4533 expld
.dataseg
.base
-= maxpage
;
4534 relro_end
-= maxpage
;
4536 lang_reset_memory_regions ();
4537 one_lang_size_sections_pass (relax
, check_regions
);
4538 if (expld
.dataseg
.relro_end
> relro_end
)
4540 /* The alignment of sections between DATA_SEGMENT_ALIGN
4541 and DATA_SEGMENT_RELRO_END caused huge padding to be
4542 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4544 unsigned int max_alignment_power
= 0;
4546 /* Find maximum alignment power of sections between
4547 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4548 for (sec
= output_bfd
->sections
; sec
; sec
= sec
->next
)
4549 if (sec
->vma
>= expld
.dataseg
.base
4550 && sec
->vma
< expld
.dataseg
.relro_end
4551 && sec
->alignment_power
> max_alignment_power
)
4552 max_alignment_power
= sec
->alignment_power
;
4554 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
4556 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
4558 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
4559 expld
.dataseg
.base
-= (1 << max_alignment_power
);
4560 lang_reset_memory_regions ();
4561 one_lang_size_sections_pass (relax
, check_regions
);
4564 link_info
.relro_start
= expld
.dataseg
.base
;
4565 link_info
.relro_end
= expld
.dataseg
.relro_end
;
4567 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
4569 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4570 a page could be saved in the data segment. */
4571 bfd_vma first
, last
;
4573 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
4574 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
4576 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
4577 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
4578 && first
+ last
<= expld
.dataseg
.pagesize
)
4580 expld
.dataseg
.phase
= exp_dataseg_adjust
;
4581 lang_reset_memory_regions ();
4582 one_lang_size_sections_pass (relax
, check_regions
);
4586 expld
.phase
= lang_final_phase_enum
;
4589 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4592 lang_do_assignments_1
4593 (lang_statement_union_type
*s
,
4594 lang_output_section_statement_type
*output_section_statement
,
4598 for (; s
!= NULL
; s
= s
->header
.next
)
4600 switch (s
->header
.type
)
4602 case lang_constructors_statement_enum
:
4603 dot
= lang_do_assignments_1 (constructor_list
.head
,
4604 output_section_statement
,
4609 case lang_output_section_statement_enum
:
4611 lang_output_section_statement_type
*os
;
4613 os
= &(s
->output_section_statement
);
4614 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
4616 dot
= os
->bfd_section
->vma
;
4617 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
4618 /* .tbss sections effectively have zero size. */
4619 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4620 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4621 || link_info
.relocatable
)
4622 dot
+= TO_ADDR (os
->bfd_section
->size
);
4626 /* If nothing has been placed into the output section then
4627 it won't have a bfd_section. */
4628 if (os
->bfd_section
&& !os
->ignored
)
4630 os
->bfd_section
->lma
4631 = exp_get_abs_int (os
->load_base
, 0, "load base");
4637 case lang_wild_statement_enum
:
4639 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
4640 output_section_statement
,
4644 case lang_object_symbols_statement_enum
:
4645 case lang_output_statement_enum
:
4646 case lang_target_statement_enum
:
4649 case lang_data_statement_enum
:
4650 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4651 if (expld
.result
.valid_p
)
4652 s
->data_statement
.value
= (expld
.result
.value
4653 + expld
.result
.section
->vma
);
4655 einfo (_("%F%P: invalid data statement\n"));
4658 switch (s
->data_statement
.type
)
4676 if (size
< TO_SIZE ((unsigned) 1))
4677 size
= TO_SIZE ((unsigned) 1);
4678 dot
+= TO_ADDR (size
);
4682 case lang_reloc_statement_enum
:
4683 exp_fold_tree (s
->reloc_statement
.addend_exp
,
4684 bfd_abs_section_ptr
, &dot
);
4685 if (expld
.result
.valid_p
)
4686 s
->reloc_statement
.addend_value
= expld
.result
.value
;
4688 einfo (_("%F%P: invalid reloc statement\n"));
4689 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
4692 case lang_input_section_enum
:
4694 asection
*in
= s
->input_section
.section
;
4696 if ((in
->flags
& SEC_EXCLUDE
) == 0)
4697 dot
+= TO_ADDR (in
->size
);
4701 case lang_input_statement_enum
:
4704 case lang_fill_statement_enum
:
4705 fill
= s
->fill_statement
.fill
;
4708 case lang_assignment_statement_enum
:
4709 exp_fold_tree (s
->assignment_statement
.exp
,
4710 output_section_statement
->bfd_section
,
4714 case lang_padding_statement_enum
:
4715 dot
+= TO_ADDR (s
->padding_statement
.size
);
4718 case lang_group_statement_enum
:
4719 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
4720 output_section_statement
,
4728 case lang_address_statement_enum
:
4736 lang_do_assignments (void)
4738 lang_statement_iteration
++;
4739 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
4742 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4743 operator .startof. (section_name), it produces an undefined symbol
4744 .startof.section_name. Similarly, when it sees
4745 .sizeof. (section_name), it produces an undefined symbol
4746 .sizeof.section_name. For all the output sections, we look for
4747 such symbols, and set them to the correct value. */
4750 lang_set_startof (void)
4754 if (link_info
.relocatable
)
4757 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4759 const char *secname
;
4761 struct bfd_link_hash_entry
*h
;
4763 secname
= bfd_get_section_name (output_bfd
, s
);
4764 buf
= xmalloc (10 + strlen (secname
));
4766 sprintf (buf
, ".startof.%s", secname
);
4767 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4768 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4770 h
->type
= bfd_link_hash_defined
;
4771 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, s
);
4772 h
->u
.def
.section
= bfd_abs_section_ptr
;
4775 sprintf (buf
, ".sizeof.%s", secname
);
4776 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4777 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4779 h
->type
= bfd_link_hash_defined
;
4780 h
->u
.def
.value
= TO_ADDR (s
->size
);
4781 h
->u
.def
.section
= bfd_abs_section_ptr
;
4791 struct bfd_link_hash_entry
*h
;
4794 if (link_info
.relocatable
|| link_info
.shared
)
4799 if (entry_symbol
.name
== NULL
)
4801 /* No entry has been specified. Look for the default entry, but
4802 don't warn if we don't find it. */
4803 entry_symbol
.name
= entry_symbol_default
;
4807 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
4808 FALSE
, FALSE
, TRUE
);
4810 && (h
->type
== bfd_link_hash_defined
4811 || h
->type
== bfd_link_hash_defweak
)
4812 && h
->u
.def
.section
->output_section
!= NULL
)
4816 val
= (h
->u
.def
.value
4817 + bfd_get_section_vma (output_bfd
,
4818 h
->u
.def
.section
->output_section
)
4819 + h
->u
.def
.section
->output_offset
);
4820 if (! bfd_set_start_address (output_bfd
, val
))
4821 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
4828 /* We couldn't find the entry symbol. Try parsing it as a
4830 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
4833 if (! bfd_set_start_address (output_bfd
, val
))
4834 einfo (_("%P%F: can't set start address\n"));
4840 /* Can't find the entry symbol, and it's not a number. Use
4841 the first address in the text section. */
4842 ts
= bfd_get_section_by_name (output_bfd
, entry_section
);
4846 einfo (_("%P: warning: cannot find entry symbol %s;"
4847 " defaulting to %V\n"),
4849 bfd_get_section_vma (output_bfd
, ts
));
4850 if (! bfd_set_start_address (output_bfd
,
4851 bfd_get_section_vma (output_bfd
,
4853 einfo (_("%P%F: can't set start address\n"));
4858 einfo (_("%P: warning: cannot find entry symbol %s;"
4859 " not setting start address\n"),
4865 /* Don't bfd_hash_table_free (&lang_definedness_table);
4866 map file output may result in a call of lang_track_definedness. */
4869 /* This is a small function used when we want to ignore errors from
4873 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
4875 /* Don't do anything. */
4878 /* Check that the architecture of all the input files is compatible
4879 with the output file. Also call the backend to let it do any
4880 other checking that is needed. */
4885 lang_statement_union_type
*file
;
4887 const bfd_arch_info_type
*compatible
;
4889 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
4891 input_bfd
= file
->input_statement
.the_bfd
;
4893 = bfd_arch_get_compatible (input_bfd
, output_bfd
,
4894 command_line
.accept_unknown_input_arch
);
4896 /* In general it is not possible to perform a relocatable
4897 link between differing object formats when the input
4898 file has relocations, because the relocations in the
4899 input format may not have equivalent representations in
4900 the output format (and besides BFD does not translate
4901 relocs for other link purposes than a final link). */
4902 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
4903 && (compatible
== NULL
4904 || bfd_get_flavour (input_bfd
) != bfd_get_flavour (output_bfd
))
4905 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
4907 einfo (_("%P%F: Relocatable linking with relocations from"
4908 " format %s (%B) to format %s (%B) is not supported\n"),
4909 bfd_get_target (input_bfd
), input_bfd
,
4910 bfd_get_target (output_bfd
), output_bfd
);
4911 /* einfo with %F exits. */
4914 if (compatible
== NULL
)
4916 if (command_line
.warn_mismatch
)
4917 einfo (_("%P: warning: %s architecture of input file `%B'"
4918 " is incompatible with %s output\n"),
4919 bfd_printable_name (input_bfd
), input_bfd
,
4920 bfd_printable_name (output_bfd
));
4922 else if (bfd_count_sections (input_bfd
))
4924 /* If the input bfd has no contents, it shouldn't set the
4925 private data of the output bfd. */
4927 bfd_error_handler_type pfn
= NULL
;
4929 /* If we aren't supposed to warn about mismatched input
4930 files, temporarily set the BFD error handler to a
4931 function which will do nothing. We still want to call
4932 bfd_merge_private_bfd_data, since it may set up
4933 information which is needed in the output file. */
4934 if (! command_line
.warn_mismatch
)
4935 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
4936 if (! bfd_merge_private_bfd_data (input_bfd
, output_bfd
))
4938 if (command_line
.warn_mismatch
)
4939 einfo (_("%P%X: failed to merge target specific data"
4940 " of file %B\n"), input_bfd
);
4942 if (! command_line
.warn_mismatch
)
4943 bfd_set_error_handler (pfn
);
4948 /* Look through all the global common symbols and attach them to the
4949 correct section. The -sort-common command line switch may be used
4950 to roughly sort the entries by size. */
4955 if (command_line
.inhibit_common_definition
)
4957 if (link_info
.relocatable
4958 && ! command_line
.force_common_definition
)
4961 if (! config
.sort_common
)
4962 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
4967 for (power
= 4; power
>= 0; power
--)
4968 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
4972 /* Place one common symbol in the correct section. */
4975 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
4977 unsigned int power_of_two
;
4981 if (h
->type
!= bfd_link_hash_common
)
4985 power_of_two
= h
->u
.c
.p
->alignment_power
;
4987 if (config
.sort_common
4988 && power_of_two
< (unsigned int) *(int *) info
)
4991 section
= h
->u
.c
.p
->section
;
4993 /* Increase the size of the section to align the common sym. */
4994 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
4995 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
4997 /* Adjust the alignment if necessary. */
4998 if (power_of_two
> section
->alignment_power
)
4999 section
->alignment_power
= power_of_two
;
5001 /* Change the symbol from common to defined. */
5002 h
->type
= bfd_link_hash_defined
;
5003 h
->u
.def
.section
= section
;
5004 h
->u
.def
.value
= section
->size
;
5006 /* Increase the size of the section. */
5007 section
->size
+= size
;
5009 /* Make sure the section is allocated in memory, and make sure that
5010 it is no longer a common section. */
5011 section
->flags
|= SEC_ALLOC
;
5012 section
->flags
&= ~SEC_IS_COMMON
;
5014 if (config
.map_file
!= NULL
)
5016 static bfd_boolean header_printed
;
5021 if (! header_printed
)
5023 minfo (_("\nAllocating common symbols\n"));
5024 minfo (_("Common symbol size file\n\n"));
5025 header_printed
= TRUE
;
5028 name
= demangle (h
->root
.string
);
5030 len
= strlen (name
);
5045 if (size
<= 0xffffffff)
5046 sprintf (buf
, "%lx", (unsigned long) size
);
5048 sprintf_vma (buf
, size
);
5058 minfo ("%B\n", section
->owner
);
5064 /* Run through the input files and ensure that every input section has
5065 somewhere to go. If one is found without a destination then create
5066 an input request and place it into the statement tree. */
5069 lang_place_orphans (void)
5071 LANG_FOR_EACH_INPUT_STATEMENT (file
)
5075 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
5077 if (s
->output_section
== NULL
)
5079 /* This section of the file is not attached, root
5080 around for a sensible place for it to go. */
5082 if (file
->just_syms_flag
)
5083 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5084 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5085 s
->output_section
= bfd_abs_section_ptr
;
5086 else if (strcmp (s
->name
, "COMMON") == 0)
5088 /* This is a lonely common section which must have
5089 come from an archive. We attach to the section
5090 with the wildcard. */
5091 if (! link_info
.relocatable
5092 || command_line
.force_common_definition
)
5094 if (default_common_section
== NULL
)
5096 default_common_section
=
5097 lang_output_section_statement_lookup (".bss");
5100 lang_add_section (&default_common_section
->children
, s
,
5101 default_common_section
);
5104 else if (ldemul_place_orphan (s
))
5108 lang_output_section_statement_type
*os
;
5110 os
= lang_output_section_statement_lookup (s
->name
);
5111 lang_add_section (&os
->children
, s
, os
);
5119 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5121 flagword
*ptr_flags
;
5123 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5129 *ptr_flags
|= SEC_ALLOC
;
5133 *ptr_flags
|= SEC_READONLY
;
5137 *ptr_flags
|= SEC_DATA
;
5141 *ptr_flags
|= SEC_CODE
;
5146 *ptr_flags
|= SEC_LOAD
;
5150 einfo (_("%P%F: invalid syntax in flags\n"));
5157 /* Call a function on each input file. This function will be called
5158 on an archive, but not on the elements. */
5161 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5163 lang_input_statement_type
*f
;
5165 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5167 f
= (lang_input_statement_type
*) f
->next_real_file
)
5171 /* Call a function on each file. The function will be called on all
5172 the elements of an archive which are included in the link, but will
5173 not be called on the archive file itself. */
5176 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5178 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5185 ldlang_add_file (lang_input_statement_type
*entry
)
5189 lang_statement_append (&file_chain
,
5190 (lang_statement_union_type
*) entry
,
5193 /* The BFD linker needs to have a list of all input BFDs involved in
5195 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5196 ASSERT (entry
->the_bfd
!= output_bfd
);
5197 for (pp
= &link_info
.input_bfds
; *pp
!= NULL
; pp
= &(*pp
)->link_next
)
5199 *pp
= entry
->the_bfd
;
5200 entry
->the_bfd
->usrdata
= entry
;
5201 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5203 /* Look through the sections and check for any which should not be
5204 included in the link. We need to do this now, so that we can
5205 notice when the backend linker tries to report multiple
5206 definition errors for symbols which are in sections we aren't
5207 going to link. FIXME: It might be better to entirely ignore
5208 symbols which are defined in sections which are going to be
5209 discarded. This would require modifying the backend linker for
5210 each backend which might set the SEC_LINK_ONCE flag. If we do
5211 this, we should probably handle SEC_EXCLUDE in the same way. */
5213 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5217 lang_add_output (const char *name
, int from_script
)
5219 /* Make -o on command line override OUTPUT in script. */
5220 if (!had_output_filename
|| !from_script
)
5222 output_filename
= name
;
5223 had_output_filename
= TRUE
;
5227 static lang_output_section_statement_type
*current_section
;
5238 for (l
= 0; l
< 32; l
++)
5240 if (i
>= (unsigned int) x
)
5248 lang_output_section_statement_type
*
5249 lang_enter_output_section_statement (const char *output_section_statement_name
,
5250 etree_type
*address_exp
,
5251 enum section_type sectype
,
5253 etree_type
*subalign
,
5257 lang_output_section_statement_type
*os
;
5259 os
= lang_output_section_statement_lookup_1 (output_section_statement_name
,
5261 current_section
= os
;
5263 /* Make next things chain into subchain of this. */
5265 if (os
->addr_tree
== NULL
)
5267 os
->addr_tree
= address_exp
;
5269 os
->sectype
= sectype
;
5270 if (sectype
!= noload_section
)
5271 os
->flags
= SEC_NO_FLAGS
;
5273 os
->flags
= SEC_NEVER_LOAD
;
5274 os
->block_value
= 1;
5275 stat_ptr
= &os
->children
;
5277 os
->subsection_alignment
=
5278 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5279 os
->section_alignment
=
5280 topower (exp_get_value_int (align
, -1, "section alignment"));
5282 os
->load_base
= ebase
;
5289 lang_output_statement_type
*new;
5291 new = new_stat (lang_output_statement
, stat_ptr
);
5292 new->name
= output_filename
;
5295 /* Reset the current counters in the regions. */
5298 lang_reset_memory_regions (void)
5300 lang_memory_region_type
*p
= lang_memory_region_list
;
5302 lang_output_section_statement_type
*os
;
5304 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5306 p
->old_length
= (bfd_size_type
) (p
->current
- p
->origin
);
5307 p
->current
= p
->origin
;
5310 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5313 os
->processed
= FALSE
;
5315 for (o
= output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5317 /* Save the last size for possible use by bfd_relax_section. */
5318 o
->rawsize
= o
->size
;
5323 /* Worker for lang_gc_sections_1. */
5326 gc_section_callback (lang_wild_statement_type
*ptr
,
5327 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5329 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5330 void *data ATTRIBUTE_UNUSED
)
5332 /* If the wild pattern was marked KEEP, the member sections
5333 should be as well. */
5334 if (ptr
->keep_sections
)
5335 section
->flags
|= SEC_KEEP
;
5338 /* Iterate over sections marking them against GC. */
5341 lang_gc_sections_1 (lang_statement_union_type
*s
)
5343 for (; s
!= NULL
; s
= s
->header
.next
)
5345 switch (s
->header
.type
)
5347 case lang_wild_statement_enum
:
5348 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5350 case lang_constructors_statement_enum
:
5351 lang_gc_sections_1 (constructor_list
.head
);
5353 case lang_output_section_statement_enum
:
5354 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5356 case lang_group_statement_enum
:
5357 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5366 lang_gc_sections (void)
5368 struct bfd_link_hash_entry
*h
;
5369 ldlang_undef_chain_list_type
*ulist
;
5371 /* Keep all sections so marked in the link script. */
5373 lang_gc_sections_1 (statement_list
.head
);
5375 /* Keep all sections containing symbols undefined on the command-line,
5376 and the section containing the entry symbol. */
5378 for (ulist
= link_info
.gc_sym_list
; ulist
; ulist
= ulist
->next
)
5380 h
= bfd_link_hash_lookup (link_info
.hash
, ulist
->name
,
5381 FALSE
, FALSE
, FALSE
);
5384 && (h
->type
== bfd_link_hash_defined
5385 || h
->type
== bfd_link_hash_defweak
)
5386 && ! bfd_is_abs_section (h
->u
.def
.section
))
5388 h
->u
.def
.section
->flags
|= SEC_KEEP
;
5392 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5393 the special case of debug info. (See bfd/stabs.c)
5394 Twiddle the flag here, to simplify later linker code. */
5395 if (link_info
.relocatable
)
5397 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5400 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5401 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5402 sec
->flags
&= ~SEC_EXCLUDE
;
5406 if (link_info
.gc_sections
)
5407 bfd_gc_sections (output_bfd
, &link_info
);
5410 /* Relax all sections until bfd_relax_section gives up. */
5413 relax_sections (void)
5415 /* Keep relaxing until bfd_relax_section gives up. */
5416 bfd_boolean relax_again
;
5420 relax_again
= FALSE
;
5422 /* Note: pe-dll.c does something like this also. If you find
5423 you need to change this code, you probably need to change
5424 pe-dll.c also. DJ */
5426 /* Do all the assignments with our current guesses as to
5428 lang_do_assignments ();
5430 /* We must do this after lang_do_assignments, because it uses
5432 lang_reset_memory_regions ();
5434 /* Perform another relax pass - this time we know where the
5435 globals are, so can make a better guess. */
5436 lang_size_sections (&relax_again
, FALSE
);
5438 while (relax_again
);
5444 current_target
= default_target
;
5446 /* Open the output file. */
5447 lang_for_each_statement (ldlang_open_output
);
5450 ldemul_create_output_section_statements ();
5452 /* Add to the hash table all undefineds on the command line. */
5453 lang_place_undefineds ();
5455 if (!bfd_section_already_linked_table_init ())
5456 einfo (_("%P%F: Failed to create hash table\n"));
5458 /* Create a bfd for each input file. */
5459 current_target
= default_target
;
5460 open_input_bfds (statement_list
.head
, FALSE
);
5462 link_info
.gc_sym_list
= &entry_symbol
;
5463 if (entry_symbol
.name
== NULL
)
5464 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
5466 ldemul_after_open ();
5468 bfd_section_already_linked_table_free ();
5470 /* Make sure that we're not mixing architectures. We call this
5471 after all the input files have been opened, but before we do any
5472 other processing, so that any operations merge_private_bfd_data
5473 does on the output file will be known during the rest of the
5477 /* Handle .exports instead of a version script if we're told to do so. */
5478 if (command_line
.version_exports_section
)
5479 lang_do_version_exports_section ();
5481 /* Build all sets based on the information gathered from the input
5483 ldctor_build_sets ();
5485 /* Remove unreferenced sections if asked to. */
5486 lang_gc_sections ();
5488 /* Size up the common data. */
5491 /* Update wild statements. */
5492 update_wild_statements (statement_list
.head
);
5494 /* Run through the contours of the script and attach input sections
5495 to the correct output sections. */
5496 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
5498 /* Find any sections not attached explicitly and handle them. */
5499 lang_place_orphans ();
5501 if (! link_info
.relocatable
)
5505 /* Merge SEC_MERGE sections. This has to be done after GC of
5506 sections, so that GCed sections are not merged, but before
5507 assigning dynamic symbols, since removing whole input sections
5509 bfd_merge_sections (output_bfd
, &link_info
);
5511 /* Look for a text section and set the readonly attribute in it. */
5512 found
= bfd_get_section_by_name (output_bfd
, ".text");
5516 if (config
.text_read_only
)
5517 found
->flags
|= SEC_READONLY
;
5519 found
->flags
&= ~SEC_READONLY
;
5523 /* Do anything special before sizing sections. This is where ELF
5524 and other back-ends size dynamic sections. */
5525 ldemul_before_allocation ();
5527 /* We must record the program headers before we try to fix the
5528 section positions, since they will affect SIZEOF_HEADERS. */
5529 lang_record_phdrs ();
5531 /* Size up the sections. */
5532 lang_size_sections (NULL
, !command_line
.relax
);
5534 /* Now run around and relax if we can. */
5535 if (command_line
.relax
)
5537 /* We may need more than one relaxation pass. */
5538 int i
= link_info
.relax_pass
;
5540 /* The backend can use it to determine the current pass. */
5541 link_info
.relax_pass
= 0;
5546 link_info
.relax_pass
++;
5549 /* Final extra sizing to report errors. */
5550 lang_do_assignments ();
5551 lang_reset_memory_regions ();
5552 lang_size_sections (NULL
, TRUE
);
5555 /* See if anything special should be done now we know how big
5557 ldemul_after_allocation ();
5559 /* Fix any .startof. or .sizeof. symbols. */
5560 lang_set_startof ();
5562 /* Do all the assignments, now that we know the final resting places
5563 of all the symbols. */
5565 lang_do_assignments ();
5567 /* Make sure that the section addresses make sense. */
5568 if (! link_info
.relocatable
5569 && command_line
.check_section_addresses
)
5570 lang_check_section_addresses ();
5577 /* EXPORTED TO YACC */
5580 lang_add_wild (struct wildcard_spec
*filespec
,
5581 struct wildcard_list
*section_list
,
5582 bfd_boolean keep_sections
)
5584 struct wildcard_list
*curr
, *next
;
5585 lang_wild_statement_type
*new;
5587 /* Reverse the list as the parser puts it back to front. */
5588 for (curr
= section_list
, section_list
= NULL
;
5590 section_list
= curr
, curr
= next
)
5592 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
5593 placed_commons
= TRUE
;
5596 curr
->next
= section_list
;
5599 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
5601 if (strcmp (filespec
->name
, "*") == 0)
5602 filespec
->name
= NULL
;
5603 else if (! wildcardp (filespec
->name
))
5604 lang_has_input_file
= TRUE
;
5607 new = new_stat (lang_wild_statement
, stat_ptr
);
5608 new->filename
= NULL
;
5609 new->filenames_sorted
= FALSE
;
5610 if (filespec
!= NULL
)
5612 new->filename
= filespec
->name
;
5613 new->filenames_sorted
= filespec
->sorted
== by_name
;
5615 new->section_list
= section_list
;
5616 new->keep_sections
= keep_sections
;
5617 lang_list_init (&new->children
);
5618 analyze_walk_wild_section_handler (new);
5622 lang_section_start (const char *name
, etree_type
*address
,
5623 const segment_type
*segment
)
5625 lang_address_statement_type
*ad
;
5627 ad
= new_stat (lang_address_statement
, stat_ptr
);
5628 ad
->section_name
= name
;
5629 ad
->address
= address
;
5630 ad
->segment
= segment
;
5633 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5634 because of a -e argument on the command line, or zero if this is
5635 called by ENTRY in a linker script. Command line arguments take
5639 lang_add_entry (const char *name
, bfd_boolean cmdline
)
5641 if (entry_symbol
.name
== NULL
5643 || ! entry_from_cmdline
)
5645 entry_symbol
.name
= name
;
5646 entry_from_cmdline
= cmdline
;
5650 /* Set the default start symbol to NAME. .em files should use this,
5651 not lang_add_entry, to override the use of "start" if neither the
5652 linker script nor the command line specifies an entry point. NAME
5653 must be permanently allocated. */
5655 lang_default_entry (const char *name
)
5657 entry_symbol_default
= name
;
5661 lang_add_target (const char *name
)
5663 lang_target_statement_type
*new;
5665 new = new_stat (lang_target_statement
, stat_ptr
);
5670 lang_add_map (const char *name
)
5677 map_option_f
= TRUE
;
5685 lang_add_fill (fill_type
*fill
)
5687 lang_fill_statement_type
*new;
5689 new = new_stat (lang_fill_statement
, stat_ptr
);
5694 lang_add_data (int type
, union etree_union
*exp
)
5696 lang_data_statement_type
*new;
5698 new = new_stat (lang_data_statement
, stat_ptr
);
5703 /* Create a new reloc statement. RELOC is the BFD relocation type to
5704 generate. HOWTO is the corresponding howto structure (we could
5705 look this up, but the caller has already done so). SECTION is the
5706 section to generate a reloc against, or NAME is the name of the
5707 symbol to generate a reloc against. Exactly one of SECTION and
5708 NAME must be NULL. ADDEND is an expression for the addend. */
5711 lang_add_reloc (bfd_reloc_code_real_type reloc
,
5712 reloc_howto_type
*howto
,
5715 union etree_union
*addend
)
5717 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
5721 p
->section
= section
;
5723 p
->addend_exp
= addend
;
5725 p
->addend_value
= 0;
5726 p
->output_section
= NULL
;
5727 p
->output_offset
= 0;
5730 lang_assignment_statement_type
*
5731 lang_add_assignment (etree_type
*exp
)
5733 lang_assignment_statement_type
*new;
5735 new = new_stat (lang_assignment_statement
, stat_ptr
);
5741 lang_add_attribute (enum statement_enum attribute
)
5743 new_statement (attribute
, sizeof (lang_statement_header_type
), stat_ptr
);
5747 lang_startup (const char *name
)
5749 if (startup_file
!= NULL
)
5751 einfo (_("%P%F: multiple STARTUP files\n"));
5753 first_file
->filename
= name
;
5754 first_file
->local_sym_name
= name
;
5755 first_file
->real
= TRUE
;
5757 startup_file
= name
;
5761 lang_float (bfd_boolean maybe
)
5763 lang_float_flag
= maybe
;
5767 /* Work out the load- and run-time regions from a script statement, and
5768 store them in *LMA_REGION and *REGION respectively.
5770 MEMSPEC is the name of the run-time region, or the value of
5771 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5772 LMA_MEMSPEC is the name of the load-time region, or null if the
5773 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5774 had an explicit load address.
5776 It is an error to specify both a load region and a load address. */
5779 lang_get_regions (lang_memory_region_type
**region
,
5780 lang_memory_region_type
**lma_region
,
5781 const char *memspec
,
5782 const char *lma_memspec
,
5783 bfd_boolean have_lma
,
5784 bfd_boolean have_vma
)
5786 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
5788 /* If no runtime region or VMA has been specified, but the load region
5789 has been specified, then use the load region for the runtime region
5791 if (lma_memspec
!= NULL
5793 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
5794 *region
= *lma_region
;
5796 *region
= lang_memory_region_lookup (memspec
, FALSE
);
5798 if (have_lma
&& lma_memspec
!= 0)
5799 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5803 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
5804 lang_output_section_phdr_list
*phdrs
,
5805 const char *lma_memspec
)
5807 lang_get_regions (¤t_section
->region
,
5808 ¤t_section
->lma_region
,
5809 memspec
, lma_memspec
,
5810 current_section
->load_base
!= NULL
,
5811 current_section
->addr_tree
!= NULL
);
5812 current_section
->fill
= fill
;
5813 current_section
->phdrs
= phdrs
;
5814 stat_ptr
= &statement_list
;
5817 /* Create an absolute symbol with the given name with the value of the
5818 address of first byte of the section named.
5820 If the symbol already exists, then do nothing. */
5823 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
5825 struct bfd_link_hash_entry
*h
;
5827 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5829 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5831 if (h
->type
== bfd_link_hash_new
5832 || h
->type
== bfd_link_hash_undefined
)
5836 h
->type
= bfd_link_hash_defined
;
5838 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5842 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, sec
);
5844 h
->u
.def
.section
= bfd_abs_section_ptr
;
5848 /* Create an absolute symbol with the given name with the value of the
5849 address of the first byte after the end of the section named.
5851 If the symbol already exists, then do nothing. */
5854 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
5856 struct bfd_link_hash_entry
*h
;
5858 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5860 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5862 if (h
->type
== bfd_link_hash_new
5863 || h
->type
== bfd_link_hash_undefined
)
5867 h
->type
= bfd_link_hash_defined
;
5869 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5873 h
->u
.def
.value
= (bfd_get_section_vma (output_bfd
, sec
)
5874 + TO_ADDR (sec
->size
));
5876 h
->u
.def
.section
= bfd_abs_section_ptr
;
5881 lang_statement_append (lang_statement_list_type
*list
,
5882 lang_statement_union_type
*element
,
5883 lang_statement_union_type
**field
)
5885 *(list
->tail
) = element
;
5889 /* Set the output format type. -oformat overrides scripts. */
5892 lang_add_output_format (const char *format
,
5897 if (output_target
== NULL
|| !from_script
)
5899 if (command_line
.endian
== ENDIAN_BIG
5902 else if (command_line
.endian
== ENDIAN_LITTLE
5906 output_target
= format
;
5910 /* Enter a group. This creates a new lang_group_statement, and sets
5911 stat_ptr to build new statements within the group. */
5914 lang_enter_group (void)
5916 lang_group_statement_type
*g
;
5918 g
= new_stat (lang_group_statement
, stat_ptr
);
5919 lang_list_init (&g
->children
);
5920 stat_ptr
= &g
->children
;
5923 /* Leave a group. This just resets stat_ptr to start writing to the
5924 regular list of statements again. Note that this will not work if
5925 groups can occur inside anything else which can adjust stat_ptr,
5926 but currently they can't. */
5929 lang_leave_group (void)
5931 stat_ptr
= &statement_list
;
5934 /* Add a new program header. This is called for each entry in a PHDRS
5935 command in a linker script. */
5938 lang_new_phdr (const char *name
,
5940 bfd_boolean filehdr
,
5945 struct lang_phdr
*n
, **pp
;
5947 n
= stat_alloc (sizeof (struct lang_phdr
));
5950 n
->type
= exp_get_value_int (type
, 0, "program header type");
5951 n
->filehdr
= filehdr
;
5956 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
5961 /* Record the program header information in the output BFD. FIXME: We
5962 should not be calling an ELF specific function here. */
5965 lang_record_phdrs (void)
5969 lang_output_section_phdr_list
*last
;
5970 struct lang_phdr
*l
;
5971 lang_output_section_statement_type
*os
;
5974 secs
= xmalloc (alc
* sizeof (asection
*));
5976 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
5983 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5987 lang_output_section_phdr_list
*pl
;
5989 if (os
->constraint
== -1)
5997 if (os
->sectype
== noload_section
5998 || os
->bfd_section
== NULL
5999 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
6004 if (os
->bfd_section
== NULL
)
6007 for (; pl
!= NULL
; pl
= pl
->next
)
6009 if (strcmp (pl
->name
, l
->name
) == 0)
6014 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
6016 secs
[c
] = os
->bfd_section
;
6023 if (l
->flags
== NULL
)
6026 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
6031 at
= exp_get_vma (l
->at
, 0, "phdr load address");
6033 if (! bfd_record_phdr (output_bfd
, l
->type
,
6034 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
6035 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
6036 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
6041 /* Make sure all the phdr assignments succeeded. */
6042 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
6046 lang_output_section_phdr_list
*pl
;
6048 if (os
->constraint
== -1
6049 || os
->bfd_section
== NULL
)
6052 for (pl
= os
->phdrs
;
6055 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
6056 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
6057 os
->name
, pl
->name
);
6061 /* Record a list of sections which may not be cross referenced. */
6064 lang_add_nocrossref (lang_nocrossref_type
*l
)
6066 struct lang_nocrossrefs
*n
;
6068 n
= xmalloc (sizeof *n
);
6069 n
->next
= nocrossref_list
;
6071 nocrossref_list
= n
;
6073 /* Set notice_all so that we get informed about all symbols. */
6074 link_info
.notice_all
= TRUE
;
6077 /* Overlay handling. We handle overlays with some static variables. */
6079 /* The overlay virtual address. */
6080 static etree_type
*overlay_vma
;
6081 /* And subsection alignment. */
6082 static etree_type
*overlay_subalign
;
6084 /* An expression for the maximum section size seen so far. */
6085 static etree_type
*overlay_max
;
6087 /* A list of all the sections in this overlay. */
6089 struct overlay_list
{
6090 struct overlay_list
*next
;
6091 lang_output_section_statement_type
*os
;
6094 static struct overlay_list
*overlay_list
;
6096 /* Start handling an overlay. */
6099 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6101 /* The grammar should prevent nested overlays from occurring. */
6102 ASSERT (overlay_vma
== NULL
6103 && overlay_subalign
== NULL
6104 && overlay_max
== NULL
);
6106 overlay_vma
= vma_expr
;
6107 overlay_subalign
= subalign
;
6110 /* Start a section in an overlay. We handle this by calling
6111 lang_enter_output_section_statement with the correct VMA.
6112 lang_leave_overlay sets up the LMA and memory regions. */
6115 lang_enter_overlay_section (const char *name
)
6117 struct overlay_list
*n
;
6120 lang_enter_output_section_statement (name
, overlay_vma
, normal_section
,
6121 0, overlay_subalign
, 0, 0);
6123 /* If this is the first section, then base the VMA of future
6124 sections on this one. This will work correctly even if `.' is
6125 used in the addresses. */
6126 if (overlay_list
== NULL
)
6127 overlay_vma
= exp_nameop (ADDR
, name
);
6129 /* Remember the section. */
6130 n
= xmalloc (sizeof *n
);
6131 n
->os
= current_section
;
6132 n
->next
= overlay_list
;
6135 size
= exp_nameop (SIZEOF
, name
);
6137 /* Arrange to work out the maximum section end address. */
6138 if (overlay_max
== NULL
)
6141 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6144 /* Finish a section in an overlay. There isn't any special to do
6148 lang_leave_overlay_section (fill_type
*fill
,
6149 lang_output_section_phdr_list
*phdrs
)
6156 name
= current_section
->name
;
6158 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6159 region and that no load-time region has been specified. It doesn't
6160 really matter what we say here, since lang_leave_overlay will
6162 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6164 /* Define the magic symbols. */
6166 clean
= xmalloc (strlen (name
) + 1);
6168 for (s1
= name
; *s1
!= '\0'; s1
++)
6169 if (ISALNUM (*s1
) || *s1
== '_')
6173 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6174 sprintf (buf
, "__load_start_%s", clean
);
6175 lang_add_assignment (exp_assop ('=', buf
,
6176 exp_nameop (LOADADDR
, name
)));
6178 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6179 sprintf (buf
, "__load_stop_%s", clean
);
6180 lang_add_assignment (exp_assop ('=', buf
,
6182 exp_nameop (LOADADDR
, name
),
6183 exp_nameop (SIZEOF
, name
))));
6188 /* Finish an overlay. If there are any overlay wide settings, this
6189 looks through all the sections in the overlay and sets them. */
6192 lang_leave_overlay (etree_type
*lma_expr
,
6195 const char *memspec
,
6196 lang_output_section_phdr_list
*phdrs
,
6197 const char *lma_memspec
)
6199 lang_memory_region_type
*region
;
6200 lang_memory_region_type
*lma_region
;
6201 struct overlay_list
*l
;
6202 lang_nocrossref_type
*nocrossref
;
6204 lang_get_regions (®ion
, &lma_region
,
6205 memspec
, lma_memspec
,
6206 lma_expr
!= NULL
, FALSE
);
6210 /* After setting the size of the last section, set '.' to end of the
6212 if (overlay_list
!= NULL
)
6213 overlay_list
->os
->update_dot_tree
6214 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6219 struct overlay_list
*next
;
6221 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6224 l
->os
->region
= region
;
6225 l
->os
->lma_region
= lma_region
;
6227 /* The first section has the load address specified in the
6228 OVERLAY statement. The rest are worked out from that.
6229 The base address is not needed (and should be null) if
6230 an LMA region was specified. */
6232 l
->os
->load_base
= lma_expr
;
6233 else if (lma_region
== 0)
6234 l
->os
->load_base
= exp_binop ('+',
6235 exp_nameop (LOADADDR
, l
->next
->os
->name
),
6236 exp_nameop (SIZEOF
, l
->next
->os
->name
));
6238 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6239 l
->os
->phdrs
= phdrs
;
6243 lang_nocrossref_type
*nc
;
6245 nc
= xmalloc (sizeof *nc
);
6246 nc
->name
= l
->os
->name
;
6247 nc
->next
= nocrossref
;
6256 if (nocrossref
!= NULL
)
6257 lang_add_nocrossref (nocrossref
);
6260 overlay_list
= NULL
;
6264 /* Version handling. This is only useful for ELF. */
6266 /* This global variable holds the version tree that we build. */
6268 struct bfd_elf_version_tree
*lang_elf_version_info
;
6270 /* If PREV is NULL, return first version pattern matching particular symbol.
6271 If PREV is non-NULL, return first version pattern matching particular
6272 symbol after PREV (previously returned by lang_vers_match). */
6274 static struct bfd_elf_version_expr
*
6275 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6276 struct bfd_elf_version_expr
*prev
,
6279 const char *cxx_sym
= sym
;
6280 const char *java_sym
= sym
;
6281 struct bfd_elf_version_expr
*expr
= NULL
;
6283 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6285 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6289 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6291 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6296 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6298 struct bfd_elf_version_expr e
;
6300 switch (prev
? prev
->mask
: 0)
6303 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6306 expr
= htab_find (head
->htab
, &e
);
6307 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6308 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6314 case BFD_ELF_VERSION_C_TYPE
:
6315 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6318 expr
= htab_find (head
->htab
, &e
);
6319 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6320 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6326 case BFD_ELF_VERSION_CXX_TYPE
:
6327 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6329 e
.symbol
= java_sym
;
6330 expr
= htab_find (head
->htab
, &e
);
6331 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6332 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6343 /* Finally, try the wildcards. */
6344 if (prev
== NULL
|| prev
->symbol
)
6345 expr
= head
->remaining
;
6348 for (; expr
; expr
= expr
->next
)
6355 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6358 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6360 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6364 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6370 free ((char *) cxx_sym
);
6371 if (java_sym
!= sym
)
6372 free ((char *) java_sym
);
6376 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6377 return a string pointing to the symbol name. */
6380 realsymbol (const char *pattern
)
6383 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6384 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6386 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6388 /* It is a glob pattern only if there is no preceding
6390 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6398 /* Remove the preceding backslash. */
6405 backslash
= *p
== '\\';
6420 /* This is called for each variable name or match expression. NEW is
6421 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
6422 pattern to be matched against symbol names. */
6424 struct bfd_elf_version_expr
*
6425 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
6428 bfd_boolean literal_p
)
6430 struct bfd_elf_version_expr
*ret
;
6432 ret
= xmalloc (sizeof *ret
);
6434 ret
->pattern
= literal_p
? NULL
: new;
6437 ret
->symbol
= literal_p
? new : realsymbol (new);
6439 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
6440 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6441 else if (strcasecmp (lang
, "C++") == 0)
6442 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
6443 else if (strcasecmp (lang
, "Java") == 0)
6444 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
6447 einfo (_("%X%P: unknown language `%s' in version information\n"),
6449 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6452 return ldemul_new_vers_pattern (ret
);
6455 /* This is called for each set of variable names and match
6458 struct bfd_elf_version_tree
*
6459 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
6460 struct bfd_elf_version_expr
*locals
)
6462 struct bfd_elf_version_tree
*ret
;
6464 ret
= xcalloc (1, sizeof *ret
);
6465 ret
->globals
.list
= globals
;
6466 ret
->locals
.list
= locals
;
6467 ret
->match
= lang_vers_match
;
6468 ret
->name_indx
= (unsigned int) -1;
6472 /* This static variable keeps track of version indices. */
6474 static int version_index
;
6477 version_expr_head_hash (const void *p
)
6479 const struct bfd_elf_version_expr
*e
= p
;
6481 return htab_hash_string (e
->symbol
);
6485 version_expr_head_eq (const void *p1
, const void *p2
)
6487 const struct bfd_elf_version_expr
*e1
= p1
;
6488 const struct bfd_elf_version_expr
*e2
= p2
;
6490 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
6494 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
6497 struct bfd_elf_version_expr
*e
, *next
;
6498 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
6500 for (e
= head
->list
; e
; e
= e
->next
)
6504 head
->mask
|= e
->mask
;
6509 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
6510 version_expr_head_eq
, NULL
);
6511 list_loc
= &head
->list
;
6512 remaining_loc
= &head
->remaining
;
6513 for (e
= head
->list
; e
; e
= next
)
6519 remaining_loc
= &e
->next
;
6523 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
6527 struct bfd_elf_version_expr
*e1
, *last
;
6533 if (e1
->mask
== e
->mask
)
6541 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
6545 /* This is a duplicate. */
6546 /* FIXME: Memory leak. Sometimes pattern is not
6547 xmalloced alone, but in larger chunk of memory. */
6548 /* free (e->symbol); */
6553 e
->next
= last
->next
;
6561 list_loc
= &e
->next
;
6565 *remaining_loc
= NULL
;
6566 *list_loc
= head
->remaining
;
6569 head
->remaining
= head
->list
;
6572 /* This is called when we know the name and dependencies of the
6576 lang_register_vers_node (const char *name
,
6577 struct bfd_elf_version_tree
*version
,
6578 struct bfd_elf_version_deps
*deps
)
6580 struct bfd_elf_version_tree
*t
, **pp
;
6581 struct bfd_elf_version_expr
*e1
;
6586 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
6587 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
6589 einfo (_("%X%P: anonymous version tag cannot be combined"
6590 " with other version tags\n"));
6595 /* Make sure this node has a unique name. */
6596 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6597 if (strcmp (t
->name
, name
) == 0)
6598 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
6600 lang_finalize_version_expr_head (&version
->globals
);
6601 lang_finalize_version_expr_head (&version
->locals
);
6603 /* Check the global and local match names, and make sure there
6604 aren't any duplicates. */
6606 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
6608 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6610 struct bfd_elf_version_expr
*e2
;
6612 if (t
->locals
.htab
&& e1
->symbol
)
6614 e2
= htab_find (t
->locals
.htab
, e1
);
6615 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6617 if (e1
->mask
== e2
->mask
)
6618 einfo (_("%X%P: duplicate expression `%s'"
6619 " in version information\n"), e1
->symbol
);
6623 else if (!e1
->symbol
)
6624 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6625 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6626 && e1
->mask
== e2
->mask
)
6627 einfo (_("%X%P: duplicate expression `%s'"
6628 " in version information\n"), e1
->pattern
);
6632 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
6634 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6636 struct bfd_elf_version_expr
*e2
;
6638 if (t
->globals
.htab
&& e1
->symbol
)
6640 e2
= htab_find (t
->globals
.htab
, e1
);
6641 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6643 if (e1
->mask
== e2
->mask
)
6644 einfo (_("%X%P: duplicate expression `%s'"
6645 " in version information\n"),
6650 else if (!e1
->symbol
)
6651 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6652 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6653 && e1
->mask
== e2
->mask
)
6654 einfo (_("%X%P: duplicate expression `%s'"
6655 " in version information\n"), e1
->pattern
);
6659 version
->deps
= deps
;
6660 version
->name
= name
;
6661 if (name
[0] != '\0')
6664 version
->vernum
= version_index
;
6667 version
->vernum
= 0;
6669 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6674 /* This is called when we see a version dependency. */
6676 struct bfd_elf_version_deps
*
6677 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
6679 struct bfd_elf_version_deps
*ret
;
6680 struct bfd_elf_version_tree
*t
;
6682 ret
= xmalloc (sizeof *ret
);
6685 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6687 if (strcmp (t
->name
, name
) == 0)
6689 ret
->version_needed
= t
;
6694 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
6700 lang_do_version_exports_section (void)
6702 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
6704 LANG_FOR_EACH_INPUT_STATEMENT (is
)
6706 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
6714 contents
= xmalloc (len
);
6715 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
6716 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
6719 while (p
< contents
+ len
)
6721 greg
= lang_new_vers_pattern (greg
, p
, NULL
, FALSE
);
6722 p
= strchr (p
, '\0') + 1;
6725 /* Do not free the contents, as we used them creating the regex. */
6727 /* Do not include this section in the link. */
6728 sec
->flags
|= SEC_EXCLUDE
;
6731 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
, FALSE
);
6732 lang_register_vers_node (command_line
.version_exports_section
,
6733 lang_new_vers_node (greg
, lreg
), NULL
);
6737 lang_add_unique (const char *name
)
6739 struct unique_sections
*ent
;
6741 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
6742 if (strcmp (ent
->name
, name
) == 0)
6745 ent
= xmalloc (sizeof *ent
);
6746 ent
->name
= xstrdup (name
);
6747 ent
->next
= unique_section_list
;
6748 unique_section_list
= ent
;