1 // output.cc -- manage the output file for gold
3 // Copyright 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
4 // Written by Ian Lance Taylor <iant@google.com>.
6 // This file is part of gold.
8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
10 // the Free Software Foundation; either version 3 of the License, or
11 // (at your option) any later version.
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License
19 // along with this program; if not, write to the Free Software
20 // Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 // MA 02110-1301, USA.
33 #ifdef HAVE_SYS_MMAN_H
37 #include "libiberty.h"
40 #include "parameters.h"
45 #include "descriptors.h"
49 // For systems without mmap support.
51 # define mmap gold_mmap
52 # define munmap gold_munmap
53 # define mremap gold_mremap
55 # define MAP_FAILED (reinterpret_cast<void*>(-1))
64 # define MAP_PRIVATE 0
66 # ifndef MAP_ANONYMOUS
67 # define MAP_ANONYMOUS 0
74 # define ENOSYS EINVAL
78 gold_mmap(void *, size_t, int, int, int, off_t
)
85 gold_munmap(void *, size_t)
92 gold_mremap(void *, size_t, size_t, int)
100 #if defined(HAVE_MMAP) && !defined(HAVE_MREMAP)
101 # define mremap gold_mremap
102 extern "C" void *gold_mremap(void *, size_t, size_t, int);
105 // Some BSD systems still use MAP_ANON instead of MAP_ANONYMOUS
106 #ifndef MAP_ANONYMOUS
107 # define MAP_ANONYMOUS MAP_ANON
110 #ifndef MREMAP_MAYMOVE
111 # define MREMAP_MAYMOVE 1
114 // Mingw does not have S_ISLNK.
116 # define S_ISLNK(mode) 0
122 // A wrapper around posix_fallocate. If we don't have posix_fallocate,
123 // or the --no-posix-fallocate option is set, we try the fallocate
124 // system call directly. If that fails, we use ftruncate to set
125 // the file size and hope that there is enough disk space.
128 gold_fallocate(int o
, off_t offset
, off_t len
)
130 #ifdef HAVE_POSIX_FALLOCATE
131 if (parameters
->options().posix_fallocate())
132 return ::posix_fallocate(o
, offset
, len
);
133 #endif // defined(HAVE_POSIX_FALLOCATE)
134 #ifdef HAVE_FALLOCATE
135 if (::fallocate(o
, 0, offset
, len
) == 0)
137 #endif // defined(HAVE_FALLOCATE)
138 if (::ftruncate(o
, offset
+ len
) < 0)
143 // Output_data variables.
145 bool Output_data::allocated_sizes_are_fixed
;
147 // Output_data methods.
149 Output_data::~Output_data()
153 // Return the default alignment for the target size.
156 Output_data::default_alignment()
158 return Output_data::default_alignment_for_size(
159 parameters
->target().get_size());
162 // Return the default alignment for a size--32 or 64.
165 Output_data::default_alignment_for_size(int size
)
175 // Output_section_header methods. This currently assumes that the
176 // segment and section lists are complete at construction time.
178 Output_section_headers::Output_section_headers(
179 const Layout
* layout
,
180 const Layout::Segment_list
* segment_list
,
181 const Layout::Section_list
* section_list
,
182 const Layout::Section_list
* unattached_section_list
,
183 const Stringpool
* secnamepool
,
184 const Output_section
* shstrtab_section
)
186 segment_list_(segment_list
),
187 section_list_(section_list
),
188 unattached_section_list_(unattached_section_list
),
189 secnamepool_(secnamepool
),
190 shstrtab_section_(shstrtab_section
)
194 // Compute the current data size.
197 Output_section_headers::do_size() const
199 // Count all the sections. Start with 1 for the null section.
201 if (!parameters
->options().relocatable())
203 for (Layout::Segment_list::const_iterator p
=
204 this->segment_list_
->begin();
205 p
!= this->segment_list_
->end();
207 if ((*p
)->type() == elfcpp::PT_LOAD
)
208 count
+= (*p
)->output_section_count();
212 for (Layout::Section_list::const_iterator p
=
213 this->section_list_
->begin();
214 p
!= this->section_list_
->end();
216 if (((*p
)->flags() & elfcpp::SHF_ALLOC
) != 0)
219 count
+= this->unattached_section_list_
->size();
221 const int size
= parameters
->target().get_size();
224 shdr_size
= elfcpp::Elf_sizes
<32>::shdr_size
;
226 shdr_size
= elfcpp::Elf_sizes
<64>::shdr_size
;
230 return count
* shdr_size
;
233 // Write out the section headers.
236 Output_section_headers::do_write(Output_file
* of
)
238 switch (parameters
->size_and_endianness())
240 #ifdef HAVE_TARGET_32_LITTLE
241 case Parameters::TARGET_32_LITTLE
:
242 this->do_sized_write
<32, false>(of
);
245 #ifdef HAVE_TARGET_32_BIG
246 case Parameters::TARGET_32_BIG
:
247 this->do_sized_write
<32, true>(of
);
250 #ifdef HAVE_TARGET_64_LITTLE
251 case Parameters::TARGET_64_LITTLE
:
252 this->do_sized_write
<64, false>(of
);
255 #ifdef HAVE_TARGET_64_BIG
256 case Parameters::TARGET_64_BIG
:
257 this->do_sized_write
<64, true>(of
);
265 template<int size
, bool big_endian
>
267 Output_section_headers::do_sized_write(Output_file
* of
)
269 off_t all_shdrs_size
= this->data_size();
270 unsigned char* view
= of
->get_output_view(this->offset(), all_shdrs_size
);
272 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
273 unsigned char* v
= view
;
276 typename
elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
277 oshdr
.put_sh_name(0);
278 oshdr
.put_sh_type(elfcpp::SHT_NULL
);
279 oshdr
.put_sh_flags(0);
280 oshdr
.put_sh_addr(0);
281 oshdr
.put_sh_offset(0);
283 size_t section_count
= (this->data_size()
284 / elfcpp::Elf_sizes
<size
>::shdr_size
);
285 if (section_count
< elfcpp::SHN_LORESERVE
)
286 oshdr
.put_sh_size(0);
288 oshdr
.put_sh_size(section_count
);
290 unsigned int shstrndx
= this->shstrtab_section_
->out_shndx();
291 if (shstrndx
< elfcpp::SHN_LORESERVE
)
292 oshdr
.put_sh_link(0);
294 oshdr
.put_sh_link(shstrndx
);
296 size_t segment_count
= this->segment_list_
->size();
297 oshdr
.put_sh_info(segment_count
>= elfcpp::PN_XNUM
? segment_count
: 0);
299 oshdr
.put_sh_addralign(0);
300 oshdr
.put_sh_entsize(0);
305 unsigned int shndx
= 1;
306 if (!parameters
->options().relocatable())
308 for (Layout::Segment_list::const_iterator p
=
309 this->segment_list_
->begin();
310 p
!= this->segment_list_
->end();
312 v
= (*p
)->write_section_headers
<size
, big_endian
>(this->layout_
,
319 for (Layout::Section_list::const_iterator p
=
320 this->section_list_
->begin();
321 p
!= this->section_list_
->end();
324 // We do unallocated sections below, except that group
325 // sections have to come first.
326 if (((*p
)->flags() & elfcpp::SHF_ALLOC
) == 0
327 && (*p
)->type() != elfcpp::SHT_GROUP
)
329 gold_assert(shndx
== (*p
)->out_shndx());
330 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
331 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
337 for (Layout::Section_list::const_iterator p
=
338 this->unattached_section_list_
->begin();
339 p
!= this->unattached_section_list_
->end();
342 // For a relocatable link, we did unallocated group sections
343 // above, since they have to come first.
344 if ((*p
)->type() == elfcpp::SHT_GROUP
345 && parameters
->options().relocatable())
347 gold_assert(shndx
== (*p
)->out_shndx());
348 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
349 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
354 of
->write_output_view(this->offset(), all_shdrs_size
, view
);
357 // Output_segment_header methods.
359 Output_segment_headers::Output_segment_headers(
360 const Layout::Segment_list
& segment_list
)
361 : segment_list_(segment_list
)
363 this->set_current_data_size_for_child(this->do_size());
367 Output_segment_headers::do_write(Output_file
* of
)
369 switch (parameters
->size_and_endianness())
371 #ifdef HAVE_TARGET_32_LITTLE
372 case Parameters::TARGET_32_LITTLE
:
373 this->do_sized_write
<32, false>(of
);
376 #ifdef HAVE_TARGET_32_BIG
377 case Parameters::TARGET_32_BIG
:
378 this->do_sized_write
<32, true>(of
);
381 #ifdef HAVE_TARGET_64_LITTLE
382 case Parameters::TARGET_64_LITTLE
:
383 this->do_sized_write
<64, false>(of
);
386 #ifdef HAVE_TARGET_64_BIG
387 case Parameters::TARGET_64_BIG
:
388 this->do_sized_write
<64, true>(of
);
396 template<int size
, bool big_endian
>
398 Output_segment_headers::do_sized_write(Output_file
* of
)
400 const int phdr_size
= elfcpp::Elf_sizes
<size
>::phdr_size
;
401 off_t all_phdrs_size
= this->segment_list_
.size() * phdr_size
;
402 gold_assert(all_phdrs_size
== this->data_size());
403 unsigned char* view
= of
->get_output_view(this->offset(),
405 unsigned char* v
= view
;
406 for (Layout::Segment_list::const_iterator p
= this->segment_list_
.begin();
407 p
!= this->segment_list_
.end();
410 elfcpp::Phdr_write
<size
, big_endian
> ophdr(v
);
411 (*p
)->write_header(&ophdr
);
415 gold_assert(v
- view
== all_phdrs_size
);
417 of
->write_output_view(this->offset(), all_phdrs_size
, view
);
421 Output_segment_headers::do_size() const
423 const int size
= parameters
->target().get_size();
426 phdr_size
= elfcpp::Elf_sizes
<32>::phdr_size
;
428 phdr_size
= elfcpp::Elf_sizes
<64>::phdr_size
;
432 return this->segment_list_
.size() * phdr_size
;
435 // Output_file_header methods.
437 Output_file_header::Output_file_header(const Target
* target
,
438 const Symbol_table
* symtab
,
439 const Output_segment_headers
* osh
)
442 segment_header_(osh
),
443 section_header_(NULL
),
446 this->set_data_size(this->do_size());
449 // Set the section table information for a file header.
452 Output_file_header::set_section_info(const Output_section_headers
* shdrs
,
453 const Output_section
* shstrtab
)
455 this->section_header_
= shdrs
;
456 this->shstrtab_
= shstrtab
;
459 // Write out the file header.
462 Output_file_header::do_write(Output_file
* of
)
464 gold_assert(this->offset() == 0);
466 switch (parameters
->size_and_endianness())
468 #ifdef HAVE_TARGET_32_LITTLE
469 case Parameters::TARGET_32_LITTLE
:
470 this->do_sized_write
<32, false>(of
);
473 #ifdef HAVE_TARGET_32_BIG
474 case Parameters::TARGET_32_BIG
:
475 this->do_sized_write
<32, true>(of
);
478 #ifdef HAVE_TARGET_64_LITTLE
479 case Parameters::TARGET_64_LITTLE
:
480 this->do_sized_write
<64, false>(of
);
483 #ifdef HAVE_TARGET_64_BIG
484 case Parameters::TARGET_64_BIG
:
485 this->do_sized_write
<64, true>(of
);
493 // Write out the file header with appropriate size and endianness.
495 template<int size
, bool big_endian
>
497 Output_file_header::do_sized_write(Output_file
* of
)
499 gold_assert(this->offset() == 0);
501 int ehdr_size
= elfcpp::Elf_sizes
<size
>::ehdr_size
;
502 unsigned char* view
= of
->get_output_view(0, ehdr_size
);
503 elfcpp::Ehdr_write
<size
, big_endian
> oehdr(view
);
505 unsigned char e_ident
[elfcpp::EI_NIDENT
];
506 memset(e_ident
, 0, elfcpp::EI_NIDENT
);
507 e_ident
[elfcpp::EI_MAG0
] = elfcpp::ELFMAG0
;
508 e_ident
[elfcpp::EI_MAG1
] = elfcpp::ELFMAG1
;
509 e_ident
[elfcpp::EI_MAG2
] = elfcpp::ELFMAG2
;
510 e_ident
[elfcpp::EI_MAG3
] = elfcpp::ELFMAG3
;
512 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS32
;
514 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS64
;
517 e_ident
[elfcpp::EI_DATA
] = (big_endian
518 ? elfcpp::ELFDATA2MSB
519 : elfcpp::ELFDATA2LSB
);
520 e_ident
[elfcpp::EI_VERSION
] = elfcpp::EV_CURRENT
;
521 oehdr
.put_e_ident(e_ident
);
524 if (parameters
->options().relocatable())
525 e_type
= elfcpp::ET_REL
;
526 else if (parameters
->options().output_is_position_independent())
527 e_type
= elfcpp::ET_DYN
;
529 e_type
= elfcpp::ET_EXEC
;
530 oehdr
.put_e_type(e_type
);
532 oehdr
.put_e_machine(this->target_
->machine_code());
533 oehdr
.put_e_version(elfcpp::EV_CURRENT
);
535 oehdr
.put_e_entry(this->entry
<size
>());
537 if (this->segment_header_
== NULL
)
538 oehdr
.put_e_phoff(0);
540 oehdr
.put_e_phoff(this->segment_header_
->offset());
542 oehdr
.put_e_shoff(this->section_header_
->offset());
543 oehdr
.put_e_flags(this->target_
->processor_specific_flags());
544 oehdr
.put_e_ehsize(elfcpp::Elf_sizes
<size
>::ehdr_size
);
546 if (this->segment_header_
== NULL
)
548 oehdr
.put_e_phentsize(0);
549 oehdr
.put_e_phnum(0);
553 oehdr
.put_e_phentsize(elfcpp::Elf_sizes
<size
>::phdr_size
);
554 size_t phnum
= (this->segment_header_
->data_size()
555 / elfcpp::Elf_sizes
<size
>::phdr_size
);
556 if (phnum
> elfcpp::PN_XNUM
)
557 phnum
= elfcpp::PN_XNUM
;
558 oehdr
.put_e_phnum(phnum
);
561 oehdr
.put_e_shentsize(elfcpp::Elf_sizes
<size
>::shdr_size
);
562 size_t section_count
= (this->section_header_
->data_size()
563 / elfcpp::Elf_sizes
<size
>::shdr_size
);
565 if (section_count
< elfcpp::SHN_LORESERVE
)
566 oehdr
.put_e_shnum(this->section_header_
->data_size()
567 / elfcpp::Elf_sizes
<size
>::shdr_size
);
569 oehdr
.put_e_shnum(0);
571 unsigned int shstrndx
= this->shstrtab_
->out_shndx();
572 if (shstrndx
< elfcpp::SHN_LORESERVE
)
573 oehdr
.put_e_shstrndx(this->shstrtab_
->out_shndx());
575 oehdr
.put_e_shstrndx(elfcpp::SHN_XINDEX
);
577 // Let the target adjust the ELF header, e.g., to set EI_OSABI in
578 // the e_ident field.
579 parameters
->target().adjust_elf_header(view
, ehdr_size
);
581 of
->write_output_view(0, ehdr_size
, view
);
584 // Return the value to use for the entry address.
587 typename
elfcpp::Elf_types
<size
>::Elf_Addr
588 Output_file_header::entry()
590 const bool should_issue_warning
= (parameters
->options().entry() != NULL
591 && !parameters
->options().relocatable()
592 && !parameters
->options().shared());
593 const char* entry
= parameters
->entry();
594 Symbol
* sym
= this->symtab_
->lookup(entry
);
596 typename Sized_symbol
<size
>::Value_type v
;
599 Sized_symbol
<size
>* ssym
;
600 ssym
= this->symtab_
->get_sized_symbol
<size
>(sym
);
601 if (!ssym
->is_defined() && should_issue_warning
)
602 gold_warning("entry symbol '%s' exists but is not defined", entry
);
607 // We couldn't find the entry symbol. See if we can parse it as
608 // a number. This supports, e.g., -e 0x1000.
610 v
= strtoull(entry
, &endptr
, 0);
613 if (should_issue_warning
)
614 gold_warning("cannot find entry symbol '%s'", entry
);
622 // Compute the current data size.
625 Output_file_header::do_size() const
627 const int size
= parameters
->target().get_size();
629 return elfcpp::Elf_sizes
<32>::ehdr_size
;
631 return elfcpp::Elf_sizes
<64>::ehdr_size
;
636 // Output_data_const methods.
639 Output_data_const::do_write(Output_file
* of
)
641 of
->write(this->offset(), this->data_
.data(), this->data_
.size());
644 // Output_data_const_buffer methods.
647 Output_data_const_buffer::do_write(Output_file
* of
)
649 of
->write(this->offset(), this->p_
, this->data_size());
652 // Output_section_data methods.
654 // Record the output section, and set the entry size and such.
657 Output_section_data::set_output_section(Output_section
* os
)
659 gold_assert(this->output_section_
== NULL
);
660 this->output_section_
= os
;
661 this->do_adjust_output_section(os
);
664 // Return the section index of the output section.
667 Output_section_data::do_out_shndx() const
669 gold_assert(this->output_section_
!= NULL
);
670 return this->output_section_
->out_shndx();
673 // Set the alignment, which means we may need to update the alignment
674 // of the output section.
677 Output_section_data::set_addralign(uint64_t addralign
)
679 this->addralign_
= addralign
;
680 if (this->output_section_
!= NULL
681 && this->output_section_
->addralign() < addralign
)
682 this->output_section_
->set_addralign(addralign
);
685 // Output_data_strtab methods.
687 // Set the final data size.
690 Output_data_strtab::set_final_data_size()
692 this->strtab_
->set_string_offsets();
693 this->set_data_size(this->strtab_
->get_strtab_size());
696 // Write out a string table.
699 Output_data_strtab::do_write(Output_file
* of
)
701 this->strtab_
->write(of
, this->offset());
704 // Output_reloc methods.
706 // A reloc against a global symbol.
708 template<bool dynamic
, int size
, bool big_endian
>
709 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
717 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
718 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
719 is_section_symbol_(false), use_plt_offset_(use_plt_offset
), shndx_(INVALID_CODE
)
721 // this->type_ is a bitfield; make sure TYPE fits.
722 gold_assert(this->type_
== type
);
723 this->u1_
.gsym
= gsym
;
726 this->set_needs_dynsym_index();
729 template<bool dynamic
, int size
, bool big_endian
>
730 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
733 Sized_relobj
<size
, big_endian
>* relobj
,
739 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
740 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
741 is_section_symbol_(false), use_plt_offset_(use_plt_offset
), shndx_(shndx
)
743 gold_assert(shndx
!= INVALID_CODE
);
744 // this->type_ is a bitfield; make sure TYPE fits.
745 gold_assert(this->type_
== type
);
746 this->u1_
.gsym
= gsym
;
747 this->u2_
.relobj
= relobj
;
749 this->set_needs_dynsym_index();
752 // A reloc against a local symbol.
754 template<bool dynamic
, int size
, bool big_endian
>
755 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
756 Sized_relobj
<size
, big_endian
>* relobj
,
757 unsigned int local_sym_index
,
763 bool is_section_symbol
,
765 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
766 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
767 is_section_symbol_(is_section_symbol
), use_plt_offset_(use_plt_offset
),
770 gold_assert(local_sym_index
!= GSYM_CODE
771 && local_sym_index
!= INVALID_CODE
);
772 // this->type_ is a bitfield; make sure TYPE fits.
773 gold_assert(this->type_
== type
);
774 this->u1_
.relobj
= relobj
;
777 this->set_needs_dynsym_index();
780 template<bool dynamic
, int size
, bool big_endian
>
781 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
782 Sized_relobj
<size
, big_endian
>* relobj
,
783 unsigned int local_sym_index
,
789 bool is_section_symbol
,
791 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
792 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
793 is_section_symbol_(is_section_symbol
), use_plt_offset_(use_plt_offset
),
796 gold_assert(local_sym_index
!= GSYM_CODE
797 && local_sym_index
!= INVALID_CODE
);
798 gold_assert(shndx
!= INVALID_CODE
);
799 // this->type_ is a bitfield; make sure TYPE fits.
800 gold_assert(this->type_
== type
);
801 this->u1_
.relobj
= relobj
;
802 this->u2_
.relobj
= relobj
;
804 this->set_needs_dynsym_index();
807 // A reloc against the STT_SECTION symbol of an output section.
809 template<bool dynamic
, int size
, bool big_endian
>
810 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
816 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
817 is_relative_(is_relative
), is_symbolless_(is_relative
),
818 is_section_symbol_(true), use_plt_offset_(false), shndx_(INVALID_CODE
)
820 // this->type_ is a bitfield; make sure TYPE fits.
821 gold_assert(this->type_
== type
);
825 this->set_needs_dynsym_index();
827 os
->set_needs_symtab_index();
830 template<bool dynamic
, int size
, bool big_endian
>
831 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
834 Sized_relobj
<size
, big_endian
>* relobj
,
838 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
839 is_relative_(is_relative
), is_symbolless_(is_relative
),
840 is_section_symbol_(true), use_plt_offset_(false), shndx_(shndx
)
842 gold_assert(shndx
!= INVALID_CODE
);
843 // this->type_ is a bitfield; make sure TYPE fits.
844 gold_assert(this->type_
== type
);
846 this->u2_
.relobj
= relobj
;
848 this->set_needs_dynsym_index();
850 os
->set_needs_symtab_index();
853 // An absolute relocation.
855 template<bool dynamic
, int size
, bool big_endian
>
856 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
860 : address_(address
), local_sym_index_(0), type_(type
),
861 is_relative_(false), is_symbolless_(false),
862 is_section_symbol_(false), use_plt_offset_(false), shndx_(INVALID_CODE
)
864 // this->type_ is a bitfield; make sure TYPE fits.
865 gold_assert(this->type_
== type
);
866 this->u1_
.relobj
= NULL
;
870 template<bool dynamic
, int size
, bool big_endian
>
871 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
873 Sized_relobj
<size
, big_endian
>* relobj
,
876 : address_(address
), local_sym_index_(0), type_(type
),
877 is_relative_(false), is_symbolless_(false),
878 is_section_symbol_(false), use_plt_offset_(false), shndx_(shndx
)
880 gold_assert(shndx
!= INVALID_CODE
);
881 // this->type_ is a bitfield; make sure TYPE fits.
882 gold_assert(this->type_
== type
);
883 this->u1_
.relobj
= NULL
;
884 this->u2_
.relobj
= relobj
;
887 // A target specific relocation.
889 template<bool dynamic
, int size
, bool big_endian
>
890 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
895 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
896 is_relative_(false), is_symbolless_(false),
897 is_section_symbol_(false), use_plt_offset_(false), shndx_(INVALID_CODE
)
899 // this->type_ is a bitfield; make sure TYPE fits.
900 gold_assert(this->type_
== type
);
905 template<bool dynamic
, int size
, bool big_endian
>
906 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
909 Sized_relobj
<size
, big_endian
>* relobj
,
912 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
913 is_relative_(false), is_symbolless_(false),
914 is_section_symbol_(false), use_plt_offset_(false), shndx_(shndx
)
916 gold_assert(shndx
!= INVALID_CODE
);
917 // this->type_ is a bitfield; make sure TYPE fits.
918 gold_assert(this->type_
== type
);
920 this->u2_
.relobj
= relobj
;
923 // Record that we need a dynamic symbol index for this relocation.
925 template<bool dynamic
, int size
, bool big_endian
>
927 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
928 set_needs_dynsym_index()
930 if (this->is_symbolless_
)
932 switch (this->local_sym_index_
)
938 this->u1_
.gsym
->set_needs_dynsym_entry();
942 this->u1_
.os
->set_needs_dynsym_index();
946 // The target must take care of this if necessary.
954 const unsigned int lsi
= this->local_sym_index_
;
955 Sized_relobj_file
<size
, big_endian
>* relobj
=
956 this->u1_
.relobj
->sized_relobj();
957 gold_assert(relobj
!= NULL
);
958 if (!this->is_section_symbol_
)
959 relobj
->set_needs_output_dynsym_entry(lsi
);
961 relobj
->output_section(lsi
)->set_needs_dynsym_index();
967 // Get the symbol index of a relocation.
969 template<bool dynamic
, int size
, bool big_endian
>
971 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_symbol_index()
975 if (this->is_symbolless_
)
977 switch (this->local_sym_index_
)
983 if (this->u1_
.gsym
== NULL
)
986 index
= this->u1_
.gsym
->dynsym_index();
988 index
= this->u1_
.gsym
->symtab_index();
993 index
= this->u1_
.os
->dynsym_index();
995 index
= this->u1_
.os
->symtab_index();
999 index
= parameters
->target().reloc_symbol_index(this->u1_
.arg
,
1004 // Relocations without symbols use a symbol index of 0.
1010 const unsigned int lsi
= this->local_sym_index_
;
1011 Sized_relobj_file
<size
, big_endian
>* relobj
=
1012 this->u1_
.relobj
->sized_relobj();
1013 gold_assert(relobj
!= NULL
);
1014 if (!this->is_section_symbol_
)
1017 index
= relobj
->dynsym_index(lsi
);
1019 index
= relobj
->symtab_index(lsi
);
1023 Output_section
* os
= relobj
->output_section(lsi
);
1024 gold_assert(os
!= NULL
);
1026 index
= os
->dynsym_index();
1028 index
= os
->symtab_index();
1033 gold_assert(index
!= -1U);
1037 // For a local section symbol, get the address of the offset ADDEND
1038 // within the input section.
1040 template<bool dynamic
, int size
, bool big_endian
>
1041 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1042 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
1043 local_section_offset(Addend addend
) const
1045 gold_assert(this->local_sym_index_
!= GSYM_CODE
1046 && this->local_sym_index_
!= SECTION_CODE
1047 && this->local_sym_index_
!= TARGET_CODE
1048 && this->local_sym_index_
!= INVALID_CODE
1049 && this->local_sym_index_
!= 0
1050 && this->is_section_symbol_
);
1051 const unsigned int lsi
= this->local_sym_index_
;
1052 Output_section
* os
= this->u1_
.relobj
->output_section(lsi
);
1053 gold_assert(os
!= NULL
);
1054 Address offset
= this->u1_
.relobj
->get_output_section_offset(lsi
);
1055 if (offset
!= invalid_address
)
1056 return offset
+ addend
;
1057 // This is a merge section.
1058 Sized_relobj_file
<size
, big_endian
>* relobj
=
1059 this->u1_
.relobj
->sized_relobj();
1060 gold_assert(relobj
!= NULL
);
1061 offset
= os
->output_address(relobj
, lsi
, addend
);
1062 gold_assert(offset
!= invalid_address
);
1066 // Get the output address of a relocation.
1068 template<bool dynamic
, int size
, bool big_endian
>
1069 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1070 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_address() const
1072 Address address
= this->address_
;
1073 if (this->shndx_
!= INVALID_CODE
)
1075 Output_section
* os
= this->u2_
.relobj
->output_section(this->shndx_
);
1076 gold_assert(os
!= NULL
);
1077 Address off
= this->u2_
.relobj
->get_output_section_offset(this->shndx_
);
1078 if (off
!= invalid_address
)
1079 address
+= os
->address() + off
;
1082 Sized_relobj_file
<size
, big_endian
>* relobj
=
1083 this->u2_
.relobj
->sized_relobj();
1084 gold_assert(relobj
!= NULL
);
1085 address
= os
->output_address(relobj
, this->shndx_
, address
);
1086 gold_assert(address
!= invalid_address
);
1089 else if (this->u2_
.od
!= NULL
)
1090 address
+= this->u2_
.od
->address();
1094 // Write out the offset and info fields of a Rel or Rela relocation
1097 template<bool dynamic
, int size
, bool big_endian
>
1098 template<typename Write_rel
>
1100 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write_rel(
1101 Write_rel
* wr
) const
1103 wr
->put_r_offset(this->get_address());
1104 unsigned int sym_index
= this->get_symbol_index();
1105 wr
->put_r_info(elfcpp::elf_r_info
<size
>(sym_index
, this->type_
));
1108 // Write out a Rel relocation.
1110 template<bool dynamic
, int size
, bool big_endian
>
1112 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write(
1113 unsigned char* pov
) const
1115 elfcpp::Rel_write
<size
, big_endian
> orel(pov
);
1116 this->write_rel(&orel
);
1119 // Get the value of the symbol referred to by a Rel relocation.
1121 template<bool dynamic
, int size
, bool big_endian
>
1122 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1123 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::symbol_value(
1124 Addend addend
) const
1126 if (this->local_sym_index_
== GSYM_CODE
)
1128 const Sized_symbol
<size
>* sym
;
1129 sym
= static_cast<const Sized_symbol
<size
>*>(this->u1_
.gsym
);
1130 if (this->use_plt_offset_
&& sym
->has_plt_offset())
1132 uint64_t plt_address
=
1133 parameters
->target().plt_address_for_global(sym
);
1134 return plt_address
+ sym
->plt_offset();
1137 return sym
->value() + addend
;
1139 if (this->local_sym_index_
== SECTION_CODE
)
1141 gold_assert(!this->use_plt_offset_
);
1142 return this->u1_
.os
->address() + addend
;
1144 gold_assert(this->local_sym_index_
!= TARGET_CODE
1145 && this->local_sym_index_
!= INVALID_CODE
1146 && this->local_sym_index_
!= 0
1147 && !this->is_section_symbol_
);
1148 const unsigned int lsi
= this->local_sym_index_
;
1149 Sized_relobj_file
<size
, big_endian
>* relobj
=
1150 this->u1_
.relobj
->sized_relobj();
1151 gold_assert(relobj
!= NULL
);
1152 if (this->use_plt_offset_
)
1154 uint64_t plt_address
=
1155 parameters
->target().plt_address_for_local(relobj
, lsi
);
1156 return plt_address
+ relobj
->local_plt_offset(lsi
);
1158 const Symbol_value
<size
>* symval
= relobj
->local_symbol(lsi
);
1159 return symval
->value(relobj
, addend
);
1162 // Reloc comparison. This function sorts the dynamic relocs for the
1163 // benefit of the dynamic linker. First we sort all relative relocs
1164 // to the front. Among relative relocs, we sort by output address.
1165 // Among non-relative relocs, we sort by symbol index, then by output
1168 template<bool dynamic
, int size
, bool big_endian
>
1170 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
1171 compare(const Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>& r2
)
1174 if (this->is_relative_
)
1176 if (!r2
.is_relative_
)
1178 // Otherwise sort by reloc address below.
1180 else if (r2
.is_relative_
)
1184 unsigned int sym1
= this->get_symbol_index();
1185 unsigned int sym2
= r2
.get_symbol_index();
1188 else if (sym1
> sym2
)
1190 // Otherwise sort by reloc address.
1193 section_offset_type addr1
= this->get_address();
1194 section_offset_type addr2
= r2
.get_address();
1197 else if (addr1
> addr2
)
1200 // Final tie breaker, in order to generate the same output on any
1201 // host: reloc type.
1202 unsigned int type1
= this->type_
;
1203 unsigned int type2
= r2
.type_
;
1206 else if (type1
> type2
)
1209 // These relocs appear to be exactly the same.
1213 // Write out a Rela relocation.
1215 template<bool dynamic
, int size
, bool big_endian
>
1217 Output_reloc
<elfcpp::SHT_RELA
, dynamic
, size
, big_endian
>::write(
1218 unsigned char* pov
) const
1220 elfcpp::Rela_write
<size
, big_endian
> orel(pov
);
1221 this->rel_
.write_rel(&orel
);
1222 Addend addend
= this->addend_
;
1223 if (this->rel_
.is_target_specific())
1224 addend
= parameters
->target().reloc_addend(this->rel_
.target_arg(),
1225 this->rel_
.type(), addend
);
1226 else if (this->rel_
.is_symbolless())
1227 addend
= this->rel_
.symbol_value(addend
);
1228 else if (this->rel_
.is_local_section_symbol())
1229 addend
= this->rel_
.local_section_offset(addend
);
1230 orel
.put_r_addend(addend
);
1233 // Output_data_reloc_base methods.
1235 // Adjust the output section.
1237 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1239 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>
1240 ::do_adjust_output_section(Output_section
* os
)
1242 if (sh_type
== elfcpp::SHT_REL
)
1243 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rel_size
);
1244 else if (sh_type
== elfcpp::SHT_RELA
)
1245 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rela_size
);
1249 // A STT_GNU_IFUNC symbol may require a IRELATIVE reloc when doing a
1250 // static link. The backends will generate a dynamic reloc section
1251 // to hold this. In that case we don't want to link to the dynsym
1252 // section, because there isn't one.
1254 os
->set_should_link_to_symtab();
1255 else if (parameters
->doing_static_link())
1258 os
->set_should_link_to_dynsym();
1261 // Write out relocation data.
1263 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1265 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>::do_write(
1268 const off_t off
= this->offset();
1269 const off_t oview_size
= this->data_size();
1270 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1272 if (this->sort_relocs())
1274 gold_assert(dynamic
);
1275 std::sort(this->relocs_
.begin(), this->relocs_
.end(),
1276 Sort_relocs_comparison());
1279 unsigned char* pov
= oview
;
1280 for (typename
Relocs::const_iterator p
= this->relocs_
.begin();
1281 p
!= this->relocs_
.end();
1288 gold_assert(pov
- oview
== oview_size
);
1290 of
->write_output_view(off
, oview_size
, oview
);
1292 // We no longer need the relocation entries.
1293 this->relocs_
.clear();
1296 // Class Output_relocatable_relocs.
1298 template<int sh_type
, int size
, bool big_endian
>
1300 Output_relocatable_relocs
<sh_type
, size
, big_endian
>::set_final_data_size()
1302 this->set_data_size(this->rr_
->output_reloc_count()
1303 * Reloc_types
<sh_type
, size
, big_endian
>::reloc_size
);
1306 // class Output_data_group.
1308 template<int size
, bool big_endian
>
1309 Output_data_group
<size
, big_endian
>::Output_data_group(
1310 Sized_relobj_file
<size
, big_endian
>* relobj
,
1311 section_size_type entry_count
,
1312 elfcpp::Elf_Word flags
,
1313 std::vector
<unsigned int>* input_shndxes
)
1314 : Output_section_data(entry_count
* 4, 4, false),
1318 this->input_shndxes_
.swap(*input_shndxes
);
1321 // Write out the section group, which means translating the section
1322 // indexes to apply to the output file.
1324 template<int size
, bool big_endian
>
1326 Output_data_group
<size
, big_endian
>::do_write(Output_file
* of
)
1328 const off_t off
= this->offset();
1329 const section_size_type oview_size
=
1330 convert_to_section_size_type(this->data_size());
1331 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1333 elfcpp::Elf_Word
* contents
= reinterpret_cast<elfcpp::Elf_Word
*>(oview
);
1334 elfcpp::Swap
<32, big_endian
>::writeval(contents
, this->flags_
);
1337 for (std::vector
<unsigned int>::const_iterator p
=
1338 this->input_shndxes_
.begin();
1339 p
!= this->input_shndxes_
.end();
1342 Output_section
* os
= this->relobj_
->output_section(*p
);
1344 unsigned int output_shndx
;
1346 output_shndx
= os
->out_shndx();
1349 this->relobj_
->error(_("section group retained but "
1350 "group element discarded"));
1354 elfcpp::Swap
<32, big_endian
>::writeval(contents
, output_shndx
);
1357 size_t wrote
= reinterpret_cast<unsigned char*>(contents
) - oview
;
1358 gold_assert(wrote
== oview_size
);
1360 of
->write_output_view(off
, oview_size
, oview
);
1362 // We no longer need this information.
1363 this->input_shndxes_
.clear();
1366 // Output_data_got::Got_entry methods.
1368 // Write out the entry.
1370 template<int size
, bool big_endian
>
1372 Output_data_got
<size
, big_endian
>::Got_entry::write(
1373 unsigned int got_indx
,
1374 unsigned char* pov
) const
1378 switch (this->local_sym_index_
)
1382 // If the symbol is resolved locally, we need to write out the
1383 // link-time value, which will be relocated dynamically by a
1384 // RELATIVE relocation.
1385 Symbol
* gsym
= this->u_
.gsym
;
1386 if (this->use_plt_or_tls_offset_
&& gsym
->has_plt_offset())
1387 val
= (parameters
->target().plt_address_for_global(gsym
)
1388 + gsym
->plt_offset());
1391 Sized_symbol
<size
>* sgsym
;
1392 // This cast is a bit ugly. We don't want to put a
1393 // virtual method in Symbol, because we want Symbol to be
1394 // as small as possible.
1395 sgsym
= static_cast<Sized_symbol
<size
>*>(gsym
);
1396 val
= sgsym
->value();
1397 if (this->use_plt_or_tls_offset_
&& gsym
->type() == elfcpp::STT_TLS
)
1398 val
+= parameters
->target().tls_offset_for_global(gsym
,
1405 val
= this->u_
.constant
;
1409 // If we're doing an incremental update, don't touch this GOT entry.
1410 if (parameters
->incremental_update())
1412 val
= this->u_
.constant
;
1417 const Sized_relobj_file
<size
, big_endian
>* object
1418 = static_cast<Sized_relobj_file
<size
, big_endian
>*>(this->u_
.object
);
1419 const unsigned int lsi
= this->local_sym_index_
;
1420 bool is_tls
= object
->local_symbol(lsi
)->is_tls_symbol();
1421 if (this->use_plt_or_tls_offset_
&& !is_tls
)
1423 uint64_t plt_address
=
1424 parameters
->target().plt_address_for_local(object
, lsi
);
1425 val
= plt_address
+ object
->local_plt_offset(lsi
);
1429 uint64_t lval
= object
->local_symbol_value(lsi
, 0);
1430 val
= convert_types
<Valtype
, uint64_t>(lval
);
1431 if (this->use_plt_or_tls_offset_
&& is_tls
)
1432 val
+= parameters
->target().tls_offset_for_local(object
, lsi
,
1439 elfcpp::Swap
<size
, big_endian
>::writeval(pov
, val
);
1442 // Output_data_got methods.
1444 // Add an entry for a global symbol to the GOT. This returns true if
1445 // this is a new GOT entry, false if the symbol already had a GOT
1448 template<int size
, bool big_endian
>
1450 Output_data_got
<size
, big_endian
>::add_global(
1452 unsigned int got_type
)
1454 if (gsym
->has_got_offset(got_type
))
1457 unsigned int got_offset
= this->add_got_entry(Got_entry(gsym
, false));
1458 gsym
->set_got_offset(got_type
, got_offset
);
1462 // Like add_global, but use the PLT offset.
1464 template<int size
, bool big_endian
>
1466 Output_data_got
<size
, big_endian
>::add_global_plt(Symbol
* gsym
,
1467 unsigned int got_type
)
1469 if (gsym
->has_got_offset(got_type
))
1472 unsigned int got_offset
= this->add_got_entry(Got_entry(gsym
, true));
1473 gsym
->set_got_offset(got_type
, got_offset
);
1477 // Add an entry for a global symbol to the GOT, and add a dynamic
1478 // relocation of type R_TYPE for the GOT entry.
1480 template<int size
, bool big_endian
>
1482 Output_data_got
<size
, big_endian
>::add_global_with_rel(
1484 unsigned int got_type
,
1485 Output_data_reloc_generic
* rel_dyn
,
1486 unsigned int r_type
)
1488 if (gsym
->has_got_offset(got_type
))
1491 unsigned int got_offset
= this->add_got_entry(Got_entry());
1492 gsym
->set_got_offset(got_type
, got_offset
);
1493 rel_dyn
->add_global_generic(gsym
, r_type
, this, got_offset
, 0);
1496 // Add a pair of entries for a global symbol to the GOT, and add
1497 // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively.
1498 // If R_TYPE_2 == 0, add the second entry with no relocation.
1499 template<int size
, bool big_endian
>
1501 Output_data_got
<size
, big_endian
>::add_global_pair_with_rel(
1503 unsigned int got_type
,
1504 Output_data_reloc_generic
* rel_dyn
,
1505 unsigned int r_type_1
,
1506 unsigned int r_type_2
)
1508 if (gsym
->has_got_offset(got_type
))
1511 unsigned int got_offset
= this->add_got_entry_pair(Got_entry(), Got_entry());
1512 gsym
->set_got_offset(got_type
, got_offset
);
1513 rel_dyn
->add_global_generic(gsym
, r_type_1
, this, got_offset
, 0);
1516 rel_dyn
->add_global_generic(gsym
, r_type_2
, this,
1517 got_offset
+ size
/ 8, 0);
1520 // Add an entry for a local symbol to the GOT. This returns true if
1521 // this is a new GOT entry, false if the symbol already has a GOT
1524 template<int size
, bool big_endian
>
1526 Output_data_got
<size
, big_endian
>::add_local(
1528 unsigned int symndx
,
1529 unsigned int got_type
)
1531 if (object
->local_has_got_offset(symndx
, got_type
))
1534 unsigned int got_offset
= this->add_got_entry(Got_entry(object
, symndx
,
1536 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1540 // Like add_local, but use the PLT offset.
1542 template<int size
, bool big_endian
>
1544 Output_data_got
<size
, big_endian
>::add_local_plt(
1546 unsigned int symndx
,
1547 unsigned int got_type
)
1549 if (object
->local_has_got_offset(symndx
, got_type
))
1552 unsigned int got_offset
= this->add_got_entry(Got_entry(object
, symndx
,
1554 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1558 // Add an entry for a local symbol to the GOT, and add a dynamic
1559 // relocation of type R_TYPE for the GOT entry.
1561 template<int size
, bool big_endian
>
1563 Output_data_got
<size
, big_endian
>::add_local_with_rel(
1565 unsigned int symndx
,
1566 unsigned int got_type
,
1567 Output_data_reloc_generic
* rel_dyn
,
1568 unsigned int r_type
)
1570 if (object
->local_has_got_offset(symndx
, got_type
))
1573 unsigned int got_offset
= this->add_got_entry(Got_entry());
1574 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1575 rel_dyn
->add_local_generic(object
, symndx
, r_type
, this, got_offset
, 0);
1578 // Add a pair of entries for a local symbol to the GOT, and add
1579 // a dynamic relocation of type R_TYPE using the section symbol of
1580 // the output section to which input section SHNDX maps, on the first.
1581 // The first got entry will have a value of zero, the second the
1582 // value of the local symbol.
1583 template<int size
, bool big_endian
>
1585 Output_data_got
<size
, big_endian
>::add_local_pair_with_rel(
1587 unsigned int symndx
,
1589 unsigned int got_type
,
1590 Output_data_reloc_generic
* rel_dyn
,
1591 unsigned int r_type
)
1593 if (object
->local_has_got_offset(symndx
, got_type
))
1596 unsigned int got_offset
=
1597 this->add_got_entry_pair(Got_entry(),
1598 Got_entry(object
, symndx
, false));
1599 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1600 Output_section
* os
= object
->output_section(shndx
);
1601 rel_dyn
->add_output_section_generic(os
, r_type
, this, got_offset
, 0);
1604 // Add a pair of entries for a local symbol to the GOT, and add
1605 // a dynamic relocation of type R_TYPE using STN_UNDEF on the first.
1606 // The first got entry will have a value of zero, the second the
1607 // value of the local symbol offset by Target::tls_offset_for_local.
1608 template<int size
, bool big_endian
>
1610 Output_data_got
<size
, big_endian
>::add_local_tls_pair(
1612 unsigned int symndx
,
1613 unsigned int got_type
,
1614 Output_data_reloc_generic
* rel_dyn
,
1615 unsigned int r_type
)
1617 if (object
->local_has_got_offset(symndx
, got_type
))
1620 unsigned int got_offset
1621 = this->add_got_entry_pair(Got_entry(),
1622 Got_entry(object
, symndx
, true));
1623 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1624 rel_dyn
->add_local_generic(object
, 0, r_type
, this, got_offset
, 0);
1627 // Reserve a slot in the GOT for a local symbol or the second slot of a pair.
1629 template<int size
, bool big_endian
>
1631 Output_data_got
<size
, big_endian
>::reserve_local(
1634 unsigned int sym_index
,
1635 unsigned int got_type
)
1637 this->do_reserve_slot(i
);
1638 object
->set_local_got_offset(sym_index
, got_type
, this->got_offset(i
));
1641 // Reserve a slot in the GOT for a global symbol.
1643 template<int size
, bool big_endian
>
1645 Output_data_got
<size
, big_endian
>::reserve_global(
1648 unsigned int got_type
)
1650 this->do_reserve_slot(i
);
1651 gsym
->set_got_offset(got_type
, this->got_offset(i
));
1654 // Write out the GOT.
1656 template<int size
, bool big_endian
>
1658 Output_data_got
<size
, big_endian
>::do_write(Output_file
* of
)
1660 const int add
= size
/ 8;
1662 const off_t off
= this->offset();
1663 const off_t oview_size
= this->data_size();
1664 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1666 unsigned char* pov
= oview
;
1667 for (unsigned int i
= 0; i
< this->entries_
.size(); ++i
)
1669 this->entries_
[i
].write(i
, pov
);
1673 gold_assert(pov
- oview
== oview_size
);
1675 of
->write_output_view(off
, oview_size
, oview
);
1677 // We no longer need the GOT entries.
1678 this->entries_
.clear();
1681 // Create a new GOT entry and return its offset.
1683 template<int size
, bool big_endian
>
1685 Output_data_got
<size
, big_endian
>::add_got_entry(Got_entry got_entry
)
1687 if (!this->is_data_size_valid())
1689 this->entries_
.push_back(got_entry
);
1690 this->set_got_size();
1691 return this->last_got_offset();
1695 // For an incremental update, find an available slot.
1696 off_t got_offset
= this->free_list_
.allocate(size
/ 8, size
/ 8, 0);
1697 if (got_offset
== -1)
1698 gold_fallback(_("out of patch space (GOT);"
1699 " relink with --incremental-full"));
1700 unsigned int got_index
= got_offset
/ (size
/ 8);
1701 gold_assert(got_index
< this->entries_
.size());
1702 this->entries_
[got_index
] = got_entry
;
1703 return static_cast<unsigned int>(got_offset
);
1707 // Create a pair of new GOT entries and return the offset of the first.
1709 template<int size
, bool big_endian
>
1711 Output_data_got
<size
, big_endian
>::add_got_entry_pair(Got_entry got_entry_1
,
1712 Got_entry got_entry_2
)
1714 if (!this->is_data_size_valid())
1716 unsigned int got_offset
;
1717 this->entries_
.push_back(got_entry_1
);
1718 got_offset
= this->last_got_offset();
1719 this->entries_
.push_back(got_entry_2
);
1720 this->set_got_size();
1725 // For an incremental update, find an available pair of slots.
1726 off_t got_offset
= this->free_list_
.allocate(2 * size
/ 8, size
/ 8, 0);
1727 if (got_offset
== -1)
1728 gold_fallback(_("out of patch space (GOT);"
1729 " relink with --incremental-full"));
1730 unsigned int got_index
= got_offset
/ (size
/ 8);
1731 gold_assert(got_index
< this->entries_
.size());
1732 this->entries_
[got_index
] = got_entry_1
;
1733 this->entries_
[got_index
+ 1] = got_entry_2
;
1734 return static_cast<unsigned int>(got_offset
);
1738 // Replace GOT entry I with a new value.
1740 template<int size
, bool big_endian
>
1742 Output_data_got
<size
, big_endian
>::replace_got_entry(
1744 Got_entry got_entry
)
1746 gold_assert(i
< this->entries_
.size());
1747 this->entries_
[i
] = got_entry
;
1750 // Output_data_dynamic::Dynamic_entry methods.
1752 // Write out the entry.
1754 template<int size
, bool big_endian
>
1756 Output_data_dynamic::Dynamic_entry::write(
1758 const Stringpool
* pool
) const
1760 typename
elfcpp::Elf_types
<size
>::Elf_WXword val
;
1761 switch (this->offset_
)
1763 case DYNAMIC_NUMBER
:
1767 case DYNAMIC_SECTION_SIZE
:
1768 val
= this->u_
.od
->data_size();
1769 if (this->od2
!= NULL
)
1770 val
+= this->od2
->data_size();
1773 case DYNAMIC_SYMBOL
:
1775 const Sized_symbol
<size
>* s
=
1776 static_cast<const Sized_symbol
<size
>*>(this->u_
.sym
);
1781 case DYNAMIC_STRING
:
1782 val
= pool
->get_offset(this->u_
.str
);
1786 val
= this->u_
.od
->address() + this->offset_
;
1790 elfcpp::Dyn_write
<size
, big_endian
> dw(pov
);
1791 dw
.put_d_tag(this->tag_
);
1795 // Output_data_dynamic methods.
1797 // Adjust the output section to set the entry size.
1800 Output_data_dynamic::do_adjust_output_section(Output_section
* os
)
1802 if (parameters
->target().get_size() == 32)
1803 os
->set_entsize(elfcpp::Elf_sizes
<32>::dyn_size
);
1804 else if (parameters
->target().get_size() == 64)
1805 os
->set_entsize(elfcpp::Elf_sizes
<64>::dyn_size
);
1810 // Set the final data size.
1813 Output_data_dynamic::set_final_data_size()
1815 // Add the terminating entry if it hasn't been added.
1816 // Because of relaxation, we can run this multiple times.
1817 if (this->entries_
.empty() || this->entries_
.back().tag() != elfcpp::DT_NULL
)
1819 int extra
= parameters
->options().spare_dynamic_tags();
1820 for (int i
= 0; i
< extra
; ++i
)
1821 this->add_constant(elfcpp::DT_NULL
, 0);
1822 this->add_constant(elfcpp::DT_NULL
, 0);
1826 if (parameters
->target().get_size() == 32)
1827 dyn_size
= elfcpp::Elf_sizes
<32>::dyn_size
;
1828 else if (parameters
->target().get_size() == 64)
1829 dyn_size
= elfcpp::Elf_sizes
<64>::dyn_size
;
1832 this->set_data_size(this->entries_
.size() * dyn_size
);
1835 // Write out the dynamic entries.
1838 Output_data_dynamic::do_write(Output_file
* of
)
1840 switch (parameters
->size_and_endianness())
1842 #ifdef HAVE_TARGET_32_LITTLE
1843 case Parameters::TARGET_32_LITTLE
:
1844 this->sized_write
<32, false>(of
);
1847 #ifdef HAVE_TARGET_32_BIG
1848 case Parameters::TARGET_32_BIG
:
1849 this->sized_write
<32, true>(of
);
1852 #ifdef HAVE_TARGET_64_LITTLE
1853 case Parameters::TARGET_64_LITTLE
:
1854 this->sized_write
<64, false>(of
);
1857 #ifdef HAVE_TARGET_64_BIG
1858 case Parameters::TARGET_64_BIG
:
1859 this->sized_write
<64, true>(of
);
1867 template<int size
, bool big_endian
>
1869 Output_data_dynamic::sized_write(Output_file
* of
)
1871 const int dyn_size
= elfcpp::Elf_sizes
<size
>::dyn_size
;
1873 const off_t offset
= this->offset();
1874 const off_t oview_size
= this->data_size();
1875 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1877 unsigned char* pov
= oview
;
1878 for (typename
Dynamic_entries::const_iterator p
= this->entries_
.begin();
1879 p
!= this->entries_
.end();
1882 p
->write
<size
, big_endian
>(pov
, this->pool_
);
1886 gold_assert(pov
- oview
== oview_size
);
1888 of
->write_output_view(offset
, oview_size
, oview
);
1890 // We no longer need the dynamic entries.
1891 this->entries_
.clear();
1894 // Class Output_symtab_xindex.
1897 Output_symtab_xindex::do_write(Output_file
* of
)
1899 const off_t offset
= this->offset();
1900 const off_t oview_size
= this->data_size();
1901 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1903 memset(oview
, 0, oview_size
);
1905 if (parameters
->target().is_big_endian())
1906 this->endian_do_write
<true>(oview
);
1908 this->endian_do_write
<false>(oview
);
1910 of
->write_output_view(offset
, oview_size
, oview
);
1912 // We no longer need the data.
1913 this->entries_
.clear();
1916 template<bool big_endian
>
1918 Output_symtab_xindex::endian_do_write(unsigned char* const oview
)
1920 for (Xindex_entries::const_iterator p
= this->entries_
.begin();
1921 p
!= this->entries_
.end();
1924 unsigned int symndx
= p
->first
;
1925 gold_assert(symndx
* 4 < this->data_size());
1926 elfcpp::Swap
<32, big_endian
>::writeval(oview
+ symndx
* 4, p
->second
);
1930 // Output_fill_debug_info methods.
1932 // Return the minimum size needed for a dummy compilation unit header.
1935 Output_fill_debug_info::do_minimum_hole_size() const
1937 // Compile unit header fields: unit_length, version, debug_abbrev_offset,
1939 const size_t len
= 4 + 2 + 4 + 1;
1940 // For type units, add type_signature, type_offset.
1941 if (this->is_debug_types_
)
1946 // Write a dummy compilation unit header to fill a hole in the
1947 // .debug_info or .debug_types section.
1950 Output_fill_debug_info::do_write(Output_file
* of
, off_t off
, size_t len
) const
1952 gold_debug(DEBUG_INCREMENTAL
, "fill_debug_info(%08lx, %08lx)",
1953 static_cast<long>(off
), static_cast<long>(len
));
1955 gold_assert(len
>= this->do_minimum_hole_size());
1957 unsigned char* const oview
= of
->get_output_view(off
, len
);
1958 unsigned char* pov
= oview
;
1960 // Write header fields: unit_length, version, debug_abbrev_offset,
1962 if (this->is_big_endian())
1964 elfcpp::Swap_unaligned
<32, true>::writeval(pov
, len
- 4);
1965 elfcpp::Swap_unaligned
<16, true>::writeval(pov
+ 4, this->version
);
1966 elfcpp::Swap_unaligned
<32, true>::writeval(pov
+ 6, 0);
1970 elfcpp::Swap_unaligned
<32, false>::writeval(pov
, len
- 4);
1971 elfcpp::Swap_unaligned
<16, false>::writeval(pov
+ 4, this->version
);
1972 elfcpp::Swap_unaligned
<32, false>::writeval(pov
+ 6, 0);
1977 // For type units, the additional header fields -- type_signature,
1978 // type_offset -- can be filled with zeroes.
1980 // Fill the remainder of the free space with zeroes. The first
1981 // zero should tell the consumer there are no DIEs to read in this
1982 // compilation unit.
1983 if (pov
< oview
+ len
)
1984 memset(pov
, 0, oview
+ len
- pov
);
1986 of
->write_output_view(off
, len
, oview
);
1989 // Output_fill_debug_line methods.
1991 // Return the minimum size needed for a dummy line number program header.
1994 Output_fill_debug_line::do_minimum_hole_size() const
1996 // Line number program header fields: unit_length, version, header_length,
1997 // minimum_instruction_length, default_is_stmt, line_base, line_range,
1998 // opcode_base, standard_opcode_lengths[], include_directories, filenames.
1999 const size_t len
= 4 + 2 + 4 + this->header_length
;
2003 // Write a dummy line number program header to fill a hole in the
2004 // .debug_line section.
2007 Output_fill_debug_line::do_write(Output_file
* of
, off_t off
, size_t len
) const
2009 gold_debug(DEBUG_INCREMENTAL
, "fill_debug_line(%08lx, %08lx)",
2010 static_cast<long>(off
), static_cast<long>(len
));
2012 gold_assert(len
>= this->do_minimum_hole_size());
2014 unsigned char* const oview
= of
->get_output_view(off
, len
);
2015 unsigned char* pov
= oview
;
2017 // Write header fields: unit_length, version, header_length,
2018 // minimum_instruction_length, default_is_stmt, line_base, line_range,
2019 // opcode_base, standard_opcode_lengths[], include_directories, filenames.
2020 // We set the header_length field to cover the entire hole, so the
2021 // line number program is empty.
2022 if (this->is_big_endian())
2024 elfcpp::Swap_unaligned
<32, true>::writeval(pov
, len
- 4);
2025 elfcpp::Swap_unaligned
<16, true>::writeval(pov
+ 4, this->version
);
2026 elfcpp::Swap_unaligned
<32, true>::writeval(pov
+ 6, len
- (4 + 2 + 4));
2030 elfcpp::Swap_unaligned
<32, false>::writeval(pov
, len
- 4);
2031 elfcpp::Swap_unaligned
<16, false>::writeval(pov
+ 4, this->version
);
2032 elfcpp::Swap_unaligned
<32, false>::writeval(pov
+ 6, len
- (4 + 2 + 4));
2035 *pov
++ = 1; // minimum_instruction_length
2036 *pov
++ = 0; // default_is_stmt
2037 *pov
++ = 0; // line_base
2038 *pov
++ = 5; // line_range
2039 *pov
++ = 13; // opcode_base
2040 *pov
++ = 0; // standard_opcode_lengths[1]
2041 *pov
++ = 1; // standard_opcode_lengths[2]
2042 *pov
++ = 1; // standard_opcode_lengths[3]
2043 *pov
++ = 1; // standard_opcode_lengths[4]
2044 *pov
++ = 1; // standard_opcode_lengths[5]
2045 *pov
++ = 0; // standard_opcode_lengths[6]
2046 *pov
++ = 0; // standard_opcode_lengths[7]
2047 *pov
++ = 0; // standard_opcode_lengths[8]
2048 *pov
++ = 1; // standard_opcode_lengths[9]
2049 *pov
++ = 0; // standard_opcode_lengths[10]
2050 *pov
++ = 0; // standard_opcode_lengths[11]
2051 *pov
++ = 1; // standard_opcode_lengths[12]
2052 *pov
++ = 0; // include_directories (empty)
2053 *pov
++ = 0; // filenames (empty)
2055 // Some consumers don't check the header_length field, and simply
2056 // start reading the line number program immediately following the
2057 // header. For those consumers, we fill the remainder of the free
2058 // space with DW_LNS_set_basic_block opcodes. These are effectively
2059 // no-ops: the resulting line table program will not create any rows.
2060 if (pov
< oview
+ len
)
2061 memset(pov
, elfcpp::DW_LNS_set_basic_block
, oview
+ len
- pov
);
2063 of
->write_output_view(off
, len
, oview
);
2066 // Output_section::Input_section methods.
2068 // Return the current data size. For an input section we store the size here.
2069 // For an Output_section_data, we have to ask it for the size.
2072 Output_section::Input_section::current_data_size() const
2074 if (this->is_input_section())
2075 return this->u1_
.data_size
;
2078 this->u2_
.posd
->pre_finalize_data_size();
2079 return this->u2_
.posd
->current_data_size();
2083 // Return the 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.
2087 Output_section::Input_section::data_size() const
2089 if (this->is_input_section())
2090 return this->u1_
.data_size
;
2092 return this->u2_
.posd
->data_size();
2095 // Return the object for an input section.
2098 Output_section::Input_section::relobj() const
2100 if (this->is_input_section())
2101 return this->u2_
.object
;
2102 else if (this->is_merge_section())
2104 gold_assert(this->u2_
.pomb
->first_relobj() != NULL
);
2105 return this->u2_
.pomb
->first_relobj();
2107 else if (this->is_relaxed_input_section())
2108 return this->u2_
.poris
->relobj();
2113 // Return the input section index for an input section.
2116 Output_section::Input_section::shndx() const
2118 if (this->is_input_section())
2119 return this->shndx_
;
2120 else if (this->is_merge_section())
2122 gold_assert(this->u2_
.pomb
->first_relobj() != NULL
);
2123 return this->u2_
.pomb
->first_shndx();
2125 else if (this->is_relaxed_input_section())
2126 return this->u2_
.poris
->shndx();
2131 // Set the address and file offset.
2134 Output_section::Input_section::set_address_and_file_offset(
2137 off_t section_file_offset
)
2139 if (this->is_input_section())
2140 this->u2_
.object
->set_section_offset(this->shndx_
,
2141 file_offset
- section_file_offset
);
2143 this->u2_
.posd
->set_address_and_file_offset(address
, file_offset
);
2146 // Reset the address and file offset.
2149 Output_section::Input_section::reset_address_and_file_offset()
2151 if (!this->is_input_section())
2152 this->u2_
.posd
->reset_address_and_file_offset();
2155 // Finalize the data size.
2158 Output_section::Input_section::finalize_data_size()
2160 if (!this->is_input_section())
2161 this->u2_
.posd
->finalize_data_size();
2164 // Try to turn an input offset into an output offset. We want to
2165 // return the output offset relative to the start of this
2166 // Input_section in the output section.
2169 Output_section::Input_section::output_offset(
2170 const Relobj
* object
,
2172 section_offset_type offset
,
2173 section_offset_type
* poutput
) const
2175 if (!this->is_input_section())
2176 return this->u2_
.posd
->output_offset(object
, shndx
, offset
, poutput
);
2179 if (this->shndx_
!= shndx
|| this->u2_
.object
!= object
)
2186 // Return whether this is the merge section for the input section
2190 Output_section::Input_section::is_merge_section_for(const Relobj
* object
,
2191 unsigned int shndx
) const
2193 if (this->is_input_section())
2195 return this->u2_
.posd
->is_merge_section_for(object
, shndx
);
2198 // Write out the data. We don't have to do anything for an input
2199 // section--they are handled via Object::relocate--but this is where
2200 // we write out the data for an Output_section_data.
2203 Output_section::Input_section::write(Output_file
* of
)
2205 if (!this->is_input_section())
2206 this->u2_
.posd
->write(of
);
2209 // Write the data to a buffer. As for write(), we don't have to do
2210 // anything for an input section.
2213 Output_section::Input_section::write_to_buffer(unsigned char* buffer
)
2215 if (!this->is_input_section())
2216 this->u2_
.posd
->write_to_buffer(buffer
);
2219 // Print to a map file.
2222 Output_section::Input_section::print_to_mapfile(Mapfile
* mapfile
) const
2224 switch (this->shndx_
)
2226 case OUTPUT_SECTION_CODE
:
2227 case MERGE_DATA_SECTION_CODE
:
2228 case MERGE_STRING_SECTION_CODE
:
2229 this->u2_
.posd
->print_to_mapfile(mapfile
);
2232 case RELAXED_INPUT_SECTION_CODE
:
2234 Output_relaxed_input_section
* relaxed_section
=
2235 this->relaxed_input_section();
2236 mapfile
->print_input_section(relaxed_section
->relobj(),
2237 relaxed_section
->shndx());
2241 mapfile
->print_input_section(this->u2_
.object
, this->shndx_
);
2246 // Output_section methods.
2248 // Construct an Output_section. NAME will point into a Stringpool.
2250 Output_section::Output_section(const char* name
, elfcpp::Elf_Word type
,
2251 elfcpp::Elf_Xword flags
)
2256 link_section_(NULL
),
2258 info_section_(NULL
),
2263 order_(ORDER_INVALID
),
2268 first_input_offset_(0),
2270 postprocessing_buffer_(NULL
),
2271 needs_symtab_index_(false),
2272 needs_dynsym_index_(false),
2273 should_link_to_symtab_(false),
2274 should_link_to_dynsym_(false),
2275 after_input_sections_(false),
2276 requires_postprocessing_(false),
2277 found_in_sections_clause_(false),
2278 has_load_address_(false),
2279 info_uses_section_index_(false),
2280 input_section_order_specified_(false),
2281 may_sort_attached_input_sections_(false),
2282 must_sort_attached_input_sections_(false),
2283 attached_input_sections_are_sorted_(false),
2285 is_small_section_(false),
2286 is_large_section_(false),
2287 generate_code_fills_at_write_(false),
2288 is_entsize_zero_(false),
2289 section_offsets_need_adjustment_(false),
2291 always_keeps_input_sections_(false),
2292 has_fixed_layout_(false),
2293 is_patch_space_allowed_(false),
2294 is_unique_segment_(false),
2296 extra_segment_flags_(0),
2297 segment_alignment_(0),
2299 lookup_maps_(new Output_section_lookup_maps
),
2301 free_space_fill_(NULL
),
2304 // An unallocated section has no address. Forcing this means that
2305 // we don't need special treatment for symbols defined in debug
2307 if ((flags
& elfcpp::SHF_ALLOC
) == 0)
2308 this->set_address(0);
2311 Output_section::~Output_section()
2313 delete this->checkpoint_
;
2316 // Set the entry size.
2319 Output_section::set_entsize(uint64_t v
)
2321 if (this->is_entsize_zero_
)
2323 else if (this->entsize_
== 0)
2325 else if (this->entsize_
!= v
)
2328 this->is_entsize_zero_
= 1;
2332 // Add the input section SHNDX, with header SHDR, named SECNAME, in
2333 // OBJECT, to the Output_section. RELOC_SHNDX is the index of a
2334 // relocation section which applies to this section, or 0 if none, or
2335 // -1U if more than one. Return the offset of the input section
2336 // within the output section. Return -1 if the input section will
2337 // receive special handling. In the normal case we don't always keep
2338 // track of input sections for an Output_section. Instead, each
2339 // Object keeps track of the Output_section for each of its input
2340 // sections. However, if HAVE_SECTIONS_SCRIPT is true, we do keep
2341 // track of input sections here; this is used when SECTIONS appears in
2344 template<int size
, bool big_endian
>
2346 Output_section::add_input_section(Layout
* layout
,
2347 Sized_relobj_file
<size
, big_endian
>* object
,
2349 const char* secname
,
2350 const elfcpp::Shdr
<size
, big_endian
>& shdr
,
2351 unsigned int reloc_shndx
,
2352 bool have_sections_script
)
2354 elfcpp::Elf_Xword addralign
= shdr
.get_sh_addralign();
2355 if ((addralign
& (addralign
- 1)) != 0)
2357 object
->error(_("invalid alignment %lu for section \"%s\""),
2358 static_cast<unsigned long>(addralign
), secname
);
2362 if (addralign
> this->addralign_
)
2363 this->addralign_
= addralign
;
2365 typename
elfcpp::Elf_types
<size
>::Elf_WXword sh_flags
= shdr
.get_sh_flags();
2366 uint64_t entsize
= shdr
.get_sh_entsize();
2368 // .debug_str is a mergeable string section, but is not always so
2369 // marked by compilers. Mark manually here so we can optimize.
2370 if (strcmp(secname
, ".debug_str") == 0)
2372 sh_flags
|= (elfcpp::SHF_MERGE
| elfcpp::SHF_STRINGS
);
2376 this->update_flags_for_input_section(sh_flags
);
2377 this->set_entsize(entsize
);
2379 // If this is a SHF_MERGE section, we pass all the input sections to
2380 // a Output_data_merge. We don't try to handle relocations for such
2381 // a section. We don't try to handle empty merge sections--they
2382 // mess up the mappings, and are useless anyhow.
2383 // FIXME: Need to handle merge sections during incremental update.
2384 if ((sh_flags
& elfcpp::SHF_MERGE
) != 0
2386 && shdr
.get_sh_size() > 0
2387 && !parameters
->incremental())
2389 // Keep information about merged input sections for rebuilding fast
2390 // lookup maps if we have sections-script or we do relaxation.
2391 bool keeps_input_sections
= (this->always_keeps_input_sections_
2392 || have_sections_script
2393 || parameters
->target().may_relax());
2395 if (this->add_merge_input_section(object
, shndx
, sh_flags
, entsize
,
2396 addralign
, keeps_input_sections
))
2398 // Tell the relocation routines that they need to call the
2399 // output_offset method to determine the final address.
2404 section_size_type input_section_size
= shdr
.get_sh_size();
2405 section_size_type uncompressed_size
;
2406 if (object
->section_is_compressed(shndx
, &uncompressed_size
))
2407 input_section_size
= uncompressed_size
;
2409 off_t offset_in_section
;
2410 off_t aligned_offset_in_section
;
2411 if (this->has_fixed_layout())
2413 // For incremental updates, find a chunk of unused space in the section.
2414 offset_in_section
= this->free_list_
.allocate(input_section_size
,
2416 if (offset_in_section
== -1)
2417 gold_fallback(_("out of patch space in section %s; "
2418 "relink with --incremental-full"),
2420 aligned_offset_in_section
= offset_in_section
;
2424 offset_in_section
= this->current_data_size_for_child();
2425 aligned_offset_in_section
= align_address(offset_in_section
,
2427 this->set_current_data_size_for_child(aligned_offset_in_section
2428 + input_section_size
);
2431 // Determine if we want to delay code-fill generation until the output
2432 // section is written. When the target is relaxing, we want to delay fill
2433 // generating to avoid adjusting them during relaxation. Also, if we are
2434 // sorting input sections we must delay fill generation.
2435 if (!this->generate_code_fills_at_write_
2436 && !have_sections_script
2437 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2438 && parameters
->target().has_code_fill()
2439 && (parameters
->target().may_relax()
2440 || layout
->is_section_ordering_specified()))
2442 gold_assert(this->fills_
.empty());
2443 this->generate_code_fills_at_write_
= true;
2446 if (aligned_offset_in_section
> offset_in_section
2447 && !this->generate_code_fills_at_write_
2448 && !have_sections_script
2449 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2450 && parameters
->target().has_code_fill())
2452 // We need to add some fill data. Using fill_list_ when
2453 // possible is an optimization, since we will often have fill
2454 // sections without input sections.
2455 off_t fill_len
= aligned_offset_in_section
- offset_in_section
;
2456 if (this->input_sections_
.empty())
2457 this->fills_
.push_back(Fill(offset_in_section
, fill_len
));
2460 std::string
fill_data(parameters
->target().code_fill(fill_len
));
2461 Output_data_const
* odc
= new Output_data_const(fill_data
, 1);
2462 this->input_sections_
.push_back(Input_section(odc
));
2466 // We need to keep track of this section if we are already keeping
2467 // track of sections, or if we are relaxing. Also, if this is a
2468 // section which requires sorting, or which may require sorting in
2469 // the future, we keep track of the sections. If the
2470 // --section-ordering-file option is used to specify the order of
2471 // sections, we need to keep track of sections.
2472 if (this->always_keeps_input_sections_
2473 || have_sections_script
2474 || !this->input_sections_
.empty()
2475 || this->may_sort_attached_input_sections()
2476 || this->must_sort_attached_input_sections()
2477 || parameters
->options().user_set_Map()
2478 || parameters
->target().may_relax()
2479 || layout
->is_section_ordering_specified())
2481 Input_section
isecn(object
, shndx
, input_section_size
, addralign
);
2482 /* If section ordering is requested by specifying a ordering file,
2483 using --section-ordering-file, match the section name with
2485 if (parameters
->options().section_ordering_file())
2487 unsigned int section_order_index
=
2488 layout
->find_section_order_index(std::string(secname
));
2489 if (section_order_index
!= 0)
2491 isecn
.set_section_order_index(section_order_index
);
2492 this->set_input_section_order_specified();
2495 if (this->has_fixed_layout())
2497 // For incremental updates, finalize the address and offset now.
2498 uint64_t addr
= this->address();
2499 isecn
.set_address_and_file_offset(addr
+ aligned_offset_in_section
,
2500 aligned_offset_in_section
,
2503 this->input_sections_
.push_back(isecn
);
2506 return aligned_offset_in_section
;
2509 // Add arbitrary data to an output section.
2512 Output_section::add_output_section_data(Output_section_data
* posd
)
2514 Input_section
inp(posd
);
2515 this->add_output_section_data(&inp
);
2517 if (posd
->is_data_size_valid())
2519 off_t offset_in_section
;
2520 if (this->has_fixed_layout())
2522 // For incremental updates, find a chunk of unused space.
2523 offset_in_section
= this->free_list_
.allocate(posd
->data_size(),
2524 posd
->addralign(), 0);
2525 if (offset_in_section
== -1)
2526 gold_fallback(_("out of patch space in section %s; "
2527 "relink with --incremental-full"),
2529 // Finalize the address and offset now.
2530 uint64_t addr
= this->address();
2531 off_t offset
= this->offset();
2532 posd
->set_address_and_file_offset(addr
+ offset_in_section
,
2533 offset
+ offset_in_section
);
2537 offset_in_section
= this->current_data_size_for_child();
2538 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2540 this->set_current_data_size_for_child(aligned_offset_in_section
2541 + posd
->data_size());
2544 else if (this->has_fixed_layout())
2546 // For incremental updates, arrange for the data to have a fixed layout.
2547 // This will mean that additions to the data must be allocated from
2548 // free space within the containing output section.
2549 uint64_t addr
= this->address();
2550 posd
->set_address(addr
);
2551 posd
->set_file_offset(0);
2552 // FIXME: This should eventually be unreachable.
2553 // gold_unreachable();
2557 // Add a relaxed input section.
2560 Output_section::add_relaxed_input_section(Layout
* layout
,
2561 Output_relaxed_input_section
* poris
,
2562 const std::string
& name
)
2564 Input_section
inp(poris
);
2566 // If the --section-ordering-file option is used to specify the order of
2567 // sections, we need to keep track of sections.
2568 if (layout
->is_section_ordering_specified())
2570 unsigned int section_order_index
=
2571 layout
->find_section_order_index(name
);
2572 if (section_order_index
!= 0)
2574 inp
.set_section_order_index(section_order_index
);
2575 this->set_input_section_order_specified();
2579 this->add_output_section_data(&inp
);
2580 if (this->lookup_maps_
->is_valid())
2581 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2582 poris
->shndx(), poris
);
2584 // For a relaxed section, we use the current data size. Linker scripts
2585 // get all the input sections, including relaxed one from an output
2586 // section and add them back to them same output section to compute the
2587 // output section size. If we do not account for sizes of relaxed input
2588 // sections, an output section would be incorrectly sized.
2589 off_t offset_in_section
= this->current_data_size_for_child();
2590 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2591 poris
->addralign());
2592 this->set_current_data_size_for_child(aligned_offset_in_section
2593 + poris
->current_data_size());
2596 // Add arbitrary data to an output section by Input_section.
2599 Output_section::add_output_section_data(Input_section
* inp
)
2601 if (this->input_sections_
.empty())
2602 this->first_input_offset_
= this->current_data_size_for_child();
2604 this->input_sections_
.push_back(*inp
);
2606 uint64_t addralign
= inp
->addralign();
2607 if (addralign
> this->addralign_
)
2608 this->addralign_
= addralign
;
2610 inp
->set_output_section(this);
2613 // Add a merge section to an output section.
2616 Output_section::add_output_merge_section(Output_section_data
* posd
,
2617 bool is_string
, uint64_t entsize
)
2619 Input_section
inp(posd
, is_string
, entsize
);
2620 this->add_output_section_data(&inp
);
2623 // Add an input section to a SHF_MERGE section.
2626 Output_section::add_merge_input_section(Relobj
* object
, unsigned int shndx
,
2627 uint64_t flags
, uint64_t entsize
,
2629 bool keeps_input_sections
)
2631 bool is_string
= (flags
& elfcpp::SHF_STRINGS
) != 0;
2633 // We only merge strings if the alignment is not more than the
2634 // character size. This could be handled, but it's unusual.
2635 if (is_string
&& addralign
> entsize
)
2638 // We cannot restore merged input section states.
2639 gold_assert(this->checkpoint_
== NULL
);
2641 // Look up merge sections by required properties.
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());
2646 Merge_section_properties
msp(is_string
, entsize
, addralign
);
2647 Output_merge_base
* pomb
= this->lookup_maps_
->find_merge_section(msp
);
2648 bool is_new
= false;
2651 gold_assert(pomb
->is_string() == is_string
2652 && pomb
->entsize() == entsize
2653 && pomb
->addralign() == addralign
);
2657 // Create a new Output_merge_data or Output_merge_string_data.
2659 pomb
= new Output_merge_data(entsize
, addralign
);
2665 pomb
= new Output_merge_string
<char>(addralign
);
2668 pomb
= new Output_merge_string
<uint16_t>(addralign
);
2671 pomb
= new Output_merge_string
<uint32_t>(addralign
);
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();
2684 if (pomb
->add_input_section(object
, shndx
))
2686 // Add new merge section to this output section and link merge
2687 // section properties to new merge section in map.
2690 this->add_output_merge_section(pomb
, is_string
, entsize
);
2691 this->lookup_maps_
->add_merge_section(msp
, pomb
);
2694 // Add input section to new merge section and link input section to new
2695 // merge section in map.
2696 this->lookup_maps_
->add_merge_input_section(object
, shndx
, pomb
);
2701 // If add_input_section failed, delete new merge section to avoid
2702 // exporting empty merge sections in Output_section::get_input_section.
2709 // Build a relaxation map to speed up relaxation of existing input sections.
2710 // Look up to the first LIMIT elements in INPUT_SECTIONS.
2713 Output_section::build_relaxation_map(
2714 const Input_section_list
& input_sections
,
2716 Relaxation_map
* relaxation_map
) const
2718 for (size_t i
= 0; i
< limit
; ++i
)
2720 const Input_section
& is(input_sections
[i
]);
2721 if (is
.is_input_section() || is
.is_relaxed_input_section())
2723 Section_id
sid(is
.relobj(), is
.shndx());
2724 (*relaxation_map
)[sid
] = i
;
2729 // Convert regular input sections in INPUT_SECTIONS into relaxed input
2730 // sections in RELAXED_SECTIONS. MAP is a prebuilt map from section id
2731 // indices of INPUT_SECTIONS.
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
,
2737 Input_section_list
* input_sections
)
2739 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2741 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2742 Section_id
sid(poris
->relobj(), poris
->shndx());
2743 Relaxation_map::const_iterator p
= map
.find(sid
);
2744 gold_assert(p
!= map
.end());
2745 gold_assert((*input_sections
)[p
->second
].is_input_section());
2747 // Remember section order index of original input section
2748 // if it is set. Copy it to the relaxed input section.
2750 (*input_sections
)[p
->second
].section_order_index();
2751 (*input_sections
)[p
->second
] = Input_section(poris
);
2752 (*input_sections
)[p
->second
].set_section_order_index(soi
);
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.
2761 Output_section::convert_input_sections_to_relaxed_sections(
2762 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
)
2764 gold_assert(parameters
->target().may_relax());
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.
2771 // By default, we look at the whole list.
2772 size_t limit
= this->input_sections_
.size();
2774 if (this->checkpoint_
!= NULL
)
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())
2781 this->build_relaxation_map(
2782 *(this->checkpoint_
->input_sections()),
2783 this->checkpoint_
->input_sections()->size(),
2785 this->convert_input_sections_in_list_to_relaxed_sections(
2788 this->checkpoint_
->input_sections());
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();
2798 // Convert input sections in input_section_list.
2800 this->build_relaxation_map(this->input_sections_
, limit
, &map
);
2801 this->convert_input_sections_in_list_to_relaxed_sections(
2804 &this->input_sections_
);
2806 // Update fast look-up map.
2807 if (this->lookup_maps_
->is_valid())
2808 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2810 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2811 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2812 poris
->shndx(), poris
);
2816 // Update the output section flags based on input section flags.
2819 Output_section::update_flags_for_input_section(elfcpp::Elf_Xword flags
)
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
2824 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0
2825 && (flags
& elfcpp::SHF_ALLOC
) != 0)
2826 this->mark_address_invalid();
2828 this->flags_
|= (flags
2829 & (elfcpp::SHF_WRITE
2831 | elfcpp::SHF_EXECINSTR
));
2833 if ((flags
& elfcpp::SHF_MERGE
) == 0)
2834 this->flags_
&=~ elfcpp::SHF_MERGE
;
2837 if (this->current_data_size_for_child() == 0)
2838 this->flags_
|= elfcpp::SHF_MERGE
;
2841 if ((flags
& elfcpp::SHF_STRINGS
) == 0)
2842 this->flags_
&=~ elfcpp::SHF_STRINGS
;
2845 if (this->current_data_size_for_child() == 0)
2846 this->flags_
|= elfcpp::SHF_STRINGS
;
2850 // Find the merge section into which an input section with index SHNDX in
2851 // OBJECT has been added. Return NULL if none found.
2853 Output_section_data
*
2854 Output_section::find_merge_section(const Relobj
* object
,
2855 unsigned int shndx
) const
2857 if (!this->lookup_maps_
->is_valid())
2858 this->build_lookup_maps();
2859 return this->lookup_maps_
->find_merge_section(object
, shndx
);
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.
2867 Output_section::build_lookup_maps() const
2869 this->lookup_maps_
->clear();
2870 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2871 p
!= this->input_sections_
.end();
2874 if (p
->is_merge_section())
2876 Output_merge_base
* pomb
= p
->output_merge_base();
2877 Merge_section_properties
msp(pomb
->is_string(), pomb
->entsize(),
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();
2885 const Const_section_id
& csid
= *is
;
2886 this->lookup_maps_
->add_merge_input_section(csid
.first
,
2891 else if (p
->is_relaxed_input_section())
2893 Output_relaxed_input_section
* poris
= p
->relaxed_input_section();
2894 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2895 poris
->shndx(), poris
);
2900 // Find an relaxed input section corresponding to an input section
2901 // in OBJECT with index SHNDX.
2903 const Output_relaxed_input_section
*
2904 Output_section::find_relaxed_input_section(const Relobj
* object
,
2905 unsigned int shndx
) const
2907 if (!this->lookup_maps_
->is_valid())
2908 this->build_lookup_maps();
2909 return this->lookup_maps_
->find_relaxed_input_section(object
, shndx
);
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
2915 // a special mapping.
2918 Output_section::is_input_address_mapped(const Relobj
* object
,
2922 // Look at the Output_section_data_maps first.
2923 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2925 posd
= this->find_relaxed_input_section(object
, shndx
);
2929 section_offset_type output_offset
;
2930 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2932 return output_offset
!= -1;
2935 // Fall back to the slow look-up.
2936 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2937 p
!= this->input_sections_
.end();
2940 section_offset_type output_offset
;
2941 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2942 return output_offset
!= -1;
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.
2951 // Given an address OFFSET relative to the start of input section
2952 // SHNDX in object OBJECT, return the output offset relative to the
2953 // start of the input section in the output section. This should only
2954 // be called if SHNDX in OBJECT has a special mapping.
2957 Output_section::output_offset(const Relobj
* object
, unsigned int shndx
,
2958 section_offset_type offset
) const
2960 // This can only be called meaningfully when we know the data size
2962 gold_assert(this->is_data_size_valid());
2964 // Look at the Output_section_data_maps first.
2965 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2967 posd
= this->find_relaxed_input_section(object
, shndx
);
2970 section_offset_type output_offset
;
2971 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2973 return output_offset
;
2976 // Fall back to the slow look-up.
2977 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2978 p
!= this->input_sections_
.end();
2981 section_offset_type output_offset
;
2982 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2983 return output_offset
;
2988 // Return the output virtual address of OFFSET relative to the start
2989 // of input section SHNDX in object OBJECT.
2992 Output_section::output_address(const Relobj
* object
, unsigned int shndx
,
2995 uint64_t addr
= this->address() + this->first_input_offset_
;
2997 // Look at the Output_section_data_maps first.
2998 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
3000 posd
= this->find_relaxed_input_section(object
, shndx
);
3001 if (posd
!= NULL
&& posd
->is_address_valid())
3003 section_offset_type output_offset
;
3004 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
3006 return posd
->address() + output_offset
;
3009 // Fall back to the slow look-up.
3010 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
3011 p
!= this->input_sections_
.end();
3014 addr
= align_address(addr
, p
->addralign());
3015 section_offset_type output_offset
;
3016 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
3018 if (output_offset
== -1)
3020 return addr
+ output_offset
;
3022 addr
+= p
->data_size();
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.
3033 // Find the output address of the start of the merged section for
3034 // input section SHNDX in object OBJECT.
3037 Output_section::find_starting_output_address(const Relobj
* object
,
3039 uint64_t* paddr
) const
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.
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();
3049 addr
= align_address(addr
, p
->addralign());
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
3055 if (p
->is_merge_section_for(object
, shndx
))
3061 addr
+= p
->data_size();
3064 // We couldn't find a merge output section for this input section.
3068 // Update the data size of an Output_section.
3071 Output_section::update_data_size()
3073 if (this->input_sections_
.empty())
3076 if (this->must_sort_attached_input_sections()
3077 || this->input_section_order_specified())
3078 this->sort_attached_input_sections();
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();
3085 off
= align_address(off
, p
->addralign());
3086 off
+= p
->current_data_size();
3089 this->set_current_data_size_for_child(off
);
3092 // Set the data size of an Output_section. This is where we handle
3093 // setting the addresses of any Output_section_data objects.
3096 Output_section::set_final_data_size()
3100 if (this->input_sections_
.empty())
3101 data_size
= this->current_data_size_for_child();
3104 if (this->must_sort_attached_input_sections()
3105 || this->input_section_order_specified())
3106 this->sort_attached_input_sections();
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();
3115 off
= align_address(off
, p
->addralign());
3116 p
->set_address_and_file_offset(address
+ (off
- startoff
), off
,
3118 off
+= p
->data_size();
3120 data_size
= off
- startoff
;
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())
3127 double pct
= parameters
->options().incremental_patch();
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();
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_
),
3139 data_size
= new_size
;
3142 this->set_data_size(data_size
);
3145 // Reset the address and file offset.
3148 Output_section::do_reset_address_and_file_offset()
3150 // An unallocated section has no address. Forcing this means that
3151 // we don't need special treatment for symbols defined in debug
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_
)
3155 this->set_address(0);
3157 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3158 p
!= this->input_sections_
.end();
3160 p
->reset_address_and_file_offset();
3162 // Remove any patch space that was added in set_final_data_size.
3163 if (this->patch_space_
> 0)
3165 this->set_current_data_size_for_child(this->current_data_size_for_child()
3166 - this->patch_space_
);
3167 this->patch_space_
= 0;
3171 // Return true if address and file offset have the values after reset.
3174 Output_section::do_address_and_file_offset_have_reset_values() const
3176 if (this->is_offset_valid())
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;
3183 return !this->is_address_valid();
3186 // Set the TLS offset. Called only for SHT_TLS sections.
3189 Output_section::do_set_tls_offset(uint64_t tls_base
)
3191 this->tls_offset_
= this->address() - tls_base
;
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
3199 // attached input section matching ".ctors.*", ".dtors.*",
3200 // ".init_array.*" or ".fini_array.*".
3202 class Output_section::Input_section_sort_entry
3205 Input_section_sort_entry()
3206 : input_section_(), index_(-1U), section_has_name_(false),
3210 Input_section_sort_entry(const Input_section
& input_section
,
3212 bool must_sort_attached_input_sections
)
3213 : input_section_(input_section
), index_(index
),
3214 section_has_name_(input_section
.is_input_section()
3215 || input_section
.is_relaxed_input_section())
3217 if (this->section_has_name_
3218 && must_sort_attached_input_sections
)
3220 // This is only called single-threaded from Layout::finalize,
3221 // so it is OK to lock. Unfortunately we have no way to pass
3223 const Task
* dummy_task
= reinterpret_cast<const Task
*>(-1);
3224 Object
* obj
= (input_section
.is_input_section()
3225 ? input_section
.relobj()
3226 : input_section
.relaxed_input_section()->relobj());
3227 Task_lock_obj
<Object
> tl(dummy_task
, obj
);
3229 // This is a slow operation, which should be cached in
3230 // Layout::layout if this becomes a speed problem.
3231 this->section_name_
= obj
->section_name(input_section
.shndx());
3235 // Return the Input_section.
3236 const Input_section
&
3237 input_section() const
3239 gold_assert(this->index_
!= -1U);
3240 return this->input_section_
;
3243 // The index of this entry in the original list. This is used to
3244 // make the sort stable.
3248 gold_assert(this->index_
!= -1U);
3249 return this->index_
;
3252 // Whether there is a section name.
3254 section_has_name() const
3255 { return this->section_has_name_
; }
3257 // The section name.
3259 section_name() const
3261 gold_assert(this->section_has_name_
);
3262 return this->section_name_
;
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.
3268 has_priority() const
3270 gold_assert(this->section_has_name_
);
3271 return this->section_name_
.find('.', 1) != std::string::npos
;
3274 // Return the priority. Believe it or not, gcc encodes the priority
3275 // differently for .ctors/.dtors and .init_array/.fini_array
3278 get_priority() const
3280 gold_assert(this->section_has_name_
);
3282 if (is_prefix_of(".ctors.", this->section_name_
.c_str())
3283 || is_prefix_of(".dtors.", this->section_name_
.c_str()))
3285 else if (is_prefix_of(".init_array.", this->section_name_
.c_str())
3286 || is_prefix_of(".fini_array.", this->section_name_
.c_str()))
3291 unsigned long prio
= strtoul((this->section_name_
.c_str()
3292 + (is_ctors
? 7 : 12)),
3297 return 65535 - prio
;
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.
3310 match_file_name(const char* file_name
) const
3311 { return Layout::match_file_name(this->input_section_
.relobj(), file_name
); }
3313 // Returns 1 if THIS should appear before S in section order, -1 if S
3314 // appears before THIS and 0 if they are not comparable.
3316 compare_section_ordering(const Input_section_sort_entry
& s
) const
3318 unsigned int this_secn_index
= this->input_section_
.section_order_index();
3319 unsigned int s_secn_index
= s
.input_section().section_order_index();
3320 if (this_secn_index
> 0 && s_secn_index
> 0)
3322 if (this_secn_index
< s_secn_index
)
3324 else if (this_secn_index
> s_secn_index
)
3331 // The Input_section we are sorting.
3332 Input_section input_section_
;
3333 // The index of this Input_section in the original list.
3334 unsigned int index_
;
3335 // Whether this Input_section has a section name--it won't if this
3336 // is some random Output_section_data.
3337 bool section_has_name_
;
3338 // The section name if there is one.
3339 std::string section_name_
;
3342 // Return true if S1 should come before S2 in the output section.
3345 Output_section::Input_section_sort_compare::operator()(
3346 const Output_section::Input_section_sort_entry
& s1
,
3347 const Output_section::Input_section_sort_entry
& s2
) const
3349 // crtbegin.o must come first.
3350 bool s1_begin
= s1
.match_file_name("crtbegin");
3351 bool s2_begin
= s2
.match_file_name("crtbegin");
3352 if (s1_begin
|| s2_begin
)
3358 return s1
.index() < s2
.index();
3361 // crtend.o must come last.
3362 bool s1_end
= s1
.match_file_name("crtend");
3363 bool s2_end
= s2
.match_file_name("crtend");
3364 if (s1_end
|| s2_end
)
3370 return s1
.index() < s2
.index();
3373 // We sort all the sections with no names to the end.
3374 if (!s1
.section_has_name() || !s2
.section_has_name())
3376 if (s1
.section_has_name())
3378 if (s2
.section_has_name())
3380 return s1
.index() < s2
.index();
3383 // A section with a priority follows a section without a priority.
3384 bool s1_has_priority
= s1
.has_priority();
3385 bool s2_has_priority
= s2
.has_priority();
3386 if (s1_has_priority
&& !s2_has_priority
)
3388 if (!s1_has_priority
&& s2_has_priority
)
3391 // Check if a section order exists for these sections through a section
3392 // ordering file. If sequence_num is 0, an order does not exist.
3393 int sequence_num
= s1
.compare_section_ordering(s2
);
3394 if (sequence_num
!= 0)
3395 return sequence_num
== 1;
3397 // Otherwise we sort by name.
3398 int compare
= s1
.section_name().compare(s2
.section_name());
3402 // Otherwise we keep the input order.
3403 return s1
.index() < s2
.index();
3406 // Return true if S1 should come before S2 in an .init_array or .fini_array
3410 Output_section::Input_section_sort_init_fini_compare::operator()(
3411 const Output_section::Input_section_sort_entry
& s1
,
3412 const Output_section::Input_section_sort_entry
& s2
) const
3414 // We sort all the sections with no names to the end.
3415 if (!s1
.section_has_name() || !s2
.section_has_name())
3417 if (s1
.section_has_name())
3419 if (s2
.section_has_name())
3421 return s1
.index() < s2
.index();
3424 // A section without a priority follows a section with a priority.
3425 // This is the reverse of .ctors and .dtors sections.
3426 bool s1_has_priority
= s1
.has_priority();
3427 bool s2_has_priority
= s2
.has_priority();
3428 if (s1_has_priority
&& !s2_has_priority
)
3430 if (!s1_has_priority
&& s2_has_priority
)
3433 // .ctors and .dtors sections without priority come after
3434 // .init_array and .fini_array sections without priority.
3435 if (!s1_has_priority
3436 && (s1
.section_name() == ".ctors" || s1
.section_name() == ".dtors")
3437 && s1
.section_name() != s2
.section_name())
3439 if (!s2_has_priority
3440 && (s2
.section_name() == ".ctors" || s2
.section_name() == ".dtors")
3441 && s2
.section_name() != s1
.section_name())
3444 // Sort by priority if we can.
3445 if (s1_has_priority
)
3447 unsigned int s1_prio
= s1
.get_priority();
3448 unsigned int s2_prio
= s2
.get_priority();
3449 if (s1_prio
< s2_prio
)
3451 else if (s1_prio
> s2_prio
)
3455 // Check if a section order exists for these sections through a section
3456 // ordering file. If sequence_num is 0, an order does not exist.
3457 int sequence_num
= s1
.compare_section_ordering(s2
);
3458 if (sequence_num
!= 0)
3459 return sequence_num
== 1;
3461 // Otherwise we sort by name.
3462 int compare
= s1
.section_name().compare(s2
.section_name());
3466 // Otherwise we keep the input order.
3467 return s1
.index() < s2
.index();
3470 // Return true if S1 should come before S2. Sections that do not match
3471 // any pattern in the section ordering file are placed ahead of the sections
3472 // that match some pattern.
3475 Output_section::Input_section_sort_section_order_index_compare::operator()(
3476 const Output_section::Input_section_sort_entry
& s1
,
3477 const Output_section::Input_section_sort_entry
& s2
) const
3479 unsigned int s1_secn_index
= s1
.input_section().section_order_index();
3480 unsigned int s2_secn_index
= s2
.input_section().section_order_index();
3482 // Keep input order if section ordering cannot determine order.
3483 if (s1_secn_index
== s2_secn_index
)
3484 return s1
.index() < s2
.index();
3486 return s1_secn_index
< s2_secn_index
;
3489 // This updates the section order index of input sections according to the
3490 // the order specified in the mapping from Section id to order index.
3493 Output_section::update_section_layout(
3494 const Section_layout_order
* order_map
)
3496 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3497 p
!= this->input_sections_
.end();
3500 if (p
->is_input_section()
3501 || p
->is_relaxed_input_section())
3503 Object
* obj
= (p
->is_input_section()
3505 : p
->relaxed_input_section()->relobj());
3506 unsigned int shndx
= p
->shndx();
3507 Section_layout_order::const_iterator it
3508 = order_map
->find(Section_id(obj
, shndx
));
3509 if (it
== order_map
->end())
3511 unsigned int section_order_index
= it
->second
;
3512 if (section_order_index
!= 0)
3514 p
->set_section_order_index(section_order_index
);
3515 this->set_input_section_order_specified();
3521 // Sort the input sections attached to an output section.
3524 Output_section::sort_attached_input_sections()
3526 if (this->attached_input_sections_are_sorted_
)
3529 if (this->checkpoint_
!= NULL
3530 && !this->checkpoint_
->input_sections_saved())
3531 this->checkpoint_
->save_input_sections();
3533 // The only thing we know about an input section is the object and
3534 // the section index. We need the section name. Recomputing this
3535 // is slow but this is an unusual case. If this becomes a speed
3536 // problem we can cache the names as required in Layout::layout.
3538 // We start by building a larger vector holding a copy of each
3539 // Input_section, plus its current index in the list and its name.
3540 std::vector
<Input_section_sort_entry
> sort_list
;
3543 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3544 p
!= this->input_sections_
.end();
3546 sort_list
.push_back(Input_section_sort_entry(*p
, i
,
3547 this->must_sort_attached_input_sections()));
3549 // Sort the input sections.
3550 if (this->must_sort_attached_input_sections())
3552 if (this->type() == elfcpp::SHT_PREINIT_ARRAY
3553 || this->type() == elfcpp::SHT_INIT_ARRAY
3554 || this->type() == elfcpp::SHT_FINI_ARRAY
)
3555 std::sort(sort_list
.begin(), sort_list
.end(),
3556 Input_section_sort_init_fini_compare());
3558 std::sort(sort_list
.begin(), sort_list
.end(),
3559 Input_section_sort_compare());
3563 gold_assert(this->input_section_order_specified());
3564 std::sort(sort_list
.begin(), sort_list
.end(),
3565 Input_section_sort_section_order_index_compare());
3568 // Copy the sorted input sections back to our list.
3569 this->input_sections_
.clear();
3570 for (std::vector
<Input_section_sort_entry
>::iterator p
= sort_list
.begin();
3571 p
!= sort_list
.end();
3573 this->input_sections_
.push_back(p
->input_section());
3576 // Remember that we sorted the input sections, since we might get
3578 this->attached_input_sections_are_sorted_
= true;
3581 // Write the section header to *OSHDR.
3583 template<int size
, bool big_endian
>
3585 Output_section::write_header(const Layout
* layout
,
3586 const Stringpool
* secnamepool
,
3587 elfcpp::Shdr_write
<size
, big_endian
>* oshdr
) const
3589 oshdr
->put_sh_name(secnamepool
->get_offset(this->name_
));
3590 oshdr
->put_sh_type(this->type_
);
3592 elfcpp::Elf_Xword flags
= this->flags_
;
3593 if (this->info_section_
!= NULL
&& this->info_uses_section_index_
)
3594 flags
|= elfcpp::SHF_INFO_LINK
;
3595 oshdr
->put_sh_flags(flags
);
3597 oshdr
->put_sh_addr(this->address());
3598 oshdr
->put_sh_offset(this->offset());
3599 oshdr
->put_sh_size(this->data_size());
3600 if (this->link_section_
!= NULL
)
3601 oshdr
->put_sh_link(this->link_section_
->out_shndx());
3602 else if (this->should_link_to_symtab_
)
3603 oshdr
->put_sh_link(layout
->symtab_section_shndx());
3604 else if (this->should_link_to_dynsym_
)
3605 oshdr
->put_sh_link(layout
->dynsym_section()->out_shndx());
3607 oshdr
->put_sh_link(this->link_
);
3609 elfcpp::Elf_Word info
;
3610 if (this->info_section_
!= NULL
)
3612 if (this->info_uses_section_index_
)
3613 info
= this->info_section_
->out_shndx();
3615 info
= this->info_section_
->symtab_index();
3617 else if (this->info_symndx_
!= NULL
)
3618 info
= this->info_symndx_
->symtab_index();
3621 oshdr
->put_sh_info(info
);
3623 oshdr
->put_sh_addralign(this->addralign_
);
3624 oshdr
->put_sh_entsize(this->entsize_
);
3627 // Write out the data. For input sections the data is written out by
3628 // Object::relocate, but we have to handle Output_section_data objects
3632 Output_section::do_write(Output_file
* of
)
3634 gold_assert(!this->requires_postprocessing());
3636 // If the target performs relaxation, we delay filler generation until now.
3637 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
3639 off_t output_section_file_offset
= this->offset();
3640 for (Fill_list::iterator p
= this->fills_
.begin();
3641 p
!= this->fills_
.end();
3644 std::string
fill_data(parameters
->target().code_fill(p
->length()));
3645 of
->write(output_section_file_offset
+ p
->section_offset(),
3646 fill_data
.data(), fill_data
.size());
3649 off_t off
= this->offset() + this->first_input_offset_
;
3650 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3651 p
!= this->input_sections_
.end();
3654 off_t aligned_off
= align_address(off
, p
->addralign());
3655 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
3657 size_t fill_len
= aligned_off
- off
;
3658 std::string
fill_data(parameters
->target().code_fill(fill_len
));
3659 of
->write(off
, fill_data
.data(), fill_data
.size());
3663 off
= aligned_off
+ p
->data_size();
3666 // For incremental links, fill in unused chunks in debug sections
3667 // with dummy compilation unit headers.
3668 if (this->free_space_fill_
!= NULL
)
3670 for (Free_list::Const_iterator p
= this->free_list_
.begin();
3671 p
!= this->free_list_
.end();
3674 off_t off
= p
->start_
;
3675 size_t len
= p
->end_
- off
;
3676 this->free_space_fill_
->write(of
, this->offset() + off
, len
);
3678 if (this->patch_space_
> 0)
3680 off_t off
= this->current_data_size_for_child() - this->patch_space_
;
3681 this->free_space_fill_
->write(of
, this->offset() + off
,
3682 this->patch_space_
);
3687 // If a section requires postprocessing, create the buffer to use.
3690 Output_section::create_postprocessing_buffer()
3692 gold_assert(this->requires_postprocessing());
3694 if (this->postprocessing_buffer_
!= NULL
)
3697 if (!this->input_sections_
.empty())
3699 off_t off
= this->first_input_offset_
;
3700 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3701 p
!= this->input_sections_
.end();
3704 off
= align_address(off
, p
->addralign());
3705 p
->finalize_data_size();
3706 off
+= p
->data_size();
3708 this->set_current_data_size_for_child(off
);
3711 off_t buffer_size
= this->current_data_size_for_child();
3712 this->postprocessing_buffer_
= new unsigned char[buffer_size
];
3715 // Write all the data of an Output_section into the postprocessing
3716 // buffer. This is used for sections which require postprocessing,
3717 // such as compression. Input sections are handled by
3718 // Object::Relocate.
3721 Output_section::write_to_postprocessing_buffer()
3723 gold_assert(this->requires_postprocessing());
3725 // If the target performs relaxation, we delay filler generation until now.
3726 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
3728 unsigned char* buffer
= this->postprocessing_buffer();
3729 for (Fill_list::iterator p
= this->fills_
.begin();
3730 p
!= this->fills_
.end();
3733 std::string
fill_data(parameters
->target().code_fill(p
->length()));
3734 memcpy(buffer
+ p
->section_offset(), fill_data
.data(),
3738 off_t off
= this->first_input_offset_
;
3739 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3740 p
!= this->input_sections_
.end();
3743 off_t aligned_off
= align_address(off
, p
->addralign());
3744 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
3746 size_t fill_len
= aligned_off
- off
;
3747 std::string
fill_data(parameters
->target().code_fill(fill_len
));
3748 memcpy(buffer
+ off
, fill_data
.data(), fill_data
.size());
3751 p
->write_to_buffer(buffer
+ aligned_off
);
3752 off
= aligned_off
+ p
->data_size();
3756 // Get the input sections for linker script processing. We leave
3757 // behind the Output_section_data entries. Note that this may be
3758 // slightly incorrect for merge sections. We will leave them behind,
3759 // but it is possible that the script says that they should follow
3760 // some other input sections, as in:
3761 // .rodata { *(.rodata) *(.rodata.cst*) }
3762 // For that matter, we don't handle this correctly:
3763 // .rodata { foo.o(.rodata.cst*) *(.rodata.cst*) }
3764 // With luck this will never matter.
3767 Output_section::get_input_sections(
3769 const std::string
& fill
,
3770 std::list
<Input_section
>* input_sections
)
3772 if (this->checkpoint_
!= NULL
3773 && !this->checkpoint_
->input_sections_saved())
3774 this->checkpoint_
->save_input_sections();
3776 // Invalidate fast look-up maps.
3777 this->lookup_maps_
->invalidate();
3779 uint64_t orig_address
= address
;
3781 address
= align_address(address
, this->addralign());
3783 Input_section_list remaining
;
3784 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3785 p
!= this->input_sections_
.end();
3788 if (p
->is_input_section()
3789 || p
->is_relaxed_input_section()
3790 || p
->is_merge_section())
3791 input_sections
->push_back(*p
);
3794 uint64_t aligned_address
= align_address(address
, p
->addralign());
3795 if (aligned_address
!= address
&& !fill
.empty())
3797 section_size_type length
=
3798 convert_to_section_size_type(aligned_address
- address
);
3799 std::string this_fill
;
3800 this_fill
.reserve(length
);
3801 while (this_fill
.length() + fill
.length() <= length
)
3803 if (this_fill
.length() < length
)
3804 this_fill
.append(fill
, 0, length
- this_fill
.length());
3806 Output_section_data
* posd
= new Output_data_const(this_fill
, 0);
3807 remaining
.push_back(Input_section(posd
));
3809 address
= aligned_address
;
3811 remaining
.push_back(*p
);
3813 p
->finalize_data_size();
3814 address
+= p
->data_size();
3818 this->input_sections_
.swap(remaining
);
3819 this->first_input_offset_
= 0;
3821 uint64_t data_size
= address
- orig_address
;
3822 this->set_current_data_size_for_child(data_size
);
3826 // Add a script input section. SIS is an Output_section::Input_section,
3827 // which can be either a plain input section or a special input section like
3828 // a relaxed input section. For a special input section, its size must be
3832 Output_section::add_script_input_section(const Input_section
& sis
)
3834 uint64_t data_size
= sis
.data_size();
3835 uint64_t addralign
= sis
.addralign();
3836 if (addralign
> this->addralign_
)
3837 this->addralign_
= addralign
;
3839 off_t offset_in_section
= this->current_data_size_for_child();
3840 off_t aligned_offset_in_section
= align_address(offset_in_section
,
3843 this->set_current_data_size_for_child(aligned_offset_in_section
3846 this->input_sections_
.push_back(sis
);
3848 // Update fast lookup maps if necessary.
3849 if (this->lookup_maps_
->is_valid())
3851 if (sis
.is_merge_section())
3853 Output_merge_base
* pomb
= sis
.output_merge_base();
3854 Merge_section_properties
msp(pomb
->is_string(), pomb
->entsize(),
3856 this->lookup_maps_
->add_merge_section(msp
, pomb
);
3857 for (Output_merge_base::Input_sections::const_iterator p
=
3858 pomb
->input_sections_begin();
3859 p
!= pomb
->input_sections_end();
3861 this->lookup_maps_
->add_merge_input_section(p
->first
, p
->second
,
3864 else if (sis
.is_relaxed_input_section())
3866 Output_relaxed_input_section
* poris
= sis
.relaxed_input_section();
3867 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
3868 poris
->shndx(), poris
);
3873 // Save states for relaxation.
3876 Output_section::save_states()
3878 gold_assert(this->checkpoint_
== NULL
);
3879 Checkpoint_output_section
* checkpoint
=
3880 new Checkpoint_output_section(this->addralign_
, this->flags_
,
3881 this->input_sections_
,
3882 this->first_input_offset_
,
3883 this->attached_input_sections_are_sorted_
);
3884 this->checkpoint_
= checkpoint
;
3885 gold_assert(this->fills_
.empty());
3889 Output_section::discard_states()
3891 gold_assert(this->checkpoint_
!= NULL
);
3892 delete this->checkpoint_
;
3893 this->checkpoint_
= NULL
;
3894 gold_assert(this->fills_
.empty());
3896 // Simply invalidate the fast lookup maps since we do not keep
3898 this->lookup_maps_
->invalidate();
3902 Output_section::restore_states()
3904 gold_assert(this->checkpoint_
!= NULL
);
3905 Checkpoint_output_section
* checkpoint
= this->checkpoint_
;
3907 this->addralign_
= checkpoint
->addralign();
3908 this->flags_
= checkpoint
->flags();
3909 this->first_input_offset_
= checkpoint
->first_input_offset();
3911 if (!checkpoint
->input_sections_saved())
3913 // If we have not copied the input sections, just resize it.
3914 size_t old_size
= checkpoint
->input_sections_size();
3915 gold_assert(this->input_sections_
.size() >= old_size
);
3916 this->input_sections_
.resize(old_size
);
3920 // We need to copy the whole list. This is not efficient for
3921 // extremely large output with hundreads of thousands of input
3922 // objects. We may need to re-think how we should pass sections
3924 this->input_sections_
= *checkpoint
->input_sections();
3927 this->attached_input_sections_are_sorted_
=
3928 checkpoint
->attached_input_sections_are_sorted();
3930 // Simply invalidate the fast lookup maps since we do not keep
3932 this->lookup_maps_
->invalidate();
3935 // Update the section offsets of input sections in this. This is required if
3936 // relaxation causes some input sections to change sizes.
3939 Output_section::adjust_section_offsets()
3941 if (!this->section_offsets_need_adjustment_
)
3945 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3946 p
!= this->input_sections_
.end();
3949 off
= align_address(off
, p
->addralign());
3950 if (p
->is_input_section())
3951 p
->relobj()->set_section_offset(p
->shndx(), off
);
3952 off
+= p
->data_size();
3955 this->section_offsets_need_adjustment_
= false;
3958 // Print to the map file.
3961 Output_section::do_print_to_mapfile(Mapfile
* mapfile
) const
3963 mapfile
->print_output_section(this);
3965 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
3966 p
!= this->input_sections_
.end();
3968 p
->print_to_mapfile(mapfile
);
3971 // Print stats for merge sections to stderr.
3974 Output_section::print_merge_stats()
3976 Input_section_list::iterator p
;
3977 for (p
= this->input_sections_
.begin();
3978 p
!= this->input_sections_
.end();
3980 p
->print_merge_stats(this->name_
);
3983 // Set a fixed layout for the section. Used for incremental update links.
3986 Output_section::set_fixed_layout(uint64_t sh_addr
, off_t sh_offset
,
3987 off_t sh_size
, uint64_t sh_addralign
)
3989 this->addralign_
= sh_addralign
;
3990 this->set_current_data_size(sh_size
);
3991 if ((this->flags_
& elfcpp::SHF_ALLOC
) != 0)
3992 this->set_address(sh_addr
);
3993 this->set_file_offset(sh_offset
);
3994 this->finalize_data_size();
3995 this->free_list_
.init(sh_size
, false);
3996 this->has_fixed_layout_
= true;
3999 // Reserve space within the fixed layout for the section. Used for
4000 // incremental update links.
4003 Output_section::reserve(uint64_t sh_offset
, uint64_t sh_size
)
4005 this->free_list_
.remove(sh_offset
, sh_offset
+ sh_size
);
4008 // Allocate space from the free list for the section. Used for
4009 // incremental update links.
4012 Output_section::allocate(off_t len
, uint64_t addralign
)
4014 return this->free_list_
.allocate(len
, addralign
, 0);
4017 // Output segment methods.
4019 Output_segment::Output_segment(elfcpp::Elf_Word type
, elfcpp::Elf_Word flags
)
4029 is_max_align_known_(false),
4030 are_addresses_set_(false),
4031 is_large_data_segment_(false),
4032 is_unique_segment_(false)
4034 // The ELF ABI specifies that a PT_TLS segment always has PF_R as
4036 if (type
== elfcpp::PT_TLS
)
4037 this->flags_
= elfcpp::PF_R
;
4040 // Add an Output_section to a PT_LOAD Output_segment.
4043 Output_segment::add_output_section_to_load(Layout
* layout
,
4045 elfcpp::Elf_Word seg_flags
)
4047 gold_assert(this->type() == elfcpp::PT_LOAD
);
4048 gold_assert((os
->flags() & elfcpp::SHF_ALLOC
) != 0);
4049 gold_assert(!this->is_max_align_known_
);
4050 gold_assert(os
->is_large_data_section() == this->is_large_data_segment());
4052 this->update_flags_for_output_section(seg_flags
);
4054 // We don't want to change the ordering if we have a linker script
4055 // with a SECTIONS clause.
4056 Output_section_order order
= os
->order();
4057 if (layout
->script_options()->saw_sections_clause())
4058 order
= static_cast<Output_section_order
>(0);
4060 gold_assert(order
!= ORDER_INVALID
);
4062 this->output_lists_
[order
].push_back(os
);
4065 // Add an Output_section to a non-PT_LOAD Output_segment.
4068 Output_segment::add_output_section_to_nonload(Output_section
* os
,
4069 elfcpp::Elf_Word seg_flags
)
4071 gold_assert(this->type() != elfcpp::PT_LOAD
);
4072 gold_assert((os
->flags() & elfcpp::SHF_ALLOC
) != 0);
4073 gold_assert(!this->is_max_align_known_
);
4075 this->update_flags_for_output_section(seg_flags
);
4077 this->output_lists_
[0].push_back(os
);
4080 // Remove an Output_section from this segment. It is an error if it
4084 Output_segment::remove_output_section(Output_section
* os
)
4086 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4088 Output_data_list
* pdl
= &this->output_lists_
[i
];
4089 for (Output_data_list::iterator p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
4101 // Add an Output_data (which need not be an Output_section) to the
4102 // start of a segment.
4105 Output_segment::add_initial_output_data(Output_data
* od
)
4107 gold_assert(!this->is_max_align_known_
);
4108 Output_data_list::iterator p
= this->output_lists_
[0].begin();
4109 this->output_lists_
[0].insert(p
, od
);
4112 // Return true if this segment has any sections which hold actual
4113 // data, rather than being a BSS section.
4116 Output_segment::has_any_data_sections() const
4118 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4120 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4121 for (Output_data_list::const_iterator p
= pdl
->begin();
4125 if (!(*p
)->is_section())
4127 if ((*p
)->output_section()->type() != elfcpp::SHT_NOBITS
)
4134 // Return whether the first data section (not counting TLS sections)
4135 // is a relro section.
4138 Output_segment::is_first_section_relro() const
4140 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4142 if (i
== static_cast<int>(ORDER_TLS_DATA
)
4143 || i
== static_cast<int>(ORDER_TLS_BSS
))
4145 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4148 Output_data
* p
= pdl
->front();
4149 return p
->is_section() && p
->output_section()->is_relro();
4155 // Return the maximum alignment of the Output_data in Output_segment.
4158 Output_segment::maximum_alignment()
4160 if (!this->is_max_align_known_
)
4162 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4164 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4165 uint64_t addralign
= Output_segment::maximum_alignment_list(pdl
);
4166 if (addralign
> this->max_align_
)
4167 this->max_align_
= addralign
;
4169 this->is_max_align_known_
= true;
4172 return this->max_align_
;
4175 // Return the maximum alignment of a list of Output_data.
4178 Output_segment::maximum_alignment_list(const Output_data_list
* pdl
)
4181 for (Output_data_list::const_iterator p
= pdl
->begin();
4185 uint64_t addralign
= (*p
)->addralign();
4186 if (addralign
> ret
)
4192 // Return whether this segment has any dynamic relocs.
4195 Output_segment::has_dynamic_reloc() const
4197 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4198 if (this->has_dynamic_reloc_list(&this->output_lists_
[i
]))
4203 // Return whether this Output_data_list has any dynamic relocs.
4206 Output_segment::has_dynamic_reloc_list(const Output_data_list
* pdl
) const
4208 for (Output_data_list::const_iterator p
= pdl
->begin();
4211 if ((*p
)->has_dynamic_reloc())
4216 // Set the section addresses for an Output_segment. If RESET is true,
4217 // reset the addresses first. ADDR is the address and *POFF is the
4218 // file offset. Set the section indexes starting with *PSHNDX.
4219 // INCREASE_RELRO is the size of the portion of the first non-relro
4220 // section that should be included in the PT_GNU_RELRO segment.
4221 // If this segment has relro sections, and has been aligned for
4222 // that purpose, set *HAS_RELRO to TRUE. Return the address of
4223 // the immediately following segment. Update *HAS_RELRO, *POFF,
4227 Output_segment::set_section_addresses(Layout
* layout
, bool reset
,
4229 unsigned int* increase_relro
,
4232 unsigned int* pshndx
)
4234 gold_assert(this->type_
== elfcpp::PT_LOAD
);
4236 uint64_t last_relro_pad
= 0;
4237 off_t orig_off
= *poff
;
4239 bool in_tls
= false;
4241 // If we have relro sections, we need to pad forward now so that the
4242 // relro sections plus INCREASE_RELRO end on an abi page boundary.
4243 if (parameters
->options().relro()
4244 && this->is_first_section_relro()
4245 && (!this->are_addresses_set_
|| reset
))
4247 uint64_t relro_size
= 0;
4249 uint64_t max_align
= 0;
4250 for (int i
= 0; i
<= static_cast<int>(ORDER_RELRO_LAST
); ++i
)
4252 Output_data_list
* pdl
= &this->output_lists_
[i
];
4253 Output_data_list::iterator p
;
4254 for (p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
4256 if (!(*p
)->is_section())
4258 uint64_t align
= (*p
)->addralign();
4259 if (align
> max_align
)
4261 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
4265 // Align the first non-TLS section to the alignment
4266 // of the TLS segment.
4270 relro_size
= align_address(relro_size
, align
);
4271 // Ignore the size of the .tbss section.
4272 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
4273 && (*p
)->is_section_type(elfcpp::SHT_NOBITS
))
4275 if ((*p
)->is_address_valid())
4276 relro_size
+= (*p
)->data_size();
4279 // FIXME: This could be faster.
4280 (*p
)->set_address_and_file_offset(addr
+ relro_size
,
4282 relro_size
+= (*p
)->data_size();
4283 (*p
)->reset_address_and_file_offset();
4286 if (p
!= pdl
->end())
4289 relro_size
+= *increase_relro
;
4290 // Pad the total relro size to a multiple of the maximum
4291 // section alignment seen.
4292 uint64_t aligned_size
= align_address(relro_size
, max_align
);
4293 // Note the amount of padding added after the last relro section.
4294 last_relro_pad
= aligned_size
- relro_size
;
4297 uint64_t page_align
= parameters
->target().abi_pagesize();
4299 // Align to offset N such that (N + RELRO_SIZE) % PAGE_ALIGN == 0.
4300 uint64_t desired_align
= page_align
- (aligned_size
% page_align
);
4301 if (desired_align
< *poff
% page_align
)
4302 *poff
+= page_align
- *poff
% page_align
;
4303 *poff
+= desired_align
- *poff
% page_align
;
4304 addr
+= *poff
- orig_off
;
4308 if (!reset
&& this->are_addresses_set_
)
4310 gold_assert(this->paddr_
== addr
);
4311 addr
= this->vaddr_
;
4315 this->vaddr_
= addr
;
4316 this->paddr_
= addr
;
4317 this->are_addresses_set_
= true;
4322 this->offset_
= orig_off
;
4326 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4328 if (i
== static_cast<int>(ORDER_RELRO_LAST
))
4330 *poff
+= last_relro_pad
;
4331 addr
+= last_relro_pad
;
4332 if (this->output_lists_
[i
].empty())
4334 // If there is nothing in the ORDER_RELRO_LAST list,
4335 // the padding will occur at the end of the relro
4336 // segment, and we need to add it to *INCREASE_RELRO.
4337 *increase_relro
+= last_relro_pad
;
4340 addr
= this->set_section_list_addresses(layout
, reset
,
4341 &this->output_lists_
[i
],
4342 addr
, poff
, pshndx
, &in_tls
);
4343 if (i
< static_cast<int>(ORDER_SMALL_BSS
))
4345 this->filesz_
= *poff
- orig_off
;
4352 // If the last section was a TLS section, align upward to the
4353 // alignment of the TLS segment, so that the overall size of the TLS
4354 // segment is aligned.
4357 uint64_t segment_align
= layout
->tls_segment()->maximum_alignment();
4358 *poff
= align_address(*poff
, segment_align
);
4361 this->memsz_
= *poff
- orig_off
;
4363 // Ignore the file offset adjustments made by the BSS Output_data
4370 // Set the addresses and file offsets in a list of Output_data
4374 Output_segment::set_section_list_addresses(Layout
* layout
, bool reset
,
4375 Output_data_list
* pdl
,
4376 uint64_t addr
, off_t
* poff
,
4377 unsigned int* pshndx
,
4380 off_t startoff
= *poff
;
4381 // For incremental updates, we may allocate non-fixed sections from
4382 // free space in the file. This keeps track of the high-water mark.
4383 off_t maxoff
= startoff
;
4385 off_t off
= startoff
;
4386 for (Output_data_list::iterator p
= pdl
->begin();
4391 (*p
)->reset_address_and_file_offset();
4393 // When doing an incremental update or when using a linker script,
4394 // the section will most likely already have an address.
4395 if (!(*p
)->is_address_valid())
4397 uint64_t align
= (*p
)->addralign();
4399 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
4401 // Give the first TLS section the alignment of the
4402 // entire TLS segment. Otherwise the TLS segment as a
4403 // whole may be misaligned.
4406 Output_segment
* tls_segment
= layout
->tls_segment();
4407 gold_assert(tls_segment
!= NULL
);
4408 uint64_t segment_align
= tls_segment
->maximum_alignment();
4409 gold_assert(segment_align
>= align
);
4410 align
= segment_align
;
4417 // If this is the first section after the TLS segment,
4418 // align it to at least the alignment of the TLS
4419 // segment, so that the size of the overall TLS segment
4423 uint64_t segment_align
=
4424 layout
->tls_segment()->maximum_alignment();
4425 if (segment_align
> align
)
4426 align
= segment_align
;
4432 if (!parameters
->incremental_update())
4434 off
= align_address(off
, align
);
4435 (*p
)->set_address_and_file_offset(addr
+ (off
- startoff
), off
);
4439 // Incremental update: allocate file space from free list.
4440 (*p
)->pre_finalize_data_size();
4441 off_t current_size
= (*p
)->current_data_size();
4442 off
= layout
->allocate(current_size
, align
, startoff
);
4445 gold_assert((*p
)->output_section() != NULL
);
4446 gold_fallback(_("out of patch space for section %s; "
4447 "relink with --incremental-full"),
4448 (*p
)->output_section()->name());
4450 (*p
)->set_address_and_file_offset(addr
+ (off
- startoff
), off
);
4451 if ((*p
)->data_size() > current_size
)
4453 gold_assert((*p
)->output_section() != NULL
);
4454 gold_fallback(_("%s: section changed size; "
4455 "relink with --incremental-full"),
4456 (*p
)->output_section()->name());
4460 else if (parameters
->incremental_update())
4462 // For incremental updates, use the fixed offset for the
4463 // high-water mark computation.
4464 off
= (*p
)->offset();
4468 // The script may have inserted a skip forward, but it
4469 // better not have moved backward.
4470 if ((*p
)->address() >= addr
+ (off
- startoff
))
4471 off
+= (*p
)->address() - (addr
+ (off
- startoff
));
4474 if (!layout
->script_options()->saw_sections_clause())
4478 Output_section
* os
= (*p
)->output_section();
4480 // Cast to unsigned long long to avoid format warnings.
4481 unsigned long long previous_dot
=
4482 static_cast<unsigned long long>(addr
+ (off
- startoff
));
4483 unsigned long long dot
=
4484 static_cast<unsigned long long>((*p
)->address());
4487 gold_error(_("dot moves backward in linker script "
4488 "from 0x%llx to 0x%llx"), previous_dot
, dot
);
4490 gold_error(_("address of section '%s' moves backward "
4491 "from 0x%llx to 0x%llx"),
4492 os
->name(), previous_dot
, dot
);
4495 (*p
)->set_file_offset(off
);
4496 (*p
)->finalize_data_size();
4499 if (parameters
->incremental_update())
4500 gold_debug(DEBUG_INCREMENTAL
,
4501 "set_section_list_addresses: %08lx %08lx %s",
4502 static_cast<long>(off
),
4503 static_cast<long>((*p
)->data_size()),
4504 ((*p
)->output_section() != NULL
4505 ? (*p
)->output_section()->name() : "(special)"));
4507 // We want to ignore the size of a SHF_TLS SHT_NOBITS
4508 // section. Such a section does not affect the size of a
4510 if (!(*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
4511 || !(*p
)->is_section_type(elfcpp::SHT_NOBITS
))
4512 off
+= (*p
)->data_size();
4517 if ((*p
)->is_section())
4519 (*p
)->set_out_shndx(*pshndx
);
4525 return addr
+ (maxoff
- startoff
);
4528 // For a non-PT_LOAD segment, set the offset from the sections, if
4529 // any. Add INCREASE to the file size and the memory size.
4532 Output_segment::set_offset(unsigned int increase
)
4534 gold_assert(this->type_
!= elfcpp::PT_LOAD
);
4536 gold_assert(!this->are_addresses_set_
);
4538 // A non-load section only uses output_lists_[0].
4540 Output_data_list
* pdl
= &this->output_lists_
[0];
4544 gold_assert(increase
== 0);
4547 this->are_addresses_set_
= true;
4549 this->min_p_align_
= 0;
4555 // Find the first and last section by address.
4556 const Output_data
* first
= NULL
;
4557 const Output_data
* last_data
= NULL
;
4558 const Output_data
* last_bss
= NULL
;
4559 for (Output_data_list::const_iterator p
= pdl
->begin();
4564 || (*p
)->address() < first
->address()
4565 || ((*p
)->address() == first
->address()
4566 && (*p
)->data_size() < first
->data_size()))
4568 const Output_data
** plast
;
4569 if ((*p
)->is_section()
4570 && (*p
)->output_section()->type() == elfcpp::SHT_NOBITS
)
4575 || (*p
)->address() > (*plast
)->address()
4576 || ((*p
)->address() == (*plast
)->address()
4577 && (*p
)->data_size() > (*plast
)->data_size()))
4581 this->vaddr_
= first
->address();
4582 this->paddr_
= (first
->has_load_address()
4583 ? first
->load_address()
4585 this->are_addresses_set_
= true;
4586 this->offset_
= first
->offset();
4588 if (last_data
== NULL
)
4591 this->filesz_
= (last_data
->address()
4592 + last_data
->data_size()
4595 const Output_data
* last
= last_bss
!= NULL
? last_bss
: last_data
;
4596 this->memsz_
= (last
->address()
4600 this->filesz_
+= increase
;
4601 this->memsz_
+= increase
;
4603 // If this is a RELRO segment, verify that the segment ends at a
4605 if (this->type_
== elfcpp::PT_GNU_RELRO
)
4607 uint64_t page_align
= parameters
->target().abi_pagesize();
4608 uint64_t segment_end
= this->vaddr_
+ this->memsz_
;
4609 if (parameters
->incremental_update())
4611 // The INCREASE_RELRO calculation is bypassed for an incremental
4612 // update, so we need to adjust the segment size manually here.
4613 segment_end
= align_address(segment_end
, page_align
);
4614 this->memsz_
= segment_end
- this->vaddr_
;
4617 gold_assert(segment_end
== align_address(segment_end
, page_align
));
4620 // If this is a TLS segment, align the memory size. The code in
4621 // set_section_list ensures that the section after the TLS segment
4622 // is aligned to give us room.
4623 if (this->type_
== elfcpp::PT_TLS
)
4625 uint64_t segment_align
= this->maximum_alignment();
4626 gold_assert(this->vaddr_
== align_address(this->vaddr_
, segment_align
));
4627 this->memsz_
= align_address(this->memsz_
, segment_align
);
4631 // Set the TLS offsets of the sections in the PT_TLS segment.
4634 Output_segment::set_tls_offsets()
4636 gold_assert(this->type_
== elfcpp::PT_TLS
);
4638 for (Output_data_list::iterator p
= this->output_lists_
[0].begin();
4639 p
!= this->output_lists_
[0].end();
4641 (*p
)->set_tls_offset(this->vaddr_
);
4644 // Return the first section.
4647 Output_segment::first_section() const
4649 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4651 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4652 for (Output_data_list::const_iterator p
= pdl
->begin();
4656 if ((*p
)->is_section())
4657 return (*p
)->output_section();
4663 // Return the number of Output_sections in an Output_segment.
4666 Output_segment::output_section_count() const
4668 unsigned int ret
= 0;
4669 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4670 ret
+= this->output_section_count_list(&this->output_lists_
[i
]);
4674 // Return the number of Output_sections in an Output_data_list.
4677 Output_segment::output_section_count_list(const Output_data_list
* pdl
) const
4679 unsigned int count
= 0;
4680 for (Output_data_list::const_iterator p
= pdl
->begin();
4684 if ((*p
)->is_section())
4690 // Return the section attached to the list segment with the lowest
4691 // load address. This is used when handling a PHDRS clause in a
4695 Output_segment::section_with_lowest_load_address() const
4697 Output_section
* found
= NULL
;
4698 uint64_t found_lma
= 0;
4699 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4700 this->lowest_load_address_in_list(&this->output_lists_
[i
], &found
,
4705 // Look through a list for a section with a lower load address.
4708 Output_segment::lowest_load_address_in_list(const Output_data_list
* pdl
,
4709 Output_section
** found
,
4710 uint64_t* found_lma
) const
4712 for (Output_data_list::const_iterator p
= pdl
->begin();
4716 if (!(*p
)->is_section())
4718 Output_section
* os
= static_cast<Output_section
*>(*p
);
4719 uint64_t lma
= (os
->has_load_address()
4720 ? os
->load_address()
4722 if (*found
== NULL
|| lma
< *found_lma
)
4730 // Write the segment data into *OPHDR.
4732 template<int size
, bool big_endian
>
4734 Output_segment::write_header(elfcpp::Phdr_write
<size
, big_endian
>* ophdr
)
4736 ophdr
->put_p_type(this->type_
);
4737 ophdr
->put_p_offset(this->offset_
);
4738 ophdr
->put_p_vaddr(this->vaddr_
);
4739 ophdr
->put_p_paddr(this->paddr_
);
4740 ophdr
->put_p_filesz(this->filesz_
);
4741 ophdr
->put_p_memsz(this->memsz_
);
4742 ophdr
->put_p_flags(this->flags_
);
4743 ophdr
->put_p_align(std::max(this->min_p_align_
, this->maximum_alignment()));
4746 // Write the section headers into V.
4748 template<int size
, bool big_endian
>
4750 Output_segment::write_section_headers(const Layout
* layout
,
4751 const Stringpool
* secnamepool
,
4753 unsigned int* pshndx
) const
4755 // Every section that is attached to a segment must be attached to a
4756 // PT_LOAD segment, so we only write out section headers for PT_LOAD
4758 if (this->type_
!= elfcpp::PT_LOAD
)
4761 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4763 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4764 v
= this->write_section_headers_list
<size
, big_endian
>(layout
,
4773 template<int size
, bool big_endian
>
4775 Output_segment::write_section_headers_list(const Layout
* layout
,
4776 const Stringpool
* secnamepool
,
4777 const Output_data_list
* pdl
,
4779 unsigned int* pshndx
) const
4781 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
4782 for (Output_data_list::const_iterator p
= pdl
->begin();
4786 if ((*p
)->is_section())
4788 const Output_section
* ps
= static_cast<const Output_section
*>(*p
);
4789 gold_assert(*pshndx
== ps
->out_shndx());
4790 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
4791 ps
->write_header(layout
, secnamepool
, &oshdr
);
4799 // Print the output sections to the map file.
4802 Output_segment::print_sections_to_mapfile(Mapfile
* mapfile
) const
4804 if (this->type() != elfcpp::PT_LOAD
)
4806 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4807 this->print_section_list_to_mapfile(mapfile
, &this->output_lists_
[i
]);
4810 // Print an output section list to the map file.
4813 Output_segment::print_section_list_to_mapfile(Mapfile
* mapfile
,
4814 const Output_data_list
* pdl
) const
4816 for (Output_data_list::const_iterator p
= pdl
->begin();
4819 (*p
)->print_to_mapfile(mapfile
);
4822 // Output_file methods.
4824 Output_file::Output_file(const char* name
)
4829 map_is_anonymous_(false),
4830 map_is_allocated_(false),
4831 is_temporary_(false)
4835 // Try to open an existing file. Returns false if the file doesn't
4836 // exist, has a size of 0 or can't be mmapped. If BASE_NAME is not
4837 // NULL, open that file as the base for incremental linking, and
4838 // copy its contents to the new output file. This routine can
4839 // be called for incremental updates, in which case WRITABLE should
4840 // be true, or by the incremental-dump utility, in which case
4841 // WRITABLE should be false.
4844 Output_file::open_base_file(const char* base_name
, bool writable
)
4846 // The name "-" means "stdout".
4847 if (strcmp(this->name_
, "-") == 0)
4850 bool use_base_file
= base_name
!= NULL
;
4852 base_name
= this->name_
;
4853 else if (strcmp(base_name
, this->name_
) == 0)
4854 gold_fatal(_("%s: incremental base and output file name are the same"),
4857 // Don't bother opening files with a size of zero.
4859 if (::stat(base_name
, &s
) != 0)
4861 gold_info(_("%s: stat: %s"), base_name
, strerror(errno
));
4866 gold_info(_("%s: incremental base file is empty"), base_name
);
4870 // If we're using a base file, we want to open it read-only.
4874 int oflags
= writable
? O_RDWR
: O_RDONLY
;
4875 int o
= open_descriptor(-1, base_name
, oflags
, 0);
4878 gold_info(_("%s: open: %s"), base_name
, strerror(errno
));
4882 // If the base file and the output file are different, open a
4883 // new output file and read the contents from the base file into
4884 // the newly-mapped region.
4887 this->open(s
.st_size
);
4888 ssize_t bytes_to_read
= s
.st_size
;
4889 unsigned char* p
= this->base_
;
4890 while (bytes_to_read
> 0)
4892 ssize_t len
= ::read(o
, p
, bytes_to_read
);
4895 gold_info(_("%s: read failed: %s"), base_name
, strerror(errno
));
4900 gold_info(_("%s: file too short: read only %lld of %lld bytes"),
4902 static_cast<long long>(s
.st_size
- bytes_to_read
),
4903 static_cast<long long>(s
.st_size
));
4907 bytes_to_read
-= len
;
4914 this->file_size_
= s
.st_size
;
4916 if (!this->map_no_anonymous(writable
))
4918 release_descriptor(o
, true);
4920 this->file_size_
= 0;
4927 // Open the output file.
4930 Output_file::open(off_t file_size
)
4932 this->file_size_
= file_size
;
4934 // Unlink the file first; otherwise the open() may fail if the file
4935 // is busy (e.g. it's an executable that's currently being executed).
4937 // However, the linker may be part of a system where a zero-length
4938 // file is created for it to write to, with tight permissions (gcc
4939 // 2.95 did something like this). Unlinking the file would work
4940 // around those permission controls, so we only unlink if the file
4941 // has a non-zero size. We also unlink only regular files to avoid
4942 // trouble with directories/etc.
4944 // If we fail, continue; this command is merely a best-effort attempt
4945 // to improve the odds for open().
4947 // We let the name "-" mean "stdout"
4948 if (!this->is_temporary_
)
4950 if (strcmp(this->name_
, "-") == 0)
4951 this->o_
= STDOUT_FILENO
;
4955 if (::stat(this->name_
, &s
) == 0
4956 && (S_ISREG (s
.st_mode
) || S_ISLNK (s
.st_mode
)))
4959 ::unlink(this->name_
);
4960 else if (!parameters
->options().relocatable())
4962 // If we don't unlink the existing file, add execute
4963 // permission where read permissions already exist
4964 // and where the umask permits.
4965 int mask
= ::umask(0);
4967 s
.st_mode
|= (s
.st_mode
& 0444) >> 2;
4968 ::chmod(this->name_
, s
.st_mode
& ~mask
);
4972 int mode
= parameters
->options().relocatable() ? 0666 : 0777;
4973 int o
= open_descriptor(-1, this->name_
, O_RDWR
| O_CREAT
| O_TRUNC
,
4976 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4984 // Resize the output file.
4987 Output_file::resize(off_t file_size
)
4989 // If the mmap is mapping an anonymous memory buffer, this is easy:
4990 // just mremap to the new size. If it's mapping to a file, we want
4991 // to unmap to flush to the file, then remap after growing the file.
4992 if (this->map_is_anonymous_
)
4995 if (!this->map_is_allocated_
)
4997 base
= ::mremap(this->base_
, this->file_size_
, file_size
,
4999 if (base
== MAP_FAILED
)
5000 gold_fatal(_("%s: mremap: %s"), this->name_
, strerror(errno
));
5004 base
= realloc(this->base_
, file_size
);
5007 if (file_size
> this->file_size_
)
5008 memset(static_cast<char*>(base
) + this->file_size_
, 0,
5009 file_size
- this->file_size_
);
5011 this->base_
= static_cast<unsigned char*>(base
);
5012 this->file_size_
= file_size
;
5017 this->file_size_
= file_size
;
5018 if (!this->map_no_anonymous(true))
5019 gold_fatal(_("%s: mmap: %s"), this->name_
, strerror(errno
));
5023 // Map an anonymous block of memory which will later be written to the
5024 // file. Return whether the map succeeded.
5027 Output_file::map_anonymous()
5029 void* base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
5030 MAP_PRIVATE
| MAP_ANONYMOUS
, -1, 0);
5031 if (base
== MAP_FAILED
)
5033 base
= malloc(this->file_size_
);
5036 memset(base
, 0, this->file_size_
);
5037 this->map_is_allocated_
= true;
5039 this->base_
= static_cast<unsigned char*>(base
);
5040 this->map_is_anonymous_
= true;
5044 // Map the file into memory. Return whether the mapping succeeded.
5045 // If WRITABLE is true, map with write access.
5048 Output_file::map_no_anonymous(bool writable
)
5050 const int o
= this->o_
;
5052 // If the output file is not a regular file, don't try to mmap it;
5053 // instead, we'll mmap a block of memory (an anonymous buffer), and
5054 // then later write the buffer to the file.
5056 struct stat statbuf
;
5057 if (o
== STDOUT_FILENO
|| o
== STDERR_FILENO
5058 || ::fstat(o
, &statbuf
) != 0
5059 || !S_ISREG(statbuf
.st_mode
)
5060 || this->is_temporary_
)
5063 // Ensure that we have disk space available for the file. If we
5064 // don't do this, it is possible that we will call munmap, close,
5065 // and exit with dirty buffers still in the cache with no assigned
5066 // disk blocks. If the disk is out of space at that point, the
5067 // output file will wind up incomplete, but we will have already
5068 // exited. The alternative to fallocate would be to use fdatasync,
5069 // but that would be a more significant performance hit.
5072 int err
= gold_fallocate(o
, 0, this->file_size_
);
5074 gold_fatal(_("%s: %s"), this->name_
, strerror(err
));
5077 // Map the file into memory.
5078 int prot
= PROT_READ
;
5081 base
= ::mmap(NULL
, this->file_size_
, prot
, MAP_SHARED
, o
, 0);
5083 // The mmap call might fail because of file system issues: the file
5084 // system might not support mmap at all, or it might not support
5085 // mmap with PROT_WRITE.
5086 if (base
== MAP_FAILED
)
5089 this->map_is_anonymous_
= false;
5090 this->base_
= static_cast<unsigned char*>(base
);
5094 // Map the file into memory.
5099 if (parameters
->options().mmap_output_file()
5100 && this->map_no_anonymous(true))
5103 // The mmap call might fail because of file system issues: the file
5104 // system might not support mmap at all, or it might not support
5105 // mmap with PROT_WRITE. I'm not sure which errno values we will
5106 // see in all cases, so if the mmap fails for any reason and we
5107 // don't care about file contents, try for an anonymous map.
5108 if (this->map_anonymous())
5111 gold_fatal(_("%s: mmap: failed to allocate %lu bytes for output file: %s"),
5112 this->name_
, static_cast<unsigned long>(this->file_size_
),
5116 // Unmap the file from memory.
5119 Output_file::unmap()
5121 if (this->map_is_anonymous_
)
5123 // We've already written out the data, so there is no reason to
5124 // waste time unmapping or freeing the memory.
5128 if (::munmap(this->base_
, this->file_size_
) < 0)
5129 gold_error(_("%s: munmap: %s"), this->name_
, strerror(errno
));
5134 // Close the output file.
5137 Output_file::close()
5139 // If the map isn't file-backed, we need to write it now.
5140 if (this->map_is_anonymous_
&& !this->is_temporary_
)
5142 size_t bytes_to_write
= this->file_size_
;
5144 while (bytes_to_write
> 0)
5146 ssize_t bytes_written
= ::write(this->o_
, this->base_
+ offset
,
5148 if (bytes_written
== 0)
5149 gold_error(_("%s: write: unexpected 0 return-value"), this->name_
);
5150 else if (bytes_written
< 0)
5151 gold_error(_("%s: write: %s"), this->name_
, strerror(errno
));
5154 bytes_to_write
-= bytes_written
;
5155 offset
+= bytes_written
;
5161 // We don't close stdout or stderr
5162 if (this->o_
!= STDOUT_FILENO
5163 && this->o_
!= STDERR_FILENO
5164 && !this->is_temporary_
)
5165 if (::close(this->o_
) < 0)
5166 gold_error(_("%s: close: %s"), this->name_
, strerror(errno
));
5170 // Instantiate the templates we need. We could use the configure
5171 // script to restrict this to only the ones for implemented targets.
5173 #ifdef HAVE_TARGET_32_LITTLE
5176 Output_section::add_input_section
<32, false>(
5178 Sized_relobj_file
<32, false>* object
,
5180 const char* secname
,
5181 const elfcpp::Shdr
<32, false>& shdr
,
5182 unsigned int reloc_shndx
,
5183 bool have_sections_script
);
5186 #ifdef HAVE_TARGET_32_BIG
5189 Output_section::add_input_section
<32, true>(
5191 Sized_relobj_file
<32, true>* object
,
5193 const char* secname
,
5194 const elfcpp::Shdr
<32, true>& shdr
,
5195 unsigned int reloc_shndx
,
5196 bool have_sections_script
);
5199 #ifdef HAVE_TARGET_64_LITTLE
5202 Output_section::add_input_section
<64, false>(
5204 Sized_relobj_file
<64, false>* object
,
5206 const char* secname
,
5207 const elfcpp::Shdr
<64, false>& shdr
,
5208 unsigned int reloc_shndx
,
5209 bool have_sections_script
);
5212 #ifdef HAVE_TARGET_64_BIG
5215 Output_section::add_input_section
<64, true>(
5217 Sized_relobj_file
<64, true>* object
,
5219 const char* secname
,
5220 const elfcpp::Shdr
<64, true>& shdr
,
5221 unsigned int reloc_shndx
,
5222 bool have_sections_script
);
5225 #ifdef HAVE_TARGET_32_LITTLE
5227 class Output_reloc
<elfcpp::SHT_REL
, false, 32, false>;
5230 #ifdef HAVE_TARGET_32_BIG
5232 class Output_reloc
<elfcpp::SHT_REL
, false, 32, true>;
5235 #ifdef HAVE_TARGET_64_LITTLE
5237 class Output_reloc
<elfcpp::SHT_REL
, false, 64, false>;
5240 #ifdef HAVE_TARGET_64_BIG
5242 class Output_reloc
<elfcpp::SHT_REL
, false, 64, true>;
5245 #ifdef HAVE_TARGET_32_LITTLE
5247 class Output_reloc
<elfcpp::SHT_REL
, true, 32, false>;
5250 #ifdef HAVE_TARGET_32_BIG
5252 class Output_reloc
<elfcpp::SHT_REL
, true, 32, true>;
5255 #ifdef HAVE_TARGET_64_LITTLE
5257 class Output_reloc
<elfcpp::SHT_REL
, true, 64, false>;
5260 #ifdef HAVE_TARGET_64_BIG
5262 class Output_reloc
<elfcpp::SHT_REL
, true, 64, true>;
5265 #ifdef HAVE_TARGET_32_LITTLE
5267 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
5270 #ifdef HAVE_TARGET_32_BIG
5272 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
5275 #ifdef HAVE_TARGET_64_LITTLE
5277 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
5280 #ifdef HAVE_TARGET_64_BIG
5282 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
5285 #ifdef HAVE_TARGET_32_LITTLE
5287 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
5290 #ifdef HAVE_TARGET_32_BIG
5292 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
5295 #ifdef HAVE_TARGET_64_LITTLE
5297 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
5300 #ifdef HAVE_TARGET_64_BIG
5302 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
5305 #ifdef HAVE_TARGET_32_LITTLE
5307 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, false>;
5310 #ifdef HAVE_TARGET_32_BIG
5312 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, true>;
5315 #ifdef HAVE_TARGET_64_LITTLE
5317 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, false>;
5320 #ifdef HAVE_TARGET_64_BIG
5322 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, true>;
5325 #ifdef HAVE_TARGET_32_LITTLE
5327 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, false>;
5330 #ifdef HAVE_TARGET_32_BIG
5332 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, true>;
5335 #ifdef HAVE_TARGET_64_LITTLE
5337 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, false>;
5340 #ifdef HAVE_TARGET_64_BIG
5342 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, true>;
5345 #ifdef HAVE_TARGET_32_LITTLE
5347 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
5350 #ifdef HAVE_TARGET_32_BIG
5352 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
5355 #ifdef HAVE_TARGET_64_LITTLE
5357 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
5360 #ifdef HAVE_TARGET_64_BIG
5362 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
5365 #ifdef HAVE_TARGET_32_LITTLE
5367 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
5370 #ifdef HAVE_TARGET_32_BIG
5372 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
5375 #ifdef HAVE_TARGET_64_LITTLE
5377 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
5380 #ifdef HAVE_TARGET_64_BIG
5382 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
5385 #ifdef HAVE_TARGET_32_LITTLE
5387 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, false>;
5390 #ifdef HAVE_TARGET_32_BIG
5392 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, true>;
5395 #ifdef HAVE_TARGET_64_LITTLE
5397 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, false>;
5400 #ifdef HAVE_TARGET_64_BIG
5402 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, true>;
5405 #ifdef HAVE_TARGET_32_LITTLE
5407 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, false>;
5410 #ifdef HAVE_TARGET_32_BIG
5412 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, true>;
5415 #ifdef HAVE_TARGET_64_LITTLE
5417 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, false>;
5420 #ifdef HAVE_TARGET_64_BIG
5422 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, true>;
5425 #ifdef HAVE_TARGET_32_LITTLE
5427 class Output_data_group
<32, false>;
5430 #ifdef HAVE_TARGET_32_BIG
5432 class Output_data_group
<32, true>;
5435 #ifdef HAVE_TARGET_64_LITTLE
5437 class Output_data_group
<64, false>;
5440 #ifdef HAVE_TARGET_64_BIG
5442 class Output_data_group
<64, true>;
5445 #ifdef HAVE_TARGET_32_LITTLE
5447 class Output_data_got
<32, false>;
5450 #ifdef HAVE_TARGET_32_BIG
5452 class Output_data_got
<32, true>;
5455 #ifdef HAVE_TARGET_64_LITTLE
5457 class Output_data_got
<64, false>;
5460 #ifdef HAVE_TARGET_64_BIG
5462 class Output_data_got
<64, true>;
5465 } // End namespace gold.