1 /* Linker command language support.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005
4 Free Software Foundation, Inc.
6 This file is part of GLD, the Gnu Linker.
8 GLD is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GLD is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GLD; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
25 #include "libiberty.h"
26 #include "safe-ctype.h"
45 #define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
48 /* Locals variables. */
49 static struct obstack stat_obstack
;
50 static struct obstack map_obstack
;
52 #define obstack_chunk_alloc xmalloc
53 #define obstack_chunk_free free
54 static const char *startup_file
;
55 static lang_statement_list_type input_file_chain
;
56 static bfd_boolean placed_commons
= FALSE
;
57 static bfd_boolean stripped_excluded_sections
= FALSE
;
58 static lang_output_section_statement_type
*default_common_section
;
59 static bfd_boolean map_option_f
;
60 static bfd_vma print_dot
;
61 static lang_input_statement_type
*first_file
;
62 static const char *current_target
;
63 static const char *output_target
;
64 static lang_statement_list_type statement_list
;
65 static struct lang_phdr
*lang_phdr_list
;
66 static struct bfd_hash_table lang_definedness_table
;
68 /* Forward declarations. */
69 static void exp_init_os (etree_type
*);
70 static void init_map_userdata (bfd
*, asection
*, void *);
71 static lang_input_statement_type
*lookup_name (const char *);
72 static bfd_boolean
load_symbols (lang_input_statement_type
*,
73 lang_statement_list_type
*);
74 static struct bfd_hash_entry
*lang_definedness_newfunc
75 (struct bfd_hash_entry
*, struct bfd_hash_table
*, const char *);
76 static void insert_undefined (const char *);
77 static void print_all_symbols (asection
*);
78 static bfd_boolean
sort_def_symbol (struct bfd_link_hash_entry
*, void *);
79 static void print_statement (lang_statement_union_type
*,
80 lang_output_section_statement_type
*);
81 static void print_statement_list (lang_statement_union_type
*,
82 lang_output_section_statement_type
*);
83 static void print_statements (void);
84 static bfd_boolean
lang_one_common (struct bfd_link_hash_entry
*, void *);
85 static void lang_record_phdrs (void);
86 static void lang_do_version_exports_section (void);
88 /* Exported variables. */
89 lang_output_section_statement_type
*abs_output_section
;
90 lang_statement_list_type lang_output_section_statement
;
91 lang_statement_list_type
*stat_ptr
= &statement_list
;
92 lang_statement_list_type file_chain
= { NULL
, NULL
};
93 struct bfd_sym_chain entry_symbol
= { NULL
, NULL
};
94 static const char *entry_symbol_default
= "start";
95 const char *entry_section
= ".text";
96 bfd_boolean entry_from_cmdline
;
97 bfd_boolean lang_has_input_file
= FALSE
;
98 bfd_boolean had_output_filename
= FALSE
;
99 bfd_boolean lang_float_flag
= FALSE
;
100 bfd_boolean delete_output_file_on_failure
= FALSE
;
101 struct lang_nocrossrefs
*nocrossref_list
;
102 static struct unique_sections
*unique_section_list
;
103 static bfd_boolean ldlang_sysrooted_script
= FALSE
;
105 /* Functions that traverse the linker script and might evaluate
106 DEFINED() need to increment this. */
107 int lang_statement_iteration
= 0;
109 etree_type
*base
; /* Relocation base - or null */
111 /* Return TRUE if the PATTERN argument is a wildcard pattern.
112 Although backslashes are treated specially if a pattern contains
113 wildcards, we do not consider the mere presence of a backslash to
114 be enough to cause the pattern to be treated as a wildcard.
115 That lets us handle DOS filenames more naturally. */
116 #define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
118 #define new_stat(x, y) \
119 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
121 #define outside_section_address(q) \
122 ((q)->output_offset + (q)->output_section->vma)
124 #define outside_symbol_address(q) \
125 ((q)->value + outside_section_address (q->section))
127 #define SECTION_NAME_MAP_LENGTH (16)
130 stat_alloc (size_t size
)
132 return obstack_alloc (&stat_obstack
, size
);
136 unique_section_p (const asection
*sec
)
138 struct unique_sections
*unam
;
141 if (link_info
.relocatable
142 && sec
->owner
!= NULL
143 && bfd_is_group_section (sec
->owner
, sec
))
147 for (unam
= unique_section_list
; unam
; unam
= unam
->next
)
148 if (wildcardp (unam
->name
)
149 ? fnmatch (unam
->name
, secnam
, 0) == 0
150 : strcmp (unam
->name
, secnam
) == 0)
158 /* Generic traversal routines for finding matching sections. */
160 /* Try processing a section against a wildcard. This just calls
161 the callback unless the filename exclusion list is present
162 and excludes the file. It's hardly ever present so this
163 function is very fast. */
166 walk_wild_consider_section (lang_wild_statement_type
*ptr
,
167 lang_input_statement_type
*file
,
169 struct wildcard_list
*sec
,
173 bfd_boolean skip
= FALSE
;
174 struct name_list
*list_tmp
;
176 /* Don't process sections from files which were
178 for (list_tmp
= sec
->spec
.exclude_name_list
;
180 list_tmp
= list_tmp
->next
)
182 bfd_boolean is_wildcard
= wildcardp (list_tmp
->name
);
184 skip
= fnmatch (list_tmp
->name
, file
->filename
, 0) == 0;
186 skip
= strcmp (list_tmp
->name
, file
->filename
) == 0;
188 /* If this file is part of an archive, and the archive is
189 excluded, exclude this file. */
190 if (! skip
&& file
->the_bfd
!= NULL
191 && file
->the_bfd
->my_archive
!= NULL
192 && file
->the_bfd
->my_archive
->filename
!= NULL
)
195 skip
= fnmatch (list_tmp
->name
,
196 file
->the_bfd
->my_archive
->filename
,
199 skip
= strcmp (list_tmp
->name
,
200 file
->the_bfd
->my_archive
->filename
) == 0;
208 (*callback
) (ptr
, sec
, s
, file
, data
);
211 /* Lowest common denominator routine that can handle everything correctly,
215 walk_wild_section_general (lang_wild_statement_type
*ptr
,
216 lang_input_statement_type
*file
,
221 struct wildcard_list
*sec
;
223 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
225 sec
= ptr
->section_list
;
227 (*callback
) (ptr
, sec
, s
, file
, data
);
231 bfd_boolean skip
= FALSE
;
233 if (sec
->spec
.name
!= NULL
)
235 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
237 if (wildcardp (sec
->spec
.name
))
238 skip
= fnmatch (sec
->spec
.name
, sname
, 0) != 0;
240 skip
= strcmp (sec
->spec
.name
, sname
) != 0;
244 walk_wild_consider_section (ptr
, file
, s
, sec
, callback
, data
);
251 /* Routines to find a single section given its name. If there's more
252 than one section with that name, we report that. */
256 asection
*found_section
;
257 bfd_boolean multiple_sections_found
;
258 } section_iterator_callback_data
;
261 section_iterator_callback (bfd
*bfd ATTRIBUTE_UNUSED
, asection
*s
, void *data
)
263 section_iterator_callback_data
*d
= data
;
265 if (d
->found_section
!= NULL
)
267 d
->multiple_sections_found
= TRUE
;
271 d
->found_section
= s
;
276 find_section (lang_input_statement_type
*file
,
277 struct wildcard_list
*sec
,
278 bfd_boolean
*multiple_sections_found
)
280 section_iterator_callback_data cb_data
= { NULL
, FALSE
};
282 bfd_get_section_by_name_if (file
->the_bfd
, sec
->spec
.name
,
283 section_iterator_callback
, &cb_data
);
284 *multiple_sections_found
= cb_data
.multiple_sections_found
;
285 return cb_data
.found_section
;
288 /* Code for handling simple wildcards without going through fnmatch,
289 which can be expensive because of charset translations etc. */
291 /* A simple wild is a literal string followed by a single '*',
292 where the literal part is at least 4 characters long. */
295 is_simple_wild (const char *name
)
297 size_t len
= strcspn (name
, "*?[");
298 return len
>= 4 && name
[len
] == '*' && name
[len
+ 1] == '\0';
302 match_simple_wild (const char *pattern
, const char *name
)
304 /* The first four characters of the pattern are guaranteed valid
305 non-wildcard characters. So we can go faster. */
306 if (pattern
[0] != name
[0] || pattern
[1] != name
[1]
307 || pattern
[2] != name
[2] || pattern
[3] != name
[3])
312 while (*pattern
!= '*')
313 if (*name
++ != *pattern
++)
319 /* Specialized, optimized routines for handling different kinds of
323 walk_wild_section_specs1_wild0 (lang_wild_statement_type
*ptr
,
324 lang_input_statement_type
*file
,
328 /* We can just do a hash lookup for the section with the right name.
329 But if that lookup discovers more than one section with the name
330 (should be rare), we fall back to the general algorithm because
331 we would otherwise have to sort the sections to make sure they
332 get processed in the bfd's order. */
333 bfd_boolean multiple_sections_found
;
334 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
335 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
337 if (multiple_sections_found
)
338 walk_wild_section_general (ptr
, file
, callback
, data
);
340 walk_wild_consider_section (ptr
, file
, s0
, sec0
, callback
, data
);
344 walk_wild_section_specs1_wild1 (lang_wild_statement_type
*ptr
,
345 lang_input_statement_type
*file
,
350 struct wildcard_list
*wildsec0
= ptr
->handler_data
[0];
352 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
354 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
355 bfd_boolean skip
= !match_simple_wild (wildsec0
->spec
.name
, sname
);
358 walk_wild_consider_section (ptr
, file
, s
, wildsec0
, callback
, data
);
363 walk_wild_section_specs2_wild1 (lang_wild_statement_type
*ptr
,
364 lang_input_statement_type
*file
,
369 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
370 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
371 bfd_boolean multiple_sections_found
;
372 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
374 if (multiple_sections_found
)
376 walk_wild_section_general (ptr
, file
, callback
, data
);
380 /* Note that if the section was not found, s0 is NULL and
381 we'll simply never succeed the s == s0 test below. */
382 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
384 /* Recall that in this code path, a section cannot satisfy more
385 than one spec, so if s == s0 then it cannot match
388 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
391 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
392 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
395 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
,
402 walk_wild_section_specs3_wild2 (lang_wild_statement_type
*ptr
,
403 lang_input_statement_type
*file
,
408 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
409 struct wildcard_list
*wildsec1
= ptr
->handler_data
[1];
410 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
411 bfd_boolean multiple_sections_found
;
412 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
);
414 if (multiple_sections_found
)
416 walk_wild_section_general (ptr
, file
, callback
, data
);
420 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
423 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
426 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
427 bfd_boolean skip
= !match_simple_wild (wildsec1
->spec
.name
, sname
);
430 walk_wild_consider_section (ptr
, file
, s
, wildsec1
, callback
, data
);
433 skip
= !match_simple_wild (wildsec2
->spec
.name
, sname
);
435 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
443 walk_wild_section_specs4_wild2 (lang_wild_statement_type
*ptr
,
444 lang_input_statement_type
*file
,
449 struct wildcard_list
*sec0
= ptr
->handler_data
[0];
450 struct wildcard_list
*sec1
= ptr
->handler_data
[1];
451 struct wildcard_list
*wildsec2
= ptr
->handler_data
[2];
452 struct wildcard_list
*wildsec3
= ptr
->handler_data
[3];
453 bfd_boolean multiple_sections_found
;
454 asection
*s0
= find_section (file
, sec0
, &multiple_sections_found
), *s1
;
456 if (multiple_sections_found
)
458 walk_wild_section_general (ptr
, file
, callback
, data
);
462 s1
= find_section (file
, sec1
, &multiple_sections_found
);
463 if (multiple_sections_found
)
465 walk_wild_section_general (ptr
, file
, callback
, data
);
469 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
472 walk_wild_consider_section (ptr
, file
, s
, sec0
, callback
, data
);
475 walk_wild_consider_section (ptr
, file
, s
, sec1
, callback
, data
);
478 const char *sname
= bfd_get_section_name (file
->the_bfd
, s
);
479 bfd_boolean skip
= !match_simple_wild (wildsec2
->spec
.name
,
483 walk_wild_consider_section (ptr
, file
, s
, wildsec2
, callback
,
487 skip
= !match_simple_wild (wildsec3
->spec
.name
, sname
);
489 walk_wild_consider_section (ptr
, file
, s
, wildsec3
,
497 walk_wild_section (lang_wild_statement_type
*ptr
,
498 lang_input_statement_type
*file
,
502 if (file
->just_syms_flag
)
505 (*ptr
->walk_wild_section_handler
) (ptr
, file
, callback
, data
);
508 /* Returns TRUE when name1 is a wildcard spec that might match
509 something name2 can match. We're conservative: we return FALSE
510 only if the prefixes of name1 and name2 are different up to the
511 first wildcard character. */
514 wild_spec_can_overlap (const char *name1
, const char *name2
)
516 size_t prefix1_len
= strcspn (name1
, "?*[");
517 size_t prefix2_len
= strcspn (name2
, "?*[");
518 size_t min_prefix_len
;
520 /* Note that if there is no wildcard character, then we treat the
521 terminating 0 as part of the prefix. Thus ".text" won't match
522 ".text." or ".text.*", for example. */
523 if (name1
[prefix1_len
] == '\0')
525 if (name2
[prefix2_len
] == '\0')
528 min_prefix_len
= prefix1_len
< prefix2_len
? prefix1_len
: prefix2_len
;
530 return memcmp (name1
, name2
, min_prefix_len
) == 0;
533 /* Select specialized code to handle various kinds of wildcard
537 analyze_walk_wild_section_handler (lang_wild_statement_type
*ptr
)
540 int wild_name_count
= 0;
541 struct wildcard_list
*sec
;
545 ptr
->walk_wild_section_handler
= walk_wild_section_general
;
547 /* Count how many wildcard_specs there are, and how many of those
548 actually use wildcards in the name. Also, bail out if any of the
549 wildcard names are NULL. (Can this actually happen?
550 walk_wild_section used to test for it.) And bail out if any
551 of the wildcards are more complex than a simple string
552 ending in a single '*'. */
553 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
556 if (sec
->spec
.name
== NULL
)
558 if (wildcardp (sec
->spec
.name
))
561 if (!is_simple_wild (sec
->spec
.name
))
566 /* The zero-spec case would be easy to optimize but it doesn't
567 happen in practice. Likewise, more than 4 specs doesn't
568 happen in practice. */
569 if (sec_count
== 0 || sec_count
> 4)
572 /* Check that no two specs can match the same section. */
573 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
575 struct wildcard_list
*sec2
;
576 for (sec2
= sec
->next
; sec2
!= NULL
; sec2
= sec2
->next
)
578 if (wild_spec_can_overlap (sec
->spec
.name
, sec2
->spec
.name
))
583 signature
= (sec_count
<< 8) + wild_name_count
;
587 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild0
;
590 ptr
->walk_wild_section_handler
= walk_wild_section_specs1_wild1
;
593 ptr
->walk_wild_section_handler
= walk_wild_section_specs2_wild1
;
596 ptr
->walk_wild_section_handler
= walk_wild_section_specs3_wild2
;
599 ptr
->walk_wild_section_handler
= walk_wild_section_specs4_wild2
;
605 /* Now fill the data array with pointers to the specs, first the
606 specs with non-wildcard names, then the specs with wildcard
607 names. It's OK to process the specs in different order from the
608 given order, because we've already determined that no section
609 will match more than one spec. */
611 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
612 if (!wildcardp (sec
->spec
.name
))
613 ptr
->handler_data
[data_counter
++] = sec
;
614 for (sec
= ptr
->section_list
; sec
!= NULL
; sec
= sec
->next
)
615 if (wildcardp (sec
->spec
.name
))
616 ptr
->handler_data
[data_counter
++] = sec
;
619 /* Handle a wild statement for a single file F. */
622 walk_wild_file (lang_wild_statement_type
*s
,
623 lang_input_statement_type
*f
,
627 if (f
->the_bfd
== NULL
628 || ! bfd_check_format (f
->the_bfd
, bfd_archive
))
629 walk_wild_section (s
, f
, callback
, data
);
634 /* This is an archive file. We must map each member of the
635 archive separately. */
636 member
= bfd_openr_next_archived_file (f
->the_bfd
, NULL
);
637 while (member
!= NULL
)
639 /* When lookup_name is called, it will call the add_symbols
640 entry point for the archive. For each element of the
641 archive which is included, BFD will call ldlang_add_file,
642 which will set the usrdata field of the member to the
643 lang_input_statement. */
644 if (member
->usrdata
!= NULL
)
646 walk_wild_section (s
, member
->usrdata
, callback
, data
);
649 member
= bfd_openr_next_archived_file (f
->the_bfd
, member
);
655 walk_wild (lang_wild_statement_type
*s
, callback_t callback
, void *data
)
657 const char *file_spec
= s
->filename
;
659 if (file_spec
== NULL
)
661 /* Perform the iteration over all files in the list. */
662 LANG_FOR_EACH_INPUT_STATEMENT (f
)
664 walk_wild_file (s
, f
, callback
, data
);
667 else if (wildcardp (file_spec
))
669 LANG_FOR_EACH_INPUT_STATEMENT (f
)
671 if (fnmatch (file_spec
, f
->filename
, FNM_FILE_NAME
) == 0)
672 walk_wild_file (s
, f
, callback
, data
);
677 lang_input_statement_type
*f
;
679 /* Perform the iteration over a single file. */
680 f
= lookup_name (file_spec
);
682 walk_wild_file (s
, f
, callback
, data
);
686 /* lang_for_each_statement walks the parse tree and calls the provided
687 function for each node. */
690 lang_for_each_statement_worker (void (*func
) (lang_statement_union_type
*),
691 lang_statement_union_type
*s
)
693 for (; s
!= NULL
; s
= s
->header
.next
)
697 switch (s
->header
.type
)
699 case lang_constructors_statement_enum
:
700 lang_for_each_statement_worker (func
, constructor_list
.head
);
702 case lang_output_section_statement_enum
:
703 lang_for_each_statement_worker
704 (func
, s
->output_section_statement
.children
.head
);
706 case lang_wild_statement_enum
:
707 lang_for_each_statement_worker (func
,
708 s
->wild_statement
.children
.head
);
710 case lang_group_statement_enum
:
711 lang_for_each_statement_worker (func
,
712 s
->group_statement
.children
.head
);
714 case lang_data_statement_enum
:
715 case lang_reloc_statement_enum
:
716 case lang_object_symbols_statement_enum
:
717 case lang_output_statement_enum
:
718 case lang_target_statement_enum
:
719 case lang_input_section_enum
:
720 case lang_input_statement_enum
:
721 case lang_assignment_statement_enum
:
722 case lang_padding_statement_enum
:
723 case lang_address_statement_enum
:
724 case lang_fill_statement_enum
:
734 lang_for_each_statement (void (*func
) (lang_statement_union_type
*))
736 lang_for_each_statement_worker (func
, statement_list
.head
);
739 /*----------------------------------------------------------------------*/
742 lang_list_init (lang_statement_list_type
*list
)
745 list
->tail
= &list
->head
;
748 /* Build a new statement node for the parse tree. */
750 static lang_statement_union_type
*
751 new_statement (enum statement_enum type
,
753 lang_statement_list_type
*list
)
755 lang_statement_union_type
*new;
757 new = stat_alloc (size
);
758 new->header
.type
= type
;
759 new->header
.next
= NULL
;
760 lang_statement_append (list
, new, &new->header
.next
);
764 /* Build a new input file node for the language. There are several
765 ways in which we treat an input file, eg, we only look at symbols,
766 or prefix it with a -l etc.
768 We can be supplied with requests for input files more than once;
769 they may, for example be split over several lines like foo.o(.text)
770 foo.o(.data) etc, so when asked for a file we check that we haven't
771 got it already so we don't duplicate the bfd. */
773 static lang_input_statement_type
*
774 new_afile (const char *name
,
775 lang_input_file_enum_type file_type
,
777 bfd_boolean add_to_list
)
779 lang_input_statement_type
*p
;
782 p
= new_stat (lang_input_statement
, stat_ptr
);
785 p
= stat_alloc (sizeof (lang_input_statement_type
));
786 p
->header
.next
= NULL
;
789 lang_has_input_file
= TRUE
;
791 p
->sysrooted
= FALSE
;
794 case lang_input_file_is_symbols_only_enum
:
796 p
->is_archive
= FALSE
;
798 p
->local_sym_name
= name
;
799 p
->just_syms_flag
= TRUE
;
800 p
->search_dirs_flag
= FALSE
;
802 case lang_input_file_is_fake_enum
:
804 p
->is_archive
= FALSE
;
806 p
->local_sym_name
= name
;
807 p
->just_syms_flag
= FALSE
;
808 p
->search_dirs_flag
= FALSE
;
810 case lang_input_file_is_l_enum
:
811 p
->is_archive
= TRUE
;
814 p
->local_sym_name
= concat ("-l", name
, NULL
);
815 p
->just_syms_flag
= FALSE
;
816 p
->search_dirs_flag
= TRUE
;
818 case lang_input_file_is_marker_enum
:
820 p
->is_archive
= FALSE
;
822 p
->local_sym_name
= name
;
823 p
->just_syms_flag
= FALSE
;
824 p
->search_dirs_flag
= TRUE
;
826 case lang_input_file_is_search_file_enum
:
827 p
->sysrooted
= ldlang_sysrooted_script
;
829 p
->is_archive
= FALSE
;
831 p
->local_sym_name
= name
;
832 p
->just_syms_flag
= FALSE
;
833 p
->search_dirs_flag
= TRUE
;
835 case lang_input_file_is_file_enum
:
837 p
->is_archive
= FALSE
;
839 p
->local_sym_name
= name
;
840 p
->just_syms_flag
= FALSE
;
841 p
->search_dirs_flag
= FALSE
;
848 p
->next_real_file
= NULL
;
851 p
->dynamic
= config
.dynamic_link
;
852 p
->add_needed
= add_needed
;
853 p
->as_needed
= as_needed
;
854 p
->whole_archive
= whole_archive
;
856 lang_statement_append (&input_file_chain
,
857 (lang_statement_union_type
*) p
,
862 lang_input_statement_type
*
863 lang_add_input_file (const char *name
,
864 lang_input_file_enum_type file_type
,
867 lang_has_input_file
= TRUE
;
868 return new_afile (name
, file_type
, target
, TRUE
);
871 struct output_statement_hash_entry
873 struct bfd_hash_entry root
;
874 lang_output_section_statement_type
*entry
;
877 /* The hash table. */
879 static struct bfd_hash_table output_statement_table
;
881 /* Support routines for the hash table used by lang_output_section_find_1,
882 initialize the table, fill in an entry and remove the table. */
884 static struct bfd_hash_entry
*
885 output_statement_newfunc (struct bfd_hash_entry
*entry ATTRIBUTE_UNUSED
,
886 struct bfd_hash_table
*table
,
887 const char *string ATTRIBUTE_UNUSED
)
889 struct output_statement_hash_entry
*ret
890 = bfd_hash_allocate (table
,
891 sizeof (struct output_statement_hash_entry
));
893 return (struct bfd_hash_entry
*) ret
;
897 output_statement_table_init (void)
899 if (! bfd_hash_table_init_n (&output_statement_table
,
900 output_statement_newfunc
, 61))
901 einfo (_("%P%F: Failed to create hash table\n"));
905 output_statement_table_free (void)
907 bfd_hash_table_free (&output_statement_table
);
910 /* Build enough state so that the parser can build its tree. */
915 obstack_begin (&stat_obstack
, 1000);
917 stat_ptr
= &statement_list
;
919 output_statement_table_init ();
921 lang_list_init (stat_ptr
);
923 lang_list_init (&input_file_chain
);
924 lang_list_init (&lang_output_section_statement
);
925 lang_list_init (&file_chain
);
926 first_file
= lang_add_input_file (NULL
, lang_input_file_is_marker_enum
,
929 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME
);
931 abs_output_section
->bfd_section
= bfd_abs_section_ptr
;
933 /* The value "3" is ad-hoc, somewhat related to the expected number of
934 DEFINED expressions in a linker script. For most default linker
935 scripts, there are none. Why a hash table then? Well, it's somewhat
936 simpler to re-use working machinery than using a linked list in terms
937 of code-complexity here in ld, besides the initialization which just
938 looks like other code here. */
939 if (!bfd_hash_table_init_n (&lang_definedness_table
,
940 lang_definedness_newfunc
, 3))
941 einfo (_("%P%F: out of memory during initialization"));
947 output_statement_table_free ();
950 /*----------------------------------------------------------------------
951 A region is an area of memory declared with the
952 MEMORY { name:org=exp, len=exp ... }
955 We maintain a list of all the regions here.
957 If no regions are specified in the script, then the default is used
958 which is created when looked up to be the entire data space.
960 If create is true we are creating a region inside a MEMORY block.
961 In this case it is probably an error to create a region that has
962 already been created. If we are not inside a MEMORY block it is
963 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
964 and so we issue a warning. */
966 static lang_memory_region_type
*lang_memory_region_list
;
967 static lang_memory_region_type
**lang_memory_region_list_tail
968 = &lang_memory_region_list
;
970 lang_memory_region_type
*
971 lang_memory_region_lookup (const char *const name
, bfd_boolean create
)
973 lang_memory_region_type
*p
;
974 lang_memory_region_type
*new;
976 /* NAME is NULL for LMA memspecs if no region was specified. */
980 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
981 if (strcmp (p
->name
, name
) == 0)
984 einfo (_("%P:%S: warning: redeclaration of memory region '%s'\n"),
989 if (!create
&& strcmp (name
, DEFAULT_MEMORY_REGION
))
990 einfo (_("%P:%S: warning: memory region %s not declared\n"), name
);
992 new = stat_alloc (sizeof (lang_memory_region_type
));
994 new->name
= xstrdup (name
);
997 *lang_memory_region_list_tail
= new;
998 lang_memory_region_list_tail
= &new->next
;
1002 new->length
= ~(bfd_size_type
) 0;
1004 new->had_full_message
= FALSE
;
1009 static lang_memory_region_type
*
1010 lang_memory_default (asection
*section
)
1012 lang_memory_region_type
*p
;
1014 flagword sec_flags
= section
->flags
;
1016 /* Override SEC_DATA to mean a writable section. */
1017 if ((sec_flags
& (SEC_ALLOC
| SEC_READONLY
| SEC_CODE
)) == SEC_ALLOC
)
1018 sec_flags
|= SEC_DATA
;
1020 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
1022 if ((p
->flags
& sec_flags
) != 0
1023 && (p
->not_flags
& sec_flags
) == 0)
1028 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION
, FALSE
);
1031 static lang_output_section_statement_type
*
1032 lang_output_section_find_1 (const char *const name
, int constraint
)
1034 lang_output_section_statement_type
*lookup
;
1035 struct output_statement_hash_entry
*entry
;
1038 entry
= ((struct output_statement_hash_entry
*)
1039 bfd_hash_lookup (&output_statement_table
, name
, FALSE
,
1041 if (entry
== NULL
|| (lookup
= entry
->entry
) == NULL
)
1044 hash
= entry
->root
.hash
;
1047 if (lookup
->constraint
!= -1
1049 || (constraint
== lookup
->constraint
1050 && constraint
!= SPECIAL
)))
1052 entry
= (struct output_statement_hash_entry
*) entry
->root
.next
;
1053 lookup
= entry
? entry
->entry
: NULL
;
1055 while (entry
!= NULL
1056 && entry
->root
.hash
== hash
1057 && strcmp (name
, lookup
->name
) == 0);
1062 lang_output_section_statement_type
*
1063 lang_output_section_find (const char *const name
)
1065 return lang_output_section_find_1 (name
, 0);
1068 static lang_output_section_statement_type
*
1069 lang_output_section_statement_lookup_1 (const char *const name
, int constraint
)
1071 lang_output_section_statement_type
*lookup
;
1072 lang_output_section_statement_type
**nextp
;
1074 lookup
= lang_output_section_find_1 (name
, constraint
);
1077 struct output_statement_hash_entry
*entry
;
1079 lookup
= new_stat (lang_output_section_statement
, stat_ptr
);
1080 lookup
->region
= NULL
;
1081 lookup
->lma_region
= NULL
;
1083 lookup
->block_value
= 1;
1084 lookup
->name
= name
;
1086 lookup
->next
= NULL
;
1087 lookup
->bfd_section
= NULL
;
1088 lookup
->processed
= FALSE
;
1089 lookup
->constraint
= constraint
;
1090 lookup
->ignored
= FALSE
;
1091 lookup
->sectype
= normal_section
;
1092 lookup
->addr_tree
= NULL
;
1093 lang_list_init (&lookup
->children
);
1095 lookup
->memspec
= NULL
;
1097 lookup
->subsection_alignment
= -1;
1098 lookup
->section_alignment
= -1;
1099 lookup
->load_base
= NULL
;
1100 lookup
->update_dot_tree
= NULL
;
1101 lookup
->phdrs
= NULL
;
1103 entry
= ((struct output_statement_hash_entry
*)
1104 bfd_hash_lookup (&output_statement_table
, name
, TRUE
,
1107 einfo (_("%P%F: bfd_hash_lookup failed creating section `%s'\n"),
1110 entry
->entry
= lookup
;
1112 /* GCC's strict aliasing rules prevent us from just casting the
1113 address, so we store the pointer in a variable and cast that
1115 nextp
= &lookup
->next
;
1116 lang_statement_append (&lang_output_section_statement
,
1117 (lang_statement_union_type
*) lookup
,
1118 (lang_statement_union_type
**) nextp
);
1123 lang_output_section_statement_type
*
1124 lang_output_section_statement_lookup (const char *const name
)
1126 return lang_output_section_statement_lookup_1 (name
, 0);
1129 /* A variant of lang_output_section_find used by place_orphan.
1130 Returns the output statement that should precede a new output
1131 statement for SEC. If an exact match is found on certain flags,
1134 lang_output_section_statement_type
*
1135 lang_output_section_find_by_flags (const asection
*sec
,
1136 lang_output_section_statement_type
**exact
)
1138 lang_output_section_statement_type
*first
, *look
, *found
;
1141 /* We know the first statement on this list is *ABS*. May as well
1143 first
= &lang_output_section_statement
.head
->output_section_statement
;
1144 first
= first
->next
;
1146 /* First try for an exact match. */
1148 for (look
= first
; look
; look
= look
->next
)
1150 flags
= look
->flags
;
1151 if (look
->bfd_section
!= NULL
)
1152 flags
= look
->bfd_section
->flags
;
1153 flags
^= sec
->flags
;
1154 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
| SEC_READONLY
1155 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1164 if (sec
->flags
& SEC_CODE
)
1166 /* Try for a rw code section. */
1167 for (look
= first
; look
; look
= look
->next
)
1169 flags
= look
->flags
;
1170 if (look
->bfd_section
!= NULL
)
1171 flags
= look
->bfd_section
->flags
;
1172 flags
^= sec
->flags
;
1173 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1174 | SEC_CODE
| SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1180 if (sec
->flags
& (SEC_READONLY
| SEC_THREAD_LOCAL
))
1182 /* .rodata can go after .text, .sdata2 after .rodata. */
1183 for (look
= first
; look
; look
= look
->next
)
1185 flags
= look
->flags
;
1186 if (look
->bfd_section
!= NULL
)
1187 flags
= look
->bfd_section
->flags
;
1188 flags
^= sec
->flags
;
1189 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1191 && !(look
->flags
& (SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1197 if (sec
->flags
& SEC_SMALL_DATA
)
1199 /* .sdata goes after .data, .sbss after .sdata. */
1200 for (look
= first
; look
; look
= look
->next
)
1202 flags
= look
->flags
;
1203 if (look
->bfd_section
!= NULL
)
1204 flags
= look
->bfd_section
->flags
;
1205 flags
^= sec
->flags
;
1206 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1207 | SEC_THREAD_LOCAL
))
1208 || ((look
->flags
& SEC_SMALL_DATA
)
1209 && !(sec
->flags
& SEC_HAS_CONTENTS
)))
1215 if (sec
->flags
& SEC_HAS_CONTENTS
)
1217 /* .data goes after .rodata. */
1218 for (look
= first
; look
; look
= look
->next
)
1220 flags
= look
->flags
;
1221 if (look
->bfd_section
!= NULL
)
1222 flags
= look
->bfd_section
->flags
;
1223 flags
^= sec
->flags
;
1224 if (!(flags
& (SEC_HAS_CONTENTS
| SEC_ALLOC
| SEC_LOAD
1225 | SEC_SMALL_DATA
| SEC_THREAD_LOCAL
)))
1231 /* .bss goes last. */
1232 for (look
= first
; look
; look
= look
->next
)
1234 flags
= look
->flags
;
1235 if (look
->bfd_section
!= NULL
)
1236 flags
= look
->bfd_section
->flags
;
1237 flags
^= sec
->flags
;
1238 if (!(flags
& SEC_ALLOC
))
1245 /* Find the last output section before given output statement.
1246 Used by place_orphan. */
1249 output_prev_sec_find (lang_output_section_statement_type
*os
)
1251 asection
*s
= (asection
*) NULL
;
1252 lang_output_section_statement_type
*lookup
;
1254 for (lookup
= &lang_output_section_statement
.head
->output_section_statement
;
1256 lookup
= lookup
->next
)
1258 if (lookup
->constraint
== -1)
1263 if (lookup
->bfd_section
!= NULL
&& lookup
->bfd_section
->owner
!= NULL
)
1264 s
= lookup
->bfd_section
;
1270 lang_output_section_statement_type
*
1271 lang_insert_orphan (lang_input_statement_type
*file
,
1273 const char *secname
,
1274 lang_output_section_statement_type
*after
,
1275 struct orphan_save
*place
,
1276 etree_type
*address
,
1277 lang_statement_list_type
*add_child
)
1279 lang_statement_list_type
*old
;
1280 lang_statement_list_type add
;
1282 etree_type
*load_base
;
1283 lang_output_section_statement_type
*os
;
1284 lang_output_section_statement_type
**os_tail
;
1286 /* Start building a list of statements for this section.
1287 First save the current statement pointer. */
1290 /* If we have found an appropriate place for the output section
1291 statements for this orphan, add them to our own private list,
1292 inserting them later into the global statement list. */
1296 lang_list_init (stat_ptr
);
1300 if (config
.build_constructors
)
1302 /* If the name of the section is representable in C, then create
1303 symbols to mark the start and the end of the section. */
1304 for (ps
= secname
; *ps
!= '\0'; ps
++)
1305 if (! ISALNUM ((unsigned char) *ps
) && *ps
!= '_')
1310 etree_type
*e_align
;
1312 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__start_" + 1);
1313 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1314 sprintf (symname
+ (symname
[0] != 0), "__start_%s", secname
);
1315 e_align
= exp_unop (ALIGN_K
,
1316 exp_intop ((bfd_vma
) 1 << s
->alignment_power
));
1317 lang_add_assignment (exp_assop ('=', ".", e_align
));
1318 lang_add_assignment (exp_assop ('=', symname
,
1319 exp_nameop (NAME
, ".")));
1323 if (link_info
.relocatable
|| (s
->flags
& (SEC_LOAD
| SEC_ALLOC
)) == 0)
1324 address
= exp_intop (0);
1327 if (after
!= NULL
&& after
->load_base
!= NULL
)
1329 etree_type
*lma_from_vma
;
1330 lma_from_vma
= exp_binop ('-', after
->load_base
,
1331 exp_nameop (ADDR
, after
->name
));
1332 load_base
= exp_binop ('+', lma_from_vma
,
1333 exp_nameop (ADDR
, secname
));
1336 os_tail
= ((lang_output_section_statement_type
**)
1337 lang_output_section_statement
.tail
);
1338 os
= lang_enter_output_section_statement (secname
, address
, 0, NULL
, NULL
,
1341 if (add_child
== NULL
)
1342 add_child
= &os
->children
;
1343 lang_add_section (add_child
, s
, os
, file
);
1345 lang_leave_output_section_statement (0, "*default*", NULL
, NULL
);
1347 if (config
.build_constructors
&& *ps
== '\0')
1351 /* lang_leave_ouput_section_statement resets stat_ptr.
1352 Put stat_ptr back where we want it. */
1356 symname
= (char *) xmalloc (ps
- secname
+ sizeof "__stop_" + 1);
1357 symname
[0] = bfd_get_symbol_leading_char (output_bfd
);
1358 sprintf (symname
+ (symname
[0] != 0), "__stop_%s", secname
);
1359 lang_add_assignment (exp_assop ('=', symname
,
1360 exp_nameop (NAME
, ".")));
1363 /* Restore the global list pointer. */
1367 if (after
!= NULL
&& os
->bfd_section
!= NULL
)
1369 asection
*snew
, *as
;
1371 snew
= os
->bfd_section
;
1373 /* Shuffle the bfd section list to make the output file look
1374 neater. This is really only cosmetic. */
1375 if (place
->section
== NULL
1376 && after
!= (&lang_output_section_statement
.head
1377 ->output_section_statement
))
1379 asection
*bfd_section
= after
->bfd_section
;
1381 /* If the output statement hasn't been used to place any input
1382 sections (and thus doesn't have an output bfd_section),
1383 look for the closest prior output statement having an
1385 if (bfd_section
== NULL
)
1386 bfd_section
= output_prev_sec_find (after
);
1388 if (bfd_section
!= NULL
&& bfd_section
!= snew
)
1389 place
->section
= &bfd_section
->next
;
1392 if (place
->section
== NULL
)
1393 place
->section
= &output_bfd
->sections
;
1395 as
= *place
->section
;
1396 if (as
!= snew
&& as
->prev
!= snew
)
1398 /* Unlink the section. */
1399 bfd_section_list_remove (output_bfd
, snew
);
1401 /* Now tack it back on in the right place. */
1402 bfd_section_list_insert_before (output_bfd
, as
, snew
);
1405 /* Save the end of this list. Further ophans of this type will
1406 follow the one we've just added. */
1407 place
->section
= &snew
->next
;
1409 /* The following is non-cosmetic. We try to put the output
1410 statements in some sort of reasonable order here, because they
1411 determine the final load addresses of the orphan sections.
1412 In addition, placing output statements in the wrong order may
1413 require extra segments. For instance, given a typical
1414 situation of all read-only sections placed in one segment and
1415 following that a segment containing all the read-write
1416 sections, we wouldn't want to place an orphan read/write
1417 section before or amongst the read-only ones. */
1418 if (add
.head
!= NULL
)
1420 lang_output_section_statement_type
*newly_added_os
;
1422 if (place
->stmt
== NULL
)
1424 lang_statement_union_type
**where
;
1425 lang_statement_union_type
**assign
= NULL
;
1427 /* Look for a suitable place for the new statement list.
1428 The idea is to skip over anything that might be inside
1429 a SECTIONS {} statement in a script, before we find
1430 another output_section_statement. Assignments to "dot"
1431 before an output section statement are assumed to
1433 for (where
= &after
->header
.next
;
1435 where
= &(*where
)->header
.next
)
1437 switch ((*where
)->header
.type
)
1439 case lang_assignment_statement_enum
:
1442 lang_assignment_statement_type
*ass
;
1443 ass
= &(*where
)->assignment_statement
;
1444 if (ass
->exp
->type
.node_class
!= etree_assert
1445 && ass
->exp
->assign
.dst
[0] == '.'
1446 && ass
->exp
->assign
.dst
[1] == 0)
1450 case lang_wild_statement_enum
:
1451 case lang_input_section_enum
:
1452 case lang_object_symbols_statement_enum
:
1453 case lang_fill_statement_enum
:
1454 case lang_data_statement_enum
:
1455 case lang_reloc_statement_enum
:
1456 case lang_padding_statement_enum
:
1457 case lang_constructors_statement_enum
:
1460 case lang_output_section_statement_enum
:
1463 case lang_input_statement_enum
:
1464 case lang_address_statement_enum
:
1465 case lang_target_statement_enum
:
1466 case lang_output_statement_enum
:
1467 case lang_group_statement_enum
:
1468 case lang_afile_asection_pair_statement_enum
:
1477 place
->os_tail
= &after
->next
;
1481 /* Put it after the last orphan statement we added. */
1482 *add
.tail
= *place
->stmt
;
1483 *place
->stmt
= add
.head
;
1486 /* Fix the global list pointer if we happened to tack our
1487 new list at the tail. */
1488 if (*old
->tail
== add
.head
)
1489 old
->tail
= add
.tail
;
1491 /* Save the end of this list. */
1492 place
->stmt
= add
.tail
;
1494 /* Do the same for the list of output section statements. */
1495 newly_added_os
= *os_tail
;
1497 newly_added_os
->next
= *place
->os_tail
;
1498 *place
->os_tail
= newly_added_os
;
1499 place
->os_tail
= &newly_added_os
->next
;
1501 /* Fixing the global list pointer here is a little different.
1502 We added to the list in lang_enter_output_section_statement,
1503 trimmed off the new output_section_statment above when
1504 assigning *os_tail = NULL, but possibly added it back in
1505 the same place when assigning *place->os_tail. */
1506 if (*os_tail
== NULL
)
1507 lang_output_section_statement
.tail
1508 = (lang_statement_union_type
**) os_tail
;
1515 lang_map_flags (flagword flag
)
1517 if (flag
& SEC_ALLOC
)
1520 if (flag
& SEC_CODE
)
1523 if (flag
& SEC_READONLY
)
1526 if (flag
& SEC_DATA
)
1529 if (flag
& SEC_LOAD
)
1536 lang_memory_region_type
*m
;
1539 minfo (_("\nMemory Configuration\n\n"));
1540 fprintf (config
.map_file
, "%-16s %-18s %-18s %s\n",
1541 _("Name"), _("Origin"), _("Length"), _("Attributes"));
1543 for (m
= lang_memory_region_list
; m
!= NULL
; m
= m
->next
)
1548 fprintf (config
.map_file
, "%-16s ", m
->name
);
1550 sprintf_vma (buf
, m
->origin
);
1551 minfo ("0x%s ", buf
);
1559 minfo ("0x%V", m
->length
);
1560 if (m
->flags
|| m
->not_flags
)
1568 lang_map_flags (m
->flags
);
1574 lang_map_flags (m
->not_flags
);
1581 fprintf (config
.map_file
, _("\nLinker script and memory map\n\n"));
1583 if (! command_line
.reduce_memory_overheads
)
1585 obstack_begin (&map_obstack
, 1000);
1586 for (p
= link_info
.input_bfds
; p
!= (bfd
*) NULL
; p
= p
->link_next
)
1587 bfd_map_over_sections (p
, init_map_userdata
, 0);
1588 bfd_link_hash_traverse (link_info
.hash
, sort_def_symbol
, 0);
1590 print_statements ();
1594 init_map_userdata (abfd
, sec
, data
)
1595 bfd
*abfd ATTRIBUTE_UNUSED
;
1597 void *data ATTRIBUTE_UNUSED
;
1599 fat_section_userdata_type
*new_data
1600 = ((fat_section_userdata_type
*) (stat_alloc
1601 (sizeof (fat_section_userdata_type
))));
1603 ASSERT (get_userdata (sec
) == NULL
);
1604 get_userdata (sec
) = new_data
;
1605 new_data
->map_symbol_def_tail
= &new_data
->map_symbol_def_head
;
1609 sort_def_symbol (hash_entry
, info
)
1610 struct bfd_link_hash_entry
*hash_entry
;
1611 void *info ATTRIBUTE_UNUSED
;
1613 if (hash_entry
->type
== bfd_link_hash_defined
1614 || hash_entry
->type
== bfd_link_hash_defweak
)
1616 struct fat_user_section_struct
*ud
;
1617 struct map_symbol_def
*def
;
1619 ud
= get_userdata (hash_entry
->u
.def
.section
);
1622 /* ??? What do we have to do to initialize this beforehand? */
1623 /* The first time we get here is bfd_abs_section... */
1624 init_map_userdata (0, hash_entry
->u
.def
.section
, 0);
1625 ud
= get_userdata (hash_entry
->u
.def
.section
);
1627 else if (!ud
->map_symbol_def_tail
)
1628 ud
->map_symbol_def_tail
= &ud
->map_symbol_def_head
;
1630 def
= obstack_alloc (&map_obstack
, sizeof *def
);
1631 def
->entry
= hash_entry
;
1632 *(ud
->map_symbol_def_tail
) = def
;
1633 ud
->map_symbol_def_tail
= &def
->next
;
1638 /* Initialize an output section. */
1641 init_os (lang_output_section_statement_type
*s
)
1643 if (s
->bfd_section
!= NULL
)
1646 if (strcmp (s
->name
, DISCARD_SECTION_NAME
) == 0)
1647 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME
);
1649 s
->bfd_section
= bfd_get_section_by_name (output_bfd
, s
->name
);
1650 if (s
->bfd_section
== NULL
)
1651 s
->bfd_section
= bfd_make_section (output_bfd
, s
->name
);
1652 if (s
->bfd_section
== NULL
)
1654 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
1655 output_bfd
->xvec
->name
, s
->name
);
1657 s
->bfd_section
->output_section
= s
->bfd_section
;
1659 /* We initialize an output sections output offset to minus its own
1660 vma to allow us to output a section through itself. */
1661 s
->bfd_section
->output_offset
= 0;
1662 if (!command_line
.reduce_memory_overheads
)
1664 fat_section_userdata_type
*new
1665 = stat_alloc (sizeof (fat_section_userdata_type
));
1666 memset (new, 0, sizeof (fat_section_userdata_type
));
1667 get_userdata (s
->bfd_section
) = new;
1671 /* If there is a base address, make sure that any sections it might
1672 mention are initialized. */
1673 if (s
->addr_tree
!= NULL
)
1674 exp_init_os (s
->addr_tree
);
1676 if (s
->load_base
!= NULL
)
1677 exp_init_os (s
->load_base
);
1680 /* Make sure that all output sections mentioned in an expression are
1684 exp_init_os (etree_type
*exp
)
1686 switch (exp
->type
.node_class
)
1690 exp_init_os (exp
->assign
.src
);
1694 exp_init_os (exp
->binary
.lhs
);
1695 exp_init_os (exp
->binary
.rhs
);
1699 exp_init_os (exp
->trinary
.cond
);
1700 exp_init_os (exp
->trinary
.lhs
);
1701 exp_init_os (exp
->trinary
.rhs
);
1705 exp_init_os (exp
->assert_s
.child
);
1709 exp_init_os (exp
->unary
.child
);
1713 switch (exp
->type
.node_code
)
1719 lang_output_section_statement_type
*os
;
1721 os
= lang_output_section_find (exp
->name
.name
);
1722 if (os
!= NULL
&& os
->bfd_section
== NULL
)
1734 section_already_linked (bfd
*abfd
, asection
*sec
, void *data
)
1736 lang_input_statement_type
*entry
= data
;
1738 /* If we are only reading symbols from this object, then we want to
1739 discard all sections. */
1740 if (entry
->just_syms_flag
)
1742 bfd_link_just_syms (abfd
, sec
, &link_info
);
1746 if (!(abfd
->flags
& DYNAMIC
))
1747 bfd_section_already_linked (abfd
, sec
);
1750 /* The wild routines.
1752 These expand statements like *(.text) and foo.o to a list of
1753 explicit actions, like foo.o(.text), bar.o(.text) and
1754 foo.o(.text, .data). */
1756 /* Add SECTION to the output section OUTPUT. Do this by creating a
1757 lang_input_section statement which is placed at PTR. FILE is the
1758 input file which holds SECTION. */
1761 lang_add_section (lang_statement_list_type
*ptr
,
1763 lang_output_section_statement_type
*output
,
1764 lang_input_statement_type
*file
)
1766 flagword flags
= section
->flags
;
1767 bfd_boolean discard
;
1769 /* Discard sections marked with SEC_EXCLUDE. */
1770 discard
= (flags
& SEC_EXCLUDE
) != 0;
1772 /* Discard input sections which are assigned to a section named
1773 DISCARD_SECTION_NAME. */
1774 if (strcmp (output
->name
, DISCARD_SECTION_NAME
) == 0)
1777 /* Discard debugging sections if we are stripping debugging
1779 if ((link_info
.strip
== strip_debugger
|| link_info
.strip
== strip_all
)
1780 && (flags
& SEC_DEBUGGING
) != 0)
1785 if (section
->output_section
== NULL
)
1787 /* This prevents future calls from assigning this section. */
1788 section
->output_section
= bfd_abs_section_ptr
;
1793 if (section
->output_section
== NULL
)
1796 lang_input_section_type
*new;
1799 if (output
->bfd_section
== NULL
)
1802 first
= ! output
->bfd_section
->linker_has_input
;
1803 output
->bfd_section
->linker_has_input
= 1;
1805 if (!link_info
.relocatable
1806 && !stripped_excluded_sections
)
1808 asection
*s
= output
->bfd_section
->map_tail
.s
;
1809 output
->bfd_section
->map_tail
.s
= section
;
1810 section
->map_head
.s
= NULL
;
1811 section
->map_tail
.s
= s
;
1813 s
->map_head
.s
= section
;
1815 output
->bfd_section
->map_head
.s
= section
;
1818 /* Add a section reference to the list. */
1819 new = new_stat (lang_input_section
, ptr
);
1821 new->section
= section
;
1823 section
->output_section
= output
->bfd_section
;
1825 flags
= section
->flags
;
1827 /* We don't copy the SEC_NEVER_LOAD flag from an input section
1828 to an output section, because we want to be able to include a
1829 SEC_NEVER_LOAD section in the middle of an otherwise loaded
1830 section (I don't know why we want to do this, but we do).
1831 build_link_order in ldwrite.c handles this case by turning
1832 the embedded SEC_NEVER_LOAD section into a fill. */
1834 flags
&= ~ SEC_NEVER_LOAD
;
1836 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
1837 already been processed. One reason to do this is that on pe
1838 format targets, .text$foo sections go into .text and it's odd
1839 to see .text with SEC_LINK_ONCE set. */
1841 if (! link_info
.relocatable
)
1842 flags
&= ~ (SEC_LINK_ONCE
| SEC_LINK_DUPLICATES
);
1844 /* If this is not the first input section, and the SEC_READONLY
1845 flag is not currently set, then don't set it just because the
1846 input section has it set. */
1848 if (! first
&& (output
->bfd_section
->flags
& SEC_READONLY
) == 0)
1849 flags
&= ~ SEC_READONLY
;
1851 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
1853 && ((output
->bfd_section
->flags
& (SEC_MERGE
| SEC_STRINGS
))
1854 != (flags
& (SEC_MERGE
| SEC_STRINGS
))
1855 || ((flags
& SEC_MERGE
)
1856 && output
->bfd_section
->entsize
!= section
->entsize
)))
1858 output
->bfd_section
->flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1859 flags
&= ~ (SEC_MERGE
| SEC_STRINGS
);
1862 output
->bfd_section
->flags
|= flags
;
1864 if (flags
& SEC_MERGE
)
1865 output
->bfd_section
->entsize
= section
->entsize
;
1867 /* If SEC_READONLY is not set in the input section, then clear
1868 it from the output section. */
1869 if ((section
->flags
& SEC_READONLY
) == 0)
1870 output
->bfd_section
->flags
&= ~SEC_READONLY
;
1872 switch (output
->sectype
)
1874 case normal_section
:
1879 case overlay_section
:
1880 output
->bfd_section
->flags
&= ~SEC_ALLOC
;
1882 case noload_section
:
1883 output
->bfd_section
->flags
&= ~SEC_LOAD
;
1884 output
->bfd_section
->flags
|= SEC_NEVER_LOAD
;
1888 /* Copy over SEC_SMALL_DATA. */
1889 if (section
->flags
& SEC_SMALL_DATA
)
1890 output
->bfd_section
->flags
|= SEC_SMALL_DATA
;
1892 if (section
->alignment_power
> output
->bfd_section
->alignment_power
)
1893 output
->bfd_section
->alignment_power
= section
->alignment_power
;
1895 /* If supplied an alignment, then force it. */
1896 if (output
->section_alignment
!= -1)
1897 output
->bfd_section
->alignment_power
= output
->section_alignment
;
1899 if (bfd_get_arch (section
->owner
) == bfd_arch_tic54x
1900 && (section
->flags
& SEC_TIC54X_BLOCK
) != 0)
1902 output
->bfd_section
->flags
|= SEC_TIC54X_BLOCK
;
1903 /* FIXME: This value should really be obtained from the bfd... */
1904 output
->block_value
= 128;
1909 /* Compare sections ASEC and BSEC according to SORT. */
1912 compare_section (sort_type sort
, asection
*asec
, asection
*bsec
)
1921 case by_alignment_name
:
1922 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
1923 - bfd_section_alignment (asec
->owner
, asec
));
1929 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
1930 bfd_get_section_name (bsec
->owner
, bsec
));
1933 case by_name_alignment
:
1934 ret
= strcmp (bfd_get_section_name (asec
->owner
, asec
),
1935 bfd_get_section_name (bsec
->owner
, bsec
));
1941 ret
= (bfd_section_alignment (bsec
->owner
, bsec
)
1942 - bfd_section_alignment (asec
->owner
, asec
));
1949 /* Handle wildcard sorting. This returns the lang_input_section which
1950 should follow the one we are going to create for SECTION and FILE,
1951 based on the sorting requirements of WILD. It returns NULL if the
1952 new section should just go at the end of the current list. */
1954 static lang_statement_union_type
*
1955 wild_sort (lang_wild_statement_type
*wild
,
1956 struct wildcard_list
*sec
,
1957 lang_input_statement_type
*file
,
1960 const char *section_name
;
1961 lang_statement_union_type
*l
;
1963 if (!wild
->filenames_sorted
1964 && (sec
== NULL
|| sec
->spec
.sorted
== none
))
1967 section_name
= bfd_get_section_name (file
->the_bfd
, section
);
1968 for (l
= wild
->children
.head
; l
!= NULL
; l
= l
->header
.next
)
1970 lang_input_section_type
*ls
;
1972 if (l
->header
.type
!= lang_input_section_enum
)
1974 ls
= &l
->input_section
;
1976 /* Sorting by filename takes precedence over sorting by section
1979 if (wild
->filenames_sorted
)
1981 const char *fn
, *ln
;
1985 /* The PE support for the .idata section as generated by
1986 dlltool assumes that files will be sorted by the name of
1987 the archive and then the name of the file within the
1990 if (file
->the_bfd
!= NULL
1991 && bfd_my_archive (file
->the_bfd
) != NULL
)
1993 fn
= bfd_get_filename (bfd_my_archive (file
->the_bfd
));
1998 fn
= file
->filename
;
2002 if (ls
->ifile
->the_bfd
!= NULL
2003 && bfd_my_archive (ls
->ifile
->the_bfd
) != NULL
)
2005 ln
= bfd_get_filename (bfd_my_archive (ls
->ifile
->the_bfd
));
2010 ln
= ls
->ifile
->filename
;
2014 i
= strcmp (fn
, ln
);
2023 fn
= file
->filename
;
2025 ln
= ls
->ifile
->filename
;
2027 i
= strcmp (fn
, ln
);
2035 /* Here either the files are not sorted by name, or we are
2036 looking at the sections for this file. */
2038 if (sec
!= NULL
&& sec
->spec
.sorted
!= none
)
2039 if (compare_section (sec
->spec
.sorted
, section
, ls
->section
) < 0)
2046 /* Expand a wild statement for a particular FILE. SECTION may be
2047 NULL, in which case it is a wild card. */
2050 output_section_callback (lang_wild_statement_type
*ptr
,
2051 struct wildcard_list
*sec
,
2053 lang_input_statement_type
*file
,
2056 lang_statement_union_type
*before
;
2058 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2059 if (unique_section_p (section
))
2062 before
= wild_sort (ptr
, sec
, file
, section
);
2064 /* Here BEFORE points to the lang_input_section which
2065 should follow the one we are about to add. If BEFORE
2066 is NULL, then the section should just go at the end
2067 of the current list. */
2070 lang_add_section (&ptr
->children
, section
,
2071 (lang_output_section_statement_type
*) output
,
2075 lang_statement_list_type list
;
2076 lang_statement_union_type
**pp
;
2078 lang_list_init (&list
);
2079 lang_add_section (&list
, section
,
2080 (lang_output_section_statement_type
*) output
,
2083 /* If we are discarding the section, LIST.HEAD will
2085 if (list
.head
!= NULL
)
2087 ASSERT (list
.head
->header
.next
== NULL
);
2089 for (pp
= &ptr
->children
.head
;
2091 pp
= &(*pp
)->header
.next
)
2092 ASSERT (*pp
!= NULL
);
2094 list
.head
->header
.next
= *pp
;
2100 /* Check if all sections in a wild statement for a particular FILE
2104 check_section_callback (lang_wild_statement_type
*ptr ATTRIBUTE_UNUSED
,
2105 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
2107 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
2110 /* Exclude sections that match UNIQUE_SECTION_LIST. */
2111 if (unique_section_p (section
))
2114 if (section
->output_section
== NULL
&& (section
->flags
& SEC_READONLY
) == 0)
2115 ((lang_output_section_statement_type
*) data
)->all_input_readonly
= FALSE
;
2118 /* This is passed a file name which must have been seen already and
2119 added to the statement tree. We will see if it has been opened
2120 already and had its symbols read. If not then we'll read it. */
2122 static lang_input_statement_type
*
2123 lookup_name (const char *name
)
2125 lang_input_statement_type
*search
;
2127 for (search
= (lang_input_statement_type
*) input_file_chain
.head
;
2129 search
= (lang_input_statement_type
*) search
->next_real_file
)
2131 /* Use the local_sym_name as the name of the file that has
2132 already been loaded as filename might have been transformed
2133 via the search directory lookup mechanism. */
2134 const char * filename
= search
->local_sym_name
;
2136 if (filename
== NULL
&& name
== NULL
)
2138 if (filename
!= NULL
2140 && strcmp (filename
, name
) == 0)
2145 search
= new_afile (name
, lang_input_file_is_search_file_enum
,
2146 default_target
, FALSE
);
2148 /* If we have already added this file, or this file is not real
2149 (FIXME: can that ever actually happen?) or the name is NULL
2150 (FIXME: can that ever actually happen?) don't add this file. */
2153 || search
->filename
== NULL
)
2156 if (! load_symbols (search
, NULL
))
2162 /* Save LIST as a list of libraries whose symbols should not be exported. */
2167 struct excluded_lib
*next
;
2169 static struct excluded_lib
*excluded_libs
;
2172 add_excluded_libs (const char *list
)
2174 const char *p
= list
, *end
;
2178 struct excluded_lib
*entry
;
2179 end
= strpbrk (p
, ",:");
2181 end
= p
+ strlen (p
);
2182 entry
= xmalloc (sizeof (*entry
));
2183 entry
->next
= excluded_libs
;
2184 entry
->name
= xmalloc (end
- p
+ 1);
2185 memcpy (entry
->name
, p
, end
- p
);
2186 entry
->name
[end
- p
] = '\0';
2187 excluded_libs
= entry
;
2195 check_excluded_libs (bfd
*abfd
)
2197 struct excluded_lib
*lib
= excluded_libs
;
2201 int len
= strlen (lib
->name
);
2202 const char *filename
= lbasename (abfd
->filename
);
2204 if (strcmp (lib
->name
, "ALL") == 0)
2206 abfd
->no_export
= TRUE
;
2210 if (strncmp (lib
->name
, filename
, len
) == 0
2211 && (filename
[len
] == '\0'
2212 || (filename
[len
] == '.' && filename
[len
+ 1] == 'a'
2213 && filename
[len
+ 2] == '\0')))
2215 abfd
->no_export
= TRUE
;
2223 /* Get the symbols for an input file. */
2226 load_symbols (lang_input_statement_type
*entry
,
2227 lang_statement_list_type
*place
)
2234 ldfile_open_file (entry
);
2236 if (! bfd_check_format (entry
->the_bfd
, bfd_archive
)
2237 && ! bfd_check_format_matches (entry
->the_bfd
, bfd_object
, &matching
))
2240 lang_statement_list_type
*hold
;
2241 bfd_boolean bad_load
= TRUE
;
2242 bfd_boolean save_ldlang_sysrooted_script
;
2244 err
= bfd_get_error ();
2246 /* See if the emulation has some special knowledge. */
2247 if (ldemul_unrecognized_file (entry
))
2250 if (err
== bfd_error_file_ambiguously_recognized
)
2254 einfo (_("%B: file not recognized: %E\n"), entry
->the_bfd
);
2255 einfo (_("%B: matching formats:"), entry
->the_bfd
);
2256 for (p
= matching
; *p
!= NULL
; p
++)
2260 else if (err
!= bfd_error_file_not_recognized
2262 einfo (_("%F%B: file not recognized: %E\n"), entry
->the_bfd
);
2266 bfd_close (entry
->the_bfd
);
2267 entry
->the_bfd
= NULL
;
2269 /* Try to interpret the file as a linker script. */
2270 ldfile_open_command_file (entry
->filename
);
2274 save_ldlang_sysrooted_script
= ldlang_sysrooted_script
;
2275 ldlang_sysrooted_script
= entry
->sysrooted
;
2277 ldfile_assumed_script
= TRUE
;
2278 parser_input
= input_script
;
2279 /* We want to use the same -Bdynamic/-Bstatic as the one for
2281 config
.dynamic_link
= entry
->dynamic
;
2283 ldfile_assumed_script
= FALSE
;
2285 ldlang_sysrooted_script
= save_ldlang_sysrooted_script
;
2291 if (ldemul_recognized_file (entry
))
2294 /* We don't call ldlang_add_file for an archive. Instead, the
2295 add_symbols entry point will call ldlang_add_file, via the
2296 add_archive_element callback, for each element of the archive
2298 switch (bfd_get_format (entry
->the_bfd
))
2304 ldlang_add_file (entry
);
2305 if (trace_files
|| trace_file_tries
)
2306 info_msg ("%I\n", entry
);
2310 check_excluded_libs (entry
->the_bfd
);
2312 if (entry
->whole_archive
)
2315 bfd_boolean loaded
= TRUE
;
2319 member
= bfd_openr_next_archived_file (entry
->the_bfd
, member
);
2324 if (! bfd_check_format (member
, bfd_object
))
2326 einfo (_("%F%B: member %B in archive is not an object\n"),
2327 entry
->the_bfd
, member
);
2331 if (! ((*link_info
.callbacks
->add_archive_element
)
2332 (&link_info
, member
, "--whole-archive")))
2335 if (! bfd_link_add_symbols (member
, &link_info
))
2337 einfo (_("%F%B: could not read symbols: %E\n"), member
);
2342 entry
->loaded
= loaded
;
2348 if (bfd_link_add_symbols (entry
->the_bfd
, &link_info
))
2349 entry
->loaded
= TRUE
;
2351 einfo (_("%F%B: could not read symbols: %E\n"), entry
->the_bfd
);
2353 return entry
->loaded
;
2356 /* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2357 may be NULL, indicating that it is a wildcard. Separate
2358 lang_input_section statements are created for each part of the
2359 expansion; they are added after the wild statement S. OUTPUT is
2360 the output section. */
2363 wild (lang_wild_statement_type
*s
,
2364 const char *target ATTRIBUTE_UNUSED
,
2365 lang_output_section_statement_type
*output
)
2367 struct wildcard_list
*sec
;
2369 walk_wild (s
, output_section_callback
, output
);
2371 for (sec
= s
->section_list
; sec
!= NULL
; sec
= sec
->next
)
2373 if (default_common_section
!= NULL
)
2375 if (sec
->spec
.name
!= NULL
&& strcmp (sec
->spec
.name
, "COMMON") == 0)
2377 /* Remember the section that common is going to in case we
2378 later get something which doesn't know where to put it. */
2379 default_common_section
= output
;
2384 /* Return TRUE iff target is the sought target. */
2387 get_target (const bfd_target
*target
, void *data
)
2389 const char *sought
= data
;
2391 return strcmp (target
->name
, sought
) == 0;
2394 /* Like strcpy() but convert to lower case as well. */
2397 stricpy (char *dest
, char *src
)
2401 while ((c
= *src
++) != 0)
2402 *dest
++ = TOLOWER (c
);
2407 /* Remove the first occurrence of needle (if any) in haystack
2411 strcut (char *haystack
, char *needle
)
2413 haystack
= strstr (haystack
, needle
);
2419 for (src
= haystack
+ strlen (needle
); *src
;)
2420 *haystack
++ = *src
++;
2426 /* Compare two target format name strings.
2427 Return a value indicating how "similar" they are. */
2430 name_compare (char *first
, char *second
)
2436 copy1
= xmalloc (strlen (first
) + 1);
2437 copy2
= xmalloc (strlen (second
) + 1);
2439 /* Convert the names to lower case. */
2440 stricpy (copy1
, first
);
2441 stricpy (copy2
, second
);
2443 /* Remove size and endian strings from the name. */
2444 strcut (copy1
, "big");
2445 strcut (copy1
, "little");
2446 strcut (copy2
, "big");
2447 strcut (copy2
, "little");
2449 /* Return a value based on how many characters match,
2450 starting from the beginning. If both strings are
2451 the same then return 10 * their length. */
2452 for (result
= 0; copy1
[result
] == copy2
[result
]; result
++)
2453 if (copy1
[result
] == 0)
2465 /* Set by closest_target_match() below. */
2466 static const bfd_target
*winner
;
2468 /* Scan all the valid bfd targets looking for one that has the endianness
2469 requirement that was specified on the command line, and is the nearest
2470 match to the original output target. */
2473 closest_target_match (const bfd_target
*target
, void *data
)
2475 const bfd_target
*original
= data
;
2477 if (command_line
.endian
== ENDIAN_BIG
2478 && target
->byteorder
!= BFD_ENDIAN_BIG
)
2481 if (command_line
.endian
== ENDIAN_LITTLE
2482 && target
->byteorder
!= BFD_ENDIAN_LITTLE
)
2485 /* Must be the same flavour. */
2486 if (target
->flavour
!= original
->flavour
)
2489 /* If we have not found a potential winner yet, then record this one. */
2496 /* Oh dear, we now have two potential candidates for a successful match.
2497 Compare their names and choose the better one. */
2498 if (name_compare (target
->name
, original
->name
)
2499 > name_compare (winner
->name
, original
->name
))
2502 /* Keep on searching until wqe have checked them all. */
2506 /* Return the BFD target format of the first input file. */
2509 get_first_input_target (void)
2511 char *target
= NULL
;
2513 LANG_FOR_EACH_INPUT_STATEMENT (s
)
2515 if (s
->header
.type
== lang_input_statement_enum
2518 ldfile_open_file (s
);
2520 if (s
->the_bfd
!= NULL
2521 && bfd_check_format (s
->the_bfd
, bfd_object
))
2523 target
= bfd_get_target (s
->the_bfd
);
2535 lang_get_output_target (void)
2539 /* Has the user told us which output format to use? */
2540 if (output_target
!= NULL
)
2541 return output_target
;
2543 /* No - has the current target been set to something other than
2545 if (current_target
!= default_target
)
2546 return current_target
;
2548 /* No - can we determine the format of the first input file? */
2549 target
= get_first_input_target ();
2553 /* Failed - use the default output target. */
2554 return default_target
;
2557 /* Open the output file. */
2560 open_output (const char *name
)
2564 output_target
= lang_get_output_target ();
2566 /* Has the user requested a particular endianness on the command
2568 if (command_line
.endian
!= ENDIAN_UNSET
)
2570 const bfd_target
*target
;
2571 enum bfd_endian desired_endian
;
2573 /* Get the chosen target. */
2574 target
= bfd_search_for_target (get_target
, (void *) output_target
);
2576 /* If the target is not supported, we cannot do anything. */
2579 if (command_line
.endian
== ENDIAN_BIG
)
2580 desired_endian
= BFD_ENDIAN_BIG
;
2582 desired_endian
= BFD_ENDIAN_LITTLE
;
2584 /* See if the target has the wrong endianness. This should
2585 not happen if the linker script has provided big and
2586 little endian alternatives, but some scrips don't do
2588 if (target
->byteorder
!= desired_endian
)
2590 /* If it does, then see if the target provides
2591 an alternative with the correct endianness. */
2592 if (target
->alternative_target
!= NULL
2593 && (target
->alternative_target
->byteorder
== desired_endian
))
2594 output_target
= target
->alternative_target
->name
;
2597 /* Try to find a target as similar as possible to
2598 the default target, but which has the desired
2599 endian characteristic. */
2600 bfd_search_for_target (closest_target_match
,
2603 /* Oh dear - we could not find any targets that
2604 satisfy our requirements. */
2606 einfo (_("%P: warning: could not find any targets"
2607 " that match endianness requirement\n"));
2609 output_target
= winner
->name
;
2615 output
= bfd_openw (name
, output_target
);
2619 if (bfd_get_error () == bfd_error_invalid_target
)
2620 einfo (_("%P%F: target %s not found\n"), output_target
);
2622 einfo (_("%P%F: cannot open output file %s: %E\n"), name
);
2625 delete_output_file_on_failure
= TRUE
;
2627 if (! bfd_set_format (output
, bfd_object
))
2628 einfo (_("%P%F:%s: can not make object file: %E\n"), name
);
2629 if (! bfd_set_arch_mach (output
,
2630 ldfile_output_architecture
,
2631 ldfile_output_machine
))
2632 einfo (_("%P%F:%s: can not set architecture: %E\n"), name
);
2634 link_info
.hash
= bfd_link_hash_table_create (output
);
2635 if (link_info
.hash
== NULL
)
2636 einfo (_("%P%F: can not create link hash table: %E\n"));
2638 bfd_set_gp_size (output
, g_switch_value
);
2643 ldlang_open_output (lang_statement_union_type
*statement
)
2645 switch (statement
->header
.type
)
2647 case lang_output_statement_enum
:
2648 ASSERT (output_bfd
== NULL
);
2649 output_bfd
= open_output (statement
->output_statement
.name
);
2650 ldemul_set_output_arch ();
2651 if (config
.magic_demand_paged
&& !link_info
.relocatable
)
2652 output_bfd
->flags
|= D_PAGED
;
2654 output_bfd
->flags
&= ~D_PAGED
;
2655 if (config
.text_read_only
)
2656 output_bfd
->flags
|= WP_TEXT
;
2658 output_bfd
->flags
&= ~WP_TEXT
;
2659 if (link_info
.traditional_format
)
2660 output_bfd
->flags
|= BFD_TRADITIONAL_FORMAT
;
2662 output_bfd
->flags
&= ~BFD_TRADITIONAL_FORMAT
;
2665 case lang_target_statement_enum
:
2666 current_target
= statement
->target_statement
.target
;
2673 /* Convert between addresses in bytes and sizes in octets.
2674 For currently supported targets, octets_per_byte is always a power
2675 of two, so we can use shifts. */
2676 #define TO_ADDR(X) ((X) >> opb_shift)
2677 #define TO_SIZE(X) ((X) << opb_shift)
2679 /* Support the above. */
2680 static unsigned int opb_shift
= 0;
2685 unsigned x
= bfd_arch_mach_octets_per_byte (ldfile_output_architecture
,
2686 ldfile_output_machine
);
2689 while ((x
& 1) == 0)
2697 /* Open all the input files. */
2700 open_input_bfds (lang_statement_union_type
*s
, bfd_boolean force
)
2702 for (; s
!= NULL
; s
= s
->header
.next
)
2704 switch (s
->header
.type
)
2706 case lang_constructors_statement_enum
:
2707 open_input_bfds (constructor_list
.head
, force
);
2709 case lang_output_section_statement_enum
:
2710 open_input_bfds (s
->output_section_statement
.children
.head
, force
);
2712 case lang_wild_statement_enum
:
2713 /* Maybe we should load the file's symbols. */
2714 if (s
->wild_statement
.filename
2715 && ! wildcardp (s
->wild_statement
.filename
))
2716 lookup_name (s
->wild_statement
.filename
);
2717 open_input_bfds (s
->wild_statement
.children
.head
, force
);
2719 case lang_group_statement_enum
:
2721 struct bfd_link_hash_entry
*undefs
;
2723 /* We must continually search the entries in the group
2724 until no new symbols are added to the list of undefined
2729 undefs
= link_info
.hash
->undefs_tail
;
2730 open_input_bfds (s
->group_statement
.children
.head
, TRUE
);
2732 while (undefs
!= link_info
.hash
->undefs_tail
);
2735 case lang_target_statement_enum
:
2736 current_target
= s
->target_statement
.target
;
2738 case lang_input_statement_enum
:
2739 if (s
->input_statement
.real
)
2741 lang_statement_list_type add
;
2743 s
->input_statement
.target
= current_target
;
2745 /* If we are being called from within a group, and this
2746 is an archive which has already been searched, then
2747 force it to be researched unless the whole archive
2748 has been loaded already. */
2750 && !s
->input_statement
.whole_archive
2751 && s
->input_statement
.loaded
2752 && bfd_check_format (s
->input_statement
.the_bfd
,
2754 s
->input_statement
.loaded
= FALSE
;
2756 lang_list_init (&add
);
2758 if (! load_symbols (&s
->input_statement
, &add
))
2759 config
.make_executable
= FALSE
;
2761 if (add
.head
!= NULL
)
2763 *add
.tail
= s
->header
.next
;
2764 s
->header
.next
= add
.head
;
2774 /* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
2777 lang_track_definedness (const char *name
)
2779 if (bfd_hash_lookup (&lang_definedness_table
, name
, TRUE
, FALSE
) == NULL
)
2780 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name
);
2783 /* New-function for the definedness hash table. */
2785 static struct bfd_hash_entry
*
2786 lang_definedness_newfunc (struct bfd_hash_entry
*entry
,
2787 struct bfd_hash_table
*table ATTRIBUTE_UNUSED
,
2788 const char *name ATTRIBUTE_UNUSED
)
2790 struct lang_definedness_hash_entry
*ret
2791 = (struct lang_definedness_hash_entry
*) entry
;
2794 ret
= (struct lang_definedness_hash_entry
*)
2795 bfd_hash_allocate (table
, sizeof (struct lang_definedness_hash_entry
));
2798 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name
);
2800 ret
->iteration
= -1;
2804 /* Return the iteration when the definition of NAME was last updated. A
2805 value of -1 means that the symbol is not defined in the linker script
2806 or the command line, but may be defined in the linker symbol table. */
2809 lang_symbol_definition_iteration (const char *name
)
2811 struct lang_definedness_hash_entry
*defentry
2812 = (struct lang_definedness_hash_entry
*)
2813 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2815 /* We've already created this one on the presence of DEFINED in the
2816 script, so it can't be NULL unless something is borked elsewhere in
2818 if (defentry
== NULL
)
2821 return defentry
->iteration
;
2824 /* Update the definedness state of NAME. */
2827 lang_update_definedness (const char *name
, struct bfd_link_hash_entry
*h
)
2829 struct lang_definedness_hash_entry
*defentry
2830 = (struct lang_definedness_hash_entry
*)
2831 bfd_hash_lookup (&lang_definedness_table
, name
, FALSE
, FALSE
);
2833 /* We don't keep track of symbols not tested with DEFINED. */
2834 if (defentry
== NULL
)
2837 /* If the symbol was already defined, and not from an earlier statement
2838 iteration, don't update the definedness iteration, because that'd
2839 make the symbol seem defined in the linker script at this point, and
2840 it wasn't; it was defined in some object. If we do anyway, DEFINED
2841 would start to yield false before this point and the construct "sym =
2842 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
2844 if (h
->type
!= bfd_link_hash_undefined
2845 && h
->type
!= bfd_link_hash_common
2846 && h
->type
!= bfd_link_hash_new
2847 && defentry
->iteration
== -1)
2850 defentry
->iteration
= lang_statement_iteration
;
2853 /* Add the supplied name to the symbol table as an undefined reference.
2854 This is a two step process as the symbol table doesn't even exist at
2855 the time the ld command line is processed. First we put the name
2856 on a list, then, once the output file has been opened, transfer the
2857 name to the symbol table. */
2859 typedef struct bfd_sym_chain ldlang_undef_chain_list_type
;
2861 #define ldlang_undef_chain_list_head entry_symbol.next
2864 ldlang_add_undef (const char *const name
)
2866 ldlang_undef_chain_list_type
*new =
2867 stat_alloc (sizeof (ldlang_undef_chain_list_type
));
2869 new->next
= ldlang_undef_chain_list_head
;
2870 ldlang_undef_chain_list_head
= new;
2872 new->name
= xstrdup (name
);
2874 if (output_bfd
!= NULL
)
2875 insert_undefined (new->name
);
2878 /* Insert NAME as undefined in the symbol table. */
2881 insert_undefined (const char *name
)
2883 struct bfd_link_hash_entry
*h
;
2885 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, FALSE
, TRUE
);
2887 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
2888 if (h
->type
== bfd_link_hash_new
)
2890 h
->type
= bfd_link_hash_undefined
;
2891 h
->u
.undef
.abfd
= NULL
;
2892 bfd_link_add_undef (link_info
.hash
, h
);
2896 /* Run through the list of undefineds created above and place them
2897 into the linker hash table as undefined symbols belonging to the
2901 lang_place_undefineds (void)
2903 ldlang_undef_chain_list_type
*ptr
;
2905 for (ptr
= ldlang_undef_chain_list_head
; ptr
!= NULL
; ptr
= ptr
->next
)
2906 insert_undefined (ptr
->name
);
2909 /* Check for all readonly or some readwrite sections. */
2912 check_input_sections
2913 (lang_statement_union_type
*s
,
2914 lang_output_section_statement_type
*output_section_statement
)
2916 for (; s
!= (lang_statement_union_type
*) NULL
; s
= s
->header
.next
)
2918 switch (s
->header
.type
)
2920 case lang_wild_statement_enum
:
2921 walk_wild (&s
->wild_statement
, check_section_callback
,
2922 output_section_statement
);
2923 if (! output_section_statement
->all_input_readonly
)
2926 case lang_constructors_statement_enum
:
2927 check_input_sections (constructor_list
.head
,
2928 output_section_statement
);
2929 if (! output_section_statement
->all_input_readonly
)
2932 case lang_group_statement_enum
:
2933 check_input_sections (s
->group_statement
.children
.head
,
2934 output_section_statement
);
2935 if (! output_section_statement
->all_input_readonly
)
2944 /* Update wildcard statements if needed. */
2947 update_wild_statements (lang_statement_union_type
*s
)
2949 struct wildcard_list
*sec
;
2951 switch (sort_section
)
2961 for (; s
!= NULL
; s
= s
->header
.next
)
2963 switch (s
->header
.type
)
2968 case lang_wild_statement_enum
:
2969 sec
= s
->wild_statement
.section_list
;
2972 switch (sec
->spec
.sorted
)
2975 sec
->spec
.sorted
= sort_section
;
2978 if (sort_section
== by_alignment
)
2979 sec
->spec
.sorted
= by_name_alignment
;
2982 if (sort_section
== by_name
)
2983 sec
->spec
.sorted
= by_alignment_name
;
2991 case lang_constructors_statement_enum
:
2992 update_wild_statements (constructor_list
.head
);
2995 case lang_output_section_statement_enum
:
2996 update_wild_statements
2997 (s
->output_section_statement
.children
.head
);
3000 case lang_group_statement_enum
:
3001 update_wild_statements (s
->group_statement
.children
.head
);
3009 /* Open input files and attach to output sections. */
3012 map_input_to_output_sections
3013 (lang_statement_union_type
*s
, const char *target
,
3014 lang_output_section_statement_type
*os
)
3016 for (; s
!= NULL
; s
= s
->header
.next
)
3018 switch (s
->header
.type
)
3020 case lang_wild_statement_enum
:
3021 wild (&s
->wild_statement
, target
, os
);
3023 case lang_constructors_statement_enum
:
3024 map_input_to_output_sections (constructor_list
.head
,
3028 case lang_output_section_statement_enum
:
3029 if (s
->output_section_statement
.constraint
)
3031 if (s
->output_section_statement
.constraint
!= ONLY_IF_RW
3032 && s
->output_section_statement
.constraint
!= ONLY_IF_RO
)
3034 s
->output_section_statement
.all_input_readonly
= TRUE
;
3035 check_input_sections (s
->output_section_statement
.children
.head
,
3036 &s
->output_section_statement
);
3037 if ((s
->output_section_statement
.all_input_readonly
3038 && s
->output_section_statement
.constraint
== ONLY_IF_RW
)
3039 || (!s
->output_section_statement
.all_input_readonly
3040 && s
->output_section_statement
.constraint
== ONLY_IF_RO
))
3042 s
->output_section_statement
.constraint
= -1;
3047 map_input_to_output_sections (s
->output_section_statement
.children
.head
,
3049 &s
->output_section_statement
);
3051 case lang_output_statement_enum
:
3053 case lang_target_statement_enum
:
3054 target
= s
->target_statement
.target
;
3056 case lang_group_statement_enum
:
3057 map_input_to_output_sections (s
->group_statement
.children
.head
,
3061 case lang_data_statement_enum
:
3062 /* Make sure that any sections mentioned in the expression
3064 exp_init_os (s
->data_statement
.exp
);
3065 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3067 /* The output section gets contents, and then we inspect for
3068 any flags set in the input script which override any ALLOC. */
3069 os
->bfd_section
->flags
|= SEC_HAS_CONTENTS
;
3070 if (!(os
->flags
& SEC_NEVER_LOAD
))
3071 os
->bfd_section
->flags
|= SEC_ALLOC
| SEC_LOAD
;
3073 case lang_fill_statement_enum
:
3074 case lang_input_section_enum
:
3075 case lang_object_symbols_statement_enum
:
3076 case lang_reloc_statement_enum
:
3077 case lang_padding_statement_enum
:
3078 case lang_input_statement_enum
:
3079 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3082 case lang_assignment_statement_enum
:
3083 if (os
!= NULL
&& os
->bfd_section
== NULL
)
3086 /* Make sure that any sections mentioned in the assignment
3088 exp_init_os (s
->assignment_statement
.exp
);
3090 case lang_afile_asection_pair_statement_enum
:
3093 case lang_address_statement_enum
:
3094 /* Mark the specified section with the supplied address.
3096 If this section was actually a segment marker, then the
3097 directive is ignored if the linker script explicitly
3098 processed the segment marker. Originally, the linker
3099 treated segment directives (like -Ttext on the
3100 command-line) as section directives. We honor the
3101 section directive semantics for backwards compatibilty;
3102 linker scripts that do not specifically check for
3103 SEGMENT_START automatically get the old semantics. */
3104 if (!s
->address_statement
.segment
3105 || !s
->address_statement
.segment
->used
)
3107 lang_output_section_statement_type
*aos
3108 = (lang_output_section_statement_lookup
3109 (s
->address_statement
.section_name
));
3111 if (aos
->bfd_section
== NULL
)
3113 aos
->addr_tree
= s
->address_statement
.address
;
3120 /* An output section might have been removed after its statement was
3121 added. For example, ldemul_before_allocation can remove dynamic
3122 sections if they turn out to be not needed. Clean them up here. */
3125 strip_excluded_output_sections (void)
3127 lang_output_section_statement_type
*os
;
3129 /* Run lang_size_sections (if not already done). */
3130 if (expld
.phase
!= lang_mark_phase_enum
)
3132 expld
.phase
= lang_mark_phase_enum
;
3133 expld
.dataseg
.phase
= exp_dataseg_none
;
3134 one_lang_size_sections_pass (NULL
, FALSE
);
3135 lang_reset_memory_regions ();
3138 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
3142 asection
*output_section
;
3143 bfd_boolean exclude
;
3145 if (os
->constraint
== -1)
3148 output_section
= os
->bfd_section
;
3149 if (output_section
== NULL
)
3152 exclude
= (output_section
->rawsize
== 0
3153 && (output_section
->flags
& SEC_KEEP
) == 0
3154 && !bfd_section_removed_from_list (output_bfd
,
3157 /* Some sections have not yet been sized, notably .gnu.version,
3158 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3159 input sections, so don't drop output sections that have such
3160 input sections unless they are also marked SEC_EXCLUDE. */
3161 if (exclude
&& output_section
->map_head
.s
!= NULL
)
3165 for (s
= output_section
->map_head
.s
; s
!= NULL
; s
= s
->map_head
.s
)
3166 if ((s
->flags
& SEC_LINKER_CREATED
) != 0
3167 && (s
->flags
& SEC_EXCLUDE
) == 0)
3174 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3175 output_section
->map_head
.link_order
= NULL
;
3176 output_section
->map_tail
.link_order
= NULL
;
3180 /* We don't set bfd_section to NULL since bfd_section of the
3181 removed output section statement may still be used. */
3183 output_section
->flags
|= SEC_EXCLUDE
;
3184 bfd_section_list_remove (output_bfd
, output_section
);
3185 output_bfd
->section_count
--;
3189 /* Stop future calls to lang_add_section from messing with map_head
3190 and map_tail link_order fields. */
3191 stripped_excluded_sections
= TRUE
;
3195 print_output_section_statement
3196 (lang_output_section_statement_type
*output_section_statement
)
3198 asection
*section
= output_section_statement
->bfd_section
;
3201 if (output_section_statement
!= abs_output_section
)
3203 minfo ("\n%s", output_section_statement
->name
);
3205 if (section
!= NULL
)
3207 print_dot
= section
->vma
;
3209 len
= strlen (output_section_statement
->name
);
3210 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3215 while (len
< SECTION_NAME_MAP_LENGTH
)
3221 minfo ("0x%V %W", section
->vma
, section
->size
);
3223 if (output_section_statement
->load_base
!= NULL
)
3227 addr
= exp_get_abs_int (output_section_statement
->load_base
, 0,
3229 minfo (_(" load address 0x%V"), addr
);
3236 print_statement_list (output_section_statement
->children
.head
,
3237 output_section_statement
);
3240 /* Scan for the use of the destination in the right hand side
3241 of an expression. In such cases we will not compute the
3242 correct expression, since the value of DST that is used on
3243 the right hand side will be its final value, not its value
3244 just before this expression is evaluated. */
3247 scan_for_self_assignment (const char * dst
, etree_type
* rhs
)
3249 if (rhs
== NULL
|| dst
== NULL
)
3252 switch (rhs
->type
.node_class
)
3255 return scan_for_self_assignment (dst
, rhs
->binary
.lhs
)
3256 || scan_for_self_assignment (dst
, rhs
->binary
.rhs
);
3259 return scan_for_self_assignment (dst
, rhs
->trinary
.lhs
)
3260 || scan_for_self_assignment (dst
, rhs
->trinary
.rhs
);
3263 case etree_provided
:
3265 if (strcmp (dst
, rhs
->assign
.dst
) == 0)
3267 return scan_for_self_assignment (dst
, rhs
->assign
.src
);
3270 return scan_for_self_assignment (dst
, rhs
->unary
.child
);
3274 return strcmp (dst
, rhs
->value
.str
) == 0;
3279 return strcmp (dst
, rhs
->name
.name
) == 0;
3291 print_assignment (lang_assignment_statement_type
*assignment
,
3292 lang_output_section_statement_type
*output_section
)
3296 bfd_boolean computation_is_valid
= TRUE
;
3299 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3302 if (assignment
->exp
->type
.node_class
== etree_assert
)
3305 tree
= assignment
->exp
->assert_s
.child
;
3306 computation_is_valid
= TRUE
;
3310 const char *dst
= assignment
->exp
->assign
.dst
;
3312 is_dot
= (dst
[0] == '.' && dst
[1] == 0);
3313 tree
= assignment
->exp
->assign
.src
;
3314 computation_is_valid
= is_dot
|| (scan_for_self_assignment (dst
, tree
) == FALSE
);
3317 exp_fold_tree (tree
, output_section
->bfd_section
, &print_dot
);
3318 if (expld
.result
.valid_p
)
3322 if (computation_is_valid
)
3324 value
= expld
.result
.value
;
3326 if (expld
.result
.section
)
3327 value
+= expld
.result
.section
->vma
;
3329 minfo ("0x%V", value
);
3335 struct bfd_link_hash_entry
*h
;
3337 h
= bfd_link_hash_lookup (link_info
.hash
, assignment
->exp
->assign
.dst
,
3338 FALSE
, FALSE
, TRUE
);
3341 value
= h
->u
.def
.value
;
3343 if (expld
.result
.section
)
3344 value
+= expld
.result
.section
->vma
;
3346 minfo ("[0x%V]", value
);
3349 minfo ("[unresolved]");
3361 exp_print_tree (assignment
->exp
);
3366 print_input_statement (lang_input_statement_type
*statm
)
3368 if (statm
->filename
!= NULL
)
3370 fprintf (config
.map_file
, "LOAD %s\n", statm
->filename
);
3374 /* Print all symbols defined in a particular section. This is called
3375 via bfd_link_hash_traverse, or by print_all_symbols. */
3378 print_one_symbol (struct bfd_link_hash_entry
*hash_entry
, void *ptr
)
3380 asection
*sec
= ptr
;
3382 if ((hash_entry
->type
== bfd_link_hash_defined
3383 || hash_entry
->type
== bfd_link_hash_defweak
)
3384 && sec
== hash_entry
->u
.def
.section
)
3388 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3391 (hash_entry
->u
.def
.value
3392 + hash_entry
->u
.def
.section
->output_offset
3393 + hash_entry
->u
.def
.section
->output_section
->vma
));
3395 minfo (" %T\n", hash_entry
->root
.string
);
3402 print_all_symbols (sec
)
3405 struct fat_user_section_struct
*ud
= get_userdata (sec
);
3406 struct map_symbol_def
*def
;
3411 *ud
->map_symbol_def_tail
= 0;
3412 for (def
= ud
->map_symbol_def_head
; def
; def
= def
->next
)
3413 print_one_symbol (def
->entry
, sec
);
3416 /* Print information about an input section to the map file. */
3419 print_input_section (lang_input_section_type
*in
)
3421 asection
*i
= in
->section
;
3422 bfd_size_type size
= i
->size
;
3431 minfo ("%s", i
->name
);
3433 len
= 1 + strlen (i
->name
);
3434 if (len
>= SECTION_NAME_MAP_LENGTH
- 1)
3439 while (len
< SECTION_NAME_MAP_LENGTH
)
3445 if (i
->output_section
!= NULL
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3446 addr
= i
->output_section
->vma
+ i
->output_offset
;
3453 minfo ("0x%V %W %B\n", addr
, TO_ADDR (size
), i
->owner
);
3455 if (size
!= i
->rawsize
&& i
->rawsize
!= 0)
3457 len
= SECTION_NAME_MAP_LENGTH
+ 3;
3469 minfo (_("%W (size before relaxing)\n"), i
->rawsize
);
3472 if (i
->output_section
!= NULL
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3474 if (command_line
.reduce_memory_overheads
)
3475 bfd_link_hash_traverse (link_info
.hash
, print_one_symbol
, i
);
3477 print_all_symbols (i
);
3479 print_dot
= addr
+ TO_ADDR (size
);
3485 print_fill_statement (lang_fill_statement_type
*fill
)
3489 fputs (" FILL mask 0x", config
.map_file
);
3490 for (p
= fill
->fill
->data
, size
= fill
->fill
->size
; size
!= 0; p
++, size
--)
3491 fprintf (config
.map_file
, "%02x", *p
);
3492 fputs ("\n", config
.map_file
);
3496 print_data_statement (lang_data_statement_type
*data
)
3504 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3507 addr
= data
->output_vma
;
3508 if (data
->output_section
!= NULL
)
3509 addr
+= data
->output_section
->vma
;
3537 minfo ("0x%V %W %s 0x%v", addr
, size
, name
, data
->value
);
3539 if (data
->exp
->type
.node_class
!= etree_value
)
3542 exp_print_tree (data
->exp
);
3547 print_dot
= addr
+ TO_ADDR (size
);
3550 /* Print an address statement. These are generated by options like
3554 print_address_statement (lang_address_statement_type
*address
)
3556 minfo (_("Address of section %s set to "), address
->section_name
);
3557 exp_print_tree (address
->address
);
3561 /* Print a reloc statement. */
3564 print_reloc_statement (lang_reloc_statement_type
*reloc
)
3571 for (i
= 0; i
< SECTION_NAME_MAP_LENGTH
; i
++)
3574 addr
= reloc
->output_vma
;
3575 if (reloc
->output_section
!= NULL
)
3576 addr
+= reloc
->output_section
->vma
;
3578 size
= bfd_get_reloc_size (reloc
->howto
);
3580 minfo ("0x%V %W RELOC %s ", addr
, size
, reloc
->howto
->name
);
3582 if (reloc
->name
!= NULL
)
3583 minfo ("%s+", reloc
->name
);
3585 minfo ("%s+", reloc
->section
->name
);
3587 exp_print_tree (reloc
->addend_exp
);
3591 print_dot
= addr
+ TO_ADDR (size
);
3595 print_padding_statement (lang_padding_statement_type
*s
)
3603 len
= sizeof " *fill*" - 1;
3604 while (len
< SECTION_NAME_MAP_LENGTH
)
3610 addr
= s
->output_offset
;
3611 if (s
->output_section
!= NULL
)
3612 addr
+= s
->output_section
->vma
;
3613 minfo ("0x%V %W ", addr
, (bfd_vma
) s
->size
);
3615 if (s
->fill
->size
!= 0)
3619 for (p
= s
->fill
->data
, size
= s
->fill
->size
; size
!= 0; p
++, size
--)
3620 fprintf (config
.map_file
, "%02x", *p
);
3625 print_dot
= addr
+ TO_ADDR (s
->size
);
3629 print_wild_statement (lang_wild_statement_type
*w
,
3630 lang_output_section_statement_type
*os
)
3632 struct wildcard_list
*sec
;
3636 if (w
->filenames_sorted
)
3638 if (w
->filename
!= NULL
)
3639 minfo ("%s", w
->filename
);
3642 if (w
->filenames_sorted
)
3646 for (sec
= w
->section_list
; sec
; sec
= sec
->next
)
3648 if (sec
->spec
.sorted
)
3650 if (sec
->spec
.exclude_name_list
!= NULL
)
3653 minfo ("EXCLUDE_FILE(%s", sec
->spec
.exclude_name_list
->name
);
3654 for (tmp
= sec
->spec
.exclude_name_list
->next
; tmp
; tmp
= tmp
->next
)
3655 minfo (" %s", tmp
->name
);
3658 if (sec
->spec
.name
!= NULL
)
3659 minfo ("%s", sec
->spec
.name
);
3662 if (sec
->spec
.sorted
)
3671 print_statement_list (w
->children
.head
, os
);
3674 /* Print a group statement. */
3677 print_group (lang_group_statement_type
*s
,
3678 lang_output_section_statement_type
*os
)
3680 fprintf (config
.map_file
, "START GROUP\n");
3681 print_statement_list (s
->children
.head
, os
);
3682 fprintf (config
.map_file
, "END GROUP\n");
3685 /* Print the list of statements in S.
3686 This can be called for any statement type. */
3689 print_statement_list (lang_statement_union_type
*s
,
3690 lang_output_section_statement_type
*os
)
3694 print_statement (s
, os
);
3699 /* Print the first statement in statement list S.
3700 This can be called for any statement type. */
3703 print_statement (lang_statement_union_type
*s
,
3704 lang_output_section_statement_type
*os
)
3706 switch (s
->header
.type
)
3709 fprintf (config
.map_file
, _("Fail with %d\n"), s
->header
.type
);
3712 case lang_constructors_statement_enum
:
3713 if (constructor_list
.head
!= NULL
)
3715 if (constructors_sorted
)
3716 minfo (" SORT (CONSTRUCTORS)\n");
3718 minfo (" CONSTRUCTORS\n");
3719 print_statement_list (constructor_list
.head
, os
);
3722 case lang_wild_statement_enum
:
3723 print_wild_statement (&s
->wild_statement
, os
);
3725 case lang_address_statement_enum
:
3726 print_address_statement (&s
->address_statement
);
3728 case lang_object_symbols_statement_enum
:
3729 minfo (" CREATE_OBJECT_SYMBOLS\n");
3731 case lang_fill_statement_enum
:
3732 print_fill_statement (&s
->fill_statement
);
3734 case lang_data_statement_enum
:
3735 print_data_statement (&s
->data_statement
);
3737 case lang_reloc_statement_enum
:
3738 print_reloc_statement (&s
->reloc_statement
);
3740 case lang_input_section_enum
:
3741 print_input_section (&s
->input_section
);
3743 case lang_padding_statement_enum
:
3744 print_padding_statement (&s
->padding_statement
);
3746 case lang_output_section_statement_enum
:
3747 print_output_section_statement (&s
->output_section_statement
);
3749 case lang_assignment_statement_enum
:
3750 print_assignment (&s
->assignment_statement
, os
);
3752 case lang_target_statement_enum
:
3753 fprintf (config
.map_file
, "TARGET(%s)\n", s
->target_statement
.target
);
3755 case lang_output_statement_enum
:
3756 minfo ("OUTPUT(%s", s
->output_statement
.name
);
3757 if (output_target
!= NULL
)
3758 minfo (" %s", output_target
);
3761 case lang_input_statement_enum
:
3762 print_input_statement (&s
->input_statement
);
3764 case lang_group_statement_enum
:
3765 print_group (&s
->group_statement
, os
);
3767 case lang_afile_asection_pair_statement_enum
:
3774 print_statements (void)
3776 print_statement_list (statement_list
.head
, abs_output_section
);
3779 /* Print the first N statements in statement list S to STDERR.
3780 If N == 0, nothing is printed.
3781 If N < 0, the entire list is printed.
3782 Intended to be called from GDB. */
3785 dprint_statement (lang_statement_union_type
*s
, int n
)
3787 FILE *map_save
= config
.map_file
;
3789 config
.map_file
= stderr
;
3792 print_statement_list (s
, abs_output_section
);
3795 while (s
&& --n
>= 0)
3797 print_statement (s
, abs_output_section
);
3802 config
.map_file
= map_save
;
3806 insert_pad (lang_statement_union_type
**ptr
,
3808 unsigned int alignment_needed
,
3809 asection
*output_section
,
3812 static fill_type zero_fill
= { 1, { 0 } };
3813 lang_statement_union_type
*pad
= NULL
;
3815 if (ptr
!= &statement_list
.head
)
3816 pad
= ((lang_statement_union_type
*)
3817 ((char *) ptr
- offsetof (lang_statement_union_type
, header
.next
)));
3819 && pad
->header
.type
== lang_padding_statement_enum
3820 && pad
->padding_statement
.output_section
== output_section
)
3822 /* Use the existing pad statement. */
3824 else if ((pad
= *ptr
) != NULL
3825 && pad
->header
.type
== lang_padding_statement_enum
3826 && pad
->padding_statement
.output_section
== output_section
)
3828 /* Use the existing pad statement. */
3832 /* Make a new padding statement, linked into existing chain. */
3833 pad
= stat_alloc (sizeof (lang_padding_statement_type
));
3834 pad
->header
.next
= *ptr
;
3836 pad
->header
.type
= lang_padding_statement_enum
;
3837 pad
->padding_statement
.output_section
= output_section
;
3840 pad
->padding_statement
.fill
= fill
;
3842 pad
->padding_statement
.output_offset
= dot
- output_section
->vma
;
3843 pad
->padding_statement
.size
= alignment_needed
;
3844 output_section
->size
+= alignment_needed
;
3847 /* Work out how much this section will move the dot point. */
3851 (lang_statement_union_type
**this_ptr
,
3852 lang_output_section_statement_type
*output_section_statement
,
3856 lang_input_section_type
*is
= &((*this_ptr
)->input_section
);
3857 asection
*i
= is
->section
;
3859 if (!is
->ifile
->just_syms_flag
&& (i
->flags
& SEC_EXCLUDE
) == 0)
3861 unsigned int alignment_needed
;
3864 /* Align this section first to the input sections requirement,
3865 then to the output section's requirement. If this alignment
3866 is greater than any seen before, then record it too. Perform
3867 the alignment by inserting a magic 'padding' statement. */
3869 if (output_section_statement
->subsection_alignment
!= -1)
3870 i
->alignment_power
= output_section_statement
->subsection_alignment
;
3872 o
= output_section_statement
->bfd_section
;
3873 if (o
->alignment_power
< i
->alignment_power
)
3874 o
->alignment_power
= i
->alignment_power
;
3876 alignment_needed
= align_power (dot
, i
->alignment_power
) - dot
;
3878 if (alignment_needed
!= 0)
3880 insert_pad (this_ptr
, fill
, TO_SIZE (alignment_needed
), o
, dot
);
3881 dot
+= alignment_needed
;
3884 /* Remember where in the output section this input section goes. */
3886 i
->output_offset
= dot
- o
->vma
;
3888 /* Mark how big the output section must be to contain this now. */
3889 dot
+= TO_ADDR (i
->size
);
3890 o
->size
= TO_SIZE (dot
- o
->vma
);
3894 i
->output_offset
= i
->vma
- output_section_statement
->bfd_section
->vma
;
3901 sort_sections_by_lma (const void *arg1
, const void *arg2
)
3903 const asection
*sec1
= *(const asection
**) arg1
;
3904 const asection
*sec2
= *(const asection
**) arg2
;
3906 if (bfd_section_lma (sec1
->owner
, sec1
)
3907 < bfd_section_lma (sec2
->owner
, sec2
))
3909 else if (bfd_section_lma (sec1
->owner
, sec1
)
3910 > bfd_section_lma (sec2
->owner
, sec2
))
3916 #define IGNORE_SECTION(s) \
3917 ((s->flags & SEC_NEVER_LOAD) != 0 \
3918 || (s->flags & SEC_ALLOC) == 0 \
3919 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
3920 && (s->flags & SEC_LOAD) == 0))
3922 /* Check to see if any allocated sections overlap with other allocated
3923 sections. This can happen if a linker script specifies the output
3924 section addresses of the two sections. */
3927 lang_check_section_addresses (void)
3930 asection
**sections
, **spp
;
3938 if (bfd_count_sections (output_bfd
) <= 1)
3941 amt
= bfd_count_sections (output_bfd
) * sizeof (asection
*);
3942 sections
= xmalloc (amt
);
3944 /* Scan all sections in the output list. */
3946 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
3948 /* Only consider loadable sections with real contents. */
3949 if (IGNORE_SECTION (s
) || s
->size
== 0)
3952 sections
[count
] = s
;
3959 qsort (sections
, (size_t) count
, sizeof (asection
*),
3960 sort_sections_by_lma
);
3964 s_start
= bfd_section_lma (output_bfd
, s
);
3965 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
3966 for (count
--; count
; count
--)
3968 /* We must check the sections' LMA addresses not their VMA
3969 addresses because overlay sections can have overlapping VMAs
3970 but they must have distinct LMAs. */
3975 s_start
= bfd_section_lma (output_bfd
, s
);
3976 s_end
= s_start
+ TO_ADDR (s
->size
) - 1;
3978 /* Look for an overlap. */
3979 if (s_end
>= os_start
&& s_start
<= os_end
)
3980 einfo (_("%X%P: section %s [%V -> %V] overlaps section %s [%V -> %V]\n"),
3981 s
->name
, s_start
, s_end
, os
->name
, os_start
, os_end
);
3987 /* Make sure the new address is within the region. We explicitly permit the
3988 current address to be at the exact end of the region when the address is
3989 non-zero, in case the region is at the end of addressable memory and the
3990 calculation wraps around. */
3993 os_region_check (lang_output_section_statement_type
*os
,
3994 lang_memory_region_type
*region
,
3998 if ((region
->current
< region
->origin
3999 || (region
->current
- region
->origin
> region
->length
))
4000 && ((region
->current
!= region
->origin
+ region
->length
)
4005 einfo (_("%X%P: address 0x%v of %B section %s"
4006 " is not within region %s\n"),
4008 os
->bfd_section
->owner
,
4009 os
->bfd_section
->name
,
4014 einfo (_("%X%P: region %s is full (%B section %s)\n"),
4016 os
->bfd_section
->owner
,
4017 os
->bfd_section
->name
);
4019 /* Reset the region pointer. */
4020 region
->current
= region
->origin
;
4024 /* Set the sizes for all the output sections. */
4027 lang_size_sections_1
4028 (lang_statement_union_type
*s
,
4029 lang_output_section_statement_type
*output_section_statement
,
4030 lang_statement_union_type
**prev
,
4034 bfd_boolean check_regions
)
4036 /* Size up the sections from their constituent parts. */
4037 for (; s
!= NULL
; s
= s
->header
.next
)
4039 switch (s
->header
.type
)
4041 case lang_output_section_statement_enum
:
4043 bfd_vma newdot
, after
;
4044 lang_output_section_statement_type
*os
;
4046 os
= &s
->output_section_statement
;
4047 if (os
->addr_tree
!= NULL
)
4049 os
->processed
= FALSE
;
4050 exp_fold_tree (os
->addr_tree
, bfd_abs_section_ptr
, &dot
);
4052 if (!expld
.result
.valid_p
4053 && expld
.phase
!= lang_mark_phase_enum
)
4054 einfo (_("%F%S: non constant or forward reference"
4055 " address expression for section %s\n"),
4058 dot
= expld
.result
.value
+ expld
.result
.section
->vma
;
4061 if (os
->bfd_section
== NULL
)
4062 /* This section was removed or never actually created. */
4065 /* If this is a COFF shared library section, use the size and
4066 address from the input section. FIXME: This is COFF
4067 specific; it would be cleaner if there were some other way
4068 to do this, but nothing simple comes to mind. */
4069 if ((bfd_get_flavour (output_bfd
) == bfd_target_ecoff_flavour
4070 || bfd_get_flavour (output_bfd
) == bfd_target_coff_flavour
)
4071 && (os
->bfd_section
->flags
& SEC_COFF_SHARED_LIBRARY
) != 0)
4075 if (os
->children
.head
== NULL
4076 || os
->children
.head
->header
.next
!= NULL
4077 || (os
->children
.head
->header
.type
4078 != lang_input_section_enum
))
4079 einfo (_("%P%X: Internal error on COFF shared library"
4080 " section %s\n"), os
->name
);
4082 input
= os
->children
.head
->input_section
.section
;
4083 bfd_set_section_vma (os
->bfd_section
->owner
,
4085 bfd_section_vma (input
->owner
, input
));
4086 os
->bfd_section
->size
= input
->size
;
4091 if (bfd_is_abs_section (os
->bfd_section
))
4093 /* No matter what happens, an abs section starts at zero. */
4094 ASSERT (os
->bfd_section
->vma
== 0);
4098 if (os
->addr_tree
== NULL
)
4100 /* No address specified for this section, get one
4101 from the region specification. */
4102 if (os
->region
== NULL
4103 || ((os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))
4104 && os
->region
->name
[0] == '*'
4105 && strcmp (os
->region
->name
,
4106 DEFAULT_MEMORY_REGION
) == 0))
4108 os
->region
= lang_memory_default (os
->bfd_section
);
4111 /* If a loadable section is using the default memory
4112 region, and some non default memory regions were
4113 defined, issue an error message. */
4114 if (!IGNORE_SECTION (os
->bfd_section
)
4115 && ! link_info
.relocatable
4117 && strcmp (os
->region
->name
,
4118 DEFAULT_MEMORY_REGION
) == 0
4119 && lang_memory_region_list
!= NULL
4120 && (strcmp (lang_memory_region_list
->name
,
4121 DEFAULT_MEMORY_REGION
) != 0
4122 || lang_memory_region_list
->next
!= NULL
)
4123 && expld
.phase
!= lang_mark_phase_enum
)
4125 /* By default this is an error rather than just a
4126 warning because if we allocate the section to the
4127 default memory region we can end up creating an
4128 excessively large binary, or even seg faulting when
4129 attempting to perform a negative seek. See
4130 sources.redhat.com/ml/binutils/2003-04/msg00423.html
4131 for an example of this. This behaviour can be
4132 overridden by the using the --no-check-sections
4134 if (command_line
.check_section_addresses
)
4135 einfo (_("%P%F: error: no memory region specified"
4136 " for loadable section `%s'\n"),
4137 bfd_get_section_name (output_bfd
,
4140 einfo (_("%P: warning: no memory region specified"
4141 " for loadable section `%s'\n"),
4142 bfd_get_section_name (output_bfd
,
4146 newdot
= os
->region
->current
;
4148 if (os
->section_alignment
== -1)
4150 bfd_vma savedot
= newdot
;
4151 newdot
= align_power (newdot
,
4152 os
->bfd_section
->alignment_power
);
4154 if (newdot
!= savedot
4155 && config
.warn_section_align
4156 && expld
.phase
!= lang_mark_phase_enum
)
4157 einfo (_("%P: warning: changing start of section"
4158 " %s by %lu bytes\n"),
4159 os
->name
, (unsigned long) (newdot
- savedot
));
4163 /* The section starts here.
4164 First, align to what the section needs. */
4166 if (os
->section_alignment
!= -1)
4167 newdot
= align_power (newdot
, os
->section_alignment
);
4169 bfd_set_section_vma (0, os
->bfd_section
, newdot
);
4171 os
->bfd_section
->output_offset
= 0;
4174 lang_size_sections_1 (os
->children
.head
, os
, &os
->children
.head
,
4175 os
->fill
, newdot
, relax
, check_regions
);
4177 os
->processed
= TRUE
;
4179 if (bfd_is_abs_section (os
->bfd_section
) || os
->ignored
)
4181 ASSERT (os
->bfd_section
->size
== 0);
4185 dot
= os
->bfd_section
->vma
;
4187 /* Put the section within the requested block size, or
4188 align at the block boundary. */
4190 + TO_ADDR (os
->bfd_section
->size
)
4191 + os
->block_value
- 1)
4192 & - (bfd_vma
) os
->block_value
);
4194 os
->bfd_section
->size
= TO_SIZE (after
- os
->bfd_section
->vma
);
4196 /* .tbss sections effectively have zero size. */
4197 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4198 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4199 || link_info
.relocatable
)
4200 dot
+= TO_ADDR (os
->bfd_section
->size
);
4202 if (os
->update_dot_tree
!= 0)
4203 exp_fold_tree (os
->update_dot_tree
, bfd_abs_section_ptr
, &dot
);
4205 /* Update dot in the region ?
4206 We only do this if the section is going to be allocated,
4207 since unallocated sections do not contribute to the region's
4208 overall size in memory.
4210 If the SEC_NEVER_LOAD bit is not set, it will affect the
4211 addresses of sections after it. We have to update
4213 if (os
->region
!= NULL
4214 && ((os
->bfd_section
->flags
& SEC_NEVER_LOAD
) == 0
4215 || (os
->bfd_section
->flags
& (SEC_ALLOC
| SEC_LOAD
))))
4217 os
->region
->current
= dot
;
4220 /* Make sure the new address is within the region. */
4221 os_region_check (os
, os
->region
, os
->addr_tree
,
4222 os
->bfd_section
->vma
);
4224 /* If there's no load address specified, use the run
4225 region as the load region. */
4226 if (os
->lma_region
== NULL
&& os
->load_base
== NULL
)
4227 os
->lma_region
= os
->region
;
4229 if (os
->lma_region
!= NULL
&& os
->lma_region
!= os
->region
)
4231 /* Set load_base, which will be handled later. */
4232 os
->load_base
= exp_intop (os
->lma_region
->current
);
4233 os
->lma_region
->current
+=
4234 TO_ADDR (os
->bfd_section
->size
);
4236 os_region_check (os
, os
->lma_region
, NULL
,
4237 os
->bfd_section
->lma
);
4243 case lang_constructors_statement_enum
:
4244 dot
= lang_size_sections_1 (constructor_list
.head
,
4245 output_section_statement
,
4246 &s
->wild_statement
.children
.head
,
4247 fill
, dot
, relax
, check_regions
);
4250 case lang_data_statement_enum
:
4252 unsigned int size
= 0;
4254 s
->data_statement
.output_vma
=
4255 dot
- output_section_statement
->bfd_section
->vma
;
4256 s
->data_statement
.output_section
=
4257 output_section_statement
->bfd_section
;
4259 /* We might refer to provided symbols in the expression, and
4260 need to mark them as needed. */
4261 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4263 switch (s
->data_statement
.type
)
4281 if (size
< TO_SIZE ((unsigned) 1))
4282 size
= TO_SIZE ((unsigned) 1);
4283 dot
+= TO_ADDR (size
);
4284 output_section_statement
->bfd_section
->size
+= size
;
4288 case lang_reloc_statement_enum
:
4292 s
->reloc_statement
.output_vma
=
4293 dot
- output_section_statement
->bfd_section
->vma
;
4294 s
->reloc_statement
.output_section
=
4295 output_section_statement
->bfd_section
;
4296 size
= bfd_get_reloc_size (s
->reloc_statement
.howto
);
4297 dot
+= TO_ADDR (size
);
4298 output_section_statement
->bfd_section
->size
+= size
;
4302 case lang_wild_statement_enum
:
4303 dot
= lang_size_sections_1 (s
->wild_statement
.children
.head
,
4304 output_section_statement
,
4305 &s
->wild_statement
.children
.head
,
4306 fill
, dot
, relax
, check_regions
);
4309 case lang_object_symbols_statement_enum
:
4310 link_info
.create_object_symbols_section
=
4311 output_section_statement
->bfd_section
;
4314 case lang_output_statement_enum
:
4315 case lang_target_statement_enum
:
4318 case lang_input_section_enum
:
4322 i
= (*prev
)->input_section
.section
;
4327 if (! bfd_relax_section (i
->owner
, i
, &link_info
, &again
))
4328 einfo (_("%P%F: can't relax section: %E\n"));
4332 dot
= size_input_section (prev
, output_section_statement
,
4333 output_section_statement
->fill
, dot
);
4337 case lang_input_statement_enum
:
4340 case lang_fill_statement_enum
:
4341 s
->fill_statement
.output_section
=
4342 output_section_statement
->bfd_section
;
4344 fill
= s
->fill_statement
.fill
;
4347 case lang_assignment_statement_enum
:
4349 bfd_vma newdot
= dot
;
4351 exp_fold_tree (s
->assignment_statement
.exp
,
4352 output_section_statement
->bfd_section
,
4355 if (newdot
!= dot
&& !output_section_statement
->ignored
)
4357 if (output_section_statement
== abs_output_section
)
4359 /* If we don't have an output section, then just adjust
4360 the default memory address. */
4361 lang_memory_region_lookup (DEFAULT_MEMORY_REGION
,
4362 FALSE
)->current
= newdot
;
4366 /* Insert a pad after this statement. We can't
4367 put the pad before when relaxing, in case the
4368 assignment references dot. */
4369 insert_pad (&s
->header
.next
, fill
, TO_SIZE (newdot
- dot
),
4370 output_section_statement
->bfd_section
, dot
);
4372 /* Don't neuter the pad below when relaxing. */
4375 /* If dot is advanced, this implies that the section
4376 should have space allocated to it, unless the
4377 user has explicitly stated that the section
4378 should never be loaded. */
4379 if (!(output_section_statement
->flags
4380 & (SEC_NEVER_LOAD
| SEC_ALLOC
)))
4381 output_section_statement
->bfd_section
->flags
|= SEC_ALLOC
;
4388 case lang_padding_statement_enum
:
4389 /* If this is the first time lang_size_sections is called,
4390 we won't have any padding statements. If this is the
4391 second or later passes when relaxing, we should allow
4392 padding to shrink. If padding is needed on this pass, it
4393 will be added back in. */
4394 s
->padding_statement
.size
= 0;
4396 /* Make sure output_offset is valid. If relaxation shrinks
4397 the section and this pad isn't needed, it's possible to
4398 have output_offset larger than the final size of the
4399 section. bfd_set_section_contents will complain even for
4400 a pad size of zero. */
4401 s
->padding_statement
.output_offset
4402 = dot
- output_section_statement
->bfd_section
->vma
;
4405 case lang_group_statement_enum
:
4406 dot
= lang_size_sections_1 (s
->group_statement
.children
.head
,
4407 output_section_statement
,
4408 &s
->group_statement
.children
.head
,
4409 fill
, dot
, relax
, check_regions
);
4416 /* We can only get here when relaxing is turned on. */
4417 case lang_address_statement_enum
:
4420 prev
= &s
->header
.next
;
4426 one_lang_size_sections_pass (bfd_boolean
*relax
, bfd_boolean check_regions
)
4428 lang_statement_iteration
++;
4429 lang_size_sections_1 (statement_list
.head
, abs_output_section
,
4430 &statement_list
.head
, 0, 0, relax
, check_regions
);
4434 lang_size_sections (bfd_boolean
*relax
, bfd_boolean check_regions
)
4436 expld
.phase
= lang_allocating_phase_enum
;
4437 expld
.dataseg
.phase
= exp_dataseg_none
;
4439 one_lang_size_sections_pass (relax
, check_regions
);
4440 if (expld
.dataseg
.phase
== exp_dataseg_end_seen
4441 && link_info
.relro
&& expld
.dataseg
.relro_end
)
4443 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
4444 to put expld.dataseg.relro on a (common) page boundary. */
4445 bfd_vma old_min_base
, relro_end
, maxpage
;
4447 expld
.dataseg
.phase
= exp_dataseg_relro_adjust
;
4448 old_min_base
= expld
.dataseg
.min_base
;
4449 maxpage
= expld
.dataseg
.maxpagesize
;
4450 expld
.dataseg
.base
+= (-expld
.dataseg
.relro_end
4451 & (expld
.dataseg
.pagesize
- 1));
4452 /* Compute the expected PT_GNU_RELRO segment end. */
4453 relro_end
= (expld
.dataseg
.relro_end
+ expld
.dataseg
.pagesize
- 1)
4454 & ~(expld
.dataseg
.pagesize
- 1);
4455 if (old_min_base
+ maxpage
< expld
.dataseg
.base
)
4457 expld
.dataseg
.base
-= maxpage
;
4458 relro_end
-= maxpage
;
4460 one_lang_size_sections_pass (relax
, check_regions
);
4461 if (expld
.dataseg
.relro_end
> relro_end
)
4463 /* The alignment of sections between DATA_SEGMENT_ALIGN
4464 and DATA_SEGMENT_RELRO_END caused huge padding to be
4465 inserted at DATA_SEGMENT_RELRO_END. Try some other base. */
4467 unsigned int max_alignment_power
= 0;
4469 /* Find maximum alignment power of sections between
4470 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
4471 for (sec
= output_bfd
->sections
; sec
; sec
= sec
->next
)
4472 if (sec
->vma
>= expld
.dataseg
.base
4473 && sec
->vma
< expld
.dataseg
.relro_end
4474 && sec
->alignment_power
> max_alignment_power
)
4475 max_alignment_power
= sec
->alignment_power
;
4477 if (((bfd_vma
) 1 << max_alignment_power
) < expld
.dataseg
.pagesize
)
4479 if (expld
.dataseg
.base
- (1 << max_alignment_power
)
4481 expld
.dataseg
.base
+= expld
.dataseg
.pagesize
;
4482 expld
.dataseg
.base
-= (1 << max_alignment_power
);
4483 one_lang_size_sections_pass (relax
, check_regions
);
4486 link_info
.relro_start
= expld
.dataseg
.base
;
4487 link_info
.relro_end
= expld
.dataseg
.relro_end
;
4489 else if (expld
.dataseg
.phase
== exp_dataseg_end_seen
)
4491 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
4492 a page could be saved in the data segment. */
4493 bfd_vma first
, last
;
4495 first
= -expld
.dataseg
.base
& (expld
.dataseg
.pagesize
- 1);
4496 last
= expld
.dataseg
.end
& (expld
.dataseg
.pagesize
- 1);
4498 && ((expld
.dataseg
.base
& ~(expld
.dataseg
.pagesize
- 1))
4499 != (expld
.dataseg
.end
& ~(expld
.dataseg
.pagesize
- 1)))
4500 && first
+ last
<= expld
.dataseg
.pagesize
)
4502 expld
.dataseg
.phase
= exp_dataseg_adjust
;
4503 one_lang_size_sections_pass (relax
, check_regions
);
4507 expld
.phase
= lang_final_phase_enum
;
4510 /* Worker function for lang_do_assignments. Recursiveness goes here. */
4513 lang_do_assignments_1
4514 (lang_statement_union_type
*s
,
4515 lang_output_section_statement_type
*output_section_statement
,
4519 for (; s
!= NULL
; s
= s
->header
.next
)
4521 switch (s
->header
.type
)
4523 case lang_constructors_statement_enum
:
4524 dot
= lang_do_assignments_1 (constructor_list
.head
,
4525 output_section_statement
,
4530 case lang_output_section_statement_enum
:
4532 lang_output_section_statement_type
*os
;
4534 os
= &(s
->output_section_statement
);
4535 if (os
->bfd_section
!= NULL
&& !os
->ignored
)
4537 dot
= os
->bfd_section
->vma
;
4538 lang_do_assignments_1 (os
->children
.head
, os
, os
->fill
, dot
);
4539 /* .tbss sections effectively have zero size. */
4540 if ((os
->bfd_section
->flags
& SEC_HAS_CONTENTS
) != 0
4541 || (os
->bfd_section
->flags
& SEC_THREAD_LOCAL
) == 0
4542 || link_info
.relocatable
)
4543 dot
+= TO_ADDR (os
->bfd_section
->size
);
4547 /* If nothing has been placed into the output section then
4548 it won't have a bfd_section. */
4549 if (os
->bfd_section
&& !os
->ignored
)
4551 os
->bfd_section
->lma
4552 = exp_get_abs_int (os
->load_base
, 0, "load base");
4558 case lang_wild_statement_enum
:
4560 dot
= lang_do_assignments_1 (s
->wild_statement
.children
.head
,
4561 output_section_statement
,
4565 case lang_object_symbols_statement_enum
:
4566 case lang_output_statement_enum
:
4567 case lang_target_statement_enum
:
4570 case lang_data_statement_enum
:
4571 exp_fold_tree (s
->data_statement
.exp
, bfd_abs_section_ptr
, &dot
);
4572 if (expld
.result
.valid_p
)
4573 s
->data_statement
.value
= (expld
.result
.value
4574 + expld
.result
.section
->vma
);
4576 einfo (_("%F%P: invalid data statement\n"));
4579 switch (s
->data_statement
.type
)
4597 if (size
< TO_SIZE ((unsigned) 1))
4598 size
= TO_SIZE ((unsigned) 1);
4599 dot
+= TO_ADDR (size
);
4603 case lang_reloc_statement_enum
:
4604 exp_fold_tree (s
->reloc_statement
.addend_exp
,
4605 bfd_abs_section_ptr
, &dot
);
4606 if (expld
.result
.valid_p
)
4607 s
->reloc_statement
.addend_value
= expld
.result
.value
;
4609 einfo (_("%F%P: invalid reloc statement\n"));
4610 dot
+= TO_ADDR (bfd_get_reloc_size (s
->reloc_statement
.howto
));
4613 case lang_input_section_enum
:
4615 asection
*in
= s
->input_section
.section
;
4617 if ((in
->flags
& SEC_EXCLUDE
) == 0)
4618 dot
+= TO_ADDR (in
->size
);
4622 case lang_input_statement_enum
:
4625 case lang_fill_statement_enum
:
4626 fill
= s
->fill_statement
.fill
;
4629 case lang_assignment_statement_enum
:
4630 exp_fold_tree (s
->assignment_statement
.exp
,
4631 output_section_statement
->bfd_section
,
4635 case lang_padding_statement_enum
:
4636 dot
+= TO_ADDR (s
->padding_statement
.size
);
4639 case lang_group_statement_enum
:
4640 dot
= lang_do_assignments_1 (s
->group_statement
.children
.head
,
4641 output_section_statement
,
4649 case lang_address_statement_enum
:
4657 lang_do_assignments (void)
4659 lang_statement_iteration
++;
4660 lang_do_assignments_1 (statement_list
.head
, abs_output_section
, NULL
, 0);
4663 /* Fix any .startof. or .sizeof. symbols. When the assemblers see the
4664 operator .startof. (section_name), it produces an undefined symbol
4665 .startof.section_name. Similarly, when it sees
4666 .sizeof. (section_name), it produces an undefined symbol
4667 .sizeof.section_name. For all the output sections, we look for
4668 such symbols, and set them to the correct value. */
4671 lang_set_startof (void)
4675 if (link_info
.relocatable
)
4678 for (s
= output_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4680 const char *secname
;
4682 struct bfd_link_hash_entry
*h
;
4684 secname
= bfd_get_section_name (output_bfd
, s
);
4685 buf
= xmalloc (10 + strlen (secname
));
4687 sprintf (buf
, ".startof.%s", secname
);
4688 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4689 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4691 h
->type
= bfd_link_hash_defined
;
4692 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, s
);
4693 h
->u
.def
.section
= bfd_abs_section_ptr
;
4696 sprintf (buf
, ".sizeof.%s", secname
);
4697 h
= bfd_link_hash_lookup (link_info
.hash
, buf
, FALSE
, FALSE
, TRUE
);
4698 if (h
!= NULL
&& h
->type
== bfd_link_hash_undefined
)
4700 h
->type
= bfd_link_hash_defined
;
4701 h
->u
.def
.value
= TO_ADDR (s
->size
);
4702 h
->u
.def
.section
= bfd_abs_section_ptr
;
4712 struct bfd_link_hash_entry
*h
;
4715 if (link_info
.relocatable
|| link_info
.shared
)
4720 if (entry_symbol
.name
== NULL
)
4722 /* No entry has been specified. Look for the default entry, but
4723 don't warn if we don't find it. */
4724 entry_symbol
.name
= entry_symbol_default
;
4728 h
= bfd_link_hash_lookup (link_info
.hash
, entry_symbol
.name
,
4729 FALSE
, FALSE
, TRUE
);
4731 && (h
->type
== bfd_link_hash_defined
4732 || h
->type
== bfd_link_hash_defweak
)
4733 && h
->u
.def
.section
->output_section
!= NULL
)
4737 val
= (h
->u
.def
.value
4738 + bfd_get_section_vma (output_bfd
,
4739 h
->u
.def
.section
->output_section
)
4740 + h
->u
.def
.section
->output_offset
);
4741 if (! bfd_set_start_address (output_bfd
, val
))
4742 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol
.name
);
4749 /* We couldn't find the entry symbol. Try parsing it as a
4751 val
= bfd_scan_vma (entry_symbol
.name
, &send
, 0);
4754 if (! bfd_set_start_address (output_bfd
, val
))
4755 einfo (_("%P%F: can't set start address\n"));
4761 /* Can't find the entry symbol, and it's not a number. Use
4762 the first address in the text section. */
4763 ts
= bfd_get_section_by_name (output_bfd
, entry_section
);
4767 einfo (_("%P: warning: cannot find entry symbol %s;"
4768 " defaulting to %V\n"),
4770 bfd_get_section_vma (output_bfd
, ts
));
4771 if (! bfd_set_start_address (output_bfd
,
4772 bfd_get_section_vma (output_bfd
,
4774 einfo (_("%P%F: can't set start address\n"));
4779 einfo (_("%P: warning: cannot find entry symbol %s;"
4780 " not setting start address\n"),
4786 /* Don't bfd_hash_table_free (&lang_definedness_table);
4787 map file output may result in a call of lang_track_definedness. */
4790 /* This is a small function used when we want to ignore errors from
4794 ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED
, ...)
4796 /* Don't do anything. */
4799 /* Check that the architecture of all the input files is compatible
4800 with the output file. Also call the backend to let it do any
4801 other checking that is needed. */
4806 lang_statement_union_type
*file
;
4808 const bfd_arch_info_type
*compatible
;
4810 for (file
= file_chain
.head
; file
!= NULL
; file
= file
->input_statement
.next
)
4812 input_bfd
= file
->input_statement
.the_bfd
;
4814 = bfd_arch_get_compatible (input_bfd
, output_bfd
,
4815 command_line
.accept_unknown_input_arch
);
4817 /* In general it is not possible to perform a relocatable
4818 link between differing object formats when the input
4819 file has relocations, because the relocations in the
4820 input format may not have equivalent representations in
4821 the output format (and besides BFD does not translate
4822 relocs for other link purposes than a final link). */
4823 if ((link_info
.relocatable
|| link_info
.emitrelocations
)
4824 && (compatible
== NULL
4825 || bfd_get_flavour (input_bfd
) != bfd_get_flavour (output_bfd
))
4826 && (bfd_get_file_flags (input_bfd
) & HAS_RELOC
) != 0)
4828 einfo (_("%P%F: Relocatable linking with relocations from"
4829 " format %s (%B) to format %s (%B) is not supported\n"),
4830 bfd_get_target (input_bfd
), input_bfd
,
4831 bfd_get_target (output_bfd
), output_bfd
);
4832 /* einfo with %F exits. */
4835 if (compatible
== NULL
)
4837 if (command_line
.warn_mismatch
)
4838 einfo (_("%P: warning: %s architecture of input file `%B'"
4839 " is incompatible with %s output\n"),
4840 bfd_printable_name (input_bfd
), input_bfd
,
4841 bfd_printable_name (output_bfd
));
4843 else if (bfd_count_sections (input_bfd
))
4845 /* If the input bfd has no contents, it shouldn't set the
4846 private data of the output bfd. */
4848 bfd_error_handler_type pfn
= NULL
;
4850 /* If we aren't supposed to warn about mismatched input
4851 files, temporarily set the BFD error handler to a
4852 function which will do nothing. We still want to call
4853 bfd_merge_private_bfd_data, since it may set up
4854 information which is needed in the output file. */
4855 if (! command_line
.warn_mismatch
)
4856 pfn
= bfd_set_error_handler (ignore_bfd_errors
);
4857 if (! bfd_merge_private_bfd_data (input_bfd
, output_bfd
))
4859 if (command_line
.warn_mismatch
)
4860 einfo (_("%P%X: failed to merge target specific data"
4861 " of file %B\n"), input_bfd
);
4863 if (! command_line
.warn_mismatch
)
4864 bfd_set_error_handler (pfn
);
4869 /* Look through all the global common symbols and attach them to the
4870 correct section. The -sort-common command line switch may be used
4871 to roughly sort the entries by size. */
4876 if (command_line
.inhibit_common_definition
)
4878 if (link_info
.relocatable
4879 && ! command_line
.force_common_definition
)
4882 if (! config
.sort_common
)
4883 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, NULL
);
4888 for (power
= 4; power
>= 0; power
--)
4889 bfd_link_hash_traverse (link_info
.hash
, lang_one_common
, &power
);
4893 /* Place one common symbol in the correct section. */
4896 lang_one_common (struct bfd_link_hash_entry
*h
, void *info
)
4898 unsigned int power_of_two
;
4902 if (h
->type
!= bfd_link_hash_common
)
4906 power_of_two
= h
->u
.c
.p
->alignment_power
;
4908 if (config
.sort_common
4909 && power_of_two
< (unsigned int) *(int *) info
)
4912 section
= h
->u
.c
.p
->section
;
4914 /* Increase the size of the section to align the common sym. */
4915 section
->size
+= ((bfd_vma
) 1 << (power_of_two
+ opb_shift
)) - 1;
4916 section
->size
&= (- (bfd_vma
) 1 << (power_of_two
+ opb_shift
));
4918 /* Adjust the alignment if necessary. */
4919 if (power_of_two
> section
->alignment_power
)
4920 section
->alignment_power
= power_of_two
;
4922 /* Change the symbol from common to defined. */
4923 h
->type
= bfd_link_hash_defined
;
4924 h
->u
.def
.section
= section
;
4925 h
->u
.def
.value
= section
->size
;
4927 /* Increase the size of the section. */
4928 section
->size
+= size
;
4930 /* Make sure the section is allocated in memory, and make sure that
4931 it is no longer a common section. */
4932 section
->flags
|= SEC_ALLOC
;
4933 section
->flags
&= ~SEC_IS_COMMON
;
4935 if (config
.map_file
!= NULL
)
4937 static bfd_boolean header_printed
;
4942 if (! header_printed
)
4944 minfo (_("\nAllocating common symbols\n"));
4945 minfo (_("Common symbol size file\n\n"));
4946 header_printed
= TRUE
;
4949 name
= demangle (h
->root
.string
);
4951 len
= strlen (name
);
4966 if (size
<= 0xffffffff)
4967 sprintf (buf
, "%lx", (unsigned long) size
);
4969 sprintf_vma (buf
, size
);
4979 minfo ("%B\n", section
->owner
);
4985 /* Run through the input files and ensure that every input section has
4986 somewhere to go. If one is found without a destination then create
4987 an input request and place it into the statement tree. */
4990 lang_place_orphans (void)
4992 LANG_FOR_EACH_INPUT_STATEMENT (file
)
4996 for (s
= file
->the_bfd
->sections
; s
!= NULL
; s
= s
->next
)
4998 if (s
->output_section
== NULL
)
5000 /* This section of the file is not attached, root
5001 around for a sensible place for it to go. */
5003 if (file
->just_syms_flag
)
5004 bfd_link_just_syms (file
->the_bfd
, s
, &link_info
);
5005 else if ((s
->flags
& SEC_EXCLUDE
) != 0)
5006 s
->output_section
= bfd_abs_section_ptr
;
5007 else if (strcmp (s
->name
, "COMMON") == 0)
5009 /* This is a lonely common section which must have
5010 come from an archive. We attach to the section
5011 with the wildcard. */
5012 if (! link_info
.relocatable
5013 || command_line
.force_common_definition
)
5015 if (default_common_section
== NULL
)
5017 default_common_section
=
5018 lang_output_section_statement_lookup (".bss");
5021 lang_add_section (&default_common_section
->children
, s
,
5022 default_common_section
, file
);
5025 else if (ldemul_place_orphan (file
, s
))
5029 lang_output_section_statement_type
*os
;
5031 os
= lang_output_section_statement_lookup (s
->name
);
5032 lang_add_section (&os
->children
, s
, os
, file
);
5040 lang_set_flags (lang_memory_region_type
*ptr
, const char *flags
, int invert
)
5042 flagword
*ptr_flags
;
5044 ptr_flags
= invert
? &ptr
->not_flags
: &ptr
->flags
;
5050 *ptr_flags
|= SEC_ALLOC
;
5054 *ptr_flags
|= SEC_READONLY
;
5058 *ptr_flags
|= SEC_DATA
;
5062 *ptr_flags
|= SEC_CODE
;
5067 *ptr_flags
|= SEC_LOAD
;
5071 einfo (_("%P%F: invalid syntax in flags\n"));
5078 /* Call a function on each input file. This function will be called
5079 on an archive, but not on the elements. */
5082 lang_for_each_input_file (void (*func
) (lang_input_statement_type
*))
5084 lang_input_statement_type
*f
;
5086 for (f
= (lang_input_statement_type
*) input_file_chain
.head
;
5088 f
= (lang_input_statement_type
*) f
->next_real_file
)
5092 /* Call a function on each file. The function will be called on all
5093 the elements of an archive which are included in the link, but will
5094 not be called on the archive file itself. */
5097 lang_for_each_file (void (*func
) (lang_input_statement_type
*))
5099 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5106 ldlang_add_file (lang_input_statement_type
*entry
)
5110 lang_statement_append (&file_chain
,
5111 (lang_statement_union_type
*) entry
,
5114 /* The BFD linker needs to have a list of all input BFDs involved in
5116 ASSERT (entry
->the_bfd
->link_next
== NULL
);
5117 ASSERT (entry
->the_bfd
!= output_bfd
);
5118 for (pp
= &link_info
.input_bfds
; *pp
!= NULL
; pp
= &(*pp
)->link_next
)
5120 *pp
= entry
->the_bfd
;
5121 entry
->the_bfd
->usrdata
= entry
;
5122 bfd_set_gp_size (entry
->the_bfd
, g_switch_value
);
5124 /* Look through the sections and check for any which should not be
5125 included in the link. We need to do this now, so that we can
5126 notice when the backend linker tries to report multiple
5127 definition errors for symbols which are in sections we aren't
5128 going to link. FIXME: It might be better to entirely ignore
5129 symbols which are defined in sections which are going to be
5130 discarded. This would require modifying the backend linker for
5131 each backend which might set the SEC_LINK_ONCE flag. If we do
5132 this, we should probably handle SEC_EXCLUDE in the same way. */
5134 bfd_map_over_sections (entry
->the_bfd
, section_already_linked
, entry
);
5138 lang_add_output (const char *name
, int from_script
)
5140 /* Make -o on command line override OUTPUT in script. */
5141 if (!had_output_filename
|| !from_script
)
5143 output_filename
= name
;
5144 had_output_filename
= TRUE
;
5148 static lang_output_section_statement_type
*current_section
;
5159 for (l
= 0; l
< 32; l
++)
5161 if (i
>= (unsigned int) x
)
5169 lang_output_section_statement_type
*
5170 lang_enter_output_section_statement (const char *output_section_statement_name
,
5171 etree_type
*address_exp
,
5172 enum section_type sectype
,
5174 etree_type
*subalign
,
5178 lang_output_section_statement_type
*os
;
5182 lang_output_section_statement_lookup_1 (output_section_statement_name
,
5185 /* Make next things chain into subchain of this. */
5187 if (os
->addr_tree
== NULL
)
5189 os
->addr_tree
= address_exp
;
5191 os
->sectype
= sectype
;
5192 if (sectype
!= noload_section
)
5193 os
->flags
= SEC_NO_FLAGS
;
5195 os
->flags
= SEC_NEVER_LOAD
;
5196 os
->block_value
= 1;
5197 stat_ptr
= &os
->children
;
5199 os
->subsection_alignment
=
5200 topower (exp_get_value_int (subalign
, -1, "subsection alignment"));
5201 os
->section_alignment
=
5202 topower (exp_get_value_int (align
, -1, "section alignment"));
5204 os
->load_base
= ebase
;
5211 lang_output_statement_type
*new =
5212 new_stat (lang_output_statement
, stat_ptr
);
5214 new->name
= output_filename
;
5217 /* Reset the current counters in the regions. */
5220 lang_reset_memory_regions (void)
5222 lang_memory_region_type
*p
= lang_memory_region_list
;
5224 lang_output_section_statement_type
*os
;
5226 for (p
= lang_memory_region_list
; p
!= NULL
; p
= p
->next
)
5228 p
->old_length
= (bfd_size_type
) (p
->current
- p
->origin
);
5229 p
->current
= p
->origin
;
5232 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5235 os
->processed
= FALSE
;
5237 for (o
= output_bfd
->sections
; o
!= NULL
; o
= o
->next
)
5239 /* Save the last size for possible use by bfd_relax_section. */
5240 o
->rawsize
= o
->size
;
5245 /* Worker for lang_gc_sections_1. */
5248 gc_section_callback (lang_wild_statement_type
*ptr
,
5249 struct wildcard_list
*sec ATTRIBUTE_UNUSED
,
5251 lang_input_statement_type
*file ATTRIBUTE_UNUSED
,
5252 void *data ATTRIBUTE_UNUSED
)
5254 /* If the wild pattern was marked KEEP, the member sections
5255 should be as well. */
5256 if (ptr
->keep_sections
)
5257 section
->flags
|= SEC_KEEP
;
5260 /* Iterate over sections marking them against GC. */
5263 lang_gc_sections_1 (lang_statement_union_type
*s
)
5265 for (; s
!= NULL
; s
= s
->header
.next
)
5267 switch (s
->header
.type
)
5269 case lang_wild_statement_enum
:
5270 walk_wild (&s
->wild_statement
, gc_section_callback
, NULL
);
5272 case lang_constructors_statement_enum
:
5273 lang_gc_sections_1 (constructor_list
.head
);
5275 case lang_output_section_statement_enum
:
5276 lang_gc_sections_1 (s
->output_section_statement
.children
.head
);
5278 case lang_group_statement_enum
:
5279 lang_gc_sections_1 (s
->group_statement
.children
.head
);
5288 lang_gc_sections (void)
5290 struct bfd_link_hash_entry
*h
;
5291 ldlang_undef_chain_list_type
*ulist
;
5293 /* Keep all sections so marked in the link script. */
5295 lang_gc_sections_1 (statement_list
.head
);
5297 /* Keep all sections containing symbols undefined on the command-line,
5298 and the section containing the entry symbol. */
5300 for (ulist
= link_info
.gc_sym_list
; ulist
; ulist
= ulist
->next
)
5302 h
= bfd_link_hash_lookup (link_info
.hash
, ulist
->name
,
5303 FALSE
, FALSE
, FALSE
);
5306 && (h
->type
== bfd_link_hash_defined
5307 || h
->type
== bfd_link_hash_defweak
)
5308 && ! bfd_is_abs_section (h
->u
.def
.section
))
5310 h
->u
.def
.section
->flags
|= SEC_KEEP
;
5314 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
5315 the special case of debug info. (See bfd/stabs.c)
5316 Twiddle the flag here, to simplify later linker code. */
5317 if (link_info
.relocatable
)
5319 LANG_FOR_EACH_INPUT_STATEMENT (f
)
5322 for (sec
= f
->the_bfd
->sections
; sec
!= NULL
; sec
= sec
->next
)
5323 if ((sec
->flags
& SEC_DEBUGGING
) == 0)
5324 sec
->flags
&= ~SEC_EXCLUDE
;
5328 if (link_info
.gc_sections
)
5329 bfd_gc_sections (output_bfd
, &link_info
);
5335 current_target
= default_target
;
5337 /* Open the output file. */
5338 lang_for_each_statement (ldlang_open_output
);
5341 ldemul_create_output_section_statements ();
5343 /* Add to the hash table all undefineds on the command line. */
5344 lang_place_undefineds ();
5346 if (!bfd_section_already_linked_table_init ())
5347 einfo (_("%P%F: Failed to create hash table\n"));
5349 /* Create a bfd for each input file. */
5350 current_target
= default_target
;
5351 open_input_bfds (statement_list
.head
, FALSE
);
5353 link_info
.gc_sym_list
= &entry_symbol
;
5354 if (entry_symbol
.name
== NULL
)
5355 link_info
.gc_sym_list
= ldlang_undef_chain_list_head
;
5357 ldemul_after_open ();
5359 bfd_section_already_linked_table_free ();
5361 /* Make sure that we're not mixing architectures. We call this
5362 after all the input files have been opened, but before we do any
5363 other processing, so that any operations merge_private_bfd_data
5364 does on the output file will be known during the rest of the
5368 /* Handle .exports instead of a version script if we're told to do so. */
5369 if (command_line
.version_exports_section
)
5370 lang_do_version_exports_section ();
5372 /* Build all sets based on the information gathered from the input
5374 ldctor_build_sets ();
5376 /* Remove unreferenced sections if asked to. */
5377 lang_gc_sections ();
5379 /* Size up the common data. */
5382 /* Update wild statements. */
5383 update_wild_statements (statement_list
.head
);
5385 /* Run through the contours of the script and attach input sections
5386 to the correct output sections. */
5387 map_input_to_output_sections (statement_list
.head
, NULL
, NULL
);
5389 /* Find any sections not attached explicitly and handle them. */
5390 lang_place_orphans ();
5392 if (! link_info
.relocatable
)
5396 /* Merge SEC_MERGE sections. This has to be done after GC of
5397 sections, so that GCed sections are not merged, but before
5398 assigning dynamic symbols, since removing whole input sections
5400 bfd_merge_sections (output_bfd
, &link_info
);
5402 /* Look for a text section and set the readonly attribute in it. */
5403 found
= bfd_get_section_by_name (output_bfd
, ".text");
5407 if (config
.text_read_only
)
5408 found
->flags
|= SEC_READONLY
;
5410 found
->flags
&= ~SEC_READONLY
;
5414 /* Do anything special before sizing sections. This is where ELF
5415 and other back-ends size dynamic sections. */
5416 ldemul_before_allocation ();
5418 /* We must record the program headers before we try to fix the
5419 section positions, since they will affect SIZEOF_HEADERS. */
5420 lang_record_phdrs ();
5422 /* Size up the sections. */
5423 lang_size_sections (NULL
, !command_line
.relax
);
5425 /* Now run around and relax if we can. */
5426 if (command_line
.relax
)
5428 /* Keep relaxing until bfd_relax_section gives up. */
5429 bfd_boolean relax_again
;
5433 relax_again
= FALSE
;
5435 /* Note: pe-dll.c does something like this also. If you find
5436 you need to change this code, you probably need to change
5437 pe-dll.c also. DJ */
5439 /* Do all the assignments with our current guesses as to
5441 lang_do_assignments ();
5443 /* We must do this after lang_do_assignments, because it uses
5445 lang_reset_memory_regions ();
5447 /* Perform another relax pass - this time we know where the
5448 globals are, so can make a better guess. */
5449 lang_size_sections (&relax_again
, FALSE
);
5451 /* If the normal relax is done and the relax finalize pass
5452 is not performed yet, we perform another relax pass. */
5453 if (!relax_again
&& link_info
.need_relax_finalize
)
5455 link_info
.need_relax_finalize
= FALSE
;
5459 while (relax_again
);
5461 /* Final extra sizing to report errors. */
5462 lang_do_assignments ();
5463 lang_reset_memory_regions ();
5464 lang_size_sections (NULL
, TRUE
);
5467 /* See if anything special should be done now we know how big
5469 ldemul_after_allocation ();
5471 /* Fix any .startof. or .sizeof. symbols. */
5472 lang_set_startof ();
5474 /* Do all the assignments, now that we know the final resting places
5475 of all the symbols. */
5477 lang_do_assignments ();
5479 /* Make sure that the section addresses make sense. */
5480 if (! link_info
.relocatable
5481 && command_line
.check_section_addresses
)
5482 lang_check_section_addresses ();
5489 /* EXPORTED TO YACC */
5492 lang_add_wild (struct wildcard_spec
*filespec
,
5493 struct wildcard_list
*section_list
,
5494 bfd_boolean keep_sections
)
5496 struct wildcard_list
*curr
, *next
;
5497 lang_wild_statement_type
*new;
5499 /* Reverse the list as the parser puts it back to front. */
5500 for (curr
= section_list
, section_list
= NULL
;
5502 section_list
= curr
, curr
= next
)
5504 if (curr
->spec
.name
!= NULL
&& strcmp (curr
->spec
.name
, "COMMON") == 0)
5505 placed_commons
= TRUE
;
5508 curr
->next
= section_list
;
5511 if (filespec
!= NULL
&& filespec
->name
!= NULL
)
5513 if (strcmp (filespec
->name
, "*") == 0)
5514 filespec
->name
= NULL
;
5515 else if (! wildcardp (filespec
->name
))
5516 lang_has_input_file
= TRUE
;
5519 new = new_stat (lang_wild_statement
, stat_ptr
);
5520 new->filename
= NULL
;
5521 new->filenames_sorted
= FALSE
;
5522 if (filespec
!= NULL
)
5524 new->filename
= filespec
->name
;
5525 new->filenames_sorted
= filespec
->sorted
== by_name
;
5527 new->section_list
= section_list
;
5528 new->keep_sections
= keep_sections
;
5529 lang_list_init (&new->children
);
5530 analyze_walk_wild_section_handler (new);
5534 lang_section_start (const char *name
, etree_type
*address
,
5535 const segment_type
*segment
)
5537 lang_address_statement_type
*ad
;
5539 ad
= new_stat (lang_address_statement
, stat_ptr
);
5540 ad
->section_name
= name
;
5541 ad
->address
= address
;
5542 ad
->segment
= segment
;
5545 /* Set the start symbol to NAME. CMDLINE is nonzero if this is called
5546 because of a -e argument on the command line, or zero if this is
5547 called by ENTRY in a linker script. Command line arguments take
5551 lang_add_entry (const char *name
, bfd_boolean cmdline
)
5553 if (entry_symbol
.name
== NULL
5555 || ! entry_from_cmdline
)
5557 entry_symbol
.name
= name
;
5558 entry_from_cmdline
= cmdline
;
5562 /* Set the default start symbol to NAME. .em files should use this,
5563 not lang_add_entry, to override the use of "start" if neither the
5564 linker script nor the command line specifies an entry point. NAME
5565 must be permanently allocated. */
5567 lang_default_entry (const char *name
)
5569 entry_symbol_default
= name
;
5573 lang_add_target (const char *name
)
5575 lang_target_statement_type
*new = new_stat (lang_target_statement
,
5583 lang_add_map (const char *name
)
5590 map_option_f
= TRUE
;
5598 lang_add_fill (fill_type
*fill
)
5600 lang_fill_statement_type
*new = new_stat (lang_fill_statement
,
5607 lang_add_data (int type
, union etree_union
*exp
)
5610 lang_data_statement_type
*new = new_stat (lang_data_statement
,
5618 /* Create a new reloc statement. RELOC is the BFD relocation type to
5619 generate. HOWTO is the corresponding howto structure (we could
5620 look this up, but the caller has already done so). SECTION is the
5621 section to generate a reloc against, or NAME is the name of the
5622 symbol to generate a reloc against. Exactly one of SECTION and
5623 NAME must be NULL. ADDEND is an expression for the addend. */
5626 lang_add_reloc (bfd_reloc_code_real_type reloc
,
5627 reloc_howto_type
*howto
,
5630 union etree_union
*addend
)
5632 lang_reloc_statement_type
*p
= new_stat (lang_reloc_statement
, stat_ptr
);
5636 p
->section
= section
;
5638 p
->addend_exp
= addend
;
5640 p
->addend_value
= 0;
5641 p
->output_section
= NULL
;
5645 lang_assignment_statement_type
*
5646 lang_add_assignment (etree_type
*exp
)
5648 lang_assignment_statement_type
*new = new_stat (lang_assignment_statement
,
5656 lang_add_attribute (enum statement_enum attribute
)
5658 new_statement (attribute
, sizeof (lang_statement_union_type
), stat_ptr
);
5662 lang_startup (const char *name
)
5664 if (startup_file
!= NULL
)
5666 einfo (_("%P%Fmultiple STARTUP files\n"));
5668 first_file
->filename
= name
;
5669 first_file
->local_sym_name
= name
;
5670 first_file
->real
= TRUE
;
5672 startup_file
= name
;
5676 lang_float (bfd_boolean maybe
)
5678 lang_float_flag
= maybe
;
5682 /* Work out the load- and run-time regions from a script statement, and
5683 store them in *LMA_REGION and *REGION respectively.
5685 MEMSPEC is the name of the run-time region, or the value of
5686 DEFAULT_MEMORY_REGION if the statement didn't specify one.
5687 LMA_MEMSPEC is the name of the load-time region, or null if the
5688 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
5689 had an explicit load address.
5691 It is an error to specify both a load region and a load address. */
5694 lang_get_regions (lang_memory_region_type
**region
,
5695 lang_memory_region_type
**lma_region
,
5696 const char *memspec
,
5697 const char *lma_memspec
,
5698 bfd_boolean have_lma
,
5699 bfd_boolean have_vma
)
5701 *lma_region
= lang_memory_region_lookup (lma_memspec
, FALSE
);
5703 /* If no runtime region or VMA has been specified, but the load region
5704 has been specified, then use the load region for the runtime region
5706 if (lma_memspec
!= NULL
5708 && strcmp (memspec
, DEFAULT_MEMORY_REGION
) == 0)
5709 *region
= *lma_region
;
5711 *region
= lang_memory_region_lookup (memspec
, FALSE
);
5713 if (have_lma
&& lma_memspec
!= 0)
5714 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
5718 lang_leave_output_section_statement (fill_type
*fill
, const char *memspec
,
5719 lang_output_section_phdr_list
*phdrs
,
5720 const char *lma_memspec
)
5722 lang_get_regions (¤t_section
->region
,
5723 ¤t_section
->lma_region
,
5724 memspec
, lma_memspec
,
5725 current_section
->load_base
!= NULL
,
5726 current_section
->addr_tree
!= NULL
);
5727 current_section
->fill
= fill
;
5728 current_section
->phdrs
= phdrs
;
5729 stat_ptr
= &statement_list
;
5732 /* Create an absolute symbol with the given name with the value of the
5733 address of first byte of the section named.
5735 If the symbol already exists, then do nothing. */
5738 lang_abs_symbol_at_beginning_of (const char *secname
, const char *name
)
5740 struct bfd_link_hash_entry
*h
;
5742 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5744 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5746 if (h
->type
== bfd_link_hash_new
5747 || h
->type
== bfd_link_hash_undefined
)
5751 h
->type
= bfd_link_hash_defined
;
5753 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5757 h
->u
.def
.value
= bfd_get_section_vma (output_bfd
, sec
);
5759 h
->u
.def
.section
= bfd_abs_section_ptr
;
5763 /* Create an absolute symbol with the given name with the value of the
5764 address of the first byte after the end of the section named.
5766 If the symbol already exists, then do nothing. */
5769 lang_abs_symbol_at_end_of (const char *secname
, const char *name
)
5771 struct bfd_link_hash_entry
*h
;
5773 h
= bfd_link_hash_lookup (link_info
.hash
, name
, TRUE
, TRUE
, TRUE
);
5775 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
5777 if (h
->type
== bfd_link_hash_new
5778 || h
->type
== bfd_link_hash_undefined
)
5782 h
->type
= bfd_link_hash_defined
;
5784 sec
= bfd_get_section_by_name (output_bfd
, secname
);
5788 h
->u
.def
.value
= (bfd_get_section_vma (output_bfd
, sec
)
5789 + TO_ADDR (sec
->size
));
5791 h
->u
.def
.section
= bfd_abs_section_ptr
;
5796 lang_statement_append (lang_statement_list_type
*list
,
5797 lang_statement_union_type
*element
,
5798 lang_statement_union_type
**field
)
5800 *(list
->tail
) = element
;
5804 /* Set the output format type. -oformat overrides scripts. */
5807 lang_add_output_format (const char *format
,
5812 if (output_target
== NULL
|| !from_script
)
5814 if (command_line
.endian
== ENDIAN_BIG
5817 else if (command_line
.endian
== ENDIAN_LITTLE
5821 output_target
= format
;
5825 /* Enter a group. This creates a new lang_group_statement, and sets
5826 stat_ptr to build new statements within the group. */
5829 lang_enter_group (void)
5831 lang_group_statement_type
*g
;
5833 g
= new_stat (lang_group_statement
, stat_ptr
);
5834 lang_list_init (&g
->children
);
5835 stat_ptr
= &g
->children
;
5838 /* Leave a group. This just resets stat_ptr to start writing to the
5839 regular list of statements again. Note that this will not work if
5840 groups can occur inside anything else which can adjust stat_ptr,
5841 but currently they can't. */
5844 lang_leave_group (void)
5846 stat_ptr
= &statement_list
;
5849 /* Add a new program header. This is called for each entry in a PHDRS
5850 command in a linker script. */
5853 lang_new_phdr (const char *name
,
5855 bfd_boolean filehdr
,
5860 struct lang_phdr
*n
, **pp
;
5862 n
= stat_alloc (sizeof (struct lang_phdr
));
5865 n
->type
= exp_get_value_int (type
, 0, "program header type");
5866 n
->filehdr
= filehdr
;
5871 for (pp
= &lang_phdr_list
; *pp
!= NULL
; pp
= &(*pp
)->next
)
5876 /* Record the program header information in the output BFD. FIXME: We
5877 should not be calling an ELF specific function here. */
5880 lang_record_phdrs (void)
5884 lang_output_section_phdr_list
*last
;
5885 struct lang_phdr
*l
;
5886 lang_output_section_statement_type
*os
;
5889 secs
= xmalloc (alc
* sizeof (asection
*));
5891 for (l
= lang_phdr_list
; l
!= NULL
; l
= l
->next
)
5898 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5902 lang_output_section_phdr_list
*pl
;
5904 if (os
->constraint
== -1)
5912 if (os
->sectype
== noload_section
5913 || os
->bfd_section
== NULL
5914 || (os
->bfd_section
->flags
& SEC_ALLOC
) == 0)
5919 if (os
->bfd_section
== NULL
)
5922 for (; pl
!= NULL
; pl
= pl
->next
)
5924 if (strcmp (pl
->name
, l
->name
) == 0)
5929 secs
= xrealloc (secs
, alc
* sizeof (asection
*));
5931 secs
[c
] = os
->bfd_section
;
5938 if (l
->flags
== NULL
)
5941 flags
= exp_get_vma (l
->flags
, 0, "phdr flags");
5946 at
= exp_get_vma (l
->at
, 0, "phdr load address");
5948 if (! bfd_record_phdr (output_bfd
, l
->type
,
5949 l
->flags
!= NULL
, flags
, l
->at
!= NULL
,
5950 at
, l
->filehdr
, l
->phdrs
, c
, secs
))
5951 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
5956 /* Make sure all the phdr assignments succeeded. */
5957 for (os
= &lang_output_section_statement
.head
->output_section_statement
;
5961 lang_output_section_phdr_list
*pl
;
5963 if (os
->constraint
== -1
5964 || os
->bfd_section
== NULL
)
5967 for (pl
= os
->phdrs
;
5970 if (! pl
->used
&& strcmp (pl
->name
, "NONE") != 0)
5971 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
5972 os
->name
, pl
->name
);
5976 /* Record a list of sections which may not be cross referenced. */
5979 lang_add_nocrossref (lang_nocrossref_type
*l
)
5981 struct lang_nocrossrefs
*n
;
5983 n
= xmalloc (sizeof *n
);
5984 n
->next
= nocrossref_list
;
5986 nocrossref_list
= n
;
5988 /* Set notice_all so that we get informed about all symbols. */
5989 link_info
.notice_all
= TRUE
;
5992 /* Overlay handling. We handle overlays with some static variables. */
5994 /* The overlay virtual address. */
5995 static etree_type
*overlay_vma
;
5996 /* And subsection alignment. */
5997 static etree_type
*overlay_subalign
;
5999 /* An expression for the maximum section size seen so far. */
6000 static etree_type
*overlay_max
;
6002 /* A list of all the sections in this overlay. */
6004 struct overlay_list
{
6005 struct overlay_list
*next
;
6006 lang_output_section_statement_type
*os
;
6009 static struct overlay_list
*overlay_list
;
6011 /* Start handling an overlay. */
6014 lang_enter_overlay (etree_type
*vma_expr
, etree_type
*subalign
)
6016 /* The grammar should prevent nested overlays from occurring. */
6017 ASSERT (overlay_vma
== NULL
6018 && overlay_subalign
== NULL
6019 && overlay_max
== NULL
);
6021 overlay_vma
= vma_expr
;
6022 overlay_subalign
= subalign
;
6025 /* Start a section in an overlay. We handle this by calling
6026 lang_enter_output_section_statement with the correct VMA.
6027 lang_leave_overlay sets up the LMA and memory regions. */
6030 lang_enter_overlay_section (const char *name
)
6032 struct overlay_list
*n
;
6035 lang_enter_output_section_statement (name
, overlay_vma
, normal_section
,
6036 0, overlay_subalign
, 0, 0);
6038 /* If this is the first section, then base the VMA of future
6039 sections on this one. This will work correctly even if `.' is
6040 used in the addresses. */
6041 if (overlay_list
== NULL
)
6042 overlay_vma
= exp_nameop (ADDR
, name
);
6044 /* Remember the section. */
6045 n
= xmalloc (sizeof *n
);
6046 n
->os
= current_section
;
6047 n
->next
= overlay_list
;
6050 size
= exp_nameop (SIZEOF
, name
);
6052 /* Arrange to work out the maximum section end address. */
6053 if (overlay_max
== NULL
)
6056 overlay_max
= exp_binop (MAX_K
, overlay_max
, size
);
6059 /* Finish a section in an overlay. There isn't any special to do
6063 lang_leave_overlay_section (fill_type
*fill
,
6064 lang_output_section_phdr_list
*phdrs
)
6071 name
= current_section
->name
;
6073 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
6074 region and that no load-time region has been specified. It doesn't
6075 really matter what we say here, since lang_leave_overlay will
6077 lang_leave_output_section_statement (fill
, DEFAULT_MEMORY_REGION
, phdrs
, 0);
6079 /* Define the magic symbols. */
6081 clean
= xmalloc (strlen (name
) + 1);
6083 for (s1
= name
; *s1
!= '\0'; s1
++)
6084 if (ISALNUM (*s1
) || *s1
== '_')
6088 buf
= xmalloc (strlen (clean
) + sizeof "__load_start_");
6089 sprintf (buf
, "__load_start_%s", clean
);
6090 lang_add_assignment (exp_assop ('=', buf
,
6091 exp_nameop (LOADADDR
, name
)));
6093 buf
= xmalloc (strlen (clean
) + sizeof "__load_stop_");
6094 sprintf (buf
, "__load_stop_%s", clean
);
6095 lang_add_assignment (exp_assop ('=', buf
,
6097 exp_nameop (LOADADDR
, name
),
6098 exp_nameop (SIZEOF
, name
))));
6103 /* Finish an overlay. If there are any overlay wide settings, this
6104 looks through all the sections in the overlay and sets them. */
6107 lang_leave_overlay (etree_type
*lma_expr
,
6110 const char *memspec
,
6111 lang_output_section_phdr_list
*phdrs
,
6112 const char *lma_memspec
)
6114 lang_memory_region_type
*region
;
6115 lang_memory_region_type
*lma_region
;
6116 struct overlay_list
*l
;
6117 lang_nocrossref_type
*nocrossref
;
6119 lang_get_regions (®ion
, &lma_region
,
6120 memspec
, lma_memspec
,
6121 lma_expr
!= NULL
, FALSE
);
6125 /* After setting the size of the last section, set '.' to end of the
6127 if (overlay_list
!= NULL
)
6128 overlay_list
->os
->update_dot_tree
6129 = exp_assop ('=', ".", exp_binop ('+', overlay_vma
, overlay_max
));
6134 struct overlay_list
*next
;
6136 if (fill
!= NULL
&& l
->os
->fill
== NULL
)
6139 l
->os
->region
= region
;
6140 l
->os
->lma_region
= lma_region
;
6142 /* The first section has the load address specified in the
6143 OVERLAY statement. The rest are worked out from that.
6144 The base address is not needed (and should be null) if
6145 an LMA region was specified. */
6147 l
->os
->load_base
= lma_expr
;
6148 else if (lma_region
== 0)
6149 l
->os
->load_base
= exp_binop ('+',
6150 exp_nameop (LOADADDR
, l
->next
->os
->name
),
6151 exp_nameop (SIZEOF
, l
->next
->os
->name
));
6153 if (phdrs
!= NULL
&& l
->os
->phdrs
== NULL
)
6154 l
->os
->phdrs
= phdrs
;
6158 lang_nocrossref_type
*nc
;
6160 nc
= xmalloc (sizeof *nc
);
6161 nc
->name
= l
->os
->name
;
6162 nc
->next
= nocrossref
;
6171 if (nocrossref
!= NULL
)
6172 lang_add_nocrossref (nocrossref
);
6175 overlay_list
= NULL
;
6179 /* Version handling. This is only useful for ELF. */
6181 /* This global variable holds the version tree that we build. */
6183 struct bfd_elf_version_tree
*lang_elf_version_info
;
6185 /* If PREV is NULL, return first version pattern matching particular symbol.
6186 If PREV is non-NULL, return first version pattern matching particular
6187 symbol after PREV (previously returned by lang_vers_match). */
6189 static struct bfd_elf_version_expr
*
6190 lang_vers_match (struct bfd_elf_version_expr_head
*head
,
6191 struct bfd_elf_version_expr
*prev
,
6194 const char *cxx_sym
= sym
;
6195 const char *java_sym
= sym
;
6196 struct bfd_elf_version_expr
*expr
= NULL
;
6198 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6200 cxx_sym
= cplus_demangle (sym
, DMGL_PARAMS
| DMGL_ANSI
);
6204 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6206 java_sym
= cplus_demangle (sym
, DMGL_JAVA
);
6211 if (head
->htab
&& (prev
== NULL
|| prev
->symbol
))
6213 struct bfd_elf_version_expr e
;
6215 switch (prev
? prev
->mask
: 0)
6218 if (head
->mask
& BFD_ELF_VERSION_C_TYPE
)
6221 expr
= htab_find (head
->htab
, &e
);
6222 while (expr
&& strcmp (expr
->symbol
, sym
) == 0)
6223 if (expr
->mask
== BFD_ELF_VERSION_C_TYPE
)
6229 case BFD_ELF_VERSION_C_TYPE
:
6230 if (head
->mask
& BFD_ELF_VERSION_CXX_TYPE
)
6233 expr
= htab_find (head
->htab
, &e
);
6234 while (expr
&& strcmp (expr
->symbol
, cxx_sym
) == 0)
6235 if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6241 case BFD_ELF_VERSION_CXX_TYPE
:
6242 if (head
->mask
& BFD_ELF_VERSION_JAVA_TYPE
)
6244 e
.symbol
= java_sym
;
6245 expr
= htab_find (head
->htab
, &e
);
6246 while (expr
&& strcmp (expr
->symbol
, java_sym
) == 0)
6247 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6258 /* Finally, try the wildcards. */
6259 if (prev
== NULL
|| prev
->symbol
)
6260 expr
= head
->remaining
;
6267 if (expr
->pattern
[0] == '*' && expr
->pattern
[1] == '\0')
6270 if (expr
->mask
== BFD_ELF_VERSION_JAVA_TYPE
)
6272 else if (expr
->mask
== BFD_ELF_VERSION_CXX_TYPE
)
6276 if (fnmatch (expr
->pattern
, s
, 0) == 0)
6283 free ((char *) cxx_sym
);
6284 if (java_sym
!= sym
)
6285 free ((char *) java_sym
);
6289 /* Return NULL if the PATTERN argument is a glob pattern, otherwise,
6290 return a string pointing to the symbol name. */
6293 realsymbol (const char *pattern
)
6296 bfd_boolean changed
= FALSE
, backslash
= FALSE
;
6297 char *s
, *symbol
= xmalloc (strlen (pattern
) + 1);
6299 for (p
= pattern
, s
= symbol
; *p
!= '\0'; ++p
)
6301 /* It is a glob pattern only if there is no preceding
6303 if (! backslash
&& (*p
== '?' || *p
== '*' || *p
== '['))
6311 /* Remove the preceding backslash. */
6318 backslash
= *p
== '\\';
6333 /* This is called for each variable name or match expression. */
6335 struct bfd_elf_version_expr
*
6336 lang_new_vers_pattern (struct bfd_elf_version_expr
*orig
,
6340 struct bfd_elf_version_expr
*ret
;
6342 ret
= xmalloc (sizeof *ret
);
6347 ret
->symbol
= realsymbol (new);
6349 if (lang
== NULL
|| strcasecmp (lang
, "C") == 0)
6350 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6351 else if (strcasecmp (lang
, "C++") == 0)
6352 ret
->mask
= BFD_ELF_VERSION_CXX_TYPE
;
6353 else if (strcasecmp (lang
, "Java") == 0)
6354 ret
->mask
= BFD_ELF_VERSION_JAVA_TYPE
;
6357 einfo (_("%X%P: unknown language `%s' in version information\n"),
6359 ret
->mask
= BFD_ELF_VERSION_C_TYPE
;
6362 return ldemul_new_vers_pattern (ret
);
6365 /* This is called for each set of variable names and match
6368 struct bfd_elf_version_tree
*
6369 lang_new_vers_node (struct bfd_elf_version_expr
*globals
,
6370 struct bfd_elf_version_expr
*locals
)
6372 struct bfd_elf_version_tree
*ret
;
6374 ret
= xcalloc (1, sizeof *ret
);
6375 ret
->globals
.list
= globals
;
6376 ret
->locals
.list
= locals
;
6377 ret
->match
= lang_vers_match
;
6378 ret
->name_indx
= (unsigned int) -1;
6382 /* This static variable keeps track of version indices. */
6384 static int version_index
;
6387 version_expr_head_hash (const void *p
)
6389 const struct bfd_elf_version_expr
*e
= p
;
6391 return htab_hash_string (e
->symbol
);
6395 version_expr_head_eq (const void *p1
, const void *p2
)
6397 const struct bfd_elf_version_expr
*e1
= p1
;
6398 const struct bfd_elf_version_expr
*e2
= p2
;
6400 return strcmp (e1
->symbol
, e2
->symbol
) == 0;
6404 lang_finalize_version_expr_head (struct bfd_elf_version_expr_head
*head
)
6407 struct bfd_elf_version_expr
*e
, *next
;
6408 struct bfd_elf_version_expr
**list_loc
, **remaining_loc
;
6410 for (e
= head
->list
; e
; e
= e
->next
)
6414 head
->mask
|= e
->mask
;
6419 head
->htab
= htab_create (count
* 2, version_expr_head_hash
,
6420 version_expr_head_eq
, NULL
);
6421 list_loc
= &head
->list
;
6422 remaining_loc
= &head
->remaining
;
6423 for (e
= head
->list
; e
; e
= next
)
6429 remaining_loc
= &e
->next
;
6433 void **loc
= htab_find_slot (head
->htab
, e
, INSERT
);
6437 struct bfd_elf_version_expr
*e1
, *last
;
6443 if (e1
->mask
== e
->mask
)
6451 while (e1
&& strcmp (e1
->symbol
, e
->symbol
) == 0);
6455 /* This is a duplicate. */
6456 /* FIXME: Memory leak. Sometimes pattern is not
6457 xmalloced alone, but in larger chunk of memory. */
6458 /* free (e->symbol); */
6463 e
->next
= last
->next
;
6471 list_loc
= &e
->next
;
6475 *remaining_loc
= NULL
;
6476 *list_loc
= head
->remaining
;
6479 head
->remaining
= head
->list
;
6482 /* This is called when we know the name and dependencies of the
6486 lang_register_vers_node (const char *name
,
6487 struct bfd_elf_version_tree
*version
,
6488 struct bfd_elf_version_deps
*deps
)
6490 struct bfd_elf_version_tree
*t
, **pp
;
6491 struct bfd_elf_version_expr
*e1
;
6496 if ((name
[0] == '\0' && lang_elf_version_info
!= NULL
)
6497 || (lang_elf_version_info
&& lang_elf_version_info
->name
[0] == '\0'))
6499 einfo (_("%X%P: anonymous version tag cannot be combined"
6500 " with other version tags\n"));
6505 /* Make sure this node has a unique name. */
6506 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6507 if (strcmp (t
->name
, name
) == 0)
6508 einfo (_("%X%P: duplicate version tag `%s'\n"), name
);
6510 lang_finalize_version_expr_head (&version
->globals
);
6511 lang_finalize_version_expr_head (&version
->locals
);
6513 /* Check the global and local match names, and make sure there
6514 aren't any duplicates. */
6516 for (e1
= version
->globals
.list
; e1
!= NULL
; e1
= e1
->next
)
6518 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6520 struct bfd_elf_version_expr
*e2
;
6522 if (t
->locals
.htab
&& e1
->symbol
)
6524 e2
= htab_find (t
->locals
.htab
, e1
);
6525 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6527 if (e1
->mask
== e2
->mask
)
6528 einfo (_("%X%P: duplicate expression `%s'"
6529 " in version information\n"), e1
->symbol
);
6533 else if (!e1
->symbol
)
6534 for (e2
= t
->locals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6535 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6536 && e1
->mask
== e2
->mask
)
6537 einfo (_("%X%P: duplicate expression `%s'"
6538 " in version information\n"), e1
->pattern
);
6542 for (e1
= version
->locals
.list
; e1
!= NULL
; e1
= e1
->next
)
6544 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6546 struct bfd_elf_version_expr
*e2
;
6548 if (t
->globals
.htab
&& e1
->symbol
)
6550 e2
= htab_find (t
->globals
.htab
, e1
);
6551 while (e2
&& strcmp (e1
->symbol
, e2
->symbol
) == 0)
6553 if (e1
->mask
== e2
->mask
)
6554 einfo (_("%X%P: duplicate expression `%s'"
6555 " in version information\n"),
6560 else if (!e1
->symbol
)
6561 for (e2
= t
->globals
.remaining
; e2
!= NULL
; e2
= e2
->next
)
6562 if (strcmp (e1
->pattern
, e2
->pattern
) == 0
6563 && e1
->mask
== e2
->mask
)
6564 einfo (_("%X%P: duplicate expression `%s'"
6565 " in version information\n"), e1
->pattern
);
6569 version
->deps
= deps
;
6570 version
->name
= name
;
6571 if (name
[0] != '\0')
6574 version
->vernum
= version_index
;
6577 version
->vernum
= 0;
6579 for (pp
= &lang_elf_version_info
; *pp
!= NULL
; pp
= &(*pp
)->next
)
6584 /* This is called when we see a version dependency. */
6586 struct bfd_elf_version_deps
*
6587 lang_add_vers_depend (struct bfd_elf_version_deps
*list
, const char *name
)
6589 struct bfd_elf_version_deps
*ret
;
6590 struct bfd_elf_version_tree
*t
;
6592 ret
= xmalloc (sizeof *ret
);
6595 for (t
= lang_elf_version_info
; t
!= NULL
; t
= t
->next
)
6597 if (strcmp (t
->name
, name
) == 0)
6599 ret
->version_needed
= t
;
6604 einfo (_("%X%P: unable to find version dependency `%s'\n"), name
);
6610 lang_do_version_exports_section (void)
6612 struct bfd_elf_version_expr
*greg
= NULL
, *lreg
;
6614 LANG_FOR_EACH_INPUT_STATEMENT (is
)
6616 asection
*sec
= bfd_get_section_by_name (is
->the_bfd
, ".exports");
6624 contents
= xmalloc (len
);
6625 if (!bfd_get_section_contents (is
->the_bfd
, sec
, contents
, 0, len
))
6626 einfo (_("%X%P: unable to read .exports section contents\n"), sec
);
6629 while (p
< contents
+ len
)
6631 greg
= lang_new_vers_pattern (greg
, p
, NULL
);
6632 p
= strchr (p
, '\0') + 1;
6635 /* Do not free the contents, as we used them creating the regex. */
6637 /* Do not include this section in the link. */
6638 sec
->flags
|= SEC_EXCLUDE
;
6641 lreg
= lang_new_vers_pattern (NULL
, "*", NULL
);
6642 lang_register_vers_node (command_line
.version_exports_section
,
6643 lang_new_vers_node (greg
, lreg
), NULL
);
6647 lang_add_unique (const char *name
)
6649 struct unique_sections
*ent
;
6651 for (ent
= unique_section_list
; ent
; ent
= ent
->next
)
6652 if (strcmp (ent
->name
, name
) == 0)
6655 ent
= xmalloc (sizeof *ent
);
6656 ent
->name
= xstrdup (name
);
6657 ent
->next
= unique_section_list
;
6658 unique_section_list
= ent
;