1 // output.cc -- manage the output file for gold
3 // Copyright 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
4 // Written by Ian Lance Taylor <iant@google.com>.
6 // This file is part of gold.
8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
10 // the Free Software Foundation; either version 3 of the License, or
11 // (at your option) any later version.
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License
19 // along with this program; if not, write to the Free Software
20 // Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 // MA 02110-1301, USA.
33 #ifdef HAVE_SYS_MMAN_H
37 #include "libiberty.h"
40 #include "parameters.h"
45 #include "descriptors.h"
49 // For systems without mmap support.
51 # define mmap gold_mmap
52 # define munmap gold_munmap
53 # define mremap gold_mremap
55 # define MAP_FAILED (reinterpret_cast<void*>(-1))
64 # define MAP_PRIVATE 0
66 # ifndef MAP_ANONYMOUS
67 # define MAP_ANONYMOUS 0
74 # define ENOSYS EINVAL
78 gold_mmap(void *, size_t, int, int, int, off_t
)
85 gold_munmap(void *, size_t)
92 gold_mremap(void *, size_t, size_t, int)
100 #if defined(HAVE_MMAP) && !defined(HAVE_MREMAP)
101 # define mremap gold_mremap
102 extern "C" void *gold_mremap(void *, size_t, size_t, int);
105 // Some BSD systems still use MAP_ANON instead of MAP_ANONYMOUS
106 #ifndef MAP_ANONYMOUS
107 # define MAP_ANONYMOUS MAP_ANON
110 #ifndef MREMAP_MAYMOVE
111 # define MREMAP_MAYMOVE 1
114 // Mingw does not have S_ISLNK.
116 # define S_ISLNK(mode) 0
122 // A wrapper around posix_fallocate. If we don't have posix_fallocate,
123 // or the --no-posix-fallocate option is set, we try the fallocate
124 // system call directly. If that fails, we use ftruncate to set
125 // the file size and hope that there is enough disk space.
128 gold_fallocate(int o
, off_t offset
, off_t len
)
130 #ifdef HAVE_POSIX_FALLOCATE
131 if (parameters
->options().posix_fallocate())
132 return ::posix_fallocate(o
, offset
, len
);
133 #endif // defined(HAVE_POSIX_FALLOCATE)
134 #ifdef HAVE_FALLOCATE
135 if (::fallocate(o
, 0, offset
, len
) == 0)
137 #endif // defined(HAVE_FALLOCATE)
138 if (::ftruncate(o
, offset
+ len
) < 0)
143 // Output_data variables.
145 bool Output_data::allocated_sizes_are_fixed
;
147 // Output_data methods.
149 Output_data::~Output_data()
153 // Return the default alignment for the target size.
156 Output_data::default_alignment()
158 return Output_data::default_alignment_for_size(
159 parameters
->target().get_size());
162 // Return the default alignment for a size--32 or 64.
165 Output_data::default_alignment_for_size(int size
)
175 // Output_section_header methods. This currently assumes that the
176 // segment and section lists are complete at construction time.
178 Output_section_headers::Output_section_headers(
179 const Layout
* layout
,
180 const Layout::Segment_list
* segment_list
,
181 const Layout::Section_list
* section_list
,
182 const Layout::Section_list
* unattached_section_list
,
183 const Stringpool
* secnamepool
,
184 const Output_section
* shstrtab_section
)
186 segment_list_(segment_list
),
187 section_list_(section_list
),
188 unattached_section_list_(unattached_section_list
),
189 secnamepool_(secnamepool
),
190 shstrtab_section_(shstrtab_section
)
194 // Compute the current data size.
197 Output_section_headers::do_size() const
199 // Count all the sections. Start with 1 for the null section.
201 if (!parameters
->options().relocatable())
203 for (Layout::Segment_list::const_iterator p
=
204 this->segment_list_
->begin();
205 p
!= this->segment_list_
->end();
207 if ((*p
)->type() == elfcpp::PT_LOAD
)
208 count
+= (*p
)->output_section_count();
212 for (Layout::Section_list::const_iterator p
=
213 this->section_list_
->begin();
214 p
!= this->section_list_
->end();
216 if (((*p
)->flags() & elfcpp::SHF_ALLOC
) != 0)
219 count
+= this->unattached_section_list_
->size();
221 const int size
= parameters
->target().get_size();
224 shdr_size
= elfcpp::Elf_sizes
<32>::shdr_size
;
226 shdr_size
= elfcpp::Elf_sizes
<64>::shdr_size
;
230 return count
* shdr_size
;
233 // Write out the section headers.
236 Output_section_headers::do_write(Output_file
* of
)
238 switch (parameters
->size_and_endianness())
240 #ifdef HAVE_TARGET_32_LITTLE
241 case Parameters::TARGET_32_LITTLE
:
242 this->do_sized_write
<32, false>(of
);
245 #ifdef HAVE_TARGET_32_BIG
246 case Parameters::TARGET_32_BIG
:
247 this->do_sized_write
<32, true>(of
);
250 #ifdef HAVE_TARGET_64_LITTLE
251 case Parameters::TARGET_64_LITTLE
:
252 this->do_sized_write
<64, false>(of
);
255 #ifdef HAVE_TARGET_64_BIG
256 case Parameters::TARGET_64_BIG
:
257 this->do_sized_write
<64, true>(of
);
265 template<int size
, bool big_endian
>
267 Output_section_headers::do_sized_write(Output_file
* of
)
269 off_t all_shdrs_size
= this->data_size();
270 unsigned char* view
= of
->get_output_view(this->offset(), all_shdrs_size
);
272 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
273 unsigned char* v
= view
;
276 typename
elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
277 oshdr
.put_sh_name(0);
278 oshdr
.put_sh_type(elfcpp::SHT_NULL
);
279 oshdr
.put_sh_flags(0);
280 oshdr
.put_sh_addr(0);
281 oshdr
.put_sh_offset(0);
283 size_t section_count
= (this->data_size()
284 / elfcpp::Elf_sizes
<size
>::shdr_size
);
285 if (section_count
< elfcpp::SHN_LORESERVE
)
286 oshdr
.put_sh_size(0);
288 oshdr
.put_sh_size(section_count
);
290 unsigned int shstrndx
= this->shstrtab_section_
->out_shndx();
291 if (shstrndx
< elfcpp::SHN_LORESERVE
)
292 oshdr
.put_sh_link(0);
294 oshdr
.put_sh_link(shstrndx
);
296 size_t segment_count
= this->segment_list_
->size();
297 oshdr
.put_sh_info(segment_count
>= elfcpp::PN_XNUM
? segment_count
: 0);
299 oshdr
.put_sh_addralign(0);
300 oshdr
.put_sh_entsize(0);
305 unsigned int shndx
= 1;
306 if (!parameters
->options().relocatable())
308 for (Layout::Segment_list::const_iterator p
=
309 this->segment_list_
->begin();
310 p
!= this->segment_list_
->end();
312 v
= (*p
)->write_section_headers
<size
, big_endian
>(this->layout_
,
319 for (Layout::Section_list::const_iterator p
=
320 this->section_list_
->begin();
321 p
!= this->section_list_
->end();
324 // We do unallocated sections below, except that group
325 // sections have to come first.
326 if (((*p
)->flags() & elfcpp::SHF_ALLOC
) == 0
327 && (*p
)->type() != elfcpp::SHT_GROUP
)
329 gold_assert(shndx
== (*p
)->out_shndx());
330 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
331 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
337 for (Layout::Section_list::const_iterator p
=
338 this->unattached_section_list_
->begin();
339 p
!= this->unattached_section_list_
->end();
342 // For a relocatable link, we did unallocated group sections
343 // above, since they have to come first.
344 if ((*p
)->type() == elfcpp::SHT_GROUP
345 && parameters
->options().relocatable())
347 gold_assert(shndx
== (*p
)->out_shndx());
348 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
349 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
354 of
->write_output_view(this->offset(), all_shdrs_size
, view
);
357 // Output_segment_header methods.
359 Output_segment_headers::Output_segment_headers(
360 const Layout::Segment_list
& segment_list
)
361 : segment_list_(segment_list
)
363 this->set_current_data_size_for_child(this->do_size());
367 Output_segment_headers::do_write(Output_file
* of
)
369 switch (parameters
->size_and_endianness())
371 #ifdef HAVE_TARGET_32_LITTLE
372 case Parameters::TARGET_32_LITTLE
:
373 this->do_sized_write
<32, false>(of
);
376 #ifdef HAVE_TARGET_32_BIG
377 case Parameters::TARGET_32_BIG
:
378 this->do_sized_write
<32, true>(of
);
381 #ifdef HAVE_TARGET_64_LITTLE
382 case Parameters::TARGET_64_LITTLE
:
383 this->do_sized_write
<64, false>(of
);
386 #ifdef HAVE_TARGET_64_BIG
387 case Parameters::TARGET_64_BIG
:
388 this->do_sized_write
<64, true>(of
);
396 template<int size
, bool big_endian
>
398 Output_segment_headers::do_sized_write(Output_file
* of
)
400 const int phdr_size
= elfcpp::Elf_sizes
<size
>::phdr_size
;
401 off_t all_phdrs_size
= this->segment_list_
.size() * phdr_size
;
402 gold_assert(all_phdrs_size
== this->data_size());
403 unsigned char* view
= of
->get_output_view(this->offset(),
405 unsigned char* v
= view
;
406 for (Layout::Segment_list::const_iterator p
= this->segment_list_
.begin();
407 p
!= this->segment_list_
.end();
410 elfcpp::Phdr_write
<size
, big_endian
> ophdr(v
);
411 (*p
)->write_header(&ophdr
);
415 gold_assert(v
- view
== all_phdrs_size
);
417 of
->write_output_view(this->offset(), all_phdrs_size
, view
);
421 Output_segment_headers::do_size() const
423 const int size
= parameters
->target().get_size();
426 phdr_size
= elfcpp::Elf_sizes
<32>::phdr_size
;
428 phdr_size
= elfcpp::Elf_sizes
<64>::phdr_size
;
432 return this->segment_list_
.size() * phdr_size
;
435 // Output_file_header methods.
437 Output_file_header::Output_file_header(const Target
* target
,
438 const Symbol_table
* symtab
,
439 const Output_segment_headers
* osh
)
442 segment_header_(osh
),
443 section_header_(NULL
),
446 this->set_data_size(this->do_size());
449 // Set the section table information for a file header.
452 Output_file_header::set_section_info(const Output_section_headers
* shdrs
,
453 const Output_section
* shstrtab
)
455 this->section_header_
= shdrs
;
456 this->shstrtab_
= shstrtab
;
459 // Write out the file header.
462 Output_file_header::do_write(Output_file
* of
)
464 gold_assert(this->offset() == 0);
466 switch (parameters
->size_and_endianness())
468 #ifdef HAVE_TARGET_32_LITTLE
469 case Parameters::TARGET_32_LITTLE
:
470 this->do_sized_write
<32, false>(of
);
473 #ifdef HAVE_TARGET_32_BIG
474 case Parameters::TARGET_32_BIG
:
475 this->do_sized_write
<32, true>(of
);
478 #ifdef HAVE_TARGET_64_LITTLE
479 case Parameters::TARGET_64_LITTLE
:
480 this->do_sized_write
<64, false>(of
);
483 #ifdef HAVE_TARGET_64_BIG
484 case Parameters::TARGET_64_BIG
:
485 this->do_sized_write
<64, true>(of
);
493 // Write out the file header with appropriate size and endianness.
495 template<int size
, bool big_endian
>
497 Output_file_header::do_sized_write(Output_file
* of
)
499 gold_assert(this->offset() == 0);
501 int ehdr_size
= elfcpp::Elf_sizes
<size
>::ehdr_size
;
502 unsigned char* view
= of
->get_output_view(0, ehdr_size
);
503 elfcpp::Ehdr_write
<size
, big_endian
> oehdr(view
);
505 unsigned char e_ident
[elfcpp::EI_NIDENT
];
506 memset(e_ident
, 0, elfcpp::EI_NIDENT
);
507 e_ident
[elfcpp::EI_MAG0
] = elfcpp::ELFMAG0
;
508 e_ident
[elfcpp::EI_MAG1
] = elfcpp::ELFMAG1
;
509 e_ident
[elfcpp::EI_MAG2
] = elfcpp::ELFMAG2
;
510 e_ident
[elfcpp::EI_MAG3
] = elfcpp::ELFMAG3
;
512 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS32
;
514 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS64
;
517 e_ident
[elfcpp::EI_DATA
] = (big_endian
518 ? elfcpp::ELFDATA2MSB
519 : elfcpp::ELFDATA2LSB
);
520 e_ident
[elfcpp::EI_VERSION
] = elfcpp::EV_CURRENT
;
521 oehdr
.put_e_ident(e_ident
);
524 if (parameters
->options().relocatable())
525 e_type
= elfcpp::ET_REL
;
526 else if (parameters
->options().output_is_position_independent())
527 e_type
= elfcpp::ET_DYN
;
529 e_type
= elfcpp::ET_EXEC
;
530 oehdr
.put_e_type(e_type
);
532 oehdr
.put_e_machine(this->target_
->machine_code());
533 oehdr
.put_e_version(elfcpp::EV_CURRENT
);
535 oehdr
.put_e_entry(this->entry
<size
>());
537 if (this->segment_header_
== NULL
)
538 oehdr
.put_e_phoff(0);
540 oehdr
.put_e_phoff(this->segment_header_
->offset());
542 oehdr
.put_e_shoff(this->section_header_
->offset());
543 oehdr
.put_e_flags(this->target_
->processor_specific_flags());
544 oehdr
.put_e_ehsize(elfcpp::Elf_sizes
<size
>::ehdr_size
);
546 if (this->segment_header_
== NULL
)
548 oehdr
.put_e_phentsize(0);
549 oehdr
.put_e_phnum(0);
553 oehdr
.put_e_phentsize(elfcpp::Elf_sizes
<size
>::phdr_size
);
554 size_t phnum
= (this->segment_header_
->data_size()
555 / elfcpp::Elf_sizes
<size
>::phdr_size
);
556 if (phnum
> elfcpp::PN_XNUM
)
557 phnum
= elfcpp::PN_XNUM
;
558 oehdr
.put_e_phnum(phnum
);
561 oehdr
.put_e_shentsize(elfcpp::Elf_sizes
<size
>::shdr_size
);
562 size_t section_count
= (this->section_header_
->data_size()
563 / elfcpp::Elf_sizes
<size
>::shdr_size
);
565 if (section_count
< elfcpp::SHN_LORESERVE
)
566 oehdr
.put_e_shnum(this->section_header_
->data_size()
567 / elfcpp::Elf_sizes
<size
>::shdr_size
);
569 oehdr
.put_e_shnum(0);
571 unsigned int shstrndx
= this->shstrtab_
->out_shndx();
572 if (shstrndx
< elfcpp::SHN_LORESERVE
)
573 oehdr
.put_e_shstrndx(this->shstrtab_
->out_shndx());
575 oehdr
.put_e_shstrndx(elfcpp::SHN_XINDEX
);
577 // Let the target adjust the ELF header, e.g., to set EI_OSABI in
578 // the e_ident field.
579 parameters
->target().adjust_elf_header(view
, ehdr_size
);
581 of
->write_output_view(0, ehdr_size
, view
);
584 // Return the value to use for the entry address.
587 typename
elfcpp::Elf_types
<size
>::Elf_Addr
588 Output_file_header::entry()
590 const bool should_issue_warning
= (parameters
->options().entry() != NULL
591 && !parameters
->options().relocatable()
592 && !parameters
->options().shared());
593 const char* entry
= parameters
->entry();
594 Symbol
* sym
= this->symtab_
->lookup(entry
);
596 typename Sized_symbol
<size
>::Value_type v
;
599 Sized_symbol
<size
>* ssym
;
600 ssym
= this->symtab_
->get_sized_symbol
<size
>(sym
);
601 if (!ssym
->is_defined() && should_issue_warning
)
602 gold_warning("entry symbol '%s' exists but is not defined", entry
);
607 // We couldn't find the entry symbol. See if we can parse it as
608 // a number. This supports, e.g., -e 0x1000.
610 v
= strtoull(entry
, &endptr
, 0);
613 if (should_issue_warning
)
614 gold_warning("cannot find entry symbol '%s'", entry
);
622 // Compute the current data size.
625 Output_file_header::do_size() const
627 const int size
= parameters
->target().get_size();
629 return elfcpp::Elf_sizes
<32>::ehdr_size
;
631 return elfcpp::Elf_sizes
<64>::ehdr_size
;
636 // Output_data_const methods.
639 Output_data_const::do_write(Output_file
* of
)
641 of
->write(this->offset(), this->data_
.data(), this->data_
.size());
644 // Output_data_const_buffer methods.
647 Output_data_const_buffer::do_write(Output_file
* of
)
649 of
->write(this->offset(), this->p_
, this->data_size());
652 // Output_section_data methods.
654 // Record the output section, and set the entry size and such.
657 Output_section_data::set_output_section(Output_section
* os
)
659 gold_assert(this->output_section_
== NULL
);
660 this->output_section_
= os
;
661 this->do_adjust_output_section(os
);
664 // Return the section index of the output section.
667 Output_section_data::do_out_shndx() const
669 gold_assert(this->output_section_
!= NULL
);
670 return this->output_section_
->out_shndx();
673 // Set the alignment, which means we may need to update the alignment
674 // of the output section.
677 Output_section_data::set_addralign(uint64_t addralign
)
679 this->addralign_
= addralign
;
680 if (this->output_section_
!= NULL
681 && this->output_section_
->addralign() < addralign
)
682 this->output_section_
->set_addralign(addralign
);
685 // Output_data_strtab methods.
687 // Set the final data size.
690 Output_data_strtab::set_final_data_size()
692 this->strtab_
->set_string_offsets();
693 this->set_data_size(this->strtab_
->get_strtab_size());
696 // Write out a string table.
699 Output_data_strtab::do_write(Output_file
* of
)
701 this->strtab_
->write(of
, this->offset());
704 // Output_reloc methods.
706 // A reloc against a global symbol.
708 template<bool dynamic
, int size
, bool big_endian
>
709 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
717 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
718 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
719 is_section_symbol_(false), use_plt_offset_(use_plt_offset
), shndx_(INVALID_CODE
)
721 // this->type_ is a bitfield; make sure TYPE fits.
722 gold_assert(this->type_
== type
);
723 this->u1_
.gsym
= gsym
;
726 this->set_needs_dynsym_index();
729 template<bool dynamic
, int size
, bool big_endian
>
730 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
733 Sized_relobj
<size
, big_endian
>* relobj
,
739 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
740 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
741 is_section_symbol_(false), use_plt_offset_(use_plt_offset
), shndx_(shndx
)
743 gold_assert(shndx
!= INVALID_CODE
);
744 // this->type_ is a bitfield; make sure TYPE fits.
745 gold_assert(this->type_
== type
);
746 this->u1_
.gsym
= gsym
;
747 this->u2_
.relobj
= relobj
;
749 this->set_needs_dynsym_index();
752 // A reloc against a local symbol.
754 template<bool dynamic
, int size
, bool big_endian
>
755 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
756 Sized_relobj
<size
, big_endian
>* relobj
,
757 unsigned int local_sym_index
,
763 bool is_section_symbol
,
765 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
766 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
767 is_section_symbol_(is_section_symbol
), use_plt_offset_(use_plt_offset
),
770 gold_assert(local_sym_index
!= GSYM_CODE
771 && local_sym_index
!= INVALID_CODE
);
772 // this->type_ is a bitfield; make sure TYPE fits.
773 gold_assert(this->type_
== type
);
774 this->u1_
.relobj
= relobj
;
777 this->set_needs_dynsym_index();
780 template<bool dynamic
, int size
, bool big_endian
>
781 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
782 Sized_relobj
<size
, big_endian
>* relobj
,
783 unsigned int local_sym_index
,
789 bool is_section_symbol
,
791 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
792 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
793 is_section_symbol_(is_section_symbol
), use_plt_offset_(use_plt_offset
),
796 gold_assert(local_sym_index
!= GSYM_CODE
797 && local_sym_index
!= INVALID_CODE
);
798 gold_assert(shndx
!= INVALID_CODE
);
799 // this->type_ is a bitfield; make sure TYPE fits.
800 gold_assert(this->type_
== type
);
801 this->u1_
.relobj
= relobj
;
802 this->u2_
.relobj
= relobj
;
804 this->set_needs_dynsym_index();
807 // A reloc against the STT_SECTION symbol of an output section.
809 template<bool dynamic
, int size
, bool big_endian
>
810 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
816 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
817 is_relative_(is_relative
), is_symbolless_(is_relative
),
818 is_section_symbol_(true), use_plt_offset_(false), shndx_(INVALID_CODE
)
820 // this->type_ is a bitfield; make sure TYPE fits.
821 gold_assert(this->type_
== type
);
825 this->set_needs_dynsym_index();
827 os
->set_needs_symtab_index();
830 template<bool dynamic
, int size
, bool big_endian
>
831 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
834 Sized_relobj
<size
, big_endian
>* relobj
,
838 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
839 is_relative_(is_relative
), is_symbolless_(is_relative
),
840 is_section_symbol_(true), use_plt_offset_(false), shndx_(shndx
)
842 gold_assert(shndx
!= INVALID_CODE
);
843 // this->type_ is a bitfield; make sure TYPE fits.
844 gold_assert(this->type_
== type
);
846 this->u2_
.relobj
= relobj
;
848 this->set_needs_dynsym_index();
850 os
->set_needs_symtab_index();
853 // An absolute relocation.
855 template<bool dynamic
, int size
, bool big_endian
>
856 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
860 : address_(address
), local_sym_index_(0), type_(type
),
861 is_relative_(false), is_symbolless_(false),
862 is_section_symbol_(false), use_plt_offset_(false), shndx_(INVALID_CODE
)
864 // this->type_ is a bitfield; make sure TYPE fits.
865 gold_assert(this->type_
== type
);
866 this->u1_
.relobj
= NULL
;
870 template<bool dynamic
, int size
, bool big_endian
>
871 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
873 Sized_relobj
<size
, big_endian
>* relobj
,
876 : address_(address
), local_sym_index_(0), type_(type
),
877 is_relative_(false), is_symbolless_(false),
878 is_section_symbol_(false), use_plt_offset_(false), shndx_(shndx
)
880 gold_assert(shndx
!= INVALID_CODE
);
881 // this->type_ is a bitfield; make sure TYPE fits.
882 gold_assert(this->type_
== type
);
883 this->u1_
.relobj
= NULL
;
884 this->u2_
.relobj
= relobj
;
887 // A target specific relocation.
889 template<bool dynamic
, int size
, bool big_endian
>
890 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
895 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
896 is_relative_(false), is_symbolless_(false),
897 is_section_symbol_(false), use_plt_offset_(false), shndx_(INVALID_CODE
)
899 // this->type_ is a bitfield; make sure TYPE fits.
900 gold_assert(this->type_
== type
);
905 template<bool dynamic
, int size
, bool big_endian
>
906 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
909 Sized_relobj
<size
, big_endian
>* relobj
,
912 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
913 is_relative_(false), is_symbolless_(false),
914 is_section_symbol_(false), use_plt_offset_(false), shndx_(shndx
)
916 gold_assert(shndx
!= INVALID_CODE
);
917 // this->type_ is a bitfield; make sure TYPE fits.
918 gold_assert(this->type_
== type
);
920 this->u2_
.relobj
= relobj
;
923 // Record that we need a dynamic symbol index for this relocation.
925 template<bool dynamic
, int size
, bool big_endian
>
927 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
928 set_needs_dynsym_index()
930 if (this->is_symbolless_
)
932 switch (this->local_sym_index_
)
938 this->u1_
.gsym
->set_needs_dynsym_entry();
942 this->u1_
.os
->set_needs_dynsym_index();
946 // The target must take care of this if necessary.
954 const unsigned int lsi
= this->local_sym_index_
;
955 Sized_relobj_file
<size
, big_endian
>* relobj
=
956 this->u1_
.relobj
->sized_relobj();
957 gold_assert(relobj
!= NULL
);
958 if (!this->is_section_symbol_
)
959 relobj
->set_needs_output_dynsym_entry(lsi
);
961 relobj
->output_section(lsi
)->set_needs_dynsym_index();
967 // Get the symbol index of a relocation.
969 template<bool dynamic
, int size
, bool big_endian
>
971 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_symbol_index()
975 if (this->is_symbolless_
)
977 switch (this->local_sym_index_
)
983 if (this->u1_
.gsym
== NULL
)
986 index
= this->u1_
.gsym
->dynsym_index();
988 index
= this->u1_
.gsym
->symtab_index();
993 index
= this->u1_
.os
->dynsym_index();
995 index
= this->u1_
.os
->symtab_index();
999 index
= parameters
->target().reloc_symbol_index(this->u1_
.arg
,
1004 // Relocations without symbols use a symbol index of 0.
1010 const unsigned int lsi
= this->local_sym_index_
;
1011 Sized_relobj_file
<size
, big_endian
>* relobj
=
1012 this->u1_
.relobj
->sized_relobj();
1013 gold_assert(relobj
!= NULL
);
1014 if (!this->is_section_symbol_
)
1017 index
= relobj
->dynsym_index(lsi
);
1019 index
= relobj
->symtab_index(lsi
);
1023 Output_section
* os
= relobj
->output_section(lsi
);
1024 gold_assert(os
!= NULL
);
1026 index
= os
->dynsym_index();
1028 index
= os
->symtab_index();
1033 gold_assert(index
!= -1U);
1037 // For a local section symbol, get the address of the offset ADDEND
1038 // within the input section.
1040 template<bool dynamic
, int size
, bool big_endian
>
1041 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1042 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
1043 local_section_offset(Addend addend
) const
1045 gold_assert(this->local_sym_index_
!= GSYM_CODE
1046 && this->local_sym_index_
!= SECTION_CODE
1047 && this->local_sym_index_
!= TARGET_CODE
1048 && this->local_sym_index_
!= INVALID_CODE
1049 && this->local_sym_index_
!= 0
1050 && this->is_section_symbol_
);
1051 const unsigned int lsi
= this->local_sym_index_
;
1052 Output_section
* os
= this->u1_
.relobj
->output_section(lsi
);
1053 gold_assert(os
!= NULL
);
1054 Address offset
= this->u1_
.relobj
->get_output_section_offset(lsi
);
1055 if (offset
!= invalid_address
)
1056 return offset
+ addend
;
1057 // This is a merge section.
1058 Sized_relobj_file
<size
, big_endian
>* relobj
=
1059 this->u1_
.relobj
->sized_relobj();
1060 gold_assert(relobj
!= NULL
);
1061 offset
= os
->output_address(relobj
, lsi
, addend
);
1062 gold_assert(offset
!= invalid_address
);
1066 // Get the output address of a relocation.
1068 template<bool dynamic
, int size
, bool big_endian
>
1069 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1070 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_address() const
1072 Address address
= this->address_
;
1073 if (this->shndx_
!= INVALID_CODE
)
1075 Output_section
* os
= this->u2_
.relobj
->output_section(this->shndx_
);
1076 gold_assert(os
!= NULL
);
1077 Address off
= this->u2_
.relobj
->get_output_section_offset(this->shndx_
);
1078 if (off
!= invalid_address
)
1079 address
+= os
->address() + off
;
1082 Sized_relobj_file
<size
, big_endian
>* relobj
=
1083 this->u2_
.relobj
->sized_relobj();
1084 gold_assert(relobj
!= NULL
);
1085 address
= os
->output_address(relobj
, this->shndx_
, address
);
1086 gold_assert(address
!= invalid_address
);
1089 else if (this->u2_
.od
!= NULL
)
1090 address
+= this->u2_
.od
->address();
1094 // Write out the offset and info fields of a Rel or Rela relocation
1097 template<bool dynamic
, int size
, bool big_endian
>
1098 template<typename Write_rel
>
1100 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write_rel(
1101 Write_rel
* wr
) const
1103 wr
->put_r_offset(this->get_address());
1104 unsigned int sym_index
= this->get_symbol_index();
1105 wr
->put_r_info(elfcpp::elf_r_info
<size
>(sym_index
, this->type_
));
1108 // Write out a Rel relocation.
1110 template<bool dynamic
, int size
, bool big_endian
>
1112 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write(
1113 unsigned char* pov
) const
1115 elfcpp::Rel_write
<size
, big_endian
> orel(pov
);
1116 this->write_rel(&orel
);
1119 // Get the value of the symbol referred to by a Rel relocation.
1121 template<bool dynamic
, int size
, bool big_endian
>
1122 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1123 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::symbol_value(
1124 Addend addend
) const
1126 if (this->local_sym_index_
== GSYM_CODE
)
1128 const Sized_symbol
<size
>* sym
;
1129 sym
= static_cast<const Sized_symbol
<size
>*>(this->u1_
.gsym
);
1130 if (this->use_plt_offset_
&& sym
->has_plt_offset())
1132 uint64_t plt_address
=
1133 parameters
->target().plt_address_for_global(sym
);
1134 return plt_address
+ sym
->plt_offset();
1137 return sym
->value() + addend
;
1139 if (this->local_sym_index_
== SECTION_CODE
)
1141 gold_assert(!this->use_plt_offset_
);
1142 return this->u1_
.os
->address() + addend
;
1144 gold_assert(this->local_sym_index_
!= TARGET_CODE
1145 && this->local_sym_index_
!= INVALID_CODE
1146 && this->local_sym_index_
!= 0
1147 && !this->is_section_symbol_
);
1148 const unsigned int lsi
= this->local_sym_index_
;
1149 Sized_relobj_file
<size
, big_endian
>* relobj
=
1150 this->u1_
.relobj
->sized_relobj();
1151 gold_assert(relobj
!= NULL
);
1152 if (this->use_plt_offset_
)
1154 uint64_t plt_address
=
1155 parameters
->target().plt_address_for_local(relobj
, lsi
);
1156 return plt_address
+ relobj
->local_plt_offset(lsi
);
1158 const Symbol_value
<size
>* symval
= relobj
->local_symbol(lsi
);
1159 return symval
->value(relobj
, addend
);
1162 // Reloc comparison. This function sorts the dynamic relocs for the
1163 // benefit of the dynamic linker. First we sort all relative relocs
1164 // to the front. Among relative relocs, we sort by output address.
1165 // Among non-relative relocs, we sort by symbol index, then by output
1168 template<bool dynamic
, int size
, bool big_endian
>
1170 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
1171 compare(const Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>& r2
)
1174 if (this->is_relative_
)
1176 if (!r2
.is_relative_
)
1178 // Otherwise sort by reloc address below.
1180 else if (r2
.is_relative_
)
1184 unsigned int sym1
= this->get_symbol_index();
1185 unsigned int sym2
= r2
.get_symbol_index();
1188 else if (sym1
> sym2
)
1190 // Otherwise sort by reloc address.
1193 section_offset_type addr1
= this->get_address();
1194 section_offset_type addr2
= r2
.get_address();
1197 else if (addr1
> addr2
)
1200 // Final tie breaker, in order to generate the same output on any
1201 // host: reloc type.
1202 unsigned int type1
= this->type_
;
1203 unsigned int type2
= r2
.type_
;
1206 else if (type1
> type2
)
1209 // These relocs appear to be exactly the same.
1213 // Write out a Rela relocation.
1215 template<bool dynamic
, int size
, bool big_endian
>
1217 Output_reloc
<elfcpp::SHT_RELA
, dynamic
, size
, big_endian
>::write(
1218 unsigned char* pov
) const
1220 elfcpp::Rela_write
<size
, big_endian
> orel(pov
);
1221 this->rel_
.write_rel(&orel
);
1222 Addend addend
= this->addend_
;
1223 if (this->rel_
.is_target_specific())
1224 addend
= parameters
->target().reloc_addend(this->rel_
.target_arg(),
1225 this->rel_
.type(), addend
);
1226 else if (this->rel_
.is_symbolless())
1227 addend
= this->rel_
.symbol_value(addend
);
1228 else if (this->rel_
.is_local_section_symbol())
1229 addend
= this->rel_
.local_section_offset(addend
);
1230 orel
.put_r_addend(addend
);
1233 // Output_data_reloc_base methods.
1235 // Adjust the output section.
1237 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1239 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>
1240 ::do_adjust_output_section(Output_section
* os
)
1242 if (sh_type
== elfcpp::SHT_REL
)
1243 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rel_size
);
1244 else if (sh_type
== elfcpp::SHT_RELA
)
1245 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rela_size
);
1249 // A STT_GNU_IFUNC symbol may require a IRELATIVE reloc when doing a
1250 // static link. The backends will generate a dynamic reloc section
1251 // to hold this. In that case we don't want to link to the dynsym
1252 // section, because there isn't one.
1254 os
->set_should_link_to_symtab();
1255 else if (parameters
->doing_static_link())
1258 os
->set_should_link_to_dynsym();
1261 // Write out relocation data.
1263 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1265 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>::do_write(
1268 const off_t off
= this->offset();
1269 const off_t oview_size
= this->data_size();
1270 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1272 if (this->sort_relocs())
1274 gold_assert(dynamic
);
1275 std::sort(this->relocs_
.begin(), this->relocs_
.end(),
1276 Sort_relocs_comparison());
1279 unsigned char* pov
= oview
;
1280 for (typename
Relocs::const_iterator p
= this->relocs_
.begin();
1281 p
!= this->relocs_
.end();
1288 gold_assert(pov
- oview
== oview_size
);
1290 of
->write_output_view(off
, oview_size
, oview
);
1292 // We no longer need the relocation entries.
1293 this->relocs_
.clear();
1296 // Class Output_relocatable_relocs.
1298 template<int sh_type
, int size
, bool big_endian
>
1300 Output_relocatable_relocs
<sh_type
, size
, big_endian
>::set_final_data_size()
1302 this->set_data_size(this->rr_
->output_reloc_count()
1303 * Reloc_types
<sh_type
, size
, big_endian
>::reloc_size
);
1306 // class Output_data_group.
1308 template<int size
, bool big_endian
>
1309 Output_data_group
<size
, big_endian
>::Output_data_group(
1310 Sized_relobj_file
<size
, big_endian
>* relobj
,
1311 section_size_type entry_count
,
1312 elfcpp::Elf_Word flags
,
1313 std::vector
<unsigned int>* input_shndxes
)
1314 : Output_section_data(entry_count
* 4, 4, false),
1318 this->input_shndxes_
.swap(*input_shndxes
);
1321 // Write out the section group, which means translating the section
1322 // indexes to apply to the output file.
1324 template<int size
, bool big_endian
>
1326 Output_data_group
<size
, big_endian
>::do_write(Output_file
* of
)
1328 const off_t off
= this->offset();
1329 const section_size_type oview_size
=
1330 convert_to_section_size_type(this->data_size());
1331 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1333 elfcpp::Elf_Word
* contents
= reinterpret_cast<elfcpp::Elf_Word
*>(oview
);
1334 elfcpp::Swap
<32, big_endian
>::writeval(contents
, this->flags_
);
1337 for (std::vector
<unsigned int>::const_iterator p
=
1338 this->input_shndxes_
.begin();
1339 p
!= this->input_shndxes_
.end();
1342 Output_section
* os
= this->relobj_
->output_section(*p
);
1344 unsigned int output_shndx
;
1346 output_shndx
= os
->out_shndx();
1349 this->relobj_
->error(_("section group retained but "
1350 "group element discarded"));
1354 elfcpp::Swap
<32, big_endian
>::writeval(contents
, output_shndx
);
1357 size_t wrote
= reinterpret_cast<unsigned char*>(contents
) - oview
;
1358 gold_assert(wrote
== oview_size
);
1360 of
->write_output_view(off
, oview_size
, oview
);
1362 // We no longer need this information.
1363 this->input_shndxes_
.clear();
1366 // Output_data_got::Got_entry methods.
1368 // Write out the entry.
1370 template<int size
, bool big_endian
>
1372 Output_data_got
<size
, big_endian
>::Got_entry::write(unsigned char* pov
) const
1376 switch (this->local_sym_index_
)
1380 // If the symbol is resolved locally, we need to write out the
1381 // link-time value, which will be relocated dynamically by a
1382 // RELATIVE relocation.
1383 Symbol
* gsym
= this->u_
.gsym
;
1384 if (this->use_plt_offset_
&& gsym
->has_plt_offset())
1385 val
= (parameters
->target().plt_address_for_global(gsym
)
1386 + gsym
->plt_offset());
1389 Sized_symbol
<size
>* sgsym
;
1390 // This cast is a bit ugly. We don't want to put a
1391 // virtual method in Symbol, because we want Symbol to be
1392 // as small as possible.
1393 sgsym
= static_cast<Sized_symbol
<size
>*>(gsym
);
1394 val
= sgsym
->value();
1400 val
= this->u_
.constant
;
1404 // If we're doing an incremental update, don't touch this GOT entry.
1405 if (parameters
->incremental_update())
1407 val
= this->u_
.constant
;
1412 const Relobj
* object
= this->u_
.object
;
1413 const unsigned int lsi
= this->local_sym_index_
;
1414 if (!this->use_plt_offset_
)
1416 uint64_t lval
= object
->local_symbol_value(lsi
, 0);
1417 val
= convert_types
<Valtype
, uint64_t>(lval
);
1421 uint64_t plt_address
=
1422 parameters
->target().plt_address_for_local(object
, lsi
);
1423 val
= plt_address
+ object
->local_plt_offset(lsi
);
1429 elfcpp::Swap
<size
, big_endian
>::writeval(pov
, val
);
1432 // Output_data_got methods.
1434 // Add an entry for a global symbol to the GOT. This returns true if
1435 // this is a new GOT entry, false if the symbol already had a GOT
1438 template<int size
, bool big_endian
>
1440 Output_data_got
<size
, big_endian
>::add_global(
1442 unsigned int got_type
)
1444 if (gsym
->has_got_offset(got_type
))
1447 unsigned int got_offset
= this->add_got_entry(Got_entry(gsym
, false));
1448 gsym
->set_got_offset(got_type
, got_offset
);
1452 // Like add_global, but use the PLT offset.
1454 template<int size
, bool big_endian
>
1456 Output_data_got
<size
, big_endian
>::add_global_plt(Symbol
* gsym
,
1457 unsigned int got_type
)
1459 if (gsym
->has_got_offset(got_type
))
1462 unsigned int got_offset
= this->add_got_entry(Got_entry(gsym
, true));
1463 gsym
->set_got_offset(got_type
, got_offset
);
1467 // Add an entry for a global symbol to the GOT, and add a dynamic
1468 // relocation of type R_TYPE for the GOT entry.
1470 template<int size
, bool big_endian
>
1472 Output_data_got
<size
, big_endian
>::add_global_with_rel(
1474 unsigned int got_type
,
1475 Output_data_reloc_generic
* rel_dyn
,
1476 unsigned int r_type
)
1478 if (gsym
->has_got_offset(got_type
))
1481 unsigned int got_offset
= this->add_got_entry(Got_entry());
1482 gsym
->set_got_offset(got_type
, got_offset
);
1483 rel_dyn
->add_global_generic(gsym
, r_type
, this, got_offset
, 0);
1486 // Add a pair of entries for a global symbol to the GOT, and add
1487 // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively.
1488 // If R_TYPE_2 == 0, add the second entry with no relocation.
1489 template<int size
, bool big_endian
>
1491 Output_data_got
<size
, big_endian
>::add_global_pair_with_rel(
1493 unsigned int got_type
,
1494 Output_data_reloc_generic
* rel_dyn
,
1495 unsigned int r_type_1
,
1496 unsigned int r_type_2
)
1498 if (gsym
->has_got_offset(got_type
))
1501 unsigned int got_offset
= this->add_got_entry_pair(Got_entry(), Got_entry());
1502 gsym
->set_got_offset(got_type
, got_offset
);
1503 rel_dyn
->add_global_generic(gsym
, r_type_1
, this, got_offset
, 0);
1506 rel_dyn
->add_global_generic(gsym
, r_type_2
, this,
1507 got_offset
+ size
/ 8, 0);
1510 // Add an entry for a local symbol to the GOT. This returns true if
1511 // this is a new GOT entry, false if the symbol already has a GOT
1514 template<int size
, bool big_endian
>
1516 Output_data_got
<size
, big_endian
>::add_local(
1518 unsigned int symndx
,
1519 unsigned int got_type
)
1521 if (object
->local_has_got_offset(symndx
, got_type
))
1524 unsigned int got_offset
= this->add_got_entry(Got_entry(object
, symndx
,
1526 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1530 // Like add_local, but use the PLT offset.
1532 template<int size
, bool big_endian
>
1534 Output_data_got
<size
, big_endian
>::add_local_plt(
1536 unsigned int symndx
,
1537 unsigned int got_type
)
1539 if (object
->local_has_got_offset(symndx
, got_type
))
1542 unsigned int got_offset
= this->add_got_entry(Got_entry(object
, symndx
,
1544 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1548 // Add an entry for a local symbol to the GOT, and add a dynamic
1549 // relocation of type R_TYPE for the GOT entry.
1551 template<int size
, bool big_endian
>
1553 Output_data_got
<size
, big_endian
>::add_local_with_rel(
1555 unsigned int symndx
,
1556 unsigned int got_type
,
1557 Output_data_reloc_generic
* rel_dyn
,
1558 unsigned int r_type
)
1560 if (object
->local_has_got_offset(symndx
, got_type
))
1563 unsigned int got_offset
= this->add_got_entry(Got_entry());
1564 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1565 rel_dyn
->add_local_generic(object
, symndx
, r_type
, this, got_offset
, 0);
1568 // Add a pair of entries for a local symbol to the GOT, and add
1569 // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively.
1570 // If R_TYPE_2 == 0, add the second entry with no relocation.
1571 template<int size
, bool big_endian
>
1573 Output_data_got
<size
, big_endian
>::add_local_pair_with_rel(
1575 unsigned int symndx
,
1577 unsigned int got_type
,
1578 Output_data_reloc_generic
* rel_dyn
,
1579 unsigned int r_type_1
,
1580 unsigned int r_type_2
)
1582 if (object
->local_has_got_offset(symndx
, got_type
))
1585 unsigned int got_offset
=
1586 this->add_got_entry_pair(Got_entry(),
1587 Got_entry(object
, symndx
, false));
1588 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1589 Output_section
* os
= object
->output_section(shndx
);
1590 rel_dyn
->add_output_section_generic(os
, r_type_1
, this, got_offset
, 0);
1593 rel_dyn
->add_output_section_generic(os
, r_type_2
, this,
1594 got_offset
+ size
/ 8, 0);
1597 // Reserve a slot in the GOT for a local symbol or the second slot of a pair.
1599 template<int size
, bool big_endian
>
1601 Output_data_got
<size
, big_endian
>::reserve_local(
1604 unsigned int sym_index
,
1605 unsigned int got_type
)
1607 this->do_reserve_slot(i
);
1608 object
->set_local_got_offset(sym_index
, got_type
, this->got_offset(i
));
1611 // Reserve a slot in the GOT for a global symbol.
1613 template<int size
, bool big_endian
>
1615 Output_data_got
<size
, big_endian
>::reserve_global(
1618 unsigned int got_type
)
1620 this->do_reserve_slot(i
);
1621 gsym
->set_got_offset(got_type
, this->got_offset(i
));
1624 // Write out the GOT.
1626 template<int size
, bool big_endian
>
1628 Output_data_got
<size
, big_endian
>::do_write(Output_file
* of
)
1630 const int add
= size
/ 8;
1632 const off_t off
= this->offset();
1633 const off_t oview_size
= this->data_size();
1634 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1636 unsigned char* pov
= oview
;
1637 for (typename
Got_entries::const_iterator p
= this->entries_
.begin();
1638 p
!= this->entries_
.end();
1645 gold_assert(pov
- oview
== oview_size
);
1647 of
->write_output_view(off
, oview_size
, oview
);
1649 // We no longer need the GOT entries.
1650 this->entries_
.clear();
1653 // Create a new GOT entry and return its offset.
1655 template<int size
, bool big_endian
>
1657 Output_data_got
<size
, big_endian
>::add_got_entry(Got_entry got_entry
)
1659 if (!this->is_data_size_valid())
1661 this->entries_
.push_back(got_entry
);
1662 this->set_got_size();
1663 return this->last_got_offset();
1667 // For an incremental update, find an available slot.
1668 off_t got_offset
= this->free_list_
.allocate(size
/ 8, size
/ 8, 0);
1669 if (got_offset
== -1)
1670 gold_fallback(_("out of patch space (GOT);"
1671 " relink with --incremental-full"));
1672 unsigned int got_index
= got_offset
/ (size
/ 8);
1673 gold_assert(got_index
< this->entries_
.size());
1674 this->entries_
[got_index
] = got_entry
;
1675 return static_cast<unsigned int>(got_offset
);
1679 // Create a pair of new GOT entries and return the offset of the first.
1681 template<int size
, bool big_endian
>
1683 Output_data_got
<size
, big_endian
>::add_got_entry_pair(Got_entry got_entry_1
,
1684 Got_entry got_entry_2
)
1686 if (!this->is_data_size_valid())
1688 unsigned int got_offset
;
1689 this->entries_
.push_back(got_entry_1
);
1690 got_offset
= this->last_got_offset();
1691 this->entries_
.push_back(got_entry_2
);
1692 this->set_got_size();
1697 // For an incremental update, find an available pair of slots.
1698 off_t got_offset
= this->free_list_
.allocate(2 * size
/ 8, size
/ 8, 0);
1699 if (got_offset
== -1)
1700 gold_fallback(_("out of patch space (GOT);"
1701 " relink with --incremental-full"));
1702 unsigned int got_index
= got_offset
/ (size
/ 8);
1703 gold_assert(got_index
< this->entries_
.size());
1704 this->entries_
[got_index
] = got_entry_1
;
1705 this->entries_
[got_index
+ 1] = got_entry_2
;
1706 return static_cast<unsigned int>(got_offset
);
1710 // Replace GOT entry I with a new value.
1712 template<int size
, bool big_endian
>
1714 Output_data_got
<size
, big_endian
>::replace_got_entry(
1716 Got_entry got_entry
)
1718 gold_assert(i
< this->entries_
.size());
1719 this->entries_
[i
] = got_entry
;
1722 // Output_data_dynamic::Dynamic_entry methods.
1724 // Write out the entry.
1726 template<int size
, bool big_endian
>
1728 Output_data_dynamic::Dynamic_entry::write(
1730 const Stringpool
* pool
) const
1732 typename
elfcpp::Elf_types
<size
>::Elf_WXword val
;
1733 switch (this->offset_
)
1735 case DYNAMIC_NUMBER
:
1739 case DYNAMIC_SECTION_SIZE
:
1740 val
= this->u_
.od
->data_size();
1741 if (this->od2
!= NULL
)
1742 val
+= this->od2
->data_size();
1745 case DYNAMIC_SYMBOL
:
1747 const Sized_symbol
<size
>* s
=
1748 static_cast<const Sized_symbol
<size
>*>(this->u_
.sym
);
1753 case DYNAMIC_STRING
:
1754 val
= pool
->get_offset(this->u_
.str
);
1758 val
= this->u_
.od
->address() + this->offset_
;
1762 elfcpp::Dyn_write
<size
, big_endian
> dw(pov
);
1763 dw
.put_d_tag(this->tag_
);
1767 // Output_data_dynamic methods.
1769 // Adjust the output section to set the entry size.
1772 Output_data_dynamic::do_adjust_output_section(Output_section
* os
)
1774 if (parameters
->target().get_size() == 32)
1775 os
->set_entsize(elfcpp::Elf_sizes
<32>::dyn_size
);
1776 else if (parameters
->target().get_size() == 64)
1777 os
->set_entsize(elfcpp::Elf_sizes
<64>::dyn_size
);
1782 // Set the final data size.
1785 Output_data_dynamic::set_final_data_size()
1787 // Add the terminating entry if it hasn't been added.
1788 // Because of relaxation, we can run this multiple times.
1789 if (this->entries_
.empty() || this->entries_
.back().tag() != elfcpp::DT_NULL
)
1791 int extra
= parameters
->options().spare_dynamic_tags();
1792 for (int i
= 0; i
< extra
; ++i
)
1793 this->add_constant(elfcpp::DT_NULL
, 0);
1794 this->add_constant(elfcpp::DT_NULL
, 0);
1798 if (parameters
->target().get_size() == 32)
1799 dyn_size
= elfcpp::Elf_sizes
<32>::dyn_size
;
1800 else if (parameters
->target().get_size() == 64)
1801 dyn_size
= elfcpp::Elf_sizes
<64>::dyn_size
;
1804 this->set_data_size(this->entries_
.size() * dyn_size
);
1807 // Write out the dynamic entries.
1810 Output_data_dynamic::do_write(Output_file
* of
)
1812 switch (parameters
->size_and_endianness())
1814 #ifdef HAVE_TARGET_32_LITTLE
1815 case Parameters::TARGET_32_LITTLE
:
1816 this->sized_write
<32, false>(of
);
1819 #ifdef HAVE_TARGET_32_BIG
1820 case Parameters::TARGET_32_BIG
:
1821 this->sized_write
<32, true>(of
);
1824 #ifdef HAVE_TARGET_64_LITTLE
1825 case Parameters::TARGET_64_LITTLE
:
1826 this->sized_write
<64, false>(of
);
1829 #ifdef HAVE_TARGET_64_BIG
1830 case Parameters::TARGET_64_BIG
:
1831 this->sized_write
<64, true>(of
);
1839 template<int size
, bool big_endian
>
1841 Output_data_dynamic::sized_write(Output_file
* of
)
1843 const int dyn_size
= elfcpp::Elf_sizes
<size
>::dyn_size
;
1845 const off_t offset
= this->offset();
1846 const off_t oview_size
= this->data_size();
1847 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1849 unsigned char* pov
= oview
;
1850 for (typename
Dynamic_entries::const_iterator p
= this->entries_
.begin();
1851 p
!= this->entries_
.end();
1854 p
->write
<size
, big_endian
>(pov
, this->pool_
);
1858 gold_assert(pov
- oview
== oview_size
);
1860 of
->write_output_view(offset
, oview_size
, oview
);
1862 // We no longer need the dynamic entries.
1863 this->entries_
.clear();
1866 // Class Output_symtab_xindex.
1869 Output_symtab_xindex::do_write(Output_file
* of
)
1871 const off_t offset
= this->offset();
1872 const off_t oview_size
= this->data_size();
1873 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1875 memset(oview
, 0, oview_size
);
1877 if (parameters
->target().is_big_endian())
1878 this->endian_do_write
<true>(oview
);
1880 this->endian_do_write
<false>(oview
);
1882 of
->write_output_view(offset
, oview_size
, oview
);
1884 // We no longer need the data.
1885 this->entries_
.clear();
1888 template<bool big_endian
>
1890 Output_symtab_xindex::endian_do_write(unsigned char* const oview
)
1892 for (Xindex_entries::const_iterator p
= this->entries_
.begin();
1893 p
!= this->entries_
.end();
1896 unsigned int symndx
= p
->first
;
1897 gold_assert(symndx
* 4 < this->data_size());
1898 elfcpp::Swap
<32, big_endian
>::writeval(oview
+ symndx
* 4, p
->second
);
1902 // Output_fill_debug_info methods.
1904 // Return the minimum size needed for a dummy compilation unit header.
1907 Output_fill_debug_info::do_minimum_hole_size() const
1909 // Compile unit header fields: unit_length, version, debug_abbrev_offset,
1911 const size_t len
= 4 + 2 + 4 + 1;
1912 // For type units, add type_signature, type_offset.
1913 if (this->is_debug_types_
)
1918 // Write a dummy compilation unit header to fill a hole in the
1919 // .debug_info or .debug_types section.
1922 Output_fill_debug_info::do_write(Output_file
* of
, off_t off
, size_t len
) const
1924 gold_debug(DEBUG_INCREMENTAL
, "fill_debug_info(%08lx, %08lx)",
1925 static_cast<long>(off
), static_cast<long>(len
));
1927 gold_assert(len
>= this->do_minimum_hole_size());
1929 unsigned char* const oview
= of
->get_output_view(off
, len
);
1930 unsigned char* pov
= oview
;
1932 // Write header fields: unit_length, version, debug_abbrev_offset,
1934 if (this->is_big_endian())
1936 elfcpp::Swap_unaligned
<32, true>::writeval(pov
, len
- 4);
1937 elfcpp::Swap_unaligned
<16, true>::writeval(pov
+ 4, this->version
);
1938 elfcpp::Swap_unaligned
<32, true>::writeval(pov
+ 6, 0);
1942 elfcpp::Swap_unaligned
<32, false>::writeval(pov
, len
- 4);
1943 elfcpp::Swap_unaligned
<16, false>::writeval(pov
+ 4, this->version
);
1944 elfcpp::Swap_unaligned
<32, false>::writeval(pov
+ 6, 0);
1949 // For type units, the additional header fields -- type_signature,
1950 // type_offset -- can be filled with zeroes.
1952 // Fill the remainder of the free space with zeroes. The first
1953 // zero should tell the consumer there are no DIEs to read in this
1954 // compilation unit.
1955 if (pov
< oview
+ len
)
1956 memset(pov
, 0, oview
+ len
- pov
);
1958 of
->write_output_view(off
, len
, oview
);
1961 // Output_fill_debug_line methods.
1963 // Return the minimum size needed for a dummy line number program header.
1966 Output_fill_debug_line::do_minimum_hole_size() const
1968 // Line number program header fields: unit_length, version, header_length,
1969 // minimum_instruction_length, default_is_stmt, line_base, line_range,
1970 // opcode_base, standard_opcode_lengths[], include_directories, filenames.
1971 const size_t len
= 4 + 2 + 4 + this->header_length
;
1975 // Write a dummy line number program header to fill a hole in the
1976 // .debug_line section.
1979 Output_fill_debug_line::do_write(Output_file
* of
, off_t off
, size_t len
) const
1981 gold_debug(DEBUG_INCREMENTAL
, "fill_debug_line(%08lx, %08lx)",
1982 static_cast<long>(off
), static_cast<long>(len
));
1984 gold_assert(len
>= this->do_minimum_hole_size());
1986 unsigned char* const oview
= of
->get_output_view(off
, len
);
1987 unsigned char* pov
= oview
;
1989 // Write header fields: unit_length, version, header_length,
1990 // minimum_instruction_length, default_is_stmt, line_base, line_range,
1991 // opcode_base, standard_opcode_lengths[], include_directories, filenames.
1992 // We set the header_length field to cover the entire hole, so the
1993 // line number program is empty.
1994 if (this->is_big_endian())
1996 elfcpp::Swap_unaligned
<32, true>::writeval(pov
, len
- 4);
1997 elfcpp::Swap_unaligned
<16, true>::writeval(pov
+ 4, this->version
);
1998 elfcpp::Swap_unaligned
<32, true>::writeval(pov
+ 6, len
- (4 + 2 + 4));
2002 elfcpp::Swap_unaligned
<32, false>::writeval(pov
, len
- 4);
2003 elfcpp::Swap_unaligned
<16, false>::writeval(pov
+ 4, this->version
);
2004 elfcpp::Swap_unaligned
<32, false>::writeval(pov
+ 6, len
- (4 + 2 + 4));
2007 *pov
++ = 1; // minimum_instruction_length
2008 *pov
++ = 0; // default_is_stmt
2009 *pov
++ = 0; // line_base
2010 *pov
++ = 5; // line_range
2011 *pov
++ = 13; // opcode_base
2012 *pov
++ = 0; // standard_opcode_lengths[1]
2013 *pov
++ = 1; // standard_opcode_lengths[2]
2014 *pov
++ = 1; // standard_opcode_lengths[3]
2015 *pov
++ = 1; // standard_opcode_lengths[4]
2016 *pov
++ = 1; // standard_opcode_lengths[5]
2017 *pov
++ = 0; // standard_opcode_lengths[6]
2018 *pov
++ = 0; // standard_opcode_lengths[7]
2019 *pov
++ = 0; // standard_opcode_lengths[8]
2020 *pov
++ = 1; // standard_opcode_lengths[9]
2021 *pov
++ = 0; // standard_opcode_lengths[10]
2022 *pov
++ = 0; // standard_opcode_lengths[11]
2023 *pov
++ = 1; // standard_opcode_lengths[12]
2024 *pov
++ = 0; // include_directories (empty)
2025 *pov
++ = 0; // filenames (empty)
2027 // Some consumers don't check the header_length field, and simply
2028 // start reading the line number program immediately following the
2029 // header. For those consumers, we fill the remainder of the free
2030 // space with DW_LNS_set_basic_block opcodes. These are effectively
2031 // no-ops: the resulting line table program will not create any rows.
2032 if (pov
< oview
+ len
)
2033 memset(pov
, elfcpp::DW_LNS_set_basic_block
, oview
+ len
- pov
);
2035 of
->write_output_view(off
, len
, oview
);
2038 // Output_section::Input_section methods.
2040 // Return the current data size. For an input section we store the size here.
2041 // For an Output_section_data, we have to ask it for the size.
2044 Output_section::Input_section::current_data_size() const
2046 if (this->is_input_section())
2047 return this->u1_
.data_size
;
2050 this->u2_
.posd
->pre_finalize_data_size();
2051 return this->u2_
.posd
->current_data_size();
2055 // Return the data size. For an input section we store the size here.
2056 // For an Output_section_data, we have to ask it for the size.
2059 Output_section::Input_section::data_size() const
2061 if (this->is_input_section())
2062 return this->u1_
.data_size
;
2064 return this->u2_
.posd
->data_size();
2067 // Return the object for an input section.
2070 Output_section::Input_section::relobj() const
2072 if (this->is_input_section())
2073 return this->u2_
.object
;
2074 else if (this->is_merge_section())
2076 gold_assert(this->u2_
.pomb
->first_relobj() != NULL
);
2077 return this->u2_
.pomb
->first_relobj();
2079 else if (this->is_relaxed_input_section())
2080 return this->u2_
.poris
->relobj();
2085 // Return the input section index for an input section.
2088 Output_section::Input_section::shndx() const
2090 if (this->is_input_section())
2091 return this->shndx_
;
2092 else if (this->is_merge_section())
2094 gold_assert(this->u2_
.pomb
->first_relobj() != NULL
);
2095 return this->u2_
.pomb
->first_shndx();
2097 else if (this->is_relaxed_input_section())
2098 return this->u2_
.poris
->shndx();
2103 // Set the address and file offset.
2106 Output_section::Input_section::set_address_and_file_offset(
2109 off_t section_file_offset
)
2111 if (this->is_input_section())
2112 this->u2_
.object
->set_section_offset(this->shndx_
,
2113 file_offset
- section_file_offset
);
2115 this->u2_
.posd
->set_address_and_file_offset(address
, file_offset
);
2118 // Reset the address and file offset.
2121 Output_section::Input_section::reset_address_and_file_offset()
2123 if (!this->is_input_section())
2124 this->u2_
.posd
->reset_address_and_file_offset();
2127 // Finalize the data size.
2130 Output_section::Input_section::finalize_data_size()
2132 if (!this->is_input_section())
2133 this->u2_
.posd
->finalize_data_size();
2136 // Try to turn an input offset into an output offset. We want to
2137 // return the output offset relative to the start of this
2138 // Input_section in the output section.
2141 Output_section::Input_section::output_offset(
2142 const Relobj
* object
,
2144 section_offset_type offset
,
2145 section_offset_type
* poutput
) const
2147 if (!this->is_input_section())
2148 return this->u2_
.posd
->output_offset(object
, shndx
, offset
, poutput
);
2151 if (this->shndx_
!= shndx
|| this->u2_
.object
!= object
)
2158 // Return whether this is the merge section for the input section
2162 Output_section::Input_section::is_merge_section_for(const Relobj
* object
,
2163 unsigned int shndx
) const
2165 if (this->is_input_section())
2167 return this->u2_
.posd
->is_merge_section_for(object
, shndx
);
2170 // Write out the data. We don't have to do anything for an input
2171 // section--they are handled via Object::relocate--but this is where
2172 // we write out the data for an Output_section_data.
2175 Output_section::Input_section::write(Output_file
* of
)
2177 if (!this->is_input_section())
2178 this->u2_
.posd
->write(of
);
2181 // Write the data to a buffer. As for write(), we don't have to do
2182 // anything for an input section.
2185 Output_section::Input_section::write_to_buffer(unsigned char* buffer
)
2187 if (!this->is_input_section())
2188 this->u2_
.posd
->write_to_buffer(buffer
);
2191 // Print to a map file.
2194 Output_section::Input_section::print_to_mapfile(Mapfile
* mapfile
) const
2196 switch (this->shndx_
)
2198 case OUTPUT_SECTION_CODE
:
2199 case MERGE_DATA_SECTION_CODE
:
2200 case MERGE_STRING_SECTION_CODE
:
2201 this->u2_
.posd
->print_to_mapfile(mapfile
);
2204 case RELAXED_INPUT_SECTION_CODE
:
2206 Output_relaxed_input_section
* relaxed_section
=
2207 this->relaxed_input_section();
2208 mapfile
->print_input_section(relaxed_section
->relobj(),
2209 relaxed_section
->shndx());
2213 mapfile
->print_input_section(this->u2_
.object
, this->shndx_
);
2218 // Output_section methods.
2220 // Construct an Output_section. NAME will point into a Stringpool.
2222 Output_section::Output_section(const char* name
, elfcpp::Elf_Word type
,
2223 elfcpp::Elf_Xword flags
)
2228 link_section_(NULL
),
2230 info_section_(NULL
),
2235 order_(ORDER_INVALID
),
2240 first_input_offset_(0),
2242 postprocessing_buffer_(NULL
),
2243 needs_symtab_index_(false),
2244 needs_dynsym_index_(false),
2245 should_link_to_symtab_(false),
2246 should_link_to_dynsym_(false),
2247 after_input_sections_(false),
2248 requires_postprocessing_(false),
2249 found_in_sections_clause_(false),
2250 has_load_address_(false),
2251 info_uses_section_index_(false),
2252 input_section_order_specified_(false),
2253 may_sort_attached_input_sections_(false),
2254 must_sort_attached_input_sections_(false),
2255 attached_input_sections_are_sorted_(false),
2257 is_small_section_(false),
2258 is_large_section_(false),
2259 generate_code_fills_at_write_(false),
2260 is_entsize_zero_(false),
2261 section_offsets_need_adjustment_(false),
2263 always_keeps_input_sections_(false),
2264 has_fixed_layout_(false),
2265 is_patch_space_allowed_(false),
2266 is_unique_segment_(false),
2268 extra_segment_flags_(0),
2269 segment_alignment_(0),
2271 lookup_maps_(new Output_section_lookup_maps
),
2273 free_space_fill_(NULL
),
2276 // An unallocated section has no address. Forcing this means that
2277 // we don't need special treatment for symbols defined in debug
2279 if ((flags
& elfcpp::SHF_ALLOC
) == 0)
2280 this->set_address(0);
2283 Output_section::~Output_section()
2285 delete this->checkpoint_
;
2288 // Set the entry size.
2291 Output_section::set_entsize(uint64_t v
)
2293 if (this->is_entsize_zero_
)
2295 else if (this->entsize_
== 0)
2297 else if (this->entsize_
!= v
)
2300 this->is_entsize_zero_
= 1;
2304 // Add the input section SHNDX, with header SHDR, named SECNAME, in
2305 // OBJECT, to the Output_section. RELOC_SHNDX is the index of a
2306 // relocation section which applies to this section, or 0 if none, or
2307 // -1U if more than one. Return the offset of the input section
2308 // within the output section. Return -1 if the input section will
2309 // receive special handling. In the normal case we don't always keep
2310 // track of input sections for an Output_section. Instead, each
2311 // Object keeps track of the Output_section for each of its input
2312 // sections. However, if HAVE_SECTIONS_SCRIPT is true, we do keep
2313 // track of input sections here; this is used when SECTIONS appears in
2316 template<int size
, bool big_endian
>
2318 Output_section::add_input_section(Layout
* layout
,
2319 Sized_relobj_file
<size
, big_endian
>* object
,
2321 const char* secname
,
2322 const elfcpp::Shdr
<size
, big_endian
>& shdr
,
2323 unsigned int reloc_shndx
,
2324 bool have_sections_script
)
2326 elfcpp::Elf_Xword addralign
= shdr
.get_sh_addralign();
2327 if ((addralign
& (addralign
- 1)) != 0)
2329 object
->error(_("invalid alignment %lu for section \"%s\""),
2330 static_cast<unsigned long>(addralign
), secname
);
2334 if (addralign
> this->addralign_
)
2335 this->addralign_
= addralign
;
2337 typename
elfcpp::Elf_types
<size
>::Elf_WXword sh_flags
= shdr
.get_sh_flags();
2338 uint64_t entsize
= shdr
.get_sh_entsize();
2340 // .debug_str is a mergeable string section, but is not always so
2341 // marked by compilers. Mark manually here so we can optimize.
2342 if (strcmp(secname
, ".debug_str") == 0)
2344 sh_flags
|= (elfcpp::SHF_MERGE
| elfcpp::SHF_STRINGS
);
2348 this->update_flags_for_input_section(sh_flags
);
2349 this->set_entsize(entsize
);
2351 // If this is a SHF_MERGE section, we pass all the input sections to
2352 // a Output_data_merge. We don't try to handle relocations for such
2353 // a section. We don't try to handle empty merge sections--they
2354 // mess up the mappings, and are useless anyhow.
2355 // FIXME: Need to handle merge sections during incremental update.
2356 if ((sh_flags
& elfcpp::SHF_MERGE
) != 0
2358 && shdr
.get_sh_size() > 0
2359 && !parameters
->incremental())
2361 // Keep information about merged input sections for rebuilding fast
2362 // lookup maps if we have sections-script or we do relaxation.
2363 bool keeps_input_sections
= (this->always_keeps_input_sections_
2364 || have_sections_script
2365 || parameters
->target().may_relax());
2367 if (this->add_merge_input_section(object
, shndx
, sh_flags
, entsize
,
2368 addralign
, keeps_input_sections
))
2370 // Tell the relocation routines that they need to call the
2371 // output_offset method to determine the final address.
2376 section_size_type input_section_size
= shdr
.get_sh_size();
2377 section_size_type uncompressed_size
;
2378 if (object
->section_is_compressed(shndx
, &uncompressed_size
))
2379 input_section_size
= uncompressed_size
;
2381 off_t offset_in_section
;
2382 off_t aligned_offset_in_section
;
2383 if (this->has_fixed_layout())
2385 // For incremental updates, find a chunk of unused space in the section.
2386 offset_in_section
= this->free_list_
.allocate(input_section_size
,
2388 if (offset_in_section
== -1)
2389 gold_fallback(_("out of patch space in section %s; "
2390 "relink with --incremental-full"),
2392 aligned_offset_in_section
= offset_in_section
;
2396 offset_in_section
= this->current_data_size_for_child();
2397 aligned_offset_in_section
= align_address(offset_in_section
,
2399 this->set_current_data_size_for_child(aligned_offset_in_section
2400 + input_section_size
);
2403 // Determine if we want to delay code-fill generation until the output
2404 // section is written. When the target is relaxing, we want to delay fill
2405 // generating to avoid adjusting them during relaxation. Also, if we are
2406 // sorting input sections we must delay fill generation.
2407 if (!this->generate_code_fills_at_write_
2408 && !have_sections_script
2409 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2410 && parameters
->target().has_code_fill()
2411 && (parameters
->target().may_relax()
2412 || layout
->is_section_ordering_specified()))
2414 gold_assert(this->fills_
.empty());
2415 this->generate_code_fills_at_write_
= true;
2418 if (aligned_offset_in_section
> offset_in_section
2419 && !this->generate_code_fills_at_write_
2420 && !have_sections_script
2421 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2422 && parameters
->target().has_code_fill())
2424 // We need to add some fill data. Using fill_list_ when
2425 // possible is an optimization, since we will often have fill
2426 // sections without input sections.
2427 off_t fill_len
= aligned_offset_in_section
- offset_in_section
;
2428 if (this->input_sections_
.empty())
2429 this->fills_
.push_back(Fill(offset_in_section
, fill_len
));
2432 std::string
fill_data(parameters
->target().code_fill(fill_len
));
2433 Output_data_const
* odc
= new Output_data_const(fill_data
, 1);
2434 this->input_sections_
.push_back(Input_section(odc
));
2438 // We need to keep track of this section if we are already keeping
2439 // track of sections, or if we are relaxing. Also, if this is a
2440 // section which requires sorting, or which may require sorting in
2441 // the future, we keep track of the sections. If the
2442 // --section-ordering-file option is used to specify the order of
2443 // sections, we need to keep track of sections.
2444 if (this->always_keeps_input_sections_
2445 || have_sections_script
2446 || !this->input_sections_
.empty()
2447 || this->may_sort_attached_input_sections()
2448 || this->must_sort_attached_input_sections()
2449 || parameters
->options().user_set_Map()
2450 || parameters
->target().may_relax()
2451 || layout
->is_section_ordering_specified())
2453 Input_section
isecn(object
, shndx
, input_section_size
, addralign
);
2454 /* If section ordering is requested by specifying a ordering file,
2455 using --section-ordering-file, match the section name with
2457 if (parameters
->options().section_ordering_file())
2459 unsigned int section_order_index
=
2460 layout
->find_section_order_index(std::string(secname
));
2461 if (section_order_index
!= 0)
2463 isecn
.set_section_order_index(section_order_index
);
2464 this->set_input_section_order_specified();
2467 if (this->has_fixed_layout())
2469 // For incremental updates, finalize the address and offset now.
2470 uint64_t addr
= this->address();
2471 isecn
.set_address_and_file_offset(addr
+ aligned_offset_in_section
,
2472 aligned_offset_in_section
,
2475 this->input_sections_
.push_back(isecn
);
2478 return aligned_offset_in_section
;
2481 // Add arbitrary data to an output section.
2484 Output_section::add_output_section_data(Output_section_data
* posd
)
2486 Input_section
inp(posd
);
2487 this->add_output_section_data(&inp
);
2489 if (posd
->is_data_size_valid())
2491 off_t offset_in_section
;
2492 if (this->has_fixed_layout())
2494 // For incremental updates, find a chunk of unused space.
2495 offset_in_section
= this->free_list_
.allocate(posd
->data_size(),
2496 posd
->addralign(), 0);
2497 if (offset_in_section
== -1)
2498 gold_fallback(_("out of patch space in section %s; "
2499 "relink with --incremental-full"),
2501 // Finalize the address and offset now.
2502 uint64_t addr
= this->address();
2503 off_t offset
= this->offset();
2504 posd
->set_address_and_file_offset(addr
+ offset_in_section
,
2505 offset
+ offset_in_section
);
2509 offset_in_section
= this->current_data_size_for_child();
2510 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2512 this->set_current_data_size_for_child(aligned_offset_in_section
2513 + posd
->data_size());
2516 else if (this->has_fixed_layout())
2518 // For incremental updates, arrange for the data to have a fixed layout.
2519 // This will mean that additions to the data must be allocated from
2520 // free space within the containing output section.
2521 uint64_t addr
= this->address();
2522 posd
->set_address(addr
);
2523 posd
->set_file_offset(0);
2524 // FIXME: This should eventually be unreachable.
2525 // gold_unreachable();
2529 // Add a relaxed input section.
2532 Output_section::add_relaxed_input_section(Layout
* layout
,
2533 Output_relaxed_input_section
* poris
,
2534 const std::string
& name
)
2536 Input_section
inp(poris
);
2538 // If the --section-ordering-file option is used to specify the order of
2539 // sections, we need to keep track of sections.
2540 if (layout
->is_section_ordering_specified())
2542 unsigned int section_order_index
=
2543 layout
->find_section_order_index(name
);
2544 if (section_order_index
!= 0)
2546 inp
.set_section_order_index(section_order_index
);
2547 this->set_input_section_order_specified();
2551 this->add_output_section_data(&inp
);
2552 if (this->lookup_maps_
->is_valid())
2553 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2554 poris
->shndx(), poris
);
2556 // For a relaxed section, we use the current data size. Linker scripts
2557 // get all the input sections, including relaxed one from an output
2558 // section and add them back to them same output section to compute the
2559 // output section size. If we do not account for sizes of relaxed input
2560 // sections, an output section would be incorrectly sized.
2561 off_t offset_in_section
= this->current_data_size_for_child();
2562 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2563 poris
->addralign());
2564 this->set_current_data_size_for_child(aligned_offset_in_section
2565 + poris
->current_data_size());
2568 // Add arbitrary data to an output section by Input_section.
2571 Output_section::add_output_section_data(Input_section
* inp
)
2573 if (this->input_sections_
.empty())
2574 this->first_input_offset_
= this->current_data_size_for_child();
2576 this->input_sections_
.push_back(*inp
);
2578 uint64_t addralign
= inp
->addralign();
2579 if (addralign
> this->addralign_
)
2580 this->addralign_
= addralign
;
2582 inp
->set_output_section(this);
2585 // Add a merge section to an output section.
2588 Output_section::add_output_merge_section(Output_section_data
* posd
,
2589 bool is_string
, uint64_t entsize
)
2591 Input_section
inp(posd
, is_string
, entsize
);
2592 this->add_output_section_data(&inp
);
2595 // Add an input section to a SHF_MERGE section.
2598 Output_section::add_merge_input_section(Relobj
* object
, unsigned int shndx
,
2599 uint64_t flags
, uint64_t entsize
,
2601 bool keeps_input_sections
)
2603 bool is_string
= (flags
& elfcpp::SHF_STRINGS
) != 0;
2605 // We only merge strings if the alignment is not more than the
2606 // character size. This could be handled, but it's unusual.
2607 if (is_string
&& addralign
> entsize
)
2610 // We cannot restore merged input section states.
2611 gold_assert(this->checkpoint_
== NULL
);
2613 // Look up merge sections by required properties.
2614 // Currently, we only invalidate the lookup maps in script processing
2615 // and relaxation. We should not have done either when we reach here.
2616 // So we assume that the lookup maps are valid to simply code.
2617 gold_assert(this->lookup_maps_
->is_valid());
2618 Merge_section_properties
msp(is_string
, entsize
, addralign
);
2619 Output_merge_base
* pomb
= this->lookup_maps_
->find_merge_section(msp
);
2620 bool is_new
= false;
2623 gold_assert(pomb
->is_string() == is_string
2624 && pomb
->entsize() == entsize
2625 && pomb
->addralign() == addralign
);
2629 // Create a new Output_merge_data or Output_merge_string_data.
2631 pomb
= new Output_merge_data(entsize
, addralign
);
2637 pomb
= new Output_merge_string
<char>(addralign
);
2640 pomb
= new Output_merge_string
<uint16_t>(addralign
);
2643 pomb
= new Output_merge_string
<uint32_t>(addralign
);
2649 // If we need to do script processing or relaxation, we need to keep
2650 // the original input sections to rebuild the fast lookup maps.
2651 if (keeps_input_sections
)
2652 pomb
->set_keeps_input_sections();
2656 if (pomb
->add_input_section(object
, shndx
))
2658 // Add new merge section to this output section and link merge
2659 // section properties to new merge section in map.
2662 this->add_output_merge_section(pomb
, is_string
, entsize
);
2663 this->lookup_maps_
->add_merge_section(msp
, pomb
);
2666 // Add input section to new merge section and link input section to new
2667 // merge section in map.
2668 this->lookup_maps_
->add_merge_input_section(object
, shndx
, pomb
);
2673 // If add_input_section failed, delete new merge section to avoid
2674 // exporting empty merge sections in Output_section::get_input_section.
2681 // Build a relaxation map to speed up relaxation of existing input sections.
2682 // Look up to the first LIMIT elements in INPUT_SECTIONS.
2685 Output_section::build_relaxation_map(
2686 const Input_section_list
& input_sections
,
2688 Relaxation_map
* relaxation_map
) const
2690 for (size_t i
= 0; i
< limit
; ++i
)
2692 const Input_section
& is(input_sections
[i
]);
2693 if (is
.is_input_section() || is
.is_relaxed_input_section())
2695 Section_id
sid(is
.relobj(), is
.shndx());
2696 (*relaxation_map
)[sid
] = i
;
2701 // Convert regular input sections in INPUT_SECTIONS into relaxed input
2702 // sections in RELAXED_SECTIONS. MAP is a prebuilt map from section id
2703 // indices of INPUT_SECTIONS.
2706 Output_section::convert_input_sections_in_list_to_relaxed_sections(
2707 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
,
2708 const Relaxation_map
& map
,
2709 Input_section_list
* input_sections
)
2711 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2713 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2714 Section_id
sid(poris
->relobj(), poris
->shndx());
2715 Relaxation_map::const_iterator p
= map
.find(sid
);
2716 gold_assert(p
!= map
.end());
2717 gold_assert((*input_sections
)[p
->second
].is_input_section());
2719 // Remember section order index of original input section
2720 // if it is set. Copy it to the relaxed input section.
2722 (*input_sections
)[p
->second
].section_order_index();
2723 (*input_sections
)[p
->second
] = Input_section(poris
);
2724 (*input_sections
)[p
->second
].set_section_order_index(soi
);
2728 // Convert regular input sections into relaxed input sections. RELAXED_SECTIONS
2729 // is a vector of pointers to Output_relaxed_input_section or its derived
2730 // classes. The relaxed sections must correspond to existing input sections.
2733 Output_section::convert_input_sections_to_relaxed_sections(
2734 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
)
2736 gold_assert(parameters
->target().may_relax());
2738 // We want to make sure that restore_states does not undo the effect of
2739 // this. If there is no checkpoint active, just search the current
2740 // input section list and replace the sections there. If there is
2741 // a checkpoint, also replace the sections there.
2743 // By default, we look at the whole list.
2744 size_t limit
= this->input_sections_
.size();
2746 if (this->checkpoint_
!= NULL
)
2748 // Replace input sections with relaxed input section in the saved
2749 // copy of the input section list.
2750 if (this->checkpoint_
->input_sections_saved())
2753 this->build_relaxation_map(
2754 *(this->checkpoint_
->input_sections()),
2755 this->checkpoint_
->input_sections()->size(),
2757 this->convert_input_sections_in_list_to_relaxed_sections(
2760 this->checkpoint_
->input_sections());
2764 // We have not copied the input section list yet. Instead, just
2765 // look at the portion that would be saved.
2766 limit
= this->checkpoint_
->input_sections_size();
2770 // Convert input sections in input_section_list.
2772 this->build_relaxation_map(this->input_sections_
, limit
, &map
);
2773 this->convert_input_sections_in_list_to_relaxed_sections(
2776 &this->input_sections_
);
2778 // Update fast look-up map.
2779 if (this->lookup_maps_
->is_valid())
2780 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2782 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2783 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2784 poris
->shndx(), poris
);
2788 // Update the output section flags based on input section flags.
2791 Output_section::update_flags_for_input_section(elfcpp::Elf_Xword flags
)
2793 // If we created the section with SHF_ALLOC clear, we set the
2794 // address. If we are now setting the SHF_ALLOC flag, we need to
2796 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0
2797 && (flags
& elfcpp::SHF_ALLOC
) != 0)
2798 this->mark_address_invalid();
2800 this->flags_
|= (flags
2801 & (elfcpp::SHF_WRITE
2803 | elfcpp::SHF_EXECINSTR
));
2805 if ((flags
& elfcpp::SHF_MERGE
) == 0)
2806 this->flags_
&=~ elfcpp::SHF_MERGE
;
2809 if (this->current_data_size_for_child() == 0)
2810 this->flags_
|= elfcpp::SHF_MERGE
;
2813 if ((flags
& elfcpp::SHF_STRINGS
) == 0)
2814 this->flags_
&=~ elfcpp::SHF_STRINGS
;
2817 if (this->current_data_size_for_child() == 0)
2818 this->flags_
|= elfcpp::SHF_STRINGS
;
2822 // Find the merge section into which an input section with index SHNDX in
2823 // OBJECT has been added. Return NULL if none found.
2825 Output_section_data
*
2826 Output_section::find_merge_section(const Relobj
* object
,
2827 unsigned int shndx
) const
2829 if (!this->lookup_maps_
->is_valid())
2830 this->build_lookup_maps();
2831 return this->lookup_maps_
->find_merge_section(object
, shndx
);
2834 // Build the lookup maps for merge and relaxed sections. This is needs
2835 // to be declared as a const methods so that it is callable with a const
2836 // Output_section pointer. The method only updates states of the maps.
2839 Output_section::build_lookup_maps() const
2841 this->lookup_maps_
->clear();
2842 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2843 p
!= this->input_sections_
.end();
2846 if (p
->is_merge_section())
2848 Output_merge_base
* pomb
= p
->output_merge_base();
2849 Merge_section_properties
msp(pomb
->is_string(), pomb
->entsize(),
2851 this->lookup_maps_
->add_merge_section(msp
, pomb
);
2852 for (Output_merge_base::Input_sections::const_iterator is
=
2853 pomb
->input_sections_begin();
2854 is
!= pomb
->input_sections_end();
2857 const Const_section_id
& csid
= *is
;
2858 this->lookup_maps_
->add_merge_input_section(csid
.first
,
2863 else if (p
->is_relaxed_input_section())
2865 Output_relaxed_input_section
* poris
= p
->relaxed_input_section();
2866 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2867 poris
->shndx(), poris
);
2872 // Find an relaxed input section corresponding to an input section
2873 // in OBJECT with index SHNDX.
2875 const Output_relaxed_input_section
*
2876 Output_section::find_relaxed_input_section(const Relobj
* object
,
2877 unsigned int shndx
) const
2879 if (!this->lookup_maps_
->is_valid())
2880 this->build_lookup_maps();
2881 return this->lookup_maps_
->find_relaxed_input_section(object
, shndx
);
2884 // Given an address OFFSET relative to the start of input section
2885 // SHNDX in OBJECT, return whether this address is being included in
2886 // the final link. This should only be called if SHNDX in OBJECT has
2887 // a special mapping.
2890 Output_section::is_input_address_mapped(const Relobj
* object
,
2894 // Look at the Output_section_data_maps first.
2895 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2897 posd
= this->find_relaxed_input_section(object
, shndx
);
2901 section_offset_type output_offset
;
2902 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2904 return output_offset
!= -1;
2907 // Fall back to the slow look-up.
2908 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2909 p
!= this->input_sections_
.end();
2912 section_offset_type output_offset
;
2913 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2914 return output_offset
!= -1;
2917 // By default we assume that the address is mapped. This should
2918 // only be called after we have passed all sections to Layout. At
2919 // that point we should know what we are discarding.
2923 // Given an address OFFSET relative to the start of input section
2924 // SHNDX in object OBJECT, return the output offset relative to the
2925 // start of the input section in the output section. This should only
2926 // be called if SHNDX in OBJECT has a special mapping.
2929 Output_section::output_offset(const Relobj
* object
, unsigned int shndx
,
2930 section_offset_type offset
) const
2932 // This can only be called meaningfully when we know the data size
2934 gold_assert(this->is_data_size_valid());
2936 // Look at the Output_section_data_maps first.
2937 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2939 posd
= this->find_relaxed_input_section(object
, shndx
);
2942 section_offset_type output_offset
;
2943 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2945 return output_offset
;
2948 // Fall back to the slow look-up.
2949 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2950 p
!= this->input_sections_
.end();
2953 section_offset_type output_offset
;
2954 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2955 return output_offset
;
2960 // Return the output virtual address of OFFSET relative to the start
2961 // of input section SHNDX in object OBJECT.
2964 Output_section::output_address(const Relobj
* object
, unsigned int shndx
,
2967 uint64_t addr
= this->address() + this->first_input_offset_
;
2969 // Look at the Output_section_data_maps first.
2970 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2972 posd
= this->find_relaxed_input_section(object
, shndx
);
2973 if (posd
!= NULL
&& posd
->is_address_valid())
2975 section_offset_type output_offset
;
2976 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2978 return posd
->address() + output_offset
;
2981 // Fall back to the slow look-up.
2982 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2983 p
!= this->input_sections_
.end();
2986 addr
= align_address(addr
, p
->addralign());
2987 section_offset_type output_offset
;
2988 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2990 if (output_offset
== -1)
2992 return addr
+ output_offset
;
2994 addr
+= p
->data_size();
2997 // If we get here, it means that we don't know the mapping for this
2998 // input section. This might happen in principle if
2999 // add_input_section were called before add_output_section_data.
3000 // But it should never actually happen.
3005 // Find the output address of the start of the merged section for
3006 // input section SHNDX in object OBJECT.
3009 Output_section::find_starting_output_address(const Relobj
* object
,
3011 uint64_t* paddr
) const
3013 // FIXME: This becomes a bottle-neck if we have many relaxed sections.
3014 // Looking up the merge section map does not always work as we sometimes
3015 // find a merge section without its address set.
3016 uint64_t addr
= this->address() + this->first_input_offset_
;
3017 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
3018 p
!= this->input_sections_
.end();
3021 addr
= align_address(addr
, p
->addralign());
3023 // It would be nice if we could use the existing output_offset
3024 // method to get the output offset of input offset 0.
3025 // Unfortunately we don't know for sure that input offset 0 is
3027 if (p
->is_merge_section_for(object
, shndx
))
3033 addr
+= p
->data_size();
3036 // We couldn't find a merge output section for this input section.
3040 // Update the data size of an Output_section.
3043 Output_section::update_data_size()
3045 if (this->input_sections_
.empty())
3048 if (this->must_sort_attached_input_sections()
3049 || this->input_section_order_specified())
3050 this->sort_attached_input_sections();
3052 off_t off
= this->first_input_offset_
;
3053 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3054 p
!= this->input_sections_
.end();
3057 off
= align_address(off
, p
->addralign());
3058 off
+= p
->current_data_size();
3061 this->set_current_data_size_for_child(off
);
3064 // Set the data size of an Output_section. This is where we handle
3065 // setting the addresses of any Output_section_data objects.
3068 Output_section::set_final_data_size()
3072 if (this->input_sections_
.empty())
3073 data_size
= this->current_data_size_for_child();
3076 if (this->must_sort_attached_input_sections()
3077 || this->input_section_order_specified())
3078 this->sort_attached_input_sections();
3080 uint64_t address
= this->address();
3081 off_t startoff
= this->offset();
3082 off_t off
= startoff
+ this->first_input_offset_
;
3083 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3084 p
!= this->input_sections_
.end();
3087 off
= align_address(off
, p
->addralign());
3088 p
->set_address_and_file_offset(address
+ (off
- startoff
), off
,
3090 off
+= p
->data_size();
3092 data_size
= off
- startoff
;
3095 // For full incremental links, we want to allocate some patch space
3096 // in most sections for subsequent incremental updates.
3097 if (this->is_patch_space_allowed_
&& parameters
->incremental_full())
3099 double pct
= parameters
->options().incremental_patch();
3100 size_t extra
= static_cast<size_t>(data_size
* pct
);
3101 if (this->free_space_fill_
!= NULL
3102 && this->free_space_fill_
->minimum_hole_size() > extra
)
3103 extra
= this->free_space_fill_
->minimum_hole_size();
3104 off_t new_size
= align_address(data_size
+ extra
, this->addralign());
3105 this->patch_space_
= new_size
- data_size
;
3106 gold_debug(DEBUG_INCREMENTAL
,
3107 "set_final_data_size: %08lx + %08lx: section %s",
3108 static_cast<long>(data_size
),
3109 static_cast<long>(this->patch_space_
),
3111 data_size
= new_size
;
3114 this->set_data_size(data_size
);
3117 // Reset the address and file offset.
3120 Output_section::do_reset_address_and_file_offset()
3122 // An unallocated section has no address. Forcing this means that
3123 // we don't need special treatment for symbols defined in debug
3124 // sections. We do the same in the constructor. This does not
3125 // apply to NOLOAD sections though.
3126 if (((this->flags_
& elfcpp::SHF_ALLOC
) == 0) && !this->is_noload_
)
3127 this->set_address(0);
3129 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3130 p
!= this->input_sections_
.end();
3132 p
->reset_address_and_file_offset();
3134 // Remove any patch space that was added in set_final_data_size.
3135 if (this->patch_space_
> 0)
3137 this->set_current_data_size_for_child(this->current_data_size_for_child()
3138 - this->patch_space_
);
3139 this->patch_space_
= 0;
3143 // Return true if address and file offset have the values after reset.
3146 Output_section::do_address_and_file_offset_have_reset_values() const
3148 if (this->is_offset_valid())
3151 // An unallocated section has address 0 after its construction or a reset.
3152 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0)
3153 return this->is_address_valid() && this->address() == 0;
3155 return !this->is_address_valid();
3158 // Set the TLS offset. Called only for SHT_TLS sections.
3161 Output_section::do_set_tls_offset(uint64_t tls_base
)
3163 this->tls_offset_
= this->address() - tls_base
;
3166 // In a few cases we need to sort the input sections attached to an
3167 // output section. This is used to implement the type of constructor
3168 // priority ordering implemented by the GNU linker, in which the
3169 // priority becomes part of the section name and the sections are
3170 // sorted by name. We only do this for an output section if we see an
3171 // attached input section matching ".ctors.*", ".dtors.*",
3172 // ".init_array.*" or ".fini_array.*".
3174 class Output_section::Input_section_sort_entry
3177 Input_section_sort_entry()
3178 : input_section_(), index_(-1U), section_has_name_(false),
3182 Input_section_sort_entry(const Input_section
& input_section
,
3184 bool must_sort_attached_input_sections
)
3185 : input_section_(input_section
), index_(index
),
3186 section_has_name_(input_section
.is_input_section()
3187 || input_section
.is_relaxed_input_section())
3189 if (this->section_has_name_
3190 && must_sort_attached_input_sections
)
3192 // This is only called single-threaded from Layout::finalize,
3193 // so it is OK to lock. Unfortunately we have no way to pass
3195 const Task
* dummy_task
= reinterpret_cast<const Task
*>(-1);
3196 Object
* obj
= (input_section
.is_input_section()
3197 ? input_section
.relobj()
3198 : input_section
.relaxed_input_section()->relobj());
3199 Task_lock_obj
<Object
> tl(dummy_task
, obj
);
3201 // This is a slow operation, which should be cached in
3202 // Layout::layout if this becomes a speed problem.
3203 this->section_name_
= obj
->section_name(input_section
.shndx());
3207 // Return the Input_section.
3208 const Input_section
&
3209 input_section() const
3211 gold_assert(this->index_
!= -1U);
3212 return this->input_section_
;
3215 // The index of this entry in the original list. This is used to
3216 // make the sort stable.
3220 gold_assert(this->index_
!= -1U);
3221 return this->index_
;
3224 // Whether there is a section name.
3226 section_has_name() const
3227 { return this->section_has_name_
; }
3229 // The section name.
3231 section_name() const
3233 gold_assert(this->section_has_name_
);
3234 return this->section_name_
;
3237 // Return true if the section name has a priority. This is assumed
3238 // to be true if it has a dot after the initial dot.
3240 has_priority() const
3242 gold_assert(this->section_has_name_
);
3243 return this->section_name_
.find('.', 1) != std::string::npos
;
3246 // Return the priority. Believe it or not, gcc encodes the priority
3247 // differently for .ctors/.dtors and .init_array/.fini_array
3250 get_priority() const
3252 gold_assert(this->section_has_name_
);
3254 if (is_prefix_of(".ctors.", this->section_name_
.c_str())
3255 || is_prefix_of(".dtors.", this->section_name_
.c_str()))
3257 else if (is_prefix_of(".init_array.", this->section_name_
.c_str())
3258 || is_prefix_of(".fini_array.", this->section_name_
.c_str()))
3263 unsigned long prio
= strtoul((this->section_name_
.c_str()
3264 + (is_ctors
? 7 : 12)),
3269 return 65535 - prio
;
3274 // Return true if this an input file whose base name matches
3275 // FILE_NAME. The base name must have an extension of ".o", and
3276 // must be exactly FILE_NAME.o or FILE_NAME, one character, ".o".
3277 // This is to match crtbegin.o as well as crtbeginS.o without
3278 // getting confused by other possibilities. Overall matching the
3279 // file name this way is a dreadful hack, but the GNU linker does it
3280 // in order to better support gcc, and we need to be compatible.
3282 match_file_name(const char* file_name
) const
3283 { return Layout::match_file_name(this->input_section_
.relobj(), file_name
); }
3285 // Returns 1 if THIS should appear before S in section order, -1 if S
3286 // appears before THIS and 0 if they are not comparable.
3288 compare_section_ordering(const Input_section_sort_entry
& s
) const
3290 unsigned int this_secn_index
= this->input_section_
.section_order_index();
3291 unsigned int s_secn_index
= s
.input_section().section_order_index();
3292 if (this_secn_index
> 0 && s_secn_index
> 0)
3294 if (this_secn_index
< s_secn_index
)
3296 else if (this_secn_index
> s_secn_index
)
3303 // The Input_section we are sorting.
3304 Input_section input_section_
;
3305 // The index of this Input_section in the original list.
3306 unsigned int index_
;
3307 // Whether this Input_section has a section name--it won't if this
3308 // is some random Output_section_data.
3309 bool section_has_name_
;
3310 // The section name if there is one.
3311 std::string section_name_
;
3314 // Return true if S1 should come before S2 in the output section.
3317 Output_section::Input_section_sort_compare::operator()(
3318 const Output_section::Input_section_sort_entry
& s1
,
3319 const Output_section::Input_section_sort_entry
& s2
) const
3321 // crtbegin.o must come first.
3322 bool s1_begin
= s1
.match_file_name("crtbegin");
3323 bool s2_begin
= s2
.match_file_name("crtbegin");
3324 if (s1_begin
|| s2_begin
)
3330 return s1
.index() < s2
.index();
3333 // crtend.o must come last.
3334 bool s1_end
= s1
.match_file_name("crtend");
3335 bool s2_end
= s2
.match_file_name("crtend");
3336 if (s1_end
|| s2_end
)
3342 return s1
.index() < s2
.index();
3345 // We sort all the sections with no names to the end.
3346 if (!s1
.section_has_name() || !s2
.section_has_name())
3348 if (s1
.section_has_name())
3350 if (s2
.section_has_name())
3352 return s1
.index() < s2
.index();
3355 // A section with a priority follows a section without a priority.
3356 bool s1_has_priority
= s1
.has_priority();
3357 bool s2_has_priority
= s2
.has_priority();
3358 if (s1_has_priority
&& !s2_has_priority
)
3360 if (!s1_has_priority
&& s2_has_priority
)
3363 // Check if a section order exists for these sections through a section
3364 // ordering file. If sequence_num is 0, an order does not exist.
3365 int sequence_num
= s1
.compare_section_ordering(s2
);
3366 if (sequence_num
!= 0)
3367 return sequence_num
== 1;
3369 // Otherwise we sort by name.
3370 int compare
= s1
.section_name().compare(s2
.section_name());
3374 // Otherwise we keep the input order.
3375 return s1
.index() < s2
.index();
3378 // Return true if S1 should come before S2 in an .init_array or .fini_array
3382 Output_section::Input_section_sort_init_fini_compare::operator()(
3383 const Output_section::Input_section_sort_entry
& s1
,
3384 const Output_section::Input_section_sort_entry
& s2
) const
3386 // We sort all the sections with no names to the end.
3387 if (!s1
.section_has_name() || !s2
.section_has_name())
3389 if (s1
.section_has_name())
3391 if (s2
.section_has_name())
3393 return s1
.index() < s2
.index();
3396 // A section without a priority follows a section with a priority.
3397 // This is the reverse of .ctors and .dtors sections.
3398 bool s1_has_priority
= s1
.has_priority();
3399 bool s2_has_priority
= s2
.has_priority();
3400 if (s1_has_priority
&& !s2_has_priority
)
3402 if (!s1_has_priority
&& s2_has_priority
)
3405 // .ctors and .dtors sections without priority come after
3406 // .init_array and .fini_array sections without priority.
3407 if (!s1_has_priority
3408 && (s1
.section_name() == ".ctors" || s1
.section_name() == ".dtors")
3409 && s1
.section_name() != s2
.section_name())
3411 if (!s2_has_priority
3412 && (s2
.section_name() == ".ctors" || s2
.section_name() == ".dtors")
3413 && s2
.section_name() != s1
.section_name())
3416 // Sort by priority if we can.
3417 if (s1_has_priority
)
3419 unsigned int s1_prio
= s1
.get_priority();
3420 unsigned int s2_prio
= s2
.get_priority();
3421 if (s1_prio
< s2_prio
)
3423 else if (s1_prio
> s2_prio
)
3427 // Check if a section order exists for these sections through a section
3428 // ordering file. If sequence_num is 0, an order does not exist.
3429 int sequence_num
= s1
.compare_section_ordering(s2
);
3430 if (sequence_num
!= 0)
3431 return sequence_num
== 1;
3433 // Otherwise we sort by name.
3434 int compare
= s1
.section_name().compare(s2
.section_name());
3438 // Otherwise we keep the input order.
3439 return s1
.index() < s2
.index();
3442 // Return true if S1 should come before S2. Sections that do not match
3443 // any pattern in the section ordering file are placed ahead of the sections
3444 // that match some pattern.
3447 Output_section::Input_section_sort_section_order_index_compare::operator()(
3448 const Output_section::Input_section_sort_entry
& s1
,
3449 const Output_section::Input_section_sort_entry
& s2
) const
3451 unsigned int s1_secn_index
= s1
.input_section().section_order_index();
3452 unsigned int s2_secn_index
= s2
.input_section().section_order_index();
3454 // Keep input order if section ordering cannot determine order.
3455 if (s1_secn_index
== s2_secn_index
)
3456 return s1
.index() < s2
.index();
3458 return s1_secn_index
< s2_secn_index
;
3461 // This updates the section order index of input sections according to the
3462 // the order specified in the mapping from Section id to order index.
3465 Output_section::update_section_layout(
3466 const Section_layout_order
* order_map
)
3468 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3469 p
!= this->input_sections_
.end();
3472 if (p
->is_input_section()
3473 || p
->is_relaxed_input_section())
3475 Object
* obj
= (p
->is_input_section()
3477 : p
->relaxed_input_section()->relobj());
3478 unsigned int shndx
= p
->shndx();
3479 Section_layout_order::const_iterator it
3480 = order_map
->find(Section_id(obj
, shndx
));
3481 if (it
== order_map
->end())
3483 unsigned int section_order_index
= it
->second
;
3484 if (section_order_index
!= 0)
3486 p
->set_section_order_index(section_order_index
);
3487 this->set_input_section_order_specified();
3493 // Sort the input sections attached to an output section.
3496 Output_section::sort_attached_input_sections()
3498 if (this->attached_input_sections_are_sorted_
)
3501 if (this->checkpoint_
!= NULL
3502 && !this->checkpoint_
->input_sections_saved())
3503 this->checkpoint_
->save_input_sections();
3505 // The only thing we know about an input section is the object and
3506 // the section index. We need the section name. Recomputing this
3507 // is slow but this is an unusual case. If this becomes a speed
3508 // problem we can cache the names as required in Layout::layout.
3510 // We start by building a larger vector holding a copy of each
3511 // Input_section, plus its current index in the list and its name.
3512 std::vector
<Input_section_sort_entry
> sort_list
;
3515 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3516 p
!= this->input_sections_
.end();
3518 sort_list
.push_back(Input_section_sort_entry(*p
, i
,
3519 this->must_sort_attached_input_sections()));
3521 // Sort the input sections.
3522 if (this->must_sort_attached_input_sections())
3524 if (this->type() == elfcpp::SHT_PREINIT_ARRAY
3525 || this->type() == elfcpp::SHT_INIT_ARRAY
3526 || this->type() == elfcpp::SHT_FINI_ARRAY
)
3527 std::sort(sort_list
.begin(), sort_list
.end(),
3528 Input_section_sort_init_fini_compare());
3530 std::sort(sort_list
.begin(), sort_list
.end(),
3531 Input_section_sort_compare());
3535 gold_assert(this->input_section_order_specified());
3536 std::sort(sort_list
.begin(), sort_list
.end(),
3537 Input_section_sort_section_order_index_compare());
3540 // Copy the sorted input sections back to our list.
3541 this->input_sections_
.clear();
3542 for (std::vector
<Input_section_sort_entry
>::iterator p
= sort_list
.begin();
3543 p
!= sort_list
.end();
3545 this->input_sections_
.push_back(p
->input_section());
3548 // Remember that we sorted the input sections, since we might get
3550 this->attached_input_sections_are_sorted_
= true;
3553 // Write the section header to *OSHDR.
3555 template<int size
, bool big_endian
>
3557 Output_section::write_header(const Layout
* layout
,
3558 const Stringpool
* secnamepool
,
3559 elfcpp::Shdr_write
<size
, big_endian
>* oshdr
) const
3561 oshdr
->put_sh_name(secnamepool
->get_offset(this->name_
));
3562 oshdr
->put_sh_type(this->type_
);
3564 elfcpp::Elf_Xword flags
= this->flags_
;
3565 if (this->info_section_
!= NULL
&& this->info_uses_section_index_
)
3566 flags
|= elfcpp::SHF_INFO_LINK
;
3567 oshdr
->put_sh_flags(flags
);
3569 oshdr
->put_sh_addr(this->address());
3570 oshdr
->put_sh_offset(this->offset());
3571 oshdr
->put_sh_size(this->data_size());
3572 if (this->link_section_
!= NULL
)
3573 oshdr
->put_sh_link(this->link_section_
->out_shndx());
3574 else if (this->should_link_to_symtab_
)
3575 oshdr
->put_sh_link(layout
->symtab_section_shndx());
3576 else if (this->should_link_to_dynsym_
)
3577 oshdr
->put_sh_link(layout
->dynsym_section()->out_shndx());
3579 oshdr
->put_sh_link(this->link_
);
3581 elfcpp::Elf_Word info
;
3582 if (this->info_section_
!= NULL
)
3584 if (this->info_uses_section_index_
)
3585 info
= this->info_section_
->out_shndx();
3587 info
= this->info_section_
->symtab_index();
3589 else if (this->info_symndx_
!= NULL
)
3590 info
= this->info_symndx_
->symtab_index();
3593 oshdr
->put_sh_info(info
);
3595 oshdr
->put_sh_addralign(this->addralign_
);
3596 oshdr
->put_sh_entsize(this->entsize_
);
3599 // Write out the data. For input sections the data is written out by
3600 // Object::relocate, but we have to handle Output_section_data objects
3604 Output_section::do_write(Output_file
* of
)
3606 gold_assert(!this->requires_postprocessing());
3608 // If the target performs relaxation, we delay filler generation until now.
3609 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
3611 off_t output_section_file_offset
= this->offset();
3612 for (Fill_list::iterator p
= this->fills_
.begin();
3613 p
!= this->fills_
.end();
3616 std::string
fill_data(parameters
->target().code_fill(p
->length()));
3617 of
->write(output_section_file_offset
+ p
->section_offset(),
3618 fill_data
.data(), fill_data
.size());
3621 off_t off
= this->offset() + this->first_input_offset_
;
3622 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3623 p
!= this->input_sections_
.end();
3626 off_t aligned_off
= align_address(off
, p
->addralign());
3627 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
3629 size_t fill_len
= aligned_off
- off
;
3630 std::string
fill_data(parameters
->target().code_fill(fill_len
));
3631 of
->write(off
, fill_data
.data(), fill_data
.size());
3635 off
= aligned_off
+ p
->data_size();
3638 // For incremental links, fill in unused chunks in debug sections
3639 // with dummy compilation unit headers.
3640 if (this->free_space_fill_
!= NULL
)
3642 for (Free_list::Const_iterator p
= this->free_list_
.begin();
3643 p
!= this->free_list_
.end();
3646 off_t off
= p
->start_
;
3647 size_t len
= p
->end_
- off
;
3648 this->free_space_fill_
->write(of
, this->offset() + off
, len
);
3650 if (this->patch_space_
> 0)
3652 off_t off
= this->current_data_size_for_child() - this->patch_space_
;
3653 this->free_space_fill_
->write(of
, this->offset() + off
,
3654 this->patch_space_
);
3659 // If a section requires postprocessing, create the buffer to use.
3662 Output_section::create_postprocessing_buffer()
3664 gold_assert(this->requires_postprocessing());
3666 if (this->postprocessing_buffer_
!= NULL
)
3669 if (!this->input_sections_
.empty())
3671 off_t off
= this->first_input_offset_
;
3672 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3673 p
!= this->input_sections_
.end();
3676 off
= align_address(off
, p
->addralign());
3677 p
->finalize_data_size();
3678 off
+= p
->data_size();
3680 this->set_current_data_size_for_child(off
);
3683 off_t buffer_size
= this->current_data_size_for_child();
3684 this->postprocessing_buffer_
= new unsigned char[buffer_size
];
3687 // Write all the data of an Output_section into the postprocessing
3688 // buffer. This is used for sections which require postprocessing,
3689 // such as compression. Input sections are handled by
3690 // Object::Relocate.
3693 Output_section::write_to_postprocessing_buffer()
3695 gold_assert(this->requires_postprocessing());
3697 // If the target performs relaxation, we delay filler generation until now.
3698 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
3700 unsigned char* buffer
= this->postprocessing_buffer();
3701 for (Fill_list::iterator p
= this->fills_
.begin();
3702 p
!= this->fills_
.end();
3705 std::string
fill_data(parameters
->target().code_fill(p
->length()));
3706 memcpy(buffer
+ p
->section_offset(), fill_data
.data(),
3710 off_t off
= this->first_input_offset_
;
3711 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3712 p
!= this->input_sections_
.end();
3715 off_t aligned_off
= align_address(off
, p
->addralign());
3716 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
3718 size_t fill_len
= aligned_off
- off
;
3719 std::string
fill_data(parameters
->target().code_fill(fill_len
));
3720 memcpy(buffer
+ off
, fill_data
.data(), fill_data
.size());
3723 p
->write_to_buffer(buffer
+ aligned_off
);
3724 off
= aligned_off
+ p
->data_size();
3728 // Get the input sections for linker script processing. We leave
3729 // behind the Output_section_data entries. Note that this may be
3730 // slightly incorrect for merge sections. We will leave them behind,
3731 // but it is possible that the script says that they should follow
3732 // some other input sections, as in:
3733 // .rodata { *(.rodata) *(.rodata.cst*) }
3734 // For that matter, we don't handle this correctly:
3735 // .rodata { foo.o(.rodata.cst*) *(.rodata.cst*) }
3736 // With luck this will never matter.
3739 Output_section::get_input_sections(
3741 const std::string
& fill
,
3742 std::list
<Input_section
>* input_sections
)
3744 if (this->checkpoint_
!= NULL
3745 && !this->checkpoint_
->input_sections_saved())
3746 this->checkpoint_
->save_input_sections();
3748 // Invalidate fast look-up maps.
3749 this->lookup_maps_
->invalidate();
3751 uint64_t orig_address
= address
;
3753 address
= align_address(address
, this->addralign());
3755 Input_section_list remaining
;
3756 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3757 p
!= this->input_sections_
.end();
3760 if (p
->is_input_section()
3761 || p
->is_relaxed_input_section()
3762 || p
->is_merge_section())
3763 input_sections
->push_back(*p
);
3766 uint64_t aligned_address
= align_address(address
, p
->addralign());
3767 if (aligned_address
!= address
&& !fill
.empty())
3769 section_size_type length
=
3770 convert_to_section_size_type(aligned_address
- address
);
3771 std::string this_fill
;
3772 this_fill
.reserve(length
);
3773 while (this_fill
.length() + fill
.length() <= length
)
3775 if (this_fill
.length() < length
)
3776 this_fill
.append(fill
, 0, length
- this_fill
.length());
3778 Output_section_data
* posd
= new Output_data_const(this_fill
, 0);
3779 remaining
.push_back(Input_section(posd
));
3781 address
= aligned_address
;
3783 remaining
.push_back(*p
);
3785 p
->finalize_data_size();
3786 address
+= p
->data_size();
3790 this->input_sections_
.swap(remaining
);
3791 this->first_input_offset_
= 0;
3793 uint64_t data_size
= address
- orig_address
;
3794 this->set_current_data_size_for_child(data_size
);
3798 // Add a script input section. SIS is an Output_section::Input_section,
3799 // which can be either a plain input section or a special input section like
3800 // a relaxed input section. For a special input section, its size must be
3804 Output_section::add_script_input_section(const Input_section
& sis
)
3806 uint64_t data_size
= sis
.data_size();
3807 uint64_t addralign
= sis
.addralign();
3808 if (addralign
> this->addralign_
)
3809 this->addralign_
= addralign
;
3811 off_t offset_in_section
= this->current_data_size_for_child();
3812 off_t aligned_offset_in_section
= align_address(offset_in_section
,
3815 this->set_current_data_size_for_child(aligned_offset_in_section
3818 this->input_sections_
.push_back(sis
);
3820 // Update fast lookup maps if necessary.
3821 if (this->lookup_maps_
->is_valid())
3823 if (sis
.is_merge_section())
3825 Output_merge_base
* pomb
= sis
.output_merge_base();
3826 Merge_section_properties
msp(pomb
->is_string(), pomb
->entsize(),
3828 this->lookup_maps_
->add_merge_section(msp
, pomb
);
3829 for (Output_merge_base::Input_sections::const_iterator p
=
3830 pomb
->input_sections_begin();
3831 p
!= pomb
->input_sections_end();
3833 this->lookup_maps_
->add_merge_input_section(p
->first
, p
->second
,
3836 else if (sis
.is_relaxed_input_section())
3838 Output_relaxed_input_section
* poris
= sis
.relaxed_input_section();
3839 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
3840 poris
->shndx(), poris
);
3845 // Save states for relaxation.
3848 Output_section::save_states()
3850 gold_assert(this->checkpoint_
== NULL
);
3851 Checkpoint_output_section
* checkpoint
=
3852 new Checkpoint_output_section(this->addralign_
, this->flags_
,
3853 this->input_sections_
,
3854 this->first_input_offset_
,
3855 this->attached_input_sections_are_sorted_
);
3856 this->checkpoint_
= checkpoint
;
3857 gold_assert(this->fills_
.empty());
3861 Output_section::discard_states()
3863 gold_assert(this->checkpoint_
!= NULL
);
3864 delete this->checkpoint_
;
3865 this->checkpoint_
= NULL
;
3866 gold_assert(this->fills_
.empty());
3868 // Simply invalidate the fast lookup maps since we do not keep
3870 this->lookup_maps_
->invalidate();
3874 Output_section::restore_states()
3876 gold_assert(this->checkpoint_
!= NULL
);
3877 Checkpoint_output_section
* checkpoint
= this->checkpoint_
;
3879 this->addralign_
= checkpoint
->addralign();
3880 this->flags_
= checkpoint
->flags();
3881 this->first_input_offset_
= checkpoint
->first_input_offset();
3883 if (!checkpoint
->input_sections_saved())
3885 // If we have not copied the input sections, just resize it.
3886 size_t old_size
= checkpoint
->input_sections_size();
3887 gold_assert(this->input_sections_
.size() >= old_size
);
3888 this->input_sections_
.resize(old_size
);
3892 // We need to copy the whole list. This is not efficient for
3893 // extremely large output with hundreads of thousands of input
3894 // objects. We may need to re-think how we should pass sections
3896 this->input_sections_
= *checkpoint
->input_sections();
3899 this->attached_input_sections_are_sorted_
=
3900 checkpoint
->attached_input_sections_are_sorted();
3902 // Simply invalidate the fast lookup maps since we do not keep
3904 this->lookup_maps_
->invalidate();
3907 // Update the section offsets of input sections in this. This is required if
3908 // relaxation causes some input sections to change sizes.
3911 Output_section::adjust_section_offsets()
3913 if (!this->section_offsets_need_adjustment_
)
3917 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3918 p
!= this->input_sections_
.end();
3921 off
= align_address(off
, p
->addralign());
3922 if (p
->is_input_section())
3923 p
->relobj()->set_section_offset(p
->shndx(), off
);
3924 off
+= p
->data_size();
3927 this->section_offsets_need_adjustment_
= false;
3930 // Print to the map file.
3933 Output_section::do_print_to_mapfile(Mapfile
* mapfile
) const
3935 mapfile
->print_output_section(this);
3937 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
3938 p
!= this->input_sections_
.end();
3940 p
->print_to_mapfile(mapfile
);
3943 // Print stats for merge sections to stderr.
3946 Output_section::print_merge_stats()
3948 Input_section_list::iterator p
;
3949 for (p
= this->input_sections_
.begin();
3950 p
!= this->input_sections_
.end();
3952 p
->print_merge_stats(this->name_
);
3955 // Set a fixed layout for the section. Used for incremental update links.
3958 Output_section::set_fixed_layout(uint64_t sh_addr
, off_t sh_offset
,
3959 off_t sh_size
, uint64_t sh_addralign
)
3961 this->addralign_
= sh_addralign
;
3962 this->set_current_data_size(sh_size
);
3963 if ((this->flags_
& elfcpp::SHF_ALLOC
) != 0)
3964 this->set_address(sh_addr
);
3965 this->set_file_offset(sh_offset
);
3966 this->finalize_data_size();
3967 this->free_list_
.init(sh_size
, false);
3968 this->has_fixed_layout_
= true;
3971 // Reserve space within the fixed layout for the section. Used for
3972 // incremental update links.
3975 Output_section::reserve(uint64_t sh_offset
, uint64_t sh_size
)
3977 this->free_list_
.remove(sh_offset
, sh_offset
+ sh_size
);
3980 // Allocate space from the free list for the section. Used for
3981 // incremental update links.
3984 Output_section::allocate(off_t len
, uint64_t addralign
)
3986 return this->free_list_
.allocate(len
, addralign
, 0);
3989 // Output segment methods.
3991 Output_segment::Output_segment(elfcpp::Elf_Word type
, elfcpp::Elf_Word flags
)
4001 is_max_align_known_(false),
4002 are_addresses_set_(false),
4003 is_large_data_segment_(false),
4004 is_unique_segment_(false)
4006 // The ELF ABI specifies that a PT_TLS segment always has PF_R as
4008 if (type
== elfcpp::PT_TLS
)
4009 this->flags_
= elfcpp::PF_R
;
4012 // Add an Output_section to a PT_LOAD Output_segment.
4015 Output_segment::add_output_section_to_load(Layout
* layout
,
4017 elfcpp::Elf_Word seg_flags
)
4019 gold_assert(this->type() == elfcpp::PT_LOAD
);
4020 gold_assert((os
->flags() & elfcpp::SHF_ALLOC
) != 0);
4021 gold_assert(!this->is_max_align_known_
);
4022 gold_assert(os
->is_large_data_section() == this->is_large_data_segment());
4024 this->update_flags_for_output_section(seg_flags
);
4026 // We don't want to change the ordering if we have a linker script
4027 // with a SECTIONS clause.
4028 Output_section_order order
= os
->order();
4029 if (layout
->script_options()->saw_sections_clause())
4030 order
= static_cast<Output_section_order
>(0);
4032 gold_assert(order
!= ORDER_INVALID
);
4034 this->output_lists_
[order
].push_back(os
);
4037 // Add an Output_section to a non-PT_LOAD Output_segment.
4040 Output_segment::add_output_section_to_nonload(Output_section
* os
,
4041 elfcpp::Elf_Word seg_flags
)
4043 gold_assert(this->type() != elfcpp::PT_LOAD
);
4044 gold_assert((os
->flags() & elfcpp::SHF_ALLOC
) != 0);
4045 gold_assert(!this->is_max_align_known_
);
4047 this->update_flags_for_output_section(seg_flags
);
4049 this->output_lists_
[0].push_back(os
);
4052 // Remove an Output_section from this segment. It is an error if it
4056 Output_segment::remove_output_section(Output_section
* os
)
4058 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4060 Output_data_list
* pdl
= &this->output_lists_
[i
];
4061 for (Output_data_list::iterator p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
4073 // Add an Output_data (which need not be an Output_section) to the
4074 // start of a segment.
4077 Output_segment::add_initial_output_data(Output_data
* od
)
4079 gold_assert(!this->is_max_align_known_
);
4080 Output_data_list::iterator p
= this->output_lists_
[0].begin();
4081 this->output_lists_
[0].insert(p
, od
);
4084 // Return true if this segment has any sections which hold actual
4085 // data, rather than being a BSS section.
4088 Output_segment::has_any_data_sections() const
4090 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4092 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4093 for (Output_data_list::const_iterator p
= pdl
->begin();
4097 if (!(*p
)->is_section())
4099 if ((*p
)->output_section()->type() != elfcpp::SHT_NOBITS
)
4106 // Return whether the first data section (not counting TLS sections)
4107 // is a relro section.
4110 Output_segment::is_first_section_relro() const
4112 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4114 if (i
== static_cast<int>(ORDER_TLS_DATA
)
4115 || i
== static_cast<int>(ORDER_TLS_BSS
))
4117 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4120 Output_data
* p
= pdl
->front();
4121 return p
->is_section() && p
->output_section()->is_relro();
4127 // Return the maximum alignment of the Output_data in Output_segment.
4130 Output_segment::maximum_alignment()
4132 if (!this->is_max_align_known_
)
4134 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4136 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4137 uint64_t addralign
= Output_segment::maximum_alignment_list(pdl
);
4138 if (addralign
> this->max_align_
)
4139 this->max_align_
= addralign
;
4141 this->is_max_align_known_
= true;
4144 return this->max_align_
;
4147 // Return the maximum alignment of a list of Output_data.
4150 Output_segment::maximum_alignment_list(const Output_data_list
* pdl
)
4153 for (Output_data_list::const_iterator p
= pdl
->begin();
4157 uint64_t addralign
= (*p
)->addralign();
4158 if (addralign
> ret
)
4164 // Return whether this segment has any dynamic relocs.
4167 Output_segment::has_dynamic_reloc() const
4169 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4170 if (this->has_dynamic_reloc_list(&this->output_lists_
[i
]))
4175 // Return whether this Output_data_list has any dynamic relocs.
4178 Output_segment::has_dynamic_reloc_list(const Output_data_list
* pdl
) const
4180 for (Output_data_list::const_iterator p
= pdl
->begin();
4183 if ((*p
)->has_dynamic_reloc())
4188 // Set the section addresses for an Output_segment. If RESET is true,
4189 // reset the addresses first. ADDR is the address and *POFF is the
4190 // file offset. Set the section indexes starting with *PSHNDX.
4191 // INCREASE_RELRO is the size of the portion of the first non-relro
4192 // section that should be included in the PT_GNU_RELRO segment.
4193 // If this segment has relro sections, and has been aligned for
4194 // that purpose, set *HAS_RELRO to TRUE. Return the address of
4195 // the immediately following segment. Update *HAS_RELRO, *POFF,
4199 Output_segment::set_section_addresses(Layout
* layout
, bool reset
,
4201 unsigned int* increase_relro
,
4204 unsigned int* pshndx
)
4206 gold_assert(this->type_
== elfcpp::PT_LOAD
);
4208 uint64_t last_relro_pad
= 0;
4209 off_t orig_off
= *poff
;
4211 bool in_tls
= false;
4213 // If we have relro sections, we need to pad forward now so that the
4214 // relro sections plus INCREASE_RELRO end on a common page boundary.
4215 if (parameters
->options().relro()
4216 && this->is_first_section_relro()
4217 && (!this->are_addresses_set_
|| reset
))
4219 uint64_t relro_size
= 0;
4221 uint64_t max_align
= 0;
4222 for (int i
= 0; i
<= static_cast<int>(ORDER_RELRO_LAST
); ++i
)
4224 Output_data_list
* pdl
= &this->output_lists_
[i
];
4225 Output_data_list::iterator p
;
4226 for (p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
4228 if (!(*p
)->is_section())
4230 uint64_t align
= (*p
)->addralign();
4231 if (align
> max_align
)
4233 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
4237 // Align the first non-TLS section to the alignment
4238 // of the TLS segment.
4242 relro_size
= align_address(relro_size
, align
);
4243 // Ignore the size of the .tbss section.
4244 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
4245 && (*p
)->is_section_type(elfcpp::SHT_NOBITS
))
4247 if ((*p
)->is_address_valid())
4248 relro_size
+= (*p
)->data_size();
4251 // FIXME: This could be faster.
4252 (*p
)->set_address_and_file_offset(addr
+ relro_size
,
4254 relro_size
+= (*p
)->data_size();
4255 (*p
)->reset_address_and_file_offset();
4258 if (p
!= pdl
->end())
4261 relro_size
+= *increase_relro
;
4262 // Pad the total relro size to a multiple of the maximum
4263 // section alignment seen.
4264 uint64_t aligned_size
= align_address(relro_size
, max_align
);
4265 // Note the amount of padding added after the last relro section.
4266 last_relro_pad
= aligned_size
- relro_size
;
4269 uint64_t page_align
= parameters
->target().common_pagesize();
4271 // Align to offset N such that (N + RELRO_SIZE) % PAGE_ALIGN == 0.
4272 uint64_t desired_align
= page_align
- (aligned_size
% page_align
);
4273 if (desired_align
< *poff
% page_align
)
4274 *poff
+= page_align
- *poff
% page_align
;
4275 *poff
+= desired_align
- *poff
% page_align
;
4276 addr
+= *poff
- orig_off
;
4280 if (!reset
&& this->are_addresses_set_
)
4282 gold_assert(this->paddr_
== addr
);
4283 addr
= this->vaddr_
;
4287 this->vaddr_
= addr
;
4288 this->paddr_
= addr
;
4289 this->are_addresses_set_
= true;
4294 this->offset_
= orig_off
;
4298 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4300 if (i
== static_cast<int>(ORDER_RELRO_LAST
))
4302 *poff
+= last_relro_pad
;
4303 addr
+= last_relro_pad
;
4304 if (this->output_lists_
[i
].empty())
4306 // If there is nothing in the ORDER_RELRO_LAST list,
4307 // the padding will occur at the end of the relro
4308 // segment, and we need to add it to *INCREASE_RELRO.
4309 *increase_relro
+= last_relro_pad
;
4312 addr
= this->set_section_list_addresses(layout
, reset
,
4313 &this->output_lists_
[i
],
4314 addr
, poff
, pshndx
, &in_tls
);
4315 if (i
< static_cast<int>(ORDER_SMALL_BSS
))
4317 this->filesz_
= *poff
- orig_off
;
4324 // If the last section was a TLS section, align upward to the
4325 // alignment of the TLS segment, so that the overall size of the TLS
4326 // segment is aligned.
4329 uint64_t segment_align
= layout
->tls_segment()->maximum_alignment();
4330 *poff
= align_address(*poff
, segment_align
);
4333 this->memsz_
= *poff
- orig_off
;
4335 // Ignore the file offset adjustments made by the BSS Output_data
4342 // Set the addresses and file offsets in a list of Output_data
4346 Output_segment::set_section_list_addresses(Layout
* layout
, bool reset
,
4347 Output_data_list
* pdl
,
4348 uint64_t addr
, off_t
* poff
,
4349 unsigned int* pshndx
,
4352 off_t startoff
= *poff
;
4353 // For incremental updates, we may allocate non-fixed sections from
4354 // free space in the file. This keeps track of the high-water mark.
4355 off_t maxoff
= startoff
;
4357 off_t off
= startoff
;
4358 for (Output_data_list::iterator p
= pdl
->begin();
4363 (*p
)->reset_address_and_file_offset();
4365 // When doing an incremental update or when using a linker script,
4366 // the section will most likely already have an address.
4367 if (!(*p
)->is_address_valid())
4369 uint64_t align
= (*p
)->addralign();
4371 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
4373 // Give the first TLS section the alignment of the
4374 // entire TLS segment. Otherwise the TLS segment as a
4375 // whole may be misaligned.
4378 Output_segment
* tls_segment
= layout
->tls_segment();
4379 gold_assert(tls_segment
!= NULL
);
4380 uint64_t segment_align
= tls_segment
->maximum_alignment();
4381 gold_assert(segment_align
>= align
);
4382 align
= segment_align
;
4389 // If this is the first section after the TLS segment,
4390 // align it to at least the alignment of the TLS
4391 // segment, so that the size of the overall TLS segment
4395 uint64_t segment_align
=
4396 layout
->tls_segment()->maximum_alignment();
4397 if (segment_align
> align
)
4398 align
= segment_align
;
4404 if (!parameters
->incremental_update())
4406 off
= align_address(off
, align
);
4407 (*p
)->set_address_and_file_offset(addr
+ (off
- startoff
), off
);
4411 // Incremental update: allocate file space from free list.
4412 (*p
)->pre_finalize_data_size();
4413 off_t current_size
= (*p
)->current_data_size();
4414 off
= layout
->allocate(current_size
, align
, startoff
);
4417 gold_assert((*p
)->output_section() != NULL
);
4418 gold_fallback(_("out of patch space for section %s; "
4419 "relink with --incremental-full"),
4420 (*p
)->output_section()->name());
4422 (*p
)->set_address_and_file_offset(addr
+ (off
- startoff
), off
);
4423 if ((*p
)->data_size() > current_size
)
4425 gold_assert((*p
)->output_section() != NULL
);
4426 gold_fallback(_("%s: section changed size; "
4427 "relink with --incremental-full"),
4428 (*p
)->output_section()->name());
4432 else if (parameters
->incremental_update())
4434 // For incremental updates, use the fixed offset for the
4435 // high-water mark computation.
4436 off
= (*p
)->offset();
4440 // The script may have inserted a skip forward, but it
4441 // better not have moved backward.
4442 if ((*p
)->address() >= addr
+ (off
- startoff
))
4443 off
+= (*p
)->address() - (addr
+ (off
- startoff
));
4446 if (!layout
->script_options()->saw_sections_clause())
4450 Output_section
* os
= (*p
)->output_section();
4452 // Cast to unsigned long long to avoid format warnings.
4453 unsigned long long previous_dot
=
4454 static_cast<unsigned long long>(addr
+ (off
- startoff
));
4455 unsigned long long dot
=
4456 static_cast<unsigned long long>((*p
)->address());
4459 gold_error(_("dot moves backward in linker script "
4460 "from 0x%llx to 0x%llx"), previous_dot
, dot
);
4462 gold_error(_("address of section '%s' moves backward "
4463 "from 0x%llx to 0x%llx"),
4464 os
->name(), previous_dot
, dot
);
4467 (*p
)->set_file_offset(off
);
4468 (*p
)->finalize_data_size();
4471 if (parameters
->incremental_update())
4472 gold_debug(DEBUG_INCREMENTAL
,
4473 "set_section_list_addresses: %08lx %08lx %s",
4474 static_cast<long>(off
),
4475 static_cast<long>((*p
)->data_size()),
4476 ((*p
)->output_section() != NULL
4477 ? (*p
)->output_section()->name() : "(special)"));
4479 // We want to ignore the size of a SHF_TLS SHT_NOBITS
4480 // section. Such a section does not affect the size of a
4482 if (!(*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
4483 || !(*p
)->is_section_type(elfcpp::SHT_NOBITS
))
4484 off
+= (*p
)->data_size();
4489 if ((*p
)->is_section())
4491 (*p
)->set_out_shndx(*pshndx
);
4497 return addr
+ (maxoff
- startoff
);
4500 // For a non-PT_LOAD segment, set the offset from the sections, if
4501 // any. Add INCREASE to the file size and the memory size.
4504 Output_segment::set_offset(unsigned int increase
)
4506 gold_assert(this->type_
!= elfcpp::PT_LOAD
);
4508 gold_assert(!this->are_addresses_set_
);
4510 // A non-load section only uses output_lists_[0].
4512 Output_data_list
* pdl
= &this->output_lists_
[0];
4516 gold_assert(increase
== 0);
4519 this->are_addresses_set_
= true;
4521 this->min_p_align_
= 0;
4527 // Find the first and last section by address.
4528 const Output_data
* first
= NULL
;
4529 const Output_data
* last_data
= NULL
;
4530 const Output_data
* last_bss
= NULL
;
4531 for (Output_data_list::const_iterator p
= pdl
->begin();
4536 || (*p
)->address() < first
->address()
4537 || ((*p
)->address() == first
->address()
4538 && (*p
)->data_size() < first
->data_size()))
4540 const Output_data
** plast
;
4541 if ((*p
)->is_section()
4542 && (*p
)->output_section()->type() == elfcpp::SHT_NOBITS
)
4547 || (*p
)->address() > (*plast
)->address()
4548 || ((*p
)->address() == (*plast
)->address()
4549 && (*p
)->data_size() > (*plast
)->data_size()))
4553 this->vaddr_
= first
->address();
4554 this->paddr_
= (first
->has_load_address()
4555 ? first
->load_address()
4557 this->are_addresses_set_
= true;
4558 this->offset_
= first
->offset();
4560 if (last_data
== NULL
)
4563 this->filesz_
= (last_data
->address()
4564 + last_data
->data_size()
4567 const Output_data
* last
= last_bss
!= NULL
? last_bss
: last_data
;
4568 this->memsz_
= (last
->address()
4572 this->filesz_
+= increase
;
4573 this->memsz_
+= increase
;
4575 // If this is a RELRO segment, verify that the segment ends at a
4577 if (this->type_
== elfcpp::PT_GNU_RELRO
)
4579 uint64_t page_align
= parameters
->target().common_pagesize();
4580 uint64_t segment_end
= this->vaddr_
+ this->memsz_
;
4581 if (parameters
->incremental_update())
4583 // The INCREASE_RELRO calculation is bypassed for an incremental
4584 // update, so we need to adjust the segment size manually here.
4585 segment_end
= align_address(segment_end
, page_align
);
4586 this->memsz_
= segment_end
- this->vaddr_
;
4589 gold_assert(segment_end
== align_address(segment_end
, page_align
));
4592 // If this is a TLS segment, align the memory size. The code in
4593 // set_section_list ensures that the section after the TLS segment
4594 // is aligned to give us room.
4595 if (this->type_
== elfcpp::PT_TLS
)
4597 uint64_t segment_align
= this->maximum_alignment();
4598 gold_assert(this->vaddr_
== align_address(this->vaddr_
, segment_align
));
4599 this->memsz_
= align_address(this->memsz_
, segment_align
);
4603 // Set the TLS offsets of the sections in the PT_TLS segment.
4606 Output_segment::set_tls_offsets()
4608 gold_assert(this->type_
== elfcpp::PT_TLS
);
4610 for (Output_data_list::iterator p
= this->output_lists_
[0].begin();
4611 p
!= this->output_lists_
[0].end();
4613 (*p
)->set_tls_offset(this->vaddr_
);
4616 // Return the load address of the first section.
4619 Output_segment::first_section_load_address() const
4621 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4623 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4624 for (Output_data_list::const_iterator p
= pdl
->begin();
4628 if ((*p
)->is_section())
4629 return ((*p
)->has_load_address()
4630 ? (*p
)->load_address()
4637 // Return the number of Output_sections in an Output_segment.
4640 Output_segment::output_section_count() const
4642 unsigned int ret
= 0;
4643 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4644 ret
+= this->output_section_count_list(&this->output_lists_
[i
]);
4648 // Return the number of Output_sections in an Output_data_list.
4651 Output_segment::output_section_count_list(const Output_data_list
* pdl
) const
4653 unsigned int count
= 0;
4654 for (Output_data_list::const_iterator p
= pdl
->begin();
4658 if ((*p
)->is_section())
4664 // Return the section attached to the list segment with the lowest
4665 // load address. This is used when handling a PHDRS clause in a
4669 Output_segment::section_with_lowest_load_address() const
4671 Output_section
* found
= NULL
;
4672 uint64_t found_lma
= 0;
4673 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4674 this->lowest_load_address_in_list(&this->output_lists_
[i
], &found
,
4679 // Look through a list for a section with a lower load address.
4682 Output_segment::lowest_load_address_in_list(const Output_data_list
* pdl
,
4683 Output_section
** found
,
4684 uint64_t* found_lma
) const
4686 for (Output_data_list::const_iterator p
= pdl
->begin();
4690 if (!(*p
)->is_section())
4692 Output_section
* os
= static_cast<Output_section
*>(*p
);
4693 uint64_t lma
= (os
->has_load_address()
4694 ? os
->load_address()
4696 if (*found
== NULL
|| lma
< *found_lma
)
4704 // Write the segment data into *OPHDR.
4706 template<int size
, bool big_endian
>
4708 Output_segment::write_header(elfcpp::Phdr_write
<size
, big_endian
>* ophdr
)
4710 ophdr
->put_p_type(this->type_
);
4711 ophdr
->put_p_offset(this->offset_
);
4712 ophdr
->put_p_vaddr(this->vaddr_
);
4713 ophdr
->put_p_paddr(this->paddr_
);
4714 ophdr
->put_p_filesz(this->filesz_
);
4715 ophdr
->put_p_memsz(this->memsz_
);
4716 ophdr
->put_p_flags(this->flags_
);
4717 ophdr
->put_p_align(std::max(this->min_p_align_
, this->maximum_alignment()));
4720 // Write the section headers into V.
4722 template<int size
, bool big_endian
>
4724 Output_segment::write_section_headers(const Layout
* layout
,
4725 const Stringpool
* secnamepool
,
4727 unsigned int* pshndx
) const
4729 // Every section that is attached to a segment must be attached to a
4730 // PT_LOAD segment, so we only write out section headers for PT_LOAD
4732 if (this->type_
!= elfcpp::PT_LOAD
)
4735 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4737 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4738 v
= this->write_section_headers_list
<size
, big_endian
>(layout
,
4747 template<int size
, bool big_endian
>
4749 Output_segment::write_section_headers_list(const Layout
* layout
,
4750 const Stringpool
* secnamepool
,
4751 const Output_data_list
* pdl
,
4753 unsigned int* pshndx
) const
4755 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
4756 for (Output_data_list::const_iterator p
= pdl
->begin();
4760 if ((*p
)->is_section())
4762 const Output_section
* ps
= static_cast<const Output_section
*>(*p
);
4763 gold_assert(*pshndx
== ps
->out_shndx());
4764 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
4765 ps
->write_header(layout
, secnamepool
, &oshdr
);
4773 // Print the output sections to the map file.
4776 Output_segment::print_sections_to_mapfile(Mapfile
* mapfile
) const
4778 if (this->type() != elfcpp::PT_LOAD
)
4780 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4781 this->print_section_list_to_mapfile(mapfile
, &this->output_lists_
[i
]);
4784 // Print an output section list to the map file.
4787 Output_segment::print_section_list_to_mapfile(Mapfile
* mapfile
,
4788 const Output_data_list
* pdl
) const
4790 for (Output_data_list::const_iterator p
= pdl
->begin();
4793 (*p
)->print_to_mapfile(mapfile
);
4796 // Output_file methods.
4798 Output_file::Output_file(const char* name
)
4803 map_is_anonymous_(false),
4804 map_is_allocated_(false),
4805 is_temporary_(false)
4809 // Try to open an existing file. Returns false if the file doesn't
4810 // exist, has a size of 0 or can't be mmapped. If BASE_NAME is not
4811 // NULL, open that file as the base for incremental linking, and
4812 // copy its contents to the new output file. This routine can
4813 // be called for incremental updates, in which case WRITABLE should
4814 // be true, or by the incremental-dump utility, in which case
4815 // WRITABLE should be false.
4818 Output_file::open_base_file(const char* base_name
, bool writable
)
4820 // The name "-" means "stdout".
4821 if (strcmp(this->name_
, "-") == 0)
4824 bool use_base_file
= base_name
!= NULL
;
4826 base_name
= this->name_
;
4827 else if (strcmp(base_name
, this->name_
) == 0)
4828 gold_fatal(_("%s: incremental base and output file name are the same"),
4831 // Don't bother opening files with a size of zero.
4833 if (::stat(base_name
, &s
) != 0)
4835 gold_info(_("%s: stat: %s"), base_name
, strerror(errno
));
4840 gold_info(_("%s: incremental base file is empty"), base_name
);
4844 // If we're using a base file, we want to open it read-only.
4848 int oflags
= writable
? O_RDWR
: O_RDONLY
;
4849 int o
= open_descriptor(-1, base_name
, oflags
, 0);
4852 gold_info(_("%s: open: %s"), base_name
, strerror(errno
));
4856 // If the base file and the output file are different, open a
4857 // new output file and read the contents from the base file into
4858 // the newly-mapped region.
4861 this->open(s
.st_size
);
4862 ssize_t bytes_to_read
= s
.st_size
;
4863 unsigned char* p
= this->base_
;
4864 while (bytes_to_read
> 0)
4866 ssize_t len
= ::read(o
, p
, bytes_to_read
);
4869 gold_info(_("%s: read failed: %s"), base_name
, strerror(errno
));
4874 gold_info(_("%s: file too short: read only %lld of %lld bytes"),
4876 static_cast<long long>(s
.st_size
- bytes_to_read
),
4877 static_cast<long long>(s
.st_size
));
4881 bytes_to_read
-= len
;
4888 this->file_size_
= s
.st_size
;
4890 if (!this->map_no_anonymous(writable
))
4892 release_descriptor(o
, true);
4894 this->file_size_
= 0;
4901 // Open the output file.
4904 Output_file::open(off_t file_size
)
4906 this->file_size_
= file_size
;
4908 // Unlink the file first; otherwise the open() may fail if the file
4909 // is busy (e.g. it's an executable that's currently being executed).
4911 // However, the linker may be part of a system where a zero-length
4912 // file is created for it to write to, with tight permissions (gcc
4913 // 2.95 did something like this). Unlinking the file would work
4914 // around those permission controls, so we only unlink if the file
4915 // has a non-zero size. We also unlink only regular files to avoid
4916 // trouble with directories/etc.
4918 // If we fail, continue; this command is merely a best-effort attempt
4919 // to improve the odds for open().
4921 // We let the name "-" mean "stdout"
4922 if (!this->is_temporary_
)
4924 if (strcmp(this->name_
, "-") == 0)
4925 this->o_
= STDOUT_FILENO
;
4929 if (::stat(this->name_
, &s
) == 0
4930 && (S_ISREG (s
.st_mode
) || S_ISLNK (s
.st_mode
)))
4933 ::unlink(this->name_
);
4934 else if (!parameters
->options().relocatable())
4936 // If we don't unlink the existing file, add execute
4937 // permission where read permissions already exist
4938 // and where the umask permits.
4939 int mask
= ::umask(0);
4941 s
.st_mode
|= (s
.st_mode
& 0444) >> 2;
4942 ::chmod(this->name_
, s
.st_mode
& ~mask
);
4946 int mode
= parameters
->options().relocatable() ? 0666 : 0777;
4947 int o
= open_descriptor(-1, this->name_
, O_RDWR
| O_CREAT
| O_TRUNC
,
4950 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4958 // Resize the output file.
4961 Output_file::resize(off_t file_size
)
4963 // If the mmap is mapping an anonymous memory buffer, this is easy:
4964 // just mremap to the new size. If it's mapping to a file, we want
4965 // to unmap to flush to the file, then remap after growing the file.
4966 if (this->map_is_anonymous_
)
4969 if (!this->map_is_allocated_
)
4971 base
= ::mremap(this->base_
, this->file_size_
, file_size
,
4973 if (base
== MAP_FAILED
)
4974 gold_fatal(_("%s: mremap: %s"), this->name_
, strerror(errno
));
4978 base
= realloc(this->base_
, file_size
);
4981 if (file_size
> this->file_size_
)
4982 memset(static_cast<char*>(base
) + this->file_size_
, 0,
4983 file_size
- this->file_size_
);
4985 this->base_
= static_cast<unsigned char*>(base
);
4986 this->file_size_
= file_size
;
4991 this->file_size_
= file_size
;
4992 if (!this->map_no_anonymous(true))
4993 gold_fatal(_("%s: mmap: %s"), this->name_
, strerror(errno
));
4997 // Map an anonymous block of memory which will later be written to the
4998 // file. Return whether the map succeeded.
5001 Output_file::map_anonymous()
5003 void* base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
5004 MAP_PRIVATE
| MAP_ANONYMOUS
, -1, 0);
5005 if (base
== MAP_FAILED
)
5007 base
= malloc(this->file_size_
);
5010 memset(base
, 0, this->file_size_
);
5011 this->map_is_allocated_
= true;
5013 this->base_
= static_cast<unsigned char*>(base
);
5014 this->map_is_anonymous_
= true;
5018 // Map the file into memory. Return whether the mapping succeeded.
5019 // If WRITABLE is true, map with write access.
5022 Output_file::map_no_anonymous(bool writable
)
5024 const int o
= this->o_
;
5026 // If the output file is not a regular file, don't try to mmap it;
5027 // instead, we'll mmap a block of memory (an anonymous buffer), and
5028 // then later write the buffer to the file.
5030 struct stat statbuf
;
5031 if (o
== STDOUT_FILENO
|| o
== STDERR_FILENO
5032 || ::fstat(o
, &statbuf
) != 0
5033 || !S_ISREG(statbuf
.st_mode
)
5034 || this->is_temporary_
)
5037 // Ensure that we have disk space available for the file. If we
5038 // don't do this, it is possible that we will call munmap, close,
5039 // and exit with dirty buffers still in the cache with no assigned
5040 // disk blocks. If the disk is out of space at that point, the
5041 // output file will wind up incomplete, but we will have already
5042 // exited. The alternative to fallocate would be to use fdatasync,
5043 // but that would be a more significant performance hit.
5046 int err
= gold_fallocate(o
, 0, this->file_size_
);
5048 gold_fatal(_("%s: %s"), this->name_
, strerror(err
));
5051 // Map the file into memory.
5052 int prot
= PROT_READ
;
5055 base
= ::mmap(NULL
, this->file_size_
, prot
, MAP_SHARED
, o
, 0);
5057 // The mmap call might fail because of file system issues: the file
5058 // system might not support mmap at all, or it might not support
5059 // mmap with PROT_WRITE.
5060 if (base
== MAP_FAILED
)
5063 this->map_is_anonymous_
= false;
5064 this->base_
= static_cast<unsigned char*>(base
);
5068 // Map the file into memory.
5073 if (parameters
->options().mmap_output_file()
5074 && this->map_no_anonymous(true))
5077 // The mmap call might fail because of file system issues: the file
5078 // system might not support mmap at all, or it might not support
5079 // mmap with PROT_WRITE. I'm not sure which errno values we will
5080 // see in all cases, so if the mmap fails for any reason and we
5081 // don't care about file contents, try for an anonymous map.
5082 if (this->map_anonymous())
5085 gold_fatal(_("%s: mmap: failed to allocate %lu bytes for output file: %s"),
5086 this->name_
, static_cast<unsigned long>(this->file_size_
),
5090 // Unmap the file from memory.
5093 Output_file::unmap()
5095 if (this->map_is_anonymous_
)
5097 // We've already written out the data, so there is no reason to
5098 // waste time unmapping or freeing the memory.
5102 if (::munmap(this->base_
, this->file_size_
) < 0)
5103 gold_error(_("%s: munmap: %s"), this->name_
, strerror(errno
));
5108 // Close the output file.
5111 Output_file::close()
5113 // If the map isn't file-backed, we need to write it now.
5114 if (this->map_is_anonymous_
&& !this->is_temporary_
)
5116 size_t bytes_to_write
= this->file_size_
;
5118 while (bytes_to_write
> 0)
5120 ssize_t bytes_written
= ::write(this->o_
, this->base_
+ offset
,
5122 if (bytes_written
== 0)
5123 gold_error(_("%s: write: unexpected 0 return-value"), this->name_
);
5124 else if (bytes_written
< 0)
5125 gold_error(_("%s: write: %s"), this->name_
, strerror(errno
));
5128 bytes_to_write
-= bytes_written
;
5129 offset
+= bytes_written
;
5135 // We don't close stdout or stderr
5136 if (this->o_
!= STDOUT_FILENO
5137 && this->o_
!= STDERR_FILENO
5138 && !this->is_temporary_
)
5139 if (::close(this->o_
) < 0)
5140 gold_error(_("%s: close: %s"), this->name_
, strerror(errno
));
5144 // Instantiate the templates we need. We could use the configure
5145 // script to restrict this to only the ones for implemented targets.
5147 #ifdef HAVE_TARGET_32_LITTLE
5150 Output_section::add_input_section
<32, false>(
5152 Sized_relobj_file
<32, false>* object
,
5154 const char* secname
,
5155 const elfcpp::Shdr
<32, false>& shdr
,
5156 unsigned int reloc_shndx
,
5157 bool have_sections_script
);
5160 #ifdef HAVE_TARGET_32_BIG
5163 Output_section::add_input_section
<32, true>(
5165 Sized_relobj_file
<32, true>* object
,
5167 const char* secname
,
5168 const elfcpp::Shdr
<32, true>& shdr
,
5169 unsigned int reloc_shndx
,
5170 bool have_sections_script
);
5173 #ifdef HAVE_TARGET_64_LITTLE
5176 Output_section::add_input_section
<64, false>(
5178 Sized_relobj_file
<64, false>* object
,
5180 const char* secname
,
5181 const elfcpp::Shdr
<64, false>& shdr
,
5182 unsigned int reloc_shndx
,
5183 bool have_sections_script
);
5186 #ifdef HAVE_TARGET_64_BIG
5189 Output_section::add_input_section
<64, true>(
5191 Sized_relobj_file
<64, true>* object
,
5193 const char* secname
,
5194 const elfcpp::Shdr
<64, true>& shdr
,
5195 unsigned int reloc_shndx
,
5196 bool have_sections_script
);
5199 #ifdef HAVE_TARGET_32_LITTLE
5201 class Output_reloc
<elfcpp::SHT_REL
, false, 32, false>;
5204 #ifdef HAVE_TARGET_32_BIG
5206 class Output_reloc
<elfcpp::SHT_REL
, false, 32, true>;
5209 #ifdef HAVE_TARGET_64_LITTLE
5211 class Output_reloc
<elfcpp::SHT_REL
, false, 64, false>;
5214 #ifdef HAVE_TARGET_64_BIG
5216 class Output_reloc
<elfcpp::SHT_REL
, false, 64, true>;
5219 #ifdef HAVE_TARGET_32_LITTLE
5221 class Output_reloc
<elfcpp::SHT_REL
, true, 32, false>;
5224 #ifdef HAVE_TARGET_32_BIG
5226 class Output_reloc
<elfcpp::SHT_REL
, true, 32, true>;
5229 #ifdef HAVE_TARGET_64_LITTLE
5231 class Output_reloc
<elfcpp::SHT_REL
, true, 64, false>;
5234 #ifdef HAVE_TARGET_64_BIG
5236 class Output_reloc
<elfcpp::SHT_REL
, true, 64, true>;
5239 #ifdef HAVE_TARGET_32_LITTLE
5241 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
5244 #ifdef HAVE_TARGET_32_BIG
5246 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
5249 #ifdef HAVE_TARGET_64_LITTLE
5251 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
5254 #ifdef HAVE_TARGET_64_BIG
5256 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
5259 #ifdef HAVE_TARGET_32_LITTLE
5261 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
5264 #ifdef HAVE_TARGET_32_BIG
5266 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
5269 #ifdef HAVE_TARGET_64_LITTLE
5271 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
5274 #ifdef HAVE_TARGET_64_BIG
5276 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
5279 #ifdef HAVE_TARGET_32_LITTLE
5281 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, false>;
5284 #ifdef HAVE_TARGET_32_BIG
5286 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, true>;
5289 #ifdef HAVE_TARGET_64_LITTLE
5291 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, false>;
5294 #ifdef HAVE_TARGET_64_BIG
5296 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, true>;
5299 #ifdef HAVE_TARGET_32_LITTLE
5301 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, false>;
5304 #ifdef HAVE_TARGET_32_BIG
5306 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, true>;
5309 #ifdef HAVE_TARGET_64_LITTLE
5311 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, false>;
5314 #ifdef HAVE_TARGET_64_BIG
5316 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, true>;
5319 #ifdef HAVE_TARGET_32_LITTLE
5321 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
5324 #ifdef HAVE_TARGET_32_BIG
5326 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
5329 #ifdef HAVE_TARGET_64_LITTLE
5331 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
5334 #ifdef HAVE_TARGET_64_BIG
5336 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
5339 #ifdef HAVE_TARGET_32_LITTLE
5341 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
5344 #ifdef HAVE_TARGET_32_BIG
5346 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
5349 #ifdef HAVE_TARGET_64_LITTLE
5351 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
5354 #ifdef HAVE_TARGET_64_BIG
5356 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
5359 #ifdef HAVE_TARGET_32_LITTLE
5361 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, false>;
5364 #ifdef HAVE_TARGET_32_BIG
5366 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, true>;
5369 #ifdef HAVE_TARGET_64_LITTLE
5371 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, false>;
5374 #ifdef HAVE_TARGET_64_BIG
5376 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, true>;
5379 #ifdef HAVE_TARGET_32_LITTLE
5381 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, false>;
5384 #ifdef HAVE_TARGET_32_BIG
5386 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, true>;
5389 #ifdef HAVE_TARGET_64_LITTLE
5391 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, false>;
5394 #ifdef HAVE_TARGET_64_BIG
5396 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, true>;
5399 #ifdef HAVE_TARGET_32_LITTLE
5401 class Output_data_group
<32, false>;
5404 #ifdef HAVE_TARGET_32_BIG
5406 class Output_data_group
<32, true>;
5409 #ifdef HAVE_TARGET_64_LITTLE
5411 class Output_data_group
<64, false>;
5414 #ifdef HAVE_TARGET_64_BIG
5416 class Output_data_group
<64, true>;
5419 #ifdef HAVE_TARGET_32_LITTLE
5421 class Output_data_got
<32, false>;
5424 #ifdef HAVE_TARGET_32_BIG
5426 class Output_data_got
<32, true>;
5429 #ifdef HAVE_TARGET_64_LITTLE
5431 class Output_data_got
<64, false>;
5434 #ifdef HAVE_TARGET_64_BIG
5436 class Output_data_got
<64, true>;
5439 } // End namespace gold.