1 /* Emulation code used by all ELF targets.
2 Copyright (C) 1991-2020 Free Software Foundation, Inc.
4 This file is part of the GNU Binutils.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
19 MA 02110-1301, USA. */
34 ldelf_map_segments (bfd_boolean need_layout
)
40 lang_relax_sections (need_layout
);
43 if (link_info
.output_bfd
->xvec
->flavour
== bfd_target_elf_flavour
44 && !bfd_link_relocatable (&link_info
))
46 bfd_size_type phdr_size
;
48 phdr_size
= elf_program_header_size (link_info
.output_bfd
);
49 /* If we don't have user supplied phdrs, throw away any
50 previous linker generated program headers. */
51 if (lang_phdr_list
== NULL
)
52 elf_seg_map (link_info
.output_bfd
) = NULL
;
53 if (!_bfd_elf_map_sections_to_segments (link_info
.output_bfd
,
55 einfo (_("%F%P: map sections to segments failed: %E\n"));
57 if (phdr_size
!= elf_program_header_size (link_info
.output_bfd
))
60 /* The first few times we allow any change to
64 < elf_program_header_size (link_info
.output_bfd
))
65 /* After that we only allow the size to grow. */
68 elf_program_header_size (link_info
.output_bfd
) = phdr_size
;
72 while (need_layout
&& --tries
);
75 einfo (_("%F%P: looping in map_segments"));
77 if (link_info
.output_bfd
->xvec
->flavour
== bfd_target_elf_flavour
78 && lang_phdr_list
== NULL
)
80 /* If we don't have user supplied phdrs, strip zero-sized dynamic
81 sections and regenerate program headers. */
82 const struct elf_backend_data
*bed
83 = get_elf_backend_data (link_info
.output_bfd
);
84 if (bed
->elf_backend_strip_zero_sized_dynamic_sections
85 && !bed
->elf_backend_strip_zero_sized_dynamic_sections
87 einfo (_("%F%P: failed to strip zero-sized dynamic sections"));
91 /* We want to emit CTF early if and only if we are not targetting ELF with this
95 ldelf_emit_ctf_early (void)
97 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
)
102 /* Callbacks used to map from bfd types to libctf types, under libctf's
105 struct ctf_strsym_iter_cb_arg
107 struct elf_sym_strtab
*syms
;
108 bfd_size_type symcount
;
109 struct elf_strtab_hash
*symstrtab
;
114 /* Return strings from the strtab to libctf, one by one. Returns NULL when
115 iteration is complete. */
118 ldelf_ctf_strtab_iter_cb (uint32_t *offset
, void *arg_
)
123 struct ctf_strsym_iter_cb_arg
*arg
=
124 (struct ctf_strsym_iter_cb_arg
*) arg_
;
126 /* There is no zeroth string. */
127 if (arg
->next_i
== 0)
130 if (arg
->next_i
>= _bfd_elf_strtab_len (arg
->symstrtab
))
136 ret
= _bfd_elf_strtab_str (arg
->symstrtab
, arg
->next_i
++, &off
);
139 /* If we've overflowed, we cannot share any further strings: the CTF
140 format cannot encode strings with such high offsets. */
147 /* Return symbols from the symbol table to libctf, one by one. We assume (and
148 assert) that the symbols in the elf_link_hash_table are in strictly ascending
149 order, and that none will be added in between existing ones. Returns NULL
150 when iteration is complete. */
152 static struct ctf_link_sym
*
153 ldelf_ctf_symbols_iter_cb (struct ctf_link_sym
*dest
,
156 struct ctf_strsym_iter_cb_arg
*arg
=
157 (struct ctf_strsym_iter_cb_arg
*) arg_
;
159 if (arg
->next_i
> arg
->symcount
)
166 ASSERT (arg
->syms
[arg
->next_i
].dest_index
== arg
->next_idx
);
167 dest
->st_name
= _bfd_elf_strtab_str (arg
->symstrtab
, arg
->next_i
, NULL
);
168 dest
->st_shndx
= arg
->syms
[arg
->next_i
].sym
.st_shndx
;
169 dest
->st_type
= ELF_ST_TYPE (arg
->syms
[arg
->next_i
].sym
.st_info
);
170 dest
->st_value
= arg
->syms
[arg
->next_i
].sym
.st_value
;
176 ldelf_examine_strtab_for_ctf
177 (struct ctf_file
*ctf_output
, struct elf_sym_strtab
*syms
,
178 bfd_size_type symcount
, struct elf_strtab_hash
*symstrtab
)
180 struct ctf_strsym_iter_cb_arg args
= { syms
, symcount
, symstrtab
,
185 if (bfd_get_flavour (link_info
.output_bfd
) == bfd_target_elf_flavour
186 && !bfd_link_relocatable (&link_info
))
188 if (ctf_link_add_strtab (ctf_output
, ldelf_ctf_strtab_iter_cb
,
190 einfo (_("%F%P: warning: CTF strtab association failed; strings will "
191 "not be shared: %s\n"),
192 ctf_errmsg (ctf_errno (ctf_output
)));
194 if (ctf_link_shuffle_syms (ctf_output
, ldelf_ctf_symbols_iter_cb
,
196 einfo (_("%F%P: warning: CTF symbol shuffling failed; slight space "
197 "cost: %s\n"), ctf_errmsg (ctf_errno (ctf_output
)));