1 // output.cc -- manage the output file for gold
3 // Copyright 2006, 2007, 2008, 2009 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 #include "libiberty.h"
35 #include "parameters.h"
40 #include "descriptors.h"
43 // Some BSD systems still use MAP_ANON instead of MAP_ANONYMOUS
45 # define MAP_ANONYMOUS MAP_ANON
48 #ifndef HAVE_POSIX_FALLOCATE
49 // A dummy, non general, version of posix_fallocate. Here we just set
50 // the file size and hope that there is enough disk space. FIXME: We
51 // could allocate disk space by walking block by block and writing a
52 // zero byte into each block.
54 posix_fallocate(int o
, off_t offset
, off_t len
)
56 return ftruncate(o
, offset
+ len
);
58 #endif // !defined(HAVE_POSIX_FALLOCATE)
63 // Output_data variables.
65 bool Output_data::allocated_sizes_are_fixed
;
67 // Output_data methods.
69 Output_data::~Output_data()
73 // Return the default alignment for the target size.
76 Output_data::default_alignment()
78 return Output_data::default_alignment_for_size(
79 parameters
->target().get_size());
82 // Return the default alignment for a size--32 or 64.
85 Output_data::default_alignment_for_size(int size
)
95 // Output_section_header methods. This currently assumes that the
96 // segment and section lists are complete at construction time.
98 Output_section_headers::Output_section_headers(
100 const Layout::Segment_list
* segment_list
,
101 const Layout::Section_list
* section_list
,
102 const Layout::Section_list
* unattached_section_list
,
103 const Stringpool
* secnamepool
,
104 const Output_section
* shstrtab_section
)
106 segment_list_(segment_list
),
107 section_list_(section_list
),
108 unattached_section_list_(unattached_section_list
),
109 secnamepool_(secnamepool
),
110 shstrtab_section_(shstrtab_section
)
114 // Compute the current data size.
117 Output_section_headers::do_size() const
119 // Count all the sections. Start with 1 for the null section.
121 if (!parameters
->options().relocatable())
123 for (Layout::Segment_list::const_iterator p
=
124 this->segment_list_
->begin();
125 p
!= this->segment_list_
->end();
127 if ((*p
)->type() == elfcpp::PT_LOAD
)
128 count
+= (*p
)->output_section_count();
132 for (Layout::Section_list::const_iterator p
=
133 this->section_list_
->begin();
134 p
!= this->section_list_
->end();
136 if (((*p
)->flags() & elfcpp::SHF_ALLOC
) != 0)
139 count
+= this->unattached_section_list_
->size();
141 const int size
= parameters
->target().get_size();
144 shdr_size
= elfcpp::Elf_sizes
<32>::shdr_size
;
146 shdr_size
= elfcpp::Elf_sizes
<64>::shdr_size
;
150 return count
* shdr_size
;
153 // Write out the section headers.
156 Output_section_headers::do_write(Output_file
* of
)
158 switch (parameters
->size_and_endianness())
160 #ifdef HAVE_TARGET_32_LITTLE
161 case Parameters::TARGET_32_LITTLE
:
162 this->do_sized_write
<32, false>(of
);
165 #ifdef HAVE_TARGET_32_BIG
166 case Parameters::TARGET_32_BIG
:
167 this->do_sized_write
<32, true>(of
);
170 #ifdef HAVE_TARGET_64_LITTLE
171 case Parameters::TARGET_64_LITTLE
:
172 this->do_sized_write
<64, false>(of
);
175 #ifdef HAVE_TARGET_64_BIG
176 case Parameters::TARGET_64_BIG
:
177 this->do_sized_write
<64, true>(of
);
185 template<int size
, bool big_endian
>
187 Output_section_headers::do_sized_write(Output_file
* of
)
189 off_t all_shdrs_size
= this->data_size();
190 unsigned char* view
= of
->get_output_view(this->offset(), all_shdrs_size
);
192 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
193 unsigned char* v
= view
;
196 typename
elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
197 oshdr
.put_sh_name(0);
198 oshdr
.put_sh_type(elfcpp::SHT_NULL
);
199 oshdr
.put_sh_flags(0);
200 oshdr
.put_sh_addr(0);
201 oshdr
.put_sh_offset(0);
203 size_t section_count
= (this->data_size()
204 / elfcpp::Elf_sizes
<size
>::shdr_size
);
205 if (section_count
< elfcpp::SHN_LORESERVE
)
206 oshdr
.put_sh_size(0);
208 oshdr
.put_sh_size(section_count
);
210 unsigned int shstrndx
= this->shstrtab_section_
->out_shndx();
211 if (shstrndx
< elfcpp::SHN_LORESERVE
)
212 oshdr
.put_sh_link(0);
214 oshdr
.put_sh_link(shstrndx
);
216 oshdr
.put_sh_info(0);
217 oshdr
.put_sh_addralign(0);
218 oshdr
.put_sh_entsize(0);
223 unsigned int shndx
= 1;
224 if (!parameters
->options().relocatable())
226 for (Layout::Segment_list::const_iterator p
=
227 this->segment_list_
->begin();
228 p
!= this->segment_list_
->end();
230 v
= (*p
)->write_section_headers
<size
, big_endian
>(this->layout_
,
237 for (Layout::Section_list::const_iterator p
=
238 this->section_list_
->begin();
239 p
!= this->section_list_
->end();
242 // We do unallocated sections below, except that group
243 // sections have to come first.
244 if (((*p
)->flags() & elfcpp::SHF_ALLOC
) == 0
245 && (*p
)->type() != elfcpp::SHT_GROUP
)
247 gold_assert(shndx
== (*p
)->out_shndx());
248 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
249 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
255 for (Layout::Section_list::const_iterator p
=
256 this->unattached_section_list_
->begin();
257 p
!= this->unattached_section_list_
->end();
260 // For a relocatable link, we did unallocated group sections
261 // above, since they have to come first.
262 if ((*p
)->type() == elfcpp::SHT_GROUP
263 && parameters
->options().relocatable())
265 gold_assert(shndx
== (*p
)->out_shndx());
266 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
267 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
272 of
->write_output_view(this->offset(), all_shdrs_size
, view
);
275 // Output_segment_header methods.
277 Output_segment_headers::Output_segment_headers(
278 const Layout::Segment_list
& segment_list
)
279 : segment_list_(segment_list
)
284 Output_segment_headers::do_write(Output_file
* of
)
286 switch (parameters
->size_and_endianness())
288 #ifdef HAVE_TARGET_32_LITTLE
289 case Parameters::TARGET_32_LITTLE
:
290 this->do_sized_write
<32, false>(of
);
293 #ifdef HAVE_TARGET_32_BIG
294 case Parameters::TARGET_32_BIG
:
295 this->do_sized_write
<32, true>(of
);
298 #ifdef HAVE_TARGET_64_LITTLE
299 case Parameters::TARGET_64_LITTLE
:
300 this->do_sized_write
<64, false>(of
);
303 #ifdef HAVE_TARGET_64_BIG
304 case Parameters::TARGET_64_BIG
:
305 this->do_sized_write
<64, true>(of
);
313 template<int size
, bool big_endian
>
315 Output_segment_headers::do_sized_write(Output_file
* of
)
317 const int phdr_size
= elfcpp::Elf_sizes
<size
>::phdr_size
;
318 off_t all_phdrs_size
= this->segment_list_
.size() * phdr_size
;
319 gold_assert(all_phdrs_size
== this->data_size());
320 unsigned char* view
= of
->get_output_view(this->offset(),
322 unsigned char* v
= view
;
323 for (Layout::Segment_list::const_iterator p
= this->segment_list_
.begin();
324 p
!= this->segment_list_
.end();
327 elfcpp::Phdr_write
<size
, big_endian
> ophdr(v
);
328 (*p
)->write_header(&ophdr
);
332 gold_assert(v
- view
== all_phdrs_size
);
334 of
->write_output_view(this->offset(), all_phdrs_size
, view
);
338 Output_segment_headers::do_size() const
340 const int size
= parameters
->target().get_size();
343 phdr_size
= elfcpp::Elf_sizes
<32>::phdr_size
;
345 phdr_size
= elfcpp::Elf_sizes
<64>::phdr_size
;
349 return this->segment_list_
.size() * phdr_size
;
352 // Output_file_header methods.
354 Output_file_header::Output_file_header(const Target
* target
,
355 const Symbol_table
* symtab
,
356 const Output_segment_headers
* osh
,
360 segment_header_(osh
),
361 section_header_(NULL
),
365 this->set_data_size(this->do_size());
368 // Set the section table information for a file header.
371 Output_file_header::set_section_info(const Output_section_headers
* shdrs
,
372 const Output_section
* shstrtab
)
374 this->section_header_
= shdrs
;
375 this->shstrtab_
= shstrtab
;
378 // Write out the file header.
381 Output_file_header::do_write(Output_file
* of
)
383 gold_assert(this->offset() == 0);
385 switch (parameters
->size_and_endianness())
387 #ifdef HAVE_TARGET_32_LITTLE
388 case Parameters::TARGET_32_LITTLE
:
389 this->do_sized_write
<32, false>(of
);
392 #ifdef HAVE_TARGET_32_BIG
393 case Parameters::TARGET_32_BIG
:
394 this->do_sized_write
<32, true>(of
);
397 #ifdef HAVE_TARGET_64_LITTLE
398 case Parameters::TARGET_64_LITTLE
:
399 this->do_sized_write
<64, false>(of
);
402 #ifdef HAVE_TARGET_64_BIG
403 case Parameters::TARGET_64_BIG
:
404 this->do_sized_write
<64, true>(of
);
412 // Write out the file header with appropriate size and endianess.
414 template<int size
, bool big_endian
>
416 Output_file_header::do_sized_write(Output_file
* of
)
418 gold_assert(this->offset() == 0);
420 int ehdr_size
= elfcpp::Elf_sizes
<size
>::ehdr_size
;
421 unsigned char* view
= of
->get_output_view(0, ehdr_size
);
422 elfcpp::Ehdr_write
<size
, big_endian
> oehdr(view
);
424 unsigned char e_ident
[elfcpp::EI_NIDENT
];
425 memset(e_ident
, 0, elfcpp::EI_NIDENT
);
426 e_ident
[elfcpp::EI_MAG0
] = elfcpp::ELFMAG0
;
427 e_ident
[elfcpp::EI_MAG1
] = elfcpp::ELFMAG1
;
428 e_ident
[elfcpp::EI_MAG2
] = elfcpp::ELFMAG2
;
429 e_ident
[elfcpp::EI_MAG3
] = elfcpp::ELFMAG3
;
431 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS32
;
433 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS64
;
436 e_ident
[elfcpp::EI_DATA
] = (big_endian
437 ? elfcpp::ELFDATA2MSB
438 : elfcpp::ELFDATA2LSB
);
439 e_ident
[elfcpp::EI_VERSION
] = elfcpp::EV_CURRENT
;
440 oehdr
.put_e_ident(e_ident
);
443 if (parameters
->options().relocatable())
444 e_type
= elfcpp::ET_REL
;
445 else if (parameters
->options().output_is_position_independent())
446 e_type
= elfcpp::ET_DYN
;
448 e_type
= elfcpp::ET_EXEC
;
449 oehdr
.put_e_type(e_type
);
451 oehdr
.put_e_machine(this->target_
->machine_code());
452 oehdr
.put_e_version(elfcpp::EV_CURRENT
);
454 oehdr
.put_e_entry(this->entry
<size
>());
456 if (this->segment_header_
== NULL
)
457 oehdr
.put_e_phoff(0);
459 oehdr
.put_e_phoff(this->segment_header_
->offset());
461 oehdr
.put_e_shoff(this->section_header_
->offset());
462 oehdr
.put_e_flags(this->target_
->processor_specific_flags());
463 oehdr
.put_e_ehsize(elfcpp::Elf_sizes
<size
>::ehdr_size
);
465 if (this->segment_header_
== NULL
)
467 oehdr
.put_e_phentsize(0);
468 oehdr
.put_e_phnum(0);
472 oehdr
.put_e_phentsize(elfcpp::Elf_sizes
<size
>::phdr_size
);
473 oehdr
.put_e_phnum(this->segment_header_
->data_size()
474 / elfcpp::Elf_sizes
<size
>::phdr_size
);
477 oehdr
.put_e_shentsize(elfcpp::Elf_sizes
<size
>::shdr_size
);
478 size_t section_count
= (this->section_header_
->data_size()
479 / elfcpp::Elf_sizes
<size
>::shdr_size
);
481 if (section_count
< elfcpp::SHN_LORESERVE
)
482 oehdr
.put_e_shnum(this->section_header_
->data_size()
483 / elfcpp::Elf_sizes
<size
>::shdr_size
);
485 oehdr
.put_e_shnum(0);
487 unsigned int shstrndx
= this->shstrtab_
->out_shndx();
488 if (shstrndx
< elfcpp::SHN_LORESERVE
)
489 oehdr
.put_e_shstrndx(this->shstrtab_
->out_shndx());
491 oehdr
.put_e_shstrndx(elfcpp::SHN_XINDEX
);
493 // Let the target adjust the ELF header, e.g., to set EI_OSABI in
494 // the e_ident field.
495 parameters
->target().adjust_elf_header(view
, ehdr_size
);
497 of
->write_output_view(0, ehdr_size
, view
);
500 // Return the value to use for the entry address. THIS->ENTRY_ is the
501 // symbol specified on the command line, if any.
504 typename
elfcpp::Elf_types
<size
>::Elf_Addr
505 Output_file_header::entry()
507 const bool should_issue_warning
= (this->entry_
!= NULL
508 && !parameters
->options().relocatable()
509 && !parameters
->options().shared());
511 // FIXME: Need to support target specific entry symbol.
512 const char* entry
= this->entry_
;
516 Symbol
* sym
= this->symtab_
->lookup(entry
);
518 typename Sized_symbol
<size
>::Value_type v
;
521 Sized_symbol
<size
>* ssym
;
522 ssym
= this->symtab_
->get_sized_symbol
<size
>(sym
);
523 if (!ssym
->is_defined() && should_issue_warning
)
524 gold_warning("entry symbol '%s' exists but is not defined", entry
);
529 // We couldn't find the entry symbol. See if we can parse it as
530 // a number. This supports, e.g., -e 0x1000.
532 v
= strtoull(entry
, &endptr
, 0);
535 if (should_issue_warning
)
536 gold_warning("cannot find entry symbol '%s'", entry
);
544 // Compute the current data size.
547 Output_file_header::do_size() const
549 const int size
= parameters
->target().get_size();
551 return elfcpp::Elf_sizes
<32>::ehdr_size
;
553 return elfcpp::Elf_sizes
<64>::ehdr_size
;
558 // Output_data_const methods.
561 Output_data_const::do_write(Output_file
* of
)
563 of
->write(this->offset(), this->data_
.data(), this->data_
.size());
566 // Output_data_const_buffer methods.
569 Output_data_const_buffer::do_write(Output_file
* of
)
571 of
->write(this->offset(), this->p_
, this->data_size());
574 // Output_section_data methods.
576 // Record the output section, and set the entry size and such.
579 Output_section_data::set_output_section(Output_section
* os
)
581 gold_assert(this->output_section_
== NULL
);
582 this->output_section_
= os
;
583 this->do_adjust_output_section(os
);
586 // Return the section index of the output section.
589 Output_section_data::do_out_shndx() const
591 gold_assert(this->output_section_
!= NULL
);
592 return this->output_section_
->out_shndx();
595 // Set the alignment, which means we may need to update the alignment
596 // of the output section.
599 Output_section_data::set_addralign(uint64_t addralign
)
601 this->addralign_
= addralign
;
602 if (this->output_section_
!= NULL
603 && this->output_section_
->addralign() < addralign
)
604 this->output_section_
->set_addralign(addralign
);
607 // Output_data_strtab methods.
609 // Set the final data size.
612 Output_data_strtab::set_final_data_size()
614 this->strtab_
->set_string_offsets();
615 this->set_data_size(this->strtab_
->get_strtab_size());
618 // Write out a string table.
621 Output_data_strtab::do_write(Output_file
* of
)
623 this->strtab_
->write(of
, this->offset());
626 // Output_reloc methods.
628 // A reloc against a global symbol.
630 template<bool dynamic
, int size
, bool big_endian
>
631 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
637 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
638 is_relative_(is_relative
), is_section_symbol_(false), shndx_(INVALID_CODE
)
640 // this->type_ is a bitfield; make sure TYPE fits.
641 gold_assert(this->type_
== type
);
642 this->u1_
.gsym
= gsym
;
645 this->set_needs_dynsym_index();
648 template<bool dynamic
, int size
, bool big_endian
>
649 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
652 Sized_relobj
<size
, big_endian
>* relobj
,
656 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
657 is_relative_(is_relative
), is_section_symbol_(false), shndx_(shndx
)
659 gold_assert(shndx
!= INVALID_CODE
);
660 // this->type_ is a bitfield; make sure TYPE fits.
661 gold_assert(this->type_
== type
);
662 this->u1_
.gsym
= gsym
;
663 this->u2_
.relobj
= relobj
;
665 this->set_needs_dynsym_index();
668 // A reloc against a local symbol.
670 template<bool dynamic
, int size
, bool big_endian
>
671 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
672 Sized_relobj
<size
, big_endian
>* relobj
,
673 unsigned int local_sym_index
,
678 bool is_section_symbol
)
679 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
680 is_relative_(is_relative
), is_section_symbol_(is_section_symbol
),
683 gold_assert(local_sym_index
!= GSYM_CODE
684 && local_sym_index
!= INVALID_CODE
);
685 // this->type_ is a bitfield; make sure TYPE fits.
686 gold_assert(this->type_
== type
);
687 this->u1_
.relobj
= relobj
;
690 this->set_needs_dynsym_index();
693 template<bool dynamic
, int size
, bool big_endian
>
694 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
695 Sized_relobj
<size
, big_endian
>* relobj
,
696 unsigned int local_sym_index
,
701 bool is_section_symbol
)
702 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
703 is_relative_(is_relative
), is_section_symbol_(is_section_symbol
),
706 gold_assert(local_sym_index
!= GSYM_CODE
707 && local_sym_index
!= INVALID_CODE
);
708 gold_assert(shndx
!= INVALID_CODE
);
709 // this->type_ is a bitfield; make sure TYPE fits.
710 gold_assert(this->type_
== type
);
711 this->u1_
.relobj
= relobj
;
712 this->u2_
.relobj
= relobj
;
714 this->set_needs_dynsym_index();
717 // A reloc against the STT_SECTION symbol of an output section.
719 template<bool dynamic
, int size
, bool big_endian
>
720 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
725 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
726 is_relative_(false), is_section_symbol_(true), shndx_(INVALID_CODE
)
728 // this->type_ is a bitfield; make sure TYPE fits.
729 gold_assert(this->type_
== type
);
733 this->set_needs_dynsym_index();
735 os
->set_needs_symtab_index();
738 template<bool dynamic
, int size
, bool big_endian
>
739 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
742 Sized_relobj
<size
, big_endian
>* relobj
,
745 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
746 is_relative_(false), is_section_symbol_(true), shndx_(shndx
)
748 gold_assert(shndx
!= INVALID_CODE
);
749 // this->type_ is a bitfield; make sure TYPE fits.
750 gold_assert(this->type_
== type
);
752 this->u2_
.relobj
= relobj
;
754 this->set_needs_dynsym_index();
756 os
->set_needs_symtab_index();
759 // An absolute relocation.
761 template<bool dynamic
, int size
, bool big_endian
>
762 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
766 : address_(address
), local_sym_index_(0), type_(type
),
767 is_relative_(false), is_section_symbol_(false), shndx_(INVALID_CODE
)
769 // this->type_ is a bitfield; make sure TYPE fits.
770 gold_assert(this->type_
== type
);
771 this->u1_
.relobj
= NULL
;
775 template<bool dynamic
, int size
, bool big_endian
>
776 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
778 Sized_relobj
<size
, big_endian
>* relobj
,
781 : address_(address
), local_sym_index_(0), type_(type
),
782 is_relative_(false), is_section_symbol_(false), shndx_(shndx
)
784 gold_assert(shndx
!= INVALID_CODE
);
785 // this->type_ is a bitfield; make sure TYPE fits.
786 gold_assert(this->type_
== type
);
787 this->u1_
.relobj
= NULL
;
788 this->u2_
.relobj
= relobj
;
791 // A target specific relocation.
793 template<bool dynamic
, int size
, bool big_endian
>
794 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
799 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
800 is_relative_(false), is_section_symbol_(false), shndx_(INVALID_CODE
)
802 // this->type_ is a bitfield; make sure TYPE fits.
803 gold_assert(this->type_
== type
);
808 template<bool dynamic
, int size
, bool big_endian
>
809 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
812 Sized_relobj
<size
, big_endian
>* relobj
,
815 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
816 is_relative_(false), is_section_symbol_(false), shndx_(shndx
)
818 gold_assert(shndx
!= INVALID_CODE
);
819 // this->type_ is a bitfield; make sure TYPE fits.
820 gold_assert(this->type_
== type
);
822 this->u2_
.relobj
= relobj
;
825 // Record that we need a dynamic symbol index for this relocation.
827 template<bool dynamic
, int size
, bool big_endian
>
829 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
830 set_needs_dynsym_index()
832 if (this->is_relative_
)
834 switch (this->local_sym_index_
)
840 this->u1_
.gsym
->set_needs_dynsym_entry();
844 this->u1_
.os
->set_needs_dynsym_index();
848 // The target must take care of this if necessary.
856 const unsigned int lsi
= this->local_sym_index_
;
857 if (!this->is_section_symbol_
)
858 this->u1_
.relobj
->set_needs_output_dynsym_entry(lsi
);
860 this->u1_
.relobj
->output_section(lsi
)->set_needs_dynsym_index();
866 // Get the symbol index of a relocation.
868 template<bool dynamic
, int size
, bool big_endian
>
870 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_symbol_index()
874 switch (this->local_sym_index_
)
880 if (this->u1_
.gsym
== NULL
)
883 index
= this->u1_
.gsym
->dynsym_index();
885 index
= this->u1_
.gsym
->symtab_index();
890 index
= this->u1_
.os
->dynsym_index();
892 index
= this->u1_
.os
->symtab_index();
896 index
= parameters
->target().reloc_symbol_index(this->u1_
.arg
,
901 // Relocations without symbols use a symbol index of 0.
907 const unsigned int lsi
= this->local_sym_index_
;
908 if (!this->is_section_symbol_
)
911 index
= this->u1_
.relobj
->dynsym_index(lsi
);
913 index
= this->u1_
.relobj
->symtab_index(lsi
);
917 Output_section
* os
= this->u1_
.relobj
->output_section(lsi
);
918 gold_assert(os
!= NULL
);
920 index
= os
->dynsym_index();
922 index
= os
->symtab_index();
927 gold_assert(index
!= -1U);
931 // For a local section symbol, get the address of the offset ADDEND
932 // within the input section.
934 template<bool dynamic
, int size
, bool big_endian
>
935 typename
elfcpp::Elf_types
<size
>::Elf_Addr
936 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
937 local_section_offset(Addend addend
) const
939 gold_assert(this->local_sym_index_
!= GSYM_CODE
940 && this->local_sym_index_
!= SECTION_CODE
941 && this->local_sym_index_
!= TARGET_CODE
942 && this->local_sym_index_
!= INVALID_CODE
943 && this->local_sym_index_
!= 0
944 && this->is_section_symbol_
);
945 const unsigned int lsi
= this->local_sym_index_
;
946 Output_section
* os
= this->u1_
.relobj
->output_section(lsi
);
947 gold_assert(os
!= NULL
);
948 Address offset
= this->u1_
.relobj
->get_output_section_offset(lsi
);
949 if (offset
!= invalid_address
)
950 return offset
+ addend
;
951 // This is a merge section.
952 offset
= os
->output_address(this->u1_
.relobj
, lsi
, addend
);
953 gold_assert(offset
!= invalid_address
);
957 // Get the output address of a relocation.
959 template<bool dynamic
, int size
, bool big_endian
>
960 typename
elfcpp::Elf_types
<size
>::Elf_Addr
961 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_address() const
963 Address address
= this->address_
;
964 if (this->shndx_
!= INVALID_CODE
)
966 Output_section
* os
= this->u2_
.relobj
->output_section(this->shndx_
);
967 gold_assert(os
!= NULL
);
968 Address off
= this->u2_
.relobj
->get_output_section_offset(this->shndx_
);
969 if (off
!= invalid_address
)
970 address
+= os
->address() + off
;
973 address
= os
->output_address(this->u2_
.relobj
, this->shndx_
,
975 gold_assert(address
!= invalid_address
);
978 else if (this->u2_
.od
!= NULL
)
979 address
+= this->u2_
.od
->address();
983 // Write out the offset and info fields of a Rel or Rela relocation
986 template<bool dynamic
, int size
, bool big_endian
>
987 template<typename Write_rel
>
989 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write_rel(
992 wr
->put_r_offset(this->get_address());
993 unsigned int sym_index
= this->is_relative_
? 0 : this->get_symbol_index();
994 wr
->put_r_info(elfcpp::elf_r_info
<size
>(sym_index
, this->type_
));
997 // Write out a Rel relocation.
999 template<bool dynamic
, int size
, bool big_endian
>
1001 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write(
1002 unsigned char* pov
) const
1004 elfcpp::Rel_write
<size
, big_endian
> orel(pov
);
1005 this->write_rel(&orel
);
1008 // Get the value of the symbol referred to by a Rel relocation.
1010 template<bool dynamic
, int size
, bool big_endian
>
1011 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1012 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::symbol_value(
1013 Addend addend
) const
1015 if (this->local_sym_index_
== GSYM_CODE
)
1017 const Sized_symbol
<size
>* sym
;
1018 sym
= static_cast<const Sized_symbol
<size
>*>(this->u1_
.gsym
);
1019 return sym
->value() + addend
;
1021 gold_assert(this->local_sym_index_
!= SECTION_CODE
1022 && this->local_sym_index_
!= TARGET_CODE
1023 && this->local_sym_index_
!= INVALID_CODE
1024 && this->local_sym_index_
!= 0
1025 && !this->is_section_symbol_
);
1026 const unsigned int lsi
= this->local_sym_index_
;
1027 const Symbol_value
<size
>* symval
= this->u1_
.relobj
->local_symbol(lsi
);
1028 return symval
->value(this->u1_
.relobj
, addend
);
1031 // Reloc comparison. This function sorts the dynamic relocs for the
1032 // benefit of the dynamic linker. First we sort all relative relocs
1033 // to the front. Among relative relocs, we sort by output address.
1034 // Among non-relative relocs, we sort by symbol index, then by output
1037 template<bool dynamic
, int size
, bool big_endian
>
1039 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
1040 compare(const Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>& r2
)
1043 if (this->is_relative_
)
1045 if (!r2
.is_relative_
)
1047 // Otherwise sort by reloc address below.
1049 else if (r2
.is_relative_
)
1053 unsigned int sym1
= this->get_symbol_index();
1054 unsigned int sym2
= r2
.get_symbol_index();
1057 else if (sym1
> sym2
)
1059 // Otherwise sort by reloc address.
1062 section_offset_type addr1
= this->get_address();
1063 section_offset_type addr2
= r2
.get_address();
1066 else if (addr1
> addr2
)
1069 // Final tie breaker, in order to generate the same output on any
1070 // host: reloc type.
1071 unsigned int type1
= this->type_
;
1072 unsigned int type2
= r2
.type_
;
1075 else if (type1
> type2
)
1078 // These relocs appear to be exactly the same.
1082 // Write out a Rela relocation.
1084 template<bool dynamic
, int size
, bool big_endian
>
1086 Output_reloc
<elfcpp::SHT_RELA
, dynamic
, size
, big_endian
>::write(
1087 unsigned char* pov
) const
1089 elfcpp::Rela_write
<size
, big_endian
> orel(pov
);
1090 this->rel_
.write_rel(&orel
);
1091 Addend addend
= this->addend_
;
1092 if (this->rel_
.is_target_specific())
1093 addend
= parameters
->target().reloc_addend(this->rel_
.target_arg(),
1094 this->rel_
.type(), addend
);
1095 else if (this->rel_
.is_relative())
1096 addend
= this->rel_
.symbol_value(addend
);
1097 else if (this->rel_
.is_local_section_symbol())
1098 addend
= this->rel_
.local_section_offset(addend
);
1099 orel
.put_r_addend(addend
);
1102 // Output_data_reloc_base methods.
1104 // Adjust the output section.
1106 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1108 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>
1109 ::do_adjust_output_section(Output_section
* os
)
1111 if (sh_type
== elfcpp::SHT_REL
)
1112 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rel_size
);
1113 else if (sh_type
== elfcpp::SHT_RELA
)
1114 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rela_size
);
1118 os
->set_should_link_to_dynsym();
1120 os
->set_should_link_to_symtab();
1123 // Write out relocation data.
1125 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1127 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>::do_write(
1130 const off_t off
= this->offset();
1131 const off_t oview_size
= this->data_size();
1132 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1134 if (this->sort_relocs())
1136 gold_assert(dynamic
);
1137 std::sort(this->relocs_
.begin(), this->relocs_
.end(),
1138 Sort_relocs_comparison());
1141 unsigned char* pov
= oview
;
1142 for (typename
Relocs::const_iterator p
= this->relocs_
.begin();
1143 p
!= this->relocs_
.end();
1150 gold_assert(pov
- oview
== oview_size
);
1152 of
->write_output_view(off
, oview_size
, oview
);
1154 // We no longer need the relocation entries.
1155 this->relocs_
.clear();
1158 // Class Output_relocatable_relocs.
1160 template<int sh_type
, int size
, bool big_endian
>
1162 Output_relocatable_relocs
<sh_type
, size
, big_endian
>::set_final_data_size()
1164 this->set_data_size(this->rr_
->output_reloc_count()
1165 * Reloc_types
<sh_type
, size
, big_endian
>::reloc_size
);
1168 // class Output_data_group.
1170 template<int size
, bool big_endian
>
1171 Output_data_group
<size
, big_endian
>::Output_data_group(
1172 Sized_relobj
<size
, big_endian
>* relobj
,
1173 section_size_type entry_count
,
1174 elfcpp::Elf_Word flags
,
1175 std::vector
<unsigned int>* input_shndxes
)
1176 : Output_section_data(entry_count
* 4, 4, false),
1180 this->input_shndxes_
.swap(*input_shndxes
);
1183 // Write out the section group, which means translating the section
1184 // indexes to apply to the output file.
1186 template<int size
, bool big_endian
>
1188 Output_data_group
<size
, big_endian
>::do_write(Output_file
* of
)
1190 const off_t off
= this->offset();
1191 const section_size_type oview_size
=
1192 convert_to_section_size_type(this->data_size());
1193 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1195 elfcpp::Elf_Word
* contents
= reinterpret_cast<elfcpp::Elf_Word
*>(oview
);
1196 elfcpp::Swap
<32, big_endian
>::writeval(contents
, this->flags_
);
1199 for (std::vector
<unsigned int>::const_iterator p
=
1200 this->input_shndxes_
.begin();
1201 p
!= this->input_shndxes_
.end();
1204 Output_section
* os
= this->relobj_
->output_section(*p
);
1206 unsigned int output_shndx
;
1208 output_shndx
= os
->out_shndx();
1211 this->relobj_
->error(_("section group retained but "
1212 "group element discarded"));
1216 elfcpp::Swap
<32, big_endian
>::writeval(contents
, output_shndx
);
1219 size_t wrote
= reinterpret_cast<unsigned char*>(contents
) - oview
;
1220 gold_assert(wrote
== oview_size
);
1222 of
->write_output_view(off
, oview_size
, oview
);
1224 // We no longer need this information.
1225 this->input_shndxes_
.clear();
1228 // Output_data_got::Got_entry methods.
1230 // Write out the entry.
1232 template<int size
, bool big_endian
>
1234 Output_data_got
<size
, big_endian
>::Got_entry::write(unsigned char* pov
) const
1238 switch (this->local_sym_index_
)
1242 // If the symbol is resolved locally, we need to write out the
1243 // link-time value, which will be relocated dynamically by a
1244 // RELATIVE relocation.
1245 Symbol
* gsym
= this->u_
.gsym
;
1246 Sized_symbol
<size
>* sgsym
;
1247 // This cast is a bit ugly. We don't want to put a
1248 // virtual method in Symbol, because we want Symbol to be
1249 // as small as possible.
1250 sgsym
= static_cast<Sized_symbol
<size
>*>(gsym
);
1251 val
= sgsym
->value();
1256 val
= this->u_
.constant
;
1261 const unsigned int lsi
= this->local_sym_index_
;
1262 const Symbol_value
<size
>* symval
= this->u_
.object
->local_symbol(lsi
);
1263 val
= symval
->value(this->u_
.object
, 0);
1268 elfcpp::Swap
<size
, big_endian
>::writeval(pov
, val
);
1271 // Output_data_got methods.
1273 // Add an entry for a global symbol to the GOT. This returns true if
1274 // this is a new GOT entry, false if the symbol already had a GOT
1277 template<int size
, bool big_endian
>
1279 Output_data_got
<size
, big_endian
>::add_global(
1281 unsigned int got_type
)
1283 if (gsym
->has_got_offset(got_type
))
1286 this->entries_
.push_back(Got_entry(gsym
));
1287 this->set_got_size();
1288 gsym
->set_got_offset(got_type
, this->last_got_offset());
1292 // Add an entry for a global symbol to the GOT, and add a dynamic
1293 // relocation of type R_TYPE for the GOT entry.
1294 template<int size
, bool big_endian
>
1296 Output_data_got
<size
, big_endian
>::add_global_with_rel(
1298 unsigned int got_type
,
1300 unsigned int r_type
)
1302 if (gsym
->has_got_offset(got_type
))
1305 this->entries_
.push_back(Got_entry());
1306 this->set_got_size();
1307 unsigned int got_offset
= this->last_got_offset();
1308 gsym
->set_got_offset(got_type
, got_offset
);
1309 rel_dyn
->add_global(gsym
, r_type
, this, got_offset
);
1312 template<int size
, bool big_endian
>
1314 Output_data_got
<size
, big_endian
>::add_global_with_rela(
1316 unsigned int got_type
,
1318 unsigned int r_type
)
1320 if (gsym
->has_got_offset(got_type
))
1323 this->entries_
.push_back(Got_entry());
1324 this->set_got_size();
1325 unsigned int got_offset
= this->last_got_offset();
1326 gsym
->set_got_offset(got_type
, got_offset
);
1327 rela_dyn
->add_global(gsym
, r_type
, this, got_offset
, 0);
1330 // Add a pair of entries for a global symbol to the GOT, and add
1331 // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively.
1332 // If R_TYPE_2 == 0, add the second entry with no relocation.
1333 template<int size
, bool big_endian
>
1335 Output_data_got
<size
, big_endian
>::add_global_pair_with_rel(
1337 unsigned int got_type
,
1339 unsigned int r_type_1
,
1340 unsigned int r_type_2
)
1342 if (gsym
->has_got_offset(got_type
))
1345 this->entries_
.push_back(Got_entry());
1346 unsigned int got_offset
= this->last_got_offset();
1347 gsym
->set_got_offset(got_type
, got_offset
);
1348 rel_dyn
->add_global(gsym
, r_type_1
, this, got_offset
);
1350 this->entries_
.push_back(Got_entry());
1353 got_offset
= this->last_got_offset();
1354 rel_dyn
->add_global(gsym
, r_type_2
, this, got_offset
);
1357 this->set_got_size();
1360 template<int size
, bool big_endian
>
1362 Output_data_got
<size
, big_endian
>::add_global_pair_with_rela(
1364 unsigned int got_type
,
1366 unsigned int r_type_1
,
1367 unsigned int r_type_2
)
1369 if (gsym
->has_got_offset(got_type
))
1372 this->entries_
.push_back(Got_entry());
1373 unsigned int got_offset
= this->last_got_offset();
1374 gsym
->set_got_offset(got_type
, got_offset
);
1375 rela_dyn
->add_global(gsym
, r_type_1
, this, got_offset
, 0);
1377 this->entries_
.push_back(Got_entry());
1380 got_offset
= this->last_got_offset();
1381 rela_dyn
->add_global(gsym
, r_type_2
, this, got_offset
, 0);
1384 this->set_got_size();
1387 // Add an entry for a local symbol to the GOT. This returns true if
1388 // this is a new GOT entry, false if the symbol already has a GOT
1391 template<int size
, bool big_endian
>
1393 Output_data_got
<size
, big_endian
>::add_local(
1394 Sized_relobj
<size
, big_endian
>* object
,
1395 unsigned int symndx
,
1396 unsigned int got_type
)
1398 if (object
->local_has_got_offset(symndx
, got_type
))
1401 this->entries_
.push_back(Got_entry(object
, symndx
));
1402 this->set_got_size();
1403 object
->set_local_got_offset(symndx
, got_type
, this->last_got_offset());
1407 // Add an entry for a local symbol to the GOT, and add a dynamic
1408 // relocation of type R_TYPE for the GOT entry.
1409 template<int size
, bool big_endian
>
1411 Output_data_got
<size
, big_endian
>::add_local_with_rel(
1412 Sized_relobj
<size
, big_endian
>* object
,
1413 unsigned int symndx
,
1414 unsigned int got_type
,
1416 unsigned int r_type
)
1418 if (object
->local_has_got_offset(symndx
, got_type
))
1421 this->entries_
.push_back(Got_entry());
1422 this->set_got_size();
1423 unsigned int got_offset
= this->last_got_offset();
1424 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1425 rel_dyn
->add_local(object
, symndx
, r_type
, this, got_offset
);
1428 template<int size
, bool big_endian
>
1430 Output_data_got
<size
, big_endian
>::add_local_with_rela(
1431 Sized_relobj
<size
, big_endian
>* object
,
1432 unsigned int symndx
,
1433 unsigned int got_type
,
1435 unsigned int r_type
)
1437 if (object
->local_has_got_offset(symndx
, got_type
))
1440 this->entries_
.push_back(Got_entry());
1441 this->set_got_size();
1442 unsigned int got_offset
= this->last_got_offset();
1443 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1444 rela_dyn
->add_local(object
, symndx
, r_type
, this, got_offset
, 0);
1447 // Add a pair of entries for a local symbol to the GOT, and add
1448 // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively.
1449 // If R_TYPE_2 == 0, add the second entry with no relocation.
1450 template<int size
, bool big_endian
>
1452 Output_data_got
<size
, big_endian
>::add_local_pair_with_rel(
1453 Sized_relobj
<size
, big_endian
>* object
,
1454 unsigned int symndx
,
1456 unsigned int got_type
,
1458 unsigned int r_type_1
,
1459 unsigned int r_type_2
)
1461 if (object
->local_has_got_offset(symndx
, got_type
))
1464 this->entries_
.push_back(Got_entry());
1465 unsigned int got_offset
= this->last_got_offset();
1466 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1467 Output_section
* os
= object
->output_section(shndx
);
1468 rel_dyn
->add_output_section(os
, r_type_1
, this, got_offset
);
1470 this->entries_
.push_back(Got_entry(object
, symndx
));
1473 got_offset
= this->last_got_offset();
1474 rel_dyn
->add_output_section(os
, r_type_2
, this, got_offset
);
1477 this->set_got_size();
1480 template<int size
, bool big_endian
>
1482 Output_data_got
<size
, big_endian
>::add_local_pair_with_rela(
1483 Sized_relobj
<size
, big_endian
>* object
,
1484 unsigned int symndx
,
1486 unsigned int got_type
,
1488 unsigned int r_type_1
,
1489 unsigned int r_type_2
)
1491 if (object
->local_has_got_offset(symndx
, got_type
))
1494 this->entries_
.push_back(Got_entry());
1495 unsigned int got_offset
= this->last_got_offset();
1496 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1497 Output_section
* os
= object
->output_section(shndx
);
1498 rela_dyn
->add_output_section(os
, r_type_1
, this, got_offset
, 0);
1500 this->entries_
.push_back(Got_entry(object
, symndx
));
1503 got_offset
= this->last_got_offset();
1504 rela_dyn
->add_output_section(os
, r_type_2
, this, got_offset
, 0);
1507 this->set_got_size();
1510 // Write out the GOT.
1512 template<int size
, bool big_endian
>
1514 Output_data_got
<size
, big_endian
>::do_write(Output_file
* of
)
1516 const int add
= size
/ 8;
1518 const off_t off
= this->offset();
1519 const off_t oview_size
= this->data_size();
1520 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1522 unsigned char* pov
= oview
;
1523 for (typename
Got_entries::const_iterator p
= this->entries_
.begin();
1524 p
!= this->entries_
.end();
1531 gold_assert(pov
- oview
== oview_size
);
1533 of
->write_output_view(off
, oview_size
, oview
);
1535 // We no longer need the GOT entries.
1536 this->entries_
.clear();
1539 // Output_data_dynamic::Dynamic_entry methods.
1541 // Write out the entry.
1543 template<int size
, bool big_endian
>
1545 Output_data_dynamic::Dynamic_entry::write(
1547 const Stringpool
* pool
) const
1549 typename
elfcpp::Elf_types
<size
>::Elf_WXword val
;
1550 switch (this->offset_
)
1552 case DYNAMIC_NUMBER
:
1556 case DYNAMIC_SECTION_SIZE
:
1557 val
= this->u_
.od
->data_size();
1560 case DYNAMIC_SYMBOL
:
1562 const Sized_symbol
<size
>* s
=
1563 static_cast<const Sized_symbol
<size
>*>(this->u_
.sym
);
1568 case DYNAMIC_STRING
:
1569 val
= pool
->get_offset(this->u_
.str
);
1573 val
= this->u_
.od
->address() + this->offset_
;
1577 elfcpp::Dyn_write
<size
, big_endian
> dw(pov
);
1578 dw
.put_d_tag(this->tag_
);
1582 // Output_data_dynamic methods.
1584 // Adjust the output section to set the entry size.
1587 Output_data_dynamic::do_adjust_output_section(Output_section
* os
)
1589 if (parameters
->target().get_size() == 32)
1590 os
->set_entsize(elfcpp::Elf_sizes
<32>::dyn_size
);
1591 else if (parameters
->target().get_size() == 64)
1592 os
->set_entsize(elfcpp::Elf_sizes
<64>::dyn_size
);
1597 // Set the final data size.
1600 Output_data_dynamic::set_final_data_size()
1602 // Add the terminating entry if it hasn't been added.
1603 // Because of relaxation, we can run this multiple times.
1604 if (this->entries_
.empty()
1605 || this->entries_
.rbegin()->tag() != elfcpp::DT_NULL
)
1606 this->add_constant(elfcpp::DT_NULL
, 0);
1609 if (parameters
->target().get_size() == 32)
1610 dyn_size
= elfcpp::Elf_sizes
<32>::dyn_size
;
1611 else if (parameters
->target().get_size() == 64)
1612 dyn_size
= elfcpp::Elf_sizes
<64>::dyn_size
;
1615 this->set_data_size(this->entries_
.size() * dyn_size
);
1618 // Write out the dynamic entries.
1621 Output_data_dynamic::do_write(Output_file
* of
)
1623 switch (parameters
->size_and_endianness())
1625 #ifdef HAVE_TARGET_32_LITTLE
1626 case Parameters::TARGET_32_LITTLE
:
1627 this->sized_write
<32, false>(of
);
1630 #ifdef HAVE_TARGET_32_BIG
1631 case Parameters::TARGET_32_BIG
:
1632 this->sized_write
<32, true>(of
);
1635 #ifdef HAVE_TARGET_64_LITTLE
1636 case Parameters::TARGET_64_LITTLE
:
1637 this->sized_write
<64, false>(of
);
1640 #ifdef HAVE_TARGET_64_BIG
1641 case Parameters::TARGET_64_BIG
:
1642 this->sized_write
<64, true>(of
);
1650 template<int size
, bool big_endian
>
1652 Output_data_dynamic::sized_write(Output_file
* of
)
1654 const int dyn_size
= elfcpp::Elf_sizes
<size
>::dyn_size
;
1656 const off_t offset
= this->offset();
1657 const off_t oview_size
= this->data_size();
1658 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1660 unsigned char* pov
= oview
;
1661 for (typename
Dynamic_entries::const_iterator p
= this->entries_
.begin();
1662 p
!= this->entries_
.end();
1665 p
->write
<size
, big_endian
>(pov
, this->pool_
);
1669 gold_assert(pov
- oview
== oview_size
);
1671 of
->write_output_view(offset
, oview_size
, oview
);
1673 // We no longer need the dynamic entries.
1674 this->entries_
.clear();
1677 // Class Output_symtab_xindex.
1680 Output_symtab_xindex::do_write(Output_file
* of
)
1682 const off_t offset
= this->offset();
1683 const off_t oview_size
= this->data_size();
1684 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1686 memset(oview
, 0, oview_size
);
1688 if (parameters
->target().is_big_endian())
1689 this->endian_do_write
<true>(oview
);
1691 this->endian_do_write
<false>(oview
);
1693 of
->write_output_view(offset
, oview_size
, oview
);
1695 // We no longer need the data.
1696 this->entries_
.clear();
1699 template<bool big_endian
>
1701 Output_symtab_xindex::endian_do_write(unsigned char* const oview
)
1703 for (Xindex_entries::const_iterator p
= this->entries_
.begin();
1704 p
!= this->entries_
.end();
1707 unsigned int symndx
= p
->first
;
1708 gold_assert(symndx
* 4 < this->data_size());
1709 elfcpp::Swap
<32, big_endian
>::writeval(oview
+ symndx
* 4, p
->second
);
1713 // Output_section::Input_section methods.
1715 // Return the data size. For an input section we store the size here.
1716 // For an Output_section_data, we have to ask it for the size.
1719 Output_section::Input_section::data_size() const
1721 if (this->is_input_section())
1722 return this->u1_
.data_size
;
1724 return this->u2_
.posd
->data_size();
1727 // Set the address and file offset.
1730 Output_section::Input_section::set_address_and_file_offset(
1733 off_t section_file_offset
)
1735 if (this->is_input_section())
1736 this->u2_
.object
->set_section_offset(this->shndx_
,
1737 file_offset
- section_file_offset
);
1739 this->u2_
.posd
->set_address_and_file_offset(address
, file_offset
);
1742 // Reset the address and file offset.
1745 Output_section::Input_section::reset_address_and_file_offset()
1747 if (!this->is_input_section())
1748 this->u2_
.posd
->reset_address_and_file_offset();
1751 // Finalize the data size.
1754 Output_section::Input_section::finalize_data_size()
1756 if (!this->is_input_section())
1757 this->u2_
.posd
->finalize_data_size();
1760 // Try to turn an input offset into an output offset. We want to
1761 // return the output offset relative to the start of this
1762 // Input_section in the output section.
1765 Output_section::Input_section::output_offset(
1766 const Relobj
* object
,
1768 section_offset_type offset
,
1769 section_offset_type
*poutput
) const
1771 if (!this->is_input_section())
1772 return this->u2_
.posd
->output_offset(object
, shndx
, offset
, poutput
);
1775 if (this->shndx_
!= shndx
|| this->u2_
.object
!= object
)
1782 // Return whether this is the merge section for the input section
1786 Output_section::Input_section::is_merge_section_for(const Relobj
* object
,
1787 unsigned int shndx
) const
1789 if (this->is_input_section())
1791 return this->u2_
.posd
->is_merge_section_for(object
, shndx
);
1794 // Write out the data. We don't have to do anything for an input
1795 // section--they are handled via Object::relocate--but this is where
1796 // we write out the data for an Output_section_data.
1799 Output_section::Input_section::write(Output_file
* of
)
1801 if (!this->is_input_section())
1802 this->u2_
.posd
->write(of
);
1805 // Write the data to a buffer. As for write(), we don't have to do
1806 // anything for an input section.
1809 Output_section::Input_section::write_to_buffer(unsigned char* buffer
)
1811 if (!this->is_input_section())
1812 this->u2_
.posd
->write_to_buffer(buffer
);
1815 // Print to a map file.
1818 Output_section::Input_section::print_to_mapfile(Mapfile
* mapfile
) const
1820 switch (this->shndx_
)
1822 case OUTPUT_SECTION_CODE
:
1823 case MERGE_DATA_SECTION_CODE
:
1824 case MERGE_STRING_SECTION_CODE
:
1825 this->u2_
.posd
->print_to_mapfile(mapfile
);
1828 case RELAXED_INPUT_SECTION_CODE
:
1830 Output_relaxed_input_section
* relaxed_section
=
1831 this->relaxed_input_section();
1832 mapfile
->print_input_section(relaxed_section
->relobj(),
1833 relaxed_section
->shndx());
1837 mapfile
->print_input_section(this->u2_
.object
, this->shndx_
);
1842 // Output_section methods.
1844 // Construct an Output_section. NAME will point into a Stringpool.
1846 Output_section::Output_section(const char* name
, elfcpp::Elf_Word type
,
1847 elfcpp::Elf_Xword flags
)
1852 link_section_(NULL
),
1854 info_section_(NULL
),
1863 first_input_offset_(0),
1865 postprocessing_buffer_(NULL
),
1866 needs_symtab_index_(false),
1867 needs_dynsym_index_(false),
1868 should_link_to_symtab_(false),
1869 should_link_to_dynsym_(false),
1870 after_input_sections_(false),
1871 requires_postprocessing_(false),
1872 found_in_sections_clause_(false),
1873 has_load_address_(false),
1874 info_uses_section_index_(false),
1875 may_sort_attached_input_sections_(false),
1876 must_sort_attached_input_sections_(false),
1877 attached_input_sections_are_sorted_(false),
1879 is_relro_local_(false),
1880 is_last_relro_(false),
1881 is_first_non_relro_(false),
1882 is_small_section_(false),
1883 is_large_section_(false),
1885 is_dynamic_linker_section_(false),
1886 generate_code_fills_at_write_(false),
1887 is_entsize_zero_(false),
1890 merge_section_map_(),
1891 merge_section_by_properties_map_(),
1892 relaxed_input_section_map_(),
1893 is_relaxed_input_section_map_valid_(true)
1895 // An unallocated section has no address. Forcing this means that
1896 // we don't need special treatment for symbols defined in debug
1898 if ((flags
& elfcpp::SHF_ALLOC
) == 0)
1899 this->set_address(0);
1902 Output_section::~Output_section()
1904 delete this->checkpoint_
;
1907 // Set the entry size.
1910 Output_section::set_entsize(uint64_t v
)
1912 if (this->is_entsize_zero_
)
1914 else if (this->entsize_
== 0)
1916 else if (this->entsize_
!= v
)
1919 this->is_entsize_zero_
= 1;
1923 // Add the input section SHNDX, with header SHDR, named SECNAME, in
1924 // OBJECT, to the Output_section. RELOC_SHNDX is the index of a
1925 // relocation section which applies to this section, or 0 if none, or
1926 // -1U if more than one. Return the offset of the input section
1927 // within the output section. Return -1 if the input section will
1928 // receive special handling. In the normal case we don't always keep
1929 // track of input sections for an Output_section. Instead, each
1930 // Object keeps track of the Output_section for each of its input
1931 // sections. However, if HAVE_SECTIONS_SCRIPT is true, we do keep
1932 // track of input sections here; this is used when SECTIONS appears in
1935 template<int size
, bool big_endian
>
1937 Output_section::add_input_section(Sized_relobj
<size
, big_endian
>* object
,
1939 const char* secname
,
1940 const elfcpp::Shdr
<size
, big_endian
>& shdr
,
1941 unsigned int reloc_shndx
,
1942 bool have_sections_script
)
1944 elfcpp::Elf_Xword addralign
= shdr
.get_sh_addralign();
1945 if ((addralign
& (addralign
- 1)) != 0)
1947 object
->error(_("invalid alignment %lu for section \"%s\""),
1948 static_cast<unsigned long>(addralign
), secname
);
1952 if (addralign
> this->addralign_
)
1953 this->addralign_
= addralign
;
1955 typename
elfcpp::Elf_types
<size
>::Elf_WXword sh_flags
= shdr
.get_sh_flags();
1956 uint64_t entsize
= shdr
.get_sh_entsize();
1958 // .debug_str is a mergeable string section, but is not always so
1959 // marked by compilers. Mark manually here so we can optimize.
1960 if (strcmp(secname
, ".debug_str") == 0)
1962 sh_flags
|= (elfcpp::SHF_MERGE
| elfcpp::SHF_STRINGS
);
1966 this->update_flags_for_input_section(sh_flags
);
1967 this->set_entsize(entsize
);
1969 // If this is a SHF_MERGE section, we pass all the input sections to
1970 // a Output_data_merge. We don't try to handle relocations for such
1971 // a section. We don't try to handle empty merge sections--they
1972 // mess up the mappings, and are useless anyhow.
1973 if ((sh_flags
& elfcpp::SHF_MERGE
) != 0
1975 && shdr
.get_sh_size() > 0)
1977 if (this->add_merge_input_section(object
, shndx
, sh_flags
,
1978 entsize
, addralign
))
1980 // Tell the relocation routines that they need to call the
1981 // output_offset method to determine the final address.
1986 off_t offset_in_section
= this->current_data_size_for_child();
1987 off_t aligned_offset_in_section
= align_address(offset_in_section
,
1990 // Determine if we want to delay code-fill generation until the output
1991 // section is written. When the target is relaxing, we want to delay fill
1992 // generating to avoid adjusting them during relaxation.
1993 if (!this->generate_code_fills_at_write_
1994 && !have_sections_script
1995 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
1996 && parameters
->target().has_code_fill()
1997 && parameters
->target().may_relax())
1999 gold_assert(this->fills_
.empty());
2000 this->generate_code_fills_at_write_
= true;
2003 if (aligned_offset_in_section
> offset_in_section
2004 && !this->generate_code_fills_at_write_
2005 && !have_sections_script
2006 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2007 && parameters
->target().has_code_fill())
2009 // We need to add some fill data. Using fill_list_ when
2010 // possible is an optimization, since we will often have fill
2011 // sections without input sections.
2012 off_t fill_len
= aligned_offset_in_section
- offset_in_section
;
2013 if (this->input_sections_
.empty())
2014 this->fills_
.push_back(Fill(offset_in_section
, fill_len
));
2017 std::string
fill_data(parameters
->target().code_fill(fill_len
));
2018 Output_data_const
* odc
= new Output_data_const(fill_data
, 1);
2019 this->input_sections_
.push_back(Input_section(odc
));
2023 this->set_current_data_size_for_child(aligned_offset_in_section
2024 + shdr
.get_sh_size());
2026 // We need to keep track of this section if we are already keeping
2027 // track of sections, or if we are relaxing. Also, if this is a
2028 // section which requires sorting, or which may require sorting in
2029 // the future, we keep track of the sections.
2030 if (have_sections_script
2031 || !this->input_sections_
.empty()
2032 || this->may_sort_attached_input_sections()
2033 || this->must_sort_attached_input_sections()
2034 || parameters
->options().user_set_Map()
2035 || parameters
->target().may_relax())
2036 this->input_sections_
.push_back(Input_section(object
, shndx
,
2040 return aligned_offset_in_section
;
2043 // Add arbitrary data to an output section.
2046 Output_section::add_output_section_data(Output_section_data
* posd
)
2048 Input_section
inp(posd
);
2049 this->add_output_section_data(&inp
);
2051 if (posd
->is_data_size_valid())
2053 off_t offset_in_section
= this->current_data_size_for_child();
2054 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2056 this->set_current_data_size_for_child(aligned_offset_in_section
2057 + posd
->data_size());
2061 // Add a relaxed input section.
2064 Output_section::add_relaxed_input_section(Output_relaxed_input_section
* poris
)
2066 Input_section
inp(poris
);
2067 this->add_output_section_data(&inp
);
2068 if (this->is_relaxed_input_section_map_valid_
)
2070 Input_section_specifier
iss(poris
->relobj(), poris
->shndx());
2071 this->relaxed_input_section_map_
[iss
] = poris
;
2074 // For a relaxed section, we use the current data size. Linker scripts
2075 // get all the input sections, including relaxed one from an output
2076 // section and add them back to them same output section to compute the
2077 // output section size. If we do not account for sizes of relaxed input
2078 // sections, an output section would be incorrectly sized.
2079 off_t offset_in_section
= this->current_data_size_for_child();
2080 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2081 poris
->addralign());
2082 this->set_current_data_size_for_child(aligned_offset_in_section
2083 + poris
->current_data_size());
2086 // Add arbitrary data to an output section by Input_section.
2089 Output_section::add_output_section_data(Input_section
* inp
)
2091 if (this->input_sections_
.empty())
2092 this->first_input_offset_
= this->current_data_size_for_child();
2094 this->input_sections_
.push_back(*inp
);
2096 uint64_t addralign
= inp
->addralign();
2097 if (addralign
> this->addralign_
)
2098 this->addralign_
= addralign
;
2100 inp
->set_output_section(this);
2103 // Add a merge section to an output section.
2106 Output_section::add_output_merge_section(Output_section_data
* posd
,
2107 bool is_string
, uint64_t entsize
)
2109 Input_section
inp(posd
, is_string
, entsize
);
2110 this->add_output_section_data(&inp
);
2113 // Add an input section to a SHF_MERGE section.
2116 Output_section::add_merge_input_section(Relobj
* object
, unsigned int shndx
,
2117 uint64_t flags
, uint64_t entsize
,
2120 bool is_string
= (flags
& elfcpp::SHF_STRINGS
) != 0;
2122 // We only merge strings if the alignment is not more than the
2123 // character size. This could be handled, but it's unusual.
2124 if (is_string
&& addralign
> entsize
)
2127 // We cannot restore merged input section states.
2128 gold_assert(this->checkpoint_
== NULL
);
2130 // Look up merge sections by required properties.
2131 Merge_section_properties
msp(is_string
, entsize
, addralign
);
2132 Merge_section_by_properties_map::const_iterator p
=
2133 this->merge_section_by_properties_map_
.find(msp
);
2134 if (p
!= this->merge_section_by_properties_map_
.end())
2136 Output_merge_base
* merge_section
= p
->second
;
2137 merge_section
->add_input_section(object
, shndx
);
2138 gold_assert(merge_section
->is_string() == is_string
2139 && merge_section
->entsize() == entsize
2140 && merge_section
->addralign() == addralign
);
2142 // Link input section to found merge section.
2143 Input_section_specifier
iss(object
, shndx
);
2144 this->merge_section_map_
[iss
] = merge_section
;
2148 // We handle the actual constant merging in Output_merge_data or
2149 // Output_merge_string_data.
2150 Output_merge_base
* pomb
;
2152 pomb
= new Output_merge_data(entsize
, addralign
);
2158 pomb
= new Output_merge_string
<char>(addralign
);
2161 pomb
= new Output_merge_string
<uint16_t>(addralign
);
2164 pomb
= new Output_merge_string
<uint32_t>(addralign
);
2171 // Add new merge section to this output section and link merge section
2172 // properties to new merge section in map.
2173 this->add_output_merge_section(pomb
, is_string
, entsize
);
2174 this->merge_section_by_properties_map_
[msp
] = pomb
;
2176 // Add input section to new merge section and link input section to new
2177 // merge section in map.
2178 pomb
->add_input_section(object
, shndx
);
2179 Input_section_specifier
iss(object
, shndx
);
2180 this->merge_section_map_
[iss
] = pomb
;
2185 // Build a relaxation map to speed up relaxation of existing input sections.
2186 // Look up to the first LIMIT elements in INPUT_SECTIONS.
2189 Output_section::build_relaxation_map(
2190 const Input_section_list
& input_sections
,
2192 Relaxation_map
* relaxation_map
) const
2194 for (size_t i
= 0; i
< limit
; ++i
)
2196 const Input_section
& is(input_sections
[i
]);
2197 if (is
.is_input_section() || is
.is_relaxed_input_section())
2199 Input_section_specifier
iss(is
.relobj(), is
.shndx());
2200 (*relaxation_map
)[iss
] = i
;
2205 // Convert regular input sections in INPUT_SECTIONS into relaxed input
2206 // sections in RELAXED_SECTIONS. MAP is a prebuilt map from input section
2207 // specifier to indices of INPUT_SECTIONS.
2210 Output_section::convert_input_sections_in_list_to_relaxed_sections(
2211 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
,
2212 const Relaxation_map
& map
,
2213 Input_section_list
* input_sections
)
2215 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2217 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2218 Input_section_specifier
iss(poris
->relobj(), poris
->shndx());
2219 Relaxation_map::const_iterator p
= map
.find(iss
);
2220 gold_assert(p
!= map
.end());
2221 gold_assert((*input_sections
)[p
->second
].is_input_section());
2222 (*input_sections
)[p
->second
] = Input_section(poris
);
2226 // Convert regular input sections into relaxed input sections. RELAXED_SECTIONS
2227 // is a vector of pointers to Output_relaxed_input_section or its derived
2228 // classes. The relaxed sections must correspond to existing input sections.
2231 Output_section::convert_input_sections_to_relaxed_sections(
2232 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
)
2234 gold_assert(parameters
->target().may_relax());
2236 // We want to make sure that restore_states does not undo the effect of
2237 // this. If there is no checkpoint active, just search the current
2238 // input section list and replace the sections there. If there is
2239 // a checkpoint, also replace the sections there.
2241 // By default, we look at the whole list.
2242 size_t limit
= this->input_sections_
.size();
2244 if (this->checkpoint_
!= NULL
)
2246 // Replace input sections with relaxed input section in the saved
2247 // copy of the input section list.
2248 if (this->checkpoint_
->input_sections_saved())
2251 this->build_relaxation_map(
2252 *(this->checkpoint_
->input_sections()),
2253 this->checkpoint_
->input_sections()->size(),
2255 this->convert_input_sections_in_list_to_relaxed_sections(
2258 this->checkpoint_
->input_sections());
2262 // We have not copied the input section list yet. Instead, just
2263 // look at the portion that would be saved.
2264 limit
= this->checkpoint_
->input_sections_size();
2268 // Convert input sections in input_section_list.
2270 this->build_relaxation_map(this->input_sections_
, limit
, &map
);
2271 this->convert_input_sections_in_list_to_relaxed_sections(
2274 &this->input_sections_
);
2277 // Update the output section flags based on input section flags.
2280 Output_section::update_flags_for_input_section(elfcpp::Elf_Xword flags
)
2282 // If we created the section with SHF_ALLOC clear, we set the
2283 // address. If we are now setting the SHF_ALLOC flag, we need to
2285 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0
2286 && (flags
& elfcpp::SHF_ALLOC
) != 0)
2287 this->mark_address_invalid();
2289 this->flags_
|= (flags
2290 & (elfcpp::SHF_WRITE
2292 | elfcpp::SHF_EXECINSTR
));
2294 if ((flags
& elfcpp::SHF_MERGE
) == 0)
2295 this->flags_
&=~ elfcpp::SHF_MERGE
;
2298 if (this->current_data_size_for_child() == 0)
2299 this->flags_
|= elfcpp::SHF_MERGE
;
2302 if ((flags
& elfcpp::SHF_STRINGS
) == 0)
2303 this->flags_
&=~ elfcpp::SHF_STRINGS
;
2306 if (this->current_data_size_for_child() == 0)
2307 this->flags_
|= elfcpp::SHF_STRINGS
;
2311 // Find the merge section into which an input section with index SHNDX in
2312 // OBJECT has been added. Return NULL if none found.
2314 Output_section_data
*
2315 Output_section::find_merge_section(const Relobj
* object
,
2316 unsigned int shndx
) const
2318 Input_section_specifier
iss(object
, shndx
);
2319 Output_section_data_by_input_section_map::const_iterator p
=
2320 this->merge_section_map_
.find(iss
);
2321 if (p
!= this->merge_section_map_
.end())
2323 Output_section_data
* posd
= p
->second
;
2324 gold_assert(posd
->is_merge_section_for(object
, shndx
));
2331 // Find an relaxed input section corresponding to an input section
2332 // in OBJECT with index SHNDX.
2334 const Output_relaxed_input_section
*
2335 Output_section::find_relaxed_input_section(const Relobj
* object
,
2336 unsigned int shndx
) const
2338 // Be careful that the map may not be valid due to input section export
2339 // to scripts or a check-point restore.
2340 if (!this->is_relaxed_input_section_map_valid_
)
2342 // Rebuild the map as needed.
2343 this->relaxed_input_section_map_
.clear();
2344 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2345 p
!= this->input_sections_
.end();
2347 if (p
->is_relaxed_input_section())
2349 Input_section_specifier
iss(p
->relobj(), p
->shndx());
2350 this->relaxed_input_section_map_
[iss
] =
2351 p
->relaxed_input_section();
2353 this->is_relaxed_input_section_map_valid_
= true;
2356 Input_section_specifier
iss(object
, shndx
);
2357 Output_relaxed_input_section_by_input_section_map::const_iterator p
=
2358 this->relaxed_input_section_map_
.find(iss
);
2359 if (p
!= this->relaxed_input_section_map_
.end())
2365 // Given an address OFFSET relative to the start of input section
2366 // SHNDX in OBJECT, return whether this address is being included in
2367 // the final link. This should only be called if SHNDX in OBJECT has
2368 // a special mapping.
2371 Output_section::is_input_address_mapped(const Relobj
* object
,
2375 // Look at the Output_section_data_maps first.
2376 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2378 posd
= this->find_relaxed_input_section(object
, shndx
);
2382 section_offset_type output_offset
;
2383 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2385 return output_offset
!= -1;
2388 // Fall back to the slow look-up.
2389 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2390 p
!= this->input_sections_
.end();
2393 section_offset_type output_offset
;
2394 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2395 return output_offset
!= -1;
2398 // By default we assume that the address is mapped. This should
2399 // only be called after we have passed all sections to Layout. At
2400 // that point we should know what we are discarding.
2404 // Given an address OFFSET relative to the start of input section
2405 // SHNDX in object OBJECT, return the output offset relative to the
2406 // start of the input section in the output section. This should only
2407 // be called if SHNDX in OBJECT has a special mapping.
2410 Output_section::output_offset(const Relobj
* object
, unsigned int shndx
,
2411 section_offset_type offset
) const
2413 // This can only be called meaningfully when we know the data size
2415 gold_assert(this->is_data_size_valid());
2417 // Look at the Output_section_data_maps first.
2418 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2420 posd
= this->find_relaxed_input_section(object
, shndx
);
2423 section_offset_type output_offset
;
2424 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2426 return output_offset
;
2429 // Fall back to the slow look-up.
2430 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2431 p
!= this->input_sections_
.end();
2434 section_offset_type output_offset
;
2435 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2436 return output_offset
;
2441 // Return the output virtual address of OFFSET relative to the start
2442 // of input section SHNDX in object OBJECT.
2445 Output_section::output_address(const Relobj
* object
, unsigned int shndx
,
2448 uint64_t addr
= this->address() + this->first_input_offset_
;
2450 // Look at the Output_section_data_maps first.
2451 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2453 posd
= this->find_relaxed_input_section(object
, shndx
);
2454 if (posd
!= NULL
&& posd
->is_address_valid())
2456 section_offset_type output_offset
;
2457 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2459 return posd
->address() + output_offset
;
2462 // Fall back to the slow look-up.
2463 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2464 p
!= this->input_sections_
.end();
2467 addr
= align_address(addr
, p
->addralign());
2468 section_offset_type output_offset
;
2469 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2471 if (output_offset
== -1)
2473 return addr
+ output_offset
;
2475 addr
+= p
->data_size();
2478 // If we get here, it means that we don't know the mapping for this
2479 // input section. This might happen in principle if
2480 // add_input_section were called before add_output_section_data.
2481 // But it should never actually happen.
2486 // Find the output address of the start of the merged section for
2487 // input section SHNDX in object OBJECT.
2490 Output_section::find_starting_output_address(const Relobj
* object
,
2492 uint64_t* paddr
) const
2494 // FIXME: This becomes a bottle-neck if we have many relaxed sections.
2495 // Looking up the merge section map does not always work as we sometimes
2496 // find a merge section without its address set.
2497 uint64_t addr
= this->address() + this->first_input_offset_
;
2498 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2499 p
!= this->input_sections_
.end();
2502 addr
= align_address(addr
, p
->addralign());
2504 // It would be nice if we could use the existing output_offset
2505 // method to get the output offset of input offset 0.
2506 // Unfortunately we don't know for sure that input offset 0 is
2508 if (p
->is_merge_section_for(object
, shndx
))
2514 addr
+= p
->data_size();
2517 // We couldn't find a merge output section for this input section.
2521 // Set the data size of an Output_section. This is where we handle
2522 // setting the addresses of any Output_section_data objects.
2525 Output_section::set_final_data_size()
2527 if (this->input_sections_
.empty())
2529 this->set_data_size(this->current_data_size_for_child());
2533 if (this->must_sort_attached_input_sections())
2534 this->sort_attached_input_sections();
2536 uint64_t address
= this->address();
2537 off_t startoff
= this->offset();
2538 off_t off
= startoff
+ this->first_input_offset_
;
2539 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2540 p
!= this->input_sections_
.end();
2543 off
= align_address(off
, p
->addralign());
2544 p
->set_address_and_file_offset(address
+ (off
- startoff
), off
,
2546 off
+= p
->data_size();
2549 this->set_data_size(off
- startoff
);
2552 // Reset the address and file offset.
2555 Output_section::do_reset_address_and_file_offset()
2557 // An unallocated section has no address. Forcing this means that
2558 // we don't need special treatment for symbols defined in debug
2559 // sections. We do the same in the constructor.
2560 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0)
2561 this->set_address(0);
2563 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2564 p
!= this->input_sections_
.end();
2566 p
->reset_address_and_file_offset();
2569 // Return true if address and file offset have the values after reset.
2572 Output_section::do_address_and_file_offset_have_reset_values() const
2574 if (this->is_offset_valid())
2577 // An unallocated section has address 0 after its construction or a reset.
2578 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0)
2579 return this->is_address_valid() && this->address() == 0;
2581 return !this->is_address_valid();
2584 // Set the TLS offset. Called only for SHT_TLS sections.
2587 Output_section::do_set_tls_offset(uint64_t tls_base
)
2589 this->tls_offset_
= this->address() - tls_base
;
2592 // In a few cases we need to sort the input sections attached to an
2593 // output section. This is used to implement the type of constructor
2594 // priority ordering implemented by the GNU linker, in which the
2595 // priority becomes part of the section name and the sections are
2596 // sorted by name. We only do this for an output section if we see an
2597 // attached input section matching ".ctor.*", ".dtor.*",
2598 // ".init_array.*" or ".fini_array.*".
2600 class Output_section::Input_section_sort_entry
2603 Input_section_sort_entry()
2604 : input_section_(), index_(-1U), section_has_name_(false),
2608 Input_section_sort_entry(const Input_section
& input_section
,
2610 : input_section_(input_section
), index_(index
),
2611 section_has_name_(input_section
.is_input_section()
2612 || input_section
.is_relaxed_input_section())
2614 if (this->section_has_name_
)
2616 // This is only called single-threaded from Layout::finalize,
2617 // so it is OK to lock. Unfortunately we have no way to pass
2619 const Task
* dummy_task
= reinterpret_cast<const Task
*>(-1);
2620 Object
* obj
= (input_section
.is_input_section()
2621 ? input_section
.relobj()
2622 : input_section
.relaxed_input_section()->relobj());
2623 Task_lock_obj
<Object
> tl(dummy_task
, obj
);
2625 // This is a slow operation, which should be cached in
2626 // Layout::layout if this becomes a speed problem.
2627 this->section_name_
= obj
->section_name(input_section
.shndx());
2631 // Return the Input_section.
2632 const Input_section
&
2633 input_section() const
2635 gold_assert(this->index_
!= -1U);
2636 return this->input_section_
;
2639 // The index of this entry in the original list. This is used to
2640 // make the sort stable.
2644 gold_assert(this->index_
!= -1U);
2645 return this->index_
;
2648 // Whether there is a section name.
2650 section_has_name() const
2651 { return this->section_has_name_
; }
2653 // The section name.
2655 section_name() const
2657 gold_assert(this->section_has_name_
);
2658 return this->section_name_
;
2661 // Return true if the section name has a priority. This is assumed
2662 // to be true if it has a dot after the initial dot.
2664 has_priority() const
2666 gold_assert(this->section_has_name_
);
2667 return this->section_name_
.find('.', 1);
2670 // Return true if this an input file whose base name matches
2671 // FILE_NAME. The base name must have an extension of ".o", and
2672 // must be exactly FILE_NAME.o or FILE_NAME, one character, ".o".
2673 // This is to match crtbegin.o as well as crtbeginS.o without
2674 // getting confused by other possibilities. Overall matching the
2675 // file name this way is a dreadful hack, but the GNU linker does it
2676 // in order to better support gcc, and we need to be compatible.
2678 match_file_name(const char* match_file_name
) const
2680 const std::string
& file_name(this->input_section_
.relobj()->name());
2681 const char* base_name
= lbasename(file_name
.c_str());
2682 size_t match_len
= strlen(match_file_name
);
2683 if (strncmp(base_name
, match_file_name
, match_len
) != 0)
2685 size_t base_len
= strlen(base_name
);
2686 if (base_len
!= match_len
+ 2 && base_len
!= match_len
+ 3)
2688 return memcmp(base_name
+ base_len
- 2, ".o", 2) == 0;
2692 // The Input_section we are sorting.
2693 Input_section input_section_
;
2694 // The index of this Input_section in the original list.
2695 unsigned int index_
;
2696 // Whether this Input_section has a section name--it won't if this
2697 // is some random Output_section_data.
2698 bool section_has_name_
;
2699 // The section name if there is one.
2700 std::string section_name_
;
2703 // Return true if S1 should come before S2 in the output section.
2706 Output_section::Input_section_sort_compare::operator()(
2707 const Output_section::Input_section_sort_entry
& s1
,
2708 const Output_section::Input_section_sort_entry
& s2
) const
2710 // crtbegin.o must come first.
2711 bool s1_begin
= s1
.match_file_name("crtbegin");
2712 bool s2_begin
= s2
.match_file_name("crtbegin");
2713 if (s1_begin
|| s2_begin
)
2719 return s1
.index() < s2
.index();
2722 // crtend.o must come last.
2723 bool s1_end
= s1
.match_file_name("crtend");
2724 bool s2_end
= s2
.match_file_name("crtend");
2725 if (s1_end
|| s2_end
)
2731 return s1
.index() < s2
.index();
2734 // We sort all the sections with no names to the end.
2735 if (!s1
.section_has_name() || !s2
.section_has_name())
2737 if (s1
.section_has_name())
2739 if (s2
.section_has_name())
2741 return s1
.index() < s2
.index();
2744 // A section with a priority follows a section without a priority.
2745 // The GNU linker does this for all but .init_array sections; until
2746 // further notice we'll assume that that is an mistake.
2747 bool s1_has_priority
= s1
.has_priority();
2748 bool s2_has_priority
= s2
.has_priority();
2749 if (s1_has_priority
&& !s2_has_priority
)
2751 if (!s1_has_priority
&& s2_has_priority
)
2754 // Otherwise we sort by name.
2755 int compare
= s1
.section_name().compare(s2
.section_name());
2759 // Otherwise we keep the input order.
2760 return s1
.index() < s2
.index();
2763 // Sort the input sections attached to an output section.
2766 Output_section::sort_attached_input_sections()
2768 if (this->attached_input_sections_are_sorted_
)
2771 if (this->checkpoint_
!= NULL
2772 && !this->checkpoint_
->input_sections_saved())
2773 this->checkpoint_
->save_input_sections();
2775 // The only thing we know about an input section is the object and
2776 // the section index. We need the section name. Recomputing this
2777 // is slow but this is an unusual case. If this becomes a speed
2778 // problem we can cache the names as required in Layout::layout.
2780 // We start by building a larger vector holding a copy of each
2781 // Input_section, plus its current index in the list and its name.
2782 std::vector
<Input_section_sort_entry
> sort_list
;
2785 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2786 p
!= this->input_sections_
.end();
2788 sort_list
.push_back(Input_section_sort_entry(*p
, i
));
2790 // Sort the input sections.
2791 std::sort(sort_list
.begin(), sort_list
.end(), Input_section_sort_compare());
2793 // Copy the sorted input sections back to our list.
2794 this->input_sections_
.clear();
2795 for (std::vector
<Input_section_sort_entry
>::iterator p
= sort_list
.begin();
2796 p
!= sort_list
.end();
2798 this->input_sections_
.push_back(p
->input_section());
2800 // Remember that we sorted the input sections, since we might get
2802 this->attached_input_sections_are_sorted_
= true;
2805 // Write the section header to *OSHDR.
2807 template<int size
, bool big_endian
>
2809 Output_section::write_header(const Layout
* layout
,
2810 const Stringpool
* secnamepool
,
2811 elfcpp::Shdr_write
<size
, big_endian
>* oshdr
) const
2813 oshdr
->put_sh_name(secnamepool
->get_offset(this->name_
));
2814 oshdr
->put_sh_type(this->type_
);
2816 elfcpp::Elf_Xword flags
= this->flags_
;
2817 if (this->info_section_
!= NULL
&& this->info_uses_section_index_
)
2818 flags
|= elfcpp::SHF_INFO_LINK
;
2819 oshdr
->put_sh_flags(flags
);
2821 oshdr
->put_sh_addr(this->address());
2822 oshdr
->put_sh_offset(this->offset());
2823 oshdr
->put_sh_size(this->data_size());
2824 if (this->link_section_
!= NULL
)
2825 oshdr
->put_sh_link(this->link_section_
->out_shndx());
2826 else if (this->should_link_to_symtab_
)
2827 oshdr
->put_sh_link(layout
->symtab_section()->out_shndx());
2828 else if (this->should_link_to_dynsym_
)
2829 oshdr
->put_sh_link(layout
->dynsym_section()->out_shndx());
2831 oshdr
->put_sh_link(this->link_
);
2833 elfcpp::Elf_Word info
;
2834 if (this->info_section_
!= NULL
)
2836 if (this->info_uses_section_index_
)
2837 info
= this->info_section_
->out_shndx();
2839 info
= this->info_section_
->symtab_index();
2841 else if (this->info_symndx_
!= NULL
)
2842 info
= this->info_symndx_
->symtab_index();
2845 oshdr
->put_sh_info(info
);
2847 oshdr
->put_sh_addralign(this->addralign_
);
2848 oshdr
->put_sh_entsize(this->entsize_
);
2851 // Write out the data. For input sections the data is written out by
2852 // Object::relocate, but we have to handle Output_section_data objects
2856 Output_section::do_write(Output_file
* of
)
2858 gold_assert(!this->requires_postprocessing());
2860 // If the target performs relaxation, we delay filler generation until now.
2861 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
2863 off_t output_section_file_offset
= this->offset();
2864 for (Fill_list::iterator p
= this->fills_
.begin();
2865 p
!= this->fills_
.end();
2868 std::string
fill_data(parameters
->target().code_fill(p
->length()));
2869 of
->write(output_section_file_offset
+ p
->section_offset(),
2870 fill_data
.data(), fill_data
.size());
2873 off_t off
= this->offset() + this->first_input_offset_
;
2874 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2875 p
!= this->input_sections_
.end();
2878 off_t aligned_off
= align_address(off
, p
->addralign());
2879 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
2881 size_t fill_len
= aligned_off
- off
;
2882 std::string
fill_data(parameters
->target().code_fill(fill_len
));
2883 of
->write(off
, fill_data
.data(), fill_data
.size());
2887 off
= aligned_off
+ p
->data_size();
2891 // If a section requires postprocessing, create the buffer to use.
2894 Output_section::create_postprocessing_buffer()
2896 gold_assert(this->requires_postprocessing());
2898 if (this->postprocessing_buffer_
!= NULL
)
2901 if (!this->input_sections_
.empty())
2903 off_t off
= this->first_input_offset_
;
2904 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2905 p
!= this->input_sections_
.end();
2908 off
= align_address(off
, p
->addralign());
2909 p
->finalize_data_size();
2910 off
+= p
->data_size();
2912 this->set_current_data_size_for_child(off
);
2915 off_t buffer_size
= this->current_data_size_for_child();
2916 this->postprocessing_buffer_
= new unsigned char[buffer_size
];
2919 // Write all the data of an Output_section into the postprocessing
2920 // buffer. This is used for sections which require postprocessing,
2921 // such as compression. Input sections are handled by
2922 // Object::Relocate.
2925 Output_section::write_to_postprocessing_buffer()
2927 gold_assert(this->requires_postprocessing());
2929 // If the target performs relaxation, we delay filler generation until now.
2930 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
2932 unsigned char* buffer
= this->postprocessing_buffer();
2933 for (Fill_list::iterator p
= this->fills_
.begin();
2934 p
!= this->fills_
.end();
2937 std::string
fill_data(parameters
->target().code_fill(p
->length()));
2938 memcpy(buffer
+ p
->section_offset(), fill_data
.data(),
2942 off_t off
= this->first_input_offset_
;
2943 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2944 p
!= this->input_sections_
.end();
2947 off_t aligned_off
= align_address(off
, p
->addralign());
2948 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
2950 size_t fill_len
= aligned_off
- off
;
2951 std::string
fill_data(parameters
->target().code_fill(fill_len
));
2952 memcpy(buffer
+ off
, fill_data
.data(), fill_data
.size());
2955 p
->write_to_buffer(buffer
+ aligned_off
);
2956 off
= aligned_off
+ p
->data_size();
2960 // Get the input sections for linker script processing. We leave
2961 // behind the Output_section_data entries. Note that this may be
2962 // slightly incorrect for merge sections. We will leave them behind,
2963 // but it is possible that the script says that they should follow
2964 // some other input sections, as in:
2965 // .rodata { *(.rodata) *(.rodata.cst*) }
2966 // For that matter, we don't handle this correctly:
2967 // .rodata { foo.o(.rodata.cst*) *(.rodata.cst*) }
2968 // With luck this will never matter.
2971 Output_section::get_input_sections(
2973 const std::string
& fill
,
2974 std::list
<Simple_input_section
>* input_sections
)
2976 if (this->checkpoint_
!= NULL
2977 && !this->checkpoint_
->input_sections_saved())
2978 this->checkpoint_
->save_input_sections();
2980 // Invalidate the relaxed input section map.
2981 this->is_relaxed_input_section_map_valid_
= false;
2983 uint64_t orig_address
= address
;
2985 address
= align_address(address
, this->addralign());
2987 Input_section_list remaining
;
2988 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2989 p
!= this->input_sections_
.end();
2992 if (p
->is_input_section())
2993 input_sections
->push_back(Simple_input_section(p
->relobj(),
2995 else if (p
->is_relaxed_input_section())
2996 input_sections
->push_back(
2997 Simple_input_section(p
->relaxed_input_section()));
3000 uint64_t aligned_address
= align_address(address
, p
->addralign());
3001 if (aligned_address
!= address
&& !fill
.empty())
3003 section_size_type length
=
3004 convert_to_section_size_type(aligned_address
- address
);
3005 std::string this_fill
;
3006 this_fill
.reserve(length
);
3007 while (this_fill
.length() + fill
.length() <= length
)
3009 if (this_fill
.length() < length
)
3010 this_fill
.append(fill
, 0, length
- this_fill
.length());
3012 Output_section_data
* posd
= new Output_data_const(this_fill
, 0);
3013 remaining
.push_back(Input_section(posd
));
3015 address
= aligned_address
;
3017 remaining
.push_back(*p
);
3019 p
->finalize_data_size();
3020 address
+= p
->data_size();
3024 this->input_sections_
.swap(remaining
);
3025 this->first_input_offset_
= 0;
3027 uint64_t data_size
= address
- orig_address
;
3028 this->set_current_data_size_for_child(data_size
);
3032 // Add an input section from a script.
3035 Output_section::add_input_section_for_script(const Simple_input_section
& sis
,
3039 if (addralign
> this->addralign_
)
3040 this->addralign_
= addralign
;
3042 off_t offset_in_section
= this->current_data_size_for_child();
3043 off_t aligned_offset_in_section
= align_address(offset_in_section
,
3046 this->set_current_data_size_for_child(aligned_offset_in_section
3050 (sis
.is_relaxed_input_section()
3051 ? Input_section(sis
.relaxed_input_section())
3052 : Input_section(sis
.relobj(), sis
.shndx(), data_size
, addralign
));
3053 this->input_sections_
.push_back(is
);
3059 Output_section::save_states()
3061 gold_assert(this->checkpoint_
== NULL
);
3062 Checkpoint_output_section
* checkpoint
=
3063 new Checkpoint_output_section(this->addralign_
, this->flags_
,
3064 this->input_sections_
,
3065 this->first_input_offset_
,
3066 this->attached_input_sections_are_sorted_
);
3067 this->checkpoint_
= checkpoint
;
3068 gold_assert(this->fills_
.empty());
3072 Output_section::restore_states()
3074 gold_assert(this->checkpoint_
!= NULL
);
3075 Checkpoint_output_section
* checkpoint
= this->checkpoint_
;
3077 this->addralign_
= checkpoint
->addralign();
3078 this->flags_
= checkpoint
->flags();
3079 this->first_input_offset_
= checkpoint
->first_input_offset();
3081 if (!checkpoint
->input_sections_saved())
3083 // If we have not copied the input sections, just resize it.
3084 size_t old_size
= checkpoint
->input_sections_size();
3085 gold_assert(this->input_sections_
.size() >= old_size
);
3086 this->input_sections_
.resize(old_size
);
3090 // We need to copy the whole list. This is not efficient for
3091 // extremely large output with hundreads of thousands of input
3092 // objects. We may need to re-think how we should pass sections
3094 this->input_sections_
= *checkpoint
->input_sections();
3097 this->attached_input_sections_are_sorted_
=
3098 checkpoint
->attached_input_sections_are_sorted();
3100 // Simply invalidate the relaxed input section map since we do not keep
3102 this->is_relaxed_input_section_map_valid_
= false;
3105 // Print to the map file.
3108 Output_section::do_print_to_mapfile(Mapfile
* mapfile
) const
3110 mapfile
->print_output_section(this);
3112 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
3113 p
!= this->input_sections_
.end();
3115 p
->print_to_mapfile(mapfile
);
3118 // Print stats for merge sections to stderr.
3121 Output_section::print_merge_stats()
3123 Input_section_list::iterator p
;
3124 for (p
= this->input_sections_
.begin();
3125 p
!= this->input_sections_
.end();
3127 p
->print_merge_stats(this->name_
);
3130 // Output segment methods.
3132 Output_segment::Output_segment(elfcpp::Elf_Word type
, elfcpp::Elf_Word flags
)
3144 is_max_align_known_(false),
3145 are_addresses_set_(false),
3146 is_large_data_segment_(false)
3148 // The ELF ABI specifies that a PT_TLS segment always has PF_R as
3150 if (type
== elfcpp::PT_TLS
)
3151 this->flags_
= elfcpp::PF_R
;
3154 // Add an Output_section to an Output_segment.
3157 Output_segment::add_output_section(Output_section
* os
,
3158 elfcpp::Elf_Word seg_flags
,
3161 gold_assert((os
->flags() & elfcpp::SHF_ALLOC
) != 0);
3162 gold_assert(!this->is_max_align_known_
);
3163 gold_assert(os
->is_large_data_section() == this->is_large_data_segment());
3164 gold_assert(this->type() == elfcpp::PT_LOAD
|| !do_sort
);
3166 this->update_flags_for_output_section(seg_flags
);
3168 Output_segment::Output_data_list
* pdl
;
3169 if (os
->type() == elfcpp::SHT_NOBITS
)
3170 pdl
= &this->output_bss_
;
3172 pdl
= &this->output_data_
;
3174 // Note that while there may be many input sections in an output
3175 // section, there are normally only a few output sections in an
3176 // output segment. The loops below are expected to be fast.
3178 // So that PT_NOTE segments will work correctly, we need to ensure
3179 // that all SHT_NOTE sections are adjacent.
3180 if (os
->type() == elfcpp::SHT_NOTE
&& !pdl
->empty())
3182 Output_segment::Output_data_list::iterator p
= pdl
->end();
3186 if ((*p
)->is_section_type(elfcpp::SHT_NOTE
))
3193 while (p
!= pdl
->begin());
3196 // Similarly, so that PT_TLS segments will work, we need to group
3197 // SHF_TLS sections. An SHF_TLS/SHT_NOBITS section is a special
3198 // case: we group the SHF_TLS/SHT_NOBITS sections right after the
3199 // SHF_TLS/SHT_PROGBITS sections. This lets us set up PT_TLS
3200 // correctly. SHF_TLS sections get added to both a PT_LOAD segment
3201 // and the PT_TLS segment; we do this grouping only for the PT_LOAD
3203 if (this->type_
!= elfcpp::PT_TLS
3204 && (os
->flags() & elfcpp::SHF_TLS
) != 0)
3206 pdl
= &this->output_data_
;
3209 bool nobits
= os
->type() == elfcpp::SHT_NOBITS
;
3210 bool sawtls
= false;
3211 Output_segment::Output_data_list::iterator p
= pdl
->end();
3212 gold_assert(p
!= pdl
->begin());
3217 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
3220 // Put a NOBITS section after the first TLS section.
3221 // Put a PROGBITS section after the first
3222 // TLS/PROGBITS section.
3223 insert
= nobits
|| !(*p
)->is_section_type(elfcpp::SHT_NOBITS
);
3227 // If we've gone past the TLS sections, but we've
3228 // seen a TLS section, then we need to insert this
3240 while (p
!= pdl
->begin());
3243 // There are no TLS sections yet; put this one at the requested
3244 // location in the section list.
3249 // For the PT_GNU_RELRO segment, we need to group relro
3250 // sections, and we need to put them before any non-relro
3251 // sections. Any relro local sections go before relro non-local
3252 // sections. One section may be marked as the last relro
3256 gold_assert(pdl
== &this->output_data_
);
3257 Output_segment::Output_data_list::iterator p
;
3258 for (p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
3260 if (!(*p
)->is_section())
3263 Output_section
* pos
= (*p
)->output_section();
3264 if (!pos
->is_relro()
3265 || (os
->is_relro_local() && !pos
->is_relro_local())
3266 || (!os
->is_last_relro() && pos
->is_last_relro()))
3274 // One section may be marked as the first section which follows
3275 // the relro sections.
3276 if (os
->is_first_non_relro())
3278 gold_assert(pdl
== &this->output_data_
);
3279 Output_segment::Output_data_list::iterator p
;
3280 for (p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
3282 if (!(*p
)->is_section())
3285 Output_section
* pos
= (*p
)->output_section();
3286 if (!pos
->is_relro())
3295 // Small data sections go at the end of the list of data sections.
3296 // If OS is not small, and there are small sections, we have to
3297 // insert it before the first small section.
3298 if (os
->type() != elfcpp::SHT_NOBITS
3299 && !os
->is_small_section()
3301 && pdl
->back()->is_section()
3302 && pdl
->back()->output_section()->is_small_section())
3304 for (Output_segment::Output_data_list::iterator p
= pdl
->begin();
3308 if ((*p
)->is_section()
3309 && (*p
)->output_section()->is_small_section())
3318 // A small BSS section goes at the start of the BSS sections, after
3319 // other small BSS sections.
3320 if (os
->type() == elfcpp::SHT_NOBITS
&& os
->is_small_section())
3322 for (Output_segment::Output_data_list::iterator p
= pdl
->begin();
3326 if (!(*p
)->is_section()
3327 || !(*p
)->output_section()->is_small_section())
3335 // A large BSS section goes at the end of the BSS sections, which
3336 // means that one that is not large must come before the first large
3338 if (os
->type() == elfcpp::SHT_NOBITS
3339 && !os
->is_large_section()
3341 && pdl
->back()->is_section()
3342 && pdl
->back()->output_section()->is_large_section())
3344 for (Output_segment::Output_data_list::iterator p
= pdl
->begin();
3348 if ((*p
)->is_section()
3349 && (*p
)->output_section()->is_large_section())
3358 // We do some further output section sorting in order to make the
3359 // generated program run more efficiently. We should only do this
3360 // when not using a linker script, so it is controled by the DO_SORT
3364 // FreeBSD requires the .interp section to be in the first page
3365 // of the executable. That is a more efficient location anyhow
3366 // for any OS, since it means that the kernel will have the data
3367 // handy after it reads the program headers.
3368 if (os
->is_interp() && !pdl
->empty())
3370 pdl
->insert(pdl
->begin(), os
);
3374 // Put loadable non-writable notes immediately after the .interp
3375 // sections, so that the PT_NOTE segment is on the first page of
3377 if (os
->type() == elfcpp::SHT_NOTE
3378 && (os
->flags() & elfcpp::SHF_WRITE
) == 0
3381 Output_segment::Output_data_list::iterator p
= pdl
->begin();
3382 if ((*p
)->is_section() && (*p
)->output_section()->is_interp())
3388 // If this section is used by the dynamic linker, and it is not
3389 // writable, then put it first, after the .interp section and
3390 // any loadable notes. This makes it more likely that the
3391 // dynamic linker will have to read less data from the disk.
3392 if (os
->is_dynamic_linker_section()
3394 && (os
->flags() & elfcpp::SHF_WRITE
) == 0)
3396 bool is_reloc
= (os
->type() == elfcpp::SHT_REL
3397 || os
->type() == elfcpp::SHT_RELA
);
3398 Output_segment::Output_data_list::iterator p
= pdl
->begin();
3399 while (p
!= pdl
->end()
3400 && (*p
)->is_section()
3401 && ((*p
)->output_section()->is_dynamic_linker_section()
3402 || (*p
)->output_section()->type() == elfcpp::SHT_NOTE
))
3404 // Put reloc sections after the other ones. Putting the
3405 // dynamic reloc sections first confuses BFD, notably
3406 // objcopy and strip.
3408 && ((*p
)->output_section()->type() == elfcpp::SHT_REL
3409 || (*p
)->output_section()->type() == elfcpp::SHT_RELA
))
3418 // If there were no constraints on the output section, just add it
3419 // to the end of the list.
3423 // Remove an Output_section from this segment. It is an error if it
3427 Output_segment::remove_output_section(Output_section
* os
)
3429 // We only need this for SHT_PROGBITS.
3430 gold_assert(os
->type() == elfcpp::SHT_PROGBITS
);
3431 for (Output_data_list::iterator p
= this->output_data_
.begin();
3432 p
!= this->output_data_
.end();
3437 this->output_data_
.erase(p
);
3444 // Add an Output_data (which need not be an Output_section) to the
3445 // start of a segment.
3448 Output_segment::add_initial_output_data(Output_data
* od
)
3450 gold_assert(!this->is_max_align_known_
);
3451 this->output_data_
.push_front(od
);
3454 // Return whether the first data section is a relro section.
3457 Output_segment::is_first_section_relro() const
3459 return (!this->output_data_
.empty()
3460 && this->output_data_
.front()->is_section()
3461 && this->output_data_
.front()->output_section()->is_relro());
3464 // Return the maximum alignment of the Output_data in Output_segment.
3467 Output_segment::maximum_alignment()
3469 if (!this->is_max_align_known_
)
3473 addralign
= Output_segment::maximum_alignment_list(&this->output_data_
);
3474 if (addralign
> this->max_align_
)
3475 this->max_align_
= addralign
;
3477 addralign
= Output_segment::maximum_alignment_list(&this->output_bss_
);
3478 if (addralign
> this->max_align_
)
3479 this->max_align_
= addralign
;
3481 this->is_max_align_known_
= true;
3484 return this->max_align_
;
3487 // Return the maximum alignment of a list of Output_data.
3490 Output_segment::maximum_alignment_list(const Output_data_list
* pdl
)
3493 for (Output_data_list::const_iterator p
= pdl
->begin();
3497 uint64_t addralign
= (*p
)->addralign();
3498 if (addralign
> ret
)
3504 // Return the number of dynamic relocs applied to this segment.
3507 Output_segment::dynamic_reloc_count() const
3509 return (this->dynamic_reloc_count_list(&this->output_data_
)
3510 + this->dynamic_reloc_count_list(&this->output_bss_
));
3513 // Return the number of dynamic relocs applied to an Output_data_list.
3516 Output_segment::dynamic_reloc_count_list(const Output_data_list
* pdl
) const
3518 unsigned int count
= 0;
3519 for (Output_data_list::const_iterator p
= pdl
->begin();
3522 count
+= (*p
)->dynamic_reloc_count();
3526 // Set the section addresses for an Output_segment. If RESET is true,
3527 // reset the addresses first. ADDR is the address and *POFF is the
3528 // file offset. Set the section indexes starting with *PSHNDX.
3529 // Return the address of the immediately following segment. Update
3530 // *POFF and *PSHNDX.
3533 Output_segment::set_section_addresses(const Layout
* layout
, bool reset
,
3535 unsigned int increase_relro
,
3537 unsigned int* pshndx
)
3539 gold_assert(this->type_
== elfcpp::PT_LOAD
);
3541 off_t orig_off
= *poff
;
3543 // If we have relro sections, we need to pad forward now so that the
3544 // relro sections plus INCREASE_RELRO end on a common page boundary.
3545 if (parameters
->options().relro()
3546 && this->is_first_section_relro()
3547 && (!this->are_addresses_set_
|| reset
))
3549 uint64_t relro_size
= 0;
3551 for (Output_data_list::iterator p
= this->output_data_
.begin();
3552 p
!= this->output_data_
.end();
3555 if (!(*p
)->is_section())
3557 Output_section
* pos
= (*p
)->output_section();
3558 if (!pos
->is_relro())
3560 gold_assert(!(*p
)->is_section_flag_set(elfcpp::SHF_TLS
));
3561 if ((*p
)->is_address_valid())
3562 relro_size
+= (*p
)->data_size();
3565 // FIXME: This could be faster.
3566 (*p
)->set_address_and_file_offset(addr
+ relro_size
,
3568 relro_size
+= (*p
)->data_size();
3569 (*p
)->reset_address_and_file_offset();
3572 relro_size
+= increase_relro
;
3574 uint64_t page_align
= parameters
->target().common_pagesize();
3576 // Align to offset N such that (N + RELRO_SIZE) % PAGE_ALIGN == 0.
3577 uint64_t desired_align
= page_align
- (relro_size
% page_align
);
3578 if (desired_align
< *poff
% page_align
)
3579 *poff
+= page_align
- *poff
% page_align
;
3580 *poff
+= desired_align
- *poff
% page_align
;
3581 addr
+= *poff
- orig_off
;
3585 if (!reset
&& this->are_addresses_set_
)
3587 gold_assert(this->paddr_
== addr
);
3588 addr
= this->vaddr_
;
3592 this->vaddr_
= addr
;
3593 this->paddr_
= addr
;
3594 this->are_addresses_set_
= true;
3597 bool in_tls
= false;
3599 this->offset_
= orig_off
;
3601 addr
= this->set_section_list_addresses(layout
, reset
, &this->output_data_
,
3602 addr
, poff
, pshndx
, &in_tls
);
3603 this->filesz_
= *poff
- orig_off
;
3607 uint64_t ret
= this->set_section_list_addresses(layout
, reset
,
3612 // If the last section was a TLS section, align upward to the
3613 // alignment of the TLS segment, so that the overall size of the TLS
3614 // segment is aligned.
3617 uint64_t segment_align
= layout
->tls_segment()->maximum_alignment();
3618 *poff
= align_address(*poff
, segment_align
);
3621 this->memsz_
= *poff
- orig_off
;
3623 // Ignore the file offset adjustments made by the BSS Output_data
3630 // Set the addresses and file offsets in a list of Output_data
3634 Output_segment::set_section_list_addresses(const Layout
* layout
, bool reset
,
3635 Output_data_list
* pdl
,
3636 uint64_t addr
, off_t
* poff
,
3637 unsigned int* pshndx
,
3640 off_t startoff
= *poff
;
3642 off_t off
= startoff
;
3643 for (Output_data_list::iterator p
= pdl
->begin();
3648 (*p
)->reset_address_and_file_offset();
3650 // When using a linker script the section will most likely
3651 // already have an address.
3652 if (!(*p
)->is_address_valid())
3654 uint64_t align
= (*p
)->addralign();
3656 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
3658 // Give the first TLS section the alignment of the
3659 // entire TLS segment. Otherwise the TLS segment as a
3660 // whole may be misaligned.
3663 Output_segment
* tls_segment
= layout
->tls_segment();
3664 gold_assert(tls_segment
!= NULL
);
3665 uint64_t segment_align
= tls_segment
->maximum_alignment();
3666 gold_assert(segment_align
>= align
);
3667 align
= segment_align
;
3674 // If this is the first section after the TLS segment,
3675 // align it to at least the alignment of the TLS
3676 // segment, so that the size of the overall TLS segment
3680 uint64_t segment_align
=
3681 layout
->tls_segment()->maximum_alignment();
3682 if (segment_align
> align
)
3683 align
= segment_align
;
3689 off
= align_address(off
, align
);
3690 (*p
)->set_address_and_file_offset(addr
+ (off
- startoff
), off
);
3694 // The script may have inserted a skip forward, but it
3695 // better not have moved backward.
3696 if ((*p
)->address() >= addr
+ (off
- startoff
))
3697 off
+= (*p
)->address() - (addr
+ (off
- startoff
));
3700 if (!layout
->script_options()->saw_sections_clause())
3704 Output_section
* os
= (*p
)->output_section();
3706 // Cast to unsigned long long to avoid format warnings.
3707 unsigned long long previous_dot
=
3708 static_cast<unsigned long long>(addr
+ (off
- startoff
));
3709 unsigned long long dot
=
3710 static_cast<unsigned long long>((*p
)->address());
3713 gold_error(_("dot moves backward in linker script "
3714 "from 0x%llx to 0x%llx"), previous_dot
, dot
);
3716 gold_error(_("address of section '%s' moves backward "
3717 "from 0x%llx to 0x%llx"),
3718 os
->name(), previous_dot
, dot
);
3721 (*p
)->set_file_offset(off
);
3722 (*p
)->finalize_data_size();
3725 // We want to ignore the size of a SHF_TLS or SHT_NOBITS
3726 // section. Such a section does not affect the size of a
3728 if (!(*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
3729 || !(*p
)->is_section_type(elfcpp::SHT_NOBITS
))
3730 off
+= (*p
)->data_size();
3732 if ((*p
)->is_section())
3734 (*p
)->set_out_shndx(*pshndx
);
3740 return addr
+ (off
- startoff
);
3743 // For a non-PT_LOAD segment, set the offset from the sections, if
3744 // any. Add INCREASE to the file size and the memory size.
3747 Output_segment::set_offset(unsigned int increase
)
3749 gold_assert(this->type_
!= elfcpp::PT_LOAD
);
3751 gold_assert(!this->are_addresses_set_
);
3753 if (this->output_data_
.empty() && this->output_bss_
.empty())
3755 gold_assert(increase
== 0);
3758 this->are_addresses_set_
= true;
3760 this->min_p_align_
= 0;
3766 const Output_data
* first
;
3767 if (this->output_data_
.empty())
3768 first
= this->output_bss_
.front();
3770 first
= this->output_data_
.front();
3771 this->vaddr_
= first
->address();
3772 this->paddr_
= (first
->has_load_address()
3773 ? first
->load_address()
3775 this->are_addresses_set_
= true;
3776 this->offset_
= first
->offset();
3778 if (this->output_data_
.empty())
3782 const Output_data
* last_data
= this->output_data_
.back();
3783 this->filesz_
= (last_data
->address()
3784 + last_data
->data_size()
3788 const Output_data
* last
;
3789 if (this->output_bss_
.empty())
3790 last
= this->output_data_
.back();
3792 last
= this->output_bss_
.back();
3793 this->memsz_
= (last
->address()
3797 this->filesz_
+= increase
;
3798 this->memsz_
+= increase
;
3800 // If this is a TLS segment, align the memory size. The code in
3801 // set_section_list ensures that the section after the TLS segment
3802 // is aligned to give us room.
3803 if (this->type_
== elfcpp::PT_TLS
)
3805 uint64_t segment_align
= this->maximum_alignment();
3806 gold_assert(this->vaddr_
== align_address(this->vaddr_
, segment_align
));
3807 this->memsz_
= align_address(this->memsz_
, segment_align
);
3811 // Set the TLS offsets of the sections in the PT_TLS segment.
3814 Output_segment::set_tls_offsets()
3816 gold_assert(this->type_
== elfcpp::PT_TLS
);
3818 for (Output_data_list::iterator p
= this->output_data_
.begin();
3819 p
!= this->output_data_
.end();
3821 (*p
)->set_tls_offset(this->vaddr_
);
3823 for (Output_data_list::iterator p
= this->output_bss_
.begin();
3824 p
!= this->output_bss_
.end();
3826 (*p
)->set_tls_offset(this->vaddr_
);
3829 // Return the address of the first section.
3832 Output_segment::first_section_load_address() const
3834 for (Output_data_list::const_iterator p
= this->output_data_
.begin();
3835 p
!= this->output_data_
.end();
3837 if ((*p
)->is_section())
3838 return (*p
)->has_load_address() ? (*p
)->load_address() : (*p
)->address();
3840 for (Output_data_list::const_iterator p
= this->output_bss_
.begin();
3841 p
!= this->output_bss_
.end();
3843 if ((*p
)->is_section())
3844 return (*p
)->has_load_address() ? (*p
)->load_address() : (*p
)->address();
3849 // Return the number of Output_sections in an Output_segment.
3852 Output_segment::output_section_count() const
3854 return (this->output_section_count_list(&this->output_data_
)
3855 + this->output_section_count_list(&this->output_bss_
));
3858 // Return the number of Output_sections in an Output_data_list.
3861 Output_segment::output_section_count_list(const Output_data_list
* pdl
) const
3863 unsigned int count
= 0;
3864 for (Output_data_list::const_iterator p
= pdl
->begin();
3868 if ((*p
)->is_section())
3874 // Return the section attached to the list segment with the lowest
3875 // load address. This is used when handling a PHDRS clause in a
3879 Output_segment::section_with_lowest_load_address() const
3881 Output_section
* found
= NULL
;
3882 uint64_t found_lma
= 0;
3883 this->lowest_load_address_in_list(&this->output_data_
, &found
, &found_lma
);
3885 Output_section
* found_data
= found
;
3886 this->lowest_load_address_in_list(&this->output_bss_
, &found
, &found_lma
);
3887 if (found
!= found_data
&& found_data
!= NULL
)
3889 gold_error(_("nobits section %s may not precede progbits section %s "
3891 found
->name(), found_data
->name());
3898 // Look through a list for a section with a lower load address.
3901 Output_segment::lowest_load_address_in_list(const Output_data_list
* pdl
,
3902 Output_section
** found
,
3903 uint64_t* found_lma
) const
3905 for (Output_data_list::const_iterator p
= pdl
->begin();
3909 if (!(*p
)->is_section())
3911 Output_section
* os
= static_cast<Output_section
*>(*p
);
3912 uint64_t lma
= (os
->has_load_address()
3913 ? os
->load_address()
3915 if (*found
== NULL
|| lma
< *found_lma
)
3923 // Write the segment data into *OPHDR.
3925 template<int size
, bool big_endian
>
3927 Output_segment::write_header(elfcpp::Phdr_write
<size
, big_endian
>* ophdr
)
3929 ophdr
->put_p_type(this->type_
);
3930 ophdr
->put_p_offset(this->offset_
);
3931 ophdr
->put_p_vaddr(this->vaddr_
);
3932 ophdr
->put_p_paddr(this->paddr_
);
3933 ophdr
->put_p_filesz(this->filesz_
);
3934 ophdr
->put_p_memsz(this->memsz_
);
3935 ophdr
->put_p_flags(this->flags_
);
3936 ophdr
->put_p_align(std::max(this->min_p_align_
, this->maximum_alignment()));
3939 // Write the section headers into V.
3941 template<int size
, bool big_endian
>
3943 Output_segment::write_section_headers(const Layout
* layout
,
3944 const Stringpool
* secnamepool
,
3946 unsigned int *pshndx
) const
3948 // Every section that is attached to a segment must be attached to a
3949 // PT_LOAD segment, so we only write out section headers for PT_LOAD
3951 if (this->type_
!= elfcpp::PT_LOAD
)
3954 v
= this->write_section_headers_list
<size
, big_endian
>(layout
, secnamepool
,
3955 &this->output_data_
,
3957 v
= this->write_section_headers_list
<size
, big_endian
>(layout
, secnamepool
,
3963 template<int size
, bool big_endian
>
3965 Output_segment::write_section_headers_list(const Layout
* layout
,
3966 const Stringpool
* secnamepool
,
3967 const Output_data_list
* pdl
,
3969 unsigned int* pshndx
) const
3971 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
3972 for (Output_data_list::const_iterator p
= pdl
->begin();
3976 if ((*p
)->is_section())
3978 const Output_section
* ps
= static_cast<const Output_section
*>(*p
);
3979 gold_assert(*pshndx
== ps
->out_shndx());
3980 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
3981 ps
->write_header(layout
, secnamepool
, &oshdr
);
3989 // Print the output sections to the map file.
3992 Output_segment::print_sections_to_mapfile(Mapfile
* mapfile
) const
3994 if (this->type() != elfcpp::PT_LOAD
)
3996 this->print_section_list_to_mapfile(mapfile
, &this->output_data_
);
3997 this->print_section_list_to_mapfile(mapfile
, &this->output_bss_
);
4000 // Print an output section list to the map file.
4003 Output_segment::print_section_list_to_mapfile(Mapfile
* mapfile
,
4004 const Output_data_list
* pdl
) const
4006 for (Output_data_list::const_iterator p
= pdl
->begin();
4009 (*p
)->print_to_mapfile(mapfile
);
4012 // Output_file methods.
4014 Output_file::Output_file(const char* name
)
4019 map_is_anonymous_(false),
4020 is_temporary_(false)
4024 // Try to open an existing file. Returns false if the file doesn't
4025 // exist, has a size of 0 or can't be mmapped.
4028 Output_file::open_for_modification()
4030 // The name "-" means "stdout".
4031 if (strcmp(this->name_
, "-") == 0)
4034 // Don't bother opening files with a size of zero.
4036 if (::stat(this->name_
, &s
) != 0 || s
.st_size
== 0)
4039 int o
= open_descriptor(-1, this->name_
, O_RDWR
, 0);
4041 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4043 this->file_size_
= s
.st_size
;
4045 // If the file can't be mmapped, copying the content to an anonymous
4046 // map will probably negate the performance benefits of incremental
4047 // linking. This could be helped by using views and loading only
4048 // the necessary parts, but this is not supported as of now.
4049 if (!this->map_no_anonymous())
4051 release_descriptor(o
, true);
4053 this->file_size_
= 0;
4060 // Open the output file.
4063 Output_file::open(off_t file_size
)
4065 this->file_size_
= file_size
;
4067 // Unlink the file first; otherwise the open() may fail if the file
4068 // is busy (e.g. it's an executable that's currently being executed).
4070 // However, the linker may be part of a system where a zero-length
4071 // file is created for it to write to, with tight permissions (gcc
4072 // 2.95 did something like this). Unlinking the file would work
4073 // around those permission controls, so we only unlink if the file
4074 // has a non-zero size. We also unlink only regular files to avoid
4075 // trouble with directories/etc.
4077 // If we fail, continue; this command is merely a best-effort attempt
4078 // to improve the odds for open().
4080 // We let the name "-" mean "stdout"
4081 if (!this->is_temporary_
)
4083 if (strcmp(this->name_
, "-") == 0)
4084 this->o_
= STDOUT_FILENO
;
4088 if (::stat(this->name_
, &s
) == 0
4089 && (S_ISREG (s
.st_mode
) || S_ISLNK (s
.st_mode
)))
4092 ::unlink(this->name_
);
4093 else if (!parameters
->options().relocatable())
4095 // If we don't unlink the existing file, add execute
4096 // permission where read permissions already exist
4097 // and where the umask permits.
4098 int mask
= ::umask(0);
4100 s
.st_mode
|= (s
.st_mode
& 0444) >> 2;
4101 ::chmod(this->name_
, s
.st_mode
& ~mask
);
4105 int mode
= parameters
->options().relocatable() ? 0666 : 0777;
4106 int o
= open_descriptor(-1, this->name_
, O_RDWR
| O_CREAT
| O_TRUNC
,
4109 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4117 // Resize the output file.
4120 Output_file::resize(off_t file_size
)
4122 // If the mmap is mapping an anonymous memory buffer, this is easy:
4123 // just mremap to the new size. If it's mapping to a file, we want
4124 // to unmap to flush to the file, then remap after growing the file.
4125 if (this->map_is_anonymous_
)
4127 void* base
= ::mremap(this->base_
, this->file_size_
, file_size
,
4129 if (base
== MAP_FAILED
)
4130 gold_fatal(_("%s: mremap: %s"), this->name_
, strerror(errno
));
4131 this->base_
= static_cast<unsigned char*>(base
);
4132 this->file_size_
= file_size
;
4137 this->file_size_
= file_size
;
4138 if (!this->map_no_anonymous())
4139 gold_fatal(_("%s: mmap: %s"), this->name_
, strerror(errno
));
4143 // Map an anonymous block of memory which will later be written to the
4144 // file. Return whether the map succeeded.
4147 Output_file::map_anonymous()
4149 void* base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
4150 MAP_PRIVATE
| MAP_ANONYMOUS
, -1, 0);
4151 if (base
!= MAP_FAILED
)
4153 this->map_is_anonymous_
= true;
4154 this->base_
= static_cast<unsigned char*>(base
);
4160 // Map the file into memory. Return whether the mapping succeeded.
4163 Output_file::map_no_anonymous()
4165 const int o
= this->o_
;
4167 // If the output file is not a regular file, don't try to mmap it;
4168 // instead, we'll mmap a block of memory (an anonymous buffer), and
4169 // then later write the buffer to the file.
4171 struct stat statbuf
;
4172 if (o
== STDOUT_FILENO
|| o
== STDERR_FILENO
4173 || ::fstat(o
, &statbuf
) != 0
4174 || !S_ISREG(statbuf
.st_mode
)
4175 || this->is_temporary_
)
4178 // Ensure that we have disk space available for the file. If we
4179 // don't do this, it is possible that we will call munmap, close,
4180 // and exit with dirty buffers still in the cache with no assigned
4181 // disk blocks. If the disk is out of space at that point, the
4182 // output file will wind up incomplete, but we will have already
4183 // exited. The alternative to fallocate would be to use fdatasync,
4184 // but that would be a more significant performance hit.
4185 if (::posix_fallocate(o
, 0, this->file_size_
) < 0)
4186 gold_fatal(_("%s: %s"), this->name_
, strerror(errno
));
4188 // Map the file into memory.
4189 base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
4192 // The mmap call might fail because of file system issues: the file
4193 // system might not support mmap at all, or it might not support
4194 // mmap with PROT_WRITE.
4195 if (base
== MAP_FAILED
)
4198 this->map_is_anonymous_
= false;
4199 this->base_
= static_cast<unsigned char*>(base
);
4203 // Map the file into memory.
4208 if (this->map_no_anonymous())
4211 // The mmap call might fail because of file system issues: the file
4212 // system might not support mmap at all, or it might not support
4213 // mmap with PROT_WRITE. I'm not sure which errno values we will
4214 // see in all cases, so if the mmap fails for any reason and we
4215 // don't care about file contents, try for an anonymous map.
4216 if (this->map_anonymous())
4219 gold_fatal(_("%s: mmap: failed to allocate %lu bytes for output file: %s"),
4220 this->name_
, static_cast<unsigned long>(this->file_size_
),
4224 // Unmap the file from memory.
4227 Output_file::unmap()
4229 if (::munmap(this->base_
, this->file_size_
) < 0)
4230 gold_error(_("%s: munmap: %s"), this->name_
, strerror(errno
));
4234 // Close the output file.
4237 Output_file::close()
4239 // If the map isn't file-backed, we need to write it now.
4240 if (this->map_is_anonymous_
&& !this->is_temporary_
)
4242 size_t bytes_to_write
= this->file_size_
;
4244 while (bytes_to_write
> 0)
4246 ssize_t bytes_written
= ::write(this->o_
, this->base_
+ offset
,
4248 if (bytes_written
== 0)
4249 gold_error(_("%s: write: unexpected 0 return-value"), this->name_
);
4250 else if (bytes_written
< 0)
4251 gold_error(_("%s: write: %s"), this->name_
, strerror(errno
));
4254 bytes_to_write
-= bytes_written
;
4255 offset
+= bytes_written
;
4261 // We don't close stdout or stderr
4262 if (this->o_
!= STDOUT_FILENO
4263 && this->o_
!= STDERR_FILENO
4264 && !this->is_temporary_
)
4265 if (::close(this->o_
) < 0)
4266 gold_error(_("%s: close: %s"), this->name_
, strerror(errno
));
4270 // Instantiate the templates we need. We could use the configure
4271 // script to restrict this to only the ones for implemented targets.
4273 #ifdef HAVE_TARGET_32_LITTLE
4276 Output_section::add_input_section
<32, false>(
4277 Sized_relobj
<32, false>* object
,
4279 const char* secname
,
4280 const elfcpp::Shdr
<32, false>& shdr
,
4281 unsigned int reloc_shndx
,
4282 bool have_sections_script
);
4285 #ifdef HAVE_TARGET_32_BIG
4288 Output_section::add_input_section
<32, true>(
4289 Sized_relobj
<32, true>* object
,
4291 const char* secname
,
4292 const elfcpp::Shdr
<32, true>& shdr
,
4293 unsigned int reloc_shndx
,
4294 bool have_sections_script
);
4297 #ifdef HAVE_TARGET_64_LITTLE
4300 Output_section::add_input_section
<64, false>(
4301 Sized_relobj
<64, false>* object
,
4303 const char* secname
,
4304 const elfcpp::Shdr
<64, false>& shdr
,
4305 unsigned int reloc_shndx
,
4306 bool have_sections_script
);
4309 #ifdef HAVE_TARGET_64_BIG
4312 Output_section::add_input_section
<64, true>(
4313 Sized_relobj
<64, true>* object
,
4315 const char* secname
,
4316 const elfcpp::Shdr
<64, true>& shdr
,
4317 unsigned int reloc_shndx
,
4318 bool have_sections_script
);
4321 #ifdef HAVE_TARGET_32_LITTLE
4323 class Output_reloc
<elfcpp::SHT_REL
, false, 32, false>;
4326 #ifdef HAVE_TARGET_32_BIG
4328 class Output_reloc
<elfcpp::SHT_REL
, false, 32, true>;
4331 #ifdef HAVE_TARGET_64_LITTLE
4333 class Output_reloc
<elfcpp::SHT_REL
, false, 64, false>;
4336 #ifdef HAVE_TARGET_64_BIG
4338 class Output_reloc
<elfcpp::SHT_REL
, false, 64, true>;
4341 #ifdef HAVE_TARGET_32_LITTLE
4343 class Output_reloc
<elfcpp::SHT_REL
, true, 32, false>;
4346 #ifdef HAVE_TARGET_32_BIG
4348 class Output_reloc
<elfcpp::SHT_REL
, true, 32, true>;
4351 #ifdef HAVE_TARGET_64_LITTLE
4353 class Output_reloc
<elfcpp::SHT_REL
, true, 64, false>;
4356 #ifdef HAVE_TARGET_64_BIG
4358 class Output_reloc
<elfcpp::SHT_REL
, true, 64, true>;
4361 #ifdef HAVE_TARGET_32_LITTLE
4363 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
4366 #ifdef HAVE_TARGET_32_BIG
4368 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
4371 #ifdef HAVE_TARGET_64_LITTLE
4373 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
4376 #ifdef HAVE_TARGET_64_BIG
4378 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
4381 #ifdef HAVE_TARGET_32_LITTLE
4383 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
4386 #ifdef HAVE_TARGET_32_BIG
4388 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
4391 #ifdef HAVE_TARGET_64_LITTLE
4393 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
4396 #ifdef HAVE_TARGET_64_BIG
4398 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
4401 #ifdef HAVE_TARGET_32_LITTLE
4403 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, false>;
4406 #ifdef HAVE_TARGET_32_BIG
4408 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, true>;
4411 #ifdef HAVE_TARGET_64_LITTLE
4413 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, false>;
4416 #ifdef HAVE_TARGET_64_BIG
4418 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, true>;
4421 #ifdef HAVE_TARGET_32_LITTLE
4423 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, false>;
4426 #ifdef HAVE_TARGET_32_BIG
4428 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, true>;
4431 #ifdef HAVE_TARGET_64_LITTLE
4433 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, false>;
4436 #ifdef HAVE_TARGET_64_BIG
4438 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, true>;
4441 #ifdef HAVE_TARGET_32_LITTLE
4443 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
4446 #ifdef HAVE_TARGET_32_BIG
4448 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
4451 #ifdef HAVE_TARGET_64_LITTLE
4453 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
4456 #ifdef HAVE_TARGET_64_BIG
4458 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
4461 #ifdef HAVE_TARGET_32_LITTLE
4463 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
4466 #ifdef HAVE_TARGET_32_BIG
4468 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
4471 #ifdef HAVE_TARGET_64_LITTLE
4473 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
4476 #ifdef HAVE_TARGET_64_BIG
4478 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
4481 #ifdef HAVE_TARGET_32_LITTLE
4483 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, false>;
4486 #ifdef HAVE_TARGET_32_BIG
4488 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, true>;
4491 #ifdef HAVE_TARGET_64_LITTLE
4493 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, false>;
4496 #ifdef HAVE_TARGET_64_BIG
4498 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, true>;
4501 #ifdef HAVE_TARGET_32_LITTLE
4503 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, false>;
4506 #ifdef HAVE_TARGET_32_BIG
4508 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, true>;
4511 #ifdef HAVE_TARGET_64_LITTLE
4513 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, false>;
4516 #ifdef HAVE_TARGET_64_BIG
4518 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, true>;
4521 #ifdef HAVE_TARGET_32_LITTLE
4523 class Output_data_group
<32, false>;
4526 #ifdef HAVE_TARGET_32_BIG
4528 class Output_data_group
<32, true>;
4531 #ifdef HAVE_TARGET_64_LITTLE
4533 class Output_data_group
<64, false>;
4536 #ifdef HAVE_TARGET_64_BIG
4538 class Output_data_group
<64, true>;
4541 #ifdef HAVE_TARGET_32_LITTLE
4543 class Output_data_got
<32, false>;
4546 #ifdef HAVE_TARGET_32_BIG
4548 class Output_data_got
<32, true>;
4551 #ifdef HAVE_TARGET_64_LITTLE
4553 class Output_data_got
<64, false>;
4556 #ifdef HAVE_TARGET_64_BIG
4558 class Output_data_got
<64, true>;
4561 } // End namespace gold.