Commit | Line | Data |
---|---|---|
a2fb1b05 ILT |
1 | // output.cc -- manage the output file for gold |
2 | ||
d77a0555 ILT |
3 | // Copyright 2006, 2007, 2008, 2009, 2010, 2011, 2012 |
4 | // Free Software Foundation, Inc. | |
6cb15b7f ILT |
5 | // Written by Ian Lance Taylor <iant@google.com>. |
6 | ||
7 | // This file is part of gold. | |
8 | ||
9 | // This program is free software; you can redistribute it and/or modify | |
10 | // it under the terms of the GNU General Public License as published by | |
11 | // the Free Software Foundation; either version 3 of the License, or | |
12 | // (at your option) any later version. | |
13 | ||
14 | // This program is distributed in the hope that it will be useful, | |
15 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | // GNU General Public License for more details. | |
18 | ||
19 | // You should have received a copy of the GNU General Public License | |
20 | // along with this program; if not, write to the Free Software | |
21 | // Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, | |
22 | // MA 02110-1301, USA. | |
23 | ||
a2fb1b05 ILT |
24 | #include "gold.h" |
25 | ||
26 | #include <cstdlib> | |
04bf7072 | 27 | #include <cstring> |
61ba1cf9 ILT |
28 | #include <cerrno> |
29 | #include <fcntl.h> | |
30 | #include <unistd.h> | |
4e9d8586 | 31 | #include <sys/stat.h> |
75f65a3e | 32 | #include <algorithm> |
88597d34 ILT |
33 | |
34 | #ifdef HAVE_SYS_MMAN_H | |
35 | #include <sys/mman.h> | |
36 | #endif | |
37 | ||
6a89f575 | 38 | #include "libiberty.h" |
a2fb1b05 | 39 | |
8ea8cd50 | 40 | #include "dwarf.h" |
7e1edb90 | 41 | #include "parameters.h" |
a2fb1b05 | 42 | #include "object.h" |
ead1e424 ILT |
43 | #include "symtab.h" |
44 | #include "reloc.h" | |
b8e6aad9 | 45 | #include "merge.h" |
2a00e4fb | 46 | #include "descriptors.h" |
5393d741 | 47 | #include "layout.h" |
a2fb1b05 ILT |
48 | #include "output.h" |
49 | ||
88597d34 ILT |
50 | // For systems without mmap support. |
51 | #ifndef HAVE_MMAP | |
52 | # define mmap gold_mmap | |
53 | # define munmap gold_munmap | |
54 | # define mremap gold_mremap | |
55 | # ifndef MAP_FAILED | |
56 | # define MAP_FAILED (reinterpret_cast<void*>(-1)) | |
57 | # endif | |
58 | # ifndef PROT_READ | |
59 | # define PROT_READ 0 | |
60 | # endif | |
61 | # ifndef PROT_WRITE | |
62 | # define PROT_WRITE 0 | |
63 | # endif | |
64 | # ifndef MAP_PRIVATE | |
65 | # define MAP_PRIVATE 0 | |
66 | # endif | |
67 | # ifndef MAP_ANONYMOUS | |
68 | # define MAP_ANONYMOUS 0 | |
69 | # endif | |
70 | # ifndef MAP_SHARED | |
71 | # define MAP_SHARED 0 | |
72 | # endif | |
73 | ||
74 | # ifndef ENOSYS | |
75 | # define ENOSYS EINVAL | |
76 | # endif | |
77 | ||
78 | static void * | |
79 | gold_mmap(void *, size_t, int, int, int, off_t) | |
80 | { | |
81 | errno = ENOSYS; | |
82 | return MAP_FAILED; | |
83 | } | |
84 | ||
85 | static int | |
86 | gold_munmap(void *, size_t) | |
87 | { | |
88 | errno = ENOSYS; | |
89 | return -1; | |
90 | } | |
91 | ||
92 | static void * | |
93 | gold_mremap(void *, size_t, size_t, int) | |
94 | { | |
95 | errno = ENOSYS; | |
96 | return MAP_FAILED; | |
97 | } | |
98 | ||
99 | #endif | |
100 | ||
101 | #if defined(HAVE_MMAP) && !defined(HAVE_MREMAP) | |
102 | # define mremap gold_mremap | |
103 | extern "C" void *gold_mremap(void *, size_t, size_t, int); | |
104 | #endif | |
105 | ||
c420411f ILT |
106 | // Some BSD systems still use MAP_ANON instead of MAP_ANONYMOUS |
107 | #ifndef MAP_ANONYMOUS | |
108 | # define MAP_ANONYMOUS MAP_ANON | |
109 | #endif | |
110 | ||
88597d34 ILT |
111 | #ifndef MREMAP_MAYMOVE |
112 | # define MREMAP_MAYMOVE 1 | |
113 | #endif | |
114 | ||
d0a9ace3 ILT |
115 | // Mingw does not have S_ISLNK. |
116 | #ifndef S_ISLNK | |
117 | # define S_ISLNK(mode) 0 | |
118 | #endif | |
119 | ||
a2fb1b05 ILT |
120 | namespace gold |
121 | { | |
122 | ||
7c0640fa CC |
123 | // A wrapper around posix_fallocate. If we don't have posix_fallocate, |
124 | // or the --no-posix-fallocate option is set, we try the fallocate | |
125 | // system call directly. If that fails, we use ftruncate to set | |
126 | // the file size and hope that there is enough disk space. | |
127 | ||
128 | static int | |
129 | gold_fallocate(int o, off_t offset, off_t len) | |
130 | { | |
131 | #ifdef HAVE_POSIX_FALLOCATE | |
132 | if (parameters->options().posix_fallocate()) | |
133 | return ::posix_fallocate(o, offset, len); | |
134 | #endif // defined(HAVE_POSIX_FALLOCATE) | |
135 | #ifdef HAVE_FALLOCATE | |
136 | if (::fallocate(o, 0, offset, len) == 0) | |
137 | return 0; | |
138 | #endif // defined(HAVE_FALLOCATE) | |
139 | if (::ftruncate(o, offset + len) < 0) | |
140 | return errno; | |
141 | return 0; | |
142 | } | |
143 | ||
a3ad94ed ILT |
144 | // Output_data variables. |
145 | ||
27bc2bce | 146 | bool Output_data::allocated_sizes_are_fixed; |
a3ad94ed | 147 | |
a2fb1b05 ILT |
148 | // Output_data methods. |
149 | ||
150 | Output_data::~Output_data() | |
151 | { | |
152 | } | |
153 | ||
730cdc88 ILT |
154 | // Return the default alignment for the target size. |
155 | ||
156 | uint64_t | |
157 | Output_data::default_alignment() | |
158 | { | |
8851ecca ILT |
159 | return Output_data::default_alignment_for_size( |
160 | parameters->target().get_size()); | |
730cdc88 ILT |
161 | } |
162 | ||
75f65a3e ILT |
163 | // Return the default alignment for a size--32 or 64. |
164 | ||
165 | uint64_t | |
730cdc88 | 166 | Output_data::default_alignment_for_size(int size) |
75f65a3e ILT |
167 | { |
168 | if (size == 32) | |
169 | return 4; | |
170 | else if (size == 64) | |
171 | return 8; | |
172 | else | |
a3ad94ed | 173 | gold_unreachable(); |
75f65a3e ILT |
174 | } |
175 | ||
75f65a3e ILT |
176 | // Output_section_header methods. This currently assumes that the |
177 | // segment and section lists are complete at construction time. | |
178 | ||
179 | Output_section_headers::Output_section_headers( | |
16649710 ILT |
180 | const Layout* layout, |
181 | const Layout::Segment_list* segment_list, | |
6a74a719 | 182 | const Layout::Section_list* section_list, |
16649710 | 183 | const Layout::Section_list* unattached_section_list, |
d491d34e ILT |
184 | const Stringpool* secnamepool, |
185 | const Output_section* shstrtab_section) | |
9025d29d | 186 | : layout_(layout), |
75f65a3e | 187 | segment_list_(segment_list), |
6a74a719 | 188 | section_list_(section_list), |
a3ad94ed | 189 | unattached_section_list_(unattached_section_list), |
d491d34e ILT |
190 | secnamepool_(secnamepool), |
191 | shstrtab_section_(shstrtab_section) | |
20e6d0d6 DK |
192 | { |
193 | } | |
194 | ||
195 | // Compute the current data size. | |
196 | ||
197 | off_t | |
198 | Output_section_headers::do_size() const | |
75f65a3e | 199 | { |
61ba1cf9 ILT |
200 | // Count all the sections. Start with 1 for the null section. |
201 | off_t count = 1; | |
8851ecca | 202 | if (!parameters->options().relocatable()) |
6a74a719 | 203 | { |
20e6d0d6 DK |
204 | for (Layout::Segment_list::const_iterator p = |
205 | this->segment_list_->begin(); | |
206 | p != this->segment_list_->end(); | |
6a74a719 ILT |
207 | ++p) |
208 | if ((*p)->type() == elfcpp::PT_LOAD) | |
209 | count += (*p)->output_section_count(); | |
210 | } | |
211 | else | |
212 | { | |
20e6d0d6 DK |
213 | for (Layout::Section_list::const_iterator p = |
214 | this->section_list_->begin(); | |
215 | p != this->section_list_->end(); | |
6a74a719 ILT |
216 | ++p) |
217 | if (((*p)->flags() & elfcpp::SHF_ALLOC) != 0) | |
218 | ++count; | |
219 | } | |
20e6d0d6 | 220 | count += this->unattached_section_list_->size(); |
75f65a3e | 221 | |
8851ecca | 222 | const int size = parameters->target().get_size(); |
75f65a3e ILT |
223 | int shdr_size; |
224 | if (size == 32) | |
225 | shdr_size = elfcpp::Elf_sizes<32>::shdr_size; | |
226 | else if (size == 64) | |
227 | shdr_size = elfcpp::Elf_sizes<64>::shdr_size; | |
228 | else | |
a3ad94ed | 229 | gold_unreachable(); |
75f65a3e | 230 | |
20e6d0d6 | 231 | return count * shdr_size; |
75f65a3e ILT |
232 | } |
233 | ||
61ba1cf9 ILT |
234 | // Write out the section headers. |
235 | ||
75f65a3e | 236 | void |
61ba1cf9 | 237 | Output_section_headers::do_write(Output_file* of) |
a2fb1b05 | 238 | { |
8851ecca | 239 | switch (parameters->size_and_endianness()) |
61ba1cf9 | 240 | { |
9025d29d | 241 | #ifdef HAVE_TARGET_32_LITTLE |
8851ecca ILT |
242 | case Parameters::TARGET_32_LITTLE: |
243 | this->do_sized_write<32, false>(of); | |
244 | break; | |
9025d29d | 245 | #endif |
8851ecca ILT |
246 | #ifdef HAVE_TARGET_32_BIG |
247 | case Parameters::TARGET_32_BIG: | |
248 | this->do_sized_write<32, true>(of); | |
249 | break; | |
9025d29d | 250 | #endif |
9025d29d | 251 | #ifdef HAVE_TARGET_64_LITTLE |
8851ecca ILT |
252 | case Parameters::TARGET_64_LITTLE: |
253 | this->do_sized_write<64, false>(of); | |
254 | break; | |
9025d29d | 255 | #endif |
8851ecca ILT |
256 | #ifdef HAVE_TARGET_64_BIG |
257 | case Parameters::TARGET_64_BIG: | |
258 | this->do_sized_write<64, true>(of); | |
259 | break; | |
260 | #endif | |
261 | default: | |
262 | gold_unreachable(); | |
61ba1cf9 | 263 | } |
61ba1cf9 ILT |
264 | } |
265 | ||
266 | template<int size, bool big_endian> | |
267 | void | |
268 | Output_section_headers::do_sized_write(Output_file* of) | |
269 | { | |
270 | off_t all_shdrs_size = this->data_size(); | |
271 | unsigned char* view = of->get_output_view(this->offset(), all_shdrs_size); | |
272 | ||
273 | const int shdr_size = elfcpp::Elf_sizes<size>::shdr_size; | |
274 | unsigned char* v = view; | |
275 | ||
276 | { | |
277 | typename elfcpp::Shdr_write<size, big_endian> oshdr(v); | |
278 | oshdr.put_sh_name(0); | |
279 | oshdr.put_sh_type(elfcpp::SHT_NULL); | |
280 | oshdr.put_sh_flags(0); | |
281 | oshdr.put_sh_addr(0); | |
282 | oshdr.put_sh_offset(0); | |
d491d34e ILT |
283 | |
284 | size_t section_count = (this->data_size() | |
285 | / elfcpp::Elf_sizes<size>::shdr_size); | |
286 | if (section_count < elfcpp::SHN_LORESERVE) | |
287 | oshdr.put_sh_size(0); | |
288 | else | |
289 | oshdr.put_sh_size(section_count); | |
290 | ||
291 | unsigned int shstrndx = this->shstrtab_section_->out_shndx(); | |
292 | if (shstrndx < elfcpp::SHN_LORESERVE) | |
293 | oshdr.put_sh_link(0); | |
294 | else | |
295 | oshdr.put_sh_link(shstrndx); | |
296 | ||
5696ab0b ILT |
297 | size_t segment_count = this->segment_list_->size(); |
298 | oshdr.put_sh_info(segment_count >= elfcpp::PN_XNUM ? segment_count : 0); | |
299 | ||
61ba1cf9 ILT |
300 | oshdr.put_sh_addralign(0); |
301 | oshdr.put_sh_entsize(0); | |
302 | } | |
303 | ||
304 | v += shdr_size; | |
305 | ||
6a74a719 | 306 | unsigned int shndx = 1; |
8851ecca | 307 | if (!parameters->options().relocatable()) |
6a74a719 ILT |
308 | { |
309 | for (Layout::Segment_list::const_iterator p = | |
310 | this->segment_list_->begin(); | |
311 | p != this->segment_list_->end(); | |
312 | ++p) | |
313 | v = (*p)->write_section_headers<size, big_endian>(this->layout_, | |
314 | this->secnamepool_, | |
315 | v, | |
316 | &shndx); | |
317 | } | |
318 | else | |
319 | { | |
320 | for (Layout::Section_list::const_iterator p = | |
321 | this->section_list_->begin(); | |
322 | p != this->section_list_->end(); | |
323 | ++p) | |
324 | { | |
325 | // We do unallocated sections below, except that group | |
326 | // sections have to come first. | |
327 | if (((*p)->flags() & elfcpp::SHF_ALLOC) == 0 | |
328 | && (*p)->type() != elfcpp::SHT_GROUP) | |
329 | continue; | |
330 | gold_assert(shndx == (*p)->out_shndx()); | |
331 | elfcpp::Shdr_write<size, big_endian> oshdr(v); | |
332 | (*p)->write_header(this->layout_, this->secnamepool_, &oshdr); | |
333 | v += shdr_size; | |
334 | ++shndx; | |
335 | } | |
336 | } | |
337 | ||
a3ad94ed | 338 | for (Layout::Section_list::const_iterator p = |
16649710 ILT |
339 | this->unattached_section_list_->begin(); |
340 | p != this->unattached_section_list_->end(); | |
61ba1cf9 ILT |
341 | ++p) |
342 | { | |
6a74a719 ILT |
343 | // For a relocatable link, we did unallocated group sections |
344 | // above, since they have to come first. | |
345 | if ((*p)->type() == elfcpp::SHT_GROUP | |
8851ecca | 346 | && parameters->options().relocatable()) |
6a74a719 | 347 | continue; |
a3ad94ed | 348 | gold_assert(shndx == (*p)->out_shndx()); |
61ba1cf9 | 349 | elfcpp::Shdr_write<size, big_endian> oshdr(v); |
16649710 | 350 | (*p)->write_header(this->layout_, this->secnamepool_, &oshdr); |
61ba1cf9 | 351 | v += shdr_size; |
ead1e424 | 352 | ++shndx; |
61ba1cf9 ILT |
353 | } |
354 | ||
355 | of->write_output_view(this->offset(), all_shdrs_size, view); | |
a2fb1b05 ILT |
356 | } |
357 | ||
54dc6425 ILT |
358 | // Output_segment_header methods. |
359 | ||
61ba1cf9 | 360 | Output_segment_headers::Output_segment_headers( |
61ba1cf9 | 361 | const Layout::Segment_list& segment_list) |
9025d29d | 362 | : segment_list_(segment_list) |
61ba1cf9 | 363 | { |
cdc29364 | 364 | this->set_current_data_size_for_child(this->do_size()); |
61ba1cf9 ILT |
365 | } |
366 | ||
54dc6425 | 367 | void |
61ba1cf9 | 368 | Output_segment_headers::do_write(Output_file* of) |
75f65a3e | 369 | { |
8851ecca | 370 | switch (parameters->size_and_endianness()) |
61ba1cf9 | 371 | { |
9025d29d | 372 | #ifdef HAVE_TARGET_32_LITTLE |
8851ecca ILT |
373 | case Parameters::TARGET_32_LITTLE: |
374 | this->do_sized_write<32, false>(of); | |
375 | break; | |
9025d29d | 376 | #endif |
8851ecca ILT |
377 | #ifdef HAVE_TARGET_32_BIG |
378 | case Parameters::TARGET_32_BIG: | |
379 | this->do_sized_write<32, true>(of); | |
380 | break; | |
9025d29d | 381 | #endif |
9025d29d | 382 | #ifdef HAVE_TARGET_64_LITTLE |
8851ecca ILT |
383 | case Parameters::TARGET_64_LITTLE: |
384 | this->do_sized_write<64, false>(of); | |
385 | break; | |
9025d29d | 386 | #endif |
8851ecca ILT |
387 | #ifdef HAVE_TARGET_64_BIG |
388 | case Parameters::TARGET_64_BIG: | |
389 | this->do_sized_write<64, true>(of); | |
390 | break; | |
391 | #endif | |
392 | default: | |
393 | gold_unreachable(); | |
61ba1cf9 | 394 | } |
61ba1cf9 ILT |
395 | } |
396 | ||
397 | template<int size, bool big_endian> | |
398 | void | |
399 | Output_segment_headers::do_sized_write(Output_file* of) | |
400 | { | |
401 | const int phdr_size = elfcpp::Elf_sizes<size>::phdr_size; | |
402 | off_t all_phdrs_size = this->segment_list_.size() * phdr_size; | |
a445fddf | 403 | gold_assert(all_phdrs_size == this->data_size()); |
61ba1cf9 ILT |
404 | unsigned char* view = of->get_output_view(this->offset(), |
405 | all_phdrs_size); | |
406 | unsigned char* v = view; | |
407 | for (Layout::Segment_list::const_iterator p = this->segment_list_.begin(); | |
408 | p != this->segment_list_.end(); | |
409 | ++p) | |
410 | { | |
411 | elfcpp::Phdr_write<size, big_endian> ophdr(v); | |
412 | (*p)->write_header(&ophdr); | |
413 | v += phdr_size; | |
414 | } | |
415 | ||
a445fddf ILT |
416 | gold_assert(v - view == all_phdrs_size); |
417 | ||
61ba1cf9 | 418 | of->write_output_view(this->offset(), all_phdrs_size, view); |
75f65a3e ILT |
419 | } |
420 | ||
20e6d0d6 DK |
421 | off_t |
422 | Output_segment_headers::do_size() const | |
423 | { | |
424 | const int size = parameters->target().get_size(); | |
425 | int phdr_size; | |
426 | if (size == 32) | |
427 | phdr_size = elfcpp::Elf_sizes<32>::phdr_size; | |
428 | else if (size == 64) | |
429 | phdr_size = elfcpp::Elf_sizes<64>::phdr_size; | |
430 | else | |
431 | gold_unreachable(); | |
432 | ||
433 | return this->segment_list_.size() * phdr_size; | |
434 | } | |
435 | ||
75f65a3e ILT |
436 | // Output_file_header methods. |
437 | ||
9025d29d | 438 | Output_file_header::Output_file_header(const Target* target, |
75f65a3e | 439 | const Symbol_table* symtab, |
a10ae760 | 440 | const Output_segment_headers* osh) |
9025d29d | 441 | : target_(target), |
75f65a3e | 442 | symtab_(symtab), |
61ba1cf9 | 443 | segment_header_(osh), |
75f65a3e | 444 | section_header_(NULL), |
a10ae760 | 445 | shstrtab_(NULL) |
75f65a3e | 446 | { |
20e6d0d6 | 447 | this->set_data_size(this->do_size()); |
75f65a3e ILT |
448 | } |
449 | ||
450 | // Set the section table information for a file header. | |
451 | ||
452 | void | |
453 | Output_file_header::set_section_info(const Output_section_headers* shdrs, | |
454 | const Output_section* shstrtab) | |
455 | { | |
456 | this->section_header_ = shdrs; | |
457 | this->shstrtab_ = shstrtab; | |
458 | } | |
459 | ||
460 | // Write out the file header. | |
461 | ||
462 | void | |
61ba1cf9 | 463 | Output_file_header::do_write(Output_file* of) |
54dc6425 | 464 | { |
27bc2bce ILT |
465 | gold_assert(this->offset() == 0); |
466 | ||
8851ecca | 467 | switch (parameters->size_and_endianness()) |
61ba1cf9 | 468 | { |
9025d29d | 469 | #ifdef HAVE_TARGET_32_LITTLE |
8851ecca ILT |
470 | case Parameters::TARGET_32_LITTLE: |
471 | this->do_sized_write<32, false>(of); | |
472 | break; | |
9025d29d | 473 | #endif |
8851ecca ILT |
474 | #ifdef HAVE_TARGET_32_BIG |
475 | case Parameters::TARGET_32_BIG: | |
476 | this->do_sized_write<32, true>(of); | |
477 | break; | |
9025d29d | 478 | #endif |
9025d29d | 479 | #ifdef HAVE_TARGET_64_LITTLE |
8851ecca ILT |
480 | case Parameters::TARGET_64_LITTLE: |
481 | this->do_sized_write<64, false>(of); | |
482 | break; | |
9025d29d | 483 | #endif |
8851ecca ILT |
484 | #ifdef HAVE_TARGET_64_BIG |
485 | case Parameters::TARGET_64_BIG: | |
486 | this->do_sized_write<64, true>(of); | |
487 | break; | |
488 | #endif | |
489 | default: | |
490 | gold_unreachable(); | |
61ba1cf9 | 491 | } |
61ba1cf9 ILT |
492 | } |
493 | ||
cc643b88 | 494 | // Write out the file header with appropriate size and endianness. |
61ba1cf9 ILT |
495 | |
496 | template<int size, bool big_endian> | |
497 | void | |
498 | Output_file_header::do_sized_write(Output_file* of) | |
499 | { | |
a3ad94ed | 500 | gold_assert(this->offset() == 0); |
61ba1cf9 ILT |
501 | |
502 | int ehdr_size = elfcpp::Elf_sizes<size>::ehdr_size; | |
503 | unsigned char* view = of->get_output_view(0, ehdr_size); | |
504 | elfcpp::Ehdr_write<size, big_endian> oehdr(view); | |
505 | ||
506 | unsigned char e_ident[elfcpp::EI_NIDENT]; | |
507 | memset(e_ident, 0, elfcpp::EI_NIDENT); | |
508 | e_ident[elfcpp::EI_MAG0] = elfcpp::ELFMAG0; | |
509 | e_ident[elfcpp::EI_MAG1] = elfcpp::ELFMAG1; | |
510 | e_ident[elfcpp::EI_MAG2] = elfcpp::ELFMAG2; | |
511 | e_ident[elfcpp::EI_MAG3] = elfcpp::ELFMAG3; | |
512 | if (size == 32) | |
513 | e_ident[elfcpp::EI_CLASS] = elfcpp::ELFCLASS32; | |
514 | else if (size == 64) | |
515 | e_ident[elfcpp::EI_CLASS] = elfcpp::ELFCLASS64; | |
516 | else | |
a3ad94ed | 517 | gold_unreachable(); |
61ba1cf9 ILT |
518 | e_ident[elfcpp::EI_DATA] = (big_endian |
519 | ? elfcpp::ELFDATA2MSB | |
520 | : elfcpp::ELFDATA2LSB); | |
521 | e_ident[elfcpp::EI_VERSION] = elfcpp::EV_CURRENT; | |
61ba1cf9 ILT |
522 | oehdr.put_e_ident(e_ident); |
523 | ||
524 | elfcpp::ET e_type; | |
8851ecca | 525 | if (parameters->options().relocatable()) |
61ba1cf9 | 526 | e_type = elfcpp::ET_REL; |
374ad285 | 527 | else if (parameters->options().output_is_position_independent()) |
436ca963 | 528 | e_type = elfcpp::ET_DYN; |
61ba1cf9 ILT |
529 | else |
530 | e_type = elfcpp::ET_EXEC; | |
531 | oehdr.put_e_type(e_type); | |
532 | ||
533 | oehdr.put_e_machine(this->target_->machine_code()); | |
534 | oehdr.put_e_version(elfcpp::EV_CURRENT); | |
535 | ||
d391083d | 536 | oehdr.put_e_entry(this->entry<size>()); |
61ba1cf9 | 537 | |
6a74a719 ILT |
538 | if (this->segment_header_ == NULL) |
539 | oehdr.put_e_phoff(0); | |
540 | else | |
541 | oehdr.put_e_phoff(this->segment_header_->offset()); | |
542 | ||
61ba1cf9 | 543 | oehdr.put_e_shoff(this->section_header_->offset()); |
d5b40221 | 544 | oehdr.put_e_flags(this->target_->processor_specific_flags()); |
61ba1cf9 | 545 | oehdr.put_e_ehsize(elfcpp::Elf_sizes<size>::ehdr_size); |
6a74a719 ILT |
546 | |
547 | if (this->segment_header_ == NULL) | |
548 | { | |
549 | oehdr.put_e_phentsize(0); | |
550 | oehdr.put_e_phnum(0); | |
551 | } | |
552 | else | |
553 | { | |
554 | oehdr.put_e_phentsize(elfcpp::Elf_sizes<size>::phdr_size); | |
5696ab0b ILT |
555 | size_t phnum = (this->segment_header_->data_size() |
556 | / elfcpp::Elf_sizes<size>::phdr_size); | |
557 | if (phnum > elfcpp::PN_XNUM) | |
558 | phnum = elfcpp::PN_XNUM; | |
559 | oehdr.put_e_phnum(phnum); | |
6a74a719 ILT |
560 | } |
561 | ||
61ba1cf9 | 562 | oehdr.put_e_shentsize(elfcpp::Elf_sizes<size>::shdr_size); |
d491d34e ILT |
563 | size_t section_count = (this->section_header_->data_size() |
564 | / elfcpp::Elf_sizes<size>::shdr_size); | |
565 | ||
566 | if (section_count < elfcpp::SHN_LORESERVE) | |
567 | oehdr.put_e_shnum(this->section_header_->data_size() | |
568 | / elfcpp::Elf_sizes<size>::shdr_size); | |
569 | else | |
570 | oehdr.put_e_shnum(0); | |
571 | ||
572 | unsigned int shstrndx = this->shstrtab_->out_shndx(); | |
573 | if (shstrndx < elfcpp::SHN_LORESERVE) | |
574 | oehdr.put_e_shstrndx(this->shstrtab_->out_shndx()); | |
575 | else | |
576 | oehdr.put_e_shstrndx(elfcpp::SHN_XINDEX); | |
61ba1cf9 | 577 | |
36959681 ILT |
578 | // Let the target adjust the ELF header, e.g., to set EI_OSABI in |
579 | // the e_ident field. | |
580 | parameters->target().adjust_elf_header(view, ehdr_size); | |
581 | ||
61ba1cf9 | 582 | of->write_output_view(0, ehdr_size, view); |
54dc6425 ILT |
583 | } |
584 | ||
a10ae760 | 585 | // Return the value to use for the entry address. |
d391083d ILT |
586 | |
587 | template<int size> | |
588 | typename elfcpp::Elf_types<size>::Elf_Addr | |
589 | Output_file_header::entry() | |
590 | { | |
a10ae760 | 591 | const bool should_issue_warning = (parameters->options().entry() != NULL |
8851ecca ILT |
592 | && !parameters->options().relocatable() |
593 | && !parameters->options().shared()); | |
a10ae760 | 594 | const char* entry = parameters->entry(); |
2ea97941 | 595 | Symbol* sym = this->symtab_->lookup(entry); |
d391083d ILT |
596 | |
597 | typename Sized_symbol<size>::Value_type v; | |
598 | if (sym != NULL) | |
599 | { | |
600 | Sized_symbol<size>* ssym; | |
601 | ssym = this->symtab_->get_sized_symbol<size>(sym); | |
602 | if (!ssym->is_defined() && should_issue_warning) | |
2ea97941 | 603 | gold_warning("entry symbol '%s' exists but is not defined", entry); |
d391083d ILT |
604 | v = ssym->value(); |
605 | } | |
606 | else | |
607 | { | |
608 | // We couldn't find the entry symbol. See if we can parse it as | |
609 | // a number. This supports, e.g., -e 0x1000. | |
610 | char* endptr; | |
2ea97941 | 611 | v = strtoull(entry, &endptr, 0); |
d391083d ILT |
612 | if (*endptr != '\0') |
613 | { | |
614 | if (should_issue_warning) | |
2ea97941 | 615 | gold_warning("cannot find entry symbol '%s'", entry); |
d391083d ILT |
616 | v = 0; |
617 | } | |
618 | } | |
619 | ||
620 | return v; | |
621 | } | |
622 | ||
20e6d0d6 DK |
623 | // Compute the current data size. |
624 | ||
625 | off_t | |
626 | Output_file_header::do_size() const | |
627 | { | |
628 | const int size = parameters->target().get_size(); | |
629 | if (size == 32) | |
630 | return elfcpp::Elf_sizes<32>::ehdr_size; | |
631 | else if (size == 64) | |
632 | return elfcpp::Elf_sizes<64>::ehdr_size; | |
633 | else | |
634 | gold_unreachable(); | |
635 | } | |
636 | ||
dbe717ef ILT |
637 | // Output_data_const methods. |
638 | ||
639 | void | |
a3ad94ed | 640 | Output_data_const::do_write(Output_file* of) |
dbe717ef | 641 | { |
a3ad94ed ILT |
642 | of->write(this->offset(), this->data_.data(), this->data_.size()); |
643 | } | |
644 | ||
645 | // Output_data_const_buffer methods. | |
646 | ||
647 | void | |
648 | Output_data_const_buffer::do_write(Output_file* of) | |
649 | { | |
650 | of->write(this->offset(), this->p_, this->data_size()); | |
dbe717ef ILT |
651 | } |
652 | ||
653 | // Output_section_data methods. | |
654 | ||
16649710 ILT |
655 | // Record the output section, and set the entry size and such. |
656 | ||
657 | void | |
658 | Output_section_data::set_output_section(Output_section* os) | |
659 | { | |
660 | gold_assert(this->output_section_ == NULL); | |
661 | this->output_section_ = os; | |
662 | this->do_adjust_output_section(os); | |
663 | } | |
664 | ||
665 | // Return the section index of the output section. | |
666 | ||
dbe717ef ILT |
667 | unsigned int |
668 | Output_section_data::do_out_shndx() const | |
669 | { | |
a3ad94ed | 670 | gold_assert(this->output_section_ != NULL); |
dbe717ef ILT |
671 | return this->output_section_->out_shndx(); |
672 | } | |
673 | ||
759b1a24 ILT |
674 | // Set the alignment, which means we may need to update the alignment |
675 | // of the output section. | |
676 | ||
677 | void | |
2ea97941 | 678 | Output_section_data::set_addralign(uint64_t addralign) |
759b1a24 | 679 | { |
2ea97941 | 680 | this->addralign_ = addralign; |
759b1a24 | 681 | if (this->output_section_ != NULL |
2ea97941 ILT |
682 | && this->output_section_->addralign() < addralign) |
683 | this->output_section_->set_addralign(addralign); | |
759b1a24 ILT |
684 | } |
685 | ||
a3ad94ed ILT |
686 | // Output_data_strtab methods. |
687 | ||
27bc2bce | 688 | // Set the final data size. |
a3ad94ed ILT |
689 | |
690 | void | |
27bc2bce | 691 | Output_data_strtab::set_final_data_size() |
a3ad94ed ILT |
692 | { |
693 | this->strtab_->set_string_offsets(); | |
694 | this->set_data_size(this->strtab_->get_strtab_size()); | |
695 | } | |
696 | ||
697 | // Write out a string table. | |
698 | ||
699 | void | |
700 | Output_data_strtab::do_write(Output_file* of) | |
701 | { | |
702 | this->strtab_->write(of, this->offset()); | |
703 | } | |
704 | ||
c06b7b0b ILT |
705 | // Output_reloc methods. |
706 | ||
7bf1f802 ILT |
707 | // A reloc against a global symbol. |
708 | ||
709 | template<bool dynamic, int size, bool big_endian> | |
710 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
711 | Symbol* gsym, | |
712 | unsigned int type, | |
713 | Output_data* od, | |
e8c846c3 | 714 | Address address, |
0da6fa6c | 715 | bool is_relative, |
13cf9988 DM |
716 | bool is_symbolless, |
717 | bool use_plt_offset) | |
7bf1f802 | 718 | : address_(address), local_sym_index_(GSYM_CODE), type_(type), |
0da6fa6c | 719 | is_relative_(is_relative), is_symbolless_(is_symbolless), |
13cf9988 | 720 | is_section_symbol_(false), use_plt_offset_(use_plt_offset), shndx_(INVALID_CODE) |
7bf1f802 | 721 | { |
dceae3c1 ILT |
722 | // this->type_ is a bitfield; make sure TYPE fits. |
723 | gold_assert(this->type_ == type); | |
7bf1f802 ILT |
724 | this->u1_.gsym = gsym; |
725 | this->u2_.od = od; | |
dceae3c1 ILT |
726 | if (dynamic) |
727 | this->set_needs_dynsym_index(); | |
7bf1f802 ILT |
728 | } |
729 | ||
730 | template<bool dynamic, int size, bool big_endian> | |
731 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
732 | Symbol* gsym, | |
733 | unsigned int type, | |
ef9beddf | 734 | Sized_relobj<size, big_endian>* relobj, |
7bf1f802 | 735 | unsigned int shndx, |
e8c846c3 | 736 | Address address, |
0da6fa6c | 737 | bool is_relative, |
13cf9988 DM |
738 | bool is_symbolless, |
739 | bool use_plt_offset) | |
7bf1f802 | 740 | : address_(address), local_sym_index_(GSYM_CODE), type_(type), |
0da6fa6c | 741 | is_relative_(is_relative), is_symbolless_(is_symbolless), |
13cf9988 | 742 | is_section_symbol_(false), use_plt_offset_(use_plt_offset), shndx_(shndx) |
7bf1f802 ILT |
743 | { |
744 | gold_assert(shndx != INVALID_CODE); | |
dceae3c1 ILT |
745 | // this->type_ is a bitfield; make sure TYPE fits. |
746 | gold_assert(this->type_ == type); | |
7bf1f802 ILT |
747 | this->u1_.gsym = gsym; |
748 | this->u2_.relobj = relobj; | |
dceae3c1 ILT |
749 | if (dynamic) |
750 | this->set_needs_dynsym_index(); | |
7bf1f802 ILT |
751 | } |
752 | ||
753 | // A reloc against a local symbol. | |
754 | ||
755 | template<bool dynamic, int size, bool big_endian> | |
756 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
757 | Sized_relobj<size, big_endian>* relobj, | |
758 | unsigned int local_sym_index, | |
759 | unsigned int type, | |
760 | Output_data* od, | |
e8c846c3 | 761 | Address address, |
2ea97941 | 762 | bool is_relative, |
0da6fa6c | 763 | bool is_symbolless, |
397b129b CC |
764 | bool is_section_symbol, |
765 | bool use_plt_offset) | |
7bf1f802 | 766 | : address_(address), local_sym_index_(local_sym_index), type_(type), |
0da6fa6c | 767 | is_relative_(is_relative), is_symbolless_(is_symbolless), |
397b129b CC |
768 | is_section_symbol_(is_section_symbol), use_plt_offset_(use_plt_offset), |
769 | shndx_(INVALID_CODE) | |
7bf1f802 ILT |
770 | { |
771 | gold_assert(local_sym_index != GSYM_CODE | |
772 | && local_sym_index != INVALID_CODE); | |
dceae3c1 ILT |
773 | // this->type_ is a bitfield; make sure TYPE fits. |
774 | gold_assert(this->type_ == type); | |
7bf1f802 ILT |
775 | this->u1_.relobj = relobj; |
776 | this->u2_.od = od; | |
dceae3c1 ILT |
777 | if (dynamic) |
778 | this->set_needs_dynsym_index(); | |
7bf1f802 ILT |
779 | } |
780 | ||
781 | template<bool dynamic, int size, bool big_endian> | |
782 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
783 | Sized_relobj<size, big_endian>* relobj, | |
784 | unsigned int local_sym_index, | |
785 | unsigned int type, | |
786 | unsigned int shndx, | |
e8c846c3 | 787 | Address address, |
2ea97941 | 788 | bool is_relative, |
0da6fa6c | 789 | bool is_symbolless, |
397b129b CC |
790 | bool is_section_symbol, |
791 | bool use_plt_offset) | |
7bf1f802 | 792 | : address_(address), local_sym_index_(local_sym_index), type_(type), |
0da6fa6c | 793 | is_relative_(is_relative), is_symbolless_(is_symbolless), |
397b129b CC |
794 | is_section_symbol_(is_section_symbol), use_plt_offset_(use_plt_offset), |
795 | shndx_(shndx) | |
7bf1f802 ILT |
796 | { |
797 | gold_assert(local_sym_index != GSYM_CODE | |
798 | && local_sym_index != INVALID_CODE); | |
799 | gold_assert(shndx != INVALID_CODE); | |
dceae3c1 ILT |
800 | // this->type_ is a bitfield; make sure TYPE fits. |
801 | gold_assert(this->type_ == type); | |
7bf1f802 ILT |
802 | this->u1_.relobj = relobj; |
803 | this->u2_.relobj = relobj; | |
dceae3c1 ILT |
804 | if (dynamic) |
805 | this->set_needs_dynsym_index(); | |
7bf1f802 ILT |
806 | } |
807 | ||
808 | // A reloc against the STT_SECTION symbol of an output section. | |
809 | ||
810 | template<bool dynamic, int size, bool big_endian> | |
811 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
812 | Output_section* os, | |
813 | unsigned int type, | |
814 | Output_data* od, | |
703d02da AM |
815 | Address address, |
816 | bool is_relative) | |
7bf1f802 | 817 | : address_(address), local_sym_index_(SECTION_CODE), type_(type), |
703d02da | 818 | is_relative_(is_relative), is_symbolless_(is_relative), |
397b129b | 819 | is_section_symbol_(true), use_plt_offset_(false), shndx_(INVALID_CODE) |
7bf1f802 | 820 | { |
dceae3c1 ILT |
821 | // this->type_ is a bitfield; make sure TYPE fits. |
822 | gold_assert(this->type_ == type); | |
7bf1f802 ILT |
823 | this->u1_.os = os; |
824 | this->u2_.od = od; | |
825 | if (dynamic) | |
dceae3c1 ILT |
826 | this->set_needs_dynsym_index(); |
827 | else | |
828 | os->set_needs_symtab_index(); | |
7bf1f802 ILT |
829 | } |
830 | ||
831 | template<bool dynamic, int size, bool big_endian> | |
832 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
833 | Output_section* os, | |
834 | unsigned int type, | |
ef9beddf | 835 | Sized_relobj<size, big_endian>* relobj, |
7bf1f802 | 836 | unsigned int shndx, |
703d02da AM |
837 | Address address, |
838 | bool is_relative) | |
7bf1f802 | 839 | : address_(address), local_sym_index_(SECTION_CODE), type_(type), |
703d02da | 840 | is_relative_(is_relative), is_symbolless_(is_relative), |
397b129b | 841 | is_section_symbol_(true), use_plt_offset_(false), shndx_(shndx) |
7bf1f802 ILT |
842 | { |
843 | gold_assert(shndx != INVALID_CODE); | |
dceae3c1 ILT |
844 | // this->type_ is a bitfield; make sure TYPE fits. |
845 | gold_assert(this->type_ == type); | |
7bf1f802 ILT |
846 | this->u1_.os = os; |
847 | this->u2_.relobj = relobj; | |
848 | if (dynamic) | |
dceae3c1 ILT |
849 | this->set_needs_dynsym_index(); |
850 | else | |
851 | os->set_needs_symtab_index(); | |
852 | } | |
853 | ||
ec661b9d | 854 | // An absolute or relative relocation. |
e291e7b9 ILT |
855 | |
856 | template<bool dynamic, int size, bool big_endian> | |
857 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
858 | unsigned int type, | |
859 | Output_data* od, | |
ec661b9d AM |
860 | Address address, |
861 | bool is_relative) | |
e291e7b9 | 862 | : address_(address), local_sym_index_(0), type_(type), |
ec661b9d | 863 | is_relative_(is_relative), is_symbolless_(false), |
397b129b | 864 | is_section_symbol_(false), use_plt_offset_(false), shndx_(INVALID_CODE) |
e291e7b9 ILT |
865 | { |
866 | // this->type_ is a bitfield; make sure TYPE fits. | |
867 | gold_assert(this->type_ == type); | |
868 | this->u1_.relobj = NULL; | |
869 | this->u2_.od = od; | |
870 | } | |
871 | ||
872 | template<bool dynamic, int size, bool big_endian> | |
873 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
874 | unsigned int type, | |
875 | Sized_relobj<size, big_endian>* relobj, | |
876 | unsigned int shndx, | |
ec661b9d AM |
877 | Address address, |
878 | bool is_relative) | |
e291e7b9 | 879 | : address_(address), local_sym_index_(0), type_(type), |
ec661b9d | 880 | is_relative_(is_relative), is_symbolless_(false), |
397b129b | 881 | is_section_symbol_(false), use_plt_offset_(false), shndx_(shndx) |
e291e7b9 ILT |
882 | { |
883 | gold_assert(shndx != INVALID_CODE); | |
884 | // this->type_ is a bitfield; make sure TYPE fits. | |
885 | gold_assert(this->type_ == type); | |
886 | this->u1_.relobj = NULL; | |
887 | this->u2_.relobj = relobj; | |
888 | } | |
889 | ||
890 | // A target specific relocation. | |
891 | ||
892 | template<bool dynamic, int size, bool big_endian> | |
893 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
894 | unsigned int type, | |
895 | void* arg, | |
896 | Output_data* od, | |
897 | Address address) | |
898 | : address_(address), local_sym_index_(TARGET_CODE), type_(type), | |
0da6fa6c | 899 | is_relative_(false), is_symbolless_(false), |
397b129b | 900 | is_section_symbol_(false), use_plt_offset_(false), shndx_(INVALID_CODE) |
e291e7b9 ILT |
901 | { |
902 | // this->type_ is a bitfield; make sure TYPE fits. | |
903 | gold_assert(this->type_ == type); | |
904 | this->u1_.arg = arg; | |
905 | this->u2_.od = od; | |
906 | } | |
907 | ||
908 | template<bool dynamic, int size, bool big_endian> | |
909 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc( | |
910 | unsigned int type, | |
911 | void* arg, | |
912 | Sized_relobj<size, big_endian>* relobj, | |
913 | unsigned int shndx, | |
914 | Address address) | |
915 | : address_(address), local_sym_index_(TARGET_CODE), type_(type), | |
0da6fa6c | 916 | is_relative_(false), is_symbolless_(false), |
397b129b | 917 | is_section_symbol_(false), use_plt_offset_(false), shndx_(shndx) |
e291e7b9 ILT |
918 | { |
919 | gold_assert(shndx != INVALID_CODE); | |
920 | // this->type_ is a bitfield; make sure TYPE fits. | |
921 | gold_assert(this->type_ == type); | |
922 | this->u1_.arg = arg; | |
923 | this->u2_.relobj = relobj; | |
924 | } | |
925 | ||
dceae3c1 ILT |
926 | // Record that we need a dynamic symbol index for this relocation. |
927 | ||
928 | template<bool dynamic, int size, bool big_endian> | |
929 | void | |
930 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>:: | |
931 | set_needs_dynsym_index() | |
932 | { | |
0da6fa6c | 933 | if (this->is_symbolless_) |
dceae3c1 ILT |
934 | return; |
935 | switch (this->local_sym_index_) | |
936 | { | |
937 | case INVALID_CODE: | |
938 | gold_unreachable(); | |
939 | ||
940 | case GSYM_CODE: | |
941 | this->u1_.gsym->set_needs_dynsym_entry(); | |
942 | break; | |
943 | ||
944 | case SECTION_CODE: | |
945 | this->u1_.os->set_needs_dynsym_index(); | |
946 | break; | |
947 | ||
e291e7b9 ILT |
948 | case TARGET_CODE: |
949 | // The target must take care of this if necessary. | |
950 | break; | |
951 | ||
dceae3c1 ILT |
952 | case 0: |
953 | break; | |
954 | ||
955 | default: | |
956 | { | |
957 | const unsigned int lsi = this->local_sym_index_; | |
6fa2a40b CC |
958 | Sized_relobj_file<size, big_endian>* relobj = |
959 | this->u1_.relobj->sized_relobj(); | |
960 | gold_assert(relobj != NULL); | |
dceae3c1 | 961 | if (!this->is_section_symbol_) |
6fa2a40b | 962 | relobj->set_needs_output_dynsym_entry(lsi); |
dceae3c1 | 963 | else |
6fa2a40b | 964 | relobj->output_section(lsi)->set_needs_dynsym_index(); |
dceae3c1 ILT |
965 | } |
966 | break; | |
967 | } | |
7bf1f802 ILT |
968 | } |
969 | ||
c06b7b0b ILT |
970 | // Get the symbol index of a relocation. |
971 | ||
972 | template<bool dynamic, int size, bool big_endian> | |
973 | unsigned int | |
974 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::get_symbol_index() | |
975 | const | |
976 | { | |
977 | unsigned int index; | |
0da6fa6c DM |
978 | if (this->is_symbolless_) |
979 | return 0; | |
c06b7b0b ILT |
980 | switch (this->local_sym_index_) |
981 | { | |
982 | case INVALID_CODE: | |
a3ad94ed | 983 | gold_unreachable(); |
c06b7b0b ILT |
984 | |
985 | case GSYM_CODE: | |
5a6f7e2d | 986 | if (this->u1_.gsym == NULL) |
c06b7b0b ILT |
987 | index = 0; |
988 | else if (dynamic) | |
5a6f7e2d | 989 | index = this->u1_.gsym->dynsym_index(); |
c06b7b0b | 990 | else |
5a6f7e2d | 991 | index = this->u1_.gsym->symtab_index(); |
c06b7b0b ILT |
992 | break; |
993 | ||
994 | case SECTION_CODE: | |
995 | if (dynamic) | |
5a6f7e2d | 996 | index = this->u1_.os->dynsym_index(); |
c06b7b0b | 997 | else |
5a6f7e2d | 998 | index = this->u1_.os->symtab_index(); |
c06b7b0b ILT |
999 | break; |
1000 | ||
e291e7b9 ILT |
1001 | case TARGET_CODE: |
1002 | index = parameters->target().reloc_symbol_index(this->u1_.arg, | |
1003 | this->type_); | |
1004 | break; | |
1005 | ||
436ca963 ILT |
1006 | case 0: |
1007 | // Relocations without symbols use a symbol index of 0. | |
1008 | index = 0; | |
1009 | break; | |
1010 | ||
c06b7b0b | 1011 | default: |
dceae3c1 ILT |
1012 | { |
1013 | const unsigned int lsi = this->local_sym_index_; | |
6fa2a40b CC |
1014 | Sized_relobj_file<size, big_endian>* relobj = |
1015 | this->u1_.relobj->sized_relobj(); | |
1016 | gold_assert(relobj != NULL); | |
dceae3c1 ILT |
1017 | if (!this->is_section_symbol_) |
1018 | { | |
1019 | if (dynamic) | |
6fa2a40b | 1020 | index = relobj->dynsym_index(lsi); |
dceae3c1 | 1021 | else |
6fa2a40b | 1022 | index = relobj->symtab_index(lsi); |
dceae3c1 ILT |
1023 | } |
1024 | else | |
1025 | { | |
6fa2a40b | 1026 | Output_section* os = relobj->output_section(lsi); |
dceae3c1 ILT |
1027 | gold_assert(os != NULL); |
1028 | if (dynamic) | |
1029 | index = os->dynsym_index(); | |
1030 | else | |
1031 | index = os->symtab_index(); | |
1032 | } | |
1033 | } | |
c06b7b0b ILT |
1034 | break; |
1035 | } | |
a3ad94ed | 1036 | gold_assert(index != -1U); |
c06b7b0b ILT |
1037 | return index; |
1038 | } | |
1039 | ||
624f8810 ILT |
1040 | // For a local section symbol, get the address of the offset ADDEND |
1041 | // within the input section. | |
dceae3c1 ILT |
1042 | |
1043 | template<bool dynamic, int size, bool big_endian> | |
ef9beddf | 1044 | typename elfcpp::Elf_types<size>::Elf_Addr |
dceae3c1 | 1045 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>:: |
624f8810 | 1046 | local_section_offset(Addend addend) const |
dceae3c1 | 1047 | { |
624f8810 ILT |
1048 | gold_assert(this->local_sym_index_ != GSYM_CODE |
1049 | && this->local_sym_index_ != SECTION_CODE | |
e291e7b9 | 1050 | && this->local_sym_index_ != TARGET_CODE |
624f8810 | 1051 | && this->local_sym_index_ != INVALID_CODE |
e291e7b9 | 1052 | && this->local_sym_index_ != 0 |
624f8810 | 1053 | && this->is_section_symbol_); |
dceae3c1 | 1054 | const unsigned int lsi = this->local_sym_index_; |
ef9beddf | 1055 | Output_section* os = this->u1_.relobj->output_section(lsi); |
624f8810 | 1056 | gold_assert(os != NULL); |
ef9beddf | 1057 | Address offset = this->u1_.relobj->get_output_section_offset(lsi); |
eff45813 | 1058 | if (offset != invalid_address) |
624f8810 ILT |
1059 | return offset + addend; |
1060 | // This is a merge section. | |
6fa2a40b CC |
1061 | Sized_relobj_file<size, big_endian>* relobj = |
1062 | this->u1_.relobj->sized_relobj(); | |
1063 | gold_assert(relobj != NULL); | |
1064 | offset = os->output_address(relobj, lsi, addend); | |
eff45813 | 1065 | gold_assert(offset != invalid_address); |
dceae3c1 ILT |
1066 | return offset; |
1067 | } | |
1068 | ||
d98bc257 | 1069 | // Get the output address of a relocation. |
c06b7b0b ILT |
1070 | |
1071 | template<bool dynamic, int size, bool big_endian> | |
a984ee1d | 1072 | typename elfcpp::Elf_types<size>::Elf_Addr |
d98bc257 | 1073 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::get_address() const |
c06b7b0b | 1074 | { |
a3ad94ed | 1075 | Address address = this->address_; |
5a6f7e2d ILT |
1076 | if (this->shndx_ != INVALID_CODE) |
1077 | { | |
ef9beddf | 1078 | Output_section* os = this->u2_.relobj->output_section(this->shndx_); |
5a6f7e2d | 1079 | gold_assert(os != NULL); |
ef9beddf | 1080 | Address off = this->u2_.relobj->get_output_section_offset(this->shndx_); |
eff45813 | 1081 | if (off != invalid_address) |
730cdc88 ILT |
1082 | address += os->address() + off; |
1083 | else | |
1084 | { | |
6fa2a40b CC |
1085 | Sized_relobj_file<size, big_endian>* relobj = |
1086 | this->u2_.relobj->sized_relobj(); | |
1087 | gold_assert(relobj != NULL); | |
1088 | address = os->output_address(relobj, this->shndx_, address); | |
eff45813 | 1089 | gold_assert(address != invalid_address); |
730cdc88 | 1090 | } |
5a6f7e2d ILT |
1091 | } |
1092 | else if (this->u2_.od != NULL) | |
1093 | address += this->u2_.od->address(); | |
d98bc257 ILT |
1094 | return address; |
1095 | } | |
1096 | ||
1097 | // Write out the offset and info fields of a Rel or Rela relocation | |
1098 | // entry. | |
1099 | ||
1100 | template<bool dynamic, int size, bool big_endian> | |
1101 | template<typename Write_rel> | |
1102 | void | |
1103 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::write_rel( | |
1104 | Write_rel* wr) const | |
1105 | { | |
1106 | wr->put_r_offset(this->get_address()); | |
0da6fa6c | 1107 | unsigned int sym_index = this->get_symbol_index(); |
e8c846c3 | 1108 | wr->put_r_info(elfcpp::elf_r_info<size>(sym_index, this->type_)); |
c06b7b0b ILT |
1109 | } |
1110 | ||
1111 | // Write out a Rel relocation. | |
1112 | ||
1113 | template<bool dynamic, int size, bool big_endian> | |
1114 | void | |
1115 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::write( | |
1116 | unsigned char* pov) const | |
1117 | { | |
1118 | elfcpp::Rel_write<size, big_endian> orel(pov); | |
1119 | this->write_rel(&orel); | |
1120 | } | |
1121 | ||
e8c846c3 ILT |
1122 | // Get the value of the symbol referred to by a Rel relocation. |
1123 | ||
1124 | template<bool dynamic, int size, bool big_endian> | |
1125 | typename elfcpp::Elf_types<size>::Elf_Addr | |
d1f003c6 | 1126 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::symbol_value( |
624f8810 | 1127 | Addend addend) const |
e8c846c3 ILT |
1128 | { |
1129 | if (this->local_sym_index_ == GSYM_CODE) | |
1130 | { | |
1131 | const Sized_symbol<size>* sym; | |
1132 | sym = static_cast<const Sized_symbol<size>*>(this->u1_.gsym); | |
13cf9988 | 1133 | if (this->use_plt_offset_ && sym->has_plt_offset()) |
19fec8c1 | 1134 | return parameters->target().plt_address_for_global(sym); |
13cf9988 DM |
1135 | else |
1136 | return sym->value() + addend; | |
e8c846c3 | 1137 | } |
703d02da AM |
1138 | if (this->local_sym_index_ == SECTION_CODE) |
1139 | { | |
1140 | gold_assert(!this->use_plt_offset_); | |
1141 | return this->u1_.os->address() + addend; | |
1142 | } | |
1143 | gold_assert(this->local_sym_index_ != TARGET_CODE | |
d1f003c6 | 1144 | && this->local_sym_index_ != INVALID_CODE |
e291e7b9 | 1145 | && this->local_sym_index_ != 0 |
d1f003c6 ILT |
1146 | && !this->is_section_symbol_); |
1147 | const unsigned int lsi = this->local_sym_index_; | |
6fa2a40b CC |
1148 | Sized_relobj_file<size, big_endian>* relobj = |
1149 | this->u1_.relobj->sized_relobj(); | |
1150 | gold_assert(relobj != NULL); | |
397b129b | 1151 | if (this->use_plt_offset_) |
19fec8c1 | 1152 | return parameters->target().plt_address_for_local(relobj, lsi); |
6fa2a40b CC |
1153 | const Symbol_value<size>* symval = relobj->local_symbol(lsi); |
1154 | return symval->value(relobj, addend); | |
e8c846c3 ILT |
1155 | } |
1156 | ||
d98bc257 ILT |
1157 | // Reloc comparison. This function sorts the dynamic relocs for the |
1158 | // benefit of the dynamic linker. First we sort all relative relocs | |
1159 | // to the front. Among relative relocs, we sort by output address. | |
1160 | // Among non-relative relocs, we sort by symbol index, then by output | |
1161 | // address. | |
1162 | ||
1163 | template<bool dynamic, int size, bool big_endian> | |
1164 | int | |
1165 | Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>:: | |
1166 | compare(const Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>& r2) | |
1167 | const | |
1168 | { | |
1169 | if (this->is_relative_) | |
1170 | { | |
1171 | if (!r2.is_relative_) | |
1172 | return -1; | |
1173 | // Otherwise sort by reloc address below. | |
1174 | } | |
1175 | else if (r2.is_relative_) | |
1176 | return 1; | |
1177 | else | |
1178 | { | |
1179 | unsigned int sym1 = this->get_symbol_index(); | |
1180 | unsigned int sym2 = r2.get_symbol_index(); | |
1181 | if (sym1 < sym2) | |
1182 | return -1; | |
1183 | else if (sym1 > sym2) | |
1184 | return 1; | |
1185 | // Otherwise sort by reloc address. | |
1186 | } | |
1187 | ||
1188 | section_offset_type addr1 = this->get_address(); | |
1189 | section_offset_type addr2 = r2.get_address(); | |
1190 | if (addr1 < addr2) | |
1191 | return -1; | |
1192 | else if (addr1 > addr2) | |
1193 | return 1; | |
1194 | ||
1195 | // Final tie breaker, in order to generate the same output on any | |
1196 | // host: reloc type. | |
1197 | unsigned int type1 = this->type_; | |
1198 | unsigned int type2 = r2.type_; | |
1199 | if (type1 < type2) | |
1200 | return -1; | |
1201 | else if (type1 > type2) | |
1202 | return 1; | |
1203 | ||
1204 | // These relocs appear to be exactly the same. | |
1205 | return 0; | |
1206 | } | |
1207 | ||
c06b7b0b ILT |
1208 | // Write out a Rela relocation. |
1209 | ||
1210 | template<bool dynamic, int size, bool big_endian> | |
1211 | void | |
1212 | Output_reloc<elfcpp::SHT_RELA, dynamic, size, big_endian>::write( | |
1213 | unsigned char* pov) const | |
1214 | { | |
1215 | elfcpp::Rela_write<size, big_endian> orel(pov); | |
1216 | this->rel_.write_rel(&orel); | |
e8c846c3 | 1217 | Addend addend = this->addend_; |
e291e7b9 ILT |
1218 | if (this->rel_.is_target_specific()) |
1219 | addend = parameters->target().reloc_addend(this->rel_.target_arg(), | |
1220 | this->rel_.type(), addend); | |
0da6fa6c | 1221 | else if (this->rel_.is_symbolless()) |
d1f003c6 ILT |
1222 | addend = this->rel_.symbol_value(addend); |
1223 | else if (this->rel_.is_local_section_symbol()) | |
624f8810 | 1224 | addend = this->rel_.local_section_offset(addend); |
e8c846c3 | 1225 | orel.put_r_addend(addend); |
c06b7b0b ILT |
1226 | } |
1227 | ||
1228 | // Output_data_reloc_base methods. | |
1229 | ||
16649710 ILT |
1230 | // Adjust the output section. |
1231 | ||
1232 | template<int sh_type, bool dynamic, int size, bool big_endian> | |
1233 | void | |
1234 | Output_data_reloc_base<sh_type, dynamic, size, big_endian> | |
1235 | ::do_adjust_output_section(Output_section* os) | |
1236 | { | |
1237 | if (sh_type == elfcpp::SHT_REL) | |
1238 | os->set_entsize(elfcpp::Elf_sizes<size>::rel_size); | |
1239 | else if (sh_type == elfcpp::SHT_RELA) | |
1240 | os->set_entsize(elfcpp::Elf_sizes<size>::rela_size); | |
1241 | else | |
1242 | gold_unreachable(); | |
7223e9ca ILT |
1243 | |
1244 | // A STT_GNU_IFUNC symbol may require a IRELATIVE reloc when doing a | |
1245 | // static link. The backends will generate a dynamic reloc section | |
1246 | // to hold this. In that case we don't want to link to the dynsym | |
1247 | // section, because there isn't one. | |
1248 | if (!dynamic) | |
16649710 | 1249 | os->set_should_link_to_symtab(); |
7223e9ca ILT |
1250 | else if (parameters->doing_static_link()) |
1251 | ; | |
1252 | else | |
1253 | os->set_should_link_to_dynsym(); | |
16649710 ILT |
1254 | } |
1255 | ||
c06b7b0b ILT |
1256 | // Write out relocation data. |
1257 | ||
1258 | template<int sh_type, bool dynamic, int size, bool big_endian> | |
1259 | void | |
1260 | Output_data_reloc_base<sh_type, dynamic, size, big_endian>::do_write( | |
1261 | Output_file* of) | |
1262 | { | |
1263 | const off_t off = this->offset(); | |
1264 | const off_t oview_size = this->data_size(); | |
1265 | unsigned char* const oview = of->get_output_view(off, oview_size); | |
1266 | ||
3a44184e | 1267 | if (this->sort_relocs()) |
d98bc257 ILT |
1268 | { |
1269 | gold_assert(dynamic); | |
1270 | std::sort(this->relocs_.begin(), this->relocs_.end(), | |
1271 | Sort_relocs_comparison()); | |
1272 | } | |
1273 | ||
c06b7b0b ILT |
1274 | unsigned char* pov = oview; |
1275 | for (typename Relocs::const_iterator p = this->relocs_.begin(); | |
1276 | p != this->relocs_.end(); | |
1277 | ++p) | |
1278 | { | |
1279 | p->write(pov); | |
1280 | pov += reloc_size; | |
1281 | } | |
1282 | ||
a3ad94ed | 1283 | gold_assert(pov - oview == oview_size); |
c06b7b0b ILT |
1284 | |
1285 | of->write_output_view(off, oview_size, oview); | |
1286 | ||
1287 | // We no longer need the relocation entries. | |
1288 | this->relocs_.clear(); | |
1289 | } | |
1290 | ||
6a74a719 ILT |
1291 | // Class Output_relocatable_relocs. |
1292 | ||
1293 | template<int sh_type, int size, bool big_endian> | |
1294 | void | |
1295 | Output_relocatable_relocs<sh_type, size, big_endian>::set_final_data_size() | |
1296 | { | |
1297 | this->set_data_size(this->rr_->output_reloc_count() | |
1298 | * Reloc_types<sh_type, size, big_endian>::reloc_size); | |
1299 | } | |
1300 | ||
1301 | // class Output_data_group. | |
1302 | ||
1303 | template<int size, bool big_endian> | |
1304 | Output_data_group<size, big_endian>::Output_data_group( | |
6fa2a40b | 1305 | Sized_relobj_file<size, big_endian>* relobj, |
6a74a719 | 1306 | section_size_type entry_count, |
8825ac63 ILT |
1307 | elfcpp::Elf_Word flags, |
1308 | std::vector<unsigned int>* input_shndxes) | |
20e6d0d6 | 1309 | : Output_section_data(entry_count * 4, 4, false), |
8825ac63 ILT |
1310 | relobj_(relobj), |
1311 | flags_(flags) | |
6a74a719 | 1312 | { |
8825ac63 | 1313 | this->input_shndxes_.swap(*input_shndxes); |
6a74a719 ILT |
1314 | } |
1315 | ||
1316 | // Write out the section group, which means translating the section | |
1317 | // indexes to apply to the output file. | |
1318 | ||
1319 | template<int size, bool big_endian> | |
1320 | void | |
1321 | Output_data_group<size, big_endian>::do_write(Output_file* of) | |
1322 | { | |
1323 | const off_t off = this->offset(); | |
1324 | const section_size_type oview_size = | |
1325 | convert_to_section_size_type(this->data_size()); | |
1326 | unsigned char* const oview = of->get_output_view(off, oview_size); | |
1327 | ||
1328 | elfcpp::Elf_Word* contents = reinterpret_cast<elfcpp::Elf_Word*>(oview); | |
1329 | elfcpp::Swap<32, big_endian>::writeval(contents, this->flags_); | |
1330 | ++contents; | |
1331 | ||
1332 | for (std::vector<unsigned int>::const_iterator p = | |
8825ac63 ILT |
1333 | this->input_shndxes_.begin(); |
1334 | p != this->input_shndxes_.end(); | |
6a74a719 ILT |
1335 | ++p, ++contents) |
1336 | { | |
ef9beddf | 1337 | Output_section* os = this->relobj_->output_section(*p); |
6a74a719 ILT |
1338 | |
1339 | unsigned int output_shndx; | |
1340 | if (os != NULL) | |
1341 | output_shndx = os->out_shndx(); | |
1342 | else | |
1343 | { | |
1344 | this->relobj_->error(_("section group retained but " | |
1345 | "group element discarded")); | |
1346 | output_shndx = 0; | |
1347 | } | |
1348 | ||
1349 | elfcpp::Swap<32, big_endian>::writeval(contents, output_shndx); | |
1350 | } | |
1351 | ||
1352 | size_t wrote = reinterpret_cast<unsigned char*>(contents) - oview; | |
1353 | gold_assert(wrote == oview_size); | |
1354 | ||
1355 | of->write_output_view(off, oview_size, oview); | |
1356 | ||
1357 | // We no longer need this information. | |
8825ac63 | 1358 | this->input_shndxes_.clear(); |
6a74a719 ILT |
1359 | } |
1360 | ||
dbe717ef | 1361 | // Output_data_got::Got_entry methods. |
ead1e424 ILT |
1362 | |
1363 | // Write out the entry. | |
1364 | ||
d77a0555 | 1365 | template<int got_size, bool big_endian> |
ead1e424 | 1366 | void |
d77a0555 | 1367 | Output_data_got<got_size, big_endian>::Got_entry::write( |
bd73a62d AM |
1368 | unsigned int got_indx, |
1369 | unsigned char* pov) const | |
ead1e424 ILT |
1370 | { |
1371 | Valtype val = 0; | |
1372 | ||
1373 | switch (this->local_sym_index_) | |
1374 | { | |
1375 | case GSYM_CODE: | |
1376 | { | |
e8c846c3 ILT |
1377 | // If the symbol is resolved locally, we need to write out the |
1378 | // link-time value, which will be relocated dynamically by a | |
1379 | // RELATIVE relocation. | |
ead1e424 | 1380 | Symbol* gsym = this->u_.gsym; |
bd73a62d | 1381 | if (this->use_plt_or_tls_offset_ && gsym->has_plt_offset()) |
19fec8c1 | 1382 | val = parameters->target().plt_address_for_global(gsym); |
7223e9ca ILT |
1383 | else |
1384 | { | |
d77a0555 ILT |
1385 | switch (parameters->size_and_endianness()) |
1386 | { | |
1387 | #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG) | |
1388 | case Parameters::TARGET_32_LITTLE: | |
1389 | case Parameters::TARGET_32_BIG: | |
1390 | { | |
1391 | // This cast is ugly. We don't want to put a | |
1392 | // virtual method in Symbol, because we want Symbol | |
1393 | // to be as small as possible. | |
1394 | Sized_symbol<32>::Value_type v; | |
1395 | v = static_cast<Sized_symbol<32>*>(gsym)->value(); | |
1396 | val = convert_types<Valtype, Sized_symbol<32>::Value_type>(v); | |
1397 | } | |
1398 | break; | |
1399 | #endif | |
1400 | #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG) | |
1401 | case Parameters::TARGET_64_LITTLE: | |
1402 | case Parameters::TARGET_64_BIG: | |
1403 | { | |
1404 | Sized_symbol<64>::Value_type v; | |
1405 | v = static_cast<Sized_symbol<64>*>(gsym)->value(); | |
1406 | val = convert_types<Valtype, Sized_symbol<64>::Value_type>(v); | |
1407 | } | |
1408 | break; | |
1409 | #endif | |
1410 | default: | |
1411 | gold_unreachable(); | |
1412 | } | |
1413 | if (this->use_plt_or_tls_offset_ | |
1414 | && gsym->type() == elfcpp::STT_TLS) | |
bd73a62d AM |
1415 | val += parameters->target().tls_offset_for_global(gsym, |
1416 | got_indx); | |
7223e9ca | 1417 | } |
ead1e424 ILT |
1418 | } |
1419 | break; | |
1420 | ||
1421 | case CONSTANT_CODE: | |
1422 | val = this->u_.constant; | |
1423 | break; | |
1424 | ||
4829d394 CC |
1425 | case RESERVED_CODE: |
1426 | // If we're doing an incremental update, don't touch this GOT entry. | |
1427 | if (parameters->incremental_update()) | |
1428 | return; | |
1429 | val = this->u_.constant; | |
1430 | break; | |
1431 | ||
ead1e424 | 1432 | default: |
d1f003c6 | 1433 | { |
d77a0555 | 1434 | const Relobj* object = this->u_.object; |
d1f003c6 | 1435 | const unsigned int lsi = this->local_sym_index_; |
d77a0555 | 1436 | bool is_tls = object->local_is_tls(lsi); |
bd73a62d | 1437 | if (this->use_plt_or_tls_offset_ && !is_tls) |
19fec8c1 | 1438 | val = parameters->target().plt_address_for_local(object, lsi); |
bd73a62d AM |
1439 | else |
1440 | { | |
1441 | uint64_t lval = object->local_symbol_value(lsi, 0); | |
1442 | val = convert_types<Valtype, uint64_t>(lval); | |
1443 | if (this->use_plt_or_tls_offset_ && is_tls) | |
1444 | val += parameters->target().tls_offset_for_local(object, lsi, | |
1445 | got_indx); | |
1446 | } | |
d1f003c6 | 1447 | } |
e727fa71 | 1448 | break; |
ead1e424 ILT |
1449 | } |
1450 | ||
d77a0555 | 1451 | elfcpp::Swap<got_size, big_endian>::writeval(pov, val); |
ead1e424 ILT |
1452 | } |
1453 | ||
dbe717ef | 1454 | // Output_data_got methods. |
ead1e424 | 1455 | |
dbe717ef ILT |
1456 | // Add an entry for a global symbol to the GOT. This returns true if |
1457 | // this is a new GOT entry, false if the symbol already had a GOT | |
1458 | // entry. | |
1459 | ||
d77a0555 | 1460 | template<int got_size, bool big_endian> |
dbe717ef | 1461 | bool |
d77a0555 | 1462 | Output_data_got<got_size, big_endian>::add_global( |
0a65a3a7 CC |
1463 | Symbol* gsym, |
1464 | unsigned int got_type) | |
ead1e424 | 1465 | { |
0a65a3a7 | 1466 | if (gsym->has_got_offset(got_type)) |
dbe717ef | 1467 | return false; |
ead1e424 | 1468 | |
4829d394 CC |
1469 | unsigned int got_offset = this->add_got_entry(Got_entry(gsym, false)); |
1470 | gsym->set_got_offset(got_type, got_offset); | |
7223e9ca ILT |
1471 | return true; |
1472 | } | |
1473 | ||
1474 | // Like add_global, but use the PLT offset. | |
1475 | ||
d77a0555 | 1476 | template<int got_size, bool big_endian> |
7223e9ca | 1477 | bool |
d77a0555 ILT |
1478 | Output_data_got<got_size, big_endian>::add_global_plt(Symbol* gsym, |
1479 | unsigned int got_type) | |
7223e9ca ILT |
1480 | { |
1481 | if (gsym->has_got_offset(got_type)) | |
1482 | return false; | |
1483 | ||
4829d394 CC |
1484 | unsigned int got_offset = this->add_got_entry(Got_entry(gsym, true)); |
1485 | gsym->set_got_offset(got_type, got_offset); | |
dbe717ef ILT |
1486 | return true; |
1487 | } | |
ead1e424 | 1488 | |
7bf1f802 ILT |
1489 | // Add an entry for a global symbol to the GOT, and add a dynamic |
1490 | // relocation of type R_TYPE for the GOT entry. | |
7223e9ca | 1491 | |
d77a0555 | 1492 | template<int got_size, bool big_endian> |
7bf1f802 | 1493 | void |
d77a0555 | 1494 | Output_data_got<got_size, big_endian>::add_global_with_rel( |
7bf1f802 | 1495 | Symbol* gsym, |
0a65a3a7 | 1496 | unsigned int got_type, |
83896202 | 1497 | Output_data_reloc_generic* rel_dyn, |
7bf1f802 ILT |
1498 | unsigned int r_type) |
1499 | { | |
0a65a3a7 | 1500 | if (gsym->has_got_offset(got_type)) |
7bf1f802 ILT |
1501 | return; |
1502 | ||
4829d394 | 1503 | unsigned int got_offset = this->add_got_entry(Got_entry()); |
2ea97941 | 1504 | gsym->set_got_offset(got_type, got_offset); |
83896202 | 1505 | rel_dyn->add_global_generic(gsym, r_type, this, got_offset, 0); |
7bf1f802 ILT |
1506 | } |
1507 | ||
0a65a3a7 CC |
1508 | // Add a pair of entries for a global symbol to the GOT, and add |
1509 | // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively. | |
1510 | // If R_TYPE_2 == 0, add the second entry with no relocation. | |
d77a0555 | 1511 | template<int got_size, bool big_endian> |
7bf1f802 | 1512 | void |
d77a0555 | 1513 | Output_data_got<got_size, big_endian>::add_global_pair_with_rel( |
0a65a3a7 CC |
1514 | Symbol* gsym, |
1515 | unsigned int got_type, | |
83896202 | 1516 | Output_data_reloc_generic* rel_dyn, |
0a65a3a7 CC |
1517 | unsigned int r_type_1, |
1518 | unsigned int r_type_2) | |
7bf1f802 | 1519 | { |
0a65a3a7 | 1520 | if (gsym->has_got_offset(got_type)) |
7bf1f802 ILT |
1521 | return; |
1522 | ||
4829d394 | 1523 | unsigned int got_offset = this->add_got_entry_pair(Got_entry(), Got_entry()); |
2ea97941 | 1524 | gsym->set_got_offset(got_type, got_offset); |
83896202 | 1525 | rel_dyn->add_global_generic(gsym, r_type_1, this, got_offset, 0); |
0a65a3a7 | 1526 | |
0a65a3a7 | 1527 | if (r_type_2 != 0) |
83896202 | 1528 | rel_dyn->add_global_generic(gsym, r_type_2, this, |
d77a0555 | 1529 | got_offset + got_size / 8, 0); |
7bf1f802 ILT |
1530 | } |
1531 | ||
0a65a3a7 CC |
1532 | // Add an entry for a local symbol to the GOT. This returns true if |
1533 | // this is a new GOT entry, false if the symbol already has a GOT | |
1534 | // entry. | |
07f397ab | 1535 | |
d77a0555 | 1536 | template<int got_size, bool big_endian> |
07f397ab | 1537 | bool |
d77a0555 | 1538 | Output_data_got<got_size, big_endian>::add_local( |
83896202 | 1539 | Relobj* object, |
0a65a3a7 CC |
1540 | unsigned int symndx, |
1541 | unsigned int got_type) | |
07f397ab | 1542 | { |
0a65a3a7 | 1543 | if (object->local_has_got_offset(symndx, got_type)) |
07f397ab ILT |
1544 | return false; |
1545 | ||
4829d394 CC |
1546 | unsigned int got_offset = this->add_got_entry(Got_entry(object, symndx, |
1547 | false)); | |
1548 | object->set_local_got_offset(symndx, got_type, got_offset); | |
7223e9ca ILT |
1549 | return true; |
1550 | } | |
1551 | ||
1552 | // Like add_local, but use the PLT offset. | |
1553 | ||
d77a0555 | 1554 | template<int got_size, bool big_endian> |
7223e9ca | 1555 | bool |
d77a0555 | 1556 | Output_data_got<got_size, big_endian>::add_local_plt( |
83896202 | 1557 | Relobj* object, |
7223e9ca ILT |
1558 | unsigned int symndx, |
1559 | unsigned int got_type) | |
1560 | { | |
1561 | if (object->local_has_got_offset(symndx, got_type)) | |
1562 | return false; | |
1563 | ||
4829d394 CC |
1564 | unsigned int got_offset = this->add_got_entry(Got_entry(object, symndx, |
1565 | true)); | |
1566 | object->set_local_got_offset(symndx, got_type, got_offset); | |
07f397ab ILT |
1567 | return true; |
1568 | } | |
1569 | ||
0a65a3a7 CC |
1570 | // Add an entry for a local symbol to the GOT, and add a dynamic |
1571 | // relocation of type R_TYPE for the GOT entry. | |
7223e9ca | 1572 | |
d77a0555 | 1573 | template<int got_size, bool big_endian> |
7bf1f802 | 1574 | void |
d77a0555 | 1575 | Output_data_got<got_size, big_endian>::add_local_with_rel( |
83896202 | 1576 | Relobj* object, |
0a65a3a7 CC |
1577 | unsigned int symndx, |
1578 | unsigned int got_type, | |
83896202 | 1579 | Output_data_reloc_generic* rel_dyn, |
7bf1f802 ILT |
1580 | unsigned int r_type) |
1581 | { | |
0a65a3a7 | 1582 | if (object->local_has_got_offset(symndx, got_type)) |
7bf1f802 ILT |
1583 | return; |
1584 | ||
4829d394 | 1585 | unsigned int got_offset = this->add_got_entry(Got_entry()); |
2ea97941 | 1586 | object->set_local_got_offset(symndx, got_type, got_offset); |
83896202 | 1587 | rel_dyn->add_local_generic(object, symndx, r_type, this, got_offset, 0); |
07f397ab ILT |
1588 | } |
1589 | ||
0a65a3a7 | 1590 | // Add a pair of entries for a local symbol to the GOT, and add |
bd73a62d AM |
1591 | // a dynamic relocation of type R_TYPE using the section symbol of |
1592 | // the output section to which input section SHNDX maps, on the first. | |
1593 | // The first got entry will have a value of zero, the second the | |
1594 | // value of the local symbol. | |
d77a0555 | 1595 | template<int got_size, bool big_endian> |
7bf1f802 | 1596 | void |
d77a0555 | 1597 | Output_data_got<got_size, big_endian>::add_local_pair_with_rel( |
83896202 | 1598 | Relobj* object, |
7bf1f802 ILT |
1599 | unsigned int symndx, |
1600 | unsigned int shndx, | |
0a65a3a7 | 1601 | unsigned int got_type, |
83896202 | 1602 | Output_data_reloc_generic* rel_dyn, |
bd73a62d | 1603 | unsigned int r_type) |
7bf1f802 | 1604 | { |
0a65a3a7 | 1605 | if (object->local_has_got_offset(symndx, got_type)) |
7bf1f802 ILT |
1606 | return; |
1607 | ||
4829d394 CC |
1608 | unsigned int got_offset = |
1609 | this->add_got_entry_pair(Got_entry(), | |
1610 | Got_entry(object, symndx, false)); | |
2ea97941 | 1611 | object->set_local_got_offset(symndx, got_type, got_offset); |
ef9beddf | 1612 | Output_section* os = object->output_section(shndx); |
bd73a62d AM |
1613 | rel_dyn->add_output_section_generic(os, r_type, this, got_offset, 0); |
1614 | } | |
7bf1f802 | 1615 | |
bd73a62d AM |
1616 | // Add a pair of entries for a local symbol to the GOT, and add |
1617 | // a dynamic relocation of type R_TYPE using STN_UNDEF on the first. | |
1618 | // The first got entry will have a value of zero, the second the | |
1619 | // value of the local symbol offset by Target::tls_offset_for_local. | |
d77a0555 | 1620 | template<int got_size, bool big_endian> |
bd73a62d | 1621 | void |
d77a0555 | 1622 | Output_data_got<got_size, big_endian>::add_local_tls_pair( |
bd73a62d AM |
1623 | Relobj* object, |
1624 | unsigned int symndx, | |
1625 | unsigned int got_type, | |
1626 | Output_data_reloc_generic* rel_dyn, | |
1627 | unsigned int r_type) | |
1628 | { | |
1629 | if (object->local_has_got_offset(symndx, got_type)) | |
1630 | return; | |
1631 | ||
1632 | unsigned int got_offset | |
1633 | = this->add_got_entry_pair(Got_entry(), | |
1634 | Got_entry(object, symndx, true)); | |
1635 | object->set_local_got_offset(symndx, got_type, got_offset); | |
1636 | rel_dyn->add_local_generic(object, 0, r_type, this, got_offset, 0); | |
4829d394 CC |
1637 | } |
1638 | ||
1639 | // Reserve a slot in the GOT for a local symbol or the second slot of a pair. | |
1640 | ||
d77a0555 | 1641 | template<int got_size, bool big_endian> |
4829d394 | 1642 | void |
d77a0555 | 1643 | Output_data_got<got_size, big_endian>::reserve_local( |
6fa2a40b | 1644 | unsigned int i, |
83896202 | 1645 | Relobj* object, |
6fa2a40b CC |
1646 | unsigned int sym_index, |
1647 | unsigned int got_type) | |
4829d394 | 1648 | { |
dd74ae06 | 1649 | this->do_reserve_slot(i); |
6fa2a40b | 1650 | object->set_local_got_offset(sym_index, got_type, this->got_offset(i)); |
4829d394 | 1651 | } |
7bf1f802 | 1652 | |
4829d394 CC |
1653 | // Reserve a slot in the GOT for a global symbol. |
1654 | ||
d77a0555 | 1655 | template<int got_size, bool big_endian> |
4829d394 | 1656 | void |
d77a0555 | 1657 | Output_data_got<got_size, big_endian>::reserve_global( |
4829d394 CC |
1658 | unsigned int i, |
1659 | Symbol* gsym, | |
1660 | unsigned int got_type) | |
1661 | { | |
dd74ae06 | 1662 | this->do_reserve_slot(i); |
4829d394 | 1663 | gsym->set_got_offset(got_type, this->got_offset(i)); |
7bf1f802 ILT |
1664 | } |
1665 | ||
ead1e424 ILT |
1666 | // Write out the GOT. |
1667 | ||
d77a0555 | 1668 | template<int got_size, bool big_endian> |
ead1e424 | 1669 | void |
d77a0555 | 1670 | Output_data_got<got_size, big_endian>::do_write(Output_file* of) |
ead1e424 | 1671 | { |
d77a0555 | 1672 | const int add = got_size / 8; |
ead1e424 ILT |
1673 | |
1674 | const off_t off = this->offset(); | |
c06b7b0b | 1675 | const off_t oview_size = this->data_size(); |
ead1e424 ILT |
1676 | unsigned char* const oview = of->get_output_view(off, oview_size); |
1677 | ||
1678 | unsigned char* pov = oview; | |
bd73a62d | 1679 | for (unsigned int i = 0; i < this->entries_.size(); ++i) |
ead1e424 | 1680 | { |
bd73a62d | 1681 | this->entries_[i].write(i, pov); |
ead1e424 ILT |
1682 | pov += add; |
1683 | } | |
1684 | ||
a3ad94ed | 1685 | gold_assert(pov - oview == oview_size); |
c06b7b0b | 1686 | |
ead1e424 ILT |
1687 | of->write_output_view(off, oview_size, oview); |
1688 | ||
1689 | // We no longer need the GOT entries. | |
1690 | this->entries_.clear(); | |
1691 | } | |
1692 | ||
4829d394 CC |
1693 | // Create a new GOT entry and return its offset. |
1694 | ||
d77a0555 | 1695 | template<int got_size, bool big_endian> |
4829d394 | 1696 | unsigned int |
d77a0555 | 1697 | Output_data_got<got_size, big_endian>::add_got_entry(Got_entry got_entry) |
4829d394 CC |
1698 | { |
1699 | if (!this->is_data_size_valid()) | |
1700 | { | |
1701 | this->entries_.push_back(got_entry); | |
1702 | this->set_got_size(); | |
1703 | return this->last_got_offset(); | |
1704 | } | |
1705 | else | |
1706 | { | |
1707 | // For an incremental update, find an available slot. | |
d77a0555 ILT |
1708 | off_t got_offset = this->free_list_.allocate(got_size / 8, |
1709 | got_size / 8, 0); | |
4829d394 | 1710 | if (got_offset == -1) |
e6455dfb CC |
1711 | gold_fallback(_("out of patch space (GOT);" |
1712 | " relink with --incremental-full")); | |
d77a0555 | 1713 | unsigned int got_index = got_offset / (got_size / 8); |
4829d394 CC |
1714 | gold_assert(got_index < this->entries_.size()); |
1715 | this->entries_[got_index] = got_entry; | |
1716 | return static_cast<unsigned int>(got_offset); | |
1717 | } | |
1718 | } | |
1719 | ||
1720 | // Create a pair of new GOT entries and return the offset of the first. | |
1721 | ||
d77a0555 | 1722 | template<int got_size, bool big_endian> |
4829d394 | 1723 | unsigned int |
d77a0555 ILT |
1724 | Output_data_got<got_size, big_endian>::add_got_entry_pair( |
1725 | Got_entry got_entry_1, | |
1726 | Got_entry got_entry_2) | |
4829d394 CC |
1727 | { |
1728 | if (!this->is_data_size_valid()) | |
1729 | { | |
1730 | unsigned int got_offset; | |
1731 | this->entries_.push_back(got_entry_1); | |
1732 | got_offset = this->last_got_offset(); | |
1733 | this->entries_.push_back(got_entry_2); | |
1734 | this->set_got_size(); | |
1735 | return got_offset; | |
1736 | } | |
1737 | else | |
1738 | { | |
1739 | // For an incremental update, find an available pair of slots. | |
d77a0555 ILT |
1740 | off_t got_offset = this->free_list_.allocate(2 * got_size / 8, |
1741 | got_size / 8, 0); | |
4829d394 | 1742 | if (got_offset == -1) |
e6455dfb CC |
1743 | gold_fallback(_("out of patch space (GOT);" |
1744 | " relink with --incremental-full")); | |
d77a0555 | 1745 | unsigned int got_index = got_offset / (got_size / 8); |
4829d394 CC |
1746 | gold_assert(got_index < this->entries_.size()); |
1747 | this->entries_[got_index] = got_entry_1; | |
1748 | this->entries_[got_index + 1] = got_entry_2; | |
1749 | return static_cast<unsigned int>(got_offset); | |
1750 | } | |
1751 | } | |
1752 | ||
cf43a2fe AM |
1753 | // Replace GOT entry I with a new value. |
1754 | ||
d77a0555 | 1755 | template<int got_size, bool big_endian> |
cf43a2fe | 1756 | void |
d77a0555 | 1757 | Output_data_got<got_size, big_endian>::replace_got_entry( |
cf43a2fe AM |
1758 | unsigned int i, |
1759 | Got_entry got_entry) | |
1760 | { | |
1761 | gold_assert(i < this->entries_.size()); | |
1762 | this->entries_[i] = got_entry; | |
1763 | } | |
1764 | ||
a3ad94ed ILT |
1765 | // Output_data_dynamic::Dynamic_entry methods. |
1766 | ||
1767 | // Write out the entry. | |
1768 | ||
1769 | template<int size, bool big_endian> | |
1770 | void | |
1771 | Output_data_dynamic::Dynamic_entry::write( | |
1772 | unsigned char* pov, | |
7d1a9ebb | 1773 | const Stringpool* pool) const |
a3ad94ed ILT |
1774 | { |
1775 | typename elfcpp::Elf_types<size>::Elf_WXword val; | |
c2b45e22 | 1776 | switch (this->offset_) |
a3ad94ed ILT |
1777 | { |
1778 | case DYNAMIC_NUMBER: | |
1779 | val = this->u_.val; | |
1780 | break; | |
1781 | ||
a3ad94ed | 1782 | case DYNAMIC_SECTION_SIZE: |
16649710 | 1783 | val = this->u_.od->data_size(); |
612a8d3d DM |
1784 | if (this->od2 != NULL) |
1785 | val += this->od2->data_size(); | |
a3ad94ed ILT |
1786 | break; |
1787 | ||
1788 | case DYNAMIC_SYMBOL: | |
1789 | { | |
16649710 ILT |
1790 | const Sized_symbol<size>* s = |
1791 | static_cast<const Sized_symbol<size>*>(this->u_.sym); | |
a3ad94ed ILT |
1792 | val = s->value(); |
1793 | } | |
1794 | break; | |
1795 | ||
1796 | case DYNAMIC_STRING: | |
1797 | val = pool->get_offset(this->u_.str); | |
1798 | break; | |
1799 | ||
1800 | default: | |
c2b45e22 CC |
1801 | val = this->u_.od->address() + this->offset_; |
1802 | break; | |
a3ad94ed ILT |
1803 | } |
1804 | ||
1805 | elfcpp::Dyn_write<size, big_endian> dw(pov); | |
1806 | dw.put_d_tag(this->tag_); | |
1807 | dw.put_d_val(val); | |
1808 | } | |
1809 | ||
1810 | // Output_data_dynamic methods. | |
1811 | ||
16649710 ILT |
1812 | // Adjust the output section to set the entry size. |
1813 | ||
1814 | void | |
1815 | Output_data_dynamic::do_adjust_output_section(Output_section* os) | |
1816 | { | |
8851ecca | 1817 | if (parameters->target().get_size() == 32) |
16649710 | 1818 | os->set_entsize(elfcpp::Elf_sizes<32>::dyn_size); |
8851ecca | 1819 | else if (parameters->target().get_size() == 64) |
16649710 ILT |
1820 | os->set_entsize(elfcpp::Elf_sizes<64>::dyn_size); |
1821 | else | |
1822 | gold_unreachable(); | |
1823 | } | |
1824 | ||
a3ad94ed ILT |
1825 | // Set the final data size. |
1826 | ||
1827 | void | |
27bc2bce | 1828 | Output_data_dynamic::set_final_data_size() |
a3ad94ed | 1829 | { |
20e6d0d6 DK |
1830 | // Add the terminating entry if it hasn't been added. |
1831 | // Because of relaxation, we can run this multiple times. | |
9e9e071b ILT |
1832 | if (this->entries_.empty() || this->entries_.back().tag() != elfcpp::DT_NULL) |
1833 | { | |
1834 | int extra = parameters->options().spare_dynamic_tags(); | |
1835 | for (int i = 0; i < extra; ++i) | |
1836 | this->add_constant(elfcpp::DT_NULL, 0); | |
1837 | this->add_constant(elfcpp::DT_NULL, 0); | |
1838 | } | |
a3ad94ed ILT |
1839 | |
1840 | int dyn_size; | |
8851ecca | 1841 | if (parameters->target().get_size() == 32) |
a3ad94ed | 1842 | dyn_size = elfcpp::Elf_sizes<32>::dyn_size; |
8851ecca | 1843 | else if (parameters->target().get_size() == 64) |
a3ad94ed ILT |
1844 | dyn_size = elfcpp::Elf_sizes<64>::dyn_size; |
1845 | else | |
1846 | gold_unreachable(); | |
1847 | this->set_data_size(this->entries_.size() * dyn_size); | |
1848 | } | |
1849 | ||
1850 | // Write out the dynamic entries. | |
1851 | ||
1852 | void | |
1853 | Output_data_dynamic::do_write(Output_file* of) | |
1854 | { | |
8851ecca | 1855 | switch (parameters->size_and_endianness()) |
a3ad94ed | 1856 | { |
9025d29d | 1857 | #ifdef HAVE_TARGET_32_LITTLE |
8851ecca ILT |
1858 | case Parameters::TARGET_32_LITTLE: |
1859 | this->sized_write<32, false>(of); | |
1860 | break; | |
9025d29d | 1861 | #endif |
8851ecca ILT |
1862 | #ifdef HAVE_TARGET_32_BIG |
1863 | case Parameters::TARGET_32_BIG: | |
1864 | this->sized_write<32, true>(of); | |
1865 | break; | |
9025d29d | 1866 | #endif |
9025d29d | 1867 | #ifdef HAVE_TARGET_64_LITTLE |
8851ecca ILT |
1868 | case Parameters::TARGET_64_LITTLE: |
1869 | this->sized_write<64, false>(of); | |
1870 | break; | |
9025d29d | 1871 | #endif |
8851ecca ILT |
1872 | #ifdef HAVE_TARGET_64_BIG |
1873 | case Parameters::TARGET_64_BIG: | |
1874 | this->sized_write<64, true>(of); | |
1875 | break; | |
1876 | #endif | |
1877 | default: | |
1878 | gold_unreachable(); | |
a3ad94ed | 1879 | } |
a3ad94ed ILT |
1880 | } |
1881 | ||
1882 | template<int size, bool big_endian> | |
1883 | void | |
1884 | Output_data_dynamic::sized_write(Output_file* of) | |
1885 | { | |
1886 | const int dyn_size = elfcpp::Elf_sizes<size>::dyn_size; | |
1887 | ||
2ea97941 | 1888 | const off_t offset = this->offset(); |
a3ad94ed | 1889 | const off_t oview_size = this->data_size(); |
2ea97941 | 1890 | unsigned char* const oview = of->get_output_view(offset, oview_size); |
a3ad94ed ILT |
1891 | |
1892 | unsigned char* pov = oview; | |
1893 | for (typename Dynamic_entries::const_iterator p = this->entries_.begin(); | |
1894 | p != this->entries_.end(); | |
1895 | ++p) | |
1896 | { | |
7d1a9ebb | 1897 | p->write<size, big_endian>(pov, this->pool_); |
a3ad94ed ILT |
1898 | pov += dyn_size; |
1899 | } | |
1900 | ||
1901 | gold_assert(pov - oview == oview_size); | |
1902 | ||
2ea97941 | 1903 | of->write_output_view(offset, oview_size, oview); |
a3ad94ed ILT |
1904 | |
1905 | // We no longer need the dynamic entries. | |
1906 | this->entries_.clear(); | |
1907 | } | |
1908 | ||
d491d34e ILT |
1909 | // Class Output_symtab_xindex. |
1910 | ||
1911 | void | |
1912 | Output_symtab_xindex::do_write(Output_file* of) | |
1913 | { | |
2ea97941 | 1914 | const off_t offset = this->offset(); |
d491d34e | 1915 | const off_t oview_size = this->data_size(); |
2ea97941 | 1916 | unsigned char* const oview = of->get_output_view(offset, oview_size); |
d491d34e ILT |
1917 | |
1918 | memset(oview, 0, oview_size); | |
1919 | ||
1920 | if (parameters->target().is_big_endian()) | |
1921 | this->endian_do_write<true>(oview); | |
1922 | else | |
1923 | this->endian_do_write<false>(oview); | |
1924 | ||
2ea97941 | 1925 | of->write_output_view(offset, oview_size, oview); |
d491d34e ILT |
1926 | |
1927 | // We no longer need the data. | |
1928 | this->entries_.clear(); | |
1929 | } | |
1930 | ||
1931 | template<bool big_endian> | |
1932 | void | |
1933 | Output_symtab_xindex::endian_do_write(unsigned char* const oview) | |
1934 | { | |
1935 | for (Xindex_entries::const_iterator p = this->entries_.begin(); | |
1936 | p != this->entries_.end(); | |
1937 | ++p) | |
20e6d0d6 DK |
1938 | { |
1939 | unsigned int symndx = p->first; | |
50ed5eb1 | 1940 | gold_assert(static_cast<off_t>(symndx) * 4 < this->data_size()); |
20e6d0d6 DK |
1941 | elfcpp::Swap<32, big_endian>::writeval(oview + symndx * 4, p->second); |
1942 | } | |
d491d34e ILT |
1943 | } |
1944 | ||
8ea8cd50 CC |
1945 | // Output_fill_debug_info methods. |
1946 | ||
1947 | // Return the minimum size needed for a dummy compilation unit header. | |
1948 | ||
1949 | size_t | |
1950 | Output_fill_debug_info::do_minimum_hole_size() const | |
1951 | { | |
1952 | // Compile unit header fields: unit_length, version, debug_abbrev_offset, | |
1953 | // address_size. | |
1954 | const size_t len = 4 + 2 + 4 + 1; | |
1955 | // For type units, add type_signature, type_offset. | |
1956 | if (this->is_debug_types_) | |
1957 | return len + 8 + 4; | |
1958 | return len; | |
1959 | } | |
1960 | ||
1961 | // Write a dummy compilation unit header to fill a hole in the | |
1962 | // .debug_info or .debug_types section. | |
1963 | ||
1964 | void | |
1965 | Output_fill_debug_info::do_write(Output_file* of, off_t off, size_t len) const | |
1966 | { | |
66570254 CC |
1967 | gold_debug(DEBUG_INCREMENTAL, "fill_debug_info(%08lx, %08lx)", |
1968 | static_cast<long>(off), static_cast<long>(len)); | |
8ea8cd50 CC |
1969 | |
1970 | gold_assert(len >= this->do_minimum_hole_size()); | |
1971 | ||
1972 | unsigned char* const oview = of->get_output_view(off, len); | |
1973 | unsigned char* pov = oview; | |
1974 | ||
1975 | // Write header fields: unit_length, version, debug_abbrev_offset, | |
1976 | // address_size. | |
1977 | if (this->is_big_endian()) | |
1978 | { | |
24c6c55a DM |
1979 | elfcpp::Swap_unaligned<32, true>::writeval(pov, len - 4); |
1980 | elfcpp::Swap_unaligned<16, true>::writeval(pov + 4, this->version); | |
1981 | elfcpp::Swap_unaligned<32, true>::writeval(pov + 6, 0); | |
8ea8cd50 CC |
1982 | } |
1983 | else | |
1984 | { | |
24c6c55a DM |
1985 | elfcpp::Swap_unaligned<32, false>::writeval(pov, len - 4); |
1986 | elfcpp::Swap_unaligned<16, false>::writeval(pov + 4, this->version); | |
1987 | elfcpp::Swap_unaligned<32, false>::writeval(pov + 6, 0); | |
8ea8cd50 CC |
1988 | } |
1989 | pov += 4 + 2 + 4; | |
1990 | *pov++ = 4; | |
1991 | ||
1992 | // For type units, the additional header fields -- type_signature, | |
1993 | // type_offset -- can be filled with zeroes. | |
1994 | ||
1995 | // Fill the remainder of the free space with zeroes. The first | |
1996 | // zero should tell the consumer there are no DIEs to read in this | |
1997 | // compilation unit. | |
1998 | if (pov < oview + len) | |
1999 | memset(pov, 0, oview + len - pov); | |
2000 | ||
2001 | of->write_output_view(off, len, oview); | |
2002 | } | |
2003 | ||
2004 | // Output_fill_debug_line methods. | |
2005 | ||
2006 | // Return the minimum size needed for a dummy line number program header. | |
2007 | ||
2008 | size_t | |
2009 | Output_fill_debug_line::do_minimum_hole_size() const | |
2010 | { | |
2011 | // Line number program header fields: unit_length, version, header_length, | |
2012 | // minimum_instruction_length, default_is_stmt, line_base, line_range, | |
2013 | // opcode_base, standard_opcode_lengths[], include_directories, filenames. | |
2014 | const size_t len = 4 + 2 + 4 + this->header_length; | |
2015 | return len; | |
2016 | } | |
2017 | ||
2018 | // Write a dummy line number program header to fill a hole in the | |
2019 | // .debug_line section. | |
2020 | ||
2021 | void | |
2022 | Output_fill_debug_line::do_write(Output_file* of, off_t off, size_t len) const | |
2023 | { | |
66570254 CC |
2024 | gold_debug(DEBUG_INCREMENTAL, "fill_debug_line(%08lx, %08lx)", |
2025 | static_cast<long>(off), static_cast<long>(len)); | |
8ea8cd50 CC |
2026 | |
2027 | gold_assert(len >= this->do_minimum_hole_size()); | |
2028 | ||
2029 | unsigned char* const oview = of->get_output_view(off, len); | |
2030 | unsigned char* pov = oview; | |
2031 | ||
2032 | // Write header fields: unit_length, version, header_length, | |
2033 | // minimum_instruction_length, default_is_stmt, line_base, line_range, | |
2034 | // opcode_base, standard_opcode_lengths[], include_directories, filenames. | |
2035 | // We set the header_length field to cover the entire hole, so the | |
2036 | // line number program is empty. | |
2037 | if (this->is_big_endian()) | |
2038 | { | |
24c6c55a DM |
2039 | elfcpp::Swap_unaligned<32, true>::writeval(pov, len - 4); |
2040 | elfcpp::Swap_unaligned<16, true>::writeval(pov + 4, this->version); | |
2041 | elfcpp::Swap_unaligned<32, true>::writeval(pov + 6, len - (4 + 2 + 4)); | |
8ea8cd50 CC |
2042 | } |
2043 | else | |
2044 | { | |
24c6c55a DM |
2045 | elfcpp::Swap_unaligned<32, false>::writeval(pov, len - 4); |
2046 | elfcpp::Swap_unaligned<16, false>::writeval(pov + 4, this->version); | |
2047 | elfcpp::Swap_unaligned<32, false>::writeval(pov + 6, len - (4 + 2 + 4)); | |
8ea8cd50 CC |
2048 | } |
2049 | pov += 4 + 2 + 4; | |
2050 | *pov++ = 1; // minimum_instruction_length | |
2051 | *pov++ = 0; // default_is_stmt | |
2052 | *pov++ = 0; // line_base | |
2053 | *pov++ = 5; // line_range | |
2054 | *pov++ = 13; // opcode_base | |
2055 | *pov++ = 0; // standard_opcode_lengths[1] | |
2056 | *pov++ = 1; // standard_opcode_lengths[2] | |
2057 | *pov++ = 1; // standard_opcode_lengths[3] | |
2058 | *pov++ = 1; // standard_opcode_lengths[4] | |
2059 | *pov++ = 1; // standard_opcode_lengths[5] | |
2060 | *pov++ = 0; // standard_opcode_lengths[6] | |
2061 | *pov++ = 0; // standard_opcode_lengths[7] | |
2062 | *pov++ = 0; // standard_opcode_lengths[8] | |
2063 | *pov++ = 1; // standard_opcode_lengths[9] | |
2064 | *pov++ = 0; // standard_opcode_lengths[10] | |
2065 | *pov++ = 0; // standard_opcode_lengths[11] | |
2066 | *pov++ = 1; // standard_opcode_lengths[12] | |
2067 | *pov++ = 0; // include_directories (empty) | |
2068 | *pov++ = 0; // filenames (empty) | |
2069 | ||
2070 | // Some consumers don't check the header_length field, and simply | |
2071 | // start reading the line number program immediately following the | |
2072 | // header. For those consumers, we fill the remainder of the free | |
2073 | // space with DW_LNS_set_basic_block opcodes. These are effectively | |
2074 | // no-ops: the resulting line table program will not create any rows. | |
2075 | if (pov < oview + len) | |
2076 | memset(pov, elfcpp::DW_LNS_set_basic_block, oview + len - pov); | |
2077 | ||
2078 | of->write_output_view(off, len, oview); | |
2079 | } | |
2080 | ||
ead1e424 ILT |
2081 | // Output_section::Input_section methods. |
2082 | ||
cdc29364 CC |
2083 | // Return the current data size. For an input section we store the size here. |
2084 | // For an Output_section_data, we have to ask it for the size. | |
2085 | ||
2086 | off_t | |
2087 | Output_section::Input_section::current_data_size() const | |
2088 | { | |
2089 | if (this->is_input_section()) | |
2090 | return this->u1_.data_size; | |
2091 | else | |
2092 | { | |
2093 | this->u2_.posd->pre_finalize_data_size(); | |
2094 | return this->u2_.posd->current_data_size(); | |
2095 | } | |
2096 | } | |
2097 | ||
ead1e424 ILT |
2098 | // Return the data size. For an input section we store the size here. |
2099 | // For an Output_section_data, we have to ask it for the size. | |
2100 | ||
2101 | off_t | |
2102 | Output_section::Input_section::data_size() const | |
2103 | { | |
2104 | if (this->is_input_section()) | |
b8e6aad9 | 2105 | return this->u1_.data_size; |
ead1e424 | 2106 | else |
b8e6aad9 | 2107 | return this->u2_.posd->data_size(); |
ead1e424 ILT |
2108 | } |
2109 | ||
0439c796 DK |
2110 | // Return the object for an input section. |
2111 | ||
2112 | Relobj* | |
2113 | Output_section::Input_section::relobj() const | |
2114 | { | |
2115 | if (this->is_input_section()) | |
2116 | return this->u2_.object; | |
2117 | else if (this->is_merge_section()) | |
2118 | { | |
2119 | gold_assert(this->u2_.pomb->first_relobj() != NULL); | |
2120 | return this->u2_.pomb->first_relobj(); | |
2121 | } | |
2122 | else if (this->is_relaxed_input_section()) | |
2123 | return this->u2_.poris->relobj(); | |
2124 | else | |
2125 | gold_unreachable(); | |
2126 | } | |
2127 | ||
2128 | // Return the input section index for an input section. | |
2129 | ||
2130 | unsigned int | |
2131 | Output_section::Input_section::shndx() const | |
2132 | { | |
2133 | if (this->is_input_section()) | |
2134 | return this->shndx_; | |
2135 | else if (this->is_merge_section()) | |
2136 | { | |
2137 | gold_assert(this->u2_.pomb->first_relobj() != NULL); | |
2138 | return this->u2_.pomb->first_shndx(); | |
2139 | } | |
2140 | else if (this->is_relaxed_input_section()) | |
2141 | return this->u2_.poris->shndx(); | |
2142 | else | |
2143 | gold_unreachable(); | |
2144 | } | |
2145 | ||
ead1e424 ILT |
2146 | // Set the address and file offset. |
2147 | ||
2148 | void | |
96803768 ILT |
2149 | Output_section::Input_section::set_address_and_file_offset( |
2150 | uint64_t address, | |
2151 | off_t file_offset, | |
2152 | off_t section_file_offset) | |
ead1e424 ILT |
2153 | { |
2154 | if (this->is_input_section()) | |
96803768 ILT |
2155 | this->u2_.object->set_section_offset(this->shndx_, |
2156 | file_offset - section_file_offset); | |
ead1e424 | 2157 | else |
96803768 ILT |
2158 | this->u2_.posd->set_address_and_file_offset(address, file_offset); |
2159 | } | |
2160 | ||
a445fddf ILT |
2161 | // Reset the address and file offset. |
2162 | ||
2163 | void | |
2164 | Output_section::Input_section::reset_address_and_file_offset() | |
2165 | { | |
2166 | if (!this->is_input_section()) | |
2167 | this->u2_.posd->reset_address_and_file_offset(); | |
2168 | } | |
2169 | ||
96803768 ILT |
2170 | // Finalize the data size. |
2171 | ||
2172 | void | |
2173 | Output_section::Input_section::finalize_data_size() | |
2174 | { | |
2175 | if (!this->is_input_section()) | |
2176 | this->u2_.posd->finalize_data_size(); | |
b8e6aad9 ILT |
2177 | } |
2178 | ||
1e983657 ILT |
2179 | // Try to turn an input offset into an output offset. We want to |
2180 | // return the output offset relative to the start of this | |
2181 | // Input_section in the output section. | |
b8e6aad9 | 2182 | |
8f00aeb8 | 2183 | inline bool |
8383303e ILT |
2184 | Output_section::Input_section::output_offset( |
2185 | const Relobj* object, | |
2ea97941 ILT |
2186 | unsigned int shndx, |
2187 | section_offset_type offset, | |
ca09d69a | 2188 | section_offset_type* poutput) const |
b8e6aad9 ILT |
2189 | { |
2190 | if (!this->is_input_section()) | |
2ea97941 | 2191 | return this->u2_.posd->output_offset(object, shndx, offset, poutput); |
b8e6aad9 ILT |
2192 | else |
2193 | { | |
2ea97941 | 2194 | if (this->shndx_ != shndx || this->u2_.object != object) |
b8e6aad9 | 2195 | return false; |
2ea97941 | 2196 | *poutput = offset; |
b8e6aad9 ILT |
2197 | return true; |
2198 | } | |
ead1e424 ILT |
2199 | } |
2200 | ||
a9a60db6 ILT |
2201 | // Return whether this is the merge section for the input section |
2202 | // SHNDX in OBJECT. | |
2203 | ||
2204 | inline bool | |
2205 | Output_section::Input_section::is_merge_section_for(const Relobj* object, | |
2ea97941 | 2206 | unsigned int shndx) const |
a9a60db6 ILT |
2207 | { |
2208 | if (this->is_input_section()) | |
2209 | return false; | |
2ea97941 | 2210 | return this->u2_.posd->is_merge_section_for(object, shndx); |
a9a60db6 ILT |
2211 | } |
2212 | ||
ead1e424 ILT |
2213 | // Write out the data. We don't have to do anything for an input |
2214 | // section--they are handled via Object::relocate--but this is where | |
2215 | // we write out the data for an Output_section_data. | |
2216 | ||
2217 | void | |
2218 | Output_section::Input_section::write(Output_file* of) | |
2219 | { | |
2220 | if (!this->is_input_section()) | |
b8e6aad9 | 2221 | this->u2_.posd->write(of); |
ead1e424 ILT |
2222 | } |
2223 | ||
96803768 ILT |
2224 | // Write the data to a buffer. As for write(), we don't have to do |
2225 | // anything for an input section. | |
2226 | ||
2227 | void | |
2228 | Output_section::Input_section::write_to_buffer(unsigned char* buffer) | |
2229 | { | |
2230 | if (!this->is_input_section()) | |
2231 | this->u2_.posd->write_to_buffer(buffer); | |
2232 | } | |
2233 | ||
7d9e3d98 ILT |
2234 | // Print to a map file. |
2235 | ||
2236 | void | |
2237 | Output_section::Input_section::print_to_mapfile(Mapfile* mapfile) const | |
2238 | { | |
2239 | switch (this->shndx_) | |
2240 | { | |
2241 | case OUTPUT_SECTION_CODE: | |
2242 | case MERGE_DATA_SECTION_CODE: | |
2243 | case MERGE_STRING_SECTION_CODE: | |
2244 | this->u2_.posd->print_to_mapfile(mapfile); | |
2245 | break; | |
2246 | ||
20e6d0d6 DK |
2247 | case RELAXED_INPUT_SECTION_CODE: |
2248 | { | |
2249 | Output_relaxed_input_section* relaxed_section = | |
2250 | this->relaxed_input_section(); | |
2251 | mapfile->print_input_section(relaxed_section->relobj(), | |
2252 | relaxed_section->shndx()); | |
2253 | } | |
2254 | break; | |
7d9e3d98 ILT |
2255 | default: |
2256 | mapfile->print_input_section(this->u2_.object, this->shndx_); | |
2257 | break; | |
2258 | } | |
2259 | } | |
2260 | ||
a2fb1b05 ILT |
2261 | // Output_section methods. |
2262 | ||
2263 | // Construct an Output_section. NAME will point into a Stringpool. | |
2264 | ||
2ea97941 ILT |
2265 | Output_section::Output_section(const char* name, elfcpp::Elf_Word type, |
2266 | elfcpp::Elf_Xword flags) | |
2267 | : name_(name), | |
a2fb1b05 ILT |
2268 | addralign_(0), |
2269 | entsize_(0), | |
a445fddf | 2270 | load_address_(0), |
16649710 | 2271 | link_section_(NULL), |
a2fb1b05 | 2272 | link_(0), |
16649710 | 2273 | info_section_(NULL), |
6a74a719 | 2274 | info_symndx_(NULL), |
a2fb1b05 | 2275 | info_(0), |
2ea97941 ILT |
2276 | type_(type), |
2277 | flags_(flags), | |
22f0da72 | 2278 | order_(ORDER_INVALID), |
91ea499d | 2279 | out_shndx_(-1U), |
c06b7b0b ILT |
2280 | symtab_index_(0), |
2281 | dynsym_index_(0), | |
ead1e424 ILT |
2282 | input_sections_(), |
2283 | first_input_offset_(0), | |
c51e6221 | 2284 | fills_(), |
96803768 | 2285 | postprocessing_buffer_(NULL), |
a3ad94ed | 2286 | needs_symtab_index_(false), |
16649710 ILT |
2287 | needs_dynsym_index_(false), |
2288 | should_link_to_symtab_(false), | |
730cdc88 | 2289 | should_link_to_dynsym_(false), |
27bc2bce | 2290 | after_input_sections_(false), |
7bf1f802 | 2291 | requires_postprocessing_(false), |
a445fddf ILT |
2292 | found_in_sections_clause_(false), |
2293 | has_load_address_(false), | |
755ab8af | 2294 | info_uses_section_index_(false), |
6e9ba2ca | 2295 | input_section_order_specified_(false), |
2fd32231 ILT |
2296 | may_sort_attached_input_sections_(false), |
2297 | must_sort_attached_input_sections_(false), | |
2298 | attached_input_sections_are_sorted_(false), | |
9f1d377b | 2299 | is_relro_(false), |
8a5e3e08 ILT |
2300 | is_small_section_(false), |
2301 | is_large_section_(false), | |
f5c870d2 | 2302 | generate_code_fills_at_write_(false), |
e8cd95c7 | 2303 | is_entsize_zero_(false), |
8923b24c | 2304 | section_offsets_need_adjustment_(false), |
1e5d2fb1 | 2305 | is_noload_(false), |
131687b4 | 2306 | always_keeps_input_sections_(false), |
cdc29364 | 2307 | has_fixed_layout_(false), |
9fbd3822 | 2308 | is_patch_space_allowed_(false), |
16164a6b | 2309 | is_unique_segment_(false), |
20e6d0d6 | 2310 | tls_offset_(0), |
16164a6b ST |
2311 | extra_segment_flags_(0), |
2312 | segment_alignment_(0), | |
c0a62865 | 2313 | checkpoint_(NULL), |
cdc29364 | 2314 | lookup_maps_(new Output_section_lookup_maps), |
9fbd3822 | 2315 | free_list_(), |
8ea8cd50 | 2316 | free_space_fill_(NULL), |
9fbd3822 | 2317 | patch_space_(0) |
a2fb1b05 | 2318 | { |
27bc2bce ILT |
2319 | // An unallocated section has no address. Forcing this means that |
2320 | // we don't need special treatment for symbols defined in debug | |
2321 | // sections. | |
2ea97941 | 2322 | if ((flags & elfcpp::SHF_ALLOC) == 0) |
27bc2bce | 2323 | this->set_address(0); |
a2fb1b05 ILT |
2324 | } |
2325 | ||
54dc6425 ILT |
2326 | Output_section::~Output_section() |
2327 | { | |
20e6d0d6 | 2328 | delete this->checkpoint_; |
54dc6425 ILT |
2329 | } |
2330 | ||
16649710 ILT |
2331 | // Set the entry size. |
2332 | ||
2333 | void | |
2334 | Output_section::set_entsize(uint64_t v) | |
2335 | { | |
e8cd95c7 ILT |
2336 | if (this->is_entsize_zero_) |
2337 | ; | |
2338 | else if (this->entsize_ == 0) | |
16649710 | 2339 | this->entsize_ = v; |
e8cd95c7 ILT |
2340 | else if (this->entsize_ != v) |
2341 | { | |
2342 | this->entsize_ = 0; | |
2343 | this->is_entsize_zero_ = 1; | |
2344 | } | |
16649710 ILT |
2345 | } |
2346 | ||
ead1e424 | 2347 | // Add the input section SHNDX, with header SHDR, named SECNAME, in |
730cdc88 ILT |
2348 | // OBJECT, to the Output_section. RELOC_SHNDX is the index of a |
2349 | // relocation section which applies to this section, or 0 if none, or | |
2350 | // -1U if more than one. Return the offset of the input section | |
2351 | // within the output section. Return -1 if the input section will | |
2352 | // receive special handling. In the normal case we don't always keep | |
2353 | // track of input sections for an Output_section. Instead, each | |
2354 | // Object keeps track of the Output_section for each of its input | |
a445fddf ILT |
2355 | // sections. However, if HAVE_SECTIONS_SCRIPT is true, we do keep |
2356 | // track of input sections here; this is used when SECTIONS appears in | |
2357 | // a linker script. | |
a2fb1b05 ILT |
2358 | |
2359 | template<int size, bool big_endian> | |
2360 | off_t | |
6e9ba2ca | 2361 | Output_section::add_input_section(Layout* layout, |
6fa2a40b | 2362 | Sized_relobj_file<size, big_endian>* object, |
2ea97941 | 2363 | unsigned int shndx, |
ead1e424 | 2364 | const char* secname, |
730cdc88 | 2365 | const elfcpp::Shdr<size, big_endian>& shdr, |
a445fddf ILT |
2366 | unsigned int reloc_shndx, |
2367 | bool have_sections_script) | |
a2fb1b05 | 2368 | { |
2ea97941 ILT |
2369 | elfcpp::Elf_Xword addralign = shdr.get_sh_addralign(); |
2370 | if ((addralign & (addralign - 1)) != 0) | |
a2fb1b05 | 2371 | { |
75f2446e | 2372 | object->error(_("invalid alignment %lu for section \"%s\""), |
2ea97941 ILT |
2373 | static_cast<unsigned long>(addralign), secname); |
2374 | addralign = 1; | |
a2fb1b05 | 2375 | } |
a2fb1b05 | 2376 | |
2ea97941 ILT |
2377 | if (addralign > this->addralign_) |
2378 | this->addralign_ = addralign; | |
a2fb1b05 | 2379 | |
44a43cf9 | 2380 | typename elfcpp::Elf_types<size>::Elf_WXword sh_flags = shdr.get_sh_flags(); |
2ea97941 | 2381 | uint64_t entsize = shdr.get_sh_entsize(); |
44a43cf9 ILT |
2382 | |
2383 | // .debug_str is a mergeable string section, but is not always so | |
2384 | // marked by compilers. Mark manually here so we can optimize. | |
2385 | if (strcmp(secname, ".debug_str") == 0) | |
4f833eee ILT |
2386 | { |
2387 | sh_flags |= (elfcpp::SHF_MERGE | elfcpp::SHF_STRINGS); | |
2ea97941 | 2388 | entsize = 1; |
4f833eee | 2389 | } |
44a43cf9 | 2390 | |
e8cd95c7 ILT |
2391 | this->update_flags_for_input_section(sh_flags); |
2392 | this->set_entsize(entsize); | |
2393 | ||
b8e6aad9 | 2394 | // If this is a SHF_MERGE section, we pass all the input sections to |
730cdc88 | 2395 | // a Output_data_merge. We don't try to handle relocations for such |
e0b64032 ILT |
2396 | // a section. We don't try to handle empty merge sections--they |
2397 | // mess up the mappings, and are useless anyhow. | |
cdc29364 | 2398 | // FIXME: Need to handle merge sections during incremental update. |
44a43cf9 | 2399 | if ((sh_flags & elfcpp::SHF_MERGE) != 0 |
e0b64032 | 2400 | && reloc_shndx == 0 |
cdc29364 CC |
2401 | && shdr.get_sh_size() > 0 |
2402 | && !parameters->incremental()) | |
b8e6aad9 | 2403 | { |
0439c796 DK |
2404 | // Keep information about merged input sections for rebuilding fast |
2405 | // lookup maps if we have sections-script or we do relaxation. | |
131687b4 DK |
2406 | bool keeps_input_sections = (this->always_keeps_input_sections_ |
2407 | || have_sections_script | |
2408 | || parameters->target().may_relax()); | |
2409 | ||
0439c796 DK |
2410 | if (this->add_merge_input_section(object, shndx, sh_flags, entsize, |
2411 | addralign, keeps_input_sections)) | |
b8e6aad9 ILT |
2412 | { |
2413 | // Tell the relocation routines that they need to call the | |
730cdc88 | 2414 | // output_offset method to determine the final address. |
b8e6aad9 ILT |
2415 | return -1; |
2416 | } | |
2417 | } | |
2418 | ||
cdc29364 CC |
2419 | section_size_type input_section_size = shdr.get_sh_size(); |
2420 | section_size_type uncompressed_size; | |
2421 | if (object->section_is_compressed(shndx, &uncompressed_size)) | |
2422 | input_section_size = uncompressed_size; | |
2423 | ||
2424 | off_t offset_in_section; | |
3136a00e | 2425 | |
cdc29364 CC |
2426 | if (this->has_fixed_layout()) |
2427 | { | |
2428 | // For incremental updates, find a chunk of unused space in the section. | |
2429 | offset_in_section = this->free_list_.allocate(input_section_size, | |
2430 | addralign, 0); | |
2431 | if (offset_in_section == -1) | |
9fbd3822 CC |
2432 | gold_fallback(_("out of patch space in section %s; " |
2433 | "relink with --incremental-full"), | |
2434 | this->name()); | |
3136a00e | 2435 | return offset_in_section; |
cdc29364 | 2436 | } |
c51e6221 | 2437 | |
3136a00e CC |
2438 | offset_in_section = this->current_data_size_for_child(); |
2439 | off_t aligned_offset_in_section = align_address(offset_in_section, | |
2440 | addralign); | |
2441 | this->set_current_data_size_for_child(aligned_offset_in_section | |
2442 | + input_section_size); | |
2443 | ||
c0a62865 DK |
2444 | // Determine if we want to delay code-fill generation until the output |
2445 | // section is written. When the target is relaxing, we want to delay fill | |
4cf7a849 ST |
2446 | // generating to avoid adjusting them during relaxation. Also, if we are |
2447 | // sorting input sections we must delay fill generation. | |
c0a62865 DK |
2448 | if (!this->generate_code_fills_at_write_ |
2449 | && !have_sections_script | |
2450 | && (sh_flags & elfcpp::SHF_EXECINSTR) != 0 | |
2451 | && parameters->target().has_code_fill() | |
4cf7a849 | 2452 | && (parameters->target().may_relax() |
e9552f7e | 2453 | || layout->is_section_ordering_specified())) |
c0a62865 DK |
2454 | { |
2455 | gold_assert(this->fills_.empty()); | |
2456 | this->generate_code_fills_at_write_ = true; | |
2457 | } | |
2458 | ||
c51e6221 | 2459 | if (aligned_offset_in_section > offset_in_section |
c0a62865 | 2460 | && !this->generate_code_fills_at_write_ |
a445fddf | 2461 | && !have_sections_script |
44a43cf9 | 2462 | && (sh_flags & elfcpp::SHF_EXECINSTR) != 0 |
029ba973 | 2463 | && parameters->target().has_code_fill()) |
c51e6221 ILT |
2464 | { |
2465 | // We need to add some fill data. Using fill_list_ when | |
2466 | // possible is an optimization, since we will often have fill | |
2467 | // sections without input sections. | |
2468 | off_t fill_len = aligned_offset_in_section - offset_in_section; | |
2469 | if (this->input_sections_.empty()) | |
2470 | this->fills_.push_back(Fill(offset_in_section, fill_len)); | |
2471 | else | |
2472 | { | |
029ba973 | 2473 | std::string fill_data(parameters->target().code_fill(fill_len)); |
c51e6221 ILT |
2474 | Output_data_const* odc = new Output_data_const(fill_data, 1); |
2475 | this->input_sections_.push_back(Input_section(odc)); | |
2476 | } | |
2477 | } | |
2478 | ||
ead1e424 | 2479 | // We need to keep track of this section if we are already keeping |
2fd32231 ILT |
2480 | // track of sections, or if we are relaxing. Also, if this is a |
2481 | // section which requires sorting, or which may require sorting in | |
6e9ba2ca ST |
2482 | // the future, we keep track of the sections. If the |
2483 | // --section-ordering-file option is used to specify the order of | |
2484 | // sections, we need to keep track of sections. | |
131687b4 DK |
2485 | if (this->always_keeps_input_sections_ |
2486 | || have_sections_script | |
2fd32231 ILT |
2487 | || !this->input_sections_.empty() |
2488 | || this->may_sort_attached_input_sections() | |
7d9e3d98 | 2489 | || this->must_sort_attached_input_sections() |
20e6d0d6 | 2490 | || parameters->options().user_set_Map() |
6e9ba2ca | 2491 | || parameters->target().may_relax() |
edcac0c1 | 2492 | || layout->is_section_ordering_specified()) |
6e9ba2ca | 2493 | { |
6fc6ea19 | 2494 | Input_section isecn(object, shndx, input_section_size, addralign); |
f0558624 ST |
2495 | /* If section ordering is requested by specifying a ordering file, |
2496 | using --section-ordering-file, match the section name with | |
2497 | a pattern. */ | |
2498 | if (parameters->options().section_ordering_file()) | |
6e9ba2ca ST |
2499 | { |
2500 | unsigned int section_order_index = | |
2501 | layout->find_section_order_index(std::string(secname)); | |
2502 | if (section_order_index != 0) | |
2503 | { | |
2504 | isecn.set_section_order_index(section_order_index); | |
2505 | this->set_input_section_order_specified(); | |
2506 | } | |
2507 | } | |
2508 | this->input_sections_.push_back(isecn); | |
2509 | } | |
54dc6425 | 2510 | |
c51e6221 | 2511 | return aligned_offset_in_section; |
61ba1cf9 ILT |
2512 | } |
2513 | ||
ead1e424 ILT |
2514 | // Add arbitrary data to an output section. |
2515 | ||
2516 | void | |
2517 | Output_section::add_output_section_data(Output_section_data* posd) | |
2518 | { | |
b8e6aad9 ILT |
2519 | Input_section inp(posd); |
2520 | this->add_output_section_data(&inp); | |
a445fddf ILT |
2521 | |
2522 | if (posd->is_data_size_valid()) | |
2523 | { | |
cdc29364 CC |
2524 | off_t offset_in_section; |
2525 | if (this->has_fixed_layout()) | |
2526 | { | |
2527 | // For incremental updates, find a chunk of unused space. | |
2528 | offset_in_section = this->free_list_.allocate(posd->data_size(), | |
2529 | posd->addralign(), 0); | |
2530 | if (offset_in_section == -1) | |
9fbd3822 CC |
2531 | gold_fallback(_("out of patch space in section %s; " |
2532 | "relink with --incremental-full"), | |
2533 | this->name()); | |
cdc29364 CC |
2534 | // Finalize the address and offset now. |
2535 | uint64_t addr = this->address(); | |
2536 | off_t offset = this->offset(); | |
2537 | posd->set_address_and_file_offset(addr + offset_in_section, | |
2538 | offset + offset_in_section); | |
2539 | } | |
2540 | else | |
2541 | { | |
2542 | offset_in_section = this->current_data_size_for_child(); | |
2543 | off_t aligned_offset_in_section = align_address(offset_in_section, | |
2544 | posd->addralign()); | |
2545 | this->set_current_data_size_for_child(aligned_offset_in_section | |
2546 | + posd->data_size()); | |
2547 | } | |
2548 | } | |
2549 | else if (this->has_fixed_layout()) | |
2550 | { | |
2551 | // For incremental updates, arrange for the data to have a fixed layout. | |
2552 | // This will mean that additions to the data must be allocated from | |
2553 | // free space within the containing output section. | |
2554 | uint64_t addr = this->address(); | |
2555 | posd->set_address(addr); | |
2556 | posd->set_file_offset(0); | |
4829d394 CC |
2557 | // FIXME: This should eventually be unreachable. |
2558 | // gold_unreachable(); | |
a445fddf | 2559 | } |
b8e6aad9 ILT |
2560 | } |
2561 | ||
c0a62865 DK |
2562 | // Add a relaxed input section. |
2563 | ||
2564 | void | |
d06fb4d1 DK |
2565 | Output_section::add_relaxed_input_section(Layout* layout, |
2566 | Output_relaxed_input_section* poris, | |
2567 | const std::string& name) | |
c0a62865 DK |
2568 | { |
2569 | Input_section inp(poris); | |
d06fb4d1 DK |
2570 | |
2571 | // If the --section-ordering-file option is used to specify the order of | |
2572 | // sections, we need to keep track of sections. | |
e9552f7e | 2573 | if (layout->is_section_ordering_specified()) |
d06fb4d1 DK |
2574 | { |
2575 | unsigned int section_order_index = | |
2576 | layout->find_section_order_index(name); | |
2577 | if (section_order_index != 0) | |
2578 | { | |
2579 | inp.set_section_order_index(section_order_index); | |
2580 | this->set_input_section_order_specified(); | |
2581 | } | |
2582 | } | |
2583 | ||
c0a62865 | 2584 | this->add_output_section_data(&inp); |
0439c796 DK |
2585 | if (this->lookup_maps_->is_valid()) |
2586 | this->lookup_maps_->add_relaxed_input_section(poris->relobj(), | |
2587 | poris->shndx(), poris); | |
c0a62865 DK |
2588 | |
2589 | // For a relaxed section, we use the current data size. Linker scripts | |
2590 | // get all the input sections, including relaxed one from an output | |
19fec8c1 | 2591 | // section and add them back to the same output section to compute the |
c0a62865 | 2592 | // output section size. If we do not account for sizes of relaxed input |
19fec8c1 | 2593 | // sections, an output section would be incorrectly sized. |
c0a62865 DK |
2594 | off_t offset_in_section = this->current_data_size_for_child(); |
2595 | off_t aligned_offset_in_section = align_address(offset_in_section, | |
2596 | poris->addralign()); | |
2597 | this->set_current_data_size_for_child(aligned_offset_in_section | |
2598 | + poris->current_data_size()); | |
2599 | } | |
2600 | ||
b8e6aad9 | 2601 | // Add arbitrary data to an output section by Input_section. |
c06b7b0b | 2602 | |
b8e6aad9 ILT |
2603 | void |
2604 | Output_section::add_output_section_data(Input_section* inp) | |
2605 | { | |
ead1e424 | 2606 | if (this->input_sections_.empty()) |
27bc2bce | 2607 | this->first_input_offset_ = this->current_data_size_for_child(); |
c06b7b0b | 2608 | |
b8e6aad9 | 2609 | this->input_sections_.push_back(*inp); |
c06b7b0b | 2610 | |
2ea97941 ILT |
2611 | uint64_t addralign = inp->addralign(); |
2612 | if (addralign > this->addralign_) | |
2613 | this->addralign_ = addralign; | |
c06b7b0b | 2614 | |
b8e6aad9 ILT |
2615 | inp->set_output_section(this); |
2616 | } | |
2617 | ||
2618 | // Add a merge section to an output section. | |
2619 | ||
2620 | void | |
2621 | Output_section::add_output_merge_section(Output_section_data* posd, | |
2ea97941 | 2622 | bool is_string, uint64_t entsize) |
b8e6aad9 | 2623 | { |
2ea97941 | 2624 | Input_section inp(posd, is_string, entsize); |
b8e6aad9 ILT |
2625 | this->add_output_section_data(&inp); |
2626 | } | |
2627 | ||
2628 | // Add an input section to a SHF_MERGE section. | |
2629 | ||
2630 | bool | |
2ea97941 ILT |
2631 | Output_section::add_merge_input_section(Relobj* object, unsigned int shndx, |
2632 | uint64_t flags, uint64_t entsize, | |
0439c796 DK |
2633 | uint64_t addralign, |
2634 | bool keeps_input_sections) | |
b8e6aad9 | 2635 | { |
2ea97941 | 2636 | bool is_string = (flags & elfcpp::SHF_STRINGS) != 0; |
87f95776 | 2637 | |
20e6d0d6 DK |
2638 | // We cannot restore merged input section states. |
2639 | gold_assert(this->checkpoint_ == NULL); | |
2640 | ||
c0a62865 | 2641 | // Look up merge sections by required properties. |
0439c796 DK |
2642 | // Currently, we only invalidate the lookup maps in script processing |
2643 | // and relaxation. We should not have done either when we reach here. | |
2644 | // So we assume that the lookup maps are valid to simply code. | |
2645 | gold_assert(this->lookup_maps_->is_valid()); | |
2ea97941 | 2646 | Merge_section_properties msp(is_string, entsize, addralign); |
0439c796 DK |
2647 | Output_merge_base* pomb = this->lookup_maps_->find_merge_section(msp); |
2648 | bool is_new = false; | |
2649 | if (pomb != NULL) | |
c0a62865 | 2650 | { |
6bf924b0 DK |
2651 | gold_assert(pomb->is_string() == is_string |
2652 | && pomb->entsize() == entsize | |
2653 | && pomb->addralign() == addralign); | |
c0a62865 | 2654 | } |
b8e6aad9 ILT |
2655 | else |
2656 | { | |
6bf924b0 DK |
2657 | // Create a new Output_merge_data or Output_merge_string_data. |
2658 | if (!is_string) | |
2659 | pomb = new Output_merge_data(entsize, addralign); | |
2660 | else | |
9a0910c3 | 2661 | { |
6bf924b0 DK |
2662 | switch (entsize) |
2663 | { | |
2664 | case 1: | |
2665 | pomb = new Output_merge_string<char>(addralign); | |
2666 | break; | |
2667 | case 2: | |
2668 | pomb = new Output_merge_string<uint16_t>(addralign); | |
2669 | break; | |
2670 | case 4: | |
2671 | pomb = new Output_merge_string<uint32_t>(addralign); | |
2672 | break; | |
2673 | default: | |
2674 | return false; | |
2675 | } | |
9a0910c3 | 2676 | } |
0439c796 DK |
2677 | // If we need to do script processing or relaxation, we need to keep |
2678 | // the original input sections to rebuild the fast lookup maps. | |
2679 | if (keeps_input_sections) | |
2680 | pomb->set_keeps_input_sections(); | |
2681 | is_new = true; | |
b8e6aad9 ILT |
2682 | } |
2683 | ||
6bf924b0 DK |
2684 | if (pomb->add_input_section(object, shndx)) |
2685 | { | |
0439c796 DK |
2686 | // Add new merge section to this output section and link merge |
2687 | // section properties to new merge section in map. | |
2688 | if (is_new) | |
2689 | { | |
2690 | this->add_output_merge_section(pomb, is_string, entsize); | |
2691 | this->lookup_maps_->add_merge_section(msp, pomb); | |
2692 | } | |
2693 | ||
6bf924b0 DK |
2694 | // Add input section to new merge section and link input section to new |
2695 | // merge section in map. | |
0439c796 | 2696 | this->lookup_maps_->add_merge_input_section(object, shndx, pomb); |
6bf924b0 DK |
2697 | return true; |
2698 | } | |
2699 | else | |
0439c796 DK |
2700 | { |
2701 | // If add_input_section failed, delete new merge section to avoid | |
2702 | // exporting empty merge sections in Output_section::get_input_section. | |
2703 | if (is_new) | |
2704 | delete pomb; | |
2705 | return false; | |
2706 | } | |
b8e6aad9 ILT |
2707 | } |
2708 | ||
c0a62865 | 2709 | // Build a relaxation map to speed up relaxation of existing input sections. |
2ea97941 | 2710 | // Look up to the first LIMIT elements in INPUT_SECTIONS. |
c0a62865 | 2711 | |
20e6d0d6 | 2712 | void |
c0a62865 | 2713 | Output_section::build_relaxation_map( |
2ea97941 | 2714 | const Input_section_list& input_sections, |
c0a62865 DK |
2715 | size_t limit, |
2716 | Relaxation_map* relaxation_map) const | |
20e6d0d6 | 2717 | { |
c0a62865 DK |
2718 | for (size_t i = 0; i < limit; ++i) |
2719 | { | |
2ea97941 | 2720 | const Input_section& is(input_sections[i]); |
c0a62865 DK |
2721 | if (is.is_input_section() || is.is_relaxed_input_section()) |
2722 | { | |
5ac169d4 DK |
2723 | Section_id sid(is.relobj(), is.shndx()); |
2724 | (*relaxation_map)[sid] = i; | |
c0a62865 DK |
2725 | } |
2726 | } | |
2727 | } | |
2728 | ||
2729 | // Convert regular input sections in INPUT_SECTIONS into relaxed input | |
5ac169d4 DK |
2730 | // sections in RELAXED_SECTIONS. MAP is a prebuilt map from section id |
2731 | // indices of INPUT_SECTIONS. | |
20e6d0d6 | 2732 | |
c0a62865 DK |
2733 | void |
2734 | Output_section::convert_input_sections_in_list_to_relaxed_sections( | |
2735 | const std::vector<Output_relaxed_input_section*>& relaxed_sections, | |
2736 | const Relaxation_map& map, | |
2ea97941 | 2737 | Input_section_list* input_sections) |
c0a62865 DK |
2738 | { |
2739 | for (size_t i = 0; i < relaxed_sections.size(); ++i) | |
2740 | { | |
2741 | Output_relaxed_input_section* poris = relaxed_sections[i]; | |
5ac169d4 DK |
2742 | Section_id sid(poris->relobj(), poris->shndx()); |
2743 | Relaxation_map::const_iterator p = map.find(sid); | |
c0a62865 | 2744 | gold_assert(p != map.end()); |
2ea97941 | 2745 | gold_assert((*input_sections)[p->second].is_input_section()); |
d06fb4d1 DK |
2746 | |
2747 | // Remember section order index of original input section | |
2748 | // if it is set. Copy it to the relaxed input section. | |
2749 | unsigned int soi = | |
2750 | (*input_sections)[p->second].section_order_index(); | |
2ea97941 | 2751 | (*input_sections)[p->second] = Input_section(poris); |
d06fb4d1 | 2752 | (*input_sections)[p->second].set_section_order_index(soi); |
c0a62865 DK |
2753 | } |
2754 | } | |
50ed5eb1 | 2755 | |
c0a62865 DK |
2756 | // Convert regular input sections into relaxed input sections. RELAXED_SECTIONS |
2757 | // is a vector of pointers to Output_relaxed_input_section or its derived | |
2758 | // classes. The relaxed sections must correspond to existing input sections. | |
2759 | ||
2760 | void | |
2761 | Output_section::convert_input_sections_to_relaxed_sections( | |
2762 | const std::vector<Output_relaxed_input_section*>& relaxed_sections) | |
2763 | { | |
029ba973 | 2764 | gold_assert(parameters->target().may_relax()); |
20e6d0d6 | 2765 | |
c0a62865 DK |
2766 | // We want to make sure that restore_states does not undo the effect of |
2767 | // this. If there is no checkpoint active, just search the current | |
2768 | // input section list and replace the sections there. If there is | |
2769 | // a checkpoint, also replace the sections there. | |
50ed5eb1 | 2770 | |
c0a62865 DK |
2771 | // By default, we look at the whole list. |
2772 | size_t limit = this->input_sections_.size(); | |
2773 | ||
2774 | if (this->checkpoint_ != NULL) | |
20e6d0d6 | 2775 | { |
c0a62865 DK |
2776 | // Replace input sections with relaxed input section in the saved |
2777 | // copy of the input section list. | |
2778 | if (this->checkpoint_->input_sections_saved()) | |
20e6d0d6 | 2779 | { |
c0a62865 DK |
2780 | Relaxation_map map; |
2781 | this->build_relaxation_map( | |
2782 | *(this->checkpoint_->input_sections()), | |
2783 | this->checkpoint_->input_sections()->size(), | |
2784 | &map); | |
2785 | this->convert_input_sections_in_list_to_relaxed_sections( | |
2786 | relaxed_sections, | |
2787 | map, | |
2788 | this->checkpoint_->input_sections()); | |
2789 | } | |
2790 | else | |
2791 | { | |
2792 | // We have not copied the input section list yet. Instead, just | |
2793 | // look at the portion that would be saved. | |
2794 | limit = this->checkpoint_->input_sections_size(); | |
20e6d0d6 | 2795 | } |
20e6d0d6 | 2796 | } |
c0a62865 DK |
2797 | |
2798 | // Convert input sections in input_section_list. | |
2799 | Relaxation_map map; | |
2800 | this->build_relaxation_map(this->input_sections_, limit, &map); | |
2801 | this->convert_input_sections_in_list_to_relaxed_sections( | |
2802 | relaxed_sections, | |
2803 | map, | |
2804 | &this->input_sections_); | |
41263c05 DK |
2805 | |
2806 | // Update fast look-up map. | |
0439c796 | 2807 | if (this->lookup_maps_->is_valid()) |
41263c05 DK |
2808 | for (size_t i = 0; i < relaxed_sections.size(); ++i) |
2809 | { | |
2810 | Output_relaxed_input_section* poris = relaxed_sections[i]; | |
0439c796 DK |
2811 | this->lookup_maps_->add_relaxed_input_section(poris->relobj(), |
2812 | poris->shndx(), poris); | |
41263c05 | 2813 | } |
20e6d0d6 DK |
2814 | } |
2815 | ||
9c547ec3 ILT |
2816 | // Update the output section flags based on input section flags. |
2817 | ||
2818 | void | |
2ea97941 | 2819 | Output_section::update_flags_for_input_section(elfcpp::Elf_Xword flags) |
9c547ec3 ILT |
2820 | { |
2821 | // If we created the section with SHF_ALLOC clear, we set the | |
2822 | // address. If we are now setting the SHF_ALLOC flag, we need to | |
2823 | // undo that. | |
2824 | if ((this->flags_ & elfcpp::SHF_ALLOC) == 0 | |
2ea97941 | 2825 | && (flags & elfcpp::SHF_ALLOC) != 0) |
9c547ec3 ILT |
2826 | this->mark_address_invalid(); |
2827 | ||
2ea97941 | 2828 | this->flags_ |= (flags |
9c547ec3 ILT |
2829 | & (elfcpp::SHF_WRITE |
2830 | | elfcpp::SHF_ALLOC | |
2831 | | elfcpp::SHF_EXECINSTR)); | |
e8cd95c7 ILT |
2832 | |
2833 | if ((flags & elfcpp::SHF_MERGE) == 0) | |
2834 | this->flags_ &=~ elfcpp::SHF_MERGE; | |
2835 | else | |
2836 | { | |
2837 | if (this->current_data_size_for_child() == 0) | |
2838 | this->flags_ |= elfcpp::SHF_MERGE; | |
2839 | } | |
2840 | ||
2841 | if ((flags & elfcpp::SHF_STRINGS) == 0) | |
2842 | this->flags_ &=~ elfcpp::SHF_STRINGS; | |
2843 | else | |
2844 | { | |
2845 | if (this->current_data_size_for_child() == 0) | |
2846 | this->flags_ |= elfcpp::SHF_STRINGS; | |
2847 | } | |
9c547ec3 ILT |
2848 | } |
2849 | ||
2ea97941 | 2850 | // Find the merge section into which an input section with index SHNDX in |
c0a62865 DK |
2851 | // OBJECT has been added. Return NULL if none found. |
2852 | ||
2853 | Output_section_data* | |
2854 | Output_section::find_merge_section(const Relobj* object, | |
2ea97941 | 2855 | unsigned int shndx) const |
c0a62865 | 2856 | { |
0439c796 DK |
2857 | if (!this->lookup_maps_->is_valid()) |
2858 | this->build_lookup_maps(); | |
2859 | return this->lookup_maps_->find_merge_section(object, shndx); | |
2860 | } | |
2861 | ||
2862 | // Build the lookup maps for merge and relaxed sections. This is needs | |
2863 | // to be declared as a const methods so that it is callable with a const | |
2864 | // Output_section pointer. The method only updates states of the maps. | |
2865 | ||
2866 | void | |
2867 | Output_section::build_lookup_maps() const | |
2868 | { | |
2869 | this->lookup_maps_->clear(); | |
2870 | for (Input_section_list::const_iterator p = this->input_sections_.begin(); | |
2871 | p != this->input_sections_.end(); | |
2872 | ++p) | |
c0a62865 | 2873 | { |
0439c796 DK |
2874 | if (p->is_merge_section()) |
2875 | { | |
2876 | Output_merge_base* pomb = p->output_merge_base(); | |
2877 | Merge_section_properties msp(pomb->is_string(), pomb->entsize(), | |
2878 | pomb->addralign()); | |
2879 | this->lookup_maps_->add_merge_section(msp, pomb); | |
2880 | for (Output_merge_base::Input_sections::const_iterator is = | |
2881 | pomb->input_sections_begin(); | |
2882 | is != pomb->input_sections_end(); | |
50ed5eb1 | 2883 | ++is) |
0439c796 DK |
2884 | { |
2885 | const Const_section_id& csid = *is; | |
2886 | this->lookup_maps_->add_merge_input_section(csid.first, | |
2887 | csid.second, pomb); | |
2888 | } | |
50ed5eb1 | 2889 | |
0439c796 DK |
2890 | } |
2891 | else if (p->is_relaxed_input_section()) | |
2892 | { | |
2893 | Output_relaxed_input_section* poris = p->relaxed_input_section(); | |
2894 | this->lookup_maps_->add_relaxed_input_section(poris->relobj(), | |
2895 | poris->shndx(), poris); | |
2896 | } | |
c0a62865 | 2897 | } |
c0a62865 DK |
2898 | } |
2899 | ||
2900 | // Find an relaxed input section corresponding to an input section | |
2ea97941 | 2901 | // in OBJECT with index SHNDX. |
c0a62865 | 2902 | |
d6344fb5 | 2903 | const Output_relaxed_input_section* |
c0a62865 | 2904 | Output_section::find_relaxed_input_section(const Relobj* object, |
2ea97941 | 2905 | unsigned int shndx) const |
c0a62865 | 2906 | { |
0439c796 DK |
2907 | if (!this->lookup_maps_->is_valid()) |
2908 | this->build_lookup_maps(); | |
2909 | return this->lookup_maps_->find_relaxed_input_section(object, shndx); | |
c0a62865 DK |
2910 | } |
2911 | ||
2ea97941 ILT |
2912 | // Given an address OFFSET relative to the start of input section |
2913 | // SHNDX in OBJECT, return whether this address is being included in | |
2914 | // the final link. This should only be called if SHNDX in OBJECT has | |
730cdc88 ILT |
2915 | // a special mapping. |
2916 | ||
2917 | bool | |
2918 | Output_section::is_input_address_mapped(const Relobj* object, | |
2ea97941 ILT |
2919 | unsigned int shndx, |
2920 | off_t offset) const | |
730cdc88 | 2921 | { |
c0a62865 | 2922 | // Look at the Output_section_data_maps first. |
2ea97941 | 2923 | const Output_section_data* posd = this->find_merge_section(object, shndx); |
c0a62865 | 2924 | if (posd == NULL) |
2ea97941 | 2925 | posd = this->find_relaxed_input_section(object, shndx); |
c0a62865 DK |
2926 | |
2927 | if (posd != NULL) | |
2928 | { | |
2ea97941 ILT |
2929 | section_offset_type output_offset; |
2930 | bool found = posd->output_offset(object, shndx, offset, &output_offset); | |
50ed5eb1 | 2931 | gold_assert(found); |
2ea97941 | 2932 | return output_offset != -1; |
c0a62865 DK |
2933 | } |
2934 | ||
2935 | // Fall back to the slow look-up. | |
730cdc88 ILT |
2936 | for (Input_section_list::const_iterator p = this->input_sections_.begin(); |
2937 | p != this->input_sections_.end(); | |
2938 | ++p) | |
2939 | { | |
2ea97941 ILT |
2940 | section_offset_type output_offset; |
2941 | if (p->output_offset(object, shndx, offset, &output_offset)) | |
2942 | return output_offset != -1; | |
730cdc88 ILT |
2943 | } |
2944 | ||
2945 | // By default we assume that the address is mapped. This should | |
2946 | // only be called after we have passed all sections to Layout. At | |
2947 | // that point we should know what we are discarding. | |
2948 | return true; | |
2949 | } | |
2950 | ||
2ea97941 ILT |
2951 | // Given an address OFFSET relative to the start of input section |
2952 | // SHNDX in object OBJECT, return the output offset relative to the | |
1e983657 | 2953 | // start of the input section in the output section. This should only |
2ea97941 | 2954 | // be called if SHNDX in OBJECT has a special mapping. |
730cdc88 | 2955 | |
8383303e | 2956 | section_offset_type |
2ea97941 ILT |
2957 | Output_section::output_offset(const Relobj* object, unsigned int shndx, |
2958 | section_offset_type offset) const | |
730cdc88 | 2959 | { |
c0a62865 DK |
2960 | // This can only be called meaningfully when we know the data size |
2961 | // of this. | |
2962 | gold_assert(this->is_data_size_valid()); | |
730cdc88 | 2963 | |
c0a62865 | 2964 | // Look at the Output_section_data_maps first. |
2ea97941 | 2965 | const Output_section_data* posd = this->find_merge_section(object, shndx); |
50ed5eb1 | 2966 | if (posd == NULL) |
2ea97941 | 2967 | posd = this->find_relaxed_input_section(object, shndx); |
c0a62865 DK |
2968 | if (posd != NULL) |
2969 | { | |
2ea97941 ILT |
2970 | section_offset_type output_offset; |
2971 | bool found = posd->output_offset(object, shndx, offset, &output_offset); | |
50ed5eb1 | 2972 | gold_assert(found); |
2ea97941 | 2973 | return output_offset; |
c0a62865 DK |
2974 | } |
2975 | ||
2976 | // Fall back to the slow look-up. | |
730cdc88 ILT |
2977 | for (Input_section_list::const_iterator p = this->input_sections_.begin(); |
2978 | p != this->input_sections_.end(); | |
2979 | ++p) | |
2980 | { | |
2ea97941 ILT |
2981 | section_offset_type output_offset; |
2982 | if (p->output_offset(object, shndx, offset, &output_offset)) | |
2983 | return output_offset; | |
730cdc88 ILT |
2984 | } |
2985 | gold_unreachable(); | |
2986 | } | |
2987 | ||
2ea97941 ILT |
2988 | // Return the output virtual address of OFFSET relative to the start |
2989 | // of input section SHNDX in object OBJECT. | |
b8e6aad9 ILT |
2990 | |
2991 | uint64_t | |
2ea97941 ILT |
2992 | Output_section::output_address(const Relobj* object, unsigned int shndx, |
2993 | off_t offset) const | |
b8e6aad9 ILT |
2994 | { |
2995 | uint64_t addr = this->address() + this->first_input_offset_; | |
c0a62865 DK |
2996 | |
2997 | // Look at the Output_section_data_maps first. | |
2ea97941 | 2998 | const Output_section_data* posd = this->find_merge_section(object, shndx); |
50ed5eb1 | 2999 | if (posd == NULL) |
2ea97941 | 3000 | posd = this->find_relaxed_input_section(object, shndx); |
c0a62865 DK |
3001 | if (posd != NULL && posd->is_address_valid()) |
3002 | { | |
2ea97941 ILT |
3003 | section_offset_type output_offset; |
3004 | bool found = posd->output_offset(object, shndx, offset, &output_offset); | |
c0a62865 | 3005 | gold_assert(found); |
2ea97941 | 3006 | return posd->address() + output_offset; |
c0a62865 DK |
3007 | } |
3008 | ||
3009 | // Fall back to the slow look-up. | |
b8e6aad9 ILT |
3010 | for (Input_section_list::const_iterator p = this->input_sections_.begin(); |
3011 | p != this->input_sections_.end(); | |
3012 | ++p) | |
3013 | { | |
3014 | addr = align_address(addr, p->addralign()); | |
2ea97941 ILT |
3015 | section_offset_type output_offset; |
3016 | if (p->output_offset(object, shndx, offset, &output_offset)) | |
730cdc88 | 3017 | { |
2ea97941 | 3018 | if (output_offset == -1) |
eff45813 | 3019 | return -1ULL; |
2ea97941 | 3020 | return addr + output_offset; |
730cdc88 | 3021 | } |
b8e6aad9 ILT |
3022 | addr += p->data_size(); |
3023 | } | |
3024 | ||
3025 | // If we get here, it means that we don't know the mapping for this | |
3026 | // input section. This might happen in principle if | |
3027 | // add_input_section were called before add_output_section_data. | |
3028 | // But it should never actually happen. | |
3029 | ||
3030 | gold_unreachable(); | |
ead1e424 ILT |
3031 | } |
3032 | ||
e29e076a | 3033 | // Find the output address of the start of the merged section for |
2ea97941 | 3034 | // input section SHNDX in object OBJECT. |
a9a60db6 | 3035 | |
e29e076a ILT |
3036 | bool |
3037 | Output_section::find_starting_output_address(const Relobj* object, | |
2ea97941 | 3038 | unsigned int shndx, |
e29e076a | 3039 | uint64_t* paddr) const |
a9a60db6 | 3040 | { |
c0a62865 DK |
3041 | // FIXME: This becomes a bottle-neck if we have many relaxed sections. |
3042 | // Looking up the merge section map does not always work as we sometimes | |
3043 | // find a merge section without its address set. | |
a9a60db6 ILT |
3044 | uint64_t addr = this->address() + this->first_input_offset_; |
3045 | for (Input_section_list::const_iterator p = this->input_sections_.begin(); | |
3046 | p != this->input_sections_.end(); | |
3047 | ++p) | |
3048 | { | |
3049 | addr = align_address(addr, p->addralign()); | |
3050 | ||
3051 | // It would be nice if we could use the existing output_offset | |
3052 | // method to get the output offset of input offset 0. | |
3053 | // Unfortunately we don't know for sure that input offset 0 is | |
3054 | // mapped at all. | |
2ea97941 | 3055 | if (p->is_merge_section_for(object, shndx)) |
e29e076a ILT |
3056 | { |
3057 | *paddr = addr; | |
3058 | return true; | |
3059 | } | |
a9a60db6 ILT |
3060 | |
3061 | addr += p->data_size(); | |
3062 | } | |
e29e076a ILT |
3063 | |
3064 | // We couldn't find a merge output section for this input section. | |
3065 | return false; | |
a9a60db6 ILT |
3066 | } |
3067 | ||
cdc29364 CC |
3068 | // Update the data size of an Output_section. |
3069 | ||
3070 | void | |
3071 | Output_section::update_data_size() | |
3072 | { | |
3073 | if (this->input_sections_.empty()) | |
3074 | return; | |
3075 | ||
3076 | if (this->must_sort_attached_input_sections() | |
3077 | || this->input_section_order_specified()) | |
3078 | this->sort_attached_input_sections(); | |
3079 | ||
3080 | off_t off = this->first_input_offset_; | |
3081 | for (Input_section_list::iterator p = this->input_sections_.begin(); | |
3082 | p != this->input_sections_.end(); | |
3083 | ++p) | |
3084 | { | |
3085 | off = align_address(off, p->addralign()); | |
3086 | off += p->current_data_size(); | |
3087 | } | |
3088 | ||
3089 | this->set_current_data_size_for_child(off); | |
3090 | } | |
3091 | ||
27bc2bce | 3092 | // Set the data size of an Output_section. This is where we handle |
ead1e424 ILT |
3093 | // setting the addresses of any Output_section_data objects. |
3094 | ||
3095 | void | |
27bc2bce | 3096 | Output_section::set_final_data_size() |
ead1e424 | 3097 | { |
9fbd3822 CC |
3098 | off_t data_size; |
3099 | ||
ead1e424 | 3100 | if (this->input_sections_.empty()) |
9fbd3822 CC |
3101 | data_size = this->current_data_size_for_child(); |
3102 | else | |
27bc2bce | 3103 | { |
9fbd3822 CC |
3104 | if (this->must_sort_attached_input_sections() |
3105 | || this->input_section_order_specified()) | |
3106 | this->sort_attached_input_sections(); | |
ead1e424 | 3107 | |
9fbd3822 CC |
3108 | uint64_t address = this->address(); |
3109 | off_t startoff = this->offset(); | |
3110 | off_t off = startoff + this->first_input_offset_; | |
3111 | for (Input_section_list::iterator p = this->input_sections_.begin(); | |
3112 | p != this->input_sections_.end(); | |
3113 | ++p) | |
3114 | { | |
3115 | off = align_address(off, p->addralign()); | |
3116 | p->set_address_and_file_offset(address + (off - startoff), off, | |
3117 | startoff); | |
3118 | off += p->data_size(); | |
3119 | } | |
3120 | data_size = off - startoff; | |
3121 | } | |
2fd32231 | 3122 | |
9fbd3822 CC |
3123 | // For full incremental links, we want to allocate some patch space |
3124 | // in most sections for subsequent incremental updates. | |
3125 | if (this->is_patch_space_allowed_ && parameters->incremental_full()) | |
ead1e424 | 3126 | { |
9fbd3822 | 3127 | double pct = parameters->options().incremental_patch(); |
8ea8cd50 CC |
3128 | size_t extra = static_cast<size_t>(data_size * pct); |
3129 | if (this->free_space_fill_ != NULL | |
3130 | && this->free_space_fill_->minimum_hole_size() > extra) | |
3131 | extra = this->free_space_fill_->minimum_hole_size(); | |
9fbd3822 CC |
3132 | off_t new_size = align_address(data_size + extra, this->addralign()); |
3133 | this->patch_space_ = new_size - data_size; | |
3134 | gold_debug(DEBUG_INCREMENTAL, | |
3135 | "set_final_data_size: %08lx + %08lx: section %s", | |
3136 | static_cast<long>(data_size), | |
3137 | static_cast<long>(this->patch_space_), | |
3138 | this->name()); | |
3139 | data_size = new_size; | |
ead1e424 ILT |
3140 | } |
3141 | ||
9fbd3822 | 3142 | this->set_data_size(data_size); |
ead1e424 | 3143 | } |
9a0910c3 | 3144 | |
a445fddf ILT |
3145 | // Reset the address and file offset. |
3146 | ||
3147 | void | |
3148 | Output_section::do_reset_address_and_file_offset() | |
3149 | { | |
20e6d0d6 DK |
3150 | // An unallocated section has no address. Forcing this means that |
3151 | // we don't need special treatment for symbols defined in debug | |
1e5d2fb1 DK |
3152 | // sections. We do the same in the constructor. This does not |
3153 | // apply to NOLOAD sections though. | |
3154 | if (((this->flags_ & elfcpp::SHF_ALLOC) == 0) && !this->is_noload_) | |
20e6d0d6 DK |
3155 | this->set_address(0); |
3156 | ||
a445fddf ILT |
3157 | for (Input_section_list::iterator p = this->input_sections_.begin(); |
3158 | p != this->input_sections_.end(); | |
3159 | ++p) | |
3160 | p->reset_address_and_file_offset(); | |
9fbd3822 CC |
3161 | |
3162 | // Remove any patch space that was added in set_final_data_size. | |
3163 | if (this->patch_space_ > 0) | |
3164 | { | |
3165 | this->set_current_data_size_for_child(this->current_data_size_for_child() | |
3166 | - this->patch_space_); | |
3167 | this->patch_space_ = 0; | |
3168 | } | |
a445fddf | 3169 | } |
9fbd3822 | 3170 | |
20e6d0d6 DK |
3171 | // Return true if address and file offset have the values after reset. |
3172 | ||
3173 | bool | |
3174 | Output_section::do_address_and_file_offset_have_reset_values() const | |
3175 | { | |
3176 | if (this->is_offset_valid()) | |
3177 | return false; | |
3178 | ||
3179 | // An unallocated section has address 0 after its construction or a reset. | |
3180 | if ((this->flags_ & elfcpp::SHF_ALLOC) == 0) | |
3181 | return this->is_address_valid() && this->address() == 0; | |
3182 | else | |
3183 | return !this->is_address_valid(); | |
3184 | } | |
a445fddf | 3185 | |
7bf1f802 ILT |
3186 | // Set the TLS offset. Called only for SHT_TLS sections. |
3187 | ||
3188 | void | |
3189 | Output_section::do_set_tls_offset(uint64_t tls_base) | |
3190 | { | |
3191 | this->tls_offset_ = this->address() - tls_base; | |
3192 | } | |
3193 | ||
2fd32231 ILT |
3194 | // In a few cases we need to sort the input sections attached to an |
3195 | // output section. This is used to implement the type of constructor | |
3196 | // priority ordering implemented by the GNU linker, in which the | |
3197 | // priority becomes part of the section name and the sections are | |
3198 | // sorted by name. We only do this for an output section if we see an | |
5393d741 | 3199 | // attached input section matching ".ctors.*", ".dtors.*", |
2fd32231 ILT |
3200 | // ".init_array.*" or ".fini_array.*". |
3201 | ||
3202 | class Output_section::Input_section_sort_entry | |
3203 | { | |
3204 | public: | |
3205 | Input_section_sort_entry() | |
3206 | : input_section_(), index_(-1U), section_has_name_(false), | |
3207 | section_name_() | |
3208 | { } | |
3209 | ||
2ea97941 | 3210 | Input_section_sort_entry(const Input_section& input_section, |
6e9ba2ca ST |
3211 | unsigned int index, |
3212 | bool must_sort_attached_input_sections) | |
2ea97941 ILT |
3213 | : input_section_(input_section), index_(index), |
3214 | section_has_name_(input_section.is_input_section() | |
3215 | || input_section.is_relaxed_input_section()) | |
2fd32231 | 3216 | { |
6e9ba2ca ST |
3217 | if (this->section_has_name_ |
3218 | && must_sort_attached_input_sections) | |
2fd32231 ILT |
3219 | { |
3220 | // This is only called single-threaded from Layout::finalize, | |
3221 | // so it is OK to lock. Unfortunately we have no way to pass | |
3222 | // in a Task token. | |
3223 | const Task* dummy_task = reinterpret_cast<const Task*>(-1); | |
2ea97941 ILT |
3224 | Object* obj = (input_section.is_input_section() |
3225 | ? input_section.relobj() | |
3226 | : input_section.relaxed_input_section()->relobj()); | |
2fd32231 ILT |
3227 | Task_lock_obj<Object> tl(dummy_task, obj); |
3228 | ||
3229 | // This is a slow operation, which should be cached in | |
3230 | // Layout::layout if this becomes a speed problem. | |
2ea97941 | 3231 | this->section_name_ = obj->section_name(input_section.shndx()); |
2fd32231 ILT |
3232 | } |
3233 | } | |
3234 | ||
3235 | // Return the Input_section. | |
3236 | const Input_section& | |
3237 | input_section() const | |
3238 | { | |
3239 | gold_assert(this->index_ != -1U); | |
3240 | return this->input_section_; | |
3241 | } | |
3242 | ||
3243 | // The index of this entry in the original list. This is used to | |
3244 | // make the sort stable. | |
3245 | unsigned int | |
3246 | index() const | |
3247 | { | |
3248 | gold_assert(this->index_ != -1U); | |
3249 | return this->index_; | |
3250 | } | |
3251 | ||
3252 | // Whether there is a section name. | |
3253 | bool | |
3254 | section_has_name() const | |
3255 | { return this->section_has_name_; } | |
3256 | ||
3257 | // The section name. | |
3258 | const std::string& | |
3259 | section_name() const | |
3260 | { | |
3261 | gold_assert(this->section_has_name_); | |
3262 | return this->section_name_; | |
3263 | } | |
3264 | ||
ab794b6b ILT |
3265 | // Return true if the section name has a priority. This is assumed |
3266 | // to be true if it has a dot after the initial dot. | |
2fd32231 | 3267 | bool |
ab794b6b | 3268 | has_priority() const |
2fd32231 ILT |
3269 | { |
3270 | gold_assert(this->section_has_name_); | |
2a0ff005 | 3271 | return this->section_name_.find('.', 1) != std::string::npos; |
2fd32231 ILT |
3272 | } |
3273 | ||
5393d741 ILT |
3274 | // Return the priority. Believe it or not, gcc encodes the priority |
3275 | // differently for .ctors/.dtors and .init_array/.fini_array | |
3276 | // sections. | |
3277 | unsigned int | |
3278 | get_priority() const | |
3279 | { | |
3280 | gold_assert(this->section_has_name_); | |
3281 | bool is_ctors; | |
3282 | if (is_prefix_of(".ctors.", this->section_name_.c_str()) | |
3283 | || is_prefix_of(".dtors.", this->section_name_.c_str())) | |
3284 | is_ctors = true; | |
3285 | else if (is_prefix_of(".init_array.", this->section_name_.c_str()) | |
3286 | || is_prefix_of(".fini_array.", this->section_name_.c_str())) | |
3287 | is_ctors = false; | |
3288 | else | |
3289 | return 0; | |
3290 | char* end; | |
3291 | unsigned long prio = strtoul((this->section_name_.c_str() | |
3292 | + (is_ctors ? 7 : 12)), | |
3293 | &end, 10); | |
3294 | if (*end != '\0') | |
3295 | return 0; | |
3296 | else if (is_ctors) | |
3297 | return 65535 - prio; | |
3298 | else | |
3299 | return prio; | |
3300 | } | |
3301 | ||
ab794b6b ILT |
3302 | // Return true if this an input file whose base name matches |
3303 | // FILE_NAME. The base name must have an extension of ".o", and | |
3304 | // must be exactly FILE_NAME.o or FILE_NAME, one character, ".o". | |
3305 | // This is to match crtbegin.o as well as crtbeginS.o without | |
3306 | // getting confused by other possibilities. Overall matching the | |
3307 | // file name this way is a dreadful hack, but the GNU linker does it | |
3308 | // in order to better support gcc, and we need to be compatible. | |
2fd32231 | 3309 | bool |
5393d741 | 3310 | match_file_name(const char* file_name) const |
edcac0c1 ILT |
3311 | { |
3312 | if (this->input_section_.is_output_section_data()) | |
3313 | return false; | |
3314 | return Layout::match_file_name(this->input_section_.relobj(), file_name); | |
3315 | } | |
2fd32231 | 3316 | |
8fe2a369 ST |
3317 | // Returns 1 if THIS should appear before S in section order, -1 if S |
3318 | // appears before THIS and 0 if they are not comparable. | |
6e9ba2ca ST |
3319 | int |
3320 | compare_section_ordering(const Input_section_sort_entry& s) const | |
3321 | { | |
8fe2a369 ST |
3322 | unsigned int this_secn_index = this->input_section_.section_order_index(); |
3323 | unsigned int s_secn_index = s.input_section().section_order_index(); | |
3324 | if (this_secn_index > 0 && s_secn_index > 0) | |
3325 | { | |
3326 | if (this_secn_index < s_secn_index) | |
3327 | return 1; | |
3328 | else if (this_secn_index > s_secn_index) | |
3329 | return -1; | |
3330 | } | |
3331 | return 0; | |
6e9ba2ca ST |
3332 | } |
3333 | ||
2fd32231 ILT |
3334 | private: |
3335 | // The Input_section we are sorting. | |
3336 | Input_section input_section_; | |
3337 | // The index of this Input_section in the original list. | |
3338 | unsigned int index_; | |
3339 | // Whether this Input_section has a section name--it won't if this | |
3340 | // is some random Output_section_data. | |
3341 | bool section_has_name_; | |
3342 | // The section name if there is one. | |
3343 | std::string section_name_; | |
3344 | }; | |
3345 | ||
3346 | // Return true if S1 should come before S2 in the output section. | |
3347 | ||
3348 | bool | |
3349 | Output_section::Input_section_sort_compare::operator()( | |
3350 | const Output_section::Input_section_sort_entry& s1, | |
3351 | const Output_section::Input_section_sort_entry& s2) const | |
3352 | { | |
ab794b6b ILT |
3353 | // crtbegin.o must come first. |
3354 | bool s1_begin = s1.match_file_name("crtbegin"); | |
3355 | bool s2_begin = s2.match_file_name("crtbegin"); | |
2fd32231 ILT |
3356 | if (s1_begin || s2_begin) |
3357 | { | |
3358 | if (!s1_begin) | |
3359 | return false; | |
3360 | if (!s2_begin) | |
3361 | return true; | |
3362 | return s1.index() < s2.index(); | |
3363 | } | |
3364 | ||
ab794b6b ILT |
3365 | // crtend.o must come last. |
3366 | bool s1_end = s1.match_file_name("crtend"); | |
3367 | bool s2_end = s2.match_file_name("crtend"); | |
2fd32231 ILT |
3368 | if (s1_end || s2_end) |
3369 | { | |
3370 | if (!s1_end) | |
3371 | return true; | |
3372 | if (!s2_end) | |
3373 | return false; | |
3374 | return s1.index() < s2.index(); | |
3375 | } | |
3376 | ||
ab794b6b ILT |
3377 | // We sort all the sections with no names to the end. |
3378 | if (!s1.section_has_name() || !s2.section_has_name()) | |
3379 | { | |
3380 | if (s1.section_has_name()) | |
3381 | return true; | |
3382 | if (s2.section_has_name()) | |
3383 | return false; | |
3384 | return s1.index() < s2.index(); | |
3385 | } | |
2fd32231 | 3386 | |
ab794b6b | 3387 | // A section with a priority follows a section without a priority. |
ab794b6b ILT |
3388 | bool s1_has_priority = s1.has_priority(); |
3389 | bool s2_has_priority = s2.has_priority(); | |
3390 | if (s1_has_priority && !s2_has_priority) | |
2fd32231 | 3391 | return false; |
ab794b6b | 3392 | if (!s1_has_priority && s2_has_priority) |
2fd32231 ILT |
3393 | return true; |
3394 | ||
6e9ba2ca ST |
3395 | // Check if a section order exists for these sections through a section |
3396 | // ordering file. If sequence_num is 0, an order does not exist. | |
3397 | int sequence_num = s1.compare_section_ordering(s2); | |
3398 | if (sequence_num != 0) | |
3399 | return sequence_num == 1; | |
3400 | ||
2fd32231 ILT |
3401 | // Otherwise we sort by name. |
3402 | int compare = s1.section_name().compare(s2.section_name()); | |
3403 | if (compare != 0) | |
3404 | return compare < 0; | |
3405 | ||
3406 | // Otherwise we keep the input order. | |
3407 | return s1.index() < s2.index(); | |
3408 | } | |
3409 | ||
2a0ff005 DK |
3410 | // Return true if S1 should come before S2 in an .init_array or .fini_array |
3411 | // output section. | |
3412 | ||
3413 | bool | |
3414 | Output_section::Input_section_sort_init_fini_compare::operator()( | |
3415 | const Output_section::Input_section_sort_entry& s1, | |
3416 | const Output_section::Input_section_sort_entry& s2) const | |
3417 | { | |
3418 | // We sort all the sections with no names to the end. | |
3419 | if (!s1.section_has_name() || !s2.section_has_name()) | |
3420 | { | |
3421 | if (s1.section_has_name()) | |
3422 | return true; | |
3423 | if (s2.section_has_name()) | |
3424 | return false; | |
3425 | return s1.index() < s2.index(); | |
3426 | } | |
3427 | ||
3428 | // A section without a priority follows a section with a priority. | |
3429 | // This is the reverse of .ctors and .dtors sections. | |
3430 | bool s1_has_priority = s1.has_priority(); | |
3431 | bool s2_has_priority = s2.has_priority(); | |
3432 | if (s1_has_priority && !s2_has_priority) | |
3433 | return true; | |
3434 | if (!s1_has_priority && s2_has_priority) | |
3435 | return false; | |
3436 | ||
5393d741 ILT |
3437 | // .ctors and .dtors sections without priority come after |
3438 | // .init_array and .fini_array sections without priority. | |
3439 | if (!s1_has_priority | |
3440 | && (s1.section_name() == ".ctors" || s1.section_name() == ".dtors") | |
3441 | && s1.section_name() != s2.section_name()) | |
3442 | return false; | |
3443 | if (!s2_has_priority | |
3444 | && (s2.section_name() == ".ctors" || s2.section_name() == ".dtors") | |
3445 | && s2.section_name() != s1.section_name()) | |
3446 | return true; | |
3447 | ||
3448 | // Sort by priority if we can. | |
3449 | if (s1_has_priority) | |
3450 | { | |
3451 | unsigned int s1_prio = s1.get_priority(); | |
3452 | unsigned int s2_prio = s2.get_priority(); | |
3453 | if (s1_prio < s2_prio) | |
3454 | return true; | |
3455 | else if (s1_prio > s2_prio) | |
3456 | return false; | |
3457 | } | |
3458 | ||
6e9ba2ca ST |
3459 | // Check if a section order exists for these sections through a section |
3460 | // ordering file. If sequence_num is 0, an order does not exist. | |
3461 | int sequence_num = s1.compare_section_ordering(s2); | |
3462 | if (sequence_num != 0) | |
3463 | return sequence_num == 1; | |
3464 | ||
2a0ff005 DK |
3465 | // Otherwise we sort by name. |
3466 | int compare = s1.section_name().compare(s2.section_name()); | |
3467 | if (compare != 0) | |
3468 | return compare < 0; | |
3469 | ||
3470 | // Otherwise we keep the input order. | |
3471 | return s1.index() < s2.index(); | |
3472 | } | |
3473 | ||
8fe2a369 ST |
3474 | // Return true if S1 should come before S2. Sections that do not match |
3475 | // any pattern in the section ordering file are placed ahead of the sections | |
edcac0c1 | 3476 | // that match some pattern. |
8fe2a369 | 3477 | |
6e9ba2ca ST |
3478 | bool |
3479 | Output_section::Input_section_sort_section_order_index_compare::operator()( | |
3480 | const Output_section::Input_section_sort_entry& s1, | |
3481 | const Output_section::Input_section_sort_entry& s2) const | |
3482 | { | |
8fe2a369 ST |
3483 | unsigned int s1_secn_index = s1.input_section().section_order_index(); |
3484 | unsigned int s2_secn_index = s2.input_section().section_order_index(); | |
6e9ba2ca | 3485 | |
edcac0c1 ILT |
3486 | // Keep input order if section ordering cannot determine order. |
3487 | if (s1_secn_index == s2_secn_index) | |
28f2a4ac | 3488 | return s1.index() < s2.index(); |
edcac0c1 ILT |
3489 | |
3490 | return s1_secn_index < s2_secn_index; | |
6e9ba2ca ST |
3491 | } |
3492 | ||
c6ac678d ST |
3493 | // Return true if S1 should come before S2. This is the sort comparison |
3494 | // function for .text to sort sections with prefixes | |
3495 | // .text.{unlikely,exit,startup,hot} before other sections. | |
3496 | bool | |
3497 | Output_section::Input_section_sort_section_name_special_ordering_compare | |
3498 | ::operator()( | |
3499 | const Output_section::Input_section_sort_entry& s1, | |
3500 | const Output_section::Input_section_sort_entry& s2) const | |
3501 | { | |
3502 | // We sort all the sections with no names to the end. | |
3503 | if (!s1.section_has_name() || !s2.section_has_name()) | |
3504 | { | |
3505 | if (s1.section_has_name()) | |
3506 | return true; | |
3507 | if (s2.section_has_name()) | |
3508 | return false; | |
3509 | return s1.index() < s2.index(); | |
3510 | } | |
3511 | ||
3512 | // Some input section names have special ordering requirements. | |
3513 | int o1 = Layout::special_ordering_of_input_section(s1.section_name().c_str()); | |
3514 | int o2 = Layout::special_ordering_of_input_section(s2.section_name().c_str()); | |
3515 | if (o1 != o2) | |
3516 | { | |
3517 | if (o1 < 0) | |
3518 | return false; | |
3519 | else if (o2 < 0) | |
3520 | return true; | |
3521 | else | |
3522 | return o1 < o2; | |
3523 | } | |
3524 | ||
3525 | // Keep input order otherwise. | |
3526 | return s1.index() < s2.index(); | |
3527 | } | |
3528 | ||
e9552f7e ST |
3529 | // This updates the section order index of input sections according to the |
3530 | // the order specified in the mapping from Section id to order index. | |
3531 | ||
3532 | void | |
3533 | Output_section::update_section_layout( | |
f0558624 | 3534 | const Section_layout_order* order_map) |
e9552f7e ST |
3535 | { |
3536 | for (Input_section_list::iterator p = this->input_sections_.begin(); | |
3537 | p != this->input_sections_.end(); | |
3538 | ++p) | |
3539 | { | |
3540 | if (p->is_input_section() | |
3541 | || p->is_relaxed_input_section()) | |
3542 | { | |
3543 | Object* obj = (p->is_input_section() | |
3544 | ? p->relobj() | |
3545 | : p->relaxed_input_section()->relobj()); | |
3546 | unsigned int shndx = p->shndx(); | |
3547 | Section_layout_order::const_iterator it | |
f0558624 ST |
3548 | = order_map->find(Section_id(obj, shndx)); |
3549 | if (it == order_map->end()) | |
e9552f7e ST |
3550 | continue; |
3551 | unsigned int section_order_index = it->second; | |
3552 | if (section_order_index != 0) | |
3553 | { | |
3554 | p->set_section_order_index(section_order_index); | |
3555 | this->set_input_section_order_specified(); | |
3556 | } | |
3557 | } | |
3558 | } | |
3559 | } | |
3560 | ||
2fd32231 ILT |
3561 | // Sort the input sections attached to an output section. |
3562 | ||
3563 | void | |
3564 | Output_section::sort_attached_input_sections() | |
3565 | { | |
3566 | if (this->attached_input_sections_are_sorted_) | |
3567 | return; | |
3568 | ||
20e6d0d6 DK |
3569 | if (this->checkpoint_ != NULL |
3570 | && !this->checkpoint_->input_sections_saved()) | |
3571 | this->checkpoint_->save_input_sections(); | |
3572 | ||
2fd32231 ILT |
3573 | // The only thing we know about an input section is the object and |
3574 | // the section index. We need the section name. Recomputing this | |
3575 | // is slow but this is an unusual case. If this becomes a speed | |
3576 | // problem we can cache the names as required in Layout::layout. | |
3577 | ||
3578 | // We start by building a larger vector holding a copy of each | |
3579 | // Input_section, plus its current index in the list and its name. | |
3580 | std::vector<Input_section_sort_entry> sort_list; | |
3581 | ||
3582 | unsigned int i = 0; | |
3583 | for (Input_section_list::iterator p = this->input_sections_.begin(); | |
3584 | p != this->input_sections_.end(); | |
3585 | ++p, ++i) | |
6e9ba2ca | 3586 | sort_list.push_back(Input_section_sort_entry(*p, i, |
edcac0c1 | 3587 | this->must_sort_attached_input_sections())); |
2fd32231 ILT |
3588 | |
3589 | // Sort the input sections. | |
6e9ba2ca ST |
3590 | if (this->must_sort_attached_input_sections()) |
3591 | { | |
3592 | if (this->type() == elfcpp::SHT_PREINIT_ARRAY | |
3593 | || this->type() == elfcpp::SHT_INIT_ARRAY | |
3594 | || this->type() == elfcpp::SHT_FINI_ARRAY) | |
3595 | std::sort(sort_list.begin(), sort_list.end(), | |
3596 | Input_section_sort_init_fini_compare()); | |
c6ac678d ST |
3597 | else if (strcmp(this->name(), ".text") == 0) |
3598 | std::sort(sort_list.begin(), sort_list.end(), | |
3599 | Input_section_sort_section_name_special_ordering_compare()); | |
6e9ba2ca ST |
3600 | else |
3601 | std::sort(sort_list.begin(), sort_list.end(), | |
3602 | Input_section_sort_compare()); | |
3603 | } | |
2a0ff005 | 3604 | else |
6e9ba2ca | 3605 | { |
e9552f7e | 3606 | gold_assert(this->input_section_order_specified()); |
6e9ba2ca ST |
3607 | std::sort(sort_list.begin(), sort_list.end(), |
3608 | Input_section_sort_section_order_index_compare()); | |
3609 | } | |
2fd32231 ILT |
3610 | |
3611 | // Copy the sorted input sections back to our list. | |
3612 | this->input_sections_.clear(); | |
3613 | for (std::vector<Input_section_sort_entry>::iterator p = sort_list.begin(); | |
3614 | p != sort_list.end(); | |
3615 | ++p) | |
3616 | this->input_sections_.push_back(p->input_section()); | |
6e9ba2ca | 3617 | sort_list.clear(); |
2fd32231 ILT |
3618 | |
3619 | // Remember that we sorted the input sections, since we might get | |
3620 | // called again. | |
3621 | this->attached_input_sections_are_sorted_ = true; | |
3622 | } | |
3623 | ||
61ba1cf9 ILT |
3624 | // Write the section header to *OSHDR. |
3625 | ||
3626 | template<int size, bool big_endian> | |
3627 | void | |
16649710 ILT |
3628 | Output_section::write_header(const Layout* layout, |
3629 | const Stringpool* secnamepool, | |
61ba1cf9 ILT |
3630 | elfcpp::Shdr_write<size, big_endian>* oshdr) const |
3631 | { | |
3632 | oshdr->put_sh_name(secnamepool->get_offset(this->name_)); | |
3633 | oshdr->put_sh_type(this->type_); | |
6a74a719 | 3634 | |
2ea97941 | 3635 | elfcpp::Elf_Xword flags = this->flags_; |
755ab8af | 3636 | if (this->info_section_ != NULL && this->info_uses_section_index_) |
2ea97941 ILT |
3637 | flags |= elfcpp::SHF_INFO_LINK; |
3638 | oshdr->put_sh_flags(flags); | |
6a74a719 | 3639 | |
61ba1cf9 ILT |
3640 | oshdr->put_sh_addr(this->address()); |
3641 | oshdr->put_sh_offset(this->offset()); | |
3642 | oshdr->put_sh_size(this->data_size()); | |
16649710 ILT |
3643 | if (this->link_section_ != NULL) |
3644 | oshdr->put_sh_link(this->link_section_->out_shndx()); | |
3645 | else if (this->should_link_to_symtab_) | |
886f533a | 3646 | oshdr->put_sh_link(layout->symtab_section_shndx()); |
16649710 ILT |
3647 | else if (this->should_link_to_dynsym_) |
3648 | oshdr->put_sh_link(layout->dynsym_section()->out_shndx()); | |
3649 | else | |
3650 | oshdr->put_sh_link(this->link_); | |
755ab8af | 3651 | |
2ea97941 | 3652 | elfcpp::Elf_Word info; |
16649710 | 3653 | if (this->info_section_ != NULL) |
755ab8af ILT |
3654 | { |
3655 | if (this->info_uses_section_index_) | |
2ea97941 | 3656 | info = this->info_section_->out_shndx(); |
755ab8af | 3657 | else |
2ea97941 | 3658 | info = this->info_section_->symtab_index(); |
755ab8af | 3659 | } |
6a74a719 | 3660 | else if (this->info_symndx_ != NULL) |
2ea97941 | 3661 | info = this->info_symndx_->symtab_index(); |
16649710 | 3662 | else |
2ea97941 ILT |
3663 | info = this->info_; |
3664 | oshdr->put_sh_info(info); | |
755ab8af | 3665 | |
61ba1cf9 ILT |
3666 | oshdr->put_sh_addralign(this->addralign_); |
3667 | oshdr->put_sh_entsize(this->entsize_); | |
a2fb1b05 ILT |
3668 | } |
3669 | ||
ead1e424 ILT |
3670 | // Write out the data. For input sections the data is written out by |
3671 | // Object::relocate, but we have to handle Output_section_data objects | |
3672 | // here. | |
3673 | ||
3674 | void | |
3675 | Output_section::do_write(Output_file* of) | |
3676 | { | |
96803768 ILT |
3677 | gold_assert(!this->requires_postprocessing()); |
3678 | ||
c0a62865 DK |
3679 | // If the target performs relaxation, we delay filler generation until now. |
3680 | gold_assert(!this->generate_code_fills_at_write_ || this->fills_.empty()); | |
3681 | ||
c51e6221 ILT |
3682 | off_t output_section_file_offset = this->offset(); |
3683 | for (Fill_list::iterator p = this->fills_.begin(); | |
3684 | p != this->fills_.end(); | |
3685 | ++p) | |
3686 | { | |
8851ecca | 3687 | std::string fill_data(parameters->target().code_fill(p->length())); |
c51e6221 | 3688 | of->write(output_section_file_offset + p->section_offset(), |
a445fddf | 3689 | fill_data.data(), fill_data.size()); |
c51e6221 ILT |
3690 | } |
3691 | ||
c0a62865 | 3692 | off_t off = this->offset() + this->first_input_offset_; |
ead1e424 ILT |
3693 | for (Input_section_list::iterator p = this->input_sections_.begin(); |
3694 | p != this->input_sections_.end(); | |
3695 | ++p) | |
c0a62865 DK |
3696 | { |
3697 | off_t aligned_off = align_address(off, p->addralign()); | |
3698 | if (this->generate_code_fills_at_write_ && (off != aligned_off)) | |
3699 | { | |
3700 | size_t fill_len = aligned_off - off; | |
3701 | std::string fill_data(parameters->target().code_fill(fill_len)); | |
3702 | of->write(off, fill_data.data(), fill_data.size()); | |
3703 | } | |
3704 | ||
3705 | p->write(of); | |
3706 | off = aligned_off + p->data_size(); | |
3707 | } | |
8ea8cd50 CC |
3708 | |
3709 | // For incremental links, fill in unused chunks in debug sections | |
3710 | // with dummy compilation unit headers. | |
3711 | if (this->free_space_fill_ != NULL) | |
3712 | { | |
3713 | for (Free_list::Const_iterator p = this->free_list_.begin(); | |
3714 | p != this->free_list_.end(); | |
3715 | ++p) | |
3716 | { | |
3717 | off_t off = p->start_; | |
3718 | size_t len = p->end_ - off; | |
3719 | this->free_space_fill_->write(of, this->offset() + off, len); | |
3720 | } | |
3721 | if (this->patch_space_ > 0) | |
3722 | { | |
3723 | off_t off = this->current_data_size_for_child() - this->patch_space_; | |
3724 | this->free_space_fill_->write(of, this->offset() + off, | |
3725 | this->patch_space_); | |
3726 | } | |
3727 | } | |
ead1e424 ILT |
3728 | } |
3729 | ||
96803768 ILT |
3730 | // If a section requires postprocessing, create the buffer to use. |
3731 | ||
3732 | void | |
3733 | Output_section::create_postprocessing_buffer() | |
3734 | { | |
3735 | gold_assert(this->requires_postprocessing()); | |
1bedcac5 ILT |
3736 | |
3737 | if (this->postprocessing_buffer_ != NULL) | |
3738 | return; | |
96803768 ILT |
3739 | |
3740 | if (!this->input_sections_.empty()) | |
3741 | { | |
3742 | off_t off = this->first_input_offset_; | |
3743 | for (Input_section_list::iterator p = this->input_sections_.begin(); | |
3744 | p != this->input_sections_.end(); | |
3745 | ++p) | |
3746 | { | |
3747 | off = align_address(off, p->addralign()); | |
3748 | p->finalize_data_size(); | |
3749 | off += p->data_size(); | |
3750 | } | |
3751 | this->set_current_data_size_for_child(off); | |
3752 | } | |
3753 | ||
3754 | off_t buffer_size = this->current_data_size_for_child(); | |
3755 | this->postprocessing_buffer_ = new unsigned char[buffer_size]; | |
3756 | } | |
3757 | ||
3758 | // Write all the data of an Output_section into the postprocessing | |
3759 | // buffer. This is used for sections which require postprocessing, | |
3760 | // such as compression. Input sections are handled by | |
3761 | // Object::Relocate. | |
3762 | ||
3763 | void | |
3764 | Output_section::write_to_postprocessing_buffer() | |
3765 | { | |
3766 | gold_assert(this->requires_postprocessing()); | |
3767 | ||
c0a62865 DK |
3768 | // If the target performs relaxation, we delay filler generation until now. |
3769 | gold_assert(!this->generate_code_fills_at_write_ || this->fills_.empty()); | |
3770 | ||
96803768 ILT |
3771 | unsigned char* buffer = this->postprocessing_buffer(); |
3772 | for (Fill_list::iterator p = this->fills_.begin(); | |
3773 | p != this->fills_.end(); | |
3774 | ++p) | |
3775 | { | |
8851ecca | 3776 | std::string fill_data(parameters->target().code_fill(p->length())); |
a445fddf ILT |
3777 | memcpy(buffer + p->section_offset(), fill_data.data(), |
3778 | fill_data.size()); | |
96803768 ILT |
3779 | } |
3780 | ||
3781 | off_t off = this->first_input_offset_; | |
3782 | for (Input_section_list::iterator p = this->input_sections_.begin(); | |
3783 | p != this->input_sections_.end(); | |
3784 | ++p) | |
3785 | { | |
c0a62865 DK |
3786 | off_t aligned_off = align_address(off, p->addralign()); |
3787 | if (this->generate_code_fills_at_write_ && (off != aligned_off)) | |
3788 | { | |
3789 | size_t fill_len = aligned_off - off; | |
3790 | std::string fill_data(parameters->target().code_fill(fill_len)); | |
3791 | memcpy(buffer + off, fill_data.data(), fill_data.size()); | |
3792 | } | |
3793 | ||
3794 | p->write_to_buffer(buffer + aligned_off); | |
3795 | off = aligned_off + p->data_size(); | |
96803768 ILT |
3796 | } |
3797 | } | |
3798 | ||
a445fddf ILT |
3799 | // Get the input sections for linker script processing. We leave |
3800 | // behind the Output_section_data entries. Note that this may be | |
3801 | // slightly incorrect for merge sections. We will leave them behind, | |
3802 | // but it is possible that the script says that they should follow | |
3803 | // some other input sections, as in: | |
3804 | // .rodata { *(.rodata) *(.rodata.cst*) } | |
3805 | // For that matter, we don't handle this correctly: | |
3806 | // .rodata { foo.o(.rodata.cst*) *(.rodata.cst*) } | |
3807 | // With luck this will never matter. | |
3808 | ||
3809 | uint64_t | |
3810 | Output_section::get_input_sections( | |
2ea97941 | 3811 | uint64_t address, |
a445fddf | 3812 | const std::string& fill, |
6625d24e | 3813 | std::list<Input_section>* input_sections) |
a445fddf | 3814 | { |
20e6d0d6 DK |
3815 | if (this->checkpoint_ != NULL |
3816 | && !this->checkpoint_->input_sections_saved()) | |
3817 | this->checkpoint_->save_input_sections(); | |
3818 | ||
0439c796 DK |
3819 | // Invalidate fast look-up maps. |
3820 | this->lookup_maps_->invalidate(); | |
c0a62865 | 3821 | |
2ea97941 | 3822 | uint64_t orig_address = address; |
a445fddf | 3823 | |
2ea97941 | 3824 | address = align_address(address, this->addralign()); |
a445fddf ILT |
3825 | |
3826 | Input_section_list remaining; | |
3827 | for (Input_section_list::iterator p = this->input_sections_.begin(); | |
3828 | p != this->input_sections_.end(); | |
3829 | ++p) | |
3830 | { | |
0439c796 DK |
3831 | if (p->is_input_section() |
3832 | || p->is_relaxed_input_section() | |
3833 | || p->is_merge_section()) | |
6625d24e | 3834 | input_sections->push_back(*p); |
a445fddf ILT |
3835 | else |
3836 | { | |
2ea97941 ILT |
3837 | uint64_t aligned_address = align_address(address, p->addralign()); |
3838 | if (aligned_address != address && !fill.empty()) | |
a445fddf ILT |
3839 | { |
3840 | section_size_type length = | |
2ea97941 | 3841 | convert_to_section_size_type(aligned_address - address); |
a445fddf ILT |
3842 | std::string this_fill; |
3843 | this_fill.reserve(length); | |
3844 | while (this_fill.length() + fill.length() <= length) | |
3845 | this_fill += fill; | |
3846 | if (this_fill.length() < length) | |
3847 | this_fill.append(fill, 0, length - this_fill.length()); | |
3848 | ||
3849 | Output_section_data* posd = new Output_data_const(this_fill, 0); | |
3850 | remaining.push_back(Input_section(posd)); | |
3851 | } | |
2ea97941 | 3852 | address = aligned_address; |
a445fddf ILT |
3853 | |
3854 | remaining.push_back(*p); | |
3855 | ||
3856 | p->finalize_data_size(); | |
2ea97941 | 3857 | address += p->data_size(); |
a445fddf ILT |
3858 | } |
3859 | } | |
3860 | ||
3861 | this->input_sections_.swap(remaining); | |
3862 | this->first_input_offset_ = 0; | |
3863 | ||
2ea97941 ILT |
3864 | uint64_t data_size = address - orig_address; |
3865 | this->set_current_data_size_for_child(data_size); | |
3866 | return data_size; | |
a445fddf ILT |
3867 | } |
3868 | ||
6625d24e DK |
3869 | // Add a script input section. SIS is an Output_section::Input_section, |
3870 | // which can be either a plain input section or a special input section like | |
3871 | // a relaxed input section. For a special input section, its size must be | |
3872 | // finalized. | |
a445fddf ILT |
3873 | |
3874 | void | |
6625d24e | 3875 | Output_section::add_script_input_section(const Input_section& sis) |
a445fddf | 3876 | { |
6625d24e DK |
3877 | uint64_t data_size = sis.data_size(); |
3878 | uint64_t addralign = sis.addralign(); | |
2ea97941 ILT |
3879 | if (addralign > this->addralign_) |
3880 | this->addralign_ = addralign; | |
a445fddf ILT |
3881 | |
3882 | off_t offset_in_section = this->current_data_size_for_child(); | |
3883 | off_t aligned_offset_in_section = align_address(offset_in_section, | |
2ea97941 | 3884 | addralign); |
a445fddf ILT |
3885 | |
3886 | this->set_current_data_size_for_child(aligned_offset_in_section | |
2ea97941 | 3887 | + data_size); |
a445fddf | 3888 | |
6625d24e | 3889 | this->input_sections_.push_back(sis); |
0439c796 | 3890 | |
50ed5eb1 | 3891 | // Update fast lookup maps if necessary. |
0439c796 DK |
3892 | if (this->lookup_maps_->is_valid()) |
3893 | { | |
3894 | if (sis.is_merge_section()) | |
3895 | { | |
3896 | Output_merge_base* pomb = sis.output_merge_base(); | |
3897 | Merge_section_properties msp(pomb->is_string(), pomb->entsize(), | |
3898 | pomb->addralign()); | |
3899 | this->lookup_maps_->add_merge_section(msp, pomb); | |
3900 | for (Output_merge_base::Input_sections::const_iterator p = | |
3901 | pomb->input_sections_begin(); | |
3902 | p != pomb->input_sections_end(); | |
3903 | ++p) | |
3904 | this->lookup_maps_->add_merge_input_section(p->first, p->second, | |
3905 | pomb); | |
3906 | } | |
3907 | else if (sis.is_relaxed_input_section()) | |
3908 | { | |
3909 | Output_relaxed_input_section* poris = sis.relaxed_input_section(); | |
3910 | this->lookup_maps_->add_relaxed_input_section(poris->relobj(), | |
3911 | poris->shndx(), poris); | |
3912 | } | |
3913 | } | |
20e6d0d6 DK |
3914 | } |
3915 | ||
8923b24c | 3916 | // Save states for relaxation. |
20e6d0d6 DK |
3917 | |
3918 | void | |
3919 | Output_section::save_states() | |
3920 | { | |
3921 | gold_assert(this->checkpoint_ == NULL); | |
3922 | Checkpoint_output_section* checkpoint = | |
3923 | new Checkpoint_output_section(this->addralign_, this->flags_, | |
3924 | this->input_sections_, | |
3925 | this->first_input_offset_, | |
3926 | this->attached_input_sections_are_sorted_); | |
3927 | this->checkpoint_ = checkpoint; | |
3928 | gold_assert(this->fills_.empty()); | |
3929 | } | |
3930 | ||
8923b24c DK |
3931 | void |
3932 | Output_section::discard_states() | |
3933 | { | |
3934 | gold_assert(this->checkpoint_ != NULL); | |
3935 | delete this->checkpoint_; | |
3936 | this->checkpoint_ = NULL; | |
3937 | gold_assert(this->fills_.empty()); | |
3938 | ||
0439c796 DK |
3939 | // Simply invalidate the fast lookup maps since we do not keep |
3940 | // track of them. | |
3941 | this->lookup_maps_->invalidate(); | |
8923b24c DK |
3942 | } |
3943 | ||
20e6d0d6 DK |
3944 | void |
3945 | Output_section::restore_states() | |
3946 | { | |
3947 | gold_assert(this->checkpoint_ != NULL); | |
3948 | Checkpoint_output_section* checkpoint = this->checkpoint_; | |
3949 | ||
3950 | this->addralign_ = checkpoint->addralign(); | |
3951 | this->flags_ = checkpoint->flags(); | |
3952 | this->first_input_offset_ = checkpoint->first_input_offset(); | |
3953 | ||
3954 | if (!checkpoint->input_sections_saved()) | |
3955 | { | |
3956 | // If we have not copied the input sections, just resize it. | |
3957 | size_t old_size = checkpoint->input_sections_size(); | |
3958 | gold_assert(this->input_sections_.size() >= old_size); | |
3959 | this->input_sections_.resize(old_size); | |
3960 | } | |
3961 | else | |
3962 | { | |
3963 | // We need to copy the whole list. This is not efficient for | |
3964 | // extremely large output with hundreads of thousands of input | |
3965 | // objects. We may need to re-think how we should pass sections | |
3966 | // to scripts. | |
c0a62865 | 3967 | this->input_sections_ = *checkpoint->input_sections(); |
20e6d0d6 DK |
3968 | } |
3969 | ||
3970 | this->attached_input_sections_are_sorted_ = | |
3971 | checkpoint->attached_input_sections_are_sorted(); | |
c0a62865 | 3972 | |
0439c796 DK |
3973 | // Simply invalidate the fast lookup maps since we do not keep |
3974 | // track of them. | |
3975 | this->lookup_maps_->invalidate(); | |
a445fddf ILT |
3976 | } |
3977 | ||
8923b24c DK |
3978 | // Update the section offsets of input sections in this. This is required if |
3979 | // relaxation causes some input sections to change sizes. | |
3980 | ||
3981 | void | |
3982 | Output_section::adjust_section_offsets() | |
3983 | { | |
3984 | if (!this->section_offsets_need_adjustment_) | |
3985 | return; | |
3986 | ||
3987 | off_t off = 0; | |
3988 | for (Input_section_list::iterator p = this->input_sections_.begin(); | |
3989 | p != this->input_sections_.end(); | |
3990 | ++p) | |
3991 | { | |
3992 | off = align_address(off, p->addralign()); | |
3993 | if (p->is_input_section()) | |
3994 | p->relobj()->set_section_offset(p->shndx(), off); | |
3995 | off += p->data_size(); | |
3996 | } | |
3997 | ||
3998 | this->section_offsets_need_adjustment_ = false; | |
3999 | } | |
4000 | ||
7d9e3d98 ILT |
4001 | // Print to the map file. |
4002 | ||
4003 | void | |
4004 | Output_section::do_print_to_mapfile(Mapfile* mapfile) const | |
4005 | { | |
4006 | mapfile->print_output_section(this); | |
4007 | ||
4008 | for (Input_section_list::const_iterator p = this->input_sections_.begin(); | |
4009 | p != this->input_sections_.end(); | |
4010 | ++p) | |
4011 | p->print_to_mapfile(mapfile); | |
4012 | } | |
4013 | ||
38c5e8b4 ILT |
4014 | // Print stats for merge sections to stderr. |
4015 | ||
4016 | void | |
4017 | Output_section::print_merge_stats() | |
4018 | { | |
4019 | Input_section_list::iterator p; | |
4020 | for (p = this->input_sections_.begin(); | |
4021 | p != this->input_sections_.end(); | |
4022 | ++p) | |
4023 | p->print_merge_stats(this->name_); | |
4024 | } | |
4025 | ||
cdc29364 CC |
4026 | // Set a fixed layout for the section. Used for incremental update links. |
4027 | ||
4028 | void | |
4029 | Output_section::set_fixed_layout(uint64_t sh_addr, off_t sh_offset, | |
4030 | off_t sh_size, uint64_t sh_addralign) | |
4031 | { | |
4032 | this->addralign_ = sh_addralign; | |
4033 | this->set_current_data_size(sh_size); | |
4034 | if ((this->flags_ & elfcpp::SHF_ALLOC) != 0) | |
4035 | this->set_address(sh_addr); | |
4036 | this->set_file_offset(sh_offset); | |
4037 | this->finalize_data_size(); | |
4038 | this->free_list_.init(sh_size, false); | |
4039 | this->has_fixed_layout_ = true; | |
4040 | } | |
4041 | ||
4042 | // Reserve space within the fixed layout for the section. Used for | |
4043 | // incremental update links. | |
5146f448 | 4044 | |
cdc29364 CC |
4045 | void |
4046 | Output_section::reserve(uint64_t sh_offset, uint64_t sh_size) | |
4047 | { | |
4048 | this->free_list_.remove(sh_offset, sh_offset + sh_size); | |
4049 | } | |
4050 | ||
5146f448 CC |
4051 | // Allocate space from the free list for the section. Used for |
4052 | // incremental update links. | |
4053 | ||
4054 | off_t | |
4055 | Output_section::allocate(off_t len, uint64_t addralign) | |
4056 | { | |
4057 | return this->free_list_.allocate(len, addralign, 0); | |
4058 | } | |
4059 | ||
a2fb1b05 ILT |
4060 | // Output segment methods. |
4061 | ||
2ea97941 | 4062 | Output_segment::Output_segment(elfcpp::Elf_Word type, elfcpp::Elf_Word flags) |
22f0da72 | 4063 | : vaddr_(0), |
a2fb1b05 ILT |
4064 | paddr_(0), |
4065 | memsz_(0), | |
a445fddf ILT |
4066 | max_align_(0), |
4067 | min_p_align_(0), | |
a2fb1b05 ILT |
4068 | offset_(0), |
4069 | filesz_(0), | |
2ea97941 ILT |
4070 | type_(type), |
4071 | flags_(flags), | |
a445fddf | 4072 | is_max_align_known_(false), |
8a5e3e08 | 4073 | are_addresses_set_(false), |
16164a6b ST |
4074 | is_large_data_segment_(false), |
4075 | is_unique_segment_(false) | |
a2fb1b05 | 4076 | { |
bb321bb1 ILT |
4077 | // The ELF ABI specifies that a PT_TLS segment always has PF_R as |
4078 | // the flags. | |
4079 | if (type == elfcpp::PT_TLS) | |
4080 | this->flags_ = elfcpp::PF_R; | |
a2fb1b05 ILT |
4081 | } |
4082 | ||
22f0da72 | 4083 | // Add an Output_section to a PT_LOAD Output_segment. |
a2fb1b05 ILT |
4084 | |
4085 | void | |
22f0da72 ILT |
4086 | Output_segment::add_output_section_to_load(Layout* layout, |
4087 | Output_section* os, | |
4088 | elfcpp::Elf_Word seg_flags) | |
a2fb1b05 | 4089 | { |
22f0da72 | 4090 | gold_assert(this->type() == elfcpp::PT_LOAD); |
a3ad94ed | 4091 | gold_assert((os->flags() & elfcpp::SHF_ALLOC) != 0); |
a445fddf | 4092 | gold_assert(!this->is_max_align_known_); |
8a5e3e08 | 4093 | gold_assert(os->is_large_data_section() == this->is_large_data_segment()); |
75f65a3e | 4094 | |
a192ba05 | 4095 | this->update_flags_for_output_section(seg_flags); |
75f65a3e | 4096 | |
22f0da72 ILT |
4097 | // We don't want to change the ordering if we have a linker script |
4098 | // with a SECTIONS clause. | |
4099 | Output_section_order order = os->order(); | |
4100 | if (layout->script_options()->saw_sections_clause()) | |
4101 | order = static_cast<Output_section_order>(0); | |
75f65a3e | 4102 | else |
22f0da72 | 4103 | gold_assert(order != ORDER_INVALID); |
54dc6425 | 4104 | |
22f0da72 ILT |
4105 | this->output_lists_[order].push_back(os); |
4106 | } | |
9f1d377b | 4107 | |
22f0da72 | 4108 | // Add an Output_section to a non-PT_LOAD Output_segment. |
1a2dff53 | 4109 | |
22f0da72 ILT |
4110 | void |
4111 | Output_segment::add_output_section_to_nonload(Output_section* os, | |
4112 | elfcpp::Elf_Word seg_flags) | |
4113 | { | |
4114 | gold_assert(this->type() != elfcpp::PT_LOAD); | |
4115 | gold_assert((os->flags() & elfcpp::SHF_ALLOC) != 0); | |
4116 | gold_assert(!this->is_max_align_known_); | |
1a2dff53 | 4117 | |
22f0da72 | 4118 | this->update_flags_for_output_section(seg_flags); |
9f1d377b | 4119 | |
22f0da72 ILT |
4120 | this->output_lists_[0].push_back(os); |
4121 | } | |
8a5e3e08 | 4122 | |
22f0da72 ILT |
4123 | // Remove an Output_section from this segment. It is an error if it |
4124 | // is not present. | |
8a5e3e08 | 4125 | |
22f0da72 ILT |
4126 | void |
4127 | Output_segment::remove_output_section(Output_section* os) | |
4128 | { | |
4129 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) | |
8a5e3e08 | 4130 | { |
22f0da72 ILT |
4131 | Output_data_list* pdl = &this->output_lists_[i]; |
4132 | for (Output_data_list::iterator p = pdl->begin(); p != pdl->end(); ++p) | |
8a5e3e08 | 4133 | { |
22f0da72 | 4134 | if (*p == os) |
8a5e3e08 | 4135 | { |
22f0da72 | 4136 | pdl->erase(p); |
8a5e3e08 ILT |
4137 | return; |
4138 | } | |
4139 | } | |
f5c870d2 | 4140 | } |
1650c4ff ILT |
4141 | gold_unreachable(); |
4142 | } | |
4143 | ||
a192ba05 ILT |
4144 | // Add an Output_data (which need not be an Output_section) to the |
4145 | // start of a segment. | |
75f65a3e ILT |
4146 | |
4147 | void | |
4148 | Output_segment::add_initial_output_data(Output_data* od) | |
4149 | { | |
a445fddf | 4150 | gold_assert(!this->is_max_align_known_); |
22f0da72 ILT |
4151 | Output_data_list::iterator p = this->output_lists_[0].begin(); |
4152 | this->output_lists_[0].insert(p, od); | |
4153 | } | |
4154 | ||
4155 | // Return true if this segment has any sections which hold actual | |
4156 | // data, rather than being a BSS section. | |
4157 | ||
4158 | bool | |
4159 | Output_segment::has_any_data_sections() const | |
4160 | { | |
4161 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) | |
4162 | { | |
4163 | const Output_data_list* pdl = &this->output_lists_[i]; | |
4164 | for (Output_data_list::const_iterator p = pdl->begin(); | |
4165 | p != pdl->end(); | |
4166 | ++p) | |
4167 | { | |
4168 | if (!(*p)->is_section()) | |
4169 | return true; | |
4170 | if ((*p)->output_section()->type() != elfcpp::SHT_NOBITS) | |
4171 | return true; | |
4172 | } | |
4173 | } | |
4174 | return false; | |
75f65a3e ILT |
4175 | } |
4176 | ||
5bc2f5be CC |
4177 | // Return whether the first data section (not counting TLS sections) |
4178 | // is a relro section. | |
9f1d377b ILT |
4179 | |
4180 | bool | |
4181 | Output_segment::is_first_section_relro() const | |
4182 | { | |
22f0da72 ILT |
4183 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) |
4184 | { | |
5bc2f5be CC |
4185 | if (i == static_cast<int>(ORDER_TLS_DATA) |
4186 | || i == static_cast<int>(ORDER_TLS_BSS)) | |
4187 | continue; | |
22f0da72 ILT |
4188 | const Output_data_list* pdl = &this->output_lists_[i]; |
4189 | if (!pdl->empty()) | |
4190 | { | |
4191 | Output_data* p = pdl->front(); | |
4192 | return p->is_section() && p->output_section()->is_relro(); | |
4193 | } | |
4194 | } | |
4195 | return false; | |
9f1d377b ILT |
4196 | } |
4197 | ||
75f65a3e | 4198 | // Return the maximum alignment of the Output_data in Output_segment. |
75f65a3e ILT |
4199 | |
4200 | uint64_t | |
a445fddf | 4201 | Output_segment::maximum_alignment() |
75f65a3e | 4202 | { |
a445fddf | 4203 | if (!this->is_max_align_known_) |
ead1e424 | 4204 | { |
22f0da72 | 4205 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) |
50ed5eb1 | 4206 | { |
22f0da72 ILT |
4207 | const Output_data_list* pdl = &this->output_lists_[i]; |
4208 | uint64_t addralign = Output_segment::maximum_alignment_list(pdl); | |
4209 | if (addralign > this->max_align_) | |
4210 | this->max_align_ = addralign; | |
4211 | } | |
a445fddf | 4212 | this->is_max_align_known_ = true; |
ead1e424 ILT |
4213 | } |
4214 | ||
a445fddf | 4215 | return this->max_align_; |
75f65a3e ILT |
4216 | } |
4217 | ||
ead1e424 ILT |
4218 | // Return the maximum alignment of a list of Output_data. |
4219 | ||
4220 | uint64_t | |
a445fddf | 4221 | Output_segment::maximum_alignment_list(const Output_data_list* pdl) |
ead1e424 ILT |
4222 | { |
4223 | uint64_t ret = 0; | |
4224 | for (Output_data_list::const_iterator p = pdl->begin(); | |
4225 | p != pdl->end(); | |
4226 | ++p) | |
4227 | { | |
2ea97941 ILT |
4228 | uint64_t addralign = (*p)->addralign(); |
4229 | if (addralign > ret) | |
4230 | ret = addralign; | |
ead1e424 ILT |
4231 | } |
4232 | return ret; | |
4233 | } | |
4234 | ||
22f0da72 | 4235 | // Return whether this segment has any dynamic relocs. |
4f4c5f80 | 4236 | |
22f0da72 ILT |
4237 | bool |
4238 | Output_segment::has_dynamic_reloc() const | |
4f4c5f80 | 4239 | { |
22f0da72 ILT |
4240 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) |
4241 | if (this->has_dynamic_reloc_list(&this->output_lists_[i])) | |
4242 | return true; | |
4243 | return false; | |
4f4c5f80 ILT |
4244 | } |
4245 | ||
22f0da72 | 4246 | // Return whether this Output_data_list has any dynamic relocs. |
4f4c5f80 | 4247 | |
22f0da72 ILT |
4248 | bool |
4249 | Output_segment::has_dynamic_reloc_list(const Output_data_list* pdl) const | |
4f4c5f80 | 4250 | { |
4f4c5f80 ILT |
4251 | for (Output_data_list::const_iterator p = pdl->begin(); |
4252 | p != pdl->end(); | |
4253 | ++p) | |
22f0da72 ILT |
4254 | if ((*p)->has_dynamic_reloc()) |
4255 | return true; | |
4256 | return false; | |
4f4c5f80 ILT |
4257 | } |
4258 | ||
a445fddf ILT |
4259 | // Set the section addresses for an Output_segment. If RESET is true, |
4260 | // reset the addresses first. ADDR is the address and *POFF is the | |
4261 | // file offset. Set the section indexes starting with *PSHNDX. | |
5bc2f5be CC |
4262 | // INCREASE_RELRO is the size of the portion of the first non-relro |
4263 | // section that should be included in the PT_GNU_RELRO segment. | |
4264 | // If this segment has relro sections, and has been aligned for | |
4265 | // that purpose, set *HAS_RELRO to TRUE. Return the address of | |
4266 | // the immediately following segment. Update *HAS_RELRO, *POFF, | |
4267 | // and *PSHNDX. | |
75f65a3e ILT |
4268 | |
4269 | uint64_t | |
cdc29364 | 4270 | Output_segment::set_section_addresses(Layout* layout, bool reset, |
1a2dff53 | 4271 | uint64_t addr, |
fd064a5b | 4272 | unsigned int* increase_relro, |
fc497986 | 4273 | bool* has_relro, |
1a2dff53 | 4274 | off_t* poff, |
ead1e424 | 4275 | unsigned int* pshndx) |
75f65a3e | 4276 | { |
a3ad94ed | 4277 | gold_assert(this->type_ == elfcpp::PT_LOAD); |
75f65a3e | 4278 | |
fc497986 | 4279 | uint64_t last_relro_pad = 0; |
1a2dff53 ILT |
4280 | off_t orig_off = *poff; |
4281 | ||
5bc2f5be CC |
4282 | bool in_tls = false; |
4283 | ||
1a2dff53 | 4284 | // If we have relro sections, we need to pad forward now so that the |
815a1205 | 4285 | // relro sections plus INCREASE_RELRO end on an abi page boundary. |
1a2dff53 ILT |
4286 | if (parameters->options().relro() |
4287 | && this->is_first_section_relro() | |
4288 | && (!this->are_addresses_set_ || reset)) | |
4289 | { | |
4290 | uint64_t relro_size = 0; | |
4291 | off_t off = *poff; | |
fc497986 | 4292 | uint64_t max_align = 0; |
5bc2f5be | 4293 | for (int i = 0; i <= static_cast<int>(ORDER_RELRO_LAST); ++i) |
1a2dff53 | 4294 | { |
22f0da72 ILT |
4295 | Output_data_list* pdl = &this->output_lists_[i]; |
4296 | Output_data_list::iterator p; | |
4297 | for (p = pdl->begin(); p != pdl->end(); ++p) | |
1a2dff53 | 4298 | { |
22f0da72 ILT |
4299 | if (!(*p)->is_section()) |
4300 | break; | |
fc497986 CC |
4301 | uint64_t align = (*p)->addralign(); |
4302 | if (align > max_align) | |
4303 | max_align = align; | |
5bc2f5be CC |
4304 | if ((*p)->is_section_flag_set(elfcpp::SHF_TLS)) |
4305 | in_tls = true; | |
4306 | else if (in_tls) | |
4307 | { | |
4308 | // Align the first non-TLS section to the alignment | |
4309 | // of the TLS segment. | |
4310 | align = max_align; | |
4311 | in_tls = false; | |
4312 | } | |
fc497986 | 4313 | relro_size = align_address(relro_size, align); |
5bc2f5be CC |
4314 | // Ignore the size of the .tbss section. |
4315 | if ((*p)->is_section_flag_set(elfcpp::SHF_TLS) | |
4316 | && (*p)->is_section_type(elfcpp::SHT_NOBITS)) | |
4317 | continue; | |
22f0da72 ILT |
4318 | if ((*p)->is_address_valid()) |
4319 | relro_size += (*p)->data_size(); | |
4320 | else | |
4321 | { | |
4322 | // FIXME: This could be faster. | |
4323 | (*p)->set_address_and_file_offset(addr + relro_size, | |
4324 | off + relro_size); | |
4325 | relro_size += (*p)->data_size(); | |
4326 | (*p)->reset_address_and_file_offset(); | |
4327 | } | |
1a2dff53 | 4328 | } |
22f0da72 ILT |
4329 | if (p != pdl->end()) |
4330 | break; | |
1a2dff53 | 4331 | } |
fd064a5b | 4332 | relro_size += *increase_relro; |
fc497986 CC |
4333 | // Pad the total relro size to a multiple of the maximum |
4334 | // section alignment seen. | |
4335 | uint64_t aligned_size = align_address(relro_size, max_align); | |
4336 | // Note the amount of padding added after the last relro section. | |
4337 | last_relro_pad = aligned_size - relro_size; | |
fc497986 | 4338 | *has_relro = true; |
1a2dff53 | 4339 | |
815a1205 | 4340 | uint64_t page_align = parameters->target().abi_pagesize(); |
1a2dff53 ILT |
4341 | |
4342 | // Align to offset N such that (N + RELRO_SIZE) % PAGE_ALIGN == 0. | |
fc497986 | 4343 | uint64_t desired_align = page_align - (aligned_size % page_align); |
1a2dff53 ILT |
4344 | if (desired_align < *poff % page_align) |
4345 | *poff += page_align - *poff % page_align; | |
4346 | *poff += desired_align - *poff % page_align; | |
4347 | addr += *poff - orig_off; | |
4348 | orig_off = *poff; | |
4349 | } | |
4350 | ||
a445fddf ILT |
4351 | if (!reset && this->are_addresses_set_) |
4352 | { | |
4353 | gold_assert(this->paddr_ == addr); | |
4354 | addr = this->vaddr_; | |
4355 | } | |
4356 | else | |
4357 | { | |
4358 | this->vaddr_ = addr; | |
4359 | this->paddr_ = addr; | |
4360 | this->are_addresses_set_ = true; | |
4361 | } | |
75f65a3e | 4362 | |
5bc2f5be | 4363 | in_tls = false; |
96a2b4e4 | 4364 | |
75f65a3e ILT |
4365 | this->offset_ = orig_off; |
4366 | ||
22f0da72 ILT |
4367 | off_t off = 0; |
4368 | uint64_t ret; | |
4369 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) | |
4370 | { | |
fc497986 CC |
4371 | if (i == static_cast<int>(ORDER_RELRO_LAST)) |
4372 | { | |
4373 | *poff += last_relro_pad; | |
4374 | addr += last_relro_pad; | |
fd064a5b CC |
4375 | if (this->output_lists_[i].empty()) |
4376 | { | |
4377 | // If there is nothing in the ORDER_RELRO_LAST list, | |
4378 | // the padding will occur at the end of the relro | |
4379 | // segment, and we need to add it to *INCREASE_RELRO. | |
4380 | *increase_relro += last_relro_pad; | |
4381 | } | |
fc497986 | 4382 | } |
5bc2f5be CC |
4383 | addr = this->set_section_list_addresses(layout, reset, |
4384 | &this->output_lists_[i], | |
4385 | addr, poff, pshndx, &in_tls); | |
22f0da72 ILT |
4386 | if (i < static_cast<int>(ORDER_SMALL_BSS)) |
4387 | { | |
4388 | this->filesz_ = *poff - orig_off; | |
4389 | off = *poff; | |
4390 | } | |
75f65a3e | 4391 | |
22f0da72 ILT |
4392 | ret = addr; |
4393 | } | |
96a2b4e4 ILT |
4394 | |
4395 | // If the last section was a TLS section, align upward to the | |
4396 | // alignment of the TLS segment, so that the overall size of the TLS | |
4397 | // segment is aligned. | |
4398 | if (in_tls) | |
4399 | { | |
4400 | uint64_t segment_align = layout->tls_segment()->maximum_alignment(); | |
4401 | *poff = align_address(*poff, segment_align); | |
4402 | } | |
4403 | ||
75f65a3e ILT |
4404 | this->memsz_ = *poff - orig_off; |
4405 | ||
4406 | // Ignore the file offset adjustments made by the BSS Output_data | |
4407 | // objects. | |
4408 | *poff = off; | |
61ba1cf9 ILT |
4409 | |
4410 | return ret; | |
75f65a3e ILT |
4411 | } |
4412 | ||
b8e6aad9 ILT |
4413 | // Set the addresses and file offsets in a list of Output_data |
4414 | // structures. | |
75f65a3e ILT |
4415 | |
4416 | uint64_t | |
cdc29364 | 4417 | Output_segment::set_section_list_addresses(Layout* layout, bool reset, |
96a2b4e4 | 4418 | Output_data_list* pdl, |
ead1e424 | 4419 | uint64_t addr, off_t* poff, |
96a2b4e4 | 4420 | unsigned int* pshndx, |
1a2dff53 | 4421 | bool* in_tls) |
75f65a3e | 4422 | { |
ead1e424 | 4423 | off_t startoff = *poff; |
cdc29364 CC |
4424 | // For incremental updates, we may allocate non-fixed sections from |
4425 | // free space in the file. This keeps track of the high-water mark. | |
4426 | off_t maxoff = startoff; | |
75f65a3e | 4427 | |
ead1e424 | 4428 | off_t off = startoff; |
75f65a3e ILT |
4429 | for (Output_data_list::iterator p = pdl->begin(); |
4430 | p != pdl->end(); | |
4431 | ++p) | |
4432 | { | |
a445fddf ILT |
4433 | if (reset) |
4434 | (*p)->reset_address_and_file_offset(); | |
4435 | ||
cdc29364 CC |
4436 | // When doing an incremental update or when using a linker script, |
4437 | // the section will most likely already have an address. | |
a445fddf | 4438 | if (!(*p)->is_address_valid()) |
3802b2dd | 4439 | { |
96a2b4e4 ILT |
4440 | uint64_t align = (*p)->addralign(); |
4441 | ||
4442 | if ((*p)->is_section_flag_set(elfcpp::SHF_TLS)) | |
4443 | { | |
4444 | // Give the first TLS section the alignment of the | |
4445 | // entire TLS segment. Otherwise the TLS segment as a | |
4446 | // whole may be misaligned. | |
4447 | if (!*in_tls) | |
4448 | { | |
4449 | Output_segment* tls_segment = layout->tls_segment(); | |
4450 | gold_assert(tls_segment != NULL); | |
4451 | uint64_t segment_align = tls_segment->maximum_alignment(); | |
4452 | gold_assert(segment_align >= align); | |
4453 | align = segment_align; | |
4454 | ||
4455 | *in_tls = true; | |
4456 | } | |
4457 | } | |
4458 | else | |
4459 | { | |
4460 | // If this is the first section after the TLS segment, | |
4461 | // align it to at least the alignment of the TLS | |
4462 | // segment, so that the size of the overall TLS segment | |
4463 | // is aligned. | |
4464 | if (*in_tls) | |
4465 | { | |
4466 | uint64_t segment_align = | |
4467 | layout->tls_segment()->maximum_alignment(); | |
4468 | if (segment_align > align) | |
4469 | align = segment_align; | |
4470 | ||
4471 | *in_tls = false; | |
4472 | } | |
4473 | } | |
4474 | ||
fb0e076f | 4475 | if (!parameters->incremental_update()) |
cdc29364 CC |
4476 | { |
4477 | off = align_address(off, align); | |
4478 | (*p)->set_address_and_file_offset(addr + (off - startoff), off); | |
4479 | } | |
4480 | else | |
4481 | { | |
4482 | // Incremental update: allocate file space from free list. | |
4483 | (*p)->pre_finalize_data_size(); | |
4484 | off_t current_size = (*p)->current_data_size(); | |
4485 | off = layout->allocate(current_size, align, startoff); | |
4486 | if (off == -1) | |
4487 | { | |
4488 | gold_assert((*p)->output_section() != NULL); | |
e6455dfb CC |
4489 | gold_fallback(_("out of patch space for section %s; " |
4490 | "relink with --incremental-full"), | |
4491 | (*p)->output_section()->name()); | |
cdc29364 CC |
4492 | } |
4493 | (*p)->set_address_and_file_offset(addr + (off - startoff), off); | |
4494 | if ((*p)->data_size() > current_size) | |
4495 | { | |
4496 | gold_assert((*p)->output_section() != NULL); | |
e6455dfb CC |
4497 | gold_fallback(_("%s: section changed size; " |
4498 | "relink with --incremental-full"), | |
4499 | (*p)->output_section()->name()); | |
cdc29364 CC |
4500 | } |
4501 | } | |
3802b2dd | 4502 | } |
cdc29364 CC |
4503 | else if (parameters->incremental_update()) |
4504 | { | |
4505 | // For incremental updates, use the fixed offset for the | |
4506 | // high-water mark computation. | |
4507 | off = (*p)->offset(); | |
4508 | } | |
a445fddf ILT |
4509 | else |
4510 | { | |
4511 | // The script may have inserted a skip forward, but it | |
4512 | // better not have moved backward. | |
661be1e2 ILT |
4513 | if ((*p)->address() >= addr + (off - startoff)) |
4514 | off += (*p)->address() - (addr + (off - startoff)); | |
4515 | else | |
4516 | { | |
4517 | if (!layout->script_options()->saw_sections_clause()) | |
4518 | gold_unreachable(); | |
4519 | else | |
4520 | { | |
4521 | Output_section* os = (*p)->output_section(); | |
64b1ae37 DK |
4522 | |
4523 | // Cast to unsigned long long to avoid format warnings. | |
4524 | unsigned long long previous_dot = | |
4525 | static_cast<unsigned long long>(addr + (off - startoff)); | |
4526 | unsigned long long dot = | |
4527 | static_cast<unsigned long long>((*p)->address()); | |
4528 | ||
661be1e2 ILT |
4529 | if (os == NULL) |
4530 | gold_error(_("dot moves backward in linker script " | |
64b1ae37 | 4531 | "from 0x%llx to 0x%llx"), previous_dot, dot); |
661be1e2 ILT |
4532 | else |
4533 | gold_error(_("address of section '%s' moves backward " | |
4534 | "from 0x%llx to 0x%llx"), | |
64b1ae37 | 4535 | os->name(), previous_dot, dot); |
661be1e2 ILT |
4536 | } |
4537 | } | |
a445fddf ILT |
4538 | (*p)->set_file_offset(off); |
4539 | (*p)->finalize_data_size(); | |
4540 | } | |
ead1e424 | 4541 | |
9fbd3822 CC |
4542 | if (parameters->incremental_update()) |
4543 | gold_debug(DEBUG_INCREMENTAL, | |
4544 | "set_section_list_addresses: %08lx %08lx %s", | |
4545 | static_cast<long>(off), | |
4546 | static_cast<long>((*p)->data_size()), | |
4547 | ((*p)->output_section() != NULL | |
4548 | ? (*p)->output_section()->name() : "(special)")); | |
4549 | ||
4550 | // We want to ignore the size of a SHF_TLS SHT_NOBITS | |
96a2b4e4 ILT |
4551 | // section. Such a section does not affect the size of a |
4552 | // PT_LOAD segment. | |
4553 | if (!(*p)->is_section_flag_set(elfcpp::SHF_TLS) | |
ead1e424 ILT |
4554 | || !(*p)->is_section_type(elfcpp::SHT_NOBITS)) |
4555 | off += (*p)->data_size(); | |
75f65a3e | 4556 | |
cdc29364 CC |
4557 | if (off > maxoff) |
4558 | maxoff = off; | |
4559 | ||
ead1e424 ILT |
4560 | if ((*p)->is_section()) |
4561 | { | |
4562 | (*p)->set_out_shndx(*pshndx); | |
4563 | ++*pshndx; | |
4564 | } | |
75f65a3e ILT |
4565 | } |
4566 | ||
cdc29364 CC |
4567 | *poff = maxoff; |
4568 | return addr + (maxoff - startoff); | |
75f65a3e ILT |
4569 | } |
4570 | ||
4571 | // For a non-PT_LOAD segment, set the offset from the sections, if | |
1a2dff53 | 4572 | // any. Add INCREASE to the file size and the memory size. |
75f65a3e ILT |
4573 | |
4574 | void | |
1a2dff53 | 4575 | Output_segment::set_offset(unsigned int increase) |
75f65a3e | 4576 | { |
a3ad94ed | 4577 | gold_assert(this->type_ != elfcpp::PT_LOAD); |
75f65a3e | 4578 | |
a445fddf ILT |
4579 | gold_assert(!this->are_addresses_set_); |
4580 | ||
22f0da72 ILT |
4581 | // A non-load section only uses output_lists_[0]. |
4582 | ||
4583 | Output_data_list* pdl = &this->output_lists_[0]; | |
4584 | ||
4585 | if (pdl->empty()) | |
75f65a3e | 4586 | { |
1a2dff53 | 4587 | gold_assert(increase == 0); |
75f65a3e ILT |
4588 | this->vaddr_ = 0; |
4589 | this->paddr_ = 0; | |
a445fddf | 4590 | this->are_addresses_set_ = true; |
75f65a3e | 4591 | this->memsz_ = 0; |
a445fddf | 4592 | this->min_p_align_ = 0; |
75f65a3e ILT |
4593 | this->offset_ = 0; |
4594 | this->filesz_ = 0; | |
4595 | return; | |
4596 | } | |
4597 | ||
22f0da72 | 4598 | // Find the first and last section by address. |
5f1ab67a ILT |
4599 | const Output_data* first = NULL; |
4600 | const Output_data* last_data = NULL; | |
4601 | const Output_data* last_bss = NULL; | |
22f0da72 ILT |
4602 | for (Output_data_list::const_iterator p = pdl->begin(); |
4603 | p != pdl->end(); | |
4604 | ++p) | |
4605 | { | |
4606 | if (first == NULL | |
4607 | || (*p)->address() < first->address() | |
4608 | || ((*p)->address() == first->address() | |
4609 | && (*p)->data_size() < first->data_size())) | |
4610 | first = *p; | |
4611 | const Output_data** plast; | |
4612 | if ((*p)->is_section() | |
4613 | && (*p)->output_section()->type() == elfcpp::SHT_NOBITS) | |
4614 | plast = &last_bss; | |
4615 | else | |
4616 | plast = &last_data; | |
4617 | if (*plast == NULL | |
4618 | || (*p)->address() > (*plast)->address() | |
4619 | || ((*p)->address() == (*plast)->address() | |
4620 | && (*p)->data_size() > (*plast)->data_size())) | |
4621 | *plast = *p; | |
4622 | } | |
5f1ab67a | 4623 | |
75f65a3e | 4624 | this->vaddr_ = first->address(); |
a445fddf ILT |
4625 | this->paddr_ = (first->has_load_address() |
4626 | ? first->load_address() | |
4627 | : this->vaddr_); | |
4628 | this->are_addresses_set_ = true; | |
75f65a3e ILT |
4629 | this->offset_ = first->offset(); |
4630 | ||
22f0da72 | 4631 | if (last_data == NULL) |
75f65a3e ILT |
4632 | this->filesz_ = 0; |
4633 | else | |
5f1ab67a ILT |
4634 | this->filesz_ = (last_data->address() |
4635 | + last_data->data_size() | |
4636 | - this->vaddr_); | |
75f65a3e | 4637 | |
5f1ab67a | 4638 | const Output_data* last = last_bss != NULL ? last_bss : last_data; |
75f65a3e ILT |
4639 | this->memsz_ = (last->address() |
4640 | + last->data_size() | |
4641 | - this->vaddr_); | |
96a2b4e4 | 4642 | |
1a2dff53 ILT |
4643 | this->filesz_ += increase; |
4644 | this->memsz_ += increase; | |
4645 | ||
fd064a5b CC |
4646 | // If this is a RELRO segment, verify that the segment ends at a |
4647 | // page boundary. | |
4648 | if (this->type_ == elfcpp::PT_GNU_RELRO) | |
4649 | { | |
815a1205 | 4650 | uint64_t page_align = parameters->target().abi_pagesize(); |
fd064a5b | 4651 | uint64_t segment_end = this->vaddr_ + this->memsz_; |
cdc29364 CC |
4652 | if (parameters->incremental_update()) |
4653 | { | |
4654 | // The INCREASE_RELRO calculation is bypassed for an incremental | |
4655 | // update, so we need to adjust the segment size manually here. | |
4656 | segment_end = align_address(segment_end, page_align); | |
4657 | this->memsz_ = segment_end - this->vaddr_; | |
4658 | } | |
4659 | else | |
4660 | gold_assert(segment_end == align_address(segment_end, page_align)); | |
fd064a5b CC |
4661 | } |
4662 | ||
96a2b4e4 ILT |
4663 | // If this is a TLS segment, align the memory size. The code in |
4664 | // set_section_list ensures that the section after the TLS segment | |
4665 | // is aligned to give us room. | |
4666 | if (this->type_ == elfcpp::PT_TLS) | |
4667 | { | |
4668 | uint64_t segment_align = this->maximum_alignment(); | |
4669 | gold_assert(this->vaddr_ == align_address(this->vaddr_, segment_align)); | |
4670 | this->memsz_ = align_address(this->memsz_, segment_align); | |
4671 | } | |
75f65a3e ILT |
4672 | } |
4673 | ||
7bf1f802 ILT |
4674 | // Set the TLS offsets of the sections in the PT_TLS segment. |
4675 | ||
4676 | void | |
4677 | Output_segment::set_tls_offsets() | |
4678 | { | |
4679 | gold_assert(this->type_ == elfcpp::PT_TLS); | |
4680 | ||
22f0da72 ILT |
4681 | for (Output_data_list::iterator p = this->output_lists_[0].begin(); |
4682 | p != this->output_lists_[0].end(); | |
7bf1f802 ILT |
4683 | ++p) |
4684 | (*p)->set_tls_offset(this->vaddr_); | |
4685 | } | |
4686 | ||
7404fe1b | 4687 | // Return the first section. |
a445fddf | 4688 | |
7404fe1b AM |
4689 | Output_section* |
4690 | Output_segment::first_section() const | |
a445fddf | 4691 | { |
22f0da72 ILT |
4692 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) |
4693 | { | |
4694 | const Output_data_list* pdl = &this->output_lists_[i]; | |
4695 | for (Output_data_list::const_iterator p = pdl->begin(); | |
4696 | p != pdl->end(); | |
4697 | ++p) | |
4698 | { | |
4699 | if ((*p)->is_section()) | |
7404fe1b | 4700 | return (*p)->output_section(); |
22f0da72 ILT |
4701 | } |
4702 | } | |
a445fddf ILT |
4703 | gold_unreachable(); |
4704 | } | |
4705 | ||
75f65a3e ILT |
4706 | // Return the number of Output_sections in an Output_segment. |
4707 | ||
4708 | unsigned int | |
4709 | Output_segment::output_section_count() const | |
4710 | { | |
22f0da72 ILT |
4711 | unsigned int ret = 0; |
4712 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) | |
4713 | ret += this->output_section_count_list(&this->output_lists_[i]); | |
4714 | return ret; | |
75f65a3e ILT |
4715 | } |
4716 | ||
4717 | // Return the number of Output_sections in an Output_data_list. | |
4718 | ||
4719 | unsigned int | |
4720 | Output_segment::output_section_count_list(const Output_data_list* pdl) const | |
4721 | { | |
4722 | unsigned int count = 0; | |
4723 | for (Output_data_list::const_iterator p = pdl->begin(); | |
4724 | p != pdl->end(); | |
4725 | ++p) | |
4726 | { | |
4727 | if ((*p)->is_section()) | |
4728 | ++count; | |
4729 | } | |
4730 | return count; | |
a2fb1b05 ILT |
4731 | } |
4732 | ||
1c4f3631 ILT |
4733 | // Return the section attached to the list segment with the lowest |
4734 | // load address. This is used when handling a PHDRS clause in a | |
4735 | // linker script. | |
4736 | ||
4737 | Output_section* | |
4738 | Output_segment::section_with_lowest_load_address() const | |
4739 | { | |
4740 | Output_section* found = NULL; | |
4741 | uint64_t found_lma = 0; | |
22f0da72 ILT |
4742 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) |
4743 | this->lowest_load_address_in_list(&this->output_lists_[i], &found, | |
4744 | &found_lma); | |
1c4f3631 ILT |
4745 | return found; |
4746 | } | |
4747 | ||
4748 | // Look through a list for a section with a lower load address. | |
4749 | ||
4750 | void | |
4751 | Output_segment::lowest_load_address_in_list(const Output_data_list* pdl, | |
4752 | Output_section** found, | |
4753 | uint64_t* found_lma) const | |
4754 | { | |
4755 | for (Output_data_list::const_iterator p = pdl->begin(); | |
4756 | p != pdl->end(); | |
4757 | ++p) | |
4758 | { | |
4759 | if (!(*p)->is_section()) | |
4760 | continue; | |
4761 | Output_section* os = static_cast<Output_section*>(*p); | |
4762 | uint64_t lma = (os->has_load_address() | |
4763 | ? os->load_address() | |
4764 | : os->address()); | |
4765 | if (*found == NULL || lma < *found_lma) | |
4766 | { | |
4767 | *found = os; | |
4768 | *found_lma = lma; | |
4769 | } | |
4770 | } | |
4771 | } | |
4772 | ||
61ba1cf9 ILT |
4773 | // Write the segment data into *OPHDR. |
4774 | ||
4775 | template<int size, bool big_endian> | |
4776 | void | |
ead1e424 | 4777 | Output_segment::write_header(elfcpp::Phdr_write<size, big_endian>* ophdr) |
61ba1cf9 ILT |
4778 | { |
4779 | ophdr->put_p_type(this->type_); | |
4780 | ophdr->put_p_offset(this->offset_); | |
4781 | ophdr->put_p_vaddr(this->vaddr_); | |
4782 | ophdr->put_p_paddr(this->paddr_); | |
4783 | ophdr->put_p_filesz(this->filesz_); | |
4784 | ophdr->put_p_memsz(this->memsz_); | |
4785 | ophdr->put_p_flags(this->flags_); | |
a445fddf | 4786 | ophdr->put_p_align(std::max(this->min_p_align_, this->maximum_alignment())); |
61ba1cf9 ILT |
4787 | } |
4788 | ||
4789 | // Write the section headers into V. | |
4790 | ||
4791 | template<int size, bool big_endian> | |
4792 | unsigned char* | |
16649710 ILT |
4793 | Output_segment::write_section_headers(const Layout* layout, |
4794 | const Stringpool* secnamepool, | |
ead1e424 | 4795 | unsigned char* v, |
ca09d69a | 4796 | unsigned int* pshndx) const |
5482377d | 4797 | { |
ead1e424 ILT |
4798 | // Every section that is attached to a segment must be attached to a |
4799 | // PT_LOAD segment, so we only write out section headers for PT_LOAD | |
4800 | // segments. | |
4801 | if (this->type_ != elfcpp::PT_LOAD) | |
4802 | return v; | |
4803 | ||
22f0da72 ILT |
4804 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) |
4805 | { | |
4806 | const Output_data_list* pdl = &this->output_lists_[i]; | |
4807 | v = this->write_section_headers_list<size, big_endian>(layout, | |
4808 | secnamepool, | |
4809 | pdl, | |
4810 | v, pshndx); | |
4811 | } | |
4812 | ||
61ba1cf9 ILT |
4813 | return v; |
4814 | } | |
4815 | ||
4816 | template<int size, bool big_endian> | |
4817 | unsigned char* | |
16649710 ILT |
4818 | Output_segment::write_section_headers_list(const Layout* layout, |
4819 | const Stringpool* secnamepool, | |
61ba1cf9 | 4820 | const Output_data_list* pdl, |
ead1e424 | 4821 | unsigned char* v, |
7d1a9ebb | 4822 | unsigned int* pshndx) const |
61ba1cf9 ILT |
4823 | { |
4824 | const int shdr_size = elfcpp::Elf_sizes<size>::shdr_size; | |
4825 | for (Output_data_list::const_iterator p = pdl->begin(); | |
4826 | p != pdl->end(); | |
4827 | ++p) | |
4828 | { | |
4829 | if ((*p)->is_section()) | |
4830 | { | |
5482377d | 4831 | const Output_section* ps = static_cast<const Output_section*>(*p); |
a3ad94ed | 4832 | gold_assert(*pshndx == ps->out_shndx()); |
61ba1cf9 | 4833 | elfcpp::Shdr_write<size, big_endian> oshdr(v); |
16649710 | 4834 | ps->write_header(layout, secnamepool, &oshdr); |
61ba1cf9 | 4835 | v += shdr_size; |
ead1e424 | 4836 | ++*pshndx; |
61ba1cf9 ILT |
4837 | } |
4838 | } | |
4839 | return v; | |
4840 | } | |
4841 | ||
7d9e3d98 ILT |
4842 | // Print the output sections to the map file. |
4843 | ||
4844 | void | |
4845 | Output_segment::print_sections_to_mapfile(Mapfile* mapfile) const | |
4846 | { | |
4847 | if (this->type() != elfcpp::PT_LOAD) | |
4848 | return; | |
22f0da72 ILT |
4849 | for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i) |
4850 | this->print_section_list_to_mapfile(mapfile, &this->output_lists_[i]); | |
7d9e3d98 ILT |
4851 | } |
4852 | ||
4853 | // Print an output section list to the map file. | |
4854 | ||
4855 | void | |
4856 | Output_segment::print_section_list_to_mapfile(Mapfile* mapfile, | |
4857 | const Output_data_list* pdl) const | |
4858 | { | |
4859 | for (Output_data_list::const_iterator p = pdl->begin(); | |
4860 | p != pdl->end(); | |
4861 | ++p) | |
4862 | (*p)->print_to_mapfile(mapfile); | |
4863 | } | |
4864 | ||
a2fb1b05 ILT |
4865 | // Output_file methods. |
4866 | ||
14144f39 ILT |
4867 | Output_file::Output_file(const char* name) |
4868 | : name_(name), | |
61ba1cf9 ILT |
4869 | o_(-1), |
4870 | file_size_(0), | |
c420411f | 4871 | base_(NULL), |
516cb3d0 | 4872 | map_is_anonymous_(false), |
88597d34 | 4873 | map_is_allocated_(false), |
516cb3d0 | 4874 | is_temporary_(false) |
61ba1cf9 ILT |
4875 | { |
4876 | } | |
4877 | ||
404c2abb | 4878 | // Try to open an existing file. Returns false if the file doesn't |
aa92d6ed CC |
4879 | // exist, has a size of 0 or can't be mmapped. If BASE_NAME is not |
4880 | // NULL, open that file as the base for incremental linking, and | |
4881 | // copy its contents to the new output file. This routine can | |
4882 | // be called for incremental updates, in which case WRITABLE should | |
4883 | // be true, or by the incremental-dump utility, in which case | |
4884 | // WRITABLE should be false. | |
404c2abb ILT |
4885 | |
4886 | bool | |
aa92d6ed | 4887 | Output_file::open_base_file(const char* base_name, bool writable) |
404c2abb ILT |
4888 | { |
4889 | // The name "-" means "stdout". | |
4890 | if (strcmp(this->name_, "-") == 0) | |
4891 | return false; | |
4892 | ||
aa92d6ed CC |
4893 | bool use_base_file = base_name != NULL; |
4894 | if (!use_base_file) | |
4895 | base_name = this->name_; | |
4896 | else if (strcmp(base_name, this->name_) == 0) | |
4897 | gold_fatal(_("%s: incremental base and output file name are the same"), | |
4898 | base_name); | |
4899 | ||
404c2abb ILT |
4900 | // Don't bother opening files with a size of zero. |
4901 | struct stat s; | |
aa92d6ed CC |
4902 | if (::stat(base_name, &s) != 0) |
4903 | { | |
4904 | gold_info(_("%s: stat: %s"), base_name, strerror(errno)); | |
4905 | return false; | |
4906 | } | |
4907 | if (s.st_size == 0) | |
4908 | { | |
4909 | gold_info(_("%s: incremental base file is empty"), base_name); | |
4910 | return false; | |
4911 | } | |
4912 | ||
4913 | // If we're using a base file, we want to open it read-only. | |
4914 | if (use_base_file) | |
4915 | writable = false; | |
404c2abb | 4916 | |
aa92d6ed CC |
4917 | int oflags = writable ? O_RDWR : O_RDONLY; |
4918 | int o = open_descriptor(-1, base_name, oflags, 0); | |
404c2abb | 4919 | if (o < 0) |
aa92d6ed CC |
4920 | { |
4921 | gold_info(_("%s: open: %s"), base_name, strerror(errno)); | |
4922 | return false; | |
4923 | } | |
4924 | ||
4925 | // If the base file and the output file are different, open a | |
4926 | // new output file and read the contents from the base file into | |
4927 | // the newly-mapped region. | |
4928 | if (use_base_file) | |
4929 | { | |
4930 | this->open(s.st_size); | |
dfb45471 CC |
4931 | ssize_t bytes_to_read = s.st_size; |
4932 | unsigned char* p = this->base_; | |
4933 | while (bytes_to_read > 0) | |
4934 | { | |
4935 | ssize_t len = ::read(o, p, bytes_to_read); | |
4936 | if (len < 0) | |
4937 | { | |
4938 | gold_info(_("%s: read failed: %s"), base_name, strerror(errno)); | |
4939 | return false; | |
4940 | } | |
4941 | if (len == 0) | |
4942 | { | |
4943 | gold_info(_("%s: file too short: read only %lld of %lld bytes"), | |
4944 | base_name, | |
4945 | static_cast<long long>(s.st_size - bytes_to_read), | |
4946 | static_cast<long long>(s.st_size)); | |
4947 | return false; | |
4948 | } | |
4949 | p += len; | |
4950 | bytes_to_read -= len; | |
4951 | } | |
aa92d6ed CC |
4952 | ::close(o); |
4953 | return true; | |
4954 | } | |
4955 | ||
404c2abb ILT |
4956 | this->o_ = o; |
4957 | this->file_size_ = s.st_size; | |
4958 | ||
aa92d6ed | 4959 | if (!this->map_no_anonymous(writable)) |
404c2abb ILT |
4960 | { |
4961 | release_descriptor(o, true); | |
4962 | this->o_ = -1; | |
4963 | this->file_size_ = 0; | |
4964 | return false; | |
4965 | } | |
4966 | ||
4967 | return true; | |
4968 | } | |
4969 | ||
61ba1cf9 ILT |
4970 | // Open the output file. |
4971 | ||
a2fb1b05 | 4972 | void |
61ba1cf9 | 4973 | Output_file::open(off_t file_size) |
a2fb1b05 | 4974 | { |
61ba1cf9 ILT |
4975 | this->file_size_ = file_size; |
4976 | ||
4e9d8586 ILT |
4977 | // Unlink the file first; otherwise the open() may fail if the file |
4978 | // is busy (e.g. it's an executable that's currently being executed). | |
4979 | // | |
4980 | // However, the linker may be part of a system where a zero-length | |
4981 | // file is created for it to write to, with tight permissions (gcc | |
4982 | // 2.95 did something like this). Unlinking the file would work | |
4983 | // around those permission controls, so we only unlink if the file | |
4984 | // has a non-zero size. We also unlink only regular files to avoid | |
4985 | // trouble with directories/etc. | |
4986 | // | |
4987 | // If we fail, continue; this command is merely a best-effort attempt | |
4988 | // to improve the odds for open(). | |
4989 | ||
42a1b686 | 4990 | // We let the name "-" mean "stdout" |
516cb3d0 | 4991 | if (!this->is_temporary_) |
42a1b686 | 4992 | { |
516cb3d0 ILT |
4993 | if (strcmp(this->name_, "-") == 0) |
4994 | this->o_ = STDOUT_FILENO; | |
4995 | else | |
4996 | { | |
4997 | struct stat s; | |
6a89f575 CC |
4998 | if (::stat(this->name_, &s) == 0 |
4999 | && (S_ISREG (s.st_mode) || S_ISLNK (s.st_mode))) | |
5000 | { | |
5001 | if (s.st_size != 0) | |
5002 | ::unlink(this->name_); | |
5003 | else if (!parameters->options().relocatable()) | |
5004 | { | |
5005 | // If we don't unlink the existing file, add execute | |
5006 | // permission where read permissions already exist | |
5007 | // and where the umask permits. | |
5008 | int mask = ::umask(0); | |
5009 | ::umask(mask); | |
5010 | s.st_mode |= (s.st_mode & 0444) >> 2; | |
5011 | ::chmod(this->name_, s.st_mode & ~mask); | |
5012 | } | |
5013 | } | |
516cb3d0 | 5014 | |
8851ecca | 5015 | int mode = parameters->options().relocatable() ? 0666 : 0777; |
2a00e4fb ILT |
5016 | int o = open_descriptor(-1, this->name_, O_RDWR | O_CREAT | O_TRUNC, |
5017 | mode); | |
516cb3d0 ILT |
5018 | if (o < 0) |
5019 | gold_fatal(_("%s: open: %s"), this->name_, strerror(errno)); | |
5020 | this->o_ = o; | |
5021 | } | |
42a1b686 | 5022 | } |
61ba1cf9 | 5023 | |
27bc2bce ILT |
5024 | this->map(); |
5025 | } | |
5026 | ||
5027 | // Resize the output file. | |
5028 | ||
5029 | void | |
5030 | Output_file::resize(off_t file_size) | |
5031 | { | |
c420411f ILT |
5032 | // If the mmap is mapping an anonymous memory buffer, this is easy: |
5033 | // just mremap to the new size. If it's mapping to a file, we want | |
5034 | // to unmap to flush to the file, then remap after growing the file. | |
5035 | if (this->map_is_anonymous_) | |
5036 | { | |
88597d34 ILT |
5037 | void* base; |
5038 | if (!this->map_is_allocated_) | |
5039 | { | |
5040 | base = ::mremap(this->base_, this->file_size_, file_size, | |
5041 | MREMAP_MAYMOVE); | |
5042 | if (base == MAP_FAILED) | |
5043 | gold_fatal(_("%s: mremap: %s"), this->name_, strerror(errno)); | |
5044 | } | |
5045 | else | |
5046 | { | |
5047 | base = realloc(this->base_, file_size); | |
5048 | if (base == NULL) | |
5049 | gold_nomem(); | |
5050 | if (file_size > this->file_size_) | |
5051 | memset(static_cast<char*>(base) + this->file_size_, 0, | |
5052 | file_size - this->file_size_); | |
5053 | } | |
c420411f ILT |
5054 | this->base_ = static_cast<unsigned char*>(base); |
5055 | this->file_size_ = file_size; | |
5056 | } | |
5057 | else | |
5058 | { | |
5059 | this->unmap(); | |
5060 | this->file_size_ = file_size; | |
aa92d6ed | 5061 | if (!this->map_no_anonymous(true)) |
fdcac5af | 5062 | gold_fatal(_("%s: mmap: %s"), this->name_, strerror(errno)); |
c420411f | 5063 | } |
27bc2bce ILT |
5064 | } |
5065 | ||
404c2abb ILT |
5066 | // Map an anonymous block of memory which will later be written to the |
5067 | // file. Return whether the map succeeded. | |
26736d8e | 5068 | |
404c2abb | 5069 | bool |
26736d8e ILT |
5070 | Output_file::map_anonymous() |
5071 | { | |
404c2abb ILT |
5072 | void* base = ::mmap(NULL, this->file_size_, PROT_READ | PROT_WRITE, |
5073 | MAP_PRIVATE | MAP_ANONYMOUS, -1, 0); | |
88597d34 | 5074 | if (base == MAP_FAILED) |
404c2abb | 5075 | { |
88597d34 ILT |
5076 | base = malloc(this->file_size_); |
5077 | if (base == NULL) | |
5078 | return false; | |
5079 | memset(base, 0, this->file_size_); | |
5080 | this->map_is_allocated_ = true; | |
404c2abb | 5081 | } |
88597d34 ILT |
5082 | this->base_ = static_cast<unsigned char*>(base); |
5083 | this->map_is_anonymous_ = true; | |
5084 | return true; | |
26736d8e ILT |
5085 | } |
5086 | ||
404c2abb | 5087 | // Map the file into memory. Return whether the mapping succeeded. |
aa92d6ed | 5088 | // If WRITABLE is true, map with write access. |
27bc2bce | 5089 | |
404c2abb | 5090 | bool |
aa92d6ed | 5091 | Output_file::map_no_anonymous(bool writable) |
27bc2bce | 5092 | { |
c420411f | 5093 | const int o = this->o_; |
61ba1cf9 | 5094 | |
c420411f ILT |
5095 | // If the output file is not a regular file, don't try to mmap it; |
5096 | // instead, we'll mmap a block of memory (an anonymous buffer), and | |
5097 | // then later write the buffer to the file. | |
5098 | void* base; | |
5099 | struct stat statbuf; | |
42a1b686 ILT |
5100 | if (o == STDOUT_FILENO || o == STDERR_FILENO |
5101 | || ::fstat(o, &statbuf) != 0 | |
516cb3d0 ILT |
5102 | || !S_ISREG(statbuf.st_mode) |
5103 | || this->is_temporary_) | |
404c2abb ILT |
5104 | return false; |
5105 | ||
5106 | // Ensure that we have disk space available for the file. If we | |
5107 | // don't do this, it is possible that we will call munmap, close, | |
5108 | // and exit with dirty buffers still in the cache with no assigned | |
5109 | // disk blocks. If the disk is out of space at that point, the | |
5110 | // output file will wind up incomplete, but we will have already | |
5111 | // exited. The alternative to fallocate would be to use fdatasync, | |
5112 | // but that would be a more significant performance hit. | |
bab9090f CC |
5113 | if (writable) |
5114 | { | |
7c0640fa | 5115 | int err = gold_fallocate(o, 0, this->file_size_); |
bab9090f CC |
5116 | if (err != 0) |
5117 | gold_fatal(_("%s: %s"), this->name_, strerror(err)); | |
5118 | } | |
404c2abb ILT |
5119 | |
5120 | // Map the file into memory. | |
aa92d6ed CC |
5121 | int prot = PROT_READ; |
5122 | if (writable) | |
5123 | prot |= PROT_WRITE; | |
5124 | base = ::mmap(NULL, this->file_size_, prot, MAP_SHARED, o, 0); | |
404c2abb ILT |
5125 | |
5126 | // The mmap call might fail because of file system issues: the file | |
5127 | // system might not support mmap at all, or it might not support | |
5128 | // mmap with PROT_WRITE. | |
61ba1cf9 | 5129 | if (base == MAP_FAILED) |
404c2abb ILT |
5130 | return false; |
5131 | ||
5132 | this->map_is_anonymous_ = false; | |
61ba1cf9 | 5133 | this->base_ = static_cast<unsigned char*>(base); |
404c2abb ILT |
5134 | return true; |
5135 | } | |
5136 | ||
5137 | // Map the file into memory. | |
5138 | ||
5139 | void | |
5140 | Output_file::map() | |
5141 | { | |
7c0640fa CC |
5142 | if (parameters->options().mmap_output_file() |
5143 | && this->map_no_anonymous(true)) | |
404c2abb ILT |
5144 | return; |
5145 | ||
5146 | // The mmap call might fail because of file system issues: the file | |
5147 | // system might not support mmap at all, or it might not support | |
5148 | // mmap with PROT_WRITE. I'm not sure which errno values we will | |
5149 | // see in all cases, so if the mmap fails for any reason and we | |
5150 | // don't care about file contents, try for an anonymous map. | |
5151 | if (this->map_anonymous()) | |
5152 | return; | |
5153 | ||
5154 | gold_fatal(_("%s: mmap: failed to allocate %lu bytes for output file: %s"), | |
5155 | this->name_, static_cast<unsigned long>(this->file_size_), | |
5156 | strerror(errno)); | |
61ba1cf9 ILT |
5157 | } |
5158 | ||
c420411f | 5159 | // Unmap the file from memory. |
61ba1cf9 ILT |
5160 | |
5161 | void | |
c420411f | 5162 | Output_file::unmap() |
61ba1cf9 | 5163 | { |
88597d34 ILT |
5164 | if (this->map_is_anonymous_) |
5165 | { | |
5166 | // We've already written out the data, so there is no reason to | |
5167 | // waste time unmapping or freeing the memory. | |
5168 | } | |
5169 | else | |
5170 | { | |
5171 | if (::munmap(this->base_, this->file_size_) < 0) | |
5172 | gold_error(_("%s: munmap: %s"), this->name_, strerror(errno)); | |
5173 | } | |
61ba1cf9 | 5174 | this->base_ = NULL; |
c420411f ILT |
5175 | } |
5176 | ||
5177 | // Close the output file. | |
5178 | ||
5179 | void | |
5180 | Output_file::close() | |
5181 | { | |
5182 | // If the map isn't file-backed, we need to write it now. | |
516cb3d0 | 5183 | if (this->map_is_anonymous_ && !this->is_temporary_) |
c420411f ILT |
5184 | { |
5185 | size_t bytes_to_write = this->file_size_; | |
6d1e3092 | 5186 | size_t offset = 0; |
c420411f ILT |
5187 | while (bytes_to_write > 0) |
5188 | { | |
6d1e3092 CD |
5189 | ssize_t bytes_written = ::write(this->o_, this->base_ + offset, |
5190 | bytes_to_write); | |
c420411f ILT |
5191 | if (bytes_written == 0) |
5192 | gold_error(_("%s: write: unexpected 0 return-value"), this->name_); | |
5193 | else if (bytes_written < 0) | |
5194 | gold_error(_("%s: write: %s"), this->name_, strerror(errno)); | |
5195 | else | |
6d1e3092 CD |
5196 | { |
5197 | bytes_to_write -= bytes_written; | |
5198 | offset += bytes_written; | |
5199 | } | |
c420411f ILT |
5200 | } |
5201 | } | |
5202 | this->unmap(); | |
61ba1cf9 | 5203 | |
42a1b686 | 5204 | // We don't close stdout or stderr |
516cb3d0 ILT |
5205 | if (this->o_ != STDOUT_FILENO |
5206 | && this->o_ != STDERR_FILENO | |
5207 | && !this->is_temporary_) | |
42a1b686 ILT |
5208 | if (::close(this->o_) < 0) |
5209 | gold_error(_("%s: close: %s"), this->name_, strerror(errno)); | |
61ba1cf9 | 5210 | this->o_ = -1; |
a2fb1b05 ILT |
5211 | } |
5212 | ||
5213 | // Instantiate the templates we need. We could use the configure | |
5214 | // script to restrict this to only the ones for implemented targets. | |
5215 | ||
193a53d9 | 5216 | #ifdef HAVE_TARGET_32_LITTLE |
a2fb1b05 ILT |
5217 | template |
5218 | off_t | |
5219 | Output_section::add_input_section<32, false>( | |
6e9ba2ca | 5220 | Layout* layout, |
6fa2a40b | 5221 | Sized_relobj_file<32, false>* object, |
2ea97941 | 5222 | unsigned int shndx, |
a2fb1b05 | 5223 | const char* secname, |
730cdc88 | 5224 | const elfcpp::Shdr<32, false>& shdr, |
a445fddf ILT |
5225 | unsigned int reloc_shndx, |
5226 | bool have_sections_script); | |
193a53d9 | 5227 | #endif |
a2fb1b05 | 5228 | |
193a53d9 | 5229 | #ifdef HAVE_TARGET_32_BIG |
a2fb1b05 ILT |
5230 | template |
5231 | off_t | |
5232 | Output_section::add_input_section<32, true>( | |
6e9ba2ca | 5233 | Layout* layout, |
6fa2a40b | 5234 | Sized_relobj_file<32, true>* object, |
2ea97941 | 5235 | unsigned int shndx, |
a2fb1b05 | 5236 | const char* secname, |
730cdc88 | 5237 | const elfcpp::Shdr<32, true>& shdr, |
a445fddf ILT |
5238 | unsigned int reloc_shndx, |
5239 | bool have_sections_script); | |
193a53d9 | 5240 | #endif |
a2fb1b05 | 5241 | |
193a53d9 | 5242 | #ifdef HAVE_TARGET_64_LITTLE |
a2fb1b05 ILT |
5243 | template |
5244 | off_t | |
5245 | Output_section::add_input_section<64, false>( | |
6e9ba2ca | 5246 | Layout* layout, |
6fa2a40b | 5247 | Sized_relobj_file<64, false>* object, |
2ea97941 | 5248 | unsigned int shndx, |
a2fb1b05 | 5249 | const char* secname, |
730cdc88 | 5250 | const elfcpp::Shdr<64, false>& shdr, |
a445fddf ILT |
5251 | unsigned int reloc_shndx, |
5252 | bool have_sections_script); | |
193a53d9 | 5253 | #endif |
a2fb1b05 | 5254 | |
193a53d9 | 5255 | #ifdef HAVE_TARGET_64_BIG |
a2fb1b05 ILT |
5256 | template |
5257 | off_t | |
5258 | Output_section::add_input_section<64, true>( | |
6e9ba2ca | 5259 | Layout* layout, |
6fa2a40b | 5260 | Sized_relobj_file<64, true>* object, |
2ea97941 | 5261 | unsigned int shndx, |
a2fb1b05 | 5262 | const char* secname, |
730cdc88 | 5263 | const elfcpp::Shdr<64, true>& shdr, |
a445fddf ILT |
5264 | unsigned int reloc_shndx, |
5265 | bool have_sections_script); | |
193a53d9 | 5266 | #endif |
a2fb1b05 | 5267 | |
bbbfea06 CC |
5268 | #ifdef HAVE_TARGET_32_LITTLE |
5269 | template | |
5270 | class Output_reloc<elfcpp::SHT_REL, false, 32, false>; | |
5271 | #endif | |
5272 | ||
5273 | #ifdef HAVE_TARGET_32_BIG | |
5274 | template | |
5275 | class Output_reloc<elfcpp::SHT_REL, false, 32, true>; | |
5276 | #endif | |
5277 | ||
5278 | #ifdef HAVE_TARGET_64_LITTLE | |
5279 | template | |
5280 | class Output_reloc<elfcpp::SHT_REL, false, 64, false>; | |
5281 | #endif | |
5282 | ||
5283 | #ifdef HAVE_TARGET_64_BIG | |
5284 | template | |
5285 | class Output_reloc<elfcpp::SHT_REL, false, 64, true>; | |
5286 | #endif | |
5287 | ||
5288 | #ifdef HAVE_TARGET_32_LITTLE | |
5289 | template | |
5290 | class Output_reloc<elfcpp::SHT_REL, true, 32, false>; | |
5291 | #endif | |
5292 | ||
5293 | #ifdef HAVE_TARGET_32_BIG | |
5294 | template | |
5295 | class Output_reloc<elfcpp::SHT_REL, true, 32, true>; | |
5296 | #endif | |
5297 | ||
5298 | #ifdef HAVE_TARGET_64_LITTLE | |
5299 | template | |
5300 | class Output_reloc<elfcpp::SHT_REL, true, 64, false>; | |
5301 | #endif | |
5302 | ||
5303 | #ifdef HAVE_TARGET_64_BIG | |
5304 | template | |
5305 | class Output_reloc<elfcpp::SHT_REL, true, 64, true>; | |
5306 | #endif | |
5307 | ||
5308 | #ifdef HAVE_TARGET_32_LITTLE | |
5309 | template | |
5310 | class Output_reloc<elfcpp::SHT_RELA, false, 32, false>; | |
5311 | #endif | |
5312 | ||
5313 | #ifdef HAVE_TARGET_32_BIG | |
5314 | template | |
5315 | class Output_reloc<elfcpp::SHT_RELA, false, 32, true>; | |
5316 | #endif | |
5317 | ||
5318 | #ifdef HAVE_TARGET_64_LITTLE | |
5319 | template | |
5320 | class Output_reloc<elfcpp::SHT_RELA, false, 64, false>; | |
5321 | #endif | |
5322 | ||
5323 | #ifdef HAVE_TARGET_64_BIG | |
5324 | template | |
5325 | class Output_reloc<elfcpp::SHT_RELA, false, 64, true>; | |
5326 | #endif | |
5327 | ||
5328 | #ifdef HAVE_TARGET_32_LITTLE | |
5329 | template | |
5330 | class Output_reloc<elfcpp::SHT_RELA, true, 32, false>; | |
5331 | #endif | |
5332 | ||
5333 | #ifdef HAVE_TARGET_32_BIG | |
5334 | template | |
5335 | class Output_reloc<elfcpp::SHT_RELA, true, 32, true>; | |
5336 | #endif | |
5337 | ||
5338 | #ifdef HAVE_TARGET_64_LITTLE | |
5339 | template | |
5340 | class Output_reloc<elfcpp::SHT_RELA, true, 64, false>; | |
5341 | #endif | |
5342 | ||
5343 | #ifdef HAVE_TARGET_64_BIG | |
5344 | template | |
5345 | class Output_reloc<elfcpp::SHT_RELA, true, 64, true>; | |
5346 | #endif | |
5347 | ||
193a53d9 | 5348 | #ifdef HAVE_TARGET_32_LITTLE |
c06b7b0b ILT |
5349 | template |
5350 | class Output_data_reloc<elfcpp::SHT_REL, false, 32, false>; | |
193a53d9 | 5351 | #endif |
c06b7b0b | 5352 | |
193a53d9 | 5353 | #ifdef HAVE_TARGET_32_BIG |
c06b7b0b ILT |
5354 | template |
5355 | class Output_data_reloc<elfcpp::SHT_REL, false, 32, true>; | |
193a53d9 | 5356 | #endif |
c06b7b0b | 5357 | |
193a53d9 | 5358 | #ifdef HAVE_TARGET_64_LITTLE |
c06b7b0b ILT |
5359 | template |
5360 | class Output_data_reloc<elfcpp::SHT_REL, false, 64, false>; | |
193a53d9 | 5361 | #endif |
c06b7b0b | 5362 | |
193a53d9 | 5363 | #ifdef HAVE_TARGET_64_BIG |
c06b7b0b ILT |
5364 | template |
5365 | class Output_data_reloc<elfcpp::SHT_REL, false, 64, true>; | |
193a53d9 | 5366 | #endif |
c06b7b0b | 5367 | |
193a53d9 | 5368 | #ifdef HAVE_TARGET_32_LITTLE |
c06b7b0b ILT |
5369 | template |
5370 | class Output_data_reloc<elfcpp::SHT_REL, true, 32, false>; | |
193a53d9 | 5371 | #endif |
c06b7b0b | 5372 | |
193a53d9 | 5373 | #ifdef HAVE_TARGET_32_BIG |
c06b7b0b ILT |
5374 | template |
5375 | class Output_data_reloc<elfcpp::SHT_REL, true, 32, true>; | |
193a53d9 | 5376 | #endif |
c06b7b0b | 5377 | |
193a53d9 | 5378 | #ifdef HAVE_TARGET_64_LITTLE |
c06b7b0b ILT |
5379 | template |
5380 | class Output_data_reloc<elfcpp::SHT_REL, true, 64, false>; | |
193a53d9 | 5381 | #endif |
c06b7b0b | 5382 | |
193a53d9 | 5383 | #ifdef HAVE_TARGET_64_BIG |
c06b7b0b ILT |
5384 | template |
5385 | class Output_data_reloc<elfcpp::SHT_REL, true, 64, true>; | |
193a53d9 | 5386 | #endif |
c06b7b0b | 5387 | |
193a53d9 | 5388 | #ifdef HAVE_TARGET_32_LITTLE |
c06b7b0b ILT |
5389 | template |
5390 | class Output_data_reloc<elfcpp::SHT_RELA, false, 32, false>; | |
193a53d9 | 5391 | #endif |
c06b7b0b | 5392 | |
193a53d9 | 5393 | #ifdef HAVE_TARGET_32_BIG |
c06b7b0b ILT |
5394 | template |
5395 | class Output_data_reloc<elfcpp::SHT_RELA, false, 32, true>; | |
193a53d9 | 5396 | #endif |
c06b7b0b | 5397 | |
193a53d9 | 5398 | #ifdef HAVE_TARGET_64_LITTLE |
c06b7b0b ILT |
5399 | template |
5400 | class Output_data_reloc<elfcpp::SHT_RELA, false, 64, false>; | |
193a53d9 | 5401 | #endif |
c06b7b0b | 5402 | |
193a53d9 | 5403 | #ifdef HAVE_TARGET_64_BIG |
c06b7b0b ILT |
5404 | template |
5405 | class Output_data_reloc<elfcpp::SHT_RELA, false, 64, true>; | |
193a53d9 | 5406 | #endif |
c06b7b0b | 5407 | |
193a53d9 | 5408 | #ifdef HAVE_TARGET_32_LITTLE |
c06b7b0b ILT |
5409 | template |
5410 | class Output_data_reloc<elfcpp::SHT_RELA, true, 32, false>; | |
193a53d9 | 5411 | #endif |
c06b7b0b | 5412 | |
193a53d9 | 5413 | #ifdef HAVE_TARGET_32_BIG |
c06b7b0b ILT |
5414 | template |
5415 | class Output_data_reloc<elfcpp::SHT_RELA, true, 32, true>; | |
193a53d9 | 5416 | #endif |
c06b7b0b | 5417 | |
193a53d9 | 5418 | #ifdef HAVE_TARGET_64_LITTLE |
c06b7b0b ILT |
5419 | template |
5420 | class Output_data_reloc<elfcpp::SHT_RELA, true, 64, false>; | |
193a53d9 | 5421 | #endif |
c06b7b0b | 5422 | |
193a53d9 | 5423 | #ifdef HAVE_TARGET_64_BIG |
c06b7b0b ILT |
5424 | template |
5425 | class Output_data_reloc<elfcpp::SHT_RELA, true, 64, true>; | |
193a53d9 | 5426 | #endif |
c06b7b0b | 5427 | |
6a74a719 ILT |
5428 | #ifdef HAVE_TARGET_32_LITTLE |
5429 | template | |
5430 | class Output_relocatable_relocs<elfcpp::SHT_REL, 32, false>; | |
5431 | #endif | |
5432 | ||
5433 | #ifdef HAVE_TARGET_32_BIG | |
5434 | template | |
5435 | class Output_relocatable_relocs<elfcpp::SHT_REL, 32, true>; | |
5436 | #endif | |
5437 | ||
5438 | #ifdef HAVE_TARGET_64_LITTLE | |
5439 | template | |
5440 | class Output_relocatable_relocs<elfcpp::SHT_REL, 64, false>; | |
5441 | #endif | |
5442 | ||
5443 | #ifdef HAVE_TARGET_64_BIG | |
5444 | template | |
5445 | class Output_relocatable_relocs<elfcpp::SHT_REL, 64, true>; | |
5446 | #endif | |
5447 | ||
5448 | #ifdef HAVE_TARGET_32_LITTLE | |
5449 | template | |
5450 | class Output_relocatable_relocs<elfcpp::SHT_RELA, 32, false>; | |
5451 | #endif | |
5452 | ||
5453 | #ifdef HAVE_TARGET_32_BIG | |
5454 | template | |
5455 | class Output_relocatable_relocs<elfcpp::SHT_RELA, 32, true>; | |
5456 | #endif | |
5457 | ||
5458 | #ifdef HAVE_TARGET_64_LITTLE | |
5459 | template | |
5460 | class Output_relocatable_relocs<elfcpp::SHT_RELA, 64, false>; | |
5461 | #endif | |
5462 | ||
5463 | #ifdef HAVE_TARGET_64_BIG | |
5464 | template | |
5465 | class Output_relocatable_relocs<elfcpp::SHT_RELA, 64, true>; | |
5466 | #endif | |
5467 | ||
5468 | #ifdef HAVE_TARGET_32_LITTLE | |
5469 | template | |
5470 | class Output_data_group<32, false>; | |
5471 | #endif | |
5472 | ||
5473 | #ifdef HAVE_TARGET_32_BIG | |
5474 | template | |
5475 | class Output_data_group<32, true>; | |
5476 | #endif | |
5477 | ||
5478 | #ifdef HAVE_TARGET_64_LITTLE | |
5479 | template | |
5480 | class Output_data_group<64, false>; | |
5481 | #endif | |
5482 | ||
5483 | #ifdef HAVE_TARGET_64_BIG | |
5484 | template | |
5485 | class Output_data_group<64, true>; | |
5486 | #endif | |
5487 | ||
ead1e424 | 5488 | template |
dbe717ef | 5489 | class Output_data_got<32, false>; |
ead1e424 ILT |
5490 | |
5491 | template | |
dbe717ef | 5492 | class Output_data_got<32, true>; |
ead1e424 ILT |
5493 | |
5494 | template | |
dbe717ef | 5495 | class Output_data_got<64, false>; |
ead1e424 ILT |
5496 | |
5497 | template | |
dbe717ef | 5498 | class Output_data_got<64, true>; |
ead1e424 | 5499 | |
a2fb1b05 | 5500 | } // End namespace gold. |