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 size_t segment_count
= this->segment_list_
->size();
217 oshdr
.put_sh_info(segment_count
>= elfcpp::PN_XNUM
? segment_count
: 0);
219 oshdr
.put_sh_addralign(0);
220 oshdr
.put_sh_entsize(0);
225 unsigned int shndx
= 1;
226 if (!parameters
->options().relocatable())
228 for (Layout::Segment_list::const_iterator p
=
229 this->segment_list_
->begin();
230 p
!= this->segment_list_
->end();
232 v
= (*p
)->write_section_headers
<size
, big_endian
>(this->layout_
,
239 for (Layout::Section_list::const_iterator p
=
240 this->section_list_
->begin();
241 p
!= this->section_list_
->end();
244 // We do unallocated sections below, except that group
245 // sections have to come first.
246 if (((*p
)->flags() & elfcpp::SHF_ALLOC
) == 0
247 && (*p
)->type() != elfcpp::SHT_GROUP
)
249 gold_assert(shndx
== (*p
)->out_shndx());
250 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
251 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
257 for (Layout::Section_list::const_iterator p
=
258 this->unattached_section_list_
->begin();
259 p
!= this->unattached_section_list_
->end();
262 // For a relocatable link, we did unallocated group sections
263 // above, since they have to come first.
264 if ((*p
)->type() == elfcpp::SHT_GROUP
265 && parameters
->options().relocatable())
267 gold_assert(shndx
== (*p
)->out_shndx());
268 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
269 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
274 of
->write_output_view(this->offset(), all_shdrs_size
, view
);
277 // Output_segment_header methods.
279 Output_segment_headers::Output_segment_headers(
280 const Layout::Segment_list
& segment_list
)
281 : segment_list_(segment_list
)
286 Output_segment_headers::do_write(Output_file
* of
)
288 switch (parameters
->size_and_endianness())
290 #ifdef HAVE_TARGET_32_LITTLE
291 case Parameters::TARGET_32_LITTLE
:
292 this->do_sized_write
<32, false>(of
);
295 #ifdef HAVE_TARGET_32_BIG
296 case Parameters::TARGET_32_BIG
:
297 this->do_sized_write
<32, true>(of
);
300 #ifdef HAVE_TARGET_64_LITTLE
301 case Parameters::TARGET_64_LITTLE
:
302 this->do_sized_write
<64, false>(of
);
305 #ifdef HAVE_TARGET_64_BIG
306 case Parameters::TARGET_64_BIG
:
307 this->do_sized_write
<64, true>(of
);
315 template<int size
, bool big_endian
>
317 Output_segment_headers::do_sized_write(Output_file
* of
)
319 const int phdr_size
= elfcpp::Elf_sizes
<size
>::phdr_size
;
320 off_t all_phdrs_size
= this->segment_list_
.size() * phdr_size
;
321 gold_assert(all_phdrs_size
== this->data_size());
322 unsigned char* view
= of
->get_output_view(this->offset(),
324 unsigned char* v
= view
;
325 for (Layout::Segment_list::const_iterator p
= this->segment_list_
.begin();
326 p
!= this->segment_list_
.end();
329 elfcpp::Phdr_write
<size
, big_endian
> ophdr(v
);
330 (*p
)->write_header(&ophdr
);
334 gold_assert(v
- view
== all_phdrs_size
);
336 of
->write_output_view(this->offset(), all_phdrs_size
, view
);
340 Output_segment_headers::do_size() const
342 const int size
= parameters
->target().get_size();
345 phdr_size
= elfcpp::Elf_sizes
<32>::phdr_size
;
347 phdr_size
= elfcpp::Elf_sizes
<64>::phdr_size
;
351 return this->segment_list_
.size() * phdr_size
;
354 // Output_file_header methods.
356 Output_file_header::Output_file_header(const Target
* target
,
357 const Symbol_table
* symtab
,
358 const Output_segment_headers
* osh
,
362 segment_header_(osh
),
363 section_header_(NULL
),
367 this->set_data_size(this->do_size());
370 // Set the section table information for a file header.
373 Output_file_header::set_section_info(const Output_section_headers
* shdrs
,
374 const Output_section
* shstrtab
)
376 this->section_header_
= shdrs
;
377 this->shstrtab_
= shstrtab
;
380 // Write out the file header.
383 Output_file_header::do_write(Output_file
* of
)
385 gold_assert(this->offset() == 0);
387 switch (parameters
->size_and_endianness())
389 #ifdef HAVE_TARGET_32_LITTLE
390 case Parameters::TARGET_32_LITTLE
:
391 this->do_sized_write
<32, false>(of
);
394 #ifdef HAVE_TARGET_32_BIG
395 case Parameters::TARGET_32_BIG
:
396 this->do_sized_write
<32, true>(of
);
399 #ifdef HAVE_TARGET_64_LITTLE
400 case Parameters::TARGET_64_LITTLE
:
401 this->do_sized_write
<64, false>(of
);
404 #ifdef HAVE_TARGET_64_BIG
405 case Parameters::TARGET_64_BIG
:
406 this->do_sized_write
<64, true>(of
);
414 // Write out the file header with appropriate size and endianess.
416 template<int size
, bool big_endian
>
418 Output_file_header::do_sized_write(Output_file
* of
)
420 gold_assert(this->offset() == 0);
422 int ehdr_size
= elfcpp::Elf_sizes
<size
>::ehdr_size
;
423 unsigned char* view
= of
->get_output_view(0, ehdr_size
);
424 elfcpp::Ehdr_write
<size
, big_endian
> oehdr(view
);
426 unsigned char e_ident
[elfcpp::EI_NIDENT
];
427 memset(e_ident
, 0, elfcpp::EI_NIDENT
);
428 e_ident
[elfcpp::EI_MAG0
] = elfcpp::ELFMAG0
;
429 e_ident
[elfcpp::EI_MAG1
] = elfcpp::ELFMAG1
;
430 e_ident
[elfcpp::EI_MAG2
] = elfcpp::ELFMAG2
;
431 e_ident
[elfcpp::EI_MAG3
] = elfcpp::ELFMAG3
;
433 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS32
;
435 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS64
;
438 e_ident
[elfcpp::EI_DATA
] = (big_endian
439 ? elfcpp::ELFDATA2MSB
440 : elfcpp::ELFDATA2LSB
);
441 e_ident
[elfcpp::EI_VERSION
] = elfcpp::EV_CURRENT
;
442 oehdr
.put_e_ident(e_ident
);
445 if (parameters
->options().relocatable())
446 e_type
= elfcpp::ET_REL
;
447 else if (parameters
->options().output_is_position_independent())
448 e_type
= elfcpp::ET_DYN
;
450 e_type
= elfcpp::ET_EXEC
;
451 oehdr
.put_e_type(e_type
);
453 oehdr
.put_e_machine(this->target_
->machine_code());
454 oehdr
.put_e_version(elfcpp::EV_CURRENT
);
456 oehdr
.put_e_entry(this->entry
<size
>());
458 if (this->segment_header_
== NULL
)
459 oehdr
.put_e_phoff(0);
461 oehdr
.put_e_phoff(this->segment_header_
->offset());
463 oehdr
.put_e_shoff(this->section_header_
->offset());
464 oehdr
.put_e_flags(this->target_
->processor_specific_flags());
465 oehdr
.put_e_ehsize(elfcpp::Elf_sizes
<size
>::ehdr_size
);
467 if (this->segment_header_
== NULL
)
469 oehdr
.put_e_phentsize(0);
470 oehdr
.put_e_phnum(0);
474 oehdr
.put_e_phentsize(elfcpp::Elf_sizes
<size
>::phdr_size
);
475 size_t phnum
= (this->segment_header_
->data_size()
476 / elfcpp::Elf_sizes
<size
>::phdr_size
);
477 if (phnum
> elfcpp::PN_XNUM
)
478 phnum
= elfcpp::PN_XNUM
;
479 oehdr
.put_e_phnum(phnum
);
482 oehdr
.put_e_shentsize(elfcpp::Elf_sizes
<size
>::shdr_size
);
483 size_t section_count
= (this->section_header_
->data_size()
484 / elfcpp::Elf_sizes
<size
>::shdr_size
);
486 if (section_count
< elfcpp::SHN_LORESERVE
)
487 oehdr
.put_e_shnum(this->section_header_
->data_size()
488 / elfcpp::Elf_sizes
<size
>::shdr_size
);
490 oehdr
.put_e_shnum(0);
492 unsigned int shstrndx
= this->shstrtab_
->out_shndx();
493 if (shstrndx
< elfcpp::SHN_LORESERVE
)
494 oehdr
.put_e_shstrndx(this->shstrtab_
->out_shndx());
496 oehdr
.put_e_shstrndx(elfcpp::SHN_XINDEX
);
498 // Let the target adjust the ELF header, e.g., to set EI_OSABI in
499 // the e_ident field.
500 parameters
->target().adjust_elf_header(view
, ehdr_size
);
502 of
->write_output_view(0, ehdr_size
, view
);
505 // Return the value to use for the entry address. THIS->ENTRY_ is the
506 // symbol specified on the command line, if any.
509 typename
elfcpp::Elf_types
<size
>::Elf_Addr
510 Output_file_header::entry()
512 const bool should_issue_warning
= (this->entry_
!= NULL
513 && !parameters
->options().relocatable()
514 && !parameters
->options().shared());
516 // FIXME: Need to support target specific entry symbol.
517 const char* entry
= this->entry_
;
521 Symbol
* sym
= this->symtab_
->lookup(entry
);
523 typename Sized_symbol
<size
>::Value_type v
;
526 Sized_symbol
<size
>* ssym
;
527 ssym
= this->symtab_
->get_sized_symbol
<size
>(sym
);
528 if (!ssym
->is_defined() && should_issue_warning
)
529 gold_warning("entry symbol '%s' exists but is not defined", entry
);
534 // We couldn't find the entry symbol. See if we can parse it as
535 // a number. This supports, e.g., -e 0x1000.
537 v
= strtoull(entry
, &endptr
, 0);
540 if (should_issue_warning
)
541 gold_warning("cannot find entry symbol '%s'", entry
);
549 // Compute the current data size.
552 Output_file_header::do_size() const
554 const int size
= parameters
->target().get_size();
556 return elfcpp::Elf_sizes
<32>::ehdr_size
;
558 return elfcpp::Elf_sizes
<64>::ehdr_size
;
563 // Output_data_const methods.
566 Output_data_const::do_write(Output_file
* of
)
568 of
->write(this->offset(), this->data_
.data(), this->data_
.size());
571 // Output_data_const_buffer methods.
574 Output_data_const_buffer::do_write(Output_file
* of
)
576 of
->write(this->offset(), this->p_
, this->data_size());
579 // Output_section_data methods.
581 // Record the output section, and set the entry size and such.
584 Output_section_data::set_output_section(Output_section
* os
)
586 gold_assert(this->output_section_
== NULL
);
587 this->output_section_
= os
;
588 this->do_adjust_output_section(os
);
591 // Return the section index of the output section.
594 Output_section_data::do_out_shndx() const
596 gold_assert(this->output_section_
!= NULL
);
597 return this->output_section_
->out_shndx();
600 // Set the alignment, which means we may need to update the alignment
601 // of the output section.
604 Output_section_data::set_addralign(uint64_t addralign
)
606 this->addralign_
= addralign
;
607 if (this->output_section_
!= NULL
608 && this->output_section_
->addralign() < addralign
)
609 this->output_section_
->set_addralign(addralign
);
612 // Output_data_strtab methods.
614 // Set the final data size.
617 Output_data_strtab::set_final_data_size()
619 this->strtab_
->set_string_offsets();
620 this->set_data_size(this->strtab_
->get_strtab_size());
623 // Write out a string table.
626 Output_data_strtab::do_write(Output_file
* of
)
628 this->strtab_
->write(of
, this->offset());
631 // Output_reloc methods.
633 // A reloc against a global symbol.
635 template<bool dynamic
, int size
, bool big_endian
>
636 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
643 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
644 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
645 is_section_symbol_(false), shndx_(INVALID_CODE
)
647 // this->type_ is a bitfield; make sure TYPE fits.
648 gold_assert(this->type_
== type
);
649 this->u1_
.gsym
= gsym
;
652 this->set_needs_dynsym_index();
655 template<bool dynamic
, int size
, bool big_endian
>
656 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
659 Sized_relobj
<size
, big_endian
>* relobj
,
664 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
665 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
666 is_section_symbol_(false), shndx_(shndx
)
668 gold_assert(shndx
!= INVALID_CODE
);
669 // this->type_ is a bitfield; make sure TYPE fits.
670 gold_assert(this->type_
== type
);
671 this->u1_
.gsym
= gsym
;
672 this->u2_
.relobj
= relobj
;
674 this->set_needs_dynsym_index();
677 // A reloc against a local symbol.
679 template<bool dynamic
, int size
, bool big_endian
>
680 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
681 Sized_relobj
<size
, big_endian
>* relobj
,
682 unsigned int local_sym_index
,
688 bool is_section_symbol
)
689 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
690 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
691 is_section_symbol_(is_section_symbol
), shndx_(INVALID_CODE
)
693 gold_assert(local_sym_index
!= GSYM_CODE
694 && local_sym_index
!= INVALID_CODE
);
695 // this->type_ is a bitfield; make sure TYPE fits.
696 gold_assert(this->type_
== type
);
697 this->u1_
.relobj
= relobj
;
700 this->set_needs_dynsym_index();
703 template<bool dynamic
, int size
, bool big_endian
>
704 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
705 Sized_relobj
<size
, big_endian
>* relobj
,
706 unsigned int local_sym_index
,
712 bool is_section_symbol
)
713 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
714 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
715 is_section_symbol_(is_section_symbol
), shndx_(shndx
)
717 gold_assert(local_sym_index
!= GSYM_CODE
718 && local_sym_index
!= INVALID_CODE
);
719 gold_assert(shndx
!= INVALID_CODE
);
720 // this->type_ is a bitfield; make sure TYPE fits.
721 gold_assert(this->type_
== type
);
722 this->u1_
.relobj
= relobj
;
723 this->u2_
.relobj
= relobj
;
725 this->set_needs_dynsym_index();
728 // A reloc against the STT_SECTION symbol of an output section.
730 template<bool dynamic
, int size
, bool big_endian
>
731 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
736 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
737 is_relative_(false), is_symbolless_(false),
738 is_section_symbol_(true), shndx_(INVALID_CODE
)
740 // this->type_ is a bitfield; make sure TYPE fits.
741 gold_assert(this->type_
== type
);
745 this->set_needs_dynsym_index();
747 os
->set_needs_symtab_index();
750 template<bool dynamic
, int size
, bool big_endian
>
751 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
754 Sized_relobj
<size
, big_endian
>* relobj
,
757 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
758 is_relative_(false), is_symbolless_(false),
759 is_section_symbol_(true), shndx_(shndx
)
761 gold_assert(shndx
!= INVALID_CODE
);
762 // this->type_ is a bitfield; make sure TYPE fits.
763 gold_assert(this->type_
== type
);
765 this->u2_
.relobj
= relobj
;
767 this->set_needs_dynsym_index();
769 os
->set_needs_symtab_index();
772 // An absolute relocation.
774 template<bool dynamic
, int size
, bool big_endian
>
775 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
779 : address_(address
), local_sym_index_(0), type_(type
),
780 is_relative_(false), is_symbolless_(false),
781 is_section_symbol_(false), shndx_(INVALID_CODE
)
783 // this->type_ is a bitfield; make sure TYPE fits.
784 gold_assert(this->type_
== type
);
785 this->u1_
.relobj
= NULL
;
789 template<bool dynamic
, int size
, bool big_endian
>
790 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
792 Sized_relobj
<size
, big_endian
>* relobj
,
795 : address_(address
), local_sym_index_(0), type_(type
),
796 is_relative_(false), is_symbolless_(false),
797 is_section_symbol_(false), shndx_(shndx
)
799 gold_assert(shndx
!= INVALID_CODE
);
800 // this->type_ is a bitfield; make sure TYPE fits.
801 gold_assert(this->type_
== type
);
802 this->u1_
.relobj
= NULL
;
803 this->u2_
.relobj
= relobj
;
806 // A target specific relocation.
808 template<bool dynamic
, int size
, bool big_endian
>
809 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
814 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
815 is_relative_(false), is_symbolless_(false),
816 is_section_symbol_(false), shndx_(INVALID_CODE
)
818 // this->type_ is a bitfield; make sure TYPE fits.
819 gold_assert(this->type_
== type
);
824 template<bool dynamic
, int size
, bool big_endian
>
825 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
828 Sized_relobj
<size
, big_endian
>* relobj
,
831 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
832 is_relative_(false), is_symbolless_(false),
833 is_section_symbol_(false), shndx_(shndx
)
835 gold_assert(shndx
!= INVALID_CODE
);
836 // this->type_ is a bitfield; make sure TYPE fits.
837 gold_assert(this->type_
== type
);
839 this->u2_
.relobj
= relobj
;
842 // Record that we need a dynamic symbol index for this relocation.
844 template<bool dynamic
, int size
, bool big_endian
>
846 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
847 set_needs_dynsym_index()
849 if (this->is_symbolless_
)
851 switch (this->local_sym_index_
)
857 this->u1_
.gsym
->set_needs_dynsym_entry();
861 this->u1_
.os
->set_needs_dynsym_index();
865 // The target must take care of this if necessary.
873 const unsigned int lsi
= this->local_sym_index_
;
874 if (!this->is_section_symbol_
)
875 this->u1_
.relobj
->set_needs_output_dynsym_entry(lsi
);
877 this->u1_
.relobj
->output_section(lsi
)->set_needs_dynsym_index();
883 // Get the symbol index of a relocation.
885 template<bool dynamic
, int size
, bool big_endian
>
887 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_symbol_index()
891 if (this->is_symbolless_
)
893 switch (this->local_sym_index_
)
899 if (this->u1_
.gsym
== NULL
)
902 index
= this->u1_
.gsym
->dynsym_index();
904 index
= this->u1_
.gsym
->symtab_index();
909 index
= this->u1_
.os
->dynsym_index();
911 index
= this->u1_
.os
->symtab_index();
915 index
= parameters
->target().reloc_symbol_index(this->u1_
.arg
,
920 // Relocations without symbols use a symbol index of 0.
926 const unsigned int lsi
= this->local_sym_index_
;
927 if (!this->is_section_symbol_
)
930 index
= this->u1_
.relobj
->dynsym_index(lsi
);
932 index
= this->u1_
.relobj
->symtab_index(lsi
);
936 Output_section
* os
= this->u1_
.relobj
->output_section(lsi
);
937 gold_assert(os
!= NULL
);
939 index
= os
->dynsym_index();
941 index
= os
->symtab_index();
946 gold_assert(index
!= -1U);
950 // For a local section symbol, get the address of the offset ADDEND
951 // within the input section.
953 template<bool dynamic
, int size
, bool big_endian
>
954 typename
elfcpp::Elf_types
<size
>::Elf_Addr
955 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
956 local_section_offset(Addend addend
) const
958 gold_assert(this->local_sym_index_
!= GSYM_CODE
959 && this->local_sym_index_
!= SECTION_CODE
960 && this->local_sym_index_
!= TARGET_CODE
961 && this->local_sym_index_
!= INVALID_CODE
962 && this->local_sym_index_
!= 0
963 && this->is_section_symbol_
);
964 const unsigned int lsi
= this->local_sym_index_
;
965 Output_section
* os
= this->u1_
.relobj
->output_section(lsi
);
966 gold_assert(os
!= NULL
);
967 Address offset
= this->u1_
.relobj
->get_output_section_offset(lsi
);
968 if (offset
!= invalid_address
)
969 return offset
+ addend
;
970 // This is a merge section.
971 offset
= os
->output_address(this->u1_
.relobj
, lsi
, addend
);
972 gold_assert(offset
!= invalid_address
);
976 // Get the output address of a relocation.
978 template<bool dynamic
, int size
, bool big_endian
>
979 typename
elfcpp::Elf_types
<size
>::Elf_Addr
980 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_address() const
982 Address address
= this->address_
;
983 if (this->shndx_
!= INVALID_CODE
)
985 Output_section
* os
= this->u2_
.relobj
->output_section(this->shndx_
);
986 gold_assert(os
!= NULL
);
987 Address off
= this->u2_
.relobj
->get_output_section_offset(this->shndx_
);
988 if (off
!= invalid_address
)
989 address
+= os
->address() + off
;
992 address
= os
->output_address(this->u2_
.relobj
, this->shndx_
,
994 gold_assert(address
!= invalid_address
);
997 else if (this->u2_
.od
!= NULL
)
998 address
+= this->u2_
.od
->address();
1002 // Write out the offset and info fields of a Rel or Rela relocation
1005 template<bool dynamic
, int size
, bool big_endian
>
1006 template<typename Write_rel
>
1008 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write_rel(
1009 Write_rel
* wr
) const
1011 wr
->put_r_offset(this->get_address());
1012 unsigned int sym_index
= this->get_symbol_index();
1013 wr
->put_r_info(elfcpp::elf_r_info
<size
>(sym_index
, this->type_
));
1016 // Write out a Rel relocation.
1018 template<bool dynamic
, int size
, bool big_endian
>
1020 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write(
1021 unsigned char* pov
) const
1023 elfcpp::Rel_write
<size
, big_endian
> orel(pov
);
1024 this->write_rel(&orel
);
1027 // Get the value of the symbol referred to by a Rel relocation.
1029 template<bool dynamic
, int size
, bool big_endian
>
1030 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1031 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::symbol_value(
1032 Addend addend
) const
1034 if (this->local_sym_index_
== GSYM_CODE
)
1036 const Sized_symbol
<size
>* sym
;
1037 sym
= static_cast<const Sized_symbol
<size
>*>(this->u1_
.gsym
);
1038 return sym
->value() + addend
;
1040 gold_assert(this->local_sym_index_
!= SECTION_CODE
1041 && this->local_sym_index_
!= TARGET_CODE
1042 && this->local_sym_index_
!= INVALID_CODE
1043 && this->local_sym_index_
!= 0
1044 && !this->is_section_symbol_
);
1045 const unsigned int lsi
= this->local_sym_index_
;
1046 const Symbol_value
<size
>* symval
= this->u1_
.relobj
->local_symbol(lsi
);
1047 return symval
->value(this->u1_
.relobj
, addend
);
1050 // Reloc comparison. This function sorts the dynamic relocs for the
1051 // benefit of the dynamic linker. First we sort all relative relocs
1052 // to the front. Among relative relocs, we sort by output address.
1053 // Among non-relative relocs, we sort by symbol index, then by output
1056 template<bool dynamic
, int size
, bool big_endian
>
1058 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
1059 compare(const Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>& r2
)
1062 if (this->is_relative_
)
1064 if (!r2
.is_relative_
)
1066 // Otherwise sort by reloc address below.
1068 else if (r2
.is_relative_
)
1072 unsigned int sym1
= this->get_symbol_index();
1073 unsigned int sym2
= r2
.get_symbol_index();
1076 else if (sym1
> sym2
)
1078 // Otherwise sort by reloc address.
1081 section_offset_type addr1
= this->get_address();
1082 section_offset_type addr2
= r2
.get_address();
1085 else if (addr1
> addr2
)
1088 // Final tie breaker, in order to generate the same output on any
1089 // host: reloc type.
1090 unsigned int type1
= this->type_
;
1091 unsigned int type2
= r2
.type_
;
1094 else if (type1
> type2
)
1097 // These relocs appear to be exactly the same.
1101 // Write out a Rela relocation.
1103 template<bool dynamic
, int size
, bool big_endian
>
1105 Output_reloc
<elfcpp::SHT_RELA
, dynamic
, size
, big_endian
>::write(
1106 unsigned char* pov
) const
1108 elfcpp::Rela_write
<size
, big_endian
> orel(pov
);
1109 this->rel_
.write_rel(&orel
);
1110 Addend addend
= this->addend_
;
1111 if (this->rel_
.is_target_specific())
1112 addend
= parameters
->target().reloc_addend(this->rel_
.target_arg(),
1113 this->rel_
.type(), addend
);
1114 else if (this->rel_
.is_symbolless())
1115 addend
= this->rel_
.symbol_value(addend
);
1116 else if (this->rel_
.is_local_section_symbol())
1117 addend
= this->rel_
.local_section_offset(addend
);
1118 orel
.put_r_addend(addend
);
1121 // Output_data_reloc_base methods.
1123 // Adjust the output section.
1125 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1127 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>
1128 ::do_adjust_output_section(Output_section
* os
)
1130 if (sh_type
== elfcpp::SHT_REL
)
1131 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rel_size
);
1132 else if (sh_type
== elfcpp::SHT_RELA
)
1133 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rela_size
);
1137 os
->set_should_link_to_dynsym();
1139 os
->set_should_link_to_symtab();
1142 // Write out relocation data.
1144 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1146 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>::do_write(
1149 const off_t off
= this->offset();
1150 const off_t oview_size
= this->data_size();
1151 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1153 if (this->sort_relocs())
1155 gold_assert(dynamic
);
1156 std::sort(this->relocs_
.begin(), this->relocs_
.end(),
1157 Sort_relocs_comparison());
1160 unsigned char* pov
= oview
;
1161 for (typename
Relocs::const_iterator p
= this->relocs_
.begin();
1162 p
!= this->relocs_
.end();
1169 gold_assert(pov
- oview
== oview_size
);
1171 of
->write_output_view(off
, oview_size
, oview
);
1173 // We no longer need the relocation entries.
1174 this->relocs_
.clear();
1177 // Class Output_relocatable_relocs.
1179 template<int sh_type
, int size
, bool big_endian
>
1181 Output_relocatable_relocs
<sh_type
, size
, big_endian
>::set_final_data_size()
1183 this->set_data_size(this->rr_
->output_reloc_count()
1184 * Reloc_types
<sh_type
, size
, big_endian
>::reloc_size
);
1187 // class Output_data_group.
1189 template<int size
, bool big_endian
>
1190 Output_data_group
<size
, big_endian
>::Output_data_group(
1191 Sized_relobj
<size
, big_endian
>* relobj
,
1192 section_size_type entry_count
,
1193 elfcpp::Elf_Word flags
,
1194 std::vector
<unsigned int>* input_shndxes
)
1195 : Output_section_data(entry_count
* 4, 4, false),
1199 this->input_shndxes_
.swap(*input_shndxes
);
1202 // Write out the section group, which means translating the section
1203 // indexes to apply to the output file.
1205 template<int size
, bool big_endian
>
1207 Output_data_group
<size
, big_endian
>::do_write(Output_file
* of
)
1209 const off_t off
= this->offset();
1210 const section_size_type oview_size
=
1211 convert_to_section_size_type(this->data_size());
1212 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1214 elfcpp::Elf_Word
* contents
= reinterpret_cast<elfcpp::Elf_Word
*>(oview
);
1215 elfcpp::Swap
<32, big_endian
>::writeval(contents
, this->flags_
);
1218 for (std::vector
<unsigned int>::const_iterator p
=
1219 this->input_shndxes_
.begin();
1220 p
!= this->input_shndxes_
.end();
1223 Output_section
* os
= this->relobj_
->output_section(*p
);
1225 unsigned int output_shndx
;
1227 output_shndx
= os
->out_shndx();
1230 this->relobj_
->error(_("section group retained but "
1231 "group element discarded"));
1235 elfcpp::Swap
<32, big_endian
>::writeval(contents
, output_shndx
);
1238 size_t wrote
= reinterpret_cast<unsigned char*>(contents
) - oview
;
1239 gold_assert(wrote
== oview_size
);
1241 of
->write_output_view(off
, oview_size
, oview
);
1243 // We no longer need this information.
1244 this->input_shndxes_
.clear();
1247 // Output_data_got::Got_entry methods.
1249 // Write out the entry.
1251 template<int size
, bool big_endian
>
1253 Output_data_got
<size
, big_endian
>::Got_entry::write(unsigned char* pov
) const
1257 switch (this->local_sym_index_
)
1261 // If the symbol is resolved locally, we need to write out the
1262 // link-time value, which will be relocated dynamically by a
1263 // RELATIVE relocation.
1264 Symbol
* gsym
= this->u_
.gsym
;
1265 Sized_symbol
<size
>* sgsym
;
1266 // This cast is a bit ugly. We don't want to put a
1267 // virtual method in Symbol, because we want Symbol to be
1268 // as small as possible.
1269 sgsym
= static_cast<Sized_symbol
<size
>*>(gsym
);
1270 val
= sgsym
->value();
1275 val
= this->u_
.constant
;
1280 const unsigned int lsi
= this->local_sym_index_
;
1281 const Symbol_value
<size
>* symval
= this->u_
.object
->local_symbol(lsi
);
1282 val
= symval
->value(this->u_
.object
, 0);
1287 elfcpp::Swap
<size
, big_endian
>::writeval(pov
, val
);
1290 // Output_data_got methods.
1292 // Add an entry for a global symbol to the GOT. This returns true if
1293 // this is a new GOT entry, false if the symbol already had a GOT
1296 template<int size
, bool big_endian
>
1298 Output_data_got
<size
, big_endian
>::add_global(
1300 unsigned int got_type
)
1302 if (gsym
->has_got_offset(got_type
))
1305 this->entries_
.push_back(Got_entry(gsym
));
1306 this->set_got_size();
1307 gsym
->set_got_offset(got_type
, this->last_got_offset());
1311 // Add an entry for a global symbol to the GOT, and add a dynamic
1312 // relocation of type R_TYPE for the GOT entry.
1313 template<int size
, bool big_endian
>
1315 Output_data_got
<size
, big_endian
>::add_global_with_rel(
1317 unsigned int got_type
,
1319 unsigned int r_type
)
1321 if (gsym
->has_got_offset(got_type
))
1324 this->entries_
.push_back(Got_entry());
1325 this->set_got_size();
1326 unsigned int got_offset
= this->last_got_offset();
1327 gsym
->set_got_offset(got_type
, got_offset
);
1328 rel_dyn
->add_global(gsym
, r_type
, this, got_offset
);
1331 template<int size
, bool big_endian
>
1333 Output_data_got
<size
, big_endian
>::add_global_with_rela(
1335 unsigned int got_type
,
1337 unsigned int r_type
)
1339 if (gsym
->has_got_offset(got_type
))
1342 this->entries_
.push_back(Got_entry());
1343 this->set_got_size();
1344 unsigned int got_offset
= this->last_got_offset();
1345 gsym
->set_got_offset(got_type
, got_offset
);
1346 rela_dyn
->add_global(gsym
, r_type
, this, got_offset
, 0);
1349 // Add a pair of entries for a global symbol to the GOT, and add
1350 // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively.
1351 // If R_TYPE_2 == 0, add the second entry with no relocation.
1352 template<int size
, bool big_endian
>
1354 Output_data_got
<size
, big_endian
>::add_global_pair_with_rel(
1356 unsigned int got_type
,
1358 unsigned int r_type_1
,
1359 unsigned int r_type_2
)
1361 if (gsym
->has_got_offset(got_type
))
1364 this->entries_
.push_back(Got_entry());
1365 unsigned int got_offset
= this->last_got_offset();
1366 gsym
->set_got_offset(got_type
, got_offset
);
1367 rel_dyn
->add_global(gsym
, r_type_1
, this, got_offset
);
1369 this->entries_
.push_back(Got_entry());
1372 got_offset
= this->last_got_offset();
1373 rel_dyn
->add_global(gsym
, r_type_2
, this, got_offset
);
1376 this->set_got_size();
1379 template<int size
, bool big_endian
>
1381 Output_data_got
<size
, big_endian
>::add_global_pair_with_rela(
1383 unsigned int got_type
,
1385 unsigned int r_type_1
,
1386 unsigned int r_type_2
)
1388 if (gsym
->has_got_offset(got_type
))
1391 this->entries_
.push_back(Got_entry());
1392 unsigned int got_offset
= this->last_got_offset();
1393 gsym
->set_got_offset(got_type
, got_offset
);
1394 rela_dyn
->add_global(gsym
, r_type_1
, this, got_offset
, 0);
1396 this->entries_
.push_back(Got_entry());
1399 got_offset
= this->last_got_offset();
1400 rela_dyn
->add_global(gsym
, r_type_2
, this, got_offset
, 0);
1403 this->set_got_size();
1406 // Add an entry for a local symbol to the GOT. This returns true if
1407 // this is a new GOT entry, false if the symbol already has a GOT
1410 template<int size
, bool big_endian
>
1412 Output_data_got
<size
, big_endian
>::add_local(
1413 Sized_relobj
<size
, big_endian
>* object
,
1414 unsigned int symndx
,
1415 unsigned int got_type
)
1417 if (object
->local_has_got_offset(symndx
, got_type
))
1420 this->entries_
.push_back(Got_entry(object
, symndx
));
1421 this->set_got_size();
1422 object
->set_local_got_offset(symndx
, got_type
, this->last_got_offset());
1426 // Add an entry for a local symbol to the GOT, and add a dynamic
1427 // relocation of type R_TYPE for the GOT entry.
1428 template<int size
, bool big_endian
>
1430 Output_data_got
<size
, big_endian
>::add_local_with_rel(
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 rel_dyn
->add_local(object
, symndx
, r_type
, this, got_offset
);
1447 template<int size
, bool big_endian
>
1449 Output_data_got
<size
, big_endian
>::add_local_with_rela(
1450 Sized_relobj
<size
, big_endian
>* object
,
1451 unsigned int symndx
,
1452 unsigned int got_type
,
1454 unsigned int r_type
)
1456 if (object
->local_has_got_offset(symndx
, got_type
))
1459 this->entries_
.push_back(Got_entry());
1460 this->set_got_size();
1461 unsigned int got_offset
= this->last_got_offset();
1462 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1463 rela_dyn
->add_local(object
, symndx
, r_type
, this, got_offset
, 0);
1466 // Add a pair of entries for a local symbol to the GOT, and add
1467 // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively.
1468 // If R_TYPE_2 == 0, add the second entry with no relocation.
1469 template<int size
, bool big_endian
>
1471 Output_data_got
<size
, big_endian
>::add_local_pair_with_rel(
1472 Sized_relobj
<size
, big_endian
>* object
,
1473 unsigned int symndx
,
1475 unsigned int got_type
,
1477 unsigned int r_type_1
,
1478 unsigned int r_type_2
)
1480 if (object
->local_has_got_offset(symndx
, got_type
))
1483 this->entries_
.push_back(Got_entry());
1484 unsigned int got_offset
= this->last_got_offset();
1485 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1486 Output_section
* os
= object
->output_section(shndx
);
1487 rel_dyn
->add_output_section(os
, r_type_1
, this, got_offset
);
1489 this->entries_
.push_back(Got_entry(object
, symndx
));
1492 got_offset
= this->last_got_offset();
1493 rel_dyn
->add_output_section(os
, r_type_2
, this, got_offset
);
1496 this->set_got_size();
1499 template<int size
, bool big_endian
>
1501 Output_data_got
<size
, big_endian
>::add_local_pair_with_rela(
1502 Sized_relobj
<size
, big_endian
>* object
,
1503 unsigned int symndx
,
1505 unsigned int got_type
,
1507 unsigned int r_type_1
,
1508 unsigned int r_type_2
)
1510 if (object
->local_has_got_offset(symndx
, got_type
))
1513 this->entries_
.push_back(Got_entry());
1514 unsigned int got_offset
= this->last_got_offset();
1515 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1516 Output_section
* os
= object
->output_section(shndx
);
1517 rela_dyn
->add_output_section(os
, r_type_1
, this, got_offset
, 0);
1519 this->entries_
.push_back(Got_entry(object
, symndx
));
1522 got_offset
= this->last_got_offset();
1523 rela_dyn
->add_output_section(os
, r_type_2
, this, got_offset
, 0);
1526 this->set_got_size();
1529 // Write out the GOT.
1531 template<int size
, bool big_endian
>
1533 Output_data_got
<size
, big_endian
>::do_write(Output_file
* of
)
1535 const int add
= size
/ 8;
1537 const off_t off
= this->offset();
1538 const off_t oview_size
= this->data_size();
1539 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1541 unsigned char* pov
= oview
;
1542 for (typename
Got_entries::const_iterator p
= this->entries_
.begin();
1543 p
!= this->entries_
.end();
1550 gold_assert(pov
- oview
== oview_size
);
1552 of
->write_output_view(off
, oview_size
, oview
);
1554 // We no longer need the GOT entries.
1555 this->entries_
.clear();
1558 // Output_data_dynamic::Dynamic_entry methods.
1560 // Write out the entry.
1562 template<int size
, bool big_endian
>
1564 Output_data_dynamic::Dynamic_entry::write(
1566 const Stringpool
* pool
) const
1568 typename
elfcpp::Elf_types
<size
>::Elf_WXword val
;
1569 switch (this->offset_
)
1571 case DYNAMIC_NUMBER
:
1575 case DYNAMIC_SECTION_SIZE
:
1576 val
= this->u_
.od
->data_size();
1577 if (this->od2
!= NULL
)
1578 val
+= this->od2
->data_size();
1581 case DYNAMIC_SYMBOL
:
1583 const Sized_symbol
<size
>* s
=
1584 static_cast<const Sized_symbol
<size
>*>(this->u_
.sym
);
1589 case DYNAMIC_STRING
:
1590 val
= pool
->get_offset(this->u_
.str
);
1594 val
= this->u_
.od
->address() + this->offset_
;
1598 elfcpp::Dyn_write
<size
, big_endian
> dw(pov
);
1599 dw
.put_d_tag(this->tag_
);
1603 // Output_data_dynamic methods.
1605 // Adjust the output section to set the entry size.
1608 Output_data_dynamic::do_adjust_output_section(Output_section
* os
)
1610 if (parameters
->target().get_size() == 32)
1611 os
->set_entsize(elfcpp::Elf_sizes
<32>::dyn_size
);
1612 else if (parameters
->target().get_size() == 64)
1613 os
->set_entsize(elfcpp::Elf_sizes
<64>::dyn_size
);
1618 // Set the final data size.
1621 Output_data_dynamic::set_final_data_size()
1623 // Add the terminating entry if it hasn't been added.
1624 // Because of relaxation, we can run this multiple times.
1625 if (this->entries_
.empty() || this->entries_
.back().tag() != elfcpp::DT_NULL
)
1627 int extra
= parameters
->options().spare_dynamic_tags();
1628 for (int i
= 0; i
< extra
; ++i
)
1629 this->add_constant(elfcpp::DT_NULL
, 0);
1630 this->add_constant(elfcpp::DT_NULL
, 0);
1634 if (parameters
->target().get_size() == 32)
1635 dyn_size
= elfcpp::Elf_sizes
<32>::dyn_size
;
1636 else if (parameters
->target().get_size() == 64)
1637 dyn_size
= elfcpp::Elf_sizes
<64>::dyn_size
;
1640 this->set_data_size(this->entries_
.size() * dyn_size
);
1643 // Write out the dynamic entries.
1646 Output_data_dynamic::do_write(Output_file
* of
)
1648 switch (parameters
->size_and_endianness())
1650 #ifdef HAVE_TARGET_32_LITTLE
1651 case Parameters::TARGET_32_LITTLE
:
1652 this->sized_write
<32, false>(of
);
1655 #ifdef HAVE_TARGET_32_BIG
1656 case Parameters::TARGET_32_BIG
:
1657 this->sized_write
<32, true>(of
);
1660 #ifdef HAVE_TARGET_64_LITTLE
1661 case Parameters::TARGET_64_LITTLE
:
1662 this->sized_write
<64, false>(of
);
1665 #ifdef HAVE_TARGET_64_BIG
1666 case Parameters::TARGET_64_BIG
:
1667 this->sized_write
<64, true>(of
);
1675 template<int size
, bool big_endian
>
1677 Output_data_dynamic::sized_write(Output_file
* of
)
1679 const int dyn_size
= elfcpp::Elf_sizes
<size
>::dyn_size
;
1681 const off_t offset
= this->offset();
1682 const off_t oview_size
= this->data_size();
1683 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1685 unsigned char* pov
= oview
;
1686 for (typename
Dynamic_entries::const_iterator p
= this->entries_
.begin();
1687 p
!= this->entries_
.end();
1690 p
->write
<size
, big_endian
>(pov
, this->pool_
);
1694 gold_assert(pov
- oview
== oview_size
);
1696 of
->write_output_view(offset
, oview_size
, oview
);
1698 // We no longer need the dynamic entries.
1699 this->entries_
.clear();
1702 // Class Output_symtab_xindex.
1705 Output_symtab_xindex::do_write(Output_file
* of
)
1707 const off_t offset
= this->offset();
1708 const off_t oview_size
= this->data_size();
1709 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1711 memset(oview
, 0, oview_size
);
1713 if (parameters
->target().is_big_endian())
1714 this->endian_do_write
<true>(oview
);
1716 this->endian_do_write
<false>(oview
);
1718 of
->write_output_view(offset
, oview_size
, oview
);
1720 // We no longer need the data.
1721 this->entries_
.clear();
1724 template<bool big_endian
>
1726 Output_symtab_xindex::endian_do_write(unsigned char* const oview
)
1728 for (Xindex_entries::const_iterator p
= this->entries_
.begin();
1729 p
!= this->entries_
.end();
1732 unsigned int symndx
= p
->first
;
1733 gold_assert(symndx
* 4 < this->data_size());
1734 elfcpp::Swap
<32, big_endian
>::writeval(oview
+ symndx
* 4, p
->second
);
1738 // Output_section::Input_section methods.
1740 // Return the data size. For an input section we store the size here.
1741 // For an Output_section_data, we have to ask it for the size.
1744 Output_section::Input_section::data_size() const
1746 if (this->is_input_section())
1747 return this->u1_
.data_size
;
1749 return this->u2_
.posd
->data_size();
1752 // Set the address and file offset.
1755 Output_section::Input_section::set_address_and_file_offset(
1758 off_t section_file_offset
)
1760 if (this->is_input_section())
1761 this->u2_
.object
->set_section_offset(this->shndx_
,
1762 file_offset
- section_file_offset
);
1764 this->u2_
.posd
->set_address_and_file_offset(address
, file_offset
);
1767 // Reset the address and file offset.
1770 Output_section::Input_section::reset_address_and_file_offset()
1772 if (!this->is_input_section())
1773 this->u2_
.posd
->reset_address_and_file_offset();
1776 // Finalize the data size.
1779 Output_section::Input_section::finalize_data_size()
1781 if (!this->is_input_section())
1782 this->u2_
.posd
->finalize_data_size();
1785 // Try to turn an input offset into an output offset. We want to
1786 // return the output offset relative to the start of this
1787 // Input_section in the output section.
1790 Output_section::Input_section::output_offset(
1791 const Relobj
* object
,
1793 section_offset_type offset
,
1794 section_offset_type
*poutput
) const
1796 if (!this->is_input_section())
1797 return this->u2_
.posd
->output_offset(object
, shndx
, offset
, poutput
);
1800 if (this->shndx_
!= shndx
|| this->u2_
.object
!= object
)
1807 // Return whether this is the merge section for the input section
1811 Output_section::Input_section::is_merge_section_for(const Relobj
* object
,
1812 unsigned int shndx
) const
1814 if (this->is_input_section())
1816 return this->u2_
.posd
->is_merge_section_for(object
, shndx
);
1819 // Write out the data. We don't have to do anything for an input
1820 // section--they are handled via Object::relocate--but this is where
1821 // we write out the data for an Output_section_data.
1824 Output_section::Input_section::write(Output_file
* of
)
1826 if (!this->is_input_section())
1827 this->u2_
.posd
->write(of
);
1830 // Write the data to a buffer. As for write(), we don't have to do
1831 // anything for an input section.
1834 Output_section::Input_section::write_to_buffer(unsigned char* buffer
)
1836 if (!this->is_input_section())
1837 this->u2_
.posd
->write_to_buffer(buffer
);
1840 // Print to a map file.
1843 Output_section::Input_section::print_to_mapfile(Mapfile
* mapfile
) const
1845 switch (this->shndx_
)
1847 case OUTPUT_SECTION_CODE
:
1848 case MERGE_DATA_SECTION_CODE
:
1849 case MERGE_STRING_SECTION_CODE
:
1850 this->u2_
.posd
->print_to_mapfile(mapfile
);
1853 case RELAXED_INPUT_SECTION_CODE
:
1855 Output_relaxed_input_section
* relaxed_section
=
1856 this->relaxed_input_section();
1857 mapfile
->print_input_section(relaxed_section
->relobj(),
1858 relaxed_section
->shndx());
1862 mapfile
->print_input_section(this->u2_
.object
, this->shndx_
);
1867 // Output_section methods.
1869 // Construct an Output_section. NAME will point into a Stringpool.
1871 Output_section::Output_section(const char* name
, elfcpp::Elf_Word type
,
1872 elfcpp::Elf_Xword flags
)
1877 link_section_(NULL
),
1879 info_section_(NULL
),
1888 first_input_offset_(0),
1890 postprocessing_buffer_(NULL
),
1891 needs_symtab_index_(false),
1892 needs_dynsym_index_(false),
1893 should_link_to_symtab_(false),
1894 should_link_to_dynsym_(false),
1895 after_input_sections_(false),
1896 requires_postprocessing_(false),
1897 found_in_sections_clause_(false),
1898 has_load_address_(false),
1899 info_uses_section_index_(false),
1900 may_sort_attached_input_sections_(false),
1901 must_sort_attached_input_sections_(false),
1902 attached_input_sections_are_sorted_(false),
1904 is_relro_local_(false),
1905 is_last_relro_(false),
1906 is_first_non_relro_(false),
1907 is_small_section_(false),
1908 is_large_section_(false),
1910 is_dynamic_linker_section_(false),
1911 generate_code_fills_at_write_(false),
1912 is_entsize_zero_(false),
1913 section_offsets_need_adjustment_(false),
1916 merge_section_map_(),
1917 merge_section_by_properties_map_(),
1918 relaxed_input_section_map_(),
1919 is_relaxed_input_section_map_valid_(true)
1921 // An unallocated section has no address. Forcing this means that
1922 // we don't need special treatment for symbols defined in debug
1924 if ((flags
& elfcpp::SHF_ALLOC
) == 0)
1925 this->set_address(0);
1928 Output_section::~Output_section()
1930 delete this->checkpoint_
;
1933 // Set the entry size.
1936 Output_section::set_entsize(uint64_t v
)
1938 if (this->is_entsize_zero_
)
1940 else if (this->entsize_
== 0)
1942 else if (this->entsize_
!= v
)
1945 this->is_entsize_zero_
= 1;
1949 // Add the input section SHNDX, with header SHDR, named SECNAME, in
1950 // OBJECT, to the Output_section. RELOC_SHNDX is the index of a
1951 // relocation section which applies to this section, or 0 if none, or
1952 // -1U if more than one. Return the offset of the input section
1953 // within the output section. Return -1 if the input section will
1954 // receive special handling. In the normal case we don't always keep
1955 // track of input sections for an Output_section. Instead, each
1956 // Object keeps track of the Output_section for each of its input
1957 // sections. However, if HAVE_SECTIONS_SCRIPT is true, we do keep
1958 // track of input sections here; this is used when SECTIONS appears in
1961 template<int size
, bool big_endian
>
1963 Output_section::add_input_section(Sized_relobj
<size
, big_endian
>* object
,
1965 const char* secname
,
1966 const elfcpp::Shdr
<size
, big_endian
>& shdr
,
1967 unsigned int reloc_shndx
,
1968 bool have_sections_script
)
1970 elfcpp::Elf_Xword addralign
= shdr
.get_sh_addralign();
1971 if ((addralign
& (addralign
- 1)) != 0)
1973 object
->error(_("invalid alignment %lu for section \"%s\""),
1974 static_cast<unsigned long>(addralign
), secname
);
1978 if (addralign
> this->addralign_
)
1979 this->addralign_
= addralign
;
1981 typename
elfcpp::Elf_types
<size
>::Elf_WXword sh_flags
= shdr
.get_sh_flags();
1982 uint64_t entsize
= shdr
.get_sh_entsize();
1984 // .debug_str is a mergeable string section, but is not always so
1985 // marked by compilers. Mark manually here so we can optimize.
1986 if (strcmp(secname
, ".debug_str") == 0)
1988 sh_flags
|= (elfcpp::SHF_MERGE
| elfcpp::SHF_STRINGS
);
1992 this->update_flags_for_input_section(sh_flags
);
1993 this->set_entsize(entsize
);
1995 // If this is a SHF_MERGE section, we pass all the input sections to
1996 // a Output_data_merge. We don't try to handle relocations for such
1997 // a section. We don't try to handle empty merge sections--they
1998 // mess up the mappings, and are useless anyhow.
1999 if ((sh_flags
& elfcpp::SHF_MERGE
) != 0
2001 && shdr
.get_sh_size() > 0)
2003 if (this->add_merge_input_section(object
, shndx
, sh_flags
,
2004 entsize
, addralign
))
2006 // Tell the relocation routines that they need to call the
2007 // output_offset method to determine the final address.
2012 off_t offset_in_section
= this->current_data_size_for_child();
2013 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2016 // Determine if we want to delay code-fill generation until the output
2017 // section is written. When the target is relaxing, we want to delay fill
2018 // generating to avoid adjusting them during relaxation.
2019 if (!this->generate_code_fills_at_write_
2020 && !have_sections_script
2021 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2022 && parameters
->target().has_code_fill()
2023 && parameters
->target().may_relax())
2025 gold_assert(this->fills_
.empty());
2026 this->generate_code_fills_at_write_
= true;
2029 if (aligned_offset_in_section
> offset_in_section
2030 && !this->generate_code_fills_at_write_
2031 && !have_sections_script
2032 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2033 && parameters
->target().has_code_fill())
2035 // We need to add some fill data. Using fill_list_ when
2036 // possible is an optimization, since we will often have fill
2037 // sections without input sections.
2038 off_t fill_len
= aligned_offset_in_section
- offset_in_section
;
2039 if (this->input_sections_
.empty())
2040 this->fills_
.push_back(Fill(offset_in_section
, fill_len
));
2043 std::string
fill_data(parameters
->target().code_fill(fill_len
));
2044 Output_data_const
* odc
= new Output_data_const(fill_data
, 1);
2045 this->input_sections_
.push_back(Input_section(odc
));
2049 this->set_current_data_size_for_child(aligned_offset_in_section
2050 + shdr
.get_sh_size());
2052 // We need to keep track of this section if we are already keeping
2053 // track of sections, or if we are relaxing. Also, if this is a
2054 // section which requires sorting, or which may require sorting in
2055 // the future, we keep track of the sections.
2056 if (have_sections_script
2057 || !this->input_sections_
.empty()
2058 || this->may_sort_attached_input_sections()
2059 || this->must_sort_attached_input_sections()
2060 || parameters
->options().user_set_Map()
2061 || parameters
->target().may_relax())
2062 this->input_sections_
.push_back(Input_section(object
, shndx
,
2066 return aligned_offset_in_section
;
2069 // Add arbitrary data to an output section.
2072 Output_section::add_output_section_data(Output_section_data
* posd
)
2074 Input_section
inp(posd
);
2075 this->add_output_section_data(&inp
);
2077 if (posd
->is_data_size_valid())
2079 off_t offset_in_section
= this->current_data_size_for_child();
2080 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2082 this->set_current_data_size_for_child(aligned_offset_in_section
2083 + posd
->data_size());
2087 // Add a relaxed input section.
2090 Output_section::add_relaxed_input_section(Output_relaxed_input_section
* poris
)
2092 Input_section
inp(poris
);
2093 this->add_output_section_data(&inp
);
2094 if (this->is_relaxed_input_section_map_valid_
)
2096 Const_section_id
csid(poris
->relobj(), poris
->shndx());
2097 this->relaxed_input_section_map_
[csid
] = poris
;
2100 // For a relaxed section, we use the current data size. Linker scripts
2101 // get all the input sections, including relaxed one from an output
2102 // section and add them back to them same output section to compute the
2103 // output section size. If we do not account for sizes of relaxed input
2104 // sections, an output section would be incorrectly sized.
2105 off_t offset_in_section
= this->current_data_size_for_child();
2106 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2107 poris
->addralign());
2108 this->set_current_data_size_for_child(aligned_offset_in_section
2109 + poris
->current_data_size());
2112 // Add arbitrary data to an output section by Input_section.
2115 Output_section::add_output_section_data(Input_section
* inp
)
2117 if (this->input_sections_
.empty())
2118 this->first_input_offset_
= this->current_data_size_for_child();
2120 this->input_sections_
.push_back(*inp
);
2122 uint64_t addralign
= inp
->addralign();
2123 if (addralign
> this->addralign_
)
2124 this->addralign_
= addralign
;
2126 inp
->set_output_section(this);
2129 // Add a merge section to an output section.
2132 Output_section::add_output_merge_section(Output_section_data
* posd
,
2133 bool is_string
, uint64_t entsize
)
2135 Input_section
inp(posd
, is_string
, entsize
);
2136 this->add_output_section_data(&inp
);
2139 // Add an input section to a SHF_MERGE section.
2142 Output_section::add_merge_input_section(Relobj
* object
, unsigned int shndx
,
2143 uint64_t flags
, uint64_t entsize
,
2146 bool is_string
= (flags
& elfcpp::SHF_STRINGS
) != 0;
2148 // We only merge strings if the alignment is not more than the
2149 // character size. This could be handled, but it's unusual.
2150 if (is_string
&& addralign
> entsize
)
2153 // We cannot restore merged input section states.
2154 gold_assert(this->checkpoint_
== NULL
);
2156 // Look up merge sections by required properties.
2157 Output_merge_base
* pomb
;
2158 Merge_section_properties
msp(is_string
, entsize
, addralign
);
2159 Merge_section_by_properties_map::const_iterator p
=
2160 this->merge_section_by_properties_map_
.find(msp
);
2161 if (p
!= this->merge_section_by_properties_map_
.end())
2164 gold_assert(pomb
->is_string() == is_string
2165 && pomb
->entsize() == entsize
2166 && pomb
->addralign() == addralign
);
2170 // Create a new Output_merge_data or Output_merge_string_data.
2172 pomb
= new Output_merge_data(entsize
, addralign
);
2178 pomb
= new Output_merge_string
<char>(addralign
);
2181 pomb
= new Output_merge_string
<uint16_t>(addralign
);
2184 pomb
= new Output_merge_string
<uint32_t>(addralign
);
2190 // Add new merge section to this output section and link merge
2191 // section properties to new merge section in map.
2192 this->add_output_merge_section(pomb
, is_string
, entsize
);
2193 this->merge_section_by_properties_map_
[msp
] = pomb
;
2196 if (pomb
->add_input_section(object
, shndx
))
2198 // Add input section to new merge section and link input section to new
2199 // merge section in map.
2200 Const_section_id
csid(object
, shndx
);
2201 this->merge_section_map_
[csid
] = pomb
;
2208 // Build a relaxation map to speed up relaxation of existing input sections.
2209 // Look up to the first LIMIT elements in INPUT_SECTIONS.
2212 Output_section::build_relaxation_map(
2213 const Input_section_list
& input_sections
,
2215 Relaxation_map
* relaxation_map
) const
2217 for (size_t i
= 0; i
< limit
; ++i
)
2219 const Input_section
& is(input_sections
[i
]);
2220 if (is
.is_input_section() || is
.is_relaxed_input_section())
2222 Section_id
sid(is
.relobj(), is
.shndx());
2223 (*relaxation_map
)[sid
] = i
;
2228 // Convert regular input sections in INPUT_SECTIONS into relaxed input
2229 // sections in RELAXED_SECTIONS. MAP is a prebuilt map from section id
2230 // indices of INPUT_SECTIONS.
2233 Output_section::convert_input_sections_in_list_to_relaxed_sections(
2234 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
,
2235 const Relaxation_map
& map
,
2236 Input_section_list
* input_sections
)
2238 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2240 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2241 Section_id
sid(poris
->relobj(), poris
->shndx());
2242 Relaxation_map::const_iterator p
= map
.find(sid
);
2243 gold_assert(p
!= map
.end());
2244 gold_assert((*input_sections
)[p
->second
].is_input_section());
2245 (*input_sections
)[p
->second
] = Input_section(poris
);
2249 // Convert regular input sections into relaxed input sections. RELAXED_SECTIONS
2250 // is a vector of pointers to Output_relaxed_input_section or its derived
2251 // classes. The relaxed sections must correspond to existing input sections.
2254 Output_section::convert_input_sections_to_relaxed_sections(
2255 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
)
2257 gold_assert(parameters
->target().may_relax());
2259 // We want to make sure that restore_states does not undo the effect of
2260 // this. If there is no checkpoint active, just search the current
2261 // input section list and replace the sections there. If there is
2262 // a checkpoint, also replace the sections there.
2264 // By default, we look at the whole list.
2265 size_t limit
= this->input_sections_
.size();
2267 if (this->checkpoint_
!= NULL
)
2269 // Replace input sections with relaxed input section in the saved
2270 // copy of the input section list.
2271 if (this->checkpoint_
->input_sections_saved())
2274 this->build_relaxation_map(
2275 *(this->checkpoint_
->input_sections()),
2276 this->checkpoint_
->input_sections()->size(),
2278 this->convert_input_sections_in_list_to_relaxed_sections(
2281 this->checkpoint_
->input_sections());
2285 // We have not copied the input section list yet. Instead, just
2286 // look at the portion that would be saved.
2287 limit
= this->checkpoint_
->input_sections_size();
2291 // Convert input sections in input_section_list.
2293 this->build_relaxation_map(this->input_sections_
, limit
, &map
);
2294 this->convert_input_sections_in_list_to_relaxed_sections(
2297 &this->input_sections_
);
2299 // Update fast look-up map.
2300 if (this->is_relaxed_input_section_map_valid_
)
2301 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2303 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2304 Const_section_id
csid(poris
->relobj(), poris
->shndx());
2305 this->relaxed_input_section_map_
[csid
] = poris
;
2309 // Update the output section flags based on input section flags.
2312 Output_section::update_flags_for_input_section(elfcpp::Elf_Xword flags
)
2314 // If we created the section with SHF_ALLOC clear, we set the
2315 // address. If we are now setting the SHF_ALLOC flag, we need to
2317 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0
2318 && (flags
& elfcpp::SHF_ALLOC
) != 0)
2319 this->mark_address_invalid();
2321 this->flags_
|= (flags
2322 & (elfcpp::SHF_WRITE
2324 | elfcpp::SHF_EXECINSTR
));
2326 if ((flags
& elfcpp::SHF_MERGE
) == 0)
2327 this->flags_
&=~ elfcpp::SHF_MERGE
;
2330 if (this->current_data_size_for_child() == 0)
2331 this->flags_
|= elfcpp::SHF_MERGE
;
2334 if ((flags
& elfcpp::SHF_STRINGS
) == 0)
2335 this->flags_
&=~ elfcpp::SHF_STRINGS
;
2338 if (this->current_data_size_for_child() == 0)
2339 this->flags_
|= elfcpp::SHF_STRINGS
;
2343 // Find the merge section into which an input section with index SHNDX in
2344 // OBJECT has been added. Return NULL if none found.
2346 Output_section_data
*
2347 Output_section::find_merge_section(const Relobj
* object
,
2348 unsigned int shndx
) const
2350 Const_section_id
csid(object
, shndx
);
2351 Output_section_data_by_input_section_map::const_iterator p
=
2352 this->merge_section_map_
.find(csid
);
2353 if (p
!= this->merge_section_map_
.end())
2355 Output_section_data
* posd
= p
->second
;
2356 gold_assert(posd
->is_merge_section_for(object
, shndx
));
2363 // Find an relaxed input section corresponding to an input section
2364 // in OBJECT with index SHNDX.
2366 const Output_relaxed_input_section
*
2367 Output_section::find_relaxed_input_section(const Relobj
* object
,
2368 unsigned int shndx
) const
2370 // Be careful that the map may not be valid due to input section export
2371 // to scripts or a check-point restore.
2372 if (!this->is_relaxed_input_section_map_valid_
)
2374 // Rebuild the map as needed.
2375 this->relaxed_input_section_map_
.clear();
2376 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2377 p
!= this->input_sections_
.end();
2379 if (p
->is_relaxed_input_section())
2381 Const_section_id
csid(p
->relobj(), p
->shndx());
2382 this->relaxed_input_section_map_
[csid
] =
2383 p
->relaxed_input_section();
2385 this->is_relaxed_input_section_map_valid_
= true;
2388 Const_section_id
csid(object
, shndx
);
2389 Output_relaxed_input_section_by_input_section_map::const_iterator p
=
2390 this->relaxed_input_section_map_
.find(csid
);
2391 if (p
!= this->relaxed_input_section_map_
.end())
2397 // Given an address OFFSET relative to the start of input section
2398 // SHNDX in OBJECT, return whether this address is being included in
2399 // the final link. This should only be called if SHNDX in OBJECT has
2400 // a special mapping.
2403 Output_section::is_input_address_mapped(const Relobj
* object
,
2407 // Look at the Output_section_data_maps first.
2408 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2410 posd
= this->find_relaxed_input_section(object
, shndx
);
2414 section_offset_type output_offset
;
2415 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2417 return output_offset
!= -1;
2420 // Fall back to the slow look-up.
2421 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2422 p
!= this->input_sections_
.end();
2425 section_offset_type output_offset
;
2426 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2427 return output_offset
!= -1;
2430 // By default we assume that the address is mapped. This should
2431 // only be called after we have passed all sections to Layout. At
2432 // that point we should know what we are discarding.
2436 // Given an address OFFSET relative to the start of input section
2437 // SHNDX in object OBJECT, return the output offset relative to the
2438 // start of the input section in the output section. This should only
2439 // be called if SHNDX in OBJECT has a special mapping.
2442 Output_section::output_offset(const Relobj
* object
, unsigned int shndx
,
2443 section_offset_type offset
) const
2445 // This can only be called meaningfully when we know the data size
2447 gold_assert(this->is_data_size_valid());
2449 // Look at the Output_section_data_maps first.
2450 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2452 posd
= this->find_relaxed_input_section(object
, shndx
);
2455 section_offset_type output_offset
;
2456 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2458 return output_offset
;
2461 // Fall back to the slow look-up.
2462 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2463 p
!= this->input_sections_
.end();
2466 section_offset_type output_offset
;
2467 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2468 return output_offset
;
2473 // Return the output virtual address of OFFSET relative to the start
2474 // of input section SHNDX in object OBJECT.
2477 Output_section::output_address(const Relobj
* object
, unsigned int shndx
,
2480 uint64_t addr
= this->address() + this->first_input_offset_
;
2482 // Look at the Output_section_data_maps first.
2483 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2485 posd
= this->find_relaxed_input_section(object
, shndx
);
2486 if (posd
!= NULL
&& posd
->is_address_valid())
2488 section_offset_type output_offset
;
2489 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2491 return posd
->address() + output_offset
;
2494 // Fall back to the slow look-up.
2495 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2496 p
!= this->input_sections_
.end();
2499 addr
= align_address(addr
, p
->addralign());
2500 section_offset_type output_offset
;
2501 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2503 if (output_offset
== -1)
2505 return addr
+ output_offset
;
2507 addr
+= p
->data_size();
2510 // If we get here, it means that we don't know the mapping for this
2511 // input section. This might happen in principle if
2512 // add_input_section were called before add_output_section_data.
2513 // But it should never actually happen.
2518 // Find the output address of the start of the merged section for
2519 // input section SHNDX in object OBJECT.
2522 Output_section::find_starting_output_address(const Relobj
* object
,
2524 uint64_t* paddr
) const
2526 // FIXME: This becomes a bottle-neck if we have many relaxed sections.
2527 // Looking up the merge section map does not always work as we sometimes
2528 // find a merge section without its address set.
2529 uint64_t addr
= this->address() + this->first_input_offset_
;
2530 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2531 p
!= this->input_sections_
.end();
2534 addr
= align_address(addr
, p
->addralign());
2536 // It would be nice if we could use the existing output_offset
2537 // method to get the output offset of input offset 0.
2538 // Unfortunately we don't know for sure that input offset 0 is
2540 if (p
->is_merge_section_for(object
, shndx
))
2546 addr
+= p
->data_size();
2549 // We couldn't find a merge output section for this input section.
2553 // Set the data size of an Output_section. This is where we handle
2554 // setting the addresses of any Output_section_data objects.
2557 Output_section::set_final_data_size()
2559 if (this->input_sections_
.empty())
2561 this->set_data_size(this->current_data_size_for_child());
2565 if (this->must_sort_attached_input_sections())
2566 this->sort_attached_input_sections();
2568 uint64_t address
= this->address();
2569 off_t startoff
= this->offset();
2570 off_t off
= startoff
+ this->first_input_offset_
;
2571 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2572 p
!= this->input_sections_
.end();
2575 off
= align_address(off
, p
->addralign());
2576 p
->set_address_and_file_offset(address
+ (off
- startoff
), off
,
2578 off
+= p
->data_size();
2581 this->set_data_size(off
- startoff
);
2584 // Reset the address and file offset.
2587 Output_section::do_reset_address_and_file_offset()
2589 // An unallocated section has no address. Forcing this means that
2590 // we don't need special treatment for symbols defined in debug
2591 // sections. We do the same in the constructor.
2592 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0)
2593 this->set_address(0);
2595 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2596 p
!= this->input_sections_
.end();
2598 p
->reset_address_and_file_offset();
2601 // Return true if address and file offset have the values after reset.
2604 Output_section::do_address_and_file_offset_have_reset_values() const
2606 if (this->is_offset_valid())
2609 // An unallocated section has address 0 after its construction or a reset.
2610 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0)
2611 return this->is_address_valid() && this->address() == 0;
2613 return !this->is_address_valid();
2616 // Set the TLS offset. Called only for SHT_TLS sections.
2619 Output_section::do_set_tls_offset(uint64_t tls_base
)
2621 this->tls_offset_
= this->address() - tls_base
;
2624 // In a few cases we need to sort the input sections attached to an
2625 // output section. This is used to implement the type of constructor
2626 // priority ordering implemented by the GNU linker, in which the
2627 // priority becomes part of the section name and the sections are
2628 // sorted by name. We only do this for an output section if we see an
2629 // attached input section matching ".ctor.*", ".dtor.*",
2630 // ".init_array.*" or ".fini_array.*".
2632 class Output_section::Input_section_sort_entry
2635 Input_section_sort_entry()
2636 : input_section_(), index_(-1U), section_has_name_(false),
2640 Input_section_sort_entry(const Input_section
& input_section
,
2642 : input_section_(input_section
), index_(index
),
2643 section_has_name_(input_section
.is_input_section()
2644 || input_section
.is_relaxed_input_section())
2646 if (this->section_has_name_
)
2648 // This is only called single-threaded from Layout::finalize,
2649 // so it is OK to lock. Unfortunately we have no way to pass
2651 const Task
* dummy_task
= reinterpret_cast<const Task
*>(-1);
2652 Object
* obj
= (input_section
.is_input_section()
2653 ? input_section
.relobj()
2654 : input_section
.relaxed_input_section()->relobj());
2655 Task_lock_obj
<Object
> tl(dummy_task
, obj
);
2657 // This is a slow operation, which should be cached in
2658 // Layout::layout if this becomes a speed problem.
2659 this->section_name_
= obj
->section_name(input_section
.shndx());
2663 // Return the Input_section.
2664 const Input_section
&
2665 input_section() const
2667 gold_assert(this->index_
!= -1U);
2668 return this->input_section_
;
2671 // The index of this entry in the original list. This is used to
2672 // make the sort stable.
2676 gold_assert(this->index_
!= -1U);
2677 return this->index_
;
2680 // Whether there is a section name.
2682 section_has_name() const
2683 { return this->section_has_name_
; }
2685 // The section name.
2687 section_name() const
2689 gold_assert(this->section_has_name_
);
2690 return this->section_name_
;
2693 // Return true if the section name has a priority. This is assumed
2694 // to be true if it has a dot after the initial dot.
2696 has_priority() const
2698 gold_assert(this->section_has_name_
);
2699 return this->section_name_
.find('.', 1) != std::string::npos
;
2702 // Return true if this an input file whose base name matches
2703 // FILE_NAME. The base name must have an extension of ".o", and
2704 // must be exactly FILE_NAME.o or FILE_NAME, one character, ".o".
2705 // This is to match crtbegin.o as well as crtbeginS.o without
2706 // getting confused by other possibilities. Overall matching the
2707 // file name this way is a dreadful hack, but the GNU linker does it
2708 // in order to better support gcc, and we need to be compatible.
2710 match_file_name(const char* match_file_name
) const
2712 const std::string
& file_name(this->input_section_
.relobj()->name());
2713 const char* base_name
= lbasename(file_name
.c_str());
2714 size_t match_len
= strlen(match_file_name
);
2715 if (strncmp(base_name
, match_file_name
, match_len
) != 0)
2717 size_t base_len
= strlen(base_name
);
2718 if (base_len
!= match_len
+ 2 && base_len
!= match_len
+ 3)
2720 return memcmp(base_name
+ base_len
- 2, ".o", 2) == 0;
2724 // The Input_section we are sorting.
2725 Input_section input_section_
;
2726 // The index of this Input_section in the original list.
2727 unsigned int index_
;
2728 // Whether this Input_section has a section name--it won't if this
2729 // is some random Output_section_data.
2730 bool section_has_name_
;
2731 // The section name if there is one.
2732 std::string section_name_
;
2735 // Return true if S1 should come before S2 in the output section.
2738 Output_section::Input_section_sort_compare::operator()(
2739 const Output_section::Input_section_sort_entry
& s1
,
2740 const Output_section::Input_section_sort_entry
& s2
) const
2742 // crtbegin.o must come first.
2743 bool s1_begin
= s1
.match_file_name("crtbegin");
2744 bool s2_begin
= s2
.match_file_name("crtbegin");
2745 if (s1_begin
|| s2_begin
)
2751 return s1
.index() < s2
.index();
2754 // crtend.o must come last.
2755 bool s1_end
= s1
.match_file_name("crtend");
2756 bool s2_end
= s2
.match_file_name("crtend");
2757 if (s1_end
|| s2_end
)
2763 return s1
.index() < s2
.index();
2766 // We sort all the sections with no names to the end.
2767 if (!s1
.section_has_name() || !s2
.section_has_name())
2769 if (s1
.section_has_name())
2771 if (s2
.section_has_name())
2773 return s1
.index() < s2
.index();
2776 // A section with a priority follows a section without a priority.
2777 bool s1_has_priority
= s1
.has_priority();
2778 bool s2_has_priority
= s2
.has_priority();
2779 if (s1_has_priority
&& !s2_has_priority
)
2781 if (!s1_has_priority
&& s2_has_priority
)
2784 // Otherwise we sort by name.
2785 int compare
= s1
.section_name().compare(s2
.section_name());
2789 // Otherwise we keep the input order.
2790 return s1
.index() < s2
.index();
2793 // Return true if S1 should come before S2 in an .init_array or .fini_array
2797 Output_section::Input_section_sort_init_fini_compare::operator()(
2798 const Output_section::Input_section_sort_entry
& s1
,
2799 const Output_section::Input_section_sort_entry
& s2
) const
2801 // We sort all the sections with no names to the end.
2802 if (!s1
.section_has_name() || !s2
.section_has_name())
2804 if (s1
.section_has_name())
2806 if (s2
.section_has_name())
2808 return s1
.index() < s2
.index();
2811 // A section without a priority follows a section with a priority.
2812 // This is the reverse of .ctors and .dtors sections.
2813 bool s1_has_priority
= s1
.has_priority();
2814 bool s2_has_priority
= s2
.has_priority();
2815 if (s1_has_priority
&& !s2_has_priority
)
2817 if (!s1_has_priority
&& s2_has_priority
)
2820 // Otherwise we sort by name.
2821 int compare
= s1
.section_name().compare(s2
.section_name());
2825 // Otherwise we keep the input order.
2826 return s1
.index() < s2
.index();
2829 // Sort the input sections attached to an output section.
2832 Output_section::sort_attached_input_sections()
2834 if (this->attached_input_sections_are_sorted_
)
2837 if (this->checkpoint_
!= NULL
2838 && !this->checkpoint_
->input_sections_saved())
2839 this->checkpoint_
->save_input_sections();
2841 // The only thing we know about an input section is the object and
2842 // the section index. We need the section name. Recomputing this
2843 // is slow but this is an unusual case. If this becomes a speed
2844 // problem we can cache the names as required in Layout::layout.
2846 // We start by building a larger vector holding a copy of each
2847 // Input_section, plus its current index in the list and its name.
2848 std::vector
<Input_section_sort_entry
> sort_list
;
2851 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2852 p
!= this->input_sections_
.end();
2854 sort_list
.push_back(Input_section_sort_entry(*p
, i
));
2856 // Sort the input sections.
2857 if (this->type() == elfcpp::SHT_PREINIT_ARRAY
2858 || this->type() == elfcpp::SHT_INIT_ARRAY
2859 || this->type() == elfcpp::SHT_FINI_ARRAY
)
2860 std::sort(sort_list
.begin(), sort_list
.end(),
2861 Input_section_sort_init_fini_compare());
2863 std::sort(sort_list
.begin(), sort_list
.end(),
2864 Input_section_sort_compare());
2866 // Copy the sorted input sections back to our list.
2867 this->input_sections_
.clear();
2868 for (std::vector
<Input_section_sort_entry
>::iterator p
= sort_list
.begin();
2869 p
!= sort_list
.end();
2871 this->input_sections_
.push_back(p
->input_section());
2873 // Remember that we sorted the input sections, since we might get
2875 this->attached_input_sections_are_sorted_
= true;
2878 // Write the section header to *OSHDR.
2880 template<int size
, bool big_endian
>
2882 Output_section::write_header(const Layout
* layout
,
2883 const Stringpool
* secnamepool
,
2884 elfcpp::Shdr_write
<size
, big_endian
>* oshdr
) const
2886 oshdr
->put_sh_name(secnamepool
->get_offset(this->name_
));
2887 oshdr
->put_sh_type(this->type_
);
2889 elfcpp::Elf_Xword flags
= this->flags_
;
2890 if (this->info_section_
!= NULL
&& this->info_uses_section_index_
)
2891 flags
|= elfcpp::SHF_INFO_LINK
;
2892 oshdr
->put_sh_flags(flags
);
2894 oshdr
->put_sh_addr(this->address());
2895 oshdr
->put_sh_offset(this->offset());
2896 oshdr
->put_sh_size(this->data_size());
2897 if (this->link_section_
!= NULL
)
2898 oshdr
->put_sh_link(this->link_section_
->out_shndx());
2899 else if (this->should_link_to_symtab_
)
2900 oshdr
->put_sh_link(layout
->symtab_section()->out_shndx());
2901 else if (this->should_link_to_dynsym_
)
2902 oshdr
->put_sh_link(layout
->dynsym_section()->out_shndx());
2904 oshdr
->put_sh_link(this->link_
);
2906 elfcpp::Elf_Word info
;
2907 if (this->info_section_
!= NULL
)
2909 if (this->info_uses_section_index_
)
2910 info
= this->info_section_
->out_shndx();
2912 info
= this->info_section_
->symtab_index();
2914 else if (this->info_symndx_
!= NULL
)
2915 info
= this->info_symndx_
->symtab_index();
2918 oshdr
->put_sh_info(info
);
2920 oshdr
->put_sh_addralign(this->addralign_
);
2921 oshdr
->put_sh_entsize(this->entsize_
);
2924 // Write out the data. For input sections the data is written out by
2925 // Object::relocate, but we have to handle Output_section_data objects
2929 Output_section::do_write(Output_file
* of
)
2931 gold_assert(!this->requires_postprocessing());
2933 // If the target performs relaxation, we delay filler generation until now.
2934 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
2936 off_t output_section_file_offset
= this->offset();
2937 for (Fill_list::iterator p
= this->fills_
.begin();
2938 p
!= this->fills_
.end();
2941 std::string
fill_data(parameters
->target().code_fill(p
->length()));
2942 of
->write(output_section_file_offset
+ p
->section_offset(),
2943 fill_data
.data(), fill_data
.size());
2946 off_t off
= this->offset() + this->first_input_offset_
;
2947 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2948 p
!= this->input_sections_
.end();
2951 off_t aligned_off
= align_address(off
, p
->addralign());
2952 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
2954 size_t fill_len
= aligned_off
- off
;
2955 std::string
fill_data(parameters
->target().code_fill(fill_len
));
2956 of
->write(off
, fill_data
.data(), fill_data
.size());
2960 off
= aligned_off
+ p
->data_size();
2964 // If a section requires postprocessing, create the buffer to use.
2967 Output_section::create_postprocessing_buffer()
2969 gold_assert(this->requires_postprocessing());
2971 if (this->postprocessing_buffer_
!= NULL
)
2974 if (!this->input_sections_
.empty())
2976 off_t off
= this->first_input_offset_
;
2977 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2978 p
!= this->input_sections_
.end();
2981 off
= align_address(off
, p
->addralign());
2982 p
->finalize_data_size();
2983 off
+= p
->data_size();
2985 this->set_current_data_size_for_child(off
);
2988 off_t buffer_size
= this->current_data_size_for_child();
2989 this->postprocessing_buffer_
= new unsigned char[buffer_size
];
2992 // Write all the data of an Output_section into the postprocessing
2993 // buffer. This is used for sections which require postprocessing,
2994 // such as compression. Input sections are handled by
2995 // Object::Relocate.
2998 Output_section::write_to_postprocessing_buffer()
3000 gold_assert(this->requires_postprocessing());
3002 // If the target performs relaxation, we delay filler generation until now.
3003 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
3005 unsigned char* buffer
= this->postprocessing_buffer();
3006 for (Fill_list::iterator p
= this->fills_
.begin();
3007 p
!= this->fills_
.end();
3010 std::string
fill_data(parameters
->target().code_fill(p
->length()));
3011 memcpy(buffer
+ p
->section_offset(), fill_data
.data(),
3015 off_t off
= this->first_input_offset_
;
3016 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3017 p
!= this->input_sections_
.end();
3020 off_t aligned_off
= align_address(off
, p
->addralign());
3021 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
3023 size_t fill_len
= aligned_off
- off
;
3024 std::string
fill_data(parameters
->target().code_fill(fill_len
));
3025 memcpy(buffer
+ off
, fill_data
.data(), fill_data
.size());
3028 p
->write_to_buffer(buffer
+ aligned_off
);
3029 off
= aligned_off
+ p
->data_size();
3033 // Get the input sections for linker script processing. We leave
3034 // behind the Output_section_data entries. Note that this may be
3035 // slightly incorrect for merge sections. We will leave them behind,
3036 // but it is possible that the script says that they should follow
3037 // some other input sections, as in:
3038 // .rodata { *(.rodata) *(.rodata.cst*) }
3039 // For that matter, we don't handle this correctly:
3040 // .rodata { foo.o(.rodata.cst*) *(.rodata.cst*) }
3041 // With luck this will never matter.
3044 Output_section::get_input_sections(
3046 const std::string
& fill
,
3047 std::list
<Simple_input_section
>* input_sections
)
3049 if (this->checkpoint_
!= NULL
3050 && !this->checkpoint_
->input_sections_saved())
3051 this->checkpoint_
->save_input_sections();
3053 // Invalidate the relaxed input section map.
3054 this->is_relaxed_input_section_map_valid_
= false;
3056 uint64_t orig_address
= address
;
3058 address
= align_address(address
, this->addralign());
3060 Input_section_list remaining
;
3061 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3062 p
!= this->input_sections_
.end();
3065 if (p
->is_input_section())
3066 input_sections
->push_back(Simple_input_section(p
->relobj(),
3068 else if (p
->is_relaxed_input_section())
3069 input_sections
->push_back(
3070 Simple_input_section(p
->relaxed_input_section()));
3073 uint64_t aligned_address
= align_address(address
, p
->addralign());
3074 if (aligned_address
!= address
&& !fill
.empty())
3076 section_size_type length
=
3077 convert_to_section_size_type(aligned_address
- address
);
3078 std::string this_fill
;
3079 this_fill
.reserve(length
);
3080 while (this_fill
.length() + fill
.length() <= length
)
3082 if (this_fill
.length() < length
)
3083 this_fill
.append(fill
, 0, length
- this_fill
.length());
3085 Output_section_data
* posd
= new Output_data_const(this_fill
, 0);
3086 remaining
.push_back(Input_section(posd
));
3088 address
= aligned_address
;
3090 remaining
.push_back(*p
);
3092 p
->finalize_data_size();
3093 address
+= p
->data_size();
3097 this->input_sections_
.swap(remaining
);
3098 this->first_input_offset_
= 0;
3100 uint64_t data_size
= address
- orig_address
;
3101 this->set_current_data_size_for_child(data_size
);
3105 // Add an simple input section.
3108 Output_section::add_simple_input_section(const Simple_input_section
& sis
,
3112 if (addralign
> this->addralign_
)
3113 this->addralign_
= addralign
;
3115 off_t offset_in_section
= this->current_data_size_for_child();
3116 off_t aligned_offset_in_section
= align_address(offset_in_section
,
3119 this->set_current_data_size_for_child(aligned_offset_in_section
3123 (sis
.is_relaxed_input_section()
3124 ? Input_section(sis
.relaxed_input_section())
3125 : Input_section(sis
.relobj(), sis
.shndx(), data_size
, addralign
));
3126 this->input_sections_
.push_back(is
);
3129 // Save states for relaxation.
3132 Output_section::save_states()
3134 gold_assert(this->checkpoint_
== NULL
);
3135 Checkpoint_output_section
* checkpoint
=
3136 new Checkpoint_output_section(this->addralign_
, this->flags_
,
3137 this->input_sections_
,
3138 this->first_input_offset_
,
3139 this->attached_input_sections_are_sorted_
);
3140 this->checkpoint_
= checkpoint
;
3141 gold_assert(this->fills_
.empty());
3145 Output_section::discard_states()
3147 gold_assert(this->checkpoint_
!= NULL
);
3148 delete this->checkpoint_
;
3149 this->checkpoint_
= NULL
;
3150 gold_assert(this->fills_
.empty());
3152 // Simply invalidate the relaxed input section map since we do not keep
3154 this->is_relaxed_input_section_map_valid_
= false;
3158 Output_section::restore_states()
3160 gold_assert(this->checkpoint_
!= NULL
);
3161 Checkpoint_output_section
* checkpoint
= this->checkpoint_
;
3163 this->addralign_
= checkpoint
->addralign();
3164 this->flags_
= checkpoint
->flags();
3165 this->first_input_offset_
= checkpoint
->first_input_offset();
3167 if (!checkpoint
->input_sections_saved())
3169 // If we have not copied the input sections, just resize it.
3170 size_t old_size
= checkpoint
->input_sections_size();
3171 gold_assert(this->input_sections_
.size() >= old_size
);
3172 this->input_sections_
.resize(old_size
);
3176 // We need to copy the whole list. This is not efficient for
3177 // extremely large output with hundreads of thousands of input
3178 // objects. We may need to re-think how we should pass sections
3180 this->input_sections_
= *checkpoint
->input_sections();
3183 this->attached_input_sections_are_sorted_
=
3184 checkpoint
->attached_input_sections_are_sorted();
3186 // Simply invalidate the relaxed input section map since we do not keep
3188 this->is_relaxed_input_section_map_valid_
= false;
3191 // Update the section offsets of input sections in this. This is required if
3192 // relaxation causes some input sections to change sizes.
3195 Output_section::adjust_section_offsets()
3197 if (!this->section_offsets_need_adjustment_
)
3201 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3202 p
!= this->input_sections_
.end();
3205 off
= align_address(off
, p
->addralign());
3206 if (p
->is_input_section())
3207 p
->relobj()->set_section_offset(p
->shndx(), off
);
3208 off
+= p
->data_size();
3211 this->section_offsets_need_adjustment_
= false;
3214 // Print to the map file.
3217 Output_section::do_print_to_mapfile(Mapfile
* mapfile
) const
3219 mapfile
->print_output_section(this);
3221 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
3222 p
!= this->input_sections_
.end();
3224 p
->print_to_mapfile(mapfile
);
3227 // Print stats for merge sections to stderr.
3230 Output_section::print_merge_stats()
3232 Input_section_list::iterator p
;
3233 for (p
= this->input_sections_
.begin();
3234 p
!= this->input_sections_
.end();
3236 p
->print_merge_stats(this->name_
);
3239 // Output segment methods.
3241 Output_segment::Output_segment(elfcpp::Elf_Word type
, elfcpp::Elf_Word flags
)
3253 is_max_align_known_(false),
3254 are_addresses_set_(false),
3255 is_large_data_segment_(false)
3257 // The ELF ABI specifies that a PT_TLS segment always has PF_R as
3259 if (type
== elfcpp::PT_TLS
)
3260 this->flags_
= elfcpp::PF_R
;
3263 // Add an Output_section to an Output_segment.
3266 Output_segment::add_output_section(Output_section
* os
,
3267 elfcpp::Elf_Word seg_flags
,
3270 gold_assert((os
->flags() & elfcpp::SHF_ALLOC
) != 0);
3271 gold_assert(!this->is_max_align_known_
);
3272 gold_assert(os
->is_large_data_section() == this->is_large_data_segment());
3273 gold_assert(this->type() == elfcpp::PT_LOAD
|| !do_sort
);
3275 this->update_flags_for_output_section(seg_flags
);
3277 Output_segment::Output_data_list
* pdl
;
3278 if (os
->type() == elfcpp::SHT_NOBITS
)
3279 pdl
= &this->output_bss_
;
3281 pdl
= &this->output_data_
;
3283 // Note that while there may be many input sections in an output
3284 // section, there are normally only a few output sections in an
3285 // output segment. The loops below are expected to be fast.
3287 // So that PT_NOTE segments will work correctly, we need to ensure
3288 // that all SHT_NOTE sections are adjacent.
3289 if (os
->type() == elfcpp::SHT_NOTE
&& !pdl
->empty())
3291 Output_segment::Output_data_list::iterator p
= pdl
->end();
3295 if ((*p
)->is_section_type(elfcpp::SHT_NOTE
))
3302 while (p
!= pdl
->begin());
3305 // Similarly, so that PT_TLS segments will work, we need to group
3306 // SHF_TLS sections. An SHF_TLS/SHT_NOBITS section is a special
3307 // case: we group the SHF_TLS/SHT_NOBITS sections right after the
3308 // SHF_TLS/SHT_PROGBITS sections. This lets us set up PT_TLS
3309 // correctly. SHF_TLS sections get added to both a PT_LOAD segment
3310 // and the PT_TLS segment; we do this grouping only for the PT_LOAD
3312 if (this->type_
!= elfcpp::PT_TLS
3313 && (os
->flags() & elfcpp::SHF_TLS
) != 0)
3315 pdl
= &this->output_data_
;
3318 bool nobits
= os
->type() == elfcpp::SHT_NOBITS
;
3319 bool sawtls
= false;
3320 Output_segment::Output_data_list::iterator p
= pdl
->end();
3321 gold_assert(p
!= pdl
->begin());
3326 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
3329 // Put a NOBITS section after the first TLS section.
3330 // Put a PROGBITS section after the first
3331 // TLS/PROGBITS section.
3332 insert
= nobits
|| !(*p
)->is_section_type(elfcpp::SHT_NOBITS
);
3336 // If we've gone past the TLS sections, but we've
3337 // seen a TLS section, then we need to insert this
3349 while (p
!= pdl
->begin());
3352 // There are no TLS sections yet; put this one at the requested
3353 // location in the section list.
3358 // For the PT_GNU_RELRO segment, we need to group relro
3359 // sections, and we need to put them before any non-relro
3360 // sections. Any relro local sections go before relro non-local
3361 // sections. One section may be marked as the last relro
3365 gold_assert(pdl
== &this->output_data_
);
3366 Output_segment::Output_data_list::iterator p
;
3367 for (p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
3369 if (!(*p
)->is_section())
3372 Output_section
* pos
= (*p
)->output_section();
3373 if (!pos
->is_relro()
3374 || (os
->is_relro_local() && !pos
->is_relro_local())
3375 || (!os
->is_last_relro() && pos
->is_last_relro()))
3383 // One section may be marked as the first section which follows
3384 // the relro sections.
3385 if (os
->is_first_non_relro())
3387 gold_assert(pdl
== &this->output_data_
);
3388 Output_segment::Output_data_list::iterator p
;
3389 for (p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
3391 if (!(*p
)->is_section())
3394 Output_section
* pos
= (*p
)->output_section();
3395 if (!pos
->is_relro())
3404 // Small data sections go at the end of the list of data sections.
3405 // If OS is not small, and there are small sections, we have to
3406 // insert it before the first small section.
3407 if (os
->type() != elfcpp::SHT_NOBITS
3408 && !os
->is_small_section()
3410 && pdl
->back()->is_section()
3411 && pdl
->back()->output_section()->is_small_section())
3413 for (Output_segment::Output_data_list::iterator p
= pdl
->begin();
3417 if ((*p
)->is_section()
3418 && (*p
)->output_section()->is_small_section())
3427 // A small BSS section goes at the start of the BSS sections, after
3428 // other small BSS sections.
3429 if (os
->type() == elfcpp::SHT_NOBITS
&& os
->is_small_section())
3431 for (Output_segment::Output_data_list::iterator p
= pdl
->begin();
3435 if (!(*p
)->is_section()
3436 || !(*p
)->output_section()->is_small_section())
3444 // A large BSS section goes at the end of the BSS sections, which
3445 // means that one that is not large must come before the first large
3447 if (os
->type() == elfcpp::SHT_NOBITS
3448 && !os
->is_large_section()
3450 && pdl
->back()->is_section()
3451 && pdl
->back()->output_section()->is_large_section())
3453 for (Output_segment::Output_data_list::iterator p
= pdl
->begin();
3457 if ((*p
)->is_section()
3458 && (*p
)->output_section()->is_large_section())
3467 // We do some further output section sorting in order to make the
3468 // generated program run more efficiently. We should only do this
3469 // when not using a linker script, so it is controled by the DO_SORT
3473 // FreeBSD requires the .interp section to be in the first page
3474 // of the executable. That is a more efficient location anyhow
3475 // for any OS, since it means that the kernel will have the data
3476 // handy after it reads the program headers.
3477 if (os
->is_interp() && !pdl
->empty())
3479 pdl
->insert(pdl
->begin(), os
);
3483 // Put loadable non-writable notes immediately after the .interp
3484 // sections, so that the PT_NOTE segment is on the first page of
3486 if (os
->type() == elfcpp::SHT_NOTE
3487 && (os
->flags() & elfcpp::SHF_WRITE
) == 0
3490 Output_segment::Output_data_list::iterator p
= pdl
->begin();
3491 if ((*p
)->is_section() && (*p
)->output_section()->is_interp())
3497 // If this section is used by the dynamic linker, and it is not
3498 // writable, then put it first, after the .interp section and
3499 // any loadable notes. This makes it more likely that the
3500 // dynamic linker will have to read less data from the disk.
3501 if (os
->is_dynamic_linker_section()
3503 && (os
->flags() & elfcpp::SHF_WRITE
) == 0)
3505 bool is_reloc
= (os
->type() == elfcpp::SHT_REL
3506 || os
->type() == elfcpp::SHT_RELA
);
3507 Output_segment::Output_data_list::iterator p
= pdl
->begin();
3508 while (p
!= pdl
->end()
3509 && (*p
)->is_section()
3510 && ((*p
)->output_section()->is_dynamic_linker_section()
3511 || (*p
)->output_section()->type() == elfcpp::SHT_NOTE
))
3513 // Put reloc sections after the other ones. Putting the
3514 // dynamic reloc sections first confuses BFD, notably
3515 // objcopy and strip.
3517 && ((*p
)->output_section()->type() == elfcpp::SHT_REL
3518 || (*p
)->output_section()->type() == elfcpp::SHT_RELA
))
3527 // If there were no constraints on the output section, just add it
3528 // to the end of the list.
3532 // Remove an Output_section from this segment. It is an error if it
3536 Output_segment::remove_output_section(Output_section
* os
)
3538 // We only need this for SHT_PROGBITS.
3539 gold_assert(os
->type() == elfcpp::SHT_PROGBITS
);
3540 for (Output_data_list::iterator p
= this->output_data_
.begin();
3541 p
!= this->output_data_
.end();
3546 this->output_data_
.erase(p
);
3553 // Add an Output_data (which need not be an Output_section) to the
3554 // start of a segment.
3557 Output_segment::add_initial_output_data(Output_data
* od
)
3559 gold_assert(!this->is_max_align_known_
);
3560 this->output_data_
.push_front(od
);
3563 // Return whether the first data section is a relro section.
3566 Output_segment::is_first_section_relro() const
3568 return (!this->output_data_
.empty()
3569 && this->output_data_
.front()->is_section()
3570 && this->output_data_
.front()->output_section()->is_relro());
3573 // Return the maximum alignment of the Output_data in Output_segment.
3576 Output_segment::maximum_alignment()
3578 if (!this->is_max_align_known_
)
3582 addralign
= Output_segment::maximum_alignment_list(&this->output_data_
);
3583 if (addralign
> this->max_align_
)
3584 this->max_align_
= addralign
;
3586 addralign
= Output_segment::maximum_alignment_list(&this->output_bss_
);
3587 if (addralign
> this->max_align_
)
3588 this->max_align_
= addralign
;
3590 this->is_max_align_known_
= true;
3593 return this->max_align_
;
3596 // Return the maximum alignment of a list of Output_data.
3599 Output_segment::maximum_alignment_list(const Output_data_list
* pdl
)
3602 for (Output_data_list::const_iterator p
= pdl
->begin();
3606 uint64_t addralign
= (*p
)->addralign();
3607 if (addralign
> ret
)
3613 // Return the number of dynamic relocs applied to this segment.
3616 Output_segment::dynamic_reloc_count() const
3618 return (this->dynamic_reloc_count_list(&this->output_data_
)
3619 + this->dynamic_reloc_count_list(&this->output_bss_
));
3622 // Return the number of dynamic relocs applied to an Output_data_list.
3625 Output_segment::dynamic_reloc_count_list(const Output_data_list
* pdl
) const
3627 unsigned int count
= 0;
3628 for (Output_data_list::const_iterator p
= pdl
->begin();
3631 count
+= (*p
)->dynamic_reloc_count();
3635 // Set the section addresses for an Output_segment. If RESET is true,
3636 // reset the addresses first. ADDR is the address and *POFF is the
3637 // file offset. Set the section indexes starting with *PSHNDX.
3638 // Return the address of the immediately following segment. Update
3639 // *POFF and *PSHNDX.
3642 Output_segment::set_section_addresses(const Layout
* layout
, bool reset
,
3644 unsigned int increase_relro
,
3646 unsigned int* pshndx
)
3648 gold_assert(this->type_
== elfcpp::PT_LOAD
);
3650 off_t orig_off
= *poff
;
3652 // If we have relro sections, we need to pad forward now so that the
3653 // relro sections plus INCREASE_RELRO end on a common page boundary.
3654 if (parameters
->options().relro()
3655 && this->is_first_section_relro()
3656 && (!this->are_addresses_set_
|| reset
))
3658 uint64_t relro_size
= 0;
3660 for (Output_data_list::iterator p
= this->output_data_
.begin();
3661 p
!= this->output_data_
.end();
3664 if (!(*p
)->is_section())
3666 Output_section
* pos
= (*p
)->output_section();
3667 if (!pos
->is_relro())
3669 gold_assert(!(*p
)->is_section_flag_set(elfcpp::SHF_TLS
));
3670 if ((*p
)->is_address_valid())
3671 relro_size
+= (*p
)->data_size();
3674 // FIXME: This could be faster.
3675 (*p
)->set_address_and_file_offset(addr
+ relro_size
,
3677 relro_size
+= (*p
)->data_size();
3678 (*p
)->reset_address_and_file_offset();
3681 relro_size
+= increase_relro
;
3683 uint64_t page_align
= parameters
->target().common_pagesize();
3685 // Align to offset N such that (N + RELRO_SIZE) % PAGE_ALIGN == 0.
3686 uint64_t desired_align
= page_align
- (relro_size
% page_align
);
3687 if (desired_align
< *poff
% page_align
)
3688 *poff
+= page_align
- *poff
% page_align
;
3689 *poff
+= desired_align
- *poff
% page_align
;
3690 addr
+= *poff
- orig_off
;
3694 if (!reset
&& this->are_addresses_set_
)
3696 gold_assert(this->paddr_
== addr
);
3697 addr
= this->vaddr_
;
3701 this->vaddr_
= addr
;
3702 this->paddr_
= addr
;
3703 this->are_addresses_set_
= true;
3706 bool in_tls
= false;
3708 this->offset_
= orig_off
;
3710 addr
= this->set_section_list_addresses(layout
, reset
, &this->output_data_
,
3711 addr
, poff
, pshndx
, &in_tls
);
3712 this->filesz_
= *poff
- orig_off
;
3716 uint64_t ret
= this->set_section_list_addresses(layout
, reset
,
3721 // If the last section was a TLS section, align upward to the
3722 // alignment of the TLS segment, so that the overall size of the TLS
3723 // segment is aligned.
3726 uint64_t segment_align
= layout
->tls_segment()->maximum_alignment();
3727 *poff
= align_address(*poff
, segment_align
);
3730 this->memsz_
= *poff
- orig_off
;
3732 // Ignore the file offset adjustments made by the BSS Output_data
3739 // Set the addresses and file offsets in a list of Output_data
3743 Output_segment::set_section_list_addresses(const Layout
* layout
, bool reset
,
3744 Output_data_list
* pdl
,
3745 uint64_t addr
, off_t
* poff
,
3746 unsigned int* pshndx
,
3749 off_t startoff
= *poff
;
3751 off_t off
= startoff
;
3752 for (Output_data_list::iterator p
= pdl
->begin();
3757 (*p
)->reset_address_and_file_offset();
3759 // When using a linker script the section will most likely
3760 // already have an address.
3761 if (!(*p
)->is_address_valid())
3763 uint64_t align
= (*p
)->addralign();
3765 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
3767 // Give the first TLS section the alignment of the
3768 // entire TLS segment. Otherwise the TLS segment as a
3769 // whole may be misaligned.
3772 Output_segment
* tls_segment
= layout
->tls_segment();
3773 gold_assert(tls_segment
!= NULL
);
3774 uint64_t segment_align
= tls_segment
->maximum_alignment();
3775 gold_assert(segment_align
>= align
);
3776 align
= segment_align
;
3783 // If this is the first section after the TLS segment,
3784 // align it to at least the alignment of the TLS
3785 // segment, so that the size of the overall TLS segment
3789 uint64_t segment_align
=
3790 layout
->tls_segment()->maximum_alignment();
3791 if (segment_align
> align
)
3792 align
= segment_align
;
3798 off
= align_address(off
, align
);
3799 (*p
)->set_address_and_file_offset(addr
+ (off
- startoff
), off
);
3803 // The script may have inserted a skip forward, but it
3804 // better not have moved backward.
3805 if ((*p
)->address() >= addr
+ (off
- startoff
))
3806 off
+= (*p
)->address() - (addr
+ (off
- startoff
));
3809 if (!layout
->script_options()->saw_sections_clause())
3813 Output_section
* os
= (*p
)->output_section();
3815 // Cast to unsigned long long to avoid format warnings.
3816 unsigned long long previous_dot
=
3817 static_cast<unsigned long long>(addr
+ (off
- startoff
));
3818 unsigned long long dot
=
3819 static_cast<unsigned long long>((*p
)->address());
3822 gold_error(_("dot moves backward in linker script "
3823 "from 0x%llx to 0x%llx"), previous_dot
, dot
);
3825 gold_error(_("address of section '%s' moves backward "
3826 "from 0x%llx to 0x%llx"),
3827 os
->name(), previous_dot
, dot
);
3830 (*p
)->set_file_offset(off
);
3831 (*p
)->finalize_data_size();
3834 // We want to ignore the size of a SHF_TLS or SHT_NOBITS
3835 // section. Such a section does not affect the size of a
3837 if (!(*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
3838 || !(*p
)->is_section_type(elfcpp::SHT_NOBITS
))
3839 off
+= (*p
)->data_size();
3841 if ((*p
)->is_section())
3843 (*p
)->set_out_shndx(*pshndx
);
3849 return addr
+ (off
- startoff
);
3852 // For a non-PT_LOAD segment, set the offset from the sections, if
3853 // any. Add INCREASE to the file size and the memory size.
3856 Output_segment::set_offset(unsigned int increase
)
3858 gold_assert(this->type_
!= elfcpp::PT_LOAD
);
3860 gold_assert(!this->are_addresses_set_
);
3862 if (this->output_data_
.empty() && this->output_bss_
.empty())
3864 gold_assert(increase
== 0);
3867 this->are_addresses_set_
= true;
3869 this->min_p_align_
= 0;
3875 const Output_data
* first
;
3876 if (this->output_data_
.empty())
3877 first
= this->output_bss_
.front();
3879 first
= this->output_data_
.front();
3880 this->vaddr_
= first
->address();
3881 this->paddr_
= (first
->has_load_address()
3882 ? first
->load_address()
3884 this->are_addresses_set_
= true;
3885 this->offset_
= first
->offset();
3887 if (this->output_data_
.empty())
3891 const Output_data
* last_data
= this->output_data_
.back();
3892 this->filesz_
= (last_data
->address()
3893 + last_data
->data_size()
3897 const Output_data
* last
;
3898 if (this->output_bss_
.empty())
3899 last
= this->output_data_
.back();
3901 last
= this->output_bss_
.back();
3902 this->memsz_
= (last
->address()
3906 this->filesz_
+= increase
;
3907 this->memsz_
+= increase
;
3909 // If this is a TLS segment, align the memory size. The code in
3910 // set_section_list ensures that the section after the TLS segment
3911 // is aligned to give us room.
3912 if (this->type_
== elfcpp::PT_TLS
)
3914 uint64_t segment_align
= this->maximum_alignment();
3915 gold_assert(this->vaddr_
== align_address(this->vaddr_
, segment_align
));
3916 this->memsz_
= align_address(this->memsz_
, segment_align
);
3920 // Set the TLS offsets of the sections in the PT_TLS segment.
3923 Output_segment::set_tls_offsets()
3925 gold_assert(this->type_
== elfcpp::PT_TLS
);
3927 for (Output_data_list::iterator p
= this->output_data_
.begin();
3928 p
!= this->output_data_
.end();
3930 (*p
)->set_tls_offset(this->vaddr_
);
3932 for (Output_data_list::iterator p
= this->output_bss_
.begin();
3933 p
!= this->output_bss_
.end();
3935 (*p
)->set_tls_offset(this->vaddr_
);
3938 // Return the address of the first section.
3941 Output_segment::first_section_load_address() const
3943 for (Output_data_list::const_iterator p
= this->output_data_
.begin();
3944 p
!= this->output_data_
.end();
3946 if ((*p
)->is_section())
3947 return (*p
)->has_load_address() ? (*p
)->load_address() : (*p
)->address();
3949 for (Output_data_list::const_iterator p
= this->output_bss_
.begin();
3950 p
!= this->output_bss_
.end();
3952 if ((*p
)->is_section())
3953 return (*p
)->has_load_address() ? (*p
)->load_address() : (*p
)->address();
3958 // Return the number of Output_sections in an Output_segment.
3961 Output_segment::output_section_count() const
3963 return (this->output_section_count_list(&this->output_data_
)
3964 + this->output_section_count_list(&this->output_bss_
));
3967 // Return the number of Output_sections in an Output_data_list.
3970 Output_segment::output_section_count_list(const Output_data_list
* pdl
) const
3972 unsigned int count
= 0;
3973 for (Output_data_list::const_iterator p
= pdl
->begin();
3977 if ((*p
)->is_section())
3983 // Return the section attached to the list segment with the lowest
3984 // load address. This is used when handling a PHDRS clause in a
3988 Output_segment::section_with_lowest_load_address() const
3990 Output_section
* found
= NULL
;
3991 uint64_t found_lma
= 0;
3992 this->lowest_load_address_in_list(&this->output_data_
, &found
, &found_lma
);
3994 Output_section
* found_data
= found
;
3995 this->lowest_load_address_in_list(&this->output_bss_
, &found
, &found_lma
);
3996 if (found
!= found_data
&& found_data
!= NULL
)
3998 gold_error(_("nobits section %s may not precede progbits section %s "
4000 found
->name(), found_data
->name());
4007 // Look through a list for a section with a lower load address.
4010 Output_segment::lowest_load_address_in_list(const Output_data_list
* pdl
,
4011 Output_section
** found
,
4012 uint64_t* found_lma
) const
4014 for (Output_data_list::const_iterator p
= pdl
->begin();
4018 if (!(*p
)->is_section())
4020 Output_section
* os
= static_cast<Output_section
*>(*p
);
4021 uint64_t lma
= (os
->has_load_address()
4022 ? os
->load_address()
4024 if (*found
== NULL
|| lma
< *found_lma
)
4032 // Write the segment data into *OPHDR.
4034 template<int size
, bool big_endian
>
4036 Output_segment::write_header(elfcpp::Phdr_write
<size
, big_endian
>* ophdr
)
4038 ophdr
->put_p_type(this->type_
);
4039 ophdr
->put_p_offset(this->offset_
);
4040 ophdr
->put_p_vaddr(this->vaddr_
);
4041 ophdr
->put_p_paddr(this->paddr_
);
4042 ophdr
->put_p_filesz(this->filesz_
);
4043 ophdr
->put_p_memsz(this->memsz_
);
4044 ophdr
->put_p_flags(this->flags_
);
4045 ophdr
->put_p_align(std::max(this->min_p_align_
, this->maximum_alignment()));
4048 // Write the section headers into V.
4050 template<int size
, bool big_endian
>
4052 Output_segment::write_section_headers(const Layout
* layout
,
4053 const Stringpool
* secnamepool
,
4055 unsigned int *pshndx
) const
4057 // Every section that is attached to a segment must be attached to a
4058 // PT_LOAD segment, so we only write out section headers for PT_LOAD
4060 if (this->type_
!= elfcpp::PT_LOAD
)
4063 v
= this->write_section_headers_list
<size
, big_endian
>(layout
, secnamepool
,
4064 &this->output_data_
,
4066 v
= this->write_section_headers_list
<size
, big_endian
>(layout
, secnamepool
,
4072 template<int size
, bool big_endian
>
4074 Output_segment::write_section_headers_list(const Layout
* layout
,
4075 const Stringpool
* secnamepool
,
4076 const Output_data_list
* pdl
,
4078 unsigned int* pshndx
) const
4080 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
4081 for (Output_data_list::const_iterator p
= pdl
->begin();
4085 if ((*p
)->is_section())
4087 const Output_section
* ps
= static_cast<const Output_section
*>(*p
);
4088 gold_assert(*pshndx
== ps
->out_shndx());
4089 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
4090 ps
->write_header(layout
, secnamepool
, &oshdr
);
4098 // Print the output sections to the map file.
4101 Output_segment::print_sections_to_mapfile(Mapfile
* mapfile
) const
4103 if (this->type() != elfcpp::PT_LOAD
)
4105 this->print_section_list_to_mapfile(mapfile
, &this->output_data_
);
4106 this->print_section_list_to_mapfile(mapfile
, &this->output_bss_
);
4109 // Print an output section list to the map file.
4112 Output_segment::print_section_list_to_mapfile(Mapfile
* mapfile
,
4113 const Output_data_list
* pdl
) const
4115 for (Output_data_list::const_iterator p
= pdl
->begin();
4118 (*p
)->print_to_mapfile(mapfile
);
4121 // Output_file methods.
4123 Output_file::Output_file(const char* name
)
4128 map_is_anonymous_(false),
4129 is_temporary_(false)
4133 // Try to open an existing file. Returns false if the file doesn't
4134 // exist, has a size of 0 or can't be mmapped.
4137 Output_file::open_for_modification()
4139 // The name "-" means "stdout".
4140 if (strcmp(this->name_
, "-") == 0)
4143 // Don't bother opening files with a size of zero.
4145 if (::stat(this->name_
, &s
) != 0 || s
.st_size
== 0)
4148 int o
= open_descriptor(-1, this->name_
, O_RDWR
, 0);
4150 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4152 this->file_size_
= s
.st_size
;
4154 // If the file can't be mmapped, copying the content to an anonymous
4155 // map will probably negate the performance benefits of incremental
4156 // linking. This could be helped by using views and loading only
4157 // the necessary parts, but this is not supported as of now.
4158 if (!this->map_no_anonymous())
4160 release_descriptor(o
, true);
4162 this->file_size_
= 0;
4169 // Open the output file.
4172 Output_file::open(off_t file_size
)
4174 this->file_size_
= file_size
;
4176 // Unlink the file first; otherwise the open() may fail if the file
4177 // is busy (e.g. it's an executable that's currently being executed).
4179 // However, the linker may be part of a system where a zero-length
4180 // file is created for it to write to, with tight permissions (gcc
4181 // 2.95 did something like this). Unlinking the file would work
4182 // around those permission controls, so we only unlink if the file
4183 // has a non-zero size. We also unlink only regular files to avoid
4184 // trouble with directories/etc.
4186 // If we fail, continue; this command is merely a best-effort attempt
4187 // to improve the odds for open().
4189 // We let the name "-" mean "stdout"
4190 if (!this->is_temporary_
)
4192 if (strcmp(this->name_
, "-") == 0)
4193 this->o_
= STDOUT_FILENO
;
4197 if (::stat(this->name_
, &s
) == 0
4198 && (S_ISREG (s
.st_mode
) || S_ISLNK (s
.st_mode
)))
4201 ::unlink(this->name_
);
4202 else if (!parameters
->options().relocatable())
4204 // If we don't unlink the existing file, add execute
4205 // permission where read permissions already exist
4206 // and where the umask permits.
4207 int mask
= ::umask(0);
4209 s
.st_mode
|= (s
.st_mode
& 0444) >> 2;
4210 ::chmod(this->name_
, s
.st_mode
& ~mask
);
4214 int mode
= parameters
->options().relocatable() ? 0666 : 0777;
4215 int o
= open_descriptor(-1, this->name_
, O_RDWR
| O_CREAT
| O_TRUNC
,
4218 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4226 // Resize the output file.
4229 Output_file::resize(off_t file_size
)
4231 // If the mmap is mapping an anonymous memory buffer, this is easy:
4232 // just mremap to the new size. If it's mapping to a file, we want
4233 // to unmap to flush to the file, then remap after growing the file.
4234 if (this->map_is_anonymous_
)
4236 void* base
= ::mremap(this->base_
, this->file_size_
, file_size
,
4238 if (base
== MAP_FAILED
)
4239 gold_fatal(_("%s: mremap: %s"), this->name_
, strerror(errno
));
4240 this->base_
= static_cast<unsigned char*>(base
);
4241 this->file_size_
= file_size
;
4246 this->file_size_
= file_size
;
4247 if (!this->map_no_anonymous())
4248 gold_fatal(_("%s: mmap: %s"), this->name_
, strerror(errno
));
4252 // Map an anonymous block of memory which will later be written to the
4253 // file. Return whether the map succeeded.
4256 Output_file::map_anonymous()
4258 void* base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
4259 MAP_PRIVATE
| MAP_ANONYMOUS
, -1, 0);
4260 if (base
!= MAP_FAILED
)
4262 this->map_is_anonymous_
= true;
4263 this->base_
= static_cast<unsigned char*>(base
);
4269 // Map the file into memory. Return whether the mapping succeeded.
4272 Output_file::map_no_anonymous()
4274 const int o
= this->o_
;
4276 // If the output file is not a regular file, don't try to mmap it;
4277 // instead, we'll mmap a block of memory (an anonymous buffer), and
4278 // then later write the buffer to the file.
4280 struct stat statbuf
;
4281 if (o
== STDOUT_FILENO
|| o
== STDERR_FILENO
4282 || ::fstat(o
, &statbuf
) != 0
4283 || !S_ISREG(statbuf
.st_mode
)
4284 || this->is_temporary_
)
4287 // Ensure that we have disk space available for the file. If we
4288 // don't do this, it is possible that we will call munmap, close,
4289 // and exit with dirty buffers still in the cache with no assigned
4290 // disk blocks. If the disk is out of space at that point, the
4291 // output file will wind up incomplete, but we will have already
4292 // exited. The alternative to fallocate would be to use fdatasync,
4293 // but that would be a more significant performance hit.
4294 if (::posix_fallocate(o
, 0, this->file_size_
) < 0)
4295 gold_fatal(_("%s: %s"), this->name_
, strerror(errno
));
4297 // Map the file into memory.
4298 base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
4301 // The mmap call might fail because of file system issues: the file
4302 // system might not support mmap at all, or it might not support
4303 // mmap with PROT_WRITE.
4304 if (base
== MAP_FAILED
)
4307 this->map_is_anonymous_
= false;
4308 this->base_
= static_cast<unsigned char*>(base
);
4312 // Map the file into memory.
4317 if (this->map_no_anonymous())
4320 // The mmap call might fail because of file system issues: the file
4321 // system might not support mmap at all, or it might not support
4322 // mmap with PROT_WRITE. I'm not sure which errno values we will
4323 // see in all cases, so if the mmap fails for any reason and we
4324 // don't care about file contents, try for an anonymous map.
4325 if (this->map_anonymous())
4328 gold_fatal(_("%s: mmap: failed to allocate %lu bytes for output file: %s"),
4329 this->name_
, static_cast<unsigned long>(this->file_size_
),
4333 // Unmap the file from memory.
4336 Output_file::unmap()
4338 if (::munmap(this->base_
, this->file_size_
) < 0)
4339 gold_error(_("%s: munmap: %s"), this->name_
, strerror(errno
));
4343 // Close the output file.
4346 Output_file::close()
4348 // If the map isn't file-backed, we need to write it now.
4349 if (this->map_is_anonymous_
&& !this->is_temporary_
)
4351 size_t bytes_to_write
= this->file_size_
;
4353 while (bytes_to_write
> 0)
4355 ssize_t bytes_written
= ::write(this->o_
, this->base_
+ offset
,
4357 if (bytes_written
== 0)
4358 gold_error(_("%s: write: unexpected 0 return-value"), this->name_
);
4359 else if (bytes_written
< 0)
4360 gold_error(_("%s: write: %s"), this->name_
, strerror(errno
));
4363 bytes_to_write
-= bytes_written
;
4364 offset
+= bytes_written
;
4370 // We don't close stdout or stderr
4371 if (this->o_
!= STDOUT_FILENO
4372 && this->o_
!= STDERR_FILENO
4373 && !this->is_temporary_
)
4374 if (::close(this->o_
) < 0)
4375 gold_error(_("%s: close: %s"), this->name_
, strerror(errno
));
4379 // Instantiate the templates we need. We could use the configure
4380 // script to restrict this to only the ones for implemented targets.
4382 #ifdef HAVE_TARGET_32_LITTLE
4385 Output_section::add_input_section
<32, false>(
4386 Sized_relobj
<32, false>* object
,
4388 const char* secname
,
4389 const elfcpp::Shdr
<32, false>& shdr
,
4390 unsigned int reloc_shndx
,
4391 bool have_sections_script
);
4394 #ifdef HAVE_TARGET_32_BIG
4397 Output_section::add_input_section
<32, true>(
4398 Sized_relobj
<32, true>* object
,
4400 const char* secname
,
4401 const elfcpp::Shdr
<32, true>& shdr
,
4402 unsigned int reloc_shndx
,
4403 bool have_sections_script
);
4406 #ifdef HAVE_TARGET_64_LITTLE
4409 Output_section::add_input_section
<64, false>(
4410 Sized_relobj
<64, false>* object
,
4412 const char* secname
,
4413 const elfcpp::Shdr
<64, false>& shdr
,
4414 unsigned int reloc_shndx
,
4415 bool have_sections_script
);
4418 #ifdef HAVE_TARGET_64_BIG
4421 Output_section::add_input_section
<64, true>(
4422 Sized_relobj
<64, true>* object
,
4424 const char* secname
,
4425 const elfcpp::Shdr
<64, true>& shdr
,
4426 unsigned int reloc_shndx
,
4427 bool have_sections_script
);
4430 #ifdef HAVE_TARGET_32_LITTLE
4432 class Output_reloc
<elfcpp::SHT_REL
, false, 32, false>;
4435 #ifdef HAVE_TARGET_32_BIG
4437 class Output_reloc
<elfcpp::SHT_REL
, false, 32, true>;
4440 #ifdef HAVE_TARGET_64_LITTLE
4442 class Output_reloc
<elfcpp::SHT_REL
, false, 64, false>;
4445 #ifdef HAVE_TARGET_64_BIG
4447 class Output_reloc
<elfcpp::SHT_REL
, false, 64, true>;
4450 #ifdef HAVE_TARGET_32_LITTLE
4452 class Output_reloc
<elfcpp::SHT_REL
, true, 32, false>;
4455 #ifdef HAVE_TARGET_32_BIG
4457 class Output_reloc
<elfcpp::SHT_REL
, true, 32, true>;
4460 #ifdef HAVE_TARGET_64_LITTLE
4462 class Output_reloc
<elfcpp::SHT_REL
, true, 64, false>;
4465 #ifdef HAVE_TARGET_64_BIG
4467 class Output_reloc
<elfcpp::SHT_REL
, true, 64, true>;
4470 #ifdef HAVE_TARGET_32_LITTLE
4472 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
4475 #ifdef HAVE_TARGET_32_BIG
4477 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
4480 #ifdef HAVE_TARGET_64_LITTLE
4482 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
4485 #ifdef HAVE_TARGET_64_BIG
4487 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
4490 #ifdef HAVE_TARGET_32_LITTLE
4492 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
4495 #ifdef HAVE_TARGET_32_BIG
4497 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
4500 #ifdef HAVE_TARGET_64_LITTLE
4502 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
4505 #ifdef HAVE_TARGET_64_BIG
4507 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
4510 #ifdef HAVE_TARGET_32_LITTLE
4512 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, false>;
4515 #ifdef HAVE_TARGET_32_BIG
4517 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, true>;
4520 #ifdef HAVE_TARGET_64_LITTLE
4522 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, false>;
4525 #ifdef HAVE_TARGET_64_BIG
4527 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, true>;
4530 #ifdef HAVE_TARGET_32_LITTLE
4532 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, false>;
4535 #ifdef HAVE_TARGET_32_BIG
4537 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, true>;
4540 #ifdef HAVE_TARGET_64_LITTLE
4542 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, false>;
4545 #ifdef HAVE_TARGET_64_BIG
4547 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, true>;
4550 #ifdef HAVE_TARGET_32_LITTLE
4552 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
4555 #ifdef HAVE_TARGET_32_BIG
4557 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
4560 #ifdef HAVE_TARGET_64_LITTLE
4562 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
4565 #ifdef HAVE_TARGET_64_BIG
4567 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
4570 #ifdef HAVE_TARGET_32_LITTLE
4572 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
4575 #ifdef HAVE_TARGET_32_BIG
4577 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
4580 #ifdef HAVE_TARGET_64_LITTLE
4582 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
4585 #ifdef HAVE_TARGET_64_BIG
4587 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
4590 #ifdef HAVE_TARGET_32_LITTLE
4592 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, false>;
4595 #ifdef HAVE_TARGET_32_BIG
4597 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, true>;
4600 #ifdef HAVE_TARGET_64_LITTLE
4602 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, false>;
4605 #ifdef HAVE_TARGET_64_BIG
4607 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, true>;
4610 #ifdef HAVE_TARGET_32_LITTLE
4612 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, false>;
4615 #ifdef HAVE_TARGET_32_BIG
4617 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, true>;
4620 #ifdef HAVE_TARGET_64_LITTLE
4622 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, false>;
4625 #ifdef HAVE_TARGET_64_BIG
4627 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, true>;
4630 #ifdef HAVE_TARGET_32_LITTLE
4632 class Output_data_group
<32, false>;
4635 #ifdef HAVE_TARGET_32_BIG
4637 class Output_data_group
<32, true>;
4640 #ifdef HAVE_TARGET_64_LITTLE
4642 class Output_data_group
<64, false>;
4645 #ifdef HAVE_TARGET_64_BIG
4647 class Output_data_group
<64, true>;
4650 #ifdef HAVE_TARGET_32_LITTLE
4652 class Output_data_got
<32, false>;
4655 #ifdef HAVE_TARGET_32_BIG
4657 class Output_data_got
<32, true>;
4660 #ifdef HAVE_TARGET_64_LITTLE
4662 class Output_data_got
<64, false>;
4665 #ifdef HAVE_TARGET_64_BIG
4667 class Output_data_got
<64, true>;
4670 } // End namespace gold.