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 // Return the object for an input section.
1755 Output_section::Input_section::relobj() const
1757 if (this->is_input_section())
1758 return this->u2_
.object
;
1759 else if (this->is_merge_section())
1761 gold_assert(this->u2_
.pomb
->first_relobj() != NULL
);
1762 return this->u2_
.pomb
->first_relobj();
1764 else if (this->is_relaxed_input_section())
1765 return this->u2_
.poris
->relobj();
1770 // Return the input section index for an input section.
1773 Output_section::Input_section::shndx() const
1775 if (this->is_input_section())
1776 return this->shndx_
;
1777 else if (this->is_merge_section())
1779 gold_assert(this->u2_
.pomb
->first_relobj() != NULL
);
1780 return this->u2_
.pomb
->first_shndx();
1782 else if (this->is_relaxed_input_section())
1783 return this->u2_
.poris
->shndx();
1788 // Set the address and file offset.
1791 Output_section::Input_section::set_address_and_file_offset(
1794 off_t section_file_offset
)
1796 if (this->is_input_section())
1797 this->u2_
.object
->set_section_offset(this->shndx_
,
1798 file_offset
- section_file_offset
);
1800 this->u2_
.posd
->set_address_and_file_offset(address
, file_offset
);
1803 // Reset the address and file offset.
1806 Output_section::Input_section::reset_address_and_file_offset()
1808 if (!this->is_input_section())
1809 this->u2_
.posd
->reset_address_and_file_offset();
1812 // Finalize the data size.
1815 Output_section::Input_section::finalize_data_size()
1817 if (!this->is_input_section())
1818 this->u2_
.posd
->finalize_data_size();
1821 // Try to turn an input offset into an output offset. We want to
1822 // return the output offset relative to the start of this
1823 // Input_section in the output section.
1826 Output_section::Input_section::output_offset(
1827 const Relobj
* object
,
1829 section_offset_type offset
,
1830 section_offset_type
*poutput
) const
1832 if (!this->is_input_section())
1833 return this->u2_
.posd
->output_offset(object
, shndx
, offset
, poutput
);
1836 if (this->shndx_
!= shndx
|| this->u2_
.object
!= object
)
1843 // Return whether this is the merge section for the input section
1847 Output_section::Input_section::is_merge_section_for(const Relobj
* object
,
1848 unsigned int shndx
) const
1850 if (this->is_input_section())
1852 return this->u2_
.posd
->is_merge_section_for(object
, shndx
);
1855 // Write out the data. We don't have to do anything for an input
1856 // section--they are handled via Object::relocate--but this is where
1857 // we write out the data for an Output_section_data.
1860 Output_section::Input_section::write(Output_file
* of
)
1862 if (!this->is_input_section())
1863 this->u2_
.posd
->write(of
);
1866 // Write the data to a buffer. As for write(), we don't have to do
1867 // anything for an input section.
1870 Output_section::Input_section::write_to_buffer(unsigned char* buffer
)
1872 if (!this->is_input_section())
1873 this->u2_
.posd
->write_to_buffer(buffer
);
1876 // Print to a map file.
1879 Output_section::Input_section::print_to_mapfile(Mapfile
* mapfile
) const
1881 switch (this->shndx_
)
1883 case OUTPUT_SECTION_CODE
:
1884 case MERGE_DATA_SECTION_CODE
:
1885 case MERGE_STRING_SECTION_CODE
:
1886 this->u2_
.posd
->print_to_mapfile(mapfile
);
1889 case RELAXED_INPUT_SECTION_CODE
:
1891 Output_relaxed_input_section
* relaxed_section
=
1892 this->relaxed_input_section();
1893 mapfile
->print_input_section(relaxed_section
->relobj(),
1894 relaxed_section
->shndx());
1898 mapfile
->print_input_section(this->u2_
.object
, this->shndx_
);
1903 // Output_section methods.
1905 // Construct an Output_section. NAME will point into a Stringpool.
1907 Output_section::Output_section(const char* name
, elfcpp::Elf_Word type
,
1908 elfcpp::Elf_Xword flags
)
1913 link_section_(NULL
),
1915 info_section_(NULL
),
1924 first_input_offset_(0),
1926 postprocessing_buffer_(NULL
),
1927 needs_symtab_index_(false),
1928 needs_dynsym_index_(false),
1929 should_link_to_symtab_(false),
1930 should_link_to_dynsym_(false),
1931 after_input_sections_(false),
1932 requires_postprocessing_(false),
1933 found_in_sections_clause_(false),
1934 has_load_address_(false),
1935 info_uses_section_index_(false),
1936 input_section_order_specified_(false),
1937 may_sort_attached_input_sections_(false),
1938 must_sort_attached_input_sections_(false),
1939 attached_input_sections_are_sorted_(false),
1941 is_relro_local_(false),
1942 is_last_relro_(false),
1943 is_first_non_relro_(false),
1944 is_small_section_(false),
1945 is_large_section_(false),
1947 is_dynamic_linker_section_(false),
1948 generate_code_fills_at_write_(false),
1949 is_entsize_zero_(false),
1950 section_offsets_need_adjustment_(false),
1952 always_keeps_input_sections_(false),
1955 lookup_maps_(new Output_section_lookup_maps
)
1957 // An unallocated section has no address. Forcing this means that
1958 // we don't need special treatment for symbols defined in debug
1960 if ((flags
& elfcpp::SHF_ALLOC
) == 0)
1961 this->set_address(0);
1964 Output_section::~Output_section()
1966 delete this->checkpoint_
;
1969 // Set the entry size.
1972 Output_section::set_entsize(uint64_t v
)
1974 if (this->is_entsize_zero_
)
1976 else if (this->entsize_
== 0)
1978 else if (this->entsize_
!= v
)
1981 this->is_entsize_zero_
= 1;
1985 // Add the input section SHNDX, with header SHDR, named SECNAME, in
1986 // OBJECT, to the Output_section. RELOC_SHNDX is the index of a
1987 // relocation section which applies to this section, or 0 if none, or
1988 // -1U if more than one. Return the offset of the input section
1989 // within the output section. Return -1 if the input section will
1990 // receive special handling. In the normal case we don't always keep
1991 // track of input sections for an Output_section. Instead, each
1992 // Object keeps track of the Output_section for each of its input
1993 // sections. However, if HAVE_SECTIONS_SCRIPT is true, we do keep
1994 // track of input sections here; this is used when SECTIONS appears in
1997 template<int size
, bool big_endian
>
1999 Output_section::add_input_section(Layout
* layout
,
2000 Sized_relobj
<size
, big_endian
>* object
,
2002 const char* secname
,
2003 const elfcpp::Shdr
<size
, big_endian
>& shdr
,
2004 unsigned int reloc_shndx
,
2005 bool have_sections_script
)
2007 elfcpp::Elf_Xword addralign
= shdr
.get_sh_addralign();
2008 if ((addralign
& (addralign
- 1)) != 0)
2010 object
->error(_("invalid alignment %lu for section \"%s\""),
2011 static_cast<unsigned long>(addralign
), secname
);
2015 if (addralign
> this->addralign_
)
2016 this->addralign_
= addralign
;
2018 typename
elfcpp::Elf_types
<size
>::Elf_WXword sh_flags
= shdr
.get_sh_flags();
2019 uint64_t entsize
= shdr
.get_sh_entsize();
2021 // .debug_str is a mergeable string section, but is not always so
2022 // marked by compilers. Mark manually here so we can optimize.
2023 if (strcmp(secname
, ".debug_str") == 0)
2025 sh_flags
|= (elfcpp::SHF_MERGE
| elfcpp::SHF_STRINGS
);
2029 this->update_flags_for_input_section(sh_flags
);
2030 this->set_entsize(entsize
);
2032 // If this is a SHF_MERGE section, we pass all the input sections to
2033 // a Output_data_merge. We don't try to handle relocations for such
2034 // a section. We don't try to handle empty merge sections--they
2035 // mess up the mappings, and are useless anyhow.
2036 if ((sh_flags
& elfcpp::SHF_MERGE
) != 0
2038 && shdr
.get_sh_size() > 0)
2040 // Keep information about merged input sections for rebuilding fast
2041 // lookup maps if we have sections-script or we do relaxation.
2042 bool keeps_input_sections
= (this->always_keeps_input_sections_
2043 || have_sections_script
2044 || parameters
->target().may_relax());
2046 if (this->add_merge_input_section(object
, shndx
, sh_flags
, entsize
,
2047 addralign
, keeps_input_sections
))
2049 // Tell the relocation routines that they need to call the
2050 // output_offset method to determine the final address.
2055 off_t offset_in_section
= this->current_data_size_for_child();
2056 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2059 // Determine if we want to delay code-fill generation until the output
2060 // section is written. When the target is relaxing, we want to delay fill
2061 // generating to avoid adjusting them during relaxation.
2062 if (!this->generate_code_fills_at_write_
2063 && !have_sections_script
2064 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2065 && parameters
->target().has_code_fill()
2066 && parameters
->target().may_relax())
2068 gold_assert(this->fills_
.empty());
2069 this->generate_code_fills_at_write_
= true;
2072 if (aligned_offset_in_section
> offset_in_section
2073 && !this->generate_code_fills_at_write_
2074 && !have_sections_script
2075 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2076 && parameters
->target().has_code_fill())
2078 // We need to add some fill data. Using fill_list_ when
2079 // possible is an optimization, since we will often have fill
2080 // sections without input sections.
2081 off_t fill_len
= aligned_offset_in_section
- offset_in_section
;
2082 if (this->input_sections_
.empty())
2083 this->fills_
.push_back(Fill(offset_in_section
, fill_len
));
2086 std::string
fill_data(parameters
->target().code_fill(fill_len
));
2087 Output_data_const
* odc
= new Output_data_const(fill_data
, 1);
2088 this->input_sections_
.push_back(Input_section(odc
));
2092 section_size_type input_section_size
= shdr
.get_sh_size();
2093 section_size_type uncompressed_size
;
2094 if (object
->section_is_compressed(shndx
, &uncompressed_size
))
2095 input_section_size
= uncompressed_size
;
2097 this->set_current_data_size_for_child(aligned_offset_in_section
2098 + input_section_size
);
2100 // We need to keep track of this section if we are already keeping
2101 // track of sections, or if we are relaxing. Also, if this is a
2102 // section which requires sorting, or which may require sorting in
2103 // the future, we keep track of the sections. If the
2104 // --section-ordering-file option is used to specify the order of
2105 // sections, we need to keep track of sections.
2106 if (this->always_keeps_input_sections_
2107 || have_sections_script
2108 || !this->input_sections_
.empty()
2109 || this->may_sort_attached_input_sections()
2110 || this->must_sort_attached_input_sections()
2111 || parameters
->options().user_set_Map()
2112 || parameters
->target().may_relax()
2113 || parameters
->options().section_ordering_file())
2115 Input_section
isecn(object
, shndx
, shdr
.get_sh_size(), addralign
);
2116 if (parameters
->options().section_ordering_file())
2118 unsigned int section_order_index
=
2119 layout
->find_section_order_index(std::string(secname
));
2120 if (section_order_index
!= 0)
2122 isecn
.set_section_order_index(section_order_index
);
2123 this->set_input_section_order_specified();
2126 this->input_sections_
.push_back(isecn
);
2129 return aligned_offset_in_section
;
2132 // Add arbitrary data to an output section.
2135 Output_section::add_output_section_data(Output_section_data
* posd
)
2137 Input_section
inp(posd
);
2138 this->add_output_section_data(&inp
);
2140 if (posd
->is_data_size_valid())
2142 off_t offset_in_section
= this->current_data_size_for_child();
2143 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2145 this->set_current_data_size_for_child(aligned_offset_in_section
2146 + posd
->data_size());
2150 // Add a relaxed input section.
2153 Output_section::add_relaxed_input_section(Output_relaxed_input_section
* poris
)
2155 Input_section
inp(poris
);
2156 this->add_output_section_data(&inp
);
2157 if (this->lookup_maps_
->is_valid())
2158 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2159 poris
->shndx(), poris
);
2161 // For a relaxed section, we use the current data size. Linker scripts
2162 // get all the input sections, including relaxed one from an output
2163 // section and add them back to them same output section to compute the
2164 // output section size. If we do not account for sizes of relaxed input
2165 // sections, an output section would be incorrectly sized.
2166 off_t offset_in_section
= this->current_data_size_for_child();
2167 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2168 poris
->addralign());
2169 this->set_current_data_size_for_child(aligned_offset_in_section
2170 + poris
->current_data_size());
2173 // Add arbitrary data to an output section by Input_section.
2176 Output_section::add_output_section_data(Input_section
* inp
)
2178 if (this->input_sections_
.empty())
2179 this->first_input_offset_
= this->current_data_size_for_child();
2181 this->input_sections_
.push_back(*inp
);
2183 uint64_t addralign
= inp
->addralign();
2184 if (addralign
> this->addralign_
)
2185 this->addralign_
= addralign
;
2187 inp
->set_output_section(this);
2190 // Add a merge section to an output section.
2193 Output_section::add_output_merge_section(Output_section_data
* posd
,
2194 bool is_string
, uint64_t entsize
)
2196 Input_section
inp(posd
, is_string
, entsize
);
2197 this->add_output_section_data(&inp
);
2200 // Add an input section to a SHF_MERGE section.
2203 Output_section::add_merge_input_section(Relobj
* object
, unsigned int shndx
,
2204 uint64_t flags
, uint64_t entsize
,
2206 bool keeps_input_sections
)
2208 bool is_string
= (flags
& elfcpp::SHF_STRINGS
) != 0;
2210 // We only merge strings if the alignment is not more than the
2211 // character size. This could be handled, but it's unusual.
2212 if (is_string
&& addralign
> entsize
)
2215 // We cannot restore merged input section states.
2216 gold_assert(this->checkpoint_
== NULL
);
2218 // Look up merge sections by required properties.
2219 // Currently, we only invalidate the lookup maps in script processing
2220 // and relaxation. We should not have done either when we reach here.
2221 // So we assume that the lookup maps are valid to simply code.
2222 gold_assert(this->lookup_maps_
->is_valid());
2223 Merge_section_properties
msp(is_string
, entsize
, addralign
);
2224 Output_merge_base
* pomb
= this->lookup_maps_
->find_merge_section(msp
);
2225 bool is_new
= false;
2228 gold_assert(pomb
->is_string() == is_string
2229 && pomb
->entsize() == entsize
2230 && pomb
->addralign() == addralign
);
2234 // Create a new Output_merge_data or Output_merge_string_data.
2236 pomb
= new Output_merge_data(entsize
, addralign
);
2242 pomb
= new Output_merge_string
<char>(addralign
);
2245 pomb
= new Output_merge_string
<uint16_t>(addralign
);
2248 pomb
= new Output_merge_string
<uint32_t>(addralign
);
2254 // If we need to do script processing or relaxation, we need to keep
2255 // the original input sections to rebuild the fast lookup maps.
2256 if (keeps_input_sections
)
2257 pomb
->set_keeps_input_sections();
2261 if (pomb
->add_input_section(object
, shndx
))
2263 // Add new merge section to this output section and link merge
2264 // section properties to new merge section in map.
2267 this->add_output_merge_section(pomb
, is_string
, entsize
);
2268 this->lookup_maps_
->add_merge_section(msp
, pomb
);
2271 // Add input section to new merge section and link input section to new
2272 // merge section in map.
2273 this->lookup_maps_
->add_merge_input_section(object
, shndx
, pomb
);
2278 // If add_input_section failed, delete new merge section to avoid
2279 // exporting empty merge sections in Output_section::get_input_section.
2286 // Build a relaxation map to speed up relaxation of existing input sections.
2287 // Look up to the first LIMIT elements in INPUT_SECTIONS.
2290 Output_section::build_relaxation_map(
2291 const Input_section_list
& input_sections
,
2293 Relaxation_map
* relaxation_map
) const
2295 for (size_t i
= 0; i
< limit
; ++i
)
2297 const Input_section
& is(input_sections
[i
]);
2298 if (is
.is_input_section() || is
.is_relaxed_input_section())
2300 Section_id
sid(is
.relobj(), is
.shndx());
2301 (*relaxation_map
)[sid
] = i
;
2306 // Convert regular input sections in INPUT_SECTIONS into relaxed input
2307 // sections in RELAXED_SECTIONS. MAP is a prebuilt map from section id
2308 // indices of INPUT_SECTIONS.
2311 Output_section::convert_input_sections_in_list_to_relaxed_sections(
2312 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
,
2313 const Relaxation_map
& map
,
2314 Input_section_list
* input_sections
)
2316 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2318 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2319 Section_id
sid(poris
->relobj(), poris
->shndx());
2320 Relaxation_map::const_iterator p
= map
.find(sid
);
2321 gold_assert(p
!= map
.end());
2322 gold_assert((*input_sections
)[p
->second
].is_input_section());
2323 (*input_sections
)[p
->second
] = Input_section(poris
);
2327 // Convert regular input sections into relaxed input sections. RELAXED_SECTIONS
2328 // is a vector of pointers to Output_relaxed_input_section or its derived
2329 // classes. The relaxed sections must correspond to existing input sections.
2332 Output_section::convert_input_sections_to_relaxed_sections(
2333 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
)
2335 gold_assert(parameters
->target().may_relax());
2337 // We want to make sure that restore_states does not undo the effect of
2338 // this. If there is no checkpoint active, just search the current
2339 // input section list and replace the sections there. If there is
2340 // a checkpoint, also replace the sections there.
2342 // By default, we look at the whole list.
2343 size_t limit
= this->input_sections_
.size();
2345 if (this->checkpoint_
!= NULL
)
2347 // Replace input sections with relaxed input section in the saved
2348 // copy of the input section list.
2349 if (this->checkpoint_
->input_sections_saved())
2352 this->build_relaxation_map(
2353 *(this->checkpoint_
->input_sections()),
2354 this->checkpoint_
->input_sections()->size(),
2356 this->convert_input_sections_in_list_to_relaxed_sections(
2359 this->checkpoint_
->input_sections());
2363 // We have not copied the input section list yet. Instead, just
2364 // look at the portion that would be saved.
2365 limit
= this->checkpoint_
->input_sections_size();
2369 // Convert input sections in input_section_list.
2371 this->build_relaxation_map(this->input_sections_
, limit
, &map
);
2372 this->convert_input_sections_in_list_to_relaxed_sections(
2375 &this->input_sections_
);
2377 // Update fast look-up map.
2378 if (this->lookup_maps_
->is_valid())
2379 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2381 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2382 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2383 poris
->shndx(), poris
);
2387 // Update the output section flags based on input section flags.
2390 Output_section::update_flags_for_input_section(elfcpp::Elf_Xword flags
)
2392 // If we created the section with SHF_ALLOC clear, we set the
2393 // address. If we are now setting the SHF_ALLOC flag, we need to
2395 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0
2396 && (flags
& elfcpp::SHF_ALLOC
) != 0)
2397 this->mark_address_invalid();
2399 this->flags_
|= (flags
2400 & (elfcpp::SHF_WRITE
2402 | elfcpp::SHF_EXECINSTR
));
2404 if ((flags
& elfcpp::SHF_MERGE
) == 0)
2405 this->flags_
&=~ elfcpp::SHF_MERGE
;
2408 if (this->current_data_size_for_child() == 0)
2409 this->flags_
|= elfcpp::SHF_MERGE
;
2412 if ((flags
& elfcpp::SHF_STRINGS
) == 0)
2413 this->flags_
&=~ elfcpp::SHF_STRINGS
;
2416 if (this->current_data_size_for_child() == 0)
2417 this->flags_
|= elfcpp::SHF_STRINGS
;
2421 // Find the merge section into which an input section with index SHNDX in
2422 // OBJECT has been added. Return NULL if none found.
2424 Output_section_data
*
2425 Output_section::find_merge_section(const Relobj
* object
,
2426 unsigned int shndx
) const
2428 if (!this->lookup_maps_
->is_valid())
2429 this->build_lookup_maps();
2430 return this->lookup_maps_
->find_merge_section(object
, shndx
);
2433 // Build the lookup maps for merge and relaxed sections. This is needs
2434 // to be declared as a const methods so that it is callable with a const
2435 // Output_section pointer. The method only updates states of the maps.
2438 Output_section::build_lookup_maps() const
2440 this->lookup_maps_
->clear();
2441 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2442 p
!= this->input_sections_
.end();
2445 if (p
->is_merge_section())
2447 Output_merge_base
* pomb
= p
->output_merge_base();
2448 Merge_section_properties
msp(pomb
->is_string(), pomb
->entsize(),
2450 this->lookup_maps_
->add_merge_section(msp
, pomb
);
2451 for (Output_merge_base::Input_sections::const_iterator is
=
2452 pomb
->input_sections_begin();
2453 is
!= pomb
->input_sections_end();
2456 const Const_section_id
& csid
= *is
;
2457 this->lookup_maps_
->add_merge_input_section(csid
.first
,
2462 else if (p
->is_relaxed_input_section())
2464 Output_relaxed_input_section
* poris
= p
->relaxed_input_section();
2465 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2466 poris
->shndx(), poris
);
2471 // Find an relaxed input section corresponding to an input section
2472 // in OBJECT with index SHNDX.
2474 const Output_relaxed_input_section
*
2475 Output_section::find_relaxed_input_section(const Relobj
* object
,
2476 unsigned int shndx
) const
2478 if (!this->lookup_maps_
->is_valid())
2479 this->build_lookup_maps();
2480 return this->lookup_maps_
->find_relaxed_input_section(object
, shndx
);
2483 // Given an address OFFSET relative to the start of input section
2484 // SHNDX in OBJECT, return whether this address is being included in
2485 // the final link. This should only be called if SHNDX in OBJECT has
2486 // a special mapping.
2489 Output_section::is_input_address_mapped(const Relobj
* object
,
2493 // Look at the Output_section_data_maps first.
2494 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2496 posd
= this->find_relaxed_input_section(object
, shndx
);
2500 section_offset_type output_offset
;
2501 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2503 return output_offset
!= -1;
2506 // Fall back to the slow look-up.
2507 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2508 p
!= this->input_sections_
.end();
2511 section_offset_type output_offset
;
2512 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2513 return output_offset
!= -1;
2516 // By default we assume that the address is mapped. This should
2517 // only be called after we have passed all sections to Layout. At
2518 // that point we should know what we are discarding.
2522 // Given an address OFFSET relative to the start of input section
2523 // SHNDX in object OBJECT, return the output offset relative to the
2524 // start of the input section in the output section. This should only
2525 // be called if SHNDX in OBJECT has a special mapping.
2528 Output_section::output_offset(const Relobj
* object
, unsigned int shndx
,
2529 section_offset_type offset
) const
2531 // This can only be called meaningfully when we know the data size
2533 gold_assert(this->is_data_size_valid());
2535 // Look at the Output_section_data_maps first.
2536 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2538 posd
= this->find_relaxed_input_section(object
, shndx
);
2541 section_offset_type output_offset
;
2542 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2544 return output_offset
;
2547 // Fall back to the slow look-up.
2548 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2549 p
!= this->input_sections_
.end();
2552 section_offset_type output_offset
;
2553 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2554 return output_offset
;
2559 // Return the output virtual address of OFFSET relative to the start
2560 // of input section SHNDX in object OBJECT.
2563 Output_section::output_address(const Relobj
* object
, unsigned int shndx
,
2566 uint64_t addr
= this->address() + this->first_input_offset_
;
2568 // Look at the Output_section_data_maps first.
2569 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2571 posd
= this->find_relaxed_input_section(object
, shndx
);
2572 if (posd
!= NULL
&& posd
->is_address_valid())
2574 section_offset_type output_offset
;
2575 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2577 return posd
->address() + output_offset
;
2580 // Fall back to the slow look-up.
2581 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2582 p
!= this->input_sections_
.end();
2585 addr
= align_address(addr
, p
->addralign());
2586 section_offset_type output_offset
;
2587 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2589 if (output_offset
== -1)
2591 return addr
+ output_offset
;
2593 addr
+= p
->data_size();
2596 // If we get here, it means that we don't know the mapping for this
2597 // input section. This might happen in principle if
2598 // add_input_section were called before add_output_section_data.
2599 // But it should never actually happen.
2604 // Find the output address of the start of the merged section for
2605 // input section SHNDX in object OBJECT.
2608 Output_section::find_starting_output_address(const Relobj
* object
,
2610 uint64_t* paddr
) const
2612 // FIXME: This becomes a bottle-neck if we have many relaxed sections.
2613 // Looking up the merge section map does not always work as we sometimes
2614 // find a merge section without its address set.
2615 uint64_t addr
= this->address() + this->first_input_offset_
;
2616 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2617 p
!= this->input_sections_
.end();
2620 addr
= align_address(addr
, p
->addralign());
2622 // It would be nice if we could use the existing output_offset
2623 // method to get the output offset of input offset 0.
2624 // Unfortunately we don't know for sure that input offset 0 is
2626 if (p
->is_merge_section_for(object
, shndx
))
2632 addr
+= p
->data_size();
2635 // We couldn't find a merge output section for this input section.
2639 // Set the data size of an Output_section. This is where we handle
2640 // setting the addresses of any Output_section_data objects.
2643 Output_section::set_final_data_size()
2645 if (this->input_sections_
.empty())
2647 this->set_data_size(this->current_data_size_for_child());
2651 if (this->must_sort_attached_input_sections()
2652 || this->input_section_order_specified())
2653 this->sort_attached_input_sections();
2655 uint64_t address
= this->address();
2656 off_t startoff
= this->offset();
2657 off_t off
= startoff
+ this->first_input_offset_
;
2658 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2659 p
!= this->input_sections_
.end();
2662 off
= align_address(off
, p
->addralign());
2663 p
->set_address_and_file_offset(address
+ (off
- startoff
), off
,
2665 off
+= p
->data_size();
2668 this->set_data_size(off
- startoff
);
2671 // Reset the address and file offset.
2674 Output_section::do_reset_address_and_file_offset()
2676 // An unallocated section has no address. Forcing this means that
2677 // we don't need special treatment for symbols defined in debug
2678 // sections. We do the same in the constructor. This does not
2679 // apply to NOLOAD sections though.
2680 if (((this->flags_
& elfcpp::SHF_ALLOC
) == 0) && !this->is_noload_
)
2681 this->set_address(0);
2683 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2684 p
!= this->input_sections_
.end();
2686 p
->reset_address_and_file_offset();
2689 // Return true if address and file offset have the values after reset.
2692 Output_section::do_address_and_file_offset_have_reset_values() const
2694 if (this->is_offset_valid())
2697 // An unallocated section has address 0 after its construction or a reset.
2698 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0)
2699 return this->is_address_valid() && this->address() == 0;
2701 return !this->is_address_valid();
2704 // Set the TLS offset. Called only for SHT_TLS sections.
2707 Output_section::do_set_tls_offset(uint64_t tls_base
)
2709 this->tls_offset_
= this->address() - tls_base
;
2712 // In a few cases we need to sort the input sections attached to an
2713 // output section. This is used to implement the type of constructor
2714 // priority ordering implemented by the GNU linker, in which the
2715 // priority becomes part of the section name and the sections are
2716 // sorted by name. We only do this for an output section if we see an
2717 // attached input section matching ".ctor.*", ".dtor.*",
2718 // ".init_array.*" or ".fini_array.*".
2720 class Output_section::Input_section_sort_entry
2723 Input_section_sort_entry()
2724 : input_section_(), index_(-1U), section_has_name_(false),
2728 Input_section_sort_entry(const Input_section
& input_section
,
2730 bool must_sort_attached_input_sections
)
2731 : input_section_(input_section
), index_(index
),
2732 section_has_name_(input_section
.is_input_section()
2733 || input_section
.is_relaxed_input_section())
2735 if (this->section_has_name_
2736 && must_sort_attached_input_sections
)
2738 // This is only called single-threaded from Layout::finalize,
2739 // so it is OK to lock. Unfortunately we have no way to pass
2741 const Task
* dummy_task
= reinterpret_cast<const Task
*>(-1);
2742 Object
* obj
= (input_section
.is_input_section()
2743 ? input_section
.relobj()
2744 : input_section
.relaxed_input_section()->relobj());
2745 Task_lock_obj
<Object
> tl(dummy_task
, obj
);
2747 // This is a slow operation, which should be cached in
2748 // Layout::layout if this becomes a speed problem.
2749 this->section_name_
= obj
->section_name(input_section
.shndx());
2753 // Return the Input_section.
2754 const Input_section
&
2755 input_section() const
2757 gold_assert(this->index_
!= -1U);
2758 return this->input_section_
;
2761 // The index of this entry in the original list. This is used to
2762 // make the sort stable.
2766 gold_assert(this->index_
!= -1U);
2767 return this->index_
;
2770 // Whether there is a section name.
2772 section_has_name() const
2773 { return this->section_has_name_
; }
2775 // The section name.
2777 section_name() const
2779 gold_assert(this->section_has_name_
);
2780 return this->section_name_
;
2783 // Return true if the section name has a priority. This is assumed
2784 // to be true if it has a dot after the initial dot.
2786 has_priority() const
2788 gold_assert(this->section_has_name_
);
2789 return this->section_name_
.find('.', 1) != std::string::npos
;
2792 // Return true if this an input file whose base name matches
2793 // FILE_NAME. The base name must have an extension of ".o", and
2794 // must be exactly FILE_NAME.o or FILE_NAME, one character, ".o".
2795 // This is to match crtbegin.o as well as crtbeginS.o without
2796 // getting confused by other possibilities. Overall matching the
2797 // file name this way is a dreadful hack, but the GNU linker does it
2798 // in order to better support gcc, and we need to be compatible.
2800 match_file_name(const char* match_file_name
) const
2802 const std::string
& file_name(this->input_section_
.relobj()->name());
2803 const char* base_name
= lbasename(file_name
.c_str());
2804 size_t match_len
= strlen(match_file_name
);
2805 if (strncmp(base_name
, match_file_name
, match_len
) != 0)
2807 size_t base_len
= strlen(base_name
);
2808 if (base_len
!= match_len
+ 2 && base_len
!= match_len
+ 3)
2810 return memcmp(base_name
+ base_len
- 2, ".o", 2) == 0;
2813 // Returns 1 if THIS should appear before S in section order, -1 if S
2814 // appears before THIS and 0 if they are not comparable.
2816 compare_section_ordering(const Input_section_sort_entry
& s
) const
2818 unsigned int this_secn_index
= this->input_section_
.section_order_index();
2819 unsigned int s_secn_index
= s
.input_section().section_order_index();
2820 if (this_secn_index
> 0 && s_secn_index
> 0)
2822 if (this_secn_index
< s_secn_index
)
2824 else if (this_secn_index
> s_secn_index
)
2831 // The Input_section we are sorting.
2832 Input_section input_section_
;
2833 // The index of this Input_section in the original list.
2834 unsigned int index_
;
2835 // Whether this Input_section has a section name--it won't if this
2836 // is some random Output_section_data.
2837 bool section_has_name_
;
2838 // The section name if there is one.
2839 std::string section_name_
;
2842 // Return true if S1 should come before S2 in the output section.
2845 Output_section::Input_section_sort_compare::operator()(
2846 const Output_section::Input_section_sort_entry
& s1
,
2847 const Output_section::Input_section_sort_entry
& s2
) const
2849 // crtbegin.o must come first.
2850 bool s1_begin
= s1
.match_file_name("crtbegin");
2851 bool s2_begin
= s2
.match_file_name("crtbegin");
2852 if (s1_begin
|| s2_begin
)
2858 return s1
.index() < s2
.index();
2861 // crtend.o must come last.
2862 bool s1_end
= s1
.match_file_name("crtend");
2863 bool s2_end
= s2
.match_file_name("crtend");
2864 if (s1_end
|| s2_end
)
2870 return s1
.index() < s2
.index();
2873 // We sort all the sections with no names to the end.
2874 if (!s1
.section_has_name() || !s2
.section_has_name())
2876 if (s1
.section_has_name())
2878 if (s2
.section_has_name())
2880 return s1
.index() < s2
.index();
2883 // A section with a priority follows a section without a priority.
2884 bool s1_has_priority
= s1
.has_priority();
2885 bool s2_has_priority
= s2
.has_priority();
2886 if (s1_has_priority
&& !s2_has_priority
)
2888 if (!s1_has_priority
&& s2_has_priority
)
2891 // Check if a section order exists for these sections through a section
2892 // ordering file. If sequence_num is 0, an order does not exist.
2893 int sequence_num
= s1
.compare_section_ordering(s2
);
2894 if (sequence_num
!= 0)
2895 return sequence_num
== 1;
2897 // Otherwise we sort by name.
2898 int compare
= s1
.section_name().compare(s2
.section_name());
2902 // Otherwise we keep the input order.
2903 return s1
.index() < s2
.index();
2906 // Return true if S1 should come before S2 in an .init_array or .fini_array
2910 Output_section::Input_section_sort_init_fini_compare::operator()(
2911 const Output_section::Input_section_sort_entry
& s1
,
2912 const Output_section::Input_section_sort_entry
& s2
) const
2914 // We sort all the sections with no names to the end.
2915 if (!s1
.section_has_name() || !s2
.section_has_name())
2917 if (s1
.section_has_name())
2919 if (s2
.section_has_name())
2921 return s1
.index() < s2
.index();
2924 // A section without a priority follows a section with a priority.
2925 // This is the reverse of .ctors and .dtors sections.
2926 bool s1_has_priority
= s1
.has_priority();
2927 bool s2_has_priority
= s2
.has_priority();
2928 if (s1_has_priority
&& !s2_has_priority
)
2930 if (!s1_has_priority
&& s2_has_priority
)
2933 // Check if a section order exists for these sections through a section
2934 // ordering file. If sequence_num is 0, an order does not exist.
2935 int sequence_num
= s1
.compare_section_ordering(s2
);
2936 if (sequence_num
!= 0)
2937 return sequence_num
== 1;
2939 // Otherwise we sort by name.
2940 int compare
= s1
.section_name().compare(s2
.section_name());
2944 // Otherwise we keep the input order.
2945 return s1
.index() < s2
.index();
2948 // Return true if S1 should come before S2. Sections that do not match
2949 // any pattern in the section ordering file are placed ahead of the sections
2950 // that match some pattern.
2953 Output_section::Input_section_sort_section_order_index_compare::operator()(
2954 const Output_section::Input_section_sort_entry
& s1
,
2955 const Output_section::Input_section_sort_entry
& s2
) const
2957 unsigned int s1_secn_index
= s1
.input_section().section_order_index();
2958 unsigned int s2_secn_index
= s2
.input_section().section_order_index();
2960 // Keep input order if section ordering cannot determine order.
2961 if (s1_secn_index
== s2_secn_index
)
2962 return s1
.index() < s2
.index();
2964 return s1_secn_index
< s2_secn_index
;
2967 // Sort the input sections attached to an output section.
2970 Output_section::sort_attached_input_sections()
2972 if (this->attached_input_sections_are_sorted_
)
2975 if (this->checkpoint_
!= NULL
2976 && !this->checkpoint_
->input_sections_saved())
2977 this->checkpoint_
->save_input_sections();
2979 // The only thing we know about an input section is the object and
2980 // the section index. We need the section name. Recomputing this
2981 // is slow but this is an unusual case. If this becomes a speed
2982 // problem we can cache the names as required in Layout::layout.
2984 // We start by building a larger vector holding a copy of each
2985 // Input_section, plus its current index in the list and its name.
2986 std::vector
<Input_section_sort_entry
> sort_list
;
2989 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2990 p
!= this->input_sections_
.end();
2992 sort_list
.push_back(Input_section_sort_entry(*p
, i
,
2993 this->must_sort_attached_input_sections()));
2995 // Sort the input sections.
2996 if (this->must_sort_attached_input_sections())
2998 if (this->type() == elfcpp::SHT_PREINIT_ARRAY
2999 || this->type() == elfcpp::SHT_INIT_ARRAY
3000 || this->type() == elfcpp::SHT_FINI_ARRAY
)
3001 std::sort(sort_list
.begin(), sort_list
.end(),
3002 Input_section_sort_init_fini_compare());
3004 std::sort(sort_list
.begin(), sort_list
.end(),
3005 Input_section_sort_compare());
3009 gold_assert(parameters
->options().section_ordering_file());
3010 std::sort(sort_list
.begin(), sort_list
.end(),
3011 Input_section_sort_section_order_index_compare());
3014 // Copy the sorted input sections back to our list.
3015 this->input_sections_
.clear();
3016 for (std::vector
<Input_section_sort_entry
>::iterator p
= sort_list
.begin();
3017 p
!= sort_list
.end();
3019 this->input_sections_
.push_back(p
->input_section());
3022 // Remember that we sorted the input sections, since we might get
3024 this->attached_input_sections_are_sorted_
= true;
3027 // Write the section header to *OSHDR.
3029 template<int size
, bool big_endian
>
3031 Output_section::write_header(const Layout
* layout
,
3032 const Stringpool
* secnamepool
,
3033 elfcpp::Shdr_write
<size
, big_endian
>* oshdr
) const
3035 oshdr
->put_sh_name(secnamepool
->get_offset(this->name_
));
3036 oshdr
->put_sh_type(this->type_
);
3038 elfcpp::Elf_Xword flags
= this->flags_
;
3039 if (this->info_section_
!= NULL
&& this->info_uses_section_index_
)
3040 flags
|= elfcpp::SHF_INFO_LINK
;
3041 oshdr
->put_sh_flags(flags
);
3043 oshdr
->put_sh_addr(this->address());
3044 oshdr
->put_sh_offset(this->offset());
3045 oshdr
->put_sh_size(this->data_size());
3046 if (this->link_section_
!= NULL
)
3047 oshdr
->put_sh_link(this->link_section_
->out_shndx());
3048 else if (this->should_link_to_symtab_
)
3049 oshdr
->put_sh_link(layout
->symtab_section()->out_shndx());
3050 else if (this->should_link_to_dynsym_
)
3051 oshdr
->put_sh_link(layout
->dynsym_section()->out_shndx());
3053 oshdr
->put_sh_link(this->link_
);
3055 elfcpp::Elf_Word info
;
3056 if (this->info_section_
!= NULL
)
3058 if (this->info_uses_section_index_
)
3059 info
= this->info_section_
->out_shndx();
3061 info
= this->info_section_
->symtab_index();
3063 else if (this->info_symndx_
!= NULL
)
3064 info
= this->info_symndx_
->symtab_index();
3067 oshdr
->put_sh_info(info
);
3069 oshdr
->put_sh_addralign(this->addralign_
);
3070 oshdr
->put_sh_entsize(this->entsize_
);
3073 // Write out the data. For input sections the data is written out by
3074 // Object::relocate, but we have to handle Output_section_data objects
3078 Output_section::do_write(Output_file
* of
)
3080 gold_assert(!this->requires_postprocessing());
3082 // If the target performs relaxation, we delay filler generation until now.
3083 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
3085 off_t output_section_file_offset
= this->offset();
3086 for (Fill_list::iterator p
= this->fills_
.begin();
3087 p
!= this->fills_
.end();
3090 std::string
fill_data(parameters
->target().code_fill(p
->length()));
3091 of
->write(output_section_file_offset
+ p
->section_offset(),
3092 fill_data
.data(), fill_data
.size());
3095 off_t off
= this->offset() + this->first_input_offset_
;
3096 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3097 p
!= this->input_sections_
.end();
3100 off_t aligned_off
= align_address(off
, p
->addralign());
3101 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
3103 size_t fill_len
= aligned_off
- off
;
3104 std::string
fill_data(parameters
->target().code_fill(fill_len
));
3105 of
->write(off
, fill_data
.data(), fill_data
.size());
3109 off
= aligned_off
+ p
->data_size();
3113 // If a section requires postprocessing, create the buffer to use.
3116 Output_section::create_postprocessing_buffer()
3118 gold_assert(this->requires_postprocessing());
3120 if (this->postprocessing_buffer_
!= NULL
)
3123 if (!this->input_sections_
.empty())
3125 off_t off
= this->first_input_offset_
;
3126 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3127 p
!= this->input_sections_
.end();
3130 off
= align_address(off
, p
->addralign());
3131 p
->finalize_data_size();
3132 off
+= p
->data_size();
3134 this->set_current_data_size_for_child(off
);
3137 off_t buffer_size
= this->current_data_size_for_child();
3138 this->postprocessing_buffer_
= new unsigned char[buffer_size
];
3141 // Write all the data of an Output_section into the postprocessing
3142 // buffer. This is used for sections which require postprocessing,
3143 // such as compression. Input sections are handled by
3144 // Object::Relocate.
3147 Output_section::write_to_postprocessing_buffer()
3149 gold_assert(this->requires_postprocessing());
3151 // If the target performs relaxation, we delay filler generation until now.
3152 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
3154 unsigned char* buffer
= this->postprocessing_buffer();
3155 for (Fill_list::iterator p
= this->fills_
.begin();
3156 p
!= this->fills_
.end();
3159 std::string
fill_data(parameters
->target().code_fill(p
->length()));
3160 memcpy(buffer
+ p
->section_offset(), fill_data
.data(),
3164 off_t off
= this->first_input_offset_
;
3165 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3166 p
!= this->input_sections_
.end();
3169 off_t aligned_off
= align_address(off
, p
->addralign());
3170 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
3172 size_t fill_len
= aligned_off
- off
;
3173 std::string
fill_data(parameters
->target().code_fill(fill_len
));
3174 memcpy(buffer
+ off
, fill_data
.data(), fill_data
.size());
3177 p
->write_to_buffer(buffer
+ aligned_off
);
3178 off
= aligned_off
+ p
->data_size();
3182 // Get the input sections for linker script processing. We leave
3183 // behind the Output_section_data entries. Note that this may be
3184 // slightly incorrect for merge sections. We will leave them behind,
3185 // but it is possible that the script says that they should follow
3186 // some other input sections, as in:
3187 // .rodata { *(.rodata) *(.rodata.cst*) }
3188 // For that matter, we don't handle this correctly:
3189 // .rodata { foo.o(.rodata.cst*) *(.rodata.cst*) }
3190 // With luck this will never matter.
3193 Output_section::get_input_sections(
3195 const std::string
& fill
,
3196 std::list
<Input_section
>* input_sections
)
3198 if (this->checkpoint_
!= NULL
3199 && !this->checkpoint_
->input_sections_saved())
3200 this->checkpoint_
->save_input_sections();
3202 // Invalidate fast look-up maps.
3203 this->lookup_maps_
->invalidate();
3205 uint64_t orig_address
= address
;
3207 address
= align_address(address
, this->addralign());
3209 Input_section_list remaining
;
3210 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3211 p
!= this->input_sections_
.end();
3214 if (p
->is_input_section()
3215 || p
->is_relaxed_input_section()
3216 || p
->is_merge_section())
3217 input_sections
->push_back(*p
);
3220 uint64_t aligned_address
= align_address(address
, p
->addralign());
3221 if (aligned_address
!= address
&& !fill
.empty())
3223 section_size_type length
=
3224 convert_to_section_size_type(aligned_address
- address
);
3225 std::string this_fill
;
3226 this_fill
.reserve(length
);
3227 while (this_fill
.length() + fill
.length() <= length
)
3229 if (this_fill
.length() < length
)
3230 this_fill
.append(fill
, 0, length
- this_fill
.length());
3232 Output_section_data
* posd
= new Output_data_const(this_fill
, 0);
3233 remaining
.push_back(Input_section(posd
));
3235 address
= aligned_address
;
3237 remaining
.push_back(*p
);
3239 p
->finalize_data_size();
3240 address
+= p
->data_size();
3244 this->input_sections_
.swap(remaining
);
3245 this->first_input_offset_
= 0;
3247 uint64_t data_size
= address
- orig_address
;
3248 this->set_current_data_size_for_child(data_size
);
3252 // Add a script input section. SIS is an Output_section::Input_section,
3253 // which can be either a plain input section or a special input section like
3254 // a relaxed input section. For a special input section, its size must be
3258 Output_section::add_script_input_section(const Input_section
& sis
)
3260 uint64_t data_size
= sis
.data_size();
3261 uint64_t addralign
= sis
.addralign();
3262 if (addralign
> this->addralign_
)
3263 this->addralign_
= addralign
;
3265 off_t offset_in_section
= this->current_data_size_for_child();
3266 off_t aligned_offset_in_section
= align_address(offset_in_section
,
3269 this->set_current_data_size_for_child(aligned_offset_in_section
3272 this->input_sections_
.push_back(sis
);
3274 // Update fast lookup maps if necessary.
3275 if (this->lookup_maps_
->is_valid())
3277 if (sis
.is_merge_section())
3279 Output_merge_base
* pomb
= sis
.output_merge_base();
3280 Merge_section_properties
msp(pomb
->is_string(), pomb
->entsize(),
3282 this->lookup_maps_
->add_merge_section(msp
, pomb
);
3283 for (Output_merge_base::Input_sections::const_iterator p
=
3284 pomb
->input_sections_begin();
3285 p
!= pomb
->input_sections_end();
3287 this->lookup_maps_
->add_merge_input_section(p
->first
, p
->second
,
3290 else if (sis
.is_relaxed_input_section())
3292 Output_relaxed_input_section
* poris
= sis
.relaxed_input_section();
3293 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
3294 poris
->shndx(), poris
);
3299 // Save states for relaxation.
3302 Output_section::save_states()
3304 gold_assert(this->checkpoint_
== NULL
);
3305 Checkpoint_output_section
* checkpoint
=
3306 new Checkpoint_output_section(this->addralign_
, this->flags_
,
3307 this->input_sections_
,
3308 this->first_input_offset_
,
3309 this->attached_input_sections_are_sorted_
);
3310 this->checkpoint_
= checkpoint
;
3311 gold_assert(this->fills_
.empty());
3315 Output_section::discard_states()
3317 gold_assert(this->checkpoint_
!= NULL
);
3318 delete this->checkpoint_
;
3319 this->checkpoint_
= NULL
;
3320 gold_assert(this->fills_
.empty());
3322 // Simply invalidate the fast lookup maps since we do not keep
3324 this->lookup_maps_
->invalidate();
3328 Output_section::restore_states()
3330 gold_assert(this->checkpoint_
!= NULL
);
3331 Checkpoint_output_section
* checkpoint
= this->checkpoint_
;
3333 this->addralign_
= checkpoint
->addralign();
3334 this->flags_
= checkpoint
->flags();
3335 this->first_input_offset_
= checkpoint
->first_input_offset();
3337 if (!checkpoint
->input_sections_saved())
3339 // If we have not copied the input sections, just resize it.
3340 size_t old_size
= checkpoint
->input_sections_size();
3341 gold_assert(this->input_sections_
.size() >= old_size
);
3342 this->input_sections_
.resize(old_size
);
3346 // We need to copy the whole list. This is not efficient for
3347 // extremely large output with hundreads of thousands of input
3348 // objects. We may need to re-think how we should pass sections
3350 this->input_sections_
= *checkpoint
->input_sections();
3353 this->attached_input_sections_are_sorted_
=
3354 checkpoint
->attached_input_sections_are_sorted();
3356 // Simply invalidate the fast lookup maps since we do not keep
3358 this->lookup_maps_
->invalidate();
3361 // Update the section offsets of input sections in this. This is required if
3362 // relaxation causes some input sections to change sizes.
3365 Output_section::adjust_section_offsets()
3367 if (!this->section_offsets_need_adjustment_
)
3371 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3372 p
!= this->input_sections_
.end();
3375 off
= align_address(off
, p
->addralign());
3376 if (p
->is_input_section())
3377 p
->relobj()->set_section_offset(p
->shndx(), off
);
3378 off
+= p
->data_size();
3381 this->section_offsets_need_adjustment_
= false;
3384 // Print to the map file.
3387 Output_section::do_print_to_mapfile(Mapfile
* mapfile
) const
3389 mapfile
->print_output_section(this);
3391 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
3392 p
!= this->input_sections_
.end();
3394 p
->print_to_mapfile(mapfile
);
3397 // Print stats for merge sections to stderr.
3400 Output_section::print_merge_stats()
3402 Input_section_list::iterator p
;
3403 for (p
= this->input_sections_
.begin();
3404 p
!= this->input_sections_
.end();
3406 p
->print_merge_stats(this->name_
);
3409 // Output segment methods.
3411 Output_segment::Output_segment(elfcpp::Elf_Word type
, elfcpp::Elf_Word flags
)
3423 is_max_align_known_(false),
3424 are_addresses_set_(false),
3425 is_large_data_segment_(false)
3427 // The ELF ABI specifies that a PT_TLS segment always has PF_R as
3429 if (type
== elfcpp::PT_TLS
)
3430 this->flags_
= elfcpp::PF_R
;
3433 // Add an Output_section to an Output_segment.
3436 Output_segment::add_output_section(Output_section
* os
,
3437 elfcpp::Elf_Word seg_flags
,
3440 gold_assert((os
->flags() & elfcpp::SHF_ALLOC
) != 0);
3441 gold_assert(!this->is_max_align_known_
);
3442 gold_assert(os
->is_large_data_section() == this->is_large_data_segment());
3443 gold_assert(this->type() == elfcpp::PT_LOAD
|| !do_sort
);
3445 this->update_flags_for_output_section(seg_flags
);
3447 Output_segment::Output_data_list
* pdl
;
3448 if (os
->type() == elfcpp::SHT_NOBITS
)
3449 pdl
= &this->output_bss_
;
3451 pdl
= &this->output_data_
;
3453 // Note that while there may be many input sections in an output
3454 // section, there are normally only a few output sections in an
3455 // output segment. The loops below are expected to be fast.
3457 // So that PT_NOTE segments will work correctly, we need to ensure
3458 // that all SHT_NOTE sections are adjacent.
3459 if (os
->type() == elfcpp::SHT_NOTE
&& !pdl
->empty())
3461 Output_segment::Output_data_list::iterator p
= pdl
->end();
3465 if ((*p
)->is_section_type(elfcpp::SHT_NOTE
))
3472 while (p
!= pdl
->begin());
3475 // Similarly, so that PT_TLS segments will work, we need to group
3476 // SHF_TLS sections. An SHF_TLS/SHT_NOBITS section is a special
3477 // case: we group the SHF_TLS/SHT_NOBITS sections right after the
3478 // SHF_TLS/SHT_PROGBITS sections. This lets us set up PT_TLS
3479 // correctly. SHF_TLS sections get added to both a PT_LOAD segment
3480 // and the PT_TLS segment; we do this grouping only for the PT_LOAD
3482 if (this->type_
!= elfcpp::PT_TLS
3483 && (os
->flags() & elfcpp::SHF_TLS
) != 0)
3485 pdl
= &this->output_data_
;
3488 bool nobits
= os
->type() == elfcpp::SHT_NOBITS
;
3489 bool sawtls
= false;
3490 Output_segment::Output_data_list::iterator p
= pdl
->end();
3491 gold_assert(p
!= pdl
->begin());
3496 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
3499 // Put a NOBITS section after the first TLS section.
3500 // Put a PROGBITS section after the first
3501 // TLS/PROGBITS section.
3502 insert
= nobits
|| !(*p
)->is_section_type(elfcpp::SHT_NOBITS
);
3506 // If we've gone past the TLS sections, but we've
3507 // seen a TLS section, then we need to insert this
3519 while (p
!= pdl
->begin());
3522 // There are no TLS sections yet; put this one at the requested
3523 // location in the section list.
3528 // For the PT_GNU_RELRO segment, we need to group relro
3529 // sections, and we need to put them before any non-relro
3530 // sections. Any relro local sections go before relro non-local
3531 // sections. One section may be marked as the last relro
3535 gold_assert(pdl
== &this->output_data_
);
3536 Output_segment::Output_data_list::iterator p
;
3537 for (p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
3539 if (!(*p
)->is_section())
3542 Output_section
* pos
= (*p
)->output_section();
3543 if (!pos
->is_relro()
3544 || (os
->is_relro_local() && !pos
->is_relro_local())
3545 || (!os
->is_last_relro() && pos
->is_last_relro()))
3553 // One section may be marked as the first section which follows
3554 // the relro sections.
3555 if (os
->is_first_non_relro())
3557 gold_assert(pdl
== &this->output_data_
);
3558 Output_segment::Output_data_list::iterator p
;
3559 for (p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
3561 if (!(*p
)->is_section())
3564 Output_section
* pos
= (*p
)->output_section();
3565 if (!pos
->is_relro())
3574 // Small data sections go at the end of the list of data sections.
3575 // If OS is not small, and there are small sections, we have to
3576 // insert it before the first small section.
3577 if (os
->type() != elfcpp::SHT_NOBITS
3578 && !os
->is_small_section()
3580 && pdl
->back()->is_section()
3581 && pdl
->back()->output_section()->is_small_section())
3583 for (Output_segment::Output_data_list::iterator p
= pdl
->begin();
3587 if ((*p
)->is_section()
3588 && (*p
)->output_section()->is_small_section())
3597 // A small BSS section goes at the start of the BSS sections, after
3598 // other small BSS sections.
3599 if (os
->type() == elfcpp::SHT_NOBITS
&& os
->is_small_section())
3601 for (Output_segment::Output_data_list::iterator p
= pdl
->begin();
3605 if (!(*p
)->is_section()
3606 || !(*p
)->output_section()->is_small_section())
3614 // A large BSS section goes at the end of the BSS sections, which
3615 // means that one that is not large must come before the first large
3617 if (os
->type() == elfcpp::SHT_NOBITS
3618 && !os
->is_large_section()
3620 && pdl
->back()->is_section()
3621 && pdl
->back()->output_section()->is_large_section())
3623 for (Output_segment::Output_data_list::iterator p
= pdl
->begin();
3627 if ((*p
)->is_section()
3628 && (*p
)->output_section()->is_large_section())
3637 // We do some further output section sorting in order to make the
3638 // generated program run more efficiently. We should only do this
3639 // when not using a linker script, so it is controled by the DO_SORT
3643 // FreeBSD requires the .interp section to be in the first page
3644 // of the executable. That is a more efficient location anyhow
3645 // for any OS, since it means that the kernel will have the data
3646 // handy after it reads the program headers.
3647 if (os
->is_interp() && !pdl
->empty())
3649 pdl
->insert(pdl
->begin(), os
);
3653 // Put loadable non-writable notes immediately after the .interp
3654 // sections, so that the PT_NOTE segment is on the first page of
3656 if (os
->type() == elfcpp::SHT_NOTE
3657 && (os
->flags() & elfcpp::SHF_WRITE
) == 0
3660 Output_segment::Output_data_list::iterator p
= pdl
->begin();
3661 if ((*p
)->is_section() && (*p
)->output_section()->is_interp())
3667 // If this section is used by the dynamic linker, and it is not
3668 // writable, then put it first, after the .interp section and
3669 // any loadable notes. This makes it more likely that the
3670 // dynamic linker will have to read less data from the disk.
3671 if (os
->is_dynamic_linker_section()
3673 && (os
->flags() & elfcpp::SHF_WRITE
) == 0)
3675 bool is_reloc
= (os
->type() == elfcpp::SHT_REL
3676 || os
->type() == elfcpp::SHT_RELA
);
3677 Output_segment::Output_data_list::iterator p
= pdl
->begin();
3678 while (p
!= pdl
->end()
3679 && (*p
)->is_section()
3680 && ((*p
)->output_section()->is_dynamic_linker_section()
3681 || (*p
)->output_section()->type() == elfcpp::SHT_NOTE
))
3683 // Put reloc sections after the other ones. Putting the
3684 // dynamic reloc sections first confuses BFD, notably
3685 // objcopy and strip.
3687 && ((*p
)->output_section()->type() == elfcpp::SHT_REL
3688 || (*p
)->output_section()->type() == elfcpp::SHT_RELA
))
3697 // If there were no constraints on the output section, just add it
3698 // to the end of the list.
3702 // Remove an Output_section from this segment. It is an error if it
3706 Output_segment::remove_output_section(Output_section
* os
)
3708 // We only need this for SHT_PROGBITS.
3709 gold_assert(os
->type() == elfcpp::SHT_PROGBITS
);
3710 for (Output_data_list::iterator p
= this->output_data_
.begin();
3711 p
!= this->output_data_
.end();
3716 this->output_data_
.erase(p
);
3723 // Add an Output_data (which need not be an Output_section) to the
3724 // start of a segment.
3727 Output_segment::add_initial_output_data(Output_data
* od
)
3729 gold_assert(!this->is_max_align_known_
);
3730 this->output_data_
.push_front(od
);
3733 // Return whether the first data section is a relro section.
3736 Output_segment::is_first_section_relro() const
3738 return (!this->output_data_
.empty()
3739 && this->output_data_
.front()->is_section()
3740 && this->output_data_
.front()->output_section()->is_relro());
3743 // Return the maximum alignment of the Output_data in Output_segment.
3746 Output_segment::maximum_alignment()
3748 if (!this->is_max_align_known_
)
3752 addralign
= Output_segment::maximum_alignment_list(&this->output_data_
);
3753 if (addralign
> this->max_align_
)
3754 this->max_align_
= addralign
;
3756 addralign
= Output_segment::maximum_alignment_list(&this->output_bss_
);
3757 if (addralign
> this->max_align_
)
3758 this->max_align_
= addralign
;
3760 this->is_max_align_known_
= true;
3763 return this->max_align_
;
3766 // Return the maximum alignment of a list of Output_data.
3769 Output_segment::maximum_alignment_list(const Output_data_list
* pdl
)
3772 for (Output_data_list::const_iterator p
= pdl
->begin();
3776 uint64_t addralign
= (*p
)->addralign();
3777 if (addralign
> ret
)
3783 // Return the number of dynamic relocs applied to this segment.
3786 Output_segment::dynamic_reloc_count() const
3788 return (this->dynamic_reloc_count_list(&this->output_data_
)
3789 + this->dynamic_reloc_count_list(&this->output_bss_
));
3792 // Return the number of dynamic relocs applied to an Output_data_list.
3795 Output_segment::dynamic_reloc_count_list(const Output_data_list
* pdl
) const
3797 unsigned int count
= 0;
3798 for (Output_data_list::const_iterator p
= pdl
->begin();
3801 count
+= (*p
)->dynamic_reloc_count();
3805 // Set the section addresses for an Output_segment. If RESET is true,
3806 // reset the addresses first. ADDR is the address and *POFF is the
3807 // file offset. Set the section indexes starting with *PSHNDX.
3808 // Return the address of the immediately following segment. Update
3809 // *POFF and *PSHNDX.
3812 Output_segment::set_section_addresses(const Layout
* layout
, bool reset
,
3814 unsigned int increase_relro
,
3816 unsigned int* pshndx
)
3818 gold_assert(this->type_
== elfcpp::PT_LOAD
);
3820 off_t orig_off
= *poff
;
3822 // If we have relro sections, we need to pad forward now so that the
3823 // relro sections plus INCREASE_RELRO end on a common page boundary.
3824 if (parameters
->options().relro()
3825 && this->is_first_section_relro()
3826 && (!this->are_addresses_set_
|| reset
))
3828 uint64_t relro_size
= 0;
3830 for (Output_data_list::iterator p
= this->output_data_
.begin();
3831 p
!= this->output_data_
.end();
3834 if (!(*p
)->is_section())
3836 Output_section
* pos
= (*p
)->output_section();
3837 if (!pos
->is_relro())
3839 gold_assert(!(*p
)->is_section_flag_set(elfcpp::SHF_TLS
));
3840 if ((*p
)->is_address_valid())
3841 relro_size
+= (*p
)->data_size();
3844 // FIXME: This could be faster.
3845 (*p
)->set_address_and_file_offset(addr
+ relro_size
,
3847 relro_size
+= (*p
)->data_size();
3848 (*p
)->reset_address_and_file_offset();
3851 relro_size
+= increase_relro
;
3853 uint64_t page_align
= parameters
->target().common_pagesize();
3855 // Align to offset N such that (N + RELRO_SIZE) % PAGE_ALIGN == 0.
3856 uint64_t desired_align
= page_align
- (relro_size
% page_align
);
3857 if (desired_align
< *poff
% page_align
)
3858 *poff
+= page_align
- *poff
% page_align
;
3859 *poff
+= desired_align
- *poff
% page_align
;
3860 addr
+= *poff
- orig_off
;
3864 if (!reset
&& this->are_addresses_set_
)
3866 gold_assert(this->paddr_
== addr
);
3867 addr
= this->vaddr_
;
3871 this->vaddr_
= addr
;
3872 this->paddr_
= addr
;
3873 this->are_addresses_set_
= true;
3876 bool in_tls
= false;
3878 this->offset_
= orig_off
;
3880 addr
= this->set_section_list_addresses(layout
, reset
, &this->output_data_
,
3881 addr
, poff
, pshndx
, &in_tls
);
3882 this->filesz_
= *poff
- orig_off
;
3886 uint64_t ret
= this->set_section_list_addresses(layout
, reset
,
3891 // If the last section was a TLS section, align upward to the
3892 // alignment of the TLS segment, so that the overall size of the TLS
3893 // segment is aligned.
3896 uint64_t segment_align
= layout
->tls_segment()->maximum_alignment();
3897 *poff
= align_address(*poff
, segment_align
);
3900 this->memsz_
= *poff
- orig_off
;
3902 // Ignore the file offset adjustments made by the BSS Output_data
3909 // Set the addresses and file offsets in a list of Output_data
3913 Output_segment::set_section_list_addresses(const Layout
* layout
, bool reset
,
3914 Output_data_list
* pdl
,
3915 uint64_t addr
, off_t
* poff
,
3916 unsigned int* pshndx
,
3919 off_t startoff
= *poff
;
3921 off_t off
= startoff
;
3922 for (Output_data_list::iterator p
= pdl
->begin();
3927 (*p
)->reset_address_and_file_offset();
3929 // When using a linker script the section will most likely
3930 // already have an address.
3931 if (!(*p
)->is_address_valid())
3933 uint64_t align
= (*p
)->addralign();
3935 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
3937 // Give the first TLS section the alignment of the
3938 // entire TLS segment. Otherwise the TLS segment as a
3939 // whole may be misaligned.
3942 Output_segment
* tls_segment
= layout
->tls_segment();
3943 gold_assert(tls_segment
!= NULL
);
3944 uint64_t segment_align
= tls_segment
->maximum_alignment();
3945 gold_assert(segment_align
>= align
);
3946 align
= segment_align
;
3953 // If this is the first section after the TLS segment,
3954 // align it to at least the alignment of the TLS
3955 // segment, so that the size of the overall TLS segment
3959 uint64_t segment_align
=
3960 layout
->tls_segment()->maximum_alignment();
3961 if (segment_align
> align
)
3962 align
= segment_align
;
3968 off
= align_address(off
, align
);
3969 (*p
)->set_address_and_file_offset(addr
+ (off
- startoff
), off
);
3973 // The script may have inserted a skip forward, but it
3974 // better not have moved backward.
3975 if ((*p
)->address() >= addr
+ (off
- startoff
))
3976 off
+= (*p
)->address() - (addr
+ (off
- startoff
));
3979 if (!layout
->script_options()->saw_sections_clause())
3983 Output_section
* os
= (*p
)->output_section();
3985 // Cast to unsigned long long to avoid format warnings.
3986 unsigned long long previous_dot
=
3987 static_cast<unsigned long long>(addr
+ (off
- startoff
));
3988 unsigned long long dot
=
3989 static_cast<unsigned long long>((*p
)->address());
3992 gold_error(_("dot moves backward in linker script "
3993 "from 0x%llx to 0x%llx"), previous_dot
, dot
);
3995 gold_error(_("address of section '%s' moves backward "
3996 "from 0x%llx to 0x%llx"),
3997 os
->name(), previous_dot
, dot
);
4000 (*p
)->set_file_offset(off
);
4001 (*p
)->finalize_data_size();
4004 // We want to ignore the size of a SHF_TLS or SHT_NOBITS
4005 // section. Such a section does not affect the size of a
4007 if (!(*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
4008 || !(*p
)->is_section_type(elfcpp::SHT_NOBITS
))
4009 off
+= (*p
)->data_size();
4011 if ((*p
)->is_section())
4013 (*p
)->set_out_shndx(*pshndx
);
4019 return addr
+ (off
- startoff
);
4022 // For a non-PT_LOAD segment, set the offset from the sections, if
4023 // any. Add INCREASE to the file size and the memory size.
4026 Output_segment::set_offset(unsigned int increase
)
4028 gold_assert(this->type_
!= elfcpp::PT_LOAD
);
4030 gold_assert(!this->are_addresses_set_
);
4032 if (this->output_data_
.empty() && this->output_bss_
.empty())
4034 gold_assert(increase
== 0);
4037 this->are_addresses_set_
= true;
4039 this->min_p_align_
= 0;
4045 // Find the first and last section by address. The sections may
4046 // have been sorted for the PT_LOAD segment.
4047 const Output_data
* first
= NULL
;
4048 const Output_data
* last_data
= NULL
;
4049 const Output_data
* last_bss
= NULL
;
4050 this->find_first_and_last_list(&this->output_data_
, &first
, &last_data
);
4051 this->find_first_and_last_list(&this->output_bss_
, &first
, &last_bss
);
4053 this->vaddr_
= first
->address();
4054 this->paddr_
= (first
->has_load_address()
4055 ? first
->load_address()
4057 this->are_addresses_set_
= true;
4058 this->offset_
= first
->offset();
4060 if (this->output_data_
.empty())
4063 this->filesz_
= (last_data
->address()
4064 + last_data
->data_size()
4067 const Output_data
* last
= last_bss
!= NULL
? last_bss
: last_data
;
4068 this->memsz_
= (last
->address()
4072 this->filesz_
+= increase
;
4073 this->memsz_
+= increase
;
4075 // If this is a TLS segment, align the memory size. The code in
4076 // set_section_list ensures that the section after the TLS segment
4077 // is aligned to give us room.
4078 if (this->type_
== elfcpp::PT_TLS
)
4080 uint64_t segment_align
= this->maximum_alignment();
4081 gold_assert(this->vaddr_
== align_address(this->vaddr_
, segment_align
));
4082 this->memsz_
= align_address(this->memsz_
, segment_align
);
4086 // Look through a list of Output_data objects and find the first and
4090 Output_segment::find_first_and_last_list(const Output_data_list
* pdl
,
4091 const Output_data
** pfirst
,
4092 const Output_data
** plast
) const
4094 const Output_data
* first
= *pfirst
;
4095 const Output_data
* last
= *plast
;
4096 for (Output_data_list::const_iterator p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
4099 || (*p
)->address() < first
->address()
4100 || ((*p
)->address() == first
->address()
4101 && (*p
)->data_size() < first
->data_size()))
4107 || (*p
)->address() > last
->address()
4108 || ((*p
)->address() == last
->address()
4109 && (*p
)->data_size() > last
->data_size()))
4117 // Set the TLS offsets of the sections in the PT_TLS segment.
4120 Output_segment::set_tls_offsets()
4122 gold_assert(this->type_
== elfcpp::PT_TLS
);
4124 for (Output_data_list::iterator p
= this->output_data_
.begin();
4125 p
!= this->output_data_
.end();
4127 (*p
)->set_tls_offset(this->vaddr_
);
4129 for (Output_data_list::iterator p
= this->output_bss_
.begin();
4130 p
!= this->output_bss_
.end();
4132 (*p
)->set_tls_offset(this->vaddr_
);
4135 // Return the address of the first section.
4138 Output_segment::first_section_load_address() const
4140 for (Output_data_list::const_iterator p
= this->output_data_
.begin();
4141 p
!= this->output_data_
.end();
4143 if ((*p
)->is_section())
4144 return (*p
)->has_load_address() ? (*p
)->load_address() : (*p
)->address();
4146 for (Output_data_list::const_iterator p
= this->output_bss_
.begin();
4147 p
!= this->output_bss_
.end();
4149 if ((*p
)->is_section())
4150 return (*p
)->has_load_address() ? (*p
)->load_address() : (*p
)->address();
4155 // Return the number of Output_sections in an Output_segment.
4158 Output_segment::output_section_count() const
4160 return (this->output_section_count_list(&this->output_data_
)
4161 + this->output_section_count_list(&this->output_bss_
));
4164 // Return the number of Output_sections in an Output_data_list.
4167 Output_segment::output_section_count_list(const Output_data_list
* pdl
) const
4169 unsigned int count
= 0;
4170 for (Output_data_list::const_iterator p
= pdl
->begin();
4174 if ((*p
)->is_section())
4180 // Return the section attached to the list segment with the lowest
4181 // load address. This is used when handling a PHDRS clause in a
4185 Output_segment::section_with_lowest_load_address() const
4187 Output_section
* found
= NULL
;
4188 uint64_t found_lma
= 0;
4189 this->lowest_load_address_in_list(&this->output_data_
, &found
, &found_lma
);
4191 Output_section
* found_data
= found
;
4192 this->lowest_load_address_in_list(&this->output_bss_
, &found
, &found_lma
);
4193 if (found
!= found_data
&& found_data
!= NULL
)
4195 gold_error(_("nobits section %s may not precede progbits section %s "
4197 found
->name(), found_data
->name());
4204 // Look through a list for a section with a lower load address.
4207 Output_segment::lowest_load_address_in_list(const Output_data_list
* pdl
,
4208 Output_section
** found
,
4209 uint64_t* found_lma
) const
4211 for (Output_data_list::const_iterator p
= pdl
->begin();
4215 if (!(*p
)->is_section())
4217 Output_section
* os
= static_cast<Output_section
*>(*p
);
4218 uint64_t lma
= (os
->has_load_address()
4219 ? os
->load_address()
4221 if (*found
== NULL
|| lma
< *found_lma
)
4229 // Write the segment data into *OPHDR.
4231 template<int size
, bool big_endian
>
4233 Output_segment::write_header(elfcpp::Phdr_write
<size
, big_endian
>* ophdr
)
4235 ophdr
->put_p_type(this->type_
);
4236 ophdr
->put_p_offset(this->offset_
);
4237 ophdr
->put_p_vaddr(this->vaddr_
);
4238 ophdr
->put_p_paddr(this->paddr_
);
4239 ophdr
->put_p_filesz(this->filesz_
);
4240 ophdr
->put_p_memsz(this->memsz_
);
4241 ophdr
->put_p_flags(this->flags_
);
4242 ophdr
->put_p_align(std::max(this->min_p_align_
, this->maximum_alignment()));
4245 // Write the section headers into V.
4247 template<int size
, bool big_endian
>
4249 Output_segment::write_section_headers(const Layout
* layout
,
4250 const Stringpool
* secnamepool
,
4252 unsigned int *pshndx
) const
4254 // Every section that is attached to a segment must be attached to a
4255 // PT_LOAD segment, so we only write out section headers for PT_LOAD
4257 if (this->type_
!= elfcpp::PT_LOAD
)
4260 v
= this->write_section_headers_list
<size
, big_endian
>(layout
, secnamepool
,
4261 &this->output_data_
,
4263 v
= this->write_section_headers_list
<size
, big_endian
>(layout
, secnamepool
,
4269 template<int size
, bool big_endian
>
4271 Output_segment::write_section_headers_list(const Layout
* layout
,
4272 const Stringpool
* secnamepool
,
4273 const Output_data_list
* pdl
,
4275 unsigned int* pshndx
) const
4277 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
4278 for (Output_data_list::const_iterator p
= pdl
->begin();
4282 if ((*p
)->is_section())
4284 const Output_section
* ps
= static_cast<const Output_section
*>(*p
);
4285 gold_assert(*pshndx
== ps
->out_shndx());
4286 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
4287 ps
->write_header(layout
, secnamepool
, &oshdr
);
4295 // Print the output sections to the map file.
4298 Output_segment::print_sections_to_mapfile(Mapfile
* mapfile
) const
4300 if (this->type() != elfcpp::PT_LOAD
)
4302 this->print_section_list_to_mapfile(mapfile
, &this->output_data_
);
4303 this->print_section_list_to_mapfile(mapfile
, &this->output_bss_
);
4306 // Print an output section list to the map file.
4309 Output_segment::print_section_list_to_mapfile(Mapfile
* mapfile
,
4310 const Output_data_list
* pdl
) const
4312 for (Output_data_list::const_iterator p
= pdl
->begin();
4315 (*p
)->print_to_mapfile(mapfile
);
4318 // Output_file methods.
4320 Output_file::Output_file(const char* name
)
4325 map_is_anonymous_(false),
4326 is_temporary_(false)
4330 // Try to open an existing file. Returns false if the file doesn't
4331 // exist, has a size of 0 or can't be mmapped.
4334 Output_file::open_for_modification()
4336 // The name "-" means "stdout".
4337 if (strcmp(this->name_
, "-") == 0)
4340 // Don't bother opening files with a size of zero.
4342 if (::stat(this->name_
, &s
) != 0 || s
.st_size
== 0)
4345 int o
= open_descriptor(-1, this->name_
, O_RDWR
, 0);
4347 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4349 this->file_size_
= s
.st_size
;
4351 // If the file can't be mmapped, copying the content to an anonymous
4352 // map will probably negate the performance benefits of incremental
4353 // linking. This could be helped by using views and loading only
4354 // the necessary parts, but this is not supported as of now.
4355 if (!this->map_no_anonymous())
4357 release_descriptor(o
, true);
4359 this->file_size_
= 0;
4366 // Open the output file.
4369 Output_file::open(off_t file_size
)
4371 this->file_size_
= file_size
;
4373 // Unlink the file first; otherwise the open() may fail if the file
4374 // is busy (e.g. it's an executable that's currently being executed).
4376 // However, the linker may be part of a system where a zero-length
4377 // file is created for it to write to, with tight permissions (gcc
4378 // 2.95 did something like this). Unlinking the file would work
4379 // around those permission controls, so we only unlink if the file
4380 // has a non-zero size. We also unlink only regular files to avoid
4381 // trouble with directories/etc.
4383 // If we fail, continue; this command is merely a best-effort attempt
4384 // to improve the odds for open().
4386 // We let the name "-" mean "stdout"
4387 if (!this->is_temporary_
)
4389 if (strcmp(this->name_
, "-") == 0)
4390 this->o_
= STDOUT_FILENO
;
4394 if (::stat(this->name_
, &s
) == 0
4395 && (S_ISREG (s
.st_mode
) || S_ISLNK (s
.st_mode
)))
4398 ::unlink(this->name_
);
4399 else if (!parameters
->options().relocatable())
4401 // If we don't unlink the existing file, add execute
4402 // permission where read permissions already exist
4403 // and where the umask permits.
4404 int mask
= ::umask(0);
4406 s
.st_mode
|= (s
.st_mode
& 0444) >> 2;
4407 ::chmod(this->name_
, s
.st_mode
& ~mask
);
4411 int mode
= parameters
->options().relocatable() ? 0666 : 0777;
4412 int o
= open_descriptor(-1, this->name_
, O_RDWR
| O_CREAT
| O_TRUNC
,
4415 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4423 // Resize the output file.
4426 Output_file::resize(off_t file_size
)
4428 // If the mmap is mapping an anonymous memory buffer, this is easy:
4429 // just mremap to the new size. If it's mapping to a file, we want
4430 // to unmap to flush to the file, then remap after growing the file.
4431 if (this->map_is_anonymous_
)
4433 void* base
= ::mremap(this->base_
, this->file_size_
, file_size
,
4435 if (base
== MAP_FAILED
)
4436 gold_fatal(_("%s: mremap: %s"), this->name_
, strerror(errno
));
4437 this->base_
= static_cast<unsigned char*>(base
);
4438 this->file_size_
= file_size
;
4443 this->file_size_
= file_size
;
4444 if (!this->map_no_anonymous())
4445 gold_fatal(_("%s: mmap: %s"), this->name_
, strerror(errno
));
4449 // Map an anonymous block of memory which will later be written to the
4450 // file. Return whether the map succeeded.
4453 Output_file::map_anonymous()
4455 void* base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
4456 MAP_PRIVATE
| MAP_ANONYMOUS
, -1, 0);
4457 if (base
!= MAP_FAILED
)
4459 this->map_is_anonymous_
= true;
4460 this->base_
= static_cast<unsigned char*>(base
);
4466 // Map the file into memory. Return whether the mapping succeeded.
4469 Output_file::map_no_anonymous()
4471 const int o
= this->o_
;
4473 // If the output file is not a regular file, don't try to mmap it;
4474 // instead, we'll mmap a block of memory (an anonymous buffer), and
4475 // then later write the buffer to the file.
4477 struct stat statbuf
;
4478 if (o
== STDOUT_FILENO
|| o
== STDERR_FILENO
4479 || ::fstat(o
, &statbuf
) != 0
4480 || !S_ISREG(statbuf
.st_mode
)
4481 || this->is_temporary_
)
4484 // Ensure that we have disk space available for the file. If we
4485 // don't do this, it is possible that we will call munmap, close,
4486 // and exit with dirty buffers still in the cache with no assigned
4487 // disk blocks. If the disk is out of space at that point, the
4488 // output file will wind up incomplete, but we will have already
4489 // exited. The alternative to fallocate would be to use fdatasync,
4490 // but that would be a more significant performance hit.
4491 if (::posix_fallocate(o
, 0, this->file_size_
) < 0)
4492 gold_fatal(_("%s: %s"), this->name_
, strerror(errno
));
4494 // Map the file into memory.
4495 base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
4498 // The mmap call might fail because of file system issues: the file
4499 // system might not support mmap at all, or it might not support
4500 // mmap with PROT_WRITE.
4501 if (base
== MAP_FAILED
)
4504 this->map_is_anonymous_
= false;
4505 this->base_
= static_cast<unsigned char*>(base
);
4509 // Map the file into memory.
4514 if (this->map_no_anonymous())
4517 // The mmap call might fail because of file system issues: the file
4518 // system might not support mmap at all, or it might not support
4519 // mmap with PROT_WRITE. I'm not sure which errno values we will
4520 // see in all cases, so if the mmap fails for any reason and we
4521 // don't care about file contents, try for an anonymous map.
4522 if (this->map_anonymous())
4525 gold_fatal(_("%s: mmap: failed to allocate %lu bytes for output file: %s"),
4526 this->name_
, static_cast<unsigned long>(this->file_size_
),
4530 // Unmap the file from memory.
4533 Output_file::unmap()
4535 if (::munmap(this->base_
, this->file_size_
) < 0)
4536 gold_error(_("%s: munmap: %s"), this->name_
, strerror(errno
));
4540 // Close the output file.
4543 Output_file::close()
4545 // If the map isn't file-backed, we need to write it now.
4546 if (this->map_is_anonymous_
&& !this->is_temporary_
)
4548 size_t bytes_to_write
= this->file_size_
;
4550 while (bytes_to_write
> 0)
4552 ssize_t bytes_written
= ::write(this->o_
, this->base_
+ offset
,
4554 if (bytes_written
== 0)
4555 gold_error(_("%s: write: unexpected 0 return-value"), this->name_
);
4556 else if (bytes_written
< 0)
4557 gold_error(_("%s: write: %s"), this->name_
, strerror(errno
));
4560 bytes_to_write
-= bytes_written
;
4561 offset
+= bytes_written
;
4567 // We don't close stdout or stderr
4568 if (this->o_
!= STDOUT_FILENO
4569 && this->o_
!= STDERR_FILENO
4570 && !this->is_temporary_
)
4571 if (::close(this->o_
) < 0)
4572 gold_error(_("%s: close: %s"), this->name_
, strerror(errno
));
4576 // Instantiate the templates we need. We could use the configure
4577 // script to restrict this to only the ones for implemented targets.
4579 #ifdef HAVE_TARGET_32_LITTLE
4582 Output_section::add_input_section
<32, false>(
4584 Sized_relobj
<32, false>* object
,
4586 const char* secname
,
4587 const elfcpp::Shdr
<32, false>& shdr
,
4588 unsigned int reloc_shndx
,
4589 bool have_sections_script
);
4592 #ifdef HAVE_TARGET_32_BIG
4595 Output_section::add_input_section
<32, true>(
4597 Sized_relobj
<32, true>* object
,
4599 const char* secname
,
4600 const elfcpp::Shdr
<32, true>& shdr
,
4601 unsigned int reloc_shndx
,
4602 bool have_sections_script
);
4605 #ifdef HAVE_TARGET_64_LITTLE
4608 Output_section::add_input_section
<64, false>(
4610 Sized_relobj
<64, false>* object
,
4612 const char* secname
,
4613 const elfcpp::Shdr
<64, false>& shdr
,
4614 unsigned int reloc_shndx
,
4615 bool have_sections_script
);
4618 #ifdef HAVE_TARGET_64_BIG
4621 Output_section::add_input_section
<64, true>(
4623 Sized_relobj
<64, true>* object
,
4625 const char* secname
,
4626 const elfcpp::Shdr
<64, true>& shdr
,
4627 unsigned int reloc_shndx
,
4628 bool have_sections_script
);
4631 #ifdef HAVE_TARGET_32_LITTLE
4633 class Output_reloc
<elfcpp::SHT_REL
, false, 32, false>;
4636 #ifdef HAVE_TARGET_32_BIG
4638 class Output_reloc
<elfcpp::SHT_REL
, false, 32, true>;
4641 #ifdef HAVE_TARGET_64_LITTLE
4643 class Output_reloc
<elfcpp::SHT_REL
, false, 64, false>;
4646 #ifdef HAVE_TARGET_64_BIG
4648 class Output_reloc
<elfcpp::SHT_REL
, false, 64, true>;
4651 #ifdef HAVE_TARGET_32_LITTLE
4653 class Output_reloc
<elfcpp::SHT_REL
, true, 32, false>;
4656 #ifdef HAVE_TARGET_32_BIG
4658 class Output_reloc
<elfcpp::SHT_REL
, true, 32, true>;
4661 #ifdef HAVE_TARGET_64_LITTLE
4663 class Output_reloc
<elfcpp::SHT_REL
, true, 64, false>;
4666 #ifdef HAVE_TARGET_64_BIG
4668 class Output_reloc
<elfcpp::SHT_REL
, true, 64, true>;
4671 #ifdef HAVE_TARGET_32_LITTLE
4673 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
4676 #ifdef HAVE_TARGET_32_BIG
4678 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
4681 #ifdef HAVE_TARGET_64_LITTLE
4683 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
4686 #ifdef HAVE_TARGET_64_BIG
4688 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
4691 #ifdef HAVE_TARGET_32_LITTLE
4693 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
4696 #ifdef HAVE_TARGET_32_BIG
4698 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
4701 #ifdef HAVE_TARGET_64_LITTLE
4703 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
4706 #ifdef HAVE_TARGET_64_BIG
4708 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
4711 #ifdef HAVE_TARGET_32_LITTLE
4713 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, false>;
4716 #ifdef HAVE_TARGET_32_BIG
4718 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, true>;
4721 #ifdef HAVE_TARGET_64_LITTLE
4723 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, false>;
4726 #ifdef HAVE_TARGET_64_BIG
4728 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, true>;
4731 #ifdef HAVE_TARGET_32_LITTLE
4733 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, false>;
4736 #ifdef HAVE_TARGET_32_BIG
4738 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, true>;
4741 #ifdef HAVE_TARGET_64_LITTLE
4743 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, false>;
4746 #ifdef HAVE_TARGET_64_BIG
4748 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, true>;
4751 #ifdef HAVE_TARGET_32_LITTLE
4753 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
4756 #ifdef HAVE_TARGET_32_BIG
4758 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
4761 #ifdef HAVE_TARGET_64_LITTLE
4763 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
4766 #ifdef HAVE_TARGET_64_BIG
4768 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
4771 #ifdef HAVE_TARGET_32_LITTLE
4773 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
4776 #ifdef HAVE_TARGET_32_BIG
4778 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
4781 #ifdef HAVE_TARGET_64_LITTLE
4783 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
4786 #ifdef HAVE_TARGET_64_BIG
4788 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
4791 #ifdef HAVE_TARGET_32_LITTLE
4793 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, false>;
4796 #ifdef HAVE_TARGET_32_BIG
4798 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, true>;
4801 #ifdef HAVE_TARGET_64_LITTLE
4803 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, false>;
4806 #ifdef HAVE_TARGET_64_BIG
4808 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, true>;
4811 #ifdef HAVE_TARGET_32_LITTLE
4813 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, false>;
4816 #ifdef HAVE_TARGET_32_BIG
4818 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, true>;
4821 #ifdef HAVE_TARGET_64_LITTLE
4823 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, false>;
4826 #ifdef HAVE_TARGET_64_BIG
4828 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, true>;
4831 #ifdef HAVE_TARGET_32_LITTLE
4833 class Output_data_group
<32, false>;
4836 #ifdef HAVE_TARGET_32_BIG
4838 class Output_data_group
<32, true>;
4841 #ifdef HAVE_TARGET_64_LITTLE
4843 class Output_data_group
<64, false>;
4846 #ifdef HAVE_TARGET_64_BIG
4848 class Output_data_group
<64, true>;
4851 #ifdef HAVE_TARGET_32_LITTLE
4853 class Output_data_got
<32, false>;
4856 #ifdef HAVE_TARGET_32_BIG
4858 class Output_data_got
<32, true>;
4861 #ifdef HAVE_TARGET_64_LITTLE
4863 class Output_data_got
<64, false>;
4866 #ifdef HAVE_TARGET_64_BIG
4868 class Output_data_got
<64, true>;
4871 } // End namespace gold.