1 // output.cc -- manage the output file for gold
3 // Copyright (C) 2006-2016 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(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 this->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 or relative relocation.
855 template<bool dynamic, int size, bool big_endian>
856 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc(
861 : address_(address), local_sym_index_(0), type_(type),
862 is_relative_(is_relative), is_symbolless_(false),
863 is_section_symbol_(false), use_plt_offset_(false), shndx_(INVALID_CODE)
865 // this->type_ is a bitfield; make sure TYPE fits.
866 gold_assert(this->type_ == type);
867 this->u1_.relobj = NULL;
871 template<bool dynamic, int size, bool big_endian>
872 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc(
874 Sized_relobj<size, big_endian>* relobj,
878 : address_(address), local_sym_index_(0), type_(type),
879 is_relative_(is_relative), is_symbolless_(false),
880 is_section_symbol_(false), use_plt_offset_(false), shndx_(shndx)
882 gold_assert(shndx != INVALID_CODE);
883 // this->type_ is a bitfield; make sure TYPE fits.
884 gold_assert(this->type_ == type);
885 this->u1_.relobj = NULL;
886 this->u2_.relobj = relobj;
889 // A target specific relocation.
891 template<bool dynamic, int size, bool big_endian>
892 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc(
897 : address_(address), local_sym_index_(TARGET_CODE), type_(type),
898 is_relative_(false), is_symbolless_(false),
899 is_section_symbol_(false), use_plt_offset_(false), shndx_(INVALID_CODE)
901 // this->type_ is a bitfield; make sure TYPE fits.
902 gold_assert(this->type_ == type);
907 template<bool dynamic, int size, bool big_endian>
908 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::Output_reloc(
911 Sized_relobj<size, big_endian>* relobj,
914 : address_(address), local_sym_index_(TARGET_CODE), type_(type),
915 is_relative_(false), is_symbolless_(false),
916 is_section_symbol_(false), use_plt_offset_(false), shndx_(shndx)
918 gold_assert(shndx != INVALID_CODE);
919 // this->type_ is a bitfield; make sure TYPE fits.
920 gold_assert(this->type_ == type);
922 this->u2_.relobj = relobj;
925 // Record that we need a dynamic symbol index for this relocation.
927 template<bool dynamic, int size, bool big_endian>
929 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::
930 set_needs_dynsym_index()
932 if (this->is_symbolless_)
934 switch (this->local_sym_index_)
940 this->u1_.gsym->set_needs_dynsym_entry();
944 this->u1_.os->set_needs_dynsym_index();
948 // The target must take care of this if necessary.
956 const unsigned int lsi = this->local_sym_index_;
957 Sized_relobj_file<size, big_endian>* relobj =
958 this->u1_.relobj->sized_relobj();
959 gold_assert(relobj != NULL);
960 if (!this->is_section_symbol_)
961 relobj->set_needs_output_dynsym_entry(lsi);
963 relobj->output_section(lsi)->set_needs_dynsym_index();
969 // Get the symbol index of a relocation.
971 template<bool dynamic, int size, bool big_endian>
973 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::get_symbol_index()
977 if (this->is_symbolless_)
979 switch (this->local_sym_index_)
985 if (this->u1_.gsym == NULL)
988 index = this->u1_.gsym->dynsym_index();
990 index = this->u1_.gsym->symtab_index();
995 index = this->u1_.os->dynsym_index();
997 index = this->u1_.os->symtab_index();
1001 index = parameters->target().reloc_symbol_index(this->u1_.arg,
1006 // Relocations without symbols use a symbol index of 0.
1012 const unsigned int lsi = this->local_sym_index_;
1013 Sized_relobj_file<size, big_endian>* relobj =
1014 this->u1_.relobj->sized_relobj();
1015 gold_assert(relobj != NULL);
1016 if (!this->is_section_symbol_)
1019 index = relobj->dynsym_index(lsi);
1021 index = relobj->symtab_index(lsi);
1025 Output_section* os = relobj->output_section(lsi);
1026 gold_assert(os != NULL);
1028 index = os->dynsym_index();
1030 index = os->symtab_index();
1035 gold_assert(index != -1U);
1039 // For a local section symbol, get the address of the offset ADDEND
1040 // within the input section.
1042 template<bool dynamic, int size, bool big_endian>
1043 typename elfcpp::Elf_types<size>::Elf_Addr
1044 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::
1045 local_section_offset(Addend addend) const
1047 gold_assert(this->local_sym_index_ != GSYM_CODE
1048 && this->local_sym_index_ != SECTION_CODE
1049 && this->local_sym_index_ != TARGET_CODE
1050 && this->local_sym_index_ != INVALID_CODE
1051 && this->local_sym_index_ != 0
1052 && this->is_section_symbol_);
1053 const unsigned int lsi = this->local_sym_index_;
1054 Output_section* os = this->u1_.relobj->output_section(lsi);
1055 gold_assert(os != NULL);
1056 Address offset = this->u1_.relobj->get_output_section_offset(lsi);
1057 if (offset != invalid_address)
1058 return offset + addend;
1059 // This is a merge section.
1060 Sized_relobj_file<size, big_endian>* relobj =
1061 this->u1_.relobj->sized_relobj();
1062 gold_assert(relobj != NULL);
1063 offset = os->output_address(relobj, lsi, addend);
1064 gold_assert(offset != invalid_address);
1068 // Get the output address of a relocation.
1070 template<bool dynamic, int size, bool big_endian>
1071 typename elfcpp::Elf_types<size>::Elf_Addr
1072 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::get_address() const
1074 Address address = this->address_;
1075 if (this->shndx_ != INVALID_CODE)
1077 Output_section* os = this->u2_.relobj->output_section(this->shndx_);
1078 gold_assert(os != NULL);
1079 Address off = this->u2_.relobj->get_output_section_offset(this->shndx_);
1080 if (off != invalid_address)
1081 address += os->address() + off;
1084 Sized_relobj_file<size, big_endian>* relobj =
1085 this->u2_.relobj->sized_relobj();
1086 gold_assert(relobj != NULL);
1087 address = os->output_address(relobj, this->shndx_, address);
1088 gold_assert(address != invalid_address);
1091 else if (this->u2_.od != NULL)
1092 address += this->u2_.od->address();
1096 // Write out the offset and info fields of a Rel or Rela relocation
1099 template<bool dynamic, int size, bool big_endian>
1100 template<typename Write_rel>
1102 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::write_rel(
1103 Write_rel* wr) const
1105 wr->put_r_offset(this->get_address());
1106 unsigned int sym_index = this->get_symbol_index();
1107 wr->put_r_info(elfcpp::elf_r_info<size>(sym_index, this->type_));
1110 // Write out a Rel relocation.
1112 template<bool dynamic, int size, bool big_endian>
1114 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::write(
1115 unsigned char* pov) const
1117 elfcpp::Rel_write<size, big_endian> orel(pov);
1118 this->write_rel(&orel);
1121 // Get the value of the symbol referred to by a Rel relocation.
1123 template<bool dynamic, int size, bool big_endian>
1124 typename elfcpp::Elf_types<size>::Elf_Addr
1125 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::symbol_value(
1126 Addend addend) const
1128 if (this->local_sym_index_ == GSYM_CODE)
1130 const Sized_symbol<size>* sym;
1131 sym = static_cast<const Sized_symbol<size>*>(this->u1_.gsym);
1132 if (this->use_plt_offset_ && sym->has_plt_offset())
1133 return parameters->target().plt_address_for_global(sym);
1135 return sym->value() + addend;
1137 if (this->local_sym_index_ == SECTION_CODE)
1139 gold_assert(!this->use_plt_offset_);
1140 return this->u1_.os->address() + addend;
1142 gold_assert(this->local_sym_index_ != TARGET_CODE
1143 && this->local_sym_index_ != INVALID_CODE
1144 && this->local_sym_index_ != 0
1145 && !this->is_section_symbol_);
1146 const unsigned int lsi = this->local_sym_index_;
1147 Sized_relobj_file<size, big_endian>* relobj =
1148 this->u1_.relobj->sized_relobj();
1149 gold_assert(relobj != NULL);
1150 if (this->use_plt_offset_)
1151 return parameters->target().plt_address_for_local(relobj, lsi);
1152 const Symbol_value<size>* symval = relobj->local_symbol(lsi);
1153 return symval->value(relobj, addend);
1156 // Reloc comparison. This function sorts the dynamic relocs for the
1157 // benefit of the dynamic linker. First we sort all relative relocs
1158 // to the front. Among relative relocs, we sort by output address.
1159 // Among non-relative relocs, we sort by symbol index, then by output
1162 template<bool dynamic, int size, bool big_endian>
1164 Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>::
1165 compare(const Output_reloc<elfcpp::SHT_REL, dynamic, size, big_endian>& r2)
1168 if (this->is_relative_)
1170 if (!r2.is_relative_)
1172 // Otherwise sort by reloc address below.
1174 else if (r2.is_relative_)
1178 unsigned int sym1 = this->get_symbol_index();
1179 unsigned int sym2 = r2.get_symbol_index();
1182 else if (sym1 > sym2)
1184 // Otherwise sort by reloc address.
1187 section_offset_type addr1 = this->get_address();
1188 section_offset_type addr2 = r2.get_address();
1191 else if (addr1 > addr2)
1194 // Final tie breaker, in order to generate the same output on any
1195 // host: reloc type.
1196 unsigned int type1 = this->type_;
1197 unsigned int type2 = r2.type_;
1200 else if (type1 > type2)
1203 // These relocs appear to be exactly the same.
1207 // Write out a Rela relocation.
1209 template<bool dynamic, int size, bool big_endian>
1211 Output_reloc<elfcpp::SHT_RELA, dynamic, size, big_endian>::write(
1212 unsigned char* pov) const
1214 elfcpp::Rela_write<size, big_endian> orel(pov);
1215 this->rel_.write_rel(&orel);
1216 Addend addend = this->addend_;
1217 if (this->rel_.is_target_specific())
1218 addend = parameters->target().reloc_addend(this->rel_.target_arg(),
1219 this->rel_.type(), addend);
1220 else if (this->rel_.is_symbolless())
1221 addend = this->rel_.symbol_value(addend);
1222 else if (this->rel_.is_local_section_symbol())
1223 addend = this->rel_.local_section_offset(addend);
1224 orel.put_r_addend(addend);
1227 // Output_data_reloc_base methods.
1229 // Adjust the output section.
1231 template<int sh_type, bool dynamic, int size, bool big_endian>
1233 Output_data_reloc_base<sh_type, dynamic, size, big_endian>
1234 ::do_adjust_output_section(Output_section* os)
1236 if (sh_type == elfcpp::SHT_REL)
1237 os->set_entsize(elfcpp::Elf_sizes<size>::rel_size);
1238 else if (sh_type == elfcpp::SHT_RELA)
1239 os->set_entsize(elfcpp::Elf_sizes<size>::rela_size);
1243 // A STT_GNU_IFUNC symbol may require a IRELATIVE reloc when doing a
1244 // static link. The backends will generate a dynamic reloc section
1245 // to hold this. In that case we don't want to link to the dynsym
1246 // section, because there isn't one.
1248 os->set_should_link_to_symtab();
1249 else if (parameters->doing_static_link())
1252 os->set_should_link_to_dynsym();
1255 // Standard relocation writer, which just calls Output_reloc::write().
1257 template<int sh_type, bool dynamic, int size, bool big_endian>
1258 struct Output_reloc_writer
1260 typedef Output_reloc<sh_type, dynamic, size, big_endian> Output_reloc_type;
1261 typedef std::vector<Output_reloc_type> Relocs;
1264 write(typename Relocs::const_iterator p, unsigned char* pov)
1268 // Write out relocation data.
1270 template<int sh_type, bool dynamic, int size, bool big_endian>
1272 Output_data_reloc_base<sh_type, dynamic, size, big_endian>::do_write(
1275 typedef Output_reloc_writer<sh_type, dynamic, size, big_endian> Writer;
1276 this->do_write_generic<Writer>(of);
1279 // Class Output_relocatable_relocs.
1281 template<int sh_type, int size, bool big_endian>
1283 Output_relocatable_relocs<sh_type, size, big_endian>::set_final_data_size()
1285 this->set_data_size(this->rr_->output_reloc_count()
1286 * Reloc_types<sh_type, size, big_endian>::reloc_size);
1289 // class Output_data_group.
1291 template<int size, bool big_endian>
1292 Output_data_group<size, big_endian>::Output_data_group(
1293 Sized_relobj_file<size, big_endian>* relobj,
1294 section_size_type entry_count,
1295 elfcpp::Elf_Word flags,
1296 std::vector<unsigned int>* input_shndxes)
1297 : Output_section_data(entry_count * 4, 4, false),
1301 this->input_shndxes_.swap(*input_shndxes);
1304 // Write out the section group, which means translating the section
1305 // indexes to apply to the output file.
1307 template<int size, bool big_endian>
1309 Output_data_group<size, big_endian>::do_write(Output_file* of)
1311 const off_t off = this->offset();
1312 const section_size_type oview_size =
1313 convert_to_section_size_type(this->data_size());
1314 unsigned char* const oview = of->get_output_view(off, oview_size);
1316 elfcpp::Elf_Word* contents = reinterpret_cast<elfcpp::Elf_Word*>(oview);
1317 elfcpp::Swap<32, big_endian>::writeval(contents, this->flags_);
1320 for (std::vector<unsigned int>::const_iterator p =
1321 this->input_shndxes_.begin();
1322 p != this->input_shndxes_.end();
1325 Output_section* os = this->relobj_->output_section(*p);
1327 unsigned int output_shndx;
1329 output_shndx = os->out_shndx();
1332 this->relobj_->error(_("section group retained but "
1333 "group element discarded"));
1337 elfcpp::Swap<32, big_endian>::writeval(contents, output_shndx);
1340 size_t wrote = reinterpret_cast<unsigned char*>(contents) - oview;
1341 gold_assert(wrote == oview_size);
1343 of->write_output_view(off, oview_size, oview);
1345 // We no longer need this information.
1346 this->input_shndxes_.clear();
1349 // Output_data_got::Got_entry methods.
1351 // Write out the entry.
1353 template<int got_size, bool big_endian>
1355 Output_data_got<got_size, big_endian>::Got_entry::write(
1356 unsigned int got_indx,
1357 unsigned char* pov) const
1361 switch (this->local_sym_index_)
1365 // If the symbol is resolved locally, we need to write out the
1366 // link-time value, which will be relocated dynamically by a
1367 // RELATIVE relocation.
1368 Symbol* gsym = this->u_.gsym;
1369 if (this->use_plt_or_tls_offset_ && gsym->has_plt_offset())
1370 val = parameters->target().plt_address_for_global(gsym);
1373 switch (parameters->size_and_endianness())
1375 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
1376 case Parameters::TARGET_32_LITTLE:
1377 case Parameters::TARGET_32_BIG:
1379 // This cast is ugly. We don't want to put a
1380 // virtual method in Symbol, because we want Symbol
1381 // to be as small as possible.
1382 Sized_symbol<32>::Value_type v;
1383 v = static_cast<Sized_symbol<32>*>(gsym)->value();
1384 val = convert_types<Valtype, Sized_symbol<32>::Value_type>(v);
1388 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
1389 case Parameters::TARGET_64_LITTLE:
1390 case Parameters::TARGET_64_BIG:
1392 Sized_symbol<64>::Value_type v;
1393 v = static_cast<Sized_symbol<64>*>(gsym)->value();
1394 val = convert_types<Valtype, Sized_symbol<64>::Value_type>(v);
1401 if (this->use_plt_or_tls_offset_
1402 && gsym->type() == elfcpp::STT_TLS)
1403 val += parameters->target().tls_offset_for_global(gsym,
1410 val = this->u_.constant;
1414 // If we're doing an incremental update, don't touch this GOT entry.
1415 if (parameters->incremental_update())
1417 val = this->u_.constant;
1422 const Relobj* object = this->u_.object;
1423 const unsigned int lsi = this->local_sym_index_;
1424 bool is_tls = object->local_is_tls(lsi);
1425 if (this->use_plt_or_tls_offset_ && !is_tls)
1426 val = parameters->target().plt_address_for_local(object, lsi);
1429 uint64_t lval = object->local_symbol_value(lsi, this->addend_);
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<got_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 got_size, bool big_endian>
1450 Output_data_got<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 got_size, bool big_endian>
1466 Output_data_got<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 got_size, bool big_endian>
1482 Output_data_got<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 got_size, bool big_endian>
1501 Output_data_got<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 + got_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 got_size, bool big_endian>
1526 Output_data_got<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 // Add an entry for a local symbol plus ADDEND to the GOT. This returns
1541 // true if this is a new GOT entry, false if the symbol already has a GOT
1544 template<int got_size, bool big_endian>
1546 Output_data_got<got_size, big_endian>::add_local(
1548 unsigned int symndx,
1549 unsigned int got_type,
1552 if (object->local_has_got_offset(symndx, got_type, addend))
1555 unsigned int got_offset = this->add_got_entry(Got_entry(object, symndx,
1557 object->set_local_got_offset(symndx, got_type, got_offset, addend);
1561 // Like add_local, but use the PLT offset.
1563 template<int got_size, bool big_endian>
1565 Output_data_got<got_size, big_endian>::add_local_plt(
1567 unsigned int symndx,
1568 unsigned int got_type)
1570 if (object->local_has_got_offset(symndx, got_type))
1573 unsigned int got_offset = this->add_got_entry(Got_entry(object, symndx,
1575 object->set_local_got_offset(symndx, got_type, got_offset);
1579 // Add an entry for a local symbol to the GOT, and add a dynamic
1580 // relocation of type R_TYPE for the GOT entry.
1582 template<int got_size, bool big_endian>
1584 Output_data_got<got_size, big_endian>::add_local_with_rel(
1586 unsigned int symndx,
1587 unsigned int got_type,
1588 Output_data_reloc_generic* rel_dyn,
1589 unsigned int r_type)
1591 if (object->local_has_got_offset(symndx, got_type))
1594 unsigned int got_offset = this->add_got_entry(Got_entry());
1595 object->set_local_got_offset(symndx, got_type, got_offset);
1596 rel_dyn->add_local_generic(object, symndx, r_type, this, got_offset, 0);
1599 // Add an entry for a local symbol plus ADDEND to the GOT, and add a dynamic
1600 // relocation of type R_TYPE for the GOT entry.
1602 template<int got_size, bool big_endian>
1604 Output_data_got<got_size, big_endian>::add_local_with_rel(
1606 unsigned int symndx,
1607 unsigned int got_type,
1608 Output_data_reloc_generic* rel_dyn,
1609 unsigned int r_type, uint64_t addend)
1611 if (object->local_has_got_offset(symndx, got_type, addend))
1614 unsigned int got_offset = this->add_got_entry(Got_entry());
1615 object->set_local_got_offset(symndx, got_type, got_offset, addend);
1616 rel_dyn->add_local_generic(object, symndx, r_type, this, got_offset,
1620 // Add a pair of entries for a local symbol to the GOT, and add
1621 // a dynamic relocation of type R_TYPE using the section symbol of
1622 // the output section to which input section SHNDX maps, on the first.
1623 // The first got entry will have a value of zero, the second the
1624 // value of the local symbol.
1625 template<int got_size, bool big_endian>
1627 Output_data_got<got_size, big_endian>::add_local_pair_with_rel(
1629 unsigned int symndx,
1631 unsigned int got_type,
1632 Output_data_reloc_generic* rel_dyn,
1633 unsigned int r_type)
1635 if (object->local_has_got_offset(symndx, got_type))
1638 unsigned int got_offset =
1639 this->add_got_entry_pair(Got_entry(),
1640 Got_entry(object, symndx, false));
1641 object->set_local_got_offset(symndx, got_type, got_offset);
1642 Output_section* os = object->output_section(shndx);
1643 rel_dyn->add_output_section_generic(os, r_type, this, got_offset, 0);
1646 // Add a pair of entries for a local symbol plus ADDEND to the GOT, and add
1647 // a dynamic relocation of type R_TYPE using the section symbol of
1648 // the output section to which input section SHNDX maps, on the first.
1649 // The first got entry will have a value of zero, the second the
1650 // value of the local symbol.
1651 template<int got_size, bool big_endian>
1653 Output_data_got<got_size, big_endian>::add_local_pair_with_rel(
1655 unsigned int symndx,
1657 unsigned int got_type,
1658 Output_data_reloc_generic* rel_dyn,
1659 unsigned int r_type, uint64_t addend)
1661 if (object->local_has_got_offset(symndx, got_type, addend))
1664 unsigned int got_offset =
1665 this->add_got_entry_pair(Got_entry(),
1666 Got_entry(object, symndx, false, addend));
1667 object->set_local_got_offset(symndx, got_type, got_offset, addend);
1668 Output_section* os = object->output_section(shndx);
1669 rel_dyn->add_output_section_generic(os, r_type, this, got_offset, addend);
1672 // Add a pair of entries for a local symbol to the GOT, and add
1673 // a dynamic relocation of type R_TYPE using STN_UNDEF on the first.
1674 // The first got entry will have a value of zero, the second the
1675 // value of the local symbol offset by Target::tls_offset_for_local.
1676 template<int got_size, bool big_endian>
1678 Output_data_got<got_size, big_endian>::add_local_tls_pair(
1680 unsigned int symndx,
1681 unsigned int got_type,
1682 Output_data_reloc_generic* rel_dyn,
1683 unsigned int r_type)
1685 if (object->local_has_got_offset(symndx, got_type))
1688 unsigned int got_offset
1689 = this->add_got_entry_pair(Got_entry(),
1690 Got_entry(object, symndx, true));
1691 object->set_local_got_offset(symndx, got_type, got_offset);
1692 rel_dyn->add_local_generic(object, 0, r_type, this, got_offset, 0);
1695 // Reserve a slot in the GOT for a local symbol or the second slot of a pair.
1697 template<int got_size, bool big_endian>
1699 Output_data_got<got_size, big_endian>::reserve_local(
1702 unsigned int sym_index,
1703 unsigned int got_type)
1705 this->do_reserve_slot(i);
1706 object->set_local_got_offset(sym_index, got_type, this->got_offset(i));
1709 // Reserve a slot in the GOT for a global symbol.
1711 template<int got_size, bool big_endian>
1713 Output_data_got<got_size, big_endian>::reserve_global(
1716 unsigned int got_type)
1718 this->do_reserve_slot(i);
1719 gsym->set_got_offset(got_type, this->got_offset(i));
1722 // Write out the GOT.
1724 template<int got_size, bool big_endian>
1726 Output_data_got<got_size, big_endian>::do_write(Output_file* of)
1728 const int add = got_size / 8;
1730 const off_t off = this->offset();
1731 const off_t oview_size = this->data_size();
1732 unsigned char* const oview = of->get_output_view(off, oview_size);
1734 unsigned char* pov = oview;
1735 for (unsigned int i = 0; i < this->entries_.size(); ++i)
1737 this->entries_[i].write(i, pov);
1741 gold_assert(pov - oview == oview_size);
1743 of->write_output_view(off, oview_size, oview);
1745 // We no longer need the GOT entries.
1746 this->entries_.clear();
1749 // Create a new GOT entry and return its offset.
1751 template<int got_size, bool big_endian>
1753 Output_data_got<got_size, big_endian>::add_got_entry(Got_entry got_entry)
1755 if (!this->is_data_size_valid())
1757 this->entries_.push_back(got_entry);
1758 this->set_got_size();
1759 return this->last_got_offset();
1763 // For an incremental update, find an available slot.
1764 off_t got_offset = this->free_list_.allocate(got_size / 8,
1766 if (got_offset == -1)
1767 gold_fallback(_("out of patch space (GOT);"
1768 " relink with --incremental-full"));
1769 unsigned int got_index = got_offset / (got_size / 8);
1770 gold_assert(got_index < this->entries_.size());
1771 this->entries_[got_index] = got_entry;
1772 return static_cast<unsigned int>(got_offset);
1776 // Create a pair of new GOT entries and return the offset of the first.
1778 template<int got_size, bool big_endian>
1780 Output_data_got<got_size, big_endian>::add_got_entry_pair(
1781 Got_entry got_entry_1,
1782 Got_entry got_entry_2)
1784 if (!this->is_data_size_valid())
1786 unsigned int got_offset;
1787 this->entries_.push_back(got_entry_1);
1788 got_offset = this->last_got_offset();
1789 this->entries_.push_back(got_entry_2);
1790 this->set_got_size();
1795 // For an incremental update, find an available pair of slots.
1796 off_t got_offset = this->free_list_.allocate(2 * got_size / 8,
1798 if (got_offset == -1)
1799 gold_fallback(_("out of patch space (GOT);"
1800 " relink with --incremental-full"));
1801 unsigned int got_index = got_offset / (got_size / 8);
1802 gold_assert(got_index < this->entries_.size());
1803 this->entries_[got_index] = got_entry_1;
1804 this->entries_[got_index + 1] = got_entry_2;
1805 return static_cast<unsigned int>(got_offset);
1809 // Replace GOT entry I with a new value.
1811 template<int got_size, bool big_endian>
1813 Output_data_got<got_size, big_endian>::replace_got_entry(
1815 Got_entry got_entry)
1817 gold_assert(i < this->entries_.size());
1818 this->entries_[i] = got_entry;
1821 // Output_data_dynamic::Dynamic_entry methods.
1823 // Write out the entry.
1825 template<int size, bool big_endian>
1827 Output_data_dynamic::Dynamic_entry::write(
1829 const Stringpool* pool) const
1831 typename elfcpp::Elf_types<size>::Elf_WXword val;
1832 switch (this->offset_)
1834 case DYNAMIC_NUMBER:
1838 case DYNAMIC_SECTION_SIZE:
1839 val = this->u_.od->data_size();
1840 if (this->od2 != NULL)
1841 val += this->od2->data_size();
1844 case DYNAMIC_SYMBOL:
1846 const Sized_symbol<size>* s =
1847 static_cast<const Sized_symbol<size>*>(this->u_.sym);
1852 case DYNAMIC_STRING:
1853 val = pool->get_offset(this->u_.str);
1856 case DYNAMIC_CUSTOM:
1857 val = parameters->target().dynamic_tag_custom_value(this->tag_);
1861 val = this->u_.od->address() + this->offset_;
1865 elfcpp::Dyn_write<size, big_endian> dw(pov);
1866 dw.put_d_tag(this->tag_);
1870 // Output_data_dynamic methods.
1872 // Adjust the output section to set the entry size.
1875 Output_data_dynamic::do_adjust_output_section(Output_section* os)
1877 if (parameters->target().get_size() == 32)
1878 os->set_entsize(elfcpp::Elf_sizes<32>::dyn_size);
1879 else if (parameters->target().get_size() == 64)
1880 os->set_entsize(elfcpp::Elf_sizes<64>::dyn_size);
1885 // Set the final data size.
1888 Output_data_dynamic::set_final_data_size()
1890 // Add the terminating entry if it hasn't been added.
1891 // Because of relaxation, we can run this multiple times.
1892 if (this->entries_.empty() || this->entries_.back().tag() != elfcpp::DT_NULL)
1894 int extra = parameters->options().spare_dynamic_tags();
1895 for (int i = 0; i < extra; ++i)
1896 this->add_constant(elfcpp::DT_NULL, 0);
1897 this->add_constant(elfcpp::DT_NULL, 0);
1901 if (parameters->target().get_size() == 32)
1902 dyn_size = elfcpp::Elf_sizes<32>::dyn_size;
1903 else if (parameters->target().get_size() == 64)
1904 dyn_size = elfcpp::Elf_sizes<64>::dyn_size;
1907 this->set_data_size(this->entries_.size() * dyn_size);
1910 // Write out the dynamic entries.
1913 Output_data_dynamic::do_write(Output_file* of)
1915 switch (parameters->size_and_endianness())
1917 #ifdef HAVE_TARGET_32_LITTLE
1918 case Parameters::TARGET_32_LITTLE:
1919 this->sized_write<32, false>(of);
1922 #ifdef HAVE_TARGET_32_BIG
1923 case Parameters::TARGET_32_BIG:
1924 this->sized_write<32, true>(of);
1927 #ifdef HAVE_TARGET_64_LITTLE
1928 case Parameters::TARGET_64_LITTLE:
1929 this->sized_write<64, false>(of);
1932 #ifdef HAVE_TARGET_64_BIG
1933 case Parameters::TARGET_64_BIG:
1934 this->sized_write<64, true>(of);
1942 template<int size, bool big_endian>
1944 Output_data_dynamic::sized_write(Output_file* of)
1946 const int dyn_size = elfcpp::Elf_sizes<size>::dyn_size;
1948 const off_t offset = this->offset();
1949 const off_t oview_size = this->data_size();
1950 unsigned char* const oview = of->get_output_view(offset, oview_size);
1952 unsigned char* pov = oview;
1953 for (typename Dynamic_entries::const_iterator p = this->entries_.begin();
1954 p != this->entries_.end();
1957 p->write<size, big_endian>(pov, this->pool_);
1961 gold_assert(pov - oview == oview_size);
1963 of->write_output_view(offset, oview_size, oview);
1965 // We no longer need the dynamic entries.
1966 this->entries_.clear();
1969 // Class Output_symtab_xindex.
1972 Output_symtab_xindex::do_write(Output_file* of)
1974 const off_t offset = this->offset();
1975 const off_t oview_size = this->data_size();
1976 unsigned char* const oview = of->get_output_view(offset, oview_size);
1978 memset(oview, 0, oview_size);
1980 if (parameters->target().is_big_endian())
1981 this->endian_do_write<true>(oview);
1983 this->endian_do_write<false>(oview);
1985 of->write_output_view(offset, oview_size, oview);
1987 // We no longer need the data.
1988 this->entries_.clear();
1991 template<bool big_endian>
1993 Output_symtab_xindex::endian_do_write(unsigned char* const oview)
1995 for (Xindex_entries::const_iterator p = this->entries_.begin();
1996 p != this->entries_.end();
1999 unsigned int symndx = p->first;
2000 gold_assert(static_cast<off_t>(symndx) * 4 < this->data_size());
2001 elfcpp::Swap<32, big_endian>::writeval(oview + symndx * 4, p->second);
2005 // Output_fill_debug_info methods.
2007 // Return the minimum size needed for a dummy compilation unit header.
2010 Output_fill_debug_info::do_minimum_hole_size() const
2012 // Compile unit header fields: unit_length, version, debug_abbrev_offset,
2014 const size_t len = 4 + 2 + 4 + 1;
2015 // For type units, add type_signature, type_offset.
2016 if (this->is_debug_types_)
2021 // Write a dummy compilation unit header to fill a hole in the
2022 // .debug_info or .debug_types section.
2025 Output_fill_debug_info::do_write(Output_file* of, off_t off, size_t len) const
2027 gold_debug(DEBUG_INCREMENTAL, "fill_debug_info(%08lx, %08lx)",
2028 static_cast<long>(off), static_cast<long>(len));
2030 gold_assert(len >= this->do_minimum_hole_size());
2032 unsigned char* const oview = of->get_output_view(off, len);
2033 unsigned char* pov = oview;
2035 // Write header fields: unit_length, version, debug_abbrev_offset,
2037 if (this->is_big_endian())
2039 elfcpp::Swap_unaligned<32, true>::writeval(pov, len - 4);
2040 elfcpp::Swap_unaligned<16, true>::writeval(pov + 4, this->version);
2041 elfcpp::Swap_unaligned<32, true>::writeval(pov + 6, 0);
2045 elfcpp::Swap_unaligned<32, false>::writeval(pov, len - 4);
2046 elfcpp::Swap_unaligned<16, false>::writeval(pov + 4, this->version);
2047 elfcpp::Swap_unaligned<32, false>::writeval(pov + 6, 0);
2052 // For type units, the additional header fields -- type_signature,
2053 // type_offset -- can be filled with zeroes.
2055 // Fill the remainder of the free space with zeroes. The first
2056 // zero should tell the consumer there are no DIEs to read in this
2057 // compilation unit.
2058 if (pov < oview + len)
2059 memset(pov, 0, oview + len - pov);
2061 of->write_output_view(off, len, oview);
2064 // Output_fill_debug_line methods.
2066 // Return the minimum size needed for a dummy line number program header.
2069 Output_fill_debug_line::do_minimum_hole_size() const
2071 // Line number program header fields: unit_length, version, header_length,
2072 // minimum_instruction_length, default_is_stmt, line_base, line_range,
2073 // opcode_base, standard_opcode_lengths[], include_directories, filenames.
2074 const size_t len = 4 + 2 + 4 + this->header_length;
2078 // Write a dummy line number program header to fill a hole in the
2079 // .debug_line section.
2082 Output_fill_debug_line::do_write(Output_file* of, off_t off, size_t len) const
2084 gold_debug(DEBUG_INCREMENTAL, "fill_debug_line(%08lx, %08lx)",
2085 static_cast<long>(off), static_cast<long>(len));
2087 gold_assert(len >= this->do_minimum_hole_size());
2089 unsigned char* const oview = of->get_output_view(off, len);
2090 unsigned char* pov = oview;
2092 // Write header fields: unit_length, version, header_length,
2093 // minimum_instruction_length, default_is_stmt, line_base, line_range,
2094 // opcode_base, standard_opcode_lengths[], include_directories, filenames.
2095 // We set the header_length field to cover the entire hole, so the
2096 // line number program is empty.
2097 if (this->is_big_endian())
2099 elfcpp::Swap_unaligned<32, true>::writeval(pov, len - 4);
2100 elfcpp::Swap_unaligned<16, true>::writeval(pov + 4, this->version);
2101 elfcpp::Swap_unaligned<32, true>::writeval(pov + 6, len - (4 + 2 + 4));
2105 elfcpp::Swap_unaligned<32, false>::writeval(pov, len - 4);
2106 elfcpp::Swap_unaligned<16, false>::writeval(pov + 4, this->version);
2107 elfcpp::Swap_unaligned<32, false>::writeval(pov + 6, len - (4 + 2 + 4));
2110 *pov++ = 1; // minimum_instruction_length
2111 *pov++ = 0; // default_is_stmt
2112 *pov++ = 0; // line_base
2113 *pov++ = 5; // line_range
2114 *pov++ = 13; // opcode_base
2115 *pov++ = 0; // standard_opcode_lengths[1]
2116 *pov++ = 1; // standard_opcode_lengths[2]
2117 *pov++ = 1; // standard_opcode_lengths[3]
2118 *pov++ = 1; // standard_opcode_lengths[4]
2119 *pov++ = 1; // standard_opcode_lengths[5]
2120 *pov++ = 0; // standard_opcode_lengths[6]
2121 *pov++ = 0; // standard_opcode_lengths[7]
2122 *pov++ = 0; // standard_opcode_lengths[8]
2123 *pov++ = 1; // standard_opcode_lengths[9]
2124 *pov++ = 0; // standard_opcode_lengths[10]
2125 *pov++ = 0; // standard_opcode_lengths[11]
2126 *pov++ = 1; // standard_opcode_lengths[12]
2127 *pov++ = 0; // include_directories (empty)
2128 *pov++ = 0; // filenames (empty)
2130 // Some consumers don't check the header_length field, and simply
2131 // start reading the line number program immediately following the
2132 // header. For those consumers, we fill the remainder of the free
2133 // space with DW_LNS_set_basic_block opcodes. These are effectively
2134 // no-ops: the resulting line table program will not create any rows.
2135 if (pov < oview + len)
2136 memset(pov, elfcpp::DW_LNS_set_basic_block, oview + len - pov);
2138 of->write_output_view(off, len, oview);
2141 // Output_section::Input_section methods.
2143 // Return the current data size. For an input section we store the size here.
2144 // For an Output_section_data, we have to ask it for the size.
2147 Output_section::Input_section::current_data_size() const
2149 if (this->is_input_section())
2150 return this->u1_.data_size;
2153 this->u2_.posd->pre_finalize_data_size();
2154 return this->u2_.posd->current_data_size();
2158 // Return the data size. For an input section we store the size here.
2159 // For an Output_section_data, we have to ask it for the size.
2162 Output_section::Input_section::data_size() const
2164 if (this->is_input_section())
2165 return this->u1_.data_size;
2167 return this->u2_.posd->data_size();
2170 // Return the object for an input section.
2173 Output_section::Input_section::relobj() const
2175 if (this->is_input_section())
2176 return this->u2_.object;
2177 else if (this->is_merge_section())
2179 gold_assert(this->u2_.pomb->first_relobj() != NULL);
2180 return this->u2_.pomb->first_relobj();
2182 else if (this->is_relaxed_input_section())
2183 return this->u2_.poris->relobj();
2188 // Return the input section index for an input section.
2191 Output_section::Input_section::shndx() const
2193 if (this->is_input_section())
2194 return this->shndx_;
2195 else if (this->is_merge_section())
2197 gold_assert(this->u2_.pomb->first_relobj() != NULL);
2198 return this->u2_.pomb->first_shndx();
2200 else if (this->is_relaxed_input_section())
2201 return this->u2_.poris->shndx();
2206 // Set the address and file offset.
2209 Output_section::Input_section::set_address_and_file_offset(
2212 off_t section_file_offset)
2214 if (this->is_input_section())
2215 this->u2_.object->set_section_offset(this->shndx_,
2216 file_offset - section_file_offset);
2218 this->u2_.posd->set_address_and_file_offset(address, file_offset);
2221 // Reset the address and file offset.
2224 Output_section::Input_section::reset_address_and_file_offset()
2226 if (!this->is_input_section())
2227 this->u2_.posd->reset_address_and_file_offset();
2230 // Finalize the data size.
2233 Output_section::Input_section::finalize_data_size()
2235 if (!this->is_input_section())
2236 this->u2_.posd->finalize_data_size();
2239 // Try to turn an input offset into an output offset. We want to
2240 // return the output offset relative to the start of this
2241 // Input_section in the output section.
2244 Output_section::Input_section::output_offset(
2245 const Relobj* object,
2247 section_offset_type offset,
2248 section_offset_type* poutput) const
2250 if (!this->is_input_section())
2251 return this->u2_.posd->output_offset(object, shndx, offset, poutput);
2254 if (this->shndx_ != shndx || this->u2_.object != object)
2261 // Write out the data. We don't have to do anything for an input
2262 // section--they are handled via Object::relocate--but this is where
2263 // we write out the data for an Output_section_data.
2266 Output_section::Input_section::write(Output_file* of)
2268 if (!this->is_input_section())
2269 this->u2_.posd->write(of);
2272 // Write the data to a buffer. As for write(), we don't have to do
2273 // anything for an input section.
2276 Output_section::Input_section::write_to_buffer(unsigned char* buffer)
2278 if (!this->is_input_section())
2279 this->u2_.posd->write_to_buffer(buffer);
2282 // Print to a map file.
2285 Output_section::Input_section::print_to_mapfile(Mapfile* mapfile) const
2287 switch (this->shndx_)
2289 case OUTPUT_SECTION_CODE:
2290 case MERGE_DATA_SECTION_CODE:
2291 case MERGE_STRING_SECTION_CODE:
2292 this->u2_.posd->print_to_mapfile(mapfile);
2295 case RELAXED_INPUT_SECTION_CODE:
2297 Output_relaxed_input_section* relaxed_section =
2298 this->relaxed_input_section();
2299 mapfile->print_input_section(relaxed_section->relobj(),
2300 relaxed_section->shndx());
2304 mapfile->print_input_section(this->u2_.object, this->shndx_);
2309 // Output_section methods.
2311 // Construct an Output_section. NAME will point into a Stringpool.
2313 Output_section::Output_section(const char* name, elfcpp::Elf_Word type,
2314 elfcpp::Elf_Xword flags)
2319 link_section_(NULL),
2321 info_section_(NULL),
2326 order_(ORDER_INVALID),
2331 first_input_offset_(0),
2333 postprocessing_buffer_(NULL),
2334 needs_symtab_index_(false),
2335 needs_dynsym_index_(false),
2336 should_link_to_symtab_(false),
2337 should_link_to_dynsym_(false),
2338 after_input_sections_(false),
2339 requires_postprocessing_(false),
2340 found_in_sections_clause_(false),
2341 has_load_address_(false),
2342 info_uses_section_index_(false),
2343 input_section_order_specified_(false),
2344 may_sort_attached_input_sections_(false),
2345 must_sort_attached_input_sections_(false),
2346 attached_input_sections_are_sorted_(false),
2348 is_small_section_(false),
2349 is_large_section_(false),
2350 generate_code_fills_at_write_(false),
2351 is_entsize_zero_(false),
2352 section_offsets_need_adjustment_(false),
2354 always_keeps_input_sections_(false),
2355 has_fixed_layout_(false),
2356 is_patch_space_allowed_(false),
2357 is_unique_segment_(false),
2359 extra_segment_flags_(0),
2360 segment_alignment_(0),
2362 lookup_maps_(new Output_section_lookup_maps),
2364 free_space_fill_(NULL),
2367 // An unallocated section has no address. Forcing this means that
2368 // we don't need special treatment for symbols defined in debug
2370 if ((flags & elfcpp::SHF_ALLOC) == 0)
2371 this->set_address(0);
2374 Output_section::~Output_section()
2376 delete this->checkpoint_;
2379 // Set the entry size.
2382 Output_section::set_entsize(uint64_t v)
2384 if (this->is_entsize_zero_)
2386 else if (this->entsize_ == 0)
2388 else if (this->entsize_ != v)
2391 this->is_entsize_zero_ = 1;
2395 // Add the input section SHNDX, with header SHDR, named SECNAME, in
2396 // OBJECT, to the Output_section. RELOC_SHNDX is the index of a
2397 // relocation section which applies to this section, or 0 if none, or
2398 // -1U if more than one. Return the offset of the input section
2399 // within the output section. Return -1 if the input section will
2400 // receive special handling. In the normal case we don't always keep
2401 // track of input sections for an Output_section. Instead, each
2402 // Object keeps track of the Output_section for each of its input
2403 // sections. However, if HAVE_SECTIONS_SCRIPT is true, we do keep
2404 // track of input sections here; this is used when SECTIONS appears in
2407 template<int size, bool big_endian>
2409 Output_section::add_input_section(Layout* layout,
2410 Sized_relobj_file<size, big_endian>* object,
2412 const char* secname,
2413 const elfcpp::Shdr<size, big_endian>& shdr,
2414 unsigned int reloc_shndx,
2415 bool have_sections_script)
2417 elfcpp::Elf_Xword addralign = shdr.get_sh_addralign();
2418 if ((addralign & (addralign - 1)) != 0)
2420 object->error(_("invalid alignment %lu for section \"%s\""),
2421 static_cast<unsigned long>(addralign), secname);
2425 if (addralign > this->addralign_)
2426 this->addralign_ = addralign;
2428 typename elfcpp::Elf_types<size>::Elf_WXword sh_flags = shdr.get_sh_flags();
2429 uint64_t entsize = shdr.get_sh_entsize();
2431 // .debug_str is a mergeable string section, but is not always so
2432 // marked by compilers. Mark manually here so we can optimize.
2433 if (strcmp(secname, ".debug_str") == 0)
2435 sh_flags |= (elfcpp::SHF_MERGE | elfcpp::SHF_STRINGS);
2439 this->update_flags_for_input_section(sh_flags);
2440 this->set_entsize(entsize);
2442 // If this is a SHF_MERGE section, we pass all the input sections to
2443 // a Output_data_merge. We don't try to handle relocations for such
2444 // a section. We don't try to handle empty merge sections--they
2445 // mess up the mappings, and are useless anyhow.
2446 // FIXME: Need to handle merge sections during incremental update.
2447 if ((sh_flags & elfcpp::SHF_MERGE) != 0
2449 && shdr.get_sh_size() > 0
2450 && !parameters->incremental())
2452 // Keep information about merged input sections for rebuilding fast
2453 // lookup maps if we have sections-script or we do relaxation.
2454 bool keeps_input_sections = (this->always_keeps_input_sections_
2455 || have_sections_script
2456 || parameters->target().may_relax());
2458 if (this->add_merge_input_section(object, shndx, sh_flags, entsize,
2459 addralign, keeps_input_sections))
2461 // Tell the relocation routines that they need to call the
2462 // output_offset method to determine the final address.
2467 section_size_type input_section_size = shdr.get_sh_size();
2468 section_size_type uncompressed_size;
2469 if (object->section_is_compressed(shndx, &uncompressed_size))
2470 input_section_size = uncompressed_size;
2472 off_t offset_in_section;
2474 if (this->has_fixed_layout())
2476 // For incremental updates, find a chunk of unused space in the section.
2477 offset_in_section = this->free_list_.allocate(input_section_size,
2479 if (offset_in_section == -1)
2480 gold_fallback(_("out of patch space in section %s; "
2481 "relink with --incremental-full"),
2483 return offset_in_section;
2486 offset_in_section = this->current_data_size_for_child();
2487 off_t aligned_offset_in_section = align_address(offset_in_section,
2489 this->set_current_data_size_for_child(aligned_offset_in_section
2490 + input_section_size);
2492 // Determine if we want to delay code-fill generation until the output
2493 // section is written. When the target is relaxing, we want to delay fill
2494 // generating to avoid adjusting them during relaxation. Also, if we are
2495 // sorting input sections we must delay fill generation.
2496 if (!this->generate_code_fills_at_write_
2497 && !have_sections_script
2498 && (sh_flags & elfcpp::SHF_EXECINSTR) != 0
2499 && parameters->target().has_code_fill()
2500 && (parameters->target().may_relax()
2501 || layout->is_section_ordering_specified()))
2503 gold_assert(this->fills_.empty());
2504 this->generate_code_fills_at_write_ = true;
2507 if (aligned_offset_in_section > offset_in_section
2508 && !this->generate_code_fills_at_write_
2509 && !have_sections_script
2510 && (sh_flags & elfcpp::SHF_EXECINSTR) != 0
2511 && parameters->target().has_code_fill())
2513 // We need to add some fill data. Using fill_list_ when
2514 // possible is an optimization, since we will often have fill
2515 // sections without input sections.
2516 off_t fill_len = aligned_offset_in_section - offset_in_section;
2517 if (this->input_sections_.empty())
2518 this->fills_.push_back(Fill(offset_in_section, fill_len));
2521 std::string fill_data(parameters->target().code_fill(fill_len));
2522 Output_data_const* odc = new Output_data_const(fill_data, 1);
2523 this->input_sections_.push_back(Input_section(odc));
2527 // We need to keep track of this section if we are already keeping
2528 // track of sections, or if we are relaxing. Also, if this is a
2529 // section which requires sorting, or which may require sorting in
2530 // the future, we keep track of the sections. If the
2531 // --section-ordering-file option is used to specify the order of
2532 // sections, we need to keep track of sections.
2533 if (this->always_keeps_input_sections_
2534 || have_sections_script
2535 || !this->input_sections_.empty()
2536 || this->may_sort_attached_input_sections()
2537 || this->must_sort_attached_input_sections()
2538 || parameters->options().user_set_Map()
2539 || parameters->target().may_relax()
2540 || layout->is_section_ordering_specified())
2542 Input_section isecn(object, shndx, input_section_size, addralign);
2543 /* If section ordering is requested by specifying a ordering file,
2544 using --section-ordering-file, match the section name with
2546 if (parameters->options().section_ordering_file())
2548 unsigned int section_order_index =
2549 layout->find_section_order_index(std::string(secname));
2550 if (section_order_index != 0)
2552 isecn.set_section_order_index(section_order_index);
2553 this->set_input_section_order_specified();
2556 this->input_sections_.push_back(isecn);
2559 return aligned_offset_in_section;
2562 // Add arbitrary data to an output section.
2565 Output_section::add_output_section_data(Output_section_data* posd)
2567 Input_section inp(posd);
2568 this->add_output_section_data(&inp);
2570 if (posd->is_data_size_valid())
2572 off_t offset_in_section;
2573 if (this->has_fixed_layout())
2575 // For incremental updates, find a chunk of unused space.
2576 offset_in_section = this->free_list_.allocate(posd->data_size(),
2577 posd->addralign(), 0);
2578 if (offset_in_section == -1)
2579 gold_fallback(_("out of patch space in section %s; "
2580 "relink with --incremental-full"),
2582 // Finalize the address and offset now.
2583 uint64_t addr = this->address();
2584 off_t offset = this->offset();
2585 posd->set_address_and_file_offset(addr + offset_in_section,
2586 offset + offset_in_section);
2590 offset_in_section = this->current_data_size_for_child();
2591 off_t aligned_offset_in_section = align_address(offset_in_section,
2593 this->set_current_data_size_for_child(aligned_offset_in_section
2594 + posd->data_size());
2597 else if (this->has_fixed_layout())
2599 // For incremental updates, arrange for the data to have a fixed layout.
2600 // This will mean that additions to the data must be allocated from
2601 // free space within the containing output section.
2602 uint64_t addr = this->address();
2603 posd->set_address(addr);
2604 posd->set_file_offset(0);
2605 // FIXME: This should eventually be unreachable.
2606 // gold_unreachable();
2610 // Add a relaxed input section.
2613 Output_section::add_relaxed_input_section(Layout* layout,
2614 Output_relaxed_input_section* poris,
2615 const std::string& name)
2617 Input_section inp(poris);
2619 // If the --section-ordering-file option is used to specify the order of
2620 // sections, we need to keep track of sections.
2621 if (layout->is_section_ordering_specified())
2623 unsigned int section_order_index =
2624 layout->find_section_order_index(name);
2625 if (section_order_index != 0)
2627 inp.set_section_order_index(section_order_index);
2628 this->set_input_section_order_specified();
2632 this->add_output_section_data(&inp);
2633 if (this->lookup_maps_->is_valid())
2634 this->lookup_maps_->add_relaxed_input_section(poris->relobj(),
2635 poris->shndx(), poris);
2637 // For a relaxed section, we use the current data size. Linker scripts
2638 // get all the input sections, including relaxed one from an output
2639 // section and add them back to the same output section to compute the
2640 // output section size. If we do not account for sizes of relaxed input
2641 // sections, an output section would be incorrectly sized.
2642 off_t offset_in_section = this->current_data_size_for_child();
2643 off_t aligned_offset_in_section = align_address(offset_in_section,
2644 poris->addralign());
2645 this->set_current_data_size_for_child(aligned_offset_in_section
2646 + poris->current_data_size());
2649 // Add arbitrary data to an output section by Input_section.
2652 Output_section::add_output_section_data(Input_section* inp)
2654 if (this->input_sections_.empty())
2655 this->first_input_offset_ = this->current_data_size_for_child();
2657 this->input_sections_.push_back(*inp);
2659 uint64_t addralign = inp->addralign();
2660 if (addralign > this->addralign_)
2661 this->addralign_ = addralign;
2663 inp->set_output_section(this);
2666 // Add a merge section to an output section.
2669 Output_section::add_output_merge_section(Output_section_data* posd,
2670 bool is_string, uint64_t entsize)
2672 Input_section inp(posd, is_string, entsize);
2673 this->add_output_section_data(&inp);
2676 // Add an input section to a SHF_MERGE section.
2679 Output_section::add_merge_input_section(Relobj* object, unsigned int shndx,
2680 uint64_t flags, uint64_t entsize,
2682 bool keeps_input_sections)
2684 // We cannot merge sections with entsize == 0.
2688 bool is_string = (flags & elfcpp::SHF_STRINGS) != 0;
2690 // We cannot restore merged input section states.
2691 gold_assert(this->checkpoint_ == NULL);
2693 // Look up merge sections by required properties.
2694 // Currently, we only invalidate the lookup maps in script processing
2695 // and relaxation. We should not have done either when we reach here.
2696 // So we assume that the lookup maps are valid to simply code.
2697 gold_assert(this->lookup_maps_->is_valid());
2698 Merge_section_properties msp(is_string, entsize, addralign);
2699 Output_merge_base* pomb = this->lookup_maps_->find_merge_section(msp);
2700 bool is_new = false;
2703 gold_assert(pomb->is_string() == is_string
2704 && pomb->entsize() == entsize
2705 && pomb->addralign() == addralign);
2709 // Create a new Output_merge_data or Output_merge_string_data.
2711 pomb = new Output_merge_data(entsize, addralign);
2717 pomb = new Output_merge_string<char>(addralign);
2720 pomb = new Output_merge_string<uint16_t>(addralign);
2723 pomb = new Output_merge_string<uint32_t>(addralign);
2729 // If we need to do script processing or relaxation, we need to keep
2730 // the original input sections to rebuild the fast lookup maps.
2731 if (keeps_input_sections)
2732 pomb->set_keeps_input_sections();
2736 if (pomb->add_input_section(object, shndx))
2738 // Add new merge section to this output section and link merge
2739 // section properties to new merge section in map.
2742 this->add_output_merge_section(pomb, is_string, entsize);
2743 this->lookup_maps_->add_merge_section(msp, pomb);
2750 // If add_input_section failed, delete new merge section to avoid
2751 // exporting empty merge sections in Output_section::get_input_section.
2758 // Build a relaxation map to speed up relaxation of existing input sections.
2759 // Look up to the first LIMIT elements in INPUT_SECTIONS.
2762 Output_section::build_relaxation_map(
2763 const Input_section_list& input_sections,
2765 Relaxation_map* relaxation_map) const
2767 for (size_t i = 0; i < limit; ++i)
2769 const Input_section& is(input_sections[i]);
2770 if (is.is_input_section() || is.is_relaxed_input_section())
2772 Section_id sid(is.relobj(), is.shndx());
2773 (*relaxation_map)[sid] = i;
2778 // Convert regular input sections in INPUT_SECTIONS into relaxed input
2779 // sections in RELAXED_SECTIONS. MAP is a prebuilt map from section id
2780 // indices of INPUT_SECTIONS.
2783 Output_section::convert_input_sections_in_list_to_relaxed_sections(
2784 const std::vector<Output_relaxed_input_section*>& relaxed_sections,
2785 const Relaxation_map& map,
2786 Input_section_list* input_sections)
2788 for (size_t i = 0; i < relaxed_sections.size(); ++i)
2790 Output_relaxed_input_section* poris = relaxed_sections[i];
2791 Section_id sid(poris->relobj(), poris->shndx());
2792 Relaxation_map::const_iterator p = map.find(sid);
2793 gold_assert(p != map.end());
2794 gold_assert((*input_sections)[p->second].is_input_section());
2796 // Remember section order index of original input section
2797 // if it is set. Copy it to the relaxed input section.
2799 (*input_sections)[p->second].section_order_index();
2800 (*input_sections)[p->second] = Input_section(poris);
2801 (*input_sections)[p->second].set_section_order_index(soi);
2805 // Convert regular input sections into relaxed input sections. RELAXED_SECTIONS
2806 // is a vector of pointers to Output_relaxed_input_section or its derived
2807 // classes. The relaxed sections must correspond to existing input sections.
2810 Output_section::convert_input_sections_to_relaxed_sections(
2811 const std::vector<Output_relaxed_input_section*>& relaxed_sections)
2813 gold_assert(parameters->target().may_relax());
2815 // We want to make sure that restore_states does not undo the effect of
2816 // this. If there is no checkpoint active, just search the current
2817 // input section list and replace the sections there. If there is
2818 // a checkpoint, also replace the sections there.
2820 // By default, we look at the whole list.
2821 size_t limit = this->input_sections_.size();
2823 if (this->checkpoint_ != NULL)
2825 // Replace input sections with relaxed input section in the saved
2826 // copy of the input section list.
2827 if (this->checkpoint_->input_sections_saved())
2830 this->build_relaxation_map(
2831 *(this->checkpoint_->input_sections()),
2832 this->checkpoint_->input_sections()->size(),
2834 this->convert_input_sections_in_list_to_relaxed_sections(
2837 this->checkpoint_->input_sections());
2841 // We have not copied the input section list yet. Instead, just
2842 // look at the portion that would be saved.
2843 limit = this->checkpoint_->input_sections_size();
2847 // Convert input sections in input_section_list.
2849 this->build_relaxation_map(this->input_sections_, limit, &map);
2850 this->convert_input_sections_in_list_to_relaxed_sections(
2853 &this->input_sections_);
2855 // Update fast look-up map.
2856 if (this->lookup_maps_->is_valid())
2857 for (size_t i = 0; i < relaxed_sections.size(); ++i)
2859 Output_relaxed_input_section* poris = relaxed_sections[i];
2860 this->lookup_maps_->add_relaxed_input_section(poris->relobj(),
2861 poris->shndx(), poris);
2865 // Update the output section flags based on input section flags.
2868 Output_section::update_flags_for_input_section(elfcpp::Elf_Xword flags)
2870 // If we created the section with SHF_ALLOC clear, we set the
2871 // address. If we are now setting the SHF_ALLOC flag, we need to
2873 if ((this->flags_ & elfcpp::SHF_ALLOC) == 0
2874 && (flags & elfcpp::SHF_ALLOC) != 0)
2875 this->mark_address_invalid();
2877 this->flags_ |= (flags
2878 & (elfcpp::SHF_WRITE
2880 | elfcpp::SHF_EXECINSTR));
2882 if ((flags & elfcpp::SHF_MERGE) == 0)
2883 this->flags_ &=~ elfcpp::SHF_MERGE;
2886 if (this->current_data_size_for_child() == 0)
2887 this->flags_ |= elfcpp::SHF_MERGE;
2890 if ((flags & elfcpp::SHF_STRINGS) == 0)
2891 this->flags_ &=~ elfcpp::SHF_STRINGS;
2894 if (this->current_data_size_for_child() == 0)
2895 this->flags_ |= elfcpp::SHF_STRINGS;
2899 // Find the merge section into which an input section with index SHNDX in
2900 // OBJECT has been added. Return NULL if none found.
2902 const Output_section_data*
2903 Output_section::find_merge_section(const Relobj* object,
2904 unsigned int shndx) const
2906 return object->find_merge_section(shndx);
2909 // Build the lookup maps for relaxed sections. This needs
2910 // to be declared as a const method so that it is callable with a const
2911 // Output_section pointer. The method only updates states of the maps.
2914 Output_section::build_lookup_maps() const
2916 this->lookup_maps_->clear();
2917 for (Input_section_list::const_iterator p = this->input_sections_.begin();
2918 p != this->input_sections_.end();
2921 if (p->is_relaxed_input_section())
2923 Output_relaxed_input_section* poris = p->relaxed_input_section();
2924 this->lookup_maps_->add_relaxed_input_section(poris->relobj(),
2925 poris->shndx(), poris);
2930 // Find an relaxed input section corresponding to an input section
2931 // in OBJECT with index SHNDX.
2933 const Output_relaxed_input_section*
2934 Output_section::find_relaxed_input_section(const Relobj* object,
2935 unsigned int shndx) const
2937 if (!this->lookup_maps_->is_valid())
2938 this->build_lookup_maps();
2939 return this->lookup_maps_->find_relaxed_input_section(object, shndx);
2942 // Given an address OFFSET relative to the start of input section
2943 // SHNDX in OBJECT, return whether this address is being included in
2944 // the final link. This should only be called if SHNDX in OBJECT has
2945 // a special mapping.
2948 Output_section::is_input_address_mapped(const Relobj* object,
2952 // Look at the Output_section_data_maps first.
2953 const Output_section_data* posd = this->find_merge_section(object, shndx);
2955 posd = this->find_relaxed_input_section(object, shndx);
2959 section_offset_type output_offset;
2960 bool found = posd->output_offset(object, shndx, offset, &output_offset);
2961 // By default we assume that the address is mapped. See comment at the
2965 return output_offset != -1;
2968 // Fall back to the slow look-up.
2969 for (Input_section_list::const_iterator p = this->input_sections_.begin();
2970 p != this->input_sections_.end();
2973 section_offset_type output_offset;
2974 if (p->output_offset(object, shndx, offset, &output_offset))
2975 return output_offset != -1;
2978 // By default we assume that the address is mapped. This should
2979 // only be called after we have passed all sections to Layout. At
2980 // that point we should know what we are discarding.
2984 // Given an address OFFSET relative to the start of input section
2985 // SHNDX in object OBJECT, return the output offset relative to the
2986 // start of the input section in the output section. This should only
2987 // be called if SHNDX in OBJECT has a special mapping.
2990 Output_section::output_offset(const Relobj* object, unsigned int shndx,
2991 section_offset_type offset) const
2993 // This can only be called meaningfully when we know the data size
2995 gold_assert(this->is_data_size_valid());
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);
3003 section_offset_type output_offset;
3004 bool found = posd->output_offset(object, shndx, offset, &output_offset);
3006 return 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 section_offset_type output_offset;
3015 if (p->output_offset(object, shndx, offset, &output_offset))
3016 return output_offset;
3021 // Return the output virtual address of OFFSET relative to the start
3022 // of input section SHNDX in object OBJECT.
3025 Output_section::output_address(const Relobj* object, unsigned int shndx,
3028 uint64_t addr = this->address() + this->first_input_offset_;
3030 // Look at the Output_section_data_maps first.
3031 const Output_section_data* posd = this->find_merge_section(object, shndx);
3033 posd = this->find_relaxed_input_section(object, shndx);
3034 if (posd != NULL && posd->is_address_valid())
3036 section_offset_type output_offset;
3037 bool found = posd->output_offset(object, shndx, offset, &output_offset);
3039 return posd->address() + output_offset;
3042 // Fall back to the slow look-up.
3043 for (Input_section_list::const_iterator p = this->input_sections_.begin();
3044 p != this->input_sections_.end();
3047 addr = align_address(addr, p->addralign());
3048 section_offset_type output_offset;
3049 if (p->output_offset(object, shndx, offset, &output_offset))
3051 if (output_offset == -1)
3053 return addr + output_offset;
3055 addr += p->data_size();
3058 // If we get here, it means that we don't know the mapping for this
3059 // input section. This might happen in principle if
3060 // add_input_section were called before add_output_section_data.
3061 // But it should never actually happen.
3066 // Find the output address of the start of the merged section for
3067 // input section SHNDX in object OBJECT.
3070 Output_section::find_starting_output_address(const Relobj* object,
3072 uint64_t* paddr) const
3074 const Output_section_data* data = this->find_merge_section(object, shndx);
3078 // FIXME: This becomes a bottle-neck if we have many relaxed sections.
3079 // Looking up the merge section map does not always work as we sometimes
3080 // find a merge section without its address set.
3081 uint64_t addr = this->address() + this->first_input_offset_;
3082 for (Input_section_list::const_iterator p = this->input_sections_.begin();
3083 p != this->input_sections_.end();
3086 addr = align_address(addr, p->addralign());
3088 // It would be nice if we could use the existing output_offset
3089 // method to get the output offset of input offset 0.
3090 // Unfortunately we don't know for sure that input offset 0 is
3092 if (!p->is_input_section() && p->output_section_data() == data)
3098 addr += p->data_size();
3101 // We couldn't find a merge output section for this input section.
3105 // Update the data size of an Output_section.
3108 Output_section::update_data_size()
3110 if (this->input_sections_.empty())
3113 if (this->must_sort_attached_input_sections()
3114 || this->input_section_order_specified())
3115 this->sort_attached_input_sections();
3117 off_t off = this->first_input_offset_;
3118 for (Input_section_list::iterator p = this->input_sections_.begin();
3119 p != this->input_sections_.end();
3122 off = align_address(off, p->addralign());
3123 off += p->current_data_size();
3126 this->set_current_data_size_for_child(off);
3129 // Set the data size of an Output_section. This is where we handle
3130 // setting the addresses of any Output_section_data objects.
3133 Output_section::set_final_data_size()
3137 if (this->input_sections_.empty())
3138 data_size = this->current_data_size_for_child();
3141 if (this->must_sort_attached_input_sections()
3142 || this->input_section_order_specified())
3143 this->sort_attached_input_sections();
3145 uint64_t address = this->address();
3146 off_t startoff = this->offset();
3147 off_t off = startoff + this->first_input_offset_;
3148 for (Input_section_list::iterator p = this->input_sections_.begin();
3149 p != this->input_sections_.end();
3152 off = align_address(off, p->addralign());
3153 p->set_address_and_file_offset(address + (off - startoff), off,
3155 off += p->data_size();
3157 data_size = off - startoff;
3160 // For full incremental links, we want to allocate some patch space
3161 // in most sections for subsequent incremental updates.
3162 if (this->is_patch_space_allowed_ && parameters->incremental_full())
3164 double pct = parameters->options().incremental_patch();
3165 size_t extra = static_cast<size_t>(data_size * pct);
3166 if (this->free_space_fill_ != NULL
3167 && this->free_space_fill_->minimum_hole_size() > extra)
3168 extra = this->free_space_fill_->minimum_hole_size();
3169 off_t new_size = align_address(data_size + extra, this->addralign());
3170 this->patch_space_ = new_size - data_size;
3171 gold_debug(DEBUG_INCREMENTAL,
3172 "set_final_data_size: %08lx + %08lx: section %s",
3173 static_cast<long>(data_size),
3174 static_cast<long>(this->patch_space_),
3176 data_size = new_size;
3179 this->set_data_size(data_size);
3182 // Reset the address and file offset.
3185 Output_section::do_reset_address_and_file_offset()
3187 // An unallocated section has no address. Forcing this means that
3188 // we don't need special treatment for symbols defined in debug
3189 // sections. We do the same in the constructor. This does not
3190 // apply to NOLOAD sections though.
3191 if (((this->flags_ & elfcpp::SHF_ALLOC) == 0) && !this->is_noload_)
3192 this->set_address(0);
3194 for (Input_section_list::iterator p = this->input_sections_.begin();
3195 p != this->input_sections_.end();
3197 p->reset_address_and_file_offset();
3199 // Remove any patch space that was added in set_final_data_size.
3200 if (this->patch_space_ > 0)
3202 this->set_current_data_size_for_child(this->current_data_size_for_child()
3203 - this->patch_space_);
3204 this->patch_space_ = 0;
3208 // Return true if address and file offset have the values after reset.
3211 Output_section::do_address_and_file_offset_have_reset_values() const
3213 if (this->is_offset_valid())
3216 // An unallocated section has address 0 after its construction or a reset.
3217 if ((this->flags_ & elfcpp::SHF_ALLOC) == 0)
3218 return this->is_address_valid() && this->address() == 0;
3220 return !this->is_address_valid();
3223 // Set the TLS offset. Called only for SHT_TLS sections.
3226 Output_section::do_set_tls_offset(uint64_t tls_base)
3228 this->tls_offset_ = this->address() - tls_base;
3231 // In a few cases we need to sort the input sections attached to an
3232 // output section. This is used to implement the type of constructor
3233 // priority ordering implemented by the GNU linker, in which the
3234 // priority becomes part of the section name and the sections are
3235 // sorted by name. We only do this for an output section if we see an
3236 // attached input section matching ".ctors.*", ".dtors.*",
3237 // ".init_array.*" or ".fini_array.*".
3239 class Output_section::Input_section_sort_entry
3242 Input_section_sort_entry()
3243 : input_section_(), index_(-1U), section_name_()
3246 Input_section_sort_entry(const Input_section& input_section,
3248 bool must_sort_attached_input_sections,
3249 const char* output_section_name)
3250 : input_section_(input_section), index_(index), section_name_()
3252 if ((input_section.is_input_section()
3253 || input_section.is_relaxed_input_section())
3254 && must_sort_attached_input_sections)
3256 // This is only called single-threaded from Layout::finalize,
3257 // so it is OK to lock. Unfortunately we have no way to pass
3259 const Task* dummy_task = reinterpret_cast<const Task*>(-1);
3260 Object* obj = (input_section.is_input_section()
3261 ? input_section.relobj()
3262 : input_section.relaxed_input_section()->relobj());
3263 Task_lock_obj<Object> tl(dummy_task, obj);
3265 // This is a slow operation, which should be cached in
3266 // Layout::layout if this becomes a speed problem.
3267 this->section_name_ = obj->section_name(input_section.shndx());
3269 else if (input_section.is_output_section_data()
3270 && must_sort_attached_input_sections)
3272 // For linker-generated sections, use the output section name.
3273 this->section_name_.assign(output_section_name);
3277 // Return the Input_section.
3278 const Input_section&
3279 input_section() const
3281 gold_assert(this->index_ != -1U);
3282 return this->input_section_;
3285 // The index of this entry in the original list. This is used to
3286 // make the sort stable.
3290 gold_assert(this->index_ != -1U);
3291 return this->index_;
3294 // The section name.
3296 section_name() const
3298 return this->section_name_;
3301 // Return true if the section name has a priority. This is assumed
3302 // to be true if it has a dot after the initial dot.
3304 has_priority() const
3306 return this->section_name_.find('.', 1) != std::string::npos;
3309 // Return the priority. Believe it or not, gcc encodes the priority
3310 // differently for .ctors/.dtors and .init_array/.fini_array
3313 get_priority() const
3316 if (is_prefix_of(".ctors.", this->section_name_.c_str())
3317 || is_prefix_of(".dtors.", this->section_name_.c_str()))
3319 else if (is_prefix_of(".init_array.", this->section_name_.c_str())
3320 || is_prefix_of(".fini_array.", this->section_name_.c_str()))
3325 unsigned long prio = strtoul((this->section_name_.c_str()
3326 + (is_ctors ? 7 : 12)),
3331 return 65535 - prio;
3336 // Return true if this an input file whose base name matches
3337 // FILE_NAME. The base name must have an extension of ".o", and
3338 // must be exactly FILE_NAME.o or FILE_NAME, one character, ".o".
3339 // This is to match crtbegin.o as well as crtbeginS.o without
3340 // getting confused by other possibilities. Overall matching the
3341 // file name this way is a dreadful hack, but the GNU linker does it
3342 // in order to better support gcc, and we need to be compatible.
3344 match_file_name(const char* file_name) const
3346 if (this->input_section_.is_output_section_data())
3348 return Layout::match_file_name(this->input_section_.relobj(), file_name);
3351 // Returns 1 if THIS should appear before S in section order, -1 if S
3352 // appears before THIS and 0 if they are not comparable.
3354 compare_section_ordering(const Input_section_sort_entry& s) const
3356 unsigned int this_secn_index = this->input_section_.section_order_index();
3357 unsigned int s_secn_index = s.input_section().section_order_index();
3358 if (this_secn_index > 0 && s_secn_index > 0)
3360 if (this_secn_index < s_secn_index)
3362 else if (this_secn_index > s_secn_index)
3369 // The Input_section we are sorting.
3370 Input_section input_section_;
3371 // The index of this Input_section in the original list.
3372 unsigned int index_;
3373 // The section name if there is one.
3374 std::string section_name_;
3377 // Return true if S1 should come before S2 in the output section.
3380 Output_section::Input_section_sort_compare::operator()(
3381 const Output_section::Input_section_sort_entry& s1,
3382 const Output_section::Input_section_sort_entry& s2) const
3384 // crtbegin.o must come first.
3385 bool s1_begin = s1.match_file_name("crtbegin");
3386 bool s2_begin = s2.match_file_name("crtbegin");
3387 if (s1_begin || s2_begin)
3393 return s1.index() < s2.index();
3396 // crtend.o must come last.
3397 bool s1_end = s1.match_file_name("crtend");
3398 bool s2_end = s2.match_file_name("crtend");
3399 if (s1_end || s2_end)
3405 return s1.index() < s2.index();
3408 // A section with a priority follows a section without a priority.
3409 bool s1_has_priority = s1.has_priority();
3410 bool s2_has_priority = s2.has_priority();
3411 if (s1_has_priority && !s2_has_priority)
3413 if (!s1_has_priority && s2_has_priority)
3416 // Check if a section order exists for these sections through a section
3417 // ordering file. If sequence_num is 0, an order does not exist.
3418 int sequence_num = s1.compare_section_ordering(s2);
3419 if (sequence_num != 0)
3420 return sequence_num == 1;
3422 // Otherwise we sort by name.
3423 int compare = s1.section_name().compare(s2.section_name());
3427 // Otherwise we keep the input order.
3428 return s1.index() < s2.index();
3431 // Return true if S1 should come before S2 in an .init_array or .fini_array
3435 Output_section::Input_section_sort_init_fini_compare::operator()(
3436 const Output_section::Input_section_sort_entry& s1,
3437 const Output_section::Input_section_sort_entry& s2) const
3439 // A section without a priority follows a section with a priority.
3440 // This is the reverse of .ctors and .dtors sections.
3441 bool s1_has_priority = s1.has_priority();
3442 bool s2_has_priority = s2.has_priority();
3443 if (s1_has_priority && !s2_has_priority)
3445 if (!s1_has_priority && s2_has_priority)
3448 // .ctors and .dtors sections without priority come after
3449 // .init_array and .fini_array sections without priority.
3450 if (!s1_has_priority
3451 && (s1.section_name() == ".ctors" || s1.section_name() == ".dtors")
3452 && s1.section_name() != s2.section_name())
3454 if (!s2_has_priority
3455 && (s2.section_name() == ".ctors" || s2.section_name() == ".dtors")
3456 && s2.section_name() != s1.section_name())
3459 // Sort by priority if we can.
3460 if (s1_has_priority)
3462 unsigned int s1_prio = s1.get_priority();
3463 unsigned int s2_prio = s2.get_priority();
3464 if (s1_prio < s2_prio)
3466 else if (s1_prio > s2_prio)
3470 // Check if a section order exists for these sections through a section
3471 // ordering file. If sequence_num is 0, an order does not exist.
3472 int sequence_num = s1.compare_section_ordering(s2);
3473 if (sequence_num != 0)
3474 return sequence_num == 1;
3476 // Otherwise we sort by name.
3477 int compare = s1.section_name().compare(s2.section_name());
3481 // Otherwise we keep the input order.
3482 return s1.index() < s2.index();
3485 // Return true if S1 should come before S2. Sections that do not match
3486 // any pattern in the section ordering file are placed ahead of the sections
3487 // that match some pattern.
3490 Output_section::Input_section_sort_section_order_index_compare::operator()(
3491 const Output_section::Input_section_sort_entry& s1,
3492 const Output_section::Input_section_sort_entry& s2) const
3494 unsigned int s1_secn_index = s1.input_section().section_order_index();
3495 unsigned int s2_secn_index = s2.input_section().section_order_index();
3497 // Keep input order if section ordering cannot determine order.
3498 if (s1_secn_index == s2_secn_index)
3499 return s1.index() < s2.index();
3501 return s1_secn_index < s2_secn_index;
3504 // Return true if S1 should come before S2. This is the sort comparison
3505 // function for .text to sort sections with prefixes
3506 // .text.{unlikely,exit,startup,hot} before other sections.
3509 Output_section::Input_section_sort_section_prefix_special_ordering_compare
3511 const Output_section::Input_section_sort_entry& s1,
3512 const Output_section::Input_section_sort_entry& s2) const
3514 // Some input section names have special ordering requirements.
3515 int o1 = Layout::special_ordering_of_input_section(s1.section_name().c_str());
3516 int o2 = Layout::special_ordering_of_input_section(s2.section_name().c_str());
3527 // Keep input order otherwise.
3528 return s1.index() < s2.index();
3531 // Return true if S1 should come before S2. This is the sort comparison
3532 // function for sections to sort them by name.
3535 Output_section::Input_section_sort_section_name_compare
3537 const Output_section::Input_section_sort_entry& s1,
3538 const Output_section::Input_section_sort_entry& s2) const
3541 int compare = s1.section_name().compare(s2.section_name());
3545 // Keep input order otherwise.
3546 return s1.index() < s2.index();
3549 // This updates the section order index of input sections according to the
3550 // the order specified in the mapping from Section id to order index.
3553 Output_section::update_section_layout(
3554 const Section_layout_order* order_map)
3556 for (Input_section_list::iterator p = this->input_sections_.begin();
3557 p != this->input_sections_.end();
3560 if (p->is_input_section()
3561 || p->is_relaxed_input_section())
3563 Relobj* obj = (p->is_input_section()
3565 : p->relaxed_input_section()->relobj());
3566 unsigned int shndx = p->shndx();
3567 Section_layout_order::const_iterator it
3568 = order_map->find(Section_id(obj, shndx));
3569 if (it == order_map->end())
3571 unsigned int section_order_index = it->second;
3572 if (section_order_index != 0)
3574 p->set_section_order_index(section_order_index);
3575 this->set_input_section_order_specified();
3581 // Sort the input sections attached to an output section.
3584 Output_section::sort_attached_input_sections()
3586 if (this->attached_input_sections_are_sorted_)
3589 if (this->checkpoint_ != NULL
3590 && !this->checkpoint_->input_sections_saved())
3591 this->checkpoint_->save_input_sections();
3593 // The only thing we know about an input section is the object and
3594 // the section index. We need the section name. Recomputing this
3595 // is slow but this is an unusual case. If this becomes a speed
3596 // problem we can cache the names as required in Layout::layout.
3598 // We start by building a larger vector holding a copy of each
3599 // Input_section, plus its current index in the list and its name.
3600 std::vector<Input_section_sort_entry> sort_list;
3603 for (Input_section_list::iterator p = this->input_sections_.begin();
3604 p != this->input_sections_.end();
3606 sort_list.push_back(Input_section_sort_entry(*p, i,
3607 this->must_sort_attached_input_sections(),
3610 // Sort the input sections.
3611 if (this->must_sort_attached_input_sections())
3613 if (this->type() == elfcpp::SHT_PREINIT_ARRAY
3614 || this->type() == elfcpp::SHT_INIT_ARRAY
3615 || this->type() == elfcpp::SHT_FINI_ARRAY)
3616 std::sort(sort_list.begin(), sort_list.end(),
3617 Input_section_sort_init_fini_compare());
3618 else if (strcmp(parameters->options().sort_section(), "name") == 0)
3619 std::sort(sort_list.begin(), sort_list.end(),
3620 Input_section_sort_section_name_compare());
3621 else if (strcmp(this->name(), ".text") == 0)
3622 std::sort(sort_list.begin(), sort_list.end(),
3623 Input_section_sort_section_prefix_special_ordering_compare());
3625 std::sort(sort_list.begin(), sort_list.end(),
3626 Input_section_sort_compare());
3630 gold_assert(this->input_section_order_specified());
3631 std::sort(sort_list.begin(), sort_list.end(),
3632 Input_section_sort_section_order_index_compare());
3635 // Copy the sorted input sections back to our list.
3636 this->input_sections_.clear();
3637 for (std::vector<Input_section_sort_entry>::iterator p = sort_list.begin();
3638 p != sort_list.end();
3640 this->input_sections_.push_back(p->input_section());
3643 // Remember that we sorted the input sections, since we might get
3645 this->attached_input_sections_are_sorted_ = true;
3648 // Write the section header to *OSHDR.
3650 template<int size, bool big_endian>
3652 Output_section::write_header(const Layout* layout,
3653 const Stringpool* secnamepool,
3654 elfcpp::Shdr_write<size, big_endian>* oshdr) const
3656 oshdr->put_sh_name(secnamepool->get_offset(this->name_));
3657 oshdr->put_sh_type(this->type_);
3659 elfcpp::Elf_Xword flags = this->flags_;
3660 if (this->info_section_ != NULL && this->info_uses_section_index_)
3661 flags |= elfcpp::SHF_INFO_LINK;
3662 oshdr->put_sh_flags(flags);
3664 oshdr->put_sh_addr(this->address());
3665 oshdr->put_sh_offset(this->offset());
3666 oshdr->put_sh_size(this->data_size());
3667 if (this->link_section_ != NULL)
3668 oshdr->put_sh_link(this->link_section_->out_shndx());
3669 else if (this->should_link_to_symtab_)
3670 oshdr->put_sh_link(layout->symtab_section_shndx());
3671 else if (this->should_link_to_dynsym_)
3672 oshdr->put_sh_link(layout->dynsym_section()->out_shndx());
3674 oshdr->put_sh_link(this->link_);
3676 elfcpp::Elf_Word info;
3677 if (this->info_section_ != NULL)
3679 if (this->info_uses_section_index_)
3680 info = this->info_section_->out_shndx();
3682 info = this->info_section_->symtab_index();
3684 else if (this->info_symndx_ != NULL)
3685 info = this->info_symndx_->symtab_index();
3688 oshdr->put_sh_info(info);
3690 oshdr->put_sh_addralign(this->addralign_);
3691 oshdr->put_sh_entsize(this->entsize_);
3694 // Write out the data. For input sections the data is written out by
3695 // Object::relocate, but we have to handle Output_section_data objects
3699 Output_section::do_write(Output_file* of)
3701 gold_assert(!this->requires_postprocessing());
3703 // If the target performs relaxation, we delay filler generation until now.
3704 gold_assert(!this->generate_code_fills_at_write_ || this->fills_.empty());
3706 off_t output_section_file_offset = this->offset();
3707 for (Fill_list::iterator p = this->fills_.begin();
3708 p != this->fills_.end();
3711 std::string fill_data(parameters->target().code_fill(p->length()));
3712 of->write(output_section_file_offset + p->section_offset(),
3713 fill_data.data(), fill_data.size());
3716 off_t off = this->offset() + this->first_input_offset_;
3717 for (Input_section_list::iterator p = this->input_sections_.begin();
3718 p != this->input_sections_.end();
3721 off_t aligned_off = align_address(off, p->addralign());
3722 if (this->generate_code_fills_at_write_ && (off != aligned_off))
3724 size_t fill_len = aligned_off - off;
3725 std::string fill_data(parameters->target().code_fill(fill_len));
3726 of->write(off, fill_data.data(), fill_data.size());
3730 off = aligned_off + p->data_size();
3733 // For incremental links, fill in unused chunks in debug sections
3734 // with dummy compilation unit headers.
3735 if (this->free_space_fill_ != NULL)
3737 for (Free_list::Const_iterator p = this->free_list_.begin();
3738 p != this->free_list_.end();
3741 off_t off = p->start_;
3742 size_t len = p->end_ - off;
3743 this->free_space_fill_->write(of, this->offset() + off, len);
3745 if (this->patch_space_ > 0)
3747 off_t off = this->current_data_size_for_child() - this->patch_space_;
3748 this->free_space_fill_->write(of, this->offset() + off,
3749 this->patch_space_);
3754 // If a section requires postprocessing, create the buffer to use.
3757 Output_section::create_postprocessing_buffer()
3759 gold_assert(this->requires_postprocessing());
3761 if (this->postprocessing_buffer_ != NULL)
3764 if (!this->input_sections_.empty())
3766 off_t off = this->first_input_offset_;
3767 for (Input_section_list::iterator p = this->input_sections_.begin();
3768 p != this->input_sections_.end();
3771 off = align_address(off, p->addralign());
3772 p->finalize_data_size();
3773 off += p->data_size();
3775 this->set_current_data_size_for_child(off);
3778 off_t buffer_size = this->current_data_size_for_child();
3779 this->postprocessing_buffer_ = new unsigned char[buffer_size];
3782 // Write all the data of an Output_section into the postprocessing
3783 // buffer. This is used for sections which require postprocessing,
3784 // such as compression. Input sections are handled by
3785 // Object::Relocate.
3788 Output_section::write_to_postprocessing_buffer()
3790 gold_assert(this->requires_postprocessing());
3792 // If the target performs relaxation, we delay filler generation until now.
3793 gold_assert(!this->generate_code_fills_at_write_ || this->fills_.empty());
3795 unsigned char* buffer = this->postprocessing_buffer();
3796 for (Fill_list::iterator p = this->fills_.begin();
3797 p != this->fills_.end();
3800 std::string fill_data(parameters->target().code_fill(p->length()));
3801 memcpy(buffer + p->section_offset(), fill_data.data(),
3805 off_t off = this->first_input_offset_;
3806 for (Input_section_list::iterator p = this->input_sections_.begin();
3807 p != this->input_sections_.end();
3810 off_t aligned_off = align_address(off, p->addralign());
3811 if (this->generate_code_fills_at_write_ && (off != aligned_off))
3813 size_t fill_len = aligned_off - off;
3814 std::string fill_data(parameters->target().code_fill(fill_len));
3815 memcpy(buffer + off, fill_data.data(), fill_data.size());
3818 p->write_to_buffer(buffer + aligned_off);
3819 off = aligned_off + p->data_size();
3823 // Get the input sections for linker script processing. We leave
3824 // behind the Output_section_data entries. Note that this may be
3825 // slightly incorrect for merge sections. We will leave them behind,
3826 // but it is possible that the script says that they should follow
3827 // some other input sections, as in:
3828 // .rodata { *(.rodata) *(.rodata.cst*) }
3829 // For that matter, we don't handle this correctly:
3830 // .rodata { foo.o(.rodata.cst*) *(.rodata.cst*) }
3831 // With luck this will never matter.
3834 Output_section::get_input_sections(
3836 const std::string& fill,
3837 std::list<Input_section>* input_sections)
3839 if (this->checkpoint_ != NULL
3840 && !this->checkpoint_->input_sections_saved())
3841 this->checkpoint_->save_input_sections();
3843 // Invalidate fast look-up maps.
3844 this->lookup_maps_->invalidate();
3846 uint64_t orig_address = address;
3848 address = align_address(address, this->addralign());
3850 Input_section_list remaining;
3851 for (Input_section_list::iterator p = this->input_sections_.begin();
3852 p != this->input_sections_.end();
3855 if (p->is_input_section()
3856 || p->is_relaxed_input_section()
3857 || p->is_merge_section())
3858 input_sections->push_back(*p);
3861 uint64_t aligned_address = align_address(address, p->addralign());
3862 if (aligned_address != address && !fill.empty())
3864 section_size_type length =
3865 convert_to_section_size_type(aligned_address - address);
3866 std::string this_fill;
3867 this_fill.reserve(length);
3868 while (this_fill.length() + fill.length() <= length)
3870 if (this_fill.length() < length)
3871 this_fill.append(fill, 0, length - this_fill.length());
3873 Output_section_data* posd = new Output_data_const(this_fill, 0);
3874 remaining.push_back(Input_section(posd));
3876 address = aligned_address;
3878 remaining.push_back(*p);
3880 p->finalize_data_size();
3881 address += p->data_size();
3885 this->input_sections_.swap(remaining);
3886 this->first_input_offset_ = 0;
3888 uint64_t data_size = address - orig_address;
3889 this->set_current_data_size_for_child(data_size);
3893 // Add a script input section. SIS is an Output_section::Input_section,
3894 // which can be either a plain input section or a special input section like
3895 // a relaxed input section. For a special input section, its size must be
3899 Output_section::add_script_input_section(const Input_section& sis)
3901 uint64_t data_size = sis.data_size();
3902 uint64_t addralign = sis.addralign();
3903 if (addralign > this->addralign_)
3904 this->addralign_ = addralign;
3906 off_t offset_in_section = this->current_data_size_for_child();
3907 off_t aligned_offset_in_section = align_address(offset_in_section,
3910 this->set_current_data_size_for_child(aligned_offset_in_section
3913 this->input_sections_.push_back(sis);
3915 // Update fast lookup maps if necessary.
3916 if (this->lookup_maps_->is_valid())
3918 if (sis.is_relaxed_input_section())
3920 Output_relaxed_input_section* poris = sis.relaxed_input_section();
3921 this->lookup_maps_->add_relaxed_input_section(poris->relobj(),
3922 poris->shndx(), poris);
3927 // Save states for relaxation.
3930 Output_section::save_states()
3932 gold_assert(this->checkpoint_ == NULL);
3933 Checkpoint_output_section* checkpoint =
3934 new Checkpoint_output_section(this->addralign_, this->flags_,
3935 this->input_sections_,
3936 this->first_input_offset_,
3937 this->attached_input_sections_are_sorted_);
3938 this->checkpoint_ = checkpoint;
3939 gold_assert(this->fills_.empty());
3943 Output_section::discard_states()
3945 gold_assert(this->checkpoint_ != NULL);
3946 delete this->checkpoint_;
3947 this->checkpoint_ = NULL;
3948 gold_assert(this->fills_.empty());
3950 // Simply invalidate the fast lookup maps since we do not keep
3952 this->lookup_maps_->invalidate();
3956 Output_section::restore_states()
3958 gold_assert(this->checkpoint_ != NULL);
3959 Checkpoint_output_section* checkpoint = this->checkpoint_;
3961 this->addralign_ = checkpoint->addralign();
3962 this->flags_ = checkpoint->flags();
3963 this->first_input_offset_ = checkpoint->first_input_offset();
3965 if (!checkpoint->input_sections_saved())
3967 // If we have not copied the input sections, just resize it.
3968 size_t old_size = checkpoint->input_sections_size();
3969 gold_assert(this->input_sections_.size() >= old_size);
3970 this->input_sections_.resize(old_size);
3974 // We need to copy the whole list. This is not efficient for
3975 // extremely large output with hundreads of thousands of input
3976 // objects. We may need to re-think how we should pass sections
3978 this->input_sections_ = *checkpoint->input_sections();
3981 this->attached_input_sections_are_sorted_ =
3982 checkpoint->attached_input_sections_are_sorted();
3984 // Simply invalidate the fast lookup maps since we do not keep
3986 this->lookup_maps_->invalidate();
3989 // Update the section offsets of input sections in this. This is required if
3990 // relaxation causes some input sections to change sizes.
3993 Output_section::adjust_section_offsets()
3995 if (!this->section_offsets_need_adjustment_)
3999 for (Input_section_list::iterator p = this->input_sections_.begin();
4000 p != this->input_sections_.end();
4003 off = align_address(off, p->addralign());
4004 if (p->is_input_section())
4005 p->relobj()->set_section_offset(p->shndx(), off);
4006 off += p->data_size();
4009 this->section_offsets_need_adjustment_ = false;
4012 // Print to the map file.
4015 Output_section::do_print_to_mapfile(Mapfile* mapfile) const
4017 mapfile->print_output_section(this);
4019 for (Input_section_list::const_iterator p = this->input_sections_.begin();
4020 p != this->input_sections_.end();
4022 p->print_to_mapfile(mapfile);
4025 // Print stats for merge sections to stderr.
4028 Output_section::print_merge_stats()
4030 Input_section_list::iterator p;
4031 for (p = this->input_sections_.begin();
4032 p != this->input_sections_.end();
4034 p->print_merge_stats(this->name_);
4037 // Set a fixed layout for the section. Used for incremental update links.
4040 Output_section::set_fixed_layout(uint64_t sh_addr, off_t sh_offset,
4041 off_t sh_size, uint64_t sh_addralign)
4043 this->addralign_ = sh_addralign;
4044 this->set_current_data_size(sh_size);
4045 if ((this->flags_ & elfcpp::SHF_ALLOC) != 0)
4046 this->set_address(sh_addr);
4047 this->set_file_offset(sh_offset);
4048 this->finalize_data_size();
4049 this->free_list_.init(sh_size, false);
4050 this->has_fixed_layout_ = true;
4053 // Reserve space within the fixed layout for the section. Used for
4054 // incremental update links.
4057 Output_section::reserve(uint64_t sh_offset, uint64_t sh_size)
4059 this->free_list_.remove(sh_offset, sh_offset + sh_size);
4062 // Allocate space from the free list for the section. Used for
4063 // incremental update links.
4066 Output_section::allocate(off_t len, uint64_t addralign)
4068 return this->free_list_.allocate(len, addralign, 0);
4071 // Output segment methods.
4073 Output_segment::Output_segment(elfcpp::Elf_Word type, elfcpp::Elf_Word flags)
4083 is_max_align_known_(false),
4084 are_addresses_set_(false),
4085 is_large_data_segment_(false),
4086 is_unique_segment_(false)
4088 // The ELF ABI specifies that a PT_TLS segment always has PF_R as
4090 if (type == elfcpp::PT_TLS)
4091 this->flags_ = elfcpp::PF_R;
4094 // Add an Output_section to a PT_LOAD Output_segment.
4097 Output_segment::add_output_section_to_load(Layout* layout,
4099 elfcpp::Elf_Word seg_flags)
4101 gold_assert(this->type() == elfcpp::PT_LOAD);
4102 gold_assert((os->flags() & elfcpp::SHF_ALLOC) != 0);
4103 gold_assert(!this->is_max_align_known_);
4104 gold_assert(os->is_large_data_section() == this->is_large_data_segment());
4106 this->update_flags_for_output_section(seg_flags);
4108 // We don't want to change the ordering if we have a linker script
4109 // with a SECTIONS clause.
4110 Output_section_order order = os->order();
4111 if (layout->script_options()->saw_sections_clause())
4112 order = static_cast<Output_section_order>(0);
4114 gold_assert(order != ORDER_INVALID);
4116 this->output_lists_[order].push_back(os);
4119 // Add an Output_section to a non-PT_LOAD Output_segment.
4122 Output_segment::add_output_section_to_nonload(Output_section* os,
4123 elfcpp::Elf_Word seg_flags)
4125 gold_assert(this->type() != elfcpp::PT_LOAD);
4126 gold_assert((os->flags() & elfcpp::SHF_ALLOC) != 0);
4127 gold_assert(!this->is_max_align_known_);
4129 this->update_flags_for_output_section(seg_flags);
4131 this->output_lists_[0].push_back(os);
4134 // Remove an Output_section from this segment. It is an error if it
4138 Output_segment::remove_output_section(Output_section* os)
4140 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4142 Output_data_list* pdl = &this->output_lists_[i];
4143 for (Output_data_list::iterator p = pdl->begin(); p != pdl->end(); ++p)
4155 // Add an Output_data (which need not be an Output_section) to the
4156 // start of a segment.
4159 Output_segment::add_initial_output_data(Output_data* od)
4161 gold_assert(!this->is_max_align_known_);
4162 Output_data_list::iterator p = this->output_lists_[0].begin();
4163 this->output_lists_[0].insert(p, od);
4166 // Return true if this segment has any sections which hold actual
4167 // data, rather than being a BSS section.
4170 Output_segment::has_any_data_sections() const
4172 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4174 const Output_data_list* pdl = &this->output_lists_[i];
4175 for (Output_data_list::const_iterator p = pdl->begin();
4179 if (!(*p)->is_section())
4181 if ((*p)->output_section()->type() != elfcpp::SHT_NOBITS)
4188 // Return whether the first data section (not counting TLS sections)
4189 // is a relro section.
4192 Output_segment::is_first_section_relro() const
4194 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4196 if (i == static_cast<int>(ORDER_TLS_BSS))
4198 const Output_data_list* pdl = &this->output_lists_[i];
4201 Output_data* p = pdl->front();
4202 return p->is_section() && p->output_section()->is_relro();
4208 // Return the maximum alignment of the Output_data in Output_segment.
4211 Output_segment::maximum_alignment()
4213 if (!this->is_max_align_known_)
4215 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4217 const Output_data_list* pdl = &this->output_lists_[i];
4218 uint64_t addralign = Output_segment::maximum_alignment_list(pdl);
4219 if (addralign > this->max_align_)
4220 this->max_align_ = addralign;
4222 this->is_max_align_known_ = true;
4225 return this->max_align_;
4228 // Return the maximum alignment of a list of Output_data.
4231 Output_segment::maximum_alignment_list(const Output_data_list* pdl)
4234 for (Output_data_list::const_iterator p = pdl->begin();
4238 uint64_t addralign = (*p)->addralign();
4239 if (addralign > ret)
4245 // Return whether this segment has any dynamic relocs.
4248 Output_segment::has_dynamic_reloc() const
4250 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4251 if (this->has_dynamic_reloc_list(&this->output_lists_[i]))
4256 // Return whether this Output_data_list has any dynamic relocs.
4259 Output_segment::has_dynamic_reloc_list(const Output_data_list* pdl) const
4261 for (Output_data_list::const_iterator p = pdl->begin();
4264 if ((*p)->has_dynamic_reloc())
4269 // Set the section addresses for an Output_segment. If RESET is true,
4270 // reset the addresses first. ADDR is the address and *POFF is the
4271 // file offset. Set the section indexes starting with *PSHNDX.
4272 // INCREASE_RELRO is the size of the portion of the first non-relro
4273 // section that should be included in the PT_GNU_RELRO segment.
4274 // If this segment has relro sections, and has been aligned for
4275 // that purpose, set *HAS_RELRO to TRUE. Return the address of
4276 // the immediately following segment. Update *HAS_RELRO, *POFF,
4280 Output_segment::set_section_addresses(const Target* target,
4281 Layout* layout, bool reset,
4283 unsigned int* increase_relro,
4286 unsigned int* pshndx)
4288 gold_assert(this->type_ == elfcpp::PT_LOAD);
4290 uint64_t last_relro_pad = 0;
4291 off_t orig_off = *poff;
4293 bool in_tls = false;
4295 // If we have relro sections, we need to pad forward now so that the
4296 // relro sections plus INCREASE_RELRO end on an abi page boundary.
4297 if (parameters->options().relro()
4298 && this->is_first_section_relro()
4299 && (!this->are_addresses_set_ || reset))
4301 uint64_t relro_size = 0;
4303 uint64_t max_align = 0;
4304 for (int i = 0; i <= static_cast<int>(ORDER_RELRO_LAST); ++i)
4306 Output_data_list* pdl = &this->output_lists_[i];
4307 Output_data_list::iterator p;
4308 for (p = pdl->begin(); p != pdl->end(); ++p)
4310 if (!(*p)->is_section())
4312 uint64_t align = (*p)->addralign();
4313 if (align > max_align)
4315 if ((*p)->is_section_flag_set(elfcpp::SHF_TLS))
4319 // Align the first non-TLS section to the alignment
4320 // of the TLS segment.
4324 // Ignore the size of the .tbss section.
4325 if ((*p)->is_section_flag_set(elfcpp::SHF_TLS)
4326 && (*p)->is_section_type(elfcpp::SHT_NOBITS))
4328 relro_size = align_address(relro_size, align);
4329 if ((*p)->is_address_valid())
4330 relro_size += (*p)->data_size();
4333 // FIXME: This could be faster.
4334 (*p)->set_address_and_file_offset(relro_size,
4336 relro_size += (*p)->data_size();
4337 (*p)->reset_address_and_file_offset();
4340 if (p != pdl->end())
4343 relro_size += *increase_relro;
4344 // Pad the total relro size to a multiple of the maximum
4345 // section alignment seen.
4346 uint64_t aligned_size = align_address(relro_size, max_align);
4347 // Note the amount of padding added after the last relro section.
4348 last_relro_pad = aligned_size - relro_size;
4351 uint64_t page_align = parameters->target().abi_pagesize();
4353 // Align to offset N such that (N + RELRO_SIZE) % PAGE_ALIGN == 0.
4354 uint64_t desired_align = page_align - (aligned_size % page_align);
4355 if (desired_align < off % page_align)
4357 off += desired_align - off % page_align;
4358 addr += off - orig_off;
4363 if (!reset && this->are_addresses_set_)
4365 gold_assert(this->paddr_ == addr);
4366 addr = this->vaddr_;
4370 this->vaddr_ = addr;
4371 this->paddr_ = addr;
4372 this->are_addresses_set_ = true;
4377 this->offset_ = orig_off;
4381 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4383 if (i == static_cast<int>(ORDER_RELRO_LAST))
4385 *poff += last_relro_pad;
4386 addr += last_relro_pad;
4387 if (this->output_lists_[i].empty())
4389 // If there is nothing in the ORDER_RELRO_LAST list,
4390 // the padding will occur at the end of the relro
4391 // segment, and we need to add it to *INCREASE_RELRO.
4392 *increase_relro += last_relro_pad;
4395 addr = this->set_section_list_addresses(layout, reset,
4396 &this->output_lists_[i],
4397 addr, poff, pshndx, &in_tls);
4398 if (i < static_cast<int>(ORDER_SMALL_BSS))
4400 this->filesz_ = *poff - orig_off;
4407 // If the last section was a TLS section, align upward to the
4408 // alignment of the TLS segment, so that the overall size of the TLS
4409 // segment is aligned.
4412 uint64_t segment_align = layout->tls_segment()->maximum_alignment();
4413 *poff = align_address(*poff, segment_align);
4416 this->memsz_ = *poff - orig_off;
4418 // Ignore the file offset adjustments made by the BSS Output_data
4422 // If code segments must contain only code, and this code segment is
4423 // page-aligned in the file, then fill it out to a whole page with
4424 // code fill (the tail of the segment will not be within any section).
4425 // Thus the entire code segment can be mapped from the file as whole
4426 // pages and that mapping will contain only valid instructions.
4427 if (target->isolate_execinstr() && (this->flags() & elfcpp::PF_X) != 0)
4429 uint64_t abi_pagesize = target->abi_pagesize();
4430 if (orig_off % abi_pagesize == 0 && off % abi_pagesize != 0)
4432 size_t fill_size = abi_pagesize - (off % abi_pagesize);
4434 std::string fill_data;
4435 if (target->has_code_fill())
4436 fill_data = target->code_fill(fill_size);
4438 fill_data.resize(fill_size); // Zero fill.
4440 Output_data_const* fill = new Output_data_const(fill_data, 0);
4441 fill->set_address(this->vaddr_ + this->memsz_);
4442 fill->set_file_offset(off);
4443 layout->add_relax_output(fill);
4446 gold_assert(off % abi_pagesize == 0);
4448 gold_assert(ret % abi_pagesize == 0);
4450 gold_assert((uint64_t) this->filesz_ == this->memsz_);
4451 this->memsz_ = this->filesz_ += fill_size;
4460 // Set the addresses and file offsets in a list of Output_data
4464 Output_segment::set_section_list_addresses(Layout* layout, bool reset,
4465 Output_data_list* pdl,
4466 uint64_t addr, off_t* poff,
4467 unsigned int* pshndx,
4470 off_t startoff = *poff;
4471 // For incremental updates, we may allocate non-fixed sections from
4472 // free space in the file. This keeps track of the high-water mark.
4473 off_t maxoff = startoff;
4475 off_t off = startoff;
4476 for (Output_data_list::iterator p = pdl->begin();
4481 (*p)->reset_address_and_file_offset();
4483 // When doing an incremental update or when using a linker script,
4484 // the section will most likely already have an address.
4485 if (!(*p)->is_address_valid())
4487 uint64_t align = (*p)->addralign();
4489 if ((*p)->is_section_flag_set(elfcpp::SHF_TLS))
4491 // Give the first TLS section the alignment of the
4492 // entire TLS segment. Otherwise the TLS segment as a
4493 // whole may be misaligned.
4496 Output_segment* tls_segment = layout->tls_segment();
4497 gold_assert(tls_segment != NULL);
4498 uint64_t segment_align = tls_segment->maximum_alignment();
4499 gold_assert(segment_align >= align);
4500 align = segment_align;
4507 // If this is the first section after the TLS segment,
4508 // align it to at least the alignment of the TLS
4509 // segment, so that the size of the overall TLS segment
4513 uint64_t segment_align =
4514 layout->tls_segment()->maximum_alignment();
4515 if (segment_align > align)
4516 align = segment_align;
4522 if (!parameters->incremental_update())
4524 off = align_address(off, align);
4525 (*p)->set_address_and_file_offset(addr + (off - startoff), off);
4529 // Incremental update: allocate file space from free list.
4530 (*p)->pre_finalize_data_size();
4531 off_t current_size = (*p)->current_data_size();
4532 off = layout->allocate(current_size, align, startoff);
4535 gold_assert((*p)->output_section() != NULL);
4536 gold_fallback(_("out of patch space for section %s; "
4537 "relink with --incremental-full"),
4538 (*p)->output_section()->name());
4540 (*p)->set_address_and_file_offset(addr + (off - startoff), off);
4541 if ((*p)->data_size() > current_size)
4543 gold_assert((*p)->output_section() != NULL);
4544 gold_fallback(_("%s: section changed size; "
4545 "relink with --incremental-full"),
4546 (*p)->output_section()->name());
4550 else if (parameters->incremental_update())
4552 // For incremental updates, use the fixed offset for the
4553 // high-water mark computation.
4554 off = (*p)->offset();
4558 // The script may have inserted a skip forward, but it
4559 // better not have moved backward.
4560 if ((*p)->address() >= addr + (off - startoff))
4561 off += (*p)->address() - (addr + (off - startoff));
4564 if (!layout->script_options()->saw_sections_clause())
4568 Output_section* os = (*p)->output_section();
4570 // Cast to unsigned long long to avoid format warnings.
4571 unsigned long long previous_dot =
4572 static_cast<unsigned long long>(addr + (off - startoff));
4573 unsigned long long dot =
4574 static_cast<unsigned long long>((*p)->address());
4577 gold_error(_("dot moves backward in linker script "
4578 "from 0x%llx to 0x%llx"), previous_dot, dot);
4580 gold_error(_("address of section '%s' moves backward "
4581 "from 0x%llx to 0x%llx"),
4582 os->name(), previous_dot, dot);
4585 (*p)->set_file_offset(off);
4586 (*p)->finalize_data_size();
4589 if (parameters->incremental_update())
4590 gold_debug(DEBUG_INCREMENTAL,
4591 "set_section_list_addresses: %08lx %08lx %s",
4592 static_cast<long>(off),
4593 static_cast<long>((*p)->data_size()),
4594 ((*p)->output_section() != NULL
4595 ? (*p)->output_section()->name() : "(special)"));
4597 // We want to ignore the size of a SHF_TLS SHT_NOBITS
4598 // section. Such a section does not affect the size of a
4600 if (!(*p)->is_section_flag_set(elfcpp::SHF_TLS)
4601 || !(*p)->is_section_type(elfcpp::SHT_NOBITS))
4602 off += (*p)->data_size();
4607 if ((*p)->is_section())
4609 (*p)->set_out_shndx(*pshndx);
4615 return addr + (maxoff - startoff);
4618 // For a non-PT_LOAD segment, set the offset from the sections, if
4619 // any. Add INCREASE to the file size and the memory size.
4622 Output_segment::set_offset(unsigned int increase)
4624 gold_assert(this->type_ != elfcpp::PT_LOAD);
4626 gold_assert(!this->are_addresses_set_);
4628 // A non-load section only uses output_lists_[0].
4630 Output_data_list* pdl = &this->output_lists_[0];
4634 gold_assert(increase == 0);
4637 this->are_addresses_set_ = true;
4639 this->min_p_align_ = 0;
4645 // Find the first and last section by address.
4646 const Output_data* first = NULL;
4647 const Output_data* last_data = NULL;
4648 const Output_data* last_bss = NULL;
4649 for (Output_data_list::const_iterator p = pdl->begin();
4654 || (*p)->address() < first->address()
4655 || ((*p)->address() == first->address()
4656 && (*p)->data_size() < first->data_size()))
4658 const Output_data** plast;
4659 if ((*p)->is_section()
4660 && (*p)->output_section()->type() == elfcpp::SHT_NOBITS)
4665 || (*p)->address() > (*plast)->address()
4666 || ((*p)->address() == (*plast)->address()
4667 && (*p)->data_size() > (*plast)->data_size()))
4671 this->vaddr_ = first->address();
4672 this->paddr_ = (first->has_load_address()
4673 ? first->load_address()
4675 this->are_addresses_set_ = true;
4676 this->offset_ = first->offset();
4678 if (last_data == NULL)
4681 this->filesz_ = (last_data->address()
4682 + last_data->data_size()
4685 const Output_data* last = last_bss != NULL ? last_bss : last_data;
4686 this->memsz_ = (last->address()
4690 this->filesz_ += increase;
4691 this->memsz_ += increase;
4693 // If this is a RELRO segment, verify that the segment ends at a
4695 if (this->type_ == elfcpp::PT_GNU_RELRO)
4697 uint64_t page_align = parameters->target().abi_pagesize();
4698 uint64_t segment_end = this->vaddr_ + this->memsz_;
4699 if (parameters->incremental_update())
4701 // The INCREASE_RELRO calculation is bypassed for an incremental
4702 // update, so we need to adjust the segment size manually here.
4703 segment_end = align_address(segment_end, page_align);
4704 this->memsz_ = segment_end - this->vaddr_;
4707 gold_assert(segment_end == align_address(segment_end, page_align));
4710 // If this is a TLS segment, align the memory size. The code in
4711 // set_section_list ensures that the section after the TLS segment
4712 // is aligned to give us room.
4713 if (this->type_ == elfcpp::PT_TLS)
4715 uint64_t segment_align = this->maximum_alignment();
4716 gold_assert(this->vaddr_ == align_address(this->vaddr_, segment_align));
4717 this->memsz_ = align_address(this->memsz_, segment_align);
4721 // Set the TLS offsets of the sections in the PT_TLS segment.
4724 Output_segment::set_tls_offsets()
4726 gold_assert(this->type_ == elfcpp::PT_TLS);
4728 for (Output_data_list::iterator p = this->output_lists_[0].begin();
4729 p != this->output_lists_[0].end();
4731 (*p)->set_tls_offset(this->vaddr_);
4734 // Return the first section.
4737 Output_segment::first_section() const
4739 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4741 const Output_data_list* pdl = &this->output_lists_[i];
4742 for (Output_data_list::const_iterator p = pdl->begin();
4746 if ((*p)->is_section())
4747 return (*p)->output_section();
4753 // Return the number of Output_sections in an Output_segment.
4756 Output_segment::output_section_count() const
4758 unsigned int ret = 0;
4759 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4760 ret += this->output_section_count_list(&this->output_lists_[i]);
4764 // Return the number of Output_sections in an Output_data_list.
4767 Output_segment::output_section_count_list(const Output_data_list* pdl) const
4769 unsigned int count = 0;
4770 for (Output_data_list::const_iterator p = pdl->begin();
4774 if ((*p)->is_section())
4780 // Return the section attached to the list segment with the lowest
4781 // load address. This is used when handling a PHDRS clause in a
4785 Output_segment::section_with_lowest_load_address() const
4787 Output_section* found = NULL;
4788 uint64_t found_lma = 0;
4789 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4790 this->lowest_load_address_in_list(&this->output_lists_[i], &found,
4795 // Look through a list for a section with a lower load address.
4798 Output_segment::lowest_load_address_in_list(const Output_data_list* pdl,
4799 Output_section** found,
4800 uint64_t* found_lma) const
4802 for (Output_data_list::const_iterator p = pdl->begin();
4806 if (!(*p)->is_section())
4808 Output_section* os = static_cast<Output_section*>(*p);
4809 uint64_t lma = (os->has_load_address()
4810 ? os->load_address()
4812 if (*found == NULL || lma < *found_lma)
4820 // Write the segment data into *OPHDR.
4822 template<int size, bool big_endian>
4824 Output_segment::write_header(elfcpp::Phdr_write<size, big_endian>* ophdr)
4826 ophdr->put_p_type(this->type_);
4827 ophdr->put_p_offset(this->offset_);
4828 ophdr->put_p_vaddr(this->vaddr_);
4829 ophdr->put_p_paddr(this->paddr_);
4830 ophdr->put_p_filesz(this->filesz_);
4831 ophdr->put_p_memsz(this->memsz_);
4832 ophdr->put_p_flags(this->flags_);
4833 ophdr->put_p_align(std::max(this->min_p_align_, this->maximum_alignment()));
4836 // Write the section headers into V.
4838 template<int size, bool big_endian>
4840 Output_segment::write_section_headers(const Layout* layout,
4841 const Stringpool* secnamepool,
4843 unsigned int* pshndx) const
4845 // Every section that is attached to a segment must be attached to a
4846 // PT_LOAD segment, so we only write out section headers for PT_LOAD
4848 if (this->type_ != elfcpp::PT_LOAD)
4851 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4853 const Output_data_list* pdl = &this->output_lists_[i];
4854 v = this->write_section_headers_list<size, big_endian>(layout,
4863 template<int size, bool big_endian>
4865 Output_segment::write_section_headers_list(const Layout* layout,
4866 const Stringpool* secnamepool,
4867 const Output_data_list* pdl,
4869 unsigned int* pshndx) const
4871 const int shdr_size = elfcpp::Elf_sizes<size>::shdr_size;
4872 for (Output_data_list::const_iterator p = pdl->begin();
4876 if ((*p)->is_section())
4878 const Output_section* ps = static_cast<const Output_section*>(*p);
4879 gold_assert(*pshndx == ps->out_shndx());
4880 elfcpp::Shdr_write<size, big_endian> oshdr(v);
4881 ps->write_header(layout, secnamepool, &oshdr);
4889 // Print the output sections to the map file.
4892 Output_segment::print_sections_to_mapfile(Mapfile* mapfile) const
4894 if (this->type() != elfcpp::PT_LOAD)
4896 for (int i = 0; i < static_cast<int>(ORDER_MAX); ++i)
4897 this->print_section_list_to_mapfile(mapfile, &this->output_lists_[i]);
4900 // Print an output section list to the map file.
4903 Output_segment::print_section_list_to_mapfile(Mapfile* mapfile,
4904 const Output_data_list* pdl) const
4906 for (Output_data_list::const_iterator p = pdl->begin();
4909 (*p)->print_to_mapfile(mapfile);
4912 // Output_file methods.
4914 Output_file::Output_file(const char* name)
4919 map_is_anonymous_(false),
4920 map_is_allocated_(false),
4921 is_temporary_(false)
4925 // Try to open an existing file. Returns false if the file doesn't
4926 // exist, has a size of 0 or can't be mmapped. If BASE_NAME is not
4927 // NULL, open that file as the base for incremental linking, and
4928 // copy its contents to the new output file. This routine can
4929 // be called for incremental updates, in which case WRITABLE should
4930 // be true, or by the incremental-dump utility, in which case
4931 // WRITABLE should be false.
4934 Output_file::open_base_file(const char* base_name, bool writable)
4936 // The name "-" means "stdout".
4937 if (strcmp(this->name_, "-") == 0)
4940 bool use_base_file = base_name != NULL;
4942 base_name = this->name_;
4943 else if (strcmp(base_name, this->name_) == 0)
4944 gold_fatal(_("%s: incremental base and output file name are the same"),
4947 // Don't bother opening files with a size of zero.
4949 if (::stat(base_name, &s) != 0)
4951 gold_info(_("%s: stat: %s"), base_name, strerror(errno));
4956 gold_info(_("%s: incremental base file is empty"), base_name);
4960 // If we're using a base file, we want to open it read-only.
4964 int oflags = writable ? O_RDWR : O_RDONLY;
4965 int o = open_descriptor(-1, base_name, oflags, 0);
4968 gold_info(_("%s: open: %s"), base_name, strerror(errno));
4972 // If the base file and the output file are different, open a
4973 // new output file and read the contents from the base file into
4974 // the newly-mapped region.
4977 this->open(s.st_size);
4978 ssize_t bytes_to_read = s.st_size;
4979 unsigned char* p = this->base_;
4980 while (bytes_to_read > 0)
4982 ssize_t len = ::read(o, p, bytes_to_read);
4985 gold_info(_("%s: read failed: %s"), base_name, strerror(errno));
4990 gold_info(_("%s: file too short: read only %lld of %lld bytes"),
4992 static_cast<long long>(s.st_size - bytes_to_read),
4993 static_cast<long long>(s.st_size));
4997 bytes_to_read -= len;
5004 this->file_size_ = s.st_size;
5006 if (!this->map_no_anonymous(writable))
5008 release_descriptor(o, true);
5010 this->file_size_ = 0;
5017 // Open the output file.
5020 Output_file::open(off_t file_size)
5022 this->file_size_ = file_size;
5024 // Unlink the file first; otherwise the open() may fail if the file
5025 // is busy (e.g. it's an executable that's currently being executed).
5027 // However, the linker may be part of a system where a zero-length
5028 // file is created for it to write to, with tight permissions (gcc
5029 // 2.95 did something like this). Unlinking the file would work
5030 // around those permission controls, so we only unlink if the file
5031 // has a non-zero size. We also unlink only regular files to avoid
5032 // trouble with directories/etc.
5034 // If we fail, continue; this command is merely a best-effort attempt
5035 // to improve the odds for open().
5037 // We let the name "-" mean "stdout"
5038 if (!this->is_temporary_)
5040 if (strcmp(this->name_, "-") == 0)
5041 this->o_ = STDOUT_FILENO;
5045 if (::stat(this->name_, &s) == 0
5046 && (S_ISREG (s.st_mode) || S_ISLNK (s.st_mode)))
5049 ::unlink(this->name_);
5050 else if (!parameters->options().relocatable())
5052 // If we don't unlink the existing file, add execute
5053 // permission where read permissions already exist
5054 // and where the umask permits.
5055 int mask = ::umask(0);
5057 s.st_mode |= (s.st_mode & 0444) >> 2;
5058 ::chmod(this->name_, s.st_mode & ~mask);
5062 int mode = parameters->options().relocatable() ? 0666 : 0777;
5063 int o = open_descriptor(-1, this->name_, O_RDWR | O_CREAT | O_TRUNC,
5066 gold_fatal(_("%s: open: %s"), this->name_, strerror(errno));
5074 // Resize the output file.
5077 Output_file::resize(off_t file_size)
5079 // If the mmap is mapping an anonymous memory buffer, this is easy:
5080 // just mremap to the new size. If it's mapping to a file, we want
5081 // to unmap to flush to the file, then remap after growing the file.
5082 if (this->map_is_anonymous_)
5085 if (!this->map_is_allocated_)
5087 base = ::mremap(this->base_, this->file_size_, file_size,
5089 if (base == MAP_FAILED)
5090 gold_fatal(_("%s: mremap: %s"), this->name_, strerror(errno));
5094 base = realloc(this->base_, file_size);
5097 if (file_size > this->file_size_)
5098 memset(static_cast<char*>(base) + this->file_size_, 0,
5099 file_size - this->file_size_);
5101 this->base_ = static_cast<unsigned char*>(base);
5102 this->file_size_ = file_size;
5107 this->file_size_ = file_size;
5108 if (!this->map_no_anonymous(true))
5109 gold_fatal(_("%s: mmap: %s"), this->name_, strerror(errno));
5113 // Map an anonymous block of memory which will later be written to the
5114 // file. Return whether the map succeeded.
5117 Output_file::map_anonymous()
5119 void* base = ::mmap(NULL, this->file_size_, PROT_READ | PROT_WRITE,
5120 MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
5121 if (base == MAP_FAILED)
5123 base = malloc(this->file_size_);
5126 memset(base, 0, this->file_size_);
5127 this->map_is_allocated_ = true;
5129 this->base_ = static_cast<unsigned char*>(base);
5130 this->map_is_anonymous_ = true;
5134 // Map the file into memory. Return whether the mapping succeeded.
5135 // If WRITABLE is true, map with write access.
5138 Output_file::map_no_anonymous(bool writable)
5140 const int o = this->o_;
5142 // If the output file is not a regular file, don't try to mmap it;
5143 // instead, we'll mmap a block of memory (an anonymous buffer), and
5144 // then later write the buffer to the file.
5146 struct stat statbuf;
5147 if (o == STDOUT_FILENO || o == STDERR_FILENO
5148 || ::fstat(o, &statbuf) != 0
5149 || !S_ISREG(statbuf.st_mode)
5150 || this->is_temporary_)
5153 // Ensure that we have disk space available for the file. If we
5154 // don't do this, it is possible that we will call munmap, close,
5155 // and exit with dirty buffers still in the cache with no assigned
5156 // disk blocks. If the disk is out of space at that point, the
5157 // output file will wind up incomplete, but we will have already
5158 // exited. The alternative to fallocate would be to use fdatasync,
5159 // but that would be a more significant performance hit.
5162 int err = gold_fallocate(o, 0, this->file_size_);
5164 gold_fatal(_("%s: %s"), this->name_, strerror(err));
5167 // Map the file into memory.
5168 int prot = PROT_READ;
5171 base = ::mmap(NULL, this->file_size_, prot, MAP_SHARED, o, 0);
5173 // The mmap call might fail because of file system issues: the file
5174 // system might not support mmap at all, or it might not support
5175 // mmap with PROT_WRITE.
5176 if (base == MAP_FAILED)
5179 this->map_is_anonymous_ = false;
5180 this->base_ = static_cast<unsigned char*>(base);
5184 // Map the file into memory.
5189 if (parameters->options().mmap_output_file()
5190 && this->map_no_anonymous(true))
5193 // The mmap call might fail because of file system issues: the file
5194 // system might not support mmap at all, or it might not support
5195 // mmap with PROT_WRITE. I'm not sure which errno values we will
5196 // see in all cases, so if the mmap fails for any reason and we
5197 // don't care about file contents, try for an anonymous map.
5198 if (this->map_anonymous())
5201 gold_fatal(_("%s: mmap: failed to allocate %lu bytes for output file: %s"),
5202 this->name_, static_cast<unsigned long>(this->file_size_),
5206 // Unmap the file from memory.
5209 Output_file::unmap()
5211 if (this->map_is_anonymous_)
5213 // We've already written out the data, so there is no reason to
5214 // waste time unmapping or freeing the memory.
5218 if (::munmap(this->base_, this->file_size_) < 0)
5219 gold_error(_("%s: munmap: %s"), this->name_, strerror(errno));
5224 // Close the output file.
5227 Output_file::close()
5229 // If the map isn't file-backed, we need to write it now.
5230 if (this->map_is_anonymous_ && !this->is_temporary_)
5232 size_t bytes_to_write = this->file_size_;
5234 while (bytes_to_write > 0)
5236 ssize_t bytes_written = ::write(this->o_, this->base_ + offset,
5238 if (bytes_written == 0)
5239 gold_error(_("%s: write: unexpected 0 return-value"), this->name_);
5240 else if (bytes_written < 0)
5241 gold_error(_("%s: write: %s"), this->name_, strerror(errno));
5244 bytes_to_write -= bytes_written;
5245 offset += bytes_written;
5251 // We don't close stdout or stderr
5252 if (this->o_ != STDOUT_FILENO
5253 && this->o_ != STDERR_FILENO
5254 && !this->is_temporary_)
5255 if (::close(this->o_) < 0)
5256 gold_error(_("%s: close: %s"), this->name_, strerror(errno));
5260 // Instantiate the templates we need. We could use the configure
5261 // script to restrict this to only the ones for implemented targets.
5263 #ifdef HAVE_TARGET_32_LITTLE
5266 Output_section::add_input_section<32, false>(
5268 Sized_relobj_file<32, false>* object,
5270 const char* secname,
5271 const elfcpp::Shdr<32, false>& shdr,
5272 unsigned int reloc_shndx,
5273 bool have_sections_script);
5276 #ifdef HAVE_TARGET_32_BIG
5279 Output_section::add_input_section<32, true>(
5281 Sized_relobj_file<32, true>* object,
5283 const char* secname,
5284 const elfcpp::Shdr<32, true>& shdr,
5285 unsigned int reloc_shndx,
5286 bool have_sections_script);
5289 #ifdef HAVE_TARGET_64_LITTLE
5292 Output_section::add_input_section<64, false>(
5294 Sized_relobj_file<64, false>* object,
5296 const char* secname,
5297 const elfcpp::Shdr<64, false>& shdr,
5298 unsigned int reloc_shndx,
5299 bool have_sections_script);
5302 #ifdef HAVE_TARGET_64_BIG
5305 Output_section::add_input_section<64, true>(
5307 Sized_relobj_file<64, true>* object,
5309 const char* secname,
5310 const elfcpp::Shdr<64, true>& shdr,
5311 unsigned int reloc_shndx,
5312 bool have_sections_script);
5315 #ifdef HAVE_TARGET_32_LITTLE
5317 class Output_reloc<elfcpp::SHT_REL, false, 32, false>;
5320 #ifdef HAVE_TARGET_32_BIG
5322 class Output_reloc<elfcpp::SHT_REL, false, 32, true>;
5325 #ifdef HAVE_TARGET_64_LITTLE
5327 class Output_reloc<elfcpp::SHT_REL, false, 64, false>;
5330 #ifdef HAVE_TARGET_64_BIG
5332 class Output_reloc<elfcpp::SHT_REL, false, 64, true>;
5335 #ifdef HAVE_TARGET_32_LITTLE
5337 class Output_reloc<elfcpp::SHT_REL, true, 32, false>;
5340 #ifdef HAVE_TARGET_32_BIG
5342 class Output_reloc<elfcpp::SHT_REL, true, 32, true>;
5345 #ifdef HAVE_TARGET_64_LITTLE
5347 class Output_reloc<elfcpp::SHT_REL, true, 64, false>;
5350 #ifdef HAVE_TARGET_64_BIG
5352 class Output_reloc<elfcpp::SHT_REL, true, 64, true>;
5355 #ifdef HAVE_TARGET_32_LITTLE
5357 class Output_reloc<elfcpp::SHT_RELA, false, 32, false>;
5360 #ifdef HAVE_TARGET_32_BIG
5362 class Output_reloc<elfcpp::SHT_RELA, false, 32, true>;
5365 #ifdef HAVE_TARGET_64_LITTLE
5367 class Output_reloc<elfcpp::SHT_RELA, false, 64, false>;
5370 #ifdef HAVE_TARGET_64_BIG
5372 class Output_reloc<elfcpp::SHT_RELA, false, 64, true>;
5375 #ifdef HAVE_TARGET_32_LITTLE
5377 class Output_reloc<elfcpp::SHT_RELA, true, 32, false>;
5380 #ifdef HAVE_TARGET_32_BIG
5382 class Output_reloc<elfcpp::SHT_RELA, true, 32, true>;
5385 #ifdef HAVE_TARGET_64_LITTLE
5387 class Output_reloc<elfcpp::SHT_RELA, true, 64, false>;
5390 #ifdef HAVE_TARGET_64_BIG
5392 class Output_reloc<elfcpp::SHT_RELA, true, 64, true>;
5395 #ifdef HAVE_TARGET_32_LITTLE
5397 class Output_data_reloc<elfcpp::SHT_REL, false, 32, false>;
5400 #ifdef HAVE_TARGET_32_BIG
5402 class Output_data_reloc<elfcpp::SHT_REL, false, 32, true>;
5405 #ifdef HAVE_TARGET_64_LITTLE
5407 class Output_data_reloc<elfcpp::SHT_REL, false, 64, false>;
5410 #ifdef HAVE_TARGET_64_BIG
5412 class Output_data_reloc<elfcpp::SHT_REL, false, 64, true>;
5415 #ifdef HAVE_TARGET_32_LITTLE
5417 class Output_data_reloc<elfcpp::SHT_REL, true, 32, false>;
5420 #ifdef HAVE_TARGET_32_BIG
5422 class Output_data_reloc<elfcpp::SHT_REL, true, 32, true>;
5425 #ifdef HAVE_TARGET_64_LITTLE
5427 class Output_data_reloc<elfcpp::SHT_REL, true, 64, false>;
5430 #ifdef HAVE_TARGET_64_BIG
5432 class Output_data_reloc<elfcpp::SHT_REL, true, 64, true>;
5435 #ifdef HAVE_TARGET_32_LITTLE
5437 class Output_data_reloc<elfcpp::SHT_RELA, false, 32, false>;
5440 #ifdef HAVE_TARGET_32_BIG
5442 class Output_data_reloc<elfcpp::SHT_RELA, false, 32, true>;
5445 #ifdef HAVE_TARGET_64_LITTLE
5447 class Output_data_reloc<elfcpp::SHT_RELA, false, 64, false>;
5450 #ifdef HAVE_TARGET_64_BIG
5452 class Output_data_reloc<elfcpp::SHT_RELA, false, 64, true>;
5455 #ifdef HAVE_TARGET_32_LITTLE
5457 class Output_data_reloc<elfcpp::SHT_RELA, true, 32, false>;
5460 #ifdef HAVE_TARGET_32_BIG
5462 class Output_data_reloc<elfcpp::SHT_RELA, true, 32, true>;
5465 #ifdef HAVE_TARGET_64_LITTLE
5467 class Output_data_reloc<elfcpp::SHT_RELA, true, 64, false>;
5470 #ifdef HAVE_TARGET_64_BIG
5472 class Output_data_reloc<elfcpp::SHT_RELA, true, 64, true>;
5475 #ifdef HAVE_TARGET_32_LITTLE
5477 class Output_relocatable_relocs<elfcpp::SHT_REL, 32, false>;
5480 #ifdef HAVE_TARGET_32_BIG
5482 class Output_relocatable_relocs<elfcpp::SHT_REL, 32, true>;
5485 #ifdef HAVE_TARGET_64_LITTLE
5487 class Output_relocatable_relocs<elfcpp::SHT_REL, 64, false>;
5490 #ifdef HAVE_TARGET_64_BIG
5492 class Output_relocatable_relocs<elfcpp::SHT_REL, 64, true>;
5495 #ifdef HAVE_TARGET_32_LITTLE
5497 class Output_relocatable_relocs<elfcpp::SHT_RELA, 32, false>;
5500 #ifdef HAVE_TARGET_32_BIG
5502 class Output_relocatable_relocs<elfcpp::SHT_RELA, 32, true>;
5505 #ifdef HAVE_TARGET_64_LITTLE
5507 class Output_relocatable_relocs<elfcpp::SHT_RELA, 64, false>;
5510 #ifdef HAVE_TARGET_64_BIG
5512 class Output_relocatable_relocs<elfcpp::SHT_RELA, 64, true>;
5515 #ifdef HAVE_TARGET_32_LITTLE
5517 class Output_data_group<32, false>;
5520 #ifdef HAVE_TARGET_32_BIG
5522 class Output_data_group<32, true>;
5525 #ifdef HAVE_TARGET_64_LITTLE
5527 class Output_data_group<64, false>;
5530 #ifdef HAVE_TARGET_64_BIG
5532 class Output_data_group<64, true>;
5536 class Output_data_got<32, false>;
5539 class Output_data_got<32, true>;
5542 class Output_data_got<64, false>;
5545 class Output_data_got<64, true>;
5547 } // End namespace gold.